2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include <libfirm/firm.h>
28 #include <libfirm/adt/obst.h>
29 #include <libfirm/be.h>
33 #include "adt/error.h"
34 #include "adt/array.h"
35 #include "adt/strutil.h"
43 #include "diagnostic.h"
44 #include "lang_features.h"
46 #include "type_hash.h"
51 #include "entitymap_t.h"
52 #include "driver/firm_opt.h"
54 typedef struct trampoline_region trampoline_region;
55 struct trampoline_region {
56 ir_entity *function; /**< The function that is called by this trampoline */
57 ir_entity *region; /**< created region for the trampoline */
60 fp_model_t firm_fp_model = fp_model_precise;
62 static const backend_params *be_params;
64 static ir_type *ir_type_char;
65 static ir_type *ir_type_const_char;
66 static ir_type *ir_type_wchar_t;
68 /* architecture specific floating point arithmetic mode (if any) */
69 static ir_mode *mode_float_arithmetic;
71 /* alignment of stack parameters */
72 static unsigned stack_param_align;
74 static int next_value_number_function;
75 static ir_node *continue_label;
76 static ir_node *break_label;
77 static ir_node *current_switch;
78 static bool saw_default_label;
79 static label_t **all_labels;
80 static entity_t **inner_functions;
81 static ir_node *ijmp_list;
82 static bool constant_folding;
84 static const entity_t *current_function_entity;
85 static ir_node *current_function_name;
86 static ir_node *current_funcsig;
87 static ir_graph *current_function;
88 static translation_unit_t *current_translation_unit;
89 static trampoline_region *current_trampolines;
90 static ir_type *current_outer_frame;
91 static ir_node *current_static_link;
92 static ir_entity *current_vararg_entity;
94 static entitymap_t entitymap;
96 static struct obstack asm_obst;
98 typedef enum declaration_kind_t {
99 DECLARATION_KIND_UNKNOWN,
100 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
101 DECLARATION_KIND_GLOBAL_VARIABLE,
102 DECLARATION_KIND_LOCAL_VARIABLE,
103 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
104 DECLARATION_KIND_PARAMETER,
105 DECLARATION_KIND_PARAMETER_ENTITY,
106 DECLARATION_KIND_FUNCTION,
107 DECLARATION_KIND_COMPOUND_MEMBER,
108 DECLARATION_KIND_INNER_FUNCTION
109 } declaration_kind_t;
111 static ir_type *get_ir_type_incomplete(type_t *type);
113 static void enqueue_inner_function(entity_t *entity)
115 if (inner_functions == NULL)
116 inner_functions = NEW_ARR_F(entity_t *, 0);
117 ARR_APP1(entity_t*, inner_functions, entity);
120 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
122 const entity_t *entity = get_irg_loc_description(irg, pos);
124 if (entity != NULL) {
125 source_position_t const *const pos = &entity->base.source_position;
126 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
128 return new_r_Unknown(irg, mode);
131 static const char *dbg_retrieve(const dbg_info *dbg, unsigned *line)
133 const source_position_t *pos = (const source_position_t*) dbg;
138 return pos->input_name;
141 static dbg_info *get_dbg_info(const source_position_t *pos)
143 return (dbg_info*) pos;
146 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
147 const type_dbg_info *dbg)
150 print_to_buffer(buffer, buffer_size);
151 const type_t *type = (const type_t*) dbg;
153 finish_print_to_buffer();
156 static type_dbg_info *get_type_dbg_info_(const type_t *type)
158 return (type_dbg_info*) type;
161 /* is the current block a reachable one? */
162 static bool currently_reachable(void)
164 ir_node *const block = get_cur_block();
165 return block != NULL && !is_Bad(block);
168 static void set_unreachable_now(void)
173 ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
175 static ir_node *_expression_to_firm(const expression_t *expression);
176 static ir_node *expression_to_firm(const expression_t *expression);
177 static void create_local_declaration(entity_t *entity);
179 static unsigned decide_modulo_shift(unsigned type_size)
181 if (architecture_modulo_shift == 0)
183 if (type_size < architecture_modulo_shift)
184 return architecture_modulo_shift;
188 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
190 unsigned flags = get_atomic_type_flags(kind);
191 unsigned size = get_atomic_type_size(kind);
192 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
193 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
196 } else if (size == 8) {
199 panic("unexpected kind");
201 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
203 unsigned bit_size = size * 8;
204 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
205 unsigned modulo_shift = decide_modulo_shift(bit_size);
207 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
208 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
216 * Initialises the atomic modes depending on the machine size.
218 static void init_atomic_modes(void)
220 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
221 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
222 if (atomic_modes[i] != NULL)
224 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
228 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
230 assert(kind <= ATOMIC_TYPE_LAST);
231 return atomic_modes[kind];
234 static ir_node *get_vla_size(array_type_t *const type)
236 ir_node *size_node = type->size_node;
237 if (size_node == NULL) {
238 size_node = expression_to_firm(type->size_expression);
239 type->size_node = size_node;
244 static unsigned count_parameters(const function_type_t *function_type)
248 function_parameter_t *parameter = function_type->parameters;
249 for ( ; parameter != NULL; parameter = parameter->next) {
257 * Creates a Firm type for an atomic type
259 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
261 ir_mode *mode = atomic_modes[akind];
262 type_dbg_info *dbgi = get_type_dbg_info_(type);
263 ir_type *irtype = new_d_type_primitive(mode, dbgi);
264 il_alignment_t alignment = get_atomic_type_alignment(akind);
266 set_type_size_bytes(irtype, get_atomic_type_size(akind));
267 set_type_alignment_bytes(irtype, alignment);
273 * Creates a Firm type for a complex type
275 static ir_type *create_complex_type(const atomic_type_t *type)
277 atomic_type_kind_t kind = type->akind;
278 ir_mode *mode = atomic_modes[kind];
279 ident *id = get_mode_ident(mode);
283 /* FIXME: finish the array */
288 * Creates a Firm type for an imaginary type
290 static ir_type *create_imaginary_type(const atomic_type_t *type)
292 return create_atomic_type(type->akind, (const type_t*)type);
296 * return type of a parameter (and take transparent union gnu extension into
299 static type_t *get_parameter_type(type_t *orig_type)
301 type_t *type = skip_typeref(orig_type);
302 if (is_type_union(type)
303 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
304 compound_t *compound = type->compound.compound;
305 type = compound->members.entities->declaration.type;
311 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
313 type_t *return_type = skip_typeref(function_type->return_type);
315 int n_parameters = count_parameters(function_type)
316 + (for_closure ? 1 : 0);
317 int n_results = is_type_void(return_type) ? 0 : 1;
318 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
319 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
321 if (!is_type_void(return_type)) {
322 ir_type *restype = get_ir_type(return_type);
323 set_method_res_type(irtype, 0, restype);
326 function_parameter_t *parameter = function_type->parameters;
329 ir_type *p_irtype = get_ir_type(type_void_ptr);
330 set_method_param_type(irtype, n, p_irtype);
333 for ( ; parameter != NULL; parameter = parameter->next) {
334 type_t *type = get_parameter_type(parameter->type);
335 ir_type *p_irtype = get_ir_type(type);
336 set_method_param_type(irtype, n, p_irtype);
340 bool is_variadic = function_type->variadic;
343 set_method_variadicity(irtype, variadicity_variadic);
345 unsigned cc = get_method_calling_convention(irtype);
346 switch (function_type->calling_convention) {
347 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
350 set_method_calling_convention(irtype, SET_CDECL(cc));
357 /* only non-variadic function can use stdcall, else use cdecl */
358 set_method_calling_convention(irtype, SET_STDCALL(cc));
364 /* only non-variadic function can use fastcall, else use cdecl */
365 set_method_calling_convention(irtype, SET_FASTCALL(cc));
369 /* Hmm, leave default, not accepted by the parser yet. */
374 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
376 const decl_modifiers_t modifiers = function_type->modifiers;
377 if (modifiers & DM_CONST)
378 add_method_additional_properties(irtype, mtp_property_const);
379 if (modifiers & DM_PURE)
380 add_method_additional_properties(irtype, mtp_property_pure);
381 if (modifiers & DM_RETURNS_TWICE)
382 add_method_additional_properties(irtype, mtp_property_returns_twice);
383 if (modifiers & DM_NORETURN)
384 add_method_additional_properties(irtype, mtp_property_noreturn);
385 if (modifiers & DM_NOTHROW)
386 add_method_additional_properties(irtype, mtp_property_nothrow);
387 if (modifiers & DM_MALLOC)
388 add_method_additional_properties(irtype, mtp_property_malloc);
393 static ir_type *create_pointer_type(pointer_type_t *type)
395 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
396 type_t *points_to = type->points_to;
397 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
398 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
403 static ir_type *create_reference_type(reference_type_t *type)
405 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
406 type_t *refers_to = type->refers_to;
407 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
408 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
413 static ir_type *create_array_type(array_type_t *type)
415 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
416 type_t *element_type = type->element_type;
417 ir_type *ir_element_type = get_ir_type(element_type);
418 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
420 const int align = get_type_alignment_bytes(ir_element_type);
421 set_type_alignment_bytes(irtype, align);
423 if (type->size_constant) {
424 int n_elements = type->size;
426 set_array_bounds_int(irtype, 0, 0, n_elements);
428 size_t elemsize = get_type_size_bytes(ir_element_type);
429 if (elemsize % align > 0) {
430 elemsize += align - (elemsize % align);
432 set_type_size_bytes(irtype, n_elements * elemsize);
434 set_array_lower_bound_int(irtype, 0, 0);
436 set_type_state(irtype, layout_fixed);
442 * Return the signed integer type of size bits.
444 * @param size the size
446 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
450 static ir_mode *s_modes[64 + 1] = {NULL, };
454 if (size <= 0 || size > 64)
457 mode = s_modes[size];
461 snprintf(name, sizeof(name), "bf_I%u", size);
462 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
463 s_modes[size] = mode;
466 type_dbg_info *dbgi = get_type_dbg_info_(type);
467 res = new_d_type_primitive(mode, dbgi);
468 set_primitive_base_type(res, base_tp);
474 * Return the unsigned integer type of size bits.
476 * @param size the size
478 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
482 static ir_mode *u_modes[64 + 1] = {NULL, };
486 if (size <= 0 || size > 64)
489 mode = u_modes[size];
493 snprintf(name, sizeof(name), "bf_U%u", size);
494 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
495 u_modes[size] = mode;
498 type_dbg_info *dbgi = get_type_dbg_info_(type);
499 res = new_d_type_primitive(mode, dbgi);
500 set_primitive_base_type(res, base_tp);
505 static ir_type *create_bitfield_type(const entity_t *entity)
507 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
508 type_t *base = skip_typeref(entity->declaration.type);
509 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
510 ir_type *irbase = get_ir_type(base);
512 unsigned bit_size = entity->compound_member.bit_size;
514 assert(!is_type_float(base));
515 if (is_type_signed(base)) {
516 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
518 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
523 COMPOUND_IS_STRUCT = false,
524 COMPOUND_IS_UNION = true
528 * Construct firm type from ast struct type.
530 static ir_type *create_compound_type(compound_type_t *type,
531 bool incomplete, bool is_union)
533 compound_t *compound = type->compound;
535 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
536 return compound->irtype;
539 symbol_t *type_symbol = compound->base.symbol;
541 if (type_symbol != NULL) {
542 id = new_id_from_str(type_symbol->string);
545 id = id_unique("__anonymous_union.%u");
547 id = id_unique("__anonymous_struct.%u");
553 irtype = new_type_union(id);
555 irtype = new_type_struct(id);
558 compound->irtype_complete = false;
559 compound->irtype = irtype;
565 layout_union_type(type);
567 layout_struct_type(type);
570 compound->irtype_complete = true;
572 entity_t *entry = compound->members.entities;
573 for ( ; entry != NULL; entry = entry->base.next) {
574 if (entry->kind != ENTITY_COMPOUND_MEMBER)
577 symbol_t *symbol = entry->base.symbol;
578 type_t *entry_type = entry->declaration.type;
580 if (symbol == NULL) {
581 /* anonymous bitfield member, skip */
582 if (entry->compound_member.bitfield)
584 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
585 || entry_type->kind == TYPE_COMPOUND_UNION);
586 ident = id_unique("anon.%u");
588 ident = new_id_from_str(symbol->string);
591 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
593 ir_type *entry_irtype;
594 if (entry->compound_member.bitfield) {
595 entry_irtype = create_bitfield_type(entry);
597 entry_irtype = get_ir_type(entry_type);
599 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
601 set_entity_offset(entity, entry->compound_member.offset);
602 set_entity_offset_bits_remainder(entity,
603 entry->compound_member.bit_offset);
605 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
606 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
607 entry->compound_member.entity = entity;
610 set_type_alignment_bytes(irtype, compound->alignment);
611 set_type_size_bytes(irtype, compound->size);
612 set_type_state(irtype, layout_fixed);
617 static ir_tarval *fold_constant_to_tarval(expression_t const *);
619 static void determine_enum_values(enum_type_t *const type)
621 ir_mode *const mode = atomic_modes[type->base.akind];
622 ir_tarval *const one = get_mode_one(mode);
623 ir_tarval * tv_next = get_mode_null(mode);
625 enum_t *enume = type->enume;
626 entity_t *entry = enume->base.next;
627 for (; entry != NULL; entry = entry->base.next) {
628 if (entry->kind != ENTITY_ENUM_VALUE)
631 expression_t *const init = entry->enum_value.value;
633 tv_next = fold_constant_to_tarval(init);
635 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
636 entry->enum_value.tv = tv_next;
637 tv_next = tarval_add(tv_next, one);
641 static ir_type *create_enum_type(enum_type_t *const type)
643 return create_atomic_type(type->base.akind, (const type_t*) type);
646 static ir_type *get_ir_type_incomplete(type_t *type)
648 assert(type != NULL);
649 type = skip_typeref(type);
651 if (type->base.firm_type != NULL) {
652 return type->base.firm_type;
655 switch (type->kind) {
656 case TYPE_COMPOUND_STRUCT:
657 return create_compound_type(&type->compound, true, COMPOUND_IS_STRUCT);
658 case TYPE_COMPOUND_UNION:
659 return create_compound_type(&type->compound, true, COMPOUND_IS_UNION);
661 return get_ir_type(type);
665 ir_type *get_ir_type(type_t *type)
667 assert(type != NULL);
669 type = skip_typeref(type);
671 if (type->base.firm_type != NULL) {
672 return type->base.firm_type;
675 ir_type *firm_type = NULL;
676 switch (type->kind) {
678 firm_type = create_atomic_type(type->atomic.akind, type);
681 firm_type = create_complex_type(&type->atomic);
684 firm_type = create_imaginary_type(&type->atomic);
687 firm_type = create_method_type(&type->function, false);
690 firm_type = create_pointer_type(&type->pointer);
693 firm_type = create_reference_type(&type->reference);
696 firm_type = create_array_type(&type->array);
698 case TYPE_COMPOUND_STRUCT:
699 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_STRUCT);
701 case TYPE_COMPOUND_UNION:
702 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_UNION);
705 firm_type = create_enum_type(&type->enumt);
713 if (firm_type == NULL)
714 panic("unknown type found");
716 type->base.firm_type = firm_type;
720 static ir_mode *get_ir_mode_storage(type_t *type)
722 ir_type *irtype = get_ir_type(type);
724 /* firm doesn't report a mode for arrays somehow... */
725 if (is_Array_type(irtype)) {
729 ir_mode *mode = get_type_mode(irtype);
730 assert(mode != NULL);
735 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
736 * int that it returns bigger modes for floating point on some platforms
737 * (x87 internally does arithemtic with 80bits)
739 static ir_mode *get_ir_mode_arithmetic(type_t *type)
741 ir_mode *mode = get_ir_mode_storage(type);
742 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
743 return mode_float_arithmetic;
750 * Return a node representing the size of a type.
752 static ir_node *get_type_size_node(type_t *type)
755 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
756 type = skip_typeref(type);
758 if (is_type_array(type) && type->array.is_vla) {
759 ir_node *size_node = get_vla_size(&type->array);
760 ir_node *elem_size = get_type_size_node(type->array.element_type);
761 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
765 size = get_type_size(type);
766 return new_Const_long(mode, size);
769 /** Names of the runtime functions. */
770 static const struct {
771 int id; /**< the rts id */
772 int n_res; /**< number of return values */
773 const char *name; /**< the name of the rts function */
774 int n_params; /**< number of parameters */
775 unsigned flags; /**< language flags */
777 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
778 { rts_abort, 0, "abort", 0, _C89 },
779 { rts_alloca, 1, "alloca", 1, _ALL },
780 { rts_abs, 1, "abs", 1, _C89 },
781 { rts_labs, 1, "labs", 1, _C89 },
782 { rts_llabs, 1, "llabs", 1, _C99 },
783 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
785 { rts_fabs, 1, "fabs", 1, _C89 },
786 { rts_sqrt, 1, "sqrt", 1, _C89 },
787 { rts_cbrt, 1, "cbrt", 1, _C99 },
788 { rts_exp, 1, "exp", 1, _C89 },
789 { rts_exp2, 1, "exp2", 1, _C89 },
790 { rts_exp10, 1, "exp10", 1, _GNUC },
791 { rts_log, 1, "log", 1, _C89 },
792 { rts_log2, 1, "log2", 1, _C89 },
793 { rts_log10, 1, "log10", 1, _C89 },
794 { rts_pow, 1, "pow", 2, _C89 },
795 { rts_sin, 1, "sin", 1, _C89 },
796 { rts_cos, 1, "cos", 1, _C89 },
797 { rts_tan, 1, "tan", 1, _C89 },
798 { rts_asin, 1, "asin", 1, _C89 },
799 { rts_acos, 1, "acos", 1, _C89 },
800 { rts_atan, 1, "atan", 1, _C89 },
801 { rts_sinh, 1, "sinh", 1, _C89 },
802 { rts_cosh, 1, "cosh", 1, _C89 },
803 { rts_tanh, 1, "tanh", 1, _C89 },
805 { rts_fabsf, 1, "fabsf", 1, _C99 },
806 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
807 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
808 { rts_expf, 1, "expf", 1, _C99 },
809 { rts_exp2f, 1, "exp2f", 1, _C99 },
810 { rts_exp10f, 1, "exp10f", 1, _GNUC },
811 { rts_logf, 1, "logf", 1, _C99 },
812 { rts_log2f, 1, "log2f", 1, _C99 },
813 { rts_log10f, 1, "log10f", 1, _C99 },
814 { rts_powf, 1, "powf", 2, _C99 },
815 { rts_sinf, 1, "sinf", 1, _C99 },
816 { rts_cosf, 1, "cosf", 1, _C99 },
817 { rts_tanf, 1, "tanf", 1, _C99 },
818 { rts_asinf, 1, "asinf", 1, _C99 },
819 { rts_acosf, 1, "acosf", 1, _C99 },
820 { rts_atanf, 1, "atanf", 1, _C99 },
821 { rts_sinhf, 1, "sinhf", 1, _C99 },
822 { rts_coshf, 1, "coshf", 1, _C99 },
823 { rts_tanhf, 1, "tanhf", 1, _C99 },
825 { rts_fabsl, 1, "fabsl", 1, _C99 },
826 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
827 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
828 { rts_expl, 1, "expl", 1, _C99 },
829 { rts_exp2l, 1, "exp2l", 1, _C99 },
830 { rts_exp10l, 1, "exp10l", 1, _GNUC },
831 { rts_logl, 1, "logl", 1, _C99 },
832 { rts_log2l, 1, "log2l", 1, _C99 },
833 { rts_log10l, 1, "log10l", 1, _C99 },
834 { rts_powl, 1, "powl", 2, _C99 },
835 { rts_sinl, 1, "sinl", 1, _C99 },
836 { rts_cosl, 1, "cosl", 1, _C99 },
837 { rts_tanl, 1, "tanl", 1, _C99 },
838 { rts_asinl, 1, "asinl", 1, _C99 },
839 { rts_acosl, 1, "acosl", 1, _C99 },
840 { rts_atanl, 1, "atanl", 1, _C99 },
841 { rts_sinhl, 1, "sinhl", 1, _C99 },
842 { rts_coshl, 1, "coshl", 1, _C99 },
843 { rts_tanhl, 1, "tanhl", 1, _C99 },
845 { rts_strcmp, 1, "strcmp", 2, _C89 },
846 { rts_strncmp, 1, "strncmp", 3, _C89 },
847 { rts_strcpy, 1, "strcpy", 2, _C89 },
848 { rts_strlen, 1, "strlen", 1, _C89 },
849 { rts_memcpy, 1, "memcpy", 3, _C89 },
850 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
851 { rts_memmove, 1, "memmove", 3, _C89 },
852 { rts_memset, 1, "memset", 3, _C89 },
853 { rts_memcmp, 1, "memcmp", 3, _C89 },
856 static ident *rts_idents[lengthof(rts_data)];
858 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
860 void set_create_ld_ident(ident *(*func)(entity_t*))
862 create_ld_ident = func;
866 * Handle GNU attributes for entities
868 * @param ent the entity
869 * @param decl the routine declaration
871 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
873 assert(is_declaration(entity));
874 decl_modifiers_t modifiers = entity->declaration.modifiers;
876 if (is_method_entity(irentity)) {
877 if (modifiers & DM_PURE) {
878 set_entity_additional_properties(irentity, mtp_property_pure);
880 if (modifiers & DM_CONST) {
881 add_entity_additional_properties(irentity, mtp_property_const);
884 if (modifiers & DM_USED) {
885 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
887 if (modifiers & DM_WEAK) {
888 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
892 static bool is_main(entity_t *entity)
894 static symbol_t *sym_main = NULL;
895 if (sym_main == NULL) {
896 sym_main = symbol_table_insert("main");
899 if (entity->base.symbol != sym_main)
901 /* must be in outermost scope */
902 if (entity->base.parent_scope != ¤t_translation_unit->scope)
909 * Creates an entity representing a function.
911 * @param entity the function declaration/definition
912 * @param owner_type the owner type of this function, NULL
913 * for global functions
915 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
917 assert(entity->kind == ENTITY_FUNCTION);
918 if (entity->function.irentity != NULL)
919 return entity->function.irentity;
921 switch (entity->function.btk) {
924 case BUILTIN_LIBC_CHECK:
930 if (is_main(entity)) {
931 /* force main to C linkage */
932 type_t *type = entity->declaration.type;
933 assert(is_type_function(type));
934 if (type->function.linkage != LINKAGE_C) {
935 type_t *new_type = duplicate_type(type);
936 new_type->function.linkage = LINKAGE_C;
937 type = identify_new_type(new_type);
938 entity->declaration.type = type;
942 symbol_t *symbol = entity->base.symbol;
943 ident *id = new_id_from_str(symbol->string);
945 /* already an entity defined? */
946 ir_entity *irentity = entitymap_get(&entitymap, symbol);
947 bool const has_body = entity->function.statement != NULL;
948 if (irentity != NULL) {
949 if (get_entity_visibility(irentity) == ir_visibility_external
951 set_entity_visibility(irentity, ir_visibility_default);
956 ir_type *ir_type_method;
957 if (entity->function.need_closure)
958 ir_type_method = create_method_type(&entity->declaration.type->function, true);
960 ir_type_method = get_ir_type(entity->declaration.type);
962 bool nested_function = false;
963 if (owner_type == NULL)
964 owner_type = get_glob_type();
966 nested_function = true;
968 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
969 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
973 ld_id = id_unique("inner.%u");
975 ld_id = create_ld_ident(entity);
976 set_entity_ld_ident(irentity, ld_id);
978 handle_decl_modifiers(irentity, entity);
980 if (! nested_function) {
981 /* static inline => local
982 * extern inline => local
983 * inline without definition => local
984 * inline with definition => external_visible */
985 storage_class_tag_t const storage_class
986 = (storage_class_tag_t) entity->declaration.storage_class;
987 bool const is_inline = entity->function.is_inline;
989 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
990 set_entity_visibility(irentity, ir_visibility_default);
991 } else if (storage_class == STORAGE_CLASS_STATIC ||
992 (is_inline && has_body)) {
993 set_entity_visibility(irentity, ir_visibility_local);
994 } else if (has_body) {
995 set_entity_visibility(irentity, ir_visibility_default);
997 set_entity_visibility(irentity, ir_visibility_external);
1000 /* nested functions are always local */
1001 set_entity_visibility(irentity, ir_visibility_local);
1004 /* We should check for file scope here, but as long as we compile C only
1005 this is not needed. */
1006 if (!freestanding && !has_body) {
1007 /* check for a known runtime function */
1008 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1009 if (id != rts_idents[i])
1012 function_type_t *function_type
1013 = &entity->declaration.type->function;
1014 /* rts_entities code can't handle a "wrong" number of parameters */
1015 if (function_type->unspecified_parameters)
1018 /* check number of parameters */
1019 int n_params = count_parameters(function_type);
1020 if (n_params != rts_data[i].n_params)
1023 type_t *return_type = skip_typeref(function_type->return_type);
1024 int n_res = is_type_void(return_type) ? 0 : 1;
1025 if (n_res != rts_data[i].n_res)
1028 /* ignore those rts functions not necessary needed for current mode */
1029 if ((c_mode & rts_data[i].flags) == 0)
1031 assert(rts_entities[rts_data[i].id] == NULL);
1032 rts_entities[rts_data[i].id] = irentity;
1036 entitymap_insert(&entitymap, symbol, irentity);
1039 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1040 entity->function.irentity = irentity;
1046 * Creates a SymConst for a given entity.
1048 * @param dbgi debug info
1049 * @param entity the entity
1051 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1053 assert(entity != NULL);
1054 union symconst_symbol sym;
1055 sym.entity_p = entity;
1056 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1059 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1061 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1064 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1067 if (is_Const(value)) {
1068 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1071 ir_node *cond = new_d_Cond(dbgi, value);
1072 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1073 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1074 ir_node *tblock = new_Block(1, &proj_true);
1075 ir_node *fblock = new_Block(1, &proj_false);
1076 set_cur_block(tblock);
1077 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1078 ir_node *tjump = new_Jmp();
1079 set_cur_block(fblock);
1080 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1081 ir_node *fjump = new_Jmp();
1083 ir_node *in[2] = { tjump, fjump };
1084 ir_node *mergeblock = new_Block(2, in);
1085 set_cur_block(mergeblock);
1086 ir_node *phi_in[2] = { const1, const0 };
1087 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1091 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1093 ir_mode *value_mode = get_irn_mode(value);
1095 if (value_mode == dest_mode)
1098 if (dest_mode == mode_b) {
1099 ir_node *zero = new_Const(get_mode_null(value_mode));
1100 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1102 } else if (value_mode == mode_b) {
1103 return create_conv_from_b(dbgi, value, dest_mode);
1106 return new_d_Conv(dbgi, value, dest_mode);
1110 * Creates a SymConst node representing a wide string literal.
1112 * @param literal the wide string literal
1114 static ir_node *wide_string_literal_to_firm(
1115 const string_literal_expression_t *literal)
1117 ir_type *const global_type = get_glob_type();
1118 ir_type *const elem_type = ir_type_wchar_t;
1119 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1120 ir_type *const type = new_type_array(1, elem_type);
1122 ident *const id = id_unique("str.%u");
1123 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1124 set_entity_ld_ident(entity, id);
1125 set_entity_visibility(entity, ir_visibility_private);
1126 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1128 ir_mode *const mode = get_type_mode(elem_type);
1129 const size_t slen = wstrlen(&literal->value);
1131 set_array_lower_bound_int(type, 0, 0);
1132 set_array_upper_bound_int(type, 0, slen);
1133 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1134 set_type_state(type, layout_fixed);
1136 ir_initializer_t *initializer = create_initializer_compound(slen);
1137 const char *p = literal->value.begin;
1138 for (size_t i = 0; i < slen; ++i) {
1139 assert(p < literal->value.begin + literal->value.size);
1140 utf32 v = read_utf8_char(&p);
1141 ir_tarval *tv = new_tarval_from_long(v, mode);
1142 ir_initializer_t *val = create_initializer_tarval(tv);
1143 set_initializer_compound_value(initializer, i, val);
1145 set_entity_initializer(entity, initializer);
1147 return create_symconst(dbgi, entity);
1151 * Creates a SymConst node representing a string constant.
1153 * @param src_pos the source position of the string constant
1154 * @param id_prefix a prefix for the name of the generated string constant
1155 * @param value the value of the string constant
1157 static ir_node *string_to_firm(const source_position_t *const src_pos,
1158 const char *const id_prefix,
1159 const string_t *const value)
1161 ir_type *const global_type = get_glob_type();
1162 dbg_info *const dbgi = get_dbg_info(src_pos);
1163 ir_type *const type = new_type_array(1, ir_type_const_char);
1165 ident *const id = id_unique(id_prefix);
1166 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1167 set_entity_ld_ident(entity, id);
1168 set_entity_visibility(entity, ir_visibility_private);
1169 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1171 ir_type *const elem_type = ir_type_const_char;
1172 ir_mode *const mode = get_type_mode(elem_type);
1174 const char* const string = value->begin;
1175 const size_t slen = value->size;
1177 set_array_lower_bound_int(type, 0, 0);
1178 set_array_upper_bound_int(type, 0, slen);
1179 set_type_size_bytes(type, slen);
1180 set_type_state(type, layout_fixed);
1182 ir_initializer_t *initializer = create_initializer_compound(slen);
1183 for (size_t i = 0; i < slen; ++i) {
1184 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1185 ir_initializer_t *val = create_initializer_tarval(tv);
1186 set_initializer_compound_value(initializer, i, val);
1188 set_entity_initializer(entity, initializer);
1190 return create_symconst(dbgi, entity);
1193 static bool try_create_integer(literal_expression_t *literal,
1194 type_t *type, unsigned char base)
1196 const char *string = literal->value.begin;
1197 size_t size = literal->value.size;
1199 assert(type->kind == TYPE_ATOMIC);
1200 atomic_type_kind_t akind = type->atomic.akind;
1202 ir_mode *mode = atomic_modes[akind];
1203 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1204 if (tv == tarval_bad)
1207 literal->base.type = type;
1208 literal->target_value = tv;
1212 static void create_integer_tarval(literal_expression_t *literal)
1216 const string_t *suffix = &literal->suffix;
1218 if (suffix->size > 0) {
1219 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1220 if (*c == 'u' || *c == 'U') { ++us; }
1221 if (*c == 'l' || *c == 'L') { ++ls; }
1226 switch (literal->base.kind) {
1227 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1228 case EXPR_LITERAL_INTEGER: base = 10; break;
1229 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1230 default: panic("invalid literal kind");
1233 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1235 /* now try if the constant is small enough for some types */
1236 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1238 if (us == 0 && try_create_integer(literal, type_int, base))
1240 if ((us == 1 || base != 10)
1241 && try_create_integer(literal, type_unsigned_int, base))
1245 if (us == 0 && try_create_integer(literal, type_long, base))
1247 if ((us == 1 || base != 10)
1248 && try_create_integer(literal, type_unsigned_long, base))
1251 /* last try? then we should not report tarval_bad */
1252 if (us != 1 && base == 10)
1253 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1254 if (us == 0 && try_create_integer(literal, type_long_long, base))
1258 assert(us == 1 || base != 10);
1259 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1260 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1262 panic("internal error when parsing number literal");
1265 tarval_set_integer_overflow_mode(old_mode);
1268 void determine_literal_type(literal_expression_t *literal)
1270 switch (literal->base.kind) {
1271 case EXPR_LITERAL_INTEGER:
1272 case EXPR_LITERAL_INTEGER_OCTAL:
1273 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1274 create_integer_tarval(literal);
1282 * Creates a Const node representing a constant.
1284 static ir_node *literal_to_firm(const literal_expression_t *literal)
1286 type_t *type = skip_typeref(literal->base.type);
1287 ir_mode *mode = get_ir_mode_storage(type);
1288 const char *string = literal->value.begin;
1289 size_t size = literal->value.size;
1292 switch (literal->base.kind) {
1293 case EXPR_LITERAL_WIDE_CHARACTER: {
1294 utf32 v = read_utf8_char(&string);
1296 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1298 tv = new_tarval_from_str(buf, len, mode);
1301 case EXPR_LITERAL_CHARACTER: {
1304 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1305 if (size == 1 && char_is_signed) {
1306 v = (signed char)string[0];
1309 for (size_t i = 0; i < size; ++i) {
1310 v = (v << 8) | ((unsigned char)string[i]);
1314 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1316 tv = new_tarval_from_str(buf, len, mode);
1319 case EXPR_LITERAL_INTEGER:
1320 case EXPR_LITERAL_INTEGER_OCTAL:
1321 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1322 assert(literal->target_value != NULL);
1323 tv = literal->target_value;
1325 case EXPR_LITERAL_FLOATINGPOINT:
1326 tv = new_tarval_from_str(string, size, mode);
1328 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1329 char buffer[size + 2];
1330 memcpy(buffer, "0x", 2);
1331 memcpy(buffer+2, string, size);
1332 tv = new_tarval_from_str(buffer, size+2, mode);
1335 case EXPR_LITERAL_BOOLEAN:
1336 if (string[0] == 't') {
1337 tv = get_mode_one(mode);
1339 assert(string[0] == 'f');
1340 tv = get_mode_null(mode);
1343 case EXPR_LITERAL_MS_NOOP:
1344 tv = get_mode_null(mode);
1349 panic("Invalid literal kind found");
1352 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1353 ir_node *res = new_d_Const(dbgi, tv);
1354 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1355 return create_conv(dbgi, res, mode_arith);
1359 * Allocate an area of size bytes aligned at alignment
1362 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1364 static unsigned area_cnt = 0;
1367 ir_type *tp = new_type_array(1, ir_type_char);
1368 set_array_bounds_int(tp, 0, 0, size);
1369 set_type_alignment_bytes(tp, alignment);
1371 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1372 ident *name = new_id_from_str(buf);
1373 ir_entity *area = new_entity(frame_type, name, tp);
1375 /* mark this entity as compiler generated */
1376 set_entity_compiler_generated(area, 1);
1381 * Return a node representing a trampoline region
1382 * for a given function entity.
1384 * @param dbgi debug info
1385 * @param entity the function entity
1387 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1389 ir_entity *region = NULL;
1392 if (current_trampolines != NULL) {
1393 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1394 if (current_trampolines[i].function == entity) {
1395 region = current_trampolines[i].region;
1400 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1402 ir_graph *irg = current_ir_graph;
1403 if (region == NULL) {
1404 /* create a new region */
1405 ir_type *frame_tp = get_irg_frame_type(irg);
1406 trampoline_region reg;
1407 reg.function = entity;
1409 reg.region = alloc_trampoline(frame_tp,
1410 be_params->trampoline_size,
1411 be_params->trampoline_align);
1412 ARR_APP1(trampoline_region, current_trampolines, reg);
1413 region = reg.region;
1415 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1420 * Creates a trampoline for a function represented by an entity.
1422 * @param dbgi debug info
1423 * @param mode the (reference) mode for the function address
1424 * @param entity the function entity
1426 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1429 assert(entity != NULL);
1431 in[0] = get_trampoline_region(dbgi, entity);
1432 in[1] = create_symconst(dbgi, entity);
1433 in[2] = get_irg_frame(current_ir_graph);
1435 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1436 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1437 return new_Proj(irn, mode, pn_Builtin_max+1);
1441 * Dereference an address.
1443 * @param dbgi debug info
1444 * @param type the type of the dereferenced result (the points_to type)
1445 * @param addr the address to dereference
1447 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1448 ir_node *const addr)
1450 type_t *skipped = skip_typeref(type);
1451 if (is_type_incomplete(skipped))
1454 ir_type *irtype = get_ir_type(skipped);
1455 if (is_compound_type(irtype)
1456 || is_Method_type(irtype)
1457 || is_Array_type(irtype)) {
1461 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1462 ? cons_volatile : cons_none;
1463 ir_mode *const mode = get_type_mode(irtype);
1464 ir_node *const memory = get_store();
1465 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1466 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1467 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1469 set_store(load_mem);
1471 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1472 return create_conv(dbgi, load_res, mode_arithmetic);
1476 * Creates a strict Conv (to the node's mode) if necessary.
1478 * @param dbgi debug info
1479 * @param node the node to strict conv
1481 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1483 ir_mode *mode = get_irn_mode(node);
1485 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1487 if (!mode_is_float(mode))
1490 /* check if there is already a Conv */
1491 if (is_Conv(node)) {
1492 /* convert it into a strict Conv */
1493 set_Conv_strict(node, 1);
1497 /* otherwise create a new one */
1498 return new_d_strictConv(dbgi, node, mode);
1502 * Returns the correct base address depending on whether it is a parameter or a
1503 * normal local variable.
1505 static ir_node *get_local_frame(ir_entity *const ent)
1507 ir_graph *const irg = current_ir_graph;
1508 const ir_type *const owner = get_entity_owner(ent);
1509 if (owner == current_outer_frame) {
1510 assert(current_static_link != NULL);
1511 return current_static_link;
1513 return get_irg_frame(irg);
1518 * Keep all memory edges of the given block.
1520 static void keep_all_memory(ir_node *block)
1522 ir_node *old = get_cur_block();
1524 set_cur_block(block);
1525 keep_alive(get_store());
1526 /* TODO: keep all memory edges from restricted pointers */
1530 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1532 entity_t *entity = ref->entity;
1533 if (entity->enum_value.tv == NULL) {
1534 type_t *type = skip_typeref(entity->enum_value.enum_type);
1535 assert(type->kind == TYPE_ENUM);
1536 determine_enum_values(&type->enumt);
1539 return new_Const(entity->enum_value.tv);
1542 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1544 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1545 entity_t *entity = ref->entity;
1546 assert(is_declaration(entity));
1547 type_t *type = skip_typeref(entity->declaration.type);
1549 /* make sure the type is constructed */
1550 (void) get_ir_type(type);
1552 if (entity->kind == ENTITY_FUNCTION
1553 && entity->function.btk != BUILTIN_NONE) {
1554 ir_entity *irentity = get_function_entity(entity, NULL);
1555 /* for gcc compatibility we have to produce (dummy) addresses for some
1556 * builtins which don't have entities */
1557 if (irentity == NULL) {
1558 source_position_t const *const pos = &ref->base.source_position;
1559 symbol_t const *const sym = ref->entity->base.symbol;
1560 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1562 /* simply create a NULL pointer */
1563 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1564 ir_node *res = new_Const(get_mode_null(mode));
1570 switch ((declaration_kind_t) entity->declaration.kind) {
1571 case DECLARATION_KIND_UNKNOWN:
1574 case DECLARATION_KIND_LOCAL_VARIABLE: {
1575 ir_mode *const mode = get_ir_mode_storage(type);
1576 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1577 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1579 case DECLARATION_KIND_PARAMETER: {
1580 ir_mode *const mode = get_ir_mode_storage(type);
1581 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1582 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1584 case DECLARATION_KIND_FUNCTION: {
1585 return create_symconst(dbgi, entity->function.irentity);
1587 case DECLARATION_KIND_INNER_FUNCTION: {
1588 ir_mode *const mode = get_ir_mode_storage(type);
1589 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1590 /* inner function not using the closure */
1591 return create_symconst(dbgi, entity->function.irentity);
1593 /* need trampoline here */
1594 return create_trampoline(dbgi, mode, entity->function.irentity);
1597 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1598 const variable_t *variable = &entity->variable;
1599 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1600 return deref_address(dbgi, variable->base.type, addr);
1603 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1604 ir_entity *irentity = entity->variable.v.entity;
1605 ir_node *frame = get_local_frame(irentity);
1606 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1607 return deref_address(dbgi, entity->declaration.type, sel);
1609 case DECLARATION_KIND_PARAMETER_ENTITY: {
1610 ir_entity *irentity = entity->parameter.v.entity;
1611 ir_node *frame = get_local_frame(irentity);
1612 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1613 return deref_address(dbgi, entity->declaration.type, sel);
1616 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1617 return entity->variable.v.vla_base;
1619 case DECLARATION_KIND_COMPOUND_MEMBER:
1620 panic("not implemented reference type");
1623 panic("reference to declaration with unknown type found");
1626 static ir_node *reference_addr(const reference_expression_t *ref)
1628 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1629 entity_t *entity = ref->entity;
1630 assert(is_declaration(entity));
1632 switch((declaration_kind_t) entity->declaration.kind) {
1633 case DECLARATION_KIND_UNKNOWN:
1635 case DECLARATION_KIND_PARAMETER:
1636 case DECLARATION_KIND_LOCAL_VARIABLE:
1637 /* you can store to a local variable (so we don't panic but return NULL
1638 * as an indicator for no real address) */
1640 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1641 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1644 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1645 ir_entity *irentity = entity->variable.v.entity;
1646 ir_node *frame = get_local_frame(irentity);
1647 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1651 case DECLARATION_KIND_PARAMETER_ENTITY: {
1652 ir_entity *irentity = entity->parameter.v.entity;
1653 ir_node *frame = get_local_frame(irentity);
1654 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1659 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1660 return entity->variable.v.vla_base;
1662 case DECLARATION_KIND_FUNCTION: {
1663 return create_symconst(dbgi, entity->function.irentity);
1666 case DECLARATION_KIND_INNER_FUNCTION: {
1667 type_t *const type = skip_typeref(entity->declaration.type);
1668 ir_mode *const mode = get_ir_mode_storage(type);
1669 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1670 /* inner function not using the closure */
1671 return create_symconst(dbgi, entity->function.irentity);
1673 /* need trampoline here */
1674 return create_trampoline(dbgi, mode, entity->function.irentity);
1678 case DECLARATION_KIND_COMPOUND_MEMBER:
1679 panic("not implemented reference type");
1682 panic("reference to declaration with unknown type found");
1686 * Transform calls to builtin functions.
1688 static ir_node *process_builtin_call(const call_expression_t *call)
1690 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1692 assert(call->function->kind == EXPR_REFERENCE);
1693 reference_expression_t *builtin = &call->function->reference;
1695 type_t *expr_type = skip_typeref(builtin->base.type);
1696 assert(is_type_pointer(expr_type));
1698 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1700 switch (builtin->entity->function.btk) {
1703 case BUILTIN_ALLOCA: {
1704 expression_t *argument = call->arguments->expression;
1705 ir_node *size = expression_to_firm(argument);
1707 ir_node *store = get_store();
1708 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1710 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1712 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1717 type_t *type = function_type->function.return_type;
1718 ir_mode *mode = get_ir_mode_arithmetic(type);
1719 ir_tarval *tv = get_mode_infinite(mode);
1720 ir_node *res = new_d_Const(dbgi, tv);
1724 /* Ignore string for now... */
1725 assert(is_type_function(function_type));
1726 type_t *type = function_type->function.return_type;
1727 ir_mode *mode = get_ir_mode_arithmetic(type);
1728 ir_tarval *tv = get_mode_NAN(mode);
1729 ir_node *res = new_d_Const(dbgi, tv);
1732 case BUILTIN_EXPECT: {
1733 expression_t *argument = call->arguments->expression;
1734 return _expression_to_firm(argument);
1736 case BUILTIN_VA_END:
1737 /* evaluate the argument of va_end for its side effects */
1738 _expression_to_firm(call->arguments->expression);
1740 case BUILTIN_OBJECT_SIZE: {
1741 /* determine value of "type" */
1742 expression_t *type_expression = call->arguments->next->expression;
1743 long type_val = fold_constant_to_int(type_expression);
1744 type_t *type = function_type->function.return_type;
1745 ir_mode *mode = get_ir_mode_arithmetic(type);
1746 /* just produce a "I don't know" result */
1747 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1748 get_mode_minus_one(mode);
1750 return new_d_Const(dbgi, result);
1752 case BUILTIN_ROTL: {
1753 ir_node *val = expression_to_firm(call->arguments->expression);
1754 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1755 ir_mode *mode = get_irn_mode(val);
1756 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1757 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1759 case BUILTIN_ROTR: {
1760 ir_node *val = expression_to_firm(call->arguments->expression);
1761 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1762 ir_mode *mode = get_irn_mode(val);
1763 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1764 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1765 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1766 return new_d_Rotl(dbgi, val, sub, mode);
1771 case BUILTIN_LIBC_CHECK:
1772 panic("builtin did not produce an entity");
1774 panic("invalid builtin found");
1778 * Transform a call expression.
1779 * Handles some special cases, like alloca() calls, which must be resolved
1780 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1781 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1784 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1786 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1787 assert(currently_reachable());
1789 expression_t *function = call->function;
1790 ir_node *callee = NULL;
1791 bool firm_builtin = false;
1792 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1793 if (function->kind == EXPR_REFERENCE) {
1794 const reference_expression_t *ref = &function->reference;
1795 entity_t *entity = ref->entity;
1797 if (entity->kind == ENTITY_FUNCTION) {
1798 builtin_kind_t builtin = entity->function.btk;
1799 if (builtin == BUILTIN_FIRM) {
1800 firm_builtin = true;
1801 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1802 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1803 && builtin != BUILTIN_LIBC_CHECK) {
1804 return process_builtin_call(call);
1809 callee = expression_to_firm(function);
1811 type_t *type = skip_typeref(function->base.type);
1812 assert(is_type_pointer(type));
1813 pointer_type_t *pointer_type = &type->pointer;
1814 type_t *points_to = skip_typeref(pointer_type->points_to);
1815 assert(is_type_function(points_to));
1816 function_type_t *function_type = &points_to->function;
1818 int n_parameters = 0;
1819 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1820 ir_type *new_method_type = NULL;
1821 if (function_type->variadic || function_type->unspecified_parameters) {
1822 const call_argument_t *argument = call->arguments;
1823 for ( ; argument != NULL; argument = argument->next) {
1827 /* we need to construct a new method type matching the call
1829 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1830 int n_res = get_method_n_ress(ir_method_type);
1831 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1832 set_method_calling_convention(new_method_type,
1833 get_method_calling_convention(ir_method_type));
1834 set_method_additional_properties(new_method_type,
1835 get_method_additional_properties(ir_method_type));
1836 set_method_variadicity(new_method_type,
1837 get_method_variadicity(ir_method_type));
1839 for (int i = 0; i < n_res; ++i) {
1840 set_method_res_type(new_method_type, i,
1841 get_method_res_type(ir_method_type, i));
1843 argument = call->arguments;
1844 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1845 expression_t *expression = argument->expression;
1846 ir_type *irtype = get_ir_type(expression->base.type);
1847 set_method_param_type(new_method_type, i, irtype);
1849 ir_method_type = new_method_type;
1851 n_parameters = get_method_n_params(ir_method_type);
1854 ir_node *in[n_parameters];
1856 const call_argument_t *argument = call->arguments;
1857 for (int n = 0; n < n_parameters; ++n) {
1858 expression_t *expression = argument->expression;
1859 ir_node *arg_node = expression_to_firm(expression);
1861 type_t *arg_type = skip_typeref(expression->base.type);
1862 if (!is_type_compound(arg_type)) {
1863 ir_mode *mode = get_ir_mode_storage(expression->base.type);
1864 arg_node = create_conv(dbgi, arg_node, mode);
1865 arg_node = do_strict_conv(dbgi, arg_node);
1870 argument = argument->next;
1874 if (function_type->modifiers & DM_CONST) {
1875 store = get_irg_no_mem(current_ir_graph);
1877 store = get_store();
1881 type_t *return_type = skip_typeref(function_type->return_type);
1882 ir_node *result = NULL;
1884 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1886 if (! (function_type->modifiers & DM_CONST)) {
1887 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1891 if (!is_type_void(return_type)) {
1892 assert(is_type_scalar(return_type));
1893 ir_mode *mode = get_ir_mode_storage(return_type);
1894 result = new_Proj(node, mode, pn_Builtin_max+1);
1895 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1896 result = create_conv(NULL, result, mode_arith);
1899 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1900 if (! (function_type->modifiers & DM_CONST)) {
1901 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1905 if (!is_type_void(return_type)) {
1906 ir_node *resproj = new_Proj(node, mode_T, pn_Call_T_result);
1908 if (is_type_scalar(return_type)) {
1909 ir_mode *mode = get_ir_mode_storage(return_type);
1910 result = new_Proj(resproj, mode, 0);
1911 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1912 result = create_conv(NULL, result, mode_arith);
1914 ir_mode *mode = mode_P_data;
1915 result = new_Proj(resproj, mode, 0);
1920 if (function_type->modifiers & DM_NORETURN) {
1921 /* A dead end: Keep the Call and the Block. Also place all further
1922 * nodes into a new and unreachable block. */
1924 keep_alive(get_cur_block());
1925 ir_node *block = new_Block(0, NULL);
1926 set_cur_block(block);
1932 static ir_node *statement_to_firm(statement_t *statement);
1933 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1935 static ir_node *expression_to_addr(const expression_t *expression);
1936 static ir_node *create_condition_evaluation(const expression_t *expression,
1937 ir_node *true_block,
1938 ir_node *false_block);
1940 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1943 if (!is_type_compound(type)) {
1944 ir_mode *mode = get_ir_mode_storage(type);
1945 value = create_conv(dbgi, value, mode);
1946 value = do_strict_conv(dbgi, value);
1949 ir_node *memory = get_store();
1951 if (is_type_scalar(type)) {
1952 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1953 ? cons_volatile : cons_none;
1954 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1955 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1956 set_store(store_mem);
1958 ir_type *irtype = get_ir_type(type);
1959 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1960 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1961 set_store(copyb_mem);
1965 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1967 ir_tarval *all_one = get_mode_all_one(mode);
1968 int mode_size = get_mode_size_bits(mode);
1969 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1971 assert(offset >= 0);
1973 assert(offset + size <= mode_size);
1974 if (size == mode_size) {
1978 long shiftr = get_mode_size_bits(mode) - size;
1979 long shiftl = offset;
1980 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1981 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1982 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1983 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1988 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1989 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1992 ir_type *entity_type = get_entity_type(entity);
1993 ir_type *base_type = get_primitive_base_type(entity_type);
1994 ir_mode *mode = get_type_mode(base_type);
1995 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1997 value = create_conv(dbgi, value, mode);
1999 /* kill upper bits of value and shift to right position */
2000 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
2001 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
2002 unsigned base_bits = get_mode_size_bits(mode);
2003 unsigned shiftwidth = base_bits - bitsize;
2005 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
2006 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
2008 unsigned shrwidth = base_bits - bitsize - bitoffset;
2009 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
2010 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
2012 /* load current value */
2013 ir_node *mem = get_store();
2014 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2015 set_volatile ? cons_volatile : cons_none);
2016 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2017 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2018 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2019 ir_tarval *inv_mask = tarval_not(shift_mask);
2020 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2021 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2023 /* construct new value and store */
2024 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2025 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2026 set_volatile ? cons_volatile : cons_none);
2027 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2028 set_store(store_mem);
2034 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2035 if (mode_is_signed(mode)) {
2036 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2038 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2043 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2046 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2047 entity_t *entity = expression->compound_entry;
2048 type_t *base_type = entity->declaration.type;
2049 ir_mode *mode = get_ir_mode_storage(base_type);
2050 ir_node *mem = get_store();
2051 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2052 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2053 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2054 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2056 ir_mode *amode = mode;
2057 /* optimisation, since shifting in modes < machine_size is usually
2059 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2062 unsigned amode_size = get_mode_size_bits(amode);
2063 load_res = create_conv(dbgi, load_res, amode);
2065 set_store(load_mem);
2067 /* kill upper bits */
2068 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2069 unsigned bitoffset = entity->compound_member.bit_offset;
2070 unsigned bitsize = entity->compound_member.bit_size;
2071 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2072 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2073 ir_node *countl = new_d_Const(dbgi, tvl);
2074 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2076 unsigned shift_bitsr = bitoffset + shift_bitsl;
2077 assert(shift_bitsr <= amode_size);
2078 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2079 ir_node *countr = new_d_Const(dbgi, tvr);
2081 if (mode_is_signed(mode)) {
2082 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2084 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2087 type_t *type = expression->base.type;
2088 ir_mode *resmode = get_ir_mode_arithmetic(type);
2089 return create_conv(dbgi, shiftr, resmode);
2092 /* make sure the selected compound type is constructed */
2093 static void construct_select_compound(const select_expression_t *expression)
2095 type_t *type = skip_typeref(expression->compound->base.type);
2096 if (is_type_pointer(type)) {
2097 type = type->pointer.points_to;
2099 (void) get_ir_type(type);
2102 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2103 ir_node *value, ir_node *addr)
2105 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2106 type_t *type = skip_typeref(expression->base.type);
2108 if (!is_type_compound(type)) {
2109 ir_mode *mode = get_ir_mode_storage(type);
2110 value = create_conv(dbgi, value, mode);
2111 value = do_strict_conv(dbgi, value);
2114 if (expression->kind == EXPR_REFERENCE) {
2115 const reference_expression_t *ref = &expression->reference;
2117 entity_t *entity = ref->entity;
2118 assert(is_declaration(entity));
2119 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2120 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2121 set_value(entity->variable.v.value_number, value);
2123 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2124 set_value(entity->parameter.v.value_number, value);
2130 addr = expression_to_addr(expression);
2131 assert(addr != NULL);
2133 if (expression->kind == EXPR_SELECT) {
2134 const select_expression_t *select = &expression->select;
2136 construct_select_compound(select);
2138 entity_t *entity = select->compound_entry;
2139 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2140 if (entity->compound_member.bitfield) {
2141 ir_entity *irentity = entity->compound_member.entity;
2143 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2144 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2145 set_volatile, true);
2150 assign_value(dbgi, addr, type, value);
2154 static void set_value_for_expression(const expression_t *expression,
2157 set_value_for_expression_addr(expression, value, NULL);
2160 static ir_node *get_value_from_lvalue(const expression_t *expression,
2163 if (expression->kind == EXPR_REFERENCE) {
2164 const reference_expression_t *ref = &expression->reference;
2166 entity_t *entity = ref->entity;
2167 assert(entity->kind == ENTITY_VARIABLE
2168 || entity->kind == ENTITY_PARAMETER);
2169 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2171 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2172 value_number = entity->variable.v.value_number;
2173 assert(addr == NULL);
2174 type_t *type = skip_typeref(expression->base.type);
2175 ir_mode *mode = get_ir_mode_storage(type);
2176 ir_node *res = get_value(value_number, mode);
2177 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2178 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2179 value_number = entity->parameter.v.value_number;
2180 assert(addr == NULL);
2181 type_t *type = skip_typeref(expression->base.type);
2182 ir_mode *mode = get_ir_mode_storage(type);
2183 ir_node *res = get_value(value_number, mode);
2184 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2188 assert(addr != NULL);
2189 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2192 if (expression->kind == EXPR_SELECT &&
2193 expression->select.compound_entry->compound_member.bitfield) {
2194 construct_select_compound(&expression->select);
2195 value = bitfield_extract_to_firm(&expression->select, addr);
2197 value = deref_address(dbgi, expression->base.type, addr);
2204 static ir_node *create_incdec(const unary_expression_t *expression)
2206 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2207 const expression_t *value_expr = expression->value;
2208 ir_node *addr = expression_to_addr(value_expr);
2209 ir_node *value = get_value_from_lvalue(value_expr, addr);
2211 type_t *type = skip_typeref(expression->base.type);
2212 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2215 if (is_type_pointer(type)) {
2216 pointer_type_t *pointer_type = &type->pointer;
2217 offset = get_type_size_node(pointer_type->points_to);
2219 assert(is_type_arithmetic(type));
2220 offset = new_Const(get_mode_one(mode));
2224 ir_node *store_value;
2225 switch(expression->base.kind) {
2226 case EXPR_UNARY_POSTFIX_INCREMENT:
2228 store_value = new_d_Add(dbgi, value, offset, mode);
2230 case EXPR_UNARY_POSTFIX_DECREMENT:
2232 store_value = new_d_Sub(dbgi, value, offset, mode);
2234 case EXPR_UNARY_PREFIX_INCREMENT:
2235 result = new_d_Add(dbgi, value, offset, mode);
2236 store_value = result;
2238 case EXPR_UNARY_PREFIX_DECREMENT:
2239 result = new_d_Sub(dbgi, value, offset, mode);
2240 store_value = result;
2243 panic("no incdec expr in create_incdec");
2246 set_value_for_expression_addr(value_expr, store_value, addr);
2251 static bool is_local_variable(expression_t *expression)
2253 if (expression->kind != EXPR_REFERENCE)
2255 reference_expression_t *ref_expr = &expression->reference;
2256 entity_t *entity = ref_expr->entity;
2257 if (entity->kind != ENTITY_VARIABLE)
2259 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2260 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2263 static ir_relation get_relation(const expression_kind_t kind)
2266 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2267 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2268 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2269 case EXPR_BINARY_ISLESS:
2270 case EXPR_BINARY_LESS: return ir_relation_less;
2271 case EXPR_BINARY_ISLESSEQUAL:
2272 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2273 case EXPR_BINARY_ISGREATER:
2274 case EXPR_BINARY_GREATER: return ir_relation_greater;
2275 case EXPR_BINARY_ISGREATEREQUAL:
2276 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2277 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2282 panic("trying to get pn_Cmp from non-comparison binexpr type");
2286 * Handle the assume optimizer hint: check if a Confirm
2287 * node can be created.
2289 * @param dbi debug info
2290 * @param expr the IL assume expression
2292 * we support here only some simple cases:
2297 static ir_node *handle_assume_compare(dbg_info *dbi,
2298 const binary_expression_t *expression)
2300 expression_t *op1 = expression->left;
2301 expression_t *op2 = expression->right;
2302 entity_t *var2, *var = NULL;
2303 ir_node *res = NULL;
2304 ir_relation relation = get_relation(expression->base.kind);
2306 if (is_local_variable(op1) && is_local_variable(op2)) {
2307 var = op1->reference.entity;
2308 var2 = op2->reference.entity;
2310 type_t *const type = skip_typeref(var->declaration.type);
2311 ir_mode *const mode = get_ir_mode_storage(type);
2313 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2314 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2316 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2317 set_value(var2->variable.v.value_number, res);
2319 res = new_d_Confirm(dbi, irn1, irn2, relation);
2320 set_value(var->variable.v.value_number, res);
2325 expression_t *con = NULL;
2326 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2327 var = op1->reference.entity;
2329 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2330 relation = get_inversed_relation(relation);
2331 var = op2->reference.entity;
2336 type_t *const type = skip_typeref(var->declaration.type);
2337 ir_mode *const mode = get_ir_mode_storage(type);
2339 res = get_value(var->variable.v.value_number, mode);
2340 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2341 set_value(var->variable.v.value_number, res);
2347 * Handle the assume optimizer hint.
2349 * @param dbi debug info
2350 * @param expr the IL assume expression
2352 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2354 switch(expression->kind) {
2355 case EXPR_BINARY_EQUAL:
2356 case EXPR_BINARY_NOTEQUAL:
2357 case EXPR_BINARY_LESS:
2358 case EXPR_BINARY_LESSEQUAL:
2359 case EXPR_BINARY_GREATER:
2360 case EXPR_BINARY_GREATEREQUAL:
2361 return handle_assume_compare(dbi, &expression->binary);
2367 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2368 type_t *from_type, type_t *type)
2370 type = skip_typeref(type);
2371 if (is_type_void(type)) {
2372 /* make sure firm type is constructed */
2373 (void) get_ir_type(type);
2376 if (!is_type_scalar(type)) {
2377 /* make sure firm type is constructed */
2378 (void) get_ir_type(type);
2382 from_type = skip_typeref(from_type);
2383 ir_mode *mode = get_ir_mode_storage(type);
2384 /* check for conversion from / to __based types */
2385 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2386 const variable_t *from_var = from_type->pointer.base_variable;
2387 const variable_t *to_var = type->pointer.base_variable;
2388 if (from_var != to_var) {
2389 if (from_var != NULL) {
2390 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2391 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2392 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2394 if (to_var != NULL) {
2395 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2396 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2397 value_node = new_d_Sub(dbgi, value_node, base, mode);
2402 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2403 /* bool adjustments (we save a mode_Bu, but have to temporarily
2404 * convert to mode_b so we only get a 0/1 value */
2405 value_node = create_conv(dbgi, value_node, mode_b);
2408 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2409 ir_node *node = create_conv(dbgi, value_node, mode);
2410 node = do_strict_conv(dbgi, node);
2411 node = create_conv(dbgi, node, mode_arith);
2416 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2418 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2419 type_t *type = skip_typeref(expression->base.type);
2421 const expression_t *value = expression->value;
2423 switch(expression->base.kind) {
2424 case EXPR_UNARY_TAKE_ADDRESS:
2425 return expression_to_addr(value);
2427 case EXPR_UNARY_NEGATE: {
2428 ir_node *value_node = expression_to_firm(value);
2429 ir_mode *mode = get_ir_mode_arithmetic(type);
2430 return new_d_Minus(dbgi, value_node, mode);
2432 case EXPR_UNARY_PLUS:
2433 return expression_to_firm(value);
2434 case EXPR_UNARY_BITWISE_NEGATE: {
2435 ir_node *value_node = expression_to_firm(value);
2436 ir_mode *mode = get_ir_mode_arithmetic(type);
2437 return new_d_Not(dbgi, value_node, mode);
2439 case EXPR_UNARY_NOT: {
2440 ir_node *value_node = _expression_to_firm(value);
2441 value_node = create_conv(dbgi, value_node, mode_b);
2442 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2445 case EXPR_UNARY_DEREFERENCE: {
2446 ir_node *value_node = expression_to_firm(value);
2447 type_t *value_type = skip_typeref(value->base.type);
2448 assert(is_type_pointer(value_type));
2450 /* check for __based */
2451 const variable_t *const base_var = value_type->pointer.base_variable;
2452 if (base_var != NULL) {
2453 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2454 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2455 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2457 type_t *points_to = value_type->pointer.points_to;
2458 return deref_address(dbgi, points_to, value_node);
2460 case EXPR_UNARY_POSTFIX_INCREMENT:
2461 case EXPR_UNARY_POSTFIX_DECREMENT:
2462 case EXPR_UNARY_PREFIX_INCREMENT:
2463 case EXPR_UNARY_PREFIX_DECREMENT:
2464 return create_incdec(expression);
2465 case EXPR_UNARY_CAST: {
2466 ir_node *value_node = expression_to_firm(value);
2467 type_t *from_type = value->base.type;
2468 return create_cast(dbgi, value_node, from_type, type);
2470 case EXPR_UNARY_ASSUME:
2471 return handle_assume(dbgi, value);
2476 panic("invalid UNEXPR type found");
2480 * produces a 0/1 depending of the value of a mode_b node
2482 static ir_node *produce_condition_result(const expression_t *expression,
2483 ir_mode *mode, dbg_info *dbgi)
2485 ir_node *const one_block = new_immBlock();
2486 ir_node *const zero_block = new_immBlock();
2487 create_condition_evaluation(expression, one_block, zero_block);
2488 mature_immBlock(one_block);
2489 mature_immBlock(zero_block);
2491 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2492 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2493 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2494 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2495 set_cur_block(block);
2497 ir_node *const one = new_Const(get_mode_one(mode));
2498 ir_node *const zero = new_Const(get_mode_null(mode));
2499 ir_node *const in[2] = { one, zero };
2500 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2505 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2506 ir_node *value, type_t *type)
2508 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2509 assert(is_type_pointer(type));
2510 pointer_type_t *const pointer_type = &type->pointer;
2511 type_t *const points_to = skip_typeref(pointer_type->points_to);
2512 ir_node * elem_size = get_type_size_node(points_to);
2513 elem_size = create_conv(dbgi, elem_size, mode);
2514 value = create_conv(dbgi, value, mode);
2515 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2519 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2520 ir_node *left, ir_node *right)
2523 type_t *type_left = skip_typeref(expression->left->base.type);
2524 type_t *type_right = skip_typeref(expression->right->base.type);
2526 expression_kind_t kind = expression->base.kind;
2529 case EXPR_BINARY_SHIFTLEFT:
2530 case EXPR_BINARY_SHIFTRIGHT:
2531 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2532 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2533 mode = get_ir_mode_arithmetic(expression->base.type);
2534 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2537 case EXPR_BINARY_SUB:
2538 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2539 const pointer_type_t *const ptr_type = &type_left->pointer;
2541 mode = get_ir_mode_arithmetic(expression->base.type);
2542 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2543 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2544 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2545 ir_node *const no_mem = new_NoMem();
2546 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2547 mode, op_pin_state_floats);
2548 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2551 case EXPR_BINARY_SUB_ASSIGN:
2552 if (is_type_pointer(type_left)) {
2553 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2554 mode = get_ir_mode_arithmetic(type_left);
2559 case EXPR_BINARY_ADD:
2560 case EXPR_BINARY_ADD_ASSIGN:
2561 if (is_type_pointer(type_left)) {
2562 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2563 mode = get_ir_mode_arithmetic(type_left);
2565 } else if (is_type_pointer(type_right)) {
2566 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2567 mode = get_ir_mode_arithmetic(type_right);
2574 mode = get_ir_mode_arithmetic(type_right);
2575 left = create_conv(dbgi, left, mode);
2580 case EXPR_BINARY_ADD_ASSIGN:
2581 case EXPR_BINARY_ADD:
2582 return new_d_Add(dbgi, left, right, mode);
2583 case EXPR_BINARY_SUB_ASSIGN:
2584 case EXPR_BINARY_SUB:
2585 return new_d_Sub(dbgi, left, right, mode);
2586 case EXPR_BINARY_MUL_ASSIGN:
2587 case EXPR_BINARY_MUL:
2588 return new_d_Mul(dbgi, left, right, mode);
2589 case EXPR_BINARY_BITWISE_AND:
2590 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2591 return new_d_And(dbgi, left, right, mode);
2592 case EXPR_BINARY_BITWISE_OR:
2593 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2594 return new_d_Or(dbgi, left, right, mode);
2595 case EXPR_BINARY_BITWISE_XOR:
2596 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2597 return new_d_Eor(dbgi, left, right, mode);
2598 case EXPR_BINARY_SHIFTLEFT:
2599 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2600 return new_d_Shl(dbgi, left, right, mode);
2601 case EXPR_BINARY_SHIFTRIGHT:
2602 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2603 if (mode_is_signed(mode)) {
2604 return new_d_Shrs(dbgi, left, right, mode);
2606 return new_d_Shr(dbgi, left, right, mode);
2608 case EXPR_BINARY_DIV:
2609 case EXPR_BINARY_DIV_ASSIGN: {
2610 ir_node *pin = new_Pin(new_NoMem());
2611 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2612 op_pin_state_floats);
2613 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2616 case EXPR_BINARY_MOD:
2617 case EXPR_BINARY_MOD_ASSIGN: {
2618 ir_node *pin = new_Pin(new_NoMem());
2619 assert(!mode_is_float(mode));
2620 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2621 op_pin_state_floats);
2622 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2626 panic("unexpected expression kind");
2630 static ir_node *create_lazy_op(const binary_expression_t *expression)
2632 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2633 type_t *type = skip_typeref(expression->base.type);
2634 ir_mode *mode = get_ir_mode_arithmetic(type);
2636 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2637 bool val = fold_constant_to_bool(expression->left);
2638 expression_kind_t ekind = expression->base.kind;
2639 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2640 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2642 return new_Const(get_mode_null(mode));
2646 return new_Const(get_mode_one(mode));
2650 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2651 bool valr = fold_constant_to_bool(expression->right);
2652 return create_Const_from_bool(mode, valr);
2655 return produce_condition_result(expression->right, mode, dbgi);
2658 return produce_condition_result((const expression_t*) expression, mode,
2662 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2663 ir_node *right, ir_mode *mode);
2665 static ir_node *create_assign_binop(const binary_expression_t *expression)
2667 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2668 const expression_t *left_expr = expression->left;
2669 type_t *type = skip_typeref(left_expr->base.type);
2670 ir_node *right = expression_to_firm(expression->right);
2671 ir_node *left_addr = expression_to_addr(left_expr);
2672 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2673 ir_node *result = create_op(dbgi, expression, left, right);
2675 result = create_cast(dbgi, result, expression->right->base.type, type);
2676 result = do_strict_conv(dbgi, result);
2678 result = set_value_for_expression_addr(left_expr, result, left_addr);
2680 if (!is_type_compound(type)) {
2681 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2682 result = create_conv(dbgi, result, mode_arithmetic);
2687 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2689 expression_kind_t kind = expression->base.kind;
2692 case EXPR_BINARY_EQUAL:
2693 case EXPR_BINARY_NOTEQUAL:
2694 case EXPR_BINARY_LESS:
2695 case EXPR_BINARY_LESSEQUAL:
2696 case EXPR_BINARY_GREATER:
2697 case EXPR_BINARY_GREATEREQUAL:
2698 case EXPR_BINARY_ISGREATER:
2699 case EXPR_BINARY_ISGREATEREQUAL:
2700 case EXPR_BINARY_ISLESS:
2701 case EXPR_BINARY_ISLESSEQUAL:
2702 case EXPR_BINARY_ISLESSGREATER:
2703 case EXPR_BINARY_ISUNORDERED: {
2704 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2705 ir_node *left = expression_to_firm(expression->left);
2706 ir_node *right = expression_to_firm(expression->right);
2707 ir_relation relation = get_relation(kind);
2708 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2711 case EXPR_BINARY_ASSIGN: {
2712 ir_node *addr = expression_to_addr(expression->left);
2713 ir_node *right = expression_to_firm(expression->right);
2715 = set_value_for_expression_addr(expression->left, right, addr);
2717 type_t *type = skip_typeref(expression->base.type);
2718 if (!is_type_compound(type)) {
2719 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2720 res = create_conv(NULL, res, mode_arithmetic);
2724 case EXPR_BINARY_ADD:
2725 case EXPR_BINARY_SUB:
2726 case EXPR_BINARY_MUL:
2727 case EXPR_BINARY_DIV:
2728 case EXPR_BINARY_MOD:
2729 case EXPR_BINARY_BITWISE_AND:
2730 case EXPR_BINARY_BITWISE_OR:
2731 case EXPR_BINARY_BITWISE_XOR:
2732 case EXPR_BINARY_SHIFTLEFT:
2733 case EXPR_BINARY_SHIFTRIGHT:
2735 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2736 ir_node *left = expression_to_firm(expression->left);
2737 ir_node *right = expression_to_firm(expression->right);
2738 return create_op(dbgi, expression, left, right);
2740 case EXPR_BINARY_LOGICAL_AND:
2741 case EXPR_BINARY_LOGICAL_OR:
2742 return create_lazy_op(expression);
2743 case EXPR_BINARY_COMMA:
2744 /* create side effects of left side */
2745 (void) expression_to_firm(expression->left);
2746 return _expression_to_firm(expression->right);
2748 case EXPR_BINARY_ADD_ASSIGN:
2749 case EXPR_BINARY_SUB_ASSIGN:
2750 case EXPR_BINARY_MUL_ASSIGN:
2751 case EXPR_BINARY_MOD_ASSIGN:
2752 case EXPR_BINARY_DIV_ASSIGN:
2753 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2754 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2755 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2756 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2757 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2758 return create_assign_binop(expression);
2760 panic("TODO binexpr type");
2764 static ir_node *array_access_addr(const array_access_expression_t *expression)
2766 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2767 ir_node *base_addr = expression_to_firm(expression->array_ref);
2768 ir_node *offset = expression_to_firm(expression->index);
2769 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2770 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2771 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2776 static ir_node *array_access_to_firm(
2777 const array_access_expression_t *expression)
2779 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2780 ir_node *addr = array_access_addr(expression);
2781 type_t *type = revert_automatic_type_conversion(
2782 (const expression_t*) expression);
2783 type = skip_typeref(type);
2785 return deref_address(dbgi, type, addr);
2788 static long get_offsetof_offset(const offsetof_expression_t *expression)
2790 type_t *orig_type = expression->type;
2793 designator_t *designator = expression->designator;
2794 for ( ; designator != NULL; designator = designator->next) {
2795 type_t *type = skip_typeref(orig_type);
2796 /* be sure the type is constructed */
2797 (void) get_ir_type(type);
2799 if (designator->symbol != NULL) {
2800 assert(is_type_compound(type));
2801 symbol_t *symbol = designator->symbol;
2803 compound_t *compound = type->compound.compound;
2804 entity_t *iter = compound->members.entities;
2805 for ( ; iter != NULL; iter = iter->base.next) {
2806 if (iter->base.symbol == symbol) {
2810 assert(iter != NULL);
2812 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2813 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2814 offset += get_entity_offset(iter->compound_member.entity);
2816 orig_type = iter->declaration.type;
2818 expression_t *array_index = designator->array_index;
2819 assert(designator->array_index != NULL);
2820 assert(is_type_array(type));
2822 long index = fold_constant_to_int(array_index);
2823 ir_type *arr_type = get_ir_type(type);
2824 ir_type *elem_type = get_array_element_type(arr_type);
2825 long elem_size = get_type_size_bytes(elem_type);
2827 offset += index * elem_size;
2829 orig_type = type->array.element_type;
2836 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2838 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2839 long offset = get_offsetof_offset(expression);
2840 ir_tarval *tv = new_tarval_from_long(offset, mode);
2841 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2843 return new_d_Const(dbgi, tv);
2846 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2847 ir_entity *entity, type_t *type);
2848 static ir_initializer_t *create_ir_initializer(
2849 const initializer_t *initializer, type_t *type);
2851 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2852 initializer_t *initializer,
2855 /* create the ir_initializer */
2856 ir_graph *const old_current_ir_graph = current_ir_graph;
2857 current_ir_graph = get_const_code_irg();
2859 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2861 assert(current_ir_graph == get_const_code_irg());
2862 current_ir_graph = old_current_ir_graph;
2864 ident *const id = id_unique("initializer.%u");
2865 ir_type *const irtype = get_ir_type(type);
2866 ir_type *const global_type = get_glob_type();
2867 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2868 set_entity_ld_ident(entity, id);
2869 set_entity_visibility(entity, ir_visibility_private);
2870 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2871 set_entity_initializer(entity, irinitializer);
2875 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2877 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2878 type_t *type = expression->type;
2879 initializer_t *initializer = expression->initializer;
2881 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2882 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2883 return create_symconst(dbgi, entity);
2885 /* create an entity on the stack */
2886 ident *const id = id_unique("CompLit.%u");
2887 ir_type *const irtype = get_ir_type(type);
2888 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2890 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2891 set_entity_ld_ident(entity, id);
2893 /* create initialisation code */
2894 create_local_initializer(initializer, dbgi, entity, type);
2896 /* create a sel for the compound literal address */
2897 ir_node *frame = get_irg_frame(current_ir_graph);
2898 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2903 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2905 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2906 type_t *const type = expr->type;
2907 ir_node *const addr = compound_literal_addr(expr);
2908 return deref_address(dbgi, type, addr);
2912 * Transform a sizeof expression into Firm code.
2914 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2916 type_t *const type = skip_typeref(expression->type);
2917 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2918 if (is_type_array(type) && type->array.is_vla
2919 && expression->tp_expression != NULL) {
2920 expression_to_firm(expression->tp_expression);
2922 /* strange gnu extensions: sizeof(function) == 1 */
2923 if (is_type_function(type)) {
2924 ir_mode *mode = get_ir_mode_storage(type_size_t);
2925 return new_Const(get_mode_one(mode));
2928 return get_type_size_node(type);
2931 static entity_t *get_expression_entity(const expression_t *expression)
2933 if (expression->kind != EXPR_REFERENCE)
2936 return expression->reference.entity;
2939 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2941 switch(entity->kind) {
2942 case DECLARATION_KIND_CASES:
2943 return entity->declaration.alignment;
2946 return entity->compound.alignment;
2947 case ENTITY_TYPEDEF:
2948 return entity->typedefe.alignment;
2956 * Transform an alignof expression into Firm code.
2958 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2960 unsigned alignment = 0;
2962 const expression_t *tp_expression = expression->tp_expression;
2963 if (tp_expression != NULL) {
2964 entity_t *entity = get_expression_entity(tp_expression);
2965 if (entity != NULL) {
2966 if (entity->kind == ENTITY_FUNCTION) {
2967 /* a gnu-extension */
2970 alignment = get_cparser_entity_alignment(entity);
2975 if (alignment == 0) {
2976 type_t *type = expression->type;
2977 alignment = get_type_alignment(type);
2980 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2981 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2982 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2983 return new_d_Const(dbgi, tv);
2986 static void init_ir_types(void);
2988 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2990 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2992 bool constant_folding_old = constant_folding;
2993 constant_folding = true;
2994 int old_optimize = get_optimize();
2995 int old_constant_folding = get_opt_constant_folding();
2997 set_opt_constant_folding(1);
3001 ir_graph *old_current_ir_graph = current_ir_graph;
3002 current_ir_graph = get_const_code_irg();
3004 ir_node *cnst = expression_to_firm(expression);
3005 current_ir_graph = old_current_ir_graph;
3006 set_optimize(old_optimize);
3007 set_opt_constant_folding(old_constant_folding);
3009 if (!is_Const(cnst)) {
3010 panic("couldn't fold constant");
3013 constant_folding = constant_folding_old;
3015 return get_Const_tarval(cnst);
3018 /* this function is only used in parser.c, but it relies on libfirm functionality */
3019 bool constant_is_negative(const expression_t *expression)
3021 ir_tarval *tv = fold_constant_to_tarval(expression);
3022 return tarval_is_negative(tv);
3025 long fold_constant_to_int(const expression_t *expression)
3027 ir_tarval *tv = fold_constant_to_tarval(expression);
3028 if (!tarval_is_long(tv)) {
3029 panic("result of constant folding is not integer");
3032 return get_tarval_long(tv);
3035 bool fold_constant_to_bool(const expression_t *expression)
3037 ir_tarval *tv = fold_constant_to_tarval(expression);
3038 return !tarval_is_null(tv);
3041 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3043 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3045 /* first try to fold a constant condition */
3046 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3047 bool val = fold_constant_to_bool(expression->condition);
3049 expression_t *true_expression = expression->true_expression;
3050 if (true_expression == NULL)
3051 true_expression = expression->condition;
3052 return expression_to_firm(true_expression);
3054 return expression_to_firm(expression->false_expression);
3058 ir_node *const true_block = new_immBlock();
3059 ir_node *const false_block = new_immBlock();
3060 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3061 mature_immBlock(true_block);
3062 mature_immBlock(false_block);
3064 set_cur_block(true_block);
3066 if (expression->true_expression != NULL) {
3067 true_val = expression_to_firm(expression->true_expression);
3068 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3069 true_val = cond_expr;
3071 /* Condition ended with a short circuit (&&, ||, !) operation or a
3072 * comparison. Generate a "1" as value for the true branch. */
3073 true_val = new_Const(get_mode_one(mode_Is));
3075 ir_node *const true_jmp = new_d_Jmp(dbgi);
3077 set_cur_block(false_block);
3078 ir_node *const false_val = expression_to_firm(expression->false_expression);
3079 ir_node *const false_jmp = new_d_Jmp(dbgi);
3081 /* create the common block */
3082 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3083 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3084 set_cur_block(block);
3086 /* TODO improve static semantics, so either both or no values are NULL */
3087 if (true_val == NULL || false_val == NULL)
3090 ir_node *const in[2] = { true_val, false_val };
3091 type_t *const type = skip_typeref(expression->base.type);
3093 if (is_type_compound(type)) {
3096 mode = get_ir_mode_arithmetic(type);
3098 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3104 * Returns an IR-node representing the address of a field.
3106 static ir_node *select_addr(const select_expression_t *expression)
3108 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3110 construct_select_compound(expression);
3112 ir_node *compound_addr = expression_to_firm(expression->compound);
3114 entity_t *entry = expression->compound_entry;
3115 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3116 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3118 if (constant_folding) {
3119 ir_mode *mode = get_irn_mode(compound_addr);
3120 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3121 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3122 return new_d_Add(dbgi, compound_addr, ofs, mode);
3124 ir_entity *irentity = entry->compound_member.entity;
3125 assert(irentity != NULL);
3126 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3130 static ir_node *select_to_firm(const select_expression_t *expression)
3132 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3133 ir_node *addr = select_addr(expression);
3134 type_t *type = revert_automatic_type_conversion(
3135 (const expression_t*) expression);
3136 type = skip_typeref(type);
3138 entity_t *entry = expression->compound_entry;
3139 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3141 if (entry->compound_member.bitfield) {
3142 return bitfield_extract_to_firm(expression, addr);
3145 return deref_address(dbgi, type, addr);
3148 /* Values returned by __builtin_classify_type. */
3149 typedef enum gcc_type_class
3155 enumeral_type_class,
3158 reference_type_class,
3162 function_type_class,
3173 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3175 type_t *type = expr->type_expression->base.type;
3177 /* FIXME gcc returns different values depending on whether compiling C or C++
3178 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3181 type = skip_typeref(type);
3182 switch (type->kind) {
3184 const atomic_type_t *const atomic_type = &type->atomic;
3185 switch (atomic_type->akind) {
3186 /* should not be reached */
3187 case ATOMIC_TYPE_INVALID:
3191 /* gcc cannot do that */
3192 case ATOMIC_TYPE_VOID:
3193 tc = void_type_class;
3196 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3197 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3198 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3199 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3200 case ATOMIC_TYPE_SHORT:
3201 case ATOMIC_TYPE_USHORT:
3202 case ATOMIC_TYPE_INT:
3203 case ATOMIC_TYPE_UINT:
3204 case ATOMIC_TYPE_LONG:
3205 case ATOMIC_TYPE_ULONG:
3206 case ATOMIC_TYPE_LONGLONG:
3207 case ATOMIC_TYPE_ULONGLONG:
3208 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3209 tc = integer_type_class;
3212 case ATOMIC_TYPE_FLOAT:
3213 case ATOMIC_TYPE_DOUBLE:
3214 case ATOMIC_TYPE_LONG_DOUBLE:
3215 tc = real_type_class;
3218 panic("Unexpected atomic type in classify_type_to_firm().");
3221 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3222 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3223 case TYPE_ARRAY: /* gcc handles this as pointer */
3224 case TYPE_FUNCTION: /* gcc handles this as pointer */
3225 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3226 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3227 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3229 /* gcc handles this as integer */
3230 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3232 /* gcc classifies the referenced type */
3233 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3235 /* typedef/typeof should be skipped already */
3241 panic("unexpected TYPE classify_type_to_firm().");
3245 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3246 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3247 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3248 return new_d_Const(dbgi, tv);
3251 static ir_node *function_name_to_firm(
3252 const funcname_expression_t *const expr)
3254 switch(expr->kind) {
3255 case FUNCNAME_FUNCTION:
3256 case FUNCNAME_PRETTY_FUNCTION:
3257 case FUNCNAME_FUNCDNAME:
3258 if (current_function_name == NULL) {
3259 const source_position_t *const src_pos = &expr->base.source_position;
3260 const char *name = current_function_entity->base.symbol->string;
3261 const string_t string = { name, strlen(name) + 1 };
3262 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3264 return current_function_name;
3265 case FUNCNAME_FUNCSIG:
3266 if (current_funcsig == NULL) {
3267 const source_position_t *const src_pos = &expr->base.source_position;
3268 ir_entity *ent = get_irg_entity(current_ir_graph);
3269 const char *const name = get_entity_ld_name(ent);
3270 const string_t string = { name, strlen(name) + 1 };
3271 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3273 return current_funcsig;
3275 panic("Unsupported function name");
3278 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3280 statement_t *statement = expr->statement;
3282 assert(statement->kind == STATEMENT_COMPOUND);
3283 return compound_statement_to_firm(&statement->compound);
3286 static ir_node *va_start_expression_to_firm(
3287 const va_start_expression_t *const expr)
3289 ir_entity *param_ent = current_vararg_entity;
3290 if (param_ent == NULL) {
3291 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3292 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3293 ir_type *const param_type = get_unknown_type();
3294 param_ent = new_parameter_entity(frame_type, n, param_type);
3295 current_vararg_entity = param_ent;
3298 ir_node *const frame = get_irg_frame(current_ir_graph);
3299 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3300 ir_node *const no_mem = new_NoMem();
3301 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3303 set_value_for_expression(expr->ap, arg_sel);
3308 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3310 type_t *const type = expr->base.type;
3311 expression_t *const ap_expr = expr->ap;
3312 ir_node *const ap_addr = expression_to_addr(ap_expr);
3313 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3314 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3315 ir_node *const res = deref_address(dbgi, type, ap);
3317 ir_node *const cnst = get_type_size_node(expr->base.type);
3318 ir_mode *const mode = get_irn_mode(cnst);
3319 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3320 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3321 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3322 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3323 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3325 set_value_for_expression_addr(ap_expr, add, ap_addr);
3331 * Generate Firm for a va_copy expression.
3333 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3335 ir_node *const src = expression_to_firm(expr->src);
3336 set_value_for_expression(expr->dst, src);
3340 static ir_node *dereference_addr(const unary_expression_t *const expression)
3342 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3343 return expression_to_firm(expression->value);
3347 * Returns a IR-node representing an lvalue of the given expression.
3349 static ir_node *expression_to_addr(const expression_t *expression)
3351 switch(expression->kind) {
3352 case EXPR_ARRAY_ACCESS:
3353 return array_access_addr(&expression->array_access);
3355 return call_expression_to_firm(&expression->call);
3356 case EXPR_COMPOUND_LITERAL:
3357 return compound_literal_addr(&expression->compound_literal);
3358 case EXPR_REFERENCE:
3359 return reference_addr(&expression->reference);
3361 return select_addr(&expression->select);
3362 case EXPR_UNARY_DEREFERENCE:
3363 return dereference_addr(&expression->unary);
3367 panic("trying to get address of non-lvalue");
3370 static ir_node *builtin_constant_to_firm(
3371 const builtin_constant_expression_t *expression)
3373 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3374 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3375 return create_Const_from_bool(mode, v);
3378 static ir_node *builtin_types_compatible_to_firm(
3379 const builtin_types_compatible_expression_t *expression)
3381 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3382 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3383 bool const value = types_compatible(left, right);
3384 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3385 return create_Const_from_bool(mode, value);
3388 static ir_node *get_label_block(label_t *label)
3390 if (label->block != NULL)
3391 return label->block;
3393 /* beware: might be called from create initializer with current_ir_graph
3394 * set to const_code_irg. */
3395 ir_graph *rem = current_ir_graph;
3396 current_ir_graph = current_function;
3398 ir_node *block = new_immBlock();
3400 label->block = block;
3402 ARR_APP1(label_t *, all_labels, label);
3404 current_ir_graph = rem;
3409 * Pointer to a label. This is used for the
3410 * GNU address-of-label extension.
3412 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3414 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3415 ir_node *block = get_label_block(label->label);
3416 ir_entity *entity = create_Block_entity(block);
3418 symconst_symbol value;
3419 value.entity_p = entity;
3420 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3424 * creates firm nodes for an expression. The difference between this function
3425 * and expression_to_firm is, that this version might produce mode_b nodes
3426 * instead of mode_Is.
3428 static ir_node *_expression_to_firm(expression_t const *const expr)
3431 if (!constant_folding) {
3432 assert(!expr->base.transformed);
3433 ((expression_t*)expr)->base.transformed = true;
3437 switch (expr->kind) {
3438 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3439 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3440 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3441 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3442 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3443 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3444 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3445 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3446 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3447 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3448 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3449 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3450 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3451 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3452 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3453 case EXPR_SELECT: return select_to_firm( &expr->select);
3454 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3455 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3456 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3457 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3458 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3459 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3460 case EXPR_WIDE_STRING_LITERAL: return wide_string_literal_to_firm( &expr->string_literal);
3462 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->literal.value);
3464 case EXPR_ERROR: break;
3466 panic("invalid expression found");
3470 * Check if a given expression is a GNU __builtin_expect() call.
3472 static bool is_builtin_expect(const expression_t *expression)
3474 if (expression->kind != EXPR_CALL)
3477 expression_t *function = expression->call.function;
3478 if (function->kind != EXPR_REFERENCE)
3480 reference_expression_t *ref = &function->reference;
3481 if (ref->entity->kind != ENTITY_FUNCTION ||
3482 ref->entity->function.btk != BUILTIN_EXPECT)
3488 static bool produces_mode_b(const expression_t *expression)
3490 switch (expression->kind) {
3491 case EXPR_BINARY_EQUAL:
3492 case EXPR_BINARY_NOTEQUAL:
3493 case EXPR_BINARY_LESS:
3494 case EXPR_BINARY_LESSEQUAL:
3495 case EXPR_BINARY_GREATER:
3496 case EXPR_BINARY_GREATEREQUAL:
3497 case EXPR_BINARY_ISGREATER:
3498 case EXPR_BINARY_ISGREATEREQUAL:
3499 case EXPR_BINARY_ISLESS:
3500 case EXPR_BINARY_ISLESSEQUAL:
3501 case EXPR_BINARY_ISLESSGREATER:
3502 case EXPR_BINARY_ISUNORDERED:
3503 case EXPR_UNARY_NOT:
3507 if (is_builtin_expect(expression)) {
3508 expression_t *argument = expression->call.arguments->expression;
3509 return produces_mode_b(argument);
3512 case EXPR_BINARY_COMMA:
3513 return produces_mode_b(expression->binary.right);
3520 static ir_node *expression_to_firm(const expression_t *expression)
3522 if (!produces_mode_b(expression)) {
3523 ir_node *res = _expression_to_firm(expression);
3524 assert(res == NULL || get_irn_mode(res) != mode_b);
3528 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3529 bool const constant_folding_old = constant_folding;
3530 constant_folding = true;
3531 ir_node *res = _expression_to_firm(expression);
3532 constant_folding = constant_folding_old;
3533 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3534 assert(is_Const(res));
3535 return create_Const_from_bool(mode, !is_Const_null(res));
3538 /* we have to produce a 0/1 from the mode_b expression */
3539 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3540 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3541 return produce_condition_result(expression, mode, dbgi);
3545 * create a short-circuit expression evaluation that tries to construct
3546 * efficient control flow structures for &&, || and ! expressions
3548 static ir_node *create_condition_evaluation(const expression_t *expression,
3549 ir_node *true_block,
3550 ir_node *false_block)
3552 switch(expression->kind) {
3553 case EXPR_UNARY_NOT: {
3554 const unary_expression_t *unary_expression = &expression->unary;
3555 create_condition_evaluation(unary_expression->value, false_block,
3559 case EXPR_BINARY_LOGICAL_AND: {
3560 const binary_expression_t *binary_expression = &expression->binary;
3562 ir_node *extra_block = new_immBlock();
3563 create_condition_evaluation(binary_expression->left, extra_block,
3565 mature_immBlock(extra_block);
3566 set_cur_block(extra_block);
3567 create_condition_evaluation(binary_expression->right, true_block,
3571 case EXPR_BINARY_LOGICAL_OR: {
3572 const binary_expression_t *binary_expression = &expression->binary;
3574 ir_node *extra_block = new_immBlock();
3575 create_condition_evaluation(binary_expression->left, true_block,
3577 mature_immBlock(extra_block);
3578 set_cur_block(extra_block);
3579 create_condition_evaluation(binary_expression->right, true_block,
3587 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3588 ir_node *cond_expr = _expression_to_firm(expression);
3589 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3590 ir_node *cond = new_d_Cond(dbgi, condition);
3591 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3592 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3594 /* set branch prediction info based on __builtin_expect */
3595 if (is_builtin_expect(expression) && is_Cond(cond)) {
3596 call_argument_t *argument = expression->call.arguments->next;
3597 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3598 bool const cnst = fold_constant_to_bool(argument->expression);
3599 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3600 set_Cond_jmp_pred(cond, pred);
3604 add_immBlock_pred(true_block, true_proj);
3605 add_immBlock_pred(false_block, false_proj);
3607 set_unreachable_now();
3611 static void create_variable_entity(entity_t *variable,
3612 declaration_kind_t declaration_kind,
3613 ir_type *parent_type)
3615 assert(variable->kind == ENTITY_VARIABLE);
3616 type_t *type = skip_typeref(variable->declaration.type);
3618 ident *const id = new_id_from_str(variable->base.symbol->string);
3619 ir_type *const irtype = get_ir_type(type);
3620 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3621 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3622 unsigned alignment = variable->declaration.alignment;
3624 set_entity_alignment(irentity, alignment);
3626 handle_decl_modifiers(irentity, variable);
3628 variable->declaration.kind = (unsigned char) declaration_kind;
3629 variable->variable.v.entity = irentity;
3630 set_entity_ld_ident(irentity, create_ld_ident(variable));
3632 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3633 set_entity_volatility(irentity, volatility_is_volatile);
3638 typedef struct type_path_entry_t type_path_entry_t;
3639 struct type_path_entry_t {
3641 ir_initializer_t *initializer;
3643 entity_t *compound_entry;
3646 typedef struct type_path_t type_path_t;
3647 struct type_path_t {
3648 type_path_entry_t *path;
3653 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3655 size_t len = ARR_LEN(path->path);
3657 for (size_t i = 0; i < len; ++i) {
3658 const type_path_entry_t *entry = & path->path[i];
3660 type_t *type = skip_typeref(entry->type);
3661 if (is_type_compound(type)) {
3662 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3663 } else if (is_type_array(type)) {
3664 fprintf(stderr, "[%u]", (unsigned) entry->index);
3666 fprintf(stderr, "-INVALID-");
3669 fprintf(stderr, " (");
3670 print_type(path->top_type);
3671 fprintf(stderr, ")");
3674 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3676 size_t len = ARR_LEN(path->path);
3678 return & path->path[len-1];
3681 static type_path_entry_t *append_to_type_path(type_path_t *path)
3683 size_t len = ARR_LEN(path->path);
3684 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3686 type_path_entry_t *result = & path->path[len];
3687 memset(result, 0, sizeof(result[0]));
3691 static size_t get_compound_member_count(const compound_type_t *type)
3693 compound_t *compound = type->compound;
3694 size_t n_members = 0;
3695 entity_t *member = compound->members.entities;
3696 for ( ; member != NULL; member = member->base.next) {
3703 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3705 type_t *orig_top_type = path->top_type;
3706 type_t *top_type = skip_typeref(orig_top_type);
3708 assert(is_type_compound(top_type) || is_type_array(top_type));
3710 if (ARR_LEN(path->path) == 0) {
3713 type_path_entry_t *top = get_type_path_top(path);
3714 ir_initializer_t *initializer = top->initializer;
3715 return get_initializer_compound_value(initializer, top->index);
3719 static void descend_into_subtype(type_path_t *path)
3721 type_t *orig_top_type = path->top_type;
3722 type_t *top_type = skip_typeref(orig_top_type);
3724 assert(is_type_compound(top_type) || is_type_array(top_type));
3726 ir_initializer_t *initializer = get_initializer_entry(path);
3728 type_path_entry_t *top = append_to_type_path(path);
3729 top->type = top_type;
3733 if (is_type_compound(top_type)) {
3734 compound_t *const compound = top_type->compound.compound;
3735 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3737 top->compound_entry = entry;
3739 len = get_compound_member_count(&top_type->compound);
3740 if (entry != NULL) {
3741 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3742 path->top_type = entry->declaration.type;
3745 assert(is_type_array(top_type));
3746 assert(top_type->array.size > 0);
3749 path->top_type = top_type->array.element_type;
3750 len = top_type->array.size;
3752 if (initializer == NULL
3753 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3754 initializer = create_initializer_compound(len);
3755 /* we have to set the entry at the 2nd latest path entry... */
3756 size_t path_len = ARR_LEN(path->path);
3757 assert(path_len >= 1);
3759 type_path_entry_t *entry = & path->path[path_len-2];
3760 ir_initializer_t *tinitializer = entry->initializer;
3761 set_initializer_compound_value(tinitializer, entry->index,
3765 top->initializer = initializer;
3768 static void ascend_from_subtype(type_path_t *path)
3770 type_path_entry_t *top = get_type_path_top(path);
3772 path->top_type = top->type;
3774 size_t len = ARR_LEN(path->path);
3775 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3778 static void walk_designator(type_path_t *path, const designator_t *designator)
3780 /* designators start at current object type */
3781 ARR_RESIZE(type_path_entry_t, path->path, 1);
3783 for ( ; designator != NULL; designator = designator->next) {
3784 type_path_entry_t *top = get_type_path_top(path);
3785 type_t *orig_type = top->type;
3786 type_t *type = skip_typeref(orig_type);
3788 if (designator->symbol != NULL) {
3789 assert(is_type_compound(type));
3791 symbol_t *symbol = designator->symbol;
3793 compound_t *compound = type->compound.compound;
3794 entity_t *iter = compound->members.entities;
3795 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3796 if (iter->base.symbol == symbol) {
3797 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3801 assert(iter != NULL);
3803 /* revert previous initialisations of other union elements */
3804 if (type->kind == TYPE_COMPOUND_UNION) {
3805 ir_initializer_t *initializer = top->initializer;
3806 if (initializer != NULL
3807 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3808 /* are we writing to a new element? */
3809 ir_initializer_t *oldi
3810 = get_initializer_compound_value(initializer, index);
3811 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3812 /* clear initializer */
3814 = get_initializer_compound_n_entries(initializer);
3815 ir_initializer_t *nulli = get_initializer_null();
3816 for (size_t i = 0; i < len; ++i) {
3817 set_initializer_compound_value(initializer, i,
3824 top->type = orig_type;
3825 top->compound_entry = iter;
3827 orig_type = iter->declaration.type;
3829 expression_t *array_index = designator->array_index;
3830 assert(designator->array_index != NULL);
3831 assert(is_type_array(type));
3833 long index = fold_constant_to_int(array_index);
3836 if (type->array.size_constant) {
3837 long array_size = type->array.size;
3838 assert(index < array_size);
3842 top->type = orig_type;
3843 top->index = (size_t) index;
3844 orig_type = type->array.element_type;
3846 path->top_type = orig_type;
3848 if (designator->next != NULL) {
3849 descend_into_subtype(path);
3853 path->invalid = false;
3856 static void advance_current_object(type_path_t *path)
3858 if (path->invalid) {
3859 /* TODO: handle this... */
3860 panic("invalid initializer in ast2firm (excessive elements)");
3863 type_path_entry_t *top = get_type_path_top(path);
3865 type_t *type = skip_typeref(top->type);
3866 if (is_type_union(type)) {
3867 /* only the first element is initialized in unions */
3868 top->compound_entry = NULL;
3869 } else if (is_type_struct(type)) {
3870 entity_t *entry = top->compound_entry;
3873 entry = skip_unnamed_bitfields(entry->base.next);
3874 top->compound_entry = entry;
3875 if (entry != NULL) {
3876 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3877 path->top_type = entry->declaration.type;
3881 assert(is_type_array(type));
3884 if (!type->array.size_constant || top->index < type->array.size) {
3889 /* we're past the last member of the current sub-aggregate, try if we
3890 * can ascend in the type hierarchy and continue with another subobject */
3891 size_t len = ARR_LEN(path->path);
3894 ascend_from_subtype(path);
3895 advance_current_object(path);
3897 path->invalid = true;
3902 static ir_initializer_t *create_ir_initializer_value(
3903 const initializer_value_t *initializer)
3905 if (is_type_compound(initializer->value->base.type)) {
3906 panic("initializer creation for compounds not implemented yet");
3908 type_t *type = initializer->value->base.type;
3909 expression_t *expr = initializer->value;
3910 ir_node *value = expression_to_firm(expr);
3911 ir_mode *mode = get_ir_mode_storage(type);
3912 value = create_conv(NULL, value, mode);
3913 return create_initializer_const(value);
3916 /** test wether type can be initialized by a string constant */
3917 static bool is_string_type(type_t *type)
3920 if (is_type_pointer(type)) {
3921 inner = skip_typeref(type->pointer.points_to);
3922 } else if(is_type_array(type)) {
3923 inner = skip_typeref(type->array.element_type);
3928 return is_type_integer(inner);
3931 static ir_initializer_t *create_ir_initializer_list(
3932 const initializer_list_t *initializer, type_t *type)
3935 memset(&path, 0, sizeof(path));
3936 path.top_type = type;
3937 path.path = NEW_ARR_F(type_path_entry_t, 0);
3939 descend_into_subtype(&path);
3941 for (size_t i = 0; i < initializer->len; ++i) {
3942 const initializer_t *sub_initializer = initializer->initializers[i];
3944 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3945 walk_designator(&path, sub_initializer->designator.designator);
3949 if (sub_initializer->kind == INITIALIZER_VALUE) {
3950 /* we might have to descend into types until we're at a scalar
3953 type_t *orig_top_type = path.top_type;
3954 type_t *top_type = skip_typeref(orig_top_type);
3956 if (is_type_scalar(top_type))
3958 descend_into_subtype(&path);
3960 } else if (sub_initializer->kind == INITIALIZER_STRING
3961 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3962 /* we might have to descend into types until we're at a scalar
3965 type_t *orig_top_type = path.top_type;
3966 type_t *top_type = skip_typeref(orig_top_type);
3968 if (is_string_type(top_type))
3970 descend_into_subtype(&path);
3974 ir_initializer_t *sub_irinitializer
3975 = create_ir_initializer(sub_initializer, path.top_type);
3977 size_t path_len = ARR_LEN(path.path);
3978 assert(path_len >= 1);
3979 type_path_entry_t *entry = & path.path[path_len-1];
3980 ir_initializer_t *tinitializer = entry->initializer;
3981 set_initializer_compound_value(tinitializer, entry->index,
3984 advance_current_object(&path);
3987 assert(ARR_LEN(path.path) >= 1);
3988 ir_initializer_t *result = path.path[0].initializer;
3989 DEL_ARR_F(path.path);
3994 static ir_initializer_t *create_ir_initializer_string(
3995 const initializer_string_t *initializer, type_t *type)
3997 type = skip_typeref(type);
3999 size_t string_len = initializer->string.size;
4000 assert(type->kind == TYPE_ARRAY);
4001 assert(type->array.size_constant);
4002 size_t len = type->array.size;
4003 ir_initializer_t *irinitializer = create_initializer_compound(len);
4005 const char *string = initializer->string.begin;
4006 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
4008 for (size_t i = 0; i < len; ++i) {
4013 ir_tarval *tv = new_tarval_from_long(c, mode);
4014 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4016 set_initializer_compound_value(irinitializer, i, char_initializer);
4019 return irinitializer;
4022 static ir_initializer_t *create_ir_initializer_wide_string(
4023 const initializer_wide_string_t *initializer, type_t *type)
4025 assert(type->kind == TYPE_ARRAY);
4026 assert(type->array.size_constant);
4027 size_t len = type->array.size;
4028 size_t string_len = wstrlen(&initializer->string);
4029 ir_initializer_t *irinitializer = create_initializer_compound(len);
4031 const char *p = initializer->string.begin;
4032 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4034 for (size_t i = 0; i < len; ++i) {
4036 if (i < string_len) {
4037 c = read_utf8_char(&p);
4039 ir_tarval *tv = new_tarval_from_long(c, mode);
4040 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4042 set_initializer_compound_value(irinitializer, i, char_initializer);
4045 return irinitializer;
4048 static ir_initializer_t *create_ir_initializer(
4049 const initializer_t *initializer, type_t *type)
4051 switch(initializer->kind) {
4052 case INITIALIZER_STRING:
4053 return create_ir_initializer_string(&initializer->string, type);
4055 case INITIALIZER_WIDE_STRING:
4056 return create_ir_initializer_wide_string(&initializer->wide_string,
4059 case INITIALIZER_LIST:
4060 return create_ir_initializer_list(&initializer->list, type);
4062 case INITIALIZER_VALUE:
4063 return create_ir_initializer_value(&initializer->value);
4065 case INITIALIZER_DESIGNATOR:
4066 panic("unexpected designator initializer found");
4068 panic("unknown initializer");
4071 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4072 * are elements [...] the remainder of the aggregate shall be initialized
4073 * implicitly the same as objects that have static storage duration. */
4074 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4077 /* for unions we must NOT do anything for null initializers */
4078 ir_type *owner = get_entity_owner(entity);
4079 if (is_Union_type(owner)) {
4083 ir_type *ent_type = get_entity_type(entity);
4084 /* create sub-initializers for a compound type */
4085 if (is_compound_type(ent_type)) {
4086 unsigned n_members = get_compound_n_members(ent_type);
4087 for (unsigned n = 0; n < n_members; ++n) {
4088 ir_entity *member = get_compound_member(ent_type, n);
4089 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4091 create_dynamic_null_initializer(member, dbgi, addr);
4095 if (is_Array_type(ent_type)) {
4096 assert(has_array_upper_bound(ent_type, 0));
4097 long n = get_array_upper_bound_int(ent_type, 0);
4098 for (long i = 0; i < n; ++i) {
4099 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4100 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4101 ir_node *cnst = new_d_Const(dbgi, index_tv);
4102 ir_node *in[1] = { cnst };
4103 ir_entity *arrent = get_array_element_entity(ent_type);
4104 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4106 create_dynamic_null_initializer(arrent, dbgi, addr);
4111 ir_mode *value_mode = get_type_mode(ent_type);
4112 ir_node *node = new_Const(get_mode_null(value_mode));
4114 /* is it a bitfield type? */
4115 if (is_Primitive_type(ent_type) &&
4116 get_primitive_base_type(ent_type) != NULL) {
4117 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4121 ir_node *mem = get_store();
4122 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4123 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4127 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4128 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4130 switch(get_initializer_kind(initializer)) {
4131 case IR_INITIALIZER_NULL:
4132 create_dynamic_null_initializer(entity, dbgi, base_addr);
4134 case IR_INITIALIZER_CONST: {
4135 ir_node *node = get_initializer_const_value(initializer);
4136 ir_type *ent_type = get_entity_type(entity);
4138 /* is it a bitfield type? */
4139 if (is_Primitive_type(ent_type) &&
4140 get_primitive_base_type(ent_type) != NULL) {
4141 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4145 assert(get_type_mode(type) == get_irn_mode(node));
4146 ir_node *mem = get_store();
4147 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4148 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4152 case IR_INITIALIZER_TARVAL: {
4153 ir_tarval *tv = get_initializer_tarval_value(initializer);
4154 ir_node *cnst = new_d_Const(dbgi, tv);
4155 ir_type *ent_type = get_entity_type(entity);
4157 /* is it a bitfield type? */
4158 if (is_Primitive_type(ent_type) &&
4159 get_primitive_base_type(ent_type) != NULL) {
4160 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4164 assert(get_type_mode(type) == get_tarval_mode(tv));
4165 ir_node *mem = get_store();
4166 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4167 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4171 case IR_INITIALIZER_COMPOUND: {
4172 assert(is_compound_type(type) || is_Array_type(type));
4174 if (is_Array_type(type)) {
4175 assert(has_array_upper_bound(type, 0));
4176 n_members = get_array_upper_bound_int(type, 0);
4178 n_members = get_compound_n_members(type);
4181 if (get_initializer_compound_n_entries(initializer)
4182 != (unsigned) n_members)
4183 panic("initializer doesn't match compound type");
4185 for (int i = 0; i < n_members; ++i) {
4188 ir_entity *sub_entity;
4189 if (is_Array_type(type)) {
4190 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4191 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4192 ir_node *cnst = new_d_Const(dbgi, index_tv);
4193 ir_node *in[1] = { cnst };
4194 irtype = get_array_element_type(type);
4195 sub_entity = get_array_element_entity(type);
4196 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4199 sub_entity = get_compound_member(type, i);
4200 irtype = get_entity_type(sub_entity);
4201 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4205 ir_initializer_t *sub_init
4206 = get_initializer_compound_value(initializer, i);
4208 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4215 panic("invalid IR_INITIALIZER found");
4218 static void create_dynamic_initializer(ir_initializer_t *initializer,
4219 dbg_info *dbgi, ir_entity *entity)
4221 ir_node *frame = get_irg_frame(current_ir_graph);
4222 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4223 ir_type *type = get_entity_type(entity);
4225 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4228 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4229 ir_entity *entity, type_t *type)
4231 ir_node *memory = get_store();
4232 ir_node *nomem = new_NoMem();
4233 ir_node *frame = get_irg_frame(current_ir_graph);
4234 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4236 if (initializer->kind == INITIALIZER_VALUE) {
4237 initializer_value_t *initializer_value = &initializer->value;
4239 ir_node *value = expression_to_firm(initializer_value->value);
4240 type = skip_typeref(type);
4241 assign_value(dbgi, addr, type, value);
4245 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4246 ir_initializer_t *irinitializer
4247 = create_ir_initializer(initializer, type);
4249 create_dynamic_initializer(irinitializer, dbgi, entity);
4253 /* create a "template" entity which is copied to the entity on the stack */
4254 ir_entity *const init_entity
4255 = create_initializer_entity(dbgi, initializer, type);
4256 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4257 ir_type *const irtype = get_ir_type(type);
4258 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4260 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4261 set_store(copyb_mem);
4264 static void create_initializer_local_variable_entity(entity_t *entity)
4266 assert(entity->kind == ENTITY_VARIABLE);
4267 initializer_t *initializer = entity->variable.initializer;
4268 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4269 ir_entity *irentity = entity->variable.v.entity;
4270 type_t *type = entity->declaration.type;
4272 create_local_initializer(initializer, dbgi, irentity, type);
4275 static void create_variable_initializer(entity_t *entity)
4277 assert(entity->kind == ENTITY_VARIABLE);
4278 initializer_t *initializer = entity->variable.initializer;
4279 if (initializer == NULL)
4282 declaration_kind_t declaration_kind
4283 = (declaration_kind_t) entity->declaration.kind;
4284 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4285 create_initializer_local_variable_entity(entity);
4289 type_t *type = entity->declaration.type;
4290 type_qualifiers_t tq = get_type_qualifier(type, true);
4292 if (initializer->kind == INITIALIZER_VALUE) {
4293 initializer_value_t *initializer_value = &initializer->value;
4294 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4295 expression_t *value = initializer_value->value;
4296 type_t *init_type = value->base.type;
4297 type_t *skipped = skip_typeref(init_type);
4299 if (!is_type_scalar(skipped)) {
4301 while (value->kind == EXPR_UNARY_CAST)
4302 value = value->unary.value;
4304 if (value->kind != EXPR_COMPOUND_LITERAL)
4305 panic("expected non-scalar initializer to be a compound literal");
4306 initializer = value->compound_literal.initializer;
4307 goto have_initializer;
4310 ir_node *node = expression_to_firm(initializer_value->value);
4312 ir_mode *mode = get_ir_mode_storage(init_type);
4313 node = create_conv(dbgi, node, mode);
4314 node = do_strict_conv(dbgi, node);
4316 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4317 set_value(entity->variable.v.value_number, node);
4319 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4321 ir_entity *irentity = entity->variable.v.entity;
4323 if (tq & TYPE_QUALIFIER_CONST
4324 && get_entity_owner(irentity) != get_tls_type()) {
4325 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4327 set_atomic_ent_value(irentity, node);
4331 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4332 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4334 ir_entity *irentity = entity->variable.v.entity;
4335 ir_initializer_t *irinitializer
4336 = create_ir_initializer(initializer, type);
4338 if (tq & TYPE_QUALIFIER_CONST) {
4339 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4341 set_entity_initializer(irentity, irinitializer);
4345 static void create_variable_length_array(entity_t *entity)
4347 assert(entity->kind == ENTITY_VARIABLE);
4348 assert(entity->variable.initializer == NULL);
4350 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4351 entity->variable.v.vla_base = NULL;
4353 /* TODO: record VLA somewhere so we create the free node when we leave
4357 static void allocate_variable_length_array(entity_t *entity)
4359 assert(entity->kind == ENTITY_VARIABLE);
4360 assert(entity->variable.initializer == NULL);
4361 assert(currently_reachable());
4363 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4364 type_t *type = entity->declaration.type;
4365 ir_type *el_type = get_ir_type(type->array.element_type);
4367 /* make sure size_node is calculated */
4368 get_type_size_node(type);
4369 ir_node *elems = type->array.size_node;
4370 ir_node *mem = get_store();
4371 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4373 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4374 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4377 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4378 entity->variable.v.vla_base = addr;
4382 * Creates a Firm local variable from a declaration.
4384 static void create_local_variable(entity_t *entity)
4386 assert(entity->kind == ENTITY_VARIABLE);
4387 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4389 bool needs_entity = entity->variable.address_taken;
4390 type_t *type = skip_typeref(entity->declaration.type);
4392 /* is it a variable length array? */
4393 if (is_type_array(type) && !type->array.size_constant) {
4394 create_variable_length_array(entity);
4396 } else if (is_type_array(type) || is_type_compound(type)) {
4397 needs_entity = true;
4398 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4399 needs_entity = true;
4403 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4404 create_variable_entity(entity,
4405 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4408 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4409 entity->variable.v.value_number = next_value_number_function;
4410 set_irg_loc_description(current_ir_graph, next_value_number_function,
4412 ++next_value_number_function;
4416 static void create_local_static_variable(entity_t *entity)
4418 assert(entity->kind == ENTITY_VARIABLE);
4419 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4421 type_t *type = skip_typeref(entity->declaration.type);
4422 ir_type *const var_type = entity->variable.thread_local ?
4423 get_tls_type() : get_glob_type();
4424 ir_type *const irtype = get_ir_type(type);
4425 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4427 size_t l = strlen(entity->base.symbol->string);
4428 char buf[l + sizeof(".%u")];
4429 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4430 ident *const id = id_unique(buf);
4431 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4433 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4434 set_entity_volatility(irentity, volatility_is_volatile);
4437 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4438 entity->variable.v.entity = irentity;
4440 set_entity_ld_ident(irentity, id);
4441 set_entity_visibility(irentity, ir_visibility_local);
4443 ir_graph *const old_current_ir_graph = current_ir_graph;
4444 current_ir_graph = get_const_code_irg();
4446 create_variable_initializer(entity);
4448 assert(current_ir_graph == get_const_code_irg());
4449 current_ir_graph = old_current_ir_graph;
4454 static ir_node *return_statement_to_firm(return_statement_t *statement)
4456 if (!currently_reachable())
4459 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4460 type_t *type = current_function_entity->declaration.type;
4461 ir_type *func_irtype = get_ir_type(type);
4465 if (get_method_n_ress(func_irtype) > 0) {
4466 ir_type *res_type = get_method_res_type(func_irtype, 0);
4468 if (statement->value != NULL) {
4469 ir_node *node = expression_to_firm(statement->value);
4470 if (!is_compound_type(res_type)) {
4471 type_t *ret_value_type = statement->value->base.type;
4472 ir_mode *mode = get_ir_mode_storage(ret_value_type);
4473 node = create_conv(dbgi, node, mode);
4474 node = do_strict_conv(dbgi, node);
4479 if (is_compound_type(res_type)) {
4482 mode = get_type_mode(res_type);
4484 in[0] = new_Unknown(mode);
4488 /* build return_value for its side effects */
4489 if (statement->value != NULL) {
4490 expression_to_firm(statement->value);
4495 ir_node *store = get_store();
4496 ir_node *ret = new_d_Return(dbgi, store, in_len, in);
4498 ir_node *end_block = get_irg_end_block(current_ir_graph);
4499 add_immBlock_pred(end_block, ret);
4501 set_unreachable_now();
4505 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4507 if (!currently_reachable())
4510 return expression_to_firm(statement->expression);
4513 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4515 entity_t *entity = compound->scope.entities;
4516 for ( ; entity != NULL; entity = entity->base.next) {
4517 if (!is_declaration(entity))
4520 create_local_declaration(entity);
4523 ir_node *result = NULL;
4524 statement_t *statement = compound->statements;
4525 for ( ; statement != NULL; statement = statement->base.next) {
4526 result = statement_to_firm(statement);
4532 static void create_global_variable(entity_t *entity)
4534 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4535 ir_visibility visibility = ir_visibility_default;
4536 ir_entity *irentity;
4537 assert(entity->kind == ENTITY_VARIABLE);
4539 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4540 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4541 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4542 case STORAGE_CLASS_NONE:
4543 visibility = ir_visibility_default;
4544 /* uninitialized globals get merged in C */
4545 if (entity->variable.initializer == NULL)
4546 linkage |= IR_LINKAGE_MERGE;
4548 case STORAGE_CLASS_TYPEDEF:
4549 case STORAGE_CLASS_AUTO:
4550 case STORAGE_CLASS_REGISTER:
4551 panic("invalid storage class for global var");
4554 ir_type *var_type = get_glob_type();
4555 if (entity->variable.thread_local) {
4556 var_type = get_tls_type();
4557 /* LINKAGE_MERGE not supported by current linkers */
4558 linkage &= ~IR_LINKAGE_MERGE;
4560 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4561 irentity = entity->variable.v.entity;
4562 add_entity_linkage(irentity, linkage);
4563 set_entity_visibility(irentity, visibility);
4566 static void create_local_declaration(entity_t *entity)
4568 assert(is_declaration(entity));
4570 /* construct type */
4571 (void) get_ir_type(entity->declaration.type);
4572 if (entity->base.symbol == NULL) {
4576 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4577 case STORAGE_CLASS_STATIC:
4578 if (entity->kind == ENTITY_FUNCTION) {
4579 (void)get_function_entity(entity, NULL);
4581 create_local_static_variable(entity);
4584 case STORAGE_CLASS_EXTERN:
4585 if (entity->kind == ENTITY_FUNCTION) {
4586 assert(entity->function.statement == NULL);
4587 (void)get_function_entity(entity, NULL);
4589 create_global_variable(entity);
4590 create_variable_initializer(entity);
4593 case STORAGE_CLASS_NONE:
4594 case STORAGE_CLASS_AUTO:
4595 case STORAGE_CLASS_REGISTER:
4596 if (entity->kind == ENTITY_FUNCTION) {
4597 if (entity->function.statement != NULL) {
4598 ir_type *owner = get_irg_frame_type(current_ir_graph);
4599 (void)get_function_entity(entity, owner);
4600 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4601 enqueue_inner_function(entity);
4603 (void)get_function_entity(entity, NULL);
4606 create_local_variable(entity);
4609 case STORAGE_CLASS_TYPEDEF:
4612 panic("invalid storage class found");
4615 static void initialize_local_declaration(entity_t *entity)
4617 if (entity->base.symbol == NULL)
4620 // no need to emit code in dead blocks
4621 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4622 && !currently_reachable())
4625 switch ((declaration_kind_t) entity->declaration.kind) {
4626 case DECLARATION_KIND_LOCAL_VARIABLE:
4627 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4628 create_variable_initializer(entity);
4631 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4632 allocate_variable_length_array(entity);
4635 case DECLARATION_KIND_COMPOUND_MEMBER:
4636 case DECLARATION_KIND_GLOBAL_VARIABLE:
4637 case DECLARATION_KIND_FUNCTION:
4638 case DECLARATION_KIND_INNER_FUNCTION:
4641 case DECLARATION_KIND_PARAMETER:
4642 case DECLARATION_KIND_PARAMETER_ENTITY:
4643 panic("can't initialize parameters");
4645 case DECLARATION_KIND_UNKNOWN:
4646 panic("can't initialize unknown declaration");
4648 panic("invalid declaration kind");
4651 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4653 entity_t *entity = statement->declarations_begin;
4657 entity_t *const last = statement->declarations_end;
4658 for ( ;; entity = entity->base.next) {
4659 if (is_declaration(entity)) {
4660 initialize_local_declaration(entity);
4661 } else if (entity->kind == ENTITY_TYPEDEF) {
4662 /* ยง6.7.7:3 Any array size expressions associated with variable length
4663 * array declarators are evaluated each time the declaration of the
4664 * typedef name is reached in the order of execution. */
4665 type_t *const type = skip_typeref(entity->typedefe.type);
4666 if (is_type_array(type) && type->array.is_vla)
4667 get_vla_size(&type->array);
4676 static ir_node *if_statement_to_firm(if_statement_t *statement)
4678 /* Create the condition. */
4679 ir_node *true_block = NULL;
4680 ir_node *false_block = NULL;
4681 if (currently_reachable()) {
4682 true_block = new_immBlock();
4683 false_block = new_immBlock();
4684 create_condition_evaluation(statement->condition, true_block, false_block);
4685 mature_immBlock(true_block);
4686 mature_immBlock(false_block);
4689 /* Create the true statement. */
4690 set_cur_block(true_block);
4691 statement_to_firm(statement->true_statement);
4692 ir_node *fallthrough_block = get_cur_block();
4694 /* Create the false statement. */
4695 set_cur_block(false_block);
4696 if (statement->false_statement != NULL) {
4697 statement_to_firm(statement->false_statement);
4700 /* Handle the block after the if-statement. Minor simplification and
4701 * optimisation: Reuse the false/true block as fallthrough block, if the
4702 * true/false statement does not pass control to the fallthrough block, e.g.
4703 * in the typical if (x) return; pattern. */
4704 if (fallthrough_block) {
4705 if (currently_reachable()) {
4706 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4707 ir_node *const f_jump = new_Jmp();
4708 ir_node *const in[] = { t_jump, f_jump };
4709 fallthrough_block = new_Block(2, in);
4711 set_cur_block(fallthrough_block);
4718 * Add an unconditional jump to the target block. If the source block is not
4719 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4720 * loops. This is necessary if the jump potentially enters a loop.
4722 static void jump_to(ir_node *const target_block)
4724 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4725 add_immBlock_pred(target_block, pred);
4729 * Add an unconditional jump to the target block, if the current block is
4730 * reachable and do nothing otherwise. This is only valid if the jump does not
4731 * enter a loop (a back edge is ok).
4733 static void jump_if_reachable(ir_node *const target_block)
4735 if (currently_reachable())
4736 add_immBlock_pred(target_block, new_Jmp());
4739 static ir_node *while_statement_to_firm(while_statement_t *statement)
4741 /* Create the header block */
4742 ir_node *const header_block = new_immBlock();
4743 jump_to(header_block);
4745 /* Create the condition. */
4746 ir_node * body_block;
4747 ir_node * false_block;
4748 expression_t *const cond = statement->condition;
4749 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4750 fold_constant_to_bool(cond)) {
4751 /* Shortcut for while (true). */
4752 body_block = header_block;
4755 keep_alive(header_block);
4756 keep_all_memory(header_block);
4758 body_block = new_immBlock();
4759 false_block = new_immBlock();
4761 set_cur_block(header_block);
4762 create_condition_evaluation(cond, body_block, false_block);
4763 mature_immBlock(body_block);
4766 ir_node *const old_continue_label = continue_label;
4767 ir_node *const old_break_label = break_label;
4768 continue_label = header_block;
4769 break_label = false_block;
4771 /* Create the loop body. */
4772 set_cur_block(body_block);
4773 statement_to_firm(statement->body);
4774 jump_if_reachable(header_block);
4776 mature_immBlock(header_block);
4777 assert(false_block == NULL || false_block == break_label);
4778 false_block = break_label;
4779 if (false_block != NULL) {
4780 mature_immBlock(false_block);
4782 set_cur_block(false_block);
4784 assert(continue_label == header_block);
4785 continue_label = old_continue_label;
4786 break_label = old_break_label;
4790 static ir_node *get_break_label(void)
4792 if (break_label == NULL) {
4793 break_label = new_immBlock();
4798 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4800 /* create the header block */
4801 ir_node *header_block = new_immBlock();
4804 ir_node *body_block = new_immBlock();
4805 jump_to(body_block);
4807 ir_node *old_continue_label = continue_label;
4808 ir_node *old_break_label = break_label;
4809 continue_label = header_block;
4812 set_cur_block(body_block);
4813 statement_to_firm(statement->body);
4814 ir_node *const false_block = get_break_label();
4816 assert(continue_label == header_block);
4817 continue_label = old_continue_label;
4818 break_label = old_break_label;
4820 jump_if_reachable(header_block);
4822 /* create the condition */
4823 mature_immBlock(header_block);
4824 set_cur_block(header_block);
4826 create_condition_evaluation(statement->condition, body_block, false_block);
4827 mature_immBlock(body_block);
4828 mature_immBlock(false_block);
4830 set_cur_block(false_block);
4834 static ir_node *for_statement_to_firm(for_statement_t *statement)
4836 /* create declarations */
4837 entity_t *entity = statement->scope.entities;
4838 for ( ; entity != NULL; entity = entity->base.next) {
4839 if (!is_declaration(entity))
4842 create_local_declaration(entity);
4845 if (currently_reachable()) {
4846 entity = statement->scope.entities;
4847 for ( ; entity != NULL; entity = entity->base.next) {
4848 if (!is_declaration(entity))
4851 initialize_local_declaration(entity);
4854 if (statement->initialisation != NULL) {
4855 expression_to_firm(statement->initialisation);
4859 /* Create the header block */
4860 ir_node *const header_block = new_immBlock();
4861 jump_to(header_block);
4863 /* Create the condition. */
4864 ir_node *body_block;
4865 ir_node *false_block;
4866 if (statement->condition != NULL) {
4867 body_block = new_immBlock();
4868 false_block = new_immBlock();
4870 set_cur_block(header_block);
4871 create_condition_evaluation(statement->condition, body_block, false_block);
4872 mature_immBlock(body_block);
4875 body_block = header_block;
4878 keep_alive(header_block);
4879 keep_all_memory(header_block);
4882 /* Create the step block, if necessary. */
4883 ir_node * step_block = header_block;
4884 expression_t *const step = statement->step;
4886 step_block = new_immBlock();
4889 ir_node *const old_continue_label = continue_label;
4890 ir_node *const old_break_label = break_label;
4891 continue_label = step_block;
4892 break_label = false_block;
4894 /* Create the loop body. */
4895 set_cur_block(body_block);
4896 statement_to_firm(statement->body);
4897 jump_if_reachable(step_block);
4899 /* Create the step code. */
4901 mature_immBlock(step_block);
4902 set_cur_block(step_block);
4903 expression_to_firm(step);
4904 jump_if_reachable(header_block);
4907 mature_immBlock(header_block);
4908 assert(false_block == NULL || false_block == break_label);
4909 false_block = break_label;
4910 if (false_block != NULL) {
4911 mature_immBlock(false_block);
4913 set_cur_block(false_block);
4915 assert(continue_label == step_block);
4916 continue_label = old_continue_label;
4917 break_label = old_break_label;
4921 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4923 if (!currently_reachable())
4926 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4927 ir_node *jump = new_d_Jmp(dbgi);
4928 add_immBlock_pred(target_block, jump);
4930 set_unreachable_now();
4934 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4936 /* determine number of cases */
4938 for (case_label_statement_t *l = statement->first_case; l != NULL;
4941 if (l->expression == NULL)
4943 if (l->is_empty_range)
4948 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4950 for (case_label_statement_t *l = statement->first_case; l != NULL;
4952 if (l->expression == NULL) {
4953 l->pn = pn_Switch_default;
4956 if (l->is_empty_range)
4958 ir_tarval *min = fold_constant_to_tarval(l->expression);
4959 ir_tarval *max = min;
4960 long pn = (long) i+1;
4961 if (l->end_range != NULL)
4962 max = fold_constant_to_tarval(l->end_range);
4963 ir_switch_table_set(res, i++, min, max, pn);
4969 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4971 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4972 ir_node *switch_node = NULL;
4974 if (currently_reachable()) {
4975 ir_node *expression = expression_to_firm(statement->expression);
4976 ir_switch_table *table = create_switch_table(statement);
4977 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4979 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4982 set_unreachable_now();
4984 ir_node *const old_switch = current_switch;
4985 ir_node *const old_break_label = break_label;
4986 const bool old_saw_default_label = saw_default_label;
4987 saw_default_label = false;
4988 current_switch = switch_node;
4991 statement_to_firm(statement->body);
4993 if (currently_reachable()) {
4994 add_immBlock_pred(get_break_label(), new_Jmp());
4997 if (!saw_default_label && switch_node) {
4998 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4999 add_immBlock_pred(get_break_label(), proj);
5002 if (break_label != NULL) {
5003 mature_immBlock(break_label);
5005 set_cur_block(break_label);
5007 assert(current_switch == switch_node);
5008 current_switch = old_switch;
5009 break_label = old_break_label;
5010 saw_default_label = old_saw_default_label;
5014 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
5016 if (statement->is_empty_range)
5019 if (current_switch != NULL) {
5020 ir_node *block = new_immBlock();
5021 /* Fallthrough from previous case */
5022 jump_if_reachable(block);
5024 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
5025 add_immBlock_pred(block, proj);
5026 if (statement->expression == NULL)
5027 saw_default_label = true;
5029 mature_immBlock(block);
5030 set_cur_block(block);
5033 return statement_to_firm(statement->statement);
5036 static ir_node *label_to_firm(const label_statement_t *statement)
5038 ir_node *block = get_label_block(statement->label);
5041 set_cur_block(block);
5043 keep_all_memory(block);
5045 return statement_to_firm(statement->statement);
5048 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
5050 if (!currently_reachable())
5053 ir_node *const irn = expression_to_firm(statement->expression);
5054 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5055 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
5057 set_irn_link(ijmp, ijmp_list);
5060 set_unreachable_now();
5064 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
5066 bool needs_memory = false;
5068 if (statement->is_volatile) {
5069 needs_memory = true;
5072 size_t n_clobbers = 0;
5073 asm_clobber_t *clobber = statement->clobbers;
5074 for ( ; clobber != NULL; clobber = clobber->next) {
5075 const char *clobber_str = clobber->clobber.begin;
5077 if (!be_is_valid_clobber(clobber_str)) {
5078 errorf(&statement->base.source_position,
5079 "invalid clobber '%s' specified", clobber->clobber);
5083 if (streq(clobber_str, "memory")) {
5084 needs_memory = true;
5088 ident *id = new_id_from_str(clobber_str);
5089 obstack_ptr_grow(&asm_obst, id);
5092 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5093 ident **clobbers = NULL;
5094 if (n_clobbers > 0) {
5095 clobbers = obstack_finish(&asm_obst);
5098 size_t n_inputs = 0;
5099 asm_argument_t *argument = statement->inputs;
5100 for ( ; argument != NULL; argument = argument->next)
5102 size_t n_outputs = 0;
5103 argument = statement->outputs;
5104 for ( ; argument != NULL; argument = argument->next)
5107 unsigned next_pos = 0;
5109 ir_node *ins[n_inputs + n_outputs + 1];
5112 ir_asm_constraint tmp_in_constraints[n_outputs];
5114 const expression_t *out_exprs[n_outputs];
5115 ir_node *out_addrs[n_outputs];
5116 size_t out_size = 0;
5118 argument = statement->outputs;
5119 for ( ; argument != NULL; argument = argument->next) {
5120 const char *constraints = argument->constraints.begin;
5121 asm_constraint_flags_t asm_flags
5122 = be_parse_asm_constraints(constraints);
5125 source_position_t const *const pos = &statement->base.source_position;
5126 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5127 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5129 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5130 errorf(pos, "some constraints in '%s' are invalid", constraints);
5133 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5134 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5139 unsigned pos = next_pos++;
5140 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5141 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5142 expression_t *expr = argument->expression;
5143 ir_node *addr = expression_to_addr(expr);
5144 /* in+output, construct an artifical same_as constraint on the
5146 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5148 ir_node *value = get_value_from_lvalue(expr, addr);
5150 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5152 ir_asm_constraint constraint;
5153 constraint.pos = pos;
5154 constraint.constraint = new_id_from_str(buf);
5155 constraint.mode = get_ir_mode_storage(expr->base.type);
5156 tmp_in_constraints[in_size] = constraint;
5157 ins[in_size] = value;
5162 out_exprs[out_size] = expr;
5163 out_addrs[out_size] = addr;
5165 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5166 /* pure memory ops need no input (but we have to make sure we
5167 * attach to the memory) */
5168 assert(! (asm_flags &
5169 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5170 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5171 needs_memory = true;
5173 /* we need to attach the address to the inputs */
5174 expression_t *expr = argument->expression;
5176 ir_asm_constraint constraint;
5177 constraint.pos = pos;
5178 constraint.constraint = new_id_from_str(constraints);
5179 constraint.mode = mode_M;
5180 tmp_in_constraints[in_size] = constraint;
5182 ins[in_size] = expression_to_addr(expr);
5186 errorf(&statement->base.source_position,
5187 "only modifiers but no place set in constraints '%s'",
5192 ir_asm_constraint constraint;
5193 constraint.pos = pos;
5194 constraint.constraint = new_id_from_str(constraints);
5195 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5197 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5199 assert(obstack_object_size(&asm_obst)
5200 == out_size * sizeof(ir_asm_constraint));
5201 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5204 obstack_grow(&asm_obst, tmp_in_constraints,
5205 in_size * sizeof(tmp_in_constraints[0]));
5206 /* find and count input and output arguments */
5207 argument = statement->inputs;
5208 for ( ; argument != NULL; argument = argument->next) {
5209 const char *constraints = argument->constraints.begin;
5210 asm_constraint_flags_t asm_flags
5211 = be_parse_asm_constraints(constraints);
5213 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5214 errorf(&statement->base.source_position,
5215 "some constraints in '%s' are not supported", constraints);
5218 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5219 errorf(&statement->base.source_position,
5220 "some constraints in '%s' are invalid", constraints);
5223 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5224 errorf(&statement->base.source_position,
5225 "write flag specified for input constraints '%s'",
5231 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5232 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5233 /* we can treat this as "normal" input */
5234 input = expression_to_firm(argument->expression);
5235 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5236 /* pure memory ops need no input (but we have to make sure we
5237 * attach to the memory) */
5238 assert(! (asm_flags &
5239 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5240 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5241 needs_memory = true;
5242 input = expression_to_addr(argument->expression);
5244 errorf(&statement->base.source_position,
5245 "only modifiers but no place set in constraints '%s'",
5250 ir_asm_constraint constraint;
5251 constraint.pos = next_pos++;
5252 constraint.constraint = new_id_from_str(constraints);
5253 constraint.mode = get_irn_mode(input);
5255 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5256 ins[in_size++] = input;
5260 ir_asm_constraint constraint;
5261 constraint.pos = next_pos++;
5262 constraint.constraint = new_id_from_str("");
5263 constraint.mode = mode_M;
5265 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5266 ins[in_size++] = get_store();
5269 assert(obstack_object_size(&asm_obst)
5270 == in_size * sizeof(ir_asm_constraint));
5271 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5273 /* create asm node */
5274 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5276 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5278 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5279 out_size, output_constraints,
5280 n_clobbers, clobbers, asm_text);
5282 if (statement->is_volatile) {
5283 set_irn_pinned(node, op_pin_state_pinned);
5285 set_irn_pinned(node, op_pin_state_floats);
5288 /* create output projs & connect them */
5290 ir_node *projm = new_Proj(node, mode_M, out_size);
5295 for (i = 0; i < out_size; ++i) {
5296 const expression_t *out_expr = out_exprs[i];
5298 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5299 ir_node *proj = new_Proj(node, mode, pn);
5300 ir_node *addr = out_addrs[i];
5302 set_value_for_expression_addr(out_expr, proj, addr);
5308 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5310 statement_to_firm(statement->try_statement);
5311 source_position_t const *const pos = &statement->base.source_position;
5312 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5316 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5318 errorf(&statement->base.source_position, "__leave not supported yet");
5323 * Transform a statement.
5325 static ir_node *statement_to_firm(statement_t *const stmt)
5328 assert(!stmt->base.transformed);
5329 stmt->base.transformed = true;
5332 switch (stmt->kind) {
5333 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5334 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5335 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5336 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5337 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5338 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5339 case STATEMENT_EMPTY: return NULL; /* nothing */
5340 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5341 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5342 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5343 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5344 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5345 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5346 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5347 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5348 case STATEMENT_WHILE: return while_statement_to_firm( &stmt->whiles);
5350 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5351 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5352 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5354 case STATEMENT_ERROR: panic("error statement found");
5356 panic("statement not implemented");
5359 static int count_local_variables(const entity_t *entity,
5360 const entity_t *const last)
5363 entity_t const *const end = last != NULL ? last->base.next : NULL;
5364 for (; entity != end; entity = entity->base.next) {
5368 if (entity->kind == ENTITY_VARIABLE) {
5369 type = skip_typeref(entity->declaration.type);
5370 address_taken = entity->variable.address_taken;
5371 } else if (entity->kind == ENTITY_PARAMETER) {
5372 type = skip_typeref(entity->declaration.type);
5373 address_taken = entity->parameter.address_taken;
5378 if (!address_taken && is_type_scalar(type))
5384 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5386 int *const count = env;
5388 switch (stmt->kind) {
5389 case STATEMENT_DECLARATION: {
5390 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5391 *count += count_local_variables(decl_stmt->declarations_begin,
5392 decl_stmt->declarations_end);
5397 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5406 * Return the number of local (alias free) variables used by a function.
5408 static int get_function_n_local_vars(entity_t *entity)
5410 const function_t *function = &entity->function;
5413 /* count parameters */
5414 count += count_local_variables(function->parameters.entities, NULL);
5416 /* count local variables declared in body */
5417 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5422 * Build Firm code for the parameters of a function.
5424 static void initialize_function_parameters(entity_t *entity)
5426 assert(entity->kind == ENTITY_FUNCTION);
5427 ir_graph *irg = current_ir_graph;
5428 ir_node *args = get_irg_args(irg);
5430 ir_type *function_irtype;
5432 if (entity->function.need_closure) {
5433 /* add an extra parameter for the static link */
5434 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5437 /* Matze: IMO this is wrong, nested functions should have an own
5438 * type and not rely on strange parameters... */
5439 function_irtype = create_method_type(&entity->declaration.type->function, true);
5441 function_irtype = get_ir_type(entity->declaration.type);
5446 entity_t *parameter = entity->function.parameters.entities;
5447 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5448 if (parameter->kind != ENTITY_PARAMETER)
5451 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5452 type_t *type = skip_typeref(parameter->declaration.type);
5454 bool needs_entity = parameter->parameter.address_taken;
5455 assert(!is_type_array(type));
5456 if (is_type_compound(type)) {
5457 needs_entity = true;
5460 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5462 ir_type *frame_type = get_irg_frame_type(irg);
5464 = new_parameter_entity(frame_type, n, param_irtype);
5465 parameter->declaration.kind
5466 = DECLARATION_KIND_PARAMETER_ENTITY;
5467 parameter->parameter.v.entity = param;
5471 ir_mode *param_mode = get_type_mode(param_irtype);
5473 ir_node *value = new_r_Proj(args, param_mode, pn);
5475 ir_mode *mode = get_ir_mode_storage(type);
5476 value = create_conv(NULL, value, mode);
5477 value = do_strict_conv(NULL, value);
5479 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5480 parameter->parameter.v.value_number = next_value_number_function;
5481 set_irg_loc_description(current_ir_graph, next_value_number_function,
5483 ++next_value_number_function;
5485 set_value(parameter->parameter.v.value_number, value);
5490 * Handle additional decl modifiers for IR-graphs
5492 * @param irg the IR-graph
5493 * @param dec_modifiers additional modifiers
5495 static void handle_decl_modifier_irg(ir_graph *irg,
5496 decl_modifiers_t decl_modifiers)
5498 if (decl_modifiers & DM_NAKED) {
5499 /* TRUE if the declaration includes the Microsoft
5500 __declspec(naked) specifier. */
5501 add_irg_additional_properties(irg, mtp_property_naked);
5503 if (decl_modifiers & DM_FORCEINLINE) {
5504 /* TRUE if the declaration includes the
5505 Microsoft __forceinline specifier. */
5506 set_irg_inline_property(irg, irg_inline_forced);
5508 if (decl_modifiers & DM_NOINLINE) {
5509 /* TRUE if the declaration includes the Microsoft
5510 __declspec(noinline) specifier. */
5511 set_irg_inline_property(irg, irg_inline_forbidden);
5515 static void add_function_pointer(ir_type *segment, ir_entity *method,
5516 const char *unique_template)
5518 ir_type *method_type = get_entity_type(method);
5519 ir_type *ptr_type = new_type_pointer(method_type);
5521 /* these entities don't really have a name but firm only allows
5523 * Note that we mustn't give these entities a name since for example
5524 * Mach-O doesn't allow them. */
5525 ident *ide = id_unique(unique_template);
5526 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5527 ir_graph *irg = get_const_code_irg();
5528 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5531 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5532 set_entity_compiler_generated(ptr, 1);
5533 set_entity_visibility(ptr, ir_visibility_private);
5534 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5535 set_atomic_ent_value(ptr, val);
5539 * Generate possible IJmp branches to a given label block.
5541 static void gen_ijmp_branches(ir_node *block)
5544 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5545 add_immBlock_pred(block, ijmp);
5550 * Create code for a function and all inner functions.
5552 * @param entity the function entity
5554 static void create_function(entity_t *entity)
5556 assert(entity->kind == ENTITY_FUNCTION);
5557 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5559 if (entity->function.statement == NULL)
5562 inner_functions = NULL;
5563 current_trampolines = NULL;
5565 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5566 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5567 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5569 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5570 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5571 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5574 current_function_entity = entity;
5575 current_function_name = NULL;
5576 current_funcsig = NULL;
5578 assert(all_labels == NULL);
5579 all_labels = NEW_ARR_F(label_t *, 0);
5582 int n_local_vars = get_function_n_local_vars(entity);
5583 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5584 current_ir_graph = irg;
5586 ir_graph *old_current_function = current_function;
5587 current_function = irg;
5589 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5590 current_vararg_entity = NULL;
5592 set_irg_fp_model(irg, firm_fp_model);
5593 tarval_enable_fp_ops(1);
5594 set_irn_dbg_info(get_irg_start_block(irg),
5595 get_entity_dbg_info(function_entity));
5597 /* set inline flags */
5598 if (entity->function.is_inline)
5599 set_irg_inline_property(irg, irg_inline_recomended);
5600 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5602 next_value_number_function = 0;
5603 initialize_function_parameters(entity);
5604 current_static_link = entity->function.static_link;
5606 statement_to_firm(entity->function.statement);
5608 ir_node *end_block = get_irg_end_block(irg);
5610 /* do we have a return statement yet? */
5611 if (currently_reachable()) {
5612 type_t *type = skip_typeref(entity->declaration.type);
5613 assert(is_type_function(type));
5614 const function_type_t *func_type = &type->function;
5615 const type_t *return_type
5616 = skip_typeref(func_type->return_type);
5619 if (is_type_void(return_type)) {
5620 ret = new_Return(get_store(), 0, NULL);
5623 if (is_type_scalar(return_type)) {
5624 mode = get_ir_mode_storage(func_type->return_type);
5630 /* ยง5.1.2.2.3 main implicitly returns 0 */
5631 if (is_main(entity)) {
5632 in[0] = new_Const(get_mode_null(mode));
5634 in[0] = new_Unknown(mode);
5636 ret = new_Return(get_store(), 1, in);
5638 add_immBlock_pred(end_block, ret);
5641 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5642 label_t *label = all_labels[i];
5643 if (label->address_taken) {
5644 gen_ijmp_branches(label->block);
5646 mature_immBlock(label->block);
5649 DEL_ARR_F(all_labels);
5652 irg_finalize_cons(irg);
5654 /* finalize the frame type */
5655 ir_type *frame_type = get_irg_frame_type(irg);
5656 int n = get_compound_n_members(frame_type);
5659 for (int i = 0; i < n; ++i) {
5660 ir_entity *member = get_compound_member(frame_type, i);
5661 ir_type *entity_type = get_entity_type(member);
5663 int align = get_type_alignment_bytes(entity_type);
5664 if (align > align_all)
5668 misalign = offset % align;
5670 offset += align - misalign;
5674 set_entity_offset(member, offset);
5675 offset += get_type_size_bytes(entity_type);
5677 set_type_size_bytes(frame_type, offset);
5678 set_type_alignment_bytes(frame_type, align_all);
5680 irg_verify(irg, VERIFY_ENFORCE_SSA);
5681 current_vararg_entity = old_current_vararg_entity;
5682 current_function = old_current_function;
5684 if (current_trampolines != NULL) {
5685 DEL_ARR_F(current_trampolines);
5686 current_trampolines = NULL;
5689 /* create inner functions if any */
5690 entity_t **inner = inner_functions;
5691 if (inner != NULL) {
5692 ir_type *rem_outer_frame = current_outer_frame;
5693 current_outer_frame = get_irg_frame_type(current_ir_graph);
5694 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5695 create_function(inner[i]);
5699 current_outer_frame = rem_outer_frame;
5703 static void scope_to_firm(scope_t *scope)
5705 /* first pass: create declarations */
5706 entity_t *entity = scope->entities;
5707 for ( ; entity != NULL; entity = entity->base.next) {
5708 if (entity->base.symbol == NULL)
5711 if (entity->kind == ENTITY_FUNCTION) {
5712 if (entity->function.btk != BUILTIN_NONE) {
5713 /* builtins have no representation */
5716 (void)get_function_entity(entity, NULL);
5717 } else if (entity->kind == ENTITY_VARIABLE) {
5718 create_global_variable(entity);
5719 } else if (entity->kind == ENTITY_NAMESPACE) {
5720 scope_to_firm(&entity->namespacee.members);
5724 /* second pass: create code/initializers */
5725 entity = scope->entities;
5726 for ( ; entity != NULL; entity = entity->base.next) {
5727 if (entity->base.symbol == NULL)
5730 if (entity->kind == ENTITY_FUNCTION) {
5731 if (entity->function.btk != BUILTIN_NONE) {
5732 /* builtins have no representation */
5735 create_function(entity);
5736 } else if (entity->kind == ENTITY_VARIABLE) {
5737 assert(entity->declaration.kind
5738 == DECLARATION_KIND_GLOBAL_VARIABLE);
5739 current_ir_graph = get_const_code_irg();
5740 create_variable_initializer(entity);
5745 void init_ast2firm(void)
5747 obstack_init(&asm_obst);
5748 init_atomic_modes();
5750 ir_set_debug_retrieve(dbg_retrieve);
5751 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5753 /* create idents for all known runtime functions */
5754 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5755 rts_idents[i] = new_id_from_str(rts_data[i].name);
5758 entitymap_init(&entitymap);
5761 static void init_ir_types(void)
5763 static int ir_types_initialized = 0;
5764 if (ir_types_initialized)
5766 ir_types_initialized = 1;
5768 ir_type_char = get_ir_type(type_char);
5769 ir_type_const_char = get_ir_type(type_const_char);
5770 ir_type_wchar_t = get_ir_type(type_wchar_t);
5772 be_params = be_get_backend_param();
5773 mode_float_arithmetic = be_params->mode_float_arithmetic;
5775 stack_param_align = be_params->stack_param_align;
5778 void exit_ast2firm(void)
5780 entitymap_destroy(&entitymap);
5781 obstack_free(&asm_obst, NULL);
5784 static void global_asm_to_firm(statement_t *s)
5786 for (; s != NULL; s = s->base.next) {
5787 assert(s->kind == STATEMENT_ASM);
5789 char const *const text = s->asms.asm_text.begin;
5790 size_t size = s->asms.asm_text.size;
5792 /* skip the last \0 */
5793 if (text[size - 1] == '\0')
5796 ident *const id = new_id_from_chars(text, size);
5801 void translation_unit_to_firm(translation_unit_t *unit)
5803 /* initialize firm arithmetic */
5804 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5805 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5807 /* just to be sure */
5808 continue_label = NULL;
5810 current_switch = NULL;
5811 current_translation_unit = unit;
5815 scope_to_firm(&unit->scope);
5816 global_asm_to_firm(unit->global_asm);
5818 current_ir_graph = NULL;
5819 current_translation_unit = NULL;