2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include <libfirm/firm.h>
28 #include <libfirm/adt/obst.h>
29 #include <libfirm/be.h>
33 #include "adt/error.h"
34 #include "adt/array.h"
35 #include "adt/strutil.h"
43 #include "diagnostic.h"
44 #include "lang_features.h"
46 #include "type_hash.h"
51 #include "entitymap_t.h"
52 #include "driver/firm_opt.h"
54 typedef struct trampoline_region trampoline_region;
55 struct trampoline_region {
56 ir_entity *function; /**< The function that is called by this trampoline */
57 ir_entity *region; /**< created region for the trampoline */
60 fp_model_t firm_fp_model = fp_model_precise;
62 static const backend_params *be_params;
64 static ir_type *ir_type_char;
65 static ir_type *ir_type_const_char;
66 static ir_type *ir_type_wchar_t;
67 static ir_type *ir_type_void;
68 static ir_type *ir_type_int;
70 /* architecture specific floating point arithmetic mode (if any) */
71 static ir_mode *mode_float_arithmetic;
73 /* alignment of stack parameters */
74 static unsigned stack_param_align;
76 static int next_value_number_function;
77 static ir_node *continue_label;
78 static ir_node *break_label;
79 static ir_node *current_switch_cond;
80 static bool saw_default_label;
81 static label_t **all_labels;
82 static entity_t **inner_functions;
83 static ir_node *ijmp_list;
84 static bool constant_folding;
86 static const entity_t *current_function_entity;
87 static ir_node *current_function_name;
88 static ir_node *current_funcsig;
89 static switch_statement_t *current_switch;
90 static ir_graph *current_function;
91 static translation_unit_t *current_translation_unit;
92 static trampoline_region *current_trampolines;
93 static ir_type *current_outer_frame;
94 static ir_node *current_static_link;
95 static ir_entity *current_vararg_entity;
97 static entitymap_t entitymap;
99 static struct obstack asm_obst;
101 typedef enum declaration_kind_t {
102 DECLARATION_KIND_UNKNOWN,
103 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
104 DECLARATION_KIND_GLOBAL_VARIABLE,
105 DECLARATION_KIND_LOCAL_VARIABLE,
106 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
107 DECLARATION_KIND_PARAMETER,
108 DECLARATION_KIND_PARAMETER_ENTITY,
109 DECLARATION_KIND_FUNCTION,
110 DECLARATION_KIND_COMPOUND_MEMBER,
111 DECLARATION_KIND_INNER_FUNCTION
112 } declaration_kind_t;
114 static ir_mode *get_ir_mode_storage(type_t *type);
116 static ir_type *get_ir_type_incomplete(type_t *type);
118 static void enqueue_inner_function(entity_t *entity)
120 if (inner_functions == NULL)
121 inner_functions = NEW_ARR_F(entity_t *, 0);
122 ARR_APP1(entity_t*, inner_functions, entity);
125 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
127 const entity_t *entity = get_irg_loc_description(irg, pos);
129 if (entity != NULL) {
130 source_position_t const *const pos = &entity->base.source_position;
131 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
133 return new_r_Unknown(irg, mode);
136 static const char *dbg_retrieve(const dbg_info *dbg, unsigned *line)
138 const source_position_t *pos = (const source_position_t*) dbg;
143 return pos->input_name;
146 static dbg_info *get_dbg_info(const source_position_t *pos)
148 return (dbg_info*) pos;
151 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
152 const type_dbg_info *dbg)
155 print_to_buffer(buffer, buffer_size);
156 const type_t *type = (const type_t*) dbg;
158 finish_print_to_buffer();
161 static type_dbg_info *get_type_dbg_info_(const type_t *type)
163 return (type_dbg_info*) type;
166 /* is the current block a reachable one? */
167 static bool currently_reachable(void)
169 ir_node *const block = get_cur_block();
170 return block != NULL && !is_Bad(block);
173 static void set_unreachable_now(void)
178 static ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
180 static ir_mode *mode_int, *mode_uint;
182 static ir_node *_expression_to_firm(const expression_t *expression);
183 static ir_node *expression_to_firm(const expression_t *expression);
184 static void create_local_declaration(entity_t *entity);
186 static unsigned decide_modulo_shift(unsigned type_size)
188 if (architecture_modulo_shift == 0)
190 if (type_size < architecture_modulo_shift)
191 return architecture_modulo_shift;
195 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
197 unsigned flags = get_atomic_type_flags(kind);
198 unsigned size = get_atomic_type_size(kind);
199 if ( (flags & (ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_FLOAT))
200 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
203 unsigned bit_size = size * 8;
204 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
205 unsigned modulo_shift = 0;
206 ir_mode_arithmetic arithmetic;
208 if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
209 assert(! (flags & ATOMIC_TYPE_FLAG_FLOAT));
210 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U",
212 sort = irms_int_number;
213 arithmetic = irma_twos_complement;
214 modulo_shift = decide_modulo_shift(bit_size);
216 assert(flags & ATOMIC_TYPE_FLAG_FLOAT);
217 snprintf(name, sizeof(name), "F%u", bit_size);
218 sort = irms_float_number;
219 arithmetic = irma_ieee754;
221 return new_ir_mode(name, sort, bit_size, is_signed, arithmetic,
229 * Initialises the atomic modes depending on the machine size.
231 static void init_atomic_modes(void)
233 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
234 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
236 mode_int = atomic_modes[ATOMIC_TYPE_INT];
237 mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
239 /* there's no real void type in firm */
240 atomic_modes[ATOMIC_TYPE_VOID] = atomic_modes[ATOMIC_TYPE_CHAR];
243 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
245 assert(kind <= ATOMIC_TYPE_LAST);
246 return atomic_modes[kind];
249 static ir_node *get_vla_size(array_type_t *const type)
251 ir_node *size_node = type->size_node;
252 if (size_node == NULL) {
253 size_node = expression_to_firm(type->size_expression);
254 type->size_node = size_node;
260 * Return a node representing the size of a type.
262 static ir_node *get_type_size_node(type_t *type)
264 type = skip_typeref(type);
266 if (is_type_array(type) && type->array.is_vla) {
267 ir_node *size_node = get_vla_size(&type->array);
268 ir_node *elem_size = get_type_size_node(type->array.element_type);
269 ir_mode *mode = get_irn_mode(size_node);
270 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
274 ir_mode *mode = get_ir_mode_storage(type_size_t);
276 sym.type_p = get_ir_type(type);
277 return new_SymConst(mode, sym, symconst_type_size);
280 static unsigned count_parameters(const function_type_t *function_type)
284 function_parameter_t *parameter = function_type->parameters;
285 for ( ; parameter != NULL; parameter = parameter->next) {
293 * Creates a Firm type for an atomic type
295 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
297 ir_mode *mode = atomic_modes[akind];
298 type_dbg_info *dbgi = get_type_dbg_info_(type);
299 ir_type *irtype = new_d_type_primitive(mode, dbgi);
300 il_alignment_t alignment = get_atomic_type_alignment(akind);
302 set_type_alignment_bytes(irtype, alignment);
308 * Creates a Firm type for a complex type
310 static ir_type *create_complex_type(const atomic_type_t *type)
312 atomic_type_kind_t kind = type->akind;
313 ir_mode *mode = atomic_modes[kind];
314 ident *id = get_mode_ident(mode);
318 /* FIXME: finish the array */
323 * Creates a Firm type for an imaginary type
325 static ir_type *create_imaginary_type(const atomic_type_t *type)
327 return create_atomic_type(type->akind, (const type_t*)type);
331 * return type of a parameter (and take transparent union gnu extension into
334 static type_t *get_parameter_type(type_t *orig_type)
336 type_t *type = skip_typeref(orig_type);
337 if (is_type_union(type)
338 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
339 compound_t *compound = type->compound.compound;
340 type = compound->members.entities->declaration.type;
346 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
348 type_t *return_type = skip_typeref(function_type->return_type);
350 int n_parameters = count_parameters(function_type)
351 + (for_closure ? 1 : 0);
352 int n_results = return_type == type_void ? 0 : 1;
353 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
354 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
356 if (return_type != type_void) {
357 ir_type *restype = get_ir_type(return_type);
358 set_method_res_type(irtype, 0, restype);
361 function_parameter_t *parameter = function_type->parameters;
364 ir_type *p_irtype = get_ir_type(type_void_ptr);
365 set_method_param_type(irtype, n, p_irtype);
368 for ( ; parameter != NULL; parameter = parameter->next) {
369 type_t *type = get_parameter_type(parameter->type);
370 ir_type *p_irtype = get_ir_type(type);
371 set_method_param_type(irtype, n, p_irtype);
375 bool is_variadic = function_type->variadic;
378 set_method_variadicity(irtype, variadicity_variadic);
380 unsigned cc = get_method_calling_convention(irtype);
381 switch (function_type->calling_convention) {
382 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
385 set_method_calling_convention(irtype, SET_CDECL(cc));
392 /* only non-variadic function can use stdcall, else use cdecl */
393 set_method_calling_convention(irtype, SET_STDCALL(cc));
399 /* only non-variadic function can use fastcall, else use cdecl */
400 set_method_calling_convention(irtype, SET_FASTCALL(cc));
404 /* Hmm, leave default, not accepted by the parser yet. */
409 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
411 const decl_modifiers_t modifiers = function_type->modifiers;
412 if (modifiers & DM_CONST)
413 add_method_additional_properties(irtype, mtp_property_const);
414 if (modifiers & DM_PURE)
415 add_method_additional_properties(irtype, mtp_property_pure);
416 if (modifiers & DM_RETURNS_TWICE)
417 add_method_additional_properties(irtype, mtp_property_returns_twice);
418 if (modifiers & DM_NORETURN)
419 add_method_additional_properties(irtype, mtp_property_noreturn);
420 if (modifiers & DM_NOTHROW)
421 add_method_additional_properties(irtype, mtp_property_nothrow);
422 if (modifiers & DM_MALLOC)
423 add_method_additional_properties(irtype, mtp_property_malloc);
428 static ir_type *create_pointer_type(pointer_type_t *type)
430 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
431 type_t *points_to = type->points_to;
432 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
433 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
438 static ir_type *create_reference_type(reference_type_t *type)
440 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
441 type_t *refers_to = type->refers_to;
442 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
443 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
448 static ir_type *create_array_type(array_type_t *type)
450 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
451 type_t *element_type = type->element_type;
452 ir_type *ir_element_type = get_ir_type(element_type);
453 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
455 const int align = get_type_alignment_bytes(ir_element_type);
456 set_type_alignment_bytes(irtype, align);
458 if (type->size_constant) {
459 int n_elements = type->size;
461 set_array_bounds_int(irtype, 0, 0, n_elements);
463 size_t elemsize = get_type_size_bytes(ir_element_type);
464 if (elemsize % align > 0) {
465 elemsize += align - (elemsize % align);
467 set_type_size_bytes(irtype, n_elements * elemsize);
469 set_array_lower_bound_int(irtype, 0, 0);
471 set_type_state(irtype, layout_fixed);
477 * Return the signed integer type of size bits.
479 * @param size the size
481 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
485 static ir_mode *s_modes[64 + 1] = {NULL, };
489 if (size <= 0 || size > 64)
492 mode = s_modes[size];
496 snprintf(name, sizeof(name), "bf_I%u", size);
497 mode = new_ir_mode(name, irms_int_number, size, 1, irma_twos_complement,
498 size <= 32 ? 32 : size );
499 s_modes[size] = mode;
502 type_dbg_info *dbgi = get_type_dbg_info_(type);
503 res = new_d_type_primitive(mode, dbgi);
504 set_primitive_base_type(res, base_tp);
510 * Return the unsigned integer type of size bits.
512 * @param size the size
514 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
518 static ir_mode *u_modes[64 + 1] = {NULL, };
522 if (size <= 0 || size > 64)
525 mode = u_modes[size];
529 snprintf(name, sizeof(name), "bf_U%u", size);
530 mode = new_ir_mode(name, irms_int_number, size, 0, irma_twos_complement,
531 size <= 32 ? 32 : size );
532 u_modes[size] = mode;
535 type_dbg_info *dbgi = get_type_dbg_info_(type);
536 res = new_d_type_primitive(mode, dbgi);
537 set_primitive_base_type(res, base_tp);
542 static ir_type *create_bitfield_type(const entity_t *entity)
544 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
545 type_t *base = skip_typeref(entity->declaration.type);
546 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
547 ir_type *irbase = get_ir_type(base);
549 unsigned bit_size = entity->compound_member.bit_size;
551 assert(!is_type_float(base));
552 if (is_type_signed(base)) {
553 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
555 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
559 #define INVALID_TYPE ((ir_type_ptr)-1)
562 COMPOUND_IS_STRUCT = false,
563 COMPOUND_IS_UNION = true
567 * Construct firm type from ast struct type.
569 static ir_type *create_compound_type(compound_type_t *type,
570 bool incomplete, bool is_union)
572 compound_t *compound = type->compound;
574 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
575 return compound->irtype;
578 symbol_t *type_symbol = compound->base.symbol;
580 if (type_symbol != NULL) {
581 id = new_id_from_str(type_symbol->string);
584 id = id_unique("__anonymous_union.%u");
586 id = id_unique("__anonymous_struct.%u");
592 irtype = new_type_union(id);
594 irtype = new_type_struct(id);
597 compound->irtype_complete = false;
598 compound->irtype = irtype;
604 layout_union_type(type);
606 layout_struct_type(type);
609 compound->irtype_complete = true;
611 entity_t *entry = compound->members.entities;
612 for ( ; entry != NULL; entry = entry->base.next) {
613 if (entry->kind != ENTITY_COMPOUND_MEMBER)
616 symbol_t *symbol = entry->base.symbol;
617 type_t *entry_type = entry->declaration.type;
619 if (symbol == NULL) {
620 /* anonymous bitfield member, skip */
621 if (entry->compound_member.bitfield)
623 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
624 || entry_type->kind == TYPE_COMPOUND_UNION);
625 ident = id_unique("anon.%u");
627 ident = new_id_from_str(symbol->string);
630 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
632 ir_type *entry_irtype;
633 if (entry->compound_member.bitfield) {
634 entry_irtype = create_bitfield_type(entry);
636 entry_irtype = get_ir_type(entry_type);
638 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
640 set_entity_offset(entity, entry->compound_member.offset);
641 set_entity_offset_bits_remainder(entity,
642 entry->compound_member.bit_offset);
644 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
645 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
646 entry->compound_member.entity = entity;
649 set_type_alignment_bytes(irtype, compound->alignment);
650 set_type_size_bytes(irtype, compound->size);
651 set_type_state(irtype, layout_fixed);
656 static void determine_enum_values(enum_type_t *const type)
658 ir_mode *const mode = atomic_modes[type->base.akind];
659 ir_tarval *const one = get_mode_one(mode);
660 ir_tarval * tv_next = get_mode_null(mode);
662 bool constant_folding_old = constant_folding;
663 constant_folding = true;
665 enum_t *enume = type->enume;
666 entity_t *entry = enume->base.next;
667 for (; entry != NULL; entry = entry->base.next) {
668 if (entry->kind != ENTITY_ENUM_VALUE)
671 expression_t *const init = entry->enum_value.value;
673 ir_node *const cnst = expression_to_firm(init);
674 if (!is_Const(cnst)) {
675 panic("couldn't fold constant");
677 tv_next = get_Const_tarval(cnst);
679 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
680 entry->enum_value.tv = tv_next;
681 tv_next = tarval_add(tv_next, one);
684 constant_folding = constant_folding_old;
687 static ir_type *create_enum_type(enum_type_t *const type)
689 return create_atomic_type(type->base.akind, (const type_t*) type);
692 static ir_type *get_ir_type_incomplete(type_t *type)
694 assert(type != NULL);
695 type = skip_typeref(type);
697 if (type->base.firm_type != NULL) {
698 assert(type->base.firm_type != INVALID_TYPE);
699 return type->base.firm_type;
702 switch (type->kind) {
703 case TYPE_COMPOUND_STRUCT:
704 return create_compound_type(&type->compound, true, COMPOUND_IS_STRUCT);
705 case TYPE_COMPOUND_UNION:
706 return create_compound_type(&type->compound, true, COMPOUND_IS_UNION);
708 return get_ir_type(type);
712 ir_type *get_ir_type(type_t *type)
714 assert(type != NULL);
716 type = skip_typeref(type);
718 if (type->base.firm_type != NULL) {
719 assert(type->base.firm_type != INVALID_TYPE);
720 return type->base.firm_type;
723 ir_type *firm_type = NULL;
724 switch (type->kind) {
726 /* Happens while constant folding, when there was an error */
727 return create_atomic_type(ATOMIC_TYPE_VOID, NULL);
730 firm_type = create_atomic_type(type->atomic.akind, type);
733 firm_type = create_complex_type(&type->atomic);
736 firm_type = create_imaginary_type(&type->atomic);
739 firm_type = create_method_type(&type->function, false);
742 firm_type = create_pointer_type(&type->pointer);
745 firm_type = create_reference_type(&type->reference);
748 firm_type = create_array_type(&type->array);
750 case TYPE_COMPOUND_STRUCT:
751 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_STRUCT);
753 case TYPE_COMPOUND_UNION:
754 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_UNION);
757 firm_type = create_enum_type(&type->enumt);
764 if (firm_type == NULL)
765 panic("unknown type found");
767 type->base.firm_type = firm_type;
771 static ir_mode *get_ir_mode_storage(type_t *type)
773 ir_type *irtype = get_ir_type(type);
775 /* firm doesn't report a mode for arrays somehow... */
776 if (is_Array_type(irtype)) {
780 ir_mode *mode = get_type_mode(irtype);
781 assert(mode != NULL);
786 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
787 * int that it returns bigger modes for floating point on some platforms
788 * (x87 internally does arithemtic with 80bits)
790 static ir_mode *get_ir_mode_arithmetic(type_t *type)
792 ir_mode *mode = get_ir_mode_storage(type);
793 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
794 return mode_float_arithmetic;
800 /** Names of the runtime functions. */
801 static const struct {
802 int id; /**< the rts id */
803 int n_res; /**< number of return values */
804 const char *name; /**< the name of the rts function */
805 int n_params; /**< number of parameters */
806 unsigned flags; /**< language flags */
808 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
809 { rts_abort, 0, "abort", 0, _C89 },
810 { rts_alloca, 1, "alloca", 1, _ALL },
811 { rts_abs, 1, "abs", 1, _C89 },
812 { rts_labs, 1, "labs", 1, _C89 },
813 { rts_llabs, 1, "llabs", 1, _C99 },
814 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
816 { rts_fabs, 1, "fabs", 1, _C89 },
817 { rts_sqrt, 1, "sqrt", 1, _C89 },
818 { rts_cbrt, 1, "cbrt", 1, _C99 },
819 { rts_exp, 1, "exp", 1, _C89 },
820 { rts_exp2, 1, "exp2", 1, _C89 },
821 { rts_exp10, 1, "exp10", 1, _GNUC },
822 { rts_log, 1, "log", 1, _C89 },
823 { rts_log2, 1, "log2", 1, _C89 },
824 { rts_log10, 1, "log10", 1, _C89 },
825 { rts_pow, 1, "pow", 2, _C89 },
826 { rts_sin, 1, "sin", 1, _C89 },
827 { rts_cos, 1, "cos", 1, _C89 },
828 { rts_tan, 1, "tan", 1, _C89 },
829 { rts_asin, 1, "asin", 1, _C89 },
830 { rts_acos, 1, "acos", 1, _C89 },
831 { rts_atan, 1, "atan", 1, _C89 },
832 { rts_sinh, 1, "sinh", 1, _C89 },
833 { rts_cosh, 1, "cosh", 1, _C89 },
834 { rts_tanh, 1, "tanh", 1, _C89 },
836 { rts_fabsf, 1, "fabsf", 1, _C99 },
837 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
838 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
839 { rts_expf, 1, "expf", 1, _C99 },
840 { rts_exp2f, 1, "exp2f", 1, _C99 },
841 { rts_exp10f, 1, "exp10f", 1, _GNUC },
842 { rts_logf, 1, "logf", 1, _C99 },
843 { rts_log2f, 1, "log2f", 1, _C99 },
844 { rts_log10f, 1, "log10f", 1, _C99 },
845 { rts_powf, 1, "powf", 2, _C99 },
846 { rts_sinf, 1, "sinf", 1, _C99 },
847 { rts_cosf, 1, "cosf", 1, _C99 },
848 { rts_tanf, 1, "tanf", 1, _C99 },
849 { rts_asinf, 1, "asinf", 1, _C99 },
850 { rts_acosf, 1, "acosf", 1, _C99 },
851 { rts_atanf, 1, "atanf", 1, _C99 },
852 { rts_sinhf, 1, "sinhf", 1, _C99 },
853 { rts_coshf, 1, "coshf", 1, _C99 },
854 { rts_tanhf, 1, "tanhf", 1, _C99 },
856 { rts_fabsl, 1, "fabsl", 1, _C99 },
857 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
858 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
859 { rts_expl, 1, "expl", 1, _C99 },
860 { rts_exp2l, 1, "exp2l", 1, _C99 },
861 { rts_exp10l, 1, "exp10l", 1, _GNUC },
862 { rts_logl, 1, "logl", 1, _C99 },
863 { rts_log2l, 1, "log2l", 1, _C99 },
864 { rts_log10l, 1, "log10l", 1, _C99 },
865 { rts_powl, 1, "powl", 2, _C99 },
866 { rts_sinl, 1, "sinl", 1, _C99 },
867 { rts_cosl, 1, "cosl", 1, _C99 },
868 { rts_tanl, 1, "tanl", 1, _C99 },
869 { rts_asinl, 1, "asinl", 1, _C99 },
870 { rts_acosl, 1, "acosl", 1, _C99 },
871 { rts_atanl, 1, "atanl", 1, _C99 },
872 { rts_sinhl, 1, "sinhl", 1, _C99 },
873 { rts_coshl, 1, "coshl", 1, _C99 },
874 { rts_tanhl, 1, "tanhl", 1, _C99 },
876 { rts_strcmp, 1, "strcmp", 2, _C89 },
877 { rts_strncmp, 1, "strncmp", 3, _C89 },
878 { rts_strcpy, 1, "strcpy", 2, _C89 },
879 { rts_strlen, 1, "strlen", 1, _C89 },
880 { rts_memcpy, 1, "memcpy", 3, _C89 },
881 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
882 { rts_memmove, 1, "memmove", 3, _C89 },
883 { rts_memset, 1, "memset", 3, _C89 },
884 { rts_memcmp, 1, "memcmp", 3, _C89 },
887 static ident *rts_idents[lengthof(rts_data)];
889 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
891 void set_create_ld_ident(ident *(*func)(entity_t*))
893 create_ld_ident = func;
897 * Handle GNU attributes for entities
899 * @param ent the entity
900 * @param decl the routine declaration
902 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
904 assert(is_declaration(entity));
905 decl_modifiers_t modifiers = entity->declaration.modifiers;
907 if (is_method_entity(irentity)) {
908 if (modifiers & DM_PURE) {
909 set_entity_additional_properties(irentity, mtp_property_pure);
911 if (modifiers & DM_CONST) {
912 add_entity_additional_properties(irentity, mtp_property_const);
915 if (modifiers & DM_USED) {
916 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
918 if (modifiers & DM_WEAK) {
919 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
923 static bool is_main(entity_t *entity)
925 static symbol_t *sym_main = NULL;
926 if (sym_main == NULL) {
927 sym_main = symbol_table_insert("main");
930 if (entity->base.symbol != sym_main)
932 /* must be in outermost scope */
933 if (entity->base.parent_scope != ¤t_translation_unit->scope)
940 * Creates an entity representing a function.
942 * @param entity the function declaration/definition
943 * @param owner_type the owner type of this function, NULL
944 * for global functions
946 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
948 assert(entity->kind == ENTITY_FUNCTION);
949 if (entity->function.irentity != NULL)
950 return entity->function.irentity;
952 switch (entity->function.btk) {
955 case BUILTIN_LIBC_CHECK:
961 if (is_main(entity)) {
962 /* force main to C linkage */
963 type_t *type = entity->declaration.type;
964 assert(is_type_function(type));
965 if (type->function.linkage != LINKAGE_C) {
966 type_t *new_type = duplicate_type(type);
967 new_type->function.linkage = LINKAGE_C;
968 type = identify_new_type(new_type);
969 entity->declaration.type = type;
973 symbol_t *symbol = entity->base.symbol;
974 ident *id = new_id_from_str(symbol->string);
976 /* already an entity defined? */
977 ir_entity *irentity = entitymap_get(&entitymap, symbol);
978 bool const has_body = entity->function.statement != NULL;
979 if (irentity != NULL) {
980 if (get_entity_visibility(irentity) == ir_visibility_external
982 set_entity_visibility(irentity, ir_visibility_default);
987 ir_type *ir_type_method;
988 if (entity->function.need_closure)
989 ir_type_method = create_method_type(&entity->declaration.type->function, true);
991 ir_type_method = get_ir_type(entity->declaration.type);
993 bool nested_function = false;
994 if (owner_type == NULL)
995 owner_type = get_glob_type();
997 nested_function = true;
999 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
1000 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
1003 if (nested_function)
1004 ld_id = id_unique("inner.%u");
1006 ld_id = create_ld_ident(entity);
1007 set_entity_ld_ident(irentity, ld_id);
1009 handle_decl_modifiers(irentity, entity);
1011 if (! nested_function) {
1012 /* static inline => local
1013 * extern inline => local
1014 * inline without definition => local
1015 * inline with definition => external_visible */
1016 storage_class_tag_t const storage_class
1017 = (storage_class_tag_t) entity->declaration.storage_class;
1018 bool const is_inline = entity->function.is_inline;
1020 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
1021 set_entity_visibility(irentity, ir_visibility_default);
1022 } else if (storage_class == STORAGE_CLASS_STATIC ||
1023 (is_inline && has_body)) {
1024 set_entity_visibility(irentity, ir_visibility_local);
1025 } else if (has_body) {
1026 set_entity_visibility(irentity, ir_visibility_default);
1028 set_entity_visibility(irentity, ir_visibility_external);
1031 /* nested functions are always local */
1032 set_entity_visibility(irentity, ir_visibility_local);
1035 /* We should check for file scope here, but as long as we compile C only
1036 this is not needed. */
1037 if (!freestanding && !has_body) {
1038 /* check for a known runtime function */
1039 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1040 if (id != rts_idents[i])
1043 function_type_t *function_type
1044 = &entity->declaration.type->function;
1045 /* rts_entities code can't handle a "wrong" number of parameters */
1046 if (function_type->unspecified_parameters)
1049 /* check number of parameters */
1050 int n_params = count_parameters(function_type);
1051 if (n_params != rts_data[i].n_params)
1054 type_t *return_type = skip_typeref(function_type->return_type);
1055 int n_res = return_type != type_void ? 1 : 0;
1056 if (n_res != rts_data[i].n_res)
1059 /* ignore those rts functions not necessary needed for current mode */
1060 if ((c_mode & rts_data[i].flags) == 0)
1062 assert(rts_entities[rts_data[i].id] == NULL);
1063 rts_entities[rts_data[i].id] = irentity;
1067 entitymap_insert(&entitymap, symbol, irentity);
1070 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1071 entity->function.irentity = irentity;
1077 * Creates a SymConst for a given entity.
1079 * @param dbgi debug info
1080 * @param entity the entity
1082 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1084 assert(entity != NULL);
1085 union symconst_symbol sym;
1086 sym.entity_p = entity;
1087 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1090 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1092 ir_mode *value_mode = get_irn_mode(value);
1094 if (value_mode == dest_mode)
1097 if (dest_mode == mode_b) {
1098 ir_node *zero = new_Const(get_mode_null(value_mode));
1099 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_less_greater);
1103 return new_d_Conv(dbgi, value, dest_mode);
1106 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1108 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1112 * Creates a SymConst node representing a wide string literal.
1114 * @param literal the wide string literal
1116 static ir_node *wide_string_literal_to_firm(
1117 const string_literal_expression_t *literal)
1119 ir_type *const global_type = get_glob_type();
1120 ir_type *const elem_type = ir_type_wchar_t;
1121 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1122 ir_type *const type = new_type_array(1, elem_type);
1124 ident *const id = id_unique("str.%u");
1125 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1126 set_entity_ld_ident(entity, id);
1127 set_entity_visibility(entity, ir_visibility_private);
1128 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1130 ir_mode *const mode = get_type_mode(elem_type);
1131 const size_t slen = wstrlen(&literal->value);
1133 set_array_lower_bound_int(type, 0, 0);
1134 set_array_upper_bound_int(type, 0, slen);
1135 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1136 set_type_state(type, layout_fixed);
1138 ir_initializer_t *initializer = create_initializer_compound(slen);
1139 const char *p = literal->value.begin;
1140 for (size_t i = 0; i < slen; ++i) {
1141 assert(p < literal->value.begin + literal->value.size);
1142 utf32 v = read_utf8_char(&p);
1143 ir_tarval *tv = new_tarval_from_long(v, mode);
1144 ir_initializer_t *val = create_initializer_tarval(tv);
1145 set_initializer_compound_value(initializer, i, val);
1147 set_entity_initializer(entity, initializer);
1149 return create_symconst(dbgi, entity);
1153 * Creates a SymConst node representing a string constant.
1155 * @param src_pos the source position of the string constant
1156 * @param id_prefix a prefix for the name of the generated string constant
1157 * @param value the value of the string constant
1159 static ir_node *string_to_firm(const source_position_t *const src_pos,
1160 const char *const id_prefix,
1161 const string_t *const value)
1163 ir_type *const global_type = get_glob_type();
1164 dbg_info *const dbgi = get_dbg_info(src_pos);
1165 ir_type *const type = new_type_array(1, ir_type_const_char);
1167 ident *const id = id_unique(id_prefix);
1168 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1169 set_entity_ld_ident(entity, id);
1170 set_entity_visibility(entity, ir_visibility_private);
1171 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1173 ir_type *const elem_type = ir_type_const_char;
1174 ir_mode *const mode = get_type_mode(elem_type);
1176 const char* const string = value->begin;
1177 const size_t slen = value->size;
1179 set_array_lower_bound_int(type, 0, 0);
1180 set_array_upper_bound_int(type, 0, slen);
1181 set_type_size_bytes(type, slen);
1182 set_type_state(type, layout_fixed);
1184 ir_initializer_t *initializer = create_initializer_compound(slen);
1185 for (size_t i = 0; i < slen; ++i) {
1186 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1187 ir_initializer_t *val = create_initializer_tarval(tv);
1188 set_initializer_compound_value(initializer, i, val);
1190 set_entity_initializer(entity, initializer);
1192 return create_symconst(dbgi, entity);
1195 static bool try_create_integer(literal_expression_t *literal,
1196 type_t *type, unsigned char base)
1198 const char *string = literal->value.begin;
1199 size_t size = literal->value.size;
1201 assert(type->kind == TYPE_ATOMIC);
1202 atomic_type_kind_t akind = type->atomic.akind;
1204 ir_mode *mode = atomic_modes[akind];
1205 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1206 if (tv == tarval_bad)
1209 literal->base.type = type;
1210 literal->target_value = tv;
1214 static void create_integer_tarval(literal_expression_t *literal)
1218 const string_t *suffix = &literal->suffix;
1220 if (suffix->size > 0) {
1221 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1222 if (*c == 'u' || *c == 'U') { ++us; }
1223 if (*c == 'l' || *c == 'L') { ++ls; }
1228 switch (literal->base.kind) {
1229 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1230 case EXPR_LITERAL_INTEGER: base = 10; break;
1231 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1232 default: panic("invalid literal kind");
1235 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1237 /* now try if the constant is small enough for some types */
1238 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1240 if (us == 0 && try_create_integer(literal, type_int, base))
1242 if ((us == 1 || base != 10)
1243 && try_create_integer(literal, type_unsigned_int, base))
1247 if (us == 0 && try_create_integer(literal, type_long, base))
1249 if ((us == 1 || base != 10)
1250 && try_create_integer(literal, type_unsigned_long, base))
1253 /* last try? then we should not report tarval_bad */
1254 if (us != 1 && base == 10)
1255 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1256 if (us == 0 && try_create_integer(literal, type_long_long, base))
1260 assert(us == 1 || base != 10);
1261 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1262 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1264 panic("internal error when parsing number literal");
1267 tarval_set_integer_overflow_mode(old_mode);
1270 void determine_literal_type(literal_expression_t *literal)
1272 switch (literal->base.kind) {
1273 case EXPR_LITERAL_INTEGER:
1274 case EXPR_LITERAL_INTEGER_OCTAL:
1275 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1276 create_integer_tarval(literal);
1284 * Creates a Const node representing a constant.
1286 static ir_node *literal_to_firm(const literal_expression_t *literal)
1288 type_t *type = skip_typeref(literal->base.type);
1289 ir_mode *mode = get_ir_mode_storage(type);
1290 const char *string = literal->value.begin;
1291 size_t size = literal->value.size;
1294 switch (literal->base.kind) {
1295 case EXPR_LITERAL_WIDE_CHARACTER: {
1296 utf32 v = read_utf8_char(&string);
1298 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1300 tv = new_tarval_from_str(buf, len, mode);
1303 case EXPR_LITERAL_CHARACTER: {
1306 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1307 if (size == 1 && char_is_signed) {
1308 v = (signed char)string[0];
1311 for (size_t i = 0; i < size; ++i) {
1312 v = (v << 8) | ((unsigned char)string[i]);
1316 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1318 tv = new_tarval_from_str(buf, len, mode);
1321 case EXPR_LITERAL_INTEGER:
1322 case EXPR_LITERAL_INTEGER_OCTAL:
1323 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1324 assert(literal->target_value != NULL);
1325 tv = literal->target_value;
1327 case EXPR_LITERAL_FLOATINGPOINT:
1328 tv = new_tarval_from_str(string, size, mode);
1330 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1331 char buffer[size + 2];
1332 memcpy(buffer, "0x", 2);
1333 memcpy(buffer+2, string, size);
1334 tv = new_tarval_from_str(buffer, size+2, mode);
1337 case EXPR_LITERAL_BOOLEAN:
1338 if (string[0] == 't') {
1339 tv = get_mode_one(mode);
1341 assert(string[0] == 'f');
1342 tv = get_mode_null(mode);
1345 case EXPR_LITERAL_MS_NOOP:
1346 tv = get_mode_null(mode);
1351 panic("Invalid literal kind found");
1354 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1355 ir_node *res = new_d_Const(dbgi, tv);
1356 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1357 return create_conv(dbgi, res, mode_arith);
1361 * Allocate an area of size bytes aligned at alignment
1364 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1366 static unsigned area_cnt = 0;
1369 ir_type *tp = new_type_array(1, ir_type_char);
1370 set_array_bounds_int(tp, 0, 0, size);
1371 set_type_alignment_bytes(tp, alignment);
1373 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1374 ident *name = new_id_from_str(buf);
1375 ir_entity *area = new_entity(frame_type, name, tp);
1377 /* mark this entity as compiler generated */
1378 set_entity_compiler_generated(area, 1);
1383 * Return a node representing a trampoline region
1384 * for a given function entity.
1386 * @param dbgi debug info
1387 * @param entity the function entity
1389 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1391 ir_entity *region = NULL;
1394 if (current_trampolines != NULL) {
1395 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1396 if (current_trampolines[i].function == entity) {
1397 region = current_trampolines[i].region;
1402 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1404 ir_graph *irg = current_ir_graph;
1405 if (region == NULL) {
1406 /* create a new region */
1407 ir_type *frame_tp = get_irg_frame_type(irg);
1408 trampoline_region reg;
1409 reg.function = entity;
1411 reg.region = alloc_trampoline(frame_tp,
1412 be_params->trampoline_size,
1413 be_params->trampoline_align);
1414 ARR_APP1(trampoline_region, current_trampolines, reg);
1415 region = reg.region;
1417 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1422 * Creates a trampoline for a function represented by an entity.
1424 * @param dbgi debug info
1425 * @param mode the (reference) mode for the function address
1426 * @param entity the function entity
1428 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1431 assert(entity != NULL);
1433 in[0] = get_trampoline_region(dbgi, entity);
1434 in[1] = create_symconst(dbgi, entity);
1435 in[2] = get_irg_frame(current_ir_graph);
1437 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1438 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1439 return new_Proj(irn, mode, pn_Builtin_1_result);
1443 * Dereference an address.
1445 * @param dbgi debug info
1446 * @param type the type of the dereferenced result (the points_to type)
1447 * @param addr the address to dereference
1449 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1450 ir_node *const addr)
1452 ir_type *irtype = get_ir_type(type);
1453 if (is_compound_type(irtype)
1454 || is_Method_type(irtype)
1455 || is_Array_type(irtype)) {
1459 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1460 ? cons_volatile : cons_none;
1461 ir_mode *const mode = get_type_mode(irtype);
1462 ir_node *const memory = get_store();
1463 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1464 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1465 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1467 set_store(load_mem);
1469 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(type);
1470 return create_conv(dbgi, load_res, mode_arithmetic);
1474 * Creates a strict Conv (to the node's mode) if necessary.
1476 * @param dbgi debug info
1477 * @param node the node to strict conv
1479 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1481 ir_mode *mode = get_irn_mode(node);
1483 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1485 if (!mode_is_float(mode))
1488 /* check if there is already a Conv */
1489 if (is_Conv(node)) {
1490 /* convert it into a strict Conv */
1491 set_Conv_strict(node, 1);
1495 /* otherwise create a new one */
1496 return new_d_strictConv(dbgi, node, mode);
1500 * Returns the correct base address depending on whether it is a parameter or a
1501 * normal local variable.
1503 static ir_node *get_local_frame(ir_entity *const ent)
1505 ir_graph *const irg = current_ir_graph;
1506 const ir_type *const owner = get_entity_owner(ent);
1507 if (owner == current_outer_frame) {
1508 assert(current_static_link != NULL);
1509 return current_static_link;
1511 return get_irg_frame(irg);
1516 * Keep all memory edges of the given block.
1518 static void keep_all_memory(ir_node *block)
1520 ir_node *old = get_cur_block();
1522 set_cur_block(block);
1523 keep_alive(get_store());
1524 /* TODO: keep all memory edges from restricted pointers */
1528 static ir_node *reference_expression_enum_value_to_firm(
1529 const reference_expression_t *ref)
1531 entity_t *entity = ref->entity;
1532 if (entity->enum_value.tv == NULL) {
1533 type_t *type = skip_typeref(entity->enum_value.enum_type);
1534 assert(type->kind == TYPE_ENUM);
1535 determine_enum_values(&type->enumt);
1538 return new_Const(entity->enum_value.tv);
1541 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1543 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1544 entity_t *entity = ref->entity;
1545 assert(is_declaration(entity));
1546 type_t *type = skip_typeref(entity->declaration.type);
1548 /* make sure the type is constructed */
1549 (void) get_ir_type(type);
1551 if (entity->kind == ENTITY_FUNCTION
1552 && entity->function.btk != BUILTIN_NONE) {
1553 ir_entity *irentity = get_function_entity(entity, NULL);
1554 /* for gcc compatibility we have to produce (dummy) addresses for some
1555 * builtins which don't have entities */
1556 if (irentity == NULL) {
1557 source_position_t const *const pos = &ref->base.source_position;
1558 symbol_t const *const sym = ref->entity->base.symbol;
1559 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1561 /* simply create a NULL pointer */
1562 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1563 ir_node *res = new_Const(get_mode_null(mode));
1569 switch ((declaration_kind_t) entity->declaration.kind) {
1570 case DECLARATION_KIND_UNKNOWN:
1573 case DECLARATION_KIND_LOCAL_VARIABLE: {
1574 ir_mode *const mode = get_ir_mode_storage(type);
1575 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1576 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1578 case DECLARATION_KIND_PARAMETER: {
1579 ir_mode *const mode = get_ir_mode_storage(type);
1580 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1581 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1583 case DECLARATION_KIND_FUNCTION: {
1584 return create_symconst(dbgi, entity->function.irentity);
1586 case DECLARATION_KIND_INNER_FUNCTION: {
1587 ir_mode *const mode = get_ir_mode_storage(type);
1588 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1589 /* inner function not using the closure */
1590 return create_symconst(dbgi, entity->function.irentity);
1592 /* need trampoline here */
1593 return create_trampoline(dbgi, mode, entity->function.irentity);
1596 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1597 const variable_t *variable = &entity->variable;
1598 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1599 return deref_address(dbgi, variable->base.type, addr);
1602 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1603 ir_entity *irentity = entity->variable.v.entity;
1604 ir_node *frame = get_local_frame(irentity);
1605 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1606 return deref_address(dbgi, entity->declaration.type, sel);
1608 case DECLARATION_KIND_PARAMETER_ENTITY: {
1609 ir_entity *irentity = entity->parameter.v.entity;
1610 ir_node *frame = get_local_frame(irentity);
1611 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1612 return deref_address(dbgi, entity->declaration.type, sel);
1615 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1616 return entity->variable.v.vla_base;
1618 case DECLARATION_KIND_COMPOUND_MEMBER:
1619 panic("not implemented reference type");
1622 panic("reference to declaration with unknown type found");
1625 static ir_node *reference_addr(const reference_expression_t *ref)
1627 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1628 entity_t *entity = ref->entity;
1629 assert(is_declaration(entity));
1631 switch((declaration_kind_t) entity->declaration.kind) {
1632 case DECLARATION_KIND_UNKNOWN:
1634 case DECLARATION_KIND_PARAMETER:
1635 case DECLARATION_KIND_LOCAL_VARIABLE:
1636 /* you can store to a local variable (so we don't panic but return NULL
1637 * as an indicator for no real address) */
1639 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1640 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1643 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1644 ir_entity *irentity = entity->variable.v.entity;
1645 ir_node *frame = get_local_frame(irentity);
1646 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1650 case DECLARATION_KIND_PARAMETER_ENTITY: {
1651 ir_entity *irentity = entity->parameter.v.entity;
1652 ir_node *frame = get_local_frame(irentity);
1653 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1658 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1659 return entity->variable.v.vla_base;
1661 case DECLARATION_KIND_FUNCTION: {
1662 return create_symconst(dbgi, entity->function.irentity);
1665 case DECLARATION_KIND_INNER_FUNCTION: {
1666 type_t *const type = skip_typeref(entity->declaration.type);
1667 ir_mode *const mode = get_ir_mode_storage(type);
1668 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1669 /* inner function not using the closure */
1670 return create_symconst(dbgi, entity->function.irentity);
1672 /* need trampoline here */
1673 return create_trampoline(dbgi, mode, entity->function.irentity);
1677 case DECLARATION_KIND_COMPOUND_MEMBER:
1678 panic("not implemented reference type");
1681 panic("reference to declaration with unknown type found");
1685 * Transform calls to builtin functions.
1687 static ir_node *process_builtin_call(const call_expression_t *call)
1689 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1691 assert(call->function->kind == EXPR_REFERENCE);
1692 reference_expression_t *builtin = &call->function->reference;
1694 type_t *expr_type = skip_typeref(builtin->base.type);
1695 assert(is_type_pointer(expr_type));
1697 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1699 switch (builtin->entity->function.btk) {
1702 case BUILTIN_ALLOCA: {
1703 expression_t *argument = call->arguments->expression;
1704 ir_node *size = expression_to_firm(argument);
1706 ir_node *store = get_store();
1707 ir_node *alloca = new_d_Alloc(dbgi, store, size, firm_unknown_type,
1709 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1711 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1716 type_t *type = function_type->function.return_type;
1717 ir_mode *mode = get_ir_mode_arithmetic(type);
1718 ir_tarval *tv = get_mode_infinite(mode);
1719 ir_node *res = new_d_Const(dbgi, tv);
1723 /* Ignore string for now... */
1724 assert(is_type_function(function_type));
1725 type_t *type = function_type->function.return_type;
1726 ir_mode *mode = get_ir_mode_arithmetic(type);
1727 ir_tarval *tv = get_mode_NAN(mode);
1728 ir_node *res = new_d_Const(dbgi, tv);
1731 case BUILTIN_EXPECT: {
1732 expression_t *argument = call->arguments->expression;
1733 return _expression_to_firm(argument);
1735 case BUILTIN_VA_END:
1736 /* evaluate the argument of va_end for its side effects */
1737 _expression_to_firm(call->arguments->expression);
1739 case BUILTIN_OBJECT_SIZE: {
1740 /* determine value of "type" */
1741 expression_t *type_expression = call->arguments->next->expression;
1742 long type_val = fold_constant_to_int(type_expression);
1743 type_t *type = function_type->function.return_type;
1744 ir_mode *mode = get_ir_mode_arithmetic(type);
1745 /* just produce a "I don't know" result */
1746 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1747 get_mode_minus_one(mode);
1749 return new_d_Const(dbgi, result);
1751 case BUILTIN_ROTL: {
1752 ir_node *val = expression_to_firm(call->arguments->expression);
1753 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1754 ir_mode *mode = get_irn_mode(val);
1755 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1757 case BUILTIN_ROTR: {
1758 ir_node *val = expression_to_firm(call->arguments->expression);
1759 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1760 ir_mode *mode = get_irn_mode(val);
1761 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1762 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1763 return new_d_Rotl(dbgi, val, sub, mode);
1768 case BUILTIN_LIBC_CHECK:
1769 panic("builtin did not produce an entity");
1771 panic("invalid builtin found");
1775 * Transform a call expression.
1776 * Handles some special cases, like alloca() calls, which must be resolved
1777 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1778 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1781 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1783 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1784 assert(currently_reachable());
1786 expression_t *function = call->function;
1787 ir_node *callee = NULL;
1788 bool firm_builtin = false;
1789 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1790 if (function->kind == EXPR_REFERENCE) {
1791 const reference_expression_t *ref = &function->reference;
1792 entity_t *entity = ref->entity;
1794 if (entity->kind == ENTITY_FUNCTION) {
1795 builtin_kind_t builtin = entity->function.btk;
1796 if (builtin == BUILTIN_FIRM) {
1797 firm_builtin = true;
1798 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1799 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1800 && builtin != BUILTIN_LIBC_CHECK) {
1801 return process_builtin_call(call);
1806 callee = expression_to_firm(function);
1808 type_t *type = skip_typeref(function->base.type);
1809 assert(is_type_pointer(type));
1810 pointer_type_t *pointer_type = &type->pointer;
1811 type_t *points_to = skip_typeref(pointer_type->points_to);
1812 assert(is_type_function(points_to));
1813 function_type_t *function_type = &points_to->function;
1815 int n_parameters = 0;
1816 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1817 ir_type *new_method_type = NULL;
1818 if (function_type->variadic || function_type->unspecified_parameters) {
1819 const call_argument_t *argument = call->arguments;
1820 for ( ; argument != NULL; argument = argument->next) {
1824 /* we need to construct a new method type matching the call
1826 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1827 int n_res = get_method_n_ress(ir_method_type);
1828 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1829 set_method_calling_convention(new_method_type,
1830 get_method_calling_convention(ir_method_type));
1831 set_method_additional_properties(new_method_type,
1832 get_method_additional_properties(ir_method_type));
1833 set_method_variadicity(new_method_type,
1834 get_method_variadicity(ir_method_type));
1836 for (int i = 0; i < n_res; ++i) {
1837 set_method_res_type(new_method_type, i,
1838 get_method_res_type(ir_method_type, i));
1840 argument = call->arguments;
1841 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1842 expression_t *expression = argument->expression;
1843 ir_type *irtype = get_ir_type(expression->base.type);
1844 set_method_param_type(new_method_type, i, irtype);
1846 ir_method_type = new_method_type;
1848 n_parameters = get_method_n_params(ir_method_type);
1851 ir_node *in[n_parameters];
1853 const call_argument_t *argument = call->arguments;
1854 for (int n = 0; n < n_parameters; ++n) {
1855 expression_t *expression = argument->expression;
1856 ir_node *arg_node = expression_to_firm(expression);
1858 type_t *arg_type = skip_typeref(expression->base.type);
1859 if (!is_type_compound(arg_type)) {
1860 ir_mode *mode = get_ir_mode_storage(expression->base.type);
1861 arg_node = create_conv(dbgi, arg_node, mode);
1862 arg_node = do_strict_conv(dbgi, arg_node);
1867 argument = argument->next;
1871 if (function_type->modifiers & DM_CONST) {
1872 store = get_irg_no_mem(current_ir_graph);
1874 store = get_store();
1878 type_t *return_type = skip_typeref(function_type->return_type);
1879 ir_node *result = NULL;
1881 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1883 if (! (function_type->modifiers & DM_CONST)) {
1884 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1888 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1889 assert(is_type_scalar(return_type));
1890 ir_mode *mode = get_ir_mode_storage(return_type);
1891 result = new_Proj(node, mode, pn_Builtin_1_result);
1892 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1893 result = create_conv(NULL, result, mode_arith);
1896 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1897 if (! (function_type->modifiers & DM_CONST)) {
1898 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1902 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1903 ir_node *resproj = new_Proj(node, mode_T, pn_Call_T_result);
1905 if (is_type_scalar(return_type)) {
1906 ir_mode *mode = get_ir_mode_storage(return_type);
1907 result = new_Proj(resproj, mode, 0);
1908 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1909 result = create_conv(NULL, result, mode_arith);
1911 ir_mode *mode = mode_P_data;
1912 result = new_Proj(resproj, mode, 0);
1917 if (function_type->modifiers & DM_NORETURN) {
1918 /* A dead end: Keep the Call and the Block. Also place all further
1919 * nodes into a new and unreachable block. */
1921 keep_alive(get_cur_block());
1922 ir_node *block = new_Block(0, NULL);
1923 set_cur_block(block);
1929 static void statement_to_firm(statement_t *statement);
1930 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1932 static ir_node *expression_to_addr(const expression_t *expression);
1933 static ir_node *create_condition_evaluation(const expression_t *expression,
1934 ir_node *true_block,
1935 ir_node *false_block);
1937 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1940 if (!is_type_compound(type)) {
1941 ir_mode *mode = get_ir_mode_storage(type);
1942 value = create_conv(dbgi, value, mode);
1943 value = do_strict_conv(dbgi, value);
1946 ir_node *memory = get_store();
1948 if (is_type_scalar(type)) {
1949 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1950 ? cons_volatile : cons_none;
1951 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1952 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1953 set_store(store_mem);
1955 ir_type *irtype = get_ir_type(type);
1956 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1957 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1958 set_store(copyb_mem);
1962 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1964 ir_tarval *all_one = get_mode_all_one(mode);
1965 int mode_size = get_mode_size_bits(mode);
1967 assert(offset >= 0);
1969 assert(offset + size <= mode_size);
1970 if (size == mode_size) {
1974 long shiftr = get_mode_size_bits(mode) - size;
1975 long shiftl = offset;
1976 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1977 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1978 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1979 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1984 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1985 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1988 ir_type *entity_type = get_entity_type(entity);
1989 ir_type *base_type = get_primitive_base_type(entity_type);
1990 ir_mode *mode = get_type_mode(base_type);
1992 value = create_conv(dbgi, value, mode);
1994 /* kill upper bits of value and shift to right position */
1995 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1996 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1997 unsigned base_bits = get_mode_size_bits(mode);
1998 unsigned shiftwidth = base_bits - bitsize;
2000 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
2001 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
2003 unsigned shrwidth = base_bits - bitsize - bitoffset;
2004 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
2005 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
2007 /* load current value */
2008 ir_node *mem = get_store();
2009 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2010 set_volatile ? cons_volatile : cons_none);
2011 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2012 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2013 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2014 ir_tarval *inv_mask = tarval_not(shift_mask);
2015 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2016 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2018 /* construct new value and store */
2019 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2020 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2021 set_volatile ? cons_volatile : cons_none);
2022 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2023 set_store(store_mem);
2029 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2030 if (mode_is_signed(mode)) {
2031 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2033 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2038 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2041 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2042 entity_t *entity = expression->compound_entry;
2043 type_t *base_type = entity->declaration.type;
2044 ir_mode *mode = get_ir_mode_storage(base_type);
2045 ir_node *mem = get_store();
2046 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2047 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2048 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2050 ir_mode *amode = mode;
2051 /* optimisation, since shifting in modes < machine_size is usually
2053 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2056 unsigned amode_size = get_mode_size_bits(amode);
2057 load_res = create_conv(dbgi, load_res, amode);
2059 set_store(load_mem);
2061 /* kill upper bits */
2062 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2063 unsigned bitoffset = entity->compound_member.bit_offset;
2064 unsigned bitsize = entity->compound_member.bit_size;
2065 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2066 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2067 ir_node *countl = new_d_Const(dbgi, tvl);
2068 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2070 unsigned shift_bitsr = bitoffset + shift_bitsl;
2071 assert(shift_bitsr <= amode_size);
2072 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2073 ir_node *countr = new_d_Const(dbgi, tvr);
2075 if (mode_is_signed(mode)) {
2076 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2078 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2081 type_t *type = expression->base.type;
2082 ir_mode *resmode = get_ir_mode_arithmetic(type);
2083 return create_conv(dbgi, shiftr, resmode);
2086 /* make sure the selected compound type is constructed */
2087 static void construct_select_compound(const select_expression_t *expression)
2089 type_t *type = skip_typeref(expression->compound->base.type);
2090 if (is_type_pointer(type)) {
2091 type = type->pointer.points_to;
2093 (void) get_ir_type(type);
2096 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2097 ir_node *value, ir_node *addr)
2099 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2100 type_t *type = skip_typeref(expression->base.type);
2102 if (!is_type_compound(type)) {
2103 ir_mode *mode = get_ir_mode_storage(type);
2104 value = create_conv(dbgi, value, mode);
2105 value = do_strict_conv(dbgi, value);
2108 if (expression->kind == EXPR_REFERENCE) {
2109 const reference_expression_t *ref = &expression->reference;
2111 entity_t *entity = ref->entity;
2112 assert(is_declaration(entity));
2113 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2114 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2115 set_value(entity->variable.v.value_number, value);
2117 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2118 set_value(entity->parameter.v.value_number, value);
2124 addr = expression_to_addr(expression);
2125 assert(addr != NULL);
2127 if (expression->kind == EXPR_SELECT) {
2128 const select_expression_t *select = &expression->select;
2130 construct_select_compound(select);
2132 entity_t *entity = select->compound_entry;
2133 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2134 if (entity->compound_member.bitfield) {
2135 ir_entity *irentity = entity->compound_member.entity;
2137 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2138 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2139 set_volatile, true);
2144 assign_value(dbgi, addr, type, value);
2148 static void set_value_for_expression(const expression_t *expression,
2151 set_value_for_expression_addr(expression, value, NULL);
2154 static ir_node *get_value_from_lvalue(const expression_t *expression,
2157 if (expression->kind == EXPR_REFERENCE) {
2158 const reference_expression_t *ref = &expression->reference;
2160 entity_t *entity = ref->entity;
2161 assert(entity->kind == ENTITY_VARIABLE
2162 || entity->kind == ENTITY_PARAMETER);
2163 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2165 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2166 value_number = entity->variable.v.value_number;
2167 assert(addr == NULL);
2168 type_t *type = skip_typeref(expression->base.type);
2169 ir_mode *mode = get_ir_mode_storage(type);
2170 ir_node *res = get_value(value_number, mode);
2171 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2172 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2173 value_number = entity->parameter.v.value_number;
2174 assert(addr == NULL);
2175 type_t *type = skip_typeref(expression->base.type);
2176 ir_mode *mode = get_ir_mode_storage(type);
2177 ir_node *res = get_value(value_number, mode);
2178 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2182 assert(addr != NULL);
2183 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2186 if (expression->kind == EXPR_SELECT &&
2187 expression->select.compound_entry->compound_member.bitfield) {
2188 construct_select_compound(&expression->select);
2189 value = bitfield_extract_to_firm(&expression->select, addr);
2191 value = deref_address(dbgi, expression->base.type, addr);
2198 static ir_node *create_incdec(const unary_expression_t *expression)
2200 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2201 const expression_t *value_expr = expression->value;
2202 ir_node *addr = expression_to_addr(value_expr);
2203 ir_node *value = get_value_from_lvalue(value_expr, addr);
2205 type_t *type = skip_typeref(expression->base.type);
2206 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2209 if (is_type_pointer(type)) {
2210 pointer_type_t *pointer_type = &type->pointer;
2211 offset = get_type_size_node(pointer_type->points_to);
2213 assert(is_type_arithmetic(type));
2214 offset = new_Const(get_mode_one(mode));
2218 ir_node *store_value;
2219 switch(expression->base.kind) {
2220 case EXPR_UNARY_POSTFIX_INCREMENT:
2222 store_value = new_d_Add(dbgi, value, offset, mode);
2224 case EXPR_UNARY_POSTFIX_DECREMENT:
2226 store_value = new_d_Sub(dbgi, value, offset, mode);
2228 case EXPR_UNARY_PREFIX_INCREMENT:
2229 result = new_d_Add(dbgi, value, offset, mode);
2230 store_value = result;
2232 case EXPR_UNARY_PREFIX_DECREMENT:
2233 result = new_d_Sub(dbgi, value, offset, mode);
2234 store_value = result;
2237 panic("no incdec expr in create_incdec");
2240 set_value_for_expression_addr(value_expr, store_value, addr);
2245 static bool is_local_variable(expression_t *expression)
2247 if (expression->kind != EXPR_REFERENCE)
2249 reference_expression_t *ref_expr = &expression->reference;
2250 entity_t *entity = ref_expr->entity;
2251 if (entity->kind != ENTITY_VARIABLE)
2253 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2254 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2257 static ir_relation get_relation(const expression_kind_t kind)
2260 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2261 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2262 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2263 case EXPR_BINARY_ISLESS:
2264 case EXPR_BINARY_LESS: return ir_relation_less;
2265 case EXPR_BINARY_ISLESSEQUAL:
2266 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2267 case EXPR_BINARY_ISGREATER:
2268 case EXPR_BINARY_GREATER: return ir_relation_greater;
2269 case EXPR_BINARY_ISGREATEREQUAL:
2270 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2271 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2276 panic("trying to get pn_Cmp from non-comparison binexpr type");
2280 * Handle the assume optimizer hint: check if a Confirm
2281 * node can be created.
2283 * @param dbi debug info
2284 * @param expr the IL assume expression
2286 * we support here only some simple cases:
2291 static ir_node *handle_assume_compare(dbg_info *dbi,
2292 const binary_expression_t *expression)
2294 expression_t *op1 = expression->left;
2295 expression_t *op2 = expression->right;
2296 entity_t *var2, *var = NULL;
2297 ir_node *res = NULL;
2298 ir_relation relation = get_relation(expression->base.kind);
2300 if (is_local_variable(op1) && is_local_variable(op2)) {
2301 var = op1->reference.entity;
2302 var2 = op2->reference.entity;
2304 type_t *const type = skip_typeref(var->declaration.type);
2305 ir_mode *const mode = get_ir_mode_storage(type);
2307 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2308 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2310 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2311 set_value(var2->variable.v.value_number, res);
2313 res = new_d_Confirm(dbi, irn1, irn2, relation);
2314 set_value(var->variable.v.value_number, res);
2319 expression_t *con = NULL;
2320 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2321 var = op1->reference.entity;
2323 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2324 relation = get_inversed_relation(relation);
2325 var = op2->reference.entity;
2330 type_t *const type = skip_typeref(var->declaration.type);
2331 ir_mode *const mode = get_ir_mode_storage(type);
2333 res = get_value(var->variable.v.value_number, mode);
2334 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2335 set_value(var->variable.v.value_number, res);
2341 * Handle the assume optimizer hint.
2343 * @param dbi debug info
2344 * @param expr the IL assume expression
2346 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2348 switch(expression->kind) {
2349 case EXPR_BINARY_EQUAL:
2350 case EXPR_BINARY_NOTEQUAL:
2351 case EXPR_BINARY_LESS:
2352 case EXPR_BINARY_LESSEQUAL:
2353 case EXPR_BINARY_GREATER:
2354 case EXPR_BINARY_GREATEREQUAL:
2355 return handle_assume_compare(dbi, &expression->binary);
2361 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2362 type_t *from_type, type_t *type)
2364 type = skip_typeref(type);
2365 if (type == type_void) {
2366 /* make sure firm type is constructed */
2367 (void) get_ir_type(type);
2370 if (!is_type_scalar(type)) {
2371 /* make sure firm type is constructed */
2372 (void) get_ir_type(type);
2376 from_type = skip_typeref(from_type);
2377 ir_mode *mode = get_ir_mode_storage(type);
2378 /* check for conversion from / to __based types */
2379 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2380 const variable_t *from_var = from_type->pointer.base_variable;
2381 const variable_t *to_var = type->pointer.base_variable;
2382 if (from_var != to_var) {
2383 if (from_var != NULL) {
2384 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2385 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2386 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2388 if (to_var != NULL) {
2389 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2390 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2391 value_node = new_d_Sub(dbgi, value_node, base, mode);
2396 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2397 /* bool adjustments (we save a mode_Bu, but have to temporarily
2398 * convert to mode_b so we only get a 0/1 value */
2399 value_node = create_conv(dbgi, value_node, mode_b);
2402 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2403 ir_node *node = create_conv(dbgi, value_node, mode);
2404 node = do_strict_conv(dbgi, node);
2405 node = create_conv(dbgi, node, mode_arith);
2410 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2412 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2413 type_t *type = skip_typeref(expression->base.type);
2415 if (expression->base.kind == EXPR_UNARY_TAKE_ADDRESS)
2416 return expression_to_addr(expression->value);
2418 const expression_t *value = expression->value;
2420 switch(expression->base.kind) {
2421 case EXPR_UNARY_NEGATE: {
2422 ir_node *value_node = expression_to_firm(value);
2423 ir_mode *mode = get_ir_mode_arithmetic(type);
2424 return new_d_Minus(dbgi, value_node, mode);
2426 case EXPR_UNARY_PLUS:
2427 return expression_to_firm(value);
2428 case EXPR_UNARY_BITWISE_NEGATE: {
2429 ir_node *value_node = expression_to_firm(value);
2430 ir_mode *mode = get_ir_mode_arithmetic(type);
2431 return new_d_Not(dbgi, value_node, mode);
2433 case EXPR_UNARY_NOT: {
2434 ir_node *value_node = _expression_to_firm(value);
2435 value_node = create_conv(dbgi, value_node, mode_b);
2436 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2439 case EXPR_UNARY_DEREFERENCE: {
2440 ir_node *value_node = expression_to_firm(value);
2441 type_t *value_type = skip_typeref(value->base.type);
2442 assert(is_type_pointer(value_type));
2444 /* check for __based */
2445 const variable_t *const base_var = value_type->pointer.base_variable;
2446 if (base_var != NULL) {
2447 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2448 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2449 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2451 type_t *points_to = value_type->pointer.points_to;
2452 return deref_address(dbgi, points_to, value_node);
2454 case EXPR_UNARY_POSTFIX_INCREMENT:
2455 case EXPR_UNARY_POSTFIX_DECREMENT:
2456 case EXPR_UNARY_PREFIX_INCREMENT:
2457 case EXPR_UNARY_PREFIX_DECREMENT:
2458 return create_incdec(expression);
2459 case EXPR_UNARY_CAST: {
2460 ir_node *value_node = expression_to_firm(value);
2461 type_t *from_type = value->base.type;
2462 return create_cast(dbgi, value_node, from_type, type);
2464 case EXPR_UNARY_ASSUME:
2465 return handle_assume(dbgi, value);
2470 panic("invalid UNEXPR type found");
2474 * produces a 0/1 depending of the value of a mode_b node
2476 static ir_node *produce_condition_result(const expression_t *expression,
2477 ir_mode *mode, dbg_info *dbgi)
2479 ir_node *const one_block = new_immBlock();
2480 ir_node *const zero_block = new_immBlock();
2481 create_condition_evaluation(expression, one_block, zero_block);
2482 mature_immBlock(one_block);
2483 mature_immBlock(zero_block);
2485 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2486 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2487 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2488 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2489 set_cur_block(block);
2491 ir_node *const one = new_Const(get_mode_one(mode));
2492 ir_node *const zero = new_Const(get_mode_null(mode));
2493 ir_node *const in[2] = { one, zero };
2494 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2499 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2500 ir_node *value, type_t *type)
2502 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2503 assert(is_type_pointer(type));
2504 pointer_type_t *const pointer_type = &type->pointer;
2505 type_t *const points_to = skip_typeref(pointer_type->points_to);
2506 ir_node * elem_size = get_type_size_node(points_to);
2507 elem_size = create_conv(dbgi, elem_size, mode);
2508 value = create_conv(dbgi, value, mode);
2509 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2513 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2514 ir_node *left, ir_node *right)
2517 type_t *type_left = skip_typeref(expression->left->base.type);
2518 type_t *type_right = skip_typeref(expression->right->base.type);
2520 expression_kind_t kind = expression->base.kind;
2523 case EXPR_BINARY_SHIFTLEFT:
2524 case EXPR_BINARY_SHIFTRIGHT:
2525 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2526 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2527 mode = get_ir_mode_arithmetic(expression->base.type);
2528 right = create_conv(dbgi, right, mode_uint);
2531 case EXPR_BINARY_SUB:
2532 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2533 const pointer_type_t *const ptr_type = &type_left->pointer;
2535 mode = get_ir_mode_arithmetic(expression->base.type);
2536 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2537 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2538 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2539 ir_node *const no_mem = new_NoMem();
2540 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2541 mode, op_pin_state_floats);
2542 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2545 case EXPR_BINARY_SUB_ASSIGN:
2546 if (is_type_pointer(type_left)) {
2547 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2548 mode = get_ir_mode_arithmetic(type_left);
2553 case EXPR_BINARY_ADD:
2554 case EXPR_BINARY_ADD_ASSIGN:
2555 if (is_type_pointer(type_left)) {
2556 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2557 mode = get_ir_mode_arithmetic(type_left);
2559 } else if (is_type_pointer(type_right)) {
2560 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2561 mode = get_ir_mode_arithmetic(type_right);
2568 mode = get_ir_mode_arithmetic(type_right);
2569 left = create_conv(dbgi, left, mode);
2574 case EXPR_BINARY_ADD_ASSIGN:
2575 case EXPR_BINARY_ADD:
2576 return new_d_Add(dbgi, left, right, mode);
2577 case EXPR_BINARY_SUB_ASSIGN:
2578 case EXPR_BINARY_SUB:
2579 return new_d_Sub(dbgi, left, right, mode);
2580 case EXPR_BINARY_MUL_ASSIGN:
2581 case EXPR_BINARY_MUL:
2582 return new_d_Mul(dbgi, left, right, mode);
2583 case EXPR_BINARY_BITWISE_AND:
2584 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2585 return new_d_And(dbgi, left, right, mode);
2586 case EXPR_BINARY_BITWISE_OR:
2587 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2588 return new_d_Or(dbgi, left, right, mode);
2589 case EXPR_BINARY_BITWISE_XOR:
2590 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2591 return new_d_Eor(dbgi, left, right, mode);
2592 case EXPR_BINARY_SHIFTLEFT:
2593 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2594 return new_d_Shl(dbgi, left, right, mode);
2595 case EXPR_BINARY_SHIFTRIGHT:
2596 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2597 if (mode_is_signed(mode)) {
2598 return new_d_Shrs(dbgi, left, right, mode);
2600 return new_d_Shr(dbgi, left, right, mode);
2602 case EXPR_BINARY_DIV:
2603 case EXPR_BINARY_DIV_ASSIGN: {
2604 ir_node *pin = new_Pin(new_NoMem());
2605 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2606 op_pin_state_floats);
2607 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2610 case EXPR_BINARY_MOD:
2611 case EXPR_BINARY_MOD_ASSIGN: {
2612 ir_node *pin = new_Pin(new_NoMem());
2613 assert(!mode_is_float(mode));
2614 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2615 op_pin_state_floats);
2616 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2620 panic("unexpected expression kind");
2624 static ir_node *create_lazy_op(const binary_expression_t *expression)
2626 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2627 type_t *type = skip_typeref(expression->base.type);
2628 ir_mode *mode = get_ir_mode_arithmetic(type);
2630 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2631 bool val = fold_constant_to_bool(expression->left);
2632 expression_kind_t ekind = expression->base.kind;
2633 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2634 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2636 return new_Const(get_mode_null(mode));
2640 return new_Const(get_mode_one(mode));
2644 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2645 bool valr = fold_constant_to_bool(expression->right);
2646 return create_Const_from_bool(mode, valr);
2649 return produce_condition_result(expression->right, mode, dbgi);
2652 return produce_condition_result((const expression_t*) expression, mode,
2656 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2657 ir_node *right, ir_mode *mode);
2659 static ir_node *create_assign_binop(const binary_expression_t *expression)
2661 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2662 const expression_t *left_expr = expression->left;
2663 type_t *type = skip_typeref(left_expr->base.type);
2664 ir_node *right = expression_to_firm(expression->right);
2665 ir_node *left_addr = expression_to_addr(left_expr);
2666 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2667 ir_node *result = create_op(dbgi, expression, left, right);
2669 result = create_cast(dbgi, result, expression->right->base.type, type);
2670 result = do_strict_conv(dbgi, result);
2672 result = set_value_for_expression_addr(left_expr, result, left_addr);
2674 if (!is_type_compound(type)) {
2675 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2676 result = create_conv(dbgi, result, mode_arithmetic);
2681 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2683 expression_kind_t kind = expression->base.kind;
2686 case EXPR_BINARY_EQUAL:
2687 case EXPR_BINARY_NOTEQUAL:
2688 case EXPR_BINARY_LESS:
2689 case EXPR_BINARY_LESSEQUAL:
2690 case EXPR_BINARY_GREATER:
2691 case EXPR_BINARY_GREATEREQUAL:
2692 case EXPR_BINARY_ISGREATER:
2693 case EXPR_BINARY_ISGREATEREQUAL:
2694 case EXPR_BINARY_ISLESS:
2695 case EXPR_BINARY_ISLESSEQUAL:
2696 case EXPR_BINARY_ISLESSGREATER:
2697 case EXPR_BINARY_ISUNORDERED: {
2698 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2699 ir_node *left = expression_to_firm(expression->left);
2700 ir_node *right = expression_to_firm(expression->right);
2701 ir_relation relation = get_relation(kind);
2702 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2705 case EXPR_BINARY_ASSIGN: {
2706 ir_node *addr = expression_to_addr(expression->left);
2707 ir_node *right = expression_to_firm(expression->right);
2709 = set_value_for_expression_addr(expression->left, right, addr);
2711 type_t *type = skip_typeref(expression->base.type);
2712 if (!is_type_compound(type)) {
2713 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2714 res = create_conv(NULL, res, mode_arithmetic);
2718 case EXPR_BINARY_ADD:
2719 case EXPR_BINARY_SUB:
2720 case EXPR_BINARY_MUL:
2721 case EXPR_BINARY_DIV:
2722 case EXPR_BINARY_MOD:
2723 case EXPR_BINARY_BITWISE_AND:
2724 case EXPR_BINARY_BITWISE_OR:
2725 case EXPR_BINARY_BITWISE_XOR:
2726 case EXPR_BINARY_SHIFTLEFT:
2727 case EXPR_BINARY_SHIFTRIGHT:
2729 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2730 ir_node *left = expression_to_firm(expression->left);
2731 ir_node *right = expression_to_firm(expression->right);
2732 return create_op(dbgi, expression, left, right);
2734 case EXPR_BINARY_LOGICAL_AND:
2735 case EXPR_BINARY_LOGICAL_OR:
2736 return create_lazy_op(expression);
2737 case EXPR_BINARY_COMMA:
2738 /* create side effects of left side */
2739 (void) expression_to_firm(expression->left);
2740 return _expression_to_firm(expression->right);
2742 case EXPR_BINARY_ADD_ASSIGN:
2743 case EXPR_BINARY_SUB_ASSIGN:
2744 case EXPR_BINARY_MUL_ASSIGN:
2745 case EXPR_BINARY_MOD_ASSIGN:
2746 case EXPR_BINARY_DIV_ASSIGN:
2747 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2748 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2749 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2750 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2751 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2752 return create_assign_binop(expression);
2754 panic("TODO binexpr type");
2758 static ir_node *array_access_addr(const array_access_expression_t *expression)
2760 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2761 ir_node *base_addr = expression_to_firm(expression->array_ref);
2762 ir_node *offset = expression_to_firm(expression->index);
2763 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2764 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2765 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2770 static ir_node *array_access_to_firm(
2771 const array_access_expression_t *expression)
2773 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2774 ir_node *addr = array_access_addr(expression);
2775 type_t *type = revert_automatic_type_conversion(
2776 (const expression_t*) expression);
2777 type = skip_typeref(type);
2779 return deref_address(dbgi, type, addr);
2782 static long get_offsetof_offset(const offsetof_expression_t *expression)
2784 type_t *orig_type = expression->type;
2787 designator_t *designator = expression->designator;
2788 for ( ; designator != NULL; designator = designator->next) {
2789 type_t *type = skip_typeref(orig_type);
2790 /* be sure the type is constructed */
2791 (void) get_ir_type(type);
2793 if (designator->symbol != NULL) {
2794 assert(is_type_compound(type));
2795 symbol_t *symbol = designator->symbol;
2797 compound_t *compound = type->compound.compound;
2798 entity_t *iter = compound->members.entities;
2799 for ( ; iter != NULL; iter = iter->base.next) {
2800 if (iter->base.symbol == symbol) {
2804 assert(iter != NULL);
2806 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2807 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2808 offset += get_entity_offset(iter->compound_member.entity);
2810 orig_type = iter->declaration.type;
2812 expression_t *array_index = designator->array_index;
2813 assert(designator->array_index != NULL);
2814 assert(is_type_array(type));
2816 long index = fold_constant_to_int(array_index);
2817 ir_type *arr_type = get_ir_type(type);
2818 ir_type *elem_type = get_array_element_type(arr_type);
2819 long elem_size = get_type_size_bytes(elem_type);
2821 offset += index * elem_size;
2823 orig_type = type->array.element_type;
2830 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2832 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2833 long offset = get_offsetof_offset(expression);
2834 ir_tarval *tv = new_tarval_from_long(offset, mode);
2835 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2837 return new_d_Const(dbgi, tv);
2840 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2841 ir_entity *entity, type_t *type);
2843 static ir_node *compound_literal_to_firm(
2844 const compound_literal_expression_t *expression)
2846 type_t *type = expression->type;
2848 /* create an entity on the stack */
2849 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2851 ident *const id = id_unique("CompLit.%u");
2852 ir_type *const irtype = get_ir_type(type);
2853 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2854 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2855 set_entity_ld_ident(entity, id);
2857 /* create initialisation code */
2858 initializer_t *initializer = expression->initializer;
2859 create_local_initializer(initializer, dbgi, entity, type);
2861 /* create a sel for the compound literal address */
2862 ir_node *frame = get_irg_frame(current_ir_graph);
2863 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2868 * Transform a sizeof expression into Firm code.
2870 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2872 type_t *const type = skip_typeref(expression->type);
2873 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2874 if (is_type_array(type) && type->array.is_vla
2875 && expression->tp_expression != NULL) {
2876 expression_to_firm(expression->tp_expression);
2878 /* strange gnu extensions: sizeof(function) == 1 */
2879 if (is_type_function(type)) {
2880 ir_mode *mode = get_ir_mode_storage(type_size_t);
2881 return new_Const(get_mode_one(mode));
2884 return get_type_size_node(type);
2887 static entity_t *get_expression_entity(const expression_t *expression)
2889 if (expression->kind != EXPR_REFERENCE)
2892 return expression->reference.entity;
2895 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2897 switch(entity->kind) {
2898 DECLARATION_KIND_CASES
2899 return entity->declaration.alignment;
2902 return entity->compound.alignment;
2903 case ENTITY_TYPEDEF:
2904 return entity->typedefe.alignment;
2912 * Transform an alignof expression into Firm code.
2914 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2916 unsigned alignment = 0;
2918 const expression_t *tp_expression = expression->tp_expression;
2919 if (tp_expression != NULL) {
2920 entity_t *entity = get_expression_entity(tp_expression);
2921 if (entity != NULL) {
2922 if (entity->kind == ENTITY_FUNCTION) {
2923 /* a gnu-extension */
2926 alignment = get_cparser_entity_alignment(entity);
2931 if (alignment == 0) {
2932 type_t *type = expression->type;
2933 alignment = get_type_alignment(type);
2936 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2937 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2938 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2939 return new_d_Const(dbgi, tv);
2942 static void init_ir_types(void);
2944 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2946 assert(is_type_valid(skip_typeref(expression->base.type)));
2948 bool constant_folding_old = constant_folding;
2949 constant_folding = true;
2953 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2955 ir_graph *old_current_ir_graph = current_ir_graph;
2956 current_ir_graph = get_const_code_irg();
2958 ir_node *cnst = expression_to_firm(expression);
2959 current_ir_graph = old_current_ir_graph;
2961 if (!is_Const(cnst)) {
2962 panic("couldn't fold constant");
2965 constant_folding = constant_folding_old;
2967 return get_Const_tarval(cnst);
2970 /* this function is only used in parser.c, but it relies on libfirm functionality */
2971 bool constant_is_negative(const expression_t *expression)
2973 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2974 ir_tarval *tv = fold_constant_to_tarval(expression);
2975 return tarval_is_negative(tv);
2978 long fold_constant_to_int(const expression_t *expression)
2980 if (expression->kind == EXPR_ERROR)
2983 ir_tarval *tv = fold_constant_to_tarval(expression);
2984 if (!tarval_is_long(tv)) {
2985 panic("result of constant folding is not integer");
2988 return get_tarval_long(tv);
2991 bool fold_constant_to_bool(const expression_t *expression)
2993 if (expression->kind == EXPR_ERROR)
2995 ir_tarval *tv = fold_constant_to_tarval(expression);
2996 return !tarval_is_null(tv);
2999 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3001 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3003 /* first try to fold a constant condition */
3004 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3005 bool val = fold_constant_to_bool(expression->condition);
3007 expression_t *true_expression = expression->true_expression;
3008 if (true_expression == NULL)
3009 true_expression = expression->condition;
3010 return expression_to_firm(true_expression);
3012 return expression_to_firm(expression->false_expression);
3016 ir_node *const true_block = new_immBlock();
3017 ir_node *const false_block = new_immBlock();
3018 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3019 mature_immBlock(true_block);
3020 mature_immBlock(false_block);
3022 set_cur_block(true_block);
3024 if (expression->true_expression != NULL) {
3025 true_val = expression_to_firm(expression->true_expression);
3026 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3027 true_val = cond_expr;
3029 /* Condition ended with a short circuit (&&, ||, !) operation or a
3030 * comparison. Generate a "1" as value for the true branch. */
3031 true_val = new_Const(get_mode_one(mode_Is));
3033 ir_node *const true_jmp = new_d_Jmp(dbgi);
3035 set_cur_block(false_block);
3036 ir_node *const false_val = expression_to_firm(expression->false_expression);
3037 ir_node *const false_jmp = new_d_Jmp(dbgi);
3039 /* create the common block */
3040 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3041 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3042 set_cur_block(block);
3044 /* TODO improve static semantics, so either both or no values are NULL */
3045 if (true_val == NULL || false_val == NULL)
3048 ir_node *const in[2] = { true_val, false_val };
3049 type_t *const type = skip_typeref(expression->base.type);
3051 if (is_type_compound(type)) {
3054 mode = get_ir_mode_arithmetic(type);
3056 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3062 * Returns an IR-node representing the address of a field.
3064 static ir_node *select_addr(const select_expression_t *expression)
3066 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3068 construct_select_compound(expression);
3070 ir_node *compound_addr = expression_to_firm(expression->compound);
3072 entity_t *entry = expression->compound_entry;
3073 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3074 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3076 if (constant_folding) {
3077 ir_mode *mode = get_irn_mode(compound_addr);
3078 /* FIXME: here, we need an integer mode with the same number of bits as mode */
3079 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3080 return new_d_Add(dbgi, compound_addr, ofs, mode);
3082 ir_entity *irentity = entry->compound_member.entity;
3083 assert(irentity != NULL);
3084 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3088 static ir_node *select_to_firm(const select_expression_t *expression)
3090 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3091 ir_node *addr = select_addr(expression);
3092 type_t *type = revert_automatic_type_conversion(
3093 (const expression_t*) expression);
3094 type = skip_typeref(type);
3096 entity_t *entry = expression->compound_entry;
3097 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3099 if (entry->compound_member.bitfield) {
3100 return bitfield_extract_to_firm(expression, addr);
3103 return deref_address(dbgi, type, addr);
3106 /* Values returned by __builtin_classify_type. */
3107 typedef enum gcc_type_class
3113 enumeral_type_class,
3116 reference_type_class,
3120 function_type_class,
3131 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3133 type_t *type = expr->type_expression->base.type;
3135 /* FIXME gcc returns different values depending on whether compiling C or C++
3136 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3139 type = skip_typeref(type);
3140 switch (type->kind) {
3142 const atomic_type_t *const atomic_type = &type->atomic;
3143 switch (atomic_type->akind) {
3144 /* should not be reached */
3145 case ATOMIC_TYPE_INVALID:
3149 /* gcc cannot do that */
3150 case ATOMIC_TYPE_VOID:
3151 tc = void_type_class;
3154 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3155 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3156 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3157 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3158 case ATOMIC_TYPE_SHORT:
3159 case ATOMIC_TYPE_USHORT:
3160 case ATOMIC_TYPE_INT:
3161 case ATOMIC_TYPE_UINT:
3162 case ATOMIC_TYPE_LONG:
3163 case ATOMIC_TYPE_ULONG:
3164 case ATOMIC_TYPE_LONGLONG:
3165 case ATOMIC_TYPE_ULONGLONG:
3166 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3167 tc = integer_type_class;
3170 case ATOMIC_TYPE_FLOAT:
3171 case ATOMIC_TYPE_DOUBLE:
3172 case ATOMIC_TYPE_LONG_DOUBLE:
3173 tc = real_type_class;
3176 panic("Unexpected atomic type in classify_type_to_firm().");
3179 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3180 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3181 case TYPE_ARRAY: /* gcc handles this as pointer */
3182 case TYPE_FUNCTION: /* gcc handles this as pointer */
3183 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3184 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3185 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3187 /* gcc handles this as integer */
3188 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3190 /* gcc classifies the referenced type */
3191 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3193 /* typedef/typeof should be skipped already */
3199 panic("unexpected TYPE classify_type_to_firm().");
3203 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3204 ir_tarval *const tv = new_tarval_from_long(tc, mode_int);
3205 return new_d_Const(dbgi, tv);
3208 static ir_node *function_name_to_firm(
3209 const funcname_expression_t *const expr)
3211 switch(expr->kind) {
3212 case FUNCNAME_FUNCTION:
3213 case FUNCNAME_PRETTY_FUNCTION:
3214 case FUNCNAME_FUNCDNAME:
3215 if (current_function_name == NULL) {
3216 const source_position_t *const src_pos = &expr->base.source_position;
3217 const char *name = current_function_entity->base.symbol->string;
3218 const string_t string = { name, strlen(name) + 1 };
3219 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3221 return current_function_name;
3222 case FUNCNAME_FUNCSIG:
3223 if (current_funcsig == NULL) {
3224 const source_position_t *const src_pos = &expr->base.source_position;
3225 ir_entity *ent = get_irg_entity(current_ir_graph);
3226 const char *const name = get_entity_ld_name(ent);
3227 const string_t string = { name, strlen(name) + 1 };
3228 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3230 return current_funcsig;
3232 panic("Unsupported function name");
3235 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3237 statement_t *statement = expr->statement;
3239 assert(statement->kind == STATEMENT_COMPOUND);
3240 return compound_statement_to_firm(&statement->compound);
3243 static ir_node *va_start_expression_to_firm(
3244 const va_start_expression_t *const expr)
3246 ir_entity *param_ent = current_vararg_entity;
3247 if (param_ent == NULL) {
3248 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3249 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3250 ir_type *const param_type = get_unknown_type();
3251 param_ent = new_parameter_entity(frame_type, n, param_type);
3252 current_vararg_entity = param_ent;
3255 ir_node *const frame = get_irg_frame(current_ir_graph);
3256 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3257 ir_node *const no_mem = new_NoMem();
3258 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3260 set_value_for_expression(expr->ap, arg_sel);
3265 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3267 type_t *const type = expr->base.type;
3268 expression_t *const ap_expr = expr->ap;
3269 ir_node *const ap_addr = expression_to_addr(ap_expr);
3270 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3271 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3272 ir_node *const res = deref_address(dbgi, type, ap);
3274 ir_node *const cnst = get_type_size_node(expr->base.type);
3275 ir_mode *const mode = get_irn_mode(cnst);
3276 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3277 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3278 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3279 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3280 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3282 set_value_for_expression_addr(ap_expr, add, ap_addr);
3288 * Generate Firm for a va_copy expression.
3290 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3292 ir_node *const src = expression_to_firm(expr->src);
3293 set_value_for_expression(expr->dst, src);
3297 static ir_node *dereference_addr(const unary_expression_t *const expression)
3299 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3300 return expression_to_firm(expression->value);
3304 * Returns a IR-node representing an lvalue of the given expression.
3306 static ir_node *expression_to_addr(const expression_t *expression)
3308 switch(expression->kind) {
3309 case EXPR_ARRAY_ACCESS:
3310 return array_access_addr(&expression->array_access);
3312 return call_expression_to_firm(&expression->call);
3313 case EXPR_COMPOUND_LITERAL:
3314 return compound_literal_to_firm(&expression->compound_literal);
3315 case EXPR_REFERENCE:
3316 return reference_addr(&expression->reference);
3318 return select_addr(&expression->select);
3319 case EXPR_UNARY_DEREFERENCE:
3320 return dereference_addr(&expression->unary);
3324 panic("trying to get address of non-lvalue");
3327 static ir_node *builtin_constant_to_firm(
3328 const builtin_constant_expression_t *expression)
3330 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3331 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3332 return create_Const_from_bool(mode, v);
3335 static ir_node *builtin_types_compatible_to_firm(
3336 const builtin_types_compatible_expression_t *expression)
3338 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3339 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3340 bool const value = types_compatible(left, right);
3341 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3342 return create_Const_from_bool(mode, value);
3345 static ir_node *get_label_block(label_t *label)
3347 if (label->block != NULL)
3348 return label->block;
3350 /* beware: might be called from create initializer with current_ir_graph
3351 * set to const_code_irg. */
3352 ir_graph *rem = current_ir_graph;
3353 current_ir_graph = current_function;
3355 ir_node *block = new_immBlock();
3357 label->block = block;
3359 ARR_APP1(label_t *, all_labels, label);
3361 current_ir_graph = rem;
3366 * Pointer to a label. This is used for the
3367 * GNU address-of-label extension.
3369 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3371 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3372 ir_node *block = get_label_block(label->label);
3373 ir_entity *entity = create_Block_entity(block);
3375 symconst_symbol value;
3376 value.entity_p = entity;
3377 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3380 static ir_node *error_to_firm(const expression_t *expression)
3382 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3383 return new_Bad(mode);
3387 * creates firm nodes for an expression. The difference between this function
3388 * and expression_to_firm is, that this version might produce mode_b nodes
3389 * instead of mode_Is.
3391 static ir_node *_expression_to_firm(const expression_t *expression)
3394 if (!constant_folding) {
3395 assert(!expression->base.transformed);
3396 ((expression_t*) expression)->base.transformed = true;
3400 switch (expression->kind) {
3402 return literal_to_firm(&expression->literal);
3403 case EXPR_STRING_LITERAL:
3404 return string_to_firm(&expression->base.source_position, "str.%u",
3405 &expression->literal.value);
3406 case EXPR_WIDE_STRING_LITERAL:
3407 return wide_string_literal_to_firm(&expression->string_literal);
3408 case EXPR_REFERENCE:
3409 return reference_expression_to_firm(&expression->reference);
3410 case EXPR_REFERENCE_ENUM_VALUE:
3411 return reference_expression_enum_value_to_firm(&expression->reference);
3413 return call_expression_to_firm(&expression->call);
3415 return unary_expression_to_firm(&expression->unary);
3417 return binary_expression_to_firm(&expression->binary);
3418 case EXPR_ARRAY_ACCESS:
3419 return array_access_to_firm(&expression->array_access);
3421 return sizeof_to_firm(&expression->typeprop);
3423 return alignof_to_firm(&expression->typeprop);
3424 case EXPR_CONDITIONAL:
3425 return conditional_to_firm(&expression->conditional);
3427 return select_to_firm(&expression->select);
3428 case EXPR_CLASSIFY_TYPE:
3429 return classify_type_to_firm(&expression->classify_type);
3431 return function_name_to_firm(&expression->funcname);
3432 case EXPR_STATEMENT:
3433 return statement_expression_to_firm(&expression->statement);
3435 return va_start_expression_to_firm(&expression->va_starte);
3437 return va_arg_expression_to_firm(&expression->va_arge);
3439 return va_copy_expression_to_firm(&expression->va_copye);
3440 case EXPR_BUILTIN_CONSTANT_P:
3441 return builtin_constant_to_firm(&expression->builtin_constant);
3442 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
3443 return builtin_types_compatible_to_firm(&expression->builtin_types_compatible);
3445 return offsetof_to_firm(&expression->offsetofe);
3446 case EXPR_COMPOUND_LITERAL:
3447 return compound_literal_to_firm(&expression->compound_literal);
3448 case EXPR_LABEL_ADDRESS:
3449 return label_address_to_firm(&expression->label_address);
3452 return error_to_firm(expression);
3454 panic("invalid expression found");
3458 * Check if a given expression is a GNU __builtin_expect() call.
3460 static bool is_builtin_expect(const expression_t *expression)
3462 if (expression->kind != EXPR_CALL)
3465 expression_t *function = expression->call.function;
3466 if (function->kind != EXPR_REFERENCE)
3468 reference_expression_t *ref = &function->reference;
3469 if (ref->entity->kind != ENTITY_FUNCTION ||
3470 ref->entity->function.btk != BUILTIN_EXPECT)
3476 static bool produces_mode_b(const expression_t *expression)
3478 switch (expression->kind) {
3479 case EXPR_BINARY_EQUAL:
3480 case EXPR_BINARY_NOTEQUAL:
3481 case EXPR_BINARY_LESS:
3482 case EXPR_BINARY_LESSEQUAL:
3483 case EXPR_BINARY_GREATER:
3484 case EXPR_BINARY_GREATEREQUAL:
3485 case EXPR_BINARY_ISGREATER:
3486 case EXPR_BINARY_ISGREATEREQUAL:
3487 case EXPR_BINARY_ISLESS:
3488 case EXPR_BINARY_ISLESSEQUAL:
3489 case EXPR_BINARY_ISLESSGREATER:
3490 case EXPR_BINARY_ISUNORDERED:
3491 case EXPR_UNARY_NOT:
3495 if (is_builtin_expect(expression)) {
3496 expression_t *argument = expression->call.arguments->expression;
3497 return produces_mode_b(argument);
3500 case EXPR_BINARY_COMMA:
3501 return produces_mode_b(expression->binary.right);
3508 static ir_node *expression_to_firm(const expression_t *expression)
3510 if (!produces_mode_b(expression)) {
3511 ir_node *res = _expression_to_firm(expression);
3512 assert(res == NULL || get_irn_mode(res) != mode_b);
3516 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3517 bool const constant_folding_old = constant_folding;
3518 constant_folding = true;
3519 ir_node *res = _expression_to_firm(expression);
3520 constant_folding = constant_folding_old;
3521 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3522 assert(is_Const(res));
3523 return create_Const_from_bool(mode, !is_Const_null(res));
3526 /* we have to produce a 0/1 from the mode_b expression */
3527 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3528 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3529 return produce_condition_result(expression, mode, dbgi);
3533 * create a short-circuit expression evaluation that tries to construct
3534 * efficient control flow structures for &&, || and ! expressions
3536 static ir_node *create_condition_evaluation(const expression_t *expression,
3537 ir_node *true_block,
3538 ir_node *false_block)
3540 switch(expression->kind) {
3541 case EXPR_UNARY_NOT: {
3542 const unary_expression_t *unary_expression = &expression->unary;
3543 create_condition_evaluation(unary_expression->value, false_block,
3547 case EXPR_BINARY_LOGICAL_AND: {
3548 const binary_expression_t *binary_expression = &expression->binary;
3550 ir_node *extra_block = new_immBlock();
3551 create_condition_evaluation(binary_expression->left, extra_block,
3553 mature_immBlock(extra_block);
3554 set_cur_block(extra_block);
3555 create_condition_evaluation(binary_expression->right, true_block,
3559 case EXPR_BINARY_LOGICAL_OR: {
3560 const binary_expression_t *binary_expression = &expression->binary;
3562 ir_node *extra_block = new_immBlock();
3563 create_condition_evaluation(binary_expression->left, true_block,
3565 mature_immBlock(extra_block);
3566 set_cur_block(extra_block);
3567 create_condition_evaluation(binary_expression->right, true_block,
3575 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3576 ir_node *cond_expr = _expression_to_firm(expression);
3577 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3578 ir_node *cond = new_d_Cond(dbgi, condition);
3579 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3580 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3582 /* set branch prediction info based on __builtin_expect */
3583 if (is_builtin_expect(expression) && is_Cond(cond)) {
3584 call_argument_t *argument = expression->call.arguments->next;
3585 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3586 bool const cnst = fold_constant_to_bool(argument->expression);
3587 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3588 set_Cond_jmp_pred(cond, pred);
3592 add_immBlock_pred(true_block, true_proj);
3593 add_immBlock_pred(false_block, false_proj);
3595 set_unreachable_now();
3599 static void create_variable_entity(entity_t *variable,
3600 declaration_kind_t declaration_kind,
3601 ir_type *parent_type)
3603 assert(variable->kind == ENTITY_VARIABLE);
3604 type_t *type = skip_typeref(variable->declaration.type);
3606 ident *const id = new_id_from_str(variable->base.symbol->string);
3607 ir_type *const irtype = get_ir_type(type);
3608 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3609 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3610 unsigned alignment = variable->declaration.alignment;
3612 set_entity_alignment(irentity, alignment);
3614 handle_decl_modifiers(irentity, variable);
3616 variable->declaration.kind = (unsigned char) declaration_kind;
3617 variable->variable.v.entity = irentity;
3618 set_entity_ld_ident(irentity, create_ld_ident(variable));
3620 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3621 set_entity_volatility(irentity, volatility_is_volatile);
3626 typedef struct type_path_entry_t type_path_entry_t;
3627 struct type_path_entry_t {
3629 ir_initializer_t *initializer;
3631 entity_t *compound_entry;
3634 typedef struct type_path_t type_path_t;
3635 struct type_path_t {
3636 type_path_entry_t *path;
3641 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3643 size_t len = ARR_LEN(path->path);
3645 for (size_t i = 0; i < len; ++i) {
3646 const type_path_entry_t *entry = & path->path[i];
3648 type_t *type = skip_typeref(entry->type);
3649 if (is_type_compound(type)) {
3650 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3651 } else if (is_type_array(type)) {
3652 fprintf(stderr, "[%u]", (unsigned) entry->index);
3654 fprintf(stderr, "-INVALID-");
3657 fprintf(stderr, " (");
3658 print_type(path->top_type);
3659 fprintf(stderr, ")");
3662 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3664 size_t len = ARR_LEN(path->path);
3666 return & path->path[len-1];
3669 static type_path_entry_t *append_to_type_path(type_path_t *path)
3671 size_t len = ARR_LEN(path->path);
3672 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3674 type_path_entry_t *result = & path->path[len];
3675 memset(result, 0, sizeof(result[0]));
3679 static size_t get_compound_member_count(const compound_type_t *type)
3681 compound_t *compound = type->compound;
3682 size_t n_members = 0;
3683 entity_t *member = compound->members.entities;
3684 for ( ; member != NULL; member = member->base.next) {
3691 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3693 type_t *orig_top_type = path->top_type;
3694 type_t *top_type = skip_typeref(orig_top_type);
3696 assert(is_type_compound(top_type) || is_type_array(top_type));
3698 if (ARR_LEN(path->path) == 0) {
3701 type_path_entry_t *top = get_type_path_top(path);
3702 ir_initializer_t *initializer = top->initializer;
3703 return get_initializer_compound_value(initializer, top->index);
3707 static void descend_into_subtype(type_path_t *path)
3709 type_t *orig_top_type = path->top_type;
3710 type_t *top_type = skip_typeref(orig_top_type);
3712 assert(is_type_compound(top_type) || is_type_array(top_type));
3714 ir_initializer_t *initializer = get_initializer_entry(path);
3716 type_path_entry_t *top = append_to_type_path(path);
3717 top->type = top_type;
3721 if (is_type_compound(top_type)) {
3722 compound_t *const compound = top_type->compound.compound;
3723 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3725 top->compound_entry = entry;
3727 len = get_compound_member_count(&top_type->compound);
3728 if (entry != NULL) {
3729 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3730 path->top_type = entry->declaration.type;
3733 assert(is_type_array(top_type));
3734 assert(top_type->array.size > 0);
3737 path->top_type = top_type->array.element_type;
3738 len = top_type->array.size;
3740 if (initializer == NULL
3741 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3742 initializer = create_initializer_compound(len);
3743 /* we have to set the entry at the 2nd latest path entry... */
3744 size_t path_len = ARR_LEN(path->path);
3745 assert(path_len >= 1);
3747 type_path_entry_t *entry = & path->path[path_len-2];
3748 ir_initializer_t *tinitializer = entry->initializer;
3749 set_initializer_compound_value(tinitializer, entry->index,
3753 top->initializer = initializer;
3756 static void ascend_from_subtype(type_path_t *path)
3758 type_path_entry_t *top = get_type_path_top(path);
3760 path->top_type = top->type;
3762 size_t len = ARR_LEN(path->path);
3763 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3766 static void walk_designator(type_path_t *path, const designator_t *designator)
3768 /* designators start at current object type */
3769 ARR_RESIZE(type_path_entry_t, path->path, 1);
3771 for ( ; designator != NULL; designator = designator->next) {
3772 type_path_entry_t *top = get_type_path_top(path);
3773 type_t *orig_type = top->type;
3774 type_t *type = skip_typeref(orig_type);
3776 if (designator->symbol != NULL) {
3777 assert(is_type_compound(type));
3779 symbol_t *symbol = designator->symbol;
3781 compound_t *compound = type->compound.compound;
3782 entity_t *iter = compound->members.entities;
3783 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3784 if (iter->base.symbol == symbol) {
3785 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3789 assert(iter != NULL);
3791 /* revert previous initialisations of other union elements */
3792 if (type->kind == TYPE_COMPOUND_UNION) {
3793 ir_initializer_t *initializer = top->initializer;
3794 if (initializer != NULL
3795 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3796 /* are we writing to a new element? */
3797 ir_initializer_t *oldi
3798 = get_initializer_compound_value(initializer, index);
3799 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3800 /* clear initializer */
3802 = get_initializer_compound_n_entries(initializer);
3803 ir_initializer_t *nulli = get_initializer_null();
3804 for (size_t i = 0; i < len; ++i) {
3805 set_initializer_compound_value(initializer, i,
3812 top->type = orig_type;
3813 top->compound_entry = iter;
3815 orig_type = iter->declaration.type;
3817 expression_t *array_index = designator->array_index;
3818 assert(designator->array_index != NULL);
3819 assert(is_type_array(type));
3821 long index = fold_constant_to_int(array_index);
3824 if (type->array.size_constant) {
3825 long array_size = type->array.size;
3826 assert(index < array_size);
3830 top->type = orig_type;
3831 top->index = (size_t) index;
3832 orig_type = type->array.element_type;
3834 path->top_type = orig_type;
3836 if (designator->next != NULL) {
3837 descend_into_subtype(path);
3841 path->invalid = false;
3844 static void advance_current_object(type_path_t *path)
3846 if (path->invalid) {
3847 /* TODO: handle this... */
3848 panic("invalid initializer in ast2firm (excessive elements)");
3851 type_path_entry_t *top = get_type_path_top(path);
3853 type_t *type = skip_typeref(top->type);
3854 if (is_type_union(type)) {
3855 /* only the first element is initialized in unions */
3856 top->compound_entry = NULL;
3857 } else if (is_type_struct(type)) {
3858 entity_t *entry = top->compound_entry;
3861 entry = skip_unnamed_bitfields(entry->base.next);
3862 top->compound_entry = entry;
3863 if (entry != NULL) {
3864 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3865 path->top_type = entry->declaration.type;
3869 assert(is_type_array(type));
3872 if (!type->array.size_constant || top->index < type->array.size) {
3877 /* we're past the last member of the current sub-aggregate, try if we
3878 * can ascend in the type hierarchy and continue with another subobject */
3879 size_t len = ARR_LEN(path->path);
3882 ascend_from_subtype(path);
3883 advance_current_object(path);
3885 path->invalid = true;
3890 static ir_initializer_t *create_ir_initializer(
3891 const initializer_t *initializer, type_t *type);
3893 static ir_initializer_t *create_ir_initializer_value(
3894 const initializer_value_t *initializer)
3896 if (is_type_compound(initializer->value->base.type)) {
3897 panic("initializer creation for compounds not implemented yet");
3899 type_t *type = initializer->value->base.type;
3900 expression_t *expr = initializer->value;
3901 ir_node *value = expression_to_firm(expr);
3902 ir_mode *mode = get_ir_mode_storage(type);
3903 value = create_conv(NULL, value, mode);
3904 return create_initializer_const(value);
3907 /** test wether type can be initialized by a string constant */
3908 static bool is_string_type(type_t *type)
3911 if (is_type_pointer(type)) {
3912 inner = skip_typeref(type->pointer.points_to);
3913 } else if(is_type_array(type)) {
3914 inner = skip_typeref(type->array.element_type);
3919 return is_type_integer(inner);
3922 static ir_initializer_t *create_ir_initializer_list(
3923 const initializer_list_t *initializer, type_t *type)
3926 memset(&path, 0, sizeof(path));
3927 path.top_type = type;
3928 path.path = NEW_ARR_F(type_path_entry_t, 0);
3930 descend_into_subtype(&path);
3932 for (size_t i = 0; i < initializer->len; ++i) {
3933 const initializer_t *sub_initializer = initializer->initializers[i];
3935 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3936 walk_designator(&path, sub_initializer->designator.designator);
3940 if (sub_initializer->kind == INITIALIZER_VALUE) {
3941 /* we might have to descend into types until we're at a scalar
3944 type_t *orig_top_type = path.top_type;
3945 type_t *top_type = skip_typeref(orig_top_type);
3947 if (is_type_scalar(top_type))
3949 descend_into_subtype(&path);
3951 } else if (sub_initializer->kind == INITIALIZER_STRING
3952 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3953 /* we might have to descend into types until we're at a scalar
3956 type_t *orig_top_type = path.top_type;
3957 type_t *top_type = skip_typeref(orig_top_type);
3959 if (is_string_type(top_type))
3961 descend_into_subtype(&path);
3965 ir_initializer_t *sub_irinitializer
3966 = create_ir_initializer(sub_initializer, path.top_type);
3968 size_t path_len = ARR_LEN(path.path);
3969 assert(path_len >= 1);
3970 type_path_entry_t *entry = & path.path[path_len-1];
3971 ir_initializer_t *tinitializer = entry->initializer;
3972 set_initializer_compound_value(tinitializer, entry->index,
3975 advance_current_object(&path);
3978 assert(ARR_LEN(path.path) >= 1);
3979 ir_initializer_t *result = path.path[0].initializer;
3980 DEL_ARR_F(path.path);
3985 static ir_initializer_t *create_ir_initializer_string(
3986 const initializer_string_t *initializer, type_t *type)
3988 type = skip_typeref(type);
3990 size_t string_len = initializer->string.size;
3991 assert(type->kind == TYPE_ARRAY);
3992 assert(type->array.size_constant);
3993 size_t len = type->array.size;
3994 ir_initializer_t *irinitializer = create_initializer_compound(len);
3996 const char *string = initializer->string.begin;
3997 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
3999 for (size_t i = 0; i < len; ++i) {
4004 ir_tarval *tv = new_tarval_from_long(c, mode);
4005 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4007 set_initializer_compound_value(irinitializer, i, char_initializer);
4010 return irinitializer;
4013 static ir_initializer_t *create_ir_initializer_wide_string(
4014 const initializer_wide_string_t *initializer, type_t *type)
4016 assert(type->kind == TYPE_ARRAY);
4017 assert(type->array.size_constant);
4018 size_t len = type->array.size;
4019 size_t string_len = wstrlen(&initializer->string);
4020 ir_initializer_t *irinitializer = create_initializer_compound(len);
4022 const char *p = initializer->string.begin;
4023 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4025 for (size_t i = 0; i < len; ++i) {
4027 if (i < string_len) {
4028 c = read_utf8_char(&p);
4030 ir_tarval *tv = new_tarval_from_long(c, mode);
4031 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4033 set_initializer_compound_value(irinitializer, i, char_initializer);
4036 return irinitializer;
4039 static ir_initializer_t *create_ir_initializer(
4040 const initializer_t *initializer, type_t *type)
4042 switch(initializer->kind) {
4043 case INITIALIZER_STRING:
4044 return create_ir_initializer_string(&initializer->string, type);
4046 case INITIALIZER_WIDE_STRING:
4047 return create_ir_initializer_wide_string(&initializer->wide_string,
4050 case INITIALIZER_LIST:
4051 return create_ir_initializer_list(&initializer->list, type);
4053 case INITIALIZER_VALUE:
4054 return create_ir_initializer_value(&initializer->value);
4056 case INITIALIZER_DESIGNATOR:
4057 panic("unexpected designator initializer found");
4059 panic("unknown initializer");
4062 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4063 * are elements [...] the remainder of the aggregate shall be initialized
4064 * implicitly the same as objects that have static storage duration. */
4065 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4068 /* for unions we must NOT do anything for null initializers */
4069 ir_type *owner = get_entity_owner(entity);
4070 if (is_Union_type(owner)) {
4074 ir_type *ent_type = get_entity_type(entity);
4075 /* create sub-initializers for a compound type */
4076 if (is_compound_type(ent_type)) {
4077 unsigned n_members = get_compound_n_members(ent_type);
4078 for (unsigned n = 0; n < n_members; ++n) {
4079 ir_entity *member = get_compound_member(ent_type, n);
4080 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4082 create_dynamic_null_initializer(member, dbgi, addr);
4086 if (is_Array_type(ent_type)) {
4087 assert(has_array_upper_bound(ent_type, 0));
4088 long n = get_array_upper_bound_int(ent_type, 0);
4089 for (long i = 0; i < n; ++i) {
4090 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4091 ir_node *cnst = new_d_Const(dbgi, index_tv);
4092 ir_node *in[1] = { cnst };
4093 ir_entity *arrent = get_array_element_entity(ent_type);
4094 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4096 create_dynamic_null_initializer(arrent, dbgi, addr);
4101 ir_mode *value_mode = get_type_mode(ent_type);
4102 ir_node *node = new_Const(get_mode_null(value_mode));
4104 /* is it a bitfield type? */
4105 if (is_Primitive_type(ent_type) &&
4106 get_primitive_base_type(ent_type) != NULL) {
4107 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4111 ir_node *mem = get_store();
4112 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4113 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4117 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4118 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4120 switch(get_initializer_kind(initializer)) {
4121 case IR_INITIALIZER_NULL:
4122 create_dynamic_null_initializer(entity, dbgi, base_addr);
4124 case IR_INITIALIZER_CONST: {
4125 ir_node *node = get_initializer_const_value(initializer);
4126 ir_type *ent_type = get_entity_type(entity);
4128 /* is it a bitfield type? */
4129 if (is_Primitive_type(ent_type) &&
4130 get_primitive_base_type(ent_type) != NULL) {
4131 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4135 assert(get_type_mode(type) == get_irn_mode(node));
4136 ir_node *mem = get_store();
4137 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4138 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4142 case IR_INITIALIZER_TARVAL: {
4143 ir_tarval *tv = get_initializer_tarval_value(initializer);
4144 ir_node *cnst = new_d_Const(dbgi, tv);
4145 ir_type *ent_type = get_entity_type(entity);
4147 /* is it a bitfield type? */
4148 if (is_Primitive_type(ent_type) &&
4149 get_primitive_base_type(ent_type) != NULL) {
4150 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4154 assert(get_type_mode(type) == get_tarval_mode(tv));
4155 ir_node *mem = get_store();
4156 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4157 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4161 case IR_INITIALIZER_COMPOUND: {
4162 assert(is_compound_type(type) || is_Array_type(type));
4164 if (is_Array_type(type)) {
4165 assert(has_array_upper_bound(type, 0));
4166 n_members = get_array_upper_bound_int(type, 0);
4168 n_members = get_compound_n_members(type);
4171 if (get_initializer_compound_n_entries(initializer)
4172 != (unsigned) n_members)
4173 panic("initializer doesn't match compound type");
4175 for (int i = 0; i < n_members; ++i) {
4178 ir_entity *sub_entity;
4179 if (is_Array_type(type)) {
4180 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4181 ir_node *cnst = new_d_Const(dbgi, index_tv);
4182 ir_node *in[1] = { cnst };
4183 irtype = get_array_element_type(type);
4184 sub_entity = get_array_element_entity(type);
4185 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4188 sub_entity = get_compound_member(type, i);
4189 irtype = get_entity_type(sub_entity);
4190 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4194 ir_initializer_t *sub_init
4195 = get_initializer_compound_value(initializer, i);
4197 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4204 panic("invalid IR_INITIALIZER found");
4207 static void create_dynamic_initializer(ir_initializer_t *initializer,
4208 dbg_info *dbgi, ir_entity *entity)
4210 ir_node *frame = get_irg_frame(current_ir_graph);
4211 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4212 ir_type *type = get_entity_type(entity);
4214 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4217 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4218 ir_entity *entity, type_t *type)
4220 ir_node *memory = get_store();
4221 ir_node *nomem = new_NoMem();
4222 ir_node *frame = get_irg_frame(current_ir_graph);
4223 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4225 if (initializer->kind == INITIALIZER_VALUE) {
4226 initializer_value_t *initializer_value = &initializer->value;
4228 ir_node *value = expression_to_firm(initializer_value->value);
4229 type = skip_typeref(type);
4230 assign_value(dbgi, addr, type, value);
4234 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4235 ir_initializer_t *irinitializer
4236 = create_ir_initializer(initializer, type);
4238 create_dynamic_initializer(irinitializer, dbgi, entity);
4242 /* create the ir_initializer */
4243 ir_graph *const old_current_ir_graph = current_ir_graph;
4244 current_ir_graph = get_const_code_irg();
4246 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
4248 assert(current_ir_graph == get_const_code_irg());
4249 current_ir_graph = old_current_ir_graph;
4251 /* create a "template" entity which is copied to the entity on the stack */
4252 ident *const id = id_unique("initializer.%u");
4253 ir_type *const irtype = get_ir_type(type);
4254 ir_type *const global_type = get_glob_type();
4255 ir_entity *const init_entity = new_d_entity(global_type, id, irtype, dbgi);
4256 set_entity_ld_ident(init_entity, id);
4258 set_entity_visibility(init_entity, ir_visibility_private);
4259 add_entity_linkage(init_entity, IR_LINKAGE_CONSTANT);
4261 set_entity_initializer(init_entity, irinitializer);
4263 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4264 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4266 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4267 set_store(copyb_mem);
4270 static void create_initializer_local_variable_entity(entity_t *entity)
4272 assert(entity->kind == ENTITY_VARIABLE);
4273 initializer_t *initializer = entity->variable.initializer;
4274 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4275 ir_entity *irentity = entity->variable.v.entity;
4276 type_t *type = entity->declaration.type;
4278 create_local_initializer(initializer, dbgi, irentity, type);
4281 static void create_variable_initializer(entity_t *entity)
4283 assert(entity->kind == ENTITY_VARIABLE);
4284 initializer_t *initializer = entity->variable.initializer;
4285 if (initializer == NULL)
4288 declaration_kind_t declaration_kind
4289 = (declaration_kind_t) entity->declaration.kind;
4290 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4291 create_initializer_local_variable_entity(entity);
4295 type_t *type = entity->declaration.type;
4296 type_qualifiers_t tq = get_type_qualifier(type, true);
4298 if (initializer->kind == INITIALIZER_VALUE) {
4299 initializer_value_t *initializer_value = &initializer->value;
4300 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4302 ir_node *value = expression_to_firm(initializer_value->value);
4304 type_t *init_type = initializer_value->value->base.type;
4305 ir_mode *mode = get_ir_mode_storage(init_type);
4306 value = create_conv(dbgi, value, mode);
4307 value = do_strict_conv(dbgi, value);
4309 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4310 set_value(entity->variable.v.value_number, value);
4312 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4314 ir_entity *irentity = entity->variable.v.entity;
4316 if (tq & TYPE_QUALIFIER_CONST
4317 && get_entity_owner(irentity) != get_tls_type()) {
4318 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4320 set_atomic_ent_value(irentity, value);
4323 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4324 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4326 ir_entity *irentity = entity->variable.v.entity;
4327 ir_initializer_t *irinitializer
4328 = create_ir_initializer(initializer, type);
4330 if (tq & TYPE_QUALIFIER_CONST) {
4331 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4333 set_entity_initializer(irentity, irinitializer);
4337 static void create_variable_length_array(entity_t *entity)
4339 assert(entity->kind == ENTITY_VARIABLE);
4340 assert(entity->variable.initializer == NULL);
4342 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4343 entity->variable.v.vla_base = NULL;
4345 /* TODO: record VLA somewhere so we create the free node when we leave
4349 static void allocate_variable_length_array(entity_t *entity)
4351 assert(entity->kind == ENTITY_VARIABLE);
4352 assert(entity->variable.initializer == NULL);
4353 assert(currently_reachable());
4355 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4356 type_t *type = entity->declaration.type;
4357 ir_type *el_type = get_ir_type(type->array.element_type);
4359 /* make sure size_node is calculated */
4360 get_type_size_node(type);
4361 ir_node *elems = type->array.size_node;
4362 ir_node *mem = get_store();
4363 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4365 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4366 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4369 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4370 entity->variable.v.vla_base = addr;
4374 * Creates a Firm local variable from a declaration.
4376 static void create_local_variable(entity_t *entity)
4378 assert(entity->kind == ENTITY_VARIABLE);
4379 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4381 bool needs_entity = entity->variable.address_taken;
4382 type_t *type = skip_typeref(entity->declaration.type);
4384 /* is it a variable length array? */
4385 if (is_type_array(type) && !type->array.size_constant) {
4386 create_variable_length_array(entity);
4388 } else if (is_type_array(type) || is_type_compound(type)) {
4389 needs_entity = true;
4390 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4391 needs_entity = true;
4395 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4396 create_variable_entity(entity,
4397 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4400 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4401 entity->variable.v.value_number = next_value_number_function;
4402 set_irg_loc_description(current_ir_graph, next_value_number_function,
4404 ++next_value_number_function;
4408 static void create_local_static_variable(entity_t *entity)
4410 assert(entity->kind == ENTITY_VARIABLE);
4411 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4413 type_t *type = skip_typeref(entity->declaration.type);
4414 ir_type *const var_type = entity->variable.thread_local ?
4415 get_tls_type() : get_glob_type();
4416 ir_type *const irtype = get_ir_type(type);
4417 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4419 size_t l = strlen(entity->base.symbol->string);
4420 char buf[l + sizeof(".%u")];
4421 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4422 ident *const id = id_unique(buf);
4423 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4425 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4426 set_entity_volatility(irentity, volatility_is_volatile);
4429 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4430 entity->variable.v.entity = irentity;
4432 set_entity_ld_ident(irentity, id);
4433 set_entity_visibility(irentity, ir_visibility_local);
4435 ir_graph *const old_current_ir_graph = current_ir_graph;
4436 current_ir_graph = get_const_code_irg();
4438 create_variable_initializer(entity);
4440 assert(current_ir_graph == get_const_code_irg());
4441 current_ir_graph = old_current_ir_graph;
4446 static void return_statement_to_firm(return_statement_t *statement)
4448 if (!currently_reachable())
4451 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4452 type_t *type = current_function_entity->declaration.type;
4453 ir_type *func_irtype = get_ir_type(type);
4457 if (get_method_n_ress(func_irtype) > 0) {
4458 ir_type *res_type = get_method_res_type(func_irtype, 0);
4460 if (statement->value != NULL) {
4461 ir_node *node = expression_to_firm(statement->value);
4462 if (!is_compound_type(res_type)) {
4463 type_t *ret_value_type = statement->value->base.type;
4464 ir_mode *mode = get_ir_mode_storage(ret_value_type);
4465 node = create_conv(dbgi, node, mode);
4466 node = do_strict_conv(dbgi, node);
4471 if (is_compound_type(res_type)) {
4474 mode = get_type_mode(res_type);
4476 in[0] = new_Unknown(mode);
4480 /* build return_value for its side effects */
4481 if (statement->value != NULL) {
4482 expression_to_firm(statement->value);
4487 ir_node *store = get_store();
4488 ir_node *ret = new_d_Return(dbgi, store, in_len, in);
4490 ir_node *end_block = get_irg_end_block(current_ir_graph);
4491 add_immBlock_pred(end_block, ret);
4493 set_unreachable_now();
4496 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4498 if (!currently_reachable())
4501 return expression_to_firm(statement->expression);
4504 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4506 entity_t *entity = compound->scope.entities;
4507 for ( ; entity != NULL; entity = entity->base.next) {
4508 if (!is_declaration(entity))
4511 create_local_declaration(entity);
4514 ir_node *result = NULL;
4515 statement_t *statement = compound->statements;
4516 for ( ; statement != NULL; statement = statement->base.next) {
4517 if (statement->base.next == NULL
4518 && statement->kind == STATEMENT_EXPRESSION) {
4519 result = expression_statement_to_firm(
4520 &statement->expression);
4523 statement_to_firm(statement);
4529 static void create_global_variable(entity_t *entity)
4531 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4532 ir_visibility visibility = ir_visibility_default;
4533 ir_entity *irentity;
4534 assert(entity->kind == ENTITY_VARIABLE);
4536 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4537 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4538 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4539 case STORAGE_CLASS_NONE:
4540 visibility = ir_visibility_default;
4541 /* uninitialized globals get merged in C */
4542 if (entity->variable.initializer == NULL)
4543 linkage |= IR_LINKAGE_MERGE;
4545 case STORAGE_CLASS_TYPEDEF:
4546 case STORAGE_CLASS_AUTO:
4547 case STORAGE_CLASS_REGISTER:
4548 panic("invalid storage class for global var");
4551 ir_type *var_type = get_glob_type();
4552 if (entity->variable.thread_local) {
4553 var_type = get_tls_type();
4554 /* LINKAGE_MERGE not supported by current linkers */
4555 linkage &= ~IR_LINKAGE_MERGE;
4557 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4558 irentity = entity->variable.v.entity;
4559 add_entity_linkage(irentity, linkage);
4560 set_entity_visibility(irentity, visibility);
4563 static void create_local_declaration(entity_t *entity)
4565 assert(is_declaration(entity));
4567 /* construct type */
4568 (void) get_ir_type(entity->declaration.type);
4569 if (entity->base.symbol == NULL) {
4573 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4574 case STORAGE_CLASS_STATIC:
4575 if (entity->kind == ENTITY_FUNCTION) {
4576 (void)get_function_entity(entity, NULL);
4578 create_local_static_variable(entity);
4581 case STORAGE_CLASS_EXTERN:
4582 if (entity->kind == ENTITY_FUNCTION) {
4583 assert(entity->function.statement == NULL);
4584 (void)get_function_entity(entity, NULL);
4586 create_global_variable(entity);
4587 create_variable_initializer(entity);
4590 case STORAGE_CLASS_NONE:
4591 case STORAGE_CLASS_AUTO:
4592 case STORAGE_CLASS_REGISTER:
4593 if (entity->kind == ENTITY_FUNCTION) {
4594 if (entity->function.statement != NULL) {
4595 ir_type *owner = get_irg_frame_type(current_ir_graph);
4596 (void)get_function_entity(entity, owner);
4597 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4598 enqueue_inner_function(entity);
4600 (void)get_function_entity(entity, NULL);
4603 create_local_variable(entity);
4606 case STORAGE_CLASS_TYPEDEF:
4609 panic("invalid storage class found");
4612 static void initialize_local_declaration(entity_t *entity)
4614 if (entity->base.symbol == NULL)
4617 // no need to emit code in dead blocks
4618 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4619 && !currently_reachable())
4622 switch ((declaration_kind_t) entity->declaration.kind) {
4623 case DECLARATION_KIND_LOCAL_VARIABLE:
4624 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4625 create_variable_initializer(entity);
4628 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4629 allocate_variable_length_array(entity);
4632 case DECLARATION_KIND_COMPOUND_MEMBER:
4633 case DECLARATION_KIND_GLOBAL_VARIABLE:
4634 case DECLARATION_KIND_FUNCTION:
4635 case DECLARATION_KIND_INNER_FUNCTION:
4638 case DECLARATION_KIND_PARAMETER:
4639 case DECLARATION_KIND_PARAMETER_ENTITY:
4640 panic("can't initialize parameters");
4642 case DECLARATION_KIND_UNKNOWN:
4643 panic("can't initialize unknown declaration");
4645 panic("invalid declaration kind");
4648 static void declaration_statement_to_firm(declaration_statement_t *statement)
4650 entity_t *entity = statement->declarations_begin;
4654 entity_t *const last = statement->declarations_end;
4655 for ( ;; entity = entity->base.next) {
4656 if (is_declaration(entity)) {
4657 initialize_local_declaration(entity);
4658 } else if (entity->kind == ENTITY_TYPEDEF) {
4659 /* ยง6.7.7:3 Any array size expressions associated with variable length
4660 * array declarators are evaluated each time the declaration of the
4661 * typedef name is reached in the order of execution. */
4662 type_t *const type = skip_typeref(entity->typedefe.type);
4663 if (is_type_array(type) && type->array.is_vla)
4664 get_vla_size(&type->array);
4671 static void if_statement_to_firm(if_statement_t *statement)
4673 /* Create the condition. */
4674 ir_node *true_block = NULL;
4675 ir_node *false_block = NULL;
4676 if (currently_reachable()) {
4677 true_block = new_immBlock();
4678 false_block = new_immBlock();
4679 create_condition_evaluation(statement->condition, true_block, false_block);
4680 mature_immBlock(true_block);
4683 /* Create the false statement.
4684 * Handle false before true, so if no false statement is present, then the
4685 * empty false block is reused as fallthrough block. */
4686 ir_node *fallthrough_block = NULL;
4687 if (statement->false_statement != NULL) {
4688 if (false_block != NULL) {
4689 mature_immBlock(false_block);
4691 set_cur_block(false_block);
4692 statement_to_firm(statement->false_statement);
4693 if (currently_reachable()) {
4694 fallthrough_block = new_immBlock();
4695 add_immBlock_pred(fallthrough_block, new_Jmp());
4698 fallthrough_block = false_block;
4701 /* Create the true statement. */
4702 set_cur_block(true_block);
4703 statement_to_firm(statement->true_statement);
4704 if (currently_reachable()) {
4705 if (fallthrough_block == NULL) {
4706 fallthrough_block = new_immBlock();
4708 add_immBlock_pred(fallthrough_block, new_Jmp());
4711 /* Handle the block after the if-statement. */
4712 if (fallthrough_block != NULL) {
4713 mature_immBlock(fallthrough_block);
4715 set_cur_block(fallthrough_block);
4718 /* Create a jump node which jumps into target_block, if the current block is
4720 static void jump_if_reachable(ir_node *const target_block)
4722 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4723 add_immBlock_pred(target_block, pred);
4726 static void while_statement_to_firm(while_statement_t *statement)
4728 /* Create the header block */
4729 ir_node *const header_block = new_immBlock();
4730 jump_if_reachable(header_block);
4732 /* Create the condition. */
4733 ir_node * body_block;
4734 ir_node * false_block;
4735 expression_t *const cond = statement->condition;
4736 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4737 fold_constant_to_bool(cond)) {
4738 /* Shortcut for while (true). */
4739 body_block = header_block;
4742 keep_alive(header_block);
4743 keep_all_memory(header_block);
4745 body_block = new_immBlock();
4746 false_block = new_immBlock();
4748 set_cur_block(header_block);
4749 create_condition_evaluation(cond, body_block, false_block);
4750 mature_immBlock(body_block);
4753 ir_node *const old_continue_label = continue_label;
4754 ir_node *const old_break_label = break_label;
4755 continue_label = header_block;
4756 break_label = false_block;
4758 /* Create the loop body. */
4759 set_cur_block(body_block);
4760 statement_to_firm(statement->body);
4761 jump_if_reachable(header_block);
4763 mature_immBlock(header_block);
4764 assert(false_block == NULL || false_block == break_label);
4765 false_block = break_label;
4766 if (false_block != NULL) {
4767 mature_immBlock(false_block);
4769 set_cur_block(false_block);
4771 assert(continue_label == header_block);
4772 continue_label = old_continue_label;
4773 break_label = old_break_label;
4776 static ir_node *get_break_label(void)
4778 if (break_label == NULL) {
4779 break_label = new_immBlock();
4784 static void do_while_statement_to_firm(do_while_statement_t *statement)
4786 /* create the header block */
4787 ir_node *header_block = new_immBlock();
4790 ir_node *body_block = new_immBlock();
4791 jump_if_reachable(body_block);
4793 ir_node *old_continue_label = continue_label;
4794 ir_node *old_break_label = break_label;
4795 continue_label = header_block;
4798 set_cur_block(body_block);
4799 statement_to_firm(statement->body);
4800 ir_node *const false_block = get_break_label();
4802 assert(continue_label == header_block);
4803 continue_label = old_continue_label;
4804 break_label = old_break_label;
4806 jump_if_reachable(header_block);
4808 /* create the condition */
4809 mature_immBlock(header_block);
4810 set_cur_block(header_block);
4812 create_condition_evaluation(statement->condition, body_block, false_block);
4813 mature_immBlock(body_block);
4814 mature_immBlock(false_block);
4816 set_cur_block(false_block);
4819 static void for_statement_to_firm(for_statement_t *statement)
4821 /* create declarations */
4822 entity_t *entity = statement->scope.entities;
4823 for ( ; entity != NULL; entity = entity->base.next) {
4824 if (!is_declaration(entity))
4827 create_local_declaration(entity);
4830 if (currently_reachable()) {
4831 entity = statement->scope.entities;
4832 for ( ; entity != NULL; entity = entity->base.next) {
4833 if (!is_declaration(entity))
4836 initialize_local_declaration(entity);
4839 if (statement->initialisation != NULL) {
4840 expression_to_firm(statement->initialisation);
4844 /* Create the header block */
4845 ir_node *const header_block = new_immBlock();
4846 jump_if_reachable(header_block);
4848 /* Create the condition. */
4849 ir_node *body_block;
4850 ir_node *false_block;
4851 if (statement->condition != NULL) {
4852 body_block = new_immBlock();
4853 false_block = new_immBlock();
4855 set_cur_block(header_block);
4856 create_condition_evaluation(statement->condition, body_block, false_block);
4857 mature_immBlock(body_block);
4860 body_block = header_block;
4863 keep_alive(header_block);
4864 keep_all_memory(header_block);
4867 /* Create the step block, if necessary. */
4868 ir_node * step_block = header_block;
4869 expression_t *const step = statement->step;
4871 step_block = new_immBlock();
4874 ir_node *const old_continue_label = continue_label;
4875 ir_node *const old_break_label = break_label;
4876 continue_label = step_block;
4877 break_label = false_block;
4879 /* Create the loop body. */
4880 set_cur_block(body_block);
4881 statement_to_firm(statement->body);
4882 jump_if_reachable(step_block);
4884 /* Create the step code. */
4886 mature_immBlock(step_block);
4887 set_cur_block(step_block);
4888 expression_to_firm(step);
4889 jump_if_reachable(header_block);
4892 mature_immBlock(header_block);
4893 assert(false_block == NULL || false_block == break_label);
4894 false_block = break_label;
4895 if (false_block != NULL) {
4896 mature_immBlock(false_block);
4898 set_cur_block(false_block);
4900 assert(continue_label == step_block);
4901 continue_label = old_continue_label;
4902 break_label = old_break_label;
4905 static void create_jump_statement(const statement_t *statement,
4906 ir_node *target_block)
4908 if (!currently_reachable())
4911 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4912 ir_node *jump = new_d_Jmp(dbgi);
4913 add_immBlock_pred(target_block, jump);
4915 set_unreachable_now();
4918 static void switch_statement_to_firm(switch_statement_t *statement)
4920 ir_node *first_block = NULL;
4921 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4922 ir_node *cond = NULL;
4924 if (currently_reachable()) {
4925 ir_node *expression = expression_to_firm(statement->expression);
4926 cond = new_d_Cond(dbgi, expression);
4927 first_block = get_cur_block();
4930 set_unreachable_now();
4932 ir_node *const old_switch_cond = current_switch_cond;
4933 ir_node *const old_break_label = break_label;
4934 const bool old_saw_default_label = saw_default_label;
4935 saw_default_label = false;
4936 current_switch_cond = cond;
4938 switch_statement_t *const old_switch = current_switch;
4939 current_switch = statement;
4941 /* determine a free number for the default label */
4942 unsigned long num_cases = 0;
4943 long default_proj_nr = 0;
4944 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
4945 if (l->expression == NULL) {
4949 if (l->last_case >= l->first_case)
4950 num_cases += l->last_case - l->first_case + 1;
4951 if (l->last_case > default_proj_nr)
4952 default_proj_nr = l->last_case;
4955 if (default_proj_nr == LONG_MAX) {
4956 /* Bad: an overflow will occur, we cannot be sure that the
4957 * maximum + 1 is a free number. Scan the values a second
4958 * time to find a free number.
4960 unsigned char *bits = xmalloc((num_cases + 7) >> 3);
4962 memset(bits, 0, (num_cases + 7) >> 3);
4963 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
4964 if (l->expression == NULL) {
4968 unsigned long start = l->first_case > 0 ? (unsigned long)l->first_case : 0;
4969 if (start < num_cases && l->last_case >= 0) {
4970 unsigned long end = (unsigned long)l->last_case < num_cases ?
4971 (unsigned long)l->last_case : num_cases - 1;
4972 for (unsigned long cns = start; cns <= end; ++cns) {
4973 bits[cns >> 3] |= (1 << (cns & 7));
4977 /* We look at the first num_cases constants:
4978 * Either they are dense, so we took the last (num_cases)
4979 * one, or they are not dense, so we will find one free
4983 for (i = 0; i < num_cases; ++i)
4984 if ((bits[i >> 3] & (1 << (i & 7))) == 0)
4988 default_proj_nr = i;
4992 statement->default_proj_nr = default_proj_nr;
4993 /* safety check: cond might already be folded to a Bad */
4994 if (cond != NULL && is_Cond(cond)) {
4995 set_Cond_default_proj(cond, default_proj_nr);
4998 statement_to_firm(statement->body);
5000 jump_if_reachable(get_break_label());
5002 if (!saw_default_label && first_block != NULL) {
5003 set_cur_block(first_block);
5004 ir_node *const proj = new_d_Proj(dbgi, cond, mode_X, default_proj_nr);
5005 add_immBlock_pred(get_break_label(), proj);
5008 if (break_label != NULL) {
5009 mature_immBlock(break_label);
5011 set_cur_block(break_label);
5013 assert(current_switch_cond == cond);
5014 current_switch = old_switch;
5015 current_switch_cond = old_switch_cond;
5016 break_label = old_break_label;
5017 saw_default_label = old_saw_default_label;
5020 static void case_label_to_firm(const case_label_statement_t *statement)
5022 if (statement->is_empty_range)
5025 ir_node *block = new_immBlock();
5026 /* Fallthrough from previous case */
5027 jump_if_reachable(block);
5029 if (current_switch_cond != NULL) {
5030 set_cur_block(get_nodes_block(current_switch_cond));
5031 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5032 if (statement->expression != NULL) {
5033 long pn = statement->first_case;
5034 long end_pn = statement->last_case;
5035 assert(pn <= end_pn);
5036 /* create jumps for all cases in the given range */
5038 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X, pn);
5039 add_immBlock_pred(block, proj);
5040 } while (pn++ < end_pn);
5042 saw_default_label = true;
5043 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X,
5044 current_switch->default_proj_nr);
5045 add_immBlock_pred(block, proj);
5049 mature_immBlock(block);
5050 set_cur_block(block);
5052 statement_to_firm(statement->statement);
5055 static void label_to_firm(const label_statement_t *statement)
5057 ir_node *block = get_label_block(statement->label);
5058 jump_if_reachable(block);
5060 set_cur_block(block);
5062 keep_all_memory(block);
5064 statement_to_firm(statement->statement);
5067 static void goto_to_firm(const goto_statement_t *statement)
5069 if (!currently_reachable())
5072 if (statement->expression) {
5073 ir_node *irn = expression_to_firm(statement->expression);
5074 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5075 ir_node *ijmp = new_d_IJmp(dbgi, irn);
5077 set_irn_link(ijmp, ijmp_list);
5080 ir_node *block = get_label_block(statement->label);
5081 ir_node *jmp = new_Jmp();
5082 add_immBlock_pred(block, jmp);
5084 set_unreachable_now();
5087 static void asm_statement_to_firm(const asm_statement_t *statement)
5089 bool needs_memory = false;
5091 if (statement->is_volatile) {
5092 needs_memory = true;
5095 size_t n_clobbers = 0;
5096 asm_clobber_t *clobber = statement->clobbers;
5097 for ( ; clobber != NULL; clobber = clobber->next) {
5098 const char *clobber_str = clobber->clobber.begin;
5100 if (!be_is_valid_clobber(clobber_str)) {
5101 errorf(&statement->base.source_position,
5102 "invalid clobber '%s' specified", clobber->clobber);
5106 if (streq(clobber_str, "memory")) {
5107 needs_memory = true;
5111 ident *id = new_id_from_str(clobber_str);
5112 obstack_ptr_grow(&asm_obst, id);
5115 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5116 ident **clobbers = NULL;
5117 if (n_clobbers > 0) {
5118 clobbers = obstack_finish(&asm_obst);
5121 size_t n_inputs = 0;
5122 asm_argument_t *argument = statement->inputs;
5123 for ( ; argument != NULL; argument = argument->next)
5125 size_t n_outputs = 0;
5126 argument = statement->outputs;
5127 for ( ; argument != NULL; argument = argument->next)
5130 unsigned next_pos = 0;
5132 ir_node *ins[n_inputs + n_outputs + 1];
5135 ir_asm_constraint tmp_in_constraints[n_outputs];
5137 const expression_t *out_exprs[n_outputs];
5138 ir_node *out_addrs[n_outputs];
5139 size_t out_size = 0;
5141 argument = statement->outputs;
5142 for ( ; argument != NULL; argument = argument->next) {
5143 const char *constraints = argument->constraints.begin;
5144 asm_constraint_flags_t asm_flags
5145 = be_parse_asm_constraints(constraints);
5148 source_position_t const *const pos = &statement->base.source_position;
5149 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5150 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5152 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5153 errorf(pos, "some constraints in '%s' are invalid", constraints);
5156 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5157 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5162 unsigned pos = next_pos++;
5163 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5164 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5165 expression_t *expr = argument->expression;
5166 ir_node *addr = expression_to_addr(expr);
5167 /* in+output, construct an artifical same_as constraint on the
5169 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5171 ir_node *value = get_value_from_lvalue(expr, addr);
5173 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5175 ir_asm_constraint constraint;
5176 constraint.pos = pos;
5177 constraint.constraint = new_id_from_str(buf);
5178 constraint.mode = get_ir_mode_storage(expr->base.type);
5179 tmp_in_constraints[in_size] = constraint;
5180 ins[in_size] = value;
5185 out_exprs[out_size] = expr;
5186 out_addrs[out_size] = addr;
5188 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5189 /* pure memory ops need no input (but we have to make sure we
5190 * attach to the memory) */
5191 assert(! (asm_flags &
5192 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5193 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5194 needs_memory = true;
5196 /* we need to attach the address to the inputs */
5197 expression_t *expr = argument->expression;
5199 ir_asm_constraint constraint;
5200 constraint.pos = pos;
5201 constraint.constraint = new_id_from_str(constraints);
5202 constraint.mode = NULL;
5203 tmp_in_constraints[in_size] = constraint;
5205 ins[in_size] = expression_to_addr(expr);
5209 errorf(&statement->base.source_position,
5210 "only modifiers but no place set in constraints '%s'",
5215 ir_asm_constraint constraint;
5216 constraint.pos = pos;
5217 constraint.constraint = new_id_from_str(constraints);
5218 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5220 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5222 assert(obstack_object_size(&asm_obst)
5223 == out_size * sizeof(ir_asm_constraint));
5224 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5227 obstack_grow(&asm_obst, tmp_in_constraints,
5228 in_size * sizeof(tmp_in_constraints[0]));
5229 /* find and count input and output arguments */
5230 argument = statement->inputs;
5231 for ( ; argument != NULL; argument = argument->next) {
5232 const char *constraints = argument->constraints.begin;
5233 asm_constraint_flags_t asm_flags
5234 = be_parse_asm_constraints(constraints);
5236 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5237 errorf(&statement->base.source_position,
5238 "some constraints in '%s' are not supported", constraints);
5241 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5242 errorf(&statement->base.source_position,
5243 "some constraints in '%s' are invalid", constraints);
5246 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5247 errorf(&statement->base.source_position,
5248 "write flag specified for input constraints '%s'",
5254 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5255 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5256 /* we can treat this as "normal" input */
5257 input = expression_to_firm(argument->expression);
5258 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5259 /* pure memory ops need no input (but we have to make sure we
5260 * attach to the memory) */
5261 assert(! (asm_flags &
5262 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5263 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5264 needs_memory = true;
5265 input = expression_to_addr(argument->expression);
5267 errorf(&statement->base.source_position,
5268 "only modifiers but no place set in constraints '%s'",
5273 ir_asm_constraint constraint;
5274 constraint.pos = next_pos++;
5275 constraint.constraint = new_id_from_str(constraints);
5276 constraint.mode = get_irn_mode(input);
5278 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5279 ins[in_size++] = input;
5283 ir_asm_constraint constraint;
5284 constraint.pos = next_pos++;
5285 constraint.constraint = new_id_from_str("");
5286 constraint.mode = mode_M;
5288 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5289 ins[in_size++] = get_store();
5292 assert(obstack_object_size(&asm_obst)
5293 == in_size * sizeof(ir_asm_constraint));
5294 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5296 /* create asm node */
5297 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5299 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5301 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5302 out_size, output_constraints,
5303 n_clobbers, clobbers, asm_text);
5305 if (statement->is_volatile) {
5306 set_irn_pinned(node, op_pin_state_pinned);
5308 set_irn_pinned(node, op_pin_state_floats);
5311 /* create output projs & connect them */
5313 ir_node *projm = new_Proj(node, mode_M, out_size);
5318 for (i = 0; i < out_size; ++i) {
5319 const expression_t *out_expr = out_exprs[i];
5321 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5322 ir_node *proj = new_Proj(node, mode, pn);
5323 ir_node *addr = out_addrs[i];
5325 set_value_for_expression_addr(out_expr, proj, addr);
5329 static void ms_try_statement_to_firm(ms_try_statement_t *statement)
5331 statement_to_firm(statement->try_statement);
5332 source_position_t const *const pos = &statement->base.source_position;
5333 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5336 static void leave_statement_to_firm(leave_statement_t *statement)
5338 errorf(&statement->base.source_position, "__leave not supported yet");
5342 * Transform a statement.
5344 static void statement_to_firm(statement_t *statement)
5347 assert(!statement->base.transformed);
5348 statement->base.transformed = true;
5351 switch (statement->kind) {
5352 case STATEMENT_ERROR:
5353 panic("error statement found");
5354 case STATEMENT_EMPTY:
5357 case STATEMENT_COMPOUND:
5358 compound_statement_to_firm(&statement->compound);
5360 case STATEMENT_RETURN:
5361 return_statement_to_firm(&statement->returns);
5363 case STATEMENT_EXPRESSION:
5364 expression_statement_to_firm(&statement->expression);
5367 if_statement_to_firm(&statement->ifs);
5369 case STATEMENT_WHILE:
5370 while_statement_to_firm(&statement->whiles);
5372 case STATEMENT_DO_WHILE:
5373 do_while_statement_to_firm(&statement->do_while);
5375 case STATEMENT_DECLARATION:
5376 declaration_statement_to_firm(&statement->declaration);
5378 case STATEMENT_BREAK:
5379 create_jump_statement(statement, get_break_label());
5381 case STATEMENT_CONTINUE:
5382 create_jump_statement(statement, continue_label);
5384 case STATEMENT_SWITCH:
5385 switch_statement_to_firm(&statement->switchs);
5387 case STATEMENT_CASE_LABEL:
5388 case_label_to_firm(&statement->case_label);
5391 for_statement_to_firm(&statement->fors);
5393 case STATEMENT_LABEL:
5394 label_to_firm(&statement->label);
5396 case STATEMENT_GOTO:
5397 goto_to_firm(&statement->gotos);
5400 asm_statement_to_firm(&statement->asms);
5402 case STATEMENT_MS_TRY:
5403 ms_try_statement_to_firm(&statement->ms_try);
5405 case STATEMENT_LEAVE:
5406 leave_statement_to_firm(&statement->leave);
5409 panic("statement not implemented");
5412 static int count_local_variables(const entity_t *entity,
5413 const entity_t *const last)
5416 entity_t const *const end = last != NULL ? last->base.next : NULL;
5417 for (; entity != end; entity = entity->base.next) {
5421 if (entity->kind == ENTITY_VARIABLE) {
5422 type = skip_typeref(entity->declaration.type);
5423 address_taken = entity->variable.address_taken;
5424 } else if (entity->kind == ENTITY_PARAMETER) {
5425 type = skip_typeref(entity->declaration.type);
5426 address_taken = entity->parameter.address_taken;
5431 if (!address_taken && is_type_scalar(type))
5437 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5439 int *const count = env;
5441 switch (stmt->kind) {
5442 case STATEMENT_DECLARATION: {
5443 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5444 *count += count_local_variables(decl_stmt->declarations_begin,
5445 decl_stmt->declarations_end);
5450 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5459 * Return the number of local (alias free) variables used by a function.
5461 static int get_function_n_local_vars(entity_t *entity)
5463 const function_t *function = &entity->function;
5466 /* count parameters */
5467 count += count_local_variables(function->parameters.entities, NULL);
5469 /* count local variables declared in body */
5470 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5475 * Build Firm code for the parameters of a function.
5477 static void initialize_function_parameters(entity_t *entity)
5479 assert(entity->kind == ENTITY_FUNCTION);
5480 ir_graph *irg = current_ir_graph;
5481 ir_node *args = get_irg_args(irg);
5483 ir_type *function_irtype;
5485 if (entity->function.need_closure) {
5486 /* add an extra parameter for the static link */
5487 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5490 /* Matze: IMO this is wrong, nested functions should have an own
5491 * type and not rely on strange parameters... */
5492 function_irtype = create_method_type(&entity->declaration.type->function, true);
5494 function_irtype = get_ir_type(entity->declaration.type);
5499 entity_t *parameter = entity->function.parameters.entities;
5500 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5501 if (parameter->kind != ENTITY_PARAMETER)
5504 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5505 type_t *type = skip_typeref(parameter->declaration.type);
5507 bool needs_entity = parameter->parameter.address_taken;
5508 assert(!is_type_array(type));
5509 if (is_type_compound(type)) {
5510 needs_entity = true;
5513 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5515 ir_type *frame_type = get_irg_frame_type(irg);
5517 = new_parameter_entity(frame_type, n, param_irtype);
5518 parameter->declaration.kind
5519 = DECLARATION_KIND_PARAMETER_ENTITY;
5520 parameter->parameter.v.entity = param;
5524 ir_mode *param_mode = get_type_mode(param_irtype);
5526 ir_node *value = new_r_Proj(args, param_mode, pn);
5528 ir_mode *mode = get_ir_mode_storage(type);
5529 value = create_conv(NULL, value, mode);
5530 value = do_strict_conv(NULL, value);
5532 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5533 parameter->parameter.v.value_number = next_value_number_function;
5534 set_irg_loc_description(current_ir_graph, next_value_number_function,
5536 ++next_value_number_function;
5538 set_value(parameter->parameter.v.value_number, value);
5543 * Handle additional decl modifiers for IR-graphs
5545 * @param irg the IR-graph
5546 * @param dec_modifiers additional modifiers
5548 static void handle_decl_modifier_irg(ir_graph_ptr irg,
5549 decl_modifiers_t decl_modifiers)
5551 if (decl_modifiers & DM_NAKED) {
5552 /* TRUE if the declaration includes the Microsoft
5553 __declspec(naked) specifier. */
5554 add_irg_additional_properties(irg, mtp_property_naked);
5556 if (decl_modifiers & DM_FORCEINLINE) {
5557 /* TRUE if the declaration includes the
5558 Microsoft __forceinline specifier. */
5559 set_irg_inline_property(irg, irg_inline_forced);
5561 if (decl_modifiers & DM_NOINLINE) {
5562 /* TRUE if the declaration includes the Microsoft
5563 __declspec(noinline) specifier. */
5564 set_irg_inline_property(irg, irg_inline_forbidden);
5568 static void add_function_pointer(ir_type *segment, ir_entity *method,
5569 const char *unique_template)
5571 ir_type *method_type = get_entity_type(method);
5572 ir_type *ptr_type = new_type_pointer(method_type);
5574 /* these entities don't really have a name but firm only allows
5576 * Note that we mustn't give these entities a name since for example
5577 * Mach-O doesn't allow them. */
5578 ident *ide = id_unique(unique_template);
5579 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5580 ir_graph *irg = get_const_code_irg();
5581 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5584 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5585 set_entity_compiler_generated(ptr, 1);
5586 set_entity_visibility(ptr, ir_visibility_private);
5587 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5588 set_atomic_ent_value(ptr, val);
5592 * Generate possible IJmp branches to a given label block.
5594 static void gen_ijmp_branches(ir_node *block)
5597 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5598 add_immBlock_pred(block, ijmp);
5603 * Create code for a function and all inner functions.
5605 * @param entity the function entity
5607 static void create_function(entity_t *entity)
5609 assert(entity->kind == ENTITY_FUNCTION);
5610 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5612 if (entity->function.statement == NULL)
5615 inner_functions = NULL;
5616 current_trampolines = NULL;
5618 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5619 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5620 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5622 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5623 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5624 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5627 current_function_entity = entity;
5628 current_function_name = NULL;
5629 current_funcsig = NULL;
5631 assert(all_labels == NULL);
5632 all_labels = NEW_ARR_F(label_t *, 0);
5635 int n_local_vars = get_function_n_local_vars(entity);
5636 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5637 current_ir_graph = irg;
5639 ir_graph *old_current_function = current_function;
5640 current_function = irg;
5642 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5643 current_vararg_entity = NULL;
5645 set_irg_fp_model(irg, firm_fp_model);
5646 tarval_enable_fp_ops(1);
5647 set_irn_dbg_info(get_irg_start_block(irg),
5648 get_entity_dbg_info(function_entity));
5650 ir_node *first_block = get_cur_block();
5652 /* set inline flags */
5653 if (entity->function.is_inline)
5654 set_irg_inline_property(irg, irg_inline_recomended);
5655 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5657 next_value_number_function = 0;
5658 initialize_function_parameters(entity);
5659 current_static_link = entity->function.static_link;
5661 statement_to_firm(entity->function.statement);
5663 ir_node *end_block = get_irg_end_block(irg);
5665 /* do we have a return statement yet? */
5666 if (currently_reachable()) {
5667 type_t *type = skip_typeref(entity->declaration.type);
5668 assert(is_type_function(type));
5669 const function_type_t *func_type = &type->function;
5670 const type_t *return_type
5671 = skip_typeref(func_type->return_type);
5674 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5675 ret = new_Return(get_store(), 0, NULL);
5678 if (is_type_scalar(return_type)) {
5679 mode = get_ir_mode_storage(func_type->return_type);
5685 /* ยง5.1.2.2.3 main implicitly returns 0 */
5686 if (is_main(entity)) {
5687 in[0] = new_Const(get_mode_null(mode));
5689 in[0] = new_Unknown(mode);
5691 ret = new_Return(get_store(), 1, in);
5693 add_immBlock_pred(end_block, ret);
5696 bool has_computed_gotos = false;
5697 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5698 label_t *label = all_labels[i];
5699 if (label->address_taken) {
5700 gen_ijmp_branches(label->block);
5701 has_computed_gotos = true;
5703 mature_immBlock(label->block);
5705 if (has_computed_gotos) {
5706 /* if we have computed goto's in the function, we cannot inline it */
5707 if (get_irg_inline_property(irg) >= irg_inline_recomended) {
5708 source_position_t const *const pos = &entity->base.source_position;
5709 warningf(WARN_OTHER, pos, "'%N' can never be inlined because it contains a computed goto", entity);
5711 set_irg_inline_property(irg, irg_inline_forbidden);
5714 DEL_ARR_F(all_labels);
5717 mature_immBlock(first_block);
5718 mature_immBlock(end_block);
5720 irg_finalize_cons(irg);
5722 /* finalize the frame type */
5723 ir_type *frame_type = get_irg_frame_type(irg);
5724 int n = get_compound_n_members(frame_type);
5727 for (int i = 0; i < n; ++i) {
5728 ir_entity *member = get_compound_member(frame_type, i);
5729 ir_type *entity_type = get_entity_type(member);
5731 int align = get_type_alignment_bytes(entity_type);
5732 if (align > align_all)
5736 misalign = offset % align;
5738 offset += align - misalign;
5742 set_entity_offset(member, offset);
5743 offset += get_type_size_bytes(entity_type);
5745 set_type_size_bytes(frame_type, offset);
5746 set_type_alignment_bytes(frame_type, align_all);
5748 irg_verify(irg, VERIFY_ENFORCE_SSA);
5749 current_vararg_entity = old_current_vararg_entity;
5750 current_function = old_current_function;
5752 if (current_trampolines != NULL) {
5753 DEL_ARR_F(current_trampolines);
5754 current_trampolines = NULL;
5757 /* create inner functions if any */
5758 entity_t **inner = inner_functions;
5759 if (inner != NULL) {
5760 ir_type *rem_outer_frame = current_outer_frame;
5761 current_outer_frame = get_irg_frame_type(current_ir_graph);
5762 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5763 create_function(inner[i]);
5767 current_outer_frame = rem_outer_frame;
5771 static void scope_to_firm(scope_t *scope)
5773 /* first pass: create declarations */
5774 entity_t *entity = scope->entities;
5775 for ( ; entity != NULL; entity = entity->base.next) {
5776 if (entity->base.symbol == NULL)
5779 if (entity->kind == ENTITY_FUNCTION) {
5780 if (entity->function.btk != BUILTIN_NONE) {
5781 /* builtins have no representation */
5784 (void)get_function_entity(entity, NULL);
5785 } else if (entity->kind == ENTITY_VARIABLE) {
5786 create_global_variable(entity);
5787 } else if (entity->kind == ENTITY_NAMESPACE) {
5788 scope_to_firm(&entity->namespacee.members);
5792 /* second pass: create code/initializers */
5793 entity = scope->entities;
5794 for ( ; entity != NULL; entity = entity->base.next) {
5795 if (entity->base.symbol == NULL)
5798 if (entity->kind == ENTITY_FUNCTION) {
5799 if (entity->function.btk != BUILTIN_NONE) {
5800 /* builtins have no representation */
5803 create_function(entity);
5804 } else if (entity->kind == ENTITY_VARIABLE) {
5805 assert(entity->declaration.kind
5806 == DECLARATION_KIND_GLOBAL_VARIABLE);
5807 current_ir_graph = get_const_code_irg();
5808 create_variable_initializer(entity);
5813 void init_ast2firm(void)
5815 obstack_init(&asm_obst);
5816 init_atomic_modes();
5818 ir_set_debug_retrieve(dbg_retrieve);
5819 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5821 /* create idents for all known runtime functions */
5822 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5823 rts_idents[i] = new_id_from_str(rts_data[i].name);
5826 entitymap_init(&entitymap);
5829 static void init_ir_types(void)
5831 static int ir_types_initialized = 0;
5832 if (ir_types_initialized)
5834 ir_types_initialized = 1;
5836 ir_type_int = get_ir_type(type_int);
5837 ir_type_char = get_ir_type(type_char);
5838 ir_type_const_char = get_ir_type(type_const_char);
5839 ir_type_wchar_t = get_ir_type(type_wchar_t);
5840 ir_type_void = get_ir_type(type_void);
5842 be_params = be_get_backend_param();
5843 mode_float_arithmetic = be_params->mode_float_arithmetic;
5845 stack_param_align = be_params->stack_param_align;
5848 void exit_ast2firm(void)
5850 entitymap_destroy(&entitymap);
5851 obstack_free(&asm_obst, NULL);
5854 static void global_asm_to_firm(statement_t *s)
5856 for (; s != NULL; s = s->base.next) {
5857 assert(s->kind == STATEMENT_ASM);
5859 char const *const text = s->asms.asm_text.begin;
5860 size_t size = s->asms.asm_text.size;
5862 /* skip the last \0 */
5863 if (text[size - 1] == '\0')
5866 ident *const id = new_id_from_chars(text, size);
5871 void translation_unit_to_firm(translation_unit_t *unit)
5873 /* initialize firm arithmetic */
5874 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5875 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5877 /* just to be sure */
5878 continue_label = NULL;
5880 current_switch_cond = NULL;
5881 current_translation_unit = unit;
5885 scope_to_firm(&unit->scope);
5886 global_asm_to_firm(unit->global_asm);
5888 current_ir_graph = NULL;
5889 current_translation_unit = NULL;