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;
68 /* architecture specific floating point arithmetic mode (if any) */
69 static ir_mode *mode_float_arithmetic;
71 /* alignment of stack parameters */
72 static unsigned stack_param_align;
74 static int next_value_number_function;
75 static jump_target continue_target;
76 static jump_target break_target;
77 static ir_node *current_switch;
78 static bool saw_default_label;
79 static entity_t **inner_functions;
80 static jump_target ijmp_target;
81 static ir_node **ijmp_ops;
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 position_t const *const pos = &entity->base.pos;
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 position_t const *const pos = (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 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.pos);
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("entity is not a 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.pos);
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(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 case STRING_ENCODING_UTF8: {
1138 elem_type = ir_type_char;
1140 ir_mode *const mode = get_type_mode(elem_type);
1141 char const *p = value->begin;
1142 for (size_t i = 0; i < slen; ++i) {
1143 ir_tarval *tv = new_tarval_from_long(*p++, mode);
1144 ir_initializer_t *val = create_initializer_tarval(tv);
1145 set_initializer_compound_value(initializer, i, val);
1152 case STRING_ENCODING_CHAR16: type = type_char16_t; goto init_wide;
1153 case STRING_ENCODING_CHAR32: type = type_char32_t; goto init_wide;
1154 case STRING_ENCODING_WIDE: type = type_wchar_t; goto init_wide;
1156 elem_type = get_ir_type(type);
1158 ir_mode *const mode = get_type_mode(elem_type);
1159 char const *p = value->begin;
1160 for (size_t i = 0; i < slen; ++i) {
1161 assert(p <= value->begin + value->size);
1162 utf32 v = read_utf8_char(&p);
1163 ir_tarval *tv = new_tarval_from_long(v, mode);
1164 ir_initializer_t *val = create_initializer_tarval(tv);
1165 set_initializer_compound_value(initializer, i, val);
1170 panic("invalid string encoding");
1173 ir_type *const type = new_type_array(1, elem_type);
1174 set_array_bounds_int(type, 0, 0, slen);
1175 set_type_size_bytes( type, slen * get_type_size_bytes(elem_type));
1176 set_type_state( type, layout_fixed);
1178 ir_type *const global_type = get_glob_type();
1179 ident *const id = id_unique(id_prefix);
1180 dbg_info *const dbgi = get_dbg_info(src_pos);
1181 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1182 set_entity_ld_ident( entity, id);
1183 set_entity_visibility( entity, ir_visibility_private);
1184 add_entity_linkage( entity, IR_LINKAGE_CONSTANT);
1185 set_entity_initializer(entity, initializer);
1187 return create_symconst(dbgi, entity);
1190 static bool try_create_integer(literal_expression_t *literal, type_t *type)
1192 assert(type->kind == TYPE_ATOMIC);
1193 atomic_type_kind_t akind = type->atomic.akind;
1195 ir_mode *const mode = atomic_modes[akind];
1196 char const *const str = literal->value.begin;
1197 ir_tarval *const tv = new_tarval_from_str(str, literal->suffix - str, mode);
1198 if (tv == tarval_bad)
1201 literal->base.type = type;
1202 literal->target_value = tv;
1206 void determine_literal_type(literal_expression_t *const literal)
1208 assert(literal->base.kind == EXPR_LITERAL_INTEGER);
1210 /* -1: signed only, 0: any, 1: unsigned only */
1212 !is_type_signed(literal->base.type) ? 1 :
1213 literal->value.begin[0] == '0' ? 0 :
1214 -1; /* Decimal literals only try signed types. */
1216 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1217 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1219 if (try_create_integer(literal, literal->base.type))
1222 /* now try if the constant is small enough for some types */
1223 if (sign >= 0 && try_create_integer(literal, type_unsigned_int))
1225 if (sign <= 0 && try_create_integer(literal, type_long))
1227 if (sign >= 0 && try_create_integer(literal, type_unsigned_long))
1229 /* last try? then we should not report tarval_bad */
1231 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1232 if (sign <= 0 && try_create_integer(literal, type_long_long))
1237 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1238 bool res = try_create_integer(literal, type_unsigned_long_long);
1240 panic("internal error when parsing number literal");
1243 tarval_set_integer_overflow_mode(old_mode);
1247 * Creates a Const node representing a constant.
1249 static ir_node *literal_to_firm(const literal_expression_t *literal)
1251 type_t *type = skip_typeref(literal->base.type);
1252 ir_mode *mode = get_ir_mode_storage(type);
1253 const char *string = literal->value.begin;
1254 size_t size = literal->value.size;
1257 switch (literal->base.kind) {
1258 case EXPR_LITERAL_INTEGER:
1259 assert(literal->target_value != NULL);
1260 tv = literal->target_value;
1263 case EXPR_LITERAL_FLOATINGPOINT:
1264 tv = new_tarval_from_str(string, size, mode);
1267 case EXPR_LITERAL_BOOLEAN:
1268 if (string[0] == 't') {
1269 tv = get_mode_one(mode);
1271 assert(string[0] == 'f');
1272 case EXPR_LITERAL_MS_NOOP:
1273 tv = get_mode_null(mode);
1278 panic("invalid literal kind");
1281 dbg_info *dbgi = get_dbg_info(&literal->base.pos);
1282 ir_node *res = new_d_Const(dbgi, tv);
1283 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1284 return create_conv(dbgi, res, mode_arith);
1288 * Creates a Const node representing a character constant.
1290 static ir_node *char_literal_to_firm(string_literal_expression_t const *literal)
1292 type_t *type = skip_typeref(literal->base.type);
1293 ir_mode *mode = get_ir_mode_storage(type);
1294 const char *string = literal->value.begin;
1295 size_t size = literal->value.size;
1298 switch (literal->value.encoding) {
1299 case STRING_ENCODING_WIDE: {
1300 utf32 v = read_utf8_char(&string);
1302 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1304 tv = new_tarval_from_str(buf, len, mode);
1308 case STRING_ENCODING_CHAR: {
1311 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1312 if (size == 1 && char_is_signed) {
1313 v = (signed char)string[0];
1316 for (size_t i = 0; i < size; ++i) {
1317 v = (v << 8) | ((unsigned char)string[i]);
1321 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1323 tv = new_tarval_from_str(buf, len, mode);
1328 panic("invalid literal kind");
1331 dbg_info *dbgi = get_dbg_info(&literal->base.pos);
1332 ir_node *res = new_d_Const(dbgi, tv);
1333 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1334 return create_conv(dbgi, res, mode_arith);
1338 * Allocate an area of size bytes aligned at alignment
1341 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1343 static unsigned area_cnt = 0;
1346 ir_type *tp = new_type_array(1, ir_type_char);
1347 set_array_bounds_int(tp, 0, 0, size);
1348 set_type_alignment_bytes(tp, alignment);
1350 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1351 ident *name = new_id_from_str(buf);
1352 ir_entity *area = new_entity(frame_type, name, tp);
1354 /* mark this entity as compiler generated */
1355 set_entity_compiler_generated(area, 1);
1360 * Return a node representing a trampoline region
1361 * for a given function entity.
1363 * @param dbgi debug info
1364 * @param entity the function entity
1366 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1368 ir_entity *region = NULL;
1371 if (current_trampolines != NULL) {
1372 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1373 if (current_trampolines[i].function == entity) {
1374 region = current_trampolines[i].region;
1379 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1381 ir_graph *irg = current_ir_graph;
1382 if (region == NULL) {
1383 /* create a new region */
1384 ir_type *frame_tp = get_irg_frame_type(irg);
1385 trampoline_region reg;
1386 reg.function = entity;
1388 reg.region = alloc_trampoline(frame_tp,
1389 be_params->trampoline_size,
1390 be_params->trampoline_align);
1391 ARR_APP1(trampoline_region, current_trampolines, reg);
1392 region = reg.region;
1394 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1399 * Creates a trampoline for a function represented by an entity.
1401 * @param dbgi debug info
1402 * @param mode the (reference) mode for the function address
1403 * @param entity the function entity
1405 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1408 assert(entity != NULL);
1410 in[0] = get_trampoline_region(dbgi, entity);
1411 in[1] = create_symconst(dbgi, entity);
1412 in[2] = get_irg_frame(current_ir_graph);
1414 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1415 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1416 return new_Proj(irn, mode, pn_Builtin_max+1);
1420 * Dereference an address.
1422 * @param dbgi debug info
1423 * @param type the type of the dereferenced result (the points_to type)
1424 * @param addr the address to dereference
1426 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1427 ir_node *const addr)
1429 type_t *skipped = skip_typeref(type);
1430 if (is_type_incomplete(skipped))
1433 ir_type *irtype = get_ir_type(skipped);
1434 if (is_compound_type(irtype)
1435 || is_Method_type(irtype)
1436 || is_Array_type(irtype)) {
1440 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1441 ? cons_volatile : cons_none;
1442 ir_mode *const mode = get_type_mode(irtype);
1443 ir_node *const memory = get_store();
1444 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1445 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1446 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1448 set_store(load_mem);
1450 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1451 return create_conv(dbgi, load_res, mode_arithmetic);
1455 * Returns the correct base address depending on whether it is a parameter or a
1456 * normal local variable.
1458 static ir_node *get_local_frame(ir_entity *const ent)
1460 ir_graph *const irg = current_ir_graph;
1461 const ir_type *const owner = get_entity_owner(ent);
1462 if (owner == current_outer_frame) {
1463 assert(current_static_link != NULL);
1464 return current_static_link;
1466 return get_irg_frame(irg);
1471 * Keep the current block and memory.
1472 * This is necessary for all loops, because they could become infinite.
1474 static void keep_loop(void)
1476 keep_alive(get_cur_block());
1477 keep_alive(get_store());
1480 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1482 entity_t *entity = ref->entity;
1483 if (entity->enum_value.tv == NULL) {
1484 type_t *type = skip_typeref(entity->enum_value.enum_type);
1485 assert(type->kind == TYPE_ENUM);
1486 determine_enum_values(&type->enumt);
1489 return new_Const(entity->enum_value.tv);
1492 static ir_node *reference_addr(const reference_expression_t *ref)
1494 dbg_info *dbgi = get_dbg_info(&ref->base.pos);
1495 entity_t *entity = ref->entity;
1496 assert(is_declaration(entity));
1498 if (entity->kind == ENTITY_FUNCTION
1499 && entity->function.btk != BUILTIN_NONE) {
1500 ir_entity *irentity = get_function_entity(entity, NULL);
1501 /* for gcc compatibility we have to produce (dummy) addresses for some
1502 * builtins which don't have entities */
1503 if (irentity == NULL) {
1504 position_t const *const pos = &ref->base.pos;
1505 warningf(WARN_OTHER, pos, "taking address of builtin '%N'", ref->entity);
1507 /* simply create a NULL pointer */
1508 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1509 ir_node *res = new_Const(get_mode_null(mode));
1515 switch((declaration_kind_t) entity->declaration.kind) {
1516 case DECLARATION_KIND_UNKNOWN:
1518 case DECLARATION_KIND_PARAMETER:
1519 case DECLARATION_KIND_LOCAL_VARIABLE:
1520 /* you can store to a local variable (so we don't panic but return NULL
1521 * as an indicator for no real address) */
1523 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1524 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1528 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
1529 case DECLARATION_KIND_PARAMETER_ENTITY: {
1530 ir_entity *irentity = entity->variable.v.entity;
1531 ir_node *frame = get_local_frame(irentity);
1532 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1536 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1537 return entity->variable.v.vla_base;
1539 case DECLARATION_KIND_FUNCTION: {
1540 return create_symconst(dbgi, entity->function.irentity);
1543 case DECLARATION_KIND_INNER_FUNCTION: {
1544 type_t *const type = skip_typeref(entity->declaration.type);
1545 ir_mode *const mode = get_ir_mode_storage(type);
1546 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1547 /* inner function not using the closure */
1548 return create_symconst(dbgi, entity->function.irentity);
1550 /* need trampoline here */
1551 return create_trampoline(dbgi, mode, entity->function.irentity);
1555 case DECLARATION_KIND_COMPOUND_MEMBER:
1556 panic("not implemented reference type");
1559 panic("reference to declaration with unknown type");
1562 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1564 dbg_info *const dbgi = get_dbg_info(&ref->base.pos);
1565 entity_t *const entity = ref->entity;
1566 assert(is_declaration(entity));
1568 switch ((declaration_kind_t)entity->declaration.kind) {
1569 case DECLARATION_KIND_LOCAL_VARIABLE:
1570 case DECLARATION_KIND_PARAMETER: {
1571 type_t *const type = skip_typeref(entity->declaration.type);
1572 ir_mode *const mode = get_ir_mode_storage(type);
1573 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1574 return create_conv(dbgi, value, get_ir_mode_arithmetic(type));
1578 ir_node *const addr = reference_addr(ref);
1579 return deref_address(dbgi, entity->declaration.type, addr);
1585 * Transform calls to builtin functions.
1587 static ir_node *process_builtin_call(const call_expression_t *call)
1589 dbg_info *dbgi = get_dbg_info(&call->base.pos);
1591 assert(call->function->kind == EXPR_REFERENCE);
1592 reference_expression_t *builtin = &call->function->reference;
1594 type_t *expr_type = skip_typeref(builtin->base.type);
1595 assert(is_type_pointer(expr_type));
1597 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1599 switch (builtin->entity->function.btk) {
1602 case BUILTIN_ALLOCA: {
1603 expression_t *argument = call->arguments->expression;
1604 ir_node *size = expression_to_firm(argument);
1606 ir_node *store = get_store();
1607 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1609 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1611 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1616 type_t *type = function_type->function.return_type;
1617 ir_mode *mode = get_ir_mode_arithmetic(type);
1618 ir_tarval *tv = get_mode_infinite(mode);
1619 ir_node *res = new_d_Const(dbgi, tv);
1623 /* Ignore string for now... */
1624 assert(is_type_function(function_type));
1625 type_t *type = function_type->function.return_type;
1626 ir_mode *mode = get_ir_mode_arithmetic(type);
1627 ir_tarval *tv = get_mode_NAN(mode);
1628 ir_node *res = new_d_Const(dbgi, tv);
1631 case BUILTIN_EXPECT: {
1632 expression_t *argument = call->arguments->expression;
1633 return _expression_to_firm(argument);
1635 case BUILTIN_VA_END:
1636 /* evaluate the argument of va_end for its side effects */
1637 _expression_to_firm(call->arguments->expression);
1639 case BUILTIN_OBJECT_SIZE: {
1640 /* determine value of "type" */
1641 expression_t *type_expression = call->arguments->next->expression;
1642 long type_val = fold_constant_to_int(type_expression);
1643 type_t *type = function_type->function.return_type;
1644 ir_mode *mode = get_ir_mode_arithmetic(type);
1645 /* just produce a "I don't know" result */
1646 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1647 get_mode_minus_one(mode);
1649 return new_d_Const(dbgi, result);
1651 case BUILTIN_ROTL: {
1652 ir_node *val = expression_to_firm(call->arguments->expression);
1653 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1654 ir_mode *mode = get_irn_mode(val);
1655 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1656 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1658 case BUILTIN_ROTR: {
1659 ir_node *val = expression_to_firm(call->arguments->expression);
1660 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1661 ir_mode *mode = get_irn_mode(val);
1662 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1663 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1664 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1665 return new_d_Rotl(dbgi, val, sub, mode);
1670 case BUILTIN_LIBC_CHECK:
1671 panic("builtin did not produce an entity");
1673 panic("invalid builtin");
1677 * Transform a call expression.
1678 * Handles some special cases, like alloca() calls, which must be resolved
1679 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1680 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1683 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1685 dbg_info *const dbgi = get_dbg_info(&call->base.pos);
1686 assert(currently_reachable());
1688 expression_t *function = call->function;
1689 ir_node *callee = NULL;
1690 bool firm_builtin = false;
1691 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1692 if (function->kind == EXPR_REFERENCE) {
1693 const reference_expression_t *ref = &function->reference;
1694 entity_t *entity = ref->entity;
1696 if (entity->kind == ENTITY_FUNCTION) {
1697 builtin_kind_t builtin = entity->function.btk;
1698 if (builtin == BUILTIN_FIRM) {
1699 firm_builtin = true;
1700 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1701 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1702 && builtin != BUILTIN_LIBC_CHECK) {
1703 return process_builtin_call(call);
1708 callee = expression_to_firm(function);
1710 type_t *type = skip_typeref(function->base.type);
1711 assert(is_type_pointer(type));
1712 pointer_type_t *pointer_type = &type->pointer;
1713 type_t *points_to = skip_typeref(pointer_type->points_to);
1714 assert(is_type_function(points_to));
1715 function_type_t *function_type = &points_to->function;
1717 int n_parameters = 0;
1718 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1719 ir_type *new_method_type = NULL;
1720 if (function_type->variadic || function_type->unspecified_parameters) {
1721 const call_argument_t *argument = call->arguments;
1722 for ( ; argument != NULL; argument = argument->next) {
1726 /* we need to construct a new method type matching the call
1728 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1729 int n_res = get_method_n_ress(ir_method_type);
1730 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1731 set_method_calling_convention(new_method_type,
1732 get_method_calling_convention(ir_method_type));
1733 set_method_additional_properties(new_method_type,
1734 get_method_additional_properties(ir_method_type));
1735 set_method_variadicity(new_method_type,
1736 get_method_variadicity(ir_method_type));
1738 for (int i = 0; i < n_res; ++i) {
1739 set_method_res_type(new_method_type, i,
1740 get_method_res_type(ir_method_type, i));
1742 argument = call->arguments;
1743 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1744 expression_t *expression = argument->expression;
1745 ir_type *irtype = get_ir_type(expression->base.type);
1746 set_method_param_type(new_method_type, i, irtype);
1748 ir_method_type = new_method_type;
1750 n_parameters = get_method_n_params(ir_method_type);
1753 ir_node *in[n_parameters];
1755 const call_argument_t *argument = call->arguments;
1756 for (int n = 0; n < n_parameters; ++n) {
1757 expression_t *expression = argument->expression;
1758 ir_node *arg_node = expression_to_firm(expression);
1760 type_t *arg_type = skip_typeref(expression->base.type);
1761 if (!is_type_compound(arg_type)) {
1762 ir_mode *const mode = get_ir_mode_storage(arg_type);
1763 arg_node = create_conv(dbgi, arg_node, mode);
1768 argument = argument->next;
1772 if (function_type->modifiers & DM_CONST) {
1773 store = get_irg_no_mem(current_ir_graph);
1775 store = get_store();
1779 type_t *return_type = skip_typeref(function_type->return_type);
1780 ir_node *result = NULL;
1782 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1784 if (! (function_type->modifiers & DM_CONST)) {
1785 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1789 if (!is_type_void(return_type)) {
1790 assert(is_type_scalar(return_type));
1791 ir_mode *mode = get_ir_mode_storage(return_type);
1792 result = new_Proj(node, mode, pn_Builtin_max+1);
1793 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1794 result = create_conv(NULL, result, mode_arith);
1797 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1798 if (! (function_type->modifiers & DM_CONST)) {
1799 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1803 if (!is_type_void(return_type)) {
1804 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1805 ir_mode *const mode = get_ir_mode_storage(return_type);
1806 result = new_Proj(resproj, mode, 0);
1807 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1808 result = create_conv(NULL, result, mode_arith);
1812 if (function_type->modifiers & DM_NORETURN) {
1813 /* A dead end: Keep the Call and the Block. Also place all further
1814 * nodes into a new and unreachable block. */
1816 keep_alive(get_cur_block());
1817 ir_node *block = new_Block(0, NULL);
1818 set_cur_block(block);
1824 static ir_node *statement_to_firm(statement_t *statement);
1825 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1827 static ir_node *expression_to_addr(const expression_t *expression);
1828 static ir_node *create_condition_evaluation(expression_t const *expression, jump_target *true_target, jump_target *false_target);
1830 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1833 if (!is_type_compound(type)) {
1834 ir_mode *mode = get_ir_mode_storage(type);
1835 value = create_conv(dbgi, value, mode);
1838 ir_node *memory = get_store();
1840 if (is_type_scalar(type)) {
1841 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1842 ? cons_volatile : cons_none;
1843 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1844 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1845 set_store(store_mem);
1847 ir_type *irtype = get_ir_type(type);
1848 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1849 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1850 set_store(copyb_mem);
1854 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1856 ir_tarval *all_one = get_mode_all_one(mode);
1857 int mode_size = get_mode_size_bits(mode);
1858 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1860 assert(offset >= 0);
1862 assert(offset + size <= mode_size);
1863 if (size == mode_size) {
1867 long shiftr = get_mode_size_bits(mode) - size;
1868 long shiftl = offset;
1869 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1870 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1871 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1872 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1877 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1878 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1881 ir_type *entity_type = get_entity_type(entity);
1882 ir_type *base_type = get_primitive_base_type(entity_type);
1883 ir_mode *mode = get_type_mode(base_type);
1884 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1886 value = create_conv(dbgi, value, mode);
1888 /* kill upper bits of value and shift to right position */
1889 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1890 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1891 unsigned base_bits = get_mode_size_bits(mode);
1892 unsigned shiftwidth = base_bits - bitsize;
1894 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1895 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1897 unsigned shrwidth = base_bits - bitsize - bitoffset;
1898 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
1899 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
1901 /* load current value */
1902 ir_node *mem = get_store();
1903 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
1904 set_volatile ? cons_volatile : cons_none);
1905 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1906 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1907 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
1908 ir_tarval *inv_mask = tarval_not(shift_mask);
1909 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
1910 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
1912 /* construct new value and store */
1913 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
1914 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
1915 set_volatile ? cons_volatile : cons_none);
1916 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1917 set_store(store_mem);
1923 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
1924 if (mode_is_signed(mode)) {
1925 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
1927 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
1932 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
1935 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
1936 entity_t *entity = expression->compound_entry;
1937 type_t *base_type = entity->declaration.type;
1938 ir_mode *mode = get_ir_mode_storage(base_type);
1939 ir_node *mem = get_store();
1940 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
1941 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1942 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1943 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1945 ir_mode *amode = mode;
1946 /* optimisation, since shifting in modes < machine_size is usually
1948 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
1951 unsigned amode_size = get_mode_size_bits(amode);
1952 load_res = create_conv(dbgi, load_res, amode);
1954 set_store(load_mem);
1956 /* kill upper bits */
1957 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
1958 unsigned bitoffset = entity->compound_member.bit_offset;
1959 unsigned bitsize = entity->compound_member.bit_size;
1960 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
1961 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
1962 ir_node *countl = new_d_Const(dbgi, tvl);
1963 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
1965 unsigned shift_bitsr = bitoffset + shift_bitsl;
1966 assert(shift_bitsr <= amode_size);
1967 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
1968 ir_node *countr = new_d_Const(dbgi, tvr);
1970 if (mode_is_signed(mode)) {
1971 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
1973 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
1976 type_t *type = expression->base.type;
1977 ir_mode *resmode = get_ir_mode_arithmetic(type);
1978 return create_conv(dbgi, shiftr, resmode);
1981 /* make sure the selected compound type is constructed */
1982 static void construct_select_compound(const select_expression_t *expression)
1984 type_t *type = skip_typeref(expression->compound->base.type);
1985 if (is_type_pointer(type)) {
1986 type = type->pointer.points_to;
1988 (void) get_ir_type(type);
1991 static ir_node *set_value_for_expression_addr(const expression_t *expression,
1992 ir_node *value, ir_node *addr)
1994 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
1995 type_t *type = skip_typeref(expression->base.type);
1997 if (!is_type_compound(type)) {
1998 ir_mode *mode = get_ir_mode_storage(type);
1999 value = create_conv(dbgi, value, mode);
2002 if (expression->kind == EXPR_REFERENCE) {
2003 const reference_expression_t *ref = &expression->reference;
2005 entity_t *entity = ref->entity;
2006 assert(is_declaration(entity));
2007 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2008 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2009 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2010 set_value(entity->variable.v.value_number, value);
2016 addr = expression_to_addr(expression);
2017 assert(addr != NULL);
2019 if (expression->kind == EXPR_SELECT) {
2020 const select_expression_t *select = &expression->select;
2022 construct_select_compound(select);
2024 entity_t *entity = select->compound_entry;
2025 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2026 if (entity->compound_member.bitfield) {
2027 ir_entity *irentity = entity->compound_member.entity;
2029 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2030 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2031 set_volatile, true);
2036 assign_value(dbgi, addr, type, value);
2040 static void set_value_for_expression(const expression_t *expression,
2043 set_value_for_expression_addr(expression, value, NULL);
2046 static ir_node *get_value_from_lvalue(const expression_t *expression,
2049 if (expression->kind == EXPR_REFERENCE) {
2050 const reference_expression_t *ref = &expression->reference;
2052 entity_t *entity = ref->entity;
2053 assert(entity->kind == ENTITY_VARIABLE
2054 || entity->kind == ENTITY_PARAMETER);
2055 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2057 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2058 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2059 value_number = entity->variable.v.value_number;
2060 assert(addr == NULL);
2061 type_t *type = skip_typeref(expression->base.type);
2062 ir_mode *mode = get_ir_mode_storage(type);
2063 ir_node *res = get_value(value_number, mode);
2064 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2068 assert(addr != NULL);
2069 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2072 if (expression->kind == EXPR_SELECT &&
2073 expression->select.compound_entry->compound_member.bitfield) {
2074 construct_select_compound(&expression->select);
2075 value = bitfield_extract_to_firm(&expression->select, addr);
2077 value = deref_address(dbgi, expression->base.type, addr);
2084 static ir_node *create_incdec(const unary_expression_t *expression)
2086 dbg_info *const dbgi = get_dbg_info(&expression->base.pos);
2087 const expression_t *value_expr = expression->value;
2088 ir_node *addr = expression_to_addr(value_expr);
2089 ir_node *value = get_value_from_lvalue(value_expr, addr);
2091 type_t *type = skip_typeref(expression->base.type);
2092 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2095 if (is_type_pointer(type)) {
2096 pointer_type_t *pointer_type = &type->pointer;
2097 offset = get_type_size_node(pointer_type->points_to);
2099 assert(is_type_arithmetic(type));
2100 offset = new_Const(get_mode_one(mode));
2104 ir_node *store_value;
2105 switch(expression->base.kind) {
2106 case EXPR_UNARY_POSTFIX_INCREMENT:
2108 store_value = new_d_Add(dbgi, value, offset, mode);
2110 case EXPR_UNARY_POSTFIX_DECREMENT:
2112 store_value = new_d_Sub(dbgi, value, offset, mode);
2114 case EXPR_UNARY_PREFIX_INCREMENT:
2115 result = new_d_Add(dbgi, value, offset, mode);
2116 store_value = result;
2118 case EXPR_UNARY_PREFIX_DECREMENT:
2119 result = new_d_Sub(dbgi, value, offset, mode);
2120 store_value = result;
2123 panic("no incdec expr");
2126 set_value_for_expression_addr(value_expr, store_value, addr);
2131 static bool is_local_variable(expression_t *expression)
2133 if (expression->kind != EXPR_REFERENCE)
2135 reference_expression_t *ref_expr = &expression->reference;
2136 entity_t *entity = ref_expr->entity;
2137 if (entity->kind != ENTITY_VARIABLE)
2139 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2140 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2143 static ir_relation get_relation(const expression_kind_t kind)
2146 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2147 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2148 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2149 case EXPR_BINARY_ISLESS:
2150 case EXPR_BINARY_LESS: return ir_relation_less;
2151 case EXPR_BINARY_ISLESSEQUAL:
2152 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2153 case EXPR_BINARY_ISGREATER:
2154 case EXPR_BINARY_GREATER: return ir_relation_greater;
2155 case EXPR_BINARY_ISGREATEREQUAL:
2156 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2157 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2162 panic("trying to get ir_relation from non-comparison binexpr type");
2166 * Handle the assume optimizer hint: check if a Confirm
2167 * node can be created.
2169 * @param dbi debug info
2170 * @param expr the IL assume expression
2172 * we support here only some simple cases:
2177 static ir_node *handle_assume_compare(dbg_info *dbi,
2178 const binary_expression_t *expression)
2180 expression_t *op1 = expression->left;
2181 expression_t *op2 = expression->right;
2182 entity_t *var2, *var = NULL;
2183 ir_node *res = NULL;
2184 ir_relation relation = get_relation(expression->base.kind);
2186 if (is_local_variable(op1) && is_local_variable(op2)) {
2187 var = op1->reference.entity;
2188 var2 = op2->reference.entity;
2190 type_t *const type = skip_typeref(var->declaration.type);
2191 ir_mode *const mode = get_ir_mode_storage(type);
2193 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2194 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2196 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2197 set_value(var2->variable.v.value_number, res);
2199 res = new_d_Confirm(dbi, irn1, irn2, relation);
2200 set_value(var->variable.v.value_number, res);
2205 expression_t *con = NULL;
2206 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2207 var = op1->reference.entity;
2209 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2210 relation = get_inversed_relation(relation);
2211 var = op2->reference.entity;
2216 type_t *const type = skip_typeref(var->declaration.type);
2217 ir_mode *const mode = get_ir_mode_storage(type);
2219 res = get_value(var->variable.v.value_number, mode);
2220 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2221 set_value(var->variable.v.value_number, res);
2227 * Handle the assume optimizer hint.
2229 * @param dbi debug info
2230 * @param expr the IL assume expression
2232 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2234 switch(expression->kind) {
2235 case EXPR_BINARY_EQUAL:
2236 case EXPR_BINARY_NOTEQUAL:
2237 case EXPR_BINARY_LESS:
2238 case EXPR_BINARY_LESSEQUAL:
2239 case EXPR_BINARY_GREATER:
2240 case EXPR_BINARY_GREATEREQUAL:
2241 return handle_assume_compare(dbi, &expression->binary);
2247 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2248 type_t *from_type, type_t *type)
2250 type = skip_typeref(type);
2251 if (is_type_void(type)) {
2252 /* make sure firm type is constructed */
2253 (void) get_ir_type(type);
2256 if (!is_type_scalar(type)) {
2257 /* make sure firm type is constructed */
2258 (void) get_ir_type(type);
2262 from_type = skip_typeref(from_type);
2263 ir_mode *mode = get_ir_mode_storage(type);
2264 /* check for conversion from / to __based types */
2265 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2266 const variable_t *from_var = from_type->pointer.base_variable;
2267 const variable_t *to_var = type->pointer.base_variable;
2268 if (from_var != to_var) {
2269 if (from_var != NULL) {
2270 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2271 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2272 value_node = new_d_Add(dbgi, value_node, base, mode);
2274 if (to_var != NULL) {
2275 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2276 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2277 value_node = new_d_Sub(dbgi, value_node, base, mode);
2282 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2283 /* bool adjustments (we save a mode_Bu, but have to temporarily
2284 * convert to mode_b so we only get a 0/1 value */
2285 value_node = create_conv(dbgi, value_node, mode_b);
2288 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2289 ir_node *node = create_conv(dbgi, value_node, mode);
2290 node = create_conv(dbgi, node, mode_arith);
2295 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2297 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2298 type_t *type = skip_typeref(expression->base.type);
2300 const expression_t *value = expression->value;
2302 switch(expression->base.kind) {
2303 case EXPR_UNARY_TAKE_ADDRESS:
2304 return expression_to_addr(value);
2306 case EXPR_UNARY_NEGATE: {
2307 ir_node *value_node = expression_to_firm(value);
2308 ir_mode *mode = get_ir_mode_arithmetic(type);
2309 return new_d_Minus(dbgi, value_node, mode);
2311 case EXPR_UNARY_PLUS:
2312 return expression_to_firm(value);
2313 case EXPR_UNARY_BITWISE_NEGATE: {
2314 ir_node *value_node = expression_to_firm(value);
2315 ir_mode *mode = get_ir_mode_arithmetic(type);
2316 return new_d_Not(dbgi, value_node, mode);
2318 case EXPR_UNARY_NOT: {
2319 ir_node *value_node = _expression_to_firm(value);
2320 value_node = create_conv(dbgi, value_node, mode_b);
2321 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2324 case EXPR_UNARY_DEREFERENCE: {
2325 ir_node *value_node = expression_to_firm(value);
2326 type_t *value_type = skip_typeref(value->base.type);
2327 assert(is_type_pointer(value_type));
2329 /* check for __based */
2330 const variable_t *const base_var = value_type->pointer.base_variable;
2331 if (base_var != NULL) {
2332 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2333 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2334 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2336 type_t *points_to = value_type->pointer.points_to;
2337 return deref_address(dbgi, points_to, value_node);
2339 case EXPR_UNARY_POSTFIX_INCREMENT:
2340 case EXPR_UNARY_POSTFIX_DECREMENT:
2341 case EXPR_UNARY_PREFIX_INCREMENT:
2342 case EXPR_UNARY_PREFIX_DECREMENT:
2343 return create_incdec(expression);
2344 case EXPR_UNARY_CAST: {
2345 ir_node *value_node = expression_to_firm(value);
2346 type_t *from_type = value->base.type;
2347 return create_cast(dbgi, value_node, from_type, type);
2349 case EXPR_UNARY_ASSUME:
2350 return handle_assume(dbgi, value);
2355 panic("invalid unary expression type");
2359 * produces a 0/1 depending of the value of a mode_b node
2361 static ir_node *produce_condition_result(const expression_t *expression,
2362 ir_mode *mode, dbg_info *dbgi)
2364 jump_target true_target;
2365 jump_target false_target;
2366 init_jump_target(&true_target, NULL);
2367 init_jump_target(&false_target, NULL);
2368 create_condition_evaluation(expression, &true_target, &false_target);
2370 ir_node *val = NULL;
2371 jump_target exit_target;
2372 init_jump_target(&exit_target, NULL);
2374 if (enter_jump_target(&true_target)) {
2375 val = new_Const(get_mode_one(mode));
2376 jump_to_target(&exit_target);
2379 if (enter_jump_target(&false_target)) {
2380 ir_node *const zero = new_Const(get_mode_null(mode));
2381 jump_to_target(&exit_target);
2383 ir_node *const in[] = { val, zero };
2384 val = new_rd_Phi(dbgi, exit_target.block, lengthof(in), in, mode);
2390 if (!enter_jump_target(&exit_target)) {
2391 set_cur_block(new_Block(0, NULL));
2392 val = new_Unknown(mode);
2397 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2398 ir_node *value, type_t *type)
2400 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2401 assert(is_type_pointer(type));
2402 pointer_type_t *const pointer_type = &type->pointer;
2403 type_t *const points_to = skip_typeref(pointer_type->points_to);
2404 ir_node * elem_size = get_type_size_node(points_to);
2405 elem_size = create_conv(dbgi, elem_size, mode);
2406 value = create_conv(dbgi, value, mode);
2407 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2411 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2412 ir_node *left, ir_node *right)
2415 type_t *type_left = skip_typeref(expression->left->base.type);
2416 type_t *type_right = skip_typeref(expression->right->base.type);
2418 expression_kind_t kind = expression->base.kind;
2421 case EXPR_BINARY_SHIFTLEFT:
2422 case EXPR_BINARY_SHIFTRIGHT:
2423 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2424 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2425 mode = get_ir_mode_arithmetic(expression->base.type);
2426 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2429 case EXPR_BINARY_SUB:
2430 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2431 const pointer_type_t *const ptr_type = &type_left->pointer;
2433 mode = get_ir_mode_arithmetic(expression->base.type);
2434 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2435 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2436 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2437 ir_node *const no_mem = new_NoMem();
2438 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2439 mode, op_pin_state_floats);
2440 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2443 case EXPR_BINARY_SUB_ASSIGN:
2444 if (is_type_pointer(type_left)) {
2445 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2446 mode = get_ir_mode_arithmetic(type_left);
2451 case EXPR_BINARY_ADD:
2452 case EXPR_BINARY_ADD_ASSIGN:
2453 if (is_type_pointer(type_left)) {
2454 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2455 mode = get_ir_mode_arithmetic(type_left);
2457 } else if (is_type_pointer(type_right)) {
2458 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2459 mode = get_ir_mode_arithmetic(type_right);
2466 mode = get_ir_mode_arithmetic(type_right);
2467 left = create_conv(dbgi, left, mode);
2472 case EXPR_BINARY_ADD_ASSIGN:
2473 case EXPR_BINARY_ADD:
2474 return new_d_Add(dbgi, left, right, mode);
2475 case EXPR_BINARY_SUB_ASSIGN:
2476 case EXPR_BINARY_SUB:
2477 return new_d_Sub(dbgi, left, right, mode);
2478 case EXPR_BINARY_MUL_ASSIGN:
2479 case EXPR_BINARY_MUL:
2480 return new_d_Mul(dbgi, left, right, mode);
2481 case EXPR_BINARY_BITWISE_AND:
2482 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2483 return new_d_And(dbgi, left, right, mode);
2484 case EXPR_BINARY_BITWISE_OR:
2485 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2486 return new_d_Or(dbgi, left, right, mode);
2487 case EXPR_BINARY_BITWISE_XOR:
2488 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2489 return new_d_Eor(dbgi, left, right, mode);
2490 case EXPR_BINARY_SHIFTLEFT:
2491 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2492 return new_d_Shl(dbgi, left, right, mode);
2493 case EXPR_BINARY_SHIFTRIGHT:
2494 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2495 if (mode_is_signed(mode)) {
2496 return new_d_Shrs(dbgi, left, right, mode);
2498 return new_d_Shr(dbgi, left, right, mode);
2500 case EXPR_BINARY_DIV:
2501 case EXPR_BINARY_DIV_ASSIGN: {
2502 ir_node *pin = new_Pin(new_NoMem());
2503 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2504 op_pin_state_floats);
2505 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2508 case EXPR_BINARY_MOD:
2509 case EXPR_BINARY_MOD_ASSIGN: {
2510 ir_node *pin = new_Pin(new_NoMem());
2511 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2512 op_pin_state_floats);
2513 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2517 panic("unexpected expression kind");
2521 static ir_node *create_lazy_op(const binary_expression_t *expression)
2523 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2524 type_t *type = skip_typeref(expression->base.type);
2525 ir_mode *mode = get_ir_mode_arithmetic(type);
2527 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2528 bool val = fold_constant_to_bool(expression->left);
2529 expression_kind_t ekind = expression->base.kind;
2530 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2531 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2533 return new_Const(get_mode_null(mode));
2537 return new_Const(get_mode_one(mode));
2541 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2542 bool valr = fold_constant_to_bool(expression->right);
2543 return create_Const_from_bool(mode, valr);
2546 return produce_condition_result(expression->right, mode, dbgi);
2549 return produce_condition_result((const expression_t*) expression, mode,
2553 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2554 ir_node *right, ir_mode *mode);
2556 static ir_node *create_assign_binop(const binary_expression_t *expression)
2558 dbg_info *const dbgi = get_dbg_info(&expression->base.pos);
2559 const expression_t *left_expr = expression->left;
2560 type_t *type = skip_typeref(left_expr->base.type);
2561 ir_node *right = expression_to_firm(expression->right);
2562 ir_node *left_addr = expression_to_addr(left_expr);
2563 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2564 ir_node *result = create_op(dbgi, expression, left, right);
2566 result = create_cast(dbgi, result, expression->right->base.type, type);
2568 result = set_value_for_expression_addr(left_expr, result, left_addr);
2570 if (!is_type_compound(type)) {
2571 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2572 result = create_conv(dbgi, result, mode_arithmetic);
2577 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2579 expression_kind_t kind = expression->base.kind;
2582 case EXPR_BINARY_EQUAL:
2583 case EXPR_BINARY_NOTEQUAL:
2584 case EXPR_BINARY_LESS:
2585 case EXPR_BINARY_LESSEQUAL:
2586 case EXPR_BINARY_GREATER:
2587 case EXPR_BINARY_GREATEREQUAL:
2588 case EXPR_BINARY_ISGREATER:
2589 case EXPR_BINARY_ISGREATEREQUAL:
2590 case EXPR_BINARY_ISLESS:
2591 case EXPR_BINARY_ISLESSEQUAL:
2592 case EXPR_BINARY_ISLESSGREATER:
2593 case EXPR_BINARY_ISUNORDERED: {
2594 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2595 ir_node *left = expression_to_firm(expression->left);
2596 ir_node *right = expression_to_firm(expression->right);
2597 ir_relation relation = get_relation(kind);
2598 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2601 case EXPR_BINARY_ASSIGN: {
2602 ir_node *addr = expression_to_addr(expression->left);
2603 ir_node *right = expression_to_firm(expression->right);
2605 = set_value_for_expression_addr(expression->left, right, addr);
2607 type_t *type = skip_typeref(expression->base.type);
2608 if (!is_type_compound(type)) {
2609 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2610 res = create_conv(NULL, res, mode_arithmetic);
2614 case EXPR_BINARY_ADD:
2615 case EXPR_BINARY_SUB:
2616 case EXPR_BINARY_MUL:
2617 case EXPR_BINARY_DIV:
2618 case EXPR_BINARY_MOD:
2619 case EXPR_BINARY_BITWISE_AND:
2620 case EXPR_BINARY_BITWISE_OR:
2621 case EXPR_BINARY_BITWISE_XOR:
2622 case EXPR_BINARY_SHIFTLEFT:
2623 case EXPR_BINARY_SHIFTRIGHT:
2625 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2626 ir_node *left = expression_to_firm(expression->left);
2627 ir_node *right = expression_to_firm(expression->right);
2628 return create_op(dbgi, expression, left, right);
2630 case EXPR_BINARY_LOGICAL_AND:
2631 case EXPR_BINARY_LOGICAL_OR:
2632 return create_lazy_op(expression);
2633 case EXPR_BINARY_COMMA:
2634 /* create side effects of left side */
2635 (void) expression_to_firm(expression->left);
2636 return _expression_to_firm(expression->right);
2638 case EXPR_BINARY_ADD_ASSIGN:
2639 case EXPR_BINARY_SUB_ASSIGN:
2640 case EXPR_BINARY_MUL_ASSIGN:
2641 case EXPR_BINARY_MOD_ASSIGN:
2642 case EXPR_BINARY_DIV_ASSIGN:
2643 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2644 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2645 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2646 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2647 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2648 return create_assign_binop(expression);
2650 panic("invalid binexpr type");
2654 static ir_node *array_access_addr(const array_access_expression_t *expression)
2656 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2657 ir_node *base_addr = expression_to_firm(expression->array_ref);
2658 ir_node *offset = expression_to_firm(expression->index);
2659 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2660 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2661 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2666 static ir_node *array_access_to_firm(
2667 const array_access_expression_t *expression)
2669 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2670 ir_node *addr = array_access_addr(expression);
2671 type_t *type = revert_automatic_type_conversion(
2672 (const expression_t*) expression);
2673 type = skip_typeref(type);
2675 return deref_address(dbgi, type, addr);
2678 static long get_offsetof_offset(const offsetof_expression_t *expression)
2680 type_t *orig_type = expression->type;
2683 designator_t *designator = expression->designator;
2684 for ( ; designator != NULL; designator = designator->next) {
2685 type_t *type = skip_typeref(orig_type);
2686 /* be sure the type is constructed */
2687 (void) get_ir_type(type);
2689 if (designator->symbol != NULL) {
2690 assert(is_type_compound(type));
2691 symbol_t *symbol = designator->symbol;
2693 compound_t *compound = type->compound.compound;
2694 entity_t *iter = compound->members.entities;
2695 for (; iter->base.symbol != symbol; iter = iter->base.next) {}
2697 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2698 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2699 offset += get_entity_offset(iter->compound_member.entity);
2701 orig_type = iter->declaration.type;
2703 expression_t *array_index = designator->array_index;
2704 assert(designator->array_index != NULL);
2705 assert(is_type_array(type));
2707 long index = fold_constant_to_int(array_index);
2708 ir_type *arr_type = get_ir_type(type);
2709 ir_type *elem_type = get_array_element_type(arr_type);
2710 long elem_size = get_type_size_bytes(elem_type);
2712 offset += index * elem_size;
2714 orig_type = type->array.element_type;
2721 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2723 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2724 long offset = get_offsetof_offset(expression);
2725 ir_tarval *tv = new_tarval_from_long(offset, mode);
2726 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2728 return new_d_Const(dbgi, tv);
2731 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2732 ir_entity *entity, type_t *type);
2733 static ir_initializer_t *create_ir_initializer(
2734 const initializer_t *initializer, type_t *type);
2736 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2737 initializer_t *initializer,
2740 /* create the ir_initializer */
2741 PUSH_IRG(get_const_code_irg());
2742 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2745 ident *const id = id_unique("initializer.%u");
2746 ir_type *const irtype = get_ir_type(type);
2747 ir_type *const global_type = get_glob_type();
2748 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2749 set_entity_ld_ident(entity, id);
2750 set_entity_visibility(entity, ir_visibility_private);
2751 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2752 set_entity_initializer(entity, irinitializer);
2756 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2758 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2759 type_t *type = expression->type;
2760 initializer_t *initializer = expression->initializer;
2762 if (expression->global_scope ||
2763 ((type->base.qualifiers & TYPE_QUALIFIER_CONST)
2764 && is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT)) {
2765 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2766 return create_symconst(dbgi, entity);
2768 /* create an entity on the stack */
2769 ident *const id = id_unique("CompLit.%u");
2770 ir_type *const irtype = get_ir_type(type);
2771 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2773 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2774 set_entity_ld_ident(entity, id);
2776 /* create initialisation code */
2777 create_local_initializer(initializer, dbgi, entity, type);
2779 /* create a sel for the compound literal address */
2780 ir_node *frame = get_irg_frame(current_ir_graph);
2781 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2786 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2788 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2789 type_t *const type = expr->type;
2790 ir_node *const addr = compound_literal_addr(expr);
2791 return deref_address(dbgi, type, addr);
2795 * Transform a sizeof expression into Firm code.
2797 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2799 type_t *const type = skip_typeref(expression->type);
2800 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2801 if (is_type_array(type) && type->array.is_vla
2802 && expression->tp_expression != NULL) {
2803 expression_to_firm(expression->tp_expression);
2806 return get_type_size_node(type);
2809 static entity_t *get_expression_entity(const expression_t *expression)
2811 if (expression->kind != EXPR_REFERENCE)
2814 return expression->reference.entity;
2817 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2819 switch(entity->kind) {
2820 case DECLARATION_KIND_CASES:
2821 return entity->declaration.alignment;
2824 return entity->compound.alignment;
2825 case ENTITY_TYPEDEF:
2826 return entity->typedefe.alignment;
2834 * Transform an alignof expression into Firm code.
2836 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2838 unsigned alignment = 0;
2840 const expression_t *tp_expression = expression->tp_expression;
2841 if (tp_expression != NULL) {
2842 entity_t *entity = get_expression_entity(tp_expression);
2843 if (entity != NULL) {
2844 alignment = get_cparser_entity_alignment(entity);
2848 if (alignment == 0) {
2849 type_t *type = expression->type;
2850 alignment = get_type_alignment(type);
2853 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2854 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2855 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2856 return new_d_Const(dbgi, tv);
2859 static void init_ir_types(void);
2861 ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2863 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2865 bool constant_folding_old = constant_folding;
2866 constant_folding = true;
2867 int old_optimize = get_optimize();
2868 int old_constant_folding = get_opt_constant_folding();
2870 set_opt_constant_folding(1);
2874 PUSH_IRG(get_const_code_irg());
2875 ir_node *const cnst = _expression_to_firm(expression);
2878 set_optimize(old_optimize);
2879 set_opt_constant_folding(old_constant_folding);
2881 if (!is_Const(cnst)) {
2882 panic("couldn't fold constant");
2885 constant_folding = constant_folding_old;
2887 ir_tarval *const tv = get_Const_tarval(cnst);
2888 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
2889 return tarval_convert_to(tv, mode);
2892 /* this function is only used in parser.c, but it relies on libfirm functionality */
2893 bool constant_is_negative(const expression_t *expression)
2895 ir_tarval *tv = fold_constant_to_tarval(expression);
2896 return tarval_is_negative(tv);
2899 long fold_constant_to_int(const expression_t *expression)
2901 ir_tarval *tv = fold_constant_to_tarval(expression);
2902 if (!tarval_is_long(tv)) {
2903 panic("result of constant folding is not integer");
2906 return get_tarval_long(tv);
2909 bool fold_constant_to_bool(const expression_t *expression)
2911 ir_tarval *tv = fold_constant_to_tarval(expression);
2912 return !tarval_is_null(tv);
2915 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2917 /* first try to fold a constant condition */
2918 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
2919 bool val = fold_constant_to_bool(expression->condition);
2921 expression_t *true_expression = expression->true_expression;
2922 if (true_expression == NULL)
2923 true_expression = expression->condition;
2924 return expression_to_firm(true_expression);
2926 return expression_to_firm(expression->false_expression);
2930 jump_target true_target;
2931 jump_target false_target;
2932 init_jump_target(&true_target, NULL);
2933 init_jump_target(&false_target, NULL);
2934 ir_node *const cond_expr = create_condition_evaluation(expression->condition, &true_target, &false_target);
2936 ir_node *val = NULL;
2937 jump_target exit_target;
2938 init_jump_target(&exit_target, NULL);
2940 if (enter_jump_target(&true_target)) {
2941 if (expression->true_expression) {
2942 val = expression_to_firm(expression->true_expression);
2943 } else if (cond_expr && get_irn_mode(cond_expr) != mode_b) {
2946 /* Condition ended with a short circuit (&&, ||, !) operation or a
2947 * comparison. Generate a "1" as value for the true branch. */
2948 val = new_Const(get_mode_one(mode_Is));
2950 jump_to_target(&exit_target);
2953 if (enter_jump_target(&false_target)) {
2954 ir_node *const false_val = expression_to_firm(expression->false_expression);
2955 jump_to_target(&exit_target);
2957 ir_node *const in[] = { val, false_val };
2958 dbg_info *const dbgi = get_dbg_info(&expression->base.pos);
2959 val = new_rd_Phi(dbgi, exit_target.block, lengthof(in), in, get_irn_mode(val));
2965 if (!enter_jump_target(&exit_target)) {
2966 set_cur_block(new_Block(0, NULL));
2967 type_t *const type = skip_typeref(expression->base.type);
2968 if (!is_type_void(type))
2969 val = new_Unknown(get_ir_mode_arithmetic(type));
2975 * Returns an IR-node representing the address of a field.
2977 static ir_node *select_addr(const select_expression_t *expression)
2979 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2981 construct_select_compound(expression);
2983 ir_node *compound_addr = expression_to_firm(expression->compound);
2985 entity_t *entry = expression->compound_entry;
2986 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2987 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2989 if (constant_folding) {
2990 ir_mode *mode = get_irn_mode(compound_addr);
2991 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
2992 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
2993 return new_d_Add(dbgi, compound_addr, ofs, mode);
2995 ir_entity *irentity = entry->compound_member.entity;
2996 assert(irentity != NULL);
2997 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3001 static ir_node *select_to_firm(const select_expression_t *expression)
3003 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
3004 ir_node *addr = select_addr(expression);
3005 type_t *type = revert_automatic_type_conversion(
3006 (const expression_t*) expression);
3007 type = skip_typeref(type);
3009 entity_t *entry = expression->compound_entry;
3010 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3012 if (entry->compound_member.bitfield) {
3013 return bitfield_extract_to_firm(expression, addr);
3016 return deref_address(dbgi, type, addr);
3019 /* Values returned by __builtin_classify_type. */
3020 typedef enum gcc_type_class
3026 enumeral_type_class,
3029 reference_type_class,
3033 function_type_class,
3044 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3046 type_t *type = expr->type_expression->base.type;
3048 /* FIXME gcc returns different values depending on whether compiling C or C++
3049 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3052 type = skip_typeref(type);
3053 switch (type->kind) {
3055 const atomic_type_t *const atomic_type = &type->atomic;
3056 switch (atomic_type->akind) {
3057 /* gcc cannot do that */
3058 case ATOMIC_TYPE_VOID:
3059 tc = void_type_class;
3062 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3063 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3064 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3065 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3066 case ATOMIC_TYPE_SHORT:
3067 case ATOMIC_TYPE_USHORT:
3068 case ATOMIC_TYPE_INT:
3069 case ATOMIC_TYPE_UINT:
3070 case ATOMIC_TYPE_LONG:
3071 case ATOMIC_TYPE_ULONG:
3072 case ATOMIC_TYPE_LONGLONG:
3073 case ATOMIC_TYPE_ULONGLONG:
3074 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3075 tc = integer_type_class;
3078 case ATOMIC_TYPE_FLOAT:
3079 case ATOMIC_TYPE_DOUBLE:
3080 case ATOMIC_TYPE_LONG_DOUBLE:
3081 tc = real_type_class;
3084 panic("Unexpected atomic type.");
3087 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3088 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3089 case TYPE_ARRAY: /* gcc handles this as pointer */
3090 case TYPE_FUNCTION: /* gcc handles this as pointer */
3091 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3092 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3093 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3095 /* gcc handles this as integer */
3096 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3098 /* gcc classifies the referenced type */
3099 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3101 /* typedef/typeof should be skipped already */
3107 panic("unexpected type.");
3111 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
3112 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3113 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3114 return new_d_Const(dbgi, tv);
3117 static ir_node *function_name_to_firm(
3118 const funcname_expression_t *const expr)
3120 switch(expr->kind) {
3121 case FUNCNAME_FUNCTION:
3122 case FUNCNAME_PRETTY_FUNCTION:
3123 case FUNCNAME_FUNCDNAME:
3124 if (current_function_name == NULL) {
3125 position_t const *const src_pos = &expr->base.pos;
3126 char const *const name = current_function_entity->base.symbol->string;
3127 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3128 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3130 return current_function_name;
3131 case FUNCNAME_FUNCSIG:
3132 if (current_funcsig == NULL) {
3133 position_t const *const src_pos = &expr->base.pos;
3134 ir_entity *const ent = get_irg_entity(current_ir_graph);
3135 char const *const name = get_entity_ld_name(ent);
3136 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3137 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3139 return current_funcsig;
3141 panic("Unsupported function name");
3144 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3146 statement_t *statement = expr->statement;
3148 assert(statement->kind == STATEMENT_COMPOUND);
3149 return compound_statement_to_firm(&statement->compound);
3152 static ir_node *va_start_expression_to_firm(
3153 const va_start_expression_t *const expr)
3155 ir_entity *param_ent = current_vararg_entity;
3156 if (param_ent == NULL) {
3157 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3158 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3159 ir_type *const param_type = get_unknown_type();
3160 param_ent = new_parameter_entity(frame_type, n, param_type);
3161 current_vararg_entity = param_ent;
3164 ir_node *const frame = get_irg_frame(current_ir_graph);
3165 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
3166 ir_node *const no_mem = new_NoMem();
3167 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3169 set_value_for_expression(expr->ap, arg_sel);
3174 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3176 type_t *const type = expr->base.type;
3177 expression_t *const ap_expr = expr->ap;
3178 ir_node *const ap_addr = expression_to_addr(ap_expr);
3179 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3180 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
3181 ir_node *const res = deref_address(dbgi, type, ap);
3183 ir_node *const cnst = get_type_size_node(expr->base.type);
3184 ir_mode *const mode = get_irn_mode(cnst);
3185 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3186 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3187 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3188 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3189 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3191 set_value_for_expression_addr(ap_expr, add, ap_addr);
3197 * Generate Firm for a va_copy expression.
3199 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3201 ir_node *const src = expression_to_firm(expr->src);
3202 set_value_for_expression(expr->dst, src);
3206 static ir_node *dereference_addr(const unary_expression_t *const expression)
3208 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3209 return expression_to_firm(expression->value);
3213 * Returns a IR-node representing an lvalue of the given expression.
3215 static ir_node *expression_to_addr(const expression_t *expression)
3217 switch(expression->kind) {
3218 case EXPR_ARRAY_ACCESS:
3219 return array_access_addr(&expression->array_access);
3221 return call_expression_to_firm(&expression->call);
3222 case EXPR_COMPOUND_LITERAL:
3223 return compound_literal_addr(&expression->compound_literal);
3224 case EXPR_REFERENCE:
3225 return reference_addr(&expression->reference);
3227 return select_addr(&expression->select);
3228 case EXPR_UNARY_DEREFERENCE:
3229 return dereference_addr(&expression->unary);
3233 panic("trying to get address of non-lvalue");
3236 static ir_node *builtin_constant_to_firm(
3237 const builtin_constant_expression_t *expression)
3239 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3240 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3241 return create_Const_from_bool(mode, v);
3244 static ir_node *builtin_types_compatible_to_firm(
3245 const builtin_types_compatible_expression_t *expression)
3247 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3248 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3249 bool const value = types_compatible(left, right);
3250 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3251 return create_Const_from_bool(mode, value);
3254 static void prepare_label_target(label_t *const label)
3256 if (label->address_taken && !label->indirect_block) {
3257 ir_node *const iblock = new_immBlock();
3258 label->indirect_block = iblock;
3259 ARR_APP1(ir_node*, ijmp_blocks, iblock);
3260 jump_from_block_to_target(&label->target, iblock);
3265 * Pointer to a label. This is used for the
3266 * GNU address-of-label extension.
3268 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3270 /* Beware: Might be called from create initializer with current_ir_graph
3271 * set to const_code_irg. */
3272 PUSH_IRG(current_function);
3273 prepare_label_target(label->label);
3276 symconst_symbol value;
3277 value.entity_p = create_Block_entity(label->label->indirect_block);
3278 dbg_info *const dbgi = get_dbg_info(&label->base.pos);
3279 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3283 * creates firm nodes for an expression. The difference between this function
3284 * and expression_to_firm is, that this version might produce mode_b nodes
3285 * instead of mode_Is.
3287 static ir_node *_expression_to_firm(expression_t const *const expr)
3290 if (!constant_folding) {
3291 assert(!expr->base.transformed);
3292 ((expression_t*)expr)->base.transformed = true;
3296 switch (expr->kind) {
3297 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3298 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3299 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3300 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3301 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3302 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3303 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3304 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3305 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3306 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3307 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3308 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3309 case EXPR_LITERAL_CHARACTER: return char_literal_to_firm( &expr->string_literal);
3310 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3311 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3312 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3313 case EXPR_SELECT: return select_to_firm( &expr->select);
3314 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3315 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3316 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3317 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3318 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3319 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3321 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.pos, "str.%u", &expr->string_literal.value);
3323 case EXPR_ERROR: break;
3325 panic("invalid expression");
3329 * Check if a given expression is a GNU __builtin_expect() call.
3331 static bool is_builtin_expect(const expression_t *expression)
3333 if (expression->kind != EXPR_CALL)
3336 expression_t *function = expression->call.function;
3337 if (function->kind != EXPR_REFERENCE)
3339 reference_expression_t *ref = &function->reference;
3340 if (ref->entity->kind != ENTITY_FUNCTION ||
3341 ref->entity->function.btk != BUILTIN_EXPECT)
3347 static bool produces_mode_b(const expression_t *expression)
3349 switch (expression->kind) {
3350 case EXPR_BINARY_EQUAL:
3351 case EXPR_BINARY_NOTEQUAL:
3352 case EXPR_BINARY_LESS:
3353 case EXPR_BINARY_LESSEQUAL:
3354 case EXPR_BINARY_GREATER:
3355 case EXPR_BINARY_GREATEREQUAL:
3356 case EXPR_BINARY_ISGREATER:
3357 case EXPR_BINARY_ISGREATEREQUAL:
3358 case EXPR_BINARY_ISLESS:
3359 case EXPR_BINARY_ISLESSEQUAL:
3360 case EXPR_BINARY_ISLESSGREATER:
3361 case EXPR_BINARY_ISUNORDERED:
3362 case EXPR_UNARY_NOT:
3366 if (is_builtin_expect(expression)) {
3367 expression_t *argument = expression->call.arguments->expression;
3368 return produces_mode_b(argument);
3371 case EXPR_BINARY_COMMA:
3372 return produces_mode_b(expression->binary.right);
3379 static ir_node *expression_to_firm(const expression_t *expression)
3381 if (!produces_mode_b(expression)) {
3382 ir_node *res = _expression_to_firm(expression);
3383 assert(res == NULL || get_irn_mode(res) != mode_b);
3387 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3388 return new_Const(fold_constant_to_tarval(expression));
3391 /* we have to produce a 0/1 from the mode_b expression */
3392 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
3393 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3394 return produce_condition_result(expression, mode, dbgi);
3398 * create a short-circuit expression evaluation that tries to construct
3399 * efficient control flow structures for &&, || and ! expressions
3401 static ir_node *create_condition_evaluation(expression_t const *const expression, jump_target *const true_target, jump_target *const false_target)
3403 switch(expression->kind) {
3404 case EXPR_UNARY_NOT: {
3405 const unary_expression_t *unary_expression = &expression->unary;
3406 create_condition_evaluation(unary_expression->value, false_target, true_target);
3409 case EXPR_BINARY_LOGICAL_AND: {
3410 jump_target extra_target;
3411 init_jump_target(&extra_target, NULL);
3412 create_condition_evaluation(expression->binary.left, &extra_target, false_target);
3413 if (enter_jump_target(&extra_target))
3414 create_condition_evaluation(expression->binary.right, true_target, false_target);
3417 case EXPR_BINARY_LOGICAL_OR: {
3418 jump_target extra_target;
3419 init_jump_target(&extra_target, NULL);
3420 create_condition_evaluation(expression->binary.left, true_target, &extra_target);
3421 if (enter_jump_target(&extra_target))
3422 create_condition_evaluation(expression->binary.right, true_target, false_target);
3429 ir_node *cond_expr = _expression_to_firm(expression);
3430 if (is_Const(cond_expr)) {
3431 if (tarval_is_null(get_Const_tarval(cond_expr))) {
3432 jump_to_target(false_target);
3434 jump_to_target(true_target);
3437 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
3438 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3439 ir_node *cond = new_d_Cond(dbgi, condition);
3440 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3441 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3443 /* set branch prediction info based on __builtin_expect */
3444 if (is_builtin_expect(expression) && is_Cond(cond)) {
3445 call_argument_t *argument = expression->call.arguments->next;
3446 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3447 bool const cnst = fold_constant_to_bool(argument->expression);
3448 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3449 set_Cond_jmp_pred(cond, pred);
3453 add_pred_to_jump_target(true_target, true_proj);
3454 add_pred_to_jump_target(false_target, false_proj);
3456 set_unreachable_now();
3460 static void create_variable_entity(entity_t *variable,
3461 declaration_kind_t declaration_kind,
3462 ir_type *parent_type)
3464 assert(variable->kind == ENTITY_VARIABLE);
3465 type_t *type = skip_typeref(variable->declaration.type);
3467 ident *const id = new_id_from_str(variable->base.symbol->string);
3468 ir_type *const irtype = get_ir_type(type);
3469 dbg_info *const dbgi = get_dbg_info(&variable->base.pos);
3470 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3471 unsigned alignment = variable->declaration.alignment;
3473 set_entity_alignment(irentity, alignment);
3475 handle_decl_modifiers(irentity, variable);
3477 variable->declaration.kind = (unsigned char) declaration_kind;
3478 variable->variable.v.entity = irentity;
3479 set_entity_ld_ident(irentity, create_ld_ident(variable));
3481 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3482 set_entity_volatility(irentity, volatility_is_volatile);
3487 typedef struct type_path_entry_t type_path_entry_t;
3488 struct type_path_entry_t {
3490 ir_initializer_t *initializer;
3492 entity_t *compound_entry;
3495 typedef struct type_path_t type_path_t;
3496 struct type_path_t {
3497 type_path_entry_t *path;
3502 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3504 size_t len = ARR_LEN(path->path);
3506 for (size_t i = 0; i < len; ++i) {
3507 const type_path_entry_t *entry = & path->path[i];
3509 type_t *type = skip_typeref(entry->type);
3510 if (is_type_compound(type)) {
3511 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3512 } else if (is_type_array(type)) {
3513 fprintf(stderr, "[%u]", (unsigned) entry->index);
3515 fprintf(stderr, "-INVALID-");
3518 fprintf(stderr, " (");
3519 print_type(path->top_type);
3520 fprintf(stderr, ")");
3523 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3525 size_t len = ARR_LEN(path->path);
3527 return & path->path[len-1];
3530 static type_path_entry_t *append_to_type_path(type_path_t *path)
3532 size_t len = ARR_LEN(path->path);
3533 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3535 type_path_entry_t *result = & path->path[len];
3536 memset(result, 0, sizeof(result[0]));
3540 static size_t get_compound_member_count(const compound_type_t *type)
3542 compound_t *compound = type->compound;
3543 size_t n_members = 0;
3544 entity_t *member = compound->members.entities;
3545 for ( ; member != NULL; member = member->base.next) {
3552 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3554 type_t *orig_top_type = path->top_type;
3555 type_t *top_type = skip_typeref(orig_top_type);
3557 assert(is_type_compound(top_type) || is_type_array(top_type));
3559 if (ARR_LEN(path->path) == 0) {
3562 type_path_entry_t *top = get_type_path_top(path);
3563 ir_initializer_t *initializer = top->initializer;
3564 return get_initializer_compound_value(initializer, top->index);
3568 static void descend_into_subtype(type_path_t *path)
3570 type_t *orig_top_type = path->top_type;
3571 type_t *top_type = skip_typeref(orig_top_type);
3573 assert(is_type_compound(top_type) || is_type_array(top_type));
3575 ir_initializer_t *initializer = get_initializer_entry(path);
3577 type_path_entry_t *top = append_to_type_path(path);
3578 top->type = top_type;
3582 if (is_type_compound(top_type)) {
3583 compound_t *const compound = top_type->compound.compound;
3584 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3586 top->compound_entry = entry;
3588 len = get_compound_member_count(&top_type->compound);
3589 if (entry != NULL) {
3590 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3591 path->top_type = entry->declaration.type;
3594 assert(is_type_array(top_type));
3595 assert(top_type->array.size > 0);
3598 path->top_type = top_type->array.element_type;
3599 len = top_type->array.size;
3601 if (initializer == NULL
3602 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3603 initializer = create_initializer_compound(len);
3604 /* we have to set the entry at the 2nd latest path entry... */
3605 size_t path_len = ARR_LEN(path->path);
3606 assert(path_len >= 1);
3608 type_path_entry_t *entry = & path->path[path_len-2];
3609 ir_initializer_t *tinitializer = entry->initializer;
3610 set_initializer_compound_value(tinitializer, entry->index,
3614 top->initializer = initializer;
3617 static void ascend_from_subtype(type_path_t *path)
3619 type_path_entry_t *top = get_type_path_top(path);
3621 path->top_type = top->type;
3623 size_t len = ARR_LEN(path->path);
3624 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3627 static void walk_designator(type_path_t *path, const designator_t *designator)
3629 /* designators start at current object type */
3630 ARR_RESIZE(type_path_entry_t, path->path, 1);
3632 for ( ; designator != NULL; designator = designator->next) {
3633 type_path_entry_t *top = get_type_path_top(path);
3634 type_t *orig_type = top->type;
3635 type_t *type = skip_typeref(orig_type);
3637 if (designator->symbol != NULL) {
3638 assert(is_type_compound(type));
3640 symbol_t *symbol = designator->symbol;
3642 compound_t *compound = type->compound.compound;
3643 entity_t *iter = compound->members.entities;
3644 for (; iter->base.symbol != symbol; iter = iter->base.next, ++index) {}
3645 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3647 /* revert previous initialisations of other union elements */
3648 if (type->kind == TYPE_COMPOUND_UNION) {
3649 ir_initializer_t *initializer = top->initializer;
3650 if (initializer != NULL
3651 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3652 /* are we writing to a new element? */
3653 ir_initializer_t *oldi
3654 = get_initializer_compound_value(initializer, index);
3655 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3656 /* clear initializer */
3658 = get_initializer_compound_n_entries(initializer);
3659 ir_initializer_t *nulli = get_initializer_null();
3660 for (size_t i = 0; i < len; ++i) {
3661 set_initializer_compound_value(initializer, i,
3668 top->type = orig_type;
3669 top->compound_entry = iter;
3671 orig_type = iter->declaration.type;
3673 expression_t *array_index = designator->array_index;
3674 assert(is_type_array(type));
3676 long index = fold_constant_to_int(array_index);
3677 assert(0 <= index && (!type->array.size_constant || (size_t)index < type->array.size));
3679 top->type = orig_type;
3680 top->index = (size_t) index;
3681 orig_type = type->array.element_type;
3683 path->top_type = orig_type;
3685 if (designator->next != NULL) {
3686 descend_into_subtype(path);
3690 path->invalid = false;
3693 static void advance_current_object(type_path_t *path)
3695 if (path->invalid) {
3696 /* TODO: handle this... */
3697 panic("invalid initializer (excessive elements)");
3700 type_path_entry_t *top = get_type_path_top(path);
3702 type_t *type = skip_typeref(top->type);
3703 if (is_type_union(type)) {
3704 /* only the first element is initialized in unions */
3705 top->compound_entry = NULL;
3706 } else if (is_type_struct(type)) {
3707 entity_t *entry = top->compound_entry;
3710 entry = skip_unnamed_bitfields(entry->base.next);
3711 top->compound_entry = entry;
3712 if (entry != NULL) {
3713 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3714 path->top_type = entry->declaration.type;
3718 assert(is_type_array(type));
3721 if (!type->array.size_constant || top->index < type->array.size) {
3726 /* we're past the last member of the current sub-aggregate, try if we
3727 * can ascend in the type hierarchy and continue with another subobject */
3728 size_t len = ARR_LEN(path->path);
3731 ascend_from_subtype(path);
3732 advance_current_object(path);
3734 path->invalid = true;
3739 static ir_initializer_t *create_ir_initializer_value(
3740 const initializer_value_t *initializer)
3742 expression_t *expr = initializer->value;
3743 type_t *type = skip_typeref(expr->base.type);
3745 if (is_type_compound(type)) {
3746 if (expr->kind == EXPR_UNARY_CAST) {
3747 expr = expr->unary.value;
3748 type = skip_typeref(expr->base.type);
3750 /* must be a compound literal... */
3751 if (expr->kind == EXPR_COMPOUND_LITERAL) {
3752 return create_ir_initializer(expr->compound_literal.initializer,
3757 ir_node *value = expression_to_firm(expr);
3758 if (!is_type_compound(type)) {
3759 ir_mode *mode = get_ir_mode_storage(type);
3760 value = create_conv(NULL, value, mode);
3762 return create_initializer_const(value);
3765 /** test wether type can be initialized by a string constant */
3766 static bool is_string_type(type_t *type)
3768 if (!is_type_array(type))
3771 type_t *const inner = skip_typeref(type->array.element_type);
3772 return is_type_integer(inner);
3775 static ir_initializer_t *create_ir_initializer_list(
3776 const initializer_list_t *initializer, type_t *type)
3779 memset(&path, 0, sizeof(path));
3780 path.top_type = type;
3781 path.path = NEW_ARR_F(type_path_entry_t, 0);
3783 descend_into_subtype(&path);
3785 for (size_t i = 0; i < initializer->len; ++i) {
3786 const initializer_t *sub_initializer = initializer->initializers[i];
3788 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3789 walk_designator(&path, sub_initializer->designator.designator);
3793 if (sub_initializer->kind == INITIALIZER_VALUE) {
3794 const expression_t *expr = sub_initializer->value.value;
3795 const type_t *expr_type = skip_typeref(expr->base.type);
3796 /* we might have to descend into types until the types match */
3798 type_t *orig_top_type = path.top_type;
3799 type_t *top_type = skip_typeref(orig_top_type);
3801 if (types_compatible(top_type, expr_type))
3803 descend_into_subtype(&path);
3805 } else if (sub_initializer->kind == INITIALIZER_STRING) {
3806 /* we might have to descend into types until we're at a scalar
3809 type_t *orig_top_type = path.top_type;
3810 type_t *top_type = skip_typeref(orig_top_type);
3812 if (is_string_type(top_type))
3814 descend_into_subtype(&path);
3818 ir_initializer_t *sub_irinitializer
3819 = create_ir_initializer(sub_initializer, path.top_type);
3821 size_t path_len = ARR_LEN(path.path);
3822 assert(path_len >= 1);
3823 type_path_entry_t *entry = & path.path[path_len-1];
3824 ir_initializer_t *tinitializer = entry->initializer;
3825 set_initializer_compound_value(tinitializer, entry->index,
3828 advance_current_object(&path);
3831 assert(ARR_LEN(path.path) >= 1);
3832 ir_initializer_t *result = path.path[0].initializer;
3833 DEL_ARR_F(path.path);
3838 static ir_initializer_t *create_ir_initializer_string(initializer_t const *const init, type_t *type)
3840 type = skip_typeref(type);
3842 assert(type->kind == TYPE_ARRAY);
3843 assert(type->array.size_constant);
3844 string_literal_expression_t const *const str = get_init_string(init);
3845 size_t const str_len = str->value.size;
3846 size_t const arr_len = type->array.size;
3847 ir_initializer_t *const irinit = create_initializer_compound(arr_len);
3848 ir_mode *const mode = get_ir_mode_storage(type->array.element_type);
3849 char const * p = str->value.begin;
3850 switch (str->value.encoding) {
3851 case STRING_ENCODING_CHAR:
3852 case STRING_ENCODING_UTF8:
3853 for (size_t i = 0; i != arr_len; ++i) {
3854 char const c = i < str_len ? *p++ : 0;
3855 ir_tarval *const tv = new_tarval_from_long(c, mode);
3856 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3857 set_initializer_compound_value(irinit, i, tvinit);
3861 case STRING_ENCODING_CHAR16:
3862 case STRING_ENCODING_CHAR32:
3863 case STRING_ENCODING_WIDE:
3864 for (size_t i = 0; i != arr_len; ++i) {
3865 utf32 const c = i < str_len ? read_utf8_char(&p) : 0;
3866 ir_tarval *const tv = new_tarval_from_long(c, mode);
3867 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3868 set_initializer_compound_value(irinit, i, tvinit);
3876 static ir_initializer_t *create_ir_initializer(
3877 const initializer_t *initializer, type_t *type)
3879 switch(initializer->kind) {
3880 case INITIALIZER_STRING:
3881 return create_ir_initializer_string(initializer, type);
3883 case INITIALIZER_LIST:
3884 return create_ir_initializer_list(&initializer->list, type);
3886 case INITIALIZER_VALUE:
3887 return create_ir_initializer_value(&initializer->value);
3889 case INITIALIZER_DESIGNATOR:
3890 panic("unexpected designator initializer");
3892 panic("unknown initializer");
3895 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
3896 * are elements [...] the remainder of the aggregate shall be initialized
3897 * implicitly the same as objects that have static storage duration. */
3898 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
3901 /* for unions we must NOT do anything for null initializers */
3902 ir_type *owner = get_entity_owner(entity);
3903 if (is_Union_type(owner)) {
3907 ir_type *ent_type = get_entity_type(entity);
3908 /* create sub-initializers for a compound type */
3909 if (is_compound_type(ent_type)) {
3910 unsigned n_members = get_compound_n_members(ent_type);
3911 for (unsigned n = 0; n < n_members; ++n) {
3912 ir_entity *member = get_compound_member(ent_type, n);
3913 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
3915 create_dynamic_null_initializer(member, dbgi, addr);
3919 if (is_Array_type(ent_type)) {
3920 assert(has_array_upper_bound(ent_type, 0));
3921 long n = get_array_upper_bound_int(ent_type, 0);
3922 for (long i = 0; i < n; ++i) {
3923 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3924 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3925 ir_node *cnst = new_d_Const(dbgi, index_tv);
3926 ir_node *in[1] = { cnst };
3927 ir_entity *arrent = get_array_element_entity(ent_type);
3928 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
3930 create_dynamic_null_initializer(arrent, dbgi, addr);
3935 ir_mode *value_mode = get_type_mode(ent_type);
3936 ir_node *node = new_Const(get_mode_null(value_mode));
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 ir_node *mem = get_store();
3946 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3947 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3951 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
3952 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
3954 switch(get_initializer_kind(initializer)) {
3955 case IR_INITIALIZER_NULL:
3956 create_dynamic_null_initializer(entity, dbgi, base_addr);
3958 case IR_INITIALIZER_CONST: {
3959 ir_node *node = get_initializer_const_value(initializer);
3960 ir_type *ent_type = get_entity_type(entity);
3962 /* is it a bitfield type? */
3963 if (is_Primitive_type(ent_type) &&
3964 get_primitive_base_type(ent_type) != NULL) {
3965 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3969 ir_node *mem = get_store();
3971 if (is_compound_type(ent_type)) {
3972 ir_node *copyb = new_d_CopyB(dbgi, mem, base_addr, node, ent_type);
3973 new_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
3975 assert(get_type_mode(type) == get_irn_mode(node));
3976 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3977 new_mem = new_Proj(store, mode_M, pn_Store_M);
3982 case IR_INITIALIZER_TARVAL: {
3983 ir_tarval *tv = get_initializer_tarval_value(initializer);
3984 ir_node *cnst = new_d_Const(dbgi, tv);
3985 ir_type *ent_type = get_entity_type(entity);
3987 /* is it a bitfield type? */
3988 if (is_Primitive_type(ent_type) &&
3989 get_primitive_base_type(ent_type) != NULL) {
3990 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
3994 assert(get_type_mode(type) == get_tarval_mode(tv));
3995 ir_node *mem = get_store();
3996 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
3997 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4001 case IR_INITIALIZER_COMPOUND: {
4002 assert(is_compound_type(type) || is_Array_type(type));
4004 if (is_Array_type(type)) {
4005 assert(has_array_upper_bound(type, 0));
4006 n_members = get_array_upper_bound_int(type, 0);
4008 n_members = get_compound_n_members(type);
4011 if (get_initializer_compound_n_entries(initializer)
4012 != (unsigned) n_members)
4013 panic("initializer doesn't match compound type");
4015 for (int i = 0; i < n_members; ++i) {
4018 ir_entity *sub_entity;
4019 if (is_Array_type(type)) {
4020 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4021 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4022 ir_node *cnst = new_d_Const(dbgi, index_tv);
4023 ir_node *in[1] = { cnst };
4024 irtype = get_array_element_type(type);
4025 sub_entity = get_array_element_entity(type);
4026 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4029 sub_entity = get_compound_member(type, i);
4030 irtype = get_entity_type(sub_entity);
4031 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4035 ir_initializer_t *sub_init
4036 = get_initializer_compound_value(initializer, i);
4038 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4045 panic("invalid ir_initializer");
4048 static void create_dynamic_initializer(ir_initializer_t *initializer,
4049 dbg_info *dbgi, ir_entity *entity)
4051 ir_node *frame = get_irg_frame(current_ir_graph);
4052 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4053 ir_type *type = get_entity_type(entity);
4055 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4058 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4059 ir_entity *entity, type_t *type)
4061 ir_node *memory = get_store();
4062 ir_node *nomem = new_NoMem();
4063 ir_node *frame = get_irg_frame(current_ir_graph);
4064 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4066 if (initializer->kind == INITIALIZER_VALUE) {
4067 initializer_value_t *initializer_value = &initializer->value;
4069 ir_node *value = expression_to_firm(initializer_value->value);
4070 type = skip_typeref(type);
4071 assign_value(dbgi, addr, type, value);
4075 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4076 ir_initializer_t *irinitializer
4077 = create_ir_initializer(initializer, type);
4079 create_dynamic_initializer(irinitializer, dbgi, entity);
4083 /* create a "template" entity which is copied to the entity on the stack */
4084 ir_entity *const init_entity
4085 = create_initializer_entity(dbgi, initializer, type);
4086 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4087 ir_type *const irtype = get_ir_type(type);
4088 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4090 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4091 set_store(copyb_mem);
4094 static void create_initializer_local_variable_entity(entity_t *entity)
4096 assert(entity->kind == ENTITY_VARIABLE);
4097 initializer_t *initializer = entity->variable.initializer;
4098 dbg_info *dbgi = get_dbg_info(&entity->base.pos);
4099 ir_entity *irentity = entity->variable.v.entity;
4100 type_t *type = entity->declaration.type;
4102 create_local_initializer(initializer, dbgi, irentity, type);
4105 static void create_variable_initializer(entity_t *entity)
4107 assert(entity->kind == ENTITY_VARIABLE);
4108 initializer_t *initializer = entity->variable.initializer;
4109 if (initializer == NULL)
4112 declaration_kind_t declaration_kind
4113 = (declaration_kind_t) entity->declaration.kind;
4114 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4115 create_initializer_local_variable_entity(entity);
4119 type_t *type = entity->declaration.type;
4120 type_qualifiers_t tq = get_type_qualifier(type, true);
4122 if (initializer->kind == INITIALIZER_VALUE) {
4123 expression_t * value = initializer->value.value;
4124 type_t *const init_type = skip_typeref(value->base.type);
4126 if (!is_type_scalar(init_type)) {
4128 while (value->kind == EXPR_UNARY_CAST)
4129 value = value->unary.value;
4131 if (value->kind != EXPR_COMPOUND_LITERAL)
4132 panic("expected non-scalar initializer to be a compound literal");
4133 initializer = value->compound_literal.initializer;
4134 goto have_initializer;
4137 ir_node * node = expression_to_firm(value);
4138 dbg_info *const dbgi = get_dbg_info(&entity->base.pos);
4139 ir_mode *const mode = get_ir_mode_storage(init_type);
4140 node = create_conv(dbgi, node, mode);
4142 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4143 set_value(entity->variable.v.value_number, node);
4145 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4147 ir_entity *irentity = entity->variable.v.entity;
4149 if (tq & TYPE_QUALIFIER_CONST
4150 && get_entity_owner(irentity) != get_tls_type()) {
4151 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4153 set_atomic_ent_value(irentity, node);
4157 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4158 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4160 ir_entity *irentity = entity->variable.v.entity;
4161 ir_initializer_t *irinitializer
4162 = create_ir_initializer(initializer, type);
4164 if (tq & TYPE_QUALIFIER_CONST) {
4165 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4167 set_entity_initializer(irentity, irinitializer);
4171 static void create_variable_length_array(entity_t *entity)
4173 assert(entity->kind == ENTITY_VARIABLE);
4174 assert(entity->variable.initializer == NULL);
4176 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4177 entity->variable.v.vla_base = NULL;
4179 /* TODO: record VLA somewhere so we create the free node when we leave
4183 static void allocate_variable_length_array(entity_t *entity)
4185 assert(entity->kind == ENTITY_VARIABLE);
4186 assert(entity->variable.initializer == NULL);
4187 assert(currently_reachable());
4189 dbg_info *dbgi = get_dbg_info(&entity->base.pos);
4190 type_t *type = entity->declaration.type;
4191 ir_type *el_type = get_ir_type(type->array.element_type);
4193 /* make sure size_node is calculated */
4194 get_type_size_node(type);
4195 ir_node *elems = type->array.size_node;
4196 ir_node *mem = get_store();
4197 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4199 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4200 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4203 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4204 entity->variable.v.vla_base = addr;
4207 static bool var_needs_entity(variable_t const *const var)
4209 if (var->address_taken)
4211 type_t *const type = skip_typeref(var->base.type);
4212 return !is_type_scalar(type) || type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
4216 * Creates a Firm local variable from a declaration.
4218 static void create_local_variable(entity_t *entity)
4220 assert(entity->kind == ENTITY_VARIABLE);
4221 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4223 if (!var_needs_entity(&entity->variable)) {
4224 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4225 entity->variable.v.value_number = next_value_number_function;
4226 set_irg_loc_description(current_ir_graph, next_value_number_function, entity);
4227 ++next_value_number_function;
4231 /* is it a variable length array? */
4232 type_t *const type = skip_typeref(entity->declaration.type);
4233 if (is_type_array(type) && !type->array.size_constant) {
4234 create_variable_length_array(entity);
4238 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
4239 create_variable_entity(entity, DECLARATION_KIND_LOCAL_VARIABLE_ENTITY, frame_type);
4242 static void create_local_static_variable(entity_t *entity)
4244 assert(entity->kind == ENTITY_VARIABLE);
4245 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4247 type_t *type = skip_typeref(entity->declaration.type);
4248 ir_type *const var_type = entity->variable.thread_local ?
4249 get_tls_type() : get_glob_type();
4250 ir_type *const irtype = get_ir_type(type);
4251 dbg_info *const dbgi = get_dbg_info(&entity->base.pos);
4253 size_t l = strlen(entity->base.symbol->string);
4254 char buf[l + sizeof(".%u")];
4255 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4256 ident *const id = id_unique(buf);
4257 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4259 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4260 set_entity_volatility(irentity, volatility_is_volatile);
4263 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4264 entity->variable.v.entity = irentity;
4266 set_entity_ld_ident(irentity, id);
4267 set_entity_visibility(irentity, ir_visibility_local);
4269 if (entity->variable.initializer == NULL) {
4270 ir_initializer_t *null_init = get_initializer_null();
4271 set_entity_initializer(irentity, null_init);
4274 PUSH_IRG(get_const_code_irg());
4275 create_variable_initializer(entity);
4281 static ir_node *return_statement_to_firm(return_statement_t *statement)
4283 if (!currently_reachable())
4286 dbg_info *const dbgi = get_dbg_info(&statement->base.pos);
4287 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4288 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4291 if (!is_type_void(type)) {
4292 ir_mode *const mode = get_ir_mode_storage(type);
4294 res = create_conv(dbgi, res, mode);
4296 res = new_Unknown(mode);
4303 ir_node *const in[1] = { res };
4304 ir_node *const store = get_store();
4305 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4307 ir_node *end_block = get_irg_end_block(current_ir_graph);
4308 add_immBlock_pred(end_block, ret);
4310 set_unreachable_now();
4314 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4316 if (!currently_reachable())
4319 return expression_to_firm(statement->expression);
4322 static void create_local_declarations(entity_t*);
4324 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4326 create_local_declarations(compound->scope.entities);
4328 ir_node *result = NULL;
4329 statement_t *statement = compound->statements;
4330 for ( ; statement != NULL; statement = statement->base.next) {
4331 result = statement_to_firm(statement);
4337 static void create_global_variable(entity_t *entity)
4339 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4340 ir_visibility visibility = ir_visibility_external;
4341 storage_class_tag_t storage
4342 = (storage_class_tag_t)entity->declaration.storage_class;
4343 decl_modifiers_t modifiers = entity->declaration.modifiers;
4344 assert(entity->kind == ENTITY_VARIABLE);
4347 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4348 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4349 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
4350 case STORAGE_CLASS_TYPEDEF:
4351 case STORAGE_CLASS_AUTO:
4352 case STORAGE_CLASS_REGISTER:
4353 panic("invalid storage class for global var");
4356 /* "common" symbols */
4357 if (storage == STORAGE_CLASS_NONE
4358 && entity->variable.initializer == NULL
4359 && !entity->variable.thread_local
4360 && (modifiers & DM_WEAK) == 0) {
4361 linkage |= IR_LINKAGE_MERGE;
4364 ir_type *var_type = get_glob_type();
4365 if (entity->variable.thread_local) {
4366 var_type = get_tls_type();
4368 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4369 ir_entity *irentity = entity->variable.v.entity;
4370 add_entity_linkage(irentity, linkage);
4371 set_entity_visibility(irentity, visibility);
4372 if (entity->variable.initializer == NULL
4373 && storage != STORAGE_CLASS_EXTERN) {
4374 ir_initializer_t *null_init = get_initializer_null();
4375 set_entity_initializer(irentity, null_init);
4379 static void create_local_declaration(entity_t *entity)
4381 assert(is_declaration(entity));
4383 /* construct type */
4384 (void) get_ir_type(entity->declaration.type);
4385 if (entity->base.symbol == NULL) {
4389 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4390 case STORAGE_CLASS_STATIC:
4391 if (entity->kind == ENTITY_FUNCTION) {
4392 (void)get_function_entity(entity, NULL);
4394 create_local_static_variable(entity);
4397 case STORAGE_CLASS_EXTERN:
4398 if (entity->kind == ENTITY_FUNCTION) {
4399 assert(entity->function.body == NULL);
4400 (void)get_function_entity(entity, NULL);
4402 create_global_variable(entity);
4403 create_variable_initializer(entity);
4406 case STORAGE_CLASS_NONE:
4407 case STORAGE_CLASS_AUTO:
4408 case STORAGE_CLASS_REGISTER:
4409 if (entity->kind == ENTITY_FUNCTION) {
4410 if (entity->function.body != NULL) {
4411 ir_type *owner = get_irg_frame_type(current_ir_graph);
4412 (void)get_function_entity(entity, owner);
4413 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4414 enqueue_inner_function(entity);
4416 (void)get_function_entity(entity, NULL);
4419 create_local_variable(entity);
4422 case STORAGE_CLASS_TYPEDEF:
4425 panic("invalid storage class");
4428 static void create_local_declarations(entity_t *e)
4430 for (; e; e = e->base.next) {
4431 if (is_declaration(e))
4432 create_local_declaration(e);
4436 static void initialize_local_declaration(entity_t *entity)
4438 if (entity->base.symbol == NULL)
4441 // no need to emit code in dead blocks
4442 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4443 && !currently_reachable())
4446 switch ((declaration_kind_t) entity->declaration.kind) {
4447 case DECLARATION_KIND_LOCAL_VARIABLE:
4448 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4449 create_variable_initializer(entity);
4452 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4453 allocate_variable_length_array(entity);
4456 case DECLARATION_KIND_COMPOUND_MEMBER:
4457 case DECLARATION_KIND_GLOBAL_VARIABLE:
4458 case DECLARATION_KIND_FUNCTION:
4459 case DECLARATION_KIND_INNER_FUNCTION:
4462 case DECLARATION_KIND_PARAMETER:
4463 case DECLARATION_KIND_PARAMETER_ENTITY:
4464 panic("can't initialize parameters");
4466 case DECLARATION_KIND_UNKNOWN:
4467 panic("can't initialize unknown declaration");
4469 panic("invalid declaration kind");
4472 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4474 entity_t *entity = statement->declarations_begin;
4478 entity_t *const last = statement->declarations_end;
4479 for ( ;; entity = entity->base.next) {
4480 if (is_declaration(entity)) {
4481 initialize_local_declaration(entity);
4482 } else if (entity->kind == ENTITY_TYPEDEF) {
4483 /* ยง6.7.7:3 Any array size expressions associated with variable length
4484 * array declarators are evaluated each time the declaration of the
4485 * typedef name is reached in the order of execution. */
4486 type_t *const type = skip_typeref(entity->typedefe.type);
4487 if (is_type_array(type) && type->array.is_vla)
4488 get_vla_size(&type->array);
4497 static ir_node *if_statement_to_firm(if_statement_t *statement)
4499 create_local_declarations(statement->scope.entities);
4501 /* Create the condition. */
4502 jump_target true_target;
4503 jump_target false_target;
4504 init_jump_target(&true_target, NULL);
4505 init_jump_target(&false_target, NULL);
4506 if (currently_reachable())
4507 create_condition_evaluation(statement->condition, &true_target, &false_target);
4509 jump_target exit_target;
4510 init_jump_target(&exit_target, NULL);
4512 /* Create the true statement. */
4513 enter_jump_target(&true_target);
4514 statement_to_firm(statement->true_statement);
4515 jump_to_target(&exit_target);
4517 /* Create the false statement. */
4518 enter_jump_target(&false_target);
4519 if (statement->false_statement)
4520 statement_to_firm(statement->false_statement);
4521 jump_to_target(&exit_target);
4523 enter_jump_target(&exit_target);
4527 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4529 create_local_declarations(statement->scope.entities);
4532 PUSH_CONTINUE(NULL);
4534 expression_t *const cond = statement->condition;
4535 /* Avoid an explicit body block in case of do ... while (0);. */
4536 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT && !fold_constant_to_bool(cond)) {
4537 /* do ... while (0);. */
4538 statement_to_firm(statement->body);
4539 jump_to_target(&continue_target);
4540 enter_jump_target(&continue_target);
4541 jump_to_target(&break_target);
4543 jump_target body_target;
4544 init_jump_target(&body_target, NULL);
4545 jump_to_target(&body_target);
4546 enter_immature_jump_target(&body_target);
4548 statement_to_firm(statement->body);
4549 jump_to_target(&continue_target);
4550 if (enter_jump_target(&continue_target))
4551 create_condition_evaluation(statement->condition, &body_target, &break_target);
4552 enter_jump_target(&body_target);
4554 enter_jump_target(&break_target);
4561 static ir_node *for_statement_to_firm(for_statement_t *statement)
4563 create_local_declarations(statement->scope.entities);
4565 if (currently_reachable()) {
4566 entity_t *entity = statement->scope.entities;
4567 for ( ; entity != NULL; entity = entity->base.next) {
4568 if (!is_declaration(entity))
4571 initialize_local_declaration(entity);
4574 if (statement->initialisation != NULL) {
4575 expression_to_firm(statement->initialisation);
4579 /* Create the header block */
4580 jump_target header_target;
4581 init_jump_target(&header_target, NULL);
4582 jump_to_target(&header_target);
4583 enter_immature_jump_target(&header_target);
4586 expression_t *const step = statement->step;
4588 PUSH_CONTINUE(step ? NULL : header_target.block);
4590 /* Create the condition. */
4591 expression_t *const cond = statement->condition;
4592 if (cond && (is_constant_expression(cond) != EXPR_CLASS_CONSTANT || !fold_constant_to_bool(cond))) {
4593 jump_target body_target;
4594 init_jump_target(&body_target, NULL);
4595 create_condition_evaluation(cond, &body_target, &break_target);
4596 enter_jump_target(&body_target);
4599 /* Create the loop body. */
4600 statement_to_firm(statement->body);
4601 jump_to_target(&continue_target);
4603 /* Create the step code. */
4604 if (step && enter_jump_target(&continue_target)) {
4605 expression_to_firm(step);
4606 jump_to_target(&header_target);
4609 enter_jump_target(&header_target);
4610 enter_jump_target(&break_target);
4617 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4619 /* determine number of cases */
4621 for (case_label_statement_t *l = statement->first_case; l != NULL;
4624 if (l->expression == NULL)
4626 if (l->is_empty_range)
4631 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4633 for (case_label_statement_t *l = statement->first_case; l != NULL;
4635 if (l->expression == NULL) {
4636 l->pn = pn_Switch_default;
4639 if (l->is_empty_range)
4641 ir_tarval *min = l->first_case;
4642 ir_tarval *max = l->last_case;
4643 long pn = (long) i+1;
4644 ir_switch_table_set(res, i++, min, max, pn);
4650 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4652 dbg_info *dbgi = get_dbg_info(&statement->base.pos);
4653 ir_node *switch_node = NULL;
4655 if (currently_reachable()) {
4656 ir_node *expression = expression_to_firm(statement->expression);
4657 ir_switch_table *table = create_switch_table(statement);
4658 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4660 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4663 set_unreachable_now();
4666 ir_node *const old_switch = current_switch;
4667 const bool old_saw_default_label = saw_default_label;
4668 saw_default_label = false;
4669 current_switch = switch_node;
4671 statement_to_firm(statement->body);
4672 jump_to_target(&break_target);
4674 if (!saw_default_label && switch_node) {
4675 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4676 add_pred_to_jump_target(&break_target, proj);
4679 enter_jump_target(&break_target);
4681 assert(current_switch == switch_node);
4682 current_switch = old_switch;
4683 saw_default_label = old_saw_default_label;
4688 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4690 if (current_switch != NULL && !statement->is_empty_range) {
4691 jump_target case_target;
4692 init_jump_target(&case_target, NULL);
4694 /* Fallthrough from previous case */
4695 jump_to_target(&case_target);
4697 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
4698 add_pred_to_jump_target(&case_target, proj);
4699 if (statement->expression == NULL)
4700 saw_default_label = true;
4702 enter_jump_target(&case_target);
4705 return statement_to_firm(statement->statement);
4708 static ir_node *label_to_firm(const label_statement_t *statement)
4710 label_t *const label = statement->label;
4711 prepare_label_target(label);
4712 jump_to_target(&label->target);
4713 if (--label->n_users == 0) {
4714 enter_jump_target(&label->target);
4716 enter_immature_jump_target(&label->target);
4720 return statement_to_firm(statement->statement);
4723 static ir_node *goto_statement_to_firm(goto_statement_t *const stmt)
4725 label_t *const label = stmt->label;
4726 prepare_label_target(label);
4727 jump_to_target(&label->target);
4728 if (--label->n_users == 0)
4729 enter_jump_target(&label->target);
4730 set_unreachable_now();
4734 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
4736 if (currently_reachable()) {
4737 ir_node *const op = expression_to_firm(statement->expression);
4738 ARR_APP1(ir_node*, ijmp_ops, op);
4739 jump_to_target(&ijmp_target);
4740 set_unreachable_now();
4745 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
4747 bool needs_memory = statement->is_volatile;
4748 size_t n_clobbers = 0;
4749 asm_clobber_t *clobber = statement->clobbers;
4750 for ( ; clobber != NULL; clobber = clobber->next) {
4751 const char *clobber_str = clobber->clobber.begin;
4753 if (!be_is_valid_clobber(clobber_str)) {
4754 errorf(&statement->base.pos,
4755 "invalid clobber '%s' specified", clobber->clobber);
4759 if (streq(clobber_str, "memory")) {
4760 needs_memory = true;
4764 ident *id = new_id_from_str(clobber_str);
4765 obstack_ptr_grow(&asm_obst, id);
4768 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
4769 ident **clobbers = NULL;
4770 if (n_clobbers > 0) {
4771 clobbers = obstack_finish(&asm_obst);
4774 size_t n_inputs = 0;
4775 asm_argument_t *argument = statement->inputs;
4776 for ( ; argument != NULL; argument = argument->next)
4778 size_t n_outputs = 0;
4779 argument = statement->outputs;
4780 for ( ; argument != NULL; argument = argument->next)
4783 unsigned next_pos = 0;
4785 ir_node *ins[n_inputs + n_outputs + 1];
4788 ir_asm_constraint tmp_in_constraints[n_outputs];
4790 const expression_t *out_exprs[n_outputs];
4791 ir_node *out_addrs[n_outputs];
4792 size_t out_size = 0;
4794 argument = statement->outputs;
4795 for ( ; argument != NULL; argument = argument->next) {
4796 const char *constraints = argument->constraints.begin;
4797 asm_constraint_flags_t asm_flags
4798 = be_parse_asm_constraints(constraints);
4801 position_t const *const pos = &statement->base.pos;
4802 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4803 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
4805 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4806 errorf(pos, "some constraints in '%s' are invalid", constraints);
4809 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
4810 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
4815 unsigned pos = next_pos++;
4816 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4817 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4818 expression_t *expr = argument->expression;
4819 ir_node *addr = expression_to_addr(expr);
4820 /* in+output, construct an artifical same_as constraint on the
4822 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
4824 ir_node *value = get_value_from_lvalue(expr, addr);
4826 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
4828 ir_asm_constraint constraint;
4829 constraint.pos = pos;
4830 constraint.constraint = new_id_from_str(buf);
4831 constraint.mode = get_ir_mode_storage(expr->base.type);
4832 tmp_in_constraints[in_size] = constraint;
4833 ins[in_size] = value;
4838 out_exprs[out_size] = expr;
4839 out_addrs[out_size] = addr;
4841 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4842 /* pure memory ops need no input (but we have to make sure we
4843 * attach to the memory) */
4844 assert(! (asm_flags &
4845 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
4846 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
4847 needs_memory = true;
4849 /* we need to attach the address to the inputs */
4850 expression_t *expr = argument->expression;
4852 ir_asm_constraint constraint;
4853 constraint.pos = pos;
4854 constraint.constraint = new_id_from_str(constraints);
4855 constraint.mode = mode_M;
4856 tmp_in_constraints[in_size] = constraint;
4858 ins[in_size] = expression_to_addr(expr);
4862 errorf(&statement->base.pos,
4863 "only modifiers but no place set in constraints '%s'",
4868 ir_asm_constraint constraint;
4869 constraint.pos = pos;
4870 constraint.constraint = new_id_from_str(constraints);
4871 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
4873 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
4875 assert(obstack_object_size(&asm_obst)
4876 == out_size * sizeof(ir_asm_constraint));
4877 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
4880 obstack_grow(&asm_obst, tmp_in_constraints,
4881 in_size * sizeof(tmp_in_constraints[0]));
4882 /* find and count input and output arguments */
4883 argument = statement->inputs;
4884 for ( ; argument != NULL; argument = argument->next) {
4885 const char *constraints = argument->constraints.begin;
4886 asm_constraint_flags_t asm_flags
4887 = be_parse_asm_constraints(constraints);
4889 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4890 errorf(&statement->base.pos,
4891 "some constraints in '%s' are not supported", constraints);
4894 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4895 errorf(&statement->base.pos,
4896 "some constraints in '%s' are invalid", constraints);
4899 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
4900 errorf(&statement->base.pos,
4901 "write flag specified for input constraints '%s'",
4907 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4908 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4909 /* we can treat this as "normal" input */
4910 input = expression_to_firm(argument->expression);
4911 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4912 /* pure memory ops need no input (but we have to make sure we
4913 * attach to the memory) */
4914 assert(! (asm_flags &
4915 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
4916 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
4917 needs_memory = true;
4918 input = expression_to_addr(argument->expression);
4920 errorf(&statement->base.pos,
4921 "only modifiers but no place set in constraints '%s'",
4926 ir_asm_constraint constraint;
4927 constraint.pos = next_pos++;
4928 constraint.constraint = new_id_from_str(constraints);
4929 constraint.mode = get_irn_mode(input);
4931 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
4932 ins[in_size++] = input;
4935 ir_node *mem = needs_memory ? get_store() : new_NoMem();
4936 assert(obstack_object_size(&asm_obst)
4937 == in_size * sizeof(ir_asm_constraint));
4938 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
4940 /* create asm node */
4941 dbg_info *dbgi = get_dbg_info(&statement->base.pos);
4943 ident *asm_text = new_id_from_str(statement->asm_text.begin);
4945 ir_node *node = new_d_ASM(dbgi, mem, in_size, ins, input_constraints,
4946 out_size, output_constraints,
4947 n_clobbers, clobbers, asm_text);
4949 if (statement->is_volatile) {
4950 set_irn_pinned(node, op_pin_state_pinned);
4952 set_irn_pinned(node, op_pin_state_floats);
4955 /* create output projs & connect them */
4957 ir_node *projm = new_Proj(node, mode_M, out_size);
4962 for (i = 0; i < out_size; ++i) {
4963 const expression_t *out_expr = out_exprs[i];
4965 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
4966 ir_node *proj = new_Proj(node, mode, pn);
4967 ir_node *addr = out_addrs[i];
4969 set_value_for_expression_addr(out_expr, proj, addr);
4975 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
4977 statement_to_firm(statement->try_statement);
4978 position_t const *const pos = &statement->base.pos;
4979 warningf(WARN_OTHER, pos, "structured exception handling ignored");
4983 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
4985 errorf(&statement->base.pos, "__leave not supported yet");
4990 * Transform a statement.
4992 static ir_node *statement_to_firm(statement_t *const stmt)
4995 assert(!stmt->base.transformed);
4996 stmt->base.transformed = true;
4999 switch (stmt->kind) {
5000 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5001 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5002 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5003 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5004 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5005 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5006 case STATEMENT_EMPTY: return NULL; /* nothing */
5007 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5008 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5009 case STATEMENT_GOTO: return goto_statement_to_firm( &stmt->gotos);
5010 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5011 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5012 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5013 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5014 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5015 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5019 case STATEMENT_BREAK: tgt = &break_target; goto jump;
5020 case STATEMENT_CONTINUE: tgt = &continue_target; goto jump;
5022 jump_to_target(tgt);
5023 set_unreachable_now();
5027 case STATEMENT_ERROR: panic("error statement");
5029 panic("statement not implemented");
5032 static int count_local_variables(const entity_t *entity,
5033 const entity_t *const last)
5036 entity_t const *const end = last != NULL ? last->base.next : NULL;
5037 for (; entity != end; entity = entity->base.next) {
5038 if ((entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER) &&
5039 !var_needs_entity(&entity->variable))
5045 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5047 int *const count = env;
5049 switch (stmt->kind) {
5050 case STATEMENT_DECLARATION: {
5051 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5052 *count += count_local_variables(decl_stmt->declarations_begin,
5053 decl_stmt->declarations_end);
5058 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5067 * Return the number of local (alias free) variables used by a function.
5069 static int get_function_n_local_vars(entity_t *entity)
5071 const function_t *function = &entity->function;
5074 /* count parameters */
5075 count += count_local_variables(function->parameters.entities, NULL);
5077 /* count local variables declared in body */
5078 walk_statements(function->body, count_local_variables_in_stmt, &count);
5083 * Build Firm code for the parameters of a function.
5085 static void initialize_function_parameters(entity_t *entity)
5087 assert(entity->kind == ENTITY_FUNCTION);
5088 ir_graph *irg = current_ir_graph;
5089 ir_node *args = get_irg_args(irg);
5091 ir_type *function_irtype;
5093 if (entity->function.need_closure) {
5094 /* add an extra parameter for the static link */
5095 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5098 /* Matze: IMO this is wrong, nested functions should have an own
5099 * type and not rely on strange parameters... */
5100 function_irtype = create_method_type(&entity->declaration.type->function, true);
5102 function_irtype = get_ir_type(entity->declaration.type);
5107 entity_t *parameter = entity->function.parameters.entities;
5108 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5109 if (parameter->kind != ENTITY_PARAMETER)
5112 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5113 type_t *type = skip_typeref(parameter->declaration.type);
5115 dbg_info *const dbgi = get_dbg_info(¶meter->base.pos);
5116 ir_type *const param_irtype = get_method_param_type(function_irtype, n);
5117 if (var_needs_entity(¶meter->variable)) {
5118 ir_type *frame_type = get_irg_frame_type(irg);
5120 = new_d_parameter_entity(frame_type, n, param_irtype, dbgi);
5121 parameter->declaration.kind = DECLARATION_KIND_PARAMETER_ENTITY;
5122 parameter->variable.v.entity = param;
5126 ir_mode *param_mode = get_type_mode(param_irtype);
5128 ir_node *value = new_rd_Proj(dbgi, args, param_mode, pn);
5130 ir_mode *mode = get_ir_mode_storage(type);
5131 value = create_conv(NULL, value, mode);
5133 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5134 parameter->variable.v.value_number = next_value_number_function;
5135 set_irg_loc_description(current_ir_graph, next_value_number_function,
5137 ++next_value_number_function;
5139 set_value(parameter->variable.v.value_number, value);
5143 static void add_function_pointer(ir_type *segment, ir_entity *method,
5144 const char *unique_template)
5146 ir_type *method_type = get_entity_type(method);
5147 ir_type *ptr_type = new_type_pointer(method_type);
5149 /* these entities don't really have a name but firm only allows
5151 * Note that we mustn't give these entities a name since for example
5152 * Mach-O doesn't allow them. */
5153 ident *ide = id_unique(unique_template);
5154 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5155 ir_graph *irg = get_const_code_irg();
5156 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5159 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5160 set_entity_compiler_generated(ptr, 1);
5161 set_entity_visibility(ptr, ir_visibility_private);
5162 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5163 set_atomic_ent_value(ptr, val);
5167 * Create code for a function and all inner functions.
5169 * @param entity the function entity
5171 static void create_function(entity_t *entity)
5173 assert(entity->kind == ENTITY_FUNCTION);
5174 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5176 if (entity->function.body == NULL)
5179 inner_functions = NULL;
5180 current_trampolines = NULL;
5182 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5183 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5184 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5186 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5187 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5188 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5191 current_function_entity = entity;
5192 current_function_name = NULL;
5193 current_funcsig = NULL;
5196 assert(!ijmp_blocks);
5197 init_jump_target(&ijmp_target, NULL);
5198 ijmp_ops = NEW_ARR_F(ir_node*, 0);
5199 ijmp_blocks = NEW_ARR_F(ir_node*, 0);
5201 int n_local_vars = get_function_n_local_vars(entity);
5202 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5203 current_ir_graph = irg;
5205 ir_graph *old_current_function = current_function;
5206 current_function = irg;
5208 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5209 current_vararg_entity = NULL;
5211 set_irg_fp_model(irg, firm_fp_model);
5212 tarval_enable_fp_ops(1);
5213 set_irn_dbg_info(get_irg_start_block(irg),
5214 get_entity_dbg_info(function_entity));
5216 next_value_number_function = 0;
5217 initialize_function_parameters(entity);
5218 current_static_link = entity->function.static_link;
5220 statement_to_firm(entity->function.body);
5222 ir_node *end_block = get_irg_end_block(irg);
5224 /* do we have a return statement yet? */
5225 if (currently_reachable()) {
5226 type_t *type = skip_typeref(entity->declaration.type);
5227 assert(is_type_function(type));
5228 type_t *const return_type = skip_typeref(type->function.return_type);
5231 if (is_type_void(return_type)) {
5232 ret = new_Return(get_store(), 0, NULL);
5234 ir_mode *const mode = get_ir_mode_storage(return_type);
5237 /* ยง5.1.2.2.3 main implicitly returns 0 */
5238 if (is_main(entity)) {
5239 in[0] = new_Const(get_mode_null(mode));
5241 in[0] = new_Unknown(mode);
5243 ret = new_Return(get_store(), 1, in);
5245 add_immBlock_pred(end_block, ret);
5248 if (enter_jump_target(&ijmp_target)) {
5250 size_t const n = ARR_LEN(ijmp_ops);
5251 ir_node *const op = n == 1 ? ijmp_ops[0] : new_Phi(n, ijmp_ops, get_irn_mode(ijmp_ops[0]));
5252 ir_node *const ijmp = new_IJmp(op);
5253 for (size_t i = ARR_LEN(ijmp_blocks); i-- != 0;) {
5254 ir_node *const block = ijmp_blocks[i];
5255 add_immBlock_pred(block, ijmp);
5256 mature_immBlock(block);
5260 DEL_ARR_F(ijmp_ops);
5261 DEL_ARR_F(ijmp_blocks);
5265 irg_finalize_cons(irg);
5267 /* finalize the frame type */
5268 ir_type *frame_type = get_irg_frame_type(irg);
5269 int n = get_compound_n_members(frame_type);
5272 for (int i = 0; i < n; ++i) {
5273 ir_entity *member = get_compound_member(frame_type, i);
5274 ir_type *entity_type = get_entity_type(member);
5276 int align = get_type_alignment_bytes(entity_type);
5277 if (align > align_all)
5281 misalign = offset % align;
5283 offset += align - misalign;
5287 set_entity_offset(member, offset);
5288 offset += get_type_size_bytes(entity_type);
5290 set_type_size_bytes(frame_type, offset);
5291 set_type_alignment_bytes(frame_type, align_all);
5293 irg_verify(irg, VERIFY_ENFORCE_SSA);
5294 current_vararg_entity = old_current_vararg_entity;
5295 current_function = old_current_function;
5297 if (current_trampolines != NULL) {
5298 DEL_ARR_F(current_trampolines);
5299 current_trampolines = NULL;
5302 /* create inner functions if any */
5303 entity_t **inner = inner_functions;
5304 if (inner != NULL) {
5305 ir_type *rem_outer_frame = current_outer_frame;
5306 current_outer_frame = get_irg_frame_type(current_ir_graph);
5307 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5308 create_function(inner[i]);
5312 current_outer_frame = rem_outer_frame;
5316 static void scope_to_firm(scope_t *scope)
5318 /* first pass: create declarations */
5319 entity_t *entity = scope->entities;
5320 for ( ; entity != NULL; entity = entity->base.next) {
5321 if (entity->base.symbol == NULL)
5324 if (entity->kind == ENTITY_FUNCTION) {
5325 if (entity->function.btk != BUILTIN_NONE) {
5326 /* builtins have no representation */
5329 (void)get_function_entity(entity, NULL);
5330 } else if (entity->kind == ENTITY_VARIABLE) {
5331 create_global_variable(entity);
5332 } else if (entity->kind == ENTITY_NAMESPACE) {
5333 scope_to_firm(&entity->namespacee.members);
5337 /* second pass: create code/initializers */
5338 entity = scope->entities;
5339 for ( ; entity != NULL; entity = entity->base.next) {
5340 if (entity->base.symbol == NULL)
5343 if (entity->kind == ENTITY_FUNCTION) {
5344 if (entity->function.btk != BUILTIN_NONE) {
5345 /* builtins have no representation */
5348 create_function(entity);
5349 } else if (entity->kind == ENTITY_VARIABLE) {
5350 assert(entity->declaration.kind
5351 == DECLARATION_KIND_GLOBAL_VARIABLE);
5352 current_ir_graph = get_const_code_irg();
5353 create_variable_initializer(entity);
5358 void init_ast2firm(void)
5360 obstack_init(&asm_obst);
5361 init_atomic_modes();
5363 ir_set_debug_retrieve(dbg_retrieve);
5364 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5366 /* create idents for all known runtime functions */
5367 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5368 rts_idents[i] = new_id_from_str(rts_data[i].name);
5371 entitymap_init(&entitymap);
5374 static void init_ir_types(void)
5376 static int ir_types_initialized = 0;
5377 if (ir_types_initialized)
5379 ir_types_initialized = 1;
5381 ir_type_char = get_ir_type(type_char);
5383 be_params = be_get_backend_param();
5384 mode_float_arithmetic = be_params->mode_float_arithmetic;
5386 stack_param_align = be_params->stack_param_align;
5389 void exit_ast2firm(void)
5391 entitymap_destroy(&entitymap);
5392 obstack_free(&asm_obst, NULL);
5395 static void global_asm_to_firm(statement_t *s)
5397 for (; s != NULL; s = s->base.next) {
5398 assert(s->kind == STATEMENT_ASM);
5400 char const *const text = s->asms.asm_text.begin;
5401 size_t const size = s->asms.asm_text.size;
5402 ident *const id = new_id_from_chars(text, size);
5407 static const char *get_cwd(void)
5409 static char buf[1024];
5410 if (buf[0] == '\0') {
5411 return getcwd(buf, sizeof(buf));
5416 void translation_unit_to_firm(translation_unit_t *unit)
5418 if (c_mode & _CXX) {
5419 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5420 } else if (c_mode & _C99) {
5421 be_dwarf_set_source_language(DW_LANG_C99);
5422 } else if (c_mode & _C89) {
5423 be_dwarf_set_source_language(DW_LANG_C89);
5425 be_dwarf_set_source_language(DW_LANG_C);
5427 const char *cwd = get_cwd();
5429 be_dwarf_set_compilation_directory(cwd);
5432 /* initialize firm arithmetic */
5433 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5434 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5436 /* just to be sure */
5437 init_jump_target(&break_target, NULL);
5438 init_jump_target(&continue_target, NULL);
5439 current_switch = NULL;
5440 current_translation_unit = unit;
5444 scope_to_firm(&unit->scope);
5445 global_asm_to_firm(unit->global_asm);
5447 current_ir_graph = NULL;
5448 current_translation_unit = NULL;