2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
28 #include <libfirm/firm.h>
29 #include <libfirm/adt/obst.h>
30 #include <libfirm/be.h>
34 #include "adt/error.h"
35 #include "adt/array.h"
36 #include "adt/strutil.h"
38 #include "jump_target.h"
45 #include "diagnostic.h"
46 #include "lang_features.h"
48 #include "type_hash.h"
53 #include "entitymap_t.h"
54 #include "driver/firm_opt.h"
56 typedef struct trampoline_region trampoline_region;
57 struct trampoline_region {
58 ir_entity *function; /**< The function that is called by this trampoline */
59 ir_entity *region; /**< created region for the trampoline */
62 fp_model_t firm_fp_model = fp_model_precise;
64 static const backend_params *be_params;
66 static ir_type *ir_type_char;
67 static ir_type *ir_type_wchar_t;
69 /* architecture specific floating point arithmetic mode (if any) */
70 static ir_mode *mode_float_arithmetic;
72 /* alignment of stack parameters */
73 static unsigned stack_param_align;
75 static int next_value_number_function;
76 static jump_target continue_target;
77 static jump_target break_target;
78 static ir_node *current_switch;
79 static bool saw_default_label;
80 static entity_t **inner_functions;
81 static ir_node *ijmp_list;
82 static ir_node **ijmp_blocks;
83 static bool constant_folding;
85 #define PUSH_BREAK(val) \
86 jump_target const old_break_target = break_target; \
87 (init_jump_target(&break_target, (val)))
89 ((void)(break_target = old_break_target))
91 #define PUSH_CONTINUE(val) \
92 jump_target const old_continue_target = continue_target; \
93 (init_jump_target(&continue_target, (val)))
94 #define POP_CONTINUE() \
95 ((void)(continue_target = old_continue_target))
97 #define PUSH_IRG(val) \
98 ir_graph *const old_irg = current_ir_graph; \
99 ir_graph *const new_irg = (val); \
100 ((void)(current_ir_graph = new_irg))
103 (assert(current_ir_graph == new_irg), (void)(current_ir_graph = old_irg))
105 static const entity_t *current_function_entity;
106 static ir_node *current_function_name;
107 static ir_node *current_funcsig;
108 static ir_graph *current_function;
109 static translation_unit_t *current_translation_unit;
110 static trampoline_region *current_trampolines;
111 static ir_type *current_outer_frame;
112 static ir_node *current_static_link;
113 static ir_entity *current_vararg_entity;
115 static entitymap_t entitymap;
117 static struct obstack asm_obst;
119 typedef enum declaration_kind_t {
120 DECLARATION_KIND_UNKNOWN,
121 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
122 DECLARATION_KIND_GLOBAL_VARIABLE,
123 DECLARATION_KIND_LOCAL_VARIABLE,
124 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
125 DECLARATION_KIND_PARAMETER,
126 DECLARATION_KIND_PARAMETER_ENTITY,
127 DECLARATION_KIND_FUNCTION,
128 DECLARATION_KIND_COMPOUND_MEMBER,
129 DECLARATION_KIND_INNER_FUNCTION
130 } declaration_kind_t;
132 static ir_type *get_ir_type_incomplete(type_t *type);
134 static void enqueue_inner_function(entity_t *entity)
136 if (inner_functions == NULL)
137 inner_functions = NEW_ARR_F(entity_t *, 0);
138 ARR_APP1(entity_t*, inner_functions, entity);
141 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
143 const entity_t *entity = get_irg_loc_description(irg, pos);
145 if (entity != NULL) {
146 source_position_t const *const pos = &entity->base.source_position;
147 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
149 return new_r_Unknown(irg, mode);
152 static src_loc_t dbg_retrieve(const dbg_info *dbg)
154 source_position_t const *const pos = (source_position_t const*)dbg;
156 return (src_loc_t){ pos->input_name, pos->lineno, pos->colno };
158 return (src_loc_t){ NULL, 0, 0 };
162 static dbg_info *get_dbg_info(const source_position_t *pos)
164 return (dbg_info*) pos;
167 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
168 const type_dbg_info *dbg)
171 print_to_buffer(buffer, buffer_size);
172 const type_t *type = (const type_t*) dbg;
174 finish_print_to_buffer();
177 static type_dbg_info *get_type_dbg_info_(const type_t *type)
179 return (type_dbg_info*) type;
182 /* is the current block a reachable one? */
183 static bool currently_reachable(void)
185 ir_node *const block = get_cur_block();
186 return block != NULL && !is_Bad(block);
189 static void set_unreachable_now(void)
194 ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
196 static ir_node *_expression_to_firm(const expression_t *expression);
197 static ir_node *expression_to_firm(const expression_t *expression);
199 static unsigned decide_modulo_shift(unsigned type_size)
201 if (architecture_modulo_shift == 0)
203 if (type_size < architecture_modulo_shift)
204 return architecture_modulo_shift;
208 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
210 unsigned flags = get_atomic_type_flags(kind);
211 unsigned size = get_atomic_type_size(kind);
212 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
213 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
215 case 4: return get_modeF();
216 case 8: return get_modeD();
217 default: panic("unexpected kind");
219 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
221 unsigned bit_size = size * 8;
222 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
223 unsigned modulo_shift = decide_modulo_shift(bit_size);
225 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
226 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
234 * Initialises the atomic modes depending on the machine size.
236 static void init_atomic_modes(void)
238 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
239 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
240 if (atomic_modes[i] != NULL)
242 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
246 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
248 assert(kind <= ATOMIC_TYPE_LAST);
249 return atomic_modes[kind];
252 static ir_node *get_vla_size(array_type_t *const type)
254 ir_node *size_node = type->size_node;
255 if (size_node == NULL) {
256 size_node = expression_to_firm(type->size_expression);
257 type->size_node = size_node;
262 static unsigned count_parameters(const function_type_t *function_type)
266 function_parameter_t *parameter = function_type->parameters;
267 for ( ; parameter != NULL; parameter = parameter->next) {
275 * Creates a Firm type for an atomic type
277 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
279 ir_mode *mode = atomic_modes[akind];
280 type_dbg_info *dbgi = get_type_dbg_info_(type);
281 ir_type *irtype = new_d_type_primitive(mode, dbgi);
282 il_alignment_t alignment = get_atomic_type_alignment(akind);
284 set_type_size_bytes(irtype, get_atomic_type_size(akind));
285 set_type_alignment_bytes(irtype, alignment);
291 * Creates a Firm type for a complex type
293 static ir_type *create_complex_type(const atomic_type_t *type)
295 atomic_type_kind_t kind = type->akind;
296 ir_mode *mode = atomic_modes[kind];
297 ident *id = get_mode_ident(mode);
301 /* FIXME: finish the array */
306 * Creates a Firm type for an imaginary type
308 static ir_type *create_imaginary_type(const atomic_type_t *type)
310 return create_atomic_type(type->akind, (const type_t*)type);
314 * return type of a parameter (and take transparent union gnu extension into
317 static type_t *get_parameter_type(type_t *orig_type)
319 type_t *type = skip_typeref(orig_type);
320 if (is_type_union(type)
321 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
322 compound_t *compound = type->compound.compound;
323 type = compound->members.entities->declaration.type;
329 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
331 type_t *return_type = skip_typeref(function_type->return_type);
333 int n_parameters = count_parameters(function_type)
334 + (for_closure ? 1 : 0);
335 int n_results = is_type_void(return_type) ? 0 : 1;
336 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
337 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
339 if (!is_type_void(return_type)) {
340 ir_type *restype = get_ir_type(return_type);
341 set_method_res_type(irtype, 0, restype);
344 function_parameter_t *parameter = function_type->parameters;
347 ir_type *p_irtype = get_ir_type(type_void_ptr);
348 set_method_param_type(irtype, n, p_irtype);
351 for ( ; parameter != NULL; parameter = parameter->next) {
352 type_t *type = get_parameter_type(parameter->type);
353 ir_type *p_irtype = get_ir_type(type);
354 set_method_param_type(irtype, n, p_irtype);
358 bool is_variadic = function_type->variadic;
361 set_method_variadicity(irtype, variadicity_variadic);
363 unsigned cc = get_method_calling_convention(irtype);
364 switch (function_type->calling_convention) {
365 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
368 set_method_calling_convention(irtype, SET_CDECL(cc));
375 /* only non-variadic function can use stdcall, else use cdecl */
376 set_method_calling_convention(irtype, SET_STDCALL(cc));
382 /* only non-variadic function can use fastcall, else use cdecl */
383 set_method_calling_convention(irtype, SET_FASTCALL(cc));
387 /* Hmm, leave default, not accepted by the parser yet. */
392 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
394 const decl_modifiers_t modifiers = function_type->modifiers;
395 if (modifiers & DM_CONST)
396 add_method_additional_properties(irtype, mtp_property_const);
397 if (modifiers & DM_PURE)
398 add_method_additional_properties(irtype, mtp_property_pure);
399 if (modifiers & DM_RETURNS_TWICE)
400 add_method_additional_properties(irtype, mtp_property_returns_twice);
401 if (modifiers & DM_NORETURN)
402 add_method_additional_properties(irtype, mtp_property_noreturn);
403 if (modifiers & DM_NOTHROW)
404 add_method_additional_properties(irtype, mtp_property_nothrow);
405 if (modifiers & DM_MALLOC)
406 add_method_additional_properties(irtype, mtp_property_malloc);
411 static ir_type *create_pointer_type(pointer_type_t *type)
413 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
414 type_t *points_to = type->points_to;
415 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
416 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
421 static ir_type *create_reference_type(reference_type_t *type)
423 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
424 type_t *refers_to = type->refers_to;
425 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
426 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
431 static ir_type *create_array_type(array_type_t *type)
433 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
434 type_t *element_type = type->element_type;
435 ir_type *ir_element_type = get_ir_type(element_type);
436 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
438 const int align = get_type_alignment_bytes(ir_element_type);
439 set_type_alignment_bytes(irtype, align);
441 if (type->size_constant) {
442 int n_elements = type->size;
444 set_array_bounds_int(irtype, 0, 0, n_elements);
446 size_t elemsize = get_type_size_bytes(ir_element_type);
447 if (elemsize % align > 0) {
448 elemsize += align - (elemsize % align);
450 set_type_size_bytes(irtype, n_elements * elemsize);
452 set_array_lower_bound_int(irtype, 0, 0);
454 set_type_state(irtype, layout_fixed);
460 * Return the signed integer type of size bits.
462 * @param size the size
464 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
468 static ir_mode *s_modes[64 + 1] = {NULL, };
472 if (size <= 0 || size > 64)
475 mode = s_modes[size];
479 snprintf(name, sizeof(name), "bf_I%u", size);
480 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
481 s_modes[size] = mode;
484 type_dbg_info *dbgi = get_type_dbg_info_(type);
485 res = new_d_type_primitive(mode, dbgi);
486 set_primitive_base_type(res, base_tp);
492 * Return the unsigned integer type of size bits.
494 * @param size the size
496 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
500 static ir_mode *u_modes[64 + 1] = {NULL, };
504 if (size <= 0 || size > 64)
507 mode = u_modes[size];
511 snprintf(name, sizeof(name), "bf_U%u", size);
512 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
513 u_modes[size] = mode;
516 type_dbg_info *dbgi = get_type_dbg_info_(type);
517 res = new_d_type_primitive(mode, dbgi);
518 set_primitive_base_type(res, base_tp);
523 static ir_type *create_bitfield_type(const entity_t *entity)
525 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
526 type_t *base = skip_typeref(entity->declaration.type);
527 assert(is_type_integer(base));
528 ir_type *irbase = get_ir_type(base);
530 unsigned bit_size = entity->compound_member.bit_size;
532 if (is_type_signed(base)) {
533 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
535 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
540 * Construct firm type from ast struct type.
542 static ir_type *create_compound_type(compound_type_t *const type, bool const incomplete)
544 compound_t *compound = type->compound;
546 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
547 return compound->irtype;
550 bool const is_union = type->base.kind == TYPE_COMPOUND_UNION;
552 symbol_t *type_symbol = compound->base.symbol;
554 if (type_symbol != NULL) {
555 id = new_id_from_str(type_symbol->string);
558 id = id_unique("__anonymous_union.%u");
560 id = id_unique("__anonymous_struct.%u");
566 irtype = new_type_union(id);
568 irtype = new_type_struct(id);
571 compound->irtype_complete = false;
572 compound->irtype = irtype;
578 layout_union_type(type);
580 layout_struct_type(type);
583 compound->irtype_complete = true;
585 entity_t *entry = compound->members.entities;
586 for ( ; entry != NULL; entry = entry->base.next) {
587 if (entry->kind != ENTITY_COMPOUND_MEMBER)
590 symbol_t *symbol = entry->base.symbol;
591 type_t *entry_type = entry->declaration.type;
593 if (symbol == NULL) {
594 /* anonymous bitfield member, skip */
595 if (entry->compound_member.bitfield)
597 assert(is_type_compound(entry_type));
598 ident = id_unique("anon.%u");
600 ident = new_id_from_str(symbol->string);
603 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
605 ir_type *entry_irtype;
606 if (entry->compound_member.bitfield) {
607 entry_irtype = create_bitfield_type(entry);
609 entry_irtype = get_ir_type(entry_type);
611 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
613 set_entity_offset(entity, entry->compound_member.offset);
614 set_entity_offset_bits_remainder(entity,
615 entry->compound_member.bit_offset);
617 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
618 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
619 entry->compound_member.entity = entity;
622 set_type_alignment_bytes(irtype, compound->alignment);
623 set_type_size_bytes(irtype, compound->size);
624 set_type_state(irtype, layout_fixed);
629 void determine_enum_values(enum_type_t *const type)
631 ir_mode *const mode = atomic_modes[type->base.akind];
632 ir_tarval *const one = get_mode_one(mode);
633 ir_tarval * tv_next = get_mode_null(mode);
635 enum_t *enume = type->enume;
636 entity_t *entry = enume->base.next;
637 for (; entry != NULL; entry = entry->base.next) {
638 if (entry->kind != ENTITY_ENUM_VALUE)
641 expression_t *const init = entry->enum_value.value;
643 tv_next = fold_constant_to_tarval(init);
645 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
646 entry->enum_value.tv = tv_next;
647 tv_next = tarval_add(tv_next, one);
651 static ir_type *create_enum_type(enum_type_t *const type)
653 return create_atomic_type(type->base.akind, (const type_t*) type);
656 static ir_type *get_ir_type_incomplete(type_t *type)
658 type = skip_typeref(type);
660 if (type->base.firm_type != NULL) {
661 return type->base.firm_type;
664 if (is_type_compound(type)) {
665 return create_compound_type(&type->compound, true);
667 return get_ir_type(type);
671 ir_type *get_ir_type(type_t *type)
673 type = skip_typeref(type);
675 if (type->base.firm_type != NULL) {
676 return type->base.firm_type;
679 ir_type *firm_type = NULL;
680 switch (type->kind) {
682 firm_type = create_atomic_type(type->atomic.akind, type);
685 firm_type = create_complex_type(&type->atomic);
688 firm_type = create_imaginary_type(&type->atomic);
691 firm_type = create_method_type(&type->function, false);
694 firm_type = create_pointer_type(&type->pointer);
697 firm_type = create_reference_type(&type->reference);
700 firm_type = create_array_type(&type->array);
702 case TYPE_COMPOUND_STRUCT:
703 case TYPE_COMPOUND_UNION:
704 firm_type = create_compound_type(&type->compound, false);
707 firm_type = create_enum_type(&type->enumt);
715 if (firm_type == NULL)
716 panic("unknown type found");
718 type->base.firm_type = firm_type;
722 static ir_mode *get_ir_mode_storage(type_t *type)
724 type = skip_typeref(type);
726 /* Firm doesn't report a mode for arrays and structs/unions. */
727 if (!is_type_scalar(type)) {
731 ir_type *const irtype = get_ir_type(type);
732 ir_mode *const mode = get_type_mode(irtype);
733 assert(mode != NULL);
738 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
739 * int that it returns bigger modes for floating point on some platforms
740 * (x87 internally does arithemtic with 80bits)
742 static ir_mode *get_ir_mode_arithmetic(type_t *type)
744 ir_mode *mode = get_ir_mode_storage(type);
745 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
746 return mode_float_arithmetic;
753 * Return a node representing the size of a type.
755 static ir_node *get_type_size_node(type_t *type)
758 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
759 type = skip_typeref(type);
761 if (is_type_array(type) && type->array.is_vla) {
762 ir_node *size_node = get_vla_size(&type->array);
763 ir_node *elem_size = get_type_size_node(type->array.element_type);
764 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
768 size = get_type_size(type);
769 return new_Const_long(mode, size);
772 /** Names of the runtime functions. */
773 static const struct {
774 int id; /**< the rts id */
775 int n_res; /**< number of return values */
776 const char *name; /**< the name of the rts function */
777 int n_params; /**< number of parameters */
778 unsigned flags; /**< language flags */
780 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
781 { rts_abort, 0, "abort", 0, _C89 },
782 { rts_alloca, 1, "alloca", 1, _ALL },
783 { rts_abs, 1, "abs", 1, _C89 },
784 { rts_labs, 1, "labs", 1, _C89 },
785 { rts_llabs, 1, "llabs", 1, _C99 },
786 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
788 { rts_fabs, 1, "fabs", 1, _C89 },
789 { rts_sqrt, 1, "sqrt", 1, _C89 },
790 { rts_cbrt, 1, "cbrt", 1, _C99 },
791 { rts_exp, 1, "exp", 1, _C89 },
792 { rts_exp2, 1, "exp2", 1, _C89 },
793 { rts_exp10, 1, "exp10", 1, _GNUC },
794 { rts_log, 1, "log", 1, _C89 },
795 { rts_log2, 1, "log2", 1, _C89 },
796 { rts_log10, 1, "log10", 1, _C89 },
797 { rts_pow, 1, "pow", 2, _C89 },
798 { rts_sin, 1, "sin", 1, _C89 },
799 { rts_cos, 1, "cos", 1, _C89 },
800 { rts_tan, 1, "tan", 1, _C89 },
801 { rts_asin, 1, "asin", 1, _C89 },
802 { rts_acos, 1, "acos", 1, _C89 },
803 { rts_atan, 1, "atan", 1, _C89 },
804 { rts_sinh, 1, "sinh", 1, _C89 },
805 { rts_cosh, 1, "cosh", 1, _C89 },
806 { rts_tanh, 1, "tanh", 1, _C89 },
808 { rts_fabsf, 1, "fabsf", 1, _C99 },
809 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
810 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
811 { rts_expf, 1, "expf", 1, _C99 },
812 { rts_exp2f, 1, "exp2f", 1, _C99 },
813 { rts_exp10f, 1, "exp10f", 1, _GNUC },
814 { rts_logf, 1, "logf", 1, _C99 },
815 { rts_log2f, 1, "log2f", 1, _C99 },
816 { rts_log10f, 1, "log10f", 1, _C99 },
817 { rts_powf, 1, "powf", 2, _C99 },
818 { rts_sinf, 1, "sinf", 1, _C99 },
819 { rts_cosf, 1, "cosf", 1, _C99 },
820 { rts_tanf, 1, "tanf", 1, _C99 },
821 { rts_asinf, 1, "asinf", 1, _C99 },
822 { rts_acosf, 1, "acosf", 1, _C99 },
823 { rts_atanf, 1, "atanf", 1, _C99 },
824 { rts_sinhf, 1, "sinhf", 1, _C99 },
825 { rts_coshf, 1, "coshf", 1, _C99 },
826 { rts_tanhf, 1, "tanhf", 1, _C99 },
828 { rts_fabsl, 1, "fabsl", 1, _C99 },
829 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
830 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
831 { rts_expl, 1, "expl", 1, _C99 },
832 { rts_exp2l, 1, "exp2l", 1, _C99 },
833 { rts_exp10l, 1, "exp10l", 1, _GNUC },
834 { rts_logl, 1, "logl", 1, _C99 },
835 { rts_log2l, 1, "log2l", 1, _C99 },
836 { rts_log10l, 1, "log10l", 1, _C99 },
837 { rts_powl, 1, "powl", 2, _C99 },
838 { rts_sinl, 1, "sinl", 1, _C99 },
839 { rts_cosl, 1, "cosl", 1, _C99 },
840 { rts_tanl, 1, "tanl", 1, _C99 },
841 { rts_asinl, 1, "asinl", 1, _C99 },
842 { rts_acosl, 1, "acosl", 1, _C99 },
843 { rts_atanl, 1, "atanl", 1, _C99 },
844 { rts_sinhl, 1, "sinhl", 1, _C99 },
845 { rts_coshl, 1, "coshl", 1, _C99 },
846 { rts_tanhl, 1, "tanhl", 1, _C99 },
848 { rts_strcmp, 1, "strcmp", 2, _C89 },
849 { rts_strncmp, 1, "strncmp", 3, _C89 },
850 { rts_strcpy, 1, "strcpy", 2, _C89 },
851 { rts_strlen, 1, "strlen", 1, _C89 },
852 { rts_memcpy, 1, "memcpy", 3, _C89 },
853 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
854 { rts_memmove, 1, "memmove", 3, _C89 },
855 { rts_memset, 1, "memset", 3, _C89 },
856 { rts_memcmp, 1, "memcmp", 3, _C89 },
859 static ident *rts_idents[lengthof(rts_data)];
861 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
863 void set_create_ld_ident(ident *(*func)(entity_t*))
865 create_ld_ident = func;
868 static bool declaration_is_definition(const entity_t *entity)
870 switch (entity->kind) {
871 case ENTITY_VARIABLE:
872 return entity->declaration.storage_class != STORAGE_CLASS_EXTERN;
873 case ENTITY_FUNCTION:
874 return entity->function.body != NULL;
875 case ENTITY_PARAMETER:
876 case ENTITY_COMPOUND_MEMBER:
880 case ENTITY_ENUM_VALUE:
881 case ENTITY_NAMESPACE:
883 case ENTITY_LOCAL_LABEL:
886 panic("declaration_is_definition called on non-declaration");
890 * Handle GNU attributes for entities
892 * @param ent the entity
893 * @param decl the routine declaration
895 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
897 assert(is_declaration(entity));
898 decl_modifiers_t modifiers = entity->declaration.modifiers;
900 if (is_method_entity(irentity)) {
901 if (modifiers & DM_PURE)
902 add_entity_additional_properties(irentity, mtp_property_pure);
903 if (modifiers & DM_CONST)
904 add_entity_additional_properties(irentity, mtp_property_const);
905 if (modifiers & DM_NOINLINE)
906 add_entity_additional_properties(irentity, mtp_property_noinline);
907 if (modifiers & DM_FORCEINLINE)
908 add_entity_additional_properties(irentity, mtp_property_always_inline);
909 if (modifiers & DM_NAKED)
910 add_entity_additional_properties(irentity, mtp_property_naked);
911 if (entity->kind == ENTITY_FUNCTION && entity->function.is_inline)
912 add_entity_additional_properties(irentity,
913 mtp_property_inline_recommended);
915 if ((modifiers & DM_USED) && declaration_is_definition(entity)) {
916 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
918 if ((modifiers & DM_WEAK) && declaration_is_definition(entity)
919 && entity->declaration.storage_class != STORAGE_CLASS_EXTERN) {
920 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
924 static bool is_main(entity_t *entity)
926 static symbol_t *sym_main = NULL;
927 if (sym_main == NULL) {
928 sym_main = symbol_table_insert("main");
931 if (entity->base.symbol != sym_main)
933 /* must be in outermost scope */
934 if (entity->base.parent_scope != ¤t_translation_unit->scope)
941 * Creates an entity representing a function.
943 * @param entity the function declaration/definition
944 * @param owner_type the owner type of this function, NULL
945 * for global functions
947 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
949 assert(entity->kind == ENTITY_FUNCTION);
950 if (entity->function.irentity != NULL)
951 return entity->function.irentity;
953 switch (entity->function.btk) {
956 case BUILTIN_LIBC_CHECK:
962 symbol_t *symbol = entity->base.symbol;
963 ident *id = new_id_from_str(symbol->string);
965 /* already an entity defined? */
966 ir_entity *irentity = entitymap_get(&entitymap, symbol);
967 bool const has_body = entity->function.body != NULL;
968 if (irentity != NULL) {
972 ir_type *ir_type_method;
973 if (entity->function.need_closure)
974 ir_type_method = create_method_type(&entity->declaration.type->function, true);
976 ir_type_method = get_ir_type(entity->declaration.type);
978 bool nested_function = false;
979 if (owner_type == NULL)
980 owner_type = get_glob_type();
982 nested_function = true;
984 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
985 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
989 ld_id = id_unique("inner.%u");
991 ld_id = create_ld_ident(entity);
992 set_entity_ld_ident(irentity, ld_id);
994 handle_decl_modifiers(irentity, entity);
996 if (! nested_function) {
997 storage_class_tag_t const storage_class
998 = (storage_class_tag_t) entity->declaration.storage_class;
999 if (storage_class == STORAGE_CLASS_STATIC) {
1000 set_entity_visibility(irentity, ir_visibility_local);
1002 set_entity_visibility(irentity, ir_visibility_external);
1005 bool const is_inline = entity->function.is_inline;
1006 if (is_inline && has_body) {
1007 if (((c_mode & _C99) && storage_class == STORAGE_CLASS_NONE)
1008 || ((c_mode & _C99) == 0
1009 && storage_class == STORAGE_CLASS_EXTERN)) {
1010 add_entity_linkage(irentity, IR_LINKAGE_NO_CODEGEN);
1014 /* nested functions are always local */
1015 set_entity_visibility(irentity, ir_visibility_local);
1018 /* We should check for file scope here, but as long as we compile C only
1019 this is not needed. */
1020 if (!freestanding && !has_body) {
1021 /* check for a known runtime function */
1022 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1023 if (id != rts_idents[i])
1026 function_type_t *function_type
1027 = &entity->declaration.type->function;
1028 /* rts_entities code can't handle a "wrong" number of parameters */
1029 if (function_type->unspecified_parameters)
1032 /* check number of parameters */
1033 int n_params = count_parameters(function_type);
1034 if (n_params != rts_data[i].n_params)
1037 type_t *return_type = skip_typeref(function_type->return_type);
1038 int n_res = is_type_void(return_type) ? 0 : 1;
1039 if (n_res != rts_data[i].n_res)
1042 /* ignore those rts functions not necessary needed for current mode */
1043 if ((c_mode & rts_data[i].flags) == 0)
1045 assert(rts_entities[rts_data[i].id] == NULL);
1046 rts_entities[rts_data[i].id] = irentity;
1050 entitymap_insert(&entitymap, symbol, irentity);
1053 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1054 entity->function.irentity = irentity;
1060 * Creates a SymConst for a given entity.
1062 * @param dbgi debug info
1063 * @param entity the entity
1065 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1067 assert(entity != NULL);
1068 union symconst_symbol sym;
1069 sym.entity_p = entity;
1070 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1073 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1075 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1078 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1081 if (is_Const(value)) {
1082 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1085 ir_node *cond = new_d_Cond(dbgi, value);
1086 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1087 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1088 ir_node *tblock = new_Block(1, &proj_true);
1089 ir_node *fblock = new_Block(1, &proj_false);
1090 set_cur_block(tblock);
1091 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1092 ir_node *tjump = new_Jmp();
1093 set_cur_block(fblock);
1094 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1095 ir_node *fjump = new_Jmp();
1097 ir_node *in[2] = { tjump, fjump };
1098 ir_node *mergeblock = new_Block(2, in);
1099 set_cur_block(mergeblock);
1100 ir_node *phi_in[2] = { const1, const0 };
1101 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1105 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1107 ir_mode *value_mode = get_irn_mode(value);
1109 if (value_mode == dest_mode)
1112 if (dest_mode == mode_b) {
1113 ir_node *zero = new_Const(get_mode_null(value_mode));
1114 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1116 } else if (value_mode == mode_b) {
1117 return create_conv_from_b(dbgi, value, dest_mode);
1120 return new_d_Conv(dbgi, value, dest_mode);
1124 * Creates a SymConst node representing a string constant.
1126 * @param src_pos the source position of the string constant
1127 * @param id_prefix a prefix for the name of the generated string constant
1128 * @param value the value of the string constant
1130 static ir_node *string_to_firm(source_position_t const *const src_pos, char const *const id_prefix, string_t const *const value)
1132 size_t const slen = get_string_len(value) + 1;
1133 ir_initializer_t *const initializer = create_initializer_compound(slen);
1134 ir_type * elem_type;
1135 switch (value->encoding) {
1136 case STRING_ENCODING_CHAR: {
1137 elem_type = ir_type_char;
1139 ir_mode *const mode = get_type_mode(elem_type);
1140 char const *p = value->begin;
1141 for (size_t i = 0; i < slen; ++i) {
1142 ir_tarval *tv = new_tarval_from_long(*p++, mode);
1143 ir_initializer_t *val = create_initializer_tarval(tv);
1144 set_initializer_compound_value(initializer, i, val);
1149 case STRING_ENCODING_WIDE: {
1150 elem_type = ir_type_wchar_t;
1152 ir_mode *const mode = get_type_mode(elem_type);
1153 char const *p = value->begin;
1154 for (size_t i = 0; i < slen; ++i) {
1155 assert(p <= value->begin + value->size);
1156 utf32 v = read_utf8_char(&p);
1157 ir_tarval *tv = new_tarval_from_long(v, mode);
1158 ir_initializer_t *val = create_initializer_tarval(tv);
1159 set_initializer_compound_value(initializer, i, val);
1164 panic("invalid string encoding");
1167 ir_type *const type = new_type_array(1, elem_type);
1168 set_array_bounds_int(type, 0, 0, slen);
1169 set_type_size_bytes( type, slen * get_type_size_bytes(elem_type));
1170 set_type_state( type, layout_fixed);
1172 ir_type *const global_type = get_glob_type();
1173 ident *const id = id_unique(id_prefix);
1174 dbg_info *const dbgi = get_dbg_info(src_pos);
1175 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1176 set_entity_ld_ident( entity, id);
1177 set_entity_visibility( entity, ir_visibility_private);
1178 add_entity_linkage( entity, IR_LINKAGE_CONSTANT);
1179 set_entity_initializer(entity, initializer);
1181 return create_symconst(dbgi, entity);
1184 static bool try_create_integer(literal_expression_t *literal, type_t *type)
1186 assert(type->kind == TYPE_ATOMIC);
1187 atomic_type_kind_t akind = type->atomic.akind;
1189 ir_mode *const mode = atomic_modes[akind];
1190 char const *const str = literal->value.begin;
1191 ir_tarval *const tv = new_tarval_from_str(str, literal->suffix - str, mode);
1192 if (tv == tarval_bad)
1195 literal->base.type = type;
1196 literal->target_value = tv;
1200 void determine_literal_type(literal_expression_t *const literal)
1202 assert(literal->base.kind == EXPR_LITERAL_INTEGER);
1204 /* -1: signed only, 0: any, 1: unsigned only */
1206 !is_type_signed(literal->base.type) ? 1 :
1207 literal->value.begin[0] == '0' ? 0 :
1208 -1; /* Decimal literals only try signed types. */
1210 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1211 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1213 if (try_create_integer(literal, literal->base.type))
1216 /* now try if the constant is small enough for some types */
1217 if (sign >= 0 && try_create_integer(literal, type_unsigned_int))
1219 if (sign <= 0 && try_create_integer(literal, type_long))
1221 if (sign >= 0 && try_create_integer(literal, type_unsigned_long))
1223 /* last try? then we should not report tarval_bad */
1225 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1226 if (sign <= 0 && try_create_integer(literal, type_long_long))
1231 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1232 bool res = try_create_integer(literal, type_unsigned_long_long);
1234 panic("internal error when parsing number literal");
1237 tarval_set_integer_overflow_mode(old_mode);
1241 * Creates a Const node representing a constant.
1243 static ir_node *literal_to_firm(const literal_expression_t *literal)
1245 type_t *type = skip_typeref(literal->base.type);
1246 ir_mode *mode = get_ir_mode_storage(type);
1247 const char *string = literal->value.begin;
1248 size_t size = literal->value.size;
1251 switch (literal->base.kind) {
1252 case EXPR_LITERAL_INTEGER:
1253 assert(literal->target_value != NULL);
1254 tv = literal->target_value;
1257 case EXPR_LITERAL_FLOATINGPOINT:
1258 tv = new_tarval_from_str(string, size, mode);
1261 case EXPR_LITERAL_BOOLEAN:
1262 if (string[0] == 't') {
1263 tv = get_mode_one(mode);
1265 assert(string[0] == 'f');
1266 case EXPR_LITERAL_MS_NOOP:
1267 tv = get_mode_null(mode);
1272 panic("Invalid literal kind found");
1275 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1276 ir_node *res = new_d_Const(dbgi, tv);
1277 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1278 return create_conv(dbgi, res, mode_arith);
1282 * Creates a Const node representing a character constant.
1284 static ir_node *char_literal_to_firm(string_literal_expression_t const *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->value.encoding) {
1293 case STRING_ENCODING_WIDE: {
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);
1302 case STRING_ENCODING_CHAR: {
1305 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1306 if (size == 1 && char_is_signed) {
1307 v = (signed char)string[0];
1310 for (size_t i = 0; i < size; ++i) {
1311 v = (v << 8) | ((unsigned char)string[i]);
1315 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1317 tv = new_tarval_from_str(buf, len, mode);
1322 panic("Invalid literal kind found");
1325 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1326 ir_node *res = new_d_Const(dbgi, tv);
1327 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1328 return create_conv(dbgi, res, mode_arith);
1332 * Allocate an area of size bytes aligned at alignment
1335 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1337 static unsigned area_cnt = 0;
1340 ir_type *tp = new_type_array(1, ir_type_char);
1341 set_array_bounds_int(tp, 0, 0, size);
1342 set_type_alignment_bytes(tp, alignment);
1344 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1345 ident *name = new_id_from_str(buf);
1346 ir_entity *area = new_entity(frame_type, name, tp);
1348 /* mark this entity as compiler generated */
1349 set_entity_compiler_generated(area, 1);
1354 * Return a node representing a trampoline region
1355 * for a given function entity.
1357 * @param dbgi debug info
1358 * @param entity the function entity
1360 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1362 ir_entity *region = NULL;
1365 if (current_trampolines != NULL) {
1366 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1367 if (current_trampolines[i].function == entity) {
1368 region = current_trampolines[i].region;
1373 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1375 ir_graph *irg = current_ir_graph;
1376 if (region == NULL) {
1377 /* create a new region */
1378 ir_type *frame_tp = get_irg_frame_type(irg);
1379 trampoline_region reg;
1380 reg.function = entity;
1382 reg.region = alloc_trampoline(frame_tp,
1383 be_params->trampoline_size,
1384 be_params->trampoline_align);
1385 ARR_APP1(trampoline_region, current_trampolines, reg);
1386 region = reg.region;
1388 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1393 * Creates a trampoline for a function represented by an entity.
1395 * @param dbgi debug info
1396 * @param mode the (reference) mode for the function address
1397 * @param entity the function entity
1399 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1402 assert(entity != NULL);
1404 in[0] = get_trampoline_region(dbgi, entity);
1405 in[1] = create_symconst(dbgi, entity);
1406 in[2] = get_irg_frame(current_ir_graph);
1408 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1409 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1410 return new_Proj(irn, mode, pn_Builtin_max+1);
1414 * Dereference an address.
1416 * @param dbgi debug info
1417 * @param type the type of the dereferenced result (the points_to type)
1418 * @param addr the address to dereference
1420 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1421 ir_node *const addr)
1423 type_t *skipped = skip_typeref(type);
1424 if (is_type_incomplete(skipped))
1427 ir_type *irtype = get_ir_type(skipped);
1428 if (is_compound_type(irtype)
1429 || is_Method_type(irtype)
1430 || is_Array_type(irtype)) {
1434 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1435 ? cons_volatile : cons_none;
1436 ir_mode *const mode = get_type_mode(irtype);
1437 ir_node *const memory = get_store();
1438 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1439 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1440 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1442 set_store(load_mem);
1444 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1445 return create_conv(dbgi, load_res, mode_arithmetic);
1449 * Returns the correct base address depending on whether it is a parameter or a
1450 * normal local variable.
1452 static ir_node *get_local_frame(ir_entity *const ent)
1454 ir_graph *const irg = current_ir_graph;
1455 const ir_type *const owner = get_entity_owner(ent);
1456 if (owner == current_outer_frame) {
1457 assert(current_static_link != NULL);
1458 return current_static_link;
1460 return get_irg_frame(irg);
1465 * Keep all memory edges of the given block.
1467 static void keep_all_memory(ir_node *block)
1469 ir_node *old = get_cur_block();
1471 set_cur_block(block);
1472 keep_alive(get_store());
1473 /* TODO: keep all memory edges from restricted pointers */
1477 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1479 entity_t *entity = ref->entity;
1480 if (entity->enum_value.tv == NULL) {
1481 type_t *type = skip_typeref(entity->enum_value.enum_type);
1482 assert(type->kind == TYPE_ENUM);
1483 determine_enum_values(&type->enumt);
1486 return new_Const(entity->enum_value.tv);
1489 static ir_node *reference_addr(const reference_expression_t *ref)
1491 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1492 entity_t *entity = ref->entity;
1493 assert(is_declaration(entity));
1495 if (entity->kind == ENTITY_FUNCTION
1496 && entity->function.btk != BUILTIN_NONE) {
1497 ir_entity *irentity = get_function_entity(entity, NULL);
1498 /* for gcc compatibility we have to produce (dummy) addresses for some
1499 * builtins which don't have entities */
1500 if (irentity == NULL) {
1501 source_position_t const *const pos = &ref->base.source_position;
1502 warningf(WARN_OTHER, pos, "taking address of builtin '%N'", ref->entity);
1504 /* simply create a NULL pointer */
1505 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1506 ir_node *res = new_Const(get_mode_null(mode));
1512 switch((declaration_kind_t) entity->declaration.kind) {
1513 case DECLARATION_KIND_UNKNOWN:
1515 case DECLARATION_KIND_PARAMETER:
1516 case DECLARATION_KIND_LOCAL_VARIABLE:
1517 /* you can store to a local variable (so we don't panic but return NULL
1518 * as an indicator for no real address) */
1520 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1521 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1525 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
1526 case DECLARATION_KIND_PARAMETER_ENTITY: {
1527 ir_entity *irentity = entity->variable.v.entity;
1528 ir_node *frame = get_local_frame(irentity);
1529 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1533 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1534 return entity->variable.v.vla_base;
1536 case DECLARATION_KIND_FUNCTION: {
1537 return create_symconst(dbgi, entity->function.irentity);
1540 case DECLARATION_KIND_INNER_FUNCTION: {
1541 type_t *const type = skip_typeref(entity->declaration.type);
1542 ir_mode *const mode = get_ir_mode_storage(type);
1543 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1544 /* inner function not using the closure */
1545 return create_symconst(dbgi, entity->function.irentity);
1547 /* need trampoline here */
1548 return create_trampoline(dbgi, mode, entity->function.irentity);
1552 case DECLARATION_KIND_COMPOUND_MEMBER:
1553 panic("not implemented reference type");
1556 panic("reference to declaration with unknown type found");
1559 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1561 dbg_info *const dbgi = get_dbg_info(&ref->base.source_position);
1562 entity_t *const entity = ref->entity;
1563 assert(is_declaration(entity));
1565 switch ((declaration_kind_t)entity->declaration.kind) {
1566 case DECLARATION_KIND_LOCAL_VARIABLE:
1567 case DECLARATION_KIND_PARAMETER: {
1568 type_t *const type = skip_typeref(entity->declaration.type);
1569 ir_mode *const mode = get_ir_mode_storage(type);
1570 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1571 return create_conv(dbgi, value, get_ir_mode_arithmetic(type));
1575 ir_node *const addr = reference_addr(ref);
1576 return deref_address(dbgi, entity->declaration.type, addr);
1582 * Transform calls to builtin functions.
1584 static ir_node *process_builtin_call(const call_expression_t *call)
1586 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1588 assert(call->function->kind == EXPR_REFERENCE);
1589 reference_expression_t *builtin = &call->function->reference;
1591 type_t *expr_type = skip_typeref(builtin->base.type);
1592 assert(is_type_pointer(expr_type));
1594 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1596 switch (builtin->entity->function.btk) {
1599 case BUILTIN_ALLOCA: {
1600 expression_t *argument = call->arguments->expression;
1601 ir_node *size = expression_to_firm(argument);
1603 ir_node *store = get_store();
1604 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1606 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1608 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1613 type_t *type = function_type->function.return_type;
1614 ir_mode *mode = get_ir_mode_arithmetic(type);
1615 ir_tarval *tv = get_mode_infinite(mode);
1616 ir_node *res = new_d_Const(dbgi, tv);
1620 /* Ignore string for now... */
1621 assert(is_type_function(function_type));
1622 type_t *type = function_type->function.return_type;
1623 ir_mode *mode = get_ir_mode_arithmetic(type);
1624 ir_tarval *tv = get_mode_NAN(mode);
1625 ir_node *res = new_d_Const(dbgi, tv);
1628 case BUILTIN_EXPECT: {
1629 expression_t *argument = call->arguments->expression;
1630 return _expression_to_firm(argument);
1632 case BUILTIN_VA_END:
1633 /* evaluate the argument of va_end for its side effects */
1634 _expression_to_firm(call->arguments->expression);
1636 case BUILTIN_OBJECT_SIZE: {
1637 /* determine value of "type" */
1638 expression_t *type_expression = call->arguments->next->expression;
1639 long type_val = fold_constant_to_int(type_expression);
1640 type_t *type = function_type->function.return_type;
1641 ir_mode *mode = get_ir_mode_arithmetic(type);
1642 /* just produce a "I don't know" result */
1643 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1644 get_mode_minus_one(mode);
1646 return new_d_Const(dbgi, result);
1648 case BUILTIN_ROTL: {
1649 ir_node *val = expression_to_firm(call->arguments->expression);
1650 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1651 ir_mode *mode = get_irn_mode(val);
1652 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1653 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1655 case BUILTIN_ROTR: {
1656 ir_node *val = expression_to_firm(call->arguments->expression);
1657 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1658 ir_mode *mode = get_irn_mode(val);
1659 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1660 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1661 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1662 return new_d_Rotl(dbgi, val, sub, mode);
1667 case BUILTIN_LIBC_CHECK:
1668 panic("builtin did not produce an entity");
1670 panic("invalid builtin found");
1674 * Transform a call expression.
1675 * Handles some special cases, like alloca() calls, which must be resolved
1676 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1677 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1680 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1682 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1683 assert(currently_reachable());
1685 expression_t *function = call->function;
1686 ir_node *callee = NULL;
1687 bool firm_builtin = false;
1688 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1689 if (function->kind == EXPR_REFERENCE) {
1690 const reference_expression_t *ref = &function->reference;
1691 entity_t *entity = ref->entity;
1693 if (entity->kind == ENTITY_FUNCTION) {
1694 builtin_kind_t builtin = entity->function.btk;
1695 if (builtin == BUILTIN_FIRM) {
1696 firm_builtin = true;
1697 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1698 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1699 && builtin != BUILTIN_LIBC_CHECK) {
1700 return process_builtin_call(call);
1705 callee = expression_to_firm(function);
1707 type_t *type = skip_typeref(function->base.type);
1708 assert(is_type_pointer(type));
1709 pointer_type_t *pointer_type = &type->pointer;
1710 type_t *points_to = skip_typeref(pointer_type->points_to);
1711 assert(is_type_function(points_to));
1712 function_type_t *function_type = &points_to->function;
1714 int n_parameters = 0;
1715 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1716 ir_type *new_method_type = NULL;
1717 if (function_type->variadic || function_type->unspecified_parameters) {
1718 const call_argument_t *argument = call->arguments;
1719 for ( ; argument != NULL; argument = argument->next) {
1723 /* we need to construct a new method type matching the call
1725 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1726 int n_res = get_method_n_ress(ir_method_type);
1727 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1728 set_method_calling_convention(new_method_type,
1729 get_method_calling_convention(ir_method_type));
1730 set_method_additional_properties(new_method_type,
1731 get_method_additional_properties(ir_method_type));
1732 set_method_variadicity(new_method_type,
1733 get_method_variadicity(ir_method_type));
1735 for (int i = 0; i < n_res; ++i) {
1736 set_method_res_type(new_method_type, i,
1737 get_method_res_type(ir_method_type, i));
1739 argument = call->arguments;
1740 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1741 expression_t *expression = argument->expression;
1742 ir_type *irtype = get_ir_type(expression->base.type);
1743 set_method_param_type(new_method_type, i, irtype);
1745 ir_method_type = new_method_type;
1747 n_parameters = get_method_n_params(ir_method_type);
1750 ir_node *in[n_parameters];
1752 const call_argument_t *argument = call->arguments;
1753 for (int n = 0; n < n_parameters; ++n) {
1754 expression_t *expression = argument->expression;
1755 ir_node *arg_node = expression_to_firm(expression);
1757 type_t *arg_type = skip_typeref(expression->base.type);
1758 if (!is_type_compound(arg_type)) {
1759 ir_mode *const mode = get_ir_mode_storage(arg_type);
1760 arg_node = create_conv(dbgi, arg_node, mode);
1765 argument = argument->next;
1769 if (function_type->modifiers & DM_CONST) {
1770 store = get_irg_no_mem(current_ir_graph);
1772 store = get_store();
1776 type_t *return_type = skip_typeref(function_type->return_type);
1777 ir_node *result = NULL;
1779 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1781 if (! (function_type->modifiers & DM_CONST)) {
1782 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1786 if (!is_type_void(return_type)) {
1787 assert(is_type_scalar(return_type));
1788 ir_mode *mode = get_ir_mode_storage(return_type);
1789 result = new_Proj(node, mode, pn_Builtin_max+1);
1790 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1791 result = create_conv(NULL, result, mode_arith);
1794 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1795 if (! (function_type->modifiers & DM_CONST)) {
1796 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1800 if (!is_type_void(return_type)) {
1801 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1802 ir_mode *const mode = get_ir_mode_storage(return_type);
1803 result = new_Proj(resproj, mode, 0);
1804 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1805 result = create_conv(NULL, result, mode_arith);
1809 if (function_type->modifiers & DM_NORETURN) {
1810 /* A dead end: Keep the Call and the Block. Also place all further
1811 * nodes into a new and unreachable block. */
1813 keep_alive(get_cur_block());
1814 ir_node *block = new_Block(0, NULL);
1815 set_cur_block(block);
1821 static ir_node *statement_to_firm(statement_t *statement);
1822 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1824 static ir_node *expression_to_addr(const expression_t *expression);
1825 static ir_node *create_condition_evaluation(expression_t const *expression, jump_target *true_target, jump_target *false_target);
1827 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1830 if (!is_type_compound(type)) {
1831 ir_mode *mode = get_ir_mode_storage(type);
1832 value = create_conv(dbgi, value, mode);
1835 ir_node *memory = get_store();
1837 if (is_type_scalar(type)) {
1838 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1839 ? cons_volatile : cons_none;
1840 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1841 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1842 set_store(store_mem);
1844 ir_type *irtype = get_ir_type(type);
1845 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1846 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1847 set_store(copyb_mem);
1851 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1853 ir_tarval *all_one = get_mode_all_one(mode);
1854 int mode_size = get_mode_size_bits(mode);
1855 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1857 assert(offset >= 0);
1859 assert(offset + size <= mode_size);
1860 if (size == mode_size) {
1864 long shiftr = get_mode_size_bits(mode) - size;
1865 long shiftl = offset;
1866 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1867 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1868 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1869 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1874 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1875 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1878 ir_type *entity_type = get_entity_type(entity);
1879 ir_type *base_type = get_primitive_base_type(entity_type);
1880 ir_mode *mode = get_type_mode(base_type);
1881 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1883 value = create_conv(dbgi, value, mode);
1885 /* kill upper bits of value and shift to right position */
1886 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1887 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1888 unsigned base_bits = get_mode_size_bits(mode);
1889 unsigned shiftwidth = base_bits - bitsize;
1891 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1892 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1894 unsigned shrwidth = base_bits - bitsize - bitoffset;
1895 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
1896 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
1898 /* load current value */
1899 ir_node *mem = get_store();
1900 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
1901 set_volatile ? cons_volatile : cons_none);
1902 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1903 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1904 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
1905 ir_tarval *inv_mask = tarval_not(shift_mask);
1906 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
1907 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
1909 /* construct new value and store */
1910 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
1911 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
1912 set_volatile ? cons_volatile : cons_none);
1913 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1914 set_store(store_mem);
1920 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
1921 if (mode_is_signed(mode)) {
1922 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
1924 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
1929 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
1932 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
1933 entity_t *entity = expression->compound_entry;
1934 type_t *base_type = entity->declaration.type;
1935 ir_mode *mode = get_ir_mode_storage(base_type);
1936 ir_node *mem = get_store();
1937 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
1938 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1939 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1940 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1942 ir_mode *amode = mode;
1943 /* optimisation, since shifting in modes < machine_size is usually
1945 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
1948 unsigned amode_size = get_mode_size_bits(amode);
1949 load_res = create_conv(dbgi, load_res, amode);
1951 set_store(load_mem);
1953 /* kill upper bits */
1954 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
1955 unsigned bitoffset = entity->compound_member.bit_offset;
1956 unsigned bitsize = entity->compound_member.bit_size;
1957 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
1958 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
1959 ir_node *countl = new_d_Const(dbgi, tvl);
1960 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
1962 unsigned shift_bitsr = bitoffset + shift_bitsl;
1963 assert(shift_bitsr <= amode_size);
1964 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
1965 ir_node *countr = new_d_Const(dbgi, tvr);
1967 if (mode_is_signed(mode)) {
1968 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
1970 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
1973 type_t *type = expression->base.type;
1974 ir_mode *resmode = get_ir_mode_arithmetic(type);
1975 return create_conv(dbgi, shiftr, resmode);
1978 /* make sure the selected compound type is constructed */
1979 static void construct_select_compound(const select_expression_t *expression)
1981 type_t *type = skip_typeref(expression->compound->base.type);
1982 if (is_type_pointer(type)) {
1983 type = type->pointer.points_to;
1985 (void) get_ir_type(type);
1988 static ir_node *set_value_for_expression_addr(const expression_t *expression,
1989 ir_node *value, ir_node *addr)
1991 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
1992 type_t *type = skip_typeref(expression->base.type);
1994 if (!is_type_compound(type)) {
1995 ir_mode *mode = get_ir_mode_storage(type);
1996 value = create_conv(dbgi, value, mode);
1999 if (expression->kind == EXPR_REFERENCE) {
2000 const reference_expression_t *ref = &expression->reference;
2002 entity_t *entity = ref->entity;
2003 assert(is_declaration(entity));
2004 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2005 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2006 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2007 set_value(entity->variable.v.value_number, value);
2013 addr = expression_to_addr(expression);
2014 assert(addr != NULL);
2016 if (expression->kind == EXPR_SELECT) {
2017 const select_expression_t *select = &expression->select;
2019 construct_select_compound(select);
2021 entity_t *entity = select->compound_entry;
2022 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2023 if (entity->compound_member.bitfield) {
2024 ir_entity *irentity = entity->compound_member.entity;
2026 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2027 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2028 set_volatile, true);
2033 assign_value(dbgi, addr, type, value);
2037 static void set_value_for_expression(const expression_t *expression,
2040 set_value_for_expression_addr(expression, value, NULL);
2043 static ir_node *get_value_from_lvalue(const expression_t *expression,
2046 if (expression->kind == EXPR_REFERENCE) {
2047 const reference_expression_t *ref = &expression->reference;
2049 entity_t *entity = ref->entity;
2050 assert(entity->kind == ENTITY_VARIABLE
2051 || entity->kind == ENTITY_PARAMETER);
2052 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2054 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2055 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2056 value_number = entity->variable.v.value_number;
2057 assert(addr == NULL);
2058 type_t *type = skip_typeref(expression->base.type);
2059 ir_mode *mode = get_ir_mode_storage(type);
2060 ir_node *res = get_value(value_number, mode);
2061 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2065 assert(addr != NULL);
2066 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2069 if (expression->kind == EXPR_SELECT &&
2070 expression->select.compound_entry->compound_member.bitfield) {
2071 construct_select_compound(&expression->select);
2072 value = bitfield_extract_to_firm(&expression->select, addr);
2074 value = deref_address(dbgi, expression->base.type, addr);
2081 static ir_node *create_incdec(const unary_expression_t *expression)
2083 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2084 const expression_t *value_expr = expression->value;
2085 ir_node *addr = expression_to_addr(value_expr);
2086 ir_node *value = get_value_from_lvalue(value_expr, addr);
2088 type_t *type = skip_typeref(expression->base.type);
2089 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2092 if (is_type_pointer(type)) {
2093 pointer_type_t *pointer_type = &type->pointer;
2094 offset = get_type_size_node(pointer_type->points_to);
2096 assert(is_type_arithmetic(type));
2097 offset = new_Const(get_mode_one(mode));
2101 ir_node *store_value;
2102 switch(expression->base.kind) {
2103 case EXPR_UNARY_POSTFIX_INCREMENT:
2105 store_value = new_d_Add(dbgi, value, offset, mode);
2107 case EXPR_UNARY_POSTFIX_DECREMENT:
2109 store_value = new_d_Sub(dbgi, value, offset, mode);
2111 case EXPR_UNARY_PREFIX_INCREMENT:
2112 result = new_d_Add(dbgi, value, offset, mode);
2113 store_value = result;
2115 case EXPR_UNARY_PREFIX_DECREMENT:
2116 result = new_d_Sub(dbgi, value, offset, mode);
2117 store_value = result;
2120 panic("no incdec expr in create_incdec");
2123 set_value_for_expression_addr(value_expr, store_value, addr);
2128 static bool is_local_variable(expression_t *expression)
2130 if (expression->kind != EXPR_REFERENCE)
2132 reference_expression_t *ref_expr = &expression->reference;
2133 entity_t *entity = ref_expr->entity;
2134 if (entity->kind != ENTITY_VARIABLE)
2136 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2137 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2140 static ir_relation get_relation(const expression_kind_t kind)
2143 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2144 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2145 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2146 case EXPR_BINARY_ISLESS:
2147 case EXPR_BINARY_LESS: return ir_relation_less;
2148 case EXPR_BINARY_ISLESSEQUAL:
2149 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2150 case EXPR_BINARY_ISGREATER:
2151 case EXPR_BINARY_GREATER: return ir_relation_greater;
2152 case EXPR_BINARY_ISGREATEREQUAL:
2153 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2154 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2159 panic("trying to get ir_relation from non-comparison binexpr type");
2163 * Handle the assume optimizer hint: check if a Confirm
2164 * node can be created.
2166 * @param dbi debug info
2167 * @param expr the IL assume expression
2169 * we support here only some simple cases:
2174 static ir_node *handle_assume_compare(dbg_info *dbi,
2175 const binary_expression_t *expression)
2177 expression_t *op1 = expression->left;
2178 expression_t *op2 = expression->right;
2179 entity_t *var2, *var = NULL;
2180 ir_node *res = NULL;
2181 ir_relation relation = get_relation(expression->base.kind);
2183 if (is_local_variable(op1) && is_local_variable(op2)) {
2184 var = op1->reference.entity;
2185 var2 = op2->reference.entity;
2187 type_t *const type = skip_typeref(var->declaration.type);
2188 ir_mode *const mode = get_ir_mode_storage(type);
2190 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2191 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2193 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2194 set_value(var2->variable.v.value_number, res);
2196 res = new_d_Confirm(dbi, irn1, irn2, relation);
2197 set_value(var->variable.v.value_number, res);
2202 expression_t *con = NULL;
2203 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2204 var = op1->reference.entity;
2206 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2207 relation = get_inversed_relation(relation);
2208 var = op2->reference.entity;
2213 type_t *const type = skip_typeref(var->declaration.type);
2214 ir_mode *const mode = get_ir_mode_storage(type);
2216 res = get_value(var->variable.v.value_number, mode);
2217 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2218 set_value(var->variable.v.value_number, res);
2224 * Handle the assume optimizer hint.
2226 * @param dbi debug info
2227 * @param expr the IL assume expression
2229 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2231 switch(expression->kind) {
2232 case EXPR_BINARY_EQUAL:
2233 case EXPR_BINARY_NOTEQUAL:
2234 case EXPR_BINARY_LESS:
2235 case EXPR_BINARY_LESSEQUAL:
2236 case EXPR_BINARY_GREATER:
2237 case EXPR_BINARY_GREATEREQUAL:
2238 return handle_assume_compare(dbi, &expression->binary);
2244 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2245 type_t *from_type, type_t *type)
2247 type = skip_typeref(type);
2248 if (is_type_void(type)) {
2249 /* make sure firm type is constructed */
2250 (void) get_ir_type(type);
2253 if (!is_type_scalar(type)) {
2254 /* make sure firm type is constructed */
2255 (void) get_ir_type(type);
2259 from_type = skip_typeref(from_type);
2260 ir_mode *mode = get_ir_mode_storage(type);
2261 /* check for conversion from / to __based types */
2262 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2263 const variable_t *from_var = from_type->pointer.base_variable;
2264 const variable_t *to_var = type->pointer.base_variable;
2265 if (from_var != to_var) {
2266 if (from_var != NULL) {
2267 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2268 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2269 value_node = new_d_Add(dbgi, value_node, base, mode);
2271 if (to_var != NULL) {
2272 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2273 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2274 value_node = new_d_Sub(dbgi, value_node, base, mode);
2279 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2280 /* bool adjustments (we save a mode_Bu, but have to temporarily
2281 * convert to mode_b so we only get a 0/1 value */
2282 value_node = create_conv(dbgi, value_node, mode_b);
2285 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2286 ir_node *node = create_conv(dbgi, value_node, mode);
2287 node = create_conv(dbgi, node, mode_arith);
2292 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2294 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2295 type_t *type = skip_typeref(expression->base.type);
2297 const expression_t *value = expression->value;
2299 switch(expression->base.kind) {
2300 case EXPR_UNARY_TAKE_ADDRESS:
2301 return expression_to_addr(value);
2303 case EXPR_UNARY_NEGATE: {
2304 ir_node *value_node = expression_to_firm(value);
2305 ir_mode *mode = get_ir_mode_arithmetic(type);
2306 return new_d_Minus(dbgi, value_node, mode);
2308 case EXPR_UNARY_PLUS:
2309 return expression_to_firm(value);
2310 case EXPR_UNARY_BITWISE_NEGATE: {
2311 ir_node *value_node = expression_to_firm(value);
2312 ir_mode *mode = get_ir_mode_arithmetic(type);
2313 return new_d_Not(dbgi, value_node, mode);
2315 case EXPR_UNARY_NOT: {
2316 ir_node *value_node = _expression_to_firm(value);
2317 value_node = create_conv(dbgi, value_node, mode_b);
2318 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2321 case EXPR_UNARY_DEREFERENCE: {
2322 ir_node *value_node = expression_to_firm(value);
2323 type_t *value_type = skip_typeref(value->base.type);
2324 assert(is_type_pointer(value_type));
2326 /* check for __based */
2327 const variable_t *const base_var = value_type->pointer.base_variable;
2328 if (base_var != NULL) {
2329 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2330 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2331 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2333 type_t *points_to = value_type->pointer.points_to;
2334 return deref_address(dbgi, points_to, value_node);
2336 case EXPR_UNARY_POSTFIX_INCREMENT:
2337 case EXPR_UNARY_POSTFIX_DECREMENT:
2338 case EXPR_UNARY_PREFIX_INCREMENT:
2339 case EXPR_UNARY_PREFIX_DECREMENT:
2340 return create_incdec(expression);
2341 case EXPR_UNARY_CAST: {
2342 ir_node *value_node = expression_to_firm(value);
2343 type_t *from_type = value->base.type;
2344 return create_cast(dbgi, value_node, from_type, type);
2346 case EXPR_UNARY_ASSUME:
2347 return handle_assume(dbgi, value);
2352 panic("invalid UNEXPR type found");
2356 * produces a 0/1 depending of the value of a mode_b node
2358 static ir_node *produce_condition_result(const expression_t *expression,
2359 ir_mode *mode, dbg_info *dbgi)
2361 jump_target true_target;
2362 jump_target false_target;
2363 init_jump_target(&true_target, NULL);
2364 init_jump_target(&false_target, NULL);
2365 create_condition_evaluation(expression, &true_target, &false_target);
2367 ir_node *val = NULL;
2368 jump_target exit_target;
2369 init_jump_target(&exit_target, NULL);
2371 if (enter_jump_target(&true_target)) {
2372 val = new_Const(get_mode_one(mode));
2373 jump_to_target(&exit_target);
2376 if (enter_jump_target(&false_target)) {
2377 ir_node *const zero = new_Const(get_mode_null(mode));
2378 jump_to_target(&exit_target);
2380 ir_node *const in[] = { val, zero };
2381 val = new_rd_Phi(dbgi, exit_target.block, lengthof(in), in, mode);
2387 if (!enter_jump_target(&exit_target)) {
2388 set_cur_block(new_Block(0, NULL));
2389 val = new_Unknown(mode);
2394 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2395 ir_node *value, type_t *type)
2397 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2398 assert(is_type_pointer(type));
2399 pointer_type_t *const pointer_type = &type->pointer;
2400 type_t *const points_to = skip_typeref(pointer_type->points_to);
2401 ir_node * elem_size = get_type_size_node(points_to);
2402 elem_size = create_conv(dbgi, elem_size, mode);
2403 value = create_conv(dbgi, value, mode);
2404 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2408 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2409 ir_node *left, ir_node *right)
2412 type_t *type_left = skip_typeref(expression->left->base.type);
2413 type_t *type_right = skip_typeref(expression->right->base.type);
2415 expression_kind_t kind = expression->base.kind;
2418 case EXPR_BINARY_SHIFTLEFT:
2419 case EXPR_BINARY_SHIFTRIGHT:
2420 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2421 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2422 mode = get_ir_mode_arithmetic(expression->base.type);
2423 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2426 case EXPR_BINARY_SUB:
2427 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2428 const pointer_type_t *const ptr_type = &type_left->pointer;
2430 mode = get_ir_mode_arithmetic(expression->base.type);
2431 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2432 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2433 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2434 ir_node *const no_mem = new_NoMem();
2435 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2436 mode, op_pin_state_floats);
2437 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2440 case EXPR_BINARY_SUB_ASSIGN:
2441 if (is_type_pointer(type_left)) {
2442 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2443 mode = get_ir_mode_arithmetic(type_left);
2448 case EXPR_BINARY_ADD:
2449 case EXPR_BINARY_ADD_ASSIGN:
2450 if (is_type_pointer(type_left)) {
2451 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2452 mode = get_ir_mode_arithmetic(type_left);
2454 } else if (is_type_pointer(type_right)) {
2455 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2456 mode = get_ir_mode_arithmetic(type_right);
2463 mode = get_ir_mode_arithmetic(type_right);
2464 left = create_conv(dbgi, left, mode);
2469 case EXPR_BINARY_ADD_ASSIGN:
2470 case EXPR_BINARY_ADD:
2471 return new_d_Add(dbgi, left, right, mode);
2472 case EXPR_BINARY_SUB_ASSIGN:
2473 case EXPR_BINARY_SUB:
2474 return new_d_Sub(dbgi, left, right, mode);
2475 case EXPR_BINARY_MUL_ASSIGN:
2476 case EXPR_BINARY_MUL:
2477 return new_d_Mul(dbgi, left, right, mode);
2478 case EXPR_BINARY_BITWISE_AND:
2479 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2480 return new_d_And(dbgi, left, right, mode);
2481 case EXPR_BINARY_BITWISE_OR:
2482 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2483 return new_d_Or(dbgi, left, right, mode);
2484 case EXPR_BINARY_BITWISE_XOR:
2485 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2486 return new_d_Eor(dbgi, left, right, mode);
2487 case EXPR_BINARY_SHIFTLEFT:
2488 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2489 return new_d_Shl(dbgi, left, right, mode);
2490 case EXPR_BINARY_SHIFTRIGHT:
2491 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2492 if (mode_is_signed(mode)) {
2493 return new_d_Shrs(dbgi, left, right, mode);
2495 return new_d_Shr(dbgi, left, right, mode);
2497 case EXPR_BINARY_DIV:
2498 case EXPR_BINARY_DIV_ASSIGN: {
2499 ir_node *pin = new_Pin(new_NoMem());
2500 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2501 op_pin_state_floats);
2502 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2505 case EXPR_BINARY_MOD:
2506 case EXPR_BINARY_MOD_ASSIGN: {
2507 ir_node *pin = new_Pin(new_NoMem());
2508 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2509 op_pin_state_floats);
2510 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2514 panic("unexpected expression kind");
2518 static ir_node *create_lazy_op(const binary_expression_t *expression)
2520 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2521 type_t *type = skip_typeref(expression->base.type);
2522 ir_mode *mode = get_ir_mode_arithmetic(type);
2524 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2525 bool val = fold_constant_to_bool(expression->left);
2526 expression_kind_t ekind = expression->base.kind;
2527 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2528 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2530 return new_Const(get_mode_null(mode));
2534 return new_Const(get_mode_one(mode));
2538 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2539 bool valr = fold_constant_to_bool(expression->right);
2540 return create_Const_from_bool(mode, valr);
2543 return produce_condition_result(expression->right, mode, dbgi);
2546 return produce_condition_result((const expression_t*) expression, mode,
2550 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2551 ir_node *right, ir_mode *mode);
2553 static ir_node *create_assign_binop(const binary_expression_t *expression)
2555 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2556 const expression_t *left_expr = expression->left;
2557 type_t *type = skip_typeref(left_expr->base.type);
2558 ir_node *right = expression_to_firm(expression->right);
2559 ir_node *left_addr = expression_to_addr(left_expr);
2560 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2561 ir_node *result = create_op(dbgi, expression, left, right);
2563 result = create_cast(dbgi, result, expression->right->base.type, type);
2565 result = set_value_for_expression_addr(left_expr, result, left_addr);
2567 if (!is_type_compound(type)) {
2568 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2569 result = create_conv(dbgi, result, mode_arithmetic);
2574 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2576 expression_kind_t kind = expression->base.kind;
2579 case EXPR_BINARY_EQUAL:
2580 case EXPR_BINARY_NOTEQUAL:
2581 case EXPR_BINARY_LESS:
2582 case EXPR_BINARY_LESSEQUAL:
2583 case EXPR_BINARY_GREATER:
2584 case EXPR_BINARY_GREATEREQUAL:
2585 case EXPR_BINARY_ISGREATER:
2586 case EXPR_BINARY_ISGREATEREQUAL:
2587 case EXPR_BINARY_ISLESS:
2588 case EXPR_BINARY_ISLESSEQUAL:
2589 case EXPR_BINARY_ISLESSGREATER:
2590 case EXPR_BINARY_ISUNORDERED: {
2591 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2592 ir_node *left = expression_to_firm(expression->left);
2593 ir_node *right = expression_to_firm(expression->right);
2594 ir_relation relation = get_relation(kind);
2595 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2598 case EXPR_BINARY_ASSIGN: {
2599 ir_node *addr = expression_to_addr(expression->left);
2600 ir_node *right = expression_to_firm(expression->right);
2602 = set_value_for_expression_addr(expression->left, right, addr);
2604 type_t *type = skip_typeref(expression->base.type);
2605 if (!is_type_compound(type)) {
2606 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2607 res = create_conv(NULL, res, mode_arithmetic);
2611 case EXPR_BINARY_ADD:
2612 case EXPR_BINARY_SUB:
2613 case EXPR_BINARY_MUL:
2614 case EXPR_BINARY_DIV:
2615 case EXPR_BINARY_MOD:
2616 case EXPR_BINARY_BITWISE_AND:
2617 case EXPR_BINARY_BITWISE_OR:
2618 case EXPR_BINARY_BITWISE_XOR:
2619 case EXPR_BINARY_SHIFTLEFT:
2620 case EXPR_BINARY_SHIFTRIGHT:
2622 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2623 ir_node *left = expression_to_firm(expression->left);
2624 ir_node *right = expression_to_firm(expression->right);
2625 return create_op(dbgi, expression, left, right);
2627 case EXPR_BINARY_LOGICAL_AND:
2628 case EXPR_BINARY_LOGICAL_OR:
2629 return create_lazy_op(expression);
2630 case EXPR_BINARY_COMMA:
2631 /* create side effects of left side */
2632 (void) expression_to_firm(expression->left);
2633 return _expression_to_firm(expression->right);
2635 case EXPR_BINARY_ADD_ASSIGN:
2636 case EXPR_BINARY_SUB_ASSIGN:
2637 case EXPR_BINARY_MUL_ASSIGN:
2638 case EXPR_BINARY_MOD_ASSIGN:
2639 case EXPR_BINARY_DIV_ASSIGN:
2640 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2641 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2642 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2643 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2644 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2645 return create_assign_binop(expression);
2647 panic("invalid binexpr type");
2651 static ir_node *array_access_addr(const array_access_expression_t *expression)
2653 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2654 ir_node *base_addr = expression_to_firm(expression->array_ref);
2655 ir_node *offset = expression_to_firm(expression->index);
2656 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2657 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2658 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2663 static ir_node *array_access_to_firm(
2664 const array_access_expression_t *expression)
2666 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2667 ir_node *addr = array_access_addr(expression);
2668 type_t *type = revert_automatic_type_conversion(
2669 (const expression_t*) expression);
2670 type = skip_typeref(type);
2672 return deref_address(dbgi, type, addr);
2675 static long get_offsetof_offset(const offsetof_expression_t *expression)
2677 type_t *orig_type = expression->type;
2680 designator_t *designator = expression->designator;
2681 for ( ; designator != NULL; designator = designator->next) {
2682 type_t *type = skip_typeref(orig_type);
2683 /* be sure the type is constructed */
2684 (void) get_ir_type(type);
2686 if (designator->symbol != NULL) {
2687 assert(is_type_compound(type));
2688 symbol_t *symbol = designator->symbol;
2690 compound_t *compound = type->compound.compound;
2691 entity_t *iter = compound->members.entities;
2692 for (; iter->base.symbol != symbol; iter = iter->base.next) {}
2694 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2695 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2696 offset += get_entity_offset(iter->compound_member.entity);
2698 orig_type = iter->declaration.type;
2700 expression_t *array_index = designator->array_index;
2701 assert(designator->array_index != NULL);
2702 assert(is_type_array(type));
2704 long index = fold_constant_to_int(array_index);
2705 ir_type *arr_type = get_ir_type(type);
2706 ir_type *elem_type = get_array_element_type(arr_type);
2707 long elem_size = get_type_size_bytes(elem_type);
2709 offset += index * elem_size;
2711 orig_type = type->array.element_type;
2718 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2720 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2721 long offset = get_offsetof_offset(expression);
2722 ir_tarval *tv = new_tarval_from_long(offset, mode);
2723 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2725 return new_d_Const(dbgi, tv);
2728 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2729 ir_entity *entity, type_t *type);
2730 static ir_initializer_t *create_ir_initializer(
2731 const initializer_t *initializer, type_t *type);
2733 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2734 initializer_t *initializer,
2737 /* create the ir_initializer */
2738 PUSH_IRG(get_const_code_irg());
2739 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2742 ident *const id = id_unique("initializer.%u");
2743 ir_type *const irtype = get_ir_type(type);
2744 ir_type *const global_type = get_glob_type();
2745 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2746 set_entity_ld_ident(entity, id);
2747 set_entity_visibility(entity, ir_visibility_private);
2748 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2749 set_entity_initializer(entity, irinitializer);
2753 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2755 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2756 type_t *type = expression->type;
2757 initializer_t *initializer = expression->initializer;
2759 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2760 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2761 return create_symconst(dbgi, entity);
2763 /* create an entity on the stack */
2764 ident *const id = id_unique("CompLit.%u");
2765 ir_type *const irtype = get_ir_type(type);
2766 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2768 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2769 set_entity_ld_ident(entity, id);
2771 /* create initialisation code */
2772 create_local_initializer(initializer, dbgi, entity, type);
2774 /* create a sel for the compound literal address */
2775 ir_node *frame = get_irg_frame(current_ir_graph);
2776 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2781 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2783 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2784 type_t *const type = expr->type;
2785 ir_node *const addr = compound_literal_addr(expr);
2786 return deref_address(dbgi, type, addr);
2790 * Transform a sizeof expression into Firm code.
2792 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2794 type_t *const type = skip_typeref(expression->type);
2795 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2796 if (is_type_array(type) && type->array.is_vla
2797 && expression->tp_expression != NULL) {
2798 expression_to_firm(expression->tp_expression);
2801 return get_type_size_node(type);
2804 static entity_t *get_expression_entity(const expression_t *expression)
2806 if (expression->kind != EXPR_REFERENCE)
2809 return expression->reference.entity;
2812 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2814 switch(entity->kind) {
2815 case DECLARATION_KIND_CASES:
2816 return entity->declaration.alignment;
2819 return entity->compound.alignment;
2820 case ENTITY_TYPEDEF:
2821 return entity->typedefe.alignment;
2829 * Transform an alignof expression into Firm code.
2831 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2833 unsigned alignment = 0;
2835 const expression_t *tp_expression = expression->tp_expression;
2836 if (tp_expression != NULL) {
2837 entity_t *entity = get_expression_entity(tp_expression);
2838 if (entity != NULL) {
2839 alignment = get_cparser_entity_alignment(entity);
2843 if (alignment == 0) {
2844 type_t *type = expression->type;
2845 alignment = get_type_alignment(type);
2848 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2849 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2850 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2851 return new_d_Const(dbgi, tv);
2854 static void init_ir_types(void);
2856 ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2858 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2860 bool constant_folding_old = constant_folding;
2861 constant_folding = true;
2862 int old_optimize = get_optimize();
2863 int old_constant_folding = get_opt_constant_folding();
2865 set_opt_constant_folding(1);
2869 PUSH_IRG(get_const_code_irg());
2870 ir_node *const cnst = _expression_to_firm(expression);
2873 set_optimize(old_optimize);
2874 set_opt_constant_folding(old_constant_folding);
2876 if (!is_Const(cnst)) {
2877 panic("couldn't fold constant");
2880 constant_folding = constant_folding_old;
2882 ir_tarval *const tv = get_Const_tarval(cnst);
2883 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
2884 return tarval_convert_to(tv, mode);
2887 /* this function is only used in parser.c, but it relies on libfirm functionality */
2888 bool constant_is_negative(const expression_t *expression)
2890 ir_tarval *tv = fold_constant_to_tarval(expression);
2891 return tarval_is_negative(tv);
2894 long fold_constant_to_int(const expression_t *expression)
2896 ir_tarval *tv = fold_constant_to_tarval(expression);
2897 if (!tarval_is_long(tv)) {
2898 panic("result of constant folding is not integer");
2901 return get_tarval_long(tv);
2904 bool fold_constant_to_bool(const expression_t *expression)
2906 ir_tarval *tv = fold_constant_to_tarval(expression);
2907 return !tarval_is_null(tv);
2910 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2912 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2914 /* first try to fold a constant condition */
2915 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
2916 bool val = fold_constant_to_bool(expression->condition);
2918 expression_t *true_expression = expression->true_expression;
2919 if (true_expression == NULL)
2920 true_expression = expression->condition;
2921 return expression_to_firm(true_expression);
2923 return expression_to_firm(expression->false_expression);
2927 jump_target true_target;
2928 jump_target false_target;
2929 init_jump_target(&true_target, NULL);
2930 init_jump_target(&false_target, NULL);
2931 ir_node *const cond_expr = create_condition_evaluation(expression->condition, &true_target, &false_target);
2933 ir_node *val = NULL;
2934 jump_target exit_target;
2935 init_jump_target(&exit_target, NULL);
2937 if (enter_jump_target(&true_target)) {
2938 if (expression->true_expression) {
2939 val = expression_to_firm(expression->true_expression);
2940 } else if (cond_expr && get_irn_mode(cond_expr) != mode_b) {
2943 /* Condition ended with a short circuit (&&, ||, !) operation or a
2944 * comparison. Generate a "1" as value for the true branch. */
2945 val = new_Const(get_mode_one(mode_Is));
2947 jump_to_target(&exit_target);
2950 if (enter_jump_target(&false_target)) {
2951 ir_node *const false_val = expression_to_firm(expression->false_expression);
2952 jump_to_target(&exit_target);
2954 ir_node *const in[] = { val, false_val };
2955 val = new_rd_Phi(dbgi, exit_target.block, lengthof(in), in, get_irn_mode(val));
2961 if (!enter_jump_target(&exit_target)) {
2962 set_cur_block(new_Block(0, NULL));
2963 type_t *const type = skip_typeref(expression->base.type);
2964 if (!is_type_void(type))
2965 val = new_Unknown(get_ir_mode_arithmetic(type));
2971 * Returns an IR-node representing the address of a field.
2973 static ir_node *select_addr(const select_expression_t *expression)
2975 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2977 construct_select_compound(expression);
2979 ir_node *compound_addr = expression_to_firm(expression->compound);
2981 entity_t *entry = expression->compound_entry;
2982 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2983 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2985 if (constant_folding) {
2986 ir_mode *mode = get_irn_mode(compound_addr);
2987 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
2988 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
2989 return new_d_Add(dbgi, compound_addr, ofs, mode);
2991 ir_entity *irentity = entry->compound_member.entity;
2992 assert(irentity != NULL);
2993 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
2997 static ir_node *select_to_firm(const select_expression_t *expression)
2999 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3000 ir_node *addr = select_addr(expression);
3001 type_t *type = revert_automatic_type_conversion(
3002 (const expression_t*) expression);
3003 type = skip_typeref(type);
3005 entity_t *entry = expression->compound_entry;
3006 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3008 if (entry->compound_member.bitfield) {
3009 return bitfield_extract_to_firm(expression, addr);
3012 return deref_address(dbgi, type, addr);
3015 /* Values returned by __builtin_classify_type. */
3016 typedef enum gcc_type_class
3022 enumeral_type_class,
3025 reference_type_class,
3029 function_type_class,
3040 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3042 type_t *type = expr->type_expression->base.type;
3044 /* FIXME gcc returns different values depending on whether compiling C or C++
3045 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3048 type = skip_typeref(type);
3049 switch (type->kind) {
3051 const atomic_type_t *const atomic_type = &type->atomic;
3052 switch (atomic_type->akind) {
3053 /* gcc cannot do that */
3054 case ATOMIC_TYPE_VOID:
3055 tc = void_type_class;
3058 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3059 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3060 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3061 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3062 case ATOMIC_TYPE_SHORT:
3063 case ATOMIC_TYPE_USHORT:
3064 case ATOMIC_TYPE_INT:
3065 case ATOMIC_TYPE_UINT:
3066 case ATOMIC_TYPE_LONG:
3067 case ATOMIC_TYPE_ULONG:
3068 case ATOMIC_TYPE_LONGLONG:
3069 case ATOMIC_TYPE_ULONGLONG:
3070 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3071 tc = integer_type_class;
3074 case ATOMIC_TYPE_FLOAT:
3075 case ATOMIC_TYPE_DOUBLE:
3076 case ATOMIC_TYPE_LONG_DOUBLE:
3077 tc = real_type_class;
3080 panic("Unexpected atomic type in classify_type_to_firm().");
3083 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3084 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3085 case TYPE_ARRAY: /* gcc handles this as pointer */
3086 case TYPE_FUNCTION: /* gcc handles this as pointer */
3087 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3088 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3089 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3091 /* gcc handles this as integer */
3092 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3094 /* gcc classifies the referenced type */
3095 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3097 /* typedef/typeof should be skipped already */
3103 panic("unexpected TYPE classify_type_to_firm().");
3107 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3108 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3109 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3110 return new_d_Const(dbgi, tv);
3113 static ir_node *function_name_to_firm(
3114 const funcname_expression_t *const expr)
3116 switch(expr->kind) {
3117 case FUNCNAME_FUNCTION:
3118 case FUNCNAME_PRETTY_FUNCTION:
3119 case FUNCNAME_FUNCDNAME:
3120 if (current_function_name == NULL) {
3121 source_position_t const *const src_pos = &expr->base.source_position;
3122 char const *const name = current_function_entity->base.symbol->string;
3123 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3124 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3126 return current_function_name;
3127 case FUNCNAME_FUNCSIG:
3128 if (current_funcsig == NULL) {
3129 source_position_t const *const src_pos = &expr->base.source_position;
3130 ir_entity *const ent = get_irg_entity(current_ir_graph);
3131 char const *const name = get_entity_ld_name(ent);
3132 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3133 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3135 return current_funcsig;
3137 panic("Unsupported function name");
3140 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3142 statement_t *statement = expr->statement;
3144 assert(statement->kind == STATEMENT_COMPOUND);
3145 return compound_statement_to_firm(&statement->compound);
3148 static ir_node *va_start_expression_to_firm(
3149 const va_start_expression_t *const expr)
3151 ir_entity *param_ent = current_vararg_entity;
3152 if (param_ent == NULL) {
3153 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3154 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3155 ir_type *const param_type = get_unknown_type();
3156 param_ent = new_parameter_entity(frame_type, n, param_type);
3157 current_vararg_entity = param_ent;
3160 ir_node *const frame = get_irg_frame(current_ir_graph);
3161 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3162 ir_node *const no_mem = new_NoMem();
3163 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3165 set_value_for_expression(expr->ap, arg_sel);
3170 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3172 type_t *const type = expr->base.type;
3173 expression_t *const ap_expr = expr->ap;
3174 ir_node *const ap_addr = expression_to_addr(ap_expr);
3175 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3176 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3177 ir_node *const res = deref_address(dbgi, type, ap);
3179 ir_node *const cnst = get_type_size_node(expr->base.type);
3180 ir_mode *const mode = get_irn_mode(cnst);
3181 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3182 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3183 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3184 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3185 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3187 set_value_for_expression_addr(ap_expr, add, ap_addr);
3193 * Generate Firm for a va_copy expression.
3195 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3197 ir_node *const src = expression_to_firm(expr->src);
3198 set_value_for_expression(expr->dst, src);
3202 static ir_node *dereference_addr(const unary_expression_t *const expression)
3204 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3205 return expression_to_firm(expression->value);
3209 * Returns a IR-node representing an lvalue of the given expression.
3211 static ir_node *expression_to_addr(const expression_t *expression)
3213 switch(expression->kind) {
3214 case EXPR_ARRAY_ACCESS:
3215 return array_access_addr(&expression->array_access);
3217 return call_expression_to_firm(&expression->call);
3218 case EXPR_COMPOUND_LITERAL:
3219 return compound_literal_addr(&expression->compound_literal);
3220 case EXPR_REFERENCE:
3221 return reference_addr(&expression->reference);
3223 return select_addr(&expression->select);
3224 case EXPR_UNARY_DEREFERENCE:
3225 return dereference_addr(&expression->unary);
3229 panic("trying to get address of non-lvalue");
3232 static ir_node *builtin_constant_to_firm(
3233 const builtin_constant_expression_t *expression)
3235 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3236 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3237 return create_Const_from_bool(mode, v);
3240 static ir_node *builtin_types_compatible_to_firm(
3241 const builtin_types_compatible_expression_t *expression)
3243 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3244 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3245 bool const value = types_compatible(left, right);
3246 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3247 return create_Const_from_bool(mode, value);
3250 static ir_node *get_label_block(label_t *label)
3252 if (label->block != NULL)
3253 return label->block;
3255 ir_node *block = new_immBlock();
3256 label->block = block;
3257 if (label->address_taken)
3258 ARR_APP1(ir_node*, ijmp_blocks, block);
3263 * Pointer to a label. This is used for the
3264 * GNU address-of-label extension.
3266 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3268 /* Beware: Might be called from create initializer with current_ir_graph
3269 * set to const_code_irg. */
3270 PUSH_IRG(current_function);
3271 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3272 ir_node *block = get_label_block(label->label);
3273 ir_entity *entity = create_Block_entity(block);
3276 symconst_symbol value;
3277 value.entity_p = entity;
3278 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3282 * creates firm nodes for an expression. The difference between this function
3283 * and expression_to_firm is, that this version might produce mode_b nodes
3284 * instead of mode_Is.
3286 static ir_node *_expression_to_firm(expression_t const *const expr)
3289 if (!constant_folding) {
3290 assert(!expr->base.transformed);
3291 ((expression_t*)expr)->base.transformed = true;
3295 switch (expr->kind) {
3296 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3297 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3298 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3299 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3300 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3301 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3302 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3303 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3304 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3305 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3306 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3307 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3308 case EXPR_LITERAL_CHARACTER: return char_literal_to_firm( &expr->string_literal);
3309 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3310 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3311 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3312 case EXPR_SELECT: return select_to_firm( &expr->select);
3313 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3314 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3315 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3316 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3317 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3318 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3320 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->string_literal.value);
3322 case EXPR_ERROR: break;
3324 panic("invalid expression found");
3328 * Check if a given expression is a GNU __builtin_expect() call.
3330 static bool is_builtin_expect(const expression_t *expression)
3332 if (expression->kind != EXPR_CALL)
3335 expression_t *function = expression->call.function;
3336 if (function->kind != EXPR_REFERENCE)
3338 reference_expression_t *ref = &function->reference;
3339 if (ref->entity->kind != ENTITY_FUNCTION ||
3340 ref->entity->function.btk != BUILTIN_EXPECT)
3346 static bool produces_mode_b(const expression_t *expression)
3348 switch (expression->kind) {
3349 case EXPR_BINARY_EQUAL:
3350 case EXPR_BINARY_NOTEQUAL:
3351 case EXPR_BINARY_LESS:
3352 case EXPR_BINARY_LESSEQUAL:
3353 case EXPR_BINARY_GREATER:
3354 case EXPR_BINARY_GREATEREQUAL:
3355 case EXPR_BINARY_ISGREATER:
3356 case EXPR_BINARY_ISGREATEREQUAL:
3357 case EXPR_BINARY_ISLESS:
3358 case EXPR_BINARY_ISLESSEQUAL:
3359 case EXPR_BINARY_ISLESSGREATER:
3360 case EXPR_BINARY_ISUNORDERED:
3361 case EXPR_UNARY_NOT:
3365 if (is_builtin_expect(expression)) {
3366 expression_t *argument = expression->call.arguments->expression;
3367 return produces_mode_b(argument);
3370 case EXPR_BINARY_COMMA:
3371 return produces_mode_b(expression->binary.right);
3378 static ir_node *expression_to_firm(const expression_t *expression)
3380 if (!produces_mode_b(expression)) {
3381 ir_node *res = _expression_to_firm(expression);
3382 assert(res == NULL || get_irn_mode(res) != mode_b);
3386 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3387 return new_Const(fold_constant_to_tarval(expression));
3390 /* we have to produce a 0/1 from the mode_b expression */
3391 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3392 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3393 return produce_condition_result(expression, mode, dbgi);
3397 * create a short-circuit expression evaluation that tries to construct
3398 * efficient control flow structures for &&, || and ! expressions
3400 static ir_node *create_condition_evaluation(expression_t const *const expression, jump_target *const true_target, jump_target *const false_target)
3402 switch(expression->kind) {
3403 case EXPR_UNARY_NOT: {
3404 const unary_expression_t *unary_expression = &expression->unary;
3405 create_condition_evaluation(unary_expression->value, false_target, true_target);
3408 case EXPR_BINARY_LOGICAL_AND: {
3409 jump_target extra_target;
3410 init_jump_target(&extra_target, NULL);
3411 create_condition_evaluation(expression->binary.left, &extra_target, false_target);
3412 if (enter_jump_target(&extra_target))
3413 create_condition_evaluation(expression->binary.right, true_target, false_target);
3416 case EXPR_BINARY_LOGICAL_OR: {
3417 jump_target extra_target;
3418 init_jump_target(&extra_target, NULL);
3419 create_condition_evaluation(expression->binary.left, true_target, &extra_target);
3420 if (enter_jump_target(&extra_target))
3421 create_condition_evaluation(expression->binary.right, true_target, false_target);
3428 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3429 ir_node *cond_expr = _expression_to_firm(expression);
3430 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3431 ir_node *cond = new_d_Cond(dbgi, condition);
3432 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3433 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3435 /* set branch prediction info based on __builtin_expect */
3436 if (is_builtin_expect(expression) && is_Cond(cond)) {
3437 call_argument_t *argument = expression->call.arguments->next;
3438 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3439 bool const cnst = fold_constant_to_bool(argument->expression);
3440 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3441 set_Cond_jmp_pred(cond, pred);
3445 add_pred_to_jump_target(true_target, true_proj);
3446 add_pred_to_jump_target(false_target, false_proj);
3448 set_unreachable_now();
3452 static void create_variable_entity(entity_t *variable,
3453 declaration_kind_t declaration_kind,
3454 ir_type *parent_type)
3456 assert(variable->kind == ENTITY_VARIABLE);
3457 type_t *type = skip_typeref(variable->declaration.type);
3459 ident *const id = new_id_from_str(variable->base.symbol->string);
3460 ir_type *const irtype = get_ir_type(type);
3461 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3462 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3463 unsigned alignment = variable->declaration.alignment;
3465 set_entity_alignment(irentity, alignment);
3467 handle_decl_modifiers(irentity, variable);
3469 variable->declaration.kind = (unsigned char) declaration_kind;
3470 variable->variable.v.entity = irentity;
3471 set_entity_ld_ident(irentity, create_ld_ident(variable));
3473 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3474 set_entity_volatility(irentity, volatility_is_volatile);
3479 typedef struct type_path_entry_t type_path_entry_t;
3480 struct type_path_entry_t {
3482 ir_initializer_t *initializer;
3484 entity_t *compound_entry;
3487 typedef struct type_path_t type_path_t;
3488 struct type_path_t {
3489 type_path_entry_t *path;
3494 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3496 size_t len = ARR_LEN(path->path);
3498 for (size_t i = 0; i < len; ++i) {
3499 const type_path_entry_t *entry = & path->path[i];
3501 type_t *type = skip_typeref(entry->type);
3502 if (is_type_compound(type)) {
3503 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3504 } else if (is_type_array(type)) {
3505 fprintf(stderr, "[%u]", (unsigned) entry->index);
3507 fprintf(stderr, "-INVALID-");
3510 fprintf(stderr, " (");
3511 print_type(path->top_type);
3512 fprintf(stderr, ")");
3515 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3517 size_t len = ARR_LEN(path->path);
3519 return & path->path[len-1];
3522 static type_path_entry_t *append_to_type_path(type_path_t *path)
3524 size_t len = ARR_LEN(path->path);
3525 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3527 type_path_entry_t *result = & path->path[len];
3528 memset(result, 0, sizeof(result[0]));
3532 static size_t get_compound_member_count(const compound_type_t *type)
3534 compound_t *compound = type->compound;
3535 size_t n_members = 0;
3536 entity_t *member = compound->members.entities;
3537 for ( ; member != NULL; member = member->base.next) {
3544 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3546 type_t *orig_top_type = path->top_type;
3547 type_t *top_type = skip_typeref(orig_top_type);
3549 assert(is_type_compound(top_type) || is_type_array(top_type));
3551 if (ARR_LEN(path->path) == 0) {
3554 type_path_entry_t *top = get_type_path_top(path);
3555 ir_initializer_t *initializer = top->initializer;
3556 return get_initializer_compound_value(initializer, top->index);
3560 static void descend_into_subtype(type_path_t *path)
3562 type_t *orig_top_type = path->top_type;
3563 type_t *top_type = skip_typeref(orig_top_type);
3565 assert(is_type_compound(top_type) || is_type_array(top_type));
3567 ir_initializer_t *initializer = get_initializer_entry(path);
3569 type_path_entry_t *top = append_to_type_path(path);
3570 top->type = top_type;
3574 if (is_type_compound(top_type)) {
3575 compound_t *const compound = top_type->compound.compound;
3576 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3578 top->compound_entry = entry;
3580 len = get_compound_member_count(&top_type->compound);
3581 if (entry != NULL) {
3582 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3583 path->top_type = entry->declaration.type;
3586 assert(is_type_array(top_type));
3587 assert(top_type->array.size > 0);
3590 path->top_type = top_type->array.element_type;
3591 len = top_type->array.size;
3593 if (initializer == NULL
3594 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3595 initializer = create_initializer_compound(len);
3596 /* we have to set the entry at the 2nd latest path entry... */
3597 size_t path_len = ARR_LEN(path->path);
3598 assert(path_len >= 1);
3600 type_path_entry_t *entry = & path->path[path_len-2];
3601 ir_initializer_t *tinitializer = entry->initializer;
3602 set_initializer_compound_value(tinitializer, entry->index,
3606 top->initializer = initializer;
3609 static void ascend_from_subtype(type_path_t *path)
3611 type_path_entry_t *top = get_type_path_top(path);
3613 path->top_type = top->type;
3615 size_t len = ARR_LEN(path->path);
3616 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3619 static void walk_designator(type_path_t *path, const designator_t *designator)
3621 /* designators start at current object type */
3622 ARR_RESIZE(type_path_entry_t, path->path, 1);
3624 for ( ; designator != NULL; designator = designator->next) {
3625 type_path_entry_t *top = get_type_path_top(path);
3626 type_t *orig_type = top->type;
3627 type_t *type = skip_typeref(orig_type);
3629 if (designator->symbol != NULL) {
3630 assert(is_type_compound(type));
3632 symbol_t *symbol = designator->symbol;
3634 compound_t *compound = type->compound.compound;
3635 entity_t *iter = compound->members.entities;
3636 for (; iter->base.symbol != symbol; iter = iter->base.next, ++index) {}
3637 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3639 /* revert previous initialisations of other union elements */
3640 if (type->kind == TYPE_COMPOUND_UNION) {
3641 ir_initializer_t *initializer = top->initializer;
3642 if (initializer != NULL
3643 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3644 /* are we writing to a new element? */
3645 ir_initializer_t *oldi
3646 = get_initializer_compound_value(initializer, index);
3647 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3648 /* clear initializer */
3650 = get_initializer_compound_n_entries(initializer);
3651 ir_initializer_t *nulli = get_initializer_null();
3652 for (size_t i = 0; i < len; ++i) {
3653 set_initializer_compound_value(initializer, i,
3660 top->type = orig_type;
3661 top->compound_entry = iter;
3663 orig_type = iter->declaration.type;
3665 expression_t *array_index = designator->array_index;
3666 assert(is_type_array(type));
3668 long index = fold_constant_to_int(array_index);
3669 assert(0 <= index && (!type->array.size_constant || (size_t)index < type->array.size));
3671 top->type = orig_type;
3672 top->index = (size_t) index;
3673 orig_type = type->array.element_type;
3675 path->top_type = orig_type;
3677 if (designator->next != NULL) {
3678 descend_into_subtype(path);
3682 path->invalid = false;
3685 static void advance_current_object(type_path_t *path)
3687 if (path->invalid) {
3688 /* TODO: handle this... */
3689 panic("invalid initializer in ast2firm (excessive elements)");
3692 type_path_entry_t *top = get_type_path_top(path);
3694 type_t *type = skip_typeref(top->type);
3695 if (is_type_union(type)) {
3696 /* only the first element is initialized in unions */
3697 top->compound_entry = NULL;
3698 } else if (is_type_struct(type)) {
3699 entity_t *entry = top->compound_entry;
3702 entry = skip_unnamed_bitfields(entry->base.next);
3703 top->compound_entry = entry;
3704 if (entry != NULL) {
3705 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3706 path->top_type = entry->declaration.type;
3710 assert(is_type_array(type));
3713 if (!type->array.size_constant || top->index < type->array.size) {
3718 /* we're past the last member of the current sub-aggregate, try if we
3719 * can ascend in the type hierarchy and continue with another subobject */
3720 size_t len = ARR_LEN(path->path);
3723 ascend_from_subtype(path);
3724 advance_current_object(path);
3726 path->invalid = true;
3731 static ir_initializer_t *create_ir_initializer_value(
3732 const initializer_value_t *initializer)
3734 if (is_type_compound(initializer->value->base.type)) {
3735 panic("initializer creation for compounds not implemented yet");
3737 type_t *type = initializer->value->base.type;
3738 expression_t *expr = initializer->value;
3739 ir_node *value = expression_to_firm(expr);
3740 ir_mode *mode = get_ir_mode_storage(type);
3741 value = create_conv(NULL, value, mode);
3742 return create_initializer_const(value);
3745 /** test wether type can be initialized by a string constant */
3746 static bool is_string_type(type_t *type)
3748 if (!is_type_array(type))
3751 type_t *const inner = skip_typeref(type->array.element_type);
3752 return is_type_integer(inner);
3755 static ir_initializer_t *create_ir_initializer_list(
3756 const initializer_list_t *initializer, type_t *type)
3759 memset(&path, 0, sizeof(path));
3760 path.top_type = type;
3761 path.path = NEW_ARR_F(type_path_entry_t, 0);
3763 descend_into_subtype(&path);
3765 for (size_t i = 0; i < initializer->len; ++i) {
3766 const initializer_t *sub_initializer = initializer->initializers[i];
3768 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3769 walk_designator(&path, sub_initializer->designator.designator);
3773 if (sub_initializer->kind == INITIALIZER_VALUE) {
3774 /* we might have to descend into types until we're at a scalar
3777 type_t *orig_top_type = path.top_type;
3778 type_t *top_type = skip_typeref(orig_top_type);
3780 if (is_type_scalar(top_type))
3782 descend_into_subtype(&path);
3784 } else if (sub_initializer->kind == INITIALIZER_STRING) {
3785 /* we might have to descend into types until we're at a scalar
3788 type_t *orig_top_type = path.top_type;
3789 type_t *top_type = skip_typeref(orig_top_type);
3791 if (is_string_type(top_type))
3793 descend_into_subtype(&path);
3797 ir_initializer_t *sub_irinitializer
3798 = create_ir_initializer(sub_initializer, path.top_type);
3800 size_t path_len = ARR_LEN(path.path);
3801 assert(path_len >= 1);
3802 type_path_entry_t *entry = & path.path[path_len-1];
3803 ir_initializer_t *tinitializer = entry->initializer;
3804 set_initializer_compound_value(tinitializer, entry->index,
3807 advance_current_object(&path);
3810 assert(ARR_LEN(path.path) >= 1);
3811 ir_initializer_t *result = path.path[0].initializer;
3812 DEL_ARR_F(path.path);
3817 static ir_initializer_t *create_ir_initializer_string(initializer_t const *const init, type_t *type)
3819 type = skip_typeref(type);
3821 assert(type->kind == TYPE_ARRAY);
3822 assert(type->array.size_constant);
3823 string_literal_expression_t const *const str = get_init_string(init);
3824 size_t const str_len = str->value.size;
3825 size_t const arr_len = type->array.size;
3826 ir_initializer_t *const irinit = create_initializer_compound(arr_len);
3827 ir_mode *const mode = get_ir_mode_storage(type->array.element_type);
3828 char const * p = str->value.begin;
3829 switch (str->value.encoding) {
3830 case STRING_ENCODING_CHAR:
3831 for (size_t i = 0; i != arr_len; ++i) {
3832 char const c = i < str_len ? *p++ : 0;
3833 ir_tarval *const tv = new_tarval_from_long(c, mode);
3834 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3835 set_initializer_compound_value(irinit, i, tvinit);
3839 case STRING_ENCODING_WIDE:
3840 for (size_t i = 0; i != arr_len; ++i) {
3841 utf32 const c = i < str_len ? read_utf8_char(&p) : 0;
3842 ir_tarval *const tv = new_tarval_from_long(c, mode);
3843 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3844 set_initializer_compound_value(irinit, i, tvinit);
3852 static ir_initializer_t *create_ir_initializer(
3853 const initializer_t *initializer, type_t *type)
3855 switch(initializer->kind) {
3856 case INITIALIZER_STRING:
3857 return create_ir_initializer_string(initializer, type);
3859 case INITIALIZER_LIST:
3860 return create_ir_initializer_list(&initializer->list, type);
3862 case INITIALIZER_VALUE:
3863 return create_ir_initializer_value(&initializer->value);
3865 case INITIALIZER_DESIGNATOR:
3866 panic("unexpected designator initializer found");
3868 panic("unknown initializer");
3871 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
3872 * are elements [...] the remainder of the aggregate shall be initialized
3873 * implicitly the same as objects that have static storage duration. */
3874 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
3877 /* for unions we must NOT do anything for null initializers */
3878 ir_type *owner = get_entity_owner(entity);
3879 if (is_Union_type(owner)) {
3883 ir_type *ent_type = get_entity_type(entity);
3884 /* create sub-initializers for a compound type */
3885 if (is_compound_type(ent_type)) {
3886 unsigned n_members = get_compound_n_members(ent_type);
3887 for (unsigned n = 0; n < n_members; ++n) {
3888 ir_entity *member = get_compound_member(ent_type, n);
3889 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
3891 create_dynamic_null_initializer(member, dbgi, addr);
3895 if (is_Array_type(ent_type)) {
3896 assert(has_array_upper_bound(ent_type, 0));
3897 long n = get_array_upper_bound_int(ent_type, 0);
3898 for (long i = 0; i < n; ++i) {
3899 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3900 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3901 ir_node *cnst = new_d_Const(dbgi, index_tv);
3902 ir_node *in[1] = { cnst };
3903 ir_entity *arrent = get_array_element_entity(ent_type);
3904 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
3906 create_dynamic_null_initializer(arrent, dbgi, addr);
3911 ir_mode *value_mode = get_type_mode(ent_type);
3912 ir_node *node = new_Const(get_mode_null(value_mode));
3914 /* is it a bitfield type? */
3915 if (is_Primitive_type(ent_type) &&
3916 get_primitive_base_type(ent_type) != NULL) {
3917 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3921 ir_node *mem = get_store();
3922 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3923 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3927 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
3928 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
3930 switch(get_initializer_kind(initializer)) {
3931 case IR_INITIALIZER_NULL:
3932 create_dynamic_null_initializer(entity, dbgi, base_addr);
3934 case IR_INITIALIZER_CONST: {
3935 ir_node *node = get_initializer_const_value(initializer);
3936 ir_type *ent_type = get_entity_type(entity);
3938 /* is it a bitfield type? */
3939 if (is_Primitive_type(ent_type) &&
3940 get_primitive_base_type(ent_type) != NULL) {
3941 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3945 assert(get_type_mode(type) == get_irn_mode(node));
3946 ir_node *mem = get_store();
3947 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3948 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3952 case IR_INITIALIZER_TARVAL: {
3953 ir_tarval *tv = get_initializer_tarval_value(initializer);
3954 ir_node *cnst = new_d_Const(dbgi, tv);
3955 ir_type *ent_type = get_entity_type(entity);
3957 /* is it a bitfield type? */
3958 if (is_Primitive_type(ent_type) &&
3959 get_primitive_base_type(ent_type) != NULL) {
3960 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
3964 assert(get_type_mode(type) == get_tarval_mode(tv));
3965 ir_node *mem = get_store();
3966 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
3967 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3971 case IR_INITIALIZER_COMPOUND: {
3972 assert(is_compound_type(type) || is_Array_type(type));
3974 if (is_Array_type(type)) {
3975 assert(has_array_upper_bound(type, 0));
3976 n_members = get_array_upper_bound_int(type, 0);
3978 n_members = get_compound_n_members(type);
3981 if (get_initializer_compound_n_entries(initializer)
3982 != (unsigned) n_members)
3983 panic("initializer doesn't match compound type");
3985 for (int i = 0; i < n_members; ++i) {
3988 ir_entity *sub_entity;
3989 if (is_Array_type(type)) {
3990 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3991 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3992 ir_node *cnst = new_d_Const(dbgi, index_tv);
3993 ir_node *in[1] = { cnst };
3994 irtype = get_array_element_type(type);
3995 sub_entity = get_array_element_entity(type);
3996 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
3999 sub_entity = get_compound_member(type, i);
4000 irtype = get_entity_type(sub_entity);
4001 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4005 ir_initializer_t *sub_init
4006 = get_initializer_compound_value(initializer, i);
4008 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4015 panic("invalid IR_INITIALIZER found");
4018 static void create_dynamic_initializer(ir_initializer_t *initializer,
4019 dbg_info *dbgi, ir_entity *entity)
4021 ir_node *frame = get_irg_frame(current_ir_graph);
4022 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4023 ir_type *type = get_entity_type(entity);
4025 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4028 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4029 ir_entity *entity, type_t *type)
4031 ir_node *memory = get_store();
4032 ir_node *nomem = new_NoMem();
4033 ir_node *frame = get_irg_frame(current_ir_graph);
4034 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4036 if (initializer->kind == INITIALIZER_VALUE) {
4037 initializer_value_t *initializer_value = &initializer->value;
4039 ir_node *value = expression_to_firm(initializer_value->value);
4040 type = skip_typeref(type);
4041 assign_value(dbgi, addr, type, value);
4045 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4046 ir_initializer_t *irinitializer
4047 = create_ir_initializer(initializer, type);
4049 create_dynamic_initializer(irinitializer, dbgi, entity);
4053 /* create a "template" entity which is copied to the entity on the stack */
4054 ir_entity *const init_entity
4055 = create_initializer_entity(dbgi, initializer, type);
4056 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4057 ir_type *const irtype = get_ir_type(type);
4058 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4060 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4061 set_store(copyb_mem);
4064 static void create_initializer_local_variable_entity(entity_t *entity)
4066 assert(entity->kind == ENTITY_VARIABLE);
4067 initializer_t *initializer = entity->variable.initializer;
4068 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4069 ir_entity *irentity = entity->variable.v.entity;
4070 type_t *type = entity->declaration.type;
4072 create_local_initializer(initializer, dbgi, irentity, type);
4075 static void create_variable_initializer(entity_t *entity)
4077 assert(entity->kind == ENTITY_VARIABLE);
4078 initializer_t *initializer = entity->variable.initializer;
4079 if (initializer == NULL)
4082 declaration_kind_t declaration_kind
4083 = (declaration_kind_t) entity->declaration.kind;
4084 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4085 create_initializer_local_variable_entity(entity);
4089 type_t *type = entity->declaration.type;
4090 type_qualifiers_t tq = get_type_qualifier(type, true);
4092 if (initializer->kind == INITIALIZER_VALUE) {
4093 expression_t * value = initializer->value.value;
4094 type_t *const init_type = skip_typeref(value->base.type);
4096 if (!is_type_scalar(init_type)) {
4098 while (value->kind == EXPR_UNARY_CAST)
4099 value = value->unary.value;
4101 if (value->kind != EXPR_COMPOUND_LITERAL)
4102 panic("expected non-scalar initializer to be a compound literal");
4103 initializer = value->compound_literal.initializer;
4104 goto have_initializer;
4107 ir_node * node = expression_to_firm(value);
4108 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4109 ir_mode *const mode = get_ir_mode_storage(init_type);
4110 node = create_conv(dbgi, node, mode);
4112 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4113 set_value(entity->variable.v.value_number, node);
4115 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4117 ir_entity *irentity = entity->variable.v.entity;
4119 if (tq & TYPE_QUALIFIER_CONST
4120 && get_entity_owner(irentity) != get_tls_type()) {
4121 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4123 set_atomic_ent_value(irentity, node);
4127 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4128 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4130 ir_entity *irentity = entity->variable.v.entity;
4131 ir_initializer_t *irinitializer
4132 = create_ir_initializer(initializer, type);
4134 if (tq & TYPE_QUALIFIER_CONST) {
4135 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4137 set_entity_initializer(irentity, irinitializer);
4141 static void create_variable_length_array(entity_t *entity)
4143 assert(entity->kind == ENTITY_VARIABLE);
4144 assert(entity->variable.initializer == NULL);
4146 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4147 entity->variable.v.vla_base = NULL;
4149 /* TODO: record VLA somewhere so we create the free node when we leave
4153 static void allocate_variable_length_array(entity_t *entity)
4155 assert(entity->kind == ENTITY_VARIABLE);
4156 assert(entity->variable.initializer == NULL);
4157 assert(currently_reachable());
4159 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4160 type_t *type = entity->declaration.type;
4161 ir_type *el_type = get_ir_type(type->array.element_type);
4163 /* make sure size_node is calculated */
4164 get_type_size_node(type);
4165 ir_node *elems = type->array.size_node;
4166 ir_node *mem = get_store();
4167 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4169 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4170 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4173 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4174 entity->variable.v.vla_base = addr;
4177 static bool var_needs_entity(variable_t const *const var)
4179 if (var->address_taken)
4181 type_t *const type = skip_typeref(var->base.type);
4182 return !is_type_scalar(type) || type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
4186 * Creates a Firm local variable from a declaration.
4188 static void create_local_variable(entity_t *entity)
4190 assert(entity->kind == ENTITY_VARIABLE);
4191 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4193 if (!var_needs_entity(&entity->variable)) {
4194 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4195 entity->variable.v.value_number = next_value_number_function;
4196 set_irg_loc_description(current_ir_graph, next_value_number_function, entity);
4197 ++next_value_number_function;
4201 /* is it a variable length array? */
4202 type_t *const type = skip_typeref(entity->declaration.type);
4203 if (is_type_array(type) && !type->array.size_constant) {
4204 create_variable_length_array(entity);
4208 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
4209 create_variable_entity(entity, DECLARATION_KIND_LOCAL_VARIABLE_ENTITY, frame_type);
4212 static void create_local_static_variable(entity_t *entity)
4214 assert(entity->kind == ENTITY_VARIABLE);
4215 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4217 type_t *type = skip_typeref(entity->declaration.type);
4218 ir_type *const var_type = entity->variable.thread_local ?
4219 get_tls_type() : get_glob_type();
4220 ir_type *const irtype = get_ir_type(type);
4221 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4223 size_t l = strlen(entity->base.symbol->string);
4224 char buf[l + sizeof(".%u")];
4225 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4226 ident *const id = id_unique(buf);
4227 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4229 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4230 set_entity_volatility(irentity, volatility_is_volatile);
4233 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4234 entity->variable.v.entity = irentity;
4236 set_entity_ld_ident(irentity, id);
4237 set_entity_visibility(irentity, ir_visibility_local);
4239 if (entity->variable.initializer == NULL) {
4240 ir_initializer_t *null_init = get_initializer_null();
4241 set_entity_initializer(irentity, null_init);
4244 PUSH_IRG(get_const_code_irg());
4245 create_variable_initializer(entity);
4251 static ir_node *return_statement_to_firm(return_statement_t *statement)
4253 if (!currently_reachable())
4256 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4257 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4258 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4261 if (!is_type_void(type)) {
4262 ir_mode *const mode = get_ir_mode_storage(type);
4264 res = create_conv(dbgi, res, mode);
4266 res = new_Unknown(mode);
4273 ir_node *const in[1] = { res };
4274 ir_node *const store = get_store();
4275 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4277 ir_node *end_block = get_irg_end_block(current_ir_graph);
4278 add_immBlock_pred(end_block, ret);
4280 set_unreachable_now();
4284 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4286 if (!currently_reachable())
4289 return expression_to_firm(statement->expression);
4292 static void create_local_declarations(entity_t*);
4294 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4296 create_local_declarations(compound->scope.entities);
4298 ir_node *result = NULL;
4299 statement_t *statement = compound->statements;
4300 for ( ; statement != NULL; statement = statement->base.next) {
4301 result = statement_to_firm(statement);
4307 static void create_global_variable(entity_t *entity)
4309 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4310 ir_visibility visibility = ir_visibility_external;
4311 storage_class_tag_t storage
4312 = (storage_class_tag_t)entity->declaration.storage_class;
4313 decl_modifiers_t modifiers = entity->declaration.modifiers;
4314 assert(entity->kind == ENTITY_VARIABLE);
4317 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4318 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4319 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
4320 case STORAGE_CLASS_TYPEDEF:
4321 case STORAGE_CLASS_AUTO:
4322 case STORAGE_CLASS_REGISTER:
4323 panic("invalid storage class for global var");
4326 /* "common" symbols */
4327 if (storage == STORAGE_CLASS_NONE
4328 && entity->variable.initializer == NULL
4329 && !entity->variable.thread_local
4330 && (modifiers & DM_WEAK) == 0) {
4331 linkage |= IR_LINKAGE_MERGE;
4334 ir_type *var_type = get_glob_type();
4335 if (entity->variable.thread_local) {
4336 var_type = get_tls_type();
4338 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4339 ir_entity *irentity = entity->variable.v.entity;
4340 add_entity_linkage(irentity, linkage);
4341 set_entity_visibility(irentity, visibility);
4342 if (entity->variable.initializer == NULL
4343 && storage != STORAGE_CLASS_EXTERN) {
4344 ir_initializer_t *null_init = get_initializer_null();
4345 set_entity_initializer(irentity, null_init);
4349 static void create_local_declaration(entity_t *entity)
4351 assert(is_declaration(entity));
4353 /* construct type */
4354 (void) get_ir_type(entity->declaration.type);
4355 if (entity->base.symbol == NULL) {
4359 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4360 case STORAGE_CLASS_STATIC:
4361 if (entity->kind == ENTITY_FUNCTION) {
4362 (void)get_function_entity(entity, NULL);
4364 create_local_static_variable(entity);
4367 case STORAGE_CLASS_EXTERN:
4368 if (entity->kind == ENTITY_FUNCTION) {
4369 assert(entity->function.body == NULL);
4370 (void)get_function_entity(entity, NULL);
4372 create_global_variable(entity);
4373 create_variable_initializer(entity);
4376 case STORAGE_CLASS_NONE:
4377 case STORAGE_CLASS_AUTO:
4378 case STORAGE_CLASS_REGISTER:
4379 if (entity->kind == ENTITY_FUNCTION) {
4380 if (entity->function.body != NULL) {
4381 ir_type *owner = get_irg_frame_type(current_ir_graph);
4382 (void)get_function_entity(entity, owner);
4383 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4384 enqueue_inner_function(entity);
4386 (void)get_function_entity(entity, NULL);
4389 create_local_variable(entity);
4392 case STORAGE_CLASS_TYPEDEF:
4395 panic("invalid storage class found");
4398 static void create_local_declarations(entity_t *e)
4400 for (; e; e = e->base.next) {
4401 if (is_declaration(e))
4402 create_local_declaration(e);
4406 static void initialize_local_declaration(entity_t *entity)
4408 if (entity->base.symbol == NULL)
4411 // no need to emit code in dead blocks
4412 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4413 && !currently_reachable())
4416 switch ((declaration_kind_t) entity->declaration.kind) {
4417 case DECLARATION_KIND_LOCAL_VARIABLE:
4418 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4419 create_variable_initializer(entity);
4422 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4423 allocate_variable_length_array(entity);
4426 case DECLARATION_KIND_COMPOUND_MEMBER:
4427 case DECLARATION_KIND_GLOBAL_VARIABLE:
4428 case DECLARATION_KIND_FUNCTION:
4429 case DECLARATION_KIND_INNER_FUNCTION:
4432 case DECLARATION_KIND_PARAMETER:
4433 case DECLARATION_KIND_PARAMETER_ENTITY:
4434 panic("can't initialize parameters");
4436 case DECLARATION_KIND_UNKNOWN:
4437 panic("can't initialize unknown declaration");
4439 panic("invalid declaration kind");
4442 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4444 entity_t *entity = statement->declarations_begin;
4448 entity_t *const last = statement->declarations_end;
4449 for ( ;; entity = entity->base.next) {
4450 if (is_declaration(entity)) {
4451 initialize_local_declaration(entity);
4452 } else if (entity->kind == ENTITY_TYPEDEF) {
4453 /* ยง6.7.7:3 Any array size expressions associated with variable length
4454 * array declarators are evaluated each time the declaration of the
4455 * typedef name is reached in the order of execution. */
4456 type_t *const type = skip_typeref(entity->typedefe.type);
4457 if (is_type_array(type) && type->array.is_vla)
4458 get_vla_size(&type->array);
4467 static ir_node *if_statement_to_firm(if_statement_t *statement)
4469 create_local_declarations(statement->scope.entities);
4471 /* Create the condition. */
4472 jump_target true_target;
4473 jump_target false_target;
4474 init_jump_target(&true_target, NULL);
4475 init_jump_target(&false_target, NULL);
4476 if (currently_reachable())
4477 create_condition_evaluation(statement->condition, &true_target, &false_target);
4479 jump_target exit_target;
4480 init_jump_target(&exit_target, NULL);
4482 /* Create the true statement. */
4483 enter_jump_target(&true_target);
4484 statement_to_firm(statement->true_statement);
4485 jump_to_target(&exit_target);
4487 /* Create the false statement. */
4488 enter_jump_target(&false_target);
4489 if (statement->false_statement)
4490 statement_to_firm(statement->false_statement);
4491 jump_to_target(&exit_target);
4493 enter_jump_target(&exit_target);
4498 * Add an unconditional jump to the target block. If the source block is not
4499 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4500 * loops. This is necessary if the jump potentially enters a loop.
4502 static void jump_to(ir_node *const target_block)
4504 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4505 add_immBlock_pred(target_block, pred);
4506 set_cur_block(target_block);
4510 * Add an unconditional jump to the target block, if the current block is
4511 * reachable and do nothing otherwise. This is only valid if the jump does not
4512 * enter a loop (a back edge is ok).
4514 static void jump_if_reachable(ir_node *const target_block)
4516 if (currently_reachable())
4517 add_immBlock_pred(target_block, new_Jmp());
4520 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4522 create_local_declarations(statement->scope.entities);
4525 PUSH_CONTINUE(NULL);
4527 expression_t *const cond = statement->condition;
4528 /* Avoid an explicit body block in case of do ... while (0);. */
4529 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT && !fold_constant_to_bool(cond)) {
4530 /* do ... while (0);. */
4531 statement_to_firm(statement->body);
4532 jump_to_target(&continue_target);
4533 enter_jump_target(&continue_target);
4534 jump_to_target(&break_target);
4536 jump_target body_target;
4537 init_jump_target(&body_target, NULL);
4538 jump_to_target(&body_target);
4539 enter_immature_jump_target(&body_target);
4540 statement_to_firm(statement->body);
4541 jump_to_target(&continue_target);
4542 if (enter_jump_target(&continue_target))
4543 create_condition_evaluation(statement->condition, &body_target, &break_target);
4544 enter_jump_target(&body_target);
4546 enter_jump_target(&break_target);
4553 static ir_node *for_statement_to_firm(for_statement_t *statement)
4555 create_local_declarations(statement->scope.entities);
4557 if (currently_reachable()) {
4558 entity_t *entity = statement->scope.entities;
4559 for ( ; entity != NULL; entity = entity->base.next) {
4560 if (!is_declaration(entity))
4563 initialize_local_declaration(entity);
4566 if (statement->initialisation != NULL) {
4567 expression_to_firm(statement->initialisation);
4571 /* Create the header block */
4572 ir_node *const header_block = new_immBlock();
4573 jump_to(header_block);
4575 expression_t *const step = statement->step;
4577 PUSH_CONTINUE(step ? NULL : header_block);
4579 /* Create the condition. */
4580 expression_t *const cond = statement->condition;
4581 if (cond && (is_constant_expression(cond) != EXPR_CLASS_CONSTANT || !fold_constant_to_bool(cond))) {
4582 jump_target body_target;
4583 init_jump_target(&body_target, NULL);
4584 create_condition_evaluation(cond, &body_target, &break_target);
4585 enter_jump_target(&body_target);
4588 keep_alive(header_block);
4589 keep_all_memory(header_block);
4592 /* Create the loop body. */
4593 statement_to_firm(statement->body);
4594 jump_to_target(&continue_target);
4596 /* Create the step code. */
4597 if (step && enter_jump_target(&continue_target)) {
4598 expression_to_firm(step);
4599 jump_if_reachable(header_block);
4602 mature_immBlock(header_block);
4603 enter_jump_target(&break_target);
4610 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4612 if (!currently_reachable())
4615 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4616 ir_node *jump = new_d_Jmp(dbgi);
4617 add_immBlock_pred(target_block, jump);
4619 set_unreachable_now();
4623 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4625 /* determine number of cases */
4627 for (case_label_statement_t *l = statement->first_case; l != NULL;
4630 if (l->expression == NULL)
4632 if (l->is_empty_range)
4637 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4639 for (case_label_statement_t *l = statement->first_case; l != NULL;
4641 if (l->expression == NULL) {
4642 l->pn = pn_Switch_default;
4645 if (l->is_empty_range)
4647 ir_tarval *min = l->first_case;
4648 ir_tarval *max = l->last_case;
4649 long pn = (long) i+1;
4650 ir_switch_table_set(res, i++, min, max, pn);
4656 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4658 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4659 ir_node *switch_node = NULL;
4661 if (currently_reachable()) {
4662 ir_node *expression = expression_to_firm(statement->expression);
4663 ir_switch_table *table = create_switch_table(statement);
4664 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4666 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4669 set_unreachable_now();
4672 ir_node *const old_switch = current_switch;
4673 const bool old_saw_default_label = saw_default_label;
4674 saw_default_label = false;
4675 current_switch = switch_node;
4677 statement_to_firm(statement->body);
4678 jump_to_target(&break_target);
4680 if (!saw_default_label && switch_node) {
4681 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4682 add_pred_to_jump_target(&break_target, proj);
4685 enter_jump_target(&break_target);
4687 assert(current_switch == switch_node);
4688 current_switch = old_switch;
4689 saw_default_label = old_saw_default_label;
4694 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4696 if (current_switch != NULL && !statement->is_empty_range) {
4697 ir_node *block = new_immBlock();
4698 /* Fallthrough from previous case */
4699 jump_if_reachable(block);
4701 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
4702 add_immBlock_pred(block, proj);
4703 if (statement->expression == NULL)
4704 saw_default_label = true;
4706 mature_immBlock(block);
4707 set_cur_block(block);
4710 return statement_to_firm(statement->statement);
4713 static void try_mature_label(label_t *const label)
4715 if (--label->n_users == 0 && !label->address_taken)
4716 mature_immBlock(label->block);
4719 static ir_node *label_to_firm(const label_statement_t *statement)
4721 label_t *const label = statement->label;
4722 ir_node *const block = get_label_block(label);
4726 keep_all_memory(block);
4728 try_mature_label(label);
4730 return statement_to_firm(statement->statement);
4733 static ir_node *goto_statement_to_firm(goto_statement_t *const stmt)
4735 label_t *const label = stmt->label;
4736 create_jump_statement((statement_t*)stmt, get_label_block(label));
4737 try_mature_label(label);
4741 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
4743 if (!currently_reachable())
4746 ir_node *const irn = expression_to_firm(statement->expression);
4747 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4748 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
4750 set_irn_link(ijmp, ijmp_list);
4753 set_unreachable_now();
4757 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
4759 bool needs_memory = statement->is_volatile;
4760 size_t n_clobbers = 0;
4761 asm_clobber_t *clobber = statement->clobbers;
4762 for ( ; clobber != NULL; clobber = clobber->next) {
4763 const char *clobber_str = clobber->clobber.begin;
4765 if (!be_is_valid_clobber(clobber_str)) {
4766 errorf(&statement->base.source_position,
4767 "invalid clobber '%s' specified", clobber->clobber);
4771 if (streq(clobber_str, "memory")) {
4772 needs_memory = true;
4776 ident *id = new_id_from_str(clobber_str);
4777 obstack_ptr_grow(&asm_obst, id);
4780 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
4781 ident **clobbers = NULL;
4782 if (n_clobbers > 0) {
4783 clobbers = obstack_finish(&asm_obst);
4786 size_t n_inputs = 0;
4787 asm_argument_t *argument = statement->inputs;
4788 for ( ; argument != NULL; argument = argument->next)
4790 size_t n_outputs = 0;
4791 argument = statement->outputs;
4792 for ( ; argument != NULL; argument = argument->next)
4795 unsigned next_pos = 0;
4797 ir_node *ins[n_inputs + n_outputs + 1];
4800 ir_asm_constraint tmp_in_constraints[n_outputs];
4802 const expression_t *out_exprs[n_outputs];
4803 ir_node *out_addrs[n_outputs];
4804 size_t out_size = 0;
4806 argument = statement->outputs;
4807 for ( ; argument != NULL; argument = argument->next) {
4808 const char *constraints = argument->constraints.begin;
4809 asm_constraint_flags_t asm_flags
4810 = be_parse_asm_constraints(constraints);
4813 source_position_t const *const pos = &statement->base.source_position;
4814 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4815 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
4817 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4818 errorf(pos, "some constraints in '%s' are invalid", constraints);
4821 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
4822 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
4827 unsigned pos = next_pos++;
4828 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4829 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4830 expression_t *expr = argument->expression;
4831 ir_node *addr = expression_to_addr(expr);
4832 /* in+output, construct an artifical same_as constraint on the
4834 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
4836 ir_node *value = get_value_from_lvalue(expr, addr);
4838 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
4840 ir_asm_constraint constraint;
4841 constraint.pos = pos;
4842 constraint.constraint = new_id_from_str(buf);
4843 constraint.mode = get_ir_mode_storage(expr->base.type);
4844 tmp_in_constraints[in_size] = constraint;
4845 ins[in_size] = value;
4850 out_exprs[out_size] = expr;
4851 out_addrs[out_size] = addr;
4853 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4854 /* pure memory ops need no input (but we have to make sure we
4855 * attach to the memory) */
4856 assert(! (asm_flags &
4857 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
4858 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
4859 needs_memory = true;
4861 /* we need to attach the address to the inputs */
4862 expression_t *expr = argument->expression;
4864 ir_asm_constraint constraint;
4865 constraint.pos = pos;
4866 constraint.constraint = new_id_from_str(constraints);
4867 constraint.mode = mode_M;
4868 tmp_in_constraints[in_size] = constraint;
4870 ins[in_size] = expression_to_addr(expr);
4874 errorf(&statement->base.source_position,
4875 "only modifiers but no place set in constraints '%s'",
4880 ir_asm_constraint constraint;
4881 constraint.pos = pos;
4882 constraint.constraint = new_id_from_str(constraints);
4883 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
4885 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
4887 assert(obstack_object_size(&asm_obst)
4888 == out_size * sizeof(ir_asm_constraint));
4889 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
4892 obstack_grow(&asm_obst, tmp_in_constraints,
4893 in_size * sizeof(tmp_in_constraints[0]));
4894 /* find and count input and output arguments */
4895 argument = statement->inputs;
4896 for ( ; argument != NULL; argument = argument->next) {
4897 const char *constraints = argument->constraints.begin;
4898 asm_constraint_flags_t asm_flags
4899 = be_parse_asm_constraints(constraints);
4901 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4902 errorf(&statement->base.source_position,
4903 "some constraints in '%s' are not supported", constraints);
4906 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4907 errorf(&statement->base.source_position,
4908 "some constraints in '%s' are invalid", constraints);
4911 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
4912 errorf(&statement->base.source_position,
4913 "write flag specified for input constraints '%s'",
4919 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4920 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4921 /* we can treat this as "normal" input */
4922 input = expression_to_firm(argument->expression);
4923 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4924 /* pure memory ops need no input (but we have to make sure we
4925 * attach to the memory) */
4926 assert(! (asm_flags &
4927 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
4928 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
4929 needs_memory = true;
4930 input = expression_to_addr(argument->expression);
4932 errorf(&statement->base.source_position,
4933 "only modifiers but no place set in constraints '%s'",
4938 ir_asm_constraint constraint;
4939 constraint.pos = next_pos++;
4940 constraint.constraint = new_id_from_str(constraints);
4941 constraint.mode = get_irn_mode(input);
4943 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
4944 ins[in_size++] = input;
4947 ir_node *mem = needs_memory ? get_store() : new_NoMem();
4948 assert(obstack_object_size(&asm_obst)
4949 == in_size * sizeof(ir_asm_constraint));
4950 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
4952 /* create asm node */
4953 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4955 ident *asm_text = new_id_from_str(statement->asm_text.begin);
4957 ir_node *node = new_d_ASM(dbgi, mem, in_size, ins, input_constraints,
4958 out_size, output_constraints,
4959 n_clobbers, clobbers, asm_text);
4961 if (statement->is_volatile) {
4962 set_irn_pinned(node, op_pin_state_pinned);
4964 set_irn_pinned(node, op_pin_state_floats);
4967 /* create output projs & connect them */
4969 ir_node *projm = new_Proj(node, mode_M, out_size);
4974 for (i = 0; i < out_size; ++i) {
4975 const expression_t *out_expr = out_exprs[i];
4977 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
4978 ir_node *proj = new_Proj(node, mode, pn);
4979 ir_node *addr = out_addrs[i];
4981 set_value_for_expression_addr(out_expr, proj, addr);
4987 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
4989 statement_to_firm(statement->try_statement);
4990 source_position_t const *const pos = &statement->base.source_position;
4991 warningf(WARN_OTHER, pos, "structured exception handling ignored");
4995 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
4997 errorf(&statement->base.source_position, "__leave not supported yet");
5002 * Transform a statement.
5004 static ir_node *statement_to_firm(statement_t *const stmt)
5007 assert(!stmt->base.transformed);
5008 stmt->base.transformed = true;
5011 switch (stmt->kind) {
5012 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5013 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5014 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5015 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5016 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5017 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5018 case STATEMENT_EMPTY: return NULL; /* nothing */
5019 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5020 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5021 case STATEMENT_GOTO: return goto_statement_to_firm( &stmt->gotos);
5022 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5023 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5024 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5025 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5026 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5027 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5031 case STATEMENT_BREAK: tgt = &break_target; goto jump;
5032 case STATEMENT_CONTINUE: tgt = &continue_target; goto jump;
5034 jump_to_target(tgt);
5035 set_unreachable_now();
5039 case STATEMENT_ERROR: panic("error statement found");
5041 panic("statement not implemented");
5044 static int count_local_variables(const entity_t *entity,
5045 const entity_t *const last)
5048 entity_t const *const end = last != NULL ? last->base.next : NULL;
5049 for (; entity != end; entity = entity->base.next) {
5050 if ((entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER) &&
5051 !var_needs_entity(&entity->variable))
5057 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5059 int *const count = env;
5061 switch (stmt->kind) {
5062 case STATEMENT_DECLARATION: {
5063 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5064 *count += count_local_variables(decl_stmt->declarations_begin,
5065 decl_stmt->declarations_end);
5070 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5079 * Return the number of local (alias free) variables used by a function.
5081 static int get_function_n_local_vars(entity_t *entity)
5083 const function_t *function = &entity->function;
5086 /* count parameters */
5087 count += count_local_variables(function->parameters.entities, NULL);
5089 /* count local variables declared in body */
5090 walk_statements(function->body, count_local_variables_in_stmt, &count);
5095 * Build Firm code for the parameters of a function.
5097 static void initialize_function_parameters(entity_t *entity)
5099 assert(entity->kind == ENTITY_FUNCTION);
5100 ir_graph *irg = current_ir_graph;
5101 ir_node *args = get_irg_args(irg);
5103 ir_type *function_irtype;
5105 if (entity->function.need_closure) {
5106 /* add an extra parameter for the static link */
5107 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5110 /* Matze: IMO this is wrong, nested functions should have an own
5111 * type and not rely on strange parameters... */
5112 function_irtype = create_method_type(&entity->declaration.type->function, true);
5114 function_irtype = get_ir_type(entity->declaration.type);
5119 entity_t *parameter = entity->function.parameters.entities;
5120 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5121 if (parameter->kind != ENTITY_PARAMETER)
5124 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5125 type_t *type = skip_typeref(parameter->declaration.type);
5127 dbg_info *const dbgi = get_dbg_info(¶meter->base.source_position);
5128 ir_type *const param_irtype = get_method_param_type(function_irtype, n);
5129 if (var_needs_entity(¶meter->variable)) {
5130 ir_type *frame_type = get_irg_frame_type(irg);
5132 = new_d_parameter_entity(frame_type, n, param_irtype, dbgi);
5133 parameter->declaration.kind = DECLARATION_KIND_PARAMETER_ENTITY;
5134 parameter->variable.v.entity = param;
5138 ir_mode *param_mode = get_type_mode(param_irtype);
5140 ir_node *value = new_rd_Proj(dbgi, args, param_mode, pn);
5142 ir_mode *mode = get_ir_mode_storage(type);
5143 value = create_conv(NULL, value, mode);
5145 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5146 parameter->variable.v.value_number = next_value_number_function;
5147 set_irg_loc_description(current_ir_graph, next_value_number_function,
5149 ++next_value_number_function;
5151 set_value(parameter->variable.v.value_number, value);
5155 static void add_function_pointer(ir_type *segment, ir_entity *method,
5156 const char *unique_template)
5158 ir_type *method_type = get_entity_type(method);
5159 ir_type *ptr_type = new_type_pointer(method_type);
5161 /* these entities don't really have a name but firm only allows
5163 * Note that we mustn't give these entities a name since for example
5164 * Mach-O doesn't allow them. */
5165 ident *ide = id_unique(unique_template);
5166 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5167 ir_graph *irg = get_const_code_irg();
5168 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5171 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5172 set_entity_compiler_generated(ptr, 1);
5173 set_entity_visibility(ptr, ir_visibility_private);
5174 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5175 set_atomic_ent_value(ptr, val);
5179 * Generate possible IJmp branches to a given label block.
5181 static void gen_ijmp_branches(ir_node *block)
5184 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5185 add_immBlock_pred(block, ijmp);
5190 * Create code for a function and all inner functions.
5192 * @param entity the function entity
5194 static void create_function(entity_t *entity)
5196 assert(entity->kind == ENTITY_FUNCTION);
5197 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5199 if (entity->function.body == NULL)
5202 inner_functions = NULL;
5203 current_trampolines = NULL;
5205 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5206 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5207 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5209 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5210 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5211 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5214 current_function_entity = entity;
5215 current_function_name = NULL;
5216 current_funcsig = NULL;
5218 assert(ijmp_blocks == NULL);
5219 ijmp_blocks = NEW_ARR_F(ir_node*, 0);
5222 int n_local_vars = get_function_n_local_vars(entity);
5223 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5224 current_ir_graph = irg;
5226 ir_graph *old_current_function = current_function;
5227 current_function = irg;
5229 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5230 current_vararg_entity = NULL;
5232 set_irg_fp_model(irg, firm_fp_model);
5233 tarval_enable_fp_ops(1);
5234 set_irn_dbg_info(get_irg_start_block(irg),
5235 get_entity_dbg_info(function_entity));
5237 next_value_number_function = 0;
5238 initialize_function_parameters(entity);
5239 current_static_link = entity->function.static_link;
5241 statement_to_firm(entity->function.body);
5243 ir_node *end_block = get_irg_end_block(irg);
5245 /* do we have a return statement yet? */
5246 if (currently_reachable()) {
5247 type_t *type = skip_typeref(entity->declaration.type);
5248 assert(is_type_function(type));
5249 type_t *const return_type = skip_typeref(type->function.return_type);
5252 if (is_type_void(return_type)) {
5253 ret = new_Return(get_store(), 0, NULL);
5255 ir_mode *const mode = get_ir_mode_storage(return_type);
5258 /* ยง5.1.2.2.3 main implicitly returns 0 */
5259 if (is_main(entity)) {
5260 in[0] = new_Const(get_mode_null(mode));
5262 in[0] = new_Unknown(mode);
5264 ret = new_Return(get_store(), 1, in);
5266 add_immBlock_pred(end_block, ret);
5269 for (size_t i = ARR_LEN(ijmp_blocks); i-- != 0;) {
5270 ir_node *const block = ijmp_blocks[i];
5271 gen_ijmp_branches(block);
5272 mature_immBlock(block);
5275 DEL_ARR_F(ijmp_blocks);
5278 irg_finalize_cons(irg);
5280 /* finalize the frame type */
5281 ir_type *frame_type = get_irg_frame_type(irg);
5282 int n = get_compound_n_members(frame_type);
5285 for (int i = 0; i < n; ++i) {
5286 ir_entity *member = get_compound_member(frame_type, i);
5287 ir_type *entity_type = get_entity_type(member);
5289 int align = get_type_alignment_bytes(entity_type);
5290 if (align > align_all)
5294 misalign = offset % align;
5296 offset += align - misalign;
5300 set_entity_offset(member, offset);
5301 offset += get_type_size_bytes(entity_type);
5303 set_type_size_bytes(frame_type, offset);
5304 set_type_alignment_bytes(frame_type, align_all);
5306 irg_verify(irg, VERIFY_ENFORCE_SSA);
5307 current_vararg_entity = old_current_vararg_entity;
5308 current_function = old_current_function;
5310 if (current_trampolines != NULL) {
5311 DEL_ARR_F(current_trampolines);
5312 current_trampolines = NULL;
5315 /* create inner functions if any */
5316 entity_t **inner = inner_functions;
5317 if (inner != NULL) {
5318 ir_type *rem_outer_frame = current_outer_frame;
5319 current_outer_frame = get_irg_frame_type(current_ir_graph);
5320 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5321 create_function(inner[i]);
5325 current_outer_frame = rem_outer_frame;
5329 static void scope_to_firm(scope_t *scope)
5331 /* first pass: create declarations */
5332 entity_t *entity = scope->entities;
5333 for ( ; entity != NULL; entity = entity->base.next) {
5334 if (entity->base.symbol == NULL)
5337 if (entity->kind == ENTITY_FUNCTION) {
5338 if (entity->function.btk != BUILTIN_NONE) {
5339 /* builtins have no representation */
5342 (void)get_function_entity(entity, NULL);
5343 } else if (entity->kind == ENTITY_VARIABLE) {
5344 create_global_variable(entity);
5345 } else if (entity->kind == ENTITY_NAMESPACE) {
5346 scope_to_firm(&entity->namespacee.members);
5350 /* second pass: create code/initializers */
5351 entity = scope->entities;
5352 for ( ; entity != NULL; entity = entity->base.next) {
5353 if (entity->base.symbol == NULL)
5356 if (entity->kind == ENTITY_FUNCTION) {
5357 if (entity->function.btk != BUILTIN_NONE) {
5358 /* builtins have no representation */
5361 create_function(entity);
5362 } else if (entity->kind == ENTITY_VARIABLE) {
5363 assert(entity->declaration.kind
5364 == DECLARATION_KIND_GLOBAL_VARIABLE);
5365 current_ir_graph = get_const_code_irg();
5366 create_variable_initializer(entity);
5371 void init_ast2firm(void)
5373 obstack_init(&asm_obst);
5374 init_atomic_modes();
5376 ir_set_debug_retrieve(dbg_retrieve);
5377 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5379 /* create idents for all known runtime functions */
5380 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5381 rts_idents[i] = new_id_from_str(rts_data[i].name);
5384 entitymap_init(&entitymap);
5387 static void init_ir_types(void)
5389 static int ir_types_initialized = 0;
5390 if (ir_types_initialized)
5392 ir_types_initialized = 1;
5394 ir_type_char = get_ir_type(type_char);
5395 ir_type_wchar_t = get_ir_type(type_wchar_t);
5397 be_params = be_get_backend_param();
5398 mode_float_arithmetic = be_params->mode_float_arithmetic;
5400 stack_param_align = be_params->stack_param_align;
5403 void exit_ast2firm(void)
5405 entitymap_destroy(&entitymap);
5406 obstack_free(&asm_obst, NULL);
5409 static void global_asm_to_firm(statement_t *s)
5411 for (; s != NULL; s = s->base.next) {
5412 assert(s->kind == STATEMENT_ASM);
5414 char const *const text = s->asms.asm_text.begin;
5415 size_t const size = s->asms.asm_text.size;
5416 ident *const id = new_id_from_chars(text, size);
5421 static const char *get_cwd(void)
5423 static char buf[1024];
5424 if (buf[0] == '\0') {
5425 return getcwd(buf, sizeof(buf));
5430 void translation_unit_to_firm(translation_unit_t *unit)
5432 if (c_mode & _CXX) {
5433 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5434 } else if (c_mode & _C99) {
5435 be_dwarf_set_source_language(DW_LANG_C99);
5436 } else if (c_mode & _C89) {
5437 be_dwarf_set_source_language(DW_LANG_C89);
5439 be_dwarf_set_source_language(DW_LANG_C);
5441 const char *cwd = get_cwd();
5443 be_dwarf_set_compilation_directory(cwd);
5446 /* initialize firm arithmetic */
5447 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5448 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5450 /* just to be sure */
5451 init_jump_target(&break_target, NULL);
5452 init_jump_target(&continue_target, NULL);
5453 current_switch = NULL;
5454 current_translation_unit = unit;
5458 scope_to_firm(&unit->scope);
5459 global_asm_to_firm(unit->global_asm);
5461 current_ir_graph = NULL;
5462 current_translation_unit = NULL;