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"
42 #include "diagnostic.h"
43 #include "lang_features.h"
45 #include "type_hash.h"
50 #include "entitymap_t.h"
51 #include "driver/firm_opt.h"
53 typedef struct trampoline_region trampoline_region;
54 struct trampoline_region {
55 ir_entity *function; /**< The function that is called by this trampoline */
56 ir_entity *region; /**< created region for the trampoline */
59 fp_model_t firm_fp_model = fp_model_precise;
61 static const backend_params *be_params;
63 static ir_type *ir_type_char;
64 static ir_type *ir_type_const_char;
65 static ir_type *ir_type_wchar_t;
66 static ir_type *ir_type_void;
67 static ir_type *ir_type_int;
69 /* architecture specific floating point arithmetic mode (if any) */
70 static ir_mode *mode_float_arithmetic;
72 /* alignment of stack parameters */
73 static unsigned stack_param_align;
75 static int next_value_number_function;
76 static ir_node *continue_label;
77 static ir_node *break_label;
78 static ir_node *current_switch_cond;
79 static bool saw_default_label;
80 static label_t **all_labels;
81 static entity_t **inner_functions;
82 static ir_node *ijmp_list;
83 static bool constant_folding;
85 static const entity_t *current_function_entity;
86 static ir_node *current_function_name;
87 static ir_node *current_funcsig;
88 static switch_statement_t *current_switch;
89 static ir_graph *current_function;
90 static translation_unit_t *current_translation_unit;
91 static trampoline_region *current_trampolines;
92 static ir_type *current_outer_frame;
93 static ir_node *current_static_link;
94 static ir_entity *current_vararg_entity;
96 static entitymap_t entitymap;
98 static struct obstack asm_obst;
100 typedef enum declaration_kind_t {
101 DECLARATION_KIND_UNKNOWN,
102 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
103 DECLARATION_KIND_GLOBAL_VARIABLE,
104 DECLARATION_KIND_LOCAL_VARIABLE,
105 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
106 DECLARATION_KIND_PARAMETER,
107 DECLARATION_KIND_PARAMETER_ENTITY,
108 DECLARATION_KIND_FUNCTION,
109 DECLARATION_KIND_COMPOUND_MEMBER,
110 DECLARATION_KIND_INNER_FUNCTION
111 } declaration_kind_t;
113 static ir_mode *get_ir_mode_storage(type_t *type);
115 static ir_type *get_ir_type_incomplete(type_t *type);
117 static void enqueue_inner_function(entity_t *entity)
119 if (inner_functions == NULL)
120 inner_functions = NEW_ARR_F(entity_t *, 0);
121 ARR_APP1(entity_t*, inner_functions, entity);
124 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
126 const entity_t *entity = get_irg_loc_description(irg, pos);
128 if (entity != NULL) {
129 source_position_t const *const pos = &entity->base.source_position;
130 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
132 return new_r_Unknown(irg, mode);
135 static const char *dbg_retrieve(const dbg_info *dbg, unsigned *line)
137 const source_position_t *pos = (const source_position_t*) dbg;
142 return pos->input_name;
145 static dbg_info *get_dbg_info(const source_position_t *pos)
147 return (dbg_info*) pos;
150 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
151 const type_dbg_info *dbg)
154 print_to_buffer(buffer, buffer_size);
155 const type_t *type = (const type_t*) dbg;
157 finish_print_to_buffer();
160 static type_dbg_info *get_type_dbg_info_(const type_t *type)
162 return (type_dbg_info*) type;
165 /* is the current block a reachable one? */
166 static bool currently_reachable(void)
168 ir_node *const block = get_cur_block();
169 return block != NULL && !is_Bad(block);
172 static void set_unreachable_now(void)
177 static ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
179 static ir_mode *mode_int, *mode_uint;
181 static ir_node *_expression_to_firm(const expression_t *expression);
182 static ir_node *expression_to_firm(const expression_t *expression);
183 static void create_local_declaration(entity_t *entity);
185 static unsigned decide_modulo_shift(unsigned type_size)
187 if (architecture_modulo_shift == 0)
189 if (type_size < architecture_modulo_shift)
190 return architecture_modulo_shift;
194 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
196 unsigned flags = get_atomic_type_flags(kind);
197 unsigned size = get_atomic_type_size(kind);
198 if ( (flags & (ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_FLOAT))
199 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
202 unsigned bit_size = size * 8;
203 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
204 unsigned modulo_shift = 0;
205 ir_mode_arithmetic arithmetic;
207 if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
208 assert(! (flags & ATOMIC_TYPE_FLAG_FLOAT));
209 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U",
211 sort = irms_int_number;
212 arithmetic = irma_twos_complement;
213 modulo_shift = decide_modulo_shift(bit_size);
215 assert(flags & ATOMIC_TYPE_FLAG_FLOAT);
216 snprintf(name, sizeof(name), "F%u", bit_size);
217 sort = irms_float_number;
218 arithmetic = irma_ieee754;
220 return new_ir_mode(name, sort, bit_size, is_signed, arithmetic,
228 * Initialises the atomic modes depending on the machine size.
230 static void init_atomic_modes(void)
232 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
233 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
235 mode_int = atomic_modes[ATOMIC_TYPE_INT];
236 mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
238 /* there's no real void type in firm */
239 atomic_modes[ATOMIC_TYPE_VOID] = atomic_modes[ATOMIC_TYPE_CHAR];
242 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
244 assert(kind <= ATOMIC_TYPE_LAST);
245 return atomic_modes[kind];
248 static ir_node *get_vla_size(array_type_t *const type)
250 ir_node *size_node = type->size_node;
251 if (size_node == NULL) {
252 size_node = expression_to_firm(type->size_expression);
253 type->size_node = size_node;
259 * Return a node representing the size of a type.
261 static ir_node *get_type_size_node(type_t *type)
263 type = skip_typeref(type);
265 if (is_type_array(type) && type->array.is_vla) {
266 ir_node *size_node = get_vla_size(&type->array);
267 ir_node *elem_size = get_type_size_node(type->array.element_type);
268 ir_mode *mode = get_irn_mode(size_node);
269 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
273 ir_mode *mode = get_ir_mode_storage(type_size_t);
275 sym.type_p = get_ir_type(type);
276 return new_SymConst(mode, sym, symconst_type_size);
279 static unsigned count_parameters(const function_type_t *function_type)
283 function_parameter_t *parameter = function_type->parameters;
284 for ( ; parameter != NULL; parameter = parameter->next) {
292 * Creates a Firm type for an atomic type
294 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
296 ir_mode *mode = atomic_modes[akind];
297 type_dbg_info *dbgi = get_type_dbg_info_(type);
298 ir_type *irtype = new_d_type_primitive(mode, dbgi);
299 il_alignment_t alignment = get_atomic_type_alignment(akind);
301 set_type_alignment_bytes(irtype, alignment);
307 * Creates a Firm type for a complex type
309 static ir_type *create_complex_type(const atomic_type_t *type)
311 atomic_type_kind_t kind = type->akind;
312 ir_mode *mode = atomic_modes[kind];
313 ident *id = get_mode_ident(mode);
317 /* FIXME: finish the array */
322 * Creates a Firm type for an imaginary type
324 static ir_type *create_imaginary_type(const atomic_type_t *type)
326 return create_atomic_type(type->akind, (const type_t*)type);
330 * return type of a parameter (and take transparent union gnu extension into
333 static type_t *get_parameter_type(type_t *orig_type)
335 type_t *type = skip_typeref(orig_type);
336 if (is_type_union(type)
337 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
338 compound_t *compound = type->compound.compound;
339 type = compound->members.entities->declaration.type;
345 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
347 type_t *return_type = skip_typeref(function_type->return_type);
349 int n_parameters = count_parameters(function_type)
350 + (for_closure ? 1 : 0);
351 int n_results = return_type == type_void ? 0 : 1;
352 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
353 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
355 if (return_type != type_void) {
356 ir_type *restype = get_ir_type(return_type);
357 set_method_res_type(irtype, 0, restype);
360 function_parameter_t *parameter = function_type->parameters;
363 ir_type *p_irtype = get_ir_type(type_void_ptr);
364 set_method_param_type(irtype, n, p_irtype);
367 for ( ; parameter != NULL; parameter = parameter->next) {
368 type_t *type = get_parameter_type(parameter->type);
369 ir_type *p_irtype = get_ir_type(type);
370 set_method_param_type(irtype, n, p_irtype);
374 bool is_variadic = function_type->variadic;
377 set_method_variadicity(irtype, variadicity_variadic);
379 unsigned cc = get_method_calling_convention(irtype);
380 switch (function_type->calling_convention) {
381 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
384 set_method_calling_convention(irtype, SET_CDECL(cc));
391 /* only non-variadic function can use stdcall, else use cdecl */
392 set_method_calling_convention(irtype, SET_STDCALL(cc));
398 /* only non-variadic function can use fastcall, else use cdecl */
399 set_method_calling_convention(irtype, SET_FASTCALL(cc));
403 /* Hmm, leave default, not accepted by the parser yet. */
408 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
410 const decl_modifiers_t modifiers = function_type->modifiers;
411 if (modifiers & DM_CONST)
412 add_method_additional_properties(irtype, mtp_property_const);
413 if (modifiers & DM_PURE)
414 add_method_additional_properties(irtype, mtp_property_pure);
415 if (modifiers & DM_RETURNS_TWICE)
416 add_method_additional_properties(irtype, mtp_property_returns_twice);
417 if (modifiers & DM_NORETURN)
418 add_method_additional_properties(irtype, mtp_property_noreturn);
419 if (modifiers & DM_NOTHROW)
420 add_method_additional_properties(irtype, mtp_property_nothrow);
421 if (modifiers & DM_MALLOC)
422 add_method_additional_properties(irtype, mtp_property_malloc);
427 static ir_type *create_pointer_type(pointer_type_t *type)
429 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
430 type_t *points_to = type->points_to;
431 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
432 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
437 static ir_type *create_reference_type(reference_type_t *type)
439 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
440 type_t *refers_to = type->refers_to;
441 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
442 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
447 static ir_type *create_array_type(array_type_t *type)
449 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
450 type_t *element_type = type->element_type;
451 ir_type *ir_element_type = get_ir_type(element_type);
452 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
454 const int align = get_type_alignment_bytes(ir_element_type);
455 set_type_alignment_bytes(irtype, align);
457 if (type->size_constant) {
458 int n_elements = type->size;
460 set_array_bounds_int(irtype, 0, 0, n_elements);
462 size_t elemsize = get_type_size_bytes(ir_element_type);
463 if (elemsize % align > 0) {
464 elemsize += align - (elemsize % align);
466 set_type_size_bytes(irtype, n_elements * elemsize);
468 set_array_lower_bound_int(irtype, 0, 0);
470 set_type_state(irtype, layout_fixed);
476 * Return the signed integer type of size bits.
478 * @param size the size
480 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
484 static ir_mode *s_modes[64 + 1] = {NULL, };
488 if (size <= 0 || size > 64)
491 mode = s_modes[size];
495 snprintf(name, sizeof(name), "bf_I%u", size);
496 mode = new_ir_mode(name, irms_int_number, size, 1, irma_twos_complement,
497 size <= 32 ? 32 : size );
498 s_modes[size] = mode;
501 type_dbg_info *dbgi = get_type_dbg_info_(type);
502 res = new_d_type_primitive(mode, dbgi);
503 set_primitive_base_type(res, base_tp);
509 * Return the unsigned integer type of size bits.
511 * @param size the size
513 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
517 static ir_mode *u_modes[64 + 1] = {NULL, };
521 if (size <= 0 || size > 64)
524 mode = u_modes[size];
528 snprintf(name, sizeof(name), "bf_U%u", size);
529 mode = new_ir_mode(name, irms_int_number, size, 0, irma_twos_complement,
530 size <= 32 ? 32 : size );
531 u_modes[size] = mode;
534 type_dbg_info *dbgi = get_type_dbg_info_(type);
535 res = new_d_type_primitive(mode, dbgi);
536 set_primitive_base_type(res, base_tp);
541 static ir_type *create_bitfield_type(const entity_t *entity)
543 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
544 type_t *base = skip_typeref(entity->declaration.type);
545 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
546 ir_type *irbase = get_ir_type(base);
548 unsigned bit_size = entity->compound_member.bit_size;
550 assert(!is_type_float(base));
551 if (is_type_signed(base)) {
552 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
554 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
558 #define INVALID_TYPE ((ir_type_ptr)-1)
561 COMPOUND_IS_STRUCT = false,
562 COMPOUND_IS_UNION = true
566 * Construct firm type from ast struct type.
568 static ir_type *create_compound_type(compound_type_t *type,
569 bool incomplete, bool is_union)
571 compound_t *compound = type->compound;
573 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
574 return compound->irtype;
577 symbol_t *type_symbol = compound->base.symbol;
579 if (type_symbol != NULL) {
580 id = new_id_from_str(type_symbol->string);
583 id = id_unique("__anonymous_union.%u");
585 id = id_unique("__anonymous_struct.%u");
591 irtype = new_type_union(id);
593 irtype = new_type_struct(id);
596 compound->irtype_complete = false;
597 compound->irtype = irtype;
603 layout_union_type(type);
605 layout_struct_type(type);
608 compound->irtype_complete = true;
610 entity_t *entry = compound->members.entities;
611 for ( ; entry != NULL; entry = entry->base.next) {
612 if (entry->kind != ENTITY_COMPOUND_MEMBER)
615 symbol_t *symbol = entry->base.symbol;
616 type_t *entry_type = entry->declaration.type;
618 if (symbol == NULL) {
619 /* anonymous bitfield member, skip */
620 if (entry->compound_member.bitfield)
622 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
623 || entry_type->kind == TYPE_COMPOUND_UNION);
624 ident = id_unique("anon.%u");
626 ident = new_id_from_str(symbol->string);
629 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
631 ir_type *entry_irtype;
632 if (entry->compound_member.bitfield) {
633 entry_irtype = create_bitfield_type(entry);
635 entry_irtype = get_ir_type(entry_type);
637 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
639 set_entity_offset(entity, entry->compound_member.offset);
640 set_entity_offset_bits_remainder(entity,
641 entry->compound_member.bit_offset);
643 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
644 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
645 entry->compound_member.entity = entity;
648 set_type_alignment_bytes(irtype, compound->alignment);
649 set_type_size_bytes(irtype, compound->size);
650 set_type_state(irtype, layout_fixed);
655 static ir_type *create_enum_type(enum_type_t *const type)
657 type->base.base.firm_type = ir_type_int;
659 ir_mode *const mode = mode_int;
660 ir_tarval *const one = get_mode_one(mode);
661 ir_tarval * tv_next = get_mode_null(mode);
663 bool constant_folding_old = constant_folding;
664 constant_folding = true;
666 enum_t *enume = type->enume;
667 entity_t *entry = enume->base.next;
668 for (; entry != NULL; entry = entry->base.next) {
669 if (entry->kind != ENTITY_ENUM_VALUE)
672 expression_t *const init = entry->enum_value.value;
674 ir_node *const cnst = expression_to_firm(init);
675 if (!is_Const(cnst)) {
676 panic("couldn't fold constant");
678 tv_next = get_Const_tarval(cnst);
680 entry->enum_value.tv = tv_next;
681 tv_next = tarval_add(tv_next, one);
684 constant_folding = constant_folding_old;
686 return create_atomic_type(type->base.akind, (const type_t*) type);
689 static ir_type *get_ir_type_incomplete(type_t *type)
691 assert(type != NULL);
692 type = skip_typeref(type);
694 if (type->base.firm_type != NULL) {
695 assert(type->base.firm_type != INVALID_TYPE);
696 return type->base.firm_type;
699 switch (type->kind) {
700 case TYPE_COMPOUND_STRUCT:
701 return create_compound_type(&type->compound, true, COMPOUND_IS_STRUCT);
702 case TYPE_COMPOUND_UNION:
703 return create_compound_type(&type->compound, true, COMPOUND_IS_UNION);
705 return get_ir_type(type);
709 ir_type *get_ir_type(type_t *type)
711 assert(type != NULL);
713 type = skip_typeref(type);
715 if (type->base.firm_type != NULL) {
716 assert(type->base.firm_type != INVALID_TYPE);
717 return type->base.firm_type;
720 ir_type *firm_type = NULL;
721 switch (type->kind) {
723 /* Happens while constant folding, when there was an error */
724 return create_atomic_type(ATOMIC_TYPE_VOID, NULL);
727 firm_type = create_atomic_type(type->atomic.akind, type);
730 firm_type = create_complex_type(&type->atomic);
733 firm_type = create_imaginary_type(&type->atomic);
736 firm_type = create_method_type(&type->function, false);
739 firm_type = create_pointer_type(&type->pointer);
742 firm_type = create_reference_type(&type->reference);
745 firm_type = create_array_type(&type->array);
747 case TYPE_COMPOUND_STRUCT:
748 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_STRUCT);
750 case TYPE_COMPOUND_UNION:
751 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_UNION);
754 firm_type = create_enum_type(&type->enumt);
761 if (firm_type == NULL)
762 panic("unknown type found");
764 type->base.firm_type = firm_type;
768 static ir_mode *get_ir_mode_storage(type_t *type)
770 ir_type *irtype = get_ir_type(type);
772 /* firm doesn't report a mode for arrays somehow... */
773 if (is_Array_type(irtype)) {
777 ir_mode *mode = get_type_mode(irtype);
778 assert(mode != NULL);
783 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
784 * int that it returns bigger modes for floating point on some platforms
785 * (x87 internally does arithemtic with 80bits)
787 static ir_mode *get_ir_mode_arithmetic(type_t *type)
789 ir_mode *mode = get_ir_mode_storage(type);
790 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
791 return mode_float_arithmetic;
797 /** Names of the runtime functions. */
798 static const struct {
799 int id; /**< the rts id */
800 int n_res; /**< number of return values */
801 const char *name; /**< the name of the rts function */
802 int n_params; /**< number of parameters */
803 unsigned flags; /**< language flags */
805 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
806 { rts_abort, 0, "abort", 0, _C89 },
807 { rts_alloca, 1, "alloca", 1, _ALL },
808 { rts_abs, 1, "abs", 1, _C89 },
809 { rts_labs, 1, "labs", 1, _C89 },
810 { rts_llabs, 1, "llabs", 1, _C99 },
811 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
813 { rts_fabs, 1, "fabs", 1, _C89 },
814 { rts_sqrt, 1, "sqrt", 1, _C89 },
815 { rts_cbrt, 1, "cbrt", 1, _C99 },
816 { rts_exp, 1, "exp", 1, _C89 },
817 { rts_exp2, 1, "exp2", 1, _C89 },
818 { rts_exp10, 1, "exp10", 1, _GNUC },
819 { rts_log, 1, "log", 1, _C89 },
820 { rts_log2, 1, "log2", 1, _C89 },
821 { rts_log10, 1, "log10", 1, _C89 },
822 { rts_pow, 1, "pow", 2, _C89 },
823 { rts_sin, 1, "sin", 1, _C89 },
824 { rts_cos, 1, "cos", 1, _C89 },
825 { rts_tan, 1, "tan", 1, _C89 },
826 { rts_asin, 1, "asin", 1, _C89 },
827 { rts_acos, 1, "acos", 1, _C89 },
828 { rts_atan, 1, "atan", 1, _C89 },
829 { rts_sinh, 1, "sinh", 1, _C89 },
830 { rts_cosh, 1, "cosh", 1, _C89 },
831 { rts_tanh, 1, "tanh", 1, _C89 },
833 { rts_fabsf, 1, "fabsf", 1, _C99 },
834 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
835 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
836 { rts_expf, 1, "expf", 1, _C99 },
837 { rts_exp2f, 1, "exp2f", 1, _C99 },
838 { rts_exp10f, 1, "exp10f", 1, _GNUC },
839 { rts_logf, 1, "logf", 1, _C99 },
840 { rts_log2f, 1, "log2f", 1, _C99 },
841 { rts_log10f, 1, "log10f", 1, _C99 },
842 { rts_powf, 1, "powf", 2, _C99 },
843 { rts_sinf, 1, "sinf", 1, _C99 },
844 { rts_cosf, 1, "cosf", 1, _C99 },
845 { rts_tanf, 1, "tanf", 1, _C99 },
846 { rts_asinf, 1, "asinf", 1, _C99 },
847 { rts_acosf, 1, "acosf", 1, _C99 },
848 { rts_atanf, 1, "atanf", 1, _C99 },
849 { rts_sinhf, 1, "sinhf", 1, _C99 },
850 { rts_coshf, 1, "coshf", 1, _C99 },
851 { rts_tanhf, 1, "tanhf", 1, _C99 },
853 { rts_fabsl, 1, "fabsl", 1, _C99 },
854 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
855 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
856 { rts_expl, 1, "expl", 1, _C99 },
857 { rts_exp2l, 1, "exp2l", 1, _C99 },
858 { rts_exp10l, 1, "exp10l", 1, _GNUC },
859 { rts_logl, 1, "logl", 1, _C99 },
860 { rts_log2l, 1, "log2l", 1, _C99 },
861 { rts_log10l, 1, "log10l", 1, _C99 },
862 { rts_powl, 1, "powl", 2, _C99 },
863 { rts_sinl, 1, "sinl", 1, _C99 },
864 { rts_cosl, 1, "cosl", 1, _C99 },
865 { rts_tanl, 1, "tanl", 1, _C99 },
866 { rts_asinl, 1, "asinl", 1, _C99 },
867 { rts_acosl, 1, "acosl", 1, _C99 },
868 { rts_atanl, 1, "atanl", 1, _C99 },
869 { rts_sinhl, 1, "sinhl", 1, _C99 },
870 { rts_coshl, 1, "coshl", 1, _C99 },
871 { rts_tanhl, 1, "tanhl", 1, _C99 },
873 { rts_strcmp, 1, "strcmp", 2, _C89 },
874 { rts_strncmp, 1, "strncmp", 3, _C89 },
875 { rts_strcpy, 1, "strcpy", 2, _C89 },
876 { rts_strlen, 1, "strlen", 1, _C89 },
877 { rts_memcpy, 1, "memcpy", 3, _C89 },
878 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
879 { rts_memmove, 1, "memmove", 3, _C89 },
880 { rts_memset, 1, "memset", 3, _C89 },
881 { rts_memcmp, 1, "memcmp", 3, _C89 },
884 static ident *rts_idents[lengthof(rts_data)];
886 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
888 void set_create_ld_ident(ident *(*func)(entity_t*))
890 create_ld_ident = func;
894 * Handle GNU attributes for entities
896 * @param ent the entity
897 * @param decl the routine declaration
899 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
901 assert(is_declaration(entity));
902 decl_modifiers_t modifiers = entity->declaration.modifiers;
904 if (is_method_entity(irentity)) {
905 if (modifiers & DM_PURE) {
906 set_entity_additional_properties(irentity, mtp_property_pure);
908 if (modifiers & DM_CONST) {
909 add_entity_additional_properties(irentity, mtp_property_const);
912 if (modifiers & DM_USED) {
913 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
915 if (modifiers & DM_WEAK) {
916 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
920 static bool is_main(entity_t *entity)
922 static symbol_t *sym_main = NULL;
923 if (sym_main == NULL) {
924 sym_main = symbol_table_insert("main");
927 if (entity->base.symbol != sym_main)
929 /* must be in outermost scope */
930 if (entity->base.parent_scope != ¤t_translation_unit->scope)
937 * Creates an entity representing a function.
939 * @param entity the function declaration/definition
940 * @param owner_type the owner type of this function, NULL
941 * for global functions
943 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
945 assert(entity->kind == ENTITY_FUNCTION);
946 if (entity->function.irentity != NULL)
947 return entity->function.irentity;
949 switch (entity->function.btk) {
952 case BUILTIN_LIBC_CHECK:
958 if (is_main(entity)) {
959 /* force main to C linkage */
960 type_t *type = entity->declaration.type;
961 assert(is_type_function(type));
962 if (type->function.linkage != LINKAGE_C) {
963 type_t *new_type = duplicate_type(type);
964 new_type->function.linkage = LINKAGE_C;
965 type = identify_new_type(new_type);
966 entity->declaration.type = type;
970 symbol_t *symbol = entity->base.symbol;
971 ident *id = new_id_from_str(symbol->string);
973 /* already an entity defined? */
974 ir_entity *irentity = entitymap_get(&entitymap, symbol);
975 bool const has_body = entity->function.statement != NULL;
976 if (irentity != NULL) {
977 if (get_entity_visibility(irentity) == ir_visibility_external
979 set_entity_visibility(irentity, ir_visibility_default);
984 ir_type *ir_type_method;
985 if (entity->function.need_closure)
986 ir_type_method = create_method_type(&entity->declaration.type->function, true);
988 ir_type_method = get_ir_type(entity->declaration.type);
990 bool nested_function = false;
991 if (owner_type == NULL)
992 owner_type = get_glob_type();
994 nested_function = true;
996 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
997 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
1000 if (nested_function)
1001 ld_id = id_unique("inner.%u");
1003 ld_id = create_ld_ident(entity);
1004 set_entity_ld_ident(irentity, ld_id);
1006 handle_decl_modifiers(irentity, entity);
1008 if (! nested_function) {
1009 /* static inline => local
1010 * extern inline => local
1011 * inline without definition => local
1012 * inline with definition => external_visible */
1013 storage_class_tag_t const storage_class
1014 = (storage_class_tag_t) entity->declaration.storage_class;
1015 bool const is_inline = entity->function.is_inline;
1017 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
1018 set_entity_visibility(irentity, ir_visibility_default);
1019 } else if (storage_class == STORAGE_CLASS_STATIC ||
1020 (is_inline && has_body)) {
1021 set_entity_visibility(irentity, ir_visibility_local);
1022 } else if (has_body) {
1023 set_entity_visibility(irentity, ir_visibility_default);
1025 set_entity_visibility(irentity, ir_visibility_external);
1028 /* nested functions are always local */
1029 set_entity_visibility(irentity, ir_visibility_local);
1032 /* We should check for file scope here, but as long as we compile C only
1033 this is not needed. */
1034 if (!freestanding && !has_body) {
1035 /* check for a known runtime function */
1036 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1037 if (id != rts_idents[i])
1040 function_type_t *function_type
1041 = &entity->declaration.type->function;
1042 /* rts_entities code can't handle a "wrong" number of parameters */
1043 if (function_type->unspecified_parameters)
1046 /* check number of parameters */
1047 int n_params = count_parameters(function_type);
1048 if (n_params != rts_data[i].n_params)
1051 type_t *return_type = skip_typeref(function_type->return_type);
1052 int n_res = return_type != type_void ? 1 : 0;
1053 if (n_res != rts_data[i].n_res)
1056 /* ignore those rts functions not necessary needed for current mode */
1057 if ((c_mode & rts_data[i].flags) == 0)
1059 assert(rts_entities[rts_data[i].id] == NULL);
1060 rts_entities[rts_data[i].id] = irentity;
1064 entitymap_insert(&entitymap, symbol, irentity);
1067 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1068 entity->function.irentity = irentity;
1074 * Creates a SymConst for a given entity.
1076 * @param dbgi debug info
1077 * @param entity the entity
1079 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1081 assert(entity != NULL);
1082 union symconst_symbol sym;
1083 sym.entity_p = entity;
1084 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1087 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1089 ir_mode *value_mode = get_irn_mode(value);
1091 if (value_mode == dest_mode)
1094 if (dest_mode == mode_b) {
1095 ir_node *zero = new_Const(get_mode_null(value_mode));
1096 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_less_greater);
1100 return new_d_Conv(dbgi, value, dest_mode);
1103 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1105 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1109 * Creates a SymConst node representing a wide string literal.
1111 * @param literal the wide string literal
1113 static ir_node *wide_string_literal_to_firm(
1114 const string_literal_expression_t *literal)
1116 ir_type *const global_type = get_glob_type();
1117 ir_type *const elem_type = ir_type_wchar_t;
1118 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1119 ir_type *const type = new_type_array(1, elem_type);
1121 ident *const id = id_unique("str.%u");
1122 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1123 set_entity_ld_ident(entity, id);
1124 set_entity_visibility(entity, ir_visibility_private);
1125 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1127 ir_mode *const mode = get_type_mode(elem_type);
1128 const size_t slen = wstrlen(&literal->value);
1130 set_array_lower_bound_int(type, 0, 0);
1131 set_array_upper_bound_int(type, 0, slen);
1132 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1133 set_type_state(type, layout_fixed);
1135 ir_initializer_t *initializer = create_initializer_compound(slen);
1136 const char *p = literal->value.begin;
1137 for (size_t i = 0; i < slen; ++i) {
1138 assert(p < literal->value.begin + literal->value.size);
1139 utf32 v = read_utf8_char(&p);
1140 ir_tarval *tv = new_tarval_from_long(v, mode);
1141 ir_initializer_t *val = create_initializer_tarval(tv);
1142 set_initializer_compound_value(initializer, i, val);
1144 set_entity_initializer(entity, initializer);
1146 return create_symconst(dbgi, entity);
1150 * Creates a SymConst node representing a string constant.
1152 * @param src_pos the source position of the string constant
1153 * @param id_prefix a prefix for the name of the generated string constant
1154 * @param value the value of the string constant
1156 static ir_node *string_to_firm(const source_position_t *const src_pos,
1157 const char *const id_prefix,
1158 const string_t *const value)
1160 ir_type *const global_type = get_glob_type();
1161 dbg_info *const dbgi = get_dbg_info(src_pos);
1162 ir_type *const type = new_type_array(1, ir_type_const_char);
1164 ident *const id = id_unique(id_prefix);
1165 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1166 set_entity_ld_ident(entity, id);
1167 set_entity_visibility(entity, ir_visibility_private);
1168 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1170 ir_type *const elem_type = ir_type_const_char;
1171 ir_mode *const mode = get_type_mode(elem_type);
1173 const char* const string = value->begin;
1174 const size_t slen = value->size;
1176 set_array_lower_bound_int(type, 0, 0);
1177 set_array_upper_bound_int(type, 0, slen);
1178 set_type_size_bytes(type, slen);
1179 set_type_state(type, layout_fixed);
1181 ir_initializer_t *initializer = create_initializer_compound(slen);
1182 for (size_t i = 0; i < slen; ++i) {
1183 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1184 ir_initializer_t *val = create_initializer_tarval(tv);
1185 set_initializer_compound_value(initializer, i, val);
1187 set_entity_initializer(entity, initializer);
1189 return create_symconst(dbgi, entity);
1192 static bool try_create_integer(literal_expression_t *literal,
1193 type_t *type, unsigned char base)
1195 const char *string = literal->value.begin;
1196 size_t size = literal->value.size;
1198 assert(type->kind == TYPE_ATOMIC);
1199 atomic_type_kind_t akind = type->atomic.akind;
1201 ir_mode *mode = atomic_modes[akind];
1202 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1203 if (tv == tarval_bad)
1206 literal->base.type = type;
1207 literal->target_value = tv;
1211 static void create_integer_tarval(literal_expression_t *literal)
1215 const string_t *suffix = &literal->suffix;
1217 if (suffix->size > 0) {
1218 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1219 if (*c == 'u' || *c == 'U') { ++us; }
1220 if (*c == 'l' || *c == 'L') { ++ls; }
1225 switch (literal->base.kind) {
1226 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1227 case EXPR_LITERAL_INTEGER: base = 10; break;
1228 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1229 default: panic("invalid literal kind");
1232 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1234 /* now try if the constant is small enough for some types */
1235 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1237 if (us == 0 && try_create_integer(literal, type_int, base))
1239 if ((us == 1 || base != 10)
1240 && try_create_integer(literal, type_unsigned_int, base))
1244 if (us == 0 && try_create_integer(literal, type_long, base))
1246 if ((us == 1 || base != 10)
1247 && try_create_integer(literal, type_unsigned_long, base))
1250 /* last try? then we should not report tarval_bad */
1251 if (us != 1 && base == 10)
1252 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1253 if (us == 0 && try_create_integer(literal, type_long_long, base))
1257 assert(us == 1 || base != 10);
1258 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1259 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1261 panic("internal error when parsing number literal");
1264 tarval_set_integer_overflow_mode(old_mode);
1267 void determine_literal_type(literal_expression_t *literal)
1269 switch (literal->base.kind) {
1270 case EXPR_LITERAL_INTEGER:
1271 case EXPR_LITERAL_INTEGER_OCTAL:
1272 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1273 create_integer_tarval(literal);
1281 * Creates a Const node representing a constant.
1283 static ir_node *literal_to_firm(const literal_expression_t *literal)
1285 type_t *type = skip_typeref(literal->base.type);
1286 ir_mode *mode = get_ir_mode_storage(type);
1287 const char *string = literal->value.begin;
1288 size_t size = literal->value.size;
1291 switch (literal->base.kind) {
1292 case EXPR_LITERAL_WIDE_CHARACTER: {
1293 utf32 v = read_utf8_char(&string);
1295 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1297 tv = new_tarval_from_str(buf, len, mode);
1300 case EXPR_LITERAL_CHARACTER: {
1303 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1304 if (size == 1 && char_is_signed) {
1305 v = (signed char)string[0];
1308 for (size_t i = 0; i < size; ++i) {
1309 v = (v << 8) | ((unsigned char)string[i]);
1313 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1315 tv = new_tarval_from_str(buf, len, mode);
1318 case EXPR_LITERAL_INTEGER:
1319 case EXPR_LITERAL_INTEGER_OCTAL:
1320 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1321 assert(literal->target_value != NULL);
1322 tv = literal->target_value;
1324 case EXPR_LITERAL_FLOATINGPOINT:
1325 tv = new_tarval_from_str(string, size, mode);
1327 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1328 char buffer[size + 2];
1329 memcpy(buffer, "0x", 2);
1330 memcpy(buffer+2, string, size);
1331 tv = new_tarval_from_str(buffer, size+2, mode);
1334 case EXPR_LITERAL_BOOLEAN:
1335 if (string[0] == 't') {
1336 tv = get_mode_one(mode);
1338 assert(string[0] == 'f');
1339 tv = get_mode_null(mode);
1342 case EXPR_LITERAL_MS_NOOP:
1343 tv = get_mode_null(mode);
1348 panic("Invalid literal kind found");
1351 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1352 ir_node *res = new_d_Const(dbgi, tv);
1353 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1354 return create_conv(dbgi, res, mode_arith);
1358 * Allocate an area of size bytes aligned at alignment
1361 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1363 static unsigned area_cnt = 0;
1366 ir_type *tp = new_type_array(1, ir_type_char);
1367 set_array_bounds_int(tp, 0, 0, size);
1368 set_type_alignment_bytes(tp, alignment);
1370 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1371 ident *name = new_id_from_str(buf);
1372 ir_entity *area = new_entity(frame_type, name, tp);
1374 /* mark this entity as compiler generated */
1375 set_entity_compiler_generated(area, 1);
1380 * Return a node representing a trampoline region
1381 * for a given function entity.
1383 * @param dbgi debug info
1384 * @param entity the function entity
1386 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1388 ir_entity *region = NULL;
1391 if (current_trampolines != NULL) {
1392 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1393 if (current_trampolines[i].function == entity) {
1394 region = current_trampolines[i].region;
1399 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1401 ir_graph *irg = current_ir_graph;
1402 if (region == NULL) {
1403 /* create a new region */
1404 ir_type *frame_tp = get_irg_frame_type(irg);
1405 trampoline_region reg;
1406 reg.function = entity;
1408 reg.region = alloc_trampoline(frame_tp,
1409 be_params->trampoline_size,
1410 be_params->trampoline_align);
1411 ARR_APP1(trampoline_region, current_trampolines, reg);
1412 region = reg.region;
1414 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1419 * Creates a trampoline for a function represented by an entity.
1421 * @param dbgi debug info
1422 * @param mode the (reference) mode for the function address
1423 * @param entity the function entity
1425 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1428 assert(entity != NULL);
1430 in[0] = get_trampoline_region(dbgi, entity);
1431 in[1] = create_symconst(dbgi, entity);
1432 in[2] = get_irg_frame(current_ir_graph);
1434 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1435 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1436 return new_Proj(irn, mode, pn_Builtin_1_result);
1440 * Dereference an address.
1442 * @param dbgi debug info
1443 * @param type the type of the dereferenced result (the points_to type)
1444 * @param addr the address to dereference
1446 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1447 ir_node *const addr)
1449 ir_type *irtype = get_ir_type(type);
1450 if (is_compound_type(irtype)
1451 || is_Method_type(irtype)
1452 || is_Array_type(irtype)) {
1456 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1457 ? cons_volatile : cons_none;
1458 ir_mode *const mode = get_type_mode(irtype);
1459 ir_node *const memory = get_store();
1460 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1461 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1462 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1464 set_store(load_mem);
1466 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(type);
1467 return create_conv(dbgi, load_res, mode_arithmetic);
1471 * Creates a strict Conv (to the node's mode) if necessary.
1473 * @param dbgi debug info
1474 * @param node the node to strict conv
1476 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1478 ir_mode *mode = get_irn_mode(node);
1480 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1482 if (!mode_is_float(mode))
1485 /* check if there is already a Conv */
1486 if (is_Conv(node)) {
1487 /* convert it into a strict Conv */
1488 set_Conv_strict(node, 1);
1492 /* otherwise create a new one */
1493 return new_d_strictConv(dbgi, node, mode);
1497 * Returns the correct base address depending on whether it is a parameter or a
1498 * normal local variable.
1500 static ir_node *get_local_frame(ir_entity *const ent)
1502 ir_graph *const irg = current_ir_graph;
1503 const ir_type *const owner = get_entity_owner(ent);
1504 if (owner == current_outer_frame) {
1505 assert(current_static_link != NULL);
1506 return current_static_link;
1508 return get_irg_frame(irg);
1513 * Keep all memory edges of the given block.
1515 static void keep_all_memory(ir_node *block)
1517 ir_node *old = get_cur_block();
1519 set_cur_block(block);
1520 keep_alive(get_store());
1521 /* TODO: keep all memory edges from restricted pointers */
1525 static ir_node *reference_expression_enum_value_to_firm(
1526 const reference_expression_t *ref)
1528 entity_t *entity = ref->entity;
1529 type_t *type = skip_typeref(entity->enum_value.enum_type);
1530 /* make sure the type is constructed */
1531 (void) get_ir_type(type);
1533 return new_Const(entity->enum_value.tv);
1536 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1538 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1539 entity_t *entity = ref->entity;
1540 assert(is_declaration(entity));
1541 type_t *type = skip_typeref(entity->declaration.type);
1543 /* make sure the type is constructed */
1544 (void) get_ir_type(type);
1546 if (entity->kind == ENTITY_FUNCTION
1547 && entity->function.btk != BUILTIN_NONE) {
1548 ir_entity *irentity = get_function_entity(entity, NULL);
1549 /* for gcc compatibility we have to produce (dummy) addresses for some
1550 * builtins which don't have entities */
1551 if (irentity == NULL) {
1552 source_position_t const *const pos = &ref->base.source_position;
1553 symbol_t const *const sym = ref->entity->base.symbol;
1554 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1556 /* simply create a NULL pointer */
1557 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1558 ir_node *res = new_Const(get_mode_null(mode));
1564 switch ((declaration_kind_t) entity->declaration.kind) {
1565 case DECLARATION_KIND_UNKNOWN:
1568 case DECLARATION_KIND_LOCAL_VARIABLE: {
1569 ir_mode *const mode = get_ir_mode_storage(type);
1570 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1571 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1573 case DECLARATION_KIND_PARAMETER: {
1574 ir_mode *const mode = get_ir_mode_storage(type);
1575 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1576 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1578 case DECLARATION_KIND_FUNCTION: {
1579 return create_symconst(dbgi, entity->function.irentity);
1581 case DECLARATION_KIND_INNER_FUNCTION: {
1582 ir_mode *const mode = get_ir_mode_storage(type);
1583 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1584 /* inner function not using the closure */
1585 return create_symconst(dbgi, entity->function.irentity);
1587 /* need trampoline here */
1588 return create_trampoline(dbgi, mode, entity->function.irentity);
1591 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1592 const variable_t *variable = &entity->variable;
1593 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1594 return deref_address(dbgi, variable->base.type, addr);
1597 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1598 ir_entity *irentity = entity->variable.v.entity;
1599 ir_node *frame = get_local_frame(irentity);
1600 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1601 return deref_address(dbgi, entity->declaration.type, sel);
1603 case DECLARATION_KIND_PARAMETER_ENTITY: {
1604 ir_entity *irentity = entity->parameter.v.entity;
1605 ir_node *frame = get_local_frame(irentity);
1606 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1607 return deref_address(dbgi, entity->declaration.type, sel);
1610 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1611 return entity->variable.v.vla_base;
1613 case DECLARATION_KIND_COMPOUND_MEMBER:
1614 panic("not implemented reference type");
1617 panic("reference to declaration with unknown type found");
1620 static ir_node *reference_addr(const reference_expression_t *ref)
1622 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1623 entity_t *entity = ref->entity;
1624 assert(is_declaration(entity));
1626 switch((declaration_kind_t) entity->declaration.kind) {
1627 case DECLARATION_KIND_UNKNOWN:
1629 case DECLARATION_KIND_PARAMETER:
1630 case DECLARATION_KIND_LOCAL_VARIABLE:
1631 /* you can store to a local variable (so we don't panic but return NULL
1632 * as an indicator for no real address) */
1634 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1635 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1638 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1639 ir_entity *irentity = entity->variable.v.entity;
1640 ir_node *frame = get_local_frame(irentity);
1641 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1645 case DECLARATION_KIND_PARAMETER_ENTITY: {
1646 ir_entity *irentity = entity->parameter.v.entity;
1647 ir_node *frame = get_local_frame(irentity);
1648 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1653 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1654 return entity->variable.v.vla_base;
1656 case DECLARATION_KIND_FUNCTION: {
1657 return create_symconst(dbgi, entity->function.irentity);
1660 case DECLARATION_KIND_INNER_FUNCTION: {
1661 type_t *const type = skip_typeref(entity->declaration.type);
1662 ir_mode *const mode = get_ir_mode_storage(type);
1663 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1664 /* inner function not using the closure */
1665 return create_symconst(dbgi, entity->function.irentity);
1667 /* need trampoline here */
1668 return create_trampoline(dbgi, mode, entity->function.irentity);
1672 case DECLARATION_KIND_COMPOUND_MEMBER:
1673 panic("not implemented reference type");
1676 panic("reference to declaration with unknown type found");
1680 * Transform calls to builtin functions.
1682 static ir_node *process_builtin_call(const call_expression_t *call)
1684 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1686 assert(call->function->kind == EXPR_REFERENCE);
1687 reference_expression_t *builtin = &call->function->reference;
1689 type_t *expr_type = skip_typeref(builtin->base.type);
1690 assert(is_type_pointer(expr_type));
1692 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1694 switch (builtin->entity->function.btk) {
1697 case BUILTIN_ALLOCA: {
1698 expression_t *argument = call->arguments->expression;
1699 ir_node *size = expression_to_firm(argument);
1701 ir_node *store = get_store();
1702 ir_node *alloca = new_d_Alloc(dbgi, store, size, firm_unknown_type,
1704 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1706 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1711 type_t *type = function_type->function.return_type;
1712 ir_mode *mode = get_ir_mode_arithmetic(type);
1713 ir_tarval *tv = get_mode_infinite(mode);
1714 ir_node *res = new_d_Const(dbgi, tv);
1718 /* Ignore string for now... */
1719 assert(is_type_function(function_type));
1720 type_t *type = function_type->function.return_type;
1721 ir_mode *mode = get_ir_mode_arithmetic(type);
1722 ir_tarval *tv = get_mode_NAN(mode);
1723 ir_node *res = new_d_Const(dbgi, tv);
1726 case BUILTIN_EXPECT: {
1727 expression_t *argument = call->arguments->expression;
1728 return _expression_to_firm(argument);
1730 case BUILTIN_VA_END:
1731 /* evaluate the argument of va_end for its side effects */
1732 _expression_to_firm(call->arguments->expression);
1734 case BUILTIN_OBJECT_SIZE: {
1735 /* determine value of "type" */
1736 expression_t *type_expression = call->arguments->next->expression;
1737 long type_val = fold_constant_to_int(type_expression);
1738 type_t *type = function_type->function.return_type;
1739 ir_mode *mode = get_ir_mode_arithmetic(type);
1740 /* just produce a "I don't know" result */
1741 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1742 get_mode_minus_one(mode);
1744 return new_d_Const(dbgi, result);
1746 case BUILTIN_ROTL: {
1747 ir_node *val = expression_to_firm(call->arguments->expression);
1748 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1749 ir_mode *mode = get_irn_mode(val);
1750 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1752 case BUILTIN_ROTR: {
1753 ir_node *val = expression_to_firm(call->arguments->expression);
1754 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1755 ir_mode *mode = get_irn_mode(val);
1756 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1757 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1758 return new_d_Rotl(dbgi, val, sub, mode);
1763 case BUILTIN_LIBC_CHECK:
1764 panic("builtin did not produce an entity");
1766 panic("invalid builtin found");
1770 * Transform a call expression.
1771 * Handles some special cases, like alloca() calls, which must be resolved
1772 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1773 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1776 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1778 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1779 assert(currently_reachable());
1781 expression_t *function = call->function;
1782 ir_node *callee = NULL;
1783 bool firm_builtin = false;
1784 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1785 if (function->kind == EXPR_REFERENCE) {
1786 const reference_expression_t *ref = &function->reference;
1787 entity_t *entity = ref->entity;
1789 if (entity->kind == ENTITY_FUNCTION) {
1790 builtin_kind_t builtin = entity->function.btk;
1791 if (builtin == BUILTIN_FIRM) {
1792 firm_builtin = true;
1793 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1794 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1795 && builtin != BUILTIN_LIBC_CHECK) {
1796 return process_builtin_call(call);
1801 callee = expression_to_firm(function);
1803 type_t *type = skip_typeref(function->base.type);
1804 assert(is_type_pointer(type));
1805 pointer_type_t *pointer_type = &type->pointer;
1806 type_t *points_to = skip_typeref(pointer_type->points_to);
1807 assert(is_type_function(points_to));
1808 function_type_t *function_type = &points_to->function;
1810 int n_parameters = 0;
1811 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1812 ir_type *new_method_type = NULL;
1813 if (function_type->variadic || function_type->unspecified_parameters) {
1814 const call_argument_t *argument = call->arguments;
1815 for ( ; argument != NULL; argument = argument->next) {
1819 /* we need to construct a new method type matching the call
1821 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1822 int n_res = get_method_n_ress(ir_method_type);
1823 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1824 set_method_calling_convention(new_method_type,
1825 get_method_calling_convention(ir_method_type));
1826 set_method_additional_properties(new_method_type,
1827 get_method_additional_properties(ir_method_type));
1828 set_method_variadicity(new_method_type,
1829 get_method_variadicity(ir_method_type));
1831 for (int i = 0; i < n_res; ++i) {
1832 set_method_res_type(new_method_type, i,
1833 get_method_res_type(ir_method_type, i));
1835 argument = call->arguments;
1836 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1837 expression_t *expression = argument->expression;
1838 ir_type *irtype = get_ir_type(expression->base.type);
1839 set_method_param_type(new_method_type, i, irtype);
1841 ir_method_type = new_method_type;
1843 n_parameters = get_method_n_params(ir_method_type);
1846 ir_node *in[n_parameters];
1848 const call_argument_t *argument = call->arguments;
1849 for (int n = 0; n < n_parameters; ++n) {
1850 expression_t *expression = argument->expression;
1851 ir_node *arg_node = expression_to_firm(expression);
1853 type_t *arg_type = skip_typeref(expression->base.type);
1854 if (!is_type_compound(arg_type)) {
1855 ir_mode *mode = get_ir_mode_storage(expression->base.type);
1856 arg_node = create_conv(dbgi, arg_node, mode);
1857 arg_node = do_strict_conv(dbgi, arg_node);
1862 argument = argument->next;
1866 if (function_type->modifiers & DM_CONST) {
1867 store = get_irg_no_mem(current_ir_graph);
1869 store = get_store();
1873 type_t *return_type = skip_typeref(function_type->return_type);
1874 ir_node *result = NULL;
1876 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1878 if (! (function_type->modifiers & DM_CONST)) {
1879 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1883 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1884 assert(is_type_scalar(return_type));
1885 ir_mode *mode = get_ir_mode_storage(return_type);
1886 result = new_Proj(node, mode, pn_Builtin_1_result);
1887 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1888 result = create_conv(NULL, result, mode_arith);
1891 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1892 if (! (function_type->modifiers & DM_CONST)) {
1893 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1897 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1898 ir_node *resproj = new_Proj(node, mode_T, pn_Call_T_result);
1900 if (is_type_scalar(return_type)) {
1901 ir_mode *mode = get_ir_mode_storage(return_type);
1902 result = new_Proj(resproj, mode, 0);
1903 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1904 result = create_conv(NULL, result, mode_arith);
1906 ir_mode *mode = mode_P_data;
1907 result = new_Proj(resproj, mode, 0);
1912 if (function_type->modifiers & DM_NORETURN) {
1913 /* A dead end: Keep the Call and the Block. Also place all further
1914 * nodes into a new and unreachable block. */
1916 keep_alive(get_cur_block());
1917 ir_node *block = new_Block(0, NULL);
1918 set_cur_block(block);
1924 static void statement_to_firm(statement_t *statement);
1925 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1927 static ir_node *expression_to_addr(const expression_t *expression);
1928 static ir_node *create_condition_evaluation(const expression_t *expression,
1929 ir_node *true_block,
1930 ir_node *false_block);
1932 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1935 if (!is_type_compound(type)) {
1936 ir_mode *mode = get_ir_mode_storage(type);
1937 value = create_conv(dbgi, value, mode);
1938 value = do_strict_conv(dbgi, value);
1941 ir_node *memory = get_store();
1943 if (is_type_scalar(type)) {
1944 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1945 ? cons_volatile : cons_none;
1946 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1947 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1948 set_store(store_mem);
1950 ir_type *irtype = get_ir_type(type);
1951 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1952 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1953 set_store(copyb_mem);
1957 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1959 ir_tarval *all_one = get_mode_all_one(mode);
1960 int mode_size = get_mode_size_bits(mode);
1962 assert(offset >= 0);
1964 assert(offset + size <= mode_size);
1965 if (size == mode_size) {
1969 long shiftr = get_mode_size_bits(mode) - size;
1970 long shiftl = offset;
1971 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1972 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1973 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1974 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1979 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1980 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile)
1982 ir_type *entity_type = get_entity_type(entity);
1983 ir_type *base_type = get_primitive_base_type(entity_type);
1984 assert(base_type != NULL);
1985 ir_mode *mode = get_type_mode(base_type);
1987 value = create_conv(dbgi, value, mode);
1989 /* kill upper bits of value and shift to right position */
1990 int bitoffset = get_entity_offset_bits_remainder(entity);
1991 int bitsize = get_mode_size_bits(get_type_mode(entity_type));
1992 ir_tarval *mask = create_bitfield_mask(mode, 0, bitsize);
1993 ir_node *mask_node = new_d_Const(dbgi, mask);
1994 ir_node *value_masked = new_d_And(dbgi, value, mask_node, mode);
1995 ir_tarval *shiftl = new_tarval_from_long(bitoffset, mode_uint);
1996 ir_node *shiftcount = new_d_Const(dbgi, shiftl);
1997 ir_node *value_maskshift = new_d_Shl(dbgi, value_masked, shiftcount, mode);
1999 /* load current value */
2000 ir_node *mem = get_store();
2001 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2002 set_volatile ? cons_volatile : cons_none);
2003 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2004 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2005 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2006 ir_tarval *inv_mask = tarval_not(shift_mask);
2007 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2008 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2010 /* construct new value and store */
2011 ir_node *new_val = new_d_Or(dbgi, load_res_masked, value_maskshift, mode);
2012 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2013 set_volatile ? cons_volatile : cons_none);
2014 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2015 set_store(store_mem);
2017 return value_masked;
2020 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2023 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2024 entity_t *entity = expression->compound_entry;
2025 type_t *base_type = entity->declaration.type;
2026 ir_mode *mode = get_ir_mode_storage(base_type);
2027 ir_node *mem = get_store();
2028 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2029 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2030 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2032 ir_mode *amode = mode;
2033 /* optimisation, since shifting in modes < machine_size is usually
2035 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2038 unsigned amode_size = get_mode_size_bits(amode);
2039 load_res = create_conv(dbgi, load_res, amode);
2041 set_store(load_mem);
2043 /* kill upper bits */
2044 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2045 int bitoffset = entity->compound_member.bit_offset;
2046 int bitsize = entity->compound_member.bit_size;
2047 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2048 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2049 ir_node *countl = new_d_Const(dbgi, tvl);
2050 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2052 unsigned shift_bitsr = bitoffset + shift_bitsl;
2053 assert(shift_bitsr <= amode_size);
2054 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2055 ir_node *countr = new_d_Const(dbgi, tvr);
2057 if (mode_is_signed(mode)) {
2058 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2060 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2063 type_t *type = expression->base.type;
2064 ir_mode *resmode = get_ir_mode_arithmetic(type);
2065 return create_conv(dbgi, shiftr, resmode);
2068 /* make sure the selected compound type is constructed */
2069 static void construct_select_compound(const select_expression_t *expression)
2071 type_t *type = skip_typeref(expression->compound->base.type);
2072 if (is_type_pointer(type)) {
2073 type = type->pointer.points_to;
2075 (void) get_ir_type(type);
2078 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2079 ir_node *value, ir_node *addr)
2081 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2082 type_t *type = skip_typeref(expression->base.type);
2084 if (!is_type_compound(type)) {
2085 ir_mode *mode = get_ir_mode_storage(type);
2086 value = create_conv(dbgi, value, mode);
2087 value = do_strict_conv(dbgi, value);
2090 if (expression->kind == EXPR_REFERENCE) {
2091 const reference_expression_t *ref = &expression->reference;
2093 entity_t *entity = ref->entity;
2094 assert(is_declaration(entity));
2095 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2096 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2097 set_value(entity->variable.v.value_number, value);
2099 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2100 set_value(entity->parameter.v.value_number, value);
2106 addr = expression_to_addr(expression);
2107 assert(addr != NULL);
2109 if (expression->kind == EXPR_SELECT) {
2110 const select_expression_t *select = &expression->select;
2112 construct_select_compound(select);
2114 entity_t *entity = select->compound_entry;
2115 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2116 if (entity->compound_member.bitfield) {
2117 ir_entity *irentity = entity->compound_member.entity;
2119 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2120 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2126 assign_value(dbgi, addr, type, value);
2130 static void set_value_for_expression(const expression_t *expression,
2133 set_value_for_expression_addr(expression, value, NULL);
2136 static ir_node *get_value_from_lvalue(const expression_t *expression,
2139 if (expression->kind == EXPR_REFERENCE) {
2140 const reference_expression_t *ref = &expression->reference;
2142 entity_t *entity = ref->entity;
2143 assert(entity->kind == ENTITY_VARIABLE
2144 || entity->kind == ENTITY_PARAMETER);
2145 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2147 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2148 value_number = entity->variable.v.value_number;
2149 assert(addr == NULL);
2150 type_t *type = skip_typeref(expression->base.type);
2151 ir_mode *mode = get_ir_mode_storage(type);
2152 ir_node *res = get_value(value_number, mode);
2153 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2154 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2155 value_number = entity->parameter.v.value_number;
2156 assert(addr == NULL);
2157 type_t *type = skip_typeref(expression->base.type);
2158 ir_mode *mode = get_ir_mode_storage(type);
2159 ir_node *res = get_value(value_number, mode);
2160 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2164 assert(addr != NULL);
2165 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2168 if (expression->kind == EXPR_SELECT &&
2169 expression->select.compound_entry->compound_member.bitfield) {
2170 construct_select_compound(&expression->select);
2171 value = bitfield_extract_to_firm(&expression->select, addr);
2173 value = deref_address(dbgi, expression->base.type, addr);
2180 static ir_node *create_incdec(const unary_expression_t *expression)
2182 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2183 const expression_t *value_expr = expression->value;
2184 ir_node *addr = expression_to_addr(value_expr);
2185 ir_node *value = get_value_from_lvalue(value_expr, addr);
2187 type_t *type = skip_typeref(expression->base.type);
2188 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2191 if (is_type_pointer(type)) {
2192 pointer_type_t *pointer_type = &type->pointer;
2193 offset = get_type_size_node(pointer_type->points_to);
2195 assert(is_type_arithmetic(type));
2196 offset = new_Const(get_mode_one(mode));
2200 ir_node *store_value;
2201 switch(expression->base.kind) {
2202 case EXPR_UNARY_POSTFIX_INCREMENT:
2204 store_value = new_d_Add(dbgi, value, offset, mode);
2206 case EXPR_UNARY_POSTFIX_DECREMENT:
2208 store_value = new_d_Sub(dbgi, value, offset, mode);
2210 case EXPR_UNARY_PREFIX_INCREMENT:
2211 result = new_d_Add(dbgi, value, offset, mode);
2212 store_value = result;
2214 case EXPR_UNARY_PREFIX_DECREMENT:
2215 result = new_d_Sub(dbgi, value, offset, mode);
2216 store_value = result;
2219 panic("no incdec expr in create_incdec");
2222 set_value_for_expression_addr(value_expr, store_value, addr);
2227 static bool is_local_variable(expression_t *expression)
2229 if (expression->kind != EXPR_REFERENCE)
2231 reference_expression_t *ref_expr = &expression->reference;
2232 entity_t *entity = ref_expr->entity;
2233 if (entity->kind != ENTITY_VARIABLE)
2235 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2236 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2239 static ir_relation get_relation(const expression_kind_t kind)
2242 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2243 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2244 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2245 case EXPR_BINARY_ISLESS:
2246 case EXPR_BINARY_LESS: return ir_relation_less;
2247 case EXPR_BINARY_ISLESSEQUAL:
2248 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2249 case EXPR_BINARY_ISGREATER:
2250 case EXPR_BINARY_GREATER: return ir_relation_greater;
2251 case EXPR_BINARY_ISGREATEREQUAL:
2252 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2253 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2258 panic("trying to get pn_Cmp from non-comparison binexpr type");
2262 * Handle the assume optimizer hint: check if a Confirm
2263 * node can be created.
2265 * @param dbi debug info
2266 * @param expr the IL assume expression
2268 * we support here only some simple cases:
2273 static ir_node *handle_assume_compare(dbg_info *dbi,
2274 const binary_expression_t *expression)
2276 expression_t *op1 = expression->left;
2277 expression_t *op2 = expression->right;
2278 entity_t *var2, *var = NULL;
2279 ir_node *res = NULL;
2280 ir_relation relation = get_relation(expression->base.kind);
2282 if (is_local_variable(op1) && is_local_variable(op2)) {
2283 var = op1->reference.entity;
2284 var2 = op2->reference.entity;
2286 type_t *const type = skip_typeref(var->declaration.type);
2287 ir_mode *const mode = get_ir_mode_storage(type);
2289 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2290 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2292 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2293 set_value(var2->variable.v.value_number, res);
2295 res = new_d_Confirm(dbi, irn1, irn2, relation);
2296 set_value(var->variable.v.value_number, res);
2301 expression_t *con = NULL;
2302 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2303 var = op1->reference.entity;
2305 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2306 relation = get_inversed_relation(relation);
2307 var = op2->reference.entity;
2312 type_t *const type = skip_typeref(var->declaration.type);
2313 ir_mode *const mode = get_ir_mode_storage(type);
2315 res = get_value(var->variable.v.value_number, mode);
2316 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2317 set_value(var->variable.v.value_number, res);
2323 * Handle the assume optimizer hint.
2325 * @param dbi debug info
2326 * @param expr the IL assume expression
2328 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2330 switch(expression->kind) {
2331 case EXPR_BINARY_EQUAL:
2332 case EXPR_BINARY_NOTEQUAL:
2333 case EXPR_BINARY_LESS:
2334 case EXPR_BINARY_LESSEQUAL:
2335 case EXPR_BINARY_GREATER:
2336 case EXPR_BINARY_GREATEREQUAL:
2337 return handle_assume_compare(dbi, &expression->binary);
2343 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2344 type_t *from_type, type_t *type)
2346 type = skip_typeref(type);
2347 if (type == type_void) {
2348 /* make sure firm type is constructed */
2349 (void) get_ir_type(type);
2352 if (!is_type_scalar(type)) {
2353 /* make sure firm type is constructed */
2354 (void) get_ir_type(type);
2358 from_type = skip_typeref(from_type);
2359 ir_mode *mode = get_ir_mode_storage(type);
2360 /* check for conversion from / to __based types */
2361 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2362 const variable_t *from_var = from_type->pointer.base_variable;
2363 const variable_t *to_var = type->pointer.base_variable;
2364 if (from_var != to_var) {
2365 if (from_var != NULL) {
2366 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2367 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2368 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2370 if (to_var != NULL) {
2371 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2372 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2373 value_node = new_d_Sub(dbgi, value_node, base, mode);
2378 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2379 /* bool adjustments (we save a mode_Bu, but have to temporarily
2380 * convert to mode_b so we only get a 0/1 value */
2381 value_node = create_conv(dbgi, value_node, mode_b);
2384 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2385 ir_node *node = create_conv(dbgi, value_node, mode);
2386 node = do_strict_conv(dbgi, node);
2387 node = create_conv(dbgi, node, mode_arith);
2392 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2394 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2395 type_t *type = skip_typeref(expression->base.type);
2397 if (expression->base.kind == EXPR_UNARY_TAKE_ADDRESS)
2398 return expression_to_addr(expression->value);
2400 const expression_t *value = expression->value;
2402 switch(expression->base.kind) {
2403 case EXPR_UNARY_NEGATE: {
2404 ir_node *value_node = expression_to_firm(value);
2405 ir_mode *mode = get_ir_mode_arithmetic(type);
2406 return new_d_Minus(dbgi, value_node, mode);
2408 case EXPR_UNARY_PLUS:
2409 return expression_to_firm(value);
2410 case EXPR_UNARY_BITWISE_NEGATE: {
2411 ir_node *value_node = expression_to_firm(value);
2412 ir_mode *mode = get_ir_mode_arithmetic(type);
2413 return new_d_Not(dbgi, value_node, mode);
2415 case EXPR_UNARY_NOT: {
2416 ir_node *value_node = _expression_to_firm(value);
2417 value_node = create_conv(dbgi, value_node, mode_b);
2418 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2421 case EXPR_UNARY_DEREFERENCE: {
2422 ir_node *value_node = expression_to_firm(value);
2423 type_t *value_type = skip_typeref(value->base.type);
2424 assert(is_type_pointer(value_type));
2426 /* check for __based */
2427 const variable_t *const base_var = value_type->pointer.base_variable;
2428 if (base_var != NULL) {
2429 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2430 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2431 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2433 type_t *points_to = value_type->pointer.points_to;
2434 return deref_address(dbgi, points_to, value_node);
2436 case EXPR_UNARY_POSTFIX_INCREMENT:
2437 case EXPR_UNARY_POSTFIX_DECREMENT:
2438 case EXPR_UNARY_PREFIX_INCREMENT:
2439 case EXPR_UNARY_PREFIX_DECREMENT:
2440 return create_incdec(expression);
2441 case EXPR_UNARY_CAST: {
2442 ir_node *value_node = expression_to_firm(value);
2443 type_t *from_type = value->base.type;
2444 return create_cast(dbgi, value_node, from_type, type);
2446 case EXPR_UNARY_ASSUME:
2447 return handle_assume(dbgi, value);
2452 panic("invalid UNEXPR type found");
2456 * produces a 0/1 depending of the value of a mode_b node
2458 static ir_node *produce_condition_result(const expression_t *expression,
2459 ir_mode *mode, dbg_info *dbgi)
2461 ir_node *const one_block = new_immBlock();
2462 ir_node *const zero_block = new_immBlock();
2463 create_condition_evaluation(expression, one_block, zero_block);
2464 mature_immBlock(one_block);
2465 mature_immBlock(zero_block);
2467 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2468 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2469 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2470 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2471 set_cur_block(block);
2473 ir_node *const one = new_Const(get_mode_one(mode));
2474 ir_node *const zero = new_Const(get_mode_null(mode));
2475 ir_node *const in[2] = { one, zero };
2476 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2481 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2482 ir_node *value, type_t *type)
2484 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2485 assert(is_type_pointer(type));
2486 pointer_type_t *const pointer_type = &type->pointer;
2487 type_t *const points_to = skip_typeref(pointer_type->points_to);
2488 ir_node * elem_size = get_type_size_node(points_to);
2489 elem_size = create_conv(dbgi, elem_size, mode);
2490 value = create_conv(dbgi, value, mode);
2491 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2495 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2496 ir_node *left, ir_node *right)
2499 type_t *type_left = skip_typeref(expression->left->base.type);
2500 type_t *type_right = skip_typeref(expression->right->base.type);
2502 expression_kind_t kind = expression->base.kind;
2505 case EXPR_BINARY_SHIFTLEFT:
2506 case EXPR_BINARY_SHIFTRIGHT:
2507 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2508 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2509 mode = get_ir_mode_arithmetic(expression->base.type);
2510 right = create_conv(dbgi, right, mode_uint);
2513 case EXPR_BINARY_SUB:
2514 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2515 const pointer_type_t *const ptr_type = &type_left->pointer;
2517 mode = get_ir_mode_arithmetic(expression->base.type);
2518 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2519 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2520 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2521 ir_node *const no_mem = new_NoMem();
2522 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2523 mode, op_pin_state_floats);
2524 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2527 case EXPR_BINARY_SUB_ASSIGN:
2528 if (is_type_pointer(type_left)) {
2529 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2530 mode = get_ir_mode_arithmetic(type_left);
2535 case EXPR_BINARY_ADD:
2536 case EXPR_BINARY_ADD_ASSIGN:
2537 if (is_type_pointer(type_left)) {
2538 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2539 mode = get_ir_mode_arithmetic(type_left);
2541 } else if (is_type_pointer(type_right)) {
2542 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2543 mode = get_ir_mode_arithmetic(type_right);
2550 mode = get_ir_mode_arithmetic(type_right);
2551 left = create_conv(dbgi, left, mode);
2556 case EXPR_BINARY_ADD_ASSIGN:
2557 case EXPR_BINARY_ADD:
2558 return new_d_Add(dbgi, left, right, mode);
2559 case EXPR_BINARY_SUB_ASSIGN:
2560 case EXPR_BINARY_SUB:
2561 return new_d_Sub(dbgi, left, right, mode);
2562 case EXPR_BINARY_MUL_ASSIGN:
2563 case EXPR_BINARY_MUL:
2564 return new_d_Mul(dbgi, left, right, mode);
2565 case EXPR_BINARY_BITWISE_AND:
2566 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2567 return new_d_And(dbgi, left, right, mode);
2568 case EXPR_BINARY_BITWISE_OR:
2569 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2570 return new_d_Or(dbgi, left, right, mode);
2571 case EXPR_BINARY_BITWISE_XOR:
2572 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2573 return new_d_Eor(dbgi, left, right, mode);
2574 case EXPR_BINARY_SHIFTLEFT:
2575 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2576 return new_d_Shl(dbgi, left, right, mode);
2577 case EXPR_BINARY_SHIFTRIGHT:
2578 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2579 if (mode_is_signed(mode)) {
2580 return new_d_Shrs(dbgi, left, right, mode);
2582 return new_d_Shr(dbgi, left, right, mode);
2584 case EXPR_BINARY_DIV:
2585 case EXPR_BINARY_DIV_ASSIGN: {
2586 ir_node *pin = new_Pin(new_NoMem());
2587 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2588 op_pin_state_floats);
2589 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2592 case EXPR_BINARY_MOD:
2593 case EXPR_BINARY_MOD_ASSIGN: {
2594 ir_node *pin = new_Pin(new_NoMem());
2595 assert(!mode_is_float(mode));
2596 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2597 op_pin_state_floats);
2598 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2602 panic("unexpected expression kind");
2606 static ir_node *create_lazy_op(const binary_expression_t *expression)
2608 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2609 type_t *type = skip_typeref(expression->base.type);
2610 ir_mode *mode = get_ir_mode_arithmetic(type);
2612 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2613 bool val = fold_constant_to_bool(expression->left);
2614 expression_kind_t ekind = expression->base.kind;
2615 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2616 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2618 return new_Const(get_mode_null(mode));
2622 return new_Const(get_mode_one(mode));
2626 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2627 bool valr = fold_constant_to_bool(expression->right);
2628 return create_Const_from_bool(mode, valr);
2631 return produce_condition_result(expression->right, mode, dbgi);
2634 return produce_condition_result((const expression_t*) expression, mode,
2638 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2639 ir_node *right, ir_mode *mode);
2641 static ir_node *create_assign_binop(const binary_expression_t *expression)
2643 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2644 const expression_t *left_expr = expression->left;
2645 type_t *type = skip_typeref(left_expr->base.type);
2646 ir_node *right = expression_to_firm(expression->right);
2647 ir_node *left_addr = expression_to_addr(left_expr);
2648 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2649 ir_node *result = create_op(dbgi, expression, left, right);
2651 result = create_cast(dbgi, result, expression->right->base.type, type);
2652 result = do_strict_conv(dbgi, result);
2654 result = set_value_for_expression_addr(left_expr, result, left_addr);
2656 if (!is_type_compound(type)) {
2657 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2658 result = create_conv(dbgi, result, mode_arithmetic);
2663 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2665 expression_kind_t kind = expression->base.kind;
2668 case EXPR_BINARY_EQUAL:
2669 case EXPR_BINARY_NOTEQUAL:
2670 case EXPR_BINARY_LESS:
2671 case EXPR_BINARY_LESSEQUAL:
2672 case EXPR_BINARY_GREATER:
2673 case EXPR_BINARY_GREATEREQUAL:
2674 case EXPR_BINARY_ISGREATER:
2675 case EXPR_BINARY_ISGREATEREQUAL:
2676 case EXPR_BINARY_ISLESS:
2677 case EXPR_BINARY_ISLESSEQUAL:
2678 case EXPR_BINARY_ISLESSGREATER:
2679 case EXPR_BINARY_ISUNORDERED: {
2680 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2681 ir_node *left = expression_to_firm(expression->left);
2682 ir_node *right = expression_to_firm(expression->right);
2683 ir_relation relation = get_relation(kind);
2684 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2687 case EXPR_BINARY_ASSIGN: {
2688 ir_node *addr = expression_to_addr(expression->left);
2689 ir_node *right = expression_to_firm(expression->right);
2691 = set_value_for_expression_addr(expression->left, right, addr);
2693 type_t *type = skip_typeref(expression->base.type);
2694 if (!is_type_compound(type)) {
2695 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2696 res = create_conv(NULL, res, mode_arithmetic);
2700 case EXPR_BINARY_ADD:
2701 case EXPR_BINARY_SUB:
2702 case EXPR_BINARY_MUL:
2703 case EXPR_BINARY_DIV:
2704 case EXPR_BINARY_MOD:
2705 case EXPR_BINARY_BITWISE_AND:
2706 case EXPR_BINARY_BITWISE_OR:
2707 case EXPR_BINARY_BITWISE_XOR:
2708 case EXPR_BINARY_SHIFTLEFT:
2709 case EXPR_BINARY_SHIFTRIGHT:
2711 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2712 ir_node *left = expression_to_firm(expression->left);
2713 ir_node *right = expression_to_firm(expression->right);
2714 return create_op(dbgi, expression, left, right);
2716 case EXPR_BINARY_LOGICAL_AND:
2717 case EXPR_BINARY_LOGICAL_OR:
2718 return create_lazy_op(expression);
2719 case EXPR_BINARY_COMMA:
2720 /* create side effects of left side */
2721 (void) expression_to_firm(expression->left);
2722 return _expression_to_firm(expression->right);
2724 case EXPR_BINARY_ADD_ASSIGN:
2725 case EXPR_BINARY_SUB_ASSIGN:
2726 case EXPR_BINARY_MUL_ASSIGN:
2727 case EXPR_BINARY_MOD_ASSIGN:
2728 case EXPR_BINARY_DIV_ASSIGN:
2729 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2730 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2731 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2732 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2733 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2734 return create_assign_binop(expression);
2736 panic("TODO binexpr type");
2740 static ir_node *array_access_addr(const array_access_expression_t *expression)
2742 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2743 ir_node *base_addr = expression_to_firm(expression->array_ref);
2744 ir_node *offset = expression_to_firm(expression->index);
2745 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2746 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2747 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2752 static ir_node *array_access_to_firm(
2753 const array_access_expression_t *expression)
2755 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2756 ir_node *addr = array_access_addr(expression);
2757 type_t *type = revert_automatic_type_conversion(
2758 (const expression_t*) expression);
2759 type = skip_typeref(type);
2761 return deref_address(dbgi, type, addr);
2764 static long get_offsetof_offset(const offsetof_expression_t *expression)
2766 type_t *orig_type = expression->type;
2769 designator_t *designator = expression->designator;
2770 for ( ; designator != NULL; designator = designator->next) {
2771 type_t *type = skip_typeref(orig_type);
2772 /* be sure the type is constructed */
2773 (void) get_ir_type(type);
2775 if (designator->symbol != NULL) {
2776 assert(is_type_compound(type));
2777 symbol_t *symbol = designator->symbol;
2779 compound_t *compound = type->compound.compound;
2780 entity_t *iter = compound->members.entities;
2781 for ( ; iter != NULL; iter = iter->base.next) {
2782 if (iter->base.symbol == symbol) {
2786 assert(iter != NULL);
2788 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2789 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2790 offset += get_entity_offset(iter->compound_member.entity);
2792 orig_type = iter->declaration.type;
2794 expression_t *array_index = designator->array_index;
2795 assert(designator->array_index != NULL);
2796 assert(is_type_array(type));
2798 long index = fold_constant_to_int(array_index);
2799 ir_type *arr_type = get_ir_type(type);
2800 ir_type *elem_type = get_array_element_type(arr_type);
2801 long elem_size = get_type_size_bytes(elem_type);
2803 offset += index * elem_size;
2805 orig_type = type->array.element_type;
2812 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2814 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2815 long offset = get_offsetof_offset(expression);
2816 ir_tarval *tv = new_tarval_from_long(offset, mode);
2817 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2819 return new_d_Const(dbgi, tv);
2822 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2823 ir_entity *entity, type_t *type);
2825 static ir_node *compound_literal_to_firm(
2826 const compound_literal_expression_t *expression)
2828 type_t *type = expression->type;
2830 /* create an entity on the stack */
2831 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2833 ident *const id = id_unique("CompLit.%u");
2834 ir_type *const irtype = get_ir_type(type);
2835 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2836 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2837 set_entity_ld_ident(entity, id);
2839 /* create initialisation code */
2840 initializer_t *initializer = expression->initializer;
2841 create_local_initializer(initializer, dbgi, entity, type);
2843 /* create a sel for the compound literal address */
2844 ir_node *frame = get_irg_frame(current_ir_graph);
2845 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2850 * Transform a sizeof expression into Firm code.
2852 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2854 type_t *const type = skip_typeref(expression->type);
2855 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2856 if (is_type_array(type) && type->array.is_vla
2857 && expression->tp_expression != NULL) {
2858 expression_to_firm(expression->tp_expression);
2860 /* strange gnu extensions: sizeof(function) == 1 */
2861 if (is_type_function(type)) {
2862 ir_mode *mode = get_ir_mode_storage(type_size_t);
2863 return new_Const(get_mode_one(mode));
2866 return get_type_size_node(type);
2869 static entity_t *get_expression_entity(const expression_t *expression)
2871 if (expression->kind != EXPR_REFERENCE)
2874 return expression->reference.entity;
2877 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2879 switch(entity->kind) {
2880 DECLARATION_KIND_CASES
2881 return entity->declaration.alignment;
2884 return entity->compound.alignment;
2885 case ENTITY_TYPEDEF:
2886 return entity->typedefe.alignment;
2894 * Transform an alignof expression into Firm code.
2896 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2898 unsigned alignment = 0;
2900 const expression_t *tp_expression = expression->tp_expression;
2901 if (tp_expression != NULL) {
2902 entity_t *entity = get_expression_entity(tp_expression);
2903 if (entity != NULL) {
2904 if (entity->kind == ENTITY_FUNCTION) {
2905 /* a gnu-extension */
2908 alignment = get_cparser_entity_alignment(entity);
2913 if (alignment == 0) {
2914 type_t *type = expression->type;
2915 alignment = get_type_alignment(type);
2918 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2919 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2920 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2921 return new_d_Const(dbgi, tv);
2924 static void init_ir_types(void);
2926 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2928 assert(is_type_valid(skip_typeref(expression->base.type)));
2930 bool constant_folding_old = constant_folding;
2931 constant_folding = true;
2935 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2937 ir_graph *old_current_ir_graph = current_ir_graph;
2938 current_ir_graph = get_const_code_irg();
2940 ir_node *cnst = expression_to_firm(expression);
2941 current_ir_graph = old_current_ir_graph;
2943 if (!is_Const(cnst)) {
2944 panic("couldn't fold constant");
2947 constant_folding = constant_folding_old;
2949 return get_Const_tarval(cnst);
2952 /* this function is only used in parser.c, but it relies on libfirm functionality */
2953 bool constant_is_negative(const expression_t *expression)
2955 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2956 ir_tarval *tv = fold_constant_to_tarval(expression);
2957 return tarval_is_negative(tv);
2960 long fold_constant_to_int(const expression_t *expression)
2962 if (expression->kind == EXPR_ERROR)
2965 ir_tarval *tv = fold_constant_to_tarval(expression);
2966 if (!tarval_is_long(tv)) {
2967 panic("result of constant folding is not integer");
2970 return get_tarval_long(tv);
2973 bool fold_constant_to_bool(const expression_t *expression)
2975 if (expression->kind == EXPR_ERROR)
2977 ir_tarval *tv = fold_constant_to_tarval(expression);
2978 return !tarval_is_null(tv);
2981 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2983 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2985 /* first try to fold a constant condition */
2986 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
2987 bool val = fold_constant_to_bool(expression->condition);
2989 expression_t *true_expression = expression->true_expression;
2990 if (true_expression == NULL)
2991 true_expression = expression->condition;
2992 return expression_to_firm(true_expression);
2994 return expression_to_firm(expression->false_expression);
2998 ir_node *const true_block = new_immBlock();
2999 ir_node *const false_block = new_immBlock();
3000 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3001 mature_immBlock(true_block);
3002 mature_immBlock(false_block);
3004 set_cur_block(true_block);
3006 if (expression->true_expression != NULL) {
3007 true_val = expression_to_firm(expression->true_expression);
3008 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3009 true_val = cond_expr;
3011 /* Condition ended with a short circuit (&&, ||, !) operation or a
3012 * comparison. Generate a "1" as value for the true branch. */
3013 true_val = new_Const(get_mode_one(mode_Is));
3015 ir_node *const true_jmp = new_d_Jmp(dbgi);
3017 set_cur_block(false_block);
3018 ir_node *const false_val = expression_to_firm(expression->false_expression);
3019 ir_node *const false_jmp = new_d_Jmp(dbgi);
3021 /* create the common block */
3022 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3023 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3024 set_cur_block(block);
3026 /* TODO improve static semantics, so either both or no values are NULL */
3027 if (true_val == NULL || false_val == NULL)
3030 ir_node *const in[2] = { true_val, false_val };
3031 type_t *const type = skip_typeref(expression->base.type);
3033 if (is_type_compound(type)) {
3036 mode = get_ir_mode_arithmetic(type);
3038 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3044 * Returns an IR-node representing the address of a field.
3046 static ir_node *select_addr(const select_expression_t *expression)
3048 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3050 construct_select_compound(expression);
3052 ir_node *compound_addr = expression_to_firm(expression->compound);
3054 entity_t *entry = expression->compound_entry;
3055 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3056 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3058 if (constant_folding) {
3059 ir_mode *mode = get_irn_mode(compound_addr);
3060 /* FIXME: here, we need an integer mode with the same number of bits as mode */
3061 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3062 return new_d_Add(dbgi, compound_addr, ofs, mode);
3064 ir_entity *irentity = entry->compound_member.entity;
3065 assert(irentity != NULL);
3066 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3070 static ir_node *select_to_firm(const select_expression_t *expression)
3072 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3073 ir_node *addr = select_addr(expression);
3074 type_t *type = revert_automatic_type_conversion(
3075 (const expression_t*) expression);
3076 type = skip_typeref(type);
3078 entity_t *entry = expression->compound_entry;
3079 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3081 if (entry->compound_member.bitfield) {
3082 return bitfield_extract_to_firm(expression, addr);
3085 return deref_address(dbgi, type, addr);
3088 /* Values returned by __builtin_classify_type. */
3089 typedef enum gcc_type_class
3095 enumeral_type_class,
3098 reference_type_class,
3102 function_type_class,
3113 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3115 type_t *type = expr->type_expression->base.type;
3117 /* FIXME gcc returns different values depending on whether compiling C or C++
3118 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3121 type = skip_typeref(type);
3122 switch (type->kind) {
3124 const atomic_type_t *const atomic_type = &type->atomic;
3125 switch (atomic_type->akind) {
3126 /* should not be reached */
3127 case ATOMIC_TYPE_INVALID:
3131 /* gcc cannot do that */
3132 case ATOMIC_TYPE_VOID:
3133 tc = void_type_class;
3136 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3137 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3138 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3139 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3140 case ATOMIC_TYPE_SHORT:
3141 case ATOMIC_TYPE_USHORT:
3142 case ATOMIC_TYPE_INT:
3143 case ATOMIC_TYPE_UINT:
3144 case ATOMIC_TYPE_LONG:
3145 case ATOMIC_TYPE_ULONG:
3146 case ATOMIC_TYPE_LONGLONG:
3147 case ATOMIC_TYPE_ULONGLONG:
3148 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3149 tc = integer_type_class;
3152 case ATOMIC_TYPE_FLOAT:
3153 case ATOMIC_TYPE_DOUBLE:
3154 case ATOMIC_TYPE_LONG_DOUBLE:
3155 tc = real_type_class;
3158 panic("Unexpected atomic type in classify_type_to_firm().");
3161 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3162 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3163 case TYPE_ARRAY: /* gcc handles this as pointer */
3164 case TYPE_FUNCTION: /* gcc handles this as pointer */
3165 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3166 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3167 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3169 /* gcc handles this as integer */
3170 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3172 /* gcc classifies the referenced type */
3173 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3175 /* typedef/typeof should be skipped already */
3181 panic("unexpected TYPE classify_type_to_firm().");
3185 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3186 ir_tarval *const tv = new_tarval_from_long(tc, mode_int);
3187 return new_d_Const(dbgi, tv);
3190 static ir_node *function_name_to_firm(
3191 const funcname_expression_t *const expr)
3193 switch(expr->kind) {
3194 case FUNCNAME_FUNCTION:
3195 case FUNCNAME_PRETTY_FUNCTION:
3196 case FUNCNAME_FUNCDNAME:
3197 if (current_function_name == NULL) {
3198 const source_position_t *const src_pos = &expr->base.source_position;
3199 const char *name = current_function_entity->base.symbol->string;
3200 const string_t string = { name, strlen(name) + 1 };
3201 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3203 return current_function_name;
3204 case FUNCNAME_FUNCSIG:
3205 if (current_funcsig == NULL) {
3206 const source_position_t *const src_pos = &expr->base.source_position;
3207 ir_entity *ent = get_irg_entity(current_ir_graph);
3208 const char *const name = get_entity_ld_name(ent);
3209 const string_t string = { name, strlen(name) + 1 };
3210 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3212 return current_funcsig;
3214 panic("Unsupported function name");
3217 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3219 statement_t *statement = expr->statement;
3221 assert(statement->kind == STATEMENT_COMPOUND);
3222 return compound_statement_to_firm(&statement->compound);
3225 static ir_node *va_start_expression_to_firm(
3226 const va_start_expression_t *const expr)
3228 ir_entity *param_ent = current_vararg_entity;
3229 if (param_ent == NULL) {
3230 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3231 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3232 ir_type *const param_type = get_unknown_type();
3233 param_ent = new_parameter_entity(frame_type, n, param_type);
3234 current_vararg_entity = param_ent;
3237 ir_node *const frame = get_irg_frame(current_ir_graph);
3238 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3239 ir_node *const no_mem = new_NoMem();
3240 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3242 set_value_for_expression(expr->ap, arg_sel);
3247 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3249 type_t *const type = expr->base.type;
3250 expression_t *const ap_expr = expr->ap;
3251 ir_node *const ap_addr = expression_to_addr(ap_expr);
3252 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3253 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3254 ir_node *const res = deref_address(dbgi, type, ap);
3256 ir_node *const cnst = get_type_size_node(expr->base.type);
3257 ir_mode *const mode = get_irn_mode(cnst);
3258 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3259 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3260 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3261 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3262 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3264 set_value_for_expression_addr(ap_expr, add, ap_addr);
3270 * Generate Firm for a va_copy expression.
3272 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3274 ir_node *const src = expression_to_firm(expr->src);
3275 set_value_for_expression(expr->dst, src);
3279 static ir_node *dereference_addr(const unary_expression_t *const expression)
3281 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3282 return expression_to_firm(expression->value);
3286 * Returns a IR-node representing an lvalue of the given expression.
3288 static ir_node *expression_to_addr(const expression_t *expression)
3290 switch(expression->kind) {
3291 case EXPR_ARRAY_ACCESS:
3292 return array_access_addr(&expression->array_access);
3294 return call_expression_to_firm(&expression->call);
3295 case EXPR_COMPOUND_LITERAL:
3296 return compound_literal_to_firm(&expression->compound_literal);
3297 case EXPR_REFERENCE:
3298 return reference_addr(&expression->reference);
3300 return select_addr(&expression->select);
3301 case EXPR_UNARY_DEREFERENCE:
3302 return dereference_addr(&expression->unary);
3306 panic("trying to get address of non-lvalue");
3309 static ir_node *builtin_constant_to_firm(
3310 const builtin_constant_expression_t *expression)
3312 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3313 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3314 return create_Const_from_bool(mode, v);
3317 static ir_node *builtin_types_compatible_to_firm(
3318 const builtin_types_compatible_expression_t *expression)
3320 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3321 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3322 bool const value = types_compatible(left, right);
3323 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3324 return create_Const_from_bool(mode, value);
3327 static ir_node *get_label_block(label_t *label)
3329 if (label->block != NULL)
3330 return label->block;
3332 /* beware: might be called from create initializer with current_ir_graph
3333 * set to const_code_irg. */
3334 ir_graph *rem = current_ir_graph;
3335 current_ir_graph = current_function;
3337 ir_node *block = new_immBlock();
3339 label->block = block;
3341 ARR_APP1(label_t *, all_labels, label);
3343 current_ir_graph = rem;
3348 * Pointer to a label. This is used for the
3349 * GNU address-of-label extension.
3351 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3353 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3354 ir_node *block = get_label_block(label->label);
3355 ir_entity *entity = create_Block_entity(block);
3357 symconst_symbol value;
3358 value.entity_p = entity;
3359 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3362 static ir_node *error_to_firm(const expression_t *expression)
3364 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3365 return new_Bad(mode);
3369 * creates firm nodes for an expression. The difference between this function
3370 * and expression_to_firm is, that this version might produce mode_b nodes
3371 * instead of mode_Is.
3373 static ir_node *_expression_to_firm(const expression_t *expression)
3376 if (!constant_folding) {
3377 assert(!expression->base.transformed);
3378 ((expression_t*) expression)->base.transformed = true;
3382 switch (expression->kind) {
3384 return literal_to_firm(&expression->literal);
3385 case EXPR_STRING_LITERAL:
3386 return string_to_firm(&expression->base.source_position, "str.%u",
3387 &expression->literal.value);
3388 case EXPR_WIDE_STRING_LITERAL:
3389 return wide_string_literal_to_firm(&expression->string_literal);
3390 case EXPR_REFERENCE:
3391 return reference_expression_to_firm(&expression->reference);
3392 case EXPR_REFERENCE_ENUM_VALUE:
3393 return reference_expression_enum_value_to_firm(&expression->reference);
3395 return call_expression_to_firm(&expression->call);
3397 return unary_expression_to_firm(&expression->unary);
3399 return binary_expression_to_firm(&expression->binary);
3400 case EXPR_ARRAY_ACCESS:
3401 return array_access_to_firm(&expression->array_access);
3403 return sizeof_to_firm(&expression->typeprop);
3405 return alignof_to_firm(&expression->typeprop);
3406 case EXPR_CONDITIONAL:
3407 return conditional_to_firm(&expression->conditional);
3409 return select_to_firm(&expression->select);
3410 case EXPR_CLASSIFY_TYPE:
3411 return classify_type_to_firm(&expression->classify_type);
3413 return function_name_to_firm(&expression->funcname);
3414 case EXPR_STATEMENT:
3415 return statement_expression_to_firm(&expression->statement);
3417 return va_start_expression_to_firm(&expression->va_starte);
3419 return va_arg_expression_to_firm(&expression->va_arge);
3421 return va_copy_expression_to_firm(&expression->va_copye);
3422 case EXPR_BUILTIN_CONSTANT_P:
3423 return builtin_constant_to_firm(&expression->builtin_constant);
3424 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
3425 return builtin_types_compatible_to_firm(&expression->builtin_types_compatible);
3427 return offsetof_to_firm(&expression->offsetofe);
3428 case EXPR_COMPOUND_LITERAL:
3429 return compound_literal_to_firm(&expression->compound_literal);
3430 case EXPR_LABEL_ADDRESS:
3431 return label_address_to_firm(&expression->label_address);
3434 return error_to_firm(expression);
3436 panic("invalid expression found");
3440 * Check if a given expression is a GNU __builtin_expect() call.
3442 static bool is_builtin_expect(const expression_t *expression)
3444 if (expression->kind != EXPR_CALL)
3447 expression_t *function = expression->call.function;
3448 if (function->kind != EXPR_REFERENCE)
3450 reference_expression_t *ref = &function->reference;
3451 if (ref->entity->kind != ENTITY_FUNCTION ||
3452 ref->entity->function.btk != BUILTIN_EXPECT)
3458 static bool produces_mode_b(const expression_t *expression)
3460 switch (expression->kind) {
3461 case EXPR_BINARY_EQUAL:
3462 case EXPR_BINARY_NOTEQUAL:
3463 case EXPR_BINARY_LESS:
3464 case EXPR_BINARY_LESSEQUAL:
3465 case EXPR_BINARY_GREATER:
3466 case EXPR_BINARY_GREATEREQUAL:
3467 case EXPR_BINARY_ISGREATER:
3468 case EXPR_BINARY_ISGREATEREQUAL:
3469 case EXPR_BINARY_ISLESS:
3470 case EXPR_BINARY_ISLESSEQUAL:
3471 case EXPR_BINARY_ISLESSGREATER:
3472 case EXPR_BINARY_ISUNORDERED:
3473 case EXPR_UNARY_NOT:
3477 if (is_builtin_expect(expression)) {
3478 expression_t *argument = expression->call.arguments->expression;
3479 return produces_mode_b(argument);
3482 case EXPR_BINARY_COMMA:
3483 return produces_mode_b(expression->binary.right);
3490 static ir_node *expression_to_firm(const expression_t *expression)
3492 if (!produces_mode_b(expression)) {
3493 ir_node *res = _expression_to_firm(expression);
3494 assert(res == NULL || get_irn_mode(res) != mode_b);
3498 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3499 bool const constant_folding_old = constant_folding;
3500 constant_folding = true;
3501 ir_node *res = _expression_to_firm(expression);
3502 constant_folding = constant_folding_old;
3503 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3504 assert(is_Const(res));
3505 return create_Const_from_bool(mode, !is_Const_null(res));
3508 /* we have to produce a 0/1 from the mode_b expression */
3509 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3510 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3511 return produce_condition_result(expression, mode, dbgi);
3515 * create a short-circuit expression evaluation that tries to construct
3516 * efficient control flow structures for &&, || and ! expressions
3518 static ir_node *create_condition_evaluation(const expression_t *expression,
3519 ir_node *true_block,
3520 ir_node *false_block)
3522 switch(expression->kind) {
3523 case EXPR_UNARY_NOT: {
3524 const unary_expression_t *unary_expression = &expression->unary;
3525 create_condition_evaluation(unary_expression->value, false_block,
3529 case EXPR_BINARY_LOGICAL_AND: {
3530 const binary_expression_t *binary_expression = &expression->binary;
3532 ir_node *extra_block = new_immBlock();
3533 create_condition_evaluation(binary_expression->left, extra_block,
3535 mature_immBlock(extra_block);
3536 set_cur_block(extra_block);
3537 create_condition_evaluation(binary_expression->right, true_block,
3541 case EXPR_BINARY_LOGICAL_OR: {
3542 const binary_expression_t *binary_expression = &expression->binary;
3544 ir_node *extra_block = new_immBlock();
3545 create_condition_evaluation(binary_expression->left, true_block,
3547 mature_immBlock(extra_block);
3548 set_cur_block(extra_block);
3549 create_condition_evaluation(binary_expression->right, true_block,
3557 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3558 ir_node *cond_expr = _expression_to_firm(expression);
3559 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3560 ir_node *cond = new_d_Cond(dbgi, condition);
3561 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3562 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3564 /* set branch prediction info based on __builtin_expect */
3565 if (is_builtin_expect(expression) && is_Cond(cond)) {
3566 call_argument_t *argument = expression->call.arguments->next;
3567 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3568 bool const cnst = fold_constant_to_bool(argument->expression);
3569 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3570 set_Cond_jmp_pred(cond, pred);
3574 add_immBlock_pred(true_block, true_proj);
3575 add_immBlock_pred(false_block, false_proj);
3577 set_unreachable_now();
3581 static void create_variable_entity(entity_t *variable,
3582 declaration_kind_t declaration_kind,
3583 ir_type *parent_type)
3585 assert(variable->kind == ENTITY_VARIABLE);
3586 type_t *type = skip_typeref(variable->declaration.type);
3588 ident *const id = new_id_from_str(variable->base.symbol->string);
3589 ir_type *const irtype = get_ir_type(type);
3590 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3591 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3592 unsigned alignment = variable->declaration.alignment;
3594 set_entity_alignment(irentity, alignment);
3596 handle_decl_modifiers(irentity, variable);
3598 variable->declaration.kind = (unsigned char) declaration_kind;
3599 variable->variable.v.entity = irentity;
3600 set_entity_ld_ident(irentity, create_ld_ident(variable));
3602 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3603 set_entity_volatility(irentity, volatility_is_volatile);
3608 typedef struct type_path_entry_t type_path_entry_t;
3609 struct type_path_entry_t {
3611 ir_initializer_t *initializer;
3613 entity_t *compound_entry;
3616 typedef struct type_path_t type_path_t;
3617 struct type_path_t {
3618 type_path_entry_t *path;
3623 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3625 size_t len = ARR_LEN(path->path);
3627 for (size_t i = 0; i < len; ++i) {
3628 const type_path_entry_t *entry = & path->path[i];
3630 type_t *type = skip_typeref(entry->type);
3631 if (is_type_compound(type)) {
3632 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3633 } else if (is_type_array(type)) {
3634 fprintf(stderr, "[%u]", (unsigned) entry->index);
3636 fprintf(stderr, "-INVALID-");
3639 fprintf(stderr, " (");
3640 print_type(path->top_type);
3641 fprintf(stderr, ")");
3644 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3646 size_t len = ARR_LEN(path->path);
3648 return & path->path[len-1];
3651 static type_path_entry_t *append_to_type_path(type_path_t *path)
3653 size_t len = ARR_LEN(path->path);
3654 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3656 type_path_entry_t *result = & path->path[len];
3657 memset(result, 0, sizeof(result[0]));
3661 static size_t get_compound_member_count(const compound_type_t *type)
3663 compound_t *compound = type->compound;
3664 size_t n_members = 0;
3665 entity_t *member = compound->members.entities;
3666 for ( ; member != NULL; member = member->base.next) {
3673 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3675 type_t *orig_top_type = path->top_type;
3676 type_t *top_type = skip_typeref(orig_top_type);
3678 assert(is_type_compound(top_type) || is_type_array(top_type));
3680 if (ARR_LEN(path->path) == 0) {
3683 type_path_entry_t *top = get_type_path_top(path);
3684 ir_initializer_t *initializer = top->initializer;
3685 return get_initializer_compound_value(initializer, top->index);
3689 static void descend_into_subtype(type_path_t *path)
3691 type_t *orig_top_type = path->top_type;
3692 type_t *top_type = skip_typeref(orig_top_type);
3694 assert(is_type_compound(top_type) || is_type_array(top_type));
3696 ir_initializer_t *initializer = get_initializer_entry(path);
3698 type_path_entry_t *top = append_to_type_path(path);
3699 top->type = top_type;
3703 if (is_type_compound(top_type)) {
3704 compound_t *const compound = top_type->compound.compound;
3705 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3707 top->compound_entry = entry;
3709 len = get_compound_member_count(&top_type->compound);
3710 if (entry != NULL) {
3711 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3712 path->top_type = entry->declaration.type;
3715 assert(is_type_array(top_type));
3716 assert(top_type->array.size > 0);
3719 path->top_type = top_type->array.element_type;
3720 len = top_type->array.size;
3722 if (initializer == NULL
3723 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3724 initializer = create_initializer_compound(len);
3725 /* we have to set the entry at the 2nd latest path entry... */
3726 size_t path_len = ARR_LEN(path->path);
3727 assert(path_len >= 1);
3729 type_path_entry_t *entry = & path->path[path_len-2];
3730 ir_initializer_t *tinitializer = entry->initializer;
3731 set_initializer_compound_value(tinitializer, entry->index,
3735 top->initializer = initializer;
3738 static void ascend_from_subtype(type_path_t *path)
3740 type_path_entry_t *top = get_type_path_top(path);
3742 path->top_type = top->type;
3744 size_t len = ARR_LEN(path->path);
3745 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3748 static void walk_designator(type_path_t *path, const designator_t *designator)
3750 /* designators start at current object type */
3751 ARR_RESIZE(type_path_entry_t, path->path, 1);
3753 for ( ; designator != NULL; designator = designator->next) {
3754 type_path_entry_t *top = get_type_path_top(path);
3755 type_t *orig_type = top->type;
3756 type_t *type = skip_typeref(orig_type);
3758 if (designator->symbol != NULL) {
3759 assert(is_type_compound(type));
3761 symbol_t *symbol = designator->symbol;
3763 compound_t *compound = type->compound.compound;
3764 entity_t *iter = compound->members.entities;
3765 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3766 if (iter->base.symbol == symbol) {
3767 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3771 assert(iter != NULL);
3773 /* revert previous initialisations of other union elements */
3774 if (type->kind == TYPE_COMPOUND_UNION) {
3775 ir_initializer_t *initializer = top->initializer;
3776 if (initializer != NULL
3777 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3778 /* are we writing to a new element? */
3779 ir_initializer_t *oldi
3780 = get_initializer_compound_value(initializer, index);
3781 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3782 /* clear initializer */
3784 = get_initializer_compound_n_entries(initializer);
3785 ir_initializer_t *nulli = get_initializer_null();
3786 for (size_t i = 0; i < len; ++i) {
3787 set_initializer_compound_value(initializer, i,
3794 top->type = orig_type;
3795 top->compound_entry = iter;
3797 orig_type = iter->declaration.type;
3799 expression_t *array_index = designator->array_index;
3800 assert(designator->array_index != NULL);
3801 assert(is_type_array(type));
3803 long index = fold_constant_to_int(array_index);
3806 if (type->array.size_constant) {
3807 long array_size = type->array.size;
3808 assert(index < array_size);
3812 top->type = orig_type;
3813 top->index = (size_t) index;
3814 orig_type = type->array.element_type;
3816 path->top_type = orig_type;
3818 if (designator->next != NULL) {
3819 descend_into_subtype(path);
3823 path->invalid = false;
3826 static void advance_current_object(type_path_t *path)
3828 if (path->invalid) {
3829 /* TODO: handle this... */
3830 panic("invalid initializer in ast2firm (excessive elements)");
3833 type_path_entry_t *top = get_type_path_top(path);
3835 type_t *type = skip_typeref(top->type);
3836 if (is_type_union(type)) {
3837 /* only the first element is initialized in unions */
3838 top->compound_entry = NULL;
3839 } else if (is_type_struct(type)) {
3840 entity_t *entry = top->compound_entry;
3843 entry = skip_unnamed_bitfields(entry->base.next);
3844 top->compound_entry = entry;
3845 if (entry != NULL) {
3846 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3847 path->top_type = entry->declaration.type;
3851 assert(is_type_array(type));
3854 if (!type->array.size_constant || top->index < type->array.size) {
3859 /* we're past the last member of the current sub-aggregate, try if we
3860 * can ascend in the type hierarchy and continue with another subobject */
3861 size_t len = ARR_LEN(path->path);
3864 ascend_from_subtype(path);
3865 advance_current_object(path);
3867 path->invalid = true;
3872 static ir_initializer_t *create_ir_initializer(
3873 const initializer_t *initializer, type_t *type);
3875 static ir_initializer_t *create_ir_initializer_value(
3876 const initializer_value_t *initializer)
3878 if (is_type_compound(initializer->value->base.type)) {
3879 panic("initializer creation for compounds not implemented yet");
3881 type_t *type = initializer->value->base.type;
3882 expression_t *expr = initializer->value;
3883 ir_node *value = expression_to_firm(expr);
3884 ir_mode *mode = get_ir_mode_storage(type);
3885 value = create_conv(NULL, value, mode);
3886 return create_initializer_const(value);
3889 /** test wether type can be initialized by a string constant */
3890 static bool is_string_type(type_t *type)
3893 if (is_type_pointer(type)) {
3894 inner = skip_typeref(type->pointer.points_to);
3895 } else if(is_type_array(type)) {
3896 inner = skip_typeref(type->array.element_type);
3901 return is_type_integer(inner);
3904 static ir_initializer_t *create_ir_initializer_list(
3905 const initializer_list_t *initializer, type_t *type)
3908 memset(&path, 0, sizeof(path));
3909 path.top_type = type;
3910 path.path = NEW_ARR_F(type_path_entry_t, 0);
3912 descend_into_subtype(&path);
3914 for (size_t i = 0; i < initializer->len; ++i) {
3915 const initializer_t *sub_initializer = initializer->initializers[i];
3917 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3918 walk_designator(&path, sub_initializer->designator.designator);
3922 if (sub_initializer->kind == INITIALIZER_VALUE) {
3923 /* we might have to descend into types until we're at a scalar
3926 type_t *orig_top_type = path.top_type;
3927 type_t *top_type = skip_typeref(orig_top_type);
3929 if (is_type_scalar(top_type))
3931 descend_into_subtype(&path);
3933 } else if (sub_initializer->kind == INITIALIZER_STRING
3934 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3935 /* we might have to descend into types until we're at a scalar
3938 type_t *orig_top_type = path.top_type;
3939 type_t *top_type = skip_typeref(orig_top_type);
3941 if (is_string_type(top_type))
3943 descend_into_subtype(&path);
3947 ir_initializer_t *sub_irinitializer
3948 = create_ir_initializer(sub_initializer, path.top_type);
3950 size_t path_len = ARR_LEN(path.path);
3951 assert(path_len >= 1);
3952 type_path_entry_t *entry = & path.path[path_len-1];
3953 ir_initializer_t *tinitializer = entry->initializer;
3954 set_initializer_compound_value(tinitializer, entry->index,
3957 advance_current_object(&path);
3960 assert(ARR_LEN(path.path) >= 1);
3961 ir_initializer_t *result = path.path[0].initializer;
3962 DEL_ARR_F(path.path);
3967 static ir_initializer_t *create_ir_initializer_string(
3968 const initializer_string_t *initializer, type_t *type)
3970 type = skip_typeref(type);
3972 size_t string_len = initializer->string.size;
3973 assert(type->kind == TYPE_ARRAY);
3974 assert(type->array.size_constant);
3975 size_t len = type->array.size;
3976 ir_initializer_t *irinitializer = create_initializer_compound(len);
3978 const char *string = initializer->string.begin;
3979 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
3981 for (size_t i = 0; i < len; ++i) {
3986 ir_tarval *tv = new_tarval_from_long(c, mode);
3987 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
3989 set_initializer_compound_value(irinitializer, i, char_initializer);
3992 return irinitializer;
3995 static ir_initializer_t *create_ir_initializer_wide_string(
3996 const initializer_wide_string_t *initializer, type_t *type)
3998 assert(type->kind == TYPE_ARRAY);
3999 assert(type->array.size_constant);
4000 size_t len = type->array.size;
4001 size_t string_len = wstrlen(&initializer->string);
4002 ir_initializer_t *irinitializer = create_initializer_compound(len);
4004 const char *p = initializer->string.begin;
4005 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4007 for (size_t i = 0; i < len; ++i) {
4009 if (i < string_len) {
4010 c = read_utf8_char(&p);
4012 ir_tarval *tv = new_tarval_from_long(c, mode);
4013 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4015 set_initializer_compound_value(irinitializer, i, char_initializer);
4018 return irinitializer;
4021 static ir_initializer_t *create_ir_initializer(
4022 const initializer_t *initializer, type_t *type)
4024 switch(initializer->kind) {
4025 case INITIALIZER_STRING:
4026 return create_ir_initializer_string(&initializer->string, type);
4028 case INITIALIZER_WIDE_STRING:
4029 return create_ir_initializer_wide_string(&initializer->wide_string,
4032 case INITIALIZER_LIST:
4033 return create_ir_initializer_list(&initializer->list, type);
4035 case INITIALIZER_VALUE:
4036 return create_ir_initializer_value(&initializer->value);
4038 case INITIALIZER_DESIGNATOR:
4039 panic("unexpected designator initializer found");
4041 panic("unknown initializer");
4044 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4045 * are elements [...] the remainder of the aggregate shall be initialized
4046 * implicitly the same as objects that have static storage duration. */
4047 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4050 /* for unions we must NOT do anything for null initializers */
4051 ir_type *owner = get_entity_owner(entity);
4052 if (is_Union_type(owner)) {
4056 ir_type *ent_type = get_entity_type(entity);
4057 /* create sub-initializers for a compound type */
4058 if (is_compound_type(ent_type)) {
4059 unsigned n_members = get_compound_n_members(ent_type);
4060 for (unsigned n = 0; n < n_members; ++n) {
4061 ir_entity *member = get_compound_member(ent_type, n);
4062 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4064 create_dynamic_null_initializer(member, dbgi, addr);
4068 if (is_Array_type(ent_type)) {
4069 assert(has_array_upper_bound(ent_type, 0));
4070 long n = get_array_upper_bound_int(ent_type, 0);
4071 for (long i = 0; i < n; ++i) {
4072 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4073 ir_node *cnst = new_d_Const(dbgi, index_tv);
4074 ir_node *in[1] = { cnst };
4075 ir_entity *arrent = get_array_element_entity(ent_type);
4076 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4078 create_dynamic_null_initializer(arrent, dbgi, addr);
4083 ir_mode *value_mode = get_type_mode(ent_type);
4084 ir_node *node = new_Const(get_mode_null(value_mode));
4086 /* is it a bitfield type? */
4087 if (is_Primitive_type(ent_type) &&
4088 get_primitive_base_type(ent_type) != NULL) {
4089 bitfield_store_to_firm(dbgi, entity, base_addr, node, false);
4093 ir_node *mem = get_store();
4094 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4095 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4099 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4100 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4102 switch(get_initializer_kind(initializer)) {
4103 case IR_INITIALIZER_NULL:
4104 create_dynamic_null_initializer(entity, dbgi, base_addr);
4106 case IR_INITIALIZER_CONST: {
4107 ir_node *node = get_initializer_const_value(initializer);
4108 ir_type *ent_type = get_entity_type(entity);
4110 /* is it a bitfield type? */
4111 if (is_Primitive_type(ent_type) &&
4112 get_primitive_base_type(ent_type) != NULL) {
4113 bitfield_store_to_firm(dbgi, entity, base_addr, node, false);
4117 assert(get_type_mode(type) == get_irn_mode(node));
4118 ir_node *mem = get_store();
4119 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4120 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4124 case IR_INITIALIZER_TARVAL: {
4125 ir_tarval *tv = get_initializer_tarval_value(initializer);
4126 ir_node *cnst = new_d_Const(dbgi, tv);
4127 ir_type *ent_type = get_entity_type(entity);
4129 /* is it a bitfield type? */
4130 if (is_Primitive_type(ent_type) &&
4131 get_primitive_base_type(ent_type) != NULL) {
4132 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false);
4136 assert(get_type_mode(type) == get_tarval_mode(tv));
4137 ir_node *mem = get_store();
4138 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4139 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4143 case IR_INITIALIZER_COMPOUND: {
4144 assert(is_compound_type(type) || is_Array_type(type));
4146 if (is_Array_type(type)) {
4147 assert(has_array_upper_bound(type, 0));
4148 n_members = get_array_upper_bound_int(type, 0);
4150 n_members = get_compound_n_members(type);
4153 if (get_initializer_compound_n_entries(initializer)
4154 != (unsigned) n_members)
4155 panic("initializer doesn't match compound type");
4157 for (int i = 0; i < n_members; ++i) {
4160 ir_entity *sub_entity;
4161 if (is_Array_type(type)) {
4162 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4163 ir_node *cnst = new_d_Const(dbgi, index_tv);
4164 ir_node *in[1] = { cnst };
4165 irtype = get_array_element_type(type);
4166 sub_entity = get_array_element_entity(type);
4167 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4170 sub_entity = get_compound_member(type, i);
4171 irtype = get_entity_type(sub_entity);
4172 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4176 ir_initializer_t *sub_init
4177 = get_initializer_compound_value(initializer, i);
4179 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4186 panic("invalid IR_INITIALIZER found");
4189 static void create_dynamic_initializer(ir_initializer_t *initializer,
4190 dbg_info *dbgi, ir_entity *entity)
4192 ir_node *frame = get_irg_frame(current_ir_graph);
4193 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4194 ir_type *type = get_entity_type(entity);
4196 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4199 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4200 ir_entity *entity, type_t *type)
4202 ir_node *memory = get_store();
4203 ir_node *nomem = new_NoMem();
4204 ir_node *frame = get_irg_frame(current_ir_graph);
4205 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4207 if (initializer->kind == INITIALIZER_VALUE) {
4208 initializer_value_t *initializer_value = &initializer->value;
4210 ir_node *value = expression_to_firm(initializer_value->value);
4211 type = skip_typeref(type);
4212 assign_value(dbgi, addr, type, value);
4216 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4217 ir_initializer_t *irinitializer
4218 = create_ir_initializer(initializer, type);
4220 create_dynamic_initializer(irinitializer, dbgi, entity);
4224 /* create the ir_initializer */
4225 ir_graph *const old_current_ir_graph = current_ir_graph;
4226 current_ir_graph = get_const_code_irg();
4228 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
4230 assert(current_ir_graph == get_const_code_irg());
4231 current_ir_graph = old_current_ir_graph;
4233 /* create a "template" entity which is copied to the entity on the stack */
4234 ident *const id = id_unique("initializer.%u");
4235 ir_type *const irtype = get_ir_type(type);
4236 ir_type *const global_type = get_glob_type();
4237 ir_entity *const init_entity = new_d_entity(global_type, id, irtype, dbgi);
4238 set_entity_ld_ident(init_entity, id);
4240 set_entity_visibility(init_entity, ir_visibility_private);
4241 add_entity_linkage(init_entity, IR_LINKAGE_CONSTANT);
4243 set_entity_initializer(init_entity, irinitializer);
4245 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4246 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4248 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4249 set_store(copyb_mem);
4252 static void create_initializer_local_variable_entity(entity_t *entity)
4254 assert(entity->kind == ENTITY_VARIABLE);
4255 initializer_t *initializer = entity->variable.initializer;
4256 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4257 ir_entity *irentity = entity->variable.v.entity;
4258 type_t *type = entity->declaration.type;
4260 create_local_initializer(initializer, dbgi, irentity, type);
4263 static void create_variable_initializer(entity_t *entity)
4265 assert(entity->kind == ENTITY_VARIABLE);
4266 initializer_t *initializer = entity->variable.initializer;
4267 if (initializer == NULL)
4270 declaration_kind_t declaration_kind
4271 = (declaration_kind_t) entity->declaration.kind;
4272 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4273 create_initializer_local_variable_entity(entity);
4277 type_t *type = entity->declaration.type;
4278 type_qualifiers_t tq = get_type_qualifier(type, true);
4280 if (initializer->kind == INITIALIZER_VALUE) {
4281 initializer_value_t *initializer_value = &initializer->value;
4282 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4284 ir_node *value = expression_to_firm(initializer_value->value);
4286 type_t *init_type = initializer_value->value->base.type;
4287 ir_mode *mode = get_ir_mode_storage(init_type);
4288 value = create_conv(dbgi, value, mode);
4289 value = do_strict_conv(dbgi, value);
4291 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4292 set_value(entity->variable.v.value_number, value);
4294 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4296 ir_entity *irentity = entity->variable.v.entity;
4298 if (tq & TYPE_QUALIFIER_CONST
4299 && get_entity_owner(irentity) != get_tls_type()) {
4300 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4302 set_atomic_ent_value(irentity, value);
4305 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4306 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4308 ir_entity *irentity = entity->variable.v.entity;
4309 ir_initializer_t *irinitializer
4310 = create_ir_initializer(initializer, type);
4312 if (tq & TYPE_QUALIFIER_CONST) {
4313 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4315 set_entity_initializer(irentity, irinitializer);
4319 static void create_variable_length_array(entity_t *entity)
4321 assert(entity->kind == ENTITY_VARIABLE);
4322 assert(entity->variable.initializer == NULL);
4324 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4325 entity->variable.v.vla_base = NULL;
4327 /* TODO: record VLA somewhere so we create the free node when we leave
4331 static void allocate_variable_length_array(entity_t *entity)
4333 assert(entity->kind == ENTITY_VARIABLE);
4334 assert(entity->variable.initializer == NULL);
4335 assert(currently_reachable());
4337 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4338 type_t *type = entity->declaration.type;
4339 ir_type *el_type = get_ir_type(type->array.element_type);
4341 /* make sure size_node is calculated */
4342 get_type_size_node(type);
4343 ir_node *elems = type->array.size_node;
4344 ir_node *mem = get_store();
4345 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4347 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4348 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4351 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4352 entity->variable.v.vla_base = addr;
4356 * Creates a Firm local variable from a declaration.
4358 static void create_local_variable(entity_t *entity)
4360 assert(entity->kind == ENTITY_VARIABLE);
4361 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4363 bool needs_entity = entity->variable.address_taken;
4364 type_t *type = skip_typeref(entity->declaration.type);
4366 /* is it a variable length array? */
4367 if (is_type_array(type) && !type->array.size_constant) {
4368 create_variable_length_array(entity);
4370 } else if (is_type_array(type) || is_type_compound(type)) {
4371 needs_entity = true;
4372 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4373 needs_entity = true;
4377 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4378 create_variable_entity(entity,
4379 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4382 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4383 entity->variable.v.value_number = next_value_number_function;
4384 set_irg_loc_description(current_ir_graph, next_value_number_function,
4386 ++next_value_number_function;
4390 static void create_local_static_variable(entity_t *entity)
4392 assert(entity->kind == ENTITY_VARIABLE);
4393 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4395 type_t *type = skip_typeref(entity->declaration.type);
4396 ir_type *const var_type = entity->variable.thread_local ?
4397 get_tls_type() : get_glob_type();
4398 ir_type *const irtype = get_ir_type(type);
4399 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4401 size_t l = strlen(entity->base.symbol->string);
4402 char buf[l + sizeof(".%u")];
4403 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4404 ident *const id = id_unique(buf);
4405 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4407 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4408 set_entity_volatility(irentity, volatility_is_volatile);
4411 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4412 entity->variable.v.entity = irentity;
4414 set_entity_ld_ident(irentity, id);
4415 set_entity_visibility(irentity, ir_visibility_local);
4417 ir_graph *const old_current_ir_graph = current_ir_graph;
4418 current_ir_graph = get_const_code_irg();
4420 create_variable_initializer(entity);
4422 assert(current_ir_graph == get_const_code_irg());
4423 current_ir_graph = old_current_ir_graph;
4428 static void return_statement_to_firm(return_statement_t *statement)
4430 if (!currently_reachable())
4433 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4434 type_t *type = current_function_entity->declaration.type;
4435 ir_type *func_irtype = get_ir_type(type);
4439 if (get_method_n_ress(func_irtype) > 0) {
4440 ir_type *res_type = get_method_res_type(func_irtype, 0);
4442 if (statement->value != NULL) {
4443 ir_node *node = expression_to_firm(statement->value);
4444 if (!is_compound_type(res_type)) {
4445 type_t *ret_value_type = statement->value->base.type;
4446 ir_mode *mode = get_ir_mode_storage(ret_value_type);
4447 node = create_conv(dbgi, node, mode);
4448 node = do_strict_conv(dbgi, node);
4453 if (is_compound_type(res_type)) {
4456 mode = get_type_mode(res_type);
4458 in[0] = new_Unknown(mode);
4462 /* build return_value for its side effects */
4463 if (statement->value != NULL) {
4464 expression_to_firm(statement->value);
4469 ir_node *store = get_store();
4470 ir_node *ret = new_d_Return(dbgi, store, in_len, in);
4472 ir_node *end_block = get_irg_end_block(current_ir_graph);
4473 add_immBlock_pred(end_block, ret);
4475 set_unreachable_now();
4478 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4480 if (!currently_reachable())
4483 return expression_to_firm(statement->expression);
4486 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4488 entity_t *entity = compound->scope.entities;
4489 for ( ; entity != NULL; entity = entity->base.next) {
4490 if (!is_declaration(entity))
4493 create_local_declaration(entity);
4496 ir_node *result = NULL;
4497 statement_t *statement = compound->statements;
4498 for ( ; statement != NULL; statement = statement->base.next) {
4499 if (statement->base.next == NULL
4500 && statement->kind == STATEMENT_EXPRESSION) {
4501 result = expression_statement_to_firm(
4502 &statement->expression);
4505 statement_to_firm(statement);
4511 static void create_global_variable(entity_t *entity)
4513 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4514 ir_visibility visibility = ir_visibility_default;
4515 ir_entity *irentity;
4516 assert(entity->kind == ENTITY_VARIABLE);
4518 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4519 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4520 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4521 case STORAGE_CLASS_NONE:
4522 visibility = ir_visibility_default;
4523 /* uninitialized globals get merged in C */
4524 if (entity->variable.initializer == NULL)
4525 linkage |= IR_LINKAGE_MERGE;
4527 case STORAGE_CLASS_TYPEDEF:
4528 case STORAGE_CLASS_AUTO:
4529 case STORAGE_CLASS_REGISTER:
4530 panic("invalid storage class for global var");
4533 ir_type *var_type = get_glob_type();
4534 if (entity->variable.thread_local) {
4535 var_type = get_tls_type();
4536 /* LINKAGE_MERGE not supported by current linkers */
4537 linkage &= ~IR_LINKAGE_MERGE;
4539 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4540 irentity = entity->variable.v.entity;
4541 add_entity_linkage(irentity, linkage);
4542 set_entity_visibility(irentity, visibility);
4545 static void create_local_declaration(entity_t *entity)
4547 assert(is_declaration(entity));
4549 /* construct type */
4550 (void) get_ir_type(entity->declaration.type);
4551 if (entity->base.symbol == NULL) {
4555 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4556 case STORAGE_CLASS_STATIC:
4557 if (entity->kind == ENTITY_FUNCTION) {
4558 (void)get_function_entity(entity, NULL);
4560 create_local_static_variable(entity);
4563 case STORAGE_CLASS_EXTERN:
4564 if (entity->kind == ENTITY_FUNCTION) {
4565 assert(entity->function.statement == NULL);
4566 (void)get_function_entity(entity, NULL);
4568 create_global_variable(entity);
4569 create_variable_initializer(entity);
4572 case STORAGE_CLASS_NONE:
4573 case STORAGE_CLASS_AUTO:
4574 case STORAGE_CLASS_REGISTER:
4575 if (entity->kind == ENTITY_FUNCTION) {
4576 if (entity->function.statement != NULL) {
4577 ir_type *owner = get_irg_frame_type(current_ir_graph);
4578 (void)get_function_entity(entity, owner);
4579 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4580 enqueue_inner_function(entity);
4582 (void)get_function_entity(entity, NULL);
4585 create_local_variable(entity);
4588 case STORAGE_CLASS_TYPEDEF:
4591 panic("invalid storage class found");
4594 static void initialize_local_declaration(entity_t *entity)
4596 if (entity->base.symbol == NULL)
4599 // no need to emit code in dead blocks
4600 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4601 && !currently_reachable())
4604 switch ((declaration_kind_t) entity->declaration.kind) {
4605 case DECLARATION_KIND_LOCAL_VARIABLE:
4606 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4607 create_variable_initializer(entity);
4610 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4611 allocate_variable_length_array(entity);
4614 case DECLARATION_KIND_COMPOUND_MEMBER:
4615 case DECLARATION_KIND_GLOBAL_VARIABLE:
4616 case DECLARATION_KIND_FUNCTION:
4617 case DECLARATION_KIND_INNER_FUNCTION:
4620 case DECLARATION_KIND_PARAMETER:
4621 case DECLARATION_KIND_PARAMETER_ENTITY:
4622 panic("can't initialize parameters");
4624 case DECLARATION_KIND_UNKNOWN:
4625 panic("can't initialize unknown declaration");
4627 panic("invalid declaration kind");
4630 static void declaration_statement_to_firm(declaration_statement_t *statement)
4632 entity_t *entity = statement->declarations_begin;
4636 entity_t *const last = statement->declarations_end;
4637 for ( ;; entity = entity->base.next) {
4638 if (is_declaration(entity)) {
4639 initialize_local_declaration(entity);
4640 } else if (entity->kind == ENTITY_TYPEDEF) {
4641 /* ยง6.7.7:3 Any array size expressions associated with variable length
4642 * array declarators are evaluated each time the declaration of the
4643 * typedef name is reached in the order of execution. */
4644 type_t *const type = skip_typeref(entity->typedefe.type);
4645 if (is_type_array(type) && type->array.is_vla)
4646 get_vla_size(&type->array);
4653 static void if_statement_to_firm(if_statement_t *statement)
4655 /* Create the condition. */
4656 ir_node *true_block = NULL;
4657 ir_node *false_block = NULL;
4658 if (currently_reachable()) {
4659 true_block = new_immBlock();
4660 false_block = new_immBlock();
4661 create_condition_evaluation(statement->condition, true_block, false_block);
4662 mature_immBlock(true_block);
4665 /* Create the false statement.
4666 * Handle false before true, so if no false statement is present, then the
4667 * empty false block is reused as fallthrough block. */
4668 ir_node *fallthrough_block = NULL;
4669 if (statement->false_statement != NULL) {
4670 if (false_block != NULL) {
4671 mature_immBlock(false_block);
4673 set_cur_block(false_block);
4674 statement_to_firm(statement->false_statement);
4675 if (currently_reachable()) {
4676 fallthrough_block = new_immBlock();
4677 add_immBlock_pred(fallthrough_block, new_Jmp());
4680 fallthrough_block = false_block;
4683 /* Create the true statement. */
4684 set_cur_block(true_block);
4685 statement_to_firm(statement->true_statement);
4686 if (currently_reachable()) {
4687 if (fallthrough_block == NULL) {
4688 fallthrough_block = new_immBlock();
4690 add_immBlock_pred(fallthrough_block, new_Jmp());
4693 /* Handle the block after the if-statement. */
4694 if (fallthrough_block != NULL) {
4695 mature_immBlock(fallthrough_block);
4697 set_cur_block(fallthrough_block);
4700 /* Create a jump node which jumps into target_block, if the current block is
4702 static void jump_if_reachable(ir_node *const target_block)
4704 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4705 add_immBlock_pred(target_block, pred);
4708 static void while_statement_to_firm(while_statement_t *statement)
4710 /* Create the header block */
4711 ir_node *const header_block = new_immBlock();
4712 jump_if_reachable(header_block);
4714 /* Create the condition. */
4715 ir_node * body_block;
4716 ir_node * false_block;
4717 expression_t *const cond = statement->condition;
4718 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4719 fold_constant_to_bool(cond)) {
4720 /* Shortcut for while (true). */
4721 body_block = header_block;
4724 keep_alive(header_block);
4725 keep_all_memory(header_block);
4727 body_block = new_immBlock();
4728 false_block = new_immBlock();
4730 set_cur_block(header_block);
4731 create_condition_evaluation(cond, body_block, false_block);
4732 mature_immBlock(body_block);
4735 ir_node *const old_continue_label = continue_label;
4736 ir_node *const old_break_label = break_label;
4737 continue_label = header_block;
4738 break_label = false_block;
4740 /* Create the loop body. */
4741 set_cur_block(body_block);
4742 statement_to_firm(statement->body);
4743 jump_if_reachable(header_block);
4745 mature_immBlock(header_block);
4746 assert(false_block == NULL || false_block == break_label);
4747 false_block = break_label;
4748 if (false_block != NULL) {
4749 mature_immBlock(false_block);
4751 set_cur_block(false_block);
4753 assert(continue_label == header_block);
4754 continue_label = old_continue_label;
4755 break_label = old_break_label;
4758 static ir_node *get_break_label(void)
4760 if (break_label == NULL) {
4761 break_label = new_immBlock();
4766 static void do_while_statement_to_firm(do_while_statement_t *statement)
4768 /* create the header block */
4769 ir_node *header_block = new_immBlock();
4772 ir_node *body_block = new_immBlock();
4773 jump_if_reachable(body_block);
4775 ir_node *old_continue_label = continue_label;
4776 ir_node *old_break_label = break_label;
4777 continue_label = header_block;
4780 set_cur_block(body_block);
4781 statement_to_firm(statement->body);
4782 ir_node *const false_block = get_break_label();
4784 assert(continue_label == header_block);
4785 continue_label = old_continue_label;
4786 break_label = old_break_label;
4788 jump_if_reachable(header_block);
4790 /* create the condition */
4791 mature_immBlock(header_block);
4792 set_cur_block(header_block);
4794 create_condition_evaluation(statement->condition, body_block, false_block);
4795 mature_immBlock(body_block);
4796 mature_immBlock(false_block);
4798 set_cur_block(false_block);
4801 static void for_statement_to_firm(for_statement_t *statement)
4803 /* create declarations */
4804 entity_t *entity = statement->scope.entities;
4805 for ( ; entity != NULL; entity = entity->base.next) {
4806 if (!is_declaration(entity))
4809 create_local_declaration(entity);
4812 if (currently_reachable()) {
4813 entity = statement->scope.entities;
4814 for ( ; entity != NULL; entity = entity->base.next) {
4815 if (!is_declaration(entity))
4818 initialize_local_declaration(entity);
4821 if (statement->initialisation != NULL) {
4822 expression_to_firm(statement->initialisation);
4826 /* Create the header block */
4827 ir_node *const header_block = new_immBlock();
4828 jump_if_reachable(header_block);
4830 /* Create the condition. */
4831 ir_node *body_block;
4832 ir_node *false_block;
4833 if (statement->condition != NULL) {
4834 body_block = new_immBlock();
4835 false_block = new_immBlock();
4837 set_cur_block(header_block);
4838 create_condition_evaluation(statement->condition, body_block, false_block);
4839 mature_immBlock(body_block);
4842 body_block = header_block;
4845 keep_alive(header_block);
4846 keep_all_memory(header_block);
4849 /* Create the step block, if necessary. */
4850 ir_node * step_block = header_block;
4851 expression_t *const step = statement->step;
4853 step_block = new_immBlock();
4856 ir_node *const old_continue_label = continue_label;
4857 ir_node *const old_break_label = break_label;
4858 continue_label = step_block;
4859 break_label = false_block;
4861 /* Create the loop body. */
4862 set_cur_block(body_block);
4863 statement_to_firm(statement->body);
4864 jump_if_reachable(step_block);
4866 /* Create the step code. */
4868 mature_immBlock(step_block);
4869 set_cur_block(step_block);
4870 expression_to_firm(step);
4871 jump_if_reachable(header_block);
4874 mature_immBlock(header_block);
4875 assert(false_block == NULL || false_block == break_label);
4876 false_block = break_label;
4877 if (false_block != NULL) {
4878 mature_immBlock(false_block);
4880 set_cur_block(false_block);
4882 assert(continue_label == step_block);
4883 continue_label = old_continue_label;
4884 break_label = old_break_label;
4887 static void create_jump_statement(const statement_t *statement,
4888 ir_node *target_block)
4890 if (!currently_reachable())
4893 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4894 ir_node *jump = new_d_Jmp(dbgi);
4895 add_immBlock_pred(target_block, jump);
4897 set_unreachable_now();
4900 static void switch_statement_to_firm(switch_statement_t *statement)
4902 ir_node *first_block = NULL;
4903 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4904 ir_node *cond = NULL;
4906 if (currently_reachable()) {
4907 ir_node *expression = expression_to_firm(statement->expression);
4908 cond = new_d_Cond(dbgi, expression);
4909 first_block = get_cur_block();
4912 set_unreachable_now();
4914 ir_node *const old_switch_cond = current_switch_cond;
4915 ir_node *const old_break_label = break_label;
4916 const bool old_saw_default_label = saw_default_label;
4917 saw_default_label = false;
4918 current_switch_cond = cond;
4920 switch_statement_t *const old_switch = current_switch;
4921 current_switch = statement;
4923 /* determine a free number for the default label */
4924 unsigned long num_cases = 0;
4925 long default_proj_nr = 0;
4926 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
4927 if (l->expression == NULL) {
4931 if (l->last_case >= l->first_case)
4932 num_cases += l->last_case - l->first_case + 1;
4933 if (l->last_case > default_proj_nr)
4934 default_proj_nr = l->last_case;
4937 if (default_proj_nr == LONG_MAX) {
4938 /* Bad: an overflow will occur, we cannot be sure that the
4939 * maximum + 1 is a free number. Scan the values a second
4940 * time to find a free number.
4942 unsigned char *bits = xmalloc((num_cases + 7) >> 3);
4944 memset(bits, 0, (num_cases + 7) >> 3);
4945 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
4946 if (l->expression == NULL) {
4950 unsigned long start = l->first_case > 0 ? (unsigned long)l->first_case : 0;
4951 if (start < num_cases && l->last_case >= 0) {
4952 unsigned long end = (unsigned long)l->last_case < num_cases ?
4953 (unsigned long)l->last_case : num_cases - 1;
4954 for (unsigned long cns = start; cns <= end; ++cns) {
4955 bits[cns >> 3] |= (1 << (cns & 7));
4959 /* We look at the first num_cases constants:
4960 * Either they are dense, so we took the last (num_cases)
4961 * one, or they are not dense, so we will find one free
4965 for (i = 0; i < num_cases; ++i)
4966 if ((bits[i >> 3] & (1 << (i & 7))) == 0)
4970 default_proj_nr = i;
4974 statement->default_proj_nr = default_proj_nr;
4975 /* safety check: cond might already be folded to a Bad */
4976 if (cond != NULL && is_Cond(cond)) {
4977 set_Cond_default_proj(cond, default_proj_nr);
4980 statement_to_firm(statement->body);
4982 jump_if_reachable(get_break_label());
4984 if (!saw_default_label && first_block != NULL) {
4985 set_cur_block(first_block);
4986 ir_node *const proj = new_d_Proj(dbgi, cond, mode_X, default_proj_nr);
4987 add_immBlock_pred(get_break_label(), proj);
4990 if (break_label != NULL) {
4991 mature_immBlock(break_label);
4993 set_cur_block(break_label);
4995 assert(current_switch_cond == cond);
4996 current_switch = old_switch;
4997 current_switch_cond = old_switch_cond;
4998 break_label = old_break_label;
4999 saw_default_label = old_saw_default_label;
5002 static void case_label_to_firm(const case_label_statement_t *statement)
5004 if (statement->is_empty_range)
5007 ir_node *block = new_immBlock();
5008 /* Fallthrough from previous case */
5009 jump_if_reachable(block);
5011 if (current_switch_cond != NULL) {
5012 set_cur_block(get_nodes_block(current_switch_cond));
5013 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5014 if (statement->expression != NULL) {
5015 long pn = statement->first_case;
5016 long end_pn = statement->last_case;
5017 assert(pn <= end_pn);
5018 /* create jumps for all cases in the given range */
5020 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X, pn);
5021 add_immBlock_pred(block, proj);
5022 } while (pn++ < end_pn);
5024 saw_default_label = true;
5025 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X,
5026 current_switch->default_proj_nr);
5027 add_immBlock_pred(block, proj);
5031 mature_immBlock(block);
5032 set_cur_block(block);
5034 statement_to_firm(statement->statement);
5037 static void label_to_firm(const label_statement_t *statement)
5039 ir_node *block = get_label_block(statement->label);
5040 jump_if_reachable(block);
5042 set_cur_block(block);
5044 keep_all_memory(block);
5046 statement_to_firm(statement->statement);
5049 static void goto_to_firm(const goto_statement_t *statement)
5051 if (!currently_reachable())
5054 if (statement->expression) {
5055 ir_node *irn = expression_to_firm(statement->expression);
5056 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5057 ir_node *ijmp = new_d_IJmp(dbgi, irn);
5059 set_irn_link(ijmp, ijmp_list);
5062 ir_node *block = get_label_block(statement->label);
5063 ir_node *jmp = new_Jmp();
5064 add_immBlock_pred(block, jmp);
5066 set_unreachable_now();
5069 static void asm_statement_to_firm(const asm_statement_t *statement)
5071 bool needs_memory = false;
5073 if (statement->is_volatile) {
5074 needs_memory = true;
5077 size_t n_clobbers = 0;
5078 asm_clobber_t *clobber = statement->clobbers;
5079 for ( ; clobber != NULL; clobber = clobber->next) {
5080 const char *clobber_str = clobber->clobber.begin;
5082 if (!be_is_valid_clobber(clobber_str)) {
5083 errorf(&statement->base.source_position,
5084 "invalid clobber '%s' specified", clobber->clobber);
5088 if (strcmp(clobber_str, "memory") == 0) {
5089 needs_memory = true;
5093 ident *id = new_id_from_str(clobber_str);
5094 obstack_ptr_grow(&asm_obst, id);
5097 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5098 ident **clobbers = NULL;
5099 if (n_clobbers > 0) {
5100 clobbers = obstack_finish(&asm_obst);
5103 size_t n_inputs = 0;
5104 asm_argument_t *argument = statement->inputs;
5105 for ( ; argument != NULL; argument = argument->next)
5107 size_t n_outputs = 0;
5108 argument = statement->outputs;
5109 for ( ; argument != NULL; argument = argument->next)
5112 unsigned next_pos = 0;
5114 ir_node *ins[n_inputs + n_outputs + 1];
5117 ir_asm_constraint tmp_in_constraints[n_outputs];
5119 const expression_t *out_exprs[n_outputs];
5120 ir_node *out_addrs[n_outputs];
5121 size_t out_size = 0;
5123 argument = statement->outputs;
5124 for ( ; argument != NULL; argument = argument->next) {
5125 const char *constraints = argument->constraints.begin;
5126 asm_constraint_flags_t asm_flags
5127 = be_parse_asm_constraints(constraints);
5130 source_position_t const *const pos = &statement->base.source_position;
5131 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5132 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5134 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5135 errorf(pos, "some constraints in '%s' are invalid", constraints);
5138 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5139 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5144 unsigned pos = next_pos++;
5145 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5146 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5147 expression_t *expr = argument->expression;
5148 ir_node *addr = expression_to_addr(expr);
5149 /* in+output, construct an artifical same_as constraint on the
5151 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5153 ir_node *value = get_value_from_lvalue(expr, addr);
5155 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5157 ir_asm_constraint constraint;
5158 constraint.pos = pos;
5159 constraint.constraint = new_id_from_str(buf);
5160 constraint.mode = get_ir_mode_storage(expr->base.type);
5161 tmp_in_constraints[in_size] = constraint;
5162 ins[in_size] = value;
5167 out_exprs[out_size] = expr;
5168 out_addrs[out_size] = addr;
5170 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5171 /* pure memory ops need no input (but we have to make sure we
5172 * attach to the memory) */
5173 assert(! (asm_flags &
5174 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5175 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5176 needs_memory = true;
5178 /* we need to attach the address to the inputs */
5179 expression_t *expr = argument->expression;
5181 ir_asm_constraint constraint;
5182 constraint.pos = pos;
5183 constraint.constraint = new_id_from_str(constraints);
5184 constraint.mode = NULL;
5185 tmp_in_constraints[in_size] = constraint;
5187 ins[in_size] = expression_to_addr(expr);
5191 errorf(&statement->base.source_position,
5192 "only modifiers but no place set in constraints '%s'",
5197 ir_asm_constraint constraint;
5198 constraint.pos = pos;
5199 constraint.constraint = new_id_from_str(constraints);
5200 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5202 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5204 assert(obstack_object_size(&asm_obst)
5205 == out_size * sizeof(ir_asm_constraint));
5206 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5209 obstack_grow(&asm_obst, tmp_in_constraints,
5210 in_size * sizeof(tmp_in_constraints[0]));
5211 /* find and count input and output arguments */
5212 argument = statement->inputs;
5213 for ( ; argument != NULL; argument = argument->next) {
5214 const char *constraints = argument->constraints.begin;
5215 asm_constraint_flags_t asm_flags
5216 = be_parse_asm_constraints(constraints);
5218 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5219 errorf(&statement->base.source_position,
5220 "some constraints in '%s' are not supported", constraints);
5223 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5224 errorf(&statement->base.source_position,
5225 "some constraints in '%s' are invalid", constraints);
5228 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5229 errorf(&statement->base.source_position,
5230 "write flag specified for input constraints '%s'",
5236 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5237 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5238 /* we can treat this as "normal" input */
5239 input = expression_to_firm(argument->expression);
5240 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5241 /* pure memory ops need no input (but we have to make sure we
5242 * attach to the memory) */
5243 assert(! (asm_flags &
5244 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5245 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5246 needs_memory = true;
5247 input = expression_to_addr(argument->expression);
5249 errorf(&statement->base.source_position,
5250 "only modifiers but no place set in constraints '%s'",
5255 ir_asm_constraint constraint;
5256 constraint.pos = next_pos++;
5257 constraint.constraint = new_id_from_str(constraints);
5258 constraint.mode = get_irn_mode(input);
5260 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5261 ins[in_size++] = input;
5265 ir_asm_constraint constraint;
5266 constraint.pos = next_pos++;
5267 constraint.constraint = new_id_from_str("");
5268 constraint.mode = mode_M;
5270 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5271 ins[in_size++] = get_store();
5274 assert(obstack_object_size(&asm_obst)
5275 == in_size * sizeof(ir_asm_constraint));
5276 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5278 /* create asm node */
5279 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5281 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5283 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5284 out_size, output_constraints,
5285 n_clobbers, clobbers, asm_text);
5287 if (statement->is_volatile) {
5288 set_irn_pinned(node, op_pin_state_pinned);
5290 set_irn_pinned(node, op_pin_state_floats);
5293 /* create output projs & connect them */
5295 ir_node *projm = new_Proj(node, mode_M, out_size);
5300 for (i = 0; i < out_size; ++i) {
5301 const expression_t *out_expr = out_exprs[i];
5303 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5304 ir_node *proj = new_Proj(node, mode, pn);
5305 ir_node *addr = out_addrs[i];
5307 set_value_for_expression_addr(out_expr, proj, addr);
5311 static void ms_try_statement_to_firm(ms_try_statement_t *statement)
5313 statement_to_firm(statement->try_statement);
5314 source_position_t const *const pos = &statement->base.source_position;
5315 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5318 static void leave_statement_to_firm(leave_statement_t *statement)
5320 errorf(&statement->base.source_position, "__leave not supported yet");
5324 * Transform a statement.
5326 static void statement_to_firm(statement_t *statement)
5329 assert(!statement->base.transformed);
5330 statement->base.transformed = true;
5333 switch (statement->kind) {
5334 case STATEMENT_ERROR:
5335 panic("error statement found");
5336 case STATEMENT_EMPTY:
5339 case STATEMENT_COMPOUND:
5340 compound_statement_to_firm(&statement->compound);
5342 case STATEMENT_RETURN:
5343 return_statement_to_firm(&statement->returns);
5345 case STATEMENT_EXPRESSION:
5346 expression_statement_to_firm(&statement->expression);
5349 if_statement_to_firm(&statement->ifs);
5351 case STATEMENT_WHILE:
5352 while_statement_to_firm(&statement->whiles);
5354 case STATEMENT_DO_WHILE:
5355 do_while_statement_to_firm(&statement->do_while);
5357 case STATEMENT_DECLARATION:
5358 declaration_statement_to_firm(&statement->declaration);
5360 case STATEMENT_BREAK:
5361 create_jump_statement(statement, get_break_label());
5363 case STATEMENT_CONTINUE:
5364 create_jump_statement(statement, continue_label);
5366 case STATEMENT_SWITCH:
5367 switch_statement_to_firm(&statement->switchs);
5369 case STATEMENT_CASE_LABEL:
5370 case_label_to_firm(&statement->case_label);
5373 for_statement_to_firm(&statement->fors);
5375 case STATEMENT_LABEL:
5376 label_to_firm(&statement->label);
5378 case STATEMENT_GOTO:
5379 goto_to_firm(&statement->gotos);
5382 asm_statement_to_firm(&statement->asms);
5384 case STATEMENT_MS_TRY:
5385 ms_try_statement_to_firm(&statement->ms_try);
5387 case STATEMENT_LEAVE:
5388 leave_statement_to_firm(&statement->leave);
5391 panic("statement not implemented");
5394 static int count_local_variables(const entity_t *entity,
5395 const entity_t *const last)
5398 entity_t const *const end = last != NULL ? last->base.next : NULL;
5399 for (; entity != end; entity = entity->base.next) {
5403 if (entity->kind == ENTITY_VARIABLE) {
5404 type = skip_typeref(entity->declaration.type);
5405 address_taken = entity->variable.address_taken;
5406 } else if (entity->kind == ENTITY_PARAMETER) {
5407 type = skip_typeref(entity->declaration.type);
5408 address_taken = entity->parameter.address_taken;
5413 if (!address_taken && is_type_scalar(type))
5419 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5421 int *const count = env;
5423 switch (stmt->kind) {
5424 case STATEMENT_DECLARATION: {
5425 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5426 *count += count_local_variables(decl_stmt->declarations_begin,
5427 decl_stmt->declarations_end);
5432 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5441 * Return the number of local (alias free) variables used by a function.
5443 static int get_function_n_local_vars(entity_t *entity)
5445 const function_t *function = &entity->function;
5448 /* count parameters */
5449 count += count_local_variables(function->parameters.entities, NULL);
5451 /* count local variables declared in body */
5452 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5457 * Build Firm code for the parameters of a function.
5459 static void initialize_function_parameters(entity_t *entity)
5461 assert(entity->kind == ENTITY_FUNCTION);
5462 ir_graph *irg = current_ir_graph;
5463 ir_node *args = get_irg_args(irg);
5465 ir_type *function_irtype;
5467 if (entity->function.need_closure) {
5468 /* add an extra parameter for the static link */
5469 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5472 /* Matze: IMO this is wrong, nested functions should have an own
5473 * type and not rely on strange parameters... */
5474 function_irtype = create_method_type(&entity->declaration.type->function, true);
5476 function_irtype = get_ir_type(entity->declaration.type);
5481 entity_t *parameter = entity->function.parameters.entities;
5482 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5483 if (parameter->kind != ENTITY_PARAMETER)
5486 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5487 type_t *type = skip_typeref(parameter->declaration.type);
5489 bool needs_entity = parameter->parameter.address_taken;
5490 assert(!is_type_array(type));
5491 if (is_type_compound(type)) {
5492 needs_entity = true;
5495 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5497 ir_type *frame_type = get_irg_frame_type(irg);
5499 = new_parameter_entity(frame_type, n, param_irtype);
5500 parameter->declaration.kind
5501 = DECLARATION_KIND_PARAMETER_ENTITY;
5502 parameter->parameter.v.entity = param;
5506 ir_mode *param_mode = get_type_mode(param_irtype);
5508 ir_node *value = new_r_Proj(args, param_mode, pn);
5510 ir_mode *mode = get_ir_mode_storage(type);
5511 value = create_conv(NULL, value, mode);
5512 value = do_strict_conv(NULL, value);
5514 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5515 parameter->parameter.v.value_number = next_value_number_function;
5516 set_irg_loc_description(current_ir_graph, next_value_number_function,
5518 ++next_value_number_function;
5520 set_value(parameter->parameter.v.value_number, value);
5525 * Handle additional decl modifiers for IR-graphs
5527 * @param irg the IR-graph
5528 * @param dec_modifiers additional modifiers
5530 static void handle_decl_modifier_irg(ir_graph_ptr irg,
5531 decl_modifiers_t decl_modifiers)
5533 if (decl_modifiers & DM_NAKED) {
5534 /* TRUE if the declaration includes the Microsoft
5535 __declspec(naked) specifier. */
5536 add_irg_additional_properties(irg, mtp_property_naked);
5538 if (decl_modifiers & DM_FORCEINLINE) {
5539 /* TRUE if the declaration includes the
5540 Microsoft __forceinline specifier. */
5541 set_irg_inline_property(irg, irg_inline_forced);
5543 if (decl_modifiers & DM_NOINLINE) {
5544 /* TRUE if the declaration includes the Microsoft
5545 __declspec(noinline) specifier. */
5546 set_irg_inline_property(irg, irg_inline_forbidden);
5550 static void add_function_pointer(ir_type *segment, ir_entity *method,
5551 const char *unique_template)
5553 ir_type *method_type = get_entity_type(method);
5554 ir_type *ptr_type = new_type_pointer(method_type);
5556 /* these entities don't really have a name but firm only allows
5558 * Note that we mustn't give these entities a name since for example
5559 * Mach-O doesn't allow them. */
5560 ident *ide = id_unique(unique_template);
5561 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5562 ir_graph *irg = get_const_code_irg();
5563 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5566 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5567 set_entity_compiler_generated(ptr, 1);
5568 set_entity_visibility(ptr, ir_visibility_private);
5569 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5570 set_atomic_ent_value(ptr, val);
5574 * Generate possible IJmp branches to a given label block.
5576 static void gen_ijmp_branches(ir_node *block)
5579 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5580 add_immBlock_pred(block, ijmp);
5585 * Create code for a function and all inner functions.
5587 * @param entity the function entity
5589 static void create_function(entity_t *entity)
5591 assert(entity->kind == ENTITY_FUNCTION);
5592 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5594 if (entity->function.statement == NULL)
5597 if (is_main(entity) && enable_main_collect2_hack) {
5598 prepare_main_collect2(entity);
5601 inner_functions = NULL;
5602 current_trampolines = NULL;
5604 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5605 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5606 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5608 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5609 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5610 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5613 current_function_entity = entity;
5614 current_function_name = NULL;
5615 current_funcsig = NULL;
5617 assert(all_labels == NULL);
5618 all_labels = NEW_ARR_F(label_t *, 0);
5621 int n_local_vars = get_function_n_local_vars(entity);
5622 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5623 current_ir_graph = irg;
5625 ir_graph *old_current_function = current_function;
5626 current_function = irg;
5628 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5629 current_vararg_entity = NULL;
5631 set_irg_fp_model(irg, firm_fp_model);
5632 tarval_enable_fp_ops(1);
5633 set_irn_dbg_info(get_irg_start_block(irg),
5634 get_entity_dbg_info(function_entity));
5636 ir_node *first_block = get_cur_block();
5638 /* set inline flags */
5639 if (entity->function.is_inline)
5640 set_irg_inline_property(irg, irg_inline_recomended);
5641 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5643 next_value_number_function = 0;
5644 initialize_function_parameters(entity);
5645 current_static_link = entity->function.static_link;
5647 statement_to_firm(entity->function.statement);
5649 ir_node *end_block = get_irg_end_block(irg);
5651 /* do we have a return statement yet? */
5652 if (currently_reachable()) {
5653 type_t *type = skip_typeref(entity->declaration.type);
5654 assert(is_type_function(type));
5655 const function_type_t *func_type = &type->function;
5656 const type_t *return_type
5657 = skip_typeref(func_type->return_type);
5660 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5661 ret = new_Return(get_store(), 0, NULL);
5664 if (is_type_scalar(return_type)) {
5665 mode = get_ir_mode_storage(func_type->return_type);
5671 /* ยง5.1.2.2.3 main implicitly returns 0 */
5672 if (is_main(entity)) {
5673 in[0] = new_Const(get_mode_null(mode));
5675 in[0] = new_Unknown(mode);
5677 ret = new_Return(get_store(), 1, in);
5679 add_immBlock_pred(end_block, ret);
5682 bool has_computed_gotos = false;
5683 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5684 label_t *label = all_labels[i];
5685 if (label->address_taken) {
5686 gen_ijmp_branches(label->block);
5687 has_computed_gotos = true;
5689 mature_immBlock(label->block);
5691 if (has_computed_gotos) {
5692 /* if we have computed goto's in the function, we cannot inline it */
5693 if (get_irg_inline_property(irg) >= irg_inline_recomended) {
5694 source_position_t const *const pos = &entity->base.source_position;
5695 warningf(WARN_OTHER, pos, "'%N' can never be inlined because it contains a computed goto", entity);
5697 set_irg_inline_property(irg, irg_inline_forbidden);
5700 DEL_ARR_F(all_labels);
5703 mature_immBlock(first_block);
5704 mature_immBlock(end_block);
5706 irg_finalize_cons(irg);
5708 /* finalize the frame type */
5709 ir_type *frame_type = get_irg_frame_type(irg);
5710 int n = get_compound_n_members(frame_type);
5713 for (int i = 0; i < n; ++i) {
5714 ir_entity *member = get_compound_member(frame_type, i);
5715 ir_type *entity_type = get_entity_type(member);
5717 int align = get_type_alignment_bytes(entity_type);
5718 if (align > align_all)
5722 misalign = offset % align;
5724 offset += align - misalign;
5728 set_entity_offset(member, offset);
5729 offset += get_type_size_bytes(entity_type);
5731 set_type_size_bytes(frame_type, offset);
5732 set_type_alignment_bytes(frame_type, align_all);
5734 irg_verify(irg, VERIFY_ENFORCE_SSA);
5735 current_vararg_entity = old_current_vararg_entity;
5736 current_function = old_current_function;
5738 if (current_trampolines != NULL) {
5739 DEL_ARR_F(current_trampolines);
5740 current_trampolines = NULL;
5743 /* create inner functions if any */
5744 entity_t **inner = inner_functions;
5745 if (inner != NULL) {
5746 ir_type *rem_outer_frame = current_outer_frame;
5747 current_outer_frame = get_irg_frame_type(current_ir_graph);
5748 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5749 create_function(inner[i]);
5753 current_outer_frame = rem_outer_frame;
5757 static void scope_to_firm(scope_t *scope)
5759 /* first pass: create declarations */
5760 entity_t *entity = scope->entities;
5761 for ( ; entity != NULL; entity = entity->base.next) {
5762 if (entity->base.symbol == NULL)
5765 if (entity->kind == ENTITY_FUNCTION) {
5766 if (entity->function.btk != BUILTIN_NONE) {
5767 /* builtins have no representation */
5770 (void)get_function_entity(entity, NULL);
5771 } else if (entity->kind == ENTITY_VARIABLE) {
5772 create_global_variable(entity);
5773 } else if (entity->kind == ENTITY_NAMESPACE) {
5774 scope_to_firm(&entity->namespacee.members);
5778 /* second pass: create code/initializers */
5779 entity = scope->entities;
5780 for ( ; entity != NULL; entity = entity->base.next) {
5781 if (entity->base.symbol == NULL)
5784 if (entity->kind == ENTITY_FUNCTION) {
5785 if (entity->function.btk != BUILTIN_NONE) {
5786 /* builtins have no representation */
5789 create_function(entity);
5790 } else if (entity->kind == ENTITY_VARIABLE) {
5791 assert(entity->declaration.kind
5792 == DECLARATION_KIND_GLOBAL_VARIABLE);
5793 current_ir_graph = get_const_code_irg();
5794 create_variable_initializer(entity);
5799 void init_ast2firm(void)
5801 obstack_init(&asm_obst);
5802 init_atomic_modes();
5804 ir_set_debug_retrieve(dbg_retrieve);
5805 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5807 /* create idents for all known runtime functions */
5808 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5809 rts_idents[i] = new_id_from_str(rts_data[i].name);
5812 entitymap_init(&entitymap);
5815 static void init_ir_types(void)
5817 static int ir_types_initialized = 0;
5818 if (ir_types_initialized)
5820 ir_types_initialized = 1;
5822 ir_type_int = get_ir_type(type_int);
5823 ir_type_char = get_ir_type(type_char);
5824 ir_type_const_char = get_ir_type(type_const_char);
5825 ir_type_wchar_t = get_ir_type(type_wchar_t);
5826 ir_type_void = get_ir_type(type_void);
5828 be_params = be_get_backend_param();
5829 mode_float_arithmetic = be_params->mode_float_arithmetic;
5831 stack_param_align = be_params->stack_param_align;
5834 void exit_ast2firm(void)
5836 entitymap_destroy(&entitymap);
5837 obstack_free(&asm_obst, NULL);
5840 static void global_asm_to_firm(statement_t *s)
5842 for (; s != NULL; s = s->base.next) {
5843 assert(s->kind == STATEMENT_ASM);
5845 char const *const text = s->asms.asm_text.begin;
5846 size_t size = s->asms.asm_text.size;
5848 /* skip the last \0 */
5849 if (text[size - 1] == '\0')
5852 ident *const id = new_id_from_chars(text, size);
5857 void translation_unit_to_firm(translation_unit_t *unit)
5859 /* initialize firm arithmetic */
5860 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5861 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5863 /* just to be sure */
5864 continue_label = NULL;
5866 current_switch_cond = NULL;
5867 current_translation_unit = unit;
5871 scope_to_firm(&unit->scope);
5872 global_asm_to_firm(unit->global_asm);
5874 current_ir_graph = NULL;
5875 current_translation_unit = NULL;