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);
178 static void create_local_declaration(entity_t *entity);
180 static unsigned decide_modulo_shift(unsigned type_size)
182 if (architecture_modulo_shift == 0)
184 if (type_size < architecture_modulo_shift)
185 return architecture_modulo_shift;
189 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
191 unsigned flags = get_atomic_type_flags(kind);
192 unsigned size = get_atomic_type_size(kind);
193 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
194 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
197 } else if (size == 8) {
200 panic("unexpected kind");
202 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
204 unsigned bit_size = size * 8;
205 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
206 unsigned modulo_shift = decide_modulo_shift(bit_size);
208 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
209 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
217 * Initialises the atomic modes depending on the machine size.
219 static void init_atomic_modes(void)
221 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
222 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
223 if (atomic_modes[i] != NULL)
225 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
229 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
231 assert(kind <= ATOMIC_TYPE_LAST);
232 return atomic_modes[kind];
235 static ir_node *get_vla_size(array_type_t *const type)
237 ir_node *size_node = type->size_node;
238 if (size_node == NULL) {
239 size_node = expression_to_firm(type->size_expression);
240 type->size_node = size_node;
245 static unsigned count_parameters(const function_type_t *function_type)
249 function_parameter_t *parameter = function_type->parameters;
250 for ( ; parameter != NULL; parameter = parameter->next) {
258 * Creates a Firm type for an atomic type
260 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
262 ir_mode *mode = atomic_modes[akind];
263 type_dbg_info *dbgi = get_type_dbg_info_(type);
264 ir_type *irtype = new_d_type_primitive(mode, dbgi);
265 il_alignment_t alignment = get_atomic_type_alignment(akind);
267 set_type_size_bytes(irtype, get_atomic_type_size(akind));
268 set_type_alignment_bytes(irtype, alignment);
274 * Creates a Firm type for a complex type
276 static ir_type *create_complex_type(const atomic_type_t *type)
278 atomic_type_kind_t kind = type->akind;
279 ir_mode *mode = atomic_modes[kind];
280 ident *id = get_mode_ident(mode);
284 /* FIXME: finish the array */
289 * Creates a Firm type for an imaginary type
291 static ir_type *create_imaginary_type(const atomic_type_t *type)
293 return create_atomic_type(type->akind, (const type_t*)type);
297 * return type of a parameter (and take transparent union gnu extension into
300 static type_t *get_parameter_type(type_t *orig_type)
302 type_t *type = skip_typeref(orig_type);
303 if (is_type_union(type)
304 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
305 compound_t *compound = type->compound.compound;
306 type = compound->members.entities->declaration.type;
312 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
314 type_t *return_type = skip_typeref(function_type->return_type);
316 int n_parameters = count_parameters(function_type)
317 + (for_closure ? 1 : 0);
318 int n_results = is_type_void(return_type) ? 0 : 1;
319 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
320 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
322 if (!is_type_void(return_type)) {
323 ir_type *restype = get_ir_type(return_type);
324 set_method_res_type(irtype, 0, restype);
327 function_parameter_t *parameter = function_type->parameters;
330 ir_type *p_irtype = get_ir_type(type_void_ptr);
331 set_method_param_type(irtype, n, p_irtype);
334 for ( ; parameter != NULL; parameter = parameter->next) {
335 type_t *type = get_parameter_type(parameter->type);
336 ir_type *p_irtype = get_ir_type(type);
337 set_method_param_type(irtype, n, p_irtype);
341 bool is_variadic = function_type->variadic;
344 set_method_variadicity(irtype, variadicity_variadic);
346 unsigned cc = get_method_calling_convention(irtype);
347 switch (function_type->calling_convention) {
348 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
351 set_method_calling_convention(irtype, SET_CDECL(cc));
358 /* only non-variadic function can use stdcall, else use cdecl */
359 set_method_calling_convention(irtype, SET_STDCALL(cc));
365 /* only non-variadic function can use fastcall, else use cdecl */
366 set_method_calling_convention(irtype, SET_FASTCALL(cc));
370 /* Hmm, leave default, not accepted by the parser yet. */
375 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
377 const decl_modifiers_t modifiers = function_type->modifiers;
378 if (modifiers & DM_CONST)
379 add_method_additional_properties(irtype, mtp_property_const);
380 if (modifiers & DM_PURE)
381 add_method_additional_properties(irtype, mtp_property_pure);
382 if (modifiers & DM_RETURNS_TWICE)
383 add_method_additional_properties(irtype, mtp_property_returns_twice);
384 if (modifiers & DM_NORETURN)
385 add_method_additional_properties(irtype, mtp_property_noreturn);
386 if (modifiers & DM_NOTHROW)
387 add_method_additional_properties(irtype, mtp_property_nothrow);
388 if (modifiers & DM_MALLOC)
389 add_method_additional_properties(irtype, mtp_property_malloc);
394 static ir_type *create_pointer_type(pointer_type_t *type)
396 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
397 type_t *points_to = type->points_to;
398 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
399 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
404 static ir_type *create_reference_type(reference_type_t *type)
406 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
407 type_t *refers_to = type->refers_to;
408 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
409 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
414 static ir_type *create_array_type(array_type_t *type)
416 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
417 type_t *element_type = type->element_type;
418 ir_type *ir_element_type = get_ir_type(element_type);
419 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
421 const int align = get_type_alignment_bytes(ir_element_type);
422 set_type_alignment_bytes(irtype, align);
424 if (type->size_constant) {
425 int n_elements = type->size;
427 set_array_bounds_int(irtype, 0, 0, n_elements);
429 size_t elemsize = get_type_size_bytes(ir_element_type);
430 if (elemsize % align > 0) {
431 elemsize += align - (elemsize % align);
433 set_type_size_bytes(irtype, n_elements * elemsize);
435 set_array_lower_bound_int(irtype, 0, 0);
437 set_type_state(irtype, layout_fixed);
443 * Return the signed integer type of size bits.
445 * @param size the size
447 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
451 static ir_mode *s_modes[64 + 1] = {NULL, };
455 if (size <= 0 || size > 64)
458 mode = s_modes[size];
462 snprintf(name, sizeof(name), "bf_I%u", size);
463 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
464 s_modes[size] = mode;
467 type_dbg_info *dbgi = get_type_dbg_info_(type);
468 res = new_d_type_primitive(mode, dbgi);
469 set_primitive_base_type(res, base_tp);
475 * Return the unsigned integer type of size bits.
477 * @param size the size
479 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
483 static ir_mode *u_modes[64 + 1] = {NULL, };
487 if (size <= 0 || size > 64)
490 mode = u_modes[size];
494 snprintf(name, sizeof(name), "bf_U%u", size);
495 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
496 u_modes[size] = mode;
499 type_dbg_info *dbgi = get_type_dbg_info_(type);
500 res = new_d_type_primitive(mode, dbgi);
501 set_primitive_base_type(res, base_tp);
506 static ir_type *create_bitfield_type(const entity_t *entity)
508 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
509 type_t *base = skip_typeref(entity->declaration.type);
510 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
511 ir_type *irbase = get_ir_type(base);
513 unsigned bit_size = entity->compound_member.bit_size;
515 assert(!is_type_float(base));
516 if (is_type_signed(base)) {
517 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
519 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
524 COMPOUND_IS_STRUCT = false,
525 COMPOUND_IS_UNION = true
529 * Construct firm type from ast struct type.
531 static ir_type *create_compound_type(compound_type_t *type,
532 bool incomplete, bool is_union)
534 compound_t *compound = type->compound;
536 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
537 return compound->irtype;
540 symbol_t *type_symbol = compound->base.symbol;
542 if (type_symbol != NULL) {
543 id = new_id_from_str(type_symbol->string);
546 id = id_unique("__anonymous_union.%u");
548 id = id_unique("__anonymous_struct.%u");
554 irtype = new_type_union(id);
556 irtype = new_type_struct(id);
559 compound->irtype_complete = false;
560 compound->irtype = irtype;
566 layout_union_type(type);
568 layout_struct_type(type);
571 compound->irtype_complete = true;
573 entity_t *entry = compound->members.entities;
574 for ( ; entry != NULL; entry = entry->base.next) {
575 if (entry->kind != ENTITY_COMPOUND_MEMBER)
578 symbol_t *symbol = entry->base.symbol;
579 type_t *entry_type = entry->declaration.type;
581 if (symbol == NULL) {
582 /* anonymous bitfield member, skip */
583 if (entry->compound_member.bitfield)
585 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
586 || entry_type->kind == TYPE_COMPOUND_UNION);
587 ident = id_unique("anon.%u");
589 ident = new_id_from_str(symbol->string);
592 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
594 ir_type *entry_irtype;
595 if (entry->compound_member.bitfield) {
596 entry_irtype = create_bitfield_type(entry);
598 entry_irtype = get_ir_type(entry_type);
600 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
602 set_entity_offset(entity, entry->compound_member.offset);
603 set_entity_offset_bits_remainder(entity,
604 entry->compound_member.bit_offset);
606 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
607 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
608 entry->compound_member.entity = entity;
611 set_type_alignment_bytes(irtype, compound->alignment);
612 set_type_size_bytes(irtype, compound->size);
613 set_type_state(irtype, layout_fixed);
618 static ir_tarval *fold_constant_to_tarval(expression_t const *);
620 static void determine_enum_values(enum_type_t *const type)
622 ir_mode *const mode = atomic_modes[type->base.akind];
623 ir_tarval *const one = get_mode_one(mode);
624 ir_tarval * tv_next = get_mode_null(mode);
626 enum_t *enume = type->enume;
627 entity_t *entry = enume->base.next;
628 for (; entry != NULL; entry = entry->base.next) {
629 if (entry->kind != ENTITY_ENUM_VALUE)
632 expression_t *const init = entry->enum_value.value;
634 tv_next = fold_constant_to_tarval(init);
636 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
637 entry->enum_value.tv = tv_next;
638 tv_next = tarval_add(tv_next, one);
642 static ir_type *create_enum_type(enum_type_t *const type)
644 return create_atomic_type(type->base.akind, (const type_t*) type);
647 static ir_type *get_ir_type_incomplete(type_t *type)
649 assert(type != NULL);
650 type = skip_typeref(type);
652 if (type->base.firm_type != NULL) {
653 return type->base.firm_type;
656 switch (type->kind) {
657 case TYPE_COMPOUND_STRUCT:
658 return create_compound_type(&type->compound, true, COMPOUND_IS_STRUCT);
659 case TYPE_COMPOUND_UNION:
660 return create_compound_type(&type->compound, true, COMPOUND_IS_UNION);
662 return get_ir_type(type);
666 ir_type *get_ir_type(type_t *type)
668 assert(type != NULL);
670 type = skip_typeref(type);
672 if (type->base.firm_type != NULL) {
673 return type->base.firm_type;
676 ir_type *firm_type = NULL;
677 switch (type->kind) {
679 firm_type = create_atomic_type(type->atomic.akind, type);
682 firm_type = create_complex_type(&type->atomic);
685 firm_type = create_imaginary_type(&type->atomic);
688 firm_type = create_method_type(&type->function, false);
691 firm_type = create_pointer_type(&type->pointer);
694 firm_type = create_reference_type(&type->reference);
697 firm_type = create_array_type(&type->array);
699 case TYPE_COMPOUND_STRUCT:
700 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_STRUCT);
702 case TYPE_COMPOUND_UNION:
703 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_UNION);
706 firm_type = create_enum_type(&type->enumt);
714 if (firm_type == NULL)
715 panic("unknown type found");
717 type->base.firm_type = firm_type;
721 static ir_mode *get_ir_mode_storage(type_t *type)
723 ir_type *irtype = get_ir_type(type);
725 /* firm doesn't report a mode for arrays somehow... */
726 if (is_Array_type(irtype)) {
730 ir_mode *mode = get_type_mode(irtype);
731 assert(mode != NULL);
736 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
737 * int that it returns bigger modes for floating point on some platforms
738 * (x87 internally does arithemtic with 80bits)
740 static ir_mode *get_ir_mode_arithmetic(type_t *type)
742 ir_mode *mode = get_ir_mode_storage(type);
743 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
744 return mode_float_arithmetic;
751 * Return a node representing the size of a type.
753 static ir_node *get_type_size_node(type_t *type)
756 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
757 type = skip_typeref(type);
759 if (is_type_array(type) && type->array.is_vla) {
760 ir_node *size_node = get_vla_size(&type->array);
761 ir_node *elem_size = get_type_size_node(type->array.element_type);
762 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
766 size = get_type_size(type);
767 return new_Const_long(mode, size);
770 /** Names of the runtime functions. */
771 static const struct {
772 int id; /**< the rts id */
773 int n_res; /**< number of return values */
774 const char *name; /**< the name of the rts function */
775 int n_params; /**< number of parameters */
776 unsigned flags; /**< language flags */
778 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
779 { rts_abort, 0, "abort", 0, _C89 },
780 { rts_alloca, 1, "alloca", 1, _ALL },
781 { rts_abs, 1, "abs", 1, _C89 },
782 { rts_labs, 1, "labs", 1, _C89 },
783 { rts_llabs, 1, "llabs", 1, _C99 },
784 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
786 { rts_fabs, 1, "fabs", 1, _C89 },
787 { rts_sqrt, 1, "sqrt", 1, _C89 },
788 { rts_cbrt, 1, "cbrt", 1, _C99 },
789 { rts_exp, 1, "exp", 1, _C89 },
790 { rts_exp2, 1, "exp2", 1, _C89 },
791 { rts_exp10, 1, "exp10", 1, _GNUC },
792 { rts_log, 1, "log", 1, _C89 },
793 { rts_log2, 1, "log2", 1, _C89 },
794 { rts_log10, 1, "log10", 1, _C89 },
795 { rts_pow, 1, "pow", 2, _C89 },
796 { rts_sin, 1, "sin", 1, _C89 },
797 { rts_cos, 1, "cos", 1, _C89 },
798 { rts_tan, 1, "tan", 1, _C89 },
799 { rts_asin, 1, "asin", 1, _C89 },
800 { rts_acos, 1, "acos", 1, _C89 },
801 { rts_atan, 1, "atan", 1, _C89 },
802 { rts_sinh, 1, "sinh", 1, _C89 },
803 { rts_cosh, 1, "cosh", 1, _C89 },
804 { rts_tanh, 1, "tanh", 1, _C89 },
806 { rts_fabsf, 1, "fabsf", 1, _C99 },
807 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
808 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
809 { rts_expf, 1, "expf", 1, _C99 },
810 { rts_exp2f, 1, "exp2f", 1, _C99 },
811 { rts_exp10f, 1, "exp10f", 1, _GNUC },
812 { rts_logf, 1, "logf", 1, _C99 },
813 { rts_log2f, 1, "log2f", 1, _C99 },
814 { rts_log10f, 1, "log10f", 1, _C99 },
815 { rts_powf, 1, "powf", 2, _C99 },
816 { rts_sinf, 1, "sinf", 1, _C99 },
817 { rts_cosf, 1, "cosf", 1, _C99 },
818 { rts_tanf, 1, "tanf", 1, _C99 },
819 { rts_asinf, 1, "asinf", 1, _C99 },
820 { rts_acosf, 1, "acosf", 1, _C99 },
821 { rts_atanf, 1, "atanf", 1, _C99 },
822 { rts_sinhf, 1, "sinhf", 1, _C99 },
823 { rts_coshf, 1, "coshf", 1, _C99 },
824 { rts_tanhf, 1, "tanhf", 1, _C99 },
826 { rts_fabsl, 1, "fabsl", 1, _C99 },
827 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
828 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
829 { rts_expl, 1, "expl", 1, _C99 },
830 { rts_exp2l, 1, "exp2l", 1, _C99 },
831 { rts_exp10l, 1, "exp10l", 1, _GNUC },
832 { rts_logl, 1, "logl", 1, _C99 },
833 { rts_log2l, 1, "log2l", 1, _C99 },
834 { rts_log10l, 1, "log10l", 1, _C99 },
835 { rts_powl, 1, "powl", 2, _C99 },
836 { rts_sinl, 1, "sinl", 1, _C99 },
837 { rts_cosl, 1, "cosl", 1, _C99 },
838 { rts_tanl, 1, "tanl", 1, _C99 },
839 { rts_asinl, 1, "asinl", 1, _C99 },
840 { rts_acosl, 1, "acosl", 1, _C99 },
841 { rts_atanl, 1, "atanl", 1, _C99 },
842 { rts_sinhl, 1, "sinhl", 1, _C99 },
843 { rts_coshl, 1, "coshl", 1, _C99 },
844 { rts_tanhl, 1, "tanhl", 1, _C99 },
846 { rts_strcmp, 1, "strcmp", 2, _C89 },
847 { rts_strncmp, 1, "strncmp", 3, _C89 },
848 { rts_strcpy, 1, "strcpy", 2, _C89 },
849 { rts_strlen, 1, "strlen", 1, _C89 },
850 { rts_memcpy, 1, "memcpy", 3, _C89 },
851 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
852 { rts_memmove, 1, "memmove", 3, _C89 },
853 { rts_memset, 1, "memset", 3, _C89 },
854 { rts_memcmp, 1, "memcmp", 3, _C89 },
857 static ident *rts_idents[lengthof(rts_data)];
859 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
861 void set_create_ld_ident(ident *(*func)(entity_t*))
863 create_ld_ident = func;
867 * Handle GNU attributes for entities
869 * @param ent the entity
870 * @param decl the routine declaration
872 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
874 assert(is_declaration(entity));
875 decl_modifiers_t modifiers = entity->declaration.modifiers;
877 if (is_method_entity(irentity)) {
878 if (modifiers & DM_PURE) {
879 set_entity_additional_properties(irentity, mtp_property_pure);
881 if (modifiers & DM_CONST) {
882 add_entity_additional_properties(irentity, mtp_property_const);
885 if (modifiers & DM_USED) {
886 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
888 if (modifiers & DM_WEAK) {
889 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
893 static bool is_main(entity_t *entity)
895 static symbol_t *sym_main = NULL;
896 if (sym_main == NULL) {
897 sym_main = symbol_table_insert("main");
900 if (entity->base.symbol != sym_main)
902 /* must be in outermost scope */
903 if (entity->base.parent_scope != ¤t_translation_unit->scope)
910 * Creates an entity representing a function.
912 * @param entity the function declaration/definition
913 * @param owner_type the owner type of this function, NULL
914 * for global functions
916 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
918 assert(entity->kind == ENTITY_FUNCTION);
919 if (entity->function.irentity != NULL)
920 return entity->function.irentity;
922 switch (entity->function.btk) {
925 case BUILTIN_LIBC_CHECK:
931 if (is_main(entity)) {
932 /* force main to C linkage */
933 type_t *type = entity->declaration.type;
934 assert(is_type_function(type));
935 if (type->function.linkage != LINKAGE_C) {
936 type_t *new_type = duplicate_type(type);
937 new_type->function.linkage = LINKAGE_C;
938 type = identify_new_type(new_type);
939 entity->declaration.type = type;
943 symbol_t *symbol = entity->base.symbol;
944 ident *id = new_id_from_str(symbol->string);
946 /* already an entity defined? */
947 ir_entity *irentity = entitymap_get(&entitymap, symbol);
948 bool const has_body = entity->function.statement != NULL;
949 if (irentity != NULL) {
950 if (get_entity_visibility(irentity) == ir_visibility_external
952 set_entity_visibility(irentity, ir_visibility_default);
957 ir_type *ir_type_method;
958 if (entity->function.need_closure)
959 ir_type_method = create_method_type(&entity->declaration.type->function, true);
961 ir_type_method = get_ir_type(entity->declaration.type);
963 bool nested_function = false;
964 if (owner_type == NULL)
965 owner_type = get_glob_type();
967 nested_function = true;
969 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
970 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
974 ld_id = id_unique("inner.%u");
976 ld_id = create_ld_ident(entity);
977 set_entity_ld_ident(irentity, ld_id);
979 handle_decl_modifiers(irentity, entity);
981 if (! nested_function) {
982 /* static inline => local
983 * extern inline => local
984 * inline without definition => local
985 * inline with definition => external_visible */
986 storage_class_tag_t const storage_class
987 = (storage_class_tag_t) entity->declaration.storage_class;
988 bool const is_inline = entity->function.is_inline;
990 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
991 set_entity_visibility(irentity, ir_visibility_default);
992 } else if (storage_class == STORAGE_CLASS_STATIC ||
993 (is_inline && has_body)) {
994 set_entity_visibility(irentity, ir_visibility_local);
995 } else if (has_body) {
996 set_entity_visibility(irentity, ir_visibility_default);
998 set_entity_visibility(irentity, ir_visibility_external);
1001 /* nested functions are always local */
1002 set_entity_visibility(irentity, ir_visibility_local);
1005 /* We should check for file scope here, but as long as we compile C only
1006 this is not needed. */
1007 if (!freestanding && !has_body) {
1008 /* check for a known runtime function */
1009 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1010 if (id != rts_idents[i])
1013 function_type_t *function_type
1014 = &entity->declaration.type->function;
1015 /* rts_entities code can't handle a "wrong" number of parameters */
1016 if (function_type->unspecified_parameters)
1019 /* check number of parameters */
1020 int n_params = count_parameters(function_type);
1021 if (n_params != rts_data[i].n_params)
1024 type_t *return_type = skip_typeref(function_type->return_type);
1025 int n_res = is_type_void(return_type) ? 0 : 1;
1026 if (n_res != rts_data[i].n_res)
1029 /* ignore those rts functions not necessary needed for current mode */
1030 if ((c_mode & rts_data[i].flags) == 0)
1032 assert(rts_entities[rts_data[i].id] == NULL);
1033 rts_entities[rts_data[i].id] = irentity;
1037 entitymap_insert(&entitymap, symbol, irentity);
1040 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1041 entity->function.irentity = irentity;
1047 * Creates a SymConst for a given entity.
1049 * @param dbgi debug info
1050 * @param entity the entity
1052 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1054 assert(entity != NULL);
1055 union symconst_symbol sym;
1056 sym.entity_p = entity;
1057 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1060 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1062 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1065 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1068 if (is_Const(value)) {
1069 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1072 ir_node *cond = new_d_Cond(dbgi, value);
1073 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1074 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1075 ir_node *tblock = new_Block(1, &proj_true);
1076 ir_node *fblock = new_Block(1, &proj_false);
1077 set_cur_block(tblock);
1078 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1079 ir_node *tjump = new_Jmp();
1080 set_cur_block(fblock);
1081 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1082 ir_node *fjump = new_Jmp();
1084 ir_node *in[2] = { tjump, fjump };
1085 ir_node *mergeblock = new_Block(2, in);
1086 set_cur_block(mergeblock);
1087 ir_node *phi_in[2] = { const1, const0 };
1088 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1092 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1094 ir_mode *value_mode = get_irn_mode(value);
1096 if (value_mode == dest_mode)
1099 if (dest_mode == mode_b) {
1100 ir_node *zero = new_Const(get_mode_null(value_mode));
1101 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1103 } else if (value_mode == mode_b) {
1104 return create_conv_from_b(dbgi, value, dest_mode);
1107 return new_d_Conv(dbgi, value, dest_mode);
1111 * Creates a SymConst node representing a wide string literal.
1113 * @param literal the wide string literal
1115 static ir_node *wide_string_literal_to_firm(
1116 const string_literal_expression_t *literal)
1118 ir_type *const global_type = get_glob_type();
1119 ir_type *const elem_type = ir_type_wchar_t;
1120 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1121 ir_type *const type = new_type_array(1, elem_type);
1123 ident *const id = id_unique("str.%u");
1124 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1125 set_entity_ld_ident(entity, id);
1126 set_entity_visibility(entity, ir_visibility_private);
1127 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1129 ir_mode *const mode = get_type_mode(elem_type);
1130 const size_t slen = wstrlen(&literal->value);
1132 set_array_lower_bound_int(type, 0, 0);
1133 set_array_upper_bound_int(type, 0, slen);
1134 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1135 set_type_state(type, layout_fixed);
1137 ir_initializer_t *initializer = create_initializer_compound(slen);
1138 const char *p = literal->value.begin;
1139 for (size_t i = 0; i < slen; ++i) {
1140 assert(p < literal->value.begin + literal->value.size);
1141 utf32 v = read_utf8_char(&p);
1142 ir_tarval *tv = new_tarval_from_long(v, mode);
1143 ir_initializer_t *val = create_initializer_tarval(tv);
1144 set_initializer_compound_value(initializer, i, val);
1146 set_entity_initializer(entity, initializer);
1148 return create_symconst(dbgi, entity);
1152 * Creates a SymConst node representing a string constant.
1154 * @param src_pos the source position of the string constant
1155 * @param id_prefix a prefix for the name of the generated string constant
1156 * @param value the value of the string constant
1158 static ir_node *string_to_firm(const source_position_t *const src_pos,
1159 const char *const id_prefix,
1160 const string_t *const value)
1162 ir_type *const global_type = get_glob_type();
1163 dbg_info *const dbgi = get_dbg_info(src_pos);
1164 ir_type *const type = new_type_array(1, ir_type_const_char);
1166 ident *const id = id_unique(id_prefix);
1167 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1168 set_entity_ld_ident(entity, id);
1169 set_entity_visibility(entity, ir_visibility_private);
1170 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1172 ir_type *const elem_type = ir_type_const_char;
1173 ir_mode *const mode = get_type_mode(elem_type);
1175 const char* const string = value->begin;
1176 const size_t slen = value->size;
1178 set_array_lower_bound_int(type, 0, 0);
1179 set_array_upper_bound_int(type, 0, slen);
1180 set_type_size_bytes(type, slen);
1181 set_type_state(type, layout_fixed);
1183 ir_initializer_t *initializer = create_initializer_compound(slen);
1184 for (size_t i = 0; i < slen; ++i) {
1185 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1186 ir_initializer_t *val = create_initializer_tarval(tv);
1187 set_initializer_compound_value(initializer, i, val);
1189 set_entity_initializer(entity, initializer);
1191 return create_symconst(dbgi, entity);
1194 static bool try_create_integer(literal_expression_t *literal,
1195 type_t *type, unsigned char base)
1197 const char *string = literal->value.begin;
1198 size_t size = literal->value.size;
1200 assert(type->kind == TYPE_ATOMIC);
1201 atomic_type_kind_t akind = type->atomic.akind;
1203 ir_mode *mode = atomic_modes[akind];
1204 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1205 if (tv == tarval_bad)
1208 literal->base.type = type;
1209 literal->target_value = tv;
1213 static void create_integer_tarval(literal_expression_t *literal)
1217 const string_t *suffix = &literal->suffix;
1219 if (suffix->size > 0) {
1220 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1221 if (*c == 'u' || *c == 'U') { ++us; }
1222 if (*c == 'l' || *c == 'L') { ++ls; }
1227 switch (literal->base.kind) {
1228 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1229 case EXPR_LITERAL_INTEGER: base = 10; break;
1230 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1231 default: panic("invalid literal kind");
1234 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1236 /* now try if the constant is small enough for some types */
1237 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1239 if (us == 0 && try_create_integer(literal, type_int, base))
1241 if ((us == 1 || base != 10)
1242 && try_create_integer(literal, type_unsigned_int, base))
1246 if (us == 0 && try_create_integer(literal, type_long, base))
1248 if ((us == 1 || base != 10)
1249 && try_create_integer(literal, type_unsigned_long, base))
1252 /* last try? then we should not report tarval_bad */
1253 if (us != 1 && base == 10)
1254 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1255 if (us == 0 && try_create_integer(literal, type_long_long, base))
1259 assert(us == 1 || base != 10);
1260 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1261 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1263 panic("internal error when parsing number literal");
1266 tarval_set_integer_overflow_mode(old_mode);
1269 void determine_literal_type(literal_expression_t *literal)
1271 switch (literal->base.kind) {
1272 case EXPR_LITERAL_INTEGER:
1273 case EXPR_LITERAL_INTEGER_OCTAL:
1274 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1275 create_integer_tarval(literal);
1283 * Creates a Const node representing a constant.
1285 static ir_node *literal_to_firm(const literal_expression_t *literal)
1287 type_t *type = skip_typeref(literal->base.type);
1288 ir_mode *mode = get_ir_mode_storage(type);
1289 const char *string = literal->value.begin;
1290 size_t size = literal->value.size;
1293 switch (literal->base.kind) {
1294 case EXPR_LITERAL_WIDE_CHARACTER: {
1295 utf32 v = read_utf8_char(&string);
1297 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1299 tv = new_tarval_from_str(buf, len, mode);
1302 case EXPR_LITERAL_CHARACTER: {
1305 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1306 if (size == 1 && char_is_signed) {
1307 v = (signed char)string[0];
1310 for (size_t i = 0; i < size; ++i) {
1311 v = (v << 8) | ((unsigned char)string[i]);
1315 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1317 tv = new_tarval_from_str(buf, len, mode);
1320 case EXPR_LITERAL_INTEGER:
1321 case EXPR_LITERAL_INTEGER_OCTAL:
1322 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1323 assert(literal->target_value != NULL);
1324 tv = literal->target_value;
1326 case EXPR_LITERAL_FLOATINGPOINT:
1327 tv = new_tarval_from_str(string, size, mode);
1329 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1330 char buffer[size + 2];
1331 memcpy(buffer, "0x", 2);
1332 memcpy(buffer+2, string, size);
1333 tv = new_tarval_from_str(buffer, size+2, mode);
1336 case EXPR_LITERAL_BOOLEAN:
1337 if (string[0] == 't') {
1338 tv = get_mode_one(mode);
1340 assert(string[0] == 'f');
1341 tv = get_mode_null(mode);
1344 case EXPR_LITERAL_MS_NOOP:
1345 tv = get_mode_null(mode);
1350 panic("Invalid literal kind found");
1353 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1354 ir_node *res = new_d_Const(dbgi, tv);
1355 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1356 return create_conv(dbgi, res, mode_arith);
1360 * Allocate an area of size bytes aligned at alignment
1363 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1365 static unsigned area_cnt = 0;
1368 ir_type *tp = new_type_array(1, ir_type_char);
1369 set_array_bounds_int(tp, 0, 0, size);
1370 set_type_alignment_bytes(tp, alignment);
1372 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1373 ident *name = new_id_from_str(buf);
1374 ir_entity *area = new_entity(frame_type, name, tp);
1376 /* mark this entity as compiler generated */
1377 set_entity_compiler_generated(area, 1);
1382 * Return a node representing a trampoline region
1383 * for a given function entity.
1385 * @param dbgi debug info
1386 * @param entity the function entity
1388 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1390 ir_entity *region = NULL;
1393 if (current_trampolines != NULL) {
1394 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1395 if (current_trampolines[i].function == entity) {
1396 region = current_trampolines[i].region;
1401 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1403 ir_graph *irg = current_ir_graph;
1404 if (region == NULL) {
1405 /* create a new region */
1406 ir_type *frame_tp = get_irg_frame_type(irg);
1407 trampoline_region reg;
1408 reg.function = entity;
1410 reg.region = alloc_trampoline(frame_tp,
1411 be_params->trampoline_size,
1412 be_params->trampoline_align);
1413 ARR_APP1(trampoline_region, current_trampolines, reg);
1414 region = reg.region;
1416 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1421 * Creates a trampoline for a function represented by an entity.
1423 * @param dbgi debug info
1424 * @param mode the (reference) mode for the function address
1425 * @param entity the function entity
1427 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1430 assert(entity != NULL);
1432 in[0] = get_trampoline_region(dbgi, entity);
1433 in[1] = create_symconst(dbgi, entity);
1434 in[2] = get_irg_frame(current_ir_graph);
1436 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1437 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1438 return new_Proj(irn, mode, pn_Builtin_max+1);
1442 * Dereference an address.
1444 * @param dbgi debug info
1445 * @param type the type of the dereferenced result (the points_to type)
1446 * @param addr the address to dereference
1448 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1449 ir_node *const addr)
1451 type_t *skipped = skip_typeref(type);
1452 if (is_type_incomplete(skipped))
1455 ir_type *irtype = get_ir_type(skipped);
1456 if (is_compound_type(irtype)
1457 || is_Method_type(irtype)
1458 || is_Array_type(irtype)) {
1462 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1463 ? cons_volatile : cons_none;
1464 ir_mode *const mode = get_type_mode(irtype);
1465 ir_node *const memory = get_store();
1466 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1467 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1468 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1470 set_store(load_mem);
1472 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1473 return create_conv(dbgi, load_res, mode_arithmetic);
1477 * Creates a strict Conv (to the node's mode) if necessary.
1479 * @param dbgi debug info
1480 * @param node the node to strict conv
1482 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1484 ir_mode *mode = get_irn_mode(node);
1486 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1488 if (!mode_is_float(mode))
1491 /* check if there is already a Conv */
1492 if (is_Conv(node)) {
1493 /* convert it into a strict Conv */
1494 set_Conv_strict(node, 1);
1498 /* otherwise create a new one */
1499 return new_d_strictConv(dbgi, node, mode);
1503 * Returns the correct base address depending on whether it is a parameter or a
1504 * normal local variable.
1506 static ir_node *get_local_frame(ir_entity *const ent)
1508 ir_graph *const irg = current_ir_graph;
1509 const ir_type *const owner = get_entity_owner(ent);
1510 if (owner == current_outer_frame) {
1511 assert(current_static_link != NULL);
1512 return current_static_link;
1514 return get_irg_frame(irg);
1519 * Keep all memory edges of the given block.
1521 static void keep_all_memory(ir_node *block)
1523 ir_node *old = get_cur_block();
1525 set_cur_block(block);
1526 keep_alive(get_store());
1527 /* TODO: keep all memory edges from restricted pointers */
1531 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1533 entity_t *entity = ref->entity;
1534 if (entity->enum_value.tv == NULL) {
1535 type_t *type = skip_typeref(entity->enum_value.enum_type);
1536 assert(type->kind == TYPE_ENUM);
1537 determine_enum_values(&type->enumt);
1540 return new_Const(entity->enum_value.tv);
1543 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1545 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1546 entity_t *entity = ref->entity;
1547 assert(is_declaration(entity));
1548 type_t *type = skip_typeref(entity->declaration.type);
1550 /* make sure the type is constructed */
1551 (void) get_ir_type(type);
1553 if (entity->kind == ENTITY_FUNCTION
1554 && entity->function.btk != BUILTIN_NONE) {
1555 ir_entity *irentity = get_function_entity(entity, NULL);
1556 /* for gcc compatibility we have to produce (dummy) addresses for some
1557 * builtins which don't have entities */
1558 if (irentity == NULL) {
1559 source_position_t const *const pos = &ref->base.source_position;
1560 symbol_t const *const sym = ref->entity->base.symbol;
1561 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1563 /* simply create a NULL pointer */
1564 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1565 ir_node *res = new_Const(get_mode_null(mode));
1571 switch ((declaration_kind_t) entity->declaration.kind) {
1572 case DECLARATION_KIND_UNKNOWN:
1575 case DECLARATION_KIND_LOCAL_VARIABLE: {
1576 ir_mode *const mode = get_ir_mode_storage(type);
1577 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1578 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1580 case DECLARATION_KIND_PARAMETER: {
1581 ir_mode *const mode = get_ir_mode_storage(type);
1582 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1583 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1585 case DECLARATION_KIND_FUNCTION: {
1586 return create_symconst(dbgi, entity->function.irentity);
1588 case DECLARATION_KIND_INNER_FUNCTION: {
1589 ir_mode *const mode = get_ir_mode_storage(type);
1590 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1591 /* inner function not using the closure */
1592 return create_symconst(dbgi, entity->function.irentity);
1594 /* need trampoline here */
1595 return create_trampoline(dbgi, mode, entity->function.irentity);
1598 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1599 const variable_t *variable = &entity->variable;
1600 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1601 return deref_address(dbgi, variable->base.type, addr);
1604 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1605 ir_entity *irentity = entity->variable.v.entity;
1606 ir_node *frame = get_local_frame(irentity);
1607 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1608 return deref_address(dbgi, entity->declaration.type, sel);
1610 case DECLARATION_KIND_PARAMETER_ENTITY: {
1611 ir_entity *irentity = entity->parameter.v.entity;
1612 ir_node *frame = get_local_frame(irentity);
1613 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1614 return deref_address(dbgi, entity->declaration.type, sel);
1617 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1618 return entity->variable.v.vla_base;
1620 case DECLARATION_KIND_COMPOUND_MEMBER:
1621 panic("not implemented reference type");
1624 panic("reference to declaration with unknown type found");
1627 static ir_node *reference_addr(const reference_expression_t *ref)
1629 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1630 entity_t *entity = ref->entity;
1631 assert(is_declaration(entity));
1633 switch((declaration_kind_t) entity->declaration.kind) {
1634 case DECLARATION_KIND_UNKNOWN:
1636 case DECLARATION_KIND_PARAMETER:
1637 case DECLARATION_KIND_LOCAL_VARIABLE:
1638 /* you can store to a local variable (so we don't panic but return NULL
1639 * as an indicator for no real address) */
1641 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1642 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1645 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1646 ir_entity *irentity = entity->variable.v.entity;
1647 ir_node *frame = get_local_frame(irentity);
1648 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1652 case DECLARATION_KIND_PARAMETER_ENTITY: {
1653 ir_entity *irentity = entity->parameter.v.entity;
1654 ir_node *frame = get_local_frame(irentity);
1655 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1660 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1661 return entity->variable.v.vla_base;
1663 case DECLARATION_KIND_FUNCTION: {
1664 return create_symconst(dbgi, entity->function.irentity);
1667 case DECLARATION_KIND_INNER_FUNCTION: {
1668 type_t *const type = skip_typeref(entity->declaration.type);
1669 ir_mode *const mode = get_ir_mode_storage(type);
1670 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1671 /* inner function not using the closure */
1672 return create_symconst(dbgi, entity->function.irentity);
1674 /* need trampoline here */
1675 return create_trampoline(dbgi, mode, entity->function.irentity);
1679 case DECLARATION_KIND_COMPOUND_MEMBER:
1680 panic("not implemented reference type");
1683 panic("reference to declaration with unknown type found");
1687 * Transform calls to builtin functions.
1689 static ir_node *process_builtin_call(const call_expression_t *call)
1691 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1693 assert(call->function->kind == EXPR_REFERENCE);
1694 reference_expression_t *builtin = &call->function->reference;
1696 type_t *expr_type = skip_typeref(builtin->base.type);
1697 assert(is_type_pointer(expr_type));
1699 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1701 switch (builtin->entity->function.btk) {
1704 case BUILTIN_ALLOCA: {
1705 expression_t *argument = call->arguments->expression;
1706 ir_node *size = expression_to_firm(argument);
1708 ir_node *store = get_store();
1709 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1711 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1713 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1718 type_t *type = function_type->function.return_type;
1719 ir_mode *mode = get_ir_mode_arithmetic(type);
1720 ir_tarval *tv = get_mode_infinite(mode);
1721 ir_node *res = new_d_Const(dbgi, tv);
1725 /* Ignore string for now... */
1726 assert(is_type_function(function_type));
1727 type_t *type = function_type->function.return_type;
1728 ir_mode *mode = get_ir_mode_arithmetic(type);
1729 ir_tarval *tv = get_mode_NAN(mode);
1730 ir_node *res = new_d_Const(dbgi, tv);
1733 case BUILTIN_EXPECT: {
1734 expression_t *argument = call->arguments->expression;
1735 return _expression_to_firm(argument);
1737 case BUILTIN_VA_END:
1738 /* evaluate the argument of va_end for its side effects */
1739 _expression_to_firm(call->arguments->expression);
1741 case BUILTIN_OBJECT_SIZE: {
1742 /* determine value of "type" */
1743 expression_t *type_expression = call->arguments->next->expression;
1744 long type_val = fold_constant_to_int(type_expression);
1745 type_t *type = function_type->function.return_type;
1746 ir_mode *mode = get_ir_mode_arithmetic(type);
1747 /* just produce a "I don't know" result */
1748 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1749 get_mode_minus_one(mode);
1751 return new_d_Const(dbgi, result);
1753 case BUILTIN_ROTL: {
1754 ir_node *val = expression_to_firm(call->arguments->expression);
1755 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1756 ir_mode *mode = get_irn_mode(val);
1757 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1758 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1760 case BUILTIN_ROTR: {
1761 ir_node *val = expression_to_firm(call->arguments->expression);
1762 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1763 ir_mode *mode = get_irn_mode(val);
1764 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1765 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1766 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1767 return new_d_Rotl(dbgi, val, sub, mode);
1772 case BUILTIN_LIBC_CHECK:
1773 panic("builtin did not produce an entity");
1775 panic("invalid builtin found");
1779 * Transform a call expression.
1780 * Handles some special cases, like alloca() calls, which must be resolved
1781 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1782 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1785 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1787 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1788 assert(currently_reachable());
1790 expression_t *function = call->function;
1791 ir_node *callee = NULL;
1792 bool firm_builtin = false;
1793 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1794 if (function->kind == EXPR_REFERENCE) {
1795 const reference_expression_t *ref = &function->reference;
1796 entity_t *entity = ref->entity;
1798 if (entity->kind == ENTITY_FUNCTION) {
1799 builtin_kind_t builtin = entity->function.btk;
1800 if (builtin == BUILTIN_FIRM) {
1801 firm_builtin = true;
1802 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1803 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1804 && builtin != BUILTIN_LIBC_CHECK) {
1805 return process_builtin_call(call);
1810 callee = expression_to_firm(function);
1812 type_t *type = skip_typeref(function->base.type);
1813 assert(is_type_pointer(type));
1814 pointer_type_t *pointer_type = &type->pointer;
1815 type_t *points_to = skip_typeref(pointer_type->points_to);
1816 assert(is_type_function(points_to));
1817 function_type_t *function_type = &points_to->function;
1819 int n_parameters = 0;
1820 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1821 ir_type *new_method_type = NULL;
1822 if (function_type->variadic || function_type->unspecified_parameters) {
1823 const call_argument_t *argument = call->arguments;
1824 for ( ; argument != NULL; argument = argument->next) {
1828 /* we need to construct a new method type matching the call
1830 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1831 int n_res = get_method_n_ress(ir_method_type);
1832 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1833 set_method_calling_convention(new_method_type,
1834 get_method_calling_convention(ir_method_type));
1835 set_method_additional_properties(new_method_type,
1836 get_method_additional_properties(ir_method_type));
1837 set_method_variadicity(new_method_type,
1838 get_method_variadicity(ir_method_type));
1840 for (int i = 0; i < n_res; ++i) {
1841 set_method_res_type(new_method_type, i,
1842 get_method_res_type(ir_method_type, i));
1844 argument = call->arguments;
1845 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1846 expression_t *expression = argument->expression;
1847 ir_type *irtype = get_ir_type(expression->base.type);
1848 set_method_param_type(new_method_type, i, irtype);
1850 ir_method_type = new_method_type;
1852 n_parameters = get_method_n_params(ir_method_type);
1855 ir_node *in[n_parameters];
1857 const call_argument_t *argument = call->arguments;
1858 for (int n = 0; n < n_parameters; ++n) {
1859 expression_t *expression = argument->expression;
1860 ir_node *arg_node = expression_to_firm(expression);
1862 type_t *arg_type = skip_typeref(expression->base.type);
1863 if (!is_type_compound(arg_type)) {
1864 ir_mode *mode = get_ir_mode_storage(expression->base.type);
1865 arg_node = create_conv(dbgi, arg_node, mode);
1866 arg_node = do_strict_conv(dbgi, arg_node);
1871 argument = argument->next;
1875 if (function_type->modifiers & DM_CONST) {
1876 store = get_irg_no_mem(current_ir_graph);
1878 store = get_store();
1882 type_t *return_type = skip_typeref(function_type->return_type);
1883 ir_node *result = NULL;
1885 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1887 if (! (function_type->modifiers & DM_CONST)) {
1888 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1892 if (!is_type_void(return_type)) {
1893 assert(is_type_scalar(return_type));
1894 ir_mode *mode = get_ir_mode_storage(return_type);
1895 result = new_Proj(node, mode, pn_Builtin_max+1);
1896 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1897 result = create_conv(NULL, result, mode_arith);
1900 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1901 if (! (function_type->modifiers & DM_CONST)) {
1902 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1906 if (!is_type_void(return_type)) {
1907 ir_node *resproj = new_Proj(node, mode_T, pn_Call_T_result);
1909 if (is_type_scalar(return_type)) {
1910 ir_mode *mode = get_ir_mode_storage(return_type);
1911 result = new_Proj(resproj, mode, 0);
1912 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1913 result = create_conv(NULL, result, mode_arith);
1915 ir_mode *mode = mode_P_data;
1916 result = new_Proj(resproj, mode, 0);
1921 if (function_type->modifiers & DM_NORETURN) {
1922 /* A dead end: Keep the Call and the Block. Also place all further
1923 * nodes into a new and unreachable block. */
1925 keep_alive(get_cur_block());
1926 ir_node *block = new_Block(0, NULL);
1927 set_cur_block(block);
1933 static ir_node *statement_to_firm(statement_t *statement);
1934 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1936 static ir_node *expression_to_addr(const expression_t *expression);
1937 static ir_node *create_condition_evaluation(const expression_t *expression,
1938 ir_node *true_block,
1939 ir_node *false_block);
1941 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1944 if (!is_type_compound(type)) {
1945 ir_mode *mode = get_ir_mode_storage(type);
1946 value = create_conv(dbgi, value, mode);
1947 value = do_strict_conv(dbgi, value);
1950 ir_node *memory = get_store();
1952 if (is_type_scalar(type)) {
1953 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1954 ? cons_volatile : cons_none;
1955 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1956 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1957 set_store(store_mem);
1959 ir_type *irtype = get_ir_type(type);
1960 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1961 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1962 set_store(copyb_mem);
1966 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1968 ir_tarval *all_one = get_mode_all_one(mode);
1969 int mode_size = get_mode_size_bits(mode);
1970 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1972 assert(offset >= 0);
1974 assert(offset + size <= mode_size);
1975 if (size == mode_size) {
1979 long shiftr = get_mode_size_bits(mode) - size;
1980 long shiftl = offset;
1981 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1982 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1983 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1984 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1989 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1990 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1993 ir_type *entity_type = get_entity_type(entity);
1994 ir_type *base_type = get_primitive_base_type(entity_type);
1995 ir_mode *mode = get_type_mode(base_type);
1996 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1998 value = create_conv(dbgi, value, mode);
2000 /* kill upper bits of value and shift to right position */
2001 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
2002 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
2003 unsigned base_bits = get_mode_size_bits(mode);
2004 unsigned shiftwidth = base_bits - bitsize;
2006 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
2007 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
2009 unsigned shrwidth = base_bits - bitsize - bitoffset;
2010 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
2011 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
2013 /* load current value */
2014 ir_node *mem = get_store();
2015 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2016 set_volatile ? cons_volatile : cons_none);
2017 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2018 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2019 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2020 ir_tarval *inv_mask = tarval_not(shift_mask);
2021 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2022 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2024 /* construct new value and store */
2025 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2026 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2027 set_volatile ? cons_volatile : cons_none);
2028 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2029 set_store(store_mem);
2035 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2036 if (mode_is_signed(mode)) {
2037 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2039 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2044 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2047 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2048 entity_t *entity = expression->compound_entry;
2049 type_t *base_type = entity->declaration.type;
2050 ir_mode *mode = get_ir_mode_storage(base_type);
2051 ir_node *mem = get_store();
2052 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2053 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2054 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2055 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2057 ir_mode *amode = mode;
2058 /* optimisation, since shifting in modes < machine_size is usually
2060 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2063 unsigned amode_size = get_mode_size_bits(amode);
2064 load_res = create_conv(dbgi, load_res, amode);
2066 set_store(load_mem);
2068 /* kill upper bits */
2069 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2070 unsigned bitoffset = entity->compound_member.bit_offset;
2071 unsigned bitsize = entity->compound_member.bit_size;
2072 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2073 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2074 ir_node *countl = new_d_Const(dbgi, tvl);
2075 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2077 unsigned shift_bitsr = bitoffset + shift_bitsl;
2078 assert(shift_bitsr <= amode_size);
2079 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2080 ir_node *countr = new_d_Const(dbgi, tvr);
2082 if (mode_is_signed(mode)) {
2083 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2085 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2088 type_t *type = expression->base.type;
2089 ir_mode *resmode = get_ir_mode_arithmetic(type);
2090 return create_conv(dbgi, shiftr, resmode);
2093 /* make sure the selected compound type is constructed */
2094 static void construct_select_compound(const select_expression_t *expression)
2096 type_t *type = skip_typeref(expression->compound->base.type);
2097 if (is_type_pointer(type)) {
2098 type = type->pointer.points_to;
2100 (void) get_ir_type(type);
2103 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2104 ir_node *value, ir_node *addr)
2106 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2107 type_t *type = skip_typeref(expression->base.type);
2109 if (!is_type_compound(type)) {
2110 ir_mode *mode = get_ir_mode_storage(type);
2111 value = create_conv(dbgi, value, mode);
2112 value = do_strict_conv(dbgi, value);
2115 if (expression->kind == EXPR_REFERENCE) {
2116 const reference_expression_t *ref = &expression->reference;
2118 entity_t *entity = ref->entity;
2119 assert(is_declaration(entity));
2120 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2121 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2122 set_value(entity->variable.v.value_number, value);
2124 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2125 set_value(entity->parameter.v.value_number, value);
2131 addr = expression_to_addr(expression);
2132 assert(addr != NULL);
2134 if (expression->kind == EXPR_SELECT) {
2135 const select_expression_t *select = &expression->select;
2137 construct_select_compound(select);
2139 entity_t *entity = select->compound_entry;
2140 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2141 if (entity->compound_member.bitfield) {
2142 ir_entity *irentity = entity->compound_member.entity;
2144 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2145 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2146 set_volatile, true);
2151 assign_value(dbgi, addr, type, value);
2155 static void set_value_for_expression(const expression_t *expression,
2158 set_value_for_expression_addr(expression, value, NULL);
2161 static ir_node *get_value_from_lvalue(const expression_t *expression,
2164 if (expression->kind == EXPR_REFERENCE) {
2165 const reference_expression_t *ref = &expression->reference;
2167 entity_t *entity = ref->entity;
2168 assert(entity->kind == ENTITY_VARIABLE
2169 || entity->kind == ENTITY_PARAMETER);
2170 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2172 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2173 value_number = entity->variable.v.value_number;
2174 assert(addr == NULL);
2175 type_t *type = skip_typeref(expression->base.type);
2176 ir_mode *mode = get_ir_mode_storage(type);
2177 ir_node *res = get_value(value_number, mode);
2178 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2179 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2180 value_number = entity->parameter.v.value_number;
2181 assert(addr == NULL);
2182 type_t *type = skip_typeref(expression->base.type);
2183 ir_mode *mode = get_ir_mode_storage(type);
2184 ir_node *res = get_value(value_number, mode);
2185 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2189 assert(addr != NULL);
2190 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2193 if (expression->kind == EXPR_SELECT &&
2194 expression->select.compound_entry->compound_member.bitfield) {
2195 construct_select_compound(&expression->select);
2196 value = bitfield_extract_to_firm(&expression->select, addr);
2198 value = deref_address(dbgi, expression->base.type, addr);
2205 static ir_node *create_incdec(const unary_expression_t *expression)
2207 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2208 const expression_t *value_expr = expression->value;
2209 ir_node *addr = expression_to_addr(value_expr);
2210 ir_node *value = get_value_from_lvalue(value_expr, addr);
2212 type_t *type = skip_typeref(expression->base.type);
2213 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2216 if (is_type_pointer(type)) {
2217 pointer_type_t *pointer_type = &type->pointer;
2218 offset = get_type_size_node(pointer_type->points_to);
2220 assert(is_type_arithmetic(type));
2221 offset = new_Const(get_mode_one(mode));
2225 ir_node *store_value;
2226 switch(expression->base.kind) {
2227 case EXPR_UNARY_POSTFIX_INCREMENT:
2229 store_value = new_d_Add(dbgi, value, offset, mode);
2231 case EXPR_UNARY_POSTFIX_DECREMENT:
2233 store_value = new_d_Sub(dbgi, value, offset, mode);
2235 case EXPR_UNARY_PREFIX_INCREMENT:
2236 result = new_d_Add(dbgi, value, offset, mode);
2237 store_value = result;
2239 case EXPR_UNARY_PREFIX_DECREMENT:
2240 result = new_d_Sub(dbgi, value, offset, mode);
2241 store_value = result;
2244 panic("no incdec expr in create_incdec");
2247 set_value_for_expression_addr(value_expr, store_value, addr);
2252 static bool is_local_variable(expression_t *expression)
2254 if (expression->kind != EXPR_REFERENCE)
2256 reference_expression_t *ref_expr = &expression->reference;
2257 entity_t *entity = ref_expr->entity;
2258 if (entity->kind != ENTITY_VARIABLE)
2260 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2261 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2264 static ir_relation get_relation(const expression_kind_t kind)
2267 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2268 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2269 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2270 case EXPR_BINARY_ISLESS:
2271 case EXPR_BINARY_LESS: return ir_relation_less;
2272 case EXPR_BINARY_ISLESSEQUAL:
2273 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2274 case EXPR_BINARY_ISGREATER:
2275 case EXPR_BINARY_GREATER: return ir_relation_greater;
2276 case EXPR_BINARY_ISGREATEREQUAL:
2277 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2278 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2283 panic("trying to get pn_Cmp from non-comparison binexpr type");
2287 * Handle the assume optimizer hint: check if a Confirm
2288 * node can be created.
2290 * @param dbi debug info
2291 * @param expr the IL assume expression
2293 * we support here only some simple cases:
2298 static ir_node *handle_assume_compare(dbg_info *dbi,
2299 const binary_expression_t *expression)
2301 expression_t *op1 = expression->left;
2302 expression_t *op2 = expression->right;
2303 entity_t *var2, *var = NULL;
2304 ir_node *res = NULL;
2305 ir_relation relation = get_relation(expression->base.kind);
2307 if (is_local_variable(op1) && is_local_variable(op2)) {
2308 var = op1->reference.entity;
2309 var2 = op2->reference.entity;
2311 type_t *const type = skip_typeref(var->declaration.type);
2312 ir_mode *const mode = get_ir_mode_storage(type);
2314 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2315 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2317 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2318 set_value(var2->variable.v.value_number, res);
2320 res = new_d_Confirm(dbi, irn1, irn2, relation);
2321 set_value(var->variable.v.value_number, res);
2326 expression_t *con = NULL;
2327 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2328 var = op1->reference.entity;
2330 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2331 relation = get_inversed_relation(relation);
2332 var = op2->reference.entity;
2337 type_t *const type = skip_typeref(var->declaration.type);
2338 ir_mode *const mode = get_ir_mode_storage(type);
2340 res = get_value(var->variable.v.value_number, mode);
2341 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2342 set_value(var->variable.v.value_number, res);
2348 * Handle the assume optimizer hint.
2350 * @param dbi debug info
2351 * @param expr the IL assume expression
2353 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2355 switch(expression->kind) {
2356 case EXPR_BINARY_EQUAL:
2357 case EXPR_BINARY_NOTEQUAL:
2358 case EXPR_BINARY_LESS:
2359 case EXPR_BINARY_LESSEQUAL:
2360 case EXPR_BINARY_GREATER:
2361 case EXPR_BINARY_GREATEREQUAL:
2362 return handle_assume_compare(dbi, &expression->binary);
2368 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2369 type_t *from_type, type_t *type)
2371 type = skip_typeref(type);
2372 if (is_type_void(type)) {
2373 /* make sure firm type is constructed */
2374 (void) get_ir_type(type);
2377 if (!is_type_scalar(type)) {
2378 /* make sure firm type is constructed */
2379 (void) get_ir_type(type);
2383 from_type = skip_typeref(from_type);
2384 ir_mode *mode = get_ir_mode_storage(type);
2385 /* check for conversion from / to __based types */
2386 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2387 const variable_t *from_var = from_type->pointer.base_variable;
2388 const variable_t *to_var = type->pointer.base_variable;
2389 if (from_var != to_var) {
2390 if (from_var != NULL) {
2391 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2392 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2393 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2395 if (to_var != NULL) {
2396 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2397 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2398 value_node = new_d_Sub(dbgi, value_node, base, mode);
2403 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2404 /* bool adjustments (we save a mode_Bu, but have to temporarily
2405 * convert to mode_b so we only get a 0/1 value */
2406 value_node = create_conv(dbgi, value_node, mode_b);
2409 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2410 ir_node *node = create_conv(dbgi, value_node, mode);
2411 node = do_strict_conv(dbgi, node);
2412 node = create_conv(dbgi, node, mode_arith);
2417 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2419 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2420 type_t *type = skip_typeref(expression->base.type);
2422 const expression_t *value = expression->value;
2424 switch(expression->base.kind) {
2425 case EXPR_UNARY_TAKE_ADDRESS:
2426 return expression_to_addr(value);
2428 case EXPR_UNARY_NEGATE: {
2429 ir_node *value_node = expression_to_firm(value);
2430 ir_mode *mode = get_ir_mode_arithmetic(type);
2431 return new_d_Minus(dbgi, value_node, mode);
2433 case EXPR_UNARY_PLUS:
2434 return expression_to_firm(value);
2435 case EXPR_UNARY_BITWISE_NEGATE: {
2436 ir_node *value_node = expression_to_firm(value);
2437 ir_mode *mode = get_ir_mode_arithmetic(type);
2438 return new_d_Not(dbgi, value_node, mode);
2440 case EXPR_UNARY_NOT: {
2441 ir_node *value_node = _expression_to_firm(value);
2442 value_node = create_conv(dbgi, value_node, mode_b);
2443 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2446 case EXPR_UNARY_DEREFERENCE: {
2447 ir_node *value_node = expression_to_firm(value);
2448 type_t *value_type = skip_typeref(value->base.type);
2449 assert(is_type_pointer(value_type));
2451 /* check for __based */
2452 const variable_t *const base_var = value_type->pointer.base_variable;
2453 if (base_var != NULL) {
2454 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2455 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2456 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2458 type_t *points_to = value_type->pointer.points_to;
2459 return deref_address(dbgi, points_to, value_node);
2461 case EXPR_UNARY_POSTFIX_INCREMENT:
2462 case EXPR_UNARY_POSTFIX_DECREMENT:
2463 case EXPR_UNARY_PREFIX_INCREMENT:
2464 case EXPR_UNARY_PREFIX_DECREMENT:
2465 return create_incdec(expression);
2466 case EXPR_UNARY_CAST: {
2467 ir_node *value_node = expression_to_firm(value);
2468 type_t *from_type = value->base.type;
2469 return create_cast(dbgi, value_node, from_type, type);
2471 case EXPR_UNARY_ASSUME:
2472 return handle_assume(dbgi, value);
2477 panic("invalid UNEXPR type found");
2481 * produces a 0/1 depending of the value of a mode_b node
2483 static ir_node *produce_condition_result(const expression_t *expression,
2484 ir_mode *mode, dbg_info *dbgi)
2486 ir_node *const one_block = new_immBlock();
2487 ir_node *const zero_block = new_immBlock();
2488 create_condition_evaluation(expression, one_block, zero_block);
2489 mature_immBlock(one_block);
2490 mature_immBlock(zero_block);
2492 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2493 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2494 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2495 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2496 set_cur_block(block);
2498 ir_node *const one = new_Const(get_mode_one(mode));
2499 ir_node *const zero = new_Const(get_mode_null(mode));
2500 ir_node *const in[2] = { one, zero };
2501 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2506 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2507 ir_node *value, type_t *type)
2509 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2510 assert(is_type_pointer(type));
2511 pointer_type_t *const pointer_type = &type->pointer;
2512 type_t *const points_to = skip_typeref(pointer_type->points_to);
2513 ir_node * elem_size = get_type_size_node(points_to);
2514 elem_size = create_conv(dbgi, elem_size, mode);
2515 value = create_conv(dbgi, value, mode);
2516 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2520 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2521 ir_node *left, ir_node *right)
2524 type_t *type_left = skip_typeref(expression->left->base.type);
2525 type_t *type_right = skip_typeref(expression->right->base.type);
2527 expression_kind_t kind = expression->base.kind;
2530 case EXPR_BINARY_SHIFTLEFT:
2531 case EXPR_BINARY_SHIFTRIGHT:
2532 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2533 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2534 mode = get_ir_mode_arithmetic(expression->base.type);
2535 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2538 case EXPR_BINARY_SUB:
2539 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2540 const pointer_type_t *const ptr_type = &type_left->pointer;
2542 mode = get_ir_mode_arithmetic(expression->base.type);
2543 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2544 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2545 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2546 ir_node *const no_mem = new_NoMem();
2547 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2548 mode, op_pin_state_floats);
2549 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2552 case EXPR_BINARY_SUB_ASSIGN:
2553 if (is_type_pointer(type_left)) {
2554 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2555 mode = get_ir_mode_arithmetic(type_left);
2560 case EXPR_BINARY_ADD:
2561 case EXPR_BINARY_ADD_ASSIGN:
2562 if (is_type_pointer(type_left)) {
2563 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2564 mode = get_ir_mode_arithmetic(type_left);
2566 } else if (is_type_pointer(type_right)) {
2567 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2568 mode = get_ir_mode_arithmetic(type_right);
2575 mode = get_ir_mode_arithmetic(type_right);
2576 left = create_conv(dbgi, left, mode);
2581 case EXPR_BINARY_ADD_ASSIGN:
2582 case EXPR_BINARY_ADD:
2583 return new_d_Add(dbgi, left, right, mode);
2584 case EXPR_BINARY_SUB_ASSIGN:
2585 case EXPR_BINARY_SUB:
2586 return new_d_Sub(dbgi, left, right, mode);
2587 case EXPR_BINARY_MUL_ASSIGN:
2588 case EXPR_BINARY_MUL:
2589 return new_d_Mul(dbgi, left, right, mode);
2590 case EXPR_BINARY_BITWISE_AND:
2591 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2592 return new_d_And(dbgi, left, right, mode);
2593 case EXPR_BINARY_BITWISE_OR:
2594 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2595 return new_d_Or(dbgi, left, right, mode);
2596 case EXPR_BINARY_BITWISE_XOR:
2597 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2598 return new_d_Eor(dbgi, left, right, mode);
2599 case EXPR_BINARY_SHIFTLEFT:
2600 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2601 return new_d_Shl(dbgi, left, right, mode);
2602 case EXPR_BINARY_SHIFTRIGHT:
2603 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2604 if (mode_is_signed(mode)) {
2605 return new_d_Shrs(dbgi, left, right, mode);
2607 return new_d_Shr(dbgi, left, right, mode);
2609 case EXPR_BINARY_DIV:
2610 case EXPR_BINARY_DIV_ASSIGN: {
2611 ir_node *pin = new_Pin(new_NoMem());
2612 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2613 op_pin_state_floats);
2614 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2617 case EXPR_BINARY_MOD:
2618 case EXPR_BINARY_MOD_ASSIGN: {
2619 ir_node *pin = new_Pin(new_NoMem());
2620 assert(!mode_is_float(mode));
2621 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2622 op_pin_state_floats);
2623 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2627 panic("unexpected expression kind");
2631 static ir_node *create_lazy_op(const binary_expression_t *expression)
2633 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2634 type_t *type = skip_typeref(expression->base.type);
2635 ir_mode *mode = get_ir_mode_arithmetic(type);
2637 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2638 bool val = fold_constant_to_bool(expression->left);
2639 expression_kind_t ekind = expression->base.kind;
2640 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2641 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2643 return new_Const(get_mode_null(mode));
2647 return new_Const(get_mode_one(mode));
2651 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2652 bool valr = fold_constant_to_bool(expression->right);
2653 return create_Const_from_bool(mode, valr);
2656 return produce_condition_result(expression->right, mode, dbgi);
2659 return produce_condition_result((const expression_t*) expression, mode,
2663 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2664 ir_node *right, ir_mode *mode);
2666 static ir_node *create_assign_binop(const binary_expression_t *expression)
2668 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2669 const expression_t *left_expr = expression->left;
2670 type_t *type = skip_typeref(left_expr->base.type);
2671 ir_node *right = expression_to_firm(expression->right);
2672 ir_node *left_addr = expression_to_addr(left_expr);
2673 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2674 ir_node *result = create_op(dbgi, expression, left, right);
2676 result = create_cast(dbgi, result, expression->right->base.type, type);
2677 result = do_strict_conv(dbgi, result);
2679 result = set_value_for_expression_addr(left_expr, result, left_addr);
2681 if (!is_type_compound(type)) {
2682 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2683 result = create_conv(dbgi, result, mode_arithmetic);
2688 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2690 expression_kind_t kind = expression->base.kind;
2693 case EXPR_BINARY_EQUAL:
2694 case EXPR_BINARY_NOTEQUAL:
2695 case EXPR_BINARY_LESS:
2696 case EXPR_BINARY_LESSEQUAL:
2697 case EXPR_BINARY_GREATER:
2698 case EXPR_BINARY_GREATEREQUAL:
2699 case EXPR_BINARY_ISGREATER:
2700 case EXPR_BINARY_ISGREATEREQUAL:
2701 case EXPR_BINARY_ISLESS:
2702 case EXPR_BINARY_ISLESSEQUAL:
2703 case EXPR_BINARY_ISLESSGREATER:
2704 case EXPR_BINARY_ISUNORDERED: {
2705 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2706 ir_node *left = expression_to_firm(expression->left);
2707 ir_node *right = expression_to_firm(expression->right);
2708 ir_relation relation = get_relation(kind);
2709 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2712 case EXPR_BINARY_ASSIGN: {
2713 ir_node *addr = expression_to_addr(expression->left);
2714 ir_node *right = expression_to_firm(expression->right);
2716 = set_value_for_expression_addr(expression->left, right, addr);
2718 type_t *type = skip_typeref(expression->base.type);
2719 if (!is_type_compound(type)) {
2720 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2721 res = create_conv(NULL, res, mode_arithmetic);
2725 case EXPR_BINARY_ADD:
2726 case EXPR_BINARY_SUB:
2727 case EXPR_BINARY_MUL:
2728 case EXPR_BINARY_DIV:
2729 case EXPR_BINARY_MOD:
2730 case EXPR_BINARY_BITWISE_AND:
2731 case EXPR_BINARY_BITWISE_OR:
2732 case EXPR_BINARY_BITWISE_XOR:
2733 case EXPR_BINARY_SHIFTLEFT:
2734 case EXPR_BINARY_SHIFTRIGHT:
2736 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2737 ir_node *left = expression_to_firm(expression->left);
2738 ir_node *right = expression_to_firm(expression->right);
2739 return create_op(dbgi, expression, left, right);
2741 case EXPR_BINARY_LOGICAL_AND:
2742 case EXPR_BINARY_LOGICAL_OR:
2743 return create_lazy_op(expression);
2744 case EXPR_BINARY_COMMA:
2745 /* create side effects of left side */
2746 (void) expression_to_firm(expression->left);
2747 return _expression_to_firm(expression->right);
2749 case EXPR_BINARY_ADD_ASSIGN:
2750 case EXPR_BINARY_SUB_ASSIGN:
2751 case EXPR_BINARY_MUL_ASSIGN:
2752 case EXPR_BINARY_MOD_ASSIGN:
2753 case EXPR_BINARY_DIV_ASSIGN:
2754 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2755 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2756 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2757 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2758 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2759 return create_assign_binop(expression);
2761 panic("TODO binexpr type");
2765 static ir_node *array_access_addr(const array_access_expression_t *expression)
2767 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2768 ir_node *base_addr = expression_to_firm(expression->array_ref);
2769 ir_node *offset = expression_to_firm(expression->index);
2770 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2771 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2772 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2777 static ir_node *array_access_to_firm(
2778 const array_access_expression_t *expression)
2780 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2781 ir_node *addr = array_access_addr(expression);
2782 type_t *type = revert_automatic_type_conversion(
2783 (const expression_t*) expression);
2784 type = skip_typeref(type);
2786 return deref_address(dbgi, type, addr);
2789 static long get_offsetof_offset(const offsetof_expression_t *expression)
2791 type_t *orig_type = expression->type;
2794 designator_t *designator = expression->designator;
2795 for ( ; designator != NULL; designator = designator->next) {
2796 type_t *type = skip_typeref(orig_type);
2797 /* be sure the type is constructed */
2798 (void) get_ir_type(type);
2800 if (designator->symbol != NULL) {
2801 assert(is_type_compound(type));
2802 symbol_t *symbol = designator->symbol;
2804 compound_t *compound = type->compound.compound;
2805 entity_t *iter = compound->members.entities;
2806 for ( ; iter != NULL; iter = iter->base.next) {
2807 if (iter->base.symbol == symbol) {
2811 assert(iter != NULL);
2813 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2814 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2815 offset += get_entity_offset(iter->compound_member.entity);
2817 orig_type = iter->declaration.type;
2819 expression_t *array_index = designator->array_index;
2820 assert(designator->array_index != NULL);
2821 assert(is_type_array(type));
2823 long index = fold_constant_to_int(array_index);
2824 ir_type *arr_type = get_ir_type(type);
2825 ir_type *elem_type = get_array_element_type(arr_type);
2826 long elem_size = get_type_size_bytes(elem_type);
2828 offset += index * elem_size;
2830 orig_type = type->array.element_type;
2837 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2839 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2840 long offset = get_offsetof_offset(expression);
2841 ir_tarval *tv = new_tarval_from_long(offset, mode);
2842 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2844 return new_d_Const(dbgi, tv);
2847 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2848 ir_entity *entity, type_t *type);
2849 static ir_initializer_t *create_ir_initializer(
2850 const initializer_t *initializer, type_t *type);
2852 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2853 initializer_t *initializer,
2856 /* create the ir_initializer */
2857 ir_graph *const old_current_ir_graph = current_ir_graph;
2858 current_ir_graph = get_const_code_irg();
2860 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2862 assert(current_ir_graph == get_const_code_irg());
2863 current_ir_graph = old_current_ir_graph;
2865 ident *const id = id_unique("initializer.%u");
2866 ir_type *const irtype = get_ir_type(type);
2867 ir_type *const global_type = get_glob_type();
2868 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2869 set_entity_ld_ident(entity, id);
2870 set_entity_visibility(entity, ir_visibility_private);
2871 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2872 set_entity_initializer(entity, irinitializer);
2876 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2878 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2879 type_t *type = expression->type;
2880 initializer_t *initializer = expression->initializer;
2882 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2883 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2884 return create_symconst(dbgi, entity);
2886 /* create an entity on the stack */
2887 ident *const id = id_unique("CompLit.%u");
2888 ir_type *const irtype = get_ir_type(type);
2889 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2891 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2892 set_entity_ld_ident(entity, id);
2894 /* create initialisation code */
2895 create_local_initializer(initializer, dbgi, entity, type);
2897 /* create a sel for the compound literal address */
2898 ir_node *frame = get_irg_frame(current_ir_graph);
2899 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2904 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2906 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2907 type_t *const type = expr->type;
2908 ir_node *const addr = compound_literal_addr(expr);
2909 return deref_address(dbgi, type, addr);
2913 * Transform a sizeof expression into Firm code.
2915 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2917 type_t *const type = skip_typeref(expression->type);
2918 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2919 if (is_type_array(type) && type->array.is_vla
2920 && expression->tp_expression != NULL) {
2921 expression_to_firm(expression->tp_expression);
2923 /* strange gnu extensions: sizeof(function) == 1 */
2924 if (is_type_function(type)) {
2925 ir_mode *mode = get_ir_mode_storage(type_size_t);
2926 return new_Const(get_mode_one(mode));
2929 return get_type_size_node(type);
2932 static entity_t *get_expression_entity(const expression_t *expression)
2934 if (expression->kind != EXPR_REFERENCE)
2937 return expression->reference.entity;
2940 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2942 switch(entity->kind) {
2943 case DECLARATION_KIND_CASES:
2944 return entity->declaration.alignment;
2947 return entity->compound.alignment;
2948 case ENTITY_TYPEDEF:
2949 return entity->typedefe.alignment;
2957 * Transform an alignof expression into Firm code.
2959 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2961 unsigned alignment = 0;
2963 const expression_t *tp_expression = expression->tp_expression;
2964 if (tp_expression != NULL) {
2965 entity_t *entity = get_expression_entity(tp_expression);
2966 if (entity != NULL) {
2967 if (entity->kind == ENTITY_FUNCTION) {
2968 /* a gnu-extension */
2971 alignment = get_cparser_entity_alignment(entity);
2976 if (alignment == 0) {
2977 type_t *type = expression->type;
2978 alignment = get_type_alignment(type);
2981 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2982 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2983 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2984 return new_d_Const(dbgi, tv);
2987 static void init_ir_types(void);
2989 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2991 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2993 bool constant_folding_old = constant_folding;
2994 constant_folding = true;
2995 int old_optimize = get_optimize();
2996 int old_constant_folding = get_opt_constant_folding();
2998 set_opt_constant_folding(1);
3002 ir_graph *old_current_ir_graph = current_ir_graph;
3003 current_ir_graph = get_const_code_irg();
3005 ir_node *cnst = expression_to_firm(expression);
3006 current_ir_graph = old_current_ir_graph;
3007 set_optimize(old_optimize);
3008 set_opt_constant_folding(old_constant_folding);
3010 if (!is_Const(cnst)) {
3011 panic("couldn't fold constant");
3014 constant_folding = constant_folding_old;
3016 return get_Const_tarval(cnst);
3019 /* this function is only used in parser.c, but it relies on libfirm functionality */
3020 bool constant_is_negative(const expression_t *expression)
3022 ir_tarval *tv = fold_constant_to_tarval(expression);
3023 return tarval_is_negative(tv);
3026 long fold_constant_to_int(const expression_t *expression)
3028 ir_tarval *tv = fold_constant_to_tarval(expression);
3029 if (!tarval_is_long(tv)) {
3030 panic("result of constant folding is not integer");
3033 return get_tarval_long(tv);
3036 bool fold_constant_to_bool(const expression_t *expression)
3038 ir_tarval *tv = fold_constant_to_tarval(expression);
3039 return !tarval_is_null(tv);
3042 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3044 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3046 /* first try to fold a constant condition */
3047 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3048 bool val = fold_constant_to_bool(expression->condition);
3050 expression_t *true_expression = expression->true_expression;
3051 if (true_expression == NULL)
3052 true_expression = expression->condition;
3053 return expression_to_firm(true_expression);
3055 return expression_to_firm(expression->false_expression);
3059 ir_node *const true_block = new_immBlock();
3060 ir_node *const false_block = new_immBlock();
3061 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3062 mature_immBlock(true_block);
3063 mature_immBlock(false_block);
3065 set_cur_block(true_block);
3067 if (expression->true_expression != NULL) {
3068 true_val = expression_to_firm(expression->true_expression);
3069 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3070 true_val = cond_expr;
3072 /* Condition ended with a short circuit (&&, ||, !) operation or a
3073 * comparison. Generate a "1" as value for the true branch. */
3074 true_val = new_Const(get_mode_one(mode_Is));
3076 ir_node *const true_jmp = new_d_Jmp(dbgi);
3078 set_cur_block(false_block);
3079 ir_node *const false_val = expression_to_firm(expression->false_expression);
3080 ir_node *const false_jmp = new_d_Jmp(dbgi);
3082 /* create the common block */
3083 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3084 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3085 set_cur_block(block);
3087 /* TODO improve static semantics, so either both or no values are NULL */
3088 if (true_val == NULL || false_val == NULL)
3091 ir_node *const in[2] = { true_val, false_val };
3092 type_t *const type = skip_typeref(expression->base.type);
3094 if (is_type_compound(type)) {
3097 mode = get_ir_mode_arithmetic(type);
3099 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3105 * Returns an IR-node representing the address of a field.
3107 static ir_node *select_addr(const select_expression_t *expression)
3109 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3111 construct_select_compound(expression);
3113 ir_node *compound_addr = expression_to_firm(expression->compound);
3115 entity_t *entry = expression->compound_entry;
3116 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3117 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3119 if (constant_folding) {
3120 ir_mode *mode = get_irn_mode(compound_addr);
3121 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3122 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3123 return new_d_Add(dbgi, compound_addr, ofs, mode);
3125 ir_entity *irentity = entry->compound_member.entity;
3126 assert(irentity != NULL);
3127 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3131 static ir_node *select_to_firm(const select_expression_t *expression)
3133 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3134 ir_node *addr = select_addr(expression);
3135 type_t *type = revert_automatic_type_conversion(
3136 (const expression_t*) expression);
3137 type = skip_typeref(type);
3139 entity_t *entry = expression->compound_entry;
3140 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3142 if (entry->compound_member.bitfield) {
3143 return bitfield_extract_to_firm(expression, addr);
3146 return deref_address(dbgi, type, addr);
3149 /* Values returned by __builtin_classify_type. */
3150 typedef enum gcc_type_class
3156 enumeral_type_class,
3159 reference_type_class,
3163 function_type_class,
3174 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3176 type_t *type = expr->type_expression->base.type;
3178 /* FIXME gcc returns different values depending on whether compiling C or C++
3179 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3182 type = skip_typeref(type);
3183 switch (type->kind) {
3185 const atomic_type_t *const atomic_type = &type->atomic;
3186 switch (atomic_type->akind) {
3187 /* should not be reached */
3188 case ATOMIC_TYPE_INVALID:
3192 /* gcc cannot do that */
3193 case ATOMIC_TYPE_VOID:
3194 tc = void_type_class;
3197 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3198 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3199 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3200 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3201 case ATOMIC_TYPE_SHORT:
3202 case ATOMIC_TYPE_USHORT:
3203 case ATOMIC_TYPE_INT:
3204 case ATOMIC_TYPE_UINT:
3205 case ATOMIC_TYPE_LONG:
3206 case ATOMIC_TYPE_ULONG:
3207 case ATOMIC_TYPE_LONGLONG:
3208 case ATOMIC_TYPE_ULONGLONG:
3209 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3210 tc = integer_type_class;
3213 case ATOMIC_TYPE_FLOAT:
3214 case ATOMIC_TYPE_DOUBLE:
3215 case ATOMIC_TYPE_LONG_DOUBLE:
3216 tc = real_type_class;
3219 panic("Unexpected atomic type in classify_type_to_firm().");
3222 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3223 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3224 case TYPE_ARRAY: /* gcc handles this as pointer */
3225 case TYPE_FUNCTION: /* gcc handles this as pointer */
3226 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3227 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3228 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3230 /* gcc handles this as integer */
3231 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3233 /* gcc classifies the referenced type */
3234 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3236 /* typedef/typeof should be skipped already */
3242 panic("unexpected TYPE classify_type_to_firm().");
3246 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3247 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3248 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3249 return new_d_Const(dbgi, tv);
3252 static ir_node *function_name_to_firm(
3253 const funcname_expression_t *const expr)
3255 switch(expr->kind) {
3256 case FUNCNAME_FUNCTION:
3257 case FUNCNAME_PRETTY_FUNCTION:
3258 case FUNCNAME_FUNCDNAME:
3259 if (current_function_name == NULL) {
3260 const source_position_t *const src_pos = &expr->base.source_position;
3261 const char *name = current_function_entity->base.symbol->string;
3262 const string_t string = { name, strlen(name) + 1 };
3263 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3265 return current_function_name;
3266 case FUNCNAME_FUNCSIG:
3267 if (current_funcsig == NULL) {
3268 const source_position_t *const src_pos = &expr->base.source_position;
3269 ir_entity *ent = get_irg_entity(current_ir_graph);
3270 const char *const name = get_entity_ld_name(ent);
3271 const string_t string = { name, strlen(name) + 1 };
3272 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3274 return current_funcsig;
3276 panic("Unsupported function name");
3279 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3281 statement_t *statement = expr->statement;
3283 assert(statement->kind == STATEMENT_COMPOUND);
3284 return compound_statement_to_firm(&statement->compound);
3287 static ir_node *va_start_expression_to_firm(
3288 const va_start_expression_t *const expr)
3290 ir_entity *param_ent = current_vararg_entity;
3291 if (param_ent == NULL) {
3292 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3293 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3294 ir_type *const param_type = get_unknown_type();
3295 param_ent = new_parameter_entity(frame_type, n, param_type);
3296 current_vararg_entity = param_ent;
3299 ir_node *const frame = get_irg_frame(current_ir_graph);
3300 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3301 ir_node *const no_mem = new_NoMem();
3302 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3304 set_value_for_expression(expr->ap, arg_sel);
3309 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3311 type_t *const type = expr->base.type;
3312 expression_t *const ap_expr = expr->ap;
3313 ir_node *const ap_addr = expression_to_addr(ap_expr);
3314 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3315 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3316 ir_node *const res = deref_address(dbgi, type, ap);
3318 ir_node *const cnst = get_type_size_node(expr->base.type);
3319 ir_mode *const mode = get_irn_mode(cnst);
3320 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3321 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3322 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3323 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3324 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3326 set_value_for_expression_addr(ap_expr, add, ap_addr);
3332 * Generate Firm for a va_copy expression.
3334 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3336 ir_node *const src = expression_to_firm(expr->src);
3337 set_value_for_expression(expr->dst, src);
3341 static ir_node *dereference_addr(const unary_expression_t *const expression)
3343 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3344 return expression_to_firm(expression->value);
3348 * Returns a IR-node representing an lvalue of the given expression.
3350 static ir_node *expression_to_addr(const expression_t *expression)
3352 switch(expression->kind) {
3353 case EXPR_ARRAY_ACCESS:
3354 return array_access_addr(&expression->array_access);
3356 return call_expression_to_firm(&expression->call);
3357 case EXPR_COMPOUND_LITERAL:
3358 return compound_literal_addr(&expression->compound_literal);
3359 case EXPR_REFERENCE:
3360 return reference_addr(&expression->reference);
3362 return select_addr(&expression->select);
3363 case EXPR_UNARY_DEREFERENCE:
3364 return dereference_addr(&expression->unary);
3368 panic("trying to get address of non-lvalue");
3371 static ir_node *builtin_constant_to_firm(
3372 const builtin_constant_expression_t *expression)
3374 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3375 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3376 return create_Const_from_bool(mode, v);
3379 static ir_node *builtin_types_compatible_to_firm(
3380 const builtin_types_compatible_expression_t *expression)
3382 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3383 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3384 bool const value = types_compatible(left, right);
3385 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3386 return create_Const_from_bool(mode, value);
3389 static ir_node *get_label_block(label_t *label)
3391 if (label->block != NULL)
3392 return label->block;
3394 /* beware: might be called from create initializer with current_ir_graph
3395 * set to const_code_irg. */
3396 ir_graph *rem = current_ir_graph;
3397 current_ir_graph = current_function;
3399 ir_node *block = new_immBlock();
3401 label->block = block;
3403 ARR_APP1(label_t *, all_labels, label);
3405 current_ir_graph = rem;
3410 * Pointer to a label. This is used for the
3411 * GNU address-of-label extension.
3413 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3415 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3416 ir_node *block = get_label_block(label->label);
3417 ir_entity *entity = create_Block_entity(block);
3419 symconst_symbol value;
3420 value.entity_p = entity;
3421 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3425 * creates firm nodes for an expression. The difference between this function
3426 * and expression_to_firm is, that this version might produce mode_b nodes
3427 * instead of mode_Is.
3429 static ir_node *_expression_to_firm(expression_t const *const expr)
3432 if (!constant_folding) {
3433 assert(!expr->base.transformed);
3434 ((expression_t*)expr)->base.transformed = true;
3438 switch (expr->kind) {
3439 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3440 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3441 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3442 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3443 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3444 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3445 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3446 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3447 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3448 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3449 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3450 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3451 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3452 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3453 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3454 case EXPR_SELECT: return select_to_firm( &expr->select);
3455 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3456 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3457 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3458 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3459 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3460 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3461 case EXPR_WIDE_STRING_LITERAL: return wide_string_literal_to_firm( &expr->string_literal);
3463 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->literal.value);
3465 case EXPR_ERROR: break;
3467 panic("invalid expression found");
3471 * Check if a given expression is a GNU __builtin_expect() call.
3473 static bool is_builtin_expect(const expression_t *expression)
3475 if (expression->kind != EXPR_CALL)
3478 expression_t *function = expression->call.function;
3479 if (function->kind != EXPR_REFERENCE)
3481 reference_expression_t *ref = &function->reference;
3482 if (ref->entity->kind != ENTITY_FUNCTION ||
3483 ref->entity->function.btk != BUILTIN_EXPECT)
3489 static bool produces_mode_b(const expression_t *expression)
3491 switch (expression->kind) {
3492 case EXPR_BINARY_EQUAL:
3493 case EXPR_BINARY_NOTEQUAL:
3494 case EXPR_BINARY_LESS:
3495 case EXPR_BINARY_LESSEQUAL:
3496 case EXPR_BINARY_GREATER:
3497 case EXPR_BINARY_GREATEREQUAL:
3498 case EXPR_BINARY_ISGREATER:
3499 case EXPR_BINARY_ISGREATEREQUAL:
3500 case EXPR_BINARY_ISLESS:
3501 case EXPR_BINARY_ISLESSEQUAL:
3502 case EXPR_BINARY_ISLESSGREATER:
3503 case EXPR_BINARY_ISUNORDERED:
3504 case EXPR_UNARY_NOT:
3508 if (is_builtin_expect(expression)) {
3509 expression_t *argument = expression->call.arguments->expression;
3510 return produces_mode_b(argument);
3513 case EXPR_BINARY_COMMA:
3514 return produces_mode_b(expression->binary.right);
3521 static ir_node *expression_to_firm(const expression_t *expression)
3523 if (!produces_mode_b(expression)) {
3524 ir_node *res = _expression_to_firm(expression);
3525 assert(res == NULL || get_irn_mode(res) != mode_b);
3529 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3530 bool const constant_folding_old = constant_folding;
3531 constant_folding = true;
3532 ir_node *res = _expression_to_firm(expression);
3533 constant_folding = constant_folding_old;
3534 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3535 assert(is_Const(res));
3536 return create_Const_from_bool(mode, !is_Const_null(res));
3539 /* we have to produce a 0/1 from the mode_b expression */
3540 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3541 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3542 return produce_condition_result(expression, mode, dbgi);
3546 * create a short-circuit expression evaluation that tries to construct
3547 * efficient control flow structures for &&, || and ! expressions
3549 static ir_node *create_condition_evaluation(const expression_t *expression,
3550 ir_node *true_block,
3551 ir_node *false_block)
3553 switch(expression->kind) {
3554 case EXPR_UNARY_NOT: {
3555 const unary_expression_t *unary_expression = &expression->unary;
3556 create_condition_evaluation(unary_expression->value, false_block,
3560 case EXPR_BINARY_LOGICAL_AND: {
3561 const binary_expression_t *binary_expression = &expression->binary;
3563 ir_node *extra_block = new_immBlock();
3564 create_condition_evaluation(binary_expression->left, extra_block,
3566 mature_immBlock(extra_block);
3567 set_cur_block(extra_block);
3568 create_condition_evaluation(binary_expression->right, true_block,
3572 case EXPR_BINARY_LOGICAL_OR: {
3573 const binary_expression_t *binary_expression = &expression->binary;
3575 ir_node *extra_block = new_immBlock();
3576 create_condition_evaluation(binary_expression->left, true_block,
3578 mature_immBlock(extra_block);
3579 set_cur_block(extra_block);
3580 create_condition_evaluation(binary_expression->right, true_block,
3588 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3589 ir_node *cond_expr = _expression_to_firm(expression);
3590 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3591 ir_node *cond = new_d_Cond(dbgi, condition);
3592 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3593 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3595 /* set branch prediction info based on __builtin_expect */
3596 if (is_builtin_expect(expression) && is_Cond(cond)) {
3597 call_argument_t *argument = expression->call.arguments->next;
3598 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3599 bool const cnst = fold_constant_to_bool(argument->expression);
3600 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3601 set_Cond_jmp_pred(cond, pred);
3605 add_immBlock_pred(true_block, true_proj);
3606 add_immBlock_pred(false_block, false_proj);
3608 set_unreachable_now();
3612 static void create_variable_entity(entity_t *variable,
3613 declaration_kind_t declaration_kind,
3614 ir_type *parent_type)
3616 assert(variable->kind == ENTITY_VARIABLE);
3617 type_t *type = skip_typeref(variable->declaration.type);
3619 ident *const id = new_id_from_str(variable->base.symbol->string);
3620 ir_type *const irtype = get_ir_type(type);
3621 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3622 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3623 unsigned alignment = variable->declaration.alignment;
3625 set_entity_alignment(irentity, alignment);
3627 handle_decl_modifiers(irentity, variable);
3629 variable->declaration.kind = (unsigned char) declaration_kind;
3630 variable->variable.v.entity = irentity;
3631 set_entity_ld_ident(irentity, create_ld_ident(variable));
3633 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3634 set_entity_volatility(irentity, volatility_is_volatile);
3639 typedef struct type_path_entry_t type_path_entry_t;
3640 struct type_path_entry_t {
3642 ir_initializer_t *initializer;
3644 entity_t *compound_entry;
3647 typedef struct type_path_t type_path_t;
3648 struct type_path_t {
3649 type_path_entry_t *path;
3654 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3656 size_t len = ARR_LEN(path->path);
3658 for (size_t i = 0; i < len; ++i) {
3659 const type_path_entry_t *entry = & path->path[i];
3661 type_t *type = skip_typeref(entry->type);
3662 if (is_type_compound(type)) {
3663 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3664 } else if (is_type_array(type)) {
3665 fprintf(stderr, "[%u]", (unsigned) entry->index);
3667 fprintf(stderr, "-INVALID-");
3670 fprintf(stderr, " (");
3671 print_type(path->top_type);
3672 fprintf(stderr, ")");
3675 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3677 size_t len = ARR_LEN(path->path);
3679 return & path->path[len-1];
3682 static type_path_entry_t *append_to_type_path(type_path_t *path)
3684 size_t len = ARR_LEN(path->path);
3685 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3687 type_path_entry_t *result = & path->path[len];
3688 memset(result, 0, sizeof(result[0]));
3692 static size_t get_compound_member_count(const compound_type_t *type)
3694 compound_t *compound = type->compound;
3695 size_t n_members = 0;
3696 entity_t *member = compound->members.entities;
3697 for ( ; member != NULL; member = member->base.next) {
3704 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3706 type_t *orig_top_type = path->top_type;
3707 type_t *top_type = skip_typeref(orig_top_type);
3709 assert(is_type_compound(top_type) || is_type_array(top_type));
3711 if (ARR_LEN(path->path) == 0) {
3714 type_path_entry_t *top = get_type_path_top(path);
3715 ir_initializer_t *initializer = top->initializer;
3716 return get_initializer_compound_value(initializer, top->index);
3720 static void descend_into_subtype(type_path_t *path)
3722 type_t *orig_top_type = path->top_type;
3723 type_t *top_type = skip_typeref(orig_top_type);
3725 assert(is_type_compound(top_type) || is_type_array(top_type));
3727 ir_initializer_t *initializer = get_initializer_entry(path);
3729 type_path_entry_t *top = append_to_type_path(path);
3730 top->type = top_type;
3734 if (is_type_compound(top_type)) {
3735 compound_t *const compound = top_type->compound.compound;
3736 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3738 top->compound_entry = entry;
3740 len = get_compound_member_count(&top_type->compound);
3741 if (entry != NULL) {
3742 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3743 path->top_type = entry->declaration.type;
3746 assert(is_type_array(top_type));
3747 assert(top_type->array.size > 0);
3750 path->top_type = top_type->array.element_type;
3751 len = top_type->array.size;
3753 if (initializer == NULL
3754 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3755 initializer = create_initializer_compound(len);
3756 /* we have to set the entry at the 2nd latest path entry... */
3757 size_t path_len = ARR_LEN(path->path);
3758 assert(path_len >= 1);
3760 type_path_entry_t *entry = & path->path[path_len-2];
3761 ir_initializer_t *tinitializer = entry->initializer;
3762 set_initializer_compound_value(tinitializer, entry->index,
3766 top->initializer = initializer;
3769 static void ascend_from_subtype(type_path_t *path)
3771 type_path_entry_t *top = get_type_path_top(path);
3773 path->top_type = top->type;
3775 size_t len = ARR_LEN(path->path);
3776 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3779 static void walk_designator(type_path_t *path, const designator_t *designator)
3781 /* designators start at current object type */
3782 ARR_RESIZE(type_path_entry_t, path->path, 1);
3784 for ( ; designator != NULL; designator = designator->next) {
3785 type_path_entry_t *top = get_type_path_top(path);
3786 type_t *orig_type = top->type;
3787 type_t *type = skip_typeref(orig_type);
3789 if (designator->symbol != NULL) {
3790 assert(is_type_compound(type));
3792 symbol_t *symbol = designator->symbol;
3794 compound_t *compound = type->compound.compound;
3795 entity_t *iter = compound->members.entities;
3796 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3797 if (iter->base.symbol == symbol) {
3798 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3802 assert(iter != NULL);
3804 /* revert previous initialisations of other union elements */
3805 if (type->kind == TYPE_COMPOUND_UNION) {
3806 ir_initializer_t *initializer = top->initializer;
3807 if (initializer != NULL
3808 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3809 /* are we writing to a new element? */
3810 ir_initializer_t *oldi
3811 = get_initializer_compound_value(initializer, index);
3812 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3813 /* clear initializer */
3815 = get_initializer_compound_n_entries(initializer);
3816 ir_initializer_t *nulli = get_initializer_null();
3817 for (size_t i = 0; i < len; ++i) {
3818 set_initializer_compound_value(initializer, i,
3825 top->type = orig_type;
3826 top->compound_entry = iter;
3828 orig_type = iter->declaration.type;
3830 expression_t *array_index = designator->array_index;
3831 assert(designator->array_index != NULL);
3832 assert(is_type_array(type));
3834 long index = fold_constant_to_int(array_index);
3837 if (type->array.size_constant) {
3838 long array_size = type->array.size;
3839 assert(index < array_size);
3843 top->type = orig_type;
3844 top->index = (size_t) index;
3845 orig_type = type->array.element_type;
3847 path->top_type = orig_type;
3849 if (designator->next != NULL) {
3850 descend_into_subtype(path);
3854 path->invalid = false;
3857 static void advance_current_object(type_path_t *path)
3859 if (path->invalid) {
3860 /* TODO: handle this... */
3861 panic("invalid initializer in ast2firm (excessive elements)");
3864 type_path_entry_t *top = get_type_path_top(path);
3866 type_t *type = skip_typeref(top->type);
3867 if (is_type_union(type)) {
3868 /* only the first element is initialized in unions */
3869 top->compound_entry = NULL;
3870 } else if (is_type_struct(type)) {
3871 entity_t *entry = top->compound_entry;
3874 entry = skip_unnamed_bitfields(entry->base.next);
3875 top->compound_entry = entry;
3876 if (entry != NULL) {
3877 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3878 path->top_type = entry->declaration.type;
3882 assert(is_type_array(type));
3885 if (!type->array.size_constant || top->index < type->array.size) {
3890 /* we're past the last member of the current sub-aggregate, try if we
3891 * can ascend in the type hierarchy and continue with another subobject */
3892 size_t len = ARR_LEN(path->path);
3895 ascend_from_subtype(path);
3896 advance_current_object(path);
3898 path->invalid = true;
3903 static ir_initializer_t *create_ir_initializer_value(
3904 const initializer_value_t *initializer)
3906 if (is_type_compound(initializer->value->base.type)) {
3907 panic("initializer creation for compounds not implemented yet");
3909 type_t *type = initializer->value->base.type;
3910 expression_t *expr = initializer->value;
3911 ir_node *value = expression_to_firm(expr);
3912 ir_mode *mode = get_ir_mode_storage(type);
3913 value = create_conv(NULL, value, mode);
3914 return create_initializer_const(value);
3917 /** test wether type can be initialized by a string constant */
3918 static bool is_string_type(type_t *type)
3921 if (is_type_pointer(type)) {
3922 inner = skip_typeref(type->pointer.points_to);
3923 } else if(is_type_array(type)) {
3924 inner = skip_typeref(type->array.element_type);
3929 return is_type_integer(inner);
3932 static ir_initializer_t *create_ir_initializer_list(
3933 const initializer_list_t *initializer, type_t *type)
3936 memset(&path, 0, sizeof(path));
3937 path.top_type = type;
3938 path.path = NEW_ARR_F(type_path_entry_t, 0);
3940 descend_into_subtype(&path);
3942 for (size_t i = 0; i < initializer->len; ++i) {
3943 const initializer_t *sub_initializer = initializer->initializers[i];
3945 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3946 walk_designator(&path, sub_initializer->designator.designator);
3950 if (sub_initializer->kind == INITIALIZER_VALUE) {
3951 /* we might have to descend into types until we're at a scalar
3954 type_t *orig_top_type = path.top_type;
3955 type_t *top_type = skip_typeref(orig_top_type);
3957 if (is_type_scalar(top_type))
3959 descend_into_subtype(&path);
3961 } else if (sub_initializer->kind == INITIALIZER_STRING
3962 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3963 /* we might have to descend into types until we're at a scalar
3966 type_t *orig_top_type = path.top_type;
3967 type_t *top_type = skip_typeref(orig_top_type);
3969 if (is_string_type(top_type))
3971 descend_into_subtype(&path);
3975 ir_initializer_t *sub_irinitializer
3976 = create_ir_initializer(sub_initializer, path.top_type);
3978 size_t path_len = ARR_LEN(path.path);
3979 assert(path_len >= 1);
3980 type_path_entry_t *entry = & path.path[path_len-1];
3981 ir_initializer_t *tinitializer = entry->initializer;
3982 set_initializer_compound_value(tinitializer, entry->index,
3985 advance_current_object(&path);
3988 assert(ARR_LEN(path.path) >= 1);
3989 ir_initializer_t *result = path.path[0].initializer;
3990 DEL_ARR_F(path.path);
3995 static ir_initializer_t *create_ir_initializer_string(
3996 const initializer_string_t *initializer, type_t *type)
3998 type = skip_typeref(type);
4000 size_t string_len = initializer->string.size;
4001 assert(type->kind == TYPE_ARRAY);
4002 assert(type->array.size_constant);
4003 size_t len = type->array.size;
4004 ir_initializer_t *irinitializer = create_initializer_compound(len);
4006 const char *string = initializer->string.begin;
4007 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
4009 for (size_t i = 0; i < len; ++i) {
4014 ir_tarval *tv = new_tarval_from_long(c, mode);
4015 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4017 set_initializer_compound_value(irinitializer, i, char_initializer);
4020 return irinitializer;
4023 static ir_initializer_t *create_ir_initializer_wide_string(
4024 const initializer_wide_string_t *initializer, type_t *type)
4026 assert(type->kind == TYPE_ARRAY);
4027 assert(type->array.size_constant);
4028 size_t len = type->array.size;
4029 size_t string_len = wstrlen(&initializer->string);
4030 ir_initializer_t *irinitializer = create_initializer_compound(len);
4032 const char *p = initializer->string.begin;
4033 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4035 for (size_t i = 0; i < len; ++i) {
4037 if (i < string_len) {
4038 c = read_utf8_char(&p);
4040 ir_tarval *tv = new_tarval_from_long(c, mode);
4041 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4043 set_initializer_compound_value(irinitializer, i, char_initializer);
4046 return irinitializer;
4049 static ir_initializer_t *create_ir_initializer(
4050 const initializer_t *initializer, type_t *type)
4052 switch(initializer->kind) {
4053 case INITIALIZER_STRING:
4054 return create_ir_initializer_string(&initializer->string, type);
4056 case INITIALIZER_WIDE_STRING:
4057 return create_ir_initializer_wide_string(&initializer->wide_string,
4060 case INITIALIZER_LIST:
4061 return create_ir_initializer_list(&initializer->list, type);
4063 case INITIALIZER_VALUE:
4064 return create_ir_initializer_value(&initializer->value);
4066 case INITIALIZER_DESIGNATOR:
4067 panic("unexpected designator initializer found");
4069 panic("unknown initializer");
4072 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4073 * are elements [...] the remainder of the aggregate shall be initialized
4074 * implicitly the same as objects that have static storage duration. */
4075 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4078 /* for unions we must NOT do anything for null initializers */
4079 ir_type *owner = get_entity_owner(entity);
4080 if (is_Union_type(owner)) {
4084 ir_type *ent_type = get_entity_type(entity);
4085 /* create sub-initializers for a compound type */
4086 if (is_compound_type(ent_type)) {
4087 unsigned n_members = get_compound_n_members(ent_type);
4088 for (unsigned n = 0; n < n_members; ++n) {
4089 ir_entity *member = get_compound_member(ent_type, n);
4090 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4092 create_dynamic_null_initializer(member, dbgi, addr);
4096 if (is_Array_type(ent_type)) {
4097 assert(has_array_upper_bound(ent_type, 0));
4098 long n = get_array_upper_bound_int(ent_type, 0);
4099 for (long i = 0; i < n; ++i) {
4100 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4101 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4102 ir_node *cnst = new_d_Const(dbgi, index_tv);
4103 ir_node *in[1] = { cnst };
4104 ir_entity *arrent = get_array_element_entity(ent_type);
4105 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4107 create_dynamic_null_initializer(arrent, dbgi, addr);
4112 ir_mode *value_mode = get_type_mode(ent_type);
4113 ir_node *node = new_Const(get_mode_null(value_mode));
4115 /* is it a bitfield type? */
4116 if (is_Primitive_type(ent_type) &&
4117 get_primitive_base_type(ent_type) != NULL) {
4118 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4122 ir_node *mem = get_store();
4123 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4124 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4128 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4129 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4131 switch(get_initializer_kind(initializer)) {
4132 case IR_INITIALIZER_NULL:
4133 create_dynamic_null_initializer(entity, dbgi, base_addr);
4135 case IR_INITIALIZER_CONST: {
4136 ir_node *node = get_initializer_const_value(initializer);
4137 ir_type *ent_type = get_entity_type(entity);
4139 /* is it a bitfield type? */
4140 if (is_Primitive_type(ent_type) &&
4141 get_primitive_base_type(ent_type) != NULL) {
4142 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4146 assert(get_type_mode(type) == get_irn_mode(node));
4147 ir_node *mem = get_store();
4148 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4149 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4153 case IR_INITIALIZER_TARVAL: {
4154 ir_tarval *tv = get_initializer_tarval_value(initializer);
4155 ir_node *cnst = new_d_Const(dbgi, tv);
4156 ir_type *ent_type = get_entity_type(entity);
4158 /* is it a bitfield type? */
4159 if (is_Primitive_type(ent_type) &&
4160 get_primitive_base_type(ent_type) != NULL) {
4161 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4165 assert(get_type_mode(type) == get_tarval_mode(tv));
4166 ir_node *mem = get_store();
4167 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4168 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4172 case IR_INITIALIZER_COMPOUND: {
4173 assert(is_compound_type(type) || is_Array_type(type));
4175 if (is_Array_type(type)) {
4176 assert(has_array_upper_bound(type, 0));
4177 n_members = get_array_upper_bound_int(type, 0);
4179 n_members = get_compound_n_members(type);
4182 if (get_initializer_compound_n_entries(initializer)
4183 != (unsigned) n_members)
4184 panic("initializer doesn't match compound type");
4186 for (int i = 0; i < n_members; ++i) {
4189 ir_entity *sub_entity;
4190 if (is_Array_type(type)) {
4191 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4192 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4193 ir_node *cnst = new_d_Const(dbgi, index_tv);
4194 ir_node *in[1] = { cnst };
4195 irtype = get_array_element_type(type);
4196 sub_entity = get_array_element_entity(type);
4197 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4200 sub_entity = get_compound_member(type, i);
4201 irtype = get_entity_type(sub_entity);
4202 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4206 ir_initializer_t *sub_init
4207 = get_initializer_compound_value(initializer, i);
4209 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4216 panic("invalid IR_INITIALIZER found");
4219 static void create_dynamic_initializer(ir_initializer_t *initializer,
4220 dbg_info *dbgi, ir_entity *entity)
4222 ir_node *frame = get_irg_frame(current_ir_graph);
4223 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4224 ir_type *type = get_entity_type(entity);
4226 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4229 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4230 ir_entity *entity, type_t *type)
4232 ir_node *memory = get_store();
4233 ir_node *nomem = new_NoMem();
4234 ir_node *frame = get_irg_frame(current_ir_graph);
4235 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4237 if (initializer->kind == INITIALIZER_VALUE) {
4238 initializer_value_t *initializer_value = &initializer->value;
4240 ir_node *value = expression_to_firm(initializer_value->value);
4241 type = skip_typeref(type);
4242 assign_value(dbgi, addr, type, value);
4246 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4247 ir_initializer_t *irinitializer
4248 = create_ir_initializer(initializer, type);
4250 create_dynamic_initializer(irinitializer, dbgi, entity);
4254 /* create a "template" entity which is copied to the entity on the stack */
4255 ir_entity *const init_entity
4256 = create_initializer_entity(dbgi, initializer, type);
4257 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4258 ir_type *const irtype = get_ir_type(type);
4259 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4261 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4262 set_store(copyb_mem);
4265 static void create_initializer_local_variable_entity(entity_t *entity)
4267 assert(entity->kind == ENTITY_VARIABLE);
4268 initializer_t *initializer = entity->variable.initializer;
4269 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4270 ir_entity *irentity = entity->variable.v.entity;
4271 type_t *type = entity->declaration.type;
4273 create_local_initializer(initializer, dbgi, irentity, type);
4276 static void create_variable_initializer(entity_t *entity)
4278 assert(entity->kind == ENTITY_VARIABLE);
4279 initializer_t *initializer = entity->variable.initializer;
4280 if (initializer == NULL)
4283 declaration_kind_t declaration_kind
4284 = (declaration_kind_t) entity->declaration.kind;
4285 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4286 create_initializer_local_variable_entity(entity);
4290 type_t *type = entity->declaration.type;
4291 type_qualifiers_t tq = get_type_qualifier(type, true);
4293 if (initializer->kind == INITIALIZER_VALUE) {
4294 initializer_value_t *initializer_value = &initializer->value;
4295 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4296 expression_t *value = initializer_value->value;
4297 type_t *init_type = value->base.type;
4298 type_t *skipped = skip_typeref(init_type);
4300 if (!is_type_scalar(skipped)) {
4302 while (value->kind == EXPR_UNARY_CAST)
4303 value = value->unary.value;
4305 if (value->kind != EXPR_COMPOUND_LITERAL)
4306 panic("expected non-scalar initializer to be a compound literal");
4307 initializer = value->compound_literal.initializer;
4308 goto have_initializer;
4311 ir_node *node = expression_to_firm(initializer_value->value);
4313 ir_mode *mode = get_ir_mode_storage(init_type);
4314 node = create_conv(dbgi, node, mode);
4315 node = do_strict_conv(dbgi, node);
4317 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4318 set_value(entity->variable.v.value_number, node);
4320 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4322 ir_entity *irentity = entity->variable.v.entity;
4324 if (tq & TYPE_QUALIFIER_CONST
4325 && get_entity_owner(irentity) != get_tls_type()) {
4326 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4328 set_atomic_ent_value(irentity, node);
4332 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4333 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4335 ir_entity *irentity = entity->variable.v.entity;
4336 ir_initializer_t *irinitializer
4337 = create_ir_initializer(initializer, type);
4339 if (tq & TYPE_QUALIFIER_CONST) {
4340 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4342 set_entity_initializer(irentity, irinitializer);
4346 static void create_variable_length_array(entity_t *entity)
4348 assert(entity->kind == ENTITY_VARIABLE);
4349 assert(entity->variable.initializer == NULL);
4351 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4352 entity->variable.v.vla_base = NULL;
4354 /* TODO: record VLA somewhere so we create the free node when we leave
4358 static void allocate_variable_length_array(entity_t *entity)
4360 assert(entity->kind == ENTITY_VARIABLE);
4361 assert(entity->variable.initializer == NULL);
4362 assert(currently_reachable());
4364 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4365 type_t *type = entity->declaration.type;
4366 ir_type *el_type = get_ir_type(type->array.element_type);
4368 /* make sure size_node is calculated */
4369 get_type_size_node(type);
4370 ir_node *elems = type->array.size_node;
4371 ir_node *mem = get_store();
4372 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4374 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4375 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4378 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4379 entity->variable.v.vla_base = addr;
4383 * Creates a Firm local variable from a declaration.
4385 static void create_local_variable(entity_t *entity)
4387 assert(entity->kind == ENTITY_VARIABLE);
4388 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4390 bool needs_entity = entity->variable.address_taken;
4391 type_t *type = skip_typeref(entity->declaration.type);
4393 /* is it a variable length array? */
4394 if (is_type_array(type) && !type->array.size_constant) {
4395 create_variable_length_array(entity);
4397 } else if (is_type_array(type) || is_type_compound(type)) {
4398 needs_entity = true;
4399 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4400 needs_entity = true;
4404 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4405 create_variable_entity(entity,
4406 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4409 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4410 entity->variable.v.value_number = next_value_number_function;
4411 set_irg_loc_description(current_ir_graph, next_value_number_function,
4413 ++next_value_number_function;
4417 static void create_local_static_variable(entity_t *entity)
4419 assert(entity->kind == ENTITY_VARIABLE);
4420 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4422 type_t *type = skip_typeref(entity->declaration.type);
4423 ir_type *const var_type = entity->variable.thread_local ?
4424 get_tls_type() : get_glob_type();
4425 ir_type *const irtype = get_ir_type(type);
4426 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4428 size_t l = strlen(entity->base.symbol->string);
4429 char buf[l + sizeof(".%u")];
4430 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4431 ident *const id = id_unique(buf);
4432 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4434 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4435 set_entity_volatility(irentity, volatility_is_volatile);
4438 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4439 entity->variable.v.entity = irentity;
4441 set_entity_ld_ident(irentity, id);
4442 set_entity_visibility(irentity, ir_visibility_local);
4444 ir_graph *const old_current_ir_graph = current_ir_graph;
4445 current_ir_graph = get_const_code_irg();
4447 create_variable_initializer(entity);
4449 assert(current_ir_graph == get_const_code_irg());
4450 current_ir_graph = old_current_ir_graph;
4455 static ir_node *return_statement_to_firm(return_statement_t *statement)
4457 if (!currently_reachable())
4460 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4461 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4462 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4465 if (!is_type_void(type)) {
4466 ir_mode *const mode = is_type_compound(type) ? mode_P_data : get_ir_mode_storage(type);
4468 res = create_conv(dbgi, res, mode);
4469 res = do_strict_conv(dbgi, res);
4471 res = new_Unknown(mode);
4478 ir_node *const in[1] = { res };
4479 ir_node *const store = get_store();
4480 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4482 ir_node *end_block = get_irg_end_block(current_ir_graph);
4483 add_immBlock_pred(end_block, ret);
4485 set_unreachable_now();
4489 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4491 if (!currently_reachable())
4494 return expression_to_firm(statement->expression);
4497 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4499 entity_t *entity = compound->scope.entities;
4500 for ( ; entity != NULL; entity = entity->base.next) {
4501 if (!is_declaration(entity))
4504 create_local_declaration(entity);
4507 ir_node *result = NULL;
4508 statement_t *statement = compound->statements;
4509 for ( ; statement != NULL; statement = statement->base.next) {
4510 result = statement_to_firm(statement);
4516 static void create_global_variable(entity_t *entity)
4518 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4519 ir_visibility visibility = ir_visibility_default;
4520 ir_entity *irentity;
4521 assert(entity->kind == ENTITY_VARIABLE);
4523 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4524 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4525 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4526 case STORAGE_CLASS_NONE:
4527 visibility = ir_visibility_default;
4528 /* uninitialized globals get merged in C */
4529 if (entity->variable.initializer == NULL)
4530 linkage |= IR_LINKAGE_MERGE;
4532 case STORAGE_CLASS_TYPEDEF:
4533 case STORAGE_CLASS_AUTO:
4534 case STORAGE_CLASS_REGISTER:
4535 panic("invalid storage class for global var");
4538 ir_type *var_type = get_glob_type();
4539 if (entity->variable.thread_local) {
4540 var_type = get_tls_type();
4541 /* LINKAGE_MERGE not supported by current linkers */
4542 linkage &= ~IR_LINKAGE_MERGE;
4544 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4545 irentity = entity->variable.v.entity;
4546 add_entity_linkage(irentity, linkage);
4547 set_entity_visibility(irentity, visibility);
4550 static void create_local_declaration(entity_t *entity)
4552 assert(is_declaration(entity));
4554 /* construct type */
4555 (void) get_ir_type(entity->declaration.type);
4556 if (entity->base.symbol == NULL) {
4560 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4561 case STORAGE_CLASS_STATIC:
4562 if (entity->kind == ENTITY_FUNCTION) {
4563 (void)get_function_entity(entity, NULL);
4565 create_local_static_variable(entity);
4568 case STORAGE_CLASS_EXTERN:
4569 if (entity->kind == ENTITY_FUNCTION) {
4570 assert(entity->function.statement == NULL);
4571 (void)get_function_entity(entity, NULL);
4573 create_global_variable(entity);
4574 create_variable_initializer(entity);
4577 case STORAGE_CLASS_NONE:
4578 case STORAGE_CLASS_AUTO:
4579 case STORAGE_CLASS_REGISTER:
4580 if (entity->kind == ENTITY_FUNCTION) {
4581 if (entity->function.statement != NULL) {
4582 ir_type *owner = get_irg_frame_type(current_ir_graph);
4583 (void)get_function_entity(entity, owner);
4584 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4585 enqueue_inner_function(entity);
4587 (void)get_function_entity(entity, NULL);
4590 create_local_variable(entity);
4593 case STORAGE_CLASS_TYPEDEF:
4596 panic("invalid storage class found");
4599 static void initialize_local_declaration(entity_t *entity)
4601 if (entity->base.symbol == NULL)
4604 // no need to emit code in dead blocks
4605 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4606 && !currently_reachable())
4609 switch ((declaration_kind_t) entity->declaration.kind) {
4610 case DECLARATION_KIND_LOCAL_VARIABLE:
4611 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4612 create_variable_initializer(entity);
4615 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4616 allocate_variable_length_array(entity);
4619 case DECLARATION_KIND_COMPOUND_MEMBER:
4620 case DECLARATION_KIND_GLOBAL_VARIABLE:
4621 case DECLARATION_KIND_FUNCTION:
4622 case DECLARATION_KIND_INNER_FUNCTION:
4625 case DECLARATION_KIND_PARAMETER:
4626 case DECLARATION_KIND_PARAMETER_ENTITY:
4627 panic("can't initialize parameters");
4629 case DECLARATION_KIND_UNKNOWN:
4630 panic("can't initialize unknown declaration");
4632 panic("invalid declaration kind");
4635 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4637 entity_t *entity = statement->declarations_begin;
4641 entity_t *const last = statement->declarations_end;
4642 for ( ;; entity = entity->base.next) {
4643 if (is_declaration(entity)) {
4644 initialize_local_declaration(entity);
4645 } else if (entity->kind == ENTITY_TYPEDEF) {
4646 /* ยง6.7.7:3 Any array size expressions associated with variable length
4647 * array declarators are evaluated each time the declaration of the
4648 * typedef name is reached in the order of execution. */
4649 type_t *const type = skip_typeref(entity->typedefe.type);
4650 if (is_type_array(type) && type->array.is_vla)
4651 get_vla_size(&type->array);
4660 static ir_node *if_statement_to_firm(if_statement_t *statement)
4662 /* Create the condition. */
4663 ir_node *true_block = NULL;
4664 ir_node *false_block = NULL;
4665 if (currently_reachable()) {
4666 true_block = new_immBlock();
4667 false_block = new_immBlock();
4668 create_condition_evaluation(statement->condition, true_block, false_block);
4669 mature_immBlock(true_block);
4670 mature_immBlock(false_block);
4673 /* Create the true statement. */
4674 set_cur_block(true_block);
4675 statement_to_firm(statement->true_statement);
4676 ir_node *fallthrough_block = get_cur_block();
4678 /* Create the false statement. */
4679 set_cur_block(false_block);
4680 if (statement->false_statement != NULL) {
4681 statement_to_firm(statement->false_statement);
4684 /* Handle the block after the if-statement. Minor simplification and
4685 * optimisation: Reuse the false/true block as fallthrough block, if the
4686 * true/false statement does not pass control to the fallthrough block, e.g.
4687 * in the typical if (x) return; pattern. */
4688 if (fallthrough_block) {
4689 if (currently_reachable()) {
4690 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4691 ir_node *const f_jump = new_Jmp();
4692 ir_node *const in[] = { t_jump, f_jump };
4693 fallthrough_block = new_Block(2, in);
4695 set_cur_block(fallthrough_block);
4702 * Add an unconditional jump to the target block. If the source block is not
4703 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4704 * loops. This is necessary if the jump potentially enters a loop.
4706 static void jump_to(ir_node *const target_block)
4708 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4709 add_immBlock_pred(target_block, pred);
4713 * Add an unconditional jump to the target block, if the current block is
4714 * reachable and do nothing otherwise. This is only valid if the jump does not
4715 * enter a loop (a back edge is ok).
4717 static void jump_if_reachable(ir_node *const target_block)
4719 if (currently_reachable())
4720 add_immBlock_pred(target_block, new_Jmp());
4723 static ir_node *while_statement_to_firm(while_statement_t *statement)
4725 /* Create the header block */
4726 ir_node *const header_block = new_immBlock();
4727 jump_to(header_block);
4729 /* Create the condition. */
4730 ir_node * body_block;
4731 ir_node * false_block;
4732 expression_t *const cond = statement->condition;
4733 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4734 fold_constant_to_bool(cond)) {
4735 /* Shortcut for while (true). */
4736 body_block = header_block;
4739 keep_alive(header_block);
4740 keep_all_memory(header_block);
4742 body_block = new_immBlock();
4743 false_block = new_immBlock();
4745 set_cur_block(header_block);
4746 create_condition_evaluation(cond, body_block, false_block);
4747 mature_immBlock(body_block);
4750 ir_node *const old_continue_label = continue_label;
4751 ir_node *const old_break_label = break_label;
4752 continue_label = header_block;
4753 break_label = false_block;
4755 /* Create the loop body. */
4756 set_cur_block(body_block);
4757 statement_to_firm(statement->body);
4758 jump_if_reachable(header_block);
4760 mature_immBlock(header_block);
4761 assert(false_block == NULL || false_block == break_label);
4762 false_block = break_label;
4763 if (false_block != NULL) {
4764 mature_immBlock(false_block);
4766 set_cur_block(false_block);
4768 assert(continue_label == header_block);
4769 continue_label = old_continue_label;
4770 break_label = old_break_label;
4774 static ir_node *get_break_label(void)
4776 if (break_label == NULL) {
4777 break_label = new_immBlock();
4782 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4784 /* create the header block */
4785 ir_node *header_block = new_immBlock();
4788 ir_node *body_block = new_immBlock();
4789 jump_to(body_block);
4791 ir_node *old_continue_label = continue_label;
4792 ir_node *old_break_label = break_label;
4793 continue_label = header_block;
4796 set_cur_block(body_block);
4797 statement_to_firm(statement->body);
4798 ir_node *const false_block = get_break_label();
4800 assert(continue_label == header_block);
4801 continue_label = old_continue_label;
4802 break_label = old_break_label;
4804 jump_if_reachable(header_block);
4806 /* create the condition */
4807 mature_immBlock(header_block);
4808 set_cur_block(header_block);
4810 create_condition_evaluation(statement->condition, body_block, false_block);
4811 mature_immBlock(body_block);
4812 mature_immBlock(false_block);
4814 set_cur_block(false_block);
4818 static ir_node *for_statement_to_firm(for_statement_t *statement)
4820 /* create declarations */
4821 entity_t *entity = statement->scope.entities;
4822 for ( ; entity != NULL; entity = entity->base.next) {
4823 if (!is_declaration(entity))
4826 create_local_declaration(entity);
4829 if (currently_reachable()) {
4830 entity = statement->scope.entities;
4831 for ( ; entity != NULL; entity = entity->base.next) {
4832 if (!is_declaration(entity))
4835 initialize_local_declaration(entity);
4838 if (statement->initialisation != NULL) {
4839 expression_to_firm(statement->initialisation);
4843 /* Create the header block */
4844 ir_node *const header_block = new_immBlock();
4845 jump_to(header_block);
4847 /* Create the condition. */
4848 ir_node *body_block;
4849 ir_node *false_block;
4850 if (statement->condition != NULL) {
4851 body_block = new_immBlock();
4852 false_block = new_immBlock();
4854 set_cur_block(header_block);
4855 create_condition_evaluation(statement->condition, body_block, false_block);
4856 mature_immBlock(body_block);
4859 body_block = header_block;
4862 keep_alive(header_block);
4863 keep_all_memory(header_block);
4866 /* Create the step block, if necessary. */
4867 ir_node * step_block = header_block;
4868 expression_t *const step = statement->step;
4870 step_block = new_immBlock();
4873 ir_node *const old_continue_label = continue_label;
4874 ir_node *const old_break_label = break_label;
4875 continue_label = step_block;
4876 break_label = false_block;
4878 /* Create the loop body. */
4879 set_cur_block(body_block);
4880 statement_to_firm(statement->body);
4881 jump_if_reachable(step_block);
4883 /* Create the step code. */
4885 mature_immBlock(step_block);
4886 set_cur_block(step_block);
4887 expression_to_firm(step);
4888 jump_if_reachable(header_block);
4891 mature_immBlock(header_block);
4892 assert(false_block == NULL || false_block == break_label);
4893 false_block = break_label;
4894 if (false_block != NULL) {
4895 mature_immBlock(false_block);
4897 set_cur_block(false_block);
4899 assert(continue_label == step_block);
4900 continue_label = old_continue_label;
4901 break_label = old_break_label;
4905 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4907 if (!currently_reachable())
4910 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4911 ir_node *jump = new_d_Jmp(dbgi);
4912 add_immBlock_pred(target_block, jump);
4914 set_unreachable_now();
4918 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4920 /* determine number of cases */
4922 for (case_label_statement_t *l = statement->first_case; l != NULL;
4925 if (l->expression == NULL)
4927 if (l->is_empty_range)
4932 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4934 for (case_label_statement_t *l = statement->first_case; l != NULL;
4936 if (l->expression == NULL) {
4937 l->pn = pn_Switch_default;
4940 if (l->is_empty_range)
4942 ir_tarval *min = fold_constant_to_tarval(l->expression);
4943 ir_tarval *max = min;
4944 long pn = (long) i+1;
4945 if (l->end_range != NULL)
4946 max = fold_constant_to_tarval(l->end_range);
4947 ir_switch_table_set(res, i++, min, max, pn);
4953 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4955 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4956 ir_node *switch_node = NULL;
4958 if (currently_reachable()) {
4959 ir_node *expression = expression_to_firm(statement->expression);
4960 ir_switch_table *table = create_switch_table(statement);
4961 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4963 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4966 set_unreachable_now();
4968 ir_node *const old_switch = current_switch;
4969 ir_node *const old_break_label = break_label;
4970 const bool old_saw_default_label = saw_default_label;
4971 saw_default_label = false;
4972 current_switch = switch_node;
4975 statement_to_firm(statement->body);
4977 if (currently_reachable()) {
4978 add_immBlock_pred(get_break_label(), new_Jmp());
4981 if (!saw_default_label && switch_node) {
4982 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4983 add_immBlock_pred(get_break_label(), proj);
4986 if (break_label != NULL) {
4987 mature_immBlock(break_label);
4989 set_cur_block(break_label);
4991 assert(current_switch == switch_node);
4992 current_switch = old_switch;
4993 break_label = old_break_label;
4994 saw_default_label = old_saw_default_label;
4998 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
5000 if (statement->is_empty_range)
5003 if (current_switch != NULL) {
5004 ir_node *block = new_immBlock();
5005 /* Fallthrough from previous case */
5006 jump_if_reachable(block);
5008 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
5009 add_immBlock_pred(block, proj);
5010 if (statement->expression == NULL)
5011 saw_default_label = true;
5013 mature_immBlock(block);
5014 set_cur_block(block);
5017 return statement_to_firm(statement->statement);
5020 static ir_node *label_to_firm(const label_statement_t *statement)
5022 ir_node *block = get_label_block(statement->label);
5025 set_cur_block(block);
5027 keep_all_memory(block);
5029 return statement_to_firm(statement->statement);
5032 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
5034 if (!currently_reachable())
5037 ir_node *const irn = expression_to_firm(statement->expression);
5038 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5039 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
5041 set_irn_link(ijmp, ijmp_list);
5044 set_unreachable_now();
5048 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
5050 bool needs_memory = false;
5052 if (statement->is_volatile) {
5053 needs_memory = true;
5056 size_t n_clobbers = 0;
5057 asm_clobber_t *clobber = statement->clobbers;
5058 for ( ; clobber != NULL; clobber = clobber->next) {
5059 const char *clobber_str = clobber->clobber.begin;
5061 if (!be_is_valid_clobber(clobber_str)) {
5062 errorf(&statement->base.source_position,
5063 "invalid clobber '%s' specified", clobber->clobber);
5067 if (streq(clobber_str, "memory")) {
5068 needs_memory = true;
5072 ident *id = new_id_from_str(clobber_str);
5073 obstack_ptr_grow(&asm_obst, id);
5076 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5077 ident **clobbers = NULL;
5078 if (n_clobbers > 0) {
5079 clobbers = obstack_finish(&asm_obst);
5082 size_t n_inputs = 0;
5083 asm_argument_t *argument = statement->inputs;
5084 for ( ; argument != NULL; argument = argument->next)
5086 size_t n_outputs = 0;
5087 argument = statement->outputs;
5088 for ( ; argument != NULL; argument = argument->next)
5091 unsigned next_pos = 0;
5093 ir_node *ins[n_inputs + n_outputs + 1];
5096 ir_asm_constraint tmp_in_constraints[n_outputs];
5098 const expression_t *out_exprs[n_outputs];
5099 ir_node *out_addrs[n_outputs];
5100 size_t out_size = 0;
5102 argument = statement->outputs;
5103 for ( ; argument != NULL; argument = argument->next) {
5104 const char *constraints = argument->constraints.begin;
5105 asm_constraint_flags_t asm_flags
5106 = be_parse_asm_constraints(constraints);
5109 source_position_t const *const pos = &statement->base.source_position;
5110 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5111 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5113 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5114 errorf(pos, "some constraints in '%s' are invalid", constraints);
5117 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5118 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5123 unsigned pos = next_pos++;
5124 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5125 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5126 expression_t *expr = argument->expression;
5127 ir_node *addr = expression_to_addr(expr);
5128 /* in+output, construct an artifical same_as constraint on the
5130 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5132 ir_node *value = get_value_from_lvalue(expr, addr);
5134 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5136 ir_asm_constraint constraint;
5137 constraint.pos = pos;
5138 constraint.constraint = new_id_from_str(buf);
5139 constraint.mode = get_ir_mode_storage(expr->base.type);
5140 tmp_in_constraints[in_size] = constraint;
5141 ins[in_size] = value;
5146 out_exprs[out_size] = expr;
5147 out_addrs[out_size] = addr;
5149 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5150 /* pure memory ops need no input (but we have to make sure we
5151 * attach to the memory) */
5152 assert(! (asm_flags &
5153 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5154 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5155 needs_memory = true;
5157 /* we need to attach the address to the inputs */
5158 expression_t *expr = argument->expression;
5160 ir_asm_constraint constraint;
5161 constraint.pos = pos;
5162 constraint.constraint = new_id_from_str(constraints);
5163 constraint.mode = mode_M;
5164 tmp_in_constraints[in_size] = constraint;
5166 ins[in_size] = expression_to_addr(expr);
5170 errorf(&statement->base.source_position,
5171 "only modifiers but no place set in constraints '%s'",
5176 ir_asm_constraint constraint;
5177 constraint.pos = pos;
5178 constraint.constraint = new_id_from_str(constraints);
5179 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5181 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5183 assert(obstack_object_size(&asm_obst)
5184 == out_size * sizeof(ir_asm_constraint));
5185 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5188 obstack_grow(&asm_obst, tmp_in_constraints,
5189 in_size * sizeof(tmp_in_constraints[0]));
5190 /* find and count input and output arguments */
5191 argument = statement->inputs;
5192 for ( ; argument != NULL; argument = argument->next) {
5193 const char *constraints = argument->constraints.begin;
5194 asm_constraint_flags_t asm_flags
5195 = be_parse_asm_constraints(constraints);
5197 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5198 errorf(&statement->base.source_position,
5199 "some constraints in '%s' are not supported", constraints);
5202 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5203 errorf(&statement->base.source_position,
5204 "some constraints in '%s' are invalid", constraints);
5207 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5208 errorf(&statement->base.source_position,
5209 "write flag specified for input constraints '%s'",
5215 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5216 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5217 /* we can treat this as "normal" input */
5218 input = expression_to_firm(argument->expression);
5219 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5220 /* pure memory ops need no input (but we have to make sure we
5221 * attach to the memory) */
5222 assert(! (asm_flags &
5223 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5224 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5225 needs_memory = true;
5226 input = expression_to_addr(argument->expression);
5228 errorf(&statement->base.source_position,
5229 "only modifiers but no place set in constraints '%s'",
5234 ir_asm_constraint constraint;
5235 constraint.pos = next_pos++;
5236 constraint.constraint = new_id_from_str(constraints);
5237 constraint.mode = get_irn_mode(input);
5239 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5240 ins[in_size++] = input;
5244 ir_asm_constraint constraint;
5245 constraint.pos = next_pos++;
5246 constraint.constraint = new_id_from_str("");
5247 constraint.mode = mode_M;
5249 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5250 ins[in_size++] = get_store();
5253 assert(obstack_object_size(&asm_obst)
5254 == in_size * sizeof(ir_asm_constraint));
5255 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5257 /* create asm node */
5258 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5260 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5262 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5263 out_size, output_constraints,
5264 n_clobbers, clobbers, asm_text);
5266 if (statement->is_volatile) {
5267 set_irn_pinned(node, op_pin_state_pinned);
5269 set_irn_pinned(node, op_pin_state_floats);
5272 /* create output projs & connect them */
5274 ir_node *projm = new_Proj(node, mode_M, out_size);
5279 for (i = 0; i < out_size; ++i) {
5280 const expression_t *out_expr = out_exprs[i];
5282 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5283 ir_node *proj = new_Proj(node, mode, pn);
5284 ir_node *addr = out_addrs[i];
5286 set_value_for_expression_addr(out_expr, proj, addr);
5292 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5294 statement_to_firm(statement->try_statement);
5295 source_position_t const *const pos = &statement->base.source_position;
5296 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5300 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5302 errorf(&statement->base.source_position, "__leave not supported yet");
5307 * Transform a statement.
5309 static ir_node *statement_to_firm(statement_t *const stmt)
5312 assert(!stmt->base.transformed);
5313 stmt->base.transformed = true;
5316 switch (stmt->kind) {
5317 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5318 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5319 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5320 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5321 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5322 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5323 case STATEMENT_EMPTY: return NULL; /* nothing */
5324 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5325 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5326 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5327 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5328 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5329 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5330 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5331 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5332 case STATEMENT_WHILE: return while_statement_to_firm( &stmt->whiles);
5334 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5335 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5336 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5338 case STATEMENT_ERROR: panic("error statement found");
5340 panic("statement not implemented");
5343 static int count_local_variables(const entity_t *entity,
5344 const entity_t *const last)
5347 entity_t const *const end = last != NULL ? last->base.next : NULL;
5348 for (; entity != end; entity = entity->base.next) {
5352 if (entity->kind == ENTITY_VARIABLE) {
5353 type = skip_typeref(entity->declaration.type);
5354 address_taken = entity->variable.address_taken;
5355 } else if (entity->kind == ENTITY_PARAMETER) {
5356 type = skip_typeref(entity->declaration.type);
5357 address_taken = entity->parameter.address_taken;
5362 if (!address_taken && is_type_scalar(type))
5368 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5370 int *const count = env;
5372 switch (stmt->kind) {
5373 case STATEMENT_DECLARATION: {
5374 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5375 *count += count_local_variables(decl_stmt->declarations_begin,
5376 decl_stmt->declarations_end);
5381 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5390 * Return the number of local (alias free) variables used by a function.
5392 static int get_function_n_local_vars(entity_t *entity)
5394 const function_t *function = &entity->function;
5397 /* count parameters */
5398 count += count_local_variables(function->parameters.entities, NULL);
5400 /* count local variables declared in body */
5401 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5406 * Build Firm code for the parameters of a function.
5408 static void initialize_function_parameters(entity_t *entity)
5410 assert(entity->kind == ENTITY_FUNCTION);
5411 ir_graph *irg = current_ir_graph;
5412 ir_node *args = get_irg_args(irg);
5414 ir_type *function_irtype;
5416 if (entity->function.need_closure) {
5417 /* add an extra parameter for the static link */
5418 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5421 /* Matze: IMO this is wrong, nested functions should have an own
5422 * type and not rely on strange parameters... */
5423 function_irtype = create_method_type(&entity->declaration.type->function, true);
5425 function_irtype = get_ir_type(entity->declaration.type);
5430 entity_t *parameter = entity->function.parameters.entities;
5431 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5432 if (parameter->kind != ENTITY_PARAMETER)
5435 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5436 type_t *type = skip_typeref(parameter->declaration.type);
5438 bool needs_entity = parameter->parameter.address_taken;
5439 assert(!is_type_array(type));
5440 if (is_type_compound(type)) {
5441 needs_entity = true;
5444 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5446 ir_type *frame_type = get_irg_frame_type(irg);
5448 = new_parameter_entity(frame_type, n, param_irtype);
5449 parameter->declaration.kind
5450 = DECLARATION_KIND_PARAMETER_ENTITY;
5451 parameter->parameter.v.entity = param;
5455 ir_mode *param_mode = get_type_mode(param_irtype);
5457 ir_node *value = new_r_Proj(args, param_mode, pn);
5459 ir_mode *mode = get_ir_mode_storage(type);
5460 value = create_conv(NULL, value, mode);
5461 value = do_strict_conv(NULL, value);
5463 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5464 parameter->parameter.v.value_number = next_value_number_function;
5465 set_irg_loc_description(current_ir_graph, next_value_number_function,
5467 ++next_value_number_function;
5469 set_value(parameter->parameter.v.value_number, value);
5474 * Handle additional decl modifiers for IR-graphs
5476 * @param irg the IR-graph
5477 * @param dec_modifiers additional modifiers
5479 static void handle_decl_modifier_irg(ir_graph *irg,
5480 decl_modifiers_t decl_modifiers)
5482 if (decl_modifiers & DM_NAKED) {
5483 /* TRUE if the declaration includes the Microsoft
5484 __declspec(naked) specifier. */
5485 add_irg_additional_properties(irg, mtp_property_naked);
5487 if (decl_modifiers & DM_FORCEINLINE) {
5488 /* TRUE if the declaration includes the
5489 Microsoft __forceinline specifier. */
5490 set_irg_inline_property(irg, irg_inline_forced);
5492 if (decl_modifiers & DM_NOINLINE) {
5493 /* TRUE if the declaration includes the Microsoft
5494 __declspec(noinline) specifier. */
5495 set_irg_inline_property(irg, irg_inline_forbidden);
5499 static void add_function_pointer(ir_type *segment, ir_entity *method,
5500 const char *unique_template)
5502 ir_type *method_type = get_entity_type(method);
5503 ir_type *ptr_type = new_type_pointer(method_type);
5505 /* these entities don't really have a name but firm only allows
5507 * Note that we mustn't give these entities a name since for example
5508 * Mach-O doesn't allow them. */
5509 ident *ide = id_unique(unique_template);
5510 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5511 ir_graph *irg = get_const_code_irg();
5512 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5515 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5516 set_entity_compiler_generated(ptr, 1);
5517 set_entity_visibility(ptr, ir_visibility_private);
5518 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5519 set_atomic_ent_value(ptr, val);
5523 * Generate possible IJmp branches to a given label block.
5525 static void gen_ijmp_branches(ir_node *block)
5528 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5529 add_immBlock_pred(block, ijmp);
5534 * Create code for a function and all inner functions.
5536 * @param entity the function entity
5538 static void create_function(entity_t *entity)
5540 assert(entity->kind == ENTITY_FUNCTION);
5541 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5543 if (entity->function.statement == NULL)
5546 inner_functions = NULL;
5547 current_trampolines = NULL;
5549 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5550 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5551 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5553 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5554 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5555 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5558 current_function_entity = entity;
5559 current_function_name = NULL;
5560 current_funcsig = NULL;
5562 assert(all_labels == NULL);
5563 all_labels = NEW_ARR_F(label_t *, 0);
5566 int n_local_vars = get_function_n_local_vars(entity);
5567 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5568 current_ir_graph = irg;
5570 ir_graph *old_current_function = current_function;
5571 current_function = irg;
5573 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5574 current_vararg_entity = NULL;
5576 set_irg_fp_model(irg, firm_fp_model);
5577 tarval_enable_fp_ops(1);
5578 set_irn_dbg_info(get_irg_start_block(irg),
5579 get_entity_dbg_info(function_entity));
5581 /* set inline flags */
5582 if (entity->function.is_inline)
5583 set_irg_inline_property(irg, irg_inline_recomended);
5584 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5586 next_value_number_function = 0;
5587 initialize_function_parameters(entity);
5588 current_static_link = entity->function.static_link;
5590 statement_to_firm(entity->function.statement);
5592 ir_node *end_block = get_irg_end_block(irg);
5594 /* do we have a return statement yet? */
5595 if (currently_reachable()) {
5596 type_t *type = skip_typeref(entity->declaration.type);
5597 assert(is_type_function(type));
5598 const function_type_t *func_type = &type->function;
5599 const type_t *return_type
5600 = skip_typeref(func_type->return_type);
5603 if (is_type_void(return_type)) {
5604 ret = new_Return(get_store(), 0, NULL);
5607 if (is_type_scalar(return_type)) {
5608 mode = get_ir_mode_storage(func_type->return_type);
5614 /* ยง5.1.2.2.3 main implicitly returns 0 */
5615 if (is_main(entity)) {
5616 in[0] = new_Const(get_mode_null(mode));
5618 in[0] = new_Unknown(mode);
5620 ret = new_Return(get_store(), 1, in);
5622 add_immBlock_pred(end_block, ret);
5625 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5626 label_t *label = all_labels[i];
5627 if (label->address_taken) {
5628 gen_ijmp_branches(label->block);
5630 mature_immBlock(label->block);
5633 DEL_ARR_F(all_labels);
5636 irg_finalize_cons(irg);
5638 /* finalize the frame type */
5639 ir_type *frame_type = get_irg_frame_type(irg);
5640 int n = get_compound_n_members(frame_type);
5643 for (int i = 0; i < n; ++i) {
5644 ir_entity *member = get_compound_member(frame_type, i);
5645 ir_type *entity_type = get_entity_type(member);
5647 int align = get_type_alignment_bytes(entity_type);
5648 if (align > align_all)
5652 misalign = offset % align;
5654 offset += align - misalign;
5658 set_entity_offset(member, offset);
5659 offset += get_type_size_bytes(entity_type);
5661 set_type_size_bytes(frame_type, offset);
5662 set_type_alignment_bytes(frame_type, align_all);
5664 irg_verify(irg, VERIFY_ENFORCE_SSA);
5665 current_vararg_entity = old_current_vararg_entity;
5666 current_function = old_current_function;
5668 if (current_trampolines != NULL) {
5669 DEL_ARR_F(current_trampolines);
5670 current_trampolines = NULL;
5673 /* create inner functions if any */
5674 entity_t **inner = inner_functions;
5675 if (inner != NULL) {
5676 ir_type *rem_outer_frame = current_outer_frame;
5677 current_outer_frame = get_irg_frame_type(current_ir_graph);
5678 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5679 create_function(inner[i]);
5683 current_outer_frame = rem_outer_frame;
5687 static void scope_to_firm(scope_t *scope)
5689 /* first pass: create declarations */
5690 entity_t *entity = scope->entities;
5691 for ( ; entity != NULL; entity = entity->base.next) {
5692 if (entity->base.symbol == NULL)
5695 if (entity->kind == ENTITY_FUNCTION) {
5696 if (entity->function.btk != BUILTIN_NONE) {
5697 /* builtins have no representation */
5700 (void)get_function_entity(entity, NULL);
5701 } else if (entity->kind == ENTITY_VARIABLE) {
5702 create_global_variable(entity);
5703 } else if (entity->kind == ENTITY_NAMESPACE) {
5704 scope_to_firm(&entity->namespacee.members);
5708 /* second pass: create code/initializers */
5709 entity = scope->entities;
5710 for ( ; entity != NULL; entity = entity->base.next) {
5711 if (entity->base.symbol == NULL)
5714 if (entity->kind == ENTITY_FUNCTION) {
5715 if (entity->function.btk != BUILTIN_NONE) {
5716 /* builtins have no representation */
5719 create_function(entity);
5720 } else if (entity->kind == ENTITY_VARIABLE) {
5721 assert(entity->declaration.kind
5722 == DECLARATION_KIND_GLOBAL_VARIABLE);
5723 current_ir_graph = get_const_code_irg();
5724 create_variable_initializer(entity);
5729 void init_ast2firm(void)
5731 obstack_init(&asm_obst);
5732 init_atomic_modes();
5734 ir_set_debug_retrieve(dbg_retrieve);
5735 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5737 /* create idents for all known runtime functions */
5738 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5739 rts_idents[i] = new_id_from_str(rts_data[i].name);
5742 entitymap_init(&entitymap);
5745 static void init_ir_types(void)
5747 static int ir_types_initialized = 0;
5748 if (ir_types_initialized)
5750 ir_types_initialized = 1;
5752 ir_type_char = get_ir_type(type_char);
5753 ir_type_const_char = get_ir_type(type_const_char);
5754 ir_type_wchar_t = get_ir_type(type_wchar_t);
5756 be_params = be_get_backend_param();
5757 mode_float_arithmetic = be_params->mode_float_arithmetic;
5759 stack_param_align = be_params->stack_param_align;
5762 void exit_ast2firm(void)
5764 entitymap_destroy(&entitymap);
5765 obstack_free(&asm_obst, NULL);
5768 static void global_asm_to_firm(statement_t *s)
5770 for (; s != NULL; s = s->base.next) {
5771 assert(s->kind == STATEMENT_ASM);
5773 char const *const text = s->asms.asm_text.begin;
5774 size_t size = s->asms.asm_text.size;
5776 /* skip the last \0 */
5777 if (text[size - 1] == '\0')
5780 ident *const id = new_id_from_chars(text, size);
5785 static const char *get_cwd(void)
5787 static char buf[1024];
5789 getcwd(buf, sizeof(buf));
5793 void translation_unit_to_firm(translation_unit_t *unit)
5795 if (c_mode & _CXX) {
5796 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5797 } else if (c_mode & _C99) {
5798 be_dwarf_set_source_language(DW_LANG_C99);
5799 } else if (c_mode & _C89) {
5800 be_dwarf_set_source_language(DW_LANG_C89);
5802 be_dwarf_set_source_language(DW_LANG_C);
5804 be_dwarf_set_compilation_directory(get_cwd());
5806 /* initialize firm arithmetic */
5807 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5808 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5810 /* just to be sure */
5811 continue_label = NULL;
5813 current_switch = NULL;
5814 current_translation_unit = unit;
5818 scope_to_firm(&unit->scope);
5819 global_asm_to_firm(unit->global_asm);
5821 current_ir_graph = NULL;
5822 current_translation_unit = NULL;