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 type = skip_typeref(type);
725 /* Firm doesn't report a mode for arrays and structs/unions. */
726 if (!is_type_scalar(type)) {
730 ir_type *const irtype = get_ir_type(type);
731 ir_mode *const mode = get_type_mode(irtype);
732 assert(mode != NULL);
737 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
738 * int that it returns bigger modes for floating point on some platforms
739 * (x87 internally does arithemtic with 80bits)
741 static ir_mode *get_ir_mode_arithmetic(type_t *type)
743 ir_mode *mode = get_ir_mode_storage(type);
744 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
745 return mode_float_arithmetic;
752 * Return a node representing the size of a type.
754 static ir_node *get_type_size_node(type_t *type)
757 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
758 type = skip_typeref(type);
760 if (is_type_array(type) && type->array.is_vla) {
761 ir_node *size_node = get_vla_size(&type->array);
762 ir_node *elem_size = get_type_size_node(type->array.element_type);
763 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
767 size = get_type_size(type);
768 return new_Const_long(mode, size);
771 /** Names of the runtime functions. */
772 static const struct {
773 int id; /**< the rts id */
774 int n_res; /**< number of return values */
775 const char *name; /**< the name of the rts function */
776 int n_params; /**< number of parameters */
777 unsigned flags; /**< language flags */
779 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
780 { rts_abort, 0, "abort", 0, _C89 },
781 { rts_alloca, 1, "alloca", 1, _ALL },
782 { rts_abs, 1, "abs", 1, _C89 },
783 { rts_labs, 1, "labs", 1, _C89 },
784 { rts_llabs, 1, "llabs", 1, _C99 },
785 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
787 { rts_fabs, 1, "fabs", 1, _C89 },
788 { rts_sqrt, 1, "sqrt", 1, _C89 },
789 { rts_cbrt, 1, "cbrt", 1, _C99 },
790 { rts_exp, 1, "exp", 1, _C89 },
791 { rts_exp2, 1, "exp2", 1, _C89 },
792 { rts_exp10, 1, "exp10", 1, _GNUC },
793 { rts_log, 1, "log", 1, _C89 },
794 { rts_log2, 1, "log2", 1, _C89 },
795 { rts_log10, 1, "log10", 1, _C89 },
796 { rts_pow, 1, "pow", 2, _C89 },
797 { rts_sin, 1, "sin", 1, _C89 },
798 { rts_cos, 1, "cos", 1, _C89 },
799 { rts_tan, 1, "tan", 1, _C89 },
800 { rts_asin, 1, "asin", 1, _C89 },
801 { rts_acos, 1, "acos", 1, _C89 },
802 { rts_atan, 1, "atan", 1, _C89 },
803 { rts_sinh, 1, "sinh", 1, _C89 },
804 { rts_cosh, 1, "cosh", 1, _C89 },
805 { rts_tanh, 1, "tanh", 1, _C89 },
807 { rts_fabsf, 1, "fabsf", 1, _C99 },
808 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
809 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
810 { rts_expf, 1, "expf", 1, _C99 },
811 { rts_exp2f, 1, "exp2f", 1, _C99 },
812 { rts_exp10f, 1, "exp10f", 1, _GNUC },
813 { rts_logf, 1, "logf", 1, _C99 },
814 { rts_log2f, 1, "log2f", 1, _C99 },
815 { rts_log10f, 1, "log10f", 1, _C99 },
816 { rts_powf, 1, "powf", 2, _C99 },
817 { rts_sinf, 1, "sinf", 1, _C99 },
818 { rts_cosf, 1, "cosf", 1, _C99 },
819 { rts_tanf, 1, "tanf", 1, _C99 },
820 { rts_asinf, 1, "asinf", 1, _C99 },
821 { rts_acosf, 1, "acosf", 1, _C99 },
822 { rts_atanf, 1, "atanf", 1, _C99 },
823 { rts_sinhf, 1, "sinhf", 1, _C99 },
824 { rts_coshf, 1, "coshf", 1, _C99 },
825 { rts_tanhf, 1, "tanhf", 1, _C99 },
827 { rts_fabsl, 1, "fabsl", 1, _C99 },
828 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
829 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
830 { rts_expl, 1, "expl", 1, _C99 },
831 { rts_exp2l, 1, "exp2l", 1, _C99 },
832 { rts_exp10l, 1, "exp10l", 1, _GNUC },
833 { rts_logl, 1, "logl", 1, _C99 },
834 { rts_log2l, 1, "log2l", 1, _C99 },
835 { rts_log10l, 1, "log10l", 1, _C99 },
836 { rts_powl, 1, "powl", 2, _C99 },
837 { rts_sinl, 1, "sinl", 1, _C99 },
838 { rts_cosl, 1, "cosl", 1, _C99 },
839 { rts_tanl, 1, "tanl", 1, _C99 },
840 { rts_asinl, 1, "asinl", 1, _C99 },
841 { rts_acosl, 1, "acosl", 1, _C99 },
842 { rts_atanl, 1, "atanl", 1, _C99 },
843 { rts_sinhl, 1, "sinhl", 1, _C99 },
844 { rts_coshl, 1, "coshl", 1, _C99 },
845 { rts_tanhl, 1, "tanhl", 1, _C99 },
847 { rts_strcmp, 1, "strcmp", 2, _C89 },
848 { rts_strncmp, 1, "strncmp", 3, _C89 },
849 { rts_strcpy, 1, "strcpy", 2, _C89 },
850 { rts_strlen, 1, "strlen", 1, _C89 },
851 { rts_memcpy, 1, "memcpy", 3, _C89 },
852 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
853 { rts_memmove, 1, "memmove", 3, _C89 },
854 { rts_memset, 1, "memset", 3, _C89 },
855 { rts_memcmp, 1, "memcmp", 3, _C89 },
858 static ident *rts_idents[lengthof(rts_data)];
860 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
862 void set_create_ld_ident(ident *(*func)(entity_t*))
864 create_ld_ident = func;
868 * Handle GNU attributes for entities
870 * @param ent the entity
871 * @param decl the routine declaration
873 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
875 assert(is_declaration(entity));
876 decl_modifiers_t modifiers = entity->declaration.modifiers;
878 if (is_method_entity(irentity)) {
879 if (modifiers & DM_PURE) {
880 set_entity_additional_properties(irentity, mtp_property_pure);
882 if (modifiers & DM_CONST) {
883 add_entity_additional_properties(irentity, mtp_property_const);
886 if (modifiers & DM_USED) {
887 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
889 if (modifiers & DM_WEAK) {
890 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
894 static bool is_main(entity_t *entity)
896 static symbol_t *sym_main = NULL;
897 if (sym_main == NULL) {
898 sym_main = symbol_table_insert("main");
901 if (entity->base.symbol != sym_main)
903 /* must be in outermost scope */
904 if (entity->base.parent_scope != ¤t_translation_unit->scope)
911 * Creates an entity representing a function.
913 * @param entity the function declaration/definition
914 * @param owner_type the owner type of this function, NULL
915 * for global functions
917 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
919 assert(entity->kind == ENTITY_FUNCTION);
920 if (entity->function.irentity != NULL)
921 return entity->function.irentity;
923 switch (entity->function.btk) {
926 case BUILTIN_LIBC_CHECK:
932 if (is_main(entity)) {
933 /* force main to C linkage */
934 type_t *type = entity->declaration.type;
935 assert(is_type_function(type));
936 if (type->function.linkage != LINKAGE_C) {
937 type_t *new_type = duplicate_type(type);
938 new_type->function.linkage = LINKAGE_C;
939 type = identify_new_type(new_type);
940 entity->declaration.type = type;
944 symbol_t *symbol = entity->base.symbol;
945 ident *id = new_id_from_str(symbol->string);
947 /* already an entity defined? */
948 ir_entity *irentity = entitymap_get(&entitymap, symbol);
949 bool const has_body = entity->function.statement != NULL;
950 if (irentity != NULL) {
951 if (get_entity_visibility(irentity) == ir_visibility_external
953 set_entity_visibility(irentity, ir_visibility_default);
958 ir_type *ir_type_method;
959 if (entity->function.need_closure)
960 ir_type_method = create_method_type(&entity->declaration.type->function, true);
962 ir_type_method = get_ir_type(entity->declaration.type);
964 bool nested_function = false;
965 if (owner_type == NULL)
966 owner_type = get_glob_type();
968 nested_function = true;
970 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
971 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
975 ld_id = id_unique("inner.%u");
977 ld_id = create_ld_ident(entity);
978 set_entity_ld_ident(irentity, ld_id);
980 handle_decl_modifiers(irentity, entity);
982 if (! nested_function) {
983 /* static inline => local
984 * extern inline => local
985 * inline without definition => local
986 * inline with definition => external_visible */
987 storage_class_tag_t const storage_class
988 = (storage_class_tag_t) entity->declaration.storage_class;
989 bool const is_inline = entity->function.is_inline;
991 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
992 set_entity_visibility(irentity, ir_visibility_default);
993 } else if (storage_class == STORAGE_CLASS_STATIC ||
994 (is_inline && has_body)) {
995 set_entity_visibility(irentity, ir_visibility_local);
996 } else if (has_body) {
997 set_entity_visibility(irentity, ir_visibility_default);
999 set_entity_visibility(irentity, ir_visibility_external);
1002 /* nested functions are always local */
1003 set_entity_visibility(irentity, ir_visibility_local);
1006 /* We should check for file scope here, but as long as we compile C only
1007 this is not needed. */
1008 if (!freestanding && !has_body) {
1009 /* check for a known runtime function */
1010 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1011 if (id != rts_idents[i])
1014 function_type_t *function_type
1015 = &entity->declaration.type->function;
1016 /* rts_entities code can't handle a "wrong" number of parameters */
1017 if (function_type->unspecified_parameters)
1020 /* check number of parameters */
1021 int n_params = count_parameters(function_type);
1022 if (n_params != rts_data[i].n_params)
1025 type_t *return_type = skip_typeref(function_type->return_type);
1026 int n_res = is_type_void(return_type) ? 0 : 1;
1027 if (n_res != rts_data[i].n_res)
1030 /* ignore those rts functions not necessary needed for current mode */
1031 if ((c_mode & rts_data[i].flags) == 0)
1033 assert(rts_entities[rts_data[i].id] == NULL);
1034 rts_entities[rts_data[i].id] = irentity;
1038 entitymap_insert(&entitymap, symbol, irentity);
1041 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1042 entity->function.irentity = irentity;
1048 * Creates a SymConst for a given entity.
1050 * @param dbgi debug info
1051 * @param entity the entity
1053 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1055 assert(entity != NULL);
1056 union symconst_symbol sym;
1057 sym.entity_p = entity;
1058 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1061 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1063 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1066 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1069 if (is_Const(value)) {
1070 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1073 ir_node *cond = new_d_Cond(dbgi, value);
1074 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1075 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1076 ir_node *tblock = new_Block(1, &proj_true);
1077 ir_node *fblock = new_Block(1, &proj_false);
1078 set_cur_block(tblock);
1079 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1080 ir_node *tjump = new_Jmp();
1081 set_cur_block(fblock);
1082 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1083 ir_node *fjump = new_Jmp();
1085 ir_node *in[2] = { tjump, fjump };
1086 ir_node *mergeblock = new_Block(2, in);
1087 set_cur_block(mergeblock);
1088 ir_node *phi_in[2] = { const1, const0 };
1089 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1093 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1095 ir_mode *value_mode = get_irn_mode(value);
1097 if (value_mode == dest_mode)
1100 if (dest_mode == mode_b) {
1101 ir_node *zero = new_Const(get_mode_null(value_mode));
1102 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1104 } else if (value_mode == mode_b) {
1105 return create_conv_from_b(dbgi, value, dest_mode);
1108 return new_d_Conv(dbgi, value, dest_mode);
1112 * Creates a SymConst node representing a wide string literal.
1114 * @param literal the wide string literal
1116 static ir_node *wide_string_literal_to_firm(
1117 const string_literal_expression_t *literal)
1119 ir_type *const global_type = get_glob_type();
1120 ir_type *const elem_type = ir_type_wchar_t;
1121 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1122 ir_type *const type = new_type_array(1, elem_type);
1124 ident *const id = id_unique("str.%u");
1125 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1126 set_entity_ld_ident(entity, id);
1127 set_entity_visibility(entity, ir_visibility_private);
1128 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1130 ir_mode *const mode = get_type_mode(elem_type);
1131 const size_t slen = wstrlen(&literal->value);
1133 set_array_lower_bound_int(type, 0, 0);
1134 set_array_upper_bound_int(type, 0, slen);
1135 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1136 set_type_state(type, layout_fixed);
1138 ir_initializer_t *initializer = create_initializer_compound(slen);
1139 const char *p = literal->value.begin;
1140 for (size_t i = 0; i < slen; ++i) {
1141 assert(p < literal->value.begin + literal->value.size);
1142 utf32 v = read_utf8_char(&p);
1143 ir_tarval *tv = new_tarval_from_long(v, mode);
1144 ir_initializer_t *val = create_initializer_tarval(tv);
1145 set_initializer_compound_value(initializer, i, val);
1147 set_entity_initializer(entity, initializer);
1149 return create_symconst(dbgi, entity);
1153 * Creates a SymConst node representing a string constant.
1155 * @param src_pos the source position of the string constant
1156 * @param id_prefix a prefix for the name of the generated string constant
1157 * @param value the value of the string constant
1159 static ir_node *string_to_firm(const source_position_t *const src_pos,
1160 const char *const id_prefix,
1161 const string_t *const value)
1163 ir_type *const global_type = get_glob_type();
1164 dbg_info *const dbgi = get_dbg_info(src_pos);
1165 ir_type *const type = new_type_array(1, ir_type_const_char);
1167 ident *const id = id_unique(id_prefix);
1168 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1169 set_entity_ld_ident(entity, id);
1170 set_entity_visibility(entity, ir_visibility_private);
1171 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1173 ir_type *const elem_type = ir_type_const_char;
1174 ir_mode *const mode = get_type_mode(elem_type);
1176 const char* const string = value->begin;
1177 const size_t slen = value->size;
1179 set_array_lower_bound_int(type, 0, 0);
1180 set_array_upper_bound_int(type, 0, slen);
1181 set_type_size_bytes(type, slen);
1182 set_type_state(type, layout_fixed);
1184 ir_initializer_t *initializer = create_initializer_compound(slen);
1185 for (size_t i = 0; i < slen; ++i) {
1186 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1187 ir_initializer_t *val = create_initializer_tarval(tv);
1188 set_initializer_compound_value(initializer, i, val);
1190 set_entity_initializer(entity, initializer);
1192 return create_symconst(dbgi, entity);
1195 static bool try_create_integer(literal_expression_t *literal,
1196 type_t *type, unsigned char base)
1198 const char *string = literal->value.begin;
1199 size_t size = literal->value.size;
1201 assert(type->kind == TYPE_ATOMIC);
1202 atomic_type_kind_t akind = type->atomic.akind;
1204 ir_mode *mode = atomic_modes[akind];
1205 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1206 if (tv == tarval_bad)
1209 literal->base.type = type;
1210 literal->target_value = tv;
1214 static void create_integer_tarval(literal_expression_t *literal)
1218 const string_t *suffix = &literal->suffix;
1220 if (suffix->size > 0) {
1221 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1222 if (*c == 'u' || *c == 'U') { ++us; }
1223 if (*c == 'l' || *c == 'L') { ++ls; }
1228 switch (literal->base.kind) {
1229 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1230 case EXPR_LITERAL_INTEGER: base = 10; break;
1231 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1232 default: panic("invalid literal kind");
1235 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1237 /* now try if the constant is small enough for some types */
1238 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1240 if (us == 0 && try_create_integer(literal, type_int, base))
1242 if ((us == 1 || base != 10)
1243 && try_create_integer(literal, type_unsigned_int, base))
1247 if (us == 0 && try_create_integer(literal, type_long, base))
1249 if ((us == 1 || base != 10)
1250 && try_create_integer(literal, type_unsigned_long, base))
1253 /* last try? then we should not report tarval_bad */
1254 if (us != 1 && base == 10)
1255 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1256 if (us == 0 && try_create_integer(literal, type_long_long, base))
1260 assert(us == 1 || base != 10);
1261 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1262 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1264 panic("internal error when parsing number literal");
1267 tarval_set_integer_overflow_mode(old_mode);
1270 void determine_literal_type(literal_expression_t *literal)
1272 switch (literal->base.kind) {
1273 case EXPR_LITERAL_INTEGER:
1274 case EXPR_LITERAL_INTEGER_OCTAL:
1275 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1276 create_integer_tarval(literal);
1284 * Creates a Const node representing a constant.
1286 static ir_node *literal_to_firm(const literal_expression_t *literal)
1288 type_t *type = skip_typeref(literal->base.type);
1289 ir_mode *mode = get_ir_mode_storage(type);
1290 const char *string = literal->value.begin;
1291 size_t size = literal->value.size;
1294 switch (literal->base.kind) {
1295 case EXPR_LITERAL_WIDE_CHARACTER: {
1296 utf32 v = read_utf8_char(&string);
1298 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1300 tv = new_tarval_from_str(buf, len, mode);
1303 case EXPR_LITERAL_CHARACTER: {
1306 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1307 if (size == 1 && char_is_signed) {
1308 v = (signed char)string[0];
1311 for (size_t i = 0; i < size; ++i) {
1312 v = (v << 8) | ((unsigned char)string[i]);
1316 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1318 tv = new_tarval_from_str(buf, len, mode);
1321 case EXPR_LITERAL_INTEGER:
1322 case EXPR_LITERAL_INTEGER_OCTAL:
1323 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1324 assert(literal->target_value != NULL);
1325 tv = literal->target_value;
1327 case EXPR_LITERAL_FLOATINGPOINT:
1328 tv = new_tarval_from_str(string, size, mode);
1330 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1331 char buffer[size + 2];
1332 memcpy(buffer, "0x", 2);
1333 memcpy(buffer+2, string, size);
1334 tv = new_tarval_from_str(buffer, size+2, mode);
1337 case EXPR_LITERAL_BOOLEAN:
1338 if (string[0] == 't') {
1339 tv = get_mode_one(mode);
1341 assert(string[0] == 'f');
1342 tv = get_mode_null(mode);
1345 case EXPR_LITERAL_MS_NOOP:
1346 tv = get_mode_null(mode);
1351 panic("Invalid literal kind found");
1354 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1355 ir_node *res = new_d_Const(dbgi, tv);
1356 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1357 return create_conv(dbgi, res, mode_arith);
1361 * Allocate an area of size bytes aligned at alignment
1364 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1366 static unsigned area_cnt = 0;
1369 ir_type *tp = new_type_array(1, ir_type_char);
1370 set_array_bounds_int(tp, 0, 0, size);
1371 set_type_alignment_bytes(tp, alignment);
1373 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1374 ident *name = new_id_from_str(buf);
1375 ir_entity *area = new_entity(frame_type, name, tp);
1377 /* mark this entity as compiler generated */
1378 set_entity_compiler_generated(area, 1);
1383 * Return a node representing a trampoline region
1384 * for a given function entity.
1386 * @param dbgi debug info
1387 * @param entity the function entity
1389 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1391 ir_entity *region = NULL;
1394 if (current_trampolines != NULL) {
1395 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1396 if (current_trampolines[i].function == entity) {
1397 region = current_trampolines[i].region;
1402 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1404 ir_graph *irg = current_ir_graph;
1405 if (region == NULL) {
1406 /* create a new region */
1407 ir_type *frame_tp = get_irg_frame_type(irg);
1408 trampoline_region reg;
1409 reg.function = entity;
1411 reg.region = alloc_trampoline(frame_tp,
1412 be_params->trampoline_size,
1413 be_params->trampoline_align);
1414 ARR_APP1(trampoline_region, current_trampolines, reg);
1415 region = reg.region;
1417 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1422 * Creates a trampoline for a function represented by an entity.
1424 * @param dbgi debug info
1425 * @param mode the (reference) mode for the function address
1426 * @param entity the function entity
1428 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1431 assert(entity != NULL);
1433 in[0] = get_trampoline_region(dbgi, entity);
1434 in[1] = create_symconst(dbgi, entity);
1435 in[2] = get_irg_frame(current_ir_graph);
1437 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1438 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1439 return new_Proj(irn, mode, pn_Builtin_max+1);
1443 * Dereference an address.
1445 * @param dbgi debug info
1446 * @param type the type of the dereferenced result (the points_to type)
1447 * @param addr the address to dereference
1449 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1450 ir_node *const addr)
1452 type_t *skipped = skip_typeref(type);
1453 if (is_type_incomplete(skipped))
1456 ir_type *irtype = get_ir_type(skipped);
1457 if (is_compound_type(irtype)
1458 || is_Method_type(irtype)
1459 || is_Array_type(irtype)) {
1463 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1464 ? cons_volatile : cons_none;
1465 ir_mode *const mode = get_type_mode(irtype);
1466 ir_node *const memory = get_store();
1467 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1468 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1469 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1471 set_store(load_mem);
1473 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1474 return create_conv(dbgi, load_res, mode_arithmetic);
1478 * Creates a strict Conv (to the node's mode) if necessary.
1480 * @param dbgi debug info
1481 * @param node the node to strict conv
1483 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1485 ir_mode *mode = get_irn_mode(node);
1487 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1489 if (!mode_is_float(mode))
1492 /* check if there is already a Conv */
1493 if (is_Conv(node)) {
1494 /* convert it into a strict Conv */
1495 set_Conv_strict(node, 1);
1499 /* otherwise create a new one */
1500 return new_d_strictConv(dbgi, node, mode);
1504 * Returns the correct base address depending on whether it is a parameter or a
1505 * normal local variable.
1507 static ir_node *get_local_frame(ir_entity *const ent)
1509 ir_graph *const irg = current_ir_graph;
1510 const ir_type *const owner = get_entity_owner(ent);
1511 if (owner == current_outer_frame) {
1512 assert(current_static_link != NULL);
1513 return current_static_link;
1515 return get_irg_frame(irg);
1520 * Keep all memory edges of the given block.
1522 static void keep_all_memory(ir_node *block)
1524 ir_node *old = get_cur_block();
1526 set_cur_block(block);
1527 keep_alive(get_store());
1528 /* TODO: keep all memory edges from restricted pointers */
1532 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1534 entity_t *entity = ref->entity;
1535 if (entity->enum_value.tv == NULL) {
1536 type_t *type = skip_typeref(entity->enum_value.enum_type);
1537 assert(type->kind == TYPE_ENUM);
1538 determine_enum_values(&type->enumt);
1541 return new_Const(entity->enum_value.tv);
1544 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1546 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1547 entity_t *entity = ref->entity;
1548 assert(is_declaration(entity));
1549 type_t *type = skip_typeref(entity->declaration.type);
1551 /* make sure the type is constructed */
1552 (void) get_ir_type(type);
1554 if (entity->kind == ENTITY_FUNCTION
1555 && entity->function.btk != BUILTIN_NONE) {
1556 ir_entity *irentity = get_function_entity(entity, NULL);
1557 /* for gcc compatibility we have to produce (dummy) addresses for some
1558 * builtins which don't have entities */
1559 if (irentity == NULL) {
1560 source_position_t const *const pos = &ref->base.source_position;
1561 symbol_t const *const sym = ref->entity->base.symbol;
1562 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1564 /* simply create a NULL pointer */
1565 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1566 ir_node *res = new_Const(get_mode_null(mode));
1572 switch ((declaration_kind_t) entity->declaration.kind) {
1573 case DECLARATION_KIND_UNKNOWN:
1576 case DECLARATION_KIND_LOCAL_VARIABLE: {
1577 ir_mode *const mode = get_ir_mode_storage(type);
1578 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1579 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1581 case DECLARATION_KIND_PARAMETER: {
1582 ir_mode *const mode = get_ir_mode_storage(type);
1583 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1584 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1586 case DECLARATION_KIND_FUNCTION: {
1587 return create_symconst(dbgi, entity->function.irentity);
1589 case DECLARATION_KIND_INNER_FUNCTION: {
1590 ir_mode *const mode = get_ir_mode_storage(type);
1591 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1592 /* inner function not using the closure */
1593 return create_symconst(dbgi, entity->function.irentity);
1595 /* need trampoline here */
1596 return create_trampoline(dbgi, mode, entity->function.irentity);
1599 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1600 const variable_t *variable = &entity->variable;
1601 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1602 return deref_address(dbgi, variable->base.type, addr);
1605 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1606 ir_entity *irentity = entity->variable.v.entity;
1607 ir_node *frame = get_local_frame(irentity);
1608 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1609 return deref_address(dbgi, entity->declaration.type, sel);
1611 case DECLARATION_KIND_PARAMETER_ENTITY: {
1612 ir_entity *irentity = entity->parameter.v.entity;
1613 ir_node *frame = get_local_frame(irentity);
1614 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1615 return deref_address(dbgi, entity->declaration.type, sel);
1618 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1619 return entity->variable.v.vla_base;
1621 case DECLARATION_KIND_COMPOUND_MEMBER:
1622 panic("not implemented reference type");
1625 panic("reference to declaration with unknown type found");
1628 static ir_node *reference_addr(const reference_expression_t *ref)
1630 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1631 entity_t *entity = ref->entity;
1632 assert(is_declaration(entity));
1634 switch((declaration_kind_t) entity->declaration.kind) {
1635 case DECLARATION_KIND_UNKNOWN:
1637 case DECLARATION_KIND_PARAMETER:
1638 case DECLARATION_KIND_LOCAL_VARIABLE:
1639 /* you can store to a local variable (so we don't panic but return NULL
1640 * as an indicator for no real address) */
1642 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1643 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1646 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1647 ir_entity *irentity = entity->variable.v.entity;
1648 ir_node *frame = get_local_frame(irentity);
1649 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1653 case DECLARATION_KIND_PARAMETER_ENTITY: {
1654 ir_entity *irentity = entity->parameter.v.entity;
1655 ir_node *frame = get_local_frame(irentity);
1656 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1661 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1662 return entity->variable.v.vla_base;
1664 case DECLARATION_KIND_FUNCTION: {
1665 return create_symconst(dbgi, entity->function.irentity);
1668 case DECLARATION_KIND_INNER_FUNCTION: {
1669 type_t *const type = skip_typeref(entity->declaration.type);
1670 ir_mode *const mode = get_ir_mode_storage(type);
1671 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1672 /* inner function not using the closure */
1673 return create_symconst(dbgi, entity->function.irentity);
1675 /* need trampoline here */
1676 return create_trampoline(dbgi, mode, entity->function.irentity);
1680 case DECLARATION_KIND_COMPOUND_MEMBER:
1681 panic("not implemented reference type");
1684 panic("reference to declaration with unknown type found");
1688 * Transform calls to builtin functions.
1690 static ir_node *process_builtin_call(const call_expression_t *call)
1692 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1694 assert(call->function->kind == EXPR_REFERENCE);
1695 reference_expression_t *builtin = &call->function->reference;
1697 type_t *expr_type = skip_typeref(builtin->base.type);
1698 assert(is_type_pointer(expr_type));
1700 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1702 switch (builtin->entity->function.btk) {
1705 case BUILTIN_ALLOCA: {
1706 expression_t *argument = call->arguments->expression;
1707 ir_node *size = expression_to_firm(argument);
1709 ir_node *store = get_store();
1710 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1712 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1714 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1719 type_t *type = function_type->function.return_type;
1720 ir_mode *mode = get_ir_mode_arithmetic(type);
1721 ir_tarval *tv = get_mode_infinite(mode);
1722 ir_node *res = new_d_Const(dbgi, tv);
1726 /* Ignore string for now... */
1727 assert(is_type_function(function_type));
1728 type_t *type = function_type->function.return_type;
1729 ir_mode *mode = get_ir_mode_arithmetic(type);
1730 ir_tarval *tv = get_mode_NAN(mode);
1731 ir_node *res = new_d_Const(dbgi, tv);
1734 case BUILTIN_EXPECT: {
1735 expression_t *argument = call->arguments->expression;
1736 return _expression_to_firm(argument);
1738 case BUILTIN_VA_END:
1739 /* evaluate the argument of va_end for its side effects */
1740 _expression_to_firm(call->arguments->expression);
1742 case BUILTIN_OBJECT_SIZE: {
1743 /* determine value of "type" */
1744 expression_t *type_expression = call->arguments->next->expression;
1745 long type_val = fold_constant_to_int(type_expression);
1746 type_t *type = function_type->function.return_type;
1747 ir_mode *mode = get_ir_mode_arithmetic(type);
1748 /* just produce a "I don't know" result */
1749 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1750 get_mode_minus_one(mode);
1752 return new_d_Const(dbgi, result);
1754 case BUILTIN_ROTL: {
1755 ir_node *val = expression_to_firm(call->arguments->expression);
1756 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1757 ir_mode *mode = get_irn_mode(val);
1758 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1759 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1761 case BUILTIN_ROTR: {
1762 ir_node *val = expression_to_firm(call->arguments->expression);
1763 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1764 ir_mode *mode = get_irn_mode(val);
1765 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1766 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1767 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1768 return new_d_Rotl(dbgi, val, sub, mode);
1773 case BUILTIN_LIBC_CHECK:
1774 panic("builtin did not produce an entity");
1776 panic("invalid builtin found");
1780 * Transform a call expression.
1781 * Handles some special cases, like alloca() calls, which must be resolved
1782 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1783 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1786 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1788 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1789 assert(currently_reachable());
1791 expression_t *function = call->function;
1792 ir_node *callee = NULL;
1793 bool firm_builtin = false;
1794 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1795 if (function->kind == EXPR_REFERENCE) {
1796 const reference_expression_t *ref = &function->reference;
1797 entity_t *entity = ref->entity;
1799 if (entity->kind == ENTITY_FUNCTION) {
1800 builtin_kind_t builtin = entity->function.btk;
1801 if (builtin == BUILTIN_FIRM) {
1802 firm_builtin = true;
1803 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1804 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1805 && builtin != BUILTIN_LIBC_CHECK) {
1806 return process_builtin_call(call);
1811 callee = expression_to_firm(function);
1813 type_t *type = skip_typeref(function->base.type);
1814 assert(is_type_pointer(type));
1815 pointer_type_t *pointer_type = &type->pointer;
1816 type_t *points_to = skip_typeref(pointer_type->points_to);
1817 assert(is_type_function(points_to));
1818 function_type_t *function_type = &points_to->function;
1820 int n_parameters = 0;
1821 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1822 ir_type *new_method_type = NULL;
1823 if (function_type->variadic || function_type->unspecified_parameters) {
1824 const call_argument_t *argument = call->arguments;
1825 for ( ; argument != NULL; argument = argument->next) {
1829 /* we need to construct a new method type matching the call
1831 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1832 int n_res = get_method_n_ress(ir_method_type);
1833 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1834 set_method_calling_convention(new_method_type,
1835 get_method_calling_convention(ir_method_type));
1836 set_method_additional_properties(new_method_type,
1837 get_method_additional_properties(ir_method_type));
1838 set_method_variadicity(new_method_type,
1839 get_method_variadicity(ir_method_type));
1841 for (int i = 0; i < n_res; ++i) {
1842 set_method_res_type(new_method_type, i,
1843 get_method_res_type(ir_method_type, i));
1845 argument = call->arguments;
1846 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1847 expression_t *expression = argument->expression;
1848 ir_type *irtype = get_ir_type(expression->base.type);
1849 set_method_param_type(new_method_type, i, irtype);
1851 ir_method_type = new_method_type;
1853 n_parameters = get_method_n_params(ir_method_type);
1856 ir_node *in[n_parameters];
1858 const call_argument_t *argument = call->arguments;
1859 for (int n = 0; n < n_parameters; ++n) {
1860 expression_t *expression = argument->expression;
1861 ir_node *arg_node = expression_to_firm(expression);
1863 type_t *arg_type = skip_typeref(expression->base.type);
1864 if (!is_type_compound(arg_type)) {
1865 ir_mode *mode = get_ir_mode_storage(expression->base.type);
1866 arg_node = create_conv(dbgi, arg_node, mode);
1867 arg_node = do_strict_conv(dbgi, arg_node);
1872 argument = argument->next;
1876 if (function_type->modifiers & DM_CONST) {
1877 store = get_irg_no_mem(current_ir_graph);
1879 store = get_store();
1883 type_t *return_type = skip_typeref(function_type->return_type);
1884 ir_node *result = NULL;
1886 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1888 if (! (function_type->modifiers & DM_CONST)) {
1889 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1893 if (!is_type_void(return_type)) {
1894 assert(is_type_scalar(return_type));
1895 ir_mode *mode = get_ir_mode_storage(return_type);
1896 result = new_Proj(node, mode, pn_Builtin_max+1);
1897 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1898 result = create_conv(NULL, result, mode_arith);
1901 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1902 if (! (function_type->modifiers & DM_CONST)) {
1903 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1907 if (!is_type_void(return_type)) {
1908 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1909 ir_mode *const mode = get_ir_mode_storage(return_type);
1910 result = new_Proj(resproj, mode, 0);
1911 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1912 result = create_conv(NULL, result, mode_arith);
1916 if (function_type->modifiers & DM_NORETURN) {
1917 /* A dead end: Keep the Call and the Block. Also place all further
1918 * nodes into a new and unreachable block. */
1920 keep_alive(get_cur_block());
1921 ir_node *block = new_Block(0, NULL);
1922 set_cur_block(block);
1928 static ir_node *statement_to_firm(statement_t *statement);
1929 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1931 static ir_node *expression_to_addr(const expression_t *expression);
1932 static ir_node *create_condition_evaluation(const expression_t *expression,
1933 ir_node *true_block,
1934 ir_node *false_block);
1936 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1939 if (!is_type_compound(type)) {
1940 ir_mode *mode = get_ir_mode_storage(type);
1941 value = create_conv(dbgi, value, mode);
1942 value = do_strict_conv(dbgi, value);
1945 ir_node *memory = get_store();
1947 if (is_type_scalar(type)) {
1948 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1949 ? cons_volatile : cons_none;
1950 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1951 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1952 set_store(store_mem);
1954 ir_type *irtype = get_ir_type(type);
1955 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1956 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1957 set_store(copyb_mem);
1961 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1963 ir_tarval *all_one = get_mode_all_one(mode);
1964 int mode_size = get_mode_size_bits(mode);
1965 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1967 assert(offset >= 0);
1969 assert(offset + size <= mode_size);
1970 if (size == mode_size) {
1974 long shiftr = get_mode_size_bits(mode) - size;
1975 long shiftl = offset;
1976 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1977 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1978 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1979 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1984 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1985 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1988 ir_type *entity_type = get_entity_type(entity);
1989 ir_type *base_type = get_primitive_base_type(entity_type);
1990 ir_mode *mode = get_type_mode(base_type);
1991 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1993 value = create_conv(dbgi, value, mode);
1995 /* kill upper bits of value and shift to right position */
1996 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1997 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1998 unsigned base_bits = get_mode_size_bits(mode);
1999 unsigned shiftwidth = base_bits - bitsize;
2001 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
2002 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
2004 unsigned shrwidth = base_bits - bitsize - bitoffset;
2005 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
2006 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
2008 /* load current value */
2009 ir_node *mem = get_store();
2010 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2011 set_volatile ? cons_volatile : cons_none);
2012 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2013 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2014 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2015 ir_tarval *inv_mask = tarval_not(shift_mask);
2016 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2017 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2019 /* construct new value and store */
2020 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2021 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2022 set_volatile ? cons_volatile : cons_none);
2023 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2024 set_store(store_mem);
2030 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2031 if (mode_is_signed(mode)) {
2032 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2034 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2039 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2042 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2043 entity_t *entity = expression->compound_entry;
2044 type_t *base_type = entity->declaration.type;
2045 ir_mode *mode = get_ir_mode_storage(base_type);
2046 ir_node *mem = get_store();
2047 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2048 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2049 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2050 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2052 ir_mode *amode = mode;
2053 /* optimisation, since shifting in modes < machine_size is usually
2055 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2058 unsigned amode_size = get_mode_size_bits(amode);
2059 load_res = create_conv(dbgi, load_res, amode);
2061 set_store(load_mem);
2063 /* kill upper bits */
2064 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2065 unsigned bitoffset = entity->compound_member.bit_offset;
2066 unsigned bitsize = entity->compound_member.bit_size;
2067 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2068 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2069 ir_node *countl = new_d_Const(dbgi, tvl);
2070 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2072 unsigned shift_bitsr = bitoffset + shift_bitsl;
2073 assert(shift_bitsr <= amode_size);
2074 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2075 ir_node *countr = new_d_Const(dbgi, tvr);
2077 if (mode_is_signed(mode)) {
2078 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2080 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2083 type_t *type = expression->base.type;
2084 ir_mode *resmode = get_ir_mode_arithmetic(type);
2085 return create_conv(dbgi, shiftr, resmode);
2088 /* make sure the selected compound type is constructed */
2089 static void construct_select_compound(const select_expression_t *expression)
2091 type_t *type = skip_typeref(expression->compound->base.type);
2092 if (is_type_pointer(type)) {
2093 type = type->pointer.points_to;
2095 (void) get_ir_type(type);
2098 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2099 ir_node *value, ir_node *addr)
2101 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2102 type_t *type = skip_typeref(expression->base.type);
2104 if (!is_type_compound(type)) {
2105 ir_mode *mode = get_ir_mode_storage(type);
2106 value = create_conv(dbgi, value, mode);
2107 value = do_strict_conv(dbgi, value);
2110 if (expression->kind == EXPR_REFERENCE) {
2111 const reference_expression_t *ref = &expression->reference;
2113 entity_t *entity = ref->entity;
2114 assert(is_declaration(entity));
2115 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2116 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2117 set_value(entity->variable.v.value_number, value);
2119 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2120 set_value(entity->parameter.v.value_number, value);
2126 addr = expression_to_addr(expression);
2127 assert(addr != NULL);
2129 if (expression->kind == EXPR_SELECT) {
2130 const select_expression_t *select = &expression->select;
2132 construct_select_compound(select);
2134 entity_t *entity = select->compound_entry;
2135 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2136 if (entity->compound_member.bitfield) {
2137 ir_entity *irentity = entity->compound_member.entity;
2139 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2140 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2141 set_volatile, true);
2146 assign_value(dbgi, addr, type, value);
2150 static void set_value_for_expression(const expression_t *expression,
2153 set_value_for_expression_addr(expression, value, NULL);
2156 static ir_node *get_value_from_lvalue(const expression_t *expression,
2159 if (expression->kind == EXPR_REFERENCE) {
2160 const reference_expression_t *ref = &expression->reference;
2162 entity_t *entity = ref->entity;
2163 assert(entity->kind == ENTITY_VARIABLE
2164 || entity->kind == ENTITY_PARAMETER);
2165 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2167 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2168 value_number = entity->variable.v.value_number;
2169 assert(addr == NULL);
2170 type_t *type = skip_typeref(expression->base.type);
2171 ir_mode *mode = get_ir_mode_storage(type);
2172 ir_node *res = get_value(value_number, mode);
2173 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2174 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2175 value_number = entity->parameter.v.value_number;
2176 assert(addr == NULL);
2177 type_t *type = skip_typeref(expression->base.type);
2178 ir_mode *mode = get_ir_mode_storage(type);
2179 ir_node *res = get_value(value_number, mode);
2180 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2184 assert(addr != NULL);
2185 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2188 if (expression->kind == EXPR_SELECT &&
2189 expression->select.compound_entry->compound_member.bitfield) {
2190 construct_select_compound(&expression->select);
2191 value = bitfield_extract_to_firm(&expression->select, addr);
2193 value = deref_address(dbgi, expression->base.type, addr);
2200 static ir_node *create_incdec(const unary_expression_t *expression)
2202 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2203 const expression_t *value_expr = expression->value;
2204 ir_node *addr = expression_to_addr(value_expr);
2205 ir_node *value = get_value_from_lvalue(value_expr, addr);
2207 type_t *type = skip_typeref(expression->base.type);
2208 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2211 if (is_type_pointer(type)) {
2212 pointer_type_t *pointer_type = &type->pointer;
2213 offset = get_type_size_node(pointer_type->points_to);
2215 assert(is_type_arithmetic(type));
2216 offset = new_Const(get_mode_one(mode));
2220 ir_node *store_value;
2221 switch(expression->base.kind) {
2222 case EXPR_UNARY_POSTFIX_INCREMENT:
2224 store_value = new_d_Add(dbgi, value, offset, mode);
2226 case EXPR_UNARY_POSTFIX_DECREMENT:
2228 store_value = new_d_Sub(dbgi, value, offset, mode);
2230 case EXPR_UNARY_PREFIX_INCREMENT:
2231 result = new_d_Add(dbgi, value, offset, mode);
2232 store_value = result;
2234 case EXPR_UNARY_PREFIX_DECREMENT:
2235 result = new_d_Sub(dbgi, value, offset, mode);
2236 store_value = result;
2239 panic("no incdec expr in create_incdec");
2242 set_value_for_expression_addr(value_expr, store_value, addr);
2247 static bool is_local_variable(expression_t *expression)
2249 if (expression->kind != EXPR_REFERENCE)
2251 reference_expression_t *ref_expr = &expression->reference;
2252 entity_t *entity = ref_expr->entity;
2253 if (entity->kind != ENTITY_VARIABLE)
2255 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2256 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2259 static ir_relation get_relation(const expression_kind_t kind)
2262 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2263 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2264 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2265 case EXPR_BINARY_ISLESS:
2266 case EXPR_BINARY_LESS: return ir_relation_less;
2267 case EXPR_BINARY_ISLESSEQUAL:
2268 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2269 case EXPR_BINARY_ISGREATER:
2270 case EXPR_BINARY_GREATER: return ir_relation_greater;
2271 case EXPR_BINARY_ISGREATEREQUAL:
2272 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2273 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2278 panic("trying to get pn_Cmp from non-comparison binexpr type");
2282 * Handle the assume optimizer hint: check if a Confirm
2283 * node can be created.
2285 * @param dbi debug info
2286 * @param expr the IL assume expression
2288 * we support here only some simple cases:
2293 static ir_node *handle_assume_compare(dbg_info *dbi,
2294 const binary_expression_t *expression)
2296 expression_t *op1 = expression->left;
2297 expression_t *op2 = expression->right;
2298 entity_t *var2, *var = NULL;
2299 ir_node *res = NULL;
2300 ir_relation relation = get_relation(expression->base.kind);
2302 if (is_local_variable(op1) && is_local_variable(op2)) {
2303 var = op1->reference.entity;
2304 var2 = op2->reference.entity;
2306 type_t *const type = skip_typeref(var->declaration.type);
2307 ir_mode *const mode = get_ir_mode_storage(type);
2309 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2310 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2312 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2313 set_value(var2->variable.v.value_number, res);
2315 res = new_d_Confirm(dbi, irn1, irn2, relation);
2316 set_value(var->variable.v.value_number, res);
2321 expression_t *con = NULL;
2322 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2323 var = op1->reference.entity;
2325 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2326 relation = get_inversed_relation(relation);
2327 var = op2->reference.entity;
2332 type_t *const type = skip_typeref(var->declaration.type);
2333 ir_mode *const mode = get_ir_mode_storage(type);
2335 res = get_value(var->variable.v.value_number, mode);
2336 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2337 set_value(var->variable.v.value_number, res);
2343 * Handle the assume optimizer hint.
2345 * @param dbi debug info
2346 * @param expr the IL assume expression
2348 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2350 switch(expression->kind) {
2351 case EXPR_BINARY_EQUAL:
2352 case EXPR_BINARY_NOTEQUAL:
2353 case EXPR_BINARY_LESS:
2354 case EXPR_BINARY_LESSEQUAL:
2355 case EXPR_BINARY_GREATER:
2356 case EXPR_BINARY_GREATEREQUAL:
2357 return handle_assume_compare(dbi, &expression->binary);
2363 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2364 type_t *from_type, type_t *type)
2366 type = skip_typeref(type);
2367 if (is_type_void(type)) {
2368 /* make sure firm type is constructed */
2369 (void) get_ir_type(type);
2372 if (!is_type_scalar(type)) {
2373 /* make sure firm type is constructed */
2374 (void) get_ir_type(type);
2378 from_type = skip_typeref(from_type);
2379 ir_mode *mode = get_ir_mode_storage(type);
2380 /* check for conversion from / to __based types */
2381 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2382 const variable_t *from_var = from_type->pointer.base_variable;
2383 const variable_t *to_var = type->pointer.base_variable;
2384 if (from_var != to_var) {
2385 if (from_var != NULL) {
2386 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2387 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2388 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2390 if (to_var != NULL) {
2391 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2392 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2393 value_node = new_d_Sub(dbgi, value_node, base, mode);
2398 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2399 /* bool adjustments (we save a mode_Bu, but have to temporarily
2400 * convert to mode_b so we only get a 0/1 value */
2401 value_node = create_conv(dbgi, value_node, mode_b);
2404 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2405 ir_node *node = create_conv(dbgi, value_node, mode);
2406 node = do_strict_conv(dbgi, node);
2407 node = create_conv(dbgi, node, mode_arith);
2412 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2414 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2415 type_t *type = skip_typeref(expression->base.type);
2417 const expression_t *value = expression->value;
2419 switch(expression->base.kind) {
2420 case EXPR_UNARY_TAKE_ADDRESS:
2421 return expression_to_addr(value);
2423 case EXPR_UNARY_NEGATE: {
2424 ir_node *value_node = expression_to_firm(value);
2425 ir_mode *mode = get_ir_mode_arithmetic(type);
2426 return new_d_Minus(dbgi, value_node, mode);
2428 case EXPR_UNARY_PLUS:
2429 return expression_to_firm(value);
2430 case EXPR_UNARY_BITWISE_NEGATE: {
2431 ir_node *value_node = expression_to_firm(value);
2432 ir_mode *mode = get_ir_mode_arithmetic(type);
2433 return new_d_Not(dbgi, value_node, mode);
2435 case EXPR_UNARY_NOT: {
2436 ir_node *value_node = _expression_to_firm(value);
2437 value_node = create_conv(dbgi, value_node, mode_b);
2438 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2441 case EXPR_UNARY_DEREFERENCE: {
2442 ir_node *value_node = expression_to_firm(value);
2443 type_t *value_type = skip_typeref(value->base.type);
2444 assert(is_type_pointer(value_type));
2446 /* check for __based */
2447 const variable_t *const base_var = value_type->pointer.base_variable;
2448 if (base_var != NULL) {
2449 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2450 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2451 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2453 type_t *points_to = value_type->pointer.points_to;
2454 return deref_address(dbgi, points_to, value_node);
2456 case EXPR_UNARY_POSTFIX_INCREMENT:
2457 case EXPR_UNARY_POSTFIX_DECREMENT:
2458 case EXPR_UNARY_PREFIX_INCREMENT:
2459 case EXPR_UNARY_PREFIX_DECREMENT:
2460 return create_incdec(expression);
2461 case EXPR_UNARY_CAST: {
2462 ir_node *value_node = expression_to_firm(value);
2463 type_t *from_type = value->base.type;
2464 return create_cast(dbgi, value_node, from_type, type);
2466 case EXPR_UNARY_ASSUME:
2467 return handle_assume(dbgi, value);
2472 panic("invalid UNEXPR type found");
2476 * produces a 0/1 depending of the value of a mode_b node
2478 static ir_node *produce_condition_result(const expression_t *expression,
2479 ir_mode *mode, dbg_info *dbgi)
2481 ir_node *const one_block = new_immBlock();
2482 ir_node *const zero_block = new_immBlock();
2483 create_condition_evaluation(expression, one_block, zero_block);
2484 mature_immBlock(one_block);
2485 mature_immBlock(zero_block);
2487 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2488 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2489 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2490 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2491 set_cur_block(block);
2493 ir_node *const one = new_Const(get_mode_one(mode));
2494 ir_node *const zero = new_Const(get_mode_null(mode));
2495 ir_node *const in[2] = { one, zero };
2496 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2501 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2502 ir_node *value, type_t *type)
2504 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2505 assert(is_type_pointer(type));
2506 pointer_type_t *const pointer_type = &type->pointer;
2507 type_t *const points_to = skip_typeref(pointer_type->points_to);
2508 ir_node * elem_size = get_type_size_node(points_to);
2509 elem_size = create_conv(dbgi, elem_size, mode);
2510 value = create_conv(dbgi, value, mode);
2511 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2515 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2516 ir_node *left, ir_node *right)
2519 type_t *type_left = skip_typeref(expression->left->base.type);
2520 type_t *type_right = skip_typeref(expression->right->base.type);
2522 expression_kind_t kind = expression->base.kind;
2525 case EXPR_BINARY_SHIFTLEFT:
2526 case EXPR_BINARY_SHIFTRIGHT:
2527 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2528 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2529 mode = get_ir_mode_arithmetic(expression->base.type);
2530 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2533 case EXPR_BINARY_SUB:
2534 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2535 const pointer_type_t *const ptr_type = &type_left->pointer;
2537 mode = get_ir_mode_arithmetic(expression->base.type);
2538 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2539 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2540 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2541 ir_node *const no_mem = new_NoMem();
2542 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2543 mode, op_pin_state_floats);
2544 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2547 case EXPR_BINARY_SUB_ASSIGN:
2548 if (is_type_pointer(type_left)) {
2549 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2550 mode = get_ir_mode_arithmetic(type_left);
2555 case EXPR_BINARY_ADD:
2556 case EXPR_BINARY_ADD_ASSIGN:
2557 if (is_type_pointer(type_left)) {
2558 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2559 mode = get_ir_mode_arithmetic(type_left);
2561 } else if (is_type_pointer(type_right)) {
2562 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2563 mode = get_ir_mode_arithmetic(type_right);
2570 mode = get_ir_mode_arithmetic(type_right);
2571 left = create_conv(dbgi, left, mode);
2576 case EXPR_BINARY_ADD_ASSIGN:
2577 case EXPR_BINARY_ADD:
2578 return new_d_Add(dbgi, left, right, mode);
2579 case EXPR_BINARY_SUB_ASSIGN:
2580 case EXPR_BINARY_SUB:
2581 return new_d_Sub(dbgi, left, right, mode);
2582 case EXPR_BINARY_MUL_ASSIGN:
2583 case EXPR_BINARY_MUL:
2584 return new_d_Mul(dbgi, left, right, mode);
2585 case EXPR_BINARY_BITWISE_AND:
2586 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2587 return new_d_And(dbgi, left, right, mode);
2588 case EXPR_BINARY_BITWISE_OR:
2589 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2590 return new_d_Or(dbgi, left, right, mode);
2591 case EXPR_BINARY_BITWISE_XOR:
2592 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2593 return new_d_Eor(dbgi, left, right, mode);
2594 case EXPR_BINARY_SHIFTLEFT:
2595 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2596 return new_d_Shl(dbgi, left, right, mode);
2597 case EXPR_BINARY_SHIFTRIGHT:
2598 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2599 if (mode_is_signed(mode)) {
2600 return new_d_Shrs(dbgi, left, right, mode);
2602 return new_d_Shr(dbgi, left, right, mode);
2604 case EXPR_BINARY_DIV:
2605 case EXPR_BINARY_DIV_ASSIGN: {
2606 ir_node *pin = new_Pin(new_NoMem());
2607 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2608 op_pin_state_floats);
2609 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2612 case EXPR_BINARY_MOD:
2613 case EXPR_BINARY_MOD_ASSIGN: {
2614 ir_node *pin = new_Pin(new_NoMem());
2615 assert(!mode_is_float(mode));
2616 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2617 op_pin_state_floats);
2618 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2622 panic("unexpected expression kind");
2626 static ir_node *create_lazy_op(const binary_expression_t *expression)
2628 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2629 type_t *type = skip_typeref(expression->base.type);
2630 ir_mode *mode = get_ir_mode_arithmetic(type);
2632 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2633 bool val = fold_constant_to_bool(expression->left);
2634 expression_kind_t ekind = expression->base.kind;
2635 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2636 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2638 return new_Const(get_mode_null(mode));
2642 return new_Const(get_mode_one(mode));
2646 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2647 bool valr = fold_constant_to_bool(expression->right);
2648 return create_Const_from_bool(mode, valr);
2651 return produce_condition_result(expression->right, mode, dbgi);
2654 return produce_condition_result((const expression_t*) expression, mode,
2658 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2659 ir_node *right, ir_mode *mode);
2661 static ir_node *create_assign_binop(const binary_expression_t *expression)
2663 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2664 const expression_t *left_expr = expression->left;
2665 type_t *type = skip_typeref(left_expr->base.type);
2666 ir_node *right = expression_to_firm(expression->right);
2667 ir_node *left_addr = expression_to_addr(left_expr);
2668 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2669 ir_node *result = create_op(dbgi, expression, left, right);
2671 result = create_cast(dbgi, result, expression->right->base.type, type);
2672 result = do_strict_conv(dbgi, result);
2674 result = set_value_for_expression_addr(left_expr, result, left_addr);
2676 if (!is_type_compound(type)) {
2677 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2678 result = create_conv(dbgi, result, mode_arithmetic);
2683 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2685 expression_kind_t kind = expression->base.kind;
2688 case EXPR_BINARY_EQUAL:
2689 case EXPR_BINARY_NOTEQUAL:
2690 case EXPR_BINARY_LESS:
2691 case EXPR_BINARY_LESSEQUAL:
2692 case EXPR_BINARY_GREATER:
2693 case EXPR_BINARY_GREATEREQUAL:
2694 case EXPR_BINARY_ISGREATER:
2695 case EXPR_BINARY_ISGREATEREQUAL:
2696 case EXPR_BINARY_ISLESS:
2697 case EXPR_BINARY_ISLESSEQUAL:
2698 case EXPR_BINARY_ISLESSGREATER:
2699 case EXPR_BINARY_ISUNORDERED: {
2700 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2701 ir_node *left = expression_to_firm(expression->left);
2702 ir_node *right = expression_to_firm(expression->right);
2703 ir_relation relation = get_relation(kind);
2704 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2707 case EXPR_BINARY_ASSIGN: {
2708 ir_node *addr = expression_to_addr(expression->left);
2709 ir_node *right = expression_to_firm(expression->right);
2711 = set_value_for_expression_addr(expression->left, right, addr);
2713 type_t *type = skip_typeref(expression->base.type);
2714 if (!is_type_compound(type)) {
2715 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2716 res = create_conv(NULL, res, mode_arithmetic);
2720 case EXPR_BINARY_ADD:
2721 case EXPR_BINARY_SUB:
2722 case EXPR_BINARY_MUL:
2723 case EXPR_BINARY_DIV:
2724 case EXPR_BINARY_MOD:
2725 case EXPR_BINARY_BITWISE_AND:
2726 case EXPR_BINARY_BITWISE_OR:
2727 case EXPR_BINARY_BITWISE_XOR:
2728 case EXPR_BINARY_SHIFTLEFT:
2729 case EXPR_BINARY_SHIFTRIGHT:
2731 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2732 ir_node *left = expression_to_firm(expression->left);
2733 ir_node *right = expression_to_firm(expression->right);
2734 return create_op(dbgi, expression, left, right);
2736 case EXPR_BINARY_LOGICAL_AND:
2737 case EXPR_BINARY_LOGICAL_OR:
2738 return create_lazy_op(expression);
2739 case EXPR_BINARY_COMMA:
2740 /* create side effects of left side */
2741 (void) expression_to_firm(expression->left);
2742 return _expression_to_firm(expression->right);
2744 case EXPR_BINARY_ADD_ASSIGN:
2745 case EXPR_BINARY_SUB_ASSIGN:
2746 case EXPR_BINARY_MUL_ASSIGN:
2747 case EXPR_BINARY_MOD_ASSIGN:
2748 case EXPR_BINARY_DIV_ASSIGN:
2749 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2750 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2751 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2752 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2753 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2754 return create_assign_binop(expression);
2756 panic("TODO binexpr type");
2760 static ir_node *array_access_addr(const array_access_expression_t *expression)
2762 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2763 ir_node *base_addr = expression_to_firm(expression->array_ref);
2764 ir_node *offset = expression_to_firm(expression->index);
2765 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2766 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2767 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2772 static ir_node *array_access_to_firm(
2773 const array_access_expression_t *expression)
2775 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2776 ir_node *addr = array_access_addr(expression);
2777 type_t *type = revert_automatic_type_conversion(
2778 (const expression_t*) expression);
2779 type = skip_typeref(type);
2781 return deref_address(dbgi, type, addr);
2784 static long get_offsetof_offset(const offsetof_expression_t *expression)
2786 type_t *orig_type = expression->type;
2789 designator_t *designator = expression->designator;
2790 for ( ; designator != NULL; designator = designator->next) {
2791 type_t *type = skip_typeref(orig_type);
2792 /* be sure the type is constructed */
2793 (void) get_ir_type(type);
2795 if (designator->symbol != NULL) {
2796 assert(is_type_compound(type));
2797 symbol_t *symbol = designator->symbol;
2799 compound_t *compound = type->compound.compound;
2800 entity_t *iter = compound->members.entities;
2801 for ( ; iter != NULL; iter = iter->base.next) {
2802 if (iter->base.symbol == symbol) {
2806 assert(iter != NULL);
2808 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2809 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2810 offset += get_entity_offset(iter->compound_member.entity);
2812 orig_type = iter->declaration.type;
2814 expression_t *array_index = designator->array_index;
2815 assert(designator->array_index != NULL);
2816 assert(is_type_array(type));
2818 long index = fold_constant_to_int(array_index);
2819 ir_type *arr_type = get_ir_type(type);
2820 ir_type *elem_type = get_array_element_type(arr_type);
2821 long elem_size = get_type_size_bytes(elem_type);
2823 offset += index * elem_size;
2825 orig_type = type->array.element_type;
2832 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2834 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2835 long offset = get_offsetof_offset(expression);
2836 ir_tarval *tv = new_tarval_from_long(offset, mode);
2837 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2839 return new_d_Const(dbgi, tv);
2842 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2843 ir_entity *entity, type_t *type);
2844 static ir_initializer_t *create_ir_initializer(
2845 const initializer_t *initializer, type_t *type);
2847 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2848 initializer_t *initializer,
2851 /* create the ir_initializer */
2852 ir_graph *const old_current_ir_graph = current_ir_graph;
2853 current_ir_graph = get_const_code_irg();
2855 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2857 assert(current_ir_graph == get_const_code_irg());
2858 current_ir_graph = old_current_ir_graph;
2860 ident *const id = id_unique("initializer.%u");
2861 ir_type *const irtype = get_ir_type(type);
2862 ir_type *const global_type = get_glob_type();
2863 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2864 set_entity_ld_ident(entity, id);
2865 set_entity_visibility(entity, ir_visibility_private);
2866 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2867 set_entity_initializer(entity, irinitializer);
2871 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2873 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2874 type_t *type = expression->type;
2875 initializer_t *initializer = expression->initializer;
2877 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2878 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2879 return create_symconst(dbgi, entity);
2881 /* create an entity on the stack */
2882 ident *const id = id_unique("CompLit.%u");
2883 ir_type *const irtype = get_ir_type(type);
2884 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2886 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2887 set_entity_ld_ident(entity, id);
2889 /* create initialisation code */
2890 create_local_initializer(initializer, dbgi, entity, type);
2892 /* create a sel for the compound literal address */
2893 ir_node *frame = get_irg_frame(current_ir_graph);
2894 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2899 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2901 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2902 type_t *const type = expr->type;
2903 ir_node *const addr = compound_literal_addr(expr);
2904 return deref_address(dbgi, type, addr);
2908 * Transform a sizeof expression into Firm code.
2910 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2912 type_t *const type = skip_typeref(expression->type);
2913 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2914 if (is_type_array(type) && type->array.is_vla
2915 && expression->tp_expression != NULL) {
2916 expression_to_firm(expression->tp_expression);
2918 /* strange gnu extensions: sizeof(function) == 1 */
2919 if (is_type_function(type)) {
2920 ir_mode *mode = get_ir_mode_storage(type_size_t);
2921 return new_Const(get_mode_one(mode));
2924 return get_type_size_node(type);
2927 static entity_t *get_expression_entity(const expression_t *expression)
2929 if (expression->kind != EXPR_REFERENCE)
2932 return expression->reference.entity;
2935 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2937 switch(entity->kind) {
2938 case DECLARATION_KIND_CASES:
2939 return entity->declaration.alignment;
2942 return entity->compound.alignment;
2943 case ENTITY_TYPEDEF:
2944 return entity->typedefe.alignment;
2952 * Transform an alignof expression into Firm code.
2954 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2956 unsigned alignment = 0;
2958 const expression_t *tp_expression = expression->tp_expression;
2959 if (tp_expression != NULL) {
2960 entity_t *entity = get_expression_entity(tp_expression);
2961 if (entity != NULL) {
2962 if (entity->kind == ENTITY_FUNCTION) {
2963 /* a gnu-extension */
2966 alignment = get_cparser_entity_alignment(entity);
2971 if (alignment == 0) {
2972 type_t *type = expression->type;
2973 alignment = get_type_alignment(type);
2976 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2977 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2978 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2979 return new_d_Const(dbgi, tv);
2982 static void init_ir_types(void);
2984 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2986 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2988 bool constant_folding_old = constant_folding;
2989 constant_folding = true;
2990 int old_optimize = get_optimize();
2991 int old_constant_folding = get_opt_constant_folding();
2993 set_opt_constant_folding(1);
2997 ir_graph *old_current_ir_graph = current_ir_graph;
2998 current_ir_graph = get_const_code_irg();
3000 ir_node *cnst = expression_to_firm(expression);
3001 current_ir_graph = old_current_ir_graph;
3002 set_optimize(old_optimize);
3003 set_opt_constant_folding(old_constant_folding);
3005 if (!is_Const(cnst)) {
3006 panic("couldn't fold constant");
3009 constant_folding = constant_folding_old;
3011 return get_Const_tarval(cnst);
3014 /* this function is only used in parser.c, but it relies on libfirm functionality */
3015 bool constant_is_negative(const expression_t *expression)
3017 ir_tarval *tv = fold_constant_to_tarval(expression);
3018 return tarval_is_negative(tv);
3021 long fold_constant_to_int(const expression_t *expression)
3023 ir_tarval *tv = fold_constant_to_tarval(expression);
3024 if (!tarval_is_long(tv)) {
3025 panic("result of constant folding is not integer");
3028 return get_tarval_long(tv);
3031 bool fold_constant_to_bool(const expression_t *expression)
3033 ir_tarval *tv = fold_constant_to_tarval(expression);
3034 return !tarval_is_null(tv);
3037 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3039 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3041 /* first try to fold a constant condition */
3042 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3043 bool val = fold_constant_to_bool(expression->condition);
3045 expression_t *true_expression = expression->true_expression;
3046 if (true_expression == NULL)
3047 true_expression = expression->condition;
3048 return expression_to_firm(true_expression);
3050 return expression_to_firm(expression->false_expression);
3054 ir_node *const true_block = new_immBlock();
3055 ir_node *const false_block = new_immBlock();
3056 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3057 mature_immBlock(true_block);
3058 mature_immBlock(false_block);
3060 set_cur_block(true_block);
3062 if (expression->true_expression != NULL) {
3063 true_val = expression_to_firm(expression->true_expression);
3064 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3065 true_val = cond_expr;
3067 /* Condition ended with a short circuit (&&, ||, !) operation or a
3068 * comparison. Generate a "1" as value for the true branch. */
3069 true_val = new_Const(get_mode_one(mode_Is));
3071 ir_node *const true_jmp = new_d_Jmp(dbgi);
3073 set_cur_block(false_block);
3074 ir_node *const false_val = expression_to_firm(expression->false_expression);
3075 ir_node *const false_jmp = new_d_Jmp(dbgi);
3077 /* create the common block */
3078 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3079 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3080 set_cur_block(block);
3082 /* TODO improve static semantics, so either both or no values are NULL */
3083 if (true_val == NULL || false_val == NULL)
3086 ir_node *const in[2] = { true_val, false_val };
3087 type_t *const type = skip_typeref(expression->base.type);
3088 ir_mode *const mode = get_ir_mode_arithmetic(type);
3089 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3095 * Returns an IR-node representing the address of a field.
3097 static ir_node *select_addr(const select_expression_t *expression)
3099 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3101 construct_select_compound(expression);
3103 ir_node *compound_addr = expression_to_firm(expression->compound);
3105 entity_t *entry = expression->compound_entry;
3106 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3107 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3109 if (constant_folding) {
3110 ir_mode *mode = get_irn_mode(compound_addr);
3111 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3112 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3113 return new_d_Add(dbgi, compound_addr, ofs, mode);
3115 ir_entity *irentity = entry->compound_member.entity;
3116 assert(irentity != NULL);
3117 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3121 static ir_node *select_to_firm(const select_expression_t *expression)
3123 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3124 ir_node *addr = select_addr(expression);
3125 type_t *type = revert_automatic_type_conversion(
3126 (const expression_t*) expression);
3127 type = skip_typeref(type);
3129 entity_t *entry = expression->compound_entry;
3130 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3132 if (entry->compound_member.bitfield) {
3133 return bitfield_extract_to_firm(expression, addr);
3136 return deref_address(dbgi, type, addr);
3139 /* Values returned by __builtin_classify_type. */
3140 typedef enum gcc_type_class
3146 enumeral_type_class,
3149 reference_type_class,
3153 function_type_class,
3164 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3166 type_t *type = expr->type_expression->base.type;
3168 /* FIXME gcc returns different values depending on whether compiling C or C++
3169 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3172 type = skip_typeref(type);
3173 switch (type->kind) {
3175 const atomic_type_t *const atomic_type = &type->atomic;
3176 switch (atomic_type->akind) {
3177 /* should not be reached */
3178 case ATOMIC_TYPE_INVALID:
3182 /* gcc cannot do that */
3183 case ATOMIC_TYPE_VOID:
3184 tc = void_type_class;
3187 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3188 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3189 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3190 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3191 case ATOMIC_TYPE_SHORT:
3192 case ATOMIC_TYPE_USHORT:
3193 case ATOMIC_TYPE_INT:
3194 case ATOMIC_TYPE_UINT:
3195 case ATOMIC_TYPE_LONG:
3196 case ATOMIC_TYPE_ULONG:
3197 case ATOMIC_TYPE_LONGLONG:
3198 case ATOMIC_TYPE_ULONGLONG:
3199 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3200 tc = integer_type_class;
3203 case ATOMIC_TYPE_FLOAT:
3204 case ATOMIC_TYPE_DOUBLE:
3205 case ATOMIC_TYPE_LONG_DOUBLE:
3206 tc = real_type_class;
3209 panic("Unexpected atomic type in classify_type_to_firm().");
3212 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3213 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3214 case TYPE_ARRAY: /* gcc handles this as pointer */
3215 case TYPE_FUNCTION: /* gcc handles this as pointer */
3216 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3217 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3218 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3220 /* gcc handles this as integer */
3221 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3223 /* gcc classifies the referenced type */
3224 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3226 /* typedef/typeof should be skipped already */
3232 panic("unexpected TYPE classify_type_to_firm().");
3236 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3237 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3238 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3239 return new_d_Const(dbgi, tv);
3242 static ir_node *function_name_to_firm(
3243 const funcname_expression_t *const expr)
3245 switch(expr->kind) {
3246 case FUNCNAME_FUNCTION:
3247 case FUNCNAME_PRETTY_FUNCTION:
3248 case FUNCNAME_FUNCDNAME:
3249 if (current_function_name == NULL) {
3250 const source_position_t *const src_pos = &expr->base.source_position;
3251 const char *name = current_function_entity->base.symbol->string;
3252 const string_t string = { name, strlen(name) + 1 };
3253 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3255 return current_function_name;
3256 case FUNCNAME_FUNCSIG:
3257 if (current_funcsig == NULL) {
3258 const source_position_t *const src_pos = &expr->base.source_position;
3259 ir_entity *ent = get_irg_entity(current_ir_graph);
3260 const char *const name = get_entity_ld_name(ent);
3261 const string_t string = { name, strlen(name) + 1 };
3262 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3264 return current_funcsig;
3266 panic("Unsupported function name");
3269 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3271 statement_t *statement = expr->statement;
3273 assert(statement->kind == STATEMENT_COMPOUND);
3274 return compound_statement_to_firm(&statement->compound);
3277 static ir_node *va_start_expression_to_firm(
3278 const va_start_expression_t *const expr)
3280 ir_entity *param_ent = current_vararg_entity;
3281 if (param_ent == NULL) {
3282 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3283 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3284 ir_type *const param_type = get_unknown_type();
3285 param_ent = new_parameter_entity(frame_type, n, param_type);
3286 current_vararg_entity = param_ent;
3289 ir_node *const frame = get_irg_frame(current_ir_graph);
3290 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3291 ir_node *const no_mem = new_NoMem();
3292 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3294 set_value_for_expression(expr->ap, arg_sel);
3299 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3301 type_t *const type = expr->base.type;
3302 expression_t *const ap_expr = expr->ap;
3303 ir_node *const ap_addr = expression_to_addr(ap_expr);
3304 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3305 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3306 ir_node *const res = deref_address(dbgi, type, ap);
3308 ir_node *const cnst = get_type_size_node(expr->base.type);
3309 ir_mode *const mode = get_irn_mode(cnst);
3310 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3311 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3312 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3313 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3314 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3316 set_value_for_expression_addr(ap_expr, add, ap_addr);
3322 * Generate Firm for a va_copy expression.
3324 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3326 ir_node *const src = expression_to_firm(expr->src);
3327 set_value_for_expression(expr->dst, src);
3331 static ir_node *dereference_addr(const unary_expression_t *const expression)
3333 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3334 return expression_to_firm(expression->value);
3338 * Returns a IR-node representing an lvalue of the given expression.
3340 static ir_node *expression_to_addr(const expression_t *expression)
3342 switch(expression->kind) {
3343 case EXPR_ARRAY_ACCESS:
3344 return array_access_addr(&expression->array_access);
3346 return call_expression_to_firm(&expression->call);
3347 case EXPR_COMPOUND_LITERAL:
3348 return compound_literal_addr(&expression->compound_literal);
3349 case EXPR_REFERENCE:
3350 return reference_addr(&expression->reference);
3352 return select_addr(&expression->select);
3353 case EXPR_UNARY_DEREFERENCE:
3354 return dereference_addr(&expression->unary);
3358 panic("trying to get address of non-lvalue");
3361 static ir_node *builtin_constant_to_firm(
3362 const builtin_constant_expression_t *expression)
3364 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3365 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3366 return create_Const_from_bool(mode, v);
3369 static ir_node *builtin_types_compatible_to_firm(
3370 const builtin_types_compatible_expression_t *expression)
3372 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3373 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3374 bool const value = types_compatible(left, right);
3375 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3376 return create_Const_from_bool(mode, value);
3379 static ir_node *get_label_block(label_t *label)
3381 if (label->block != NULL)
3382 return label->block;
3384 /* beware: might be called from create initializer with current_ir_graph
3385 * set to const_code_irg. */
3386 ir_graph *rem = current_ir_graph;
3387 current_ir_graph = current_function;
3389 ir_node *block = new_immBlock();
3391 label->block = block;
3393 ARR_APP1(label_t *, all_labels, label);
3395 current_ir_graph = rem;
3400 * Pointer to a label. This is used for the
3401 * GNU address-of-label extension.
3403 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3405 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3406 ir_node *block = get_label_block(label->label);
3407 ir_entity *entity = create_Block_entity(block);
3409 symconst_symbol value;
3410 value.entity_p = entity;
3411 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3415 * creates firm nodes for an expression. The difference between this function
3416 * and expression_to_firm is, that this version might produce mode_b nodes
3417 * instead of mode_Is.
3419 static ir_node *_expression_to_firm(expression_t const *const expr)
3422 if (!constant_folding) {
3423 assert(!expr->base.transformed);
3424 ((expression_t*)expr)->base.transformed = true;
3428 switch (expr->kind) {
3429 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3430 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3431 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3432 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3433 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3434 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3435 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3436 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3437 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3438 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3439 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3440 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3441 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3442 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3443 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3444 case EXPR_SELECT: return select_to_firm( &expr->select);
3445 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3446 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3447 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3448 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3449 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3450 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3451 case EXPR_WIDE_STRING_LITERAL: return wide_string_literal_to_firm( &expr->string_literal);
3453 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->literal.value);
3455 case EXPR_ERROR: break;
3457 panic("invalid expression found");
3461 * Check if a given expression is a GNU __builtin_expect() call.
3463 static bool is_builtin_expect(const expression_t *expression)
3465 if (expression->kind != EXPR_CALL)
3468 expression_t *function = expression->call.function;
3469 if (function->kind != EXPR_REFERENCE)
3471 reference_expression_t *ref = &function->reference;
3472 if (ref->entity->kind != ENTITY_FUNCTION ||
3473 ref->entity->function.btk != BUILTIN_EXPECT)
3479 static bool produces_mode_b(const expression_t *expression)
3481 switch (expression->kind) {
3482 case EXPR_BINARY_EQUAL:
3483 case EXPR_BINARY_NOTEQUAL:
3484 case EXPR_BINARY_LESS:
3485 case EXPR_BINARY_LESSEQUAL:
3486 case EXPR_BINARY_GREATER:
3487 case EXPR_BINARY_GREATEREQUAL:
3488 case EXPR_BINARY_ISGREATER:
3489 case EXPR_BINARY_ISGREATEREQUAL:
3490 case EXPR_BINARY_ISLESS:
3491 case EXPR_BINARY_ISLESSEQUAL:
3492 case EXPR_BINARY_ISLESSGREATER:
3493 case EXPR_BINARY_ISUNORDERED:
3494 case EXPR_UNARY_NOT:
3498 if (is_builtin_expect(expression)) {
3499 expression_t *argument = expression->call.arguments->expression;
3500 return produces_mode_b(argument);
3503 case EXPR_BINARY_COMMA:
3504 return produces_mode_b(expression->binary.right);
3511 static ir_node *expression_to_firm(const expression_t *expression)
3513 if (!produces_mode_b(expression)) {
3514 ir_node *res = _expression_to_firm(expression);
3515 assert(res == NULL || get_irn_mode(res) != mode_b);
3519 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3520 bool const constant_folding_old = constant_folding;
3521 constant_folding = true;
3522 ir_node *res = _expression_to_firm(expression);
3523 constant_folding = constant_folding_old;
3524 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3525 assert(is_Const(res));
3526 return create_Const_from_bool(mode, !is_Const_null(res));
3529 /* we have to produce a 0/1 from the mode_b expression */
3530 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3531 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3532 return produce_condition_result(expression, mode, dbgi);
3536 * create a short-circuit expression evaluation that tries to construct
3537 * efficient control flow structures for &&, || and ! expressions
3539 static ir_node *create_condition_evaluation(const expression_t *expression,
3540 ir_node *true_block,
3541 ir_node *false_block)
3543 switch(expression->kind) {
3544 case EXPR_UNARY_NOT: {
3545 const unary_expression_t *unary_expression = &expression->unary;
3546 create_condition_evaluation(unary_expression->value, false_block,
3550 case EXPR_BINARY_LOGICAL_AND: {
3551 const binary_expression_t *binary_expression = &expression->binary;
3553 ir_node *extra_block = new_immBlock();
3554 create_condition_evaluation(binary_expression->left, extra_block,
3556 mature_immBlock(extra_block);
3557 set_cur_block(extra_block);
3558 create_condition_evaluation(binary_expression->right, true_block,
3562 case EXPR_BINARY_LOGICAL_OR: {
3563 const binary_expression_t *binary_expression = &expression->binary;
3565 ir_node *extra_block = new_immBlock();
3566 create_condition_evaluation(binary_expression->left, true_block,
3568 mature_immBlock(extra_block);
3569 set_cur_block(extra_block);
3570 create_condition_evaluation(binary_expression->right, true_block,
3578 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3579 ir_node *cond_expr = _expression_to_firm(expression);
3580 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3581 ir_node *cond = new_d_Cond(dbgi, condition);
3582 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3583 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3585 /* set branch prediction info based on __builtin_expect */
3586 if (is_builtin_expect(expression) && is_Cond(cond)) {
3587 call_argument_t *argument = expression->call.arguments->next;
3588 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3589 bool const cnst = fold_constant_to_bool(argument->expression);
3590 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3591 set_Cond_jmp_pred(cond, pred);
3595 add_immBlock_pred(true_block, true_proj);
3596 add_immBlock_pred(false_block, false_proj);
3598 set_unreachable_now();
3602 static void create_variable_entity(entity_t *variable,
3603 declaration_kind_t declaration_kind,
3604 ir_type *parent_type)
3606 assert(variable->kind == ENTITY_VARIABLE);
3607 type_t *type = skip_typeref(variable->declaration.type);
3609 ident *const id = new_id_from_str(variable->base.symbol->string);
3610 ir_type *const irtype = get_ir_type(type);
3611 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3612 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3613 unsigned alignment = variable->declaration.alignment;
3615 set_entity_alignment(irentity, alignment);
3617 handle_decl_modifiers(irentity, variable);
3619 variable->declaration.kind = (unsigned char) declaration_kind;
3620 variable->variable.v.entity = irentity;
3621 set_entity_ld_ident(irentity, create_ld_ident(variable));
3623 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3624 set_entity_volatility(irentity, volatility_is_volatile);
3629 typedef struct type_path_entry_t type_path_entry_t;
3630 struct type_path_entry_t {
3632 ir_initializer_t *initializer;
3634 entity_t *compound_entry;
3637 typedef struct type_path_t type_path_t;
3638 struct type_path_t {
3639 type_path_entry_t *path;
3644 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3646 size_t len = ARR_LEN(path->path);
3648 for (size_t i = 0; i < len; ++i) {
3649 const type_path_entry_t *entry = & path->path[i];
3651 type_t *type = skip_typeref(entry->type);
3652 if (is_type_compound(type)) {
3653 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3654 } else if (is_type_array(type)) {
3655 fprintf(stderr, "[%u]", (unsigned) entry->index);
3657 fprintf(stderr, "-INVALID-");
3660 fprintf(stderr, " (");
3661 print_type(path->top_type);
3662 fprintf(stderr, ")");
3665 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3667 size_t len = ARR_LEN(path->path);
3669 return & path->path[len-1];
3672 static type_path_entry_t *append_to_type_path(type_path_t *path)
3674 size_t len = ARR_LEN(path->path);
3675 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3677 type_path_entry_t *result = & path->path[len];
3678 memset(result, 0, sizeof(result[0]));
3682 static size_t get_compound_member_count(const compound_type_t *type)
3684 compound_t *compound = type->compound;
3685 size_t n_members = 0;
3686 entity_t *member = compound->members.entities;
3687 for ( ; member != NULL; member = member->base.next) {
3694 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3696 type_t *orig_top_type = path->top_type;
3697 type_t *top_type = skip_typeref(orig_top_type);
3699 assert(is_type_compound(top_type) || is_type_array(top_type));
3701 if (ARR_LEN(path->path) == 0) {
3704 type_path_entry_t *top = get_type_path_top(path);
3705 ir_initializer_t *initializer = top->initializer;
3706 return get_initializer_compound_value(initializer, top->index);
3710 static void descend_into_subtype(type_path_t *path)
3712 type_t *orig_top_type = path->top_type;
3713 type_t *top_type = skip_typeref(orig_top_type);
3715 assert(is_type_compound(top_type) || is_type_array(top_type));
3717 ir_initializer_t *initializer = get_initializer_entry(path);
3719 type_path_entry_t *top = append_to_type_path(path);
3720 top->type = top_type;
3724 if (is_type_compound(top_type)) {
3725 compound_t *const compound = top_type->compound.compound;
3726 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3728 top->compound_entry = entry;
3730 len = get_compound_member_count(&top_type->compound);
3731 if (entry != NULL) {
3732 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3733 path->top_type = entry->declaration.type;
3736 assert(is_type_array(top_type));
3737 assert(top_type->array.size > 0);
3740 path->top_type = top_type->array.element_type;
3741 len = top_type->array.size;
3743 if (initializer == NULL
3744 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3745 initializer = create_initializer_compound(len);
3746 /* we have to set the entry at the 2nd latest path entry... */
3747 size_t path_len = ARR_LEN(path->path);
3748 assert(path_len >= 1);
3750 type_path_entry_t *entry = & path->path[path_len-2];
3751 ir_initializer_t *tinitializer = entry->initializer;
3752 set_initializer_compound_value(tinitializer, entry->index,
3756 top->initializer = initializer;
3759 static void ascend_from_subtype(type_path_t *path)
3761 type_path_entry_t *top = get_type_path_top(path);
3763 path->top_type = top->type;
3765 size_t len = ARR_LEN(path->path);
3766 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3769 static void walk_designator(type_path_t *path, const designator_t *designator)
3771 /* designators start at current object type */
3772 ARR_RESIZE(type_path_entry_t, path->path, 1);
3774 for ( ; designator != NULL; designator = designator->next) {
3775 type_path_entry_t *top = get_type_path_top(path);
3776 type_t *orig_type = top->type;
3777 type_t *type = skip_typeref(orig_type);
3779 if (designator->symbol != NULL) {
3780 assert(is_type_compound(type));
3782 symbol_t *symbol = designator->symbol;
3784 compound_t *compound = type->compound.compound;
3785 entity_t *iter = compound->members.entities;
3786 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3787 if (iter->base.symbol == symbol) {
3788 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3792 assert(iter != NULL);
3794 /* revert previous initialisations of other union elements */
3795 if (type->kind == TYPE_COMPOUND_UNION) {
3796 ir_initializer_t *initializer = top->initializer;
3797 if (initializer != NULL
3798 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3799 /* are we writing to a new element? */
3800 ir_initializer_t *oldi
3801 = get_initializer_compound_value(initializer, index);
3802 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3803 /* clear initializer */
3805 = get_initializer_compound_n_entries(initializer);
3806 ir_initializer_t *nulli = get_initializer_null();
3807 for (size_t i = 0; i < len; ++i) {
3808 set_initializer_compound_value(initializer, i,
3815 top->type = orig_type;
3816 top->compound_entry = iter;
3818 orig_type = iter->declaration.type;
3820 expression_t *array_index = designator->array_index;
3821 assert(designator->array_index != NULL);
3822 assert(is_type_array(type));
3824 long index = fold_constant_to_int(array_index);
3827 if (type->array.size_constant) {
3828 long array_size = type->array.size;
3829 assert(index < array_size);
3833 top->type = orig_type;
3834 top->index = (size_t) index;
3835 orig_type = type->array.element_type;
3837 path->top_type = orig_type;
3839 if (designator->next != NULL) {
3840 descend_into_subtype(path);
3844 path->invalid = false;
3847 static void advance_current_object(type_path_t *path)
3849 if (path->invalid) {
3850 /* TODO: handle this... */
3851 panic("invalid initializer in ast2firm (excessive elements)");
3854 type_path_entry_t *top = get_type_path_top(path);
3856 type_t *type = skip_typeref(top->type);
3857 if (is_type_union(type)) {
3858 /* only the first element is initialized in unions */
3859 top->compound_entry = NULL;
3860 } else if (is_type_struct(type)) {
3861 entity_t *entry = top->compound_entry;
3864 entry = skip_unnamed_bitfields(entry->base.next);
3865 top->compound_entry = entry;
3866 if (entry != NULL) {
3867 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3868 path->top_type = entry->declaration.type;
3872 assert(is_type_array(type));
3875 if (!type->array.size_constant || top->index < type->array.size) {
3880 /* we're past the last member of the current sub-aggregate, try if we
3881 * can ascend in the type hierarchy and continue with another subobject */
3882 size_t len = ARR_LEN(path->path);
3885 ascend_from_subtype(path);
3886 advance_current_object(path);
3888 path->invalid = true;
3893 static ir_initializer_t *create_ir_initializer_value(
3894 const initializer_value_t *initializer)
3896 if (is_type_compound(initializer->value->base.type)) {
3897 panic("initializer creation for compounds not implemented yet");
3899 type_t *type = initializer->value->base.type;
3900 expression_t *expr = initializer->value;
3901 ir_node *value = expression_to_firm(expr);
3902 ir_mode *mode = get_ir_mode_storage(type);
3903 value = create_conv(NULL, value, mode);
3904 return create_initializer_const(value);
3907 /** test wether type can be initialized by a string constant */
3908 static bool is_string_type(type_t *type)
3911 if (is_type_pointer(type)) {
3912 inner = skip_typeref(type->pointer.points_to);
3913 } else if(is_type_array(type)) {
3914 inner = skip_typeref(type->array.element_type);
3919 return is_type_integer(inner);
3922 static ir_initializer_t *create_ir_initializer_list(
3923 const initializer_list_t *initializer, type_t *type)
3926 memset(&path, 0, sizeof(path));
3927 path.top_type = type;
3928 path.path = NEW_ARR_F(type_path_entry_t, 0);
3930 descend_into_subtype(&path);
3932 for (size_t i = 0; i < initializer->len; ++i) {
3933 const initializer_t *sub_initializer = initializer->initializers[i];
3935 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3936 walk_designator(&path, sub_initializer->designator.designator);
3940 if (sub_initializer->kind == INITIALIZER_VALUE) {
3941 /* we might have to descend into types until we're at a scalar
3944 type_t *orig_top_type = path.top_type;
3945 type_t *top_type = skip_typeref(orig_top_type);
3947 if (is_type_scalar(top_type))
3949 descend_into_subtype(&path);
3951 } else if (sub_initializer->kind == INITIALIZER_STRING
3952 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3953 /* we might have to descend into types until we're at a scalar
3956 type_t *orig_top_type = path.top_type;
3957 type_t *top_type = skip_typeref(orig_top_type);
3959 if (is_string_type(top_type))
3961 descend_into_subtype(&path);
3965 ir_initializer_t *sub_irinitializer
3966 = create_ir_initializer(sub_initializer, path.top_type);
3968 size_t path_len = ARR_LEN(path.path);
3969 assert(path_len >= 1);
3970 type_path_entry_t *entry = & path.path[path_len-1];
3971 ir_initializer_t *tinitializer = entry->initializer;
3972 set_initializer_compound_value(tinitializer, entry->index,
3975 advance_current_object(&path);
3978 assert(ARR_LEN(path.path) >= 1);
3979 ir_initializer_t *result = path.path[0].initializer;
3980 DEL_ARR_F(path.path);
3985 static ir_initializer_t *create_ir_initializer_string(
3986 const initializer_string_t *initializer, type_t *type)
3988 type = skip_typeref(type);
3990 size_t string_len = initializer->string.size;
3991 assert(type->kind == TYPE_ARRAY);
3992 assert(type->array.size_constant);
3993 size_t len = type->array.size;
3994 ir_initializer_t *irinitializer = create_initializer_compound(len);
3996 const char *string = initializer->string.begin;
3997 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
3999 for (size_t i = 0; i < len; ++i) {
4004 ir_tarval *tv = new_tarval_from_long(c, mode);
4005 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4007 set_initializer_compound_value(irinitializer, i, char_initializer);
4010 return irinitializer;
4013 static ir_initializer_t *create_ir_initializer_wide_string(
4014 const initializer_wide_string_t *initializer, type_t *type)
4016 assert(type->kind == TYPE_ARRAY);
4017 assert(type->array.size_constant);
4018 size_t len = type->array.size;
4019 size_t string_len = wstrlen(&initializer->string);
4020 ir_initializer_t *irinitializer = create_initializer_compound(len);
4022 const char *p = initializer->string.begin;
4023 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4025 for (size_t i = 0; i < len; ++i) {
4027 if (i < string_len) {
4028 c = read_utf8_char(&p);
4030 ir_tarval *tv = new_tarval_from_long(c, mode);
4031 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4033 set_initializer_compound_value(irinitializer, i, char_initializer);
4036 return irinitializer;
4039 static ir_initializer_t *create_ir_initializer(
4040 const initializer_t *initializer, type_t *type)
4042 switch(initializer->kind) {
4043 case INITIALIZER_STRING:
4044 return create_ir_initializer_string(&initializer->string, type);
4046 case INITIALIZER_WIDE_STRING:
4047 return create_ir_initializer_wide_string(&initializer->wide_string,
4050 case INITIALIZER_LIST:
4051 return create_ir_initializer_list(&initializer->list, type);
4053 case INITIALIZER_VALUE:
4054 return create_ir_initializer_value(&initializer->value);
4056 case INITIALIZER_DESIGNATOR:
4057 panic("unexpected designator initializer found");
4059 panic("unknown initializer");
4062 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4063 * are elements [...] the remainder of the aggregate shall be initialized
4064 * implicitly the same as objects that have static storage duration. */
4065 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4068 /* for unions we must NOT do anything for null initializers */
4069 ir_type *owner = get_entity_owner(entity);
4070 if (is_Union_type(owner)) {
4074 ir_type *ent_type = get_entity_type(entity);
4075 /* create sub-initializers for a compound type */
4076 if (is_compound_type(ent_type)) {
4077 unsigned n_members = get_compound_n_members(ent_type);
4078 for (unsigned n = 0; n < n_members; ++n) {
4079 ir_entity *member = get_compound_member(ent_type, n);
4080 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4082 create_dynamic_null_initializer(member, dbgi, addr);
4086 if (is_Array_type(ent_type)) {
4087 assert(has_array_upper_bound(ent_type, 0));
4088 long n = get_array_upper_bound_int(ent_type, 0);
4089 for (long i = 0; i < n; ++i) {
4090 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4091 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4092 ir_node *cnst = new_d_Const(dbgi, index_tv);
4093 ir_node *in[1] = { cnst };
4094 ir_entity *arrent = get_array_element_entity(ent_type);
4095 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4097 create_dynamic_null_initializer(arrent, dbgi, addr);
4102 ir_mode *value_mode = get_type_mode(ent_type);
4103 ir_node *node = new_Const(get_mode_null(value_mode));
4105 /* is it a bitfield type? */
4106 if (is_Primitive_type(ent_type) &&
4107 get_primitive_base_type(ent_type) != NULL) {
4108 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4112 ir_node *mem = get_store();
4113 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4114 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4118 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4119 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4121 switch(get_initializer_kind(initializer)) {
4122 case IR_INITIALIZER_NULL:
4123 create_dynamic_null_initializer(entity, dbgi, base_addr);
4125 case IR_INITIALIZER_CONST: {
4126 ir_node *node = get_initializer_const_value(initializer);
4127 ir_type *ent_type = get_entity_type(entity);
4129 /* is it a bitfield type? */
4130 if (is_Primitive_type(ent_type) &&
4131 get_primitive_base_type(ent_type) != NULL) {
4132 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4136 assert(get_type_mode(type) == get_irn_mode(node));
4137 ir_node *mem = get_store();
4138 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4139 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4143 case IR_INITIALIZER_TARVAL: {
4144 ir_tarval *tv = get_initializer_tarval_value(initializer);
4145 ir_node *cnst = new_d_Const(dbgi, tv);
4146 ir_type *ent_type = get_entity_type(entity);
4148 /* is it a bitfield type? */
4149 if (is_Primitive_type(ent_type) &&
4150 get_primitive_base_type(ent_type) != NULL) {
4151 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4155 assert(get_type_mode(type) == get_tarval_mode(tv));
4156 ir_node *mem = get_store();
4157 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4158 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4162 case IR_INITIALIZER_COMPOUND: {
4163 assert(is_compound_type(type) || is_Array_type(type));
4165 if (is_Array_type(type)) {
4166 assert(has_array_upper_bound(type, 0));
4167 n_members = get_array_upper_bound_int(type, 0);
4169 n_members = get_compound_n_members(type);
4172 if (get_initializer_compound_n_entries(initializer)
4173 != (unsigned) n_members)
4174 panic("initializer doesn't match compound type");
4176 for (int i = 0; i < n_members; ++i) {
4179 ir_entity *sub_entity;
4180 if (is_Array_type(type)) {
4181 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4182 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4183 ir_node *cnst = new_d_Const(dbgi, index_tv);
4184 ir_node *in[1] = { cnst };
4185 irtype = get_array_element_type(type);
4186 sub_entity = get_array_element_entity(type);
4187 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4190 sub_entity = get_compound_member(type, i);
4191 irtype = get_entity_type(sub_entity);
4192 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4196 ir_initializer_t *sub_init
4197 = get_initializer_compound_value(initializer, i);
4199 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4206 panic("invalid IR_INITIALIZER found");
4209 static void create_dynamic_initializer(ir_initializer_t *initializer,
4210 dbg_info *dbgi, ir_entity *entity)
4212 ir_node *frame = get_irg_frame(current_ir_graph);
4213 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4214 ir_type *type = get_entity_type(entity);
4216 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4219 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4220 ir_entity *entity, type_t *type)
4222 ir_node *memory = get_store();
4223 ir_node *nomem = new_NoMem();
4224 ir_node *frame = get_irg_frame(current_ir_graph);
4225 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4227 if (initializer->kind == INITIALIZER_VALUE) {
4228 initializer_value_t *initializer_value = &initializer->value;
4230 ir_node *value = expression_to_firm(initializer_value->value);
4231 type = skip_typeref(type);
4232 assign_value(dbgi, addr, type, value);
4236 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4237 ir_initializer_t *irinitializer
4238 = create_ir_initializer(initializer, type);
4240 create_dynamic_initializer(irinitializer, dbgi, entity);
4244 /* create a "template" entity which is copied to the entity on the stack */
4245 ir_entity *const init_entity
4246 = create_initializer_entity(dbgi, initializer, type);
4247 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4248 ir_type *const irtype = get_ir_type(type);
4249 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4251 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4252 set_store(copyb_mem);
4255 static void create_initializer_local_variable_entity(entity_t *entity)
4257 assert(entity->kind == ENTITY_VARIABLE);
4258 initializer_t *initializer = entity->variable.initializer;
4259 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4260 ir_entity *irentity = entity->variable.v.entity;
4261 type_t *type = entity->declaration.type;
4263 create_local_initializer(initializer, dbgi, irentity, type);
4266 static void create_variable_initializer(entity_t *entity)
4268 assert(entity->kind == ENTITY_VARIABLE);
4269 initializer_t *initializer = entity->variable.initializer;
4270 if (initializer == NULL)
4273 declaration_kind_t declaration_kind
4274 = (declaration_kind_t) entity->declaration.kind;
4275 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4276 create_initializer_local_variable_entity(entity);
4280 type_t *type = entity->declaration.type;
4281 type_qualifiers_t tq = get_type_qualifier(type, true);
4283 if (initializer->kind == INITIALIZER_VALUE) {
4284 initializer_value_t *initializer_value = &initializer->value;
4285 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4286 expression_t *value = initializer_value->value;
4287 type_t *init_type = value->base.type;
4288 type_t *skipped = skip_typeref(init_type);
4290 if (!is_type_scalar(skipped)) {
4292 while (value->kind == EXPR_UNARY_CAST)
4293 value = value->unary.value;
4295 if (value->kind != EXPR_COMPOUND_LITERAL)
4296 panic("expected non-scalar initializer to be a compound literal");
4297 initializer = value->compound_literal.initializer;
4298 goto have_initializer;
4301 ir_node *node = expression_to_firm(initializer_value->value);
4303 ir_mode *mode = get_ir_mode_storage(init_type);
4304 node = create_conv(dbgi, node, mode);
4305 node = do_strict_conv(dbgi, node);
4307 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4308 set_value(entity->variable.v.value_number, node);
4310 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4312 ir_entity *irentity = entity->variable.v.entity;
4314 if (tq & TYPE_QUALIFIER_CONST
4315 && get_entity_owner(irentity) != get_tls_type()) {
4316 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4318 set_atomic_ent_value(irentity, node);
4322 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4323 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4325 ir_entity *irentity = entity->variable.v.entity;
4326 ir_initializer_t *irinitializer
4327 = create_ir_initializer(initializer, type);
4329 if (tq & TYPE_QUALIFIER_CONST) {
4330 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4332 set_entity_initializer(irentity, irinitializer);
4336 static void create_variable_length_array(entity_t *entity)
4338 assert(entity->kind == ENTITY_VARIABLE);
4339 assert(entity->variable.initializer == NULL);
4341 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4342 entity->variable.v.vla_base = NULL;
4344 /* TODO: record VLA somewhere so we create the free node when we leave
4348 static void allocate_variable_length_array(entity_t *entity)
4350 assert(entity->kind == ENTITY_VARIABLE);
4351 assert(entity->variable.initializer == NULL);
4352 assert(currently_reachable());
4354 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4355 type_t *type = entity->declaration.type;
4356 ir_type *el_type = get_ir_type(type->array.element_type);
4358 /* make sure size_node is calculated */
4359 get_type_size_node(type);
4360 ir_node *elems = type->array.size_node;
4361 ir_node *mem = get_store();
4362 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4364 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4365 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4368 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4369 entity->variable.v.vla_base = addr;
4373 * Creates a Firm local variable from a declaration.
4375 static void create_local_variable(entity_t *entity)
4377 assert(entity->kind == ENTITY_VARIABLE);
4378 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4380 bool needs_entity = entity->variable.address_taken;
4381 type_t *type = skip_typeref(entity->declaration.type);
4383 /* is it a variable length array? */
4384 if (is_type_array(type) && !type->array.size_constant) {
4385 create_variable_length_array(entity);
4387 } else if (is_type_array(type) || is_type_compound(type)) {
4388 needs_entity = true;
4389 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4390 needs_entity = true;
4394 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4395 create_variable_entity(entity,
4396 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4399 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4400 entity->variable.v.value_number = next_value_number_function;
4401 set_irg_loc_description(current_ir_graph, next_value_number_function,
4403 ++next_value_number_function;
4407 static void create_local_static_variable(entity_t *entity)
4409 assert(entity->kind == ENTITY_VARIABLE);
4410 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4412 type_t *type = skip_typeref(entity->declaration.type);
4413 ir_type *const var_type = entity->variable.thread_local ?
4414 get_tls_type() : get_glob_type();
4415 ir_type *const irtype = get_ir_type(type);
4416 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4418 size_t l = strlen(entity->base.symbol->string);
4419 char buf[l + sizeof(".%u")];
4420 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4421 ident *const id = id_unique(buf);
4422 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4424 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4425 set_entity_volatility(irentity, volatility_is_volatile);
4428 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4429 entity->variable.v.entity = irentity;
4431 set_entity_ld_ident(irentity, id);
4432 set_entity_visibility(irentity, ir_visibility_local);
4434 ir_graph *const old_current_ir_graph = current_ir_graph;
4435 current_ir_graph = get_const_code_irg();
4437 create_variable_initializer(entity);
4439 assert(current_ir_graph == get_const_code_irg());
4440 current_ir_graph = old_current_ir_graph;
4445 static ir_node *return_statement_to_firm(return_statement_t *statement)
4447 if (!currently_reachable())
4450 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4451 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4452 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4455 if (!is_type_void(type)) {
4456 ir_mode *const mode = get_ir_mode_storage(type);
4458 res = create_conv(dbgi, res, mode);
4459 res = do_strict_conv(dbgi, res);
4461 res = new_Unknown(mode);
4468 ir_node *const in[1] = { res };
4469 ir_node *const store = get_store();
4470 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4472 ir_node *end_block = get_irg_end_block(current_ir_graph);
4473 add_immBlock_pred(end_block, ret);
4475 set_unreachable_now();
4479 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4481 if (!currently_reachable())
4484 return expression_to_firm(statement->expression);
4487 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4489 entity_t *entity = compound->scope.entities;
4490 for ( ; entity != NULL; entity = entity->base.next) {
4491 if (!is_declaration(entity))
4494 create_local_declaration(entity);
4497 ir_node *result = NULL;
4498 statement_t *statement = compound->statements;
4499 for ( ; statement != NULL; statement = statement->base.next) {
4500 result = statement_to_firm(statement);
4506 static void create_global_variable(entity_t *entity)
4508 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4509 ir_visibility visibility = ir_visibility_default;
4510 ir_entity *irentity;
4511 assert(entity->kind == ENTITY_VARIABLE);
4513 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4514 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4515 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4516 case STORAGE_CLASS_NONE:
4517 visibility = ir_visibility_default;
4518 /* uninitialized globals get merged in C */
4519 if (entity->variable.initializer == NULL)
4520 linkage |= IR_LINKAGE_MERGE;
4522 case STORAGE_CLASS_TYPEDEF:
4523 case STORAGE_CLASS_AUTO:
4524 case STORAGE_CLASS_REGISTER:
4525 panic("invalid storage class for global var");
4528 ir_type *var_type = get_glob_type();
4529 if (entity->variable.thread_local) {
4530 var_type = get_tls_type();
4531 /* LINKAGE_MERGE not supported by current linkers */
4532 linkage &= ~IR_LINKAGE_MERGE;
4534 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4535 irentity = entity->variable.v.entity;
4536 add_entity_linkage(irentity, linkage);
4537 set_entity_visibility(irentity, visibility);
4540 static void create_local_declaration(entity_t *entity)
4542 assert(is_declaration(entity));
4544 /* construct type */
4545 (void) get_ir_type(entity->declaration.type);
4546 if (entity->base.symbol == NULL) {
4550 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4551 case STORAGE_CLASS_STATIC:
4552 if (entity->kind == ENTITY_FUNCTION) {
4553 (void)get_function_entity(entity, NULL);
4555 create_local_static_variable(entity);
4558 case STORAGE_CLASS_EXTERN:
4559 if (entity->kind == ENTITY_FUNCTION) {
4560 assert(entity->function.statement == NULL);
4561 (void)get_function_entity(entity, NULL);
4563 create_global_variable(entity);
4564 create_variable_initializer(entity);
4567 case STORAGE_CLASS_NONE:
4568 case STORAGE_CLASS_AUTO:
4569 case STORAGE_CLASS_REGISTER:
4570 if (entity->kind == ENTITY_FUNCTION) {
4571 if (entity->function.statement != NULL) {
4572 ir_type *owner = get_irg_frame_type(current_ir_graph);
4573 (void)get_function_entity(entity, owner);
4574 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4575 enqueue_inner_function(entity);
4577 (void)get_function_entity(entity, NULL);
4580 create_local_variable(entity);
4583 case STORAGE_CLASS_TYPEDEF:
4586 panic("invalid storage class found");
4589 static void initialize_local_declaration(entity_t *entity)
4591 if (entity->base.symbol == NULL)
4594 // no need to emit code in dead blocks
4595 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4596 && !currently_reachable())
4599 switch ((declaration_kind_t) entity->declaration.kind) {
4600 case DECLARATION_KIND_LOCAL_VARIABLE:
4601 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4602 create_variable_initializer(entity);
4605 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4606 allocate_variable_length_array(entity);
4609 case DECLARATION_KIND_COMPOUND_MEMBER:
4610 case DECLARATION_KIND_GLOBAL_VARIABLE:
4611 case DECLARATION_KIND_FUNCTION:
4612 case DECLARATION_KIND_INNER_FUNCTION:
4615 case DECLARATION_KIND_PARAMETER:
4616 case DECLARATION_KIND_PARAMETER_ENTITY:
4617 panic("can't initialize parameters");
4619 case DECLARATION_KIND_UNKNOWN:
4620 panic("can't initialize unknown declaration");
4622 panic("invalid declaration kind");
4625 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4627 entity_t *entity = statement->declarations_begin;
4631 entity_t *const last = statement->declarations_end;
4632 for ( ;; entity = entity->base.next) {
4633 if (is_declaration(entity)) {
4634 initialize_local_declaration(entity);
4635 } else if (entity->kind == ENTITY_TYPEDEF) {
4636 /* ยง6.7.7:3 Any array size expressions associated with variable length
4637 * array declarators are evaluated each time the declaration of the
4638 * typedef name is reached in the order of execution. */
4639 type_t *const type = skip_typeref(entity->typedefe.type);
4640 if (is_type_array(type) && type->array.is_vla)
4641 get_vla_size(&type->array);
4650 static ir_node *if_statement_to_firm(if_statement_t *statement)
4652 /* Create the condition. */
4653 ir_node *true_block = NULL;
4654 ir_node *false_block = NULL;
4655 if (currently_reachable()) {
4656 true_block = new_immBlock();
4657 false_block = new_immBlock();
4658 create_condition_evaluation(statement->condition, true_block, false_block);
4659 mature_immBlock(true_block);
4660 mature_immBlock(false_block);
4663 /* Create the true statement. */
4664 set_cur_block(true_block);
4665 statement_to_firm(statement->true_statement);
4666 ir_node *fallthrough_block = get_cur_block();
4668 /* Create the false statement. */
4669 set_cur_block(false_block);
4670 if (statement->false_statement != NULL) {
4671 statement_to_firm(statement->false_statement);
4674 /* Handle the block after the if-statement. Minor simplification and
4675 * optimisation: Reuse the false/true block as fallthrough block, if the
4676 * true/false statement does not pass control to the fallthrough block, e.g.
4677 * in the typical if (x) return; pattern. */
4678 if (fallthrough_block) {
4679 if (currently_reachable()) {
4680 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4681 ir_node *const f_jump = new_Jmp();
4682 ir_node *const in[] = { t_jump, f_jump };
4683 fallthrough_block = new_Block(2, in);
4685 set_cur_block(fallthrough_block);
4692 * Add an unconditional jump to the target block. If the source block is not
4693 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4694 * loops. This is necessary if the jump potentially enters a loop.
4696 static void jump_to(ir_node *const target_block)
4698 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4699 add_immBlock_pred(target_block, pred);
4703 * Add an unconditional jump to the target block, if the current block is
4704 * reachable and do nothing otherwise. This is only valid if the jump does not
4705 * enter a loop (a back edge is ok).
4707 static void jump_if_reachable(ir_node *const target_block)
4709 if (currently_reachable())
4710 add_immBlock_pred(target_block, new_Jmp());
4713 static ir_node *while_statement_to_firm(while_statement_t *statement)
4715 /* Create the header block */
4716 ir_node *const header_block = new_immBlock();
4717 jump_to(header_block);
4719 /* Create the condition. */
4720 ir_node * body_block;
4721 ir_node * false_block;
4722 expression_t *const cond = statement->condition;
4723 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4724 fold_constant_to_bool(cond)) {
4725 /* Shortcut for while (true). */
4726 body_block = header_block;
4729 keep_alive(header_block);
4730 keep_all_memory(header_block);
4732 body_block = new_immBlock();
4733 false_block = new_immBlock();
4735 set_cur_block(header_block);
4736 create_condition_evaluation(cond, body_block, false_block);
4737 mature_immBlock(body_block);
4740 ir_node *const old_continue_label = continue_label;
4741 ir_node *const old_break_label = break_label;
4742 continue_label = header_block;
4743 break_label = false_block;
4745 /* Create the loop body. */
4746 set_cur_block(body_block);
4747 statement_to_firm(statement->body);
4748 jump_if_reachable(header_block);
4750 mature_immBlock(header_block);
4751 assert(false_block == NULL || false_block == break_label);
4752 false_block = break_label;
4753 if (false_block != NULL) {
4754 mature_immBlock(false_block);
4756 set_cur_block(false_block);
4758 assert(continue_label == header_block);
4759 continue_label = old_continue_label;
4760 break_label = old_break_label;
4764 static ir_node *get_break_label(void)
4766 if (break_label == NULL) {
4767 break_label = new_immBlock();
4772 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4774 /* create the header block */
4775 ir_node *header_block = new_immBlock();
4778 ir_node *body_block = new_immBlock();
4779 jump_to(body_block);
4781 ir_node *old_continue_label = continue_label;
4782 ir_node *old_break_label = break_label;
4783 continue_label = header_block;
4786 set_cur_block(body_block);
4787 statement_to_firm(statement->body);
4788 ir_node *const false_block = get_break_label();
4790 assert(continue_label == header_block);
4791 continue_label = old_continue_label;
4792 break_label = old_break_label;
4794 jump_if_reachable(header_block);
4796 /* create the condition */
4797 mature_immBlock(header_block);
4798 set_cur_block(header_block);
4800 create_condition_evaluation(statement->condition, body_block, false_block);
4801 mature_immBlock(body_block);
4802 mature_immBlock(false_block);
4804 set_cur_block(false_block);
4808 static ir_node *for_statement_to_firm(for_statement_t *statement)
4810 /* create declarations */
4811 entity_t *entity = statement->scope.entities;
4812 for ( ; entity != NULL; entity = entity->base.next) {
4813 if (!is_declaration(entity))
4816 create_local_declaration(entity);
4819 if (currently_reachable()) {
4820 entity = statement->scope.entities;
4821 for ( ; entity != NULL; entity = entity->base.next) {
4822 if (!is_declaration(entity))
4825 initialize_local_declaration(entity);
4828 if (statement->initialisation != NULL) {
4829 expression_to_firm(statement->initialisation);
4833 /* Create the header block */
4834 ir_node *const header_block = new_immBlock();
4835 jump_to(header_block);
4837 /* Create the condition. */
4838 ir_node *body_block;
4839 ir_node *false_block;
4840 if (statement->condition != NULL) {
4841 body_block = new_immBlock();
4842 false_block = new_immBlock();
4844 set_cur_block(header_block);
4845 create_condition_evaluation(statement->condition, body_block, false_block);
4846 mature_immBlock(body_block);
4849 body_block = header_block;
4852 keep_alive(header_block);
4853 keep_all_memory(header_block);
4856 /* Create the step block, if necessary. */
4857 ir_node * step_block = header_block;
4858 expression_t *const step = statement->step;
4860 step_block = new_immBlock();
4863 ir_node *const old_continue_label = continue_label;
4864 ir_node *const old_break_label = break_label;
4865 continue_label = step_block;
4866 break_label = false_block;
4868 /* Create the loop body. */
4869 set_cur_block(body_block);
4870 statement_to_firm(statement->body);
4871 jump_if_reachable(step_block);
4873 /* Create the step code. */
4875 mature_immBlock(step_block);
4876 set_cur_block(step_block);
4877 expression_to_firm(step);
4878 jump_if_reachable(header_block);
4881 mature_immBlock(header_block);
4882 assert(false_block == NULL || false_block == break_label);
4883 false_block = break_label;
4884 if (false_block != NULL) {
4885 mature_immBlock(false_block);
4887 set_cur_block(false_block);
4889 assert(continue_label == step_block);
4890 continue_label = old_continue_label;
4891 break_label = old_break_label;
4895 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4897 if (!currently_reachable())
4900 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4901 ir_node *jump = new_d_Jmp(dbgi);
4902 add_immBlock_pred(target_block, jump);
4904 set_unreachable_now();
4908 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4910 /* determine number of cases */
4912 for (case_label_statement_t *l = statement->first_case; l != NULL;
4915 if (l->expression == NULL)
4917 if (l->is_empty_range)
4922 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4924 for (case_label_statement_t *l = statement->first_case; l != NULL;
4926 if (l->expression == NULL) {
4927 l->pn = pn_Switch_default;
4930 if (l->is_empty_range)
4932 ir_tarval *min = fold_constant_to_tarval(l->expression);
4933 ir_tarval *max = min;
4934 long pn = (long) i+1;
4935 if (l->end_range != NULL)
4936 max = fold_constant_to_tarval(l->end_range);
4937 ir_switch_table_set(res, i++, min, max, pn);
4943 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4945 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4946 ir_node *switch_node = NULL;
4948 if (currently_reachable()) {
4949 ir_node *expression = expression_to_firm(statement->expression);
4950 ir_switch_table *table = create_switch_table(statement);
4951 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4953 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4956 set_unreachable_now();
4958 ir_node *const old_switch = current_switch;
4959 ir_node *const old_break_label = break_label;
4960 const bool old_saw_default_label = saw_default_label;
4961 saw_default_label = false;
4962 current_switch = switch_node;
4965 statement_to_firm(statement->body);
4967 if (currently_reachable()) {
4968 add_immBlock_pred(get_break_label(), new_Jmp());
4971 if (!saw_default_label && switch_node) {
4972 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4973 add_immBlock_pred(get_break_label(), proj);
4976 if (break_label != NULL) {
4977 mature_immBlock(break_label);
4979 set_cur_block(break_label);
4981 assert(current_switch == switch_node);
4982 current_switch = old_switch;
4983 break_label = old_break_label;
4984 saw_default_label = old_saw_default_label;
4988 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4990 if (statement->is_empty_range)
4993 if (current_switch != NULL) {
4994 ir_node *block = new_immBlock();
4995 /* Fallthrough from previous case */
4996 jump_if_reachable(block);
4998 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
4999 add_immBlock_pred(block, proj);
5000 if (statement->expression == NULL)
5001 saw_default_label = true;
5003 mature_immBlock(block);
5004 set_cur_block(block);
5007 return statement_to_firm(statement->statement);
5010 static ir_node *label_to_firm(const label_statement_t *statement)
5012 ir_node *block = get_label_block(statement->label);
5015 set_cur_block(block);
5017 keep_all_memory(block);
5019 return statement_to_firm(statement->statement);
5022 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
5024 if (!currently_reachable())
5027 ir_node *const irn = expression_to_firm(statement->expression);
5028 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5029 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
5031 set_irn_link(ijmp, ijmp_list);
5034 set_unreachable_now();
5038 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
5040 bool needs_memory = false;
5042 if (statement->is_volatile) {
5043 needs_memory = true;
5046 size_t n_clobbers = 0;
5047 asm_clobber_t *clobber = statement->clobbers;
5048 for ( ; clobber != NULL; clobber = clobber->next) {
5049 const char *clobber_str = clobber->clobber.begin;
5051 if (!be_is_valid_clobber(clobber_str)) {
5052 errorf(&statement->base.source_position,
5053 "invalid clobber '%s' specified", clobber->clobber);
5057 if (streq(clobber_str, "memory")) {
5058 needs_memory = true;
5062 ident *id = new_id_from_str(clobber_str);
5063 obstack_ptr_grow(&asm_obst, id);
5066 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5067 ident **clobbers = NULL;
5068 if (n_clobbers > 0) {
5069 clobbers = obstack_finish(&asm_obst);
5072 size_t n_inputs = 0;
5073 asm_argument_t *argument = statement->inputs;
5074 for ( ; argument != NULL; argument = argument->next)
5076 size_t n_outputs = 0;
5077 argument = statement->outputs;
5078 for ( ; argument != NULL; argument = argument->next)
5081 unsigned next_pos = 0;
5083 ir_node *ins[n_inputs + n_outputs + 1];
5086 ir_asm_constraint tmp_in_constraints[n_outputs];
5088 const expression_t *out_exprs[n_outputs];
5089 ir_node *out_addrs[n_outputs];
5090 size_t out_size = 0;
5092 argument = statement->outputs;
5093 for ( ; argument != NULL; argument = argument->next) {
5094 const char *constraints = argument->constraints.begin;
5095 asm_constraint_flags_t asm_flags
5096 = be_parse_asm_constraints(constraints);
5099 source_position_t const *const pos = &statement->base.source_position;
5100 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5101 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5103 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5104 errorf(pos, "some constraints in '%s' are invalid", constraints);
5107 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5108 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5113 unsigned pos = next_pos++;
5114 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5115 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5116 expression_t *expr = argument->expression;
5117 ir_node *addr = expression_to_addr(expr);
5118 /* in+output, construct an artifical same_as constraint on the
5120 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5122 ir_node *value = get_value_from_lvalue(expr, addr);
5124 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5126 ir_asm_constraint constraint;
5127 constraint.pos = pos;
5128 constraint.constraint = new_id_from_str(buf);
5129 constraint.mode = get_ir_mode_storage(expr->base.type);
5130 tmp_in_constraints[in_size] = constraint;
5131 ins[in_size] = value;
5136 out_exprs[out_size] = expr;
5137 out_addrs[out_size] = addr;
5139 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5140 /* pure memory ops need no input (but we have to make sure we
5141 * attach to the memory) */
5142 assert(! (asm_flags &
5143 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5144 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5145 needs_memory = true;
5147 /* we need to attach the address to the inputs */
5148 expression_t *expr = argument->expression;
5150 ir_asm_constraint constraint;
5151 constraint.pos = pos;
5152 constraint.constraint = new_id_from_str(constraints);
5153 constraint.mode = mode_M;
5154 tmp_in_constraints[in_size] = constraint;
5156 ins[in_size] = expression_to_addr(expr);
5160 errorf(&statement->base.source_position,
5161 "only modifiers but no place set in constraints '%s'",
5166 ir_asm_constraint constraint;
5167 constraint.pos = pos;
5168 constraint.constraint = new_id_from_str(constraints);
5169 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5171 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5173 assert(obstack_object_size(&asm_obst)
5174 == out_size * sizeof(ir_asm_constraint));
5175 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5178 obstack_grow(&asm_obst, tmp_in_constraints,
5179 in_size * sizeof(tmp_in_constraints[0]));
5180 /* find and count input and output arguments */
5181 argument = statement->inputs;
5182 for ( ; argument != NULL; argument = argument->next) {
5183 const char *constraints = argument->constraints.begin;
5184 asm_constraint_flags_t asm_flags
5185 = be_parse_asm_constraints(constraints);
5187 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5188 errorf(&statement->base.source_position,
5189 "some constraints in '%s' are not supported", constraints);
5192 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5193 errorf(&statement->base.source_position,
5194 "some constraints in '%s' are invalid", constraints);
5197 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5198 errorf(&statement->base.source_position,
5199 "write flag specified for input constraints '%s'",
5205 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5206 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5207 /* we can treat this as "normal" input */
5208 input = expression_to_firm(argument->expression);
5209 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5210 /* pure memory ops need no input (but we have to make sure we
5211 * attach to the memory) */
5212 assert(! (asm_flags &
5213 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5214 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5215 needs_memory = true;
5216 input = expression_to_addr(argument->expression);
5218 errorf(&statement->base.source_position,
5219 "only modifiers but no place set in constraints '%s'",
5224 ir_asm_constraint constraint;
5225 constraint.pos = next_pos++;
5226 constraint.constraint = new_id_from_str(constraints);
5227 constraint.mode = get_irn_mode(input);
5229 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5230 ins[in_size++] = input;
5234 ir_asm_constraint constraint;
5235 constraint.pos = next_pos++;
5236 constraint.constraint = new_id_from_str("");
5237 constraint.mode = mode_M;
5239 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5240 ins[in_size++] = get_store();
5243 assert(obstack_object_size(&asm_obst)
5244 == in_size * sizeof(ir_asm_constraint));
5245 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5247 /* create asm node */
5248 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5250 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5252 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5253 out_size, output_constraints,
5254 n_clobbers, clobbers, asm_text);
5256 if (statement->is_volatile) {
5257 set_irn_pinned(node, op_pin_state_pinned);
5259 set_irn_pinned(node, op_pin_state_floats);
5262 /* create output projs & connect them */
5264 ir_node *projm = new_Proj(node, mode_M, out_size);
5269 for (i = 0; i < out_size; ++i) {
5270 const expression_t *out_expr = out_exprs[i];
5272 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5273 ir_node *proj = new_Proj(node, mode, pn);
5274 ir_node *addr = out_addrs[i];
5276 set_value_for_expression_addr(out_expr, proj, addr);
5282 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5284 statement_to_firm(statement->try_statement);
5285 source_position_t const *const pos = &statement->base.source_position;
5286 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5290 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5292 errorf(&statement->base.source_position, "__leave not supported yet");
5297 * Transform a statement.
5299 static ir_node *statement_to_firm(statement_t *const stmt)
5302 assert(!stmt->base.transformed);
5303 stmt->base.transformed = true;
5306 switch (stmt->kind) {
5307 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5308 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5309 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5310 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5311 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5312 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5313 case STATEMENT_EMPTY: return NULL; /* nothing */
5314 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5315 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5316 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5317 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5318 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5319 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5320 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5321 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5322 case STATEMENT_WHILE: return while_statement_to_firm( &stmt->whiles);
5324 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5325 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5326 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5328 case STATEMENT_ERROR: panic("error statement found");
5330 panic("statement not implemented");
5333 static int count_local_variables(const entity_t *entity,
5334 const entity_t *const last)
5337 entity_t const *const end = last != NULL ? last->base.next : NULL;
5338 for (; entity != end; entity = entity->base.next) {
5342 if (entity->kind == ENTITY_VARIABLE) {
5343 type = skip_typeref(entity->declaration.type);
5344 address_taken = entity->variable.address_taken;
5345 } else if (entity->kind == ENTITY_PARAMETER) {
5346 type = skip_typeref(entity->declaration.type);
5347 address_taken = entity->parameter.address_taken;
5352 if (!address_taken && is_type_scalar(type))
5358 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5360 int *const count = env;
5362 switch (stmt->kind) {
5363 case STATEMENT_DECLARATION: {
5364 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5365 *count += count_local_variables(decl_stmt->declarations_begin,
5366 decl_stmt->declarations_end);
5371 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5380 * Return the number of local (alias free) variables used by a function.
5382 static int get_function_n_local_vars(entity_t *entity)
5384 const function_t *function = &entity->function;
5387 /* count parameters */
5388 count += count_local_variables(function->parameters.entities, NULL);
5390 /* count local variables declared in body */
5391 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5396 * Build Firm code for the parameters of a function.
5398 static void initialize_function_parameters(entity_t *entity)
5400 assert(entity->kind == ENTITY_FUNCTION);
5401 ir_graph *irg = current_ir_graph;
5402 ir_node *args = get_irg_args(irg);
5404 ir_type *function_irtype;
5406 if (entity->function.need_closure) {
5407 /* add an extra parameter for the static link */
5408 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5411 /* Matze: IMO this is wrong, nested functions should have an own
5412 * type and not rely on strange parameters... */
5413 function_irtype = create_method_type(&entity->declaration.type->function, true);
5415 function_irtype = get_ir_type(entity->declaration.type);
5420 entity_t *parameter = entity->function.parameters.entities;
5421 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5422 if (parameter->kind != ENTITY_PARAMETER)
5425 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5426 type_t *type = skip_typeref(parameter->declaration.type);
5428 bool needs_entity = parameter->parameter.address_taken;
5429 assert(!is_type_array(type));
5430 if (is_type_compound(type)) {
5431 needs_entity = true;
5434 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5436 ir_type *frame_type = get_irg_frame_type(irg);
5438 = new_parameter_entity(frame_type, n, param_irtype);
5439 parameter->declaration.kind
5440 = DECLARATION_KIND_PARAMETER_ENTITY;
5441 parameter->parameter.v.entity = param;
5445 ir_mode *param_mode = get_type_mode(param_irtype);
5447 ir_node *value = new_r_Proj(args, param_mode, pn);
5449 ir_mode *mode = get_ir_mode_storage(type);
5450 value = create_conv(NULL, value, mode);
5451 value = do_strict_conv(NULL, value);
5453 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5454 parameter->parameter.v.value_number = next_value_number_function;
5455 set_irg_loc_description(current_ir_graph, next_value_number_function,
5457 ++next_value_number_function;
5459 set_value(parameter->parameter.v.value_number, value);
5464 * Handle additional decl modifiers for IR-graphs
5466 * @param irg the IR-graph
5467 * @param dec_modifiers additional modifiers
5469 static void handle_decl_modifier_irg(ir_graph *irg,
5470 decl_modifiers_t decl_modifiers)
5472 if (decl_modifiers & DM_NAKED) {
5473 /* TRUE if the declaration includes the Microsoft
5474 __declspec(naked) specifier. */
5475 add_irg_additional_properties(irg, mtp_property_naked);
5477 if (decl_modifiers & DM_FORCEINLINE) {
5478 /* TRUE if the declaration includes the
5479 Microsoft __forceinline specifier. */
5480 set_irg_inline_property(irg, irg_inline_forced);
5482 if (decl_modifiers & DM_NOINLINE) {
5483 /* TRUE if the declaration includes the Microsoft
5484 __declspec(noinline) specifier. */
5485 set_irg_inline_property(irg, irg_inline_forbidden);
5489 static void add_function_pointer(ir_type *segment, ir_entity *method,
5490 const char *unique_template)
5492 ir_type *method_type = get_entity_type(method);
5493 ir_type *ptr_type = new_type_pointer(method_type);
5495 /* these entities don't really have a name but firm only allows
5497 * Note that we mustn't give these entities a name since for example
5498 * Mach-O doesn't allow them. */
5499 ident *ide = id_unique(unique_template);
5500 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5501 ir_graph *irg = get_const_code_irg();
5502 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5505 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5506 set_entity_compiler_generated(ptr, 1);
5507 set_entity_visibility(ptr, ir_visibility_private);
5508 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5509 set_atomic_ent_value(ptr, val);
5513 * Generate possible IJmp branches to a given label block.
5515 static void gen_ijmp_branches(ir_node *block)
5518 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5519 add_immBlock_pred(block, ijmp);
5524 * Create code for a function and all inner functions.
5526 * @param entity the function entity
5528 static void create_function(entity_t *entity)
5530 assert(entity->kind == ENTITY_FUNCTION);
5531 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5533 if (entity->function.statement == NULL)
5536 inner_functions = NULL;
5537 current_trampolines = NULL;
5539 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5540 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5541 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5543 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5544 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5545 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5548 current_function_entity = entity;
5549 current_function_name = NULL;
5550 current_funcsig = NULL;
5552 assert(all_labels == NULL);
5553 all_labels = NEW_ARR_F(label_t *, 0);
5556 int n_local_vars = get_function_n_local_vars(entity);
5557 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5558 current_ir_graph = irg;
5560 ir_graph *old_current_function = current_function;
5561 current_function = irg;
5563 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5564 current_vararg_entity = NULL;
5566 set_irg_fp_model(irg, firm_fp_model);
5567 tarval_enable_fp_ops(1);
5568 set_irn_dbg_info(get_irg_start_block(irg),
5569 get_entity_dbg_info(function_entity));
5571 /* set inline flags */
5572 if (entity->function.is_inline)
5573 set_irg_inline_property(irg, irg_inline_recomended);
5574 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5576 next_value_number_function = 0;
5577 initialize_function_parameters(entity);
5578 current_static_link = entity->function.static_link;
5580 statement_to_firm(entity->function.statement);
5582 ir_node *end_block = get_irg_end_block(irg);
5584 /* do we have a return statement yet? */
5585 if (currently_reachable()) {
5586 type_t *type = skip_typeref(entity->declaration.type);
5587 assert(is_type_function(type));
5588 type_t *const return_type = skip_typeref(type->function.return_type);
5591 if (is_type_void(return_type)) {
5592 ret = new_Return(get_store(), 0, NULL);
5594 ir_mode *const mode = get_ir_mode_storage(return_type);
5597 /* ยง5.1.2.2.3 main implicitly returns 0 */
5598 if (is_main(entity)) {
5599 in[0] = new_Const(get_mode_null(mode));
5601 in[0] = new_Unknown(mode);
5603 ret = new_Return(get_store(), 1, in);
5605 add_immBlock_pred(end_block, ret);
5608 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5609 label_t *label = all_labels[i];
5610 if (label->address_taken) {
5611 gen_ijmp_branches(label->block);
5613 mature_immBlock(label->block);
5616 DEL_ARR_F(all_labels);
5619 irg_finalize_cons(irg);
5621 /* finalize the frame type */
5622 ir_type *frame_type = get_irg_frame_type(irg);
5623 int n = get_compound_n_members(frame_type);
5626 for (int i = 0; i < n; ++i) {
5627 ir_entity *member = get_compound_member(frame_type, i);
5628 ir_type *entity_type = get_entity_type(member);
5630 int align = get_type_alignment_bytes(entity_type);
5631 if (align > align_all)
5635 misalign = offset % align;
5637 offset += align - misalign;
5641 set_entity_offset(member, offset);
5642 offset += get_type_size_bytes(entity_type);
5644 set_type_size_bytes(frame_type, offset);
5645 set_type_alignment_bytes(frame_type, align_all);
5647 irg_verify(irg, VERIFY_ENFORCE_SSA);
5648 current_vararg_entity = old_current_vararg_entity;
5649 current_function = old_current_function;
5651 if (current_trampolines != NULL) {
5652 DEL_ARR_F(current_trampolines);
5653 current_trampolines = NULL;
5656 /* create inner functions if any */
5657 entity_t **inner = inner_functions;
5658 if (inner != NULL) {
5659 ir_type *rem_outer_frame = current_outer_frame;
5660 current_outer_frame = get_irg_frame_type(current_ir_graph);
5661 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5662 create_function(inner[i]);
5666 current_outer_frame = rem_outer_frame;
5670 static void scope_to_firm(scope_t *scope)
5672 /* first pass: create declarations */
5673 entity_t *entity = scope->entities;
5674 for ( ; entity != NULL; entity = entity->base.next) {
5675 if (entity->base.symbol == NULL)
5678 if (entity->kind == ENTITY_FUNCTION) {
5679 if (entity->function.btk != BUILTIN_NONE) {
5680 /* builtins have no representation */
5683 (void)get_function_entity(entity, NULL);
5684 } else if (entity->kind == ENTITY_VARIABLE) {
5685 create_global_variable(entity);
5686 } else if (entity->kind == ENTITY_NAMESPACE) {
5687 scope_to_firm(&entity->namespacee.members);
5691 /* second pass: create code/initializers */
5692 entity = scope->entities;
5693 for ( ; entity != NULL; entity = entity->base.next) {
5694 if (entity->base.symbol == NULL)
5697 if (entity->kind == ENTITY_FUNCTION) {
5698 if (entity->function.btk != BUILTIN_NONE) {
5699 /* builtins have no representation */
5702 create_function(entity);
5703 } else if (entity->kind == ENTITY_VARIABLE) {
5704 assert(entity->declaration.kind
5705 == DECLARATION_KIND_GLOBAL_VARIABLE);
5706 current_ir_graph = get_const_code_irg();
5707 create_variable_initializer(entity);
5712 void init_ast2firm(void)
5714 obstack_init(&asm_obst);
5715 init_atomic_modes();
5717 ir_set_debug_retrieve(dbg_retrieve);
5718 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5720 /* create idents for all known runtime functions */
5721 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5722 rts_idents[i] = new_id_from_str(rts_data[i].name);
5725 entitymap_init(&entitymap);
5728 static void init_ir_types(void)
5730 static int ir_types_initialized = 0;
5731 if (ir_types_initialized)
5733 ir_types_initialized = 1;
5735 ir_type_char = get_ir_type(type_char);
5736 ir_type_const_char = get_ir_type(type_const_char);
5737 ir_type_wchar_t = get_ir_type(type_wchar_t);
5739 be_params = be_get_backend_param();
5740 mode_float_arithmetic = be_params->mode_float_arithmetic;
5742 stack_param_align = be_params->stack_param_align;
5745 void exit_ast2firm(void)
5747 entitymap_destroy(&entitymap);
5748 obstack_free(&asm_obst, NULL);
5751 static void global_asm_to_firm(statement_t *s)
5753 for (; s != NULL; s = s->base.next) {
5754 assert(s->kind == STATEMENT_ASM);
5756 char const *const text = s->asms.asm_text.begin;
5757 size_t size = s->asms.asm_text.size;
5759 /* skip the last \0 */
5760 if (text[size - 1] == '\0')
5763 ident *const id = new_id_from_chars(text, size);
5768 static const char *get_cwd(void)
5770 static char buf[1024];
5772 getcwd(buf, sizeof(buf));
5776 void translation_unit_to_firm(translation_unit_t *unit)
5778 if (c_mode & _CXX) {
5779 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5780 } else if (c_mode & _C99) {
5781 be_dwarf_set_source_language(DW_LANG_C99);
5782 } else if (c_mode & _C89) {
5783 be_dwarf_set_source_language(DW_LANG_C89);
5785 be_dwarf_set_source_language(DW_LANG_C);
5787 be_dwarf_set_compilation_directory(get_cwd());
5789 /* initialize firm arithmetic */
5790 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5791 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5793 /* just to be sure */
5794 continue_label = NULL;
5796 current_switch = NULL;
5797 current_translation_unit = unit;
5801 scope_to_firm(&unit->scope);
5802 global_asm_to_firm(unit->global_asm);
5804 current_ir_graph = NULL;
5805 current_translation_unit = NULL;