2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
28 #include <libfirm/firm.h>
29 #include <libfirm/adt/obst.h>
30 #include <libfirm/be.h>
34 #include "adt/error.h"
35 #include "adt/array.h"
36 #include "adt/strutil.h"
44 #include "diagnostic.h"
45 #include "lang_features.h"
47 #include "type_hash.h"
52 #include "entitymap_t.h"
53 #include "driver/firm_opt.h"
55 typedef struct trampoline_region trampoline_region;
56 struct trampoline_region {
57 ir_entity *function; /**< The function that is called by this trampoline */
58 ir_entity *region; /**< created region for the trampoline */
61 fp_model_t firm_fp_model = fp_model_precise;
63 static const backend_params *be_params;
65 static ir_type *ir_type_char;
66 static ir_type *ir_type_const_char;
67 static ir_type *ir_type_wchar_t;
69 /* architecture specific floating point arithmetic mode (if any) */
70 static ir_mode *mode_float_arithmetic;
72 /* alignment of stack parameters */
73 static unsigned stack_param_align;
75 static int next_value_number_function;
76 static ir_node *continue_label;
77 static ir_node *break_label;
78 static ir_node *current_switch;
79 static bool saw_default_label;
80 static label_t **all_labels;
81 static entity_t **inner_functions;
82 static ir_node *ijmp_list;
83 static bool constant_folding;
85 static const entity_t *current_function_entity;
86 static ir_node *current_function_name;
87 static ir_node *current_funcsig;
88 static ir_graph *current_function;
89 static translation_unit_t *current_translation_unit;
90 static trampoline_region *current_trampolines;
91 static ir_type *current_outer_frame;
92 static ir_node *current_static_link;
93 static ir_entity *current_vararg_entity;
95 static entitymap_t entitymap;
97 static struct obstack asm_obst;
99 typedef enum declaration_kind_t {
100 DECLARATION_KIND_UNKNOWN,
101 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
102 DECLARATION_KIND_GLOBAL_VARIABLE,
103 DECLARATION_KIND_LOCAL_VARIABLE,
104 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
105 DECLARATION_KIND_PARAMETER,
106 DECLARATION_KIND_PARAMETER_ENTITY,
107 DECLARATION_KIND_FUNCTION,
108 DECLARATION_KIND_COMPOUND_MEMBER,
109 DECLARATION_KIND_INNER_FUNCTION
110 } declaration_kind_t;
112 static ir_type *get_ir_type_incomplete(type_t *type);
114 static void enqueue_inner_function(entity_t *entity)
116 if (inner_functions == NULL)
117 inner_functions = NEW_ARR_F(entity_t *, 0);
118 ARR_APP1(entity_t*, inner_functions, entity);
121 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
123 const entity_t *entity = get_irg_loc_description(irg, pos);
125 if (entity != NULL) {
126 source_position_t const *const pos = &entity->base.source_position;
127 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
129 return new_r_Unknown(irg, mode);
132 static src_loc_t dbg_retrieve(const dbg_info *dbg)
134 source_position_t const *const pos = (source_position_t const*)dbg;
136 return (src_loc_t){ pos->input_name, pos->lineno, pos->colno };
138 return (src_loc_t){ NULL, 0, 0 };
142 static dbg_info *get_dbg_info(const source_position_t *pos)
144 return (dbg_info*) pos;
147 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
148 const type_dbg_info *dbg)
151 print_to_buffer(buffer, buffer_size);
152 const type_t *type = (const type_t*) dbg;
154 finish_print_to_buffer();
157 static type_dbg_info *get_type_dbg_info_(const type_t *type)
159 return (type_dbg_info*) type;
162 /* is the current block a reachable one? */
163 static bool currently_reachable(void)
165 ir_node *const block = get_cur_block();
166 return block != NULL && !is_Bad(block);
169 static void set_unreachable_now(void)
174 ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
176 static ir_node *_expression_to_firm(const expression_t *expression);
177 static ir_node *expression_to_firm(const expression_t *expression);
179 static unsigned decide_modulo_shift(unsigned type_size)
181 if (architecture_modulo_shift == 0)
183 if (type_size < architecture_modulo_shift)
184 return architecture_modulo_shift;
188 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
190 unsigned flags = get_atomic_type_flags(kind);
191 unsigned size = get_atomic_type_size(kind);
192 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
193 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
196 } else if (size == 8) {
199 panic("unexpected kind");
201 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
203 unsigned bit_size = size * 8;
204 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
205 unsigned modulo_shift = decide_modulo_shift(bit_size);
207 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
208 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
216 * Initialises the atomic modes depending on the machine size.
218 static void init_atomic_modes(void)
220 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
221 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
222 if (atomic_modes[i] != NULL)
224 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
228 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
230 assert(kind <= ATOMIC_TYPE_LAST);
231 return atomic_modes[kind];
234 static ir_node *get_vla_size(array_type_t *const type)
236 ir_node *size_node = type->size_node;
237 if (size_node == NULL) {
238 size_node = expression_to_firm(type->size_expression);
239 type->size_node = size_node;
244 static unsigned count_parameters(const function_type_t *function_type)
248 function_parameter_t *parameter = function_type->parameters;
249 for ( ; parameter != NULL; parameter = parameter->next) {
257 * Creates a Firm type for an atomic type
259 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
261 ir_mode *mode = atomic_modes[akind];
262 type_dbg_info *dbgi = get_type_dbg_info_(type);
263 ir_type *irtype = new_d_type_primitive(mode, dbgi);
264 il_alignment_t alignment = get_atomic_type_alignment(akind);
266 set_type_size_bytes(irtype, get_atomic_type_size(akind));
267 set_type_alignment_bytes(irtype, alignment);
273 * Creates a Firm type for a complex type
275 static ir_type *create_complex_type(const atomic_type_t *type)
277 atomic_type_kind_t kind = type->akind;
278 ir_mode *mode = atomic_modes[kind];
279 ident *id = get_mode_ident(mode);
283 /* FIXME: finish the array */
288 * Creates a Firm type for an imaginary type
290 static ir_type *create_imaginary_type(const atomic_type_t *type)
292 return create_atomic_type(type->akind, (const type_t*)type);
296 * return type of a parameter (and take transparent union gnu extension into
299 static type_t *get_parameter_type(type_t *orig_type)
301 type_t *type = skip_typeref(orig_type);
302 if (is_type_union(type)
303 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
304 compound_t *compound = type->compound.compound;
305 type = compound->members.entities->declaration.type;
311 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
313 type_t *return_type = skip_typeref(function_type->return_type);
315 int n_parameters = count_parameters(function_type)
316 + (for_closure ? 1 : 0);
317 int n_results = is_type_void(return_type) ? 0 : 1;
318 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
319 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
321 if (!is_type_void(return_type)) {
322 ir_type *restype = get_ir_type(return_type);
323 set_method_res_type(irtype, 0, restype);
326 function_parameter_t *parameter = function_type->parameters;
329 ir_type *p_irtype = get_ir_type(type_void_ptr);
330 set_method_param_type(irtype, n, p_irtype);
333 for ( ; parameter != NULL; parameter = parameter->next) {
334 type_t *type = get_parameter_type(parameter->type);
335 ir_type *p_irtype = get_ir_type(type);
336 set_method_param_type(irtype, n, p_irtype);
340 bool is_variadic = function_type->variadic;
343 set_method_variadicity(irtype, variadicity_variadic);
345 unsigned cc = get_method_calling_convention(irtype);
346 switch (function_type->calling_convention) {
347 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
350 set_method_calling_convention(irtype, SET_CDECL(cc));
357 /* only non-variadic function can use stdcall, else use cdecl */
358 set_method_calling_convention(irtype, SET_STDCALL(cc));
364 /* only non-variadic function can use fastcall, else use cdecl */
365 set_method_calling_convention(irtype, SET_FASTCALL(cc));
369 /* Hmm, leave default, not accepted by the parser yet. */
374 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
376 const decl_modifiers_t modifiers = function_type->modifiers;
377 if (modifiers & DM_CONST)
378 add_method_additional_properties(irtype, mtp_property_const);
379 if (modifiers & DM_PURE)
380 add_method_additional_properties(irtype, mtp_property_pure);
381 if (modifiers & DM_RETURNS_TWICE)
382 add_method_additional_properties(irtype, mtp_property_returns_twice);
383 if (modifiers & DM_NORETURN)
384 add_method_additional_properties(irtype, mtp_property_noreturn);
385 if (modifiers & DM_NOTHROW)
386 add_method_additional_properties(irtype, mtp_property_nothrow);
387 if (modifiers & DM_MALLOC)
388 add_method_additional_properties(irtype, mtp_property_malloc);
393 static ir_type *create_pointer_type(pointer_type_t *type)
395 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
396 type_t *points_to = type->points_to;
397 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
398 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
403 static ir_type *create_reference_type(reference_type_t *type)
405 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
406 type_t *refers_to = type->refers_to;
407 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
408 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
413 static ir_type *create_array_type(array_type_t *type)
415 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
416 type_t *element_type = type->element_type;
417 ir_type *ir_element_type = get_ir_type(element_type);
418 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
420 const int align = get_type_alignment_bytes(ir_element_type);
421 set_type_alignment_bytes(irtype, align);
423 if (type->size_constant) {
424 int n_elements = type->size;
426 set_array_bounds_int(irtype, 0, 0, n_elements);
428 size_t elemsize = get_type_size_bytes(ir_element_type);
429 if (elemsize % align > 0) {
430 elemsize += align - (elemsize % align);
432 set_type_size_bytes(irtype, n_elements * elemsize);
434 set_array_lower_bound_int(irtype, 0, 0);
436 set_type_state(irtype, layout_fixed);
442 * Return the signed integer type of size bits.
444 * @param size the size
446 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
450 static ir_mode *s_modes[64 + 1] = {NULL, };
454 if (size <= 0 || size > 64)
457 mode = s_modes[size];
461 snprintf(name, sizeof(name), "bf_I%u", size);
462 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
463 s_modes[size] = mode;
466 type_dbg_info *dbgi = get_type_dbg_info_(type);
467 res = new_d_type_primitive(mode, dbgi);
468 set_primitive_base_type(res, base_tp);
474 * Return the unsigned integer type of size bits.
476 * @param size the size
478 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
482 static ir_mode *u_modes[64 + 1] = {NULL, };
486 if (size <= 0 || size > 64)
489 mode = u_modes[size];
493 snprintf(name, sizeof(name), "bf_U%u", size);
494 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
495 u_modes[size] = mode;
498 type_dbg_info *dbgi = get_type_dbg_info_(type);
499 res = new_d_type_primitive(mode, dbgi);
500 set_primitive_base_type(res, base_tp);
505 static ir_type *create_bitfield_type(const entity_t *entity)
507 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
508 type_t *base = skip_typeref(entity->declaration.type);
509 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
510 ir_type *irbase = get_ir_type(base);
512 unsigned bit_size = entity->compound_member.bit_size;
514 assert(!is_type_float(base));
515 if (is_type_signed(base)) {
516 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
518 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
523 * Construct firm type from ast struct type.
525 static ir_type *create_compound_type(compound_type_t *const type, bool const incomplete)
527 compound_t *compound = type->compound;
529 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
530 return compound->irtype;
533 bool const is_union = type->base.kind == TYPE_COMPOUND_UNION;
535 symbol_t *type_symbol = compound->base.symbol;
537 if (type_symbol != NULL) {
538 id = new_id_from_str(type_symbol->string);
541 id = id_unique("__anonymous_union.%u");
543 id = id_unique("__anonymous_struct.%u");
549 irtype = new_type_union(id);
551 irtype = new_type_struct(id);
554 compound->irtype_complete = false;
555 compound->irtype = irtype;
561 layout_union_type(type);
563 layout_struct_type(type);
566 compound->irtype_complete = true;
568 entity_t *entry = compound->members.entities;
569 for ( ; entry != NULL; entry = entry->base.next) {
570 if (entry->kind != ENTITY_COMPOUND_MEMBER)
573 symbol_t *symbol = entry->base.symbol;
574 type_t *entry_type = entry->declaration.type;
576 if (symbol == NULL) {
577 /* anonymous bitfield member, skip */
578 if (entry->compound_member.bitfield)
580 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
581 || entry_type->kind == TYPE_COMPOUND_UNION);
582 ident = id_unique("anon.%u");
584 ident = new_id_from_str(symbol->string);
587 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
589 ir_type *entry_irtype;
590 if (entry->compound_member.bitfield) {
591 entry_irtype = create_bitfield_type(entry);
593 entry_irtype = get_ir_type(entry_type);
595 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
597 set_entity_offset(entity, entry->compound_member.offset);
598 set_entity_offset_bits_remainder(entity,
599 entry->compound_member.bit_offset);
601 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
602 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
603 entry->compound_member.entity = entity;
606 set_type_alignment_bytes(irtype, compound->alignment);
607 set_type_size_bytes(irtype, compound->size);
608 set_type_state(irtype, layout_fixed);
613 static ir_tarval *fold_constant_to_tarval(expression_t const *);
615 static void determine_enum_values(enum_type_t *const type)
617 ir_mode *const mode = atomic_modes[type->base.akind];
618 ir_tarval *const one = get_mode_one(mode);
619 ir_tarval * tv_next = get_mode_null(mode);
621 enum_t *enume = type->enume;
622 entity_t *entry = enume->base.next;
623 for (; entry != NULL; entry = entry->base.next) {
624 if (entry->kind != ENTITY_ENUM_VALUE)
627 expression_t *const init = entry->enum_value.value;
629 tv_next = fold_constant_to_tarval(init);
631 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
632 entry->enum_value.tv = tv_next;
633 tv_next = tarval_add(tv_next, one);
637 static ir_type *create_enum_type(enum_type_t *const type)
639 return create_atomic_type(type->base.akind, (const type_t*) type);
642 static ir_type *get_ir_type_incomplete(type_t *type)
644 assert(type != NULL);
645 type = skip_typeref(type);
647 if (type->base.firm_type != NULL) {
648 return type->base.firm_type;
651 if (is_type_compound(type)) {
652 return create_compound_type(&type->compound, true);
654 return get_ir_type(type);
658 ir_type *get_ir_type(type_t *type)
660 assert(type != NULL);
662 type = skip_typeref(type);
664 if (type->base.firm_type != NULL) {
665 return type->base.firm_type;
668 ir_type *firm_type = NULL;
669 switch (type->kind) {
671 firm_type = create_atomic_type(type->atomic.akind, type);
674 firm_type = create_complex_type(&type->atomic);
677 firm_type = create_imaginary_type(&type->atomic);
680 firm_type = create_method_type(&type->function, false);
683 firm_type = create_pointer_type(&type->pointer);
686 firm_type = create_reference_type(&type->reference);
689 firm_type = create_array_type(&type->array);
691 case TYPE_COMPOUND_STRUCT:
692 case TYPE_COMPOUND_UNION:
693 firm_type = create_compound_type(&type->compound, false);
696 firm_type = create_enum_type(&type->enumt);
704 if (firm_type == NULL)
705 panic("unknown type found");
707 type->base.firm_type = firm_type;
711 static ir_mode *get_ir_mode_storage(type_t *type)
713 type = skip_typeref(type);
715 /* Firm doesn't report a mode for arrays and structs/unions. */
716 if (!is_type_scalar(type)) {
720 ir_type *const irtype = get_ir_type(type);
721 ir_mode *const mode = get_type_mode(irtype);
722 assert(mode != NULL);
727 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
728 * int that it returns bigger modes for floating point on some platforms
729 * (x87 internally does arithemtic with 80bits)
731 static ir_mode *get_ir_mode_arithmetic(type_t *type)
733 ir_mode *mode = get_ir_mode_storage(type);
734 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
735 return mode_float_arithmetic;
742 * Return a node representing the size of a type.
744 static ir_node *get_type_size_node(type_t *type)
747 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
748 type = skip_typeref(type);
750 if (is_type_array(type) && type->array.is_vla) {
751 ir_node *size_node = get_vla_size(&type->array);
752 ir_node *elem_size = get_type_size_node(type->array.element_type);
753 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
757 size = get_type_size(type);
758 return new_Const_long(mode, size);
761 /** Names of the runtime functions. */
762 static const struct {
763 int id; /**< the rts id */
764 int n_res; /**< number of return values */
765 const char *name; /**< the name of the rts function */
766 int n_params; /**< number of parameters */
767 unsigned flags; /**< language flags */
769 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
770 { rts_abort, 0, "abort", 0, _C89 },
771 { rts_alloca, 1, "alloca", 1, _ALL },
772 { rts_abs, 1, "abs", 1, _C89 },
773 { rts_labs, 1, "labs", 1, _C89 },
774 { rts_llabs, 1, "llabs", 1, _C99 },
775 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
777 { rts_fabs, 1, "fabs", 1, _C89 },
778 { rts_sqrt, 1, "sqrt", 1, _C89 },
779 { rts_cbrt, 1, "cbrt", 1, _C99 },
780 { rts_exp, 1, "exp", 1, _C89 },
781 { rts_exp2, 1, "exp2", 1, _C89 },
782 { rts_exp10, 1, "exp10", 1, _GNUC },
783 { rts_log, 1, "log", 1, _C89 },
784 { rts_log2, 1, "log2", 1, _C89 },
785 { rts_log10, 1, "log10", 1, _C89 },
786 { rts_pow, 1, "pow", 2, _C89 },
787 { rts_sin, 1, "sin", 1, _C89 },
788 { rts_cos, 1, "cos", 1, _C89 },
789 { rts_tan, 1, "tan", 1, _C89 },
790 { rts_asin, 1, "asin", 1, _C89 },
791 { rts_acos, 1, "acos", 1, _C89 },
792 { rts_atan, 1, "atan", 1, _C89 },
793 { rts_sinh, 1, "sinh", 1, _C89 },
794 { rts_cosh, 1, "cosh", 1, _C89 },
795 { rts_tanh, 1, "tanh", 1, _C89 },
797 { rts_fabsf, 1, "fabsf", 1, _C99 },
798 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
799 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
800 { rts_expf, 1, "expf", 1, _C99 },
801 { rts_exp2f, 1, "exp2f", 1, _C99 },
802 { rts_exp10f, 1, "exp10f", 1, _GNUC },
803 { rts_logf, 1, "logf", 1, _C99 },
804 { rts_log2f, 1, "log2f", 1, _C99 },
805 { rts_log10f, 1, "log10f", 1, _C99 },
806 { rts_powf, 1, "powf", 2, _C99 },
807 { rts_sinf, 1, "sinf", 1, _C99 },
808 { rts_cosf, 1, "cosf", 1, _C99 },
809 { rts_tanf, 1, "tanf", 1, _C99 },
810 { rts_asinf, 1, "asinf", 1, _C99 },
811 { rts_acosf, 1, "acosf", 1, _C99 },
812 { rts_atanf, 1, "atanf", 1, _C99 },
813 { rts_sinhf, 1, "sinhf", 1, _C99 },
814 { rts_coshf, 1, "coshf", 1, _C99 },
815 { rts_tanhf, 1, "tanhf", 1, _C99 },
817 { rts_fabsl, 1, "fabsl", 1, _C99 },
818 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
819 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
820 { rts_expl, 1, "expl", 1, _C99 },
821 { rts_exp2l, 1, "exp2l", 1, _C99 },
822 { rts_exp10l, 1, "exp10l", 1, _GNUC },
823 { rts_logl, 1, "logl", 1, _C99 },
824 { rts_log2l, 1, "log2l", 1, _C99 },
825 { rts_log10l, 1, "log10l", 1, _C99 },
826 { rts_powl, 1, "powl", 2, _C99 },
827 { rts_sinl, 1, "sinl", 1, _C99 },
828 { rts_cosl, 1, "cosl", 1, _C99 },
829 { rts_tanl, 1, "tanl", 1, _C99 },
830 { rts_asinl, 1, "asinl", 1, _C99 },
831 { rts_acosl, 1, "acosl", 1, _C99 },
832 { rts_atanl, 1, "atanl", 1, _C99 },
833 { rts_sinhl, 1, "sinhl", 1, _C99 },
834 { rts_coshl, 1, "coshl", 1, _C99 },
835 { rts_tanhl, 1, "tanhl", 1, _C99 },
837 { rts_strcmp, 1, "strcmp", 2, _C89 },
838 { rts_strncmp, 1, "strncmp", 3, _C89 },
839 { rts_strcpy, 1, "strcpy", 2, _C89 },
840 { rts_strlen, 1, "strlen", 1, _C89 },
841 { rts_memcpy, 1, "memcpy", 3, _C89 },
842 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
843 { rts_memmove, 1, "memmove", 3, _C89 },
844 { rts_memset, 1, "memset", 3, _C89 },
845 { rts_memcmp, 1, "memcmp", 3, _C89 },
848 static ident *rts_idents[lengthof(rts_data)];
850 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
852 void set_create_ld_ident(ident *(*func)(entity_t*))
854 create_ld_ident = func;
857 static bool declaration_is_definition(const entity_t *entity)
859 switch (entity->kind) {
860 case ENTITY_VARIABLE:
861 return entity->variable.initializer != NULL;
862 case ENTITY_FUNCTION:
863 return entity->function.statement != NULL;
864 case ENTITY_PARAMETER:
865 case ENTITY_COMPOUND_MEMBER:
869 case ENTITY_ENUM_VALUE:
870 case ENTITY_NAMESPACE:
872 case ENTITY_LOCAL_LABEL:
875 panic("declaration_is_definition called on non-declaration");
879 * Handle GNU attributes for entities
881 * @param ent the entity
882 * @param decl the routine declaration
884 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
886 assert(is_declaration(entity));
887 decl_modifiers_t modifiers = entity->declaration.modifiers;
889 if (is_method_entity(irentity)) {
890 if (modifiers & DM_PURE) {
891 set_entity_additional_properties(irentity, mtp_property_pure);
893 if (modifiers & DM_CONST) {
894 add_entity_additional_properties(irentity, mtp_property_const);
897 if ((modifiers & DM_USED) && declaration_is_definition(entity)) {
898 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
900 if ((modifiers & DM_WEAK) && declaration_is_definition(entity)
901 && entity->declaration.storage_class != STORAGE_CLASS_EXTERN) {
902 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
906 static bool is_main(entity_t *entity)
908 static symbol_t *sym_main = NULL;
909 if (sym_main == NULL) {
910 sym_main = symbol_table_insert("main");
913 if (entity->base.symbol != sym_main)
915 /* must be in outermost scope */
916 if (entity->base.parent_scope != ¤t_translation_unit->scope)
923 * Creates an entity representing a function.
925 * @param entity the function declaration/definition
926 * @param owner_type the owner type of this function, NULL
927 * for global functions
929 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
931 assert(entity->kind == ENTITY_FUNCTION);
932 if (entity->function.irentity != NULL)
933 return entity->function.irentity;
935 switch (entity->function.btk) {
938 case BUILTIN_LIBC_CHECK:
944 if (is_main(entity)) {
945 /* force main to C linkage */
946 type_t *type = entity->declaration.type;
947 assert(is_type_function(type));
948 if (type->function.linkage != LINKAGE_C) {
949 type_t *new_type = duplicate_type(type);
950 new_type->function.linkage = LINKAGE_C;
951 type = identify_new_type(new_type);
952 entity->declaration.type = type;
956 symbol_t *symbol = entity->base.symbol;
957 ident *id = new_id_from_str(symbol->string);
959 /* already an entity defined? */
960 ir_entity *irentity = entitymap_get(&entitymap, symbol);
961 bool const has_body = entity->function.statement != NULL;
962 if (irentity != NULL) {
966 ir_type *ir_type_method;
967 if (entity->function.need_closure)
968 ir_type_method = create_method_type(&entity->declaration.type->function, true);
970 ir_type_method = get_ir_type(entity->declaration.type);
972 bool nested_function = false;
973 if (owner_type == NULL)
974 owner_type = get_glob_type();
976 nested_function = true;
978 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
979 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
983 ld_id = id_unique("inner.%u");
985 ld_id = create_ld_ident(entity);
986 set_entity_ld_ident(irentity, ld_id);
988 handle_decl_modifiers(irentity, entity);
990 if (! nested_function) {
991 storage_class_tag_t const storage_class
992 = (storage_class_tag_t) entity->declaration.storage_class;
993 if (storage_class == STORAGE_CLASS_STATIC) {
994 set_entity_visibility(irentity, ir_visibility_local);
996 set_entity_visibility(irentity, ir_visibility_external);
999 bool const is_inline = entity->function.is_inline;
1000 if (is_inline && has_body) {
1001 if (((c_mode & _C99) && storage_class == STORAGE_CLASS_NONE)
1002 || ((c_mode & _C99) == 0
1003 && storage_class == STORAGE_CLASS_EXTERN)) {
1004 add_entity_linkage(irentity, IR_LINKAGE_NO_CODEGEN);
1008 /* nested functions are always local */
1009 set_entity_visibility(irentity, ir_visibility_local);
1012 /* We should check for file scope here, but as long as we compile C only
1013 this is not needed. */
1014 if (!freestanding && !has_body) {
1015 /* check for a known runtime function */
1016 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1017 if (id != rts_idents[i])
1020 function_type_t *function_type
1021 = &entity->declaration.type->function;
1022 /* rts_entities code can't handle a "wrong" number of parameters */
1023 if (function_type->unspecified_parameters)
1026 /* check number of parameters */
1027 int n_params = count_parameters(function_type);
1028 if (n_params != rts_data[i].n_params)
1031 type_t *return_type = skip_typeref(function_type->return_type);
1032 int n_res = is_type_void(return_type) ? 0 : 1;
1033 if (n_res != rts_data[i].n_res)
1036 /* ignore those rts functions not necessary needed for current mode */
1037 if ((c_mode & rts_data[i].flags) == 0)
1039 assert(rts_entities[rts_data[i].id] == NULL);
1040 rts_entities[rts_data[i].id] = irentity;
1044 entitymap_insert(&entitymap, symbol, irentity);
1047 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1048 entity->function.irentity = irentity;
1054 * Creates a SymConst for a given entity.
1056 * @param dbgi debug info
1057 * @param entity the entity
1059 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1061 assert(entity != NULL);
1062 union symconst_symbol sym;
1063 sym.entity_p = entity;
1064 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1067 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1069 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1072 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1075 if (is_Const(value)) {
1076 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1079 ir_node *cond = new_d_Cond(dbgi, value);
1080 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1081 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1082 ir_node *tblock = new_Block(1, &proj_true);
1083 ir_node *fblock = new_Block(1, &proj_false);
1084 set_cur_block(tblock);
1085 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1086 ir_node *tjump = new_Jmp();
1087 set_cur_block(fblock);
1088 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1089 ir_node *fjump = new_Jmp();
1091 ir_node *in[2] = { tjump, fjump };
1092 ir_node *mergeblock = new_Block(2, in);
1093 set_cur_block(mergeblock);
1094 ir_node *phi_in[2] = { const1, const0 };
1095 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1099 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1101 ir_mode *value_mode = get_irn_mode(value);
1103 if (value_mode == dest_mode)
1106 if (dest_mode == mode_b) {
1107 ir_node *zero = new_Const(get_mode_null(value_mode));
1108 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1110 } else if (value_mode == mode_b) {
1111 return create_conv_from_b(dbgi, value, dest_mode);
1114 return new_d_Conv(dbgi, value, dest_mode);
1118 * Creates a SymConst node representing a wide string literal.
1120 * @param literal the wide string literal
1122 static ir_node *wide_string_literal_to_firm(
1123 const string_literal_expression_t *literal)
1125 ir_type *const global_type = get_glob_type();
1126 ir_type *const elem_type = ir_type_wchar_t;
1127 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1128 ir_type *const type = new_type_array(1, elem_type);
1130 ident *const id = id_unique("str.%u");
1131 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1132 set_entity_ld_ident(entity, id);
1133 set_entity_visibility(entity, ir_visibility_private);
1134 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1136 ir_mode *const mode = get_type_mode(elem_type);
1137 const size_t slen = wstrlen(&literal->value);
1139 set_array_lower_bound_int(type, 0, 0);
1140 set_array_upper_bound_int(type, 0, slen);
1141 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1142 set_type_state(type, layout_fixed);
1144 ir_initializer_t *initializer = create_initializer_compound(slen);
1145 const char *p = literal->value.begin;
1146 for (size_t i = 0; i < slen; ++i) {
1147 assert(p < literal->value.begin + literal->value.size);
1148 utf32 v = read_utf8_char(&p);
1149 ir_tarval *tv = new_tarval_from_long(v, mode);
1150 ir_initializer_t *val = create_initializer_tarval(tv);
1151 set_initializer_compound_value(initializer, i, val);
1153 set_entity_initializer(entity, initializer);
1155 return create_symconst(dbgi, entity);
1159 * Creates a SymConst node representing a string constant.
1161 * @param src_pos the source position of the string constant
1162 * @param id_prefix a prefix for the name of the generated string constant
1163 * @param value the value of the string constant
1165 static ir_node *string_to_firm(const source_position_t *const src_pos,
1166 const char *const id_prefix,
1167 const string_t *const value)
1169 ir_type *const global_type = get_glob_type();
1170 dbg_info *const dbgi = get_dbg_info(src_pos);
1171 ir_type *const type = new_type_array(1, ir_type_const_char);
1173 ident *const id = id_unique(id_prefix);
1174 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1175 set_entity_ld_ident(entity, id);
1176 set_entity_visibility(entity, ir_visibility_private);
1177 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1179 ir_type *const elem_type = ir_type_const_char;
1180 ir_mode *const mode = get_type_mode(elem_type);
1182 const char* const string = value->begin;
1183 const size_t slen = value->size;
1185 set_array_lower_bound_int(type, 0, 0);
1186 set_array_upper_bound_int(type, 0, slen);
1187 set_type_size_bytes(type, slen);
1188 set_type_state(type, layout_fixed);
1190 ir_initializer_t *initializer = create_initializer_compound(slen);
1191 for (size_t i = 0; i < slen; ++i) {
1192 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1193 ir_initializer_t *val = create_initializer_tarval(tv);
1194 set_initializer_compound_value(initializer, i, val);
1196 set_entity_initializer(entity, initializer);
1198 return create_symconst(dbgi, entity);
1201 static bool try_create_integer(literal_expression_t *literal,
1202 type_t *type, unsigned char base)
1204 const char *string = literal->value.begin;
1205 size_t size = literal->value.size;
1207 assert(type->kind == TYPE_ATOMIC);
1208 atomic_type_kind_t akind = type->atomic.akind;
1210 ir_mode *mode = atomic_modes[akind];
1211 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1212 if (tv == tarval_bad)
1215 literal->base.type = type;
1216 literal->target_value = tv;
1220 static void create_integer_tarval(literal_expression_t *literal)
1224 const string_t *suffix = &literal->suffix;
1226 if (suffix->size > 0) {
1227 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1228 if (*c == 'u' || *c == 'U') { ++us; }
1229 if (*c == 'l' || *c == 'L') { ++ls; }
1234 switch (literal->base.kind) {
1235 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1236 case EXPR_LITERAL_INTEGER: base = 10; break;
1237 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1238 default: panic("invalid literal kind");
1241 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1243 /* now try if the constant is small enough for some types */
1244 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1246 if (us == 0 && try_create_integer(literal, type_int, base))
1248 if ((us == 1 || base != 10)
1249 && try_create_integer(literal, type_unsigned_int, base))
1253 if (us == 0 && try_create_integer(literal, type_long, base))
1255 if ((us == 1 || base != 10)
1256 && try_create_integer(literal, type_unsigned_long, base))
1259 /* last try? then we should not report tarval_bad */
1260 if (us != 1 && base == 10)
1261 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1262 if (us == 0 && try_create_integer(literal, type_long_long, base))
1266 assert(us == 1 || base != 10);
1267 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1268 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1270 panic("internal error when parsing number literal");
1273 tarval_set_integer_overflow_mode(old_mode);
1276 void determine_literal_type(literal_expression_t *literal)
1278 switch (literal->base.kind) {
1279 case EXPR_LITERAL_INTEGER:
1280 case EXPR_LITERAL_INTEGER_OCTAL:
1281 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1282 create_integer_tarval(literal);
1290 * Creates a Const node representing a constant.
1292 static ir_node *literal_to_firm(const literal_expression_t *literal)
1294 type_t *type = skip_typeref(literal->base.type);
1295 ir_mode *mode = get_ir_mode_storage(type);
1296 const char *string = literal->value.begin;
1297 size_t size = literal->value.size;
1300 switch (literal->base.kind) {
1301 case EXPR_LITERAL_WIDE_CHARACTER: {
1302 utf32 v = read_utf8_char(&string);
1304 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1306 tv = new_tarval_from_str(buf, len, mode);
1310 case EXPR_LITERAL_CHARACTER: {
1313 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1314 if (size == 1 && char_is_signed) {
1315 v = (signed char)string[0];
1318 for (size_t i = 0; i < size; ++i) {
1319 v = (v << 8) | ((unsigned char)string[i]);
1323 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1325 tv = new_tarval_from_str(buf, len, mode);
1329 case EXPR_LITERAL_INTEGER:
1330 case EXPR_LITERAL_INTEGER_OCTAL:
1331 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1332 assert(literal->target_value != NULL);
1333 tv = literal->target_value;
1336 case EXPR_LITERAL_FLOATINGPOINT:
1337 tv = new_tarval_from_str(string, size, mode);
1340 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1341 char buffer[size + 2];
1342 memcpy(buffer, "0x", 2);
1343 memcpy(buffer+2, string, size);
1344 tv = new_tarval_from_str(buffer, size+2, mode);
1348 case EXPR_LITERAL_BOOLEAN:
1349 if (string[0] == 't') {
1350 tv = get_mode_one(mode);
1352 assert(string[0] == 'f');
1353 case EXPR_LITERAL_MS_NOOP:
1354 tv = get_mode_null(mode);
1359 panic("Invalid literal kind found");
1362 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1363 ir_node *res = new_d_Const(dbgi, tv);
1364 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1365 return create_conv(dbgi, res, mode_arith);
1369 * Allocate an area of size bytes aligned at alignment
1372 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1374 static unsigned area_cnt = 0;
1377 ir_type *tp = new_type_array(1, ir_type_char);
1378 set_array_bounds_int(tp, 0, 0, size);
1379 set_type_alignment_bytes(tp, alignment);
1381 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1382 ident *name = new_id_from_str(buf);
1383 ir_entity *area = new_entity(frame_type, name, tp);
1385 /* mark this entity as compiler generated */
1386 set_entity_compiler_generated(area, 1);
1391 * Return a node representing a trampoline region
1392 * for a given function entity.
1394 * @param dbgi debug info
1395 * @param entity the function entity
1397 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1399 ir_entity *region = NULL;
1402 if (current_trampolines != NULL) {
1403 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1404 if (current_trampolines[i].function == entity) {
1405 region = current_trampolines[i].region;
1410 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1412 ir_graph *irg = current_ir_graph;
1413 if (region == NULL) {
1414 /* create a new region */
1415 ir_type *frame_tp = get_irg_frame_type(irg);
1416 trampoline_region reg;
1417 reg.function = entity;
1419 reg.region = alloc_trampoline(frame_tp,
1420 be_params->trampoline_size,
1421 be_params->trampoline_align);
1422 ARR_APP1(trampoline_region, current_trampolines, reg);
1423 region = reg.region;
1425 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1430 * Creates a trampoline for a function represented by an entity.
1432 * @param dbgi debug info
1433 * @param mode the (reference) mode for the function address
1434 * @param entity the function entity
1436 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1439 assert(entity != NULL);
1441 in[0] = get_trampoline_region(dbgi, entity);
1442 in[1] = create_symconst(dbgi, entity);
1443 in[2] = get_irg_frame(current_ir_graph);
1445 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1446 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1447 return new_Proj(irn, mode, pn_Builtin_max+1);
1451 * Dereference an address.
1453 * @param dbgi debug info
1454 * @param type the type of the dereferenced result (the points_to type)
1455 * @param addr the address to dereference
1457 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1458 ir_node *const addr)
1460 type_t *skipped = skip_typeref(type);
1461 if (is_type_incomplete(skipped))
1464 ir_type *irtype = get_ir_type(skipped);
1465 if (is_compound_type(irtype)
1466 || is_Method_type(irtype)
1467 || is_Array_type(irtype)) {
1471 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1472 ? cons_volatile : cons_none;
1473 ir_mode *const mode = get_type_mode(irtype);
1474 ir_node *const memory = get_store();
1475 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1476 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1477 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1479 set_store(load_mem);
1481 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1482 return create_conv(dbgi, load_res, mode_arithmetic);
1486 * Creates a strict Conv (to the node's mode) if necessary.
1488 * @param dbgi debug info
1489 * @param node the node to strict conv
1491 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1493 ir_mode *mode = get_irn_mode(node);
1495 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1497 if (!mode_is_float(mode))
1500 /* check if there is already a Conv */
1501 if (is_Conv(node)) {
1502 /* convert it into a strict Conv */
1503 set_Conv_strict(node, 1);
1507 /* otherwise create a new one */
1508 return new_d_strictConv(dbgi, node, mode);
1512 * Returns the correct base address depending on whether it is a parameter or a
1513 * normal local variable.
1515 static ir_node *get_local_frame(ir_entity *const ent)
1517 ir_graph *const irg = current_ir_graph;
1518 const ir_type *const owner = get_entity_owner(ent);
1519 if (owner == current_outer_frame) {
1520 assert(current_static_link != NULL);
1521 return current_static_link;
1523 return get_irg_frame(irg);
1528 * Keep all memory edges of the given block.
1530 static void keep_all_memory(ir_node *block)
1532 ir_node *old = get_cur_block();
1534 set_cur_block(block);
1535 keep_alive(get_store());
1536 /* TODO: keep all memory edges from restricted pointers */
1540 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1542 entity_t *entity = ref->entity;
1543 if (entity->enum_value.tv == NULL) {
1544 type_t *type = skip_typeref(entity->enum_value.enum_type);
1545 assert(type->kind == TYPE_ENUM);
1546 determine_enum_values(&type->enumt);
1549 return new_Const(entity->enum_value.tv);
1552 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1554 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1555 entity_t *entity = ref->entity;
1556 assert(is_declaration(entity));
1557 type_t *type = skip_typeref(entity->declaration.type);
1559 /* make sure the type is constructed */
1560 (void) get_ir_type(type);
1562 if (entity->kind == ENTITY_FUNCTION
1563 && entity->function.btk != BUILTIN_NONE) {
1564 ir_entity *irentity = get_function_entity(entity, NULL);
1565 /* for gcc compatibility we have to produce (dummy) addresses for some
1566 * builtins which don't have entities */
1567 if (irentity == NULL) {
1568 source_position_t const *const pos = &ref->base.source_position;
1569 symbol_t const *const sym = ref->entity->base.symbol;
1570 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1572 /* simply create a NULL pointer */
1573 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1574 ir_node *res = new_Const(get_mode_null(mode));
1580 switch ((declaration_kind_t) entity->declaration.kind) {
1581 case DECLARATION_KIND_UNKNOWN:
1584 case DECLARATION_KIND_LOCAL_VARIABLE: {
1585 ir_mode *const mode = get_ir_mode_storage(type);
1586 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1587 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1589 case DECLARATION_KIND_PARAMETER: {
1590 ir_mode *const mode = get_ir_mode_storage(type);
1591 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1592 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1594 case DECLARATION_KIND_FUNCTION: {
1595 return create_symconst(dbgi, entity->function.irentity);
1597 case DECLARATION_KIND_INNER_FUNCTION: {
1598 ir_mode *const mode = get_ir_mode_storage(type);
1599 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1600 /* inner function not using the closure */
1601 return create_symconst(dbgi, entity->function.irentity);
1603 /* need trampoline here */
1604 return create_trampoline(dbgi, mode, entity->function.irentity);
1607 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1608 const variable_t *variable = &entity->variable;
1609 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1610 return deref_address(dbgi, variable->base.type, addr);
1613 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1614 ir_entity *irentity = entity->variable.v.entity;
1615 ir_node *frame = get_local_frame(irentity);
1616 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1617 return deref_address(dbgi, entity->declaration.type, sel);
1619 case DECLARATION_KIND_PARAMETER_ENTITY: {
1620 ir_entity *irentity = entity->parameter.v.entity;
1621 ir_node *frame = get_local_frame(irentity);
1622 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1623 return deref_address(dbgi, entity->declaration.type, sel);
1626 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1627 return entity->variable.v.vla_base;
1629 case DECLARATION_KIND_COMPOUND_MEMBER:
1630 panic("not implemented reference type");
1633 panic("reference to declaration with unknown type found");
1636 static ir_node *reference_addr(const reference_expression_t *ref)
1638 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1639 entity_t *entity = ref->entity;
1640 assert(is_declaration(entity));
1642 switch((declaration_kind_t) entity->declaration.kind) {
1643 case DECLARATION_KIND_UNKNOWN:
1645 case DECLARATION_KIND_PARAMETER:
1646 case DECLARATION_KIND_LOCAL_VARIABLE:
1647 /* you can store to a local variable (so we don't panic but return NULL
1648 * as an indicator for no real address) */
1650 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1651 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1654 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1655 ir_entity *irentity = entity->variable.v.entity;
1656 ir_node *frame = get_local_frame(irentity);
1657 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1661 case DECLARATION_KIND_PARAMETER_ENTITY: {
1662 ir_entity *irentity = entity->parameter.v.entity;
1663 ir_node *frame = get_local_frame(irentity);
1664 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1669 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1670 return entity->variable.v.vla_base;
1672 case DECLARATION_KIND_FUNCTION: {
1673 return create_symconst(dbgi, entity->function.irentity);
1676 case DECLARATION_KIND_INNER_FUNCTION: {
1677 type_t *const type = skip_typeref(entity->declaration.type);
1678 ir_mode *const mode = get_ir_mode_storage(type);
1679 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1680 /* inner function not using the closure */
1681 return create_symconst(dbgi, entity->function.irentity);
1683 /* need trampoline here */
1684 return create_trampoline(dbgi, mode, entity->function.irentity);
1688 case DECLARATION_KIND_COMPOUND_MEMBER:
1689 panic("not implemented reference type");
1692 panic("reference to declaration with unknown type found");
1696 * Transform calls to builtin functions.
1698 static ir_node *process_builtin_call(const call_expression_t *call)
1700 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1702 assert(call->function->kind == EXPR_REFERENCE);
1703 reference_expression_t *builtin = &call->function->reference;
1705 type_t *expr_type = skip_typeref(builtin->base.type);
1706 assert(is_type_pointer(expr_type));
1708 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1710 switch (builtin->entity->function.btk) {
1713 case BUILTIN_ALLOCA: {
1714 expression_t *argument = call->arguments->expression;
1715 ir_node *size = expression_to_firm(argument);
1717 ir_node *store = get_store();
1718 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1720 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1722 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1727 type_t *type = function_type->function.return_type;
1728 ir_mode *mode = get_ir_mode_arithmetic(type);
1729 ir_tarval *tv = get_mode_infinite(mode);
1730 ir_node *res = new_d_Const(dbgi, tv);
1734 /* Ignore string for now... */
1735 assert(is_type_function(function_type));
1736 type_t *type = function_type->function.return_type;
1737 ir_mode *mode = get_ir_mode_arithmetic(type);
1738 ir_tarval *tv = get_mode_NAN(mode);
1739 ir_node *res = new_d_Const(dbgi, tv);
1742 case BUILTIN_EXPECT: {
1743 expression_t *argument = call->arguments->expression;
1744 return _expression_to_firm(argument);
1746 case BUILTIN_VA_END:
1747 /* evaluate the argument of va_end for its side effects */
1748 _expression_to_firm(call->arguments->expression);
1750 case BUILTIN_OBJECT_SIZE: {
1751 /* determine value of "type" */
1752 expression_t *type_expression = call->arguments->next->expression;
1753 long type_val = fold_constant_to_int(type_expression);
1754 type_t *type = function_type->function.return_type;
1755 ir_mode *mode = get_ir_mode_arithmetic(type);
1756 /* just produce a "I don't know" result */
1757 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1758 get_mode_minus_one(mode);
1760 return new_d_Const(dbgi, result);
1762 case BUILTIN_ROTL: {
1763 ir_node *val = expression_to_firm(call->arguments->expression);
1764 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1765 ir_mode *mode = get_irn_mode(val);
1766 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1767 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1769 case BUILTIN_ROTR: {
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 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1775 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1776 return new_d_Rotl(dbgi, val, sub, mode);
1781 case BUILTIN_LIBC_CHECK:
1782 panic("builtin did not produce an entity");
1784 panic("invalid builtin found");
1788 * Transform a call expression.
1789 * Handles some special cases, like alloca() calls, which must be resolved
1790 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1791 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1794 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1796 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1797 assert(currently_reachable());
1799 expression_t *function = call->function;
1800 ir_node *callee = NULL;
1801 bool firm_builtin = false;
1802 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1803 if (function->kind == EXPR_REFERENCE) {
1804 const reference_expression_t *ref = &function->reference;
1805 entity_t *entity = ref->entity;
1807 if (entity->kind == ENTITY_FUNCTION) {
1808 builtin_kind_t builtin = entity->function.btk;
1809 if (builtin == BUILTIN_FIRM) {
1810 firm_builtin = true;
1811 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1812 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1813 && builtin != BUILTIN_LIBC_CHECK) {
1814 return process_builtin_call(call);
1819 callee = expression_to_firm(function);
1821 type_t *type = skip_typeref(function->base.type);
1822 assert(is_type_pointer(type));
1823 pointer_type_t *pointer_type = &type->pointer;
1824 type_t *points_to = skip_typeref(pointer_type->points_to);
1825 assert(is_type_function(points_to));
1826 function_type_t *function_type = &points_to->function;
1828 int n_parameters = 0;
1829 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1830 ir_type *new_method_type = NULL;
1831 if (function_type->variadic || function_type->unspecified_parameters) {
1832 const call_argument_t *argument = call->arguments;
1833 for ( ; argument != NULL; argument = argument->next) {
1837 /* we need to construct a new method type matching the call
1839 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1840 int n_res = get_method_n_ress(ir_method_type);
1841 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1842 set_method_calling_convention(new_method_type,
1843 get_method_calling_convention(ir_method_type));
1844 set_method_additional_properties(new_method_type,
1845 get_method_additional_properties(ir_method_type));
1846 set_method_variadicity(new_method_type,
1847 get_method_variadicity(ir_method_type));
1849 for (int i = 0; i < n_res; ++i) {
1850 set_method_res_type(new_method_type, i,
1851 get_method_res_type(ir_method_type, i));
1853 argument = call->arguments;
1854 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1855 expression_t *expression = argument->expression;
1856 ir_type *irtype = get_ir_type(expression->base.type);
1857 set_method_param_type(new_method_type, i, irtype);
1859 ir_method_type = new_method_type;
1861 n_parameters = get_method_n_params(ir_method_type);
1864 ir_node *in[n_parameters];
1866 const call_argument_t *argument = call->arguments;
1867 for (int n = 0; n < n_parameters; ++n) {
1868 expression_t *expression = argument->expression;
1869 ir_node *arg_node = expression_to_firm(expression);
1871 type_t *arg_type = skip_typeref(expression->base.type);
1872 if (!is_type_compound(arg_type)) {
1873 ir_mode *const mode = get_ir_mode_storage(arg_type);
1874 arg_node = create_conv(dbgi, arg_node, mode);
1875 arg_node = do_strict_conv(dbgi, arg_node);
1880 argument = argument->next;
1884 if (function_type->modifiers & DM_CONST) {
1885 store = get_irg_no_mem(current_ir_graph);
1887 store = get_store();
1891 type_t *return_type = skip_typeref(function_type->return_type);
1892 ir_node *result = NULL;
1894 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1896 if (! (function_type->modifiers & DM_CONST)) {
1897 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1901 if (!is_type_void(return_type)) {
1902 assert(is_type_scalar(return_type));
1903 ir_mode *mode = get_ir_mode_storage(return_type);
1904 result = new_Proj(node, mode, pn_Builtin_max+1);
1905 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1906 result = create_conv(NULL, result, mode_arith);
1909 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1910 if (! (function_type->modifiers & DM_CONST)) {
1911 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1915 if (!is_type_void(return_type)) {
1916 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1917 ir_mode *const mode = get_ir_mode_storage(return_type);
1918 result = new_Proj(resproj, mode, 0);
1919 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1920 result = create_conv(NULL, result, mode_arith);
1924 if (function_type->modifiers & DM_NORETURN) {
1925 /* A dead end: Keep the Call and the Block. Also place all further
1926 * nodes into a new and unreachable block. */
1928 keep_alive(get_cur_block());
1929 ir_node *block = new_Block(0, NULL);
1930 set_cur_block(block);
1936 static ir_node *statement_to_firm(statement_t *statement);
1937 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1939 static ir_node *expression_to_addr(const expression_t *expression);
1940 static ir_node *create_condition_evaluation(const expression_t *expression,
1941 ir_node *true_block,
1942 ir_node *false_block);
1944 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1947 if (!is_type_compound(type)) {
1948 ir_mode *mode = get_ir_mode_storage(type);
1949 value = create_conv(dbgi, value, mode);
1950 value = do_strict_conv(dbgi, value);
1953 ir_node *memory = get_store();
1955 if (is_type_scalar(type)) {
1956 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1957 ? cons_volatile : cons_none;
1958 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1959 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1960 set_store(store_mem);
1962 ir_type *irtype = get_ir_type(type);
1963 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1964 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1965 set_store(copyb_mem);
1969 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1971 ir_tarval *all_one = get_mode_all_one(mode);
1972 int mode_size = get_mode_size_bits(mode);
1973 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1975 assert(offset >= 0);
1977 assert(offset + size <= mode_size);
1978 if (size == mode_size) {
1982 long shiftr = get_mode_size_bits(mode) - size;
1983 long shiftl = offset;
1984 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1985 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1986 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1987 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1992 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1993 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1996 ir_type *entity_type = get_entity_type(entity);
1997 ir_type *base_type = get_primitive_base_type(entity_type);
1998 ir_mode *mode = get_type_mode(base_type);
1999 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2001 value = create_conv(dbgi, value, mode);
2003 /* kill upper bits of value and shift to right position */
2004 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
2005 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
2006 unsigned base_bits = get_mode_size_bits(mode);
2007 unsigned shiftwidth = base_bits - bitsize;
2009 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
2010 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
2012 unsigned shrwidth = base_bits - bitsize - bitoffset;
2013 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
2014 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
2016 /* load current value */
2017 ir_node *mem = get_store();
2018 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2019 set_volatile ? cons_volatile : cons_none);
2020 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2021 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2022 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2023 ir_tarval *inv_mask = tarval_not(shift_mask);
2024 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2025 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2027 /* construct new value and store */
2028 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2029 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2030 set_volatile ? cons_volatile : cons_none);
2031 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2032 set_store(store_mem);
2038 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2039 if (mode_is_signed(mode)) {
2040 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2042 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2047 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2050 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2051 entity_t *entity = expression->compound_entry;
2052 type_t *base_type = entity->declaration.type;
2053 ir_mode *mode = get_ir_mode_storage(base_type);
2054 ir_node *mem = get_store();
2055 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2056 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2057 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2058 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2060 ir_mode *amode = mode;
2061 /* optimisation, since shifting in modes < machine_size is usually
2063 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2066 unsigned amode_size = get_mode_size_bits(amode);
2067 load_res = create_conv(dbgi, load_res, amode);
2069 set_store(load_mem);
2071 /* kill upper bits */
2072 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2073 unsigned bitoffset = entity->compound_member.bit_offset;
2074 unsigned bitsize = entity->compound_member.bit_size;
2075 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2076 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2077 ir_node *countl = new_d_Const(dbgi, tvl);
2078 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2080 unsigned shift_bitsr = bitoffset + shift_bitsl;
2081 assert(shift_bitsr <= amode_size);
2082 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2083 ir_node *countr = new_d_Const(dbgi, tvr);
2085 if (mode_is_signed(mode)) {
2086 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2088 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2091 type_t *type = expression->base.type;
2092 ir_mode *resmode = get_ir_mode_arithmetic(type);
2093 return create_conv(dbgi, shiftr, resmode);
2096 /* make sure the selected compound type is constructed */
2097 static void construct_select_compound(const select_expression_t *expression)
2099 type_t *type = skip_typeref(expression->compound->base.type);
2100 if (is_type_pointer(type)) {
2101 type = type->pointer.points_to;
2103 (void) get_ir_type(type);
2106 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2107 ir_node *value, ir_node *addr)
2109 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2110 type_t *type = skip_typeref(expression->base.type);
2112 if (!is_type_compound(type)) {
2113 ir_mode *mode = get_ir_mode_storage(type);
2114 value = create_conv(dbgi, value, mode);
2115 value = do_strict_conv(dbgi, value);
2118 if (expression->kind == EXPR_REFERENCE) {
2119 const reference_expression_t *ref = &expression->reference;
2121 entity_t *entity = ref->entity;
2122 assert(is_declaration(entity));
2123 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2124 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2125 set_value(entity->variable.v.value_number, value);
2127 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2128 set_value(entity->parameter.v.value_number, value);
2134 addr = expression_to_addr(expression);
2135 assert(addr != NULL);
2137 if (expression->kind == EXPR_SELECT) {
2138 const select_expression_t *select = &expression->select;
2140 construct_select_compound(select);
2142 entity_t *entity = select->compound_entry;
2143 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2144 if (entity->compound_member.bitfield) {
2145 ir_entity *irentity = entity->compound_member.entity;
2147 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2148 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2149 set_volatile, true);
2154 assign_value(dbgi, addr, type, value);
2158 static void set_value_for_expression(const expression_t *expression,
2161 set_value_for_expression_addr(expression, value, NULL);
2164 static ir_node *get_value_from_lvalue(const expression_t *expression,
2167 if (expression->kind == EXPR_REFERENCE) {
2168 const reference_expression_t *ref = &expression->reference;
2170 entity_t *entity = ref->entity;
2171 assert(entity->kind == ENTITY_VARIABLE
2172 || entity->kind == ENTITY_PARAMETER);
2173 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2175 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2176 value_number = entity->variable.v.value_number;
2177 assert(addr == NULL);
2178 type_t *type = skip_typeref(expression->base.type);
2179 ir_mode *mode = get_ir_mode_storage(type);
2180 ir_node *res = get_value(value_number, mode);
2181 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2182 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2183 value_number = entity->parameter.v.value_number;
2184 assert(addr == NULL);
2185 type_t *type = skip_typeref(expression->base.type);
2186 ir_mode *mode = get_ir_mode_storage(type);
2187 ir_node *res = get_value(value_number, mode);
2188 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2192 assert(addr != NULL);
2193 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2196 if (expression->kind == EXPR_SELECT &&
2197 expression->select.compound_entry->compound_member.bitfield) {
2198 construct_select_compound(&expression->select);
2199 value = bitfield_extract_to_firm(&expression->select, addr);
2201 value = deref_address(dbgi, expression->base.type, addr);
2208 static ir_node *create_incdec(const unary_expression_t *expression)
2210 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2211 const expression_t *value_expr = expression->value;
2212 ir_node *addr = expression_to_addr(value_expr);
2213 ir_node *value = get_value_from_lvalue(value_expr, addr);
2215 type_t *type = skip_typeref(expression->base.type);
2216 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2219 if (is_type_pointer(type)) {
2220 pointer_type_t *pointer_type = &type->pointer;
2221 offset = get_type_size_node(pointer_type->points_to);
2223 assert(is_type_arithmetic(type));
2224 offset = new_Const(get_mode_one(mode));
2228 ir_node *store_value;
2229 switch(expression->base.kind) {
2230 case EXPR_UNARY_POSTFIX_INCREMENT:
2232 store_value = new_d_Add(dbgi, value, offset, mode);
2234 case EXPR_UNARY_POSTFIX_DECREMENT:
2236 store_value = new_d_Sub(dbgi, value, offset, mode);
2238 case EXPR_UNARY_PREFIX_INCREMENT:
2239 result = new_d_Add(dbgi, value, offset, mode);
2240 store_value = result;
2242 case EXPR_UNARY_PREFIX_DECREMENT:
2243 result = new_d_Sub(dbgi, value, offset, mode);
2244 store_value = result;
2247 panic("no incdec expr in create_incdec");
2250 set_value_for_expression_addr(value_expr, store_value, addr);
2255 static bool is_local_variable(expression_t *expression)
2257 if (expression->kind != EXPR_REFERENCE)
2259 reference_expression_t *ref_expr = &expression->reference;
2260 entity_t *entity = ref_expr->entity;
2261 if (entity->kind != ENTITY_VARIABLE)
2263 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2264 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2267 static ir_relation get_relation(const expression_kind_t kind)
2270 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2271 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2272 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2273 case EXPR_BINARY_ISLESS:
2274 case EXPR_BINARY_LESS: return ir_relation_less;
2275 case EXPR_BINARY_ISLESSEQUAL:
2276 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2277 case EXPR_BINARY_ISGREATER:
2278 case EXPR_BINARY_GREATER: return ir_relation_greater;
2279 case EXPR_BINARY_ISGREATEREQUAL:
2280 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2281 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2286 panic("trying to get pn_Cmp from non-comparison binexpr type");
2290 * Handle the assume optimizer hint: check if a Confirm
2291 * node can be created.
2293 * @param dbi debug info
2294 * @param expr the IL assume expression
2296 * we support here only some simple cases:
2301 static ir_node *handle_assume_compare(dbg_info *dbi,
2302 const binary_expression_t *expression)
2304 expression_t *op1 = expression->left;
2305 expression_t *op2 = expression->right;
2306 entity_t *var2, *var = NULL;
2307 ir_node *res = NULL;
2308 ir_relation relation = get_relation(expression->base.kind);
2310 if (is_local_variable(op1) && is_local_variable(op2)) {
2311 var = op1->reference.entity;
2312 var2 = op2->reference.entity;
2314 type_t *const type = skip_typeref(var->declaration.type);
2315 ir_mode *const mode = get_ir_mode_storage(type);
2317 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2318 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2320 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2321 set_value(var2->variable.v.value_number, res);
2323 res = new_d_Confirm(dbi, irn1, irn2, relation);
2324 set_value(var->variable.v.value_number, res);
2329 expression_t *con = NULL;
2330 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2331 var = op1->reference.entity;
2333 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2334 relation = get_inversed_relation(relation);
2335 var = op2->reference.entity;
2340 type_t *const type = skip_typeref(var->declaration.type);
2341 ir_mode *const mode = get_ir_mode_storage(type);
2343 res = get_value(var->variable.v.value_number, mode);
2344 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2345 set_value(var->variable.v.value_number, res);
2351 * Handle the assume optimizer hint.
2353 * @param dbi debug info
2354 * @param expr the IL assume expression
2356 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2358 switch(expression->kind) {
2359 case EXPR_BINARY_EQUAL:
2360 case EXPR_BINARY_NOTEQUAL:
2361 case EXPR_BINARY_LESS:
2362 case EXPR_BINARY_LESSEQUAL:
2363 case EXPR_BINARY_GREATER:
2364 case EXPR_BINARY_GREATEREQUAL:
2365 return handle_assume_compare(dbi, &expression->binary);
2371 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2372 type_t *from_type, type_t *type)
2374 type = skip_typeref(type);
2375 if (is_type_void(type)) {
2376 /* make sure firm type is constructed */
2377 (void) get_ir_type(type);
2380 if (!is_type_scalar(type)) {
2381 /* make sure firm type is constructed */
2382 (void) get_ir_type(type);
2386 from_type = skip_typeref(from_type);
2387 ir_mode *mode = get_ir_mode_storage(type);
2388 /* check for conversion from / to __based types */
2389 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2390 const variable_t *from_var = from_type->pointer.base_variable;
2391 const variable_t *to_var = type->pointer.base_variable;
2392 if (from_var != to_var) {
2393 if (from_var != NULL) {
2394 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2395 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2396 value_node = new_d_Add(dbgi, value_node, base, mode);
2398 if (to_var != NULL) {
2399 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2400 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2401 value_node = new_d_Sub(dbgi, value_node, base, mode);
2406 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2407 /* bool adjustments (we save a mode_Bu, but have to temporarily
2408 * convert to mode_b so we only get a 0/1 value */
2409 value_node = create_conv(dbgi, value_node, mode_b);
2412 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2413 ir_node *node = create_conv(dbgi, value_node, mode);
2414 node = do_strict_conv(dbgi, node);
2415 node = create_conv(dbgi, node, mode_arith);
2420 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2422 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2423 type_t *type = skip_typeref(expression->base.type);
2425 const expression_t *value = expression->value;
2427 switch(expression->base.kind) {
2428 case EXPR_UNARY_TAKE_ADDRESS:
2429 return expression_to_addr(value);
2431 case EXPR_UNARY_NEGATE: {
2432 ir_node *value_node = expression_to_firm(value);
2433 ir_mode *mode = get_ir_mode_arithmetic(type);
2434 return new_d_Minus(dbgi, value_node, mode);
2436 case EXPR_UNARY_PLUS:
2437 return expression_to_firm(value);
2438 case EXPR_UNARY_BITWISE_NEGATE: {
2439 ir_node *value_node = expression_to_firm(value);
2440 ir_mode *mode = get_ir_mode_arithmetic(type);
2441 return new_d_Not(dbgi, value_node, mode);
2443 case EXPR_UNARY_NOT: {
2444 ir_node *value_node = _expression_to_firm(value);
2445 value_node = create_conv(dbgi, value_node, mode_b);
2446 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2449 case EXPR_UNARY_DEREFERENCE: {
2450 ir_node *value_node = expression_to_firm(value);
2451 type_t *value_type = skip_typeref(value->base.type);
2452 assert(is_type_pointer(value_type));
2454 /* check for __based */
2455 const variable_t *const base_var = value_type->pointer.base_variable;
2456 if (base_var != NULL) {
2457 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2458 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2459 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2461 type_t *points_to = value_type->pointer.points_to;
2462 return deref_address(dbgi, points_to, value_node);
2464 case EXPR_UNARY_POSTFIX_INCREMENT:
2465 case EXPR_UNARY_POSTFIX_DECREMENT:
2466 case EXPR_UNARY_PREFIX_INCREMENT:
2467 case EXPR_UNARY_PREFIX_DECREMENT:
2468 return create_incdec(expression);
2469 case EXPR_UNARY_CAST: {
2470 ir_node *value_node = expression_to_firm(value);
2471 type_t *from_type = value->base.type;
2472 return create_cast(dbgi, value_node, from_type, type);
2474 case EXPR_UNARY_ASSUME:
2475 return handle_assume(dbgi, value);
2480 panic("invalid UNEXPR type found");
2484 * produces a 0/1 depending of the value of a mode_b node
2486 static ir_node *produce_condition_result(const expression_t *expression,
2487 ir_mode *mode, dbg_info *dbgi)
2489 ir_node *const one_block = new_immBlock();
2490 ir_node *const zero_block = new_immBlock();
2491 create_condition_evaluation(expression, one_block, zero_block);
2492 mature_immBlock(one_block);
2493 mature_immBlock(zero_block);
2495 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2496 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2497 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2498 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2499 set_cur_block(block);
2501 ir_node *const one = new_Const(get_mode_one(mode));
2502 ir_node *const zero = new_Const(get_mode_null(mode));
2503 ir_node *const in[2] = { one, zero };
2504 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2509 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2510 ir_node *value, type_t *type)
2512 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2513 assert(is_type_pointer(type));
2514 pointer_type_t *const pointer_type = &type->pointer;
2515 type_t *const points_to = skip_typeref(pointer_type->points_to);
2516 ir_node * elem_size = get_type_size_node(points_to);
2517 elem_size = create_conv(dbgi, elem_size, mode);
2518 value = create_conv(dbgi, value, mode);
2519 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2523 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2524 ir_node *left, ir_node *right)
2527 type_t *type_left = skip_typeref(expression->left->base.type);
2528 type_t *type_right = skip_typeref(expression->right->base.type);
2530 expression_kind_t kind = expression->base.kind;
2533 case EXPR_BINARY_SHIFTLEFT:
2534 case EXPR_BINARY_SHIFTRIGHT:
2535 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2536 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2537 mode = get_ir_mode_arithmetic(expression->base.type);
2538 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2541 case EXPR_BINARY_SUB:
2542 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2543 const pointer_type_t *const ptr_type = &type_left->pointer;
2545 mode = get_ir_mode_arithmetic(expression->base.type);
2546 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2547 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2548 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2549 ir_node *const no_mem = new_NoMem();
2550 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2551 mode, op_pin_state_floats);
2552 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2555 case EXPR_BINARY_SUB_ASSIGN:
2556 if (is_type_pointer(type_left)) {
2557 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2558 mode = get_ir_mode_arithmetic(type_left);
2563 case EXPR_BINARY_ADD:
2564 case EXPR_BINARY_ADD_ASSIGN:
2565 if (is_type_pointer(type_left)) {
2566 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2567 mode = get_ir_mode_arithmetic(type_left);
2569 } else if (is_type_pointer(type_right)) {
2570 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2571 mode = get_ir_mode_arithmetic(type_right);
2578 mode = get_ir_mode_arithmetic(type_right);
2579 left = create_conv(dbgi, left, mode);
2584 case EXPR_BINARY_ADD_ASSIGN:
2585 case EXPR_BINARY_ADD:
2586 return new_d_Add(dbgi, left, right, mode);
2587 case EXPR_BINARY_SUB_ASSIGN:
2588 case EXPR_BINARY_SUB:
2589 return new_d_Sub(dbgi, left, right, mode);
2590 case EXPR_BINARY_MUL_ASSIGN:
2591 case EXPR_BINARY_MUL:
2592 return new_d_Mul(dbgi, left, right, mode);
2593 case EXPR_BINARY_BITWISE_AND:
2594 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2595 return new_d_And(dbgi, left, right, mode);
2596 case EXPR_BINARY_BITWISE_OR:
2597 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2598 return new_d_Or(dbgi, left, right, mode);
2599 case EXPR_BINARY_BITWISE_XOR:
2600 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2601 return new_d_Eor(dbgi, left, right, mode);
2602 case EXPR_BINARY_SHIFTLEFT:
2603 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2604 return new_d_Shl(dbgi, left, right, mode);
2605 case EXPR_BINARY_SHIFTRIGHT:
2606 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2607 if (mode_is_signed(mode)) {
2608 return new_d_Shrs(dbgi, left, right, mode);
2610 return new_d_Shr(dbgi, left, right, mode);
2612 case EXPR_BINARY_DIV:
2613 case EXPR_BINARY_DIV_ASSIGN: {
2614 ir_node *pin = new_Pin(new_NoMem());
2615 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2616 op_pin_state_floats);
2617 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2620 case EXPR_BINARY_MOD:
2621 case EXPR_BINARY_MOD_ASSIGN: {
2622 ir_node *pin = new_Pin(new_NoMem());
2623 assert(!mode_is_float(mode));
2624 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2625 op_pin_state_floats);
2626 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2630 panic("unexpected expression kind");
2634 static ir_node *create_lazy_op(const binary_expression_t *expression)
2636 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2637 type_t *type = skip_typeref(expression->base.type);
2638 ir_mode *mode = get_ir_mode_arithmetic(type);
2640 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2641 bool val = fold_constant_to_bool(expression->left);
2642 expression_kind_t ekind = expression->base.kind;
2643 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2644 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2646 return new_Const(get_mode_null(mode));
2650 return new_Const(get_mode_one(mode));
2654 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2655 bool valr = fold_constant_to_bool(expression->right);
2656 return create_Const_from_bool(mode, valr);
2659 return produce_condition_result(expression->right, mode, dbgi);
2662 return produce_condition_result((const expression_t*) expression, mode,
2666 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2667 ir_node *right, ir_mode *mode);
2669 static ir_node *create_assign_binop(const binary_expression_t *expression)
2671 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2672 const expression_t *left_expr = expression->left;
2673 type_t *type = skip_typeref(left_expr->base.type);
2674 ir_node *right = expression_to_firm(expression->right);
2675 ir_node *left_addr = expression_to_addr(left_expr);
2676 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2677 ir_node *result = create_op(dbgi, expression, left, right);
2679 result = create_cast(dbgi, result, expression->right->base.type, type);
2680 result = do_strict_conv(dbgi, result);
2682 result = set_value_for_expression_addr(left_expr, result, left_addr);
2684 if (!is_type_compound(type)) {
2685 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2686 result = create_conv(dbgi, result, mode_arithmetic);
2691 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2693 expression_kind_t kind = expression->base.kind;
2696 case EXPR_BINARY_EQUAL:
2697 case EXPR_BINARY_NOTEQUAL:
2698 case EXPR_BINARY_LESS:
2699 case EXPR_BINARY_LESSEQUAL:
2700 case EXPR_BINARY_GREATER:
2701 case EXPR_BINARY_GREATEREQUAL:
2702 case EXPR_BINARY_ISGREATER:
2703 case EXPR_BINARY_ISGREATEREQUAL:
2704 case EXPR_BINARY_ISLESS:
2705 case EXPR_BINARY_ISLESSEQUAL:
2706 case EXPR_BINARY_ISLESSGREATER:
2707 case EXPR_BINARY_ISUNORDERED: {
2708 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2709 ir_node *left = expression_to_firm(expression->left);
2710 ir_node *right = expression_to_firm(expression->right);
2711 ir_relation relation = get_relation(kind);
2712 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2715 case EXPR_BINARY_ASSIGN: {
2716 ir_node *addr = expression_to_addr(expression->left);
2717 ir_node *right = expression_to_firm(expression->right);
2719 = set_value_for_expression_addr(expression->left, right, addr);
2721 type_t *type = skip_typeref(expression->base.type);
2722 if (!is_type_compound(type)) {
2723 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2724 res = create_conv(NULL, res, mode_arithmetic);
2728 case EXPR_BINARY_ADD:
2729 case EXPR_BINARY_SUB:
2730 case EXPR_BINARY_MUL:
2731 case EXPR_BINARY_DIV:
2732 case EXPR_BINARY_MOD:
2733 case EXPR_BINARY_BITWISE_AND:
2734 case EXPR_BINARY_BITWISE_OR:
2735 case EXPR_BINARY_BITWISE_XOR:
2736 case EXPR_BINARY_SHIFTLEFT:
2737 case EXPR_BINARY_SHIFTRIGHT:
2739 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2740 ir_node *left = expression_to_firm(expression->left);
2741 ir_node *right = expression_to_firm(expression->right);
2742 return create_op(dbgi, expression, left, right);
2744 case EXPR_BINARY_LOGICAL_AND:
2745 case EXPR_BINARY_LOGICAL_OR:
2746 return create_lazy_op(expression);
2747 case EXPR_BINARY_COMMA:
2748 /* create side effects of left side */
2749 (void) expression_to_firm(expression->left);
2750 return _expression_to_firm(expression->right);
2752 case EXPR_BINARY_ADD_ASSIGN:
2753 case EXPR_BINARY_SUB_ASSIGN:
2754 case EXPR_BINARY_MUL_ASSIGN:
2755 case EXPR_BINARY_MOD_ASSIGN:
2756 case EXPR_BINARY_DIV_ASSIGN:
2757 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2758 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2759 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2760 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2761 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2762 return create_assign_binop(expression);
2764 panic("TODO binexpr type");
2768 static ir_node *array_access_addr(const array_access_expression_t *expression)
2770 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2771 ir_node *base_addr = expression_to_firm(expression->array_ref);
2772 ir_node *offset = expression_to_firm(expression->index);
2773 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2774 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2775 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2780 static ir_node *array_access_to_firm(
2781 const array_access_expression_t *expression)
2783 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2784 ir_node *addr = array_access_addr(expression);
2785 type_t *type = revert_automatic_type_conversion(
2786 (const expression_t*) expression);
2787 type = skip_typeref(type);
2789 return deref_address(dbgi, type, addr);
2792 static long get_offsetof_offset(const offsetof_expression_t *expression)
2794 type_t *orig_type = expression->type;
2797 designator_t *designator = expression->designator;
2798 for ( ; designator != NULL; designator = designator->next) {
2799 type_t *type = skip_typeref(orig_type);
2800 /* be sure the type is constructed */
2801 (void) get_ir_type(type);
2803 if (designator->symbol != NULL) {
2804 assert(is_type_compound(type));
2805 symbol_t *symbol = designator->symbol;
2807 compound_t *compound = type->compound.compound;
2808 entity_t *iter = compound->members.entities;
2809 for ( ; iter != NULL; iter = iter->base.next) {
2810 if (iter->base.symbol == symbol) {
2814 assert(iter != NULL);
2816 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2817 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2818 offset += get_entity_offset(iter->compound_member.entity);
2820 orig_type = iter->declaration.type;
2822 expression_t *array_index = designator->array_index;
2823 assert(designator->array_index != NULL);
2824 assert(is_type_array(type));
2826 long index = fold_constant_to_int(array_index);
2827 ir_type *arr_type = get_ir_type(type);
2828 ir_type *elem_type = get_array_element_type(arr_type);
2829 long elem_size = get_type_size_bytes(elem_type);
2831 offset += index * elem_size;
2833 orig_type = type->array.element_type;
2840 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2842 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2843 long offset = get_offsetof_offset(expression);
2844 ir_tarval *tv = new_tarval_from_long(offset, mode);
2845 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2847 return new_d_Const(dbgi, tv);
2850 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2851 ir_entity *entity, type_t *type);
2852 static ir_initializer_t *create_ir_initializer(
2853 const initializer_t *initializer, type_t *type);
2855 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2856 initializer_t *initializer,
2859 /* create the ir_initializer */
2860 ir_graph *const old_current_ir_graph = current_ir_graph;
2861 current_ir_graph = get_const_code_irg();
2863 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2865 assert(current_ir_graph == get_const_code_irg());
2866 current_ir_graph = old_current_ir_graph;
2868 ident *const id = id_unique("initializer.%u");
2869 ir_type *const irtype = get_ir_type(type);
2870 ir_type *const global_type = get_glob_type();
2871 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2872 set_entity_ld_ident(entity, id);
2873 set_entity_visibility(entity, ir_visibility_private);
2874 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2875 set_entity_initializer(entity, irinitializer);
2879 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2881 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2882 type_t *type = expression->type;
2883 initializer_t *initializer = expression->initializer;
2885 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2886 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2887 return create_symconst(dbgi, entity);
2889 /* create an entity on the stack */
2890 ident *const id = id_unique("CompLit.%u");
2891 ir_type *const irtype = get_ir_type(type);
2892 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2894 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2895 set_entity_ld_ident(entity, id);
2897 /* create initialisation code */
2898 create_local_initializer(initializer, dbgi, entity, type);
2900 /* create a sel for the compound literal address */
2901 ir_node *frame = get_irg_frame(current_ir_graph);
2902 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2907 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2909 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2910 type_t *const type = expr->type;
2911 ir_node *const addr = compound_literal_addr(expr);
2912 return deref_address(dbgi, type, addr);
2916 * Transform a sizeof expression into Firm code.
2918 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2920 type_t *const type = skip_typeref(expression->type);
2921 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2922 if (is_type_array(type) && type->array.is_vla
2923 && expression->tp_expression != NULL) {
2924 expression_to_firm(expression->tp_expression);
2927 return get_type_size_node(type);
2930 static entity_t *get_expression_entity(const expression_t *expression)
2932 if (expression->kind != EXPR_REFERENCE)
2935 return expression->reference.entity;
2938 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2940 switch(entity->kind) {
2941 case DECLARATION_KIND_CASES:
2942 return entity->declaration.alignment;
2945 return entity->compound.alignment;
2946 case ENTITY_TYPEDEF:
2947 return entity->typedefe.alignment;
2955 * Transform an alignof expression into Firm code.
2957 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2959 unsigned alignment = 0;
2961 const expression_t *tp_expression = expression->tp_expression;
2962 if (tp_expression != NULL) {
2963 entity_t *entity = get_expression_entity(tp_expression);
2964 if (entity != NULL) {
2965 if (entity->kind == ENTITY_FUNCTION) {
2966 /* a gnu-extension */
2969 alignment = get_cparser_entity_alignment(entity);
2974 if (alignment == 0) {
2975 type_t *type = expression->type;
2976 alignment = get_type_alignment(type);
2979 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2980 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2981 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2982 return new_d_Const(dbgi, tv);
2985 static void init_ir_types(void);
2987 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2989 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2991 bool constant_folding_old = constant_folding;
2992 constant_folding = true;
2993 int old_optimize = get_optimize();
2994 int old_constant_folding = get_opt_constant_folding();
2996 set_opt_constant_folding(1);
3000 ir_graph *old_current_ir_graph = current_ir_graph;
3001 current_ir_graph = get_const_code_irg();
3003 ir_node *const cnst = _expression_to_firm(expression);
3005 current_ir_graph = old_current_ir_graph;
3006 set_optimize(old_optimize);
3007 set_opt_constant_folding(old_constant_folding);
3009 if (!is_Const(cnst)) {
3010 panic("couldn't fold constant");
3013 constant_folding = constant_folding_old;
3015 ir_tarval *const tv = get_Const_tarval(cnst);
3016 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
3017 return tarval_convert_to(tv, mode);
3020 /* this function is only used in parser.c, but it relies on libfirm functionality */
3021 bool constant_is_negative(const expression_t *expression)
3023 ir_tarval *tv = fold_constant_to_tarval(expression);
3024 return tarval_is_negative(tv);
3027 long fold_constant_to_int(const expression_t *expression)
3029 ir_tarval *tv = fold_constant_to_tarval(expression);
3030 if (!tarval_is_long(tv)) {
3031 panic("result of constant folding is not integer");
3034 return get_tarval_long(tv);
3037 bool fold_constant_to_bool(const expression_t *expression)
3039 ir_tarval *tv = fold_constant_to_tarval(expression);
3040 return !tarval_is_null(tv);
3043 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3045 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3047 /* first try to fold a constant condition */
3048 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3049 bool val = fold_constant_to_bool(expression->condition);
3051 expression_t *true_expression = expression->true_expression;
3052 if (true_expression == NULL)
3053 true_expression = expression->condition;
3054 return expression_to_firm(true_expression);
3056 return expression_to_firm(expression->false_expression);
3060 ir_node *const true_block = new_immBlock();
3061 ir_node *const false_block = new_immBlock();
3062 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3063 mature_immBlock(true_block);
3064 mature_immBlock(false_block);
3066 set_cur_block(true_block);
3068 if (expression->true_expression != NULL) {
3069 true_val = expression_to_firm(expression->true_expression);
3070 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3071 true_val = cond_expr;
3073 /* Condition ended with a short circuit (&&, ||, !) operation or a
3074 * comparison. Generate a "1" as value for the true branch. */
3075 true_val = new_Const(get_mode_one(mode_Is));
3077 ir_node *const true_jmp = new_d_Jmp(dbgi);
3079 set_cur_block(false_block);
3080 ir_node *const false_val = expression_to_firm(expression->false_expression);
3081 ir_node *const false_jmp = new_d_Jmp(dbgi);
3083 /* create the common block */
3084 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3085 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3086 set_cur_block(block);
3088 /* TODO improve static semantics, so either both or no values are NULL */
3089 if (true_val == NULL || false_val == NULL)
3092 ir_node *const in[2] = { true_val, false_val };
3093 type_t *const type = skip_typeref(expression->base.type);
3094 ir_mode *const mode = get_ir_mode_arithmetic(type);
3095 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3101 * Returns an IR-node representing the address of a field.
3103 static ir_node *select_addr(const select_expression_t *expression)
3105 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3107 construct_select_compound(expression);
3109 ir_node *compound_addr = expression_to_firm(expression->compound);
3111 entity_t *entry = expression->compound_entry;
3112 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3113 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3115 if (constant_folding) {
3116 ir_mode *mode = get_irn_mode(compound_addr);
3117 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3118 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3119 return new_d_Add(dbgi, compound_addr, ofs, mode);
3121 ir_entity *irentity = entry->compound_member.entity;
3122 assert(irentity != NULL);
3123 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3127 static ir_node *select_to_firm(const select_expression_t *expression)
3129 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3130 ir_node *addr = select_addr(expression);
3131 type_t *type = revert_automatic_type_conversion(
3132 (const expression_t*) expression);
3133 type = skip_typeref(type);
3135 entity_t *entry = expression->compound_entry;
3136 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3138 if (entry->compound_member.bitfield) {
3139 return bitfield_extract_to_firm(expression, addr);
3142 return deref_address(dbgi, type, addr);
3145 /* Values returned by __builtin_classify_type. */
3146 typedef enum gcc_type_class
3152 enumeral_type_class,
3155 reference_type_class,
3159 function_type_class,
3170 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3172 type_t *type = expr->type_expression->base.type;
3174 /* FIXME gcc returns different values depending on whether compiling C or C++
3175 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3178 type = skip_typeref(type);
3179 switch (type->kind) {
3181 const atomic_type_t *const atomic_type = &type->atomic;
3182 switch (atomic_type->akind) {
3183 /* should not be reached */
3184 case ATOMIC_TYPE_INVALID:
3188 /* gcc cannot do that */
3189 case ATOMIC_TYPE_VOID:
3190 tc = void_type_class;
3193 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3194 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3195 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3196 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3197 case ATOMIC_TYPE_SHORT:
3198 case ATOMIC_TYPE_USHORT:
3199 case ATOMIC_TYPE_INT:
3200 case ATOMIC_TYPE_UINT:
3201 case ATOMIC_TYPE_LONG:
3202 case ATOMIC_TYPE_ULONG:
3203 case ATOMIC_TYPE_LONGLONG:
3204 case ATOMIC_TYPE_ULONGLONG:
3205 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3206 tc = integer_type_class;
3209 case ATOMIC_TYPE_FLOAT:
3210 case ATOMIC_TYPE_DOUBLE:
3211 case ATOMIC_TYPE_LONG_DOUBLE:
3212 tc = real_type_class;
3215 panic("Unexpected atomic type in classify_type_to_firm().");
3218 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3219 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3220 case TYPE_ARRAY: /* gcc handles this as pointer */
3221 case TYPE_FUNCTION: /* gcc handles this as pointer */
3222 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3223 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3224 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3226 /* gcc handles this as integer */
3227 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3229 /* gcc classifies the referenced type */
3230 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3232 /* typedef/typeof should be skipped already */
3238 panic("unexpected TYPE classify_type_to_firm().");
3242 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3243 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3244 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3245 return new_d_Const(dbgi, tv);
3248 static ir_node *function_name_to_firm(
3249 const funcname_expression_t *const expr)
3251 switch(expr->kind) {
3252 case FUNCNAME_FUNCTION:
3253 case FUNCNAME_PRETTY_FUNCTION:
3254 case FUNCNAME_FUNCDNAME:
3255 if (current_function_name == NULL) {
3256 const source_position_t *const src_pos = &expr->base.source_position;
3257 const char *name = current_function_entity->base.symbol->string;
3258 const string_t string = { name, strlen(name) + 1 };
3259 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3261 return current_function_name;
3262 case FUNCNAME_FUNCSIG:
3263 if (current_funcsig == NULL) {
3264 const source_position_t *const src_pos = &expr->base.source_position;
3265 ir_entity *ent = get_irg_entity(current_ir_graph);
3266 const char *const name = get_entity_ld_name(ent);
3267 const string_t string = { name, strlen(name) + 1 };
3268 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3270 return current_funcsig;
3272 panic("Unsupported function name");
3275 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3277 statement_t *statement = expr->statement;
3279 assert(statement->kind == STATEMENT_COMPOUND);
3280 return compound_statement_to_firm(&statement->compound);
3283 static ir_node *va_start_expression_to_firm(
3284 const va_start_expression_t *const expr)
3286 ir_entity *param_ent = current_vararg_entity;
3287 if (param_ent == NULL) {
3288 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3289 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3290 ir_type *const param_type = get_unknown_type();
3291 param_ent = new_parameter_entity(frame_type, n, param_type);
3292 current_vararg_entity = param_ent;
3295 ir_node *const frame = get_irg_frame(current_ir_graph);
3296 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3297 ir_node *const no_mem = new_NoMem();
3298 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3300 set_value_for_expression(expr->ap, arg_sel);
3305 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3307 type_t *const type = expr->base.type;
3308 expression_t *const ap_expr = expr->ap;
3309 ir_node *const ap_addr = expression_to_addr(ap_expr);
3310 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3311 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3312 ir_node *const res = deref_address(dbgi, type, ap);
3314 ir_node *const cnst = get_type_size_node(expr->base.type);
3315 ir_mode *const mode = get_irn_mode(cnst);
3316 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3317 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3318 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3319 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3320 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3322 set_value_for_expression_addr(ap_expr, add, ap_addr);
3328 * Generate Firm for a va_copy expression.
3330 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3332 ir_node *const src = expression_to_firm(expr->src);
3333 set_value_for_expression(expr->dst, src);
3337 static ir_node *dereference_addr(const unary_expression_t *const expression)
3339 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3340 return expression_to_firm(expression->value);
3344 * Returns a IR-node representing an lvalue of the given expression.
3346 static ir_node *expression_to_addr(const expression_t *expression)
3348 switch(expression->kind) {
3349 case EXPR_ARRAY_ACCESS:
3350 return array_access_addr(&expression->array_access);
3352 return call_expression_to_firm(&expression->call);
3353 case EXPR_COMPOUND_LITERAL:
3354 return compound_literal_addr(&expression->compound_literal);
3355 case EXPR_REFERENCE:
3356 return reference_addr(&expression->reference);
3358 return select_addr(&expression->select);
3359 case EXPR_UNARY_DEREFERENCE:
3360 return dereference_addr(&expression->unary);
3364 panic("trying to get address of non-lvalue");
3367 static ir_node *builtin_constant_to_firm(
3368 const builtin_constant_expression_t *expression)
3370 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3371 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3372 return create_Const_from_bool(mode, v);
3375 static ir_node *builtin_types_compatible_to_firm(
3376 const builtin_types_compatible_expression_t *expression)
3378 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3379 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3380 bool const value = types_compatible(left, right);
3381 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3382 return create_Const_from_bool(mode, value);
3385 static ir_node *get_label_block(label_t *label)
3387 if (label->block != NULL)
3388 return label->block;
3390 /* beware: might be called from create initializer with current_ir_graph
3391 * set to const_code_irg. */
3392 ir_graph *rem = current_ir_graph;
3393 current_ir_graph = current_function;
3395 ir_node *block = new_immBlock();
3397 label->block = block;
3399 ARR_APP1(label_t *, all_labels, label);
3401 current_ir_graph = rem;
3406 * Pointer to a label. This is used for the
3407 * GNU address-of-label extension.
3409 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3411 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3412 ir_node *block = get_label_block(label->label);
3413 ir_entity *entity = create_Block_entity(block);
3415 symconst_symbol value;
3416 value.entity_p = entity;
3417 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3421 * creates firm nodes for an expression. The difference between this function
3422 * and expression_to_firm is, that this version might produce mode_b nodes
3423 * instead of mode_Is.
3425 static ir_node *_expression_to_firm(expression_t const *const expr)
3428 if (!constant_folding) {
3429 assert(!expr->base.transformed);
3430 ((expression_t*)expr)->base.transformed = true;
3434 switch (expr->kind) {
3435 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3436 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3437 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3438 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3439 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3440 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3441 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3442 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3443 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3444 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3445 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3446 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3447 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3448 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3449 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3450 case EXPR_SELECT: return select_to_firm( &expr->select);
3451 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3452 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3453 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3454 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3455 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3456 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3457 case EXPR_WIDE_STRING_LITERAL: return wide_string_literal_to_firm( &expr->string_literal);
3459 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->literal.value);
3461 case EXPR_ERROR: break;
3463 panic("invalid expression found");
3467 * Check if a given expression is a GNU __builtin_expect() call.
3469 static bool is_builtin_expect(const expression_t *expression)
3471 if (expression->kind != EXPR_CALL)
3474 expression_t *function = expression->call.function;
3475 if (function->kind != EXPR_REFERENCE)
3477 reference_expression_t *ref = &function->reference;
3478 if (ref->entity->kind != ENTITY_FUNCTION ||
3479 ref->entity->function.btk != BUILTIN_EXPECT)
3485 static bool produces_mode_b(const expression_t *expression)
3487 switch (expression->kind) {
3488 case EXPR_BINARY_EQUAL:
3489 case EXPR_BINARY_NOTEQUAL:
3490 case EXPR_BINARY_LESS:
3491 case EXPR_BINARY_LESSEQUAL:
3492 case EXPR_BINARY_GREATER:
3493 case EXPR_BINARY_GREATEREQUAL:
3494 case EXPR_BINARY_ISGREATER:
3495 case EXPR_BINARY_ISGREATEREQUAL:
3496 case EXPR_BINARY_ISLESS:
3497 case EXPR_BINARY_ISLESSEQUAL:
3498 case EXPR_BINARY_ISLESSGREATER:
3499 case EXPR_BINARY_ISUNORDERED:
3500 case EXPR_UNARY_NOT:
3504 if (is_builtin_expect(expression)) {
3505 expression_t *argument = expression->call.arguments->expression;
3506 return produces_mode_b(argument);
3509 case EXPR_BINARY_COMMA:
3510 return produces_mode_b(expression->binary.right);
3517 static ir_node *expression_to_firm(const expression_t *expression)
3519 if (!produces_mode_b(expression)) {
3520 ir_node *res = _expression_to_firm(expression);
3521 assert(res == NULL || get_irn_mode(res) != mode_b);
3525 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3526 return new_Const(fold_constant_to_tarval(expression));
3529 /* we have to produce a 0/1 from the mode_b expression */
3530 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3531 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3532 return produce_condition_result(expression, mode, dbgi);
3536 * create a short-circuit expression evaluation that tries to construct
3537 * efficient control flow structures for &&, || and ! expressions
3539 static ir_node *create_condition_evaluation(const expression_t *expression,
3540 ir_node *true_block,
3541 ir_node *false_block)
3543 switch(expression->kind) {
3544 case EXPR_UNARY_NOT: {
3545 const unary_expression_t *unary_expression = &expression->unary;
3546 create_condition_evaluation(unary_expression->value, false_block,
3550 case EXPR_BINARY_LOGICAL_AND: {
3551 const binary_expression_t *binary_expression = &expression->binary;
3553 ir_node *extra_block = new_immBlock();
3554 create_condition_evaluation(binary_expression->left, extra_block,
3556 mature_immBlock(extra_block);
3557 set_cur_block(extra_block);
3558 create_condition_evaluation(binary_expression->right, true_block,
3562 case EXPR_BINARY_LOGICAL_OR: {
3563 const binary_expression_t *binary_expression = &expression->binary;
3565 ir_node *extra_block = new_immBlock();
3566 create_condition_evaluation(binary_expression->left, true_block,
3568 mature_immBlock(extra_block);
3569 set_cur_block(extra_block);
3570 create_condition_evaluation(binary_expression->right, true_block,
3578 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3579 ir_node *cond_expr = _expression_to_firm(expression);
3580 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3581 ir_node *cond = new_d_Cond(dbgi, condition);
3582 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3583 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3585 /* set branch prediction info based on __builtin_expect */
3586 if (is_builtin_expect(expression) && is_Cond(cond)) {
3587 call_argument_t *argument = expression->call.arguments->next;
3588 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3589 bool const cnst = fold_constant_to_bool(argument->expression);
3590 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3591 set_Cond_jmp_pred(cond, pred);
3595 add_immBlock_pred(true_block, true_proj);
3596 add_immBlock_pred(false_block, false_proj);
3598 set_unreachable_now();
3602 static void create_variable_entity(entity_t *variable,
3603 declaration_kind_t declaration_kind,
3604 ir_type *parent_type)
3606 assert(variable->kind == ENTITY_VARIABLE);
3607 type_t *type = skip_typeref(variable->declaration.type);
3609 ident *const id = new_id_from_str(variable->base.symbol->string);
3610 ir_type *const irtype = get_ir_type(type);
3611 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3612 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3613 unsigned alignment = variable->declaration.alignment;
3615 set_entity_alignment(irentity, alignment);
3617 handle_decl_modifiers(irentity, variable);
3619 variable->declaration.kind = (unsigned char) declaration_kind;
3620 variable->variable.v.entity = irentity;
3621 set_entity_ld_ident(irentity, create_ld_ident(variable));
3623 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3624 set_entity_volatility(irentity, volatility_is_volatile);
3629 typedef struct type_path_entry_t type_path_entry_t;
3630 struct type_path_entry_t {
3632 ir_initializer_t *initializer;
3634 entity_t *compound_entry;
3637 typedef struct type_path_t type_path_t;
3638 struct type_path_t {
3639 type_path_entry_t *path;
3644 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3646 size_t len = ARR_LEN(path->path);
3648 for (size_t i = 0; i < len; ++i) {
3649 const type_path_entry_t *entry = & path->path[i];
3651 type_t *type = skip_typeref(entry->type);
3652 if (is_type_compound(type)) {
3653 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3654 } else if (is_type_array(type)) {
3655 fprintf(stderr, "[%u]", (unsigned) entry->index);
3657 fprintf(stderr, "-INVALID-");
3660 fprintf(stderr, " (");
3661 print_type(path->top_type);
3662 fprintf(stderr, ")");
3665 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3667 size_t len = ARR_LEN(path->path);
3669 return & path->path[len-1];
3672 static type_path_entry_t *append_to_type_path(type_path_t *path)
3674 size_t len = ARR_LEN(path->path);
3675 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3677 type_path_entry_t *result = & path->path[len];
3678 memset(result, 0, sizeof(result[0]));
3682 static size_t get_compound_member_count(const compound_type_t *type)
3684 compound_t *compound = type->compound;
3685 size_t n_members = 0;
3686 entity_t *member = compound->members.entities;
3687 for ( ; member != NULL; member = member->base.next) {
3694 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3696 type_t *orig_top_type = path->top_type;
3697 type_t *top_type = skip_typeref(orig_top_type);
3699 assert(is_type_compound(top_type) || is_type_array(top_type));
3701 if (ARR_LEN(path->path) == 0) {
3704 type_path_entry_t *top = get_type_path_top(path);
3705 ir_initializer_t *initializer = top->initializer;
3706 return get_initializer_compound_value(initializer, top->index);
3710 static void descend_into_subtype(type_path_t *path)
3712 type_t *orig_top_type = path->top_type;
3713 type_t *top_type = skip_typeref(orig_top_type);
3715 assert(is_type_compound(top_type) || is_type_array(top_type));
3717 ir_initializer_t *initializer = get_initializer_entry(path);
3719 type_path_entry_t *top = append_to_type_path(path);
3720 top->type = top_type;
3724 if (is_type_compound(top_type)) {
3725 compound_t *const compound = top_type->compound.compound;
3726 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3728 top->compound_entry = entry;
3730 len = get_compound_member_count(&top_type->compound);
3731 if (entry != NULL) {
3732 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3733 path->top_type = entry->declaration.type;
3736 assert(is_type_array(top_type));
3737 assert(top_type->array.size > 0);
3740 path->top_type = top_type->array.element_type;
3741 len = top_type->array.size;
3743 if (initializer == NULL
3744 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3745 initializer = create_initializer_compound(len);
3746 /* we have to set the entry at the 2nd latest path entry... */
3747 size_t path_len = ARR_LEN(path->path);
3748 assert(path_len >= 1);
3750 type_path_entry_t *entry = & path->path[path_len-2];
3751 ir_initializer_t *tinitializer = entry->initializer;
3752 set_initializer_compound_value(tinitializer, entry->index,
3756 top->initializer = initializer;
3759 static void ascend_from_subtype(type_path_t *path)
3761 type_path_entry_t *top = get_type_path_top(path);
3763 path->top_type = top->type;
3765 size_t len = ARR_LEN(path->path);
3766 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3769 static void walk_designator(type_path_t *path, const designator_t *designator)
3771 /* designators start at current object type */
3772 ARR_RESIZE(type_path_entry_t, path->path, 1);
3774 for ( ; designator != NULL; designator = designator->next) {
3775 type_path_entry_t *top = get_type_path_top(path);
3776 type_t *orig_type = top->type;
3777 type_t *type = skip_typeref(orig_type);
3779 if (designator->symbol != NULL) {
3780 assert(is_type_compound(type));
3782 symbol_t *symbol = designator->symbol;
3784 compound_t *compound = type->compound.compound;
3785 entity_t *iter = compound->members.entities;
3786 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3787 if (iter->base.symbol == symbol) {
3788 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3792 assert(iter != NULL);
3794 /* revert previous initialisations of other union elements */
3795 if (type->kind == TYPE_COMPOUND_UNION) {
3796 ir_initializer_t *initializer = top->initializer;
3797 if (initializer != NULL
3798 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3799 /* are we writing to a new element? */
3800 ir_initializer_t *oldi
3801 = get_initializer_compound_value(initializer, index);
3802 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3803 /* clear initializer */
3805 = get_initializer_compound_n_entries(initializer);
3806 ir_initializer_t *nulli = get_initializer_null();
3807 for (size_t i = 0; i < len; ++i) {
3808 set_initializer_compound_value(initializer, i,
3815 top->type = orig_type;
3816 top->compound_entry = iter;
3818 orig_type = iter->declaration.type;
3820 expression_t *array_index = designator->array_index;
3821 assert(designator->array_index != NULL);
3822 assert(is_type_array(type));
3824 long index = fold_constant_to_int(array_index);
3827 if (type->array.size_constant) {
3828 long array_size = type->array.size;
3829 assert(index < array_size);
3833 top->type = orig_type;
3834 top->index = (size_t) index;
3835 orig_type = type->array.element_type;
3837 path->top_type = orig_type;
3839 if (designator->next != NULL) {
3840 descend_into_subtype(path);
3844 path->invalid = false;
3847 static void advance_current_object(type_path_t *path)
3849 if (path->invalid) {
3850 /* TODO: handle this... */
3851 panic("invalid initializer in ast2firm (excessive elements)");
3854 type_path_entry_t *top = get_type_path_top(path);
3856 type_t *type = skip_typeref(top->type);
3857 if (is_type_union(type)) {
3858 /* only the first element is initialized in unions */
3859 top->compound_entry = NULL;
3860 } else if (is_type_struct(type)) {
3861 entity_t *entry = top->compound_entry;
3864 entry = skip_unnamed_bitfields(entry->base.next);
3865 top->compound_entry = entry;
3866 if (entry != NULL) {
3867 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3868 path->top_type = entry->declaration.type;
3872 assert(is_type_array(type));
3875 if (!type->array.size_constant || top->index < type->array.size) {
3880 /* we're past the last member of the current sub-aggregate, try if we
3881 * can ascend in the type hierarchy and continue with another subobject */
3882 size_t len = ARR_LEN(path->path);
3885 ascend_from_subtype(path);
3886 advance_current_object(path);
3888 path->invalid = true;
3893 static ir_initializer_t *create_ir_initializer_value(
3894 const initializer_value_t *initializer)
3896 if (is_type_compound(initializer->value->base.type)) {
3897 panic("initializer creation for compounds not implemented yet");
3899 type_t *type = initializer->value->base.type;
3900 expression_t *expr = initializer->value;
3901 ir_node *value = expression_to_firm(expr);
3902 ir_mode *mode = get_ir_mode_storage(type);
3903 value = create_conv(NULL, value, mode);
3904 return create_initializer_const(value);
3907 /** test wether type can be initialized by a string constant */
3908 static bool is_string_type(type_t *type)
3911 if (is_type_pointer(type)) {
3912 inner = skip_typeref(type->pointer.points_to);
3913 } else if(is_type_array(type)) {
3914 inner = skip_typeref(type->array.element_type);
3919 return is_type_integer(inner);
3922 static ir_initializer_t *create_ir_initializer_list(
3923 const initializer_list_t *initializer, type_t *type)
3926 memset(&path, 0, sizeof(path));
3927 path.top_type = type;
3928 path.path = NEW_ARR_F(type_path_entry_t, 0);
3930 descend_into_subtype(&path);
3932 for (size_t i = 0; i < initializer->len; ++i) {
3933 const initializer_t *sub_initializer = initializer->initializers[i];
3935 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3936 walk_designator(&path, sub_initializer->designator.designator);
3940 if (sub_initializer->kind == INITIALIZER_VALUE) {
3941 /* we might have to descend into types until we're at a scalar
3944 type_t *orig_top_type = path.top_type;
3945 type_t *top_type = skip_typeref(orig_top_type);
3947 if (is_type_scalar(top_type))
3949 descend_into_subtype(&path);
3951 } else if (sub_initializer->kind == INITIALIZER_STRING
3952 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3953 /* we might have to descend into types until we're at a scalar
3956 type_t *orig_top_type = path.top_type;
3957 type_t *top_type = skip_typeref(orig_top_type);
3959 if (is_string_type(top_type))
3961 descend_into_subtype(&path);
3965 ir_initializer_t *sub_irinitializer
3966 = create_ir_initializer(sub_initializer, path.top_type);
3968 size_t path_len = ARR_LEN(path.path);
3969 assert(path_len >= 1);
3970 type_path_entry_t *entry = & path.path[path_len-1];
3971 ir_initializer_t *tinitializer = entry->initializer;
3972 set_initializer_compound_value(tinitializer, entry->index,
3975 advance_current_object(&path);
3978 assert(ARR_LEN(path.path) >= 1);
3979 ir_initializer_t *result = path.path[0].initializer;
3980 DEL_ARR_F(path.path);
3985 static ir_initializer_t *create_ir_initializer_string(
3986 const initializer_string_t *initializer, type_t *type)
3988 type = skip_typeref(type);
3990 size_t string_len = initializer->string.size;
3991 assert(type->kind == TYPE_ARRAY);
3992 assert(type->array.size_constant);
3993 size_t len = type->array.size;
3994 ir_initializer_t *irinitializer = create_initializer_compound(len);
3996 const char *string = initializer->string.begin;
3997 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
3999 for (size_t i = 0; i < len; ++i) {
4004 ir_tarval *tv = new_tarval_from_long(c, mode);
4005 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4007 set_initializer_compound_value(irinitializer, i, char_initializer);
4010 return irinitializer;
4013 static ir_initializer_t *create_ir_initializer_wide_string(
4014 const initializer_wide_string_t *initializer, type_t *type)
4016 assert(type->kind == TYPE_ARRAY);
4017 assert(type->array.size_constant);
4018 size_t len = type->array.size;
4019 size_t string_len = wstrlen(&initializer->string);
4020 ir_initializer_t *irinitializer = create_initializer_compound(len);
4022 const char *p = initializer->string.begin;
4023 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4025 for (size_t i = 0; i < len; ++i) {
4027 if (i < string_len) {
4028 c = read_utf8_char(&p);
4030 ir_tarval *tv = new_tarval_from_long(c, mode);
4031 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4033 set_initializer_compound_value(irinitializer, i, char_initializer);
4036 return irinitializer;
4039 static ir_initializer_t *create_ir_initializer(
4040 const initializer_t *initializer, type_t *type)
4042 switch(initializer->kind) {
4043 case INITIALIZER_STRING:
4044 return create_ir_initializer_string(&initializer->string, type);
4046 case INITIALIZER_WIDE_STRING:
4047 return create_ir_initializer_wide_string(&initializer->wide_string,
4050 case INITIALIZER_LIST:
4051 return create_ir_initializer_list(&initializer->list, type);
4053 case INITIALIZER_VALUE:
4054 return create_ir_initializer_value(&initializer->value);
4056 case INITIALIZER_DESIGNATOR:
4057 panic("unexpected designator initializer found");
4059 panic("unknown initializer");
4062 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4063 * are elements [...] the remainder of the aggregate shall be initialized
4064 * implicitly the same as objects that have static storage duration. */
4065 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4068 /* for unions we must NOT do anything for null initializers */
4069 ir_type *owner = get_entity_owner(entity);
4070 if (is_Union_type(owner)) {
4074 ir_type *ent_type = get_entity_type(entity);
4075 /* create sub-initializers for a compound type */
4076 if (is_compound_type(ent_type)) {
4077 unsigned n_members = get_compound_n_members(ent_type);
4078 for (unsigned n = 0; n < n_members; ++n) {
4079 ir_entity *member = get_compound_member(ent_type, n);
4080 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4082 create_dynamic_null_initializer(member, dbgi, addr);
4086 if (is_Array_type(ent_type)) {
4087 assert(has_array_upper_bound(ent_type, 0));
4088 long n = get_array_upper_bound_int(ent_type, 0);
4089 for (long i = 0; i < n; ++i) {
4090 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4091 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4092 ir_node *cnst = new_d_Const(dbgi, index_tv);
4093 ir_node *in[1] = { cnst };
4094 ir_entity *arrent = get_array_element_entity(ent_type);
4095 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4097 create_dynamic_null_initializer(arrent, dbgi, addr);
4102 ir_mode *value_mode = get_type_mode(ent_type);
4103 ir_node *node = new_Const(get_mode_null(value_mode));
4105 /* is it a bitfield type? */
4106 if (is_Primitive_type(ent_type) &&
4107 get_primitive_base_type(ent_type) != NULL) {
4108 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4112 ir_node *mem = get_store();
4113 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4114 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4118 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4119 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4121 switch(get_initializer_kind(initializer)) {
4122 case IR_INITIALIZER_NULL:
4123 create_dynamic_null_initializer(entity, dbgi, base_addr);
4125 case IR_INITIALIZER_CONST: {
4126 ir_node *node = get_initializer_const_value(initializer);
4127 ir_type *ent_type = get_entity_type(entity);
4129 /* is it a bitfield type? */
4130 if (is_Primitive_type(ent_type) &&
4131 get_primitive_base_type(ent_type) != NULL) {
4132 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4136 assert(get_type_mode(type) == get_irn_mode(node));
4137 ir_node *mem = get_store();
4138 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4139 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4143 case IR_INITIALIZER_TARVAL: {
4144 ir_tarval *tv = get_initializer_tarval_value(initializer);
4145 ir_node *cnst = new_d_Const(dbgi, tv);
4146 ir_type *ent_type = get_entity_type(entity);
4148 /* is it a bitfield type? */
4149 if (is_Primitive_type(ent_type) &&
4150 get_primitive_base_type(ent_type) != NULL) {
4151 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4155 assert(get_type_mode(type) == get_tarval_mode(tv));
4156 ir_node *mem = get_store();
4157 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4158 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4162 case IR_INITIALIZER_COMPOUND: {
4163 assert(is_compound_type(type) || is_Array_type(type));
4165 if (is_Array_type(type)) {
4166 assert(has_array_upper_bound(type, 0));
4167 n_members = get_array_upper_bound_int(type, 0);
4169 n_members = get_compound_n_members(type);
4172 if (get_initializer_compound_n_entries(initializer)
4173 != (unsigned) n_members)
4174 panic("initializer doesn't match compound type");
4176 for (int i = 0; i < n_members; ++i) {
4179 ir_entity *sub_entity;
4180 if (is_Array_type(type)) {
4181 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4182 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4183 ir_node *cnst = new_d_Const(dbgi, index_tv);
4184 ir_node *in[1] = { cnst };
4185 irtype = get_array_element_type(type);
4186 sub_entity = get_array_element_entity(type);
4187 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4190 sub_entity = get_compound_member(type, i);
4191 irtype = get_entity_type(sub_entity);
4192 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4196 ir_initializer_t *sub_init
4197 = get_initializer_compound_value(initializer, i);
4199 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4206 panic("invalid IR_INITIALIZER found");
4209 static void create_dynamic_initializer(ir_initializer_t *initializer,
4210 dbg_info *dbgi, ir_entity *entity)
4212 ir_node *frame = get_irg_frame(current_ir_graph);
4213 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4214 ir_type *type = get_entity_type(entity);
4216 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4219 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4220 ir_entity *entity, type_t *type)
4222 ir_node *memory = get_store();
4223 ir_node *nomem = new_NoMem();
4224 ir_node *frame = get_irg_frame(current_ir_graph);
4225 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4227 if (initializer->kind == INITIALIZER_VALUE) {
4228 initializer_value_t *initializer_value = &initializer->value;
4230 ir_node *value = expression_to_firm(initializer_value->value);
4231 type = skip_typeref(type);
4232 assign_value(dbgi, addr, type, value);
4236 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4237 ir_initializer_t *irinitializer
4238 = create_ir_initializer(initializer, type);
4240 create_dynamic_initializer(irinitializer, dbgi, entity);
4244 /* create a "template" entity which is copied to the entity on the stack */
4245 ir_entity *const init_entity
4246 = create_initializer_entity(dbgi, initializer, type);
4247 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4248 ir_type *const irtype = get_ir_type(type);
4249 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4251 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4252 set_store(copyb_mem);
4255 static void create_initializer_local_variable_entity(entity_t *entity)
4257 assert(entity->kind == ENTITY_VARIABLE);
4258 initializer_t *initializer = entity->variable.initializer;
4259 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4260 ir_entity *irentity = entity->variable.v.entity;
4261 type_t *type = entity->declaration.type;
4263 create_local_initializer(initializer, dbgi, irentity, type);
4266 static void create_variable_initializer(entity_t *entity)
4268 assert(entity->kind == ENTITY_VARIABLE);
4269 initializer_t *initializer = entity->variable.initializer;
4270 if (initializer == NULL)
4273 declaration_kind_t declaration_kind
4274 = (declaration_kind_t) entity->declaration.kind;
4275 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4276 create_initializer_local_variable_entity(entity);
4280 type_t *type = entity->declaration.type;
4281 type_qualifiers_t tq = get_type_qualifier(type, true);
4283 if (initializer->kind == INITIALIZER_VALUE) {
4284 expression_t * value = initializer->value.value;
4285 type_t *const init_type = skip_typeref(value->base.type);
4287 if (!is_type_scalar(init_type)) {
4289 while (value->kind == EXPR_UNARY_CAST)
4290 value = value->unary.value;
4292 if (value->kind != EXPR_COMPOUND_LITERAL)
4293 panic("expected non-scalar initializer to be a compound literal");
4294 initializer = value->compound_literal.initializer;
4295 goto have_initializer;
4298 ir_node * node = expression_to_firm(value);
4299 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4300 ir_mode *const mode = get_ir_mode_storage(init_type);
4301 node = create_conv(dbgi, node, mode);
4302 node = do_strict_conv(dbgi, node);
4304 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4305 set_value(entity->variable.v.value_number, node);
4307 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4309 ir_entity *irentity = entity->variable.v.entity;
4311 if (tq & TYPE_QUALIFIER_CONST
4312 && get_entity_owner(irentity) != get_tls_type()) {
4313 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4315 set_atomic_ent_value(irentity, node);
4319 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4320 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4322 ir_entity *irentity = entity->variable.v.entity;
4323 ir_initializer_t *irinitializer
4324 = create_ir_initializer(initializer, type);
4326 if (tq & TYPE_QUALIFIER_CONST) {
4327 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4329 set_entity_initializer(irentity, irinitializer);
4333 static void create_variable_length_array(entity_t *entity)
4335 assert(entity->kind == ENTITY_VARIABLE);
4336 assert(entity->variable.initializer == NULL);
4338 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4339 entity->variable.v.vla_base = NULL;
4341 /* TODO: record VLA somewhere so we create the free node when we leave
4345 static void allocate_variable_length_array(entity_t *entity)
4347 assert(entity->kind == ENTITY_VARIABLE);
4348 assert(entity->variable.initializer == NULL);
4349 assert(currently_reachable());
4351 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4352 type_t *type = entity->declaration.type;
4353 ir_type *el_type = get_ir_type(type->array.element_type);
4355 /* make sure size_node is calculated */
4356 get_type_size_node(type);
4357 ir_node *elems = type->array.size_node;
4358 ir_node *mem = get_store();
4359 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4361 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4362 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4365 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4366 entity->variable.v.vla_base = addr;
4370 * Creates a Firm local variable from a declaration.
4372 static void create_local_variable(entity_t *entity)
4374 assert(entity->kind == ENTITY_VARIABLE);
4375 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4377 bool needs_entity = entity->variable.address_taken;
4378 type_t *type = skip_typeref(entity->declaration.type);
4380 /* is it a variable length array? */
4381 if (is_type_array(type) && !type->array.size_constant) {
4382 create_variable_length_array(entity);
4384 } else if (is_type_array(type) || is_type_compound(type)) {
4385 needs_entity = true;
4386 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4387 needs_entity = true;
4391 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4392 create_variable_entity(entity,
4393 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4396 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4397 entity->variable.v.value_number = next_value_number_function;
4398 set_irg_loc_description(current_ir_graph, next_value_number_function,
4400 ++next_value_number_function;
4404 static void create_local_static_variable(entity_t *entity)
4406 assert(entity->kind == ENTITY_VARIABLE);
4407 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4409 type_t *type = skip_typeref(entity->declaration.type);
4410 ir_type *const var_type = entity->variable.thread_local ?
4411 get_tls_type() : get_glob_type();
4412 ir_type *const irtype = get_ir_type(type);
4413 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4415 size_t l = strlen(entity->base.symbol->string);
4416 char buf[l + sizeof(".%u")];
4417 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4418 ident *const id = id_unique(buf);
4419 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4421 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4422 set_entity_volatility(irentity, volatility_is_volatile);
4425 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4426 entity->variable.v.entity = irentity;
4428 set_entity_ld_ident(irentity, id);
4429 set_entity_visibility(irentity, ir_visibility_local);
4431 if (entity->variable.initializer == NULL) {
4432 ir_initializer_t *null_init = get_initializer_null();
4433 set_entity_initializer(irentity, null_init);
4436 ir_graph *const old_current_ir_graph = current_ir_graph;
4437 current_ir_graph = get_const_code_irg();
4439 create_variable_initializer(entity);
4441 assert(current_ir_graph == get_const_code_irg());
4442 current_ir_graph = old_current_ir_graph;
4447 static ir_node *return_statement_to_firm(return_statement_t *statement)
4449 if (!currently_reachable())
4452 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4453 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4454 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4457 if (!is_type_void(type)) {
4458 ir_mode *const mode = get_ir_mode_storage(type);
4460 res = create_conv(dbgi, res, mode);
4461 res = do_strict_conv(dbgi, res);
4463 res = new_Unknown(mode);
4470 ir_node *const in[1] = { res };
4471 ir_node *const store = get_store();
4472 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4474 ir_node *end_block = get_irg_end_block(current_ir_graph);
4475 add_immBlock_pred(end_block, ret);
4477 set_unreachable_now();
4481 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4483 if (!currently_reachable())
4486 return expression_to_firm(statement->expression);
4489 static void create_local_declarations(entity_t*);
4491 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4493 create_local_declarations(compound->scope.entities);
4495 ir_node *result = NULL;
4496 statement_t *statement = compound->statements;
4497 for ( ; statement != NULL; statement = statement->base.next) {
4498 result = statement_to_firm(statement);
4504 static void create_global_variable(entity_t *entity)
4506 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4507 ir_visibility visibility = ir_visibility_external;
4508 storage_class_tag_t storage
4509 = (storage_class_tag_t)entity->declaration.storage_class;
4510 decl_modifiers_t modifiers = entity->declaration.modifiers;
4511 assert(entity->kind == ENTITY_VARIABLE);
4514 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4515 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4516 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
4517 case STORAGE_CLASS_TYPEDEF:
4518 case STORAGE_CLASS_AUTO:
4519 case STORAGE_CLASS_REGISTER:
4520 panic("invalid storage class for global var");
4523 /* "common" symbols */
4524 if (storage == STORAGE_CLASS_NONE
4525 && entity->variable.initializer == NULL
4526 && !entity->variable.thread_local
4527 && (modifiers & DM_WEAK) == 0) {
4528 linkage |= IR_LINKAGE_MERGE;
4531 ir_type *var_type = get_glob_type();
4532 if (entity->variable.thread_local) {
4533 var_type = get_tls_type();
4535 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4536 ir_entity *irentity = entity->variable.v.entity;
4537 add_entity_linkage(irentity, linkage);
4538 set_entity_visibility(irentity, visibility);
4539 if (entity->variable.initializer == NULL
4540 && storage != STORAGE_CLASS_EXTERN) {
4541 ir_initializer_t *null_init = get_initializer_null();
4542 set_entity_initializer(irentity, null_init);
4546 static void create_local_declaration(entity_t *entity)
4548 assert(is_declaration(entity));
4550 /* construct type */
4551 (void) get_ir_type(entity->declaration.type);
4552 if (entity->base.symbol == NULL) {
4556 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4557 case STORAGE_CLASS_STATIC:
4558 if (entity->kind == ENTITY_FUNCTION) {
4559 (void)get_function_entity(entity, NULL);
4561 create_local_static_variable(entity);
4564 case STORAGE_CLASS_EXTERN:
4565 if (entity->kind == ENTITY_FUNCTION) {
4566 assert(entity->function.statement == NULL);
4567 (void)get_function_entity(entity, NULL);
4569 create_global_variable(entity);
4570 create_variable_initializer(entity);
4573 case STORAGE_CLASS_NONE:
4574 case STORAGE_CLASS_AUTO:
4575 case STORAGE_CLASS_REGISTER:
4576 if (entity->kind == ENTITY_FUNCTION) {
4577 if (entity->function.statement != NULL) {
4578 ir_type *owner = get_irg_frame_type(current_ir_graph);
4579 (void)get_function_entity(entity, owner);
4580 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4581 enqueue_inner_function(entity);
4583 (void)get_function_entity(entity, NULL);
4586 create_local_variable(entity);
4589 case STORAGE_CLASS_TYPEDEF:
4592 panic("invalid storage class found");
4595 static void create_local_declarations(entity_t *e)
4597 for (; e; e = e->base.next) {
4598 if (is_declaration(e))
4599 create_local_declaration(e);
4603 static void initialize_local_declaration(entity_t *entity)
4605 if (entity->base.symbol == NULL)
4608 // no need to emit code in dead blocks
4609 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4610 && !currently_reachable())
4613 switch ((declaration_kind_t) entity->declaration.kind) {
4614 case DECLARATION_KIND_LOCAL_VARIABLE:
4615 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4616 create_variable_initializer(entity);
4619 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4620 allocate_variable_length_array(entity);
4623 case DECLARATION_KIND_COMPOUND_MEMBER:
4624 case DECLARATION_KIND_GLOBAL_VARIABLE:
4625 case DECLARATION_KIND_FUNCTION:
4626 case DECLARATION_KIND_INNER_FUNCTION:
4629 case DECLARATION_KIND_PARAMETER:
4630 case DECLARATION_KIND_PARAMETER_ENTITY:
4631 panic("can't initialize parameters");
4633 case DECLARATION_KIND_UNKNOWN:
4634 panic("can't initialize unknown declaration");
4636 panic("invalid declaration kind");
4639 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4641 entity_t *entity = statement->declarations_begin;
4645 entity_t *const last = statement->declarations_end;
4646 for ( ;; entity = entity->base.next) {
4647 if (is_declaration(entity)) {
4648 initialize_local_declaration(entity);
4649 } else if (entity->kind == ENTITY_TYPEDEF) {
4650 /* ยง6.7.7:3 Any array size expressions associated with variable length
4651 * array declarators are evaluated each time the declaration of the
4652 * typedef name is reached in the order of execution. */
4653 type_t *const type = skip_typeref(entity->typedefe.type);
4654 if (is_type_array(type) && type->array.is_vla)
4655 get_vla_size(&type->array);
4664 static ir_node *if_statement_to_firm(if_statement_t *statement)
4666 create_local_declarations(statement->scope.entities);
4668 /* Create the condition. */
4669 ir_node *true_block = NULL;
4670 ir_node *false_block = NULL;
4671 if (currently_reachable()) {
4672 true_block = new_immBlock();
4673 false_block = new_immBlock();
4674 create_condition_evaluation(statement->condition, true_block, false_block);
4675 mature_immBlock(true_block);
4676 mature_immBlock(false_block);
4679 /* Create the true statement. */
4680 set_cur_block(true_block);
4681 statement_to_firm(statement->true_statement);
4682 ir_node *fallthrough_block = get_cur_block();
4684 /* Create the false statement. */
4685 set_cur_block(false_block);
4686 if (statement->false_statement != NULL) {
4687 statement_to_firm(statement->false_statement);
4690 /* Handle the block after the if-statement. Minor simplification and
4691 * optimisation: Reuse the false/true block as fallthrough block, if the
4692 * true/false statement does not pass control to the fallthrough block, e.g.
4693 * in the typical if (x) return; pattern. */
4694 if (fallthrough_block) {
4695 if (currently_reachable()) {
4696 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4697 ir_node *const f_jump = new_Jmp();
4698 ir_node *const in[] = { t_jump, f_jump };
4699 fallthrough_block = new_Block(2, in);
4701 set_cur_block(fallthrough_block);
4708 * Add an unconditional jump to the target block. If the source block is not
4709 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4710 * loops. This is necessary if the jump potentially enters a loop.
4712 static void jump_to(ir_node *const target_block)
4714 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4715 add_immBlock_pred(target_block, pred);
4719 * Add an unconditional jump to the target block, if the current block is
4720 * reachable and do nothing otherwise. This is only valid if the jump does not
4721 * enter a loop (a back edge is ok).
4723 static void jump_if_reachable(ir_node *const target_block)
4725 if (currently_reachable())
4726 add_immBlock_pred(target_block, new_Jmp());
4729 static ir_node *while_statement_to_firm(while_statement_t *statement)
4731 create_local_declarations(statement->scope.entities);
4733 /* Create the header block */
4734 ir_node *const header_block = new_immBlock();
4735 jump_to(header_block);
4737 /* Create the condition. */
4738 ir_node * body_block;
4739 ir_node * false_block;
4740 expression_t *const cond = statement->condition;
4741 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4742 fold_constant_to_bool(cond)) {
4743 /* Shortcut for while (true). */
4744 body_block = header_block;
4747 keep_alive(header_block);
4748 keep_all_memory(header_block);
4750 body_block = new_immBlock();
4751 false_block = new_immBlock();
4753 set_cur_block(header_block);
4754 create_condition_evaluation(cond, body_block, false_block);
4755 mature_immBlock(body_block);
4758 ir_node *const old_continue_label = continue_label;
4759 ir_node *const old_break_label = break_label;
4760 continue_label = header_block;
4761 break_label = false_block;
4763 /* Create the loop body. */
4764 set_cur_block(body_block);
4765 statement_to_firm(statement->body);
4766 jump_if_reachable(header_block);
4768 mature_immBlock(header_block);
4769 assert(false_block == NULL || false_block == break_label);
4770 false_block = break_label;
4771 if (false_block != NULL) {
4772 mature_immBlock(false_block);
4774 set_cur_block(false_block);
4776 assert(continue_label == header_block);
4777 continue_label = old_continue_label;
4778 break_label = old_break_label;
4782 static ir_node *get_break_label(void)
4784 if (break_label == NULL) {
4785 break_label = new_immBlock();
4790 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4792 create_local_declarations(statement->scope.entities);
4794 /* create the header block */
4795 ir_node *header_block = new_immBlock();
4798 ir_node *body_block = new_immBlock();
4799 jump_to(body_block);
4801 ir_node *old_continue_label = continue_label;
4802 ir_node *old_break_label = break_label;
4803 continue_label = header_block;
4806 set_cur_block(body_block);
4807 statement_to_firm(statement->body);
4808 ir_node *const false_block = get_break_label();
4810 assert(continue_label == header_block);
4811 continue_label = old_continue_label;
4812 break_label = old_break_label;
4814 jump_if_reachable(header_block);
4816 /* create the condition */
4817 mature_immBlock(header_block);
4818 set_cur_block(header_block);
4820 create_condition_evaluation(statement->condition, body_block, false_block);
4821 mature_immBlock(body_block);
4822 mature_immBlock(false_block);
4824 set_cur_block(false_block);
4828 static ir_node *for_statement_to_firm(for_statement_t *statement)
4830 create_local_declarations(statement->scope.entities);
4832 if (currently_reachable()) {
4833 entity_t *entity = statement->scope.entities;
4834 for ( ; entity != NULL; entity = entity->base.next) {
4835 if (!is_declaration(entity))
4838 initialize_local_declaration(entity);
4841 if (statement->initialisation != NULL) {
4842 expression_to_firm(statement->initialisation);
4846 /* Create the header block */
4847 ir_node *const header_block = new_immBlock();
4848 jump_to(header_block);
4850 /* Create the condition. */
4851 ir_node *body_block;
4852 ir_node *false_block;
4853 if (statement->condition != NULL) {
4854 body_block = new_immBlock();
4855 false_block = new_immBlock();
4857 set_cur_block(header_block);
4858 create_condition_evaluation(statement->condition, body_block, false_block);
4859 mature_immBlock(body_block);
4862 body_block = header_block;
4865 keep_alive(header_block);
4866 keep_all_memory(header_block);
4869 /* Create the step block, if necessary. */
4870 ir_node * step_block = header_block;
4871 expression_t *const step = statement->step;
4873 step_block = new_immBlock();
4876 ir_node *const old_continue_label = continue_label;
4877 ir_node *const old_break_label = break_label;
4878 continue_label = step_block;
4879 break_label = false_block;
4881 /* Create the loop body. */
4882 set_cur_block(body_block);
4883 statement_to_firm(statement->body);
4884 jump_if_reachable(step_block);
4886 /* Create the step code. */
4888 mature_immBlock(step_block);
4889 set_cur_block(step_block);
4890 expression_to_firm(step);
4891 jump_if_reachable(header_block);
4894 mature_immBlock(header_block);
4895 assert(false_block == NULL || false_block == break_label);
4896 false_block = break_label;
4897 if (false_block != NULL) {
4898 mature_immBlock(false_block);
4900 set_cur_block(false_block);
4902 assert(continue_label == step_block);
4903 continue_label = old_continue_label;
4904 break_label = old_break_label;
4908 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4910 if (!currently_reachable())
4913 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4914 ir_node *jump = new_d_Jmp(dbgi);
4915 add_immBlock_pred(target_block, jump);
4917 set_unreachable_now();
4921 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4923 /* determine number of cases */
4925 for (case_label_statement_t *l = statement->first_case; l != NULL;
4928 if (l->expression == NULL)
4930 if (l->is_empty_range)
4935 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4937 for (case_label_statement_t *l = statement->first_case; l != NULL;
4939 if (l->expression == NULL) {
4940 l->pn = pn_Switch_default;
4943 if (l->is_empty_range)
4945 ir_tarval *min = fold_constant_to_tarval(l->expression);
4946 ir_tarval *max = min;
4947 long pn = (long) i+1;
4948 if (l->end_range != NULL)
4949 max = fold_constant_to_tarval(l->end_range);
4950 ir_switch_table_set(res, i++, min, max, pn);
4956 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4958 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4959 ir_node *switch_node = NULL;
4961 if (currently_reachable()) {
4962 ir_node *expression = expression_to_firm(statement->expression);
4963 ir_switch_table *table = create_switch_table(statement);
4964 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4966 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4969 set_unreachable_now();
4971 ir_node *const old_switch = current_switch;
4972 ir_node *const old_break_label = break_label;
4973 const bool old_saw_default_label = saw_default_label;
4974 saw_default_label = false;
4975 current_switch = switch_node;
4978 statement_to_firm(statement->body);
4980 if (currently_reachable()) {
4981 add_immBlock_pred(get_break_label(), new_Jmp());
4984 if (!saw_default_label && switch_node) {
4985 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4986 add_immBlock_pred(get_break_label(), proj);
4989 if (break_label != NULL) {
4990 mature_immBlock(break_label);
4992 set_cur_block(break_label);
4994 assert(current_switch == switch_node);
4995 current_switch = old_switch;
4996 break_label = old_break_label;
4997 saw_default_label = old_saw_default_label;
5001 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
5003 if (statement->is_empty_range)
5006 if (current_switch != NULL) {
5007 ir_node *block = new_immBlock();
5008 /* Fallthrough from previous case */
5009 jump_if_reachable(block);
5011 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
5012 add_immBlock_pred(block, proj);
5013 if (statement->expression == NULL)
5014 saw_default_label = true;
5016 mature_immBlock(block);
5017 set_cur_block(block);
5020 return statement_to_firm(statement->statement);
5023 static ir_node *label_to_firm(const label_statement_t *statement)
5025 ir_node *block = get_label_block(statement->label);
5028 set_cur_block(block);
5030 keep_all_memory(block);
5032 return statement_to_firm(statement->statement);
5035 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
5037 if (!currently_reachable())
5040 ir_node *const irn = expression_to_firm(statement->expression);
5041 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5042 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
5044 set_irn_link(ijmp, ijmp_list);
5047 set_unreachable_now();
5051 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
5053 bool needs_memory = false;
5055 if (statement->is_volatile) {
5056 needs_memory = true;
5059 size_t n_clobbers = 0;
5060 asm_clobber_t *clobber = statement->clobbers;
5061 for ( ; clobber != NULL; clobber = clobber->next) {
5062 const char *clobber_str = clobber->clobber.begin;
5064 if (!be_is_valid_clobber(clobber_str)) {
5065 errorf(&statement->base.source_position,
5066 "invalid clobber '%s' specified", clobber->clobber);
5070 if (streq(clobber_str, "memory")) {
5071 needs_memory = true;
5075 ident *id = new_id_from_str(clobber_str);
5076 obstack_ptr_grow(&asm_obst, id);
5079 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5080 ident **clobbers = NULL;
5081 if (n_clobbers > 0) {
5082 clobbers = obstack_finish(&asm_obst);
5085 size_t n_inputs = 0;
5086 asm_argument_t *argument = statement->inputs;
5087 for ( ; argument != NULL; argument = argument->next)
5089 size_t n_outputs = 0;
5090 argument = statement->outputs;
5091 for ( ; argument != NULL; argument = argument->next)
5094 unsigned next_pos = 0;
5096 ir_node *ins[n_inputs + n_outputs + 1];
5099 ir_asm_constraint tmp_in_constraints[n_outputs];
5101 const expression_t *out_exprs[n_outputs];
5102 ir_node *out_addrs[n_outputs];
5103 size_t out_size = 0;
5105 argument = statement->outputs;
5106 for ( ; argument != NULL; argument = argument->next) {
5107 const char *constraints = argument->constraints.begin;
5108 asm_constraint_flags_t asm_flags
5109 = be_parse_asm_constraints(constraints);
5112 source_position_t const *const pos = &statement->base.source_position;
5113 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5114 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5116 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5117 errorf(pos, "some constraints in '%s' are invalid", constraints);
5120 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5121 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5126 unsigned pos = next_pos++;
5127 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5128 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5129 expression_t *expr = argument->expression;
5130 ir_node *addr = expression_to_addr(expr);
5131 /* in+output, construct an artifical same_as constraint on the
5133 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5135 ir_node *value = get_value_from_lvalue(expr, addr);
5137 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5139 ir_asm_constraint constraint;
5140 constraint.pos = pos;
5141 constraint.constraint = new_id_from_str(buf);
5142 constraint.mode = get_ir_mode_storage(expr->base.type);
5143 tmp_in_constraints[in_size] = constraint;
5144 ins[in_size] = value;
5149 out_exprs[out_size] = expr;
5150 out_addrs[out_size] = addr;
5152 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5153 /* pure memory ops need no input (but we have to make sure we
5154 * attach to the memory) */
5155 assert(! (asm_flags &
5156 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5157 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5158 needs_memory = true;
5160 /* we need to attach the address to the inputs */
5161 expression_t *expr = argument->expression;
5163 ir_asm_constraint constraint;
5164 constraint.pos = pos;
5165 constraint.constraint = new_id_from_str(constraints);
5166 constraint.mode = mode_M;
5167 tmp_in_constraints[in_size] = constraint;
5169 ins[in_size] = expression_to_addr(expr);
5173 errorf(&statement->base.source_position,
5174 "only modifiers but no place set in constraints '%s'",
5179 ir_asm_constraint constraint;
5180 constraint.pos = pos;
5181 constraint.constraint = new_id_from_str(constraints);
5182 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5184 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5186 assert(obstack_object_size(&asm_obst)
5187 == out_size * sizeof(ir_asm_constraint));
5188 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5191 obstack_grow(&asm_obst, tmp_in_constraints,
5192 in_size * sizeof(tmp_in_constraints[0]));
5193 /* find and count input and output arguments */
5194 argument = statement->inputs;
5195 for ( ; argument != NULL; argument = argument->next) {
5196 const char *constraints = argument->constraints.begin;
5197 asm_constraint_flags_t asm_flags
5198 = be_parse_asm_constraints(constraints);
5200 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5201 errorf(&statement->base.source_position,
5202 "some constraints in '%s' are not supported", constraints);
5205 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5206 errorf(&statement->base.source_position,
5207 "some constraints in '%s' are invalid", constraints);
5210 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5211 errorf(&statement->base.source_position,
5212 "write flag specified for input constraints '%s'",
5218 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5219 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5220 /* we can treat this as "normal" input */
5221 input = expression_to_firm(argument->expression);
5222 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5223 /* pure memory ops need no input (but we have to make sure we
5224 * attach to the memory) */
5225 assert(! (asm_flags &
5226 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5227 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5228 needs_memory = true;
5229 input = expression_to_addr(argument->expression);
5231 errorf(&statement->base.source_position,
5232 "only modifiers but no place set in constraints '%s'",
5237 ir_asm_constraint constraint;
5238 constraint.pos = next_pos++;
5239 constraint.constraint = new_id_from_str(constraints);
5240 constraint.mode = get_irn_mode(input);
5242 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5243 ins[in_size++] = input;
5247 ir_asm_constraint constraint;
5248 constraint.pos = next_pos++;
5249 constraint.constraint = new_id_from_str("");
5250 constraint.mode = mode_M;
5252 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5253 ins[in_size++] = get_store();
5256 assert(obstack_object_size(&asm_obst)
5257 == in_size * sizeof(ir_asm_constraint));
5258 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5260 /* create asm node */
5261 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5263 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5265 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5266 out_size, output_constraints,
5267 n_clobbers, clobbers, asm_text);
5269 if (statement->is_volatile) {
5270 set_irn_pinned(node, op_pin_state_pinned);
5272 set_irn_pinned(node, op_pin_state_floats);
5275 /* create output projs & connect them */
5277 ir_node *projm = new_Proj(node, mode_M, out_size);
5282 for (i = 0; i < out_size; ++i) {
5283 const expression_t *out_expr = out_exprs[i];
5285 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5286 ir_node *proj = new_Proj(node, mode, pn);
5287 ir_node *addr = out_addrs[i];
5289 set_value_for_expression_addr(out_expr, proj, addr);
5295 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5297 statement_to_firm(statement->try_statement);
5298 source_position_t const *const pos = &statement->base.source_position;
5299 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5303 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5305 errorf(&statement->base.source_position, "__leave not supported yet");
5310 * Transform a statement.
5312 static ir_node *statement_to_firm(statement_t *const stmt)
5315 assert(!stmt->base.transformed);
5316 stmt->base.transformed = true;
5319 switch (stmt->kind) {
5320 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5321 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5322 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5323 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5324 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5325 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5326 case STATEMENT_EMPTY: return NULL; /* nothing */
5327 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5328 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5329 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5330 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5331 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5332 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5333 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5334 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5335 case STATEMENT_WHILE: return while_statement_to_firm( &stmt->whiles);
5337 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5338 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5339 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5341 case STATEMENT_ERROR: panic("error statement found");
5343 panic("statement not implemented");
5346 static int count_local_variables(const entity_t *entity,
5347 const entity_t *const last)
5350 entity_t const *const end = last != NULL ? last->base.next : NULL;
5351 for (; entity != end; entity = entity->base.next) {
5355 if (entity->kind == ENTITY_VARIABLE) {
5356 type = skip_typeref(entity->declaration.type);
5357 address_taken = entity->variable.address_taken;
5358 } else if (entity->kind == ENTITY_PARAMETER) {
5359 type = skip_typeref(entity->declaration.type);
5360 address_taken = entity->parameter.address_taken;
5365 if (!address_taken && is_type_scalar(type))
5371 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5373 int *const count = env;
5375 switch (stmt->kind) {
5376 case STATEMENT_DECLARATION: {
5377 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5378 *count += count_local_variables(decl_stmt->declarations_begin,
5379 decl_stmt->declarations_end);
5384 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5393 * Return the number of local (alias free) variables used by a function.
5395 static int get_function_n_local_vars(entity_t *entity)
5397 const function_t *function = &entity->function;
5400 /* count parameters */
5401 count += count_local_variables(function->parameters.entities, NULL);
5403 /* count local variables declared in body */
5404 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5409 * Build Firm code for the parameters of a function.
5411 static void initialize_function_parameters(entity_t *entity)
5413 assert(entity->kind == ENTITY_FUNCTION);
5414 ir_graph *irg = current_ir_graph;
5415 ir_node *args = get_irg_args(irg);
5417 ir_type *function_irtype;
5419 if (entity->function.need_closure) {
5420 /* add an extra parameter for the static link */
5421 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5424 /* Matze: IMO this is wrong, nested functions should have an own
5425 * type and not rely on strange parameters... */
5426 function_irtype = create_method_type(&entity->declaration.type->function, true);
5428 function_irtype = get_ir_type(entity->declaration.type);
5433 entity_t *parameter = entity->function.parameters.entities;
5434 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5435 if (parameter->kind != ENTITY_PARAMETER)
5438 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5439 type_t *type = skip_typeref(parameter->declaration.type);
5441 bool needs_entity = parameter->parameter.address_taken;
5442 assert(!is_type_array(type));
5443 if (is_type_compound(type)) {
5444 needs_entity = true;
5447 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5449 ir_type *frame_type = get_irg_frame_type(irg);
5451 = new_parameter_entity(frame_type, n, param_irtype);
5452 parameter->declaration.kind
5453 = DECLARATION_KIND_PARAMETER_ENTITY;
5454 parameter->parameter.v.entity = param;
5458 ir_mode *param_mode = get_type_mode(param_irtype);
5460 ir_node *value = new_r_Proj(args, param_mode, pn);
5462 ir_mode *mode = get_ir_mode_storage(type);
5463 value = create_conv(NULL, value, mode);
5464 value = do_strict_conv(NULL, value);
5466 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5467 parameter->parameter.v.value_number = next_value_number_function;
5468 set_irg_loc_description(current_ir_graph, next_value_number_function,
5470 ++next_value_number_function;
5472 set_value(parameter->parameter.v.value_number, value);
5477 * Handle additional decl modifiers for IR-graphs
5479 * @param irg the IR-graph
5480 * @param dec_modifiers additional modifiers
5482 static void handle_decl_modifier_irg(ir_graph *irg,
5483 decl_modifiers_t decl_modifiers)
5485 if (decl_modifiers & DM_NAKED) {
5486 /* TRUE if the declaration includes the Microsoft
5487 __declspec(naked) specifier. */
5488 add_irg_additional_properties(irg, mtp_property_naked);
5490 if (decl_modifiers & DM_FORCEINLINE) {
5491 /* TRUE if the declaration includes the
5492 Microsoft __forceinline specifier. */
5493 set_irg_inline_property(irg, irg_inline_forced);
5495 if (decl_modifiers & DM_NOINLINE) {
5496 /* TRUE if the declaration includes the Microsoft
5497 __declspec(noinline) specifier. */
5498 set_irg_inline_property(irg, irg_inline_forbidden);
5502 static void add_function_pointer(ir_type *segment, ir_entity *method,
5503 const char *unique_template)
5505 ir_type *method_type = get_entity_type(method);
5506 ir_type *ptr_type = new_type_pointer(method_type);
5508 /* these entities don't really have a name but firm only allows
5510 * Note that we mustn't give these entities a name since for example
5511 * Mach-O doesn't allow them. */
5512 ident *ide = id_unique(unique_template);
5513 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5514 ir_graph *irg = get_const_code_irg();
5515 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5518 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5519 set_entity_compiler_generated(ptr, 1);
5520 set_entity_visibility(ptr, ir_visibility_private);
5521 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5522 set_atomic_ent_value(ptr, val);
5526 * Generate possible IJmp branches to a given label block.
5528 static void gen_ijmp_branches(ir_node *block)
5531 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5532 add_immBlock_pred(block, ijmp);
5537 * Create code for a function and all inner functions.
5539 * @param entity the function entity
5541 static void create_function(entity_t *entity)
5543 assert(entity->kind == ENTITY_FUNCTION);
5544 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5546 if (entity->function.statement == NULL)
5549 inner_functions = NULL;
5550 current_trampolines = NULL;
5552 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5553 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5554 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5556 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5557 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5558 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5561 current_function_entity = entity;
5562 current_function_name = NULL;
5563 current_funcsig = NULL;
5565 assert(all_labels == NULL);
5566 all_labels = NEW_ARR_F(label_t *, 0);
5569 int n_local_vars = get_function_n_local_vars(entity);
5570 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5571 current_ir_graph = irg;
5573 ir_graph *old_current_function = current_function;
5574 current_function = irg;
5576 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5577 current_vararg_entity = NULL;
5579 set_irg_fp_model(irg, firm_fp_model);
5580 tarval_enable_fp_ops(1);
5581 set_irn_dbg_info(get_irg_start_block(irg),
5582 get_entity_dbg_info(function_entity));
5584 /* set inline flags */
5585 if (entity->function.is_inline)
5586 set_irg_inline_property(irg, irg_inline_recomended);
5587 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5589 next_value_number_function = 0;
5590 initialize_function_parameters(entity);
5591 current_static_link = entity->function.static_link;
5593 statement_to_firm(entity->function.statement);
5595 ir_node *end_block = get_irg_end_block(irg);
5597 /* do we have a return statement yet? */
5598 if (currently_reachable()) {
5599 type_t *type = skip_typeref(entity->declaration.type);
5600 assert(is_type_function(type));
5601 type_t *const return_type = skip_typeref(type->function.return_type);
5604 if (is_type_void(return_type)) {
5605 ret = new_Return(get_store(), 0, NULL);
5607 ir_mode *const mode = get_ir_mode_storage(return_type);
5610 /* ยง5.1.2.2.3 main implicitly returns 0 */
5611 if (is_main(entity)) {
5612 in[0] = new_Const(get_mode_null(mode));
5614 in[0] = new_Unknown(mode);
5616 ret = new_Return(get_store(), 1, in);
5618 add_immBlock_pred(end_block, ret);
5621 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5622 label_t *label = all_labels[i];
5623 if (label->address_taken) {
5624 gen_ijmp_branches(label->block);
5626 mature_immBlock(label->block);
5629 DEL_ARR_F(all_labels);
5632 irg_finalize_cons(irg);
5634 /* finalize the frame type */
5635 ir_type *frame_type = get_irg_frame_type(irg);
5636 int n = get_compound_n_members(frame_type);
5639 for (int i = 0; i < n; ++i) {
5640 ir_entity *member = get_compound_member(frame_type, i);
5641 ir_type *entity_type = get_entity_type(member);
5643 int align = get_type_alignment_bytes(entity_type);
5644 if (align > align_all)
5648 misalign = offset % align;
5650 offset += align - misalign;
5654 set_entity_offset(member, offset);
5655 offset += get_type_size_bytes(entity_type);
5657 set_type_size_bytes(frame_type, offset);
5658 set_type_alignment_bytes(frame_type, align_all);
5660 irg_verify(irg, VERIFY_ENFORCE_SSA);
5661 current_vararg_entity = old_current_vararg_entity;
5662 current_function = old_current_function;
5664 if (current_trampolines != NULL) {
5665 DEL_ARR_F(current_trampolines);
5666 current_trampolines = NULL;
5669 /* create inner functions if any */
5670 entity_t **inner = inner_functions;
5671 if (inner != NULL) {
5672 ir_type *rem_outer_frame = current_outer_frame;
5673 current_outer_frame = get_irg_frame_type(current_ir_graph);
5674 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5675 create_function(inner[i]);
5679 current_outer_frame = rem_outer_frame;
5683 static void scope_to_firm(scope_t *scope)
5685 /* first pass: create declarations */
5686 entity_t *entity = scope->entities;
5687 for ( ; entity != NULL; entity = entity->base.next) {
5688 if (entity->base.symbol == NULL)
5691 if (entity->kind == ENTITY_FUNCTION) {
5692 if (entity->function.btk != BUILTIN_NONE) {
5693 /* builtins have no representation */
5696 (void)get_function_entity(entity, NULL);
5697 } else if (entity->kind == ENTITY_VARIABLE) {
5698 create_global_variable(entity);
5699 } else if (entity->kind == ENTITY_NAMESPACE) {
5700 scope_to_firm(&entity->namespacee.members);
5704 /* second pass: create code/initializers */
5705 entity = scope->entities;
5706 for ( ; entity != NULL; entity = entity->base.next) {
5707 if (entity->base.symbol == NULL)
5710 if (entity->kind == ENTITY_FUNCTION) {
5711 if (entity->function.btk != BUILTIN_NONE) {
5712 /* builtins have no representation */
5715 create_function(entity);
5716 } else if (entity->kind == ENTITY_VARIABLE) {
5717 assert(entity->declaration.kind
5718 == DECLARATION_KIND_GLOBAL_VARIABLE);
5719 current_ir_graph = get_const_code_irg();
5720 create_variable_initializer(entity);
5725 void init_ast2firm(void)
5727 obstack_init(&asm_obst);
5728 init_atomic_modes();
5730 ir_set_debug_retrieve(dbg_retrieve);
5731 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5733 /* create idents for all known runtime functions */
5734 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5735 rts_idents[i] = new_id_from_str(rts_data[i].name);
5738 entitymap_init(&entitymap);
5741 static void init_ir_types(void)
5743 static int ir_types_initialized = 0;
5744 if (ir_types_initialized)
5746 ir_types_initialized = 1;
5748 ir_type_char = get_ir_type(type_char);
5749 ir_type_const_char = get_ir_type(type_const_char);
5750 ir_type_wchar_t = get_ir_type(type_wchar_t);
5752 be_params = be_get_backend_param();
5753 mode_float_arithmetic = be_params->mode_float_arithmetic;
5755 stack_param_align = be_params->stack_param_align;
5758 void exit_ast2firm(void)
5760 entitymap_destroy(&entitymap);
5761 obstack_free(&asm_obst, NULL);
5764 static void global_asm_to_firm(statement_t *s)
5766 for (; s != NULL; s = s->base.next) {
5767 assert(s->kind == STATEMENT_ASM);
5769 char const *const text = s->asms.asm_text.begin;
5770 size_t size = s->asms.asm_text.size;
5772 /* skip the last \0 */
5773 if (text[size - 1] == '\0')
5776 ident *const id = new_id_from_chars(text, size);
5781 static const char *get_cwd(void)
5783 static char buf[1024];
5785 getcwd(buf, sizeof(buf));
5789 void translation_unit_to_firm(translation_unit_t *unit)
5791 if (c_mode & _CXX) {
5792 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5793 } else if (c_mode & _C99) {
5794 be_dwarf_set_source_language(DW_LANG_C99);
5795 } else if (c_mode & _C89) {
5796 be_dwarf_set_source_language(DW_LANG_C89);
5798 be_dwarf_set_source_language(DW_LANG_C);
5800 be_dwarf_set_compilation_directory(get_cwd());
5802 /* initialize firm arithmetic */
5803 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5804 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5806 /* just to be sure */
5807 continue_label = NULL;
5809 current_switch = NULL;
5810 current_translation_unit = unit;
5814 scope_to_firm(&unit->scope);
5815 global_asm_to_firm(unit->global_asm);
5817 current_ir_graph = NULL;
5818 current_translation_unit = NULL;