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 ir_type *create_enum_type(enum_type_t *const type)
658 type->base.base.firm_type = ir_type_int;
660 ir_mode *const mode = mode_int;
661 ir_tarval *const one = get_mode_one(mode);
662 ir_tarval * tv_next = get_mode_null(mode);
664 bool constant_folding_old = constant_folding;
665 constant_folding = true;
667 enum_t *enume = type->enume;
668 entity_t *entry = enume->base.next;
669 for (; entry != NULL; entry = entry->base.next) {
670 if (entry->kind != ENTITY_ENUM_VALUE)
673 expression_t *const init = entry->enum_value.value;
675 ir_node *const cnst = expression_to_firm(init);
676 if (!is_Const(cnst)) {
677 panic("couldn't fold constant");
679 tv_next = get_Const_tarval(cnst);
681 entry->enum_value.tv = tv_next;
682 tv_next = tarval_add(tv_next, one);
685 constant_folding = constant_folding_old;
687 return create_atomic_type(type->base.akind, (const type_t*) type);
690 static ir_type *get_ir_type_incomplete(type_t *type)
692 assert(type != NULL);
693 type = skip_typeref(type);
695 if (type->base.firm_type != NULL) {
696 assert(type->base.firm_type != INVALID_TYPE);
697 return type->base.firm_type;
700 switch (type->kind) {
701 case TYPE_COMPOUND_STRUCT:
702 return create_compound_type(&type->compound, true, COMPOUND_IS_STRUCT);
703 case TYPE_COMPOUND_UNION:
704 return create_compound_type(&type->compound, true, COMPOUND_IS_UNION);
706 return get_ir_type(type);
710 ir_type *get_ir_type(type_t *type)
712 assert(type != NULL);
714 type = skip_typeref(type);
716 if (type->base.firm_type != NULL) {
717 assert(type->base.firm_type != INVALID_TYPE);
718 return type->base.firm_type;
721 ir_type *firm_type = NULL;
722 switch (type->kind) {
724 /* Happens while constant folding, when there was an error */
725 return create_atomic_type(ATOMIC_TYPE_VOID, NULL);
728 firm_type = create_atomic_type(type->atomic.akind, type);
731 firm_type = create_complex_type(&type->atomic);
734 firm_type = create_imaginary_type(&type->atomic);
737 firm_type = create_method_type(&type->function, false);
740 firm_type = create_pointer_type(&type->pointer);
743 firm_type = create_reference_type(&type->reference);
746 firm_type = create_array_type(&type->array);
748 case TYPE_COMPOUND_STRUCT:
749 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_STRUCT);
751 case TYPE_COMPOUND_UNION:
752 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_UNION);
755 firm_type = create_enum_type(&type->enumt);
762 if (firm_type == NULL)
763 panic("unknown type found");
765 type->base.firm_type = firm_type;
769 static ir_mode *get_ir_mode_storage(type_t *type)
771 ir_type *irtype = get_ir_type(type);
773 /* firm doesn't report a mode for arrays somehow... */
774 if (is_Array_type(irtype)) {
778 ir_mode *mode = get_type_mode(irtype);
779 assert(mode != NULL);
784 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
785 * int that it returns bigger modes for floating point on some platforms
786 * (x87 internally does arithemtic with 80bits)
788 static ir_mode *get_ir_mode_arithmetic(type_t *type)
790 ir_mode *mode = get_ir_mode_storage(type);
791 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
792 return mode_float_arithmetic;
798 /** Names of the runtime functions. */
799 static const struct {
800 int id; /**< the rts id */
801 int n_res; /**< number of return values */
802 const char *name; /**< the name of the rts function */
803 int n_params; /**< number of parameters */
804 unsigned flags; /**< language flags */
806 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
807 { rts_abort, 0, "abort", 0, _C89 },
808 { rts_alloca, 1, "alloca", 1, _ALL },
809 { rts_abs, 1, "abs", 1, _C89 },
810 { rts_labs, 1, "labs", 1, _C89 },
811 { rts_llabs, 1, "llabs", 1, _C99 },
812 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
814 { rts_fabs, 1, "fabs", 1, _C89 },
815 { rts_sqrt, 1, "sqrt", 1, _C89 },
816 { rts_cbrt, 1, "cbrt", 1, _C99 },
817 { rts_exp, 1, "exp", 1, _C89 },
818 { rts_exp2, 1, "exp2", 1, _C89 },
819 { rts_exp10, 1, "exp10", 1, _GNUC },
820 { rts_log, 1, "log", 1, _C89 },
821 { rts_log2, 1, "log2", 1, _C89 },
822 { rts_log10, 1, "log10", 1, _C89 },
823 { rts_pow, 1, "pow", 2, _C89 },
824 { rts_sin, 1, "sin", 1, _C89 },
825 { rts_cos, 1, "cos", 1, _C89 },
826 { rts_tan, 1, "tan", 1, _C89 },
827 { rts_asin, 1, "asin", 1, _C89 },
828 { rts_acos, 1, "acos", 1, _C89 },
829 { rts_atan, 1, "atan", 1, _C89 },
830 { rts_sinh, 1, "sinh", 1, _C89 },
831 { rts_cosh, 1, "cosh", 1, _C89 },
832 { rts_tanh, 1, "tanh", 1, _C89 },
834 { rts_fabsf, 1, "fabsf", 1, _C99 },
835 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
836 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
837 { rts_expf, 1, "expf", 1, _C99 },
838 { rts_exp2f, 1, "exp2f", 1, _C99 },
839 { rts_exp10f, 1, "exp10f", 1, _GNUC },
840 { rts_logf, 1, "logf", 1, _C99 },
841 { rts_log2f, 1, "log2f", 1, _C99 },
842 { rts_log10f, 1, "log10f", 1, _C99 },
843 { rts_powf, 1, "powf", 2, _C99 },
844 { rts_sinf, 1, "sinf", 1, _C99 },
845 { rts_cosf, 1, "cosf", 1, _C99 },
846 { rts_tanf, 1, "tanf", 1, _C99 },
847 { rts_asinf, 1, "asinf", 1, _C99 },
848 { rts_acosf, 1, "acosf", 1, _C99 },
849 { rts_atanf, 1, "atanf", 1, _C99 },
850 { rts_sinhf, 1, "sinhf", 1, _C99 },
851 { rts_coshf, 1, "coshf", 1, _C99 },
852 { rts_tanhf, 1, "tanhf", 1, _C99 },
854 { rts_fabsl, 1, "fabsl", 1, _C99 },
855 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
856 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
857 { rts_expl, 1, "expl", 1, _C99 },
858 { rts_exp2l, 1, "exp2l", 1, _C99 },
859 { rts_exp10l, 1, "exp10l", 1, _GNUC },
860 { rts_logl, 1, "logl", 1, _C99 },
861 { rts_log2l, 1, "log2l", 1, _C99 },
862 { rts_log10l, 1, "log10l", 1, _C99 },
863 { rts_powl, 1, "powl", 2, _C99 },
864 { rts_sinl, 1, "sinl", 1, _C99 },
865 { rts_cosl, 1, "cosl", 1, _C99 },
866 { rts_tanl, 1, "tanl", 1, _C99 },
867 { rts_asinl, 1, "asinl", 1, _C99 },
868 { rts_acosl, 1, "acosl", 1, _C99 },
869 { rts_atanl, 1, "atanl", 1, _C99 },
870 { rts_sinhl, 1, "sinhl", 1, _C99 },
871 { rts_coshl, 1, "coshl", 1, _C99 },
872 { rts_tanhl, 1, "tanhl", 1, _C99 },
874 { rts_strcmp, 1, "strcmp", 2, _C89 },
875 { rts_strncmp, 1, "strncmp", 3, _C89 },
876 { rts_strcpy, 1, "strcpy", 2, _C89 },
877 { rts_strlen, 1, "strlen", 1, _C89 },
878 { rts_memcpy, 1, "memcpy", 3, _C89 },
879 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
880 { rts_memmove, 1, "memmove", 3, _C89 },
881 { rts_memset, 1, "memset", 3, _C89 },
882 { rts_memcmp, 1, "memcmp", 3, _C89 },
885 static ident *rts_idents[lengthof(rts_data)];
887 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
889 void set_create_ld_ident(ident *(*func)(entity_t*))
891 create_ld_ident = func;
895 * Handle GNU attributes for entities
897 * @param ent the entity
898 * @param decl the routine declaration
900 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
902 assert(is_declaration(entity));
903 decl_modifiers_t modifiers = entity->declaration.modifiers;
905 if (is_method_entity(irentity)) {
906 if (modifiers & DM_PURE) {
907 set_entity_additional_properties(irentity, mtp_property_pure);
909 if (modifiers & DM_CONST) {
910 add_entity_additional_properties(irentity, mtp_property_const);
913 if (modifiers & DM_USED) {
914 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
916 if (modifiers & DM_WEAK) {
917 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
921 static bool is_main(entity_t *entity)
923 static symbol_t *sym_main = NULL;
924 if (sym_main == NULL) {
925 sym_main = symbol_table_insert("main");
928 if (entity->base.symbol != sym_main)
930 /* must be in outermost scope */
931 if (entity->base.parent_scope != ¤t_translation_unit->scope)
938 * Creates an entity representing a function.
940 * @param entity the function declaration/definition
941 * @param owner_type the owner type of this function, NULL
942 * for global functions
944 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
946 assert(entity->kind == ENTITY_FUNCTION);
947 if (entity->function.irentity != NULL)
948 return entity->function.irentity;
950 switch (entity->function.btk) {
953 case BUILTIN_LIBC_CHECK:
959 if (is_main(entity)) {
960 /* force main to C linkage */
961 type_t *type = entity->declaration.type;
962 assert(is_type_function(type));
963 if (type->function.linkage != LINKAGE_C) {
964 type_t *new_type = duplicate_type(type);
965 new_type->function.linkage = LINKAGE_C;
966 type = identify_new_type(new_type);
967 entity->declaration.type = type;
971 symbol_t *symbol = entity->base.symbol;
972 ident *id = new_id_from_str(symbol->string);
974 /* already an entity defined? */
975 ir_entity *irentity = entitymap_get(&entitymap, symbol);
976 bool const has_body = entity->function.statement != NULL;
977 if (irentity != NULL) {
978 if (get_entity_visibility(irentity) == ir_visibility_external
980 set_entity_visibility(irentity, ir_visibility_default);
985 ir_type *ir_type_method;
986 if (entity->function.need_closure)
987 ir_type_method = create_method_type(&entity->declaration.type->function, true);
989 ir_type_method = get_ir_type(entity->declaration.type);
991 bool nested_function = false;
992 if (owner_type == NULL)
993 owner_type = get_glob_type();
995 nested_function = true;
997 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
998 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
1001 if (nested_function)
1002 ld_id = id_unique("inner.%u");
1004 ld_id = create_ld_ident(entity);
1005 set_entity_ld_ident(irentity, ld_id);
1007 handle_decl_modifiers(irentity, entity);
1009 if (! nested_function) {
1010 /* static inline => local
1011 * extern inline => local
1012 * inline without definition => local
1013 * inline with definition => external_visible */
1014 storage_class_tag_t const storage_class
1015 = (storage_class_tag_t) entity->declaration.storage_class;
1016 bool const is_inline = entity->function.is_inline;
1018 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
1019 set_entity_visibility(irentity, ir_visibility_default);
1020 } else if (storage_class == STORAGE_CLASS_STATIC ||
1021 (is_inline && has_body)) {
1022 set_entity_visibility(irentity, ir_visibility_local);
1023 } else if (has_body) {
1024 set_entity_visibility(irentity, ir_visibility_default);
1026 set_entity_visibility(irentity, ir_visibility_external);
1029 /* nested functions are always local */
1030 set_entity_visibility(irentity, ir_visibility_local);
1033 /* We should check for file scope here, but as long as we compile C only
1034 this is not needed. */
1035 if (!freestanding && !has_body) {
1036 /* check for a known runtime function */
1037 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1038 if (id != rts_idents[i])
1041 function_type_t *function_type
1042 = &entity->declaration.type->function;
1043 /* rts_entities code can't handle a "wrong" number of parameters */
1044 if (function_type->unspecified_parameters)
1047 /* check number of parameters */
1048 int n_params = count_parameters(function_type);
1049 if (n_params != rts_data[i].n_params)
1052 type_t *return_type = skip_typeref(function_type->return_type);
1053 int n_res = return_type != type_void ? 1 : 0;
1054 if (n_res != rts_data[i].n_res)
1057 /* ignore those rts functions not necessary needed for current mode */
1058 if ((c_mode & rts_data[i].flags) == 0)
1060 assert(rts_entities[rts_data[i].id] == NULL);
1061 rts_entities[rts_data[i].id] = irentity;
1065 entitymap_insert(&entitymap, symbol, irentity);
1068 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1069 entity->function.irentity = irentity;
1075 * Creates a SymConst for a given entity.
1077 * @param dbgi debug info
1078 * @param entity the entity
1080 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1082 assert(entity != NULL);
1083 union symconst_symbol sym;
1084 sym.entity_p = entity;
1085 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1088 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1090 ir_mode *value_mode = get_irn_mode(value);
1092 if (value_mode == dest_mode)
1095 if (dest_mode == mode_b) {
1096 ir_node *zero = new_Const(get_mode_null(value_mode));
1097 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_less_greater);
1101 return new_d_Conv(dbgi, value, dest_mode);
1104 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1106 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1110 * Creates a SymConst node representing a wide string literal.
1112 * @param literal the wide string literal
1114 static ir_node *wide_string_literal_to_firm(
1115 const string_literal_expression_t *literal)
1117 ir_type *const global_type = get_glob_type();
1118 ir_type *const elem_type = ir_type_wchar_t;
1119 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1120 ir_type *const type = new_type_array(1, elem_type);
1122 ident *const id = id_unique("str.%u");
1123 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1124 set_entity_ld_ident(entity, id);
1125 set_entity_visibility(entity, ir_visibility_private);
1126 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1128 ir_mode *const mode = get_type_mode(elem_type);
1129 const size_t slen = wstrlen(&literal->value);
1131 set_array_lower_bound_int(type, 0, 0);
1132 set_array_upper_bound_int(type, 0, slen);
1133 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1134 set_type_state(type, layout_fixed);
1136 ir_initializer_t *initializer = create_initializer_compound(slen);
1137 const char *p = literal->value.begin;
1138 for (size_t i = 0; i < slen; ++i) {
1139 assert(p < literal->value.begin + literal->value.size);
1140 utf32 v = read_utf8_char(&p);
1141 ir_tarval *tv = new_tarval_from_long(v, mode);
1142 ir_initializer_t *val = create_initializer_tarval(tv);
1143 set_initializer_compound_value(initializer, i, val);
1145 set_entity_initializer(entity, initializer);
1147 return create_symconst(dbgi, entity);
1151 * Creates a SymConst node representing a string constant.
1153 * @param src_pos the source position of the string constant
1154 * @param id_prefix a prefix for the name of the generated string constant
1155 * @param value the value of the string constant
1157 static ir_node *string_to_firm(const source_position_t *const src_pos,
1158 const char *const id_prefix,
1159 const string_t *const value)
1161 ir_type *const global_type = get_glob_type();
1162 dbg_info *const dbgi = get_dbg_info(src_pos);
1163 ir_type *const type = new_type_array(1, ir_type_const_char);
1165 ident *const id = id_unique(id_prefix);
1166 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1167 set_entity_ld_ident(entity, id);
1168 set_entity_visibility(entity, ir_visibility_private);
1169 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1171 ir_type *const elem_type = ir_type_const_char;
1172 ir_mode *const mode = get_type_mode(elem_type);
1174 const char* const string = value->begin;
1175 const size_t slen = value->size;
1177 set_array_lower_bound_int(type, 0, 0);
1178 set_array_upper_bound_int(type, 0, slen);
1179 set_type_size_bytes(type, slen);
1180 set_type_state(type, layout_fixed);
1182 ir_initializer_t *initializer = create_initializer_compound(slen);
1183 for (size_t i = 0; i < slen; ++i) {
1184 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1185 ir_initializer_t *val = create_initializer_tarval(tv);
1186 set_initializer_compound_value(initializer, i, val);
1188 set_entity_initializer(entity, initializer);
1190 return create_symconst(dbgi, entity);
1193 static bool try_create_integer(literal_expression_t *literal,
1194 type_t *type, unsigned char base)
1196 const char *string = literal->value.begin;
1197 size_t size = literal->value.size;
1199 assert(type->kind == TYPE_ATOMIC);
1200 atomic_type_kind_t akind = type->atomic.akind;
1202 ir_mode *mode = atomic_modes[akind];
1203 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1204 if (tv == tarval_bad)
1207 literal->base.type = type;
1208 literal->target_value = tv;
1212 static void create_integer_tarval(literal_expression_t *literal)
1216 const string_t *suffix = &literal->suffix;
1218 if (suffix->size > 0) {
1219 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1220 if (*c == 'u' || *c == 'U') { ++us; }
1221 if (*c == 'l' || *c == 'L') { ++ls; }
1226 switch (literal->base.kind) {
1227 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1228 case EXPR_LITERAL_INTEGER: base = 10; break;
1229 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1230 default: panic("invalid literal kind");
1233 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1235 /* now try if the constant is small enough for some types */
1236 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1238 if (us == 0 && try_create_integer(literal, type_int, base))
1240 if ((us == 1 || base != 10)
1241 && try_create_integer(literal, type_unsigned_int, base))
1245 if (us == 0 && try_create_integer(literal, type_long, base))
1247 if ((us == 1 || base != 10)
1248 && try_create_integer(literal, type_unsigned_long, base))
1251 /* last try? then we should not report tarval_bad */
1252 if (us != 1 && base == 10)
1253 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1254 if (us == 0 && try_create_integer(literal, type_long_long, base))
1258 assert(us == 1 || base != 10);
1259 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1260 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1262 panic("internal error when parsing number literal");
1265 tarval_set_integer_overflow_mode(old_mode);
1268 void determine_literal_type(literal_expression_t *literal)
1270 switch (literal->base.kind) {
1271 case EXPR_LITERAL_INTEGER:
1272 case EXPR_LITERAL_INTEGER_OCTAL:
1273 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1274 create_integer_tarval(literal);
1282 * Creates a Const node representing a constant.
1284 static ir_node *literal_to_firm(const literal_expression_t *literal)
1286 type_t *type = skip_typeref(literal->base.type);
1287 ir_mode *mode = get_ir_mode_storage(type);
1288 const char *string = literal->value.begin;
1289 size_t size = literal->value.size;
1292 switch (literal->base.kind) {
1293 case EXPR_LITERAL_WIDE_CHARACTER: {
1294 utf32 v = read_utf8_char(&string);
1296 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1298 tv = new_tarval_from_str(buf, len, mode);
1301 case EXPR_LITERAL_CHARACTER: {
1304 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1305 if (size == 1 && char_is_signed) {
1306 v = (signed char)string[0];
1309 for (size_t i = 0; i < size; ++i) {
1310 v = (v << 8) | ((unsigned char)string[i]);
1314 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1316 tv = new_tarval_from_str(buf, len, mode);
1319 case EXPR_LITERAL_INTEGER:
1320 case EXPR_LITERAL_INTEGER_OCTAL:
1321 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1322 assert(literal->target_value != NULL);
1323 tv = literal->target_value;
1325 case EXPR_LITERAL_FLOATINGPOINT:
1326 tv = new_tarval_from_str(string, size, mode);
1328 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1329 char buffer[size + 2];
1330 memcpy(buffer, "0x", 2);
1331 memcpy(buffer+2, string, size);
1332 tv = new_tarval_from_str(buffer, size+2, mode);
1335 case EXPR_LITERAL_BOOLEAN:
1336 if (string[0] == 't') {
1337 tv = get_mode_one(mode);
1339 assert(string[0] == 'f');
1340 tv = get_mode_null(mode);
1343 case EXPR_LITERAL_MS_NOOP:
1344 tv = get_mode_null(mode);
1349 panic("Invalid literal kind found");
1352 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1353 ir_node *res = new_d_Const(dbgi, tv);
1354 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1355 return create_conv(dbgi, res, mode_arith);
1359 * Allocate an area of size bytes aligned at alignment
1362 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1364 static unsigned area_cnt = 0;
1367 ir_type *tp = new_type_array(1, ir_type_char);
1368 set_array_bounds_int(tp, 0, 0, size);
1369 set_type_alignment_bytes(tp, alignment);
1371 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1372 ident *name = new_id_from_str(buf);
1373 ir_entity *area = new_entity(frame_type, name, tp);
1375 /* mark this entity as compiler generated */
1376 set_entity_compiler_generated(area, 1);
1381 * Return a node representing a trampoline region
1382 * for a given function entity.
1384 * @param dbgi debug info
1385 * @param entity the function entity
1387 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1389 ir_entity *region = NULL;
1392 if (current_trampolines != NULL) {
1393 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1394 if (current_trampolines[i].function == entity) {
1395 region = current_trampolines[i].region;
1400 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1402 ir_graph *irg = current_ir_graph;
1403 if (region == NULL) {
1404 /* create a new region */
1405 ir_type *frame_tp = get_irg_frame_type(irg);
1406 trampoline_region reg;
1407 reg.function = entity;
1409 reg.region = alloc_trampoline(frame_tp,
1410 be_params->trampoline_size,
1411 be_params->trampoline_align);
1412 ARR_APP1(trampoline_region, current_trampolines, reg);
1413 region = reg.region;
1415 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1420 * Creates a trampoline for a function represented by an entity.
1422 * @param dbgi debug info
1423 * @param mode the (reference) mode for the function address
1424 * @param entity the function entity
1426 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1429 assert(entity != NULL);
1431 in[0] = get_trampoline_region(dbgi, entity);
1432 in[1] = create_symconst(dbgi, entity);
1433 in[2] = get_irg_frame(current_ir_graph);
1435 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1436 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1437 return new_Proj(irn, mode, pn_Builtin_1_result);
1441 * Dereference an address.
1443 * @param dbgi debug info
1444 * @param type the type of the dereferenced result (the points_to type)
1445 * @param addr the address to dereference
1447 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1448 ir_node *const addr)
1450 ir_type *irtype = get_ir_type(type);
1451 if (is_compound_type(irtype)
1452 || is_Method_type(irtype)
1453 || is_Array_type(irtype)) {
1457 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1458 ? cons_volatile : cons_none;
1459 ir_mode *const mode = get_type_mode(irtype);
1460 ir_node *const memory = get_store();
1461 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1462 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1463 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1465 set_store(load_mem);
1467 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(type);
1468 return create_conv(dbgi, load_res, mode_arithmetic);
1472 * Creates a strict Conv (to the node's mode) if necessary.
1474 * @param dbgi debug info
1475 * @param node the node to strict conv
1477 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1479 ir_mode *mode = get_irn_mode(node);
1481 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1483 if (!mode_is_float(mode))
1486 /* check if there is already a Conv */
1487 if (is_Conv(node)) {
1488 /* convert it into a strict Conv */
1489 set_Conv_strict(node, 1);
1493 /* otherwise create a new one */
1494 return new_d_strictConv(dbgi, node, mode);
1498 * Returns the correct base address depending on whether it is a parameter or a
1499 * normal local variable.
1501 static ir_node *get_local_frame(ir_entity *const ent)
1503 ir_graph *const irg = current_ir_graph;
1504 const ir_type *const owner = get_entity_owner(ent);
1505 if (owner == current_outer_frame) {
1506 assert(current_static_link != NULL);
1507 return current_static_link;
1509 return get_irg_frame(irg);
1514 * Keep all memory edges of the given block.
1516 static void keep_all_memory(ir_node *block)
1518 ir_node *old = get_cur_block();
1520 set_cur_block(block);
1521 keep_alive(get_store());
1522 /* TODO: keep all memory edges from restricted pointers */
1526 static ir_node *reference_expression_enum_value_to_firm(
1527 const reference_expression_t *ref)
1529 entity_t *entity = ref->entity;
1530 type_t *type = skip_typeref(entity->enum_value.enum_type);
1531 /* make sure the type is constructed */
1532 (void) get_ir_type(type);
1534 return new_Const(entity->enum_value.tv);
1537 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1539 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1540 entity_t *entity = ref->entity;
1541 assert(is_declaration(entity));
1542 type_t *type = skip_typeref(entity->declaration.type);
1544 /* make sure the type is constructed */
1545 (void) get_ir_type(type);
1547 if (entity->kind == ENTITY_FUNCTION
1548 && entity->function.btk != BUILTIN_NONE) {
1549 ir_entity *irentity = get_function_entity(entity, NULL);
1550 /* for gcc compatibility we have to produce (dummy) addresses for some
1551 * builtins which don't have entities */
1552 if (irentity == NULL) {
1553 source_position_t const *const pos = &ref->base.source_position;
1554 symbol_t const *const sym = ref->entity->base.symbol;
1555 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1557 /* simply create a NULL pointer */
1558 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1559 ir_node *res = new_Const(get_mode_null(mode));
1565 switch ((declaration_kind_t) entity->declaration.kind) {
1566 case DECLARATION_KIND_UNKNOWN:
1569 case DECLARATION_KIND_LOCAL_VARIABLE: {
1570 ir_mode *const mode = get_ir_mode_storage(type);
1571 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1572 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1574 case DECLARATION_KIND_PARAMETER: {
1575 ir_mode *const mode = get_ir_mode_storage(type);
1576 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1577 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1579 case DECLARATION_KIND_FUNCTION: {
1580 return create_symconst(dbgi, entity->function.irentity);
1582 case DECLARATION_KIND_INNER_FUNCTION: {
1583 ir_mode *const mode = get_ir_mode_storage(type);
1584 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1585 /* inner function not using the closure */
1586 return create_symconst(dbgi, entity->function.irentity);
1588 /* need trampoline here */
1589 return create_trampoline(dbgi, mode, entity->function.irentity);
1592 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1593 const variable_t *variable = &entity->variable;
1594 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1595 return deref_address(dbgi, variable->base.type, addr);
1598 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1599 ir_entity *irentity = entity->variable.v.entity;
1600 ir_node *frame = get_local_frame(irentity);
1601 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1602 return deref_address(dbgi, entity->declaration.type, sel);
1604 case DECLARATION_KIND_PARAMETER_ENTITY: {
1605 ir_entity *irentity = entity->parameter.v.entity;
1606 ir_node *frame = get_local_frame(irentity);
1607 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1608 return deref_address(dbgi, entity->declaration.type, sel);
1611 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1612 return entity->variable.v.vla_base;
1614 case DECLARATION_KIND_COMPOUND_MEMBER:
1615 panic("not implemented reference type");
1618 panic("reference to declaration with unknown type found");
1621 static ir_node *reference_addr(const reference_expression_t *ref)
1623 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1624 entity_t *entity = ref->entity;
1625 assert(is_declaration(entity));
1627 switch((declaration_kind_t) entity->declaration.kind) {
1628 case DECLARATION_KIND_UNKNOWN:
1630 case DECLARATION_KIND_PARAMETER:
1631 case DECLARATION_KIND_LOCAL_VARIABLE:
1632 /* you can store to a local variable (so we don't panic but return NULL
1633 * as an indicator for no real address) */
1635 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1636 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1639 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1640 ir_entity *irentity = entity->variable.v.entity;
1641 ir_node *frame = get_local_frame(irentity);
1642 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1646 case DECLARATION_KIND_PARAMETER_ENTITY: {
1647 ir_entity *irentity = entity->parameter.v.entity;
1648 ir_node *frame = get_local_frame(irentity);
1649 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1654 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1655 return entity->variable.v.vla_base;
1657 case DECLARATION_KIND_FUNCTION: {
1658 return create_symconst(dbgi, entity->function.irentity);
1661 case DECLARATION_KIND_INNER_FUNCTION: {
1662 type_t *const type = skip_typeref(entity->declaration.type);
1663 ir_mode *const mode = get_ir_mode_storage(type);
1664 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1665 /* inner function not using the closure */
1666 return create_symconst(dbgi, entity->function.irentity);
1668 /* need trampoline here */
1669 return create_trampoline(dbgi, mode, entity->function.irentity);
1673 case DECLARATION_KIND_COMPOUND_MEMBER:
1674 panic("not implemented reference type");
1677 panic("reference to declaration with unknown type found");
1681 * Transform calls to builtin functions.
1683 static ir_node *process_builtin_call(const call_expression_t *call)
1685 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1687 assert(call->function->kind == EXPR_REFERENCE);
1688 reference_expression_t *builtin = &call->function->reference;
1690 type_t *expr_type = skip_typeref(builtin->base.type);
1691 assert(is_type_pointer(expr_type));
1693 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1695 switch (builtin->entity->function.btk) {
1698 case BUILTIN_ALLOCA: {
1699 expression_t *argument = call->arguments->expression;
1700 ir_node *size = expression_to_firm(argument);
1702 ir_node *store = get_store();
1703 ir_node *alloca = new_d_Alloc(dbgi, store, size, firm_unknown_type,
1705 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1707 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1712 type_t *type = function_type->function.return_type;
1713 ir_mode *mode = get_ir_mode_arithmetic(type);
1714 ir_tarval *tv = get_mode_infinite(mode);
1715 ir_node *res = new_d_Const(dbgi, tv);
1719 /* Ignore string for now... */
1720 assert(is_type_function(function_type));
1721 type_t *type = function_type->function.return_type;
1722 ir_mode *mode = get_ir_mode_arithmetic(type);
1723 ir_tarval *tv = get_mode_NAN(mode);
1724 ir_node *res = new_d_Const(dbgi, tv);
1727 case BUILTIN_EXPECT: {
1728 expression_t *argument = call->arguments->expression;
1729 return _expression_to_firm(argument);
1731 case BUILTIN_VA_END:
1732 /* evaluate the argument of va_end for its side effects */
1733 _expression_to_firm(call->arguments->expression);
1735 case BUILTIN_OBJECT_SIZE: {
1736 /* determine value of "type" */
1737 expression_t *type_expression = call->arguments->next->expression;
1738 long type_val = fold_constant_to_int(type_expression);
1739 type_t *type = function_type->function.return_type;
1740 ir_mode *mode = get_ir_mode_arithmetic(type);
1741 /* just produce a "I don't know" result */
1742 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1743 get_mode_minus_one(mode);
1745 return new_d_Const(dbgi, result);
1747 case BUILTIN_ROTL: {
1748 ir_node *val = expression_to_firm(call->arguments->expression);
1749 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1750 ir_mode *mode = get_irn_mode(val);
1751 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1753 case BUILTIN_ROTR: {
1754 ir_node *val = expression_to_firm(call->arguments->expression);
1755 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1756 ir_mode *mode = get_irn_mode(val);
1757 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1758 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1759 return new_d_Rotl(dbgi, val, sub, mode);
1764 case BUILTIN_LIBC_CHECK:
1765 panic("builtin did not produce an entity");
1767 panic("invalid builtin found");
1771 * Transform a call expression.
1772 * Handles some special cases, like alloca() calls, which must be resolved
1773 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1774 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1777 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1779 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1780 assert(currently_reachable());
1782 expression_t *function = call->function;
1783 ir_node *callee = NULL;
1784 bool firm_builtin = false;
1785 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1786 if (function->kind == EXPR_REFERENCE) {
1787 const reference_expression_t *ref = &function->reference;
1788 entity_t *entity = ref->entity;
1790 if (entity->kind == ENTITY_FUNCTION) {
1791 builtin_kind_t builtin = entity->function.btk;
1792 if (builtin == BUILTIN_FIRM) {
1793 firm_builtin = true;
1794 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1795 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1796 && builtin != BUILTIN_LIBC_CHECK) {
1797 return process_builtin_call(call);
1802 callee = expression_to_firm(function);
1804 type_t *type = skip_typeref(function->base.type);
1805 assert(is_type_pointer(type));
1806 pointer_type_t *pointer_type = &type->pointer;
1807 type_t *points_to = skip_typeref(pointer_type->points_to);
1808 assert(is_type_function(points_to));
1809 function_type_t *function_type = &points_to->function;
1811 int n_parameters = 0;
1812 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1813 ir_type *new_method_type = NULL;
1814 if (function_type->variadic || function_type->unspecified_parameters) {
1815 const call_argument_t *argument = call->arguments;
1816 for ( ; argument != NULL; argument = argument->next) {
1820 /* we need to construct a new method type matching the call
1822 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1823 int n_res = get_method_n_ress(ir_method_type);
1824 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1825 set_method_calling_convention(new_method_type,
1826 get_method_calling_convention(ir_method_type));
1827 set_method_additional_properties(new_method_type,
1828 get_method_additional_properties(ir_method_type));
1829 set_method_variadicity(new_method_type,
1830 get_method_variadicity(ir_method_type));
1832 for (int i = 0; i < n_res; ++i) {
1833 set_method_res_type(new_method_type, i,
1834 get_method_res_type(ir_method_type, i));
1836 argument = call->arguments;
1837 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1838 expression_t *expression = argument->expression;
1839 ir_type *irtype = get_ir_type(expression->base.type);
1840 set_method_param_type(new_method_type, i, irtype);
1842 ir_method_type = new_method_type;
1844 n_parameters = get_method_n_params(ir_method_type);
1847 ir_node *in[n_parameters];
1849 const call_argument_t *argument = call->arguments;
1850 for (int n = 0; n < n_parameters; ++n) {
1851 expression_t *expression = argument->expression;
1852 ir_node *arg_node = expression_to_firm(expression);
1854 type_t *arg_type = skip_typeref(expression->base.type);
1855 if (!is_type_compound(arg_type)) {
1856 ir_mode *mode = get_ir_mode_storage(expression->base.type);
1857 arg_node = create_conv(dbgi, arg_node, mode);
1858 arg_node = do_strict_conv(dbgi, arg_node);
1863 argument = argument->next;
1867 if (function_type->modifiers & DM_CONST) {
1868 store = get_irg_no_mem(current_ir_graph);
1870 store = get_store();
1874 type_t *return_type = skip_typeref(function_type->return_type);
1875 ir_node *result = NULL;
1877 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1879 if (! (function_type->modifiers & DM_CONST)) {
1880 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1884 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1885 assert(is_type_scalar(return_type));
1886 ir_mode *mode = get_ir_mode_storage(return_type);
1887 result = new_Proj(node, mode, pn_Builtin_1_result);
1888 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1889 result = create_conv(NULL, result, mode_arith);
1892 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1893 if (! (function_type->modifiers & DM_CONST)) {
1894 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1898 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1899 ir_node *resproj = new_Proj(node, mode_T, pn_Call_T_result);
1901 if (is_type_scalar(return_type)) {
1902 ir_mode *mode = get_ir_mode_storage(return_type);
1903 result = new_Proj(resproj, mode, 0);
1904 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1905 result = create_conv(NULL, result, mode_arith);
1907 ir_mode *mode = mode_P_data;
1908 result = new_Proj(resproj, mode, 0);
1913 if (function_type->modifiers & DM_NORETURN) {
1914 /* A dead end: Keep the Call and the Block. Also place all further
1915 * nodes into a new and unreachable block. */
1917 keep_alive(get_cur_block());
1918 ir_node *block = new_Block(0, NULL);
1919 set_cur_block(block);
1925 static void statement_to_firm(statement_t *statement);
1926 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1928 static ir_node *expression_to_addr(const expression_t *expression);
1929 static ir_node *create_condition_evaluation(const expression_t *expression,
1930 ir_node *true_block,
1931 ir_node *false_block);
1933 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1936 if (!is_type_compound(type)) {
1937 ir_mode *mode = get_ir_mode_storage(type);
1938 value = create_conv(dbgi, value, mode);
1939 value = do_strict_conv(dbgi, value);
1942 ir_node *memory = get_store();
1944 if (is_type_scalar(type)) {
1945 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1946 ? cons_volatile : cons_none;
1947 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1948 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1949 set_store(store_mem);
1951 ir_type *irtype = get_ir_type(type);
1952 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1953 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1954 set_store(copyb_mem);
1958 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1960 ir_tarval *all_one = get_mode_all_one(mode);
1961 int mode_size = get_mode_size_bits(mode);
1963 assert(offset >= 0);
1965 assert(offset + size <= mode_size);
1966 if (size == mode_size) {
1970 long shiftr = get_mode_size_bits(mode) - size;
1971 long shiftl = offset;
1972 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1973 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1974 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1975 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1980 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1981 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile)
1983 ir_type *entity_type = get_entity_type(entity);
1984 ir_type *base_type = get_primitive_base_type(entity_type);
1985 assert(base_type != NULL);
1986 ir_mode *mode = get_type_mode(base_type);
1988 value = create_conv(dbgi, value, mode);
1990 /* kill upper bits of value and shift to right position */
1991 int bitoffset = get_entity_offset_bits_remainder(entity);
1992 int bitsize = get_mode_size_bits(get_type_mode(entity_type));
1993 ir_tarval *mask = create_bitfield_mask(mode, 0, bitsize);
1994 ir_node *mask_node = new_d_Const(dbgi, mask);
1995 ir_node *value_masked = new_d_And(dbgi, value, mask_node, mode);
1996 ir_tarval *shiftl = new_tarval_from_long(bitoffset, mode_uint);
1997 ir_node *shiftcount = new_d_Const(dbgi, shiftl);
1998 ir_node *value_maskshift = new_d_Shl(dbgi, value_masked, shiftcount, mode);
2000 /* load current value */
2001 ir_node *mem = get_store();
2002 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2003 set_volatile ? cons_volatile : cons_none);
2004 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2005 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2006 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2007 ir_tarval *inv_mask = tarval_not(shift_mask);
2008 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2009 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2011 /* construct new value and store */
2012 ir_node *new_val = new_d_Or(dbgi, load_res_masked, value_maskshift, mode);
2013 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2014 set_volatile ? cons_volatile : cons_none);
2015 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2016 set_store(store_mem);
2018 return value_masked;
2021 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2024 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2025 entity_t *entity = expression->compound_entry;
2026 type_t *base_type = entity->declaration.type;
2027 ir_mode *mode = get_ir_mode_storage(base_type);
2028 ir_node *mem = get_store();
2029 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2030 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2031 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2033 ir_mode *amode = mode;
2034 /* optimisation, since shifting in modes < machine_size is usually
2036 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2039 unsigned amode_size = get_mode_size_bits(amode);
2040 load_res = create_conv(dbgi, load_res, amode);
2042 set_store(load_mem);
2044 /* kill upper bits */
2045 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2046 int bitoffset = entity->compound_member.bit_offset;
2047 int bitsize = entity->compound_member.bit_size;
2048 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2049 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2050 ir_node *countl = new_d_Const(dbgi, tvl);
2051 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2053 unsigned shift_bitsr = bitoffset + shift_bitsl;
2054 assert(shift_bitsr <= amode_size);
2055 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2056 ir_node *countr = new_d_Const(dbgi, tvr);
2058 if (mode_is_signed(mode)) {
2059 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2061 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2064 type_t *type = expression->base.type;
2065 ir_mode *resmode = get_ir_mode_arithmetic(type);
2066 return create_conv(dbgi, shiftr, resmode);
2069 /* make sure the selected compound type is constructed */
2070 static void construct_select_compound(const select_expression_t *expression)
2072 type_t *type = skip_typeref(expression->compound->base.type);
2073 if (is_type_pointer(type)) {
2074 type = type->pointer.points_to;
2076 (void) get_ir_type(type);
2079 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2080 ir_node *value, ir_node *addr)
2082 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2083 type_t *type = skip_typeref(expression->base.type);
2085 if (!is_type_compound(type)) {
2086 ir_mode *mode = get_ir_mode_storage(type);
2087 value = create_conv(dbgi, value, mode);
2088 value = do_strict_conv(dbgi, value);
2091 if (expression->kind == EXPR_REFERENCE) {
2092 const reference_expression_t *ref = &expression->reference;
2094 entity_t *entity = ref->entity;
2095 assert(is_declaration(entity));
2096 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2097 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2098 set_value(entity->variable.v.value_number, value);
2100 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2101 set_value(entity->parameter.v.value_number, value);
2107 addr = expression_to_addr(expression);
2108 assert(addr != NULL);
2110 if (expression->kind == EXPR_SELECT) {
2111 const select_expression_t *select = &expression->select;
2113 construct_select_compound(select);
2115 entity_t *entity = select->compound_entry;
2116 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2117 if (entity->compound_member.bitfield) {
2118 ir_entity *irentity = entity->compound_member.entity;
2120 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2121 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2127 assign_value(dbgi, addr, type, value);
2131 static void set_value_for_expression(const expression_t *expression,
2134 set_value_for_expression_addr(expression, value, NULL);
2137 static ir_node *get_value_from_lvalue(const expression_t *expression,
2140 if (expression->kind == EXPR_REFERENCE) {
2141 const reference_expression_t *ref = &expression->reference;
2143 entity_t *entity = ref->entity;
2144 assert(entity->kind == ENTITY_VARIABLE
2145 || entity->kind == ENTITY_PARAMETER);
2146 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2148 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2149 value_number = entity->variable.v.value_number;
2150 assert(addr == NULL);
2151 type_t *type = skip_typeref(expression->base.type);
2152 ir_mode *mode = get_ir_mode_storage(type);
2153 ir_node *res = get_value(value_number, mode);
2154 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2155 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2156 value_number = entity->parameter.v.value_number;
2157 assert(addr == NULL);
2158 type_t *type = skip_typeref(expression->base.type);
2159 ir_mode *mode = get_ir_mode_storage(type);
2160 ir_node *res = get_value(value_number, mode);
2161 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2165 assert(addr != NULL);
2166 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2169 if (expression->kind == EXPR_SELECT &&
2170 expression->select.compound_entry->compound_member.bitfield) {
2171 construct_select_compound(&expression->select);
2172 value = bitfield_extract_to_firm(&expression->select, addr);
2174 value = deref_address(dbgi, expression->base.type, addr);
2181 static ir_node *create_incdec(const unary_expression_t *expression)
2183 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2184 const expression_t *value_expr = expression->value;
2185 ir_node *addr = expression_to_addr(value_expr);
2186 ir_node *value = get_value_from_lvalue(value_expr, addr);
2188 type_t *type = skip_typeref(expression->base.type);
2189 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2192 if (is_type_pointer(type)) {
2193 pointer_type_t *pointer_type = &type->pointer;
2194 offset = get_type_size_node(pointer_type->points_to);
2196 assert(is_type_arithmetic(type));
2197 offset = new_Const(get_mode_one(mode));
2201 ir_node *store_value;
2202 switch(expression->base.kind) {
2203 case EXPR_UNARY_POSTFIX_INCREMENT:
2205 store_value = new_d_Add(dbgi, value, offset, mode);
2207 case EXPR_UNARY_POSTFIX_DECREMENT:
2209 store_value = new_d_Sub(dbgi, value, offset, mode);
2211 case EXPR_UNARY_PREFIX_INCREMENT:
2212 result = new_d_Add(dbgi, value, offset, mode);
2213 store_value = result;
2215 case EXPR_UNARY_PREFIX_DECREMENT:
2216 result = new_d_Sub(dbgi, value, offset, mode);
2217 store_value = result;
2220 panic("no incdec expr in create_incdec");
2223 set_value_for_expression_addr(value_expr, store_value, addr);
2228 static bool is_local_variable(expression_t *expression)
2230 if (expression->kind != EXPR_REFERENCE)
2232 reference_expression_t *ref_expr = &expression->reference;
2233 entity_t *entity = ref_expr->entity;
2234 if (entity->kind != ENTITY_VARIABLE)
2236 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2237 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2240 static ir_relation get_relation(const expression_kind_t kind)
2243 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2244 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2245 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2246 case EXPR_BINARY_ISLESS:
2247 case EXPR_BINARY_LESS: return ir_relation_less;
2248 case EXPR_BINARY_ISLESSEQUAL:
2249 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2250 case EXPR_BINARY_ISGREATER:
2251 case EXPR_BINARY_GREATER: return ir_relation_greater;
2252 case EXPR_BINARY_ISGREATEREQUAL:
2253 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2254 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2259 panic("trying to get pn_Cmp from non-comparison binexpr type");
2263 * Handle the assume optimizer hint: check if a Confirm
2264 * node can be created.
2266 * @param dbi debug info
2267 * @param expr the IL assume expression
2269 * we support here only some simple cases:
2274 static ir_node *handle_assume_compare(dbg_info *dbi,
2275 const binary_expression_t *expression)
2277 expression_t *op1 = expression->left;
2278 expression_t *op2 = expression->right;
2279 entity_t *var2, *var = NULL;
2280 ir_node *res = NULL;
2281 ir_relation relation = get_relation(expression->base.kind);
2283 if (is_local_variable(op1) && is_local_variable(op2)) {
2284 var = op1->reference.entity;
2285 var2 = op2->reference.entity;
2287 type_t *const type = skip_typeref(var->declaration.type);
2288 ir_mode *const mode = get_ir_mode_storage(type);
2290 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2291 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2293 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2294 set_value(var2->variable.v.value_number, res);
2296 res = new_d_Confirm(dbi, irn1, irn2, relation);
2297 set_value(var->variable.v.value_number, res);
2302 expression_t *con = NULL;
2303 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2304 var = op1->reference.entity;
2306 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2307 relation = get_inversed_relation(relation);
2308 var = op2->reference.entity;
2313 type_t *const type = skip_typeref(var->declaration.type);
2314 ir_mode *const mode = get_ir_mode_storage(type);
2316 res = get_value(var->variable.v.value_number, mode);
2317 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2318 set_value(var->variable.v.value_number, res);
2324 * Handle the assume optimizer hint.
2326 * @param dbi debug info
2327 * @param expr the IL assume expression
2329 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2331 switch(expression->kind) {
2332 case EXPR_BINARY_EQUAL:
2333 case EXPR_BINARY_NOTEQUAL:
2334 case EXPR_BINARY_LESS:
2335 case EXPR_BINARY_LESSEQUAL:
2336 case EXPR_BINARY_GREATER:
2337 case EXPR_BINARY_GREATEREQUAL:
2338 return handle_assume_compare(dbi, &expression->binary);
2344 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2345 type_t *from_type, type_t *type)
2347 type = skip_typeref(type);
2348 if (type == type_void) {
2349 /* make sure firm type is constructed */
2350 (void) get_ir_type(type);
2353 if (!is_type_scalar(type)) {
2354 /* make sure firm type is constructed */
2355 (void) get_ir_type(type);
2359 from_type = skip_typeref(from_type);
2360 ir_mode *mode = get_ir_mode_storage(type);
2361 /* check for conversion from / to __based types */
2362 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2363 const variable_t *from_var = from_type->pointer.base_variable;
2364 const variable_t *to_var = type->pointer.base_variable;
2365 if (from_var != to_var) {
2366 if (from_var != NULL) {
2367 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2368 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2369 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2371 if (to_var != NULL) {
2372 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2373 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2374 value_node = new_d_Sub(dbgi, value_node, base, mode);
2379 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2380 /* bool adjustments (we save a mode_Bu, but have to temporarily
2381 * convert to mode_b so we only get a 0/1 value */
2382 value_node = create_conv(dbgi, value_node, mode_b);
2385 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2386 ir_node *node = create_conv(dbgi, value_node, mode);
2387 node = do_strict_conv(dbgi, node);
2388 node = create_conv(dbgi, node, mode_arith);
2393 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2395 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2396 type_t *type = skip_typeref(expression->base.type);
2398 if (expression->base.kind == EXPR_UNARY_TAKE_ADDRESS)
2399 return expression_to_addr(expression->value);
2401 const expression_t *value = expression->value;
2403 switch(expression->base.kind) {
2404 case EXPR_UNARY_NEGATE: {
2405 ir_node *value_node = expression_to_firm(value);
2406 ir_mode *mode = get_ir_mode_arithmetic(type);
2407 return new_d_Minus(dbgi, value_node, mode);
2409 case EXPR_UNARY_PLUS:
2410 return expression_to_firm(value);
2411 case EXPR_UNARY_BITWISE_NEGATE: {
2412 ir_node *value_node = expression_to_firm(value);
2413 ir_mode *mode = get_ir_mode_arithmetic(type);
2414 return new_d_Not(dbgi, value_node, mode);
2416 case EXPR_UNARY_NOT: {
2417 ir_node *value_node = _expression_to_firm(value);
2418 value_node = create_conv(dbgi, value_node, mode_b);
2419 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2422 case EXPR_UNARY_DEREFERENCE: {
2423 ir_node *value_node = expression_to_firm(value);
2424 type_t *value_type = skip_typeref(value->base.type);
2425 assert(is_type_pointer(value_type));
2427 /* check for __based */
2428 const variable_t *const base_var = value_type->pointer.base_variable;
2429 if (base_var != NULL) {
2430 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2431 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2432 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2434 type_t *points_to = value_type->pointer.points_to;
2435 return deref_address(dbgi, points_to, value_node);
2437 case EXPR_UNARY_POSTFIX_INCREMENT:
2438 case EXPR_UNARY_POSTFIX_DECREMENT:
2439 case EXPR_UNARY_PREFIX_INCREMENT:
2440 case EXPR_UNARY_PREFIX_DECREMENT:
2441 return create_incdec(expression);
2442 case EXPR_UNARY_CAST: {
2443 ir_node *value_node = expression_to_firm(value);
2444 type_t *from_type = value->base.type;
2445 return create_cast(dbgi, value_node, from_type, type);
2447 case EXPR_UNARY_ASSUME:
2448 return handle_assume(dbgi, value);
2453 panic("invalid UNEXPR type found");
2457 * produces a 0/1 depending of the value of a mode_b node
2459 static ir_node *produce_condition_result(const expression_t *expression,
2460 ir_mode *mode, dbg_info *dbgi)
2462 ir_node *const one_block = new_immBlock();
2463 ir_node *const zero_block = new_immBlock();
2464 create_condition_evaluation(expression, one_block, zero_block);
2465 mature_immBlock(one_block);
2466 mature_immBlock(zero_block);
2468 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2469 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2470 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2471 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2472 set_cur_block(block);
2474 ir_node *const one = new_Const(get_mode_one(mode));
2475 ir_node *const zero = new_Const(get_mode_null(mode));
2476 ir_node *const in[2] = { one, zero };
2477 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2482 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2483 ir_node *value, type_t *type)
2485 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2486 assert(is_type_pointer(type));
2487 pointer_type_t *const pointer_type = &type->pointer;
2488 type_t *const points_to = skip_typeref(pointer_type->points_to);
2489 ir_node * elem_size = get_type_size_node(points_to);
2490 elem_size = create_conv(dbgi, elem_size, mode);
2491 value = create_conv(dbgi, value, mode);
2492 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2496 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2497 ir_node *left, ir_node *right)
2500 type_t *type_left = skip_typeref(expression->left->base.type);
2501 type_t *type_right = skip_typeref(expression->right->base.type);
2503 expression_kind_t kind = expression->base.kind;
2506 case EXPR_BINARY_SHIFTLEFT:
2507 case EXPR_BINARY_SHIFTRIGHT:
2508 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2509 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2510 mode = get_ir_mode_arithmetic(expression->base.type);
2511 right = create_conv(dbgi, right, mode_uint);
2514 case EXPR_BINARY_SUB:
2515 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2516 const pointer_type_t *const ptr_type = &type_left->pointer;
2518 mode = get_ir_mode_arithmetic(expression->base.type);
2519 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2520 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2521 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2522 ir_node *const no_mem = new_NoMem();
2523 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2524 mode, op_pin_state_floats);
2525 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2528 case EXPR_BINARY_SUB_ASSIGN:
2529 if (is_type_pointer(type_left)) {
2530 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2531 mode = get_ir_mode_arithmetic(type_left);
2536 case EXPR_BINARY_ADD:
2537 case EXPR_BINARY_ADD_ASSIGN:
2538 if (is_type_pointer(type_left)) {
2539 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2540 mode = get_ir_mode_arithmetic(type_left);
2542 } else if (is_type_pointer(type_right)) {
2543 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2544 mode = get_ir_mode_arithmetic(type_right);
2551 mode = get_ir_mode_arithmetic(type_right);
2552 left = create_conv(dbgi, left, mode);
2557 case EXPR_BINARY_ADD_ASSIGN:
2558 case EXPR_BINARY_ADD:
2559 return new_d_Add(dbgi, left, right, mode);
2560 case EXPR_BINARY_SUB_ASSIGN:
2561 case EXPR_BINARY_SUB:
2562 return new_d_Sub(dbgi, left, right, mode);
2563 case EXPR_BINARY_MUL_ASSIGN:
2564 case EXPR_BINARY_MUL:
2565 return new_d_Mul(dbgi, left, right, mode);
2566 case EXPR_BINARY_BITWISE_AND:
2567 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2568 return new_d_And(dbgi, left, right, mode);
2569 case EXPR_BINARY_BITWISE_OR:
2570 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2571 return new_d_Or(dbgi, left, right, mode);
2572 case EXPR_BINARY_BITWISE_XOR:
2573 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2574 return new_d_Eor(dbgi, left, right, mode);
2575 case EXPR_BINARY_SHIFTLEFT:
2576 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2577 return new_d_Shl(dbgi, left, right, mode);
2578 case EXPR_BINARY_SHIFTRIGHT:
2579 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2580 if (mode_is_signed(mode)) {
2581 return new_d_Shrs(dbgi, left, right, mode);
2583 return new_d_Shr(dbgi, left, right, mode);
2585 case EXPR_BINARY_DIV:
2586 case EXPR_BINARY_DIV_ASSIGN: {
2587 ir_node *pin = new_Pin(new_NoMem());
2588 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2589 op_pin_state_floats);
2590 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2593 case EXPR_BINARY_MOD:
2594 case EXPR_BINARY_MOD_ASSIGN: {
2595 ir_node *pin = new_Pin(new_NoMem());
2596 assert(!mode_is_float(mode));
2597 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2598 op_pin_state_floats);
2599 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2603 panic("unexpected expression kind");
2607 static ir_node *create_lazy_op(const binary_expression_t *expression)
2609 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2610 type_t *type = skip_typeref(expression->base.type);
2611 ir_mode *mode = get_ir_mode_arithmetic(type);
2613 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2614 bool val = fold_constant_to_bool(expression->left);
2615 expression_kind_t ekind = expression->base.kind;
2616 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2617 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2619 return new_Const(get_mode_null(mode));
2623 return new_Const(get_mode_one(mode));
2627 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2628 bool valr = fold_constant_to_bool(expression->right);
2629 return create_Const_from_bool(mode, valr);
2632 return produce_condition_result(expression->right, mode, dbgi);
2635 return produce_condition_result((const expression_t*) expression, mode,
2639 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2640 ir_node *right, ir_mode *mode);
2642 static ir_node *create_assign_binop(const binary_expression_t *expression)
2644 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2645 const expression_t *left_expr = expression->left;
2646 type_t *type = skip_typeref(left_expr->base.type);
2647 ir_node *right = expression_to_firm(expression->right);
2648 ir_node *left_addr = expression_to_addr(left_expr);
2649 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2650 ir_node *result = create_op(dbgi, expression, left, right);
2652 result = create_cast(dbgi, result, expression->right->base.type, type);
2653 result = do_strict_conv(dbgi, result);
2655 result = set_value_for_expression_addr(left_expr, result, left_addr);
2657 if (!is_type_compound(type)) {
2658 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2659 result = create_conv(dbgi, result, mode_arithmetic);
2664 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2666 expression_kind_t kind = expression->base.kind;
2669 case EXPR_BINARY_EQUAL:
2670 case EXPR_BINARY_NOTEQUAL:
2671 case EXPR_BINARY_LESS:
2672 case EXPR_BINARY_LESSEQUAL:
2673 case EXPR_BINARY_GREATER:
2674 case EXPR_BINARY_GREATEREQUAL:
2675 case EXPR_BINARY_ISGREATER:
2676 case EXPR_BINARY_ISGREATEREQUAL:
2677 case EXPR_BINARY_ISLESS:
2678 case EXPR_BINARY_ISLESSEQUAL:
2679 case EXPR_BINARY_ISLESSGREATER:
2680 case EXPR_BINARY_ISUNORDERED: {
2681 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2682 ir_node *left = expression_to_firm(expression->left);
2683 ir_node *right = expression_to_firm(expression->right);
2684 ir_relation relation = get_relation(kind);
2685 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2688 case EXPR_BINARY_ASSIGN: {
2689 ir_node *addr = expression_to_addr(expression->left);
2690 ir_node *right = expression_to_firm(expression->right);
2692 = set_value_for_expression_addr(expression->left, right, addr);
2694 type_t *type = skip_typeref(expression->base.type);
2695 if (!is_type_compound(type)) {
2696 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2697 res = create_conv(NULL, res, mode_arithmetic);
2701 case EXPR_BINARY_ADD:
2702 case EXPR_BINARY_SUB:
2703 case EXPR_BINARY_MUL:
2704 case EXPR_BINARY_DIV:
2705 case EXPR_BINARY_MOD:
2706 case EXPR_BINARY_BITWISE_AND:
2707 case EXPR_BINARY_BITWISE_OR:
2708 case EXPR_BINARY_BITWISE_XOR:
2709 case EXPR_BINARY_SHIFTLEFT:
2710 case EXPR_BINARY_SHIFTRIGHT:
2712 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2713 ir_node *left = expression_to_firm(expression->left);
2714 ir_node *right = expression_to_firm(expression->right);
2715 return create_op(dbgi, expression, left, right);
2717 case EXPR_BINARY_LOGICAL_AND:
2718 case EXPR_BINARY_LOGICAL_OR:
2719 return create_lazy_op(expression);
2720 case EXPR_BINARY_COMMA:
2721 /* create side effects of left side */
2722 (void) expression_to_firm(expression->left);
2723 return _expression_to_firm(expression->right);
2725 case EXPR_BINARY_ADD_ASSIGN:
2726 case EXPR_BINARY_SUB_ASSIGN:
2727 case EXPR_BINARY_MUL_ASSIGN:
2728 case EXPR_BINARY_MOD_ASSIGN:
2729 case EXPR_BINARY_DIV_ASSIGN:
2730 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2731 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2732 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2733 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2734 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2735 return create_assign_binop(expression);
2737 panic("TODO binexpr type");
2741 static ir_node *array_access_addr(const array_access_expression_t *expression)
2743 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2744 ir_node *base_addr = expression_to_firm(expression->array_ref);
2745 ir_node *offset = expression_to_firm(expression->index);
2746 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2747 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2748 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2753 static ir_node *array_access_to_firm(
2754 const array_access_expression_t *expression)
2756 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2757 ir_node *addr = array_access_addr(expression);
2758 type_t *type = revert_automatic_type_conversion(
2759 (const expression_t*) expression);
2760 type = skip_typeref(type);
2762 return deref_address(dbgi, type, addr);
2765 static long get_offsetof_offset(const offsetof_expression_t *expression)
2767 type_t *orig_type = expression->type;
2770 designator_t *designator = expression->designator;
2771 for ( ; designator != NULL; designator = designator->next) {
2772 type_t *type = skip_typeref(orig_type);
2773 /* be sure the type is constructed */
2774 (void) get_ir_type(type);
2776 if (designator->symbol != NULL) {
2777 assert(is_type_compound(type));
2778 symbol_t *symbol = designator->symbol;
2780 compound_t *compound = type->compound.compound;
2781 entity_t *iter = compound->members.entities;
2782 for ( ; iter != NULL; iter = iter->base.next) {
2783 if (iter->base.symbol == symbol) {
2787 assert(iter != NULL);
2789 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2790 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2791 offset += get_entity_offset(iter->compound_member.entity);
2793 orig_type = iter->declaration.type;
2795 expression_t *array_index = designator->array_index;
2796 assert(designator->array_index != NULL);
2797 assert(is_type_array(type));
2799 long index = fold_constant_to_int(array_index);
2800 ir_type *arr_type = get_ir_type(type);
2801 ir_type *elem_type = get_array_element_type(arr_type);
2802 long elem_size = get_type_size_bytes(elem_type);
2804 offset += index * elem_size;
2806 orig_type = type->array.element_type;
2813 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2815 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2816 long offset = get_offsetof_offset(expression);
2817 ir_tarval *tv = new_tarval_from_long(offset, mode);
2818 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2820 return new_d_Const(dbgi, tv);
2823 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2824 ir_entity *entity, type_t *type);
2826 static ir_node *compound_literal_to_firm(
2827 const compound_literal_expression_t *expression)
2829 type_t *type = expression->type;
2831 /* create an entity on the stack */
2832 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2834 ident *const id = id_unique("CompLit.%u");
2835 ir_type *const irtype = get_ir_type(type);
2836 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2837 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2838 set_entity_ld_ident(entity, id);
2840 /* create initialisation code */
2841 initializer_t *initializer = expression->initializer;
2842 create_local_initializer(initializer, dbgi, entity, type);
2844 /* create a sel for the compound literal address */
2845 ir_node *frame = get_irg_frame(current_ir_graph);
2846 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2851 * Transform a sizeof expression into Firm code.
2853 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2855 type_t *const type = skip_typeref(expression->type);
2856 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2857 if (is_type_array(type) && type->array.is_vla
2858 && expression->tp_expression != NULL) {
2859 expression_to_firm(expression->tp_expression);
2861 /* strange gnu extensions: sizeof(function) == 1 */
2862 if (is_type_function(type)) {
2863 ir_mode *mode = get_ir_mode_storage(type_size_t);
2864 return new_Const(get_mode_one(mode));
2867 return get_type_size_node(type);
2870 static entity_t *get_expression_entity(const expression_t *expression)
2872 if (expression->kind != EXPR_REFERENCE)
2875 return expression->reference.entity;
2878 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2880 switch(entity->kind) {
2881 DECLARATION_KIND_CASES
2882 return entity->declaration.alignment;
2885 return entity->compound.alignment;
2886 case ENTITY_TYPEDEF:
2887 return entity->typedefe.alignment;
2895 * Transform an alignof expression into Firm code.
2897 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2899 unsigned alignment = 0;
2901 const expression_t *tp_expression = expression->tp_expression;
2902 if (tp_expression != NULL) {
2903 entity_t *entity = get_expression_entity(tp_expression);
2904 if (entity != NULL) {
2905 if (entity->kind == ENTITY_FUNCTION) {
2906 /* a gnu-extension */
2909 alignment = get_cparser_entity_alignment(entity);
2914 if (alignment == 0) {
2915 type_t *type = expression->type;
2916 alignment = get_type_alignment(type);
2919 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2920 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2921 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2922 return new_d_Const(dbgi, tv);
2925 static void init_ir_types(void);
2927 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2929 assert(is_type_valid(skip_typeref(expression->base.type)));
2931 bool constant_folding_old = constant_folding;
2932 constant_folding = true;
2936 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2938 ir_graph *old_current_ir_graph = current_ir_graph;
2939 current_ir_graph = get_const_code_irg();
2941 ir_node *cnst = expression_to_firm(expression);
2942 current_ir_graph = old_current_ir_graph;
2944 if (!is_Const(cnst)) {
2945 panic("couldn't fold constant");
2948 constant_folding = constant_folding_old;
2950 return get_Const_tarval(cnst);
2953 /* this function is only used in parser.c, but it relies on libfirm functionality */
2954 bool constant_is_negative(const expression_t *expression)
2956 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2957 ir_tarval *tv = fold_constant_to_tarval(expression);
2958 return tarval_is_negative(tv);
2961 long fold_constant_to_int(const expression_t *expression)
2963 if (expression->kind == EXPR_ERROR)
2966 ir_tarval *tv = fold_constant_to_tarval(expression);
2967 if (!tarval_is_long(tv)) {
2968 panic("result of constant folding is not integer");
2971 return get_tarval_long(tv);
2974 bool fold_constant_to_bool(const expression_t *expression)
2976 if (expression->kind == EXPR_ERROR)
2978 ir_tarval *tv = fold_constant_to_tarval(expression);
2979 return !tarval_is_null(tv);
2982 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2984 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2986 /* first try to fold a constant condition */
2987 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
2988 bool val = fold_constant_to_bool(expression->condition);
2990 expression_t *true_expression = expression->true_expression;
2991 if (true_expression == NULL)
2992 true_expression = expression->condition;
2993 return expression_to_firm(true_expression);
2995 return expression_to_firm(expression->false_expression);
2999 ir_node *const true_block = new_immBlock();
3000 ir_node *const false_block = new_immBlock();
3001 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3002 mature_immBlock(true_block);
3003 mature_immBlock(false_block);
3005 set_cur_block(true_block);
3007 if (expression->true_expression != NULL) {
3008 true_val = expression_to_firm(expression->true_expression);
3009 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3010 true_val = cond_expr;
3012 /* Condition ended with a short circuit (&&, ||, !) operation or a
3013 * comparison. Generate a "1" as value for the true branch. */
3014 true_val = new_Const(get_mode_one(mode_Is));
3016 ir_node *const true_jmp = new_d_Jmp(dbgi);
3018 set_cur_block(false_block);
3019 ir_node *const false_val = expression_to_firm(expression->false_expression);
3020 ir_node *const false_jmp = new_d_Jmp(dbgi);
3022 /* create the common block */
3023 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3024 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3025 set_cur_block(block);
3027 /* TODO improve static semantics, so either both or no values are NULL */
3028 if (true_val == NULL || false_val == NULL)
3031 ir_node *const in[2] = { true_val, false_val };
3032 type_t *const type = skip_typeref(expression->base.type);
3034 if (is_type_compound(type)) {
3037 mode = get_ir_mode_arithmetic(type);
3039 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3045 * Returns an IR-node representing the address of a field.
3047 static ir_node *select_addr(const select_expression_t *expression)
3049 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3051 construct_select_compound(expression);
3053 ir_node *compound_addr = expression_to_firm(expression->compound);
3055 entity_t *entry = expression->compound_entry;
3056 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3057 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3059 if (constant_folding) {
3060 ir_mode *mode = get_irn_mode(compound_addr);
3061 /* FIXME: here, we need an integer mode with the same number of bits as mode */
3062 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3063 return new_d_Add(dbgi, compound_addr, ofs, mode);
3065 ir_entity *irentity = entry->compound_member.entity;
3066 assert(irentity != NULL);
3067 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3071 static ir_node *select_to_firm(const select_expression_t *expression)
3073 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3074 ir_node *addr = select_addr(expression);
3075 type_t *type = revert_automatic_type_conversion(
3076 (const expression_t*) expression);
3077 type = skip_typeref(type);
3079 entity_t *entry = expression->compound_entry;
3080 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3082 if (entry->compound_member.bitfield) {
3083 return bitfield_extract_to_firm(expression, addr);
3086 return deref_address(dbgi, type, addr);
3089 /* Values returned by __builtin_classify_type. */
3090 typedef enum gcc_type_class
3096 enumeral_type_class,
3099 reference_type_class,
3103 function_type_class,
3114 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3116 type_t *type = expr->type_expression->base.type;
3118 /* FIXME gcc returns different values depending on whether compiling C or C++
3119 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3122 type = skip_typeref(type);
3123 switch (type->kind) {
3125 const atomic_type_t *const atomic_type = &type->atomic;
3126 switch (atomic_type->akind) {
3127 /* should not be reached */
3128 case ATOMIC_TYPE_INVALID:
3132 /* gcc cannot do that */
3133 case ATOMIC_TYPE_VOID:
3134 tc = void_type_class;
3137 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3138 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3139 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3140 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3141 case ATOMIC_TYPE_SHORT:
3142 case ATOMIC_TYPE_USHORT:
3143 case ATOMIC_TYPE_INT:
3144 case ATOMIC_TYPE_UINT:
3145 case ATOMIC_TYPE_LONG:
3146 case ATOMIC_TYPE_ULONG:
3147 case ATOMIC_TYPE_LONGLONG:
3148 case ATOMIC_TYPE_ULONGLONG:
3149 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3150 tc = integer_type_class;
3153 case ATOMIC_TYPE_FLOAT:
3154 case ATOMIC_TYPE_DOUBLE:
3155 case ATOMIC_TYPE_LONG_DOUBLE:
3156 tc = real_type_class;
3159 panic("Unexpected atomic type in classify_type_to_firm().");
3162 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3163 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3164 case TYPE_ARRAY: /* gcc handles this as pointer */
3165 case TYPE_FUNCTION: /* gcc handles this as pointer */
3166 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3167 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3168 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3170 /* gcc handles this as integer */
3171 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3173 /* gcc classifies the referenced type */
3174 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3176 /* typedef/typeof should be skipped already */
3182 panic("unexpected TYPE classify_type_to_firm().");
3186 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3187 ir_tarval *const tv = new_tarval_from_long(tc, mode_int);
3188 return new_d_Const(dbgi, tv);
3191 static ir_node *function_name_to_firm(
3192 const funcname_expression_t *const expr)
3194 switch(expr->kind) {
3195 case FUNCNAME_FUNCTION:
3196 case FUNCNAME_PRETTY_FUNCTION:
3197 case FUNCNAME_FUNCDNAME:
3198 if (current_function_name == NULL) {
3199 const source_position_t *const src_pos = &expr->base.source_position;
3200 const char *name = current_function_entity->base.symbol->string;
3201 const string_t string = { name, strlen(name) + 1 };
3202 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3204 return current_function_name;
3205 case FUNCNAME_FUNCSIG:
3206 if (current_funcsig == NULL) {
3207 const source_position_t *const src_pos = &expr->base.source_position;
3208 ir_entity *ent = get_irg_entity(current_ir_graph);
3209 const char *const name = get_entity_ld_name(ent);
3210 const string_t string = { name, strlen(name) + 1 };
3211 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3213 return current_funcsig;
3215 panic("Unsupported function name");
3218 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3220 statement_t *statement = expr->statement;
3222 assert(statement->kind == STATEMENT_COMPOUND);
3223 return compound_statement_to_firm(&statement->compound);
3226 static ir_node *va_start_expression_to_firm(
3227 const va_start_expression_t *const expr)
3229 ir_entity *param_ent = current_vararg_entity;
3230 if (param_ent == NULL) {
3231 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3232 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3233 ir_type *const param_type = get_unknown_type();
3234 param_ent = new_parameter_entity(frame_type, n, param_type);
3235 current_vararg_entity = param_ent;
3238 ir_node *const frame = get_irg_frame(current_ir_graph);
3239 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3240 ir_node *const no_mem = new_NoMem();
3241 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3243 set_value_for_expression(expr->ap, arg_sel);
3248 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3250 type_t *const type = expr->base.type;
3251 expression_t *const ap_expr = expr->ap;
3252 ir_node *const ap_addr = expression_to_addr(ap_expr);
3253 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3254 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3255 ir_node *const res = deref_address(dbgi, type, ap);
3257 ir_node *const cnst = get_type_size_node(expr->base.type);
3258 ir_mode *const mode = get_irn_mode(cnst);
3259 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3260 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3261 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3262 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3263 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3265 set_value_for_expression_addr(ap_expr, add, ap_addr);
3271 * Generate Firm for a va_copy expression.
3273 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3275 ir_node *const src = expression_to_firm(expr->src);
3276 set_value_for_expression(expr->dst, src);
3280 static ir_node *dereference_addr(const unary_expression_t *const expression)
3282 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3283 return expression_to_firm(expression->value);
3287 * Returns a IR-node representing an lvalue of the given expression.
3289 static ir_node *expression_to_addr(const expression_t *expression)
3291 switch(expression->kind) {
3292 case EXPR_ARRAY_ACCESS:
3293 return array_access_addr(&expression->array_access);
3295 return call_expression_to_firm(&expression->call);
3296 case EXPR_COMPOUND_LITERAL:
3297 return compound_literal_to_firm(&expression->compound_literal);
3298 case EXPR_REFERENCE:
3299 return reference_addr(&expression->reference);
3301 return select_addr(&expression->select);
3302 case EXPR_UNARY_DEREFERENCE:
3303 return dereference_addr(&expression->unary);
3307 panic("trying to get address of non-lvalue");
3310 static ir_node *builtin_constant_to_firm(
3311 const builtin_constant_expression_t *expression)
3313 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3314 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3315 return create_Const_from_bool(mode, v);
3318 static ir_node *builtin_types_compatible_to_firm(
3319 const builtin_types_compatible_expression_t *expression)
3321 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3322 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3323 bool const value = types_compatible(left, right);
3324 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3325 return create_Const_from_bool(mode, value);
3328 static ir_node *get_label_block(label_t *label)
3330 if (label->block != NULL)
3331 return label->block;
3333 /* beware: might be called from create initializer with current_ir_graph
3334 * set to const_code_irg. */
3335 ir_graph *rem = current_ir_graph;
3336 current_ir_graph = current_function;
3338 ir_node *block = new_immBlock();
3340 label->block = block;
3342 ARR_APP1(label_t *, all_labels, label);
3344 current_ir_graph = rem;
3349 * Pointer to a label. This is used for the
3350 * GNU address-of-label extension.
3352 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3354 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3355 ir_node *block = get_label_block(label->label);
3356 ir_entity *entity = create_Block_entity(block);
3358 symconst_symbol value;
3359 value.entity_p = entity;
3360 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3363 static ir_node *error_to_firm(const expression_t *expression)
3365 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3366 return new_Bad(mode);
3370 * creates firm nodes for an expression. The difference between this function
3371 * and expression_to_firm is, that this version might produce mode_b nodes
3372 * instead of mode_Is.
3374 static ir_node *_expression_to_firm(const expression_t *expression)
3377 if (!constant_folding) {
3378 assert(!expression->base.transformed);
3379 ((expression_t*) expression)->base.transformed = true;
3383 switch (expression->kind) {
3385 return literal_to_firm(&expression->literal);
3386 case EXPR_STRING_LITERAL:
3387 return string_to_firm(&expression->base.source_position, "str.%u",
3388 &expression->literal.value);
3389 case EXPR_WIDE_STRING_LITERAL:
3390 return wide_string_literal_to_firm(&expression->string_literal);
3391 case EXPR_REFERENCE:
3392 return reference_expression_to_firm(&expression->reference);
3393 case EXPR_REFERENCE_ENUM_VALUE:
3394 return reference_expression_enum_value_to_firm(&expression->reference);
3396 return call_expression_to_firm(&expression->call);
3398 return unary_expression_to_firm(&expression->unary);
3400 return binary_expression_to_firm(&expression->binary);
3401 case EXPR_ARRAY_ACCESS:
3402 return array_access_to_firm(&expression->array_access);
3404 return sizeof_to_firm(&expression->typeprop);
3406 return alignof_to_firm(&expression->typeprop);
3407 case EXPR_CONDITIONAL:
3408 return conditional_to_firm(&expression->conditional);
3410 return select_to_firm(&expression->select);
3411 case EXPR_CLASSIFY_TYPE:
3412 return classify_type_to_firm(&expression->classify_type);
3414 return function_name_to_firm(&expression->funcname);
3415 case EXPR_STATEMENT:
3416 return statement_expression_to_firm(&expression->statement);
3418 return va_start_expression_to_firm(&expression->va_starte);
3420 return va_arg_expression_to_firm(&expression->va_arge);
3422 return va_copy_expression_to_firm(&expression->va_copye);
3423 case EXPR_BUILTIN_CONSTANT_P:
3424 return builtin_constant_to_firm(&expression->builtin_constant);
3425 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
3426 return builtin_types_compatible_to_firm(&expression->builtin_types_compatible);
3428 return offsetof_to_firm(&expression->offsetofe);
3429 case EXPR_COMPOUND_LITERAL:
3430 return compound_literal_to_firm(&expression->compound_literal);
3431 case EXPR_LABEL_ADDRESS:
3432 return label_address_to_firm(&expression->label_address);
3435 return error_to_firm(expression);
3437 panic("invalid expression found");
3441 * Check if a given expression is a GNU __builtin_expect() call.
3443 static bool is_builtin_expect(const expression_t *expression)
3445 if (expression->kind != EXPR_CALL)
3448 expression_t *function = expression->call.function;
3449 if (function->kind != EXPR_REFERENCE)
3451 reference_expression_t *ref = &function->reference;
3452 if (ref->entity->kind != ENTITY_FUNCTION ||
3453 ref->entity->function.btk != BUILTIN_EXPECT)
3459 static bool produces_mode_b(const expression_t *expression)
3461 switch (expression->kind) {
3462 case EXPR_BINARY_EQUAL:
3463 case EXPR_BINARY_NOTEQUAL:
3464 case EXPR_BINARY_LESS:
3465 case EXPR_BINARY_LESSEQUAL:
3466 case EXPR_BINARY_GREATER:
3467 case EXPR_BINARY_GREATEREQUAL:
3468 case EXPR_BINARY_ISGREATER:
3469 case EXPR_BINARY_ISGREATEREQUAL:
3470 case EXPR_BINARY_ISLESS:
3471 case EXPR_BINARY_ISLESSEQUAL:
3472 case EXPR_BINARY_ISLESSGREATER:
3473 case EXPR_BINARY_ISUNORDERED:
3474 case EXPR_UNARY_NOT:
3478 if (is_builtin_expect(expression)) {
3479 expression_t *argument = expression->call.arguments->expression;
3480 return produces_mode_b(argument);
3483 case EXPR_BINARY_COMMA:
3484 return produces_mode_b(expression->binary.right);
3491 static ir_node *expression_to_firm(const expression_t *expression)
3493 if (!produces_mode_b(expression)) {
3494 ir_node *res = _expression_to_firm(expression);
3495 assert(res == NULL || get_irn_mode(res) != mode_b);
3499 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3500 bool const constant_folding_old = constant_folding;
3501 constant_folding = true;
3502 ir_node *res = _expression_to_firm(expression);
3503 constant_folding = constant_folding_old;
3504 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3505 assert(is_Const(res));
3506 return create_Const_from_bool(mode, !is_Const_null(res));
3509 /* we have to produce a 0/1 from the mode_b expression */
3510 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3511 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3512 return produce_condition_result(expression, mode, dbgi);
3516 * create a short-circuit expression evaluation that tries to construct
3517 * efficient control flow structures for &&, || and ! expressions
3519 static ir_node *create_condition_evaluation(const expression_t *expression,
3520 ir_node *true_block,
3521 ir_node *false_block)
3523 switch(expression->kind) {
3524 case EXPR_UNARY_NOT: {
3525 const unary_expression_t *unary_expression = &expression->unary;
3526 create_condition_evaluation(unary_expression->value, false_block,
3530 case EXPR_BINARY_LOGICAL_AND: {
3531 const binary_expression_t *binary_expression = &expression->binary;
3533 ir_node *extra_block = new_immBlock();
3534 create_condition_evaluation(binary_expression->left, extra_block,
3536 mature_immBlock(extra_block);
3537 set_cur_block(extra_block);
3538 create_condition_evaluation(binary_expression->right, true_block,
3542 case EXPR_BINARY_LOGICAL_OR: {
3543 const binary_expression_t *binary_expression = &expression->binary;
3545 ir_node *extra_block = new_immBlock();
3546 create_condition_evaluation(binary_expression->left, true_block,
3548 mature_immBlock(extra_block);
3549 set_cur_block(extra_block);
3550 create_condition_evaluation(binary_expression->right, true_block,
3558 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3559 ir_node *cond_expr = _expression_to_firm(expression);
3560 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3561 ir_node *cond = new_d_Cond(dbgi, condition);
3562 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3563 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3565 /* set branch prediction info based on __builtin_expect */
3566 if (is_builtin_expect(expression) && is_Cond(cond)) {
3567 call_argument_t *argument = expression->call.arguments->next;
3568 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3569 bool const cnst = fold_constant_to_bool(argument->expression);
3570 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3571 set_Cond_jmp_pred(cond, pred);
3575 add_immBlock_pred(true_block, true_proj);
3576 add_immBlock_pred(false_block, false_proj);
3578 set_unreachable_now();
3582 static void create_variable_entity(entity_t *variable,
3583 declaration_kind_t declaration_kind,
3584 ir_type *parent_type)
3586 assert(variable->kind == ENTITY_VARIABLE);
3587 type_t *type = skip_typeref(variable->declaration.type);
3589 ident *const id = new_id_from_str(variable->base.symbol->string);
3590 ir_type *const irtype = get_ir_type(type);
3591 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3592 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3593 unsigned alignment = variable->declaration.alignment;
3595 set_entity_alignment(irentity, alignment);
3597 handle_decl_modifiers(irentity, variable);
3599 variable->declaration.kind = (unsigned char) declaration_kind;
3600 variable->variable.v.entity = irentity;
3601 set_entity_ld_ident(irentity, create_ld_ident(variable));
3603 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3604 set_entity_volatility(irentity, volatility_is_volatile);
3609 typedef struct type_path_entry_t type_path_entry_t;
3610 struct type_path_entry_t {
3612 ir_initializer_t *initializer;
3614 entity_t *compound_entry;
3617 typedef struct type_path_t type_path_t;
3618 struct type_path_t {
3619 type_path_entry_t *path;
3624 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3626 size_t len = ARR_LEN(path->path);
3628 for (size_t i = 0; i < len; ++i) {
3629 const type_path_entry_t *entry = & path->path[i];
3631 type_t *type = skip_typeref(entry->type);
3632 if (is_type_compound(type)) {
3633 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3634 } else if (is_type_array(type)) {
3635 fprintf(stderr, "[%u]", (unsigned) entry->index);
3637 fprintf(stderr, "-INVALID-");
3640 fprintf(stderr, " (");
3641 print_type(path->top_type);
3642 fprintf(stderr, ")");
3645 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3647 size_t len = ARR_LEN(path->path);
3649 return & path->path[len-1];
3652 static type_path_entry_t *append_to_type_path(type_path_t *path)
3654 size_t len = ARR_LEN(path->path);
3655 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3657 type_path_entry_t *result = & path->path[len];
3658 memset(result, 0, sizeof(result[0]));
3662 static size_t get_compound_member_count(const compound_type_t *type)
3664 compound_t *compound = type->compound;
3665 size_t n_members = 0;
3666 entity_t *member = compound->members.entities;
3667 for ( ; member != NULL; member = member->base.next) {
3674 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3676 type_t *orig_top_type = path->top_type;
3677 type_t *top_type = skip_typeref(orig_top_type);
3679 assert(is_type_compound(top_type) || is_type_array(top_type));
3681 if (ARR_LEN(path->path) == 0) {
3684 type_path_entry_t *top = get_type_path_top(path);
3685 ir_initializer_t *initializer = top->initializer;
3686 return get_initializer_compound_value(initializer, top->index);
3690 static void descend_into_subtype(type_path_t *path)
3692 type_t *orig_top_type = path->top_type;
3693 type_t *top_type = skip_typeref(orig_top_type);
3695 assert(is_type_compound(top_type) || is_type_array(top_type));
3697 ir_initializer_t *initializer = get_initializer_entry(path);
3699 type_path_entry_t *top = append_to_type_path(path);
3700 top->type = top_type;
3704 if (is_type_compound(top_type)) {
3705 compound_t *const compound = top_type->compound.compound;
3706 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3708 top->compound_entry = entry;
3710 len = get_compound_member_count(&top_type->compound);
3711 if (entry != NULL) {
3712 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3713 path->top_type = entry->declaration.type;
3716 assert(is_type_array(top_type));
3717 assert(top_type->array.size > 0);
3720 path->top_type = top_type->array.element_type;
3721 len = top_type->array.size;
3723 if (initializer == NULL
3724 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3725 initializer = create_initializer_compound(len);
3726 /* we have to set the entry at the 2nd latest path entry... */
3727 size_t path_len = ARR_LEN(path->path);
3728 assert(path_len >= 1);
3730 type_path_entry_t *entry = & path->path[path_len-2];
3731 ir_initializer_t *tinitializer = entry->initializer;
3732 set_initializer_compound_value(tinitializer, entry->index,
3736 top->initializer = initializer;
3739 static void ascend_from_subtype(type_path_t *path)
3741 type_path_entry_t *top = get_type_path_top(path);
3743 path->top_type = top->type;
3745 size_t len = ARR_LEN(path->path);
3746 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3749 static void walk_designator(type_path_t *path, const designator_t *designator)
3751 /* designators start at current object type */
3752 ARR_RESIZE(type_path_entry_t, path->path, 1);
3754 for ( ; designator != NULL; designator = designator->next) {
3755 type_path_entry_t *top = get_type_path_top(path);
3756 type_t *orig_type = top->type;
3757 type_t *type = skip_typeref(orig_type);
3759 if (designator->symbol != NULL) {
3760 assert(is_type_compound(type));
3762 symbol_t *symbol = designator->symbol;
3764 compound_t *compound = type->compound.compound;
3765 entity_t *iter = compound->members.entities;
3766 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3767 if (iter->base.symbol == symbol) {
3768 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3772 assert(iter != NULL);
3774 /* revert previous initialisations of other union elements */
3775 if (type->kind == TYPE_COMPOUND_UNION) {
3776 ir_initializer_t *initializer = top->initializer;
3777 if (initializer != NULL
3778 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3779 /* are we writing to a new element? */
3780 ir_initializer_t *oldi
3781 = get_initializer_compound_value(initializer, index);
3782 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3783 /* clear initializer */
3785 = get_initializer_compound_n_entries(initializer);
3786 ir_initializer_t *nulli = get_initializer_null();
3787 for (size_t i = 0; i < len; ++i) {
3788 set_initializer_compound_value(initializer, i,
3795 top->type = orig_type;
3796 top->compound_entry = iter;
3798 orig_type = iter->declaration.type;
3800 expression_t *array_index = designator->array_index;
3801 assert(designator->array_index != NULL);
3802 assert(is_type_array(type));
3804 long index = fold_constant_to_int(array_index);
3807 if (type->array.size_constant) {
3808 long array_size = type->array.size;
3809 assert(index < array_size);
3813 top->type = orig_type;
3814 top->index = (size_t) index;
3815 orig_type = type->array.element_type;
3817 path->top_type = orig_type;
3819 if (designator->next != NULL) {
3820 descend_into_subtype(path);
3824 path->invalid = false;
3827 static void advance_current_object(type_path_t *path)
3829 if (path->invalid) {
3830 /* TODO: handle this... */
3831 panic("invalid initializer in ast2firm (excessive elements)");
3834 type_path_entry_t *top = get_type_path_top(path);
3836 type_t *type = skip_typeref(top->type);
3837 if (is_type_union(type)) {
3838 /* only the first element is initialized in unions */
3839 top->compound_entry = NULL;
3840 } else if (is_type_struct(type)) {
3841 entity_t *entry = top->compound_entry;
3844 entry = skip_unnamed_bitfields(entry->base.next);
3845 top->compound_entry = entry;
3846 if (entry != NULL) {
3847 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3848 path->top_type = entry->declaration.type;
3852 assert(is_type_array(type));
3855 if (!type->array.size_constant || top->index < type->array.size) {
3860 /* we're past the last member of the current sub-aggregate, try if we
3861 * can ascend in the type hierarchy and continue with another subobject */
3862 size_t len = ARR_LEN(path->path);
3865 ascend_from_subtype(path);
3866 advance_current_object(path);
3868 path->invalid = true;
3873 static ir_initializer_t *create_ir_initializer(
3874 const initializer_t *initializer, type_t *type);
3876 static ir_initializer_t *create_ir_initializer_value(
3877 const initializer_value_t *initializer)
3879 if (is_type_compound(initializer->value->base.type)) {
3880 panic("initializer creation for compounds not implemented yet");
3882 type_t *type = initializer->value->base.type;
3883 expression_t *expr = initializer->value;
3884 ir_node *value = expression_to_firm(expr);
3885 ir_mode *mode = get_ir_mode_storage(type);
3886 value = create_conv(NULL, value, mode);
3887 return create_initializer_const(value);
3890 /** test wether type can be initialized by a string constant */
3891 static bool is_string_type(type_t *type)
3894 if (is_type_pointer(type)) {
3895 inner = skip_typeref(type->pointer.points_to);
3896 } else if(is_type_array(type)) {
3897 inner = skip_typeref(type->array.element_type);
3902 return is_type_integer(inner);
3905 static ir_initializer_t *create_ir_initializer_list(
3906 const initializer_list_t *initializer, type_t *type)
3909 memset(&path, 0, sizeof(path));
3910 path.top_type = type;
3911 path.path = NEW_ARR_F(type_path_entry_t, 0);
3913 descend_into_subtype(&path);
3915 for (size_t i = 0; i < initializer->len; ++i) {
3916 const initializer_t *sub_initializer = initializer->initializers[i];
3918 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3919 walk_designator(&path, sub_initializer->designator.designator);
3923 if (sub_initializer->kind == INITIALIZER_VALUE) {
3924 /* we might have to descend into types until we're at a scalar
3927 type_t *orig_top_type = path.top_type;
3928 type_t *top_type = skip_typeref(orig_top_type);
3930 if (is_type_scalar(top_type))
3932 descend_into_subtype(&path);
3934 } else if (sub_initializer->kind == INITIALIZER_STRING
3935 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3936 /* we might have to descend into types until we're at a scalar
3939 type_t *orig_top_type = path.top_type;
3940 type_t *top_type = skip_typeref(orig_top_type);
3942 if (is_string_type(top_type))
3944 descend_into_subtype(&path);
3948 ir_initializer_t *sub_irinitializer
3949 = create_ir_initializer(sub_initializer, path.top_type);
3951 size_t path_len = ARR_LEN(path.path);
3952 assert(path_len >= 1);
3953 type_path_entry_t *entry = & path.path[path_len-1];
3954 ir_initializer_t *tinitializer = entry->initializer;
3955 set_initializer_compound_value(tinitializer, entry->index,
3958 advance_current_object(&path);
3961 assert(ARR_LEN(path.path) >= 1);
3962 ir_initializer_t *result = path.path[0].initializer;
3963 DEL_ARR_F(path.path);
3968 static ir_initializer_t *create_ir_initializer_string(
3969 const initializer_string_t *initializer, type_t *type)
3971 type = skip_typeref(type);
3973 size_t string_len = initializer->string.size;
3974 assert(type->kind == TYPE_ARRAY);
3975 assert(type->array.size_constant);
3976 size_t len = type->array.size;
3977 ir_initializer_t *irinitializer = create_initializer_compound(len);
3979 const char *string = initializer->string.begin;
3980 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
3982 for (size_t i = 0; i < len; ++i) {
3987 ir_tarval *tv = new_tarval_from_long(c, mode);
3988 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
3990 set_initializer_compound_value(irinitializer, i, char_initializer);
3993 return irinitializer;
3996 static ir_initializer_t *create_ir_initializer_wide_string(
3997 const initializer_wide_string_t *initializer, type_t *type)
3999 assert(type->kind == TYPE_ARRAY);
4000 assert(type->array.size_constant);
4001 size_t len = type->array.size;
4002 size_t string_len = wstrlen(&initializer->string);
4003 ir_initializer_t *irinitializer = create_initializer_compound(len);
4005 const char *p = initializer->string.begin;
4006 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4008 for (size_t i = 0; i < len; ++i) {
4010 if (i < string_len) {
4011 c = read_utf8_char(&p);
4013 ir_tarval *tv = new_tarval_from_long(c, mode);
4014 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4016 set_initializer_compound_value(irinitializer, i, char_initializer);
4019 return irinitializer;
4022 static ir_initializer_t *create_ir_initializer(
4023 const initializer_t *initializer, type_t *type)
4025 switch(initializer->kind) {
4026 case INITIALIZER_STRING:
4027 return create_ir_initializer_string(&initializer->string, type);
4029 case INITIALIZER_WIDE_STRING:
4030 return create_ir_initializer_wide_string(&initializer->wide_string,
4033 case INITIALIZER_LIST:
4034 return create_ir_initializer_list(&initializer->list, type);
4036 case INITIALIZER_VALUE:
4037 return create_ir_initializer_value(&initializer->value);
4039 case INITIALIZER_DESIGNATOR:
4040 panic("unexpected designator initializer found");
4042 panic("unknown initializer");
4045 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4046 * are elements [...] the remainder of the aggregate shall be initialized
4047 * implicitly the same as objects that have static storage duration. */
4048 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4051 /* for unions we must NOT do anything for null initializers */
4052 ir_type *owner = get_entity_owner(entity);
4053 if (is_Union_type(owner)) {
4057 ir_type *ent_type = get_entity_type(entity);
4058 /* create sub-initializers for a compound type */
4059 if (is_compound_type(ent_type)) {
4060 unsigned n_members = get_compound_n_members(ent_type);
4061 for (unsigned n = 0; n < n_members; ++n) {
4062 ir_entity *member = get_compound_member(ent_type, n);
4063 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4065 create_dynamic_null_initializer(member, dbgi, addr);
4069 if (is_Array_type(ent_type)) {
4070 assert(has_array_upper_bound(ent_type, 0));
4071 long n = get_array_upper_bound_int(ent_type, 0);
4072 for (long i = 0; i < n; ++i) {
4073 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4074 ir_node *cnst = new_d_Const(dbgi, index_tv);
4075 ir_node *in[1] = { cnst };
4076 ir_entity *arrent = get_array_element_entity(ent_type);
4077 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4079 create_dynamic_null_initializer(arrent, dbgi, addr);
4084 ir_mode *value_mode = get_type_mode(ent_type);
4085 ir_node *node = new_Const(get_mode_null(value_mode));
4087 /* is it a bitfield type? */
4088 if (is_Primitive_type(ent_type) &&
4089 get_primitive_base_type(ent_type) != NULL) {
4090 bitfield_store_to_firm(dbgi, entity, base_addr, node, false);
4094 ir_node *mem = get_store();
4095 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4096 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4100 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4101 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4103 switch(get_initializer_kind(initializer)) {
4104 case IR_INITIALIZER_NULL:
4105 create_dynamic_null_initializer(entity, dbgi, base_addr);
4107 case IR_INITIALIZER_CONST: {
4108 ir_node *node = get_initializer_const_value(initializer);
4109 ir_type *ent_type = get_entity_type(entity);
4111 /* is it a bitfield type? */
4112 if (is_Primitive_type(ent_type) &&
4113 get_primitive_base_type(ent_type) != NULL) {
4114 bitfield_store_to_firm(dbgi, entity, base_addr, node, false);
4118 assert(get_type_mode(type) == get_irn_mode(node));
4119 ir_node *mem = get_store();
4120 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4121 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4125 case IR_INITIALIZER_TARVAL: {
4126 ir_tarval *tv = get_initializer_tarval_value(initializer);
4127 ir_node *cnst = new_d_Const(dbgi, tv);
4128 ir_type *ent_type = get_entity_type(entity);
4130 /* is it a bitfield type? */
4131 if (is_Primitive_type(ent_type) &&
4132 get_primitive_base_type(ent_type) != NULL) {
4133 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false);
4137 assert(get_type_mode(type) == get_tarval_mode(tv));
4138 ir_node *mem = get_store();
4139 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4140 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4144 case IR_INITIALIZER_COMPOUND: {
4145 assert(is_compound_type(type) || is_Array_type(type));
4147 if (is_Array_type(type)) {
4148 assert(has_array_upper_bound(type, 0));
4149 n_members = get_array_upper_bound_int(type, 0);
4151 n_members = get_compound_n_members(type);
4154 if (get_initializer_compound_n_entries(initializer)
4155 != (unsigned) n_members)
4156 panic("initializer doesn't match compound type");
4158 for (int i = 0; i < n_members; ++i) {
4161 ir_entity *sub_entity;
4162 if (is_Array_type(type)) {
4163 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4164 ir_node *cnst = new_d_Const(dbgi, index_tv);
4165 ir_node *in[1] = { cnst };
4166 irtype = get_array_element_type(type);
4167 sub_entity = get_array_element_entity(type);
4168 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4171 sub_entity = get_compound_member(type, i);
4172 irtype = get_entity_type(sub_entity);
4173 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4177 ir_initializer_t *sub_init
4178 = get_initializer_compound_value(initializer, i);
4180 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4187 panic("invalid IR_INITIALIZER found");
4190 static void create_dynamic_initializer(ir_initializer_t *initializer,
4191 dbg_info *dbgi, ir_entity *entity)
4193 ir_node *frame = get_irg_frame(current_ir_graph);
4194 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4195 ir_type *type = get_entity_type(entity);
4197 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4200 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4201 ir_entity *entity, type_t *type)
4203 ir_node *memory = get_store();
4204 ir_node *nomem = new_NoMem();
4205 ir_node *frame = get_irg_frame(current_ir_graph);
4206 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4208 if (initializer->kind == INITIALIZER_VALUE) {
4209 initializer_value_t *initializer_value = &initializer->value;
4211 ir_node *value = expression_to_firm(initializer_value->value);
4212 type = skip_typeref(type);
4213 assign_value(dbgi, addr, type, value);
4217 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4218 ir_initializer_t *irinitializer
4219 = create_ir_initializer(initializer, type);
4221 create_dynamic_initializer(irinitializer, dbgi, entity);
4225 /* create the ir_initializer */
4226 ir_graph *const old_current_ir_graph = current_ir_graph;
4227 current_ir_graph = get_const_code_irg();
4229 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
4231 assert(current_ir_graph == get_const_code_irg());
4232 current_ir_graph = old_current_ir_graph;
4234 /* create a "template" entity which is copied to the entity on the stack */
4235 ident *const id = id_unique("initializer.%u");
4236 ir_type *const irtype = get_ir_type(type);
4237 ir_type *const global_type = get_glob_type();
4238 ir_entity *const init_entity = new_d_entity(global_type, id, irtype, dbgi);
4239 set_entity_ld_ident(init_entity, id);
4241 set_entity_visibility(init_entity, ir_visibility_private);
4242 add_entity_linkage(init_entity, IR_LINKAGE_CONSTANT);
4244 set_entity_initializer(init_entity, irinitializer);
4246 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4247 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4249 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4250 set_store(copyb_mem);
4253 static void create_initializer_local_variable_entity(entity_t *entity)
4255 assert(entity->kind == ENTITY_VARIABLE);
4256 initializer_t *initializer = entity->variable.initializer;
4257 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4258 ir_entity *irentity = entity->variable.v.entity;
4259 type_t *type = entity->declaration.type;
4261 create_local_initializer(initializer, dbgi, irentity, type);
4264 static void create_variable_initializer(entity_t *entity)
4266 assert(entity->kind == ENTITY_VARIABLE);
4267 initializer_t *initializer = entity->variable.initializer;
4268 if (initializer == NULL)
4271 declaration_kind_t declaration_kind
4272 = (declaration_kind_t) entity->declaration.kind;
4273 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4274 create_initializer_local_variable_entity(entity);
4278 type_t *type = entity->declaration.type;
4279 type_qualifiers_t tq = get_type_qualifier(type, true);
4281 if (initializer->kind == INITIALIZER_VALUE) {
4282 initializer_value_t *initializer_value = &initializer->value;
4283 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4285 ir_node *value = expression_to_firm(initializer_value->value);
4287 type_t *init_type = initializer_value->value->base.type;
4288 ir_mode *mode = get_ir_mode_storage(init_type);
4289 value = create_conv(dbgi, value, mode);
4290 value = do_strict_conv(dbgi, value);
4292 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4293 set_value(entity->variable.v.value_number, value);
4295 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4297 ir_entity *irentity = entity->variable.v.entity;
4299 if (tq & TYPE_QUALIFIER_CONST
4300 && get_entity_owner(irentity) != get_tls_type()) {
4301 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4303 set_atomic_ent_value(irentity, value);
4306 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4307 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4309 ir_entity *irentity = entity->variable.v.entity;
4310 ir_initializer_t *irinitializer
4311 = create_ir_initializer(initializer, type);
4313 if (tq & TYPE_QUALIFIER_CONST) {
4314 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4316 set_entity_initializer(irentity, irinitializer);
4320 static void create_variable_length_array(entity_t *entity)
4322 assert(entity->kind == ENTITY_VARIABLE);
4323 assert(entity->variable.initializer == NULL);
4325 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4326 entity->variable.v.vla_base = NULL;
4328 /* TODO: record VLA somewhere so we create the free node when we leave
4332 static void allocate_variable_length_array(entity_t *entity)
4334 assert(entity->kind == ENTITY_VARIABLE);
4335 assert(entity->variable.initializer == NULL);
4336 assert(currently_reachable());
4338 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4339 type_t *type = entity->declaration.type;
4340 ir_type *el_type = get_ir_type(type->array.element_type);
4342 /* make sure size_node is calculated */
4343 get_type_size_node(type);
4344 ir_node *elems = type->array.size_node;
4345 ir_node *mem = get_store();
4346 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4348 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4349 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4352 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4353 entity->variable.v.vla_base = addr;
4357 * Creates a Firm local variable from a declaration.
4359 static void create_local_variable(entity_t *entity)
4361 assert(entity->kind == ENTITY_VARIABLE);
4362 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4364 bool needs_entity = entity->variable.address_taken;
4365 type_t *type = skip_typeref(entity->declaration.type);
4367 /* is it a variable length array? */
4368 if (is_type_array(type) && !type->array.size_constant) {
4369 create_variable_length_array(entity);
4371 } else if (is_type_array(type) || is_type_compound(type)) {
4372 needs_entity = true;
4373 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4374 needs_entity = true;
4378 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4379 create_variable_entity(entity,
4380 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4383 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4384 entity->variable.v.value_number = next_value_number_function;
4385 set_irg_loc_description(current_ir_graph, next_value_number_function,
4387 ++next_value_number_function;
4391 static void create_local_static_variable(entity_t *entity)
4393 assert(entity->kind == ENTITY_VARIABLE);
4394 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4396 type_t *type = skip_typeref(entity->declaration.type);
4397 ir_type *const var_type = entity->variable.thread_local ?
4398 get_tls_type() : get_glob_type();
4399 ir_type *const irtype = get_ir_type(type);
4400 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4402 size_t l = strlen(entity->base.symbol->string);
4403 char buf[l + sizeof(".%u")];
4404 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4405 ident *const id = id_unique(buf);
4406 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4408 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4409 set_entity_volatility(irentity, volatility_is_volatile);
4412 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4413 entity->variable.v.entity = irentity;
4415 set_entity_ld_ident(irentity, id);
4416 set_entity_visibility(irentity, ir_visibility_local);
4418 ir_graph *const old_current_ir_graph = current_ir_graph;
4419 current_ir_graph = get_const_code_irg();
4421 create_variable_initializer(entity);
4423 assert(current_ir_graph == get_const_code_irg());
4424 current_ir_graph = old_current_ir_graph;
4429 static void return_statement_to_firm(return_statement_t *statement)
4431 if (!currently_reachable())
4434 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4435 type_t *type = current_function_entity->declaration.type;
4436 ir_type *func_irtype = get_ir_type(type);
4440 if (get_method_n_ress(func_irtype) > 0) {
4441 ir_type *res_type = get_method_res_type(func_irtype, 0);
4443 if (statement->value != NULL) {
4444 ir_node *node = expression_to_firm(statement->value);
4445 if (!is_compound_type(res_type)) {
4446 type_t *ret_value_type = statement->value->base.type;
4447 ir_mode *mode = get_ir_mode_storage(ret_value_type);
4448 node = create_conv(dbgi, node, mode);
4449 node = do_strict_conv(dbgi, node);
4454 if (is_compound_type(res_type)) {
4457 mode = get_type_mode(res_type);
4459 in[0] = new_Unknown(mode);
4463 /* build return_value for its side effects */
4464 if (statement->value != NULL) {
4465 expression_to_firm(statement->value);
4470 ir_node *store = get_store();
4471 ir_node *ret = new_d_Return(dbgi, store, in_len, in);
4473 ir_node *end_block = get_irg_end_block(current_ir_graph);
4474 add_immBlock_pred(end_block, ret);
4476 set_unreachable_now();
4479 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4481 if (!currently_reachable())
4484 return expression_to_firm(statement->expression);
4487 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4489 entity_t *entity = compound->scope.entities;
4490 for ( ; entity != NULL; entity = entity->base.next) {
4491 if (!is_declaration(entity))
4494 create_local_declaration(entity);
4497 ir_node *result = NULL;
4498 statement_t *statement = compound->statements;
4499 for ( ; statement != NULL; statement = statement->base.next) {
4500 if (statement->base.next == NULL
4501 && statement->kind == STATEMENT_EXPRESSION) {
4502 result = expression_statement_to_firm(
4503 &statement->expression);
4506 statement_to_firm(statement);
4512 static void create_global_variable(entity_t *entity)
4514 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4515 ir_visibility visibility = ir_visibility_default;
4516 ir_entity *irentity;
4517 assert(entity->kind == ENTITY_VARIABLE);
4519 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4520 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4521 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4522 case STORAGE_CLASS_NONE:
4523 visibility = ir_visibility_default;
4524 /* uninitialized globals get merged in C */
4525 if (entity->variable.initializer == NULL)
4526 linkage |= IR_LINKAGE_MERGE;
4528 case STORAGE_CLASS_TYPEDEF:
4529 case STORAGE_CLASS_AUTO:
4530 case STORAGE_CLASS_REGISTER:
4531 panic("invalid storage class for global var");
4534 ir_type *var_type = get_glob_type();
4535 if (entity->variable.thread_local) {
4536 var_type = get_tls_type();
4537 /* LINKAGE_MERGE not supported by current linkers */
4538 linkage &= ~IR_LINKAGE_MERGE;
4540 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4541 irentity = entity->variable.v.entity;
4542 add_entity_linkage(irentity, linkage);
4543 set_entity_visibility(irentity, visibility);
4546 static void create_local_declaration(entity_t *entity)
4548 assert(is_declaration(entity));
4550 /* construct type */
4551 (void) get_ir_type(entity->declaration.type);
4552 if (entity->base.symbol == NULL) {
4556 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4557 case STORAGE_CLASS_STATIC:
4558 if (entity->kind == ENTITY_FUNCTION) {
4559 (void)get_function_entity(entity, NULL);
4561 create_local_static_variable(entity);
4564 case STORAGE_CLASS_EXTERN:
4565 if (entity->kind == ENTITY_FUNCTION) {
4566 assert(entity->function.statement == NULL);
4567 (void)get_function_entity(entity, NULL);
4569 create_global_variable(entity);
4570 create_variable_initializer(entity);
4573 case STORAGE_CLASS_NONE:
4574 case STORAGE_CLASS_AUTO:
4575 case STORAGE_CLASS_REGISTER:
4576 if (entity->kind == ENTITY_FUNCTION) {
4577 if (entity->function.statement != NULL) {
4578 ir_type *owner = get_irg_frame_type(current_ir_graph);
4579 (void)get_function_entity(entity, owner);
4580 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4581 enqueue_inner_function(entity);
4583 (void)get_function_entity(entity, NULL);
4586 create_local_variable(entity);
4589 case STORAGE_CLASS_TYPEDEF:
4592 panic("invalid storage class found");
4595 static void initialize_local_declaration(entity_t *entity)
4597 if (entity->base.symbol == NULL)
4600 // no need to emit code in dead blocks
4601 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4602 && !currently_reachable())
4605 switch ((declaration_kind_t) entity->declaration.kind) {
4606 case DECLARATION_KIND_LOCAL_VARIABLE:
4607 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4608 create_variable_initializer(entity);
4611 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4612 allocate_variable_length_array(entity);
4615 case DECLARATION_KIND_COMPOUND_MEMBER:
4616 case DECLARATION_KIND_GLOBAL_VARIABLE:
4617 case DECLARATION_KIND_FUNCTION:
4618 case DECLARATION_KIND_INNER_FUNCTION:
4621 case DECLARATION_KIND_PARAMETER:
4622 case DECLARATION_KIND_PARAMETER_ENTITY:
4623 panic("can't initialize parameters");
4625 case DECLARATION_KIND_UNKNOWN:
4626 panic("can't initialize unknown declaration");
4628 panic("invalid declaration kind");
4631 static void declaration_statement_to_firm(declaration_statement_t *statement)
4633 entity_t *entity = statement->declarations_begin;
4637 entity_t *const last = statement->declarations_end;
4638 for ( ;; entity = entity->base.next) {
4639 if (is_declaration(entity)) {
4640 initialize_local_declaration(entity);
4641 } else if (entity->kind == ENTITY_TYPEDEF) {
4642 /* ยง6.7.7:3 Any array size expressions associated with variable length
4643 * array declarators are evaluated each time the declaration of the
4644 * typedef name is reached in the order of execution. */
4645 type_t *const type = skip_typeref(entity->typedefe.type);
4646 if (is_type_array(type) && type->array.is_vla)
4647 get_vla_size(&type->array);
4654 static void if_statement_to_firm(if_statement_t *statement)
4656 /* Create the condition. */
4657 ir_node *true_block = NULL;
4658 ir_node *false_block = NULL;
4659 if (currently_reachable()) {
4660 true_block = new_immBlock();
4661 false_block = new_immBlock();
4662 create_condition_evaluation(statement->condition, true_block, false_block);
4663 mature_immBlock(true_block);
4666 /* Create the false statement.
4667 * Handle false before true, so if no false statement is present, then the
4668 * empty false block is reused as fallthrough block. */
4669 ir_node *fallthrough_block = NULL;
4670 if (statement->false_statement != NULL) {
4671 if (false_block != NULL) {
4672 mature_immBlock(false_block);
4674 set_cur_block(false_block);
4675 statement_to_firm(statement->false_statement);
4676 if (currently_reachable()) {
4677 fallthrough_block = new_immBlock();
4678 add_immBlock_pred(fallthrough_block, new_Jmp());
4681 fallthrough_block = false_block;
4684 /* Create the true statement. */
4685 set_cur_block(true_block);
4686 statement_to_firm(statement->true_statement);
4687 if (currently_reachable()) {
4688 if (fallthrough_block == NULL) {
4689 fallthrough_block = new_immBlock();
4691 add_immBlock_pred(fallthrough_block, new_Jmp());
4694 /* Handle the block after the if-statement. */
4695 if (fallthrough_block != NULL) {
4696 mature_immBlock(fallthrough_block);
4698 set_cur_block(fallthrough_block);
4701 /* Create a jump node which jumps into target_block, if the current block is
4703 static void jump_if_reachable(ir_node *const target_block)
4705 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4706 add_immBlock_pred(target_block, pred);
4709 static void while_statement_to_firm(while_statement_t *statement)
4711 /* Create the header block */
4712 ir_node *const header_block = new_immBlock();
4713 jump_if_reachable(header_block);
4715 /* Create the condition. */
4716 ir_node * body_block;
4717 ir_node * false_block;
4718 expression_t *const cond = statement->condition;
4719 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4720 fold_constant_to_bool(cond)) {
4721 /* Shortcut for while (true). */
4722 body_block = header_block;
4725 keep_alive(header_block);
4726 keep_all_memory(header_block);
4728 body_block = new_immBlock();
4729 false_block = new_immBlock();
4731 set_cur_block(header_block);
4732 create_condition_evaluation(cond, body_block, false_block);
4733 mature_immBlock(body_block);
4736 ir_node *const old_continue_label = continue_label;
4737 ir_node *const old_break_label = break_label;
4738 continue_label = header_block;
4739 break_label = false_block;
4741 /* Create the loop body. */
4742 set_cur_block(body_block);
4743 statement_to_firm(statement->body);
4744 jump_if_reachable(header_block);
4746 mature_immBlock(header_block);
4747 assert(false_block == NULL || false_block == break_label);
4748 false_block = break_label;
4749 if (false_block != NULL) {
4750 mature_immBlock(false_block);
4752 set_cur_block(false_block);
4754 assert(continue_label == header_block);
4755 continue_label = old_continue_label;
4756 break_label = old_break_label;
4759 static ir_node *get_break_label(void)
4761 if (break_label == NULL) {
4762 break_label = new_immBlock();
4767 static void do_while_statement_to_firm(do_while_statement_t *statement)
4769 /* create the header block */
4770 ir_node *header_block = new_immBlock();
4773 ir_node *body_block = new_immBlock();
4774 jump_if_reachable(body_block);
4776 ir_node *old_continue_label = continue_label;
4777 ir_node *old_break_label = break_label;
4778 continue_label = header_block;
4781 set_cur_block(body_block);
4782 statement_to_firm(statement->body);
4783 ir_node *const false_block = get_break_label();
4785 assert(continue_label == header_block);
4786 continue_label = old_continue_label;
4787 break_label = old_break_label;
4789 jump_if_reachable(header_block);
4791 /* create the condition */
4792 mature_immBlock(header_block);
4793 set_cur_block(header_block);
4795 create_condition_evaluation(statement->condition, body_block, false_block);
4796 mature_immBlock(body_block);
4797 mature_immBlock(false_block);
4799 set_cur_block(false_block);
4802 static void for_statement_to_firm(for_statement_t *statement)
4804 /* create declarations */
4805 entity_t *entity = statement->scope.entities;
4806 for ( ; entity != NULL; entity = entity->base.next) {
4807 if (!is_declaration(entity))
4810 create_local_declaration(entity);
4813 if (currently_reachable()) {
4814 entity = statement->scope.entities;
4815 for ( ; entity != NULL; entity = entity->base.next) {
4816 if (!is_declaration(entity))
4819 initialize_local_declaration(entity);
4822 if (statement->initialisation != NULL) {
4823 expression_to_firm(statement->initialisation);
4827 /* Create the header block */
4828 ir_node *const header_block = new_immBlock();
4829 jump_if_reachable(header_block);
4831 /* Create the condition. */
4832 ir_node *body_block;
4833 ir_node *false_block;
4834 if (statement->condition != NULL) {
4835 body_block = new_immBlock();
4836 false_block = new_immBlock();
4838 set_cur_block(header_block);
4839 create_condition_evaluation(statement->condition, body_block, false_block);
4840 mature_immBlock(body_block);
4843 body_block = header_block;
4846 keep_alive(header_block);
4847 keep_all_memory(header_block);
4850 /* Create the step block, if necessary. */
4851 ir_node * step_block = header_block;
4852 expression_t *const step = statement->step;
4854 step_block = new_immBlock();
4857 ir_node *const old_continue_label = continue_label;
4858 ir_node *const old_break_label = break_label;
4859 continue_label = step_block;
4860 break_label = false_block;
4862 /* Create the loop body. */
4863 set_cur_block(body_block);
4864 statement_to_firm(statement->body);
4865 jump_if_reachable(step_block);
4867 /* Create the step code. */
4869 mature_immBlock(step_block);
4870 set_cur_block(step_block);
4871 expression_to_firm(step);
4872 jump_if_reachable(header_block);
4875 mature_immBlock(header_block);
4876 assert(false_block == NULL || false_block == break_label);
4877 false_block = break_label;
4878 if (false_block != NULL) {
4879 mature_immBlock(false_block);
4881 set_cur_block(false_block);
4883 assert(continue_label == step_block);
4884 continue_label = old_continue_label;
4885 break_label = old_break_label;
4888 static void create_jump_statement(const statement_t *statement,
4889 ir_node *target_block)
4891 if (!currently_reachable())
4894 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4895 ir_node *jump = new_d_Jmp(dbgi);
4896 add_immBlock_pred(target_block, jump);
4898 set_unreachable_now();
4901 static void switch_statement_to_firm(switch_statement_t *statement)
4903 ir_node *first_block = NULL;
4904 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4905 ir_node *cond = NULL;
4907 if (currently_reachable()) {
4908 ir_node *expression = expression_to_firm(statement->expression);
4909 cond = new_d_Cond(dbgi, expression);
4910 first_block = get_cur_block();
4913 set_unreachable_now();
4915 ir_node *const old_switch_cond = current_switch_cond;
4916 ir_node *const old_break_label = break_label;
4917 const bool old_saw_default_label = saw_default_label;
4918 saw_default_label = false;
4919 current_switch_cond = cond;
4921 switch_statement_t *const old_switch = current_switch;
4922 current_switch = statement;
4924 /* determine a free number for the default label */
4925 unsigned long num_cases = 0;
4926 long default_proj_nr = 0;
4927 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
4928 if (l->expression == NULL) {
4932 if (l->last_case >= l->first_case)
4933 num_cases += l->last_case - l->first_case + 1;
4934 if (l->last_case > default_proj_nr)
4935 default_proj_nr = l->last_case;
4938 if (default_proj_nr == LONG_MAX) {
4939 /* Bad: an overflow will occur, we cannot be sure that the
4940 * maximum + 1 is a free number. Scan the values a second
4941 * time to find a free number.
4943 unsigned char *bits = xmalloc((num_cases + 7) >> 3);
4945 memset(bits, 0, (num_cases + 7) >> 3);
4946 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
4947 if (l->expression == NULL) {
4951 unsigned long start = l->first_case > 0 ? (unsigned long)l->first_case : 0;
4952 if (start < num_cases && l->last_case >= 0) {
4953 unsigned long end = (unsigned long)l->last_case < num_cases ?
4954 (unsigned long)l->last_case : num_cases - 1;
4955 for (unsigned long cns = start; cns <= end; ++cns) {
4956 bits[cns >> 3] |= (1 << (cns & 7));
4960 /* We look at the first num_cases constants:
4961 * Either they are dense, so we took the last (num_cases)
4962 * one, or they are not dense, so we will find one free
4966 for (i = 0; i < num_cases; ++i)
4967 if ((bits[i >> 3] & (1 << (i & 7))) == 0)
4971 default_proj_nr = i;
4975 statement->default_proj_nr = default_proj_nr;
4976 /* safety check: cond might already be folded to a Bad */
4977 if (cond != NULL && is_Cond(cond)) {
4978 set_Cond_default_proj(cond, default_proj_nr);
4981 statement_to_firm(statement->body);
4983 jump_if_reachable(get_break_label());
4985 if (!saw_default_label && first_block != NULL) {
4986 set_cur_block(first_block);
4987 ir_node *const proj = new_d_Proj(dbgi, cond, mode_X, default_proj_nr);
4988 add_immBlock_pred(get_break_label(), proj);
4991 if (break_label != NULL) {
4992 mature_immBlock(break_label);
4994 set_cur_block(break_label);
4996 assert(current_switch_cond == cond);
4997 current_switch = old_switch;
4998 current_switch_cond = old_switch_cond;
4999 break_label = old_break_label;
5000 saw_default_label = old_saw_default_label;
5003 static void case_label_to_firm(const case_label_statement_t *statement)
5005 if (statement->is_empty_range)
5008 ir_node *block = new_immBlock();
5009 /* Fallthrough from previous case */
5010 jump_if_reachable(block);
5012 if (current_switch_cond != NULL) {
5013 set_cur_block(get_nodes_block(current_switch_cond));
5014 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5015 if (statement->expression != NULL) {
5016 long pn = statement->first_case;
5017 long end_pn = statement->last_case;
5018 assert(pn <= end_pn);
5019 /* create jumps for all cases in the given range */
5021 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X, pn);
5022 add_immBlock_pred(block, proj);
5023 } while (pn++ < end_pn);
5025 saw_default_label = true;
5026 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X,
5027 current_switch->default_proj_nr);
5028 add_immBlock_pred(block, proj);
5032 mature_immBlock(block);
5033 set_cur_block(block);
5035 statement_to_firm(statement->statement);
5038 static void label_to_firm(const label_statement_t *statement)
5040 ir_node *block = get_label_block(statement->label);
5041 jump_if_reachable(block);
5043 set_cur_block(block);
5045 keep_all_memory(block);
5047 statement_to_firm(statement->statement);
5050 static void goto_to_firm(const goto_statement_t *statement)
5052 if (!currently_reachable())
5055 if (statement->expression) {
5056 ir_node *irn = expression_to_firm(statement->expression);
5057 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5058 ir_node *ijmp = new_d_IJmp(dbgi, irn);
5060 set_irn_link(ijmp, ijmp_list);
5063 ir_node *block = get_label_block(statement->label);
5064 ir_node *jmp = new_Jmp();
5065 add_immBlock_pred(block, jmp);
5067 set_unreachable_now();
5070 static void asm_statement_to_firm(const asm_statement_t *statement)
5072 bool needs_memory = false;
5074 if (statement->is_volatile) {
5075 needs_memory = true;
5078 size_t n_clobbers = 0;
5079 asm_clobber_t *clobber = statement->clobbers;
5080 for ( ; clobber != NULL; clobber = clobber->next) {
5081 const char *clobber_str = clobber->clobber.begin;
5083 if (!be_is_valid_clobber(clobber_str)) {
5084 errorf(&statement->base.source_position,
5085 "invalid clobber '%s' specified", clobber->clobber);
5089 if (streq(clobber_str, "memory")) {
5090 needs_memory = true;
5094 ident *id = new_id_from_str(clobber_str);
5095 obstack_ptr_grow(&asm_obst, id);
5098 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5099 ident **clobbers = NULL;
5100 if (n_clobbers > 0) {
5101 clobbers = obstack_finish(&asm_obst);
5104 size_t n_inputs = 0;
5105 asm_argument_t *argument = statement->inputs;
5106 for ( ; argument != NULL; argument = argument->next)
5108 size_t n_outputs = 0;
5109 argument = statement->outputs;
5110 for ( ; argument != NULL; argument = argument->next)
5113 unsigned next_pos = 0;
5115 ir_node *ins[n_inputs + n_outputs + 1];
5118 ir_asm_constraint tmp_in_constraints[n_outputs];
5120 const expression_t *out_exprs[n_outputs];
5121 ir_node *out_addrs[n_outputs];
5122 size_t out_size = 0;
5124 argument = statement->outputs;
5125 for ( ; argument != NULL; argument = argument->next) {
5126 const char *constraints = argument->constraints.begin;
5127 asm_constraint_flags_t asm_flags
5128 = be_parse_asm_constraints(constraints);
5131 source_position_t const *const pos = &statement->base.source_position;
5132 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5133 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5135 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5136 errorf(pos, "some constraints in '%s' are invalid", constraints);
5139 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5140 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5145 unsigned pos = next_pos++;
5146 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5147 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5148 expression_t *expr = argument->expression;
5149 ir_node *addr = expression_to_addr(expr);
5150 /* in+output, construct an artifical same_as constraint on the
5152 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5154 ir_node *value = get_value_from_lvalue(expr, addr);
5156 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5158 ir_asm_constraint constraint;
5159 constraint.pos = pos;
5160 constraint.constraint = new_id_from_str(buf);
5161 constraint.mode = get_ir_mode_storage(expr->base.type);
5162 tmp_in_constraints[in_size] = constraint;
5163 ins[in_size] = value;
5168 out_exprs[out_size] = expr;
5169 out_addrs[out_size] = addr;
5171 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5172 /* pure memory ops need no input (but we have to make sure we
5173 * attach to the memory) */
5174 assert(! (asm_flags &
5175 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5176 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5177 needs_memory = true;
5179 /* we need to attach the address to the inputs */
5180 expression_t *expr = argument->expression;
5182 ir_asm_constraint constraint;
5183 constraint.pos = pos;
5184 constraint.constraint = new_id_from_str(constraints);
5185 constraint.mode = NULL;
5186 tmp_in_constraints[in_size] = constraint;
5188 ins[in_size] = expression_to_addr(expr);
5192 errorf(&statement->base.source_position,
5193 "only modifiers but no place set in constraints '%s'",
5198 ir_asm_constraint constraint;
5199 constraint.pos = pos;
5200 constraint.constraint = new_id_from_str(constraints);
5201 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5203 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5205 assert(obstack_object_size(&asm_obst)
5206 == out_size * sizeof(ir_asm_constraint));
5207 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5210 obstack_grow(&asm_obst, tmp_in_constraints,
5211 in_size * sizeof(tmp_in_constraints[0]));
5212 /* find and count input and output arguments */
5213 argument = statement->inputs;
5214 for ( ; argument != NULL; argument = argument->next) {
5215 const char *constraints = argument->constraints.begin;
5216 asm_constraint_flags_t asm_flags
5217 = be_parse_asm_constraints(constraints);
5219 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5220 errorf(&statement->base.source_position,
5221 "some constraints in '%s' are not supported", constraints);
5224 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5225 errorf(&statement->base.source_position,
5226 "some constraints in '%s' are invalid", constraints);
5229 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5230 errorf(&statement->base.source_position,
5231 "write flag specified for input constraints '%s'",
5237 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5238 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5239 /* we can treat this as "normal" input */
5240 input = expression_to_firm(argument->expression);
5241 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5242 /* pure memory ops need no input (but we have to make sure we
5243 * attach to the memory) */
5244 assert(! (asm_flags &
5245 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5246 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5247 needs_memory = true;
5248 input = expression_to_addr(argument->expression);
5250 errorf(&statement->base.source_position,
5251 "only modifiers but no place set in constraints '%s'",
5256 ir_asm_constraint constraint;
5257 constraint.pos = next_pos++;
5258 constraint.constraint = new_id_from_str(constraints);
5259 constraint.mode = get_irn_mode(input);
5261 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5262 ins[in_size++] = input;
5266 ir_asm_constraint constraint;
5267 constraint.pos = next_pos++;
5268 constraint.constraint = new_id_from_str("");
5269 constraint.mode = mode_M;
5271 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5272 ins[in_size++] = get_store();
5275 assert(obstack_object_size(&asm_obst)
5276 == in_size * sizeof(ir_asm_constraint));
5277 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5279 /* create asm node */
5280 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5282 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5284 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5285 out_size, output_constraints,
5286 n_clobbers, clobbers, asm_text);
5288 if (statement->is_volatile) {
5289 set_irn_pinned(node, op_pin_state_pinned);
5291 set_irn_pinned(node, op_pin_state_floats);
5294 /* create output projs & connect them */
5296 ir_node *projm = new_Proj(node, mode_M, out_size);
5301 for (i = 0; i < out_size; ++i) {
5302 const expression_t *out_expr = out_exprs[i];
5304 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5305 ir_node *proj = new_Proj(node, mode, pn);
5306 ir_node *addr = out_addrs[i];
5308 set_value_for_expression_addr(out_expr, proj, addr);
5312 static void ms_try_statement_to_firm(ms_try_statement_t *statement)
5314 statement_to_firm(statement->try_statement);
5315 source_position_t const *const pos = &statement->base.source_position;
5316 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5319 static void leave_statement_to_firm(leave_statement_t *statement)
5321 errorf(&statement->base.source_position, "__leave not supported yet");
5325 * Transform a statement.
5327 static void statement_to_firm(statement_t *statement)
5330 assert(!statement->base.transformed);
5331 statement->base.transformed = true;
5334 switch (statement->kind) {
5335 case STATEMENT_ERROR:
5336 panic("error statement found");
5337 case STATEMENT_EMPTY:
5340 case STATEMENT_COMPOUND:
5341 compound_statement_to_firm(&statement->compound);
5343 case STATEMENT_RETURN:
5344 return_statement_to_firm(&statement->returns);
5346 case STATEMENT_EXPRESSION:
5347 expression_statement_to_firm(&statement->expression);
5350 if_statement_to_firm(&statement->ifs);
5352 case STATEMENT_WHILE:
5353 while_statement_to_firm(&statement->whiles);
5355 case STATEMENT_DO_WHILE:
5356 do_while_statement_to_firm(&statement->do_while);
5358 case STATEMENT_DECLARATION:
5359 declaration_statement_to_firm(&statement->declaration);
5361 case STATEMENT_BREAK:
5362 create_jump_statement(statement, get_break_label());
5364 case STATEMENT_CONTINUE:
5365 create_jump_statement(statement, continue_label);
5367 case STATEMENT_SWITCH:
5368 switch_statement_to_firm(&statement->switchs);
5370 case STATEMENT_CASE_LABEL:
5371 case_label_to_firm(&statement->case_label);
5374 for_statement_to_firm(&statement->fors);
5376 case STATEMENT_LABEL:
5377 label_to_firm(&statement->label);
5379 case STATEMENT_GOTO:
5380 goto_to_firm(&statement->gotos);
5383 asm_statement_to_firm(&statement->asms);
5385 case STATEMENT_MS_TRY:
5386 ms_try_statement_to_firm(&statement->ms_try);
5388 case STATEMENT_LEAVE:
5389 leave_statement_to_firm(&statement->leave);
5392 panic("statement not implemented");
5395 static int count_local_variables(const entity_t *entity,
5396 const entity_t *const last)
5399 entity_t const *const end = last != NULL ? last->base.next : NULL;
5400 for (; entity != end; entity = entity->base.next) {
5404 if (entity->kind == ENTITY_VARIABLE) {
5405 type = skip_typeref(entity->declaration.type);
5406 address_taken = entity->variable.address_taken;
5407 } else if (entity->kind == ENTITY_PARAMETER) {
5408 type = skip_typeref(entity->declaration.type);
5409 address_taken = entity->parameter.address_taken;
5414 if (!address_taken && is_type_scalar(type))
5420 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5422 int *const count = env;
5424 switch (stmt->kind) {
5425 case STATEMENT_DECLARATION: {
5426 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5427 *count += count_local_variables(decl_stmt->declarations_begin,
5428 decl_stmt->declarations_end);
5433 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5442 * Return the number of local (alias free) variables used by a function.
5444 static int get_function_n_local_vars(entity_t *entity)
5446 const function_t *function = &entity->function;
5449 /* count parameters */
5450 count += count_local_variables(function->parameters.entities, NULL);
5452 /* count local variables declared in body */
5453 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5458 * Build Firm code for the parameters of a function.
5460 static void initialize_function_parameters(entity_t *entity)
5462 assert(entity->kind == ENTITY_FUNCTION);
5463 ir_graph *irg = current_ir_graph;
5464 ir_node *args = get_irg_args(irg);
5466 ir_type *function_irtype;
5468 if (entity->function.need_closure) {
5469 /* add an extra parameter for the static link */
5470 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5473 /* Matze: IMO this is wrong, nested functions should have an own
5474 * type and not rely on strange parameters... */
5475 function_irtype = create_method_type(&entity->declaration.type->function, true);
5477 function_irtype = get_ir_type(entity->declaration.type);
5482 entity_t *parameter = entity->function.parameters.entities;
5483 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5484 if (parameter->kind != ENTITY_PARAMETER)
5487 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5488 type_t *type = skip_typeref(parameter->declaration.type);
5490 bool needs_entity = parameter->parameter.address_taken;
5491 assert(!is_type_array(type));
5492 if (is_type_compound(type)) {
5493 needs_entity = true;
5496 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5498 ir_type *frame_type = get_irg_frame_type(irg);
5500 = new_parameter_entity(frame_type, n, param_irtype);
5501 parameter->declaration.kind
5502 = DECLARATION_KIND_PARAMETER_ENTITY;
5503 parameter->parameter.v.entity = param;
5507 ir_mode *param_mode = get_type_mode(param_irtype);
5509 ir_node *value = new_r_Proj(args, param_mode, pn);
5511 ir_mode *mode = get_ir_mode_storage(type);
5512 value = create_conv(NULL, value, mode);
5513 value = do_strict_conv(NULL, value);
5515 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5516 parameter->parameter.v.value_number = next_value_number_function;
5517 set_irg_loc_description(current_ir_graph, next_value_number_function,
5519 ++next_value_number_function;
5521 set_value(parameter->parameter.v.value_number, value);
5526 * Handle additional decl modifiers for IR-graphs
5528 * @param irg the IR-graph
5529 * @param dec_modifiers additional modifiers
5531 static void handle_decl_modifier_irg(ir_graph_ptr irg,
5532 decl_modifiers_t decl_modifiers)
5534 if (decl_modifiers & DM_NAKED) {
5535 /* TRUE if the declaration includes the Microsoft
5536 __declspec(naked) specifier. */
5537 add_irg_additional_properties(irg, mtp_property_naked);
5539 if (decl_modifiers & DM_FORCEINLINE) {
5540 /* TRUE if the declaration includes the
5541 Microsoft __forceinline specifier. */
5542 set_irg_inline_property(irg, irg_inline_forced);
5544 if (decl_modifiers & DM_NOINLINE) {
5545 /* TRUE if the declaration includes the Microsoft
5546 __declspec(noinline) specifier. */
5547 set_irg_inline_property(irg, irg_inline_forbidden);
5551 static void add_function_pointer(ir_type *segment, ir_entity *method,
5552 const char *unique_template)
5554 ir_type *method_type = get_entity_type(method);
5555 ir_type *ptr_type = new_type_pointer(method_type);
5557 /* these entities don't really have a name but firm only allows
5559 * Note that we mustn't give these entities a name since for example
5560 * Mach-O doesn't allow them. */
5561 ident *ide = id_unique(unique_template);
5562 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5563 ir_graph *irg = get_const_code_irg();
5564 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5567 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5568 set_entity_compiler_generated(ptr, 1);
5569 set_entity_visibility(ptr, ir_visibility_private);
5570 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5571 set_atomic_ent_value(ptr, val);
5575 * Generate possible IJmp branches to a given label block.
5577 static void gen_ijmp_branches(ir_node *block)
5580 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5581 add_immBlock_pred(block, ijmp);
5586 * Create code for a function and all inner functions.
5588 * @param entity the function entity
5590 static void create_function(entity_t *entity)
5592 assert(entity->kind == ENTITY_FUNCTION);
5593 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5595 if (entity->function.statement == NULL)
5598 if (is_main(entity) && enable_main_collect2_hack) {
5599 prepare_main_collect2(entity);
5602 inner_functions = NULL;
5603 current_trampolines = NULL;
5605 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5606 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5607 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5609 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5610 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5611 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5614 current_function_entity = entity;
5615 current_function_name = NULL;
5616 current_funcsig = NULL;
5618 assert(all_labels == NULL);
5619 all_labels = NEW_ARR_F(label_t *, 0);
5622 int n_local_vars = get_function_n_local_vars(entity);
5623 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5624 current_ir_graph = irg;
5626 ir_graph *old_current_function = current_function;
5627 current_function = irg;
5629 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5630 current_vararg_entity = NULL;
5632 set_irg_fp_model(irg, firm_fp_model);
5633 tarval_enable_fp_ops(1);
5634 set_irn_dbg_info(get_irg_start_block(irg),
5635 get_entity_dbg_info(function_entity));
5637 ir_node *first_block = get_cur_block();
5639 /* set inline flags */
5640 if (entity->function.is_inline)
5641 set_irg_inline_property(irg, irg_inline_recomended);
5642 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5644 next_value_number_function = 0;
5645 initialize_function_parameters(entity);
5646 current_static_link = entity->function.static_link;
5648 statement_to_firm(entity->function.statement);
5650 ir_node *end_block = get_irg_end_block(irg);
5652 /* do we have a return statement yet? */
5653 if (currently_reachable()) {
5654 type_t *type = skip_typeref(entity->declaration.type);
5655 assert(is_type_function(type));
5656 const function_type_t *func_type = &type->function;
5657 const type_t *return_type
5658 = skip_typeref(func_type->return_type);
5661 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5662 ret = new_Return(get_store(), 0, NULL);
5665 if (is_type_scalar(return_type)) {
5666 mode = get_ir_mode_storage(func_type->return_type);
5672 /* ยง5.1.2.2.3 main implicitly returns 0 */
5673 if (is_main(entity)) {
5674 in[0] = new_Const(get_mode_null(mode));
5676 in[0] = new_Unknown(mode);
5678 ret = new_Return(get_store(), 1, in);
5680 add_immBlock_pred(end_block, ret);
5683 bool has_computed_gotos = false;
5684 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5685 label_t *label = all_labels[i];
5686 if (label->address_taken) {
5687 gen_ijmp_branches(label->block);
5688 has_computed_gotos = true;
5690 mature_immBlock(label->block);
5692 if (has_computed_gotos) {
5693 /* if we have computed goto's in the function, we cannot inline it */
5694 if (get_irg_inline_property(irg) >= irg_inline_recomended) {
5695 source_position_t const *const pos = &entity->base.source_position;
5696 warningf(WARN_OTHER, pos, "'%N' can never be inlined because it contains a computed goto", entity);
5698 set_irg_inline_property(irg, irg_inline_forbidden);
5701 DEL_ARR_F(all_labels);
5704 mature_immBlock(first_block);
5705 mature_immBlock(end_block);
5707 irg_finalize_cons(irg);
5709 /* finalize the frame type */
5710 ir_type *frame_type = get_irg_frame_type(irg);
5711 int n = get_compound_n_members(frame_type);
5714 for (int i = 0; i < n; ++i) {
5715 ir_entity *member = get_compound_member(frame_type, i);
5716 ir_type *entity_type = get_entity_type(member);
5718 int align = get_type_alignment_bytes(entity_type);
5719 if (align > align_all)
5723 misalign = offset % align;
5725 offset += align - misalign;
5729 set_entity_offset(member, offset);
5730 offset += get_type_size_bytes(entity_type);
5732 set_type_size_bytes(frame_type, offset);
5733 set_type_alignment_bytes(frame_type, align_all);
5735 irg_verify(irg, VERIFY_ENFORCE_SSA);
5736 current_vararg_entity = old_current_vararg_entity;
5737 current_function = old_current_function;
5739 if (current_trampolines != NULL) {
5740 DEL_ARR_F(current_trampolines);
5741 current_trampolines = NULL;
5744 /* create inner functions if any */
5745 entity_t **inner = inner_functions;
5746 if (inner != NULL) {
5747 ir_type *rem_outer_frame = current_outer_frame;
5748 current_outer_frame = get_irg_frame_type(current_ir_graph);
5749 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5750 create_function(inner[i]);
5754 current_outer_frame = rem_outer_frame;
5758 static void scope_to_firm(scope_t *scope)
5760 /* first pass: create declarations */
5761 entity_t *entity = scope->entities;
5762 for ( ; entity != NULL; entity = entity->base.next) {
5763 if (entity->base.symbol == NULL)
5766 if (entity->kind == ENTITY_FUNCTION) {
5767 if (entity->function.btk != BUILTIN_NONE) {
5768 /* builtins have no representation */
5771 (void)get_function_entity(entity, NULL);
5772 } else if (entity->kind == ENTITY_VARIABLE) {
5773 create_global_variable(entity);
5774 } else if (entity->kind == ENTITY_NAMESPACE) {
5775 scope_to_firm(&entity->namespacee.members);
5779 /* second pass: create code/initializers */
5780 entity = scope->entities;
5781 for ( ; entity != NULL; entity = entity->base.next) {
5782 if (entity->base.symbol == NULL)
5785 if (entity->kind == ENTITY_FUNCTION) {
5786 if (entity->function.btk != BUILTIN_NONE) {
5787 /* builtins have no representation */
5790 create_function(entity);
5791 } else if (entity->kind == ENTITY_VARIABLE) {
5792 assert(entity->declaration.kind
5793 == DECLARATION_KIND_GLOBAL_VARIABLE);
5794 current_ir_graph = get_const_code_irg();
5795 create_variable_initializer(entity);
5800 void init_ast2firm(void)
5802 obstack_init(&asm_obst);
5803 init_atomic_modes();
5805 ir_set_debug_retrieve(dbg_retrieve);
5806 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5808 /* create idents for all known runtime functions */
5809 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5810 rts_idents[i] = new_id_from_str(rts_data[i].name);
5813 entitymap_init(&entitymap);
5816 static void init_ir_types(void)
5818 static int ir_types_initialized = 0;
5819 if (ir_types_initialized)
5821 ir_types_initialized = 1;
5823 ir_type_int = get_ir_type(type_int);
5824 ir_type_char = get_ir_type(type_char);
5825 ir_type_const_char = get_ir_type(type_const_char);
5826 ir_type_wchar_t = get_ir_type(type_wchar_t);
5827 ir_type_void = get_ir_type(type_void);
5829 be_params = be_get_backend_param();
5830 mode_float_arithmetic = be_params->mode_float_arithmetic;
5832 stack_param_align = be_params->stack_param_align;
5835 void exit_ast2firm(void)
5837 entitymap_destroy(&entitymap);
5838 obstack_free(&asm_obst, NULL);
5841 static void global_asm_to_firm(statement_t *s)
5843 for (; s != NULL; s = s->base.next) {
5844 assert(s->kind == STATEMENT_ASM);
5846 char const *const text = s->asms.asm_text.begin;
5847 size_t size = s->asms.asm_text.size;
5849 /* skip the last \0 */
5850 if (text[size - 1] == '\0')
5853 ident *const id = new_id_from_chars(text, size);
5858 void translation_unit_to_firm(translation_unit_t *unit)
5860 /* initialize firm arithmetic */
5861 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5862 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5864 /* just to be sure */
5865 continue_label = NULL;
5867 current_switch_cond = NULL;
5868 current_translation_unit = unit;
5872 scope_to_firm(&unit->scope);
5873 global_asm_to_firm(unit->global_asm);
5875 current_ir_graph = NULL;
5876 current_translation_unit = NULL;