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;
95 static entitymap_t entitymap;
97 static struct obstack asm_obst;
99 typedef enum declaration_kind_t {
100 DECLARATION_KIND_UNKNOWN,
101 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
102 DECLARATION_KIND_GLOBAL_VARIABLE,
103 DECLARATION_KIND_LOCAL_VARIABLE,
104 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
105 DECLARATION_KIND_PARAMETER,
106 DECLARATION_KIND_PARAMETER_ENTITY,
107 DECLARATION_KIND_FUNCTION,
108 DECLARATION_KIND_COMPOUND_MEMBER,
109 DECLARATION_KIND_INNER_FUNCTION
110 } declaration_kind_t;
112 static ir_mode *get_ir_mode_storage(type_t *type);
114 static ir_type *get_ir_type_incomplete(type_t *type);
116 static void enqueue_inner_function(entity_t *entity)
118 if (inner_functions == NULL)
119 inner_functions = NEW_ARR_F(entity_t *, 0);
120 ARR_APP1(entity_t*, inner_functions, entity);
123 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
125 const entity_t *entity = get_irg_loc_description(irg, pos);
127 if (entity != NULL) {
128 source_position_t const *const pos = &entity->base.source_position;
129 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
131 return new_r_Unknown(irg, mode);
134 static const char *dbg_retrieve(const dbg_info *dbg, unsigned *line)
136 const source_position_t *pos = (const source_position_t*) dbg;
141 return pos->input_name;
144 static dbg_info *get_dbg_info(const source_position_t *pos)
146 return (dbg_info*) pos;
149 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
150 const type_dbg_info *dbg)
153 print_to_buffer(buffer, buffer_size);
154 const type_t *type = (const type_t*) dbg;
156 finish_print_to_buffer();
159 static type_dbg_info *get_type_dbg_info_(const type_t *type)
161 return (type_dbg_info*) type;
164 /* is the current block a reachable one? */
165 static bool currently_reachable(void)
167 ir_node *const block = get_cur_block();
168 return block != NULL && !is_Bad(block);
171 static void set_unreachable_now(void)
176 static ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
178 static ir_mode *mode_int, *mode_uint;
180 static ir_node *_expression_to_firm(const expression_t *expression);
181 static ir_node *expression_to_firm(const expression_t *expression);
182 static void create_local_declaration(entity_t *entity);
184 static unsigned decide_modulo_shift(unsigned type_size)
186 if (architecture_modulo_shift == 0)
188 if (type_size < architecture_modulo_shift)
189 return architecture_modulo_shift;
193 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
195 unsigned flags = get_atomic_type_flags(kind);
196 unsigned size = get_atomic_type_size(kind);
197 if ( (flags & (ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_FLOAT))
198 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
201 unsigned bit_size = size * 8;
202 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
203 unsigned modulo_shift = 0;
204 ir_mode_arithmetic arithmetic;
206 if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
207 assert(! (flags & ATOMIC_TYPE_FLAG_FLOAT));
208 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U",
210 sort = irms_int_number;
211 arithmetic = irma_twos_complement;
212 modulo_shift = decide_modulo_shift(bit_size);
214 assert(flags & ATOMIC_TYPE_FLAG_FLOAT);
215 snprintf(name, sizeof(name), "F%u", bit_size);
216 sort = irms_float_number;
217 arithmetic = irma_ieee754;
219 return new_ir_mode(name, sort, bit_size, is_signed, arithmetic,
227 * Initialises the atomic modes depending on the machine size.
229 static void init_atomic_modes(void)
231 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
232 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
234 mode_int = atomic_modes[ATOMIC_TYPE_INT];
235 mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
237 /* there's no real void type in firm */
238 atomic_modes[ATOMIC_TYPE_VOID] = atomic_modes[ATOMIC_TYPE_CHAR];
241 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
243 assert(kind <= ATOMIC_TYPE_LAST);
244 return atomic_modes[kind];
247 static ir_node *get_vla_size(array_type_t *const type)
249 ir_node *size_node = type->size_node;
250 if (size_node == NULL) {
251 size_node = expression_to_firm(type->size_expression);
252 type->size_node = size_node;
258 * Return a node representing the size of a type.
260 static ir_node *get_type_size_node(type_t *type)
262 type = skip_typeref(type);
264 if (is_type_array(type) && type->array.is_vla) {
265 ir_node *size_node = get_vla_size(&type->array);
266 ir_node *elem_size = get_type_size_node(type->array.element_type);
267 ir_mode *mode = get_irn_mode(size_node);
268 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
272 ir_mode *mode = get_ir_mode_storage(type_size_t);
274 sym.type_p = get_ir_type(type);
275 return new_SymConst(mode, sym, symconst_type_size);
278 static unsigned count_parameters(const function_type_t *function_type)
282 function_parameter_t *parameter = function_type->parameters;
283 for ( ; parameter != NULL; parameter = parameter->next) {
291 * Creates a Firm type for an atomic type
293 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
295 ir_mode *mode = atomic_modes[akind];
296 type_dbg_info *dbgi = get_type_dbg_info_(type);
297 ir_type *irtype = new_d_type_primitive(mode, dbgi);
298 il_alignment_t alignment = get_atomic_type_alignment(akind);
300 set_type_alignment_bytes(irtype, alignment);
306 * Creates a Firm type for a complex type
308 static ir_type *create_complex_type(const atomic_type_t *type)
310 atomic_type_kind_t kind = type->akind;
311 ir_mode *mode = atomic_modes[kind];
312 ident *id = get_mode_ident(mode);
316 /* FIXME: finish the array */
321 * Creates a Firm type for an imaginary type
323 static ir_type *create_imaginary_type(const atomic_type_t *type)
325 return create_atomic_type(type->akind, (const type_t*)type);
329 * return type of a parameter (and take transparent union gnu extension into
332 static type_t *get_parameter_type(type_t *orig_type)
334 type_t *type = skip_typeref(orig_type);
335 if (is_type_union(type)
336 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
337 compound_t *compound = type->compound.compound;
338 type = compound->members.entities->declaration.type;
344 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
346 type_t *return_type = skip_typeref(function_type->return_type);
348 int n_parameters = count_parameters(function_type)
349 + (for_closure ? 1 : 0);
350 int n_results = return_type == type_void ? 0 : 1;
351 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
352 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
354 if (return_type != type_void) {
355 ir_type *restype = get_ir_type(return_type);
356 set_method_res_type(irtype, 0, restype);
359 function_parameter_t *parameter = function_type->parameters;
362 ir_type *p_irtype = get_ir_type(type_void_ptr);
363 set_method_param_type(irtype, n, p_irtype);
366 for ( ; parameter != NULL; parameter = parameter->next) {
367 type_t *type = get_parameter_type(parameter->type);
368 ir_type *p_irtype = get_ir_type(type);
369 set_method_param_type(irtype, n, p_irtype);
373 bool is_variadic = function_type->variadic;
376 set_method_variadicity(irtype, variadicity_variadic);
378 unsigned cc = get_method_calling_convention(irtype);
379 switch (function_type->calling_convention) {
380 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
383 set_method_calling_convention(irtype, SET_CDECL(cc));
390 /* only non-variadic function can use stdcall, else use cdecl */
391 set_method_calling_convention(irtype, SET_STDCALL(cc));
397 /* only non-variadic function can use fastcall, else use cdecl */
398 set_method_calling_convention(irtype, SET_FASTCALL(cc));
402 /* Hmm, leave default, not accepted by the parser yet. */
407 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
412 static ir_type *create_pointer_type(pointer_type_t *type)
414 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
415 type_t *points_to = type->points_to;
416 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
417 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
422 static ir_type *create_reference_type(reference_type_t *type)
424 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
425 type_t *refers_to = type->refers_to;
426 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
427 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
432 static ir_type *create_array_type(array_type_t *type)
434 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
435 type_t *element_type = type->element_type;
436 ir_type *ir_element_type = get_ir_type(element_type);
437 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
439 const int align = get_type_alignment_bytes(ir_element_type);
440 set_type_alignment_bytes(irtype, align);
442 if (type->size_constant) {
443 int n_elements = type->size;
445 set_array_bounds_int(irtype, 0, 0, n_elements);
447 size_t elemsize = get_type_size_bytes(ir_element_type);
448 if (elemsize % align > 0) {
449 elemsize += align - (elemsize % align);
451 set_type_size_bytes(irtype, n_elements * elemsize);
453 set_array_lower_bound_int(irtype, 0, 0);
455 set_type_state(irtype, layout_fixed);
461 * Return the signed integer type of size bits.
463 * @param size the size
465 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
469 static ir_mode *s_modes[64 + 1] = {NULL, };
473 if (size <= 0 || size > 64)
476 mode = s_modes[size];
480 snprintf(name, sizeof(name), "bf_I%u", size);
481 mode = new_ir_mode(name, irms_int_number, size, 1, irma_twos_complement,
482 size <= 32 ? 32 : size );
483 s_modes[size] = mode;
486 type_dbg_info *dbgi = get_type_dbg_info_(type);
487 res = new_d_type_primitive(mode, dbgi);
488 set_primitive_base_type(res, base_tp);
494 * Return the unsigned integer type of size bits.
496 * @param size the size
498 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
502 static ir_mode *u_modes[64 + 1] = {NULL, };
506 if (size <= 0 || size > 64)
509 mode = u_modes[size];
513 snprintf(name, sizeof(name), "bf_U%u", size);
514 mode = new_ir_mode(name, irms_int_number, size, 0, irma_twos_complement,
515 size <= 32 ? 32 : size );
516 u_modes[size] = mode;
519 type_dbg_info *dbgi = get_type_dbg_info_(type);
520 res = new_d_type_primitive(mode, dbgi);
521 set_primitive_base_type(res, base_tp);
526 static ir_type *create_bitfield_type(const entity_t *entity)
528 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
529 type_t *base = skip_typeref(entity->declaration.type);
530 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
531 ir_type *irbase = get_ir_type(base);
533 unsigned bit_size = entity->compound_member.bit_size;
535 assert(!is_type_float(base));
536 if (is_type_signed(base)) {
537 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
539 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
543 #define INVALID_TYPE ((ir_type_ptr)-1)
546 COMPOUND_IS_STRUCT = false,
547 COMPOUND_IS_UNION = true
551 * Construct firm type from ast struct type.
553 static ir_type *create_compound_type(compound_type_t *type,
554 bool incomplete, bool is_union)
556 compound_t *compound = type->compound;
558 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
559 return compound->irtype;
562 symbol_t *type_symbol = compound->base.symbol;
564 if (type_symbol != NULL) {
565 id = new_id_from_str(type_symbol->string);
568 id = id_unique("__anonymous_union.%u");
570 id = id_unique("__anonymous_struct.%u");
576 irtype = new_type_union(id);
578 irtype = new_type_struct(id);
581 compound->irtype_complete = false;
582 compound->irtype = irtype;
588 layout_union_type(type);
590 layout_struct_type(type);
593 compound->irtype_complete = true;
595 entity_t *entry = compound->members.entities;
596 for ( ; entry != NULL; entry = entry->base.next) {
597 if (entry->kind != ENTITY_COMPOUND_MEMBER)
600 symbol_t *symbol = entry->base.symbol;
601 type_t *entry_type = entry->declaration.type;
603 if (symbol == NULL) {
604 /* anonymous bitfield member, skip */
605 if (entry->compound_member.bitfield)
607 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
608 || entry_type->kind == TYPE_COMPOUND_UNION);
609 ident = id_unique("anon.%u");
611 ident = new_id_from_str(symbol->string);
614 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
616 ir_type *entry_irtype;
617 if (entry->compound_member.bitfield) {
618 entry_irtype = create_bitfield_type(entry);
620 entry_irtype = get_ir_type(entry_type);
622 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
624 set_entity_offset(entity, entry->compound_member.offset);
625 set_entity_offset_bits_remainder(entity,
626 entry->compound_member.bit_offset);
628 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
629 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
630 entry->compound_member.entity = entity;
633 set_type_alignment_bytes(irtype, compound->alignment);
634 set_type_size_bytes(irtype, compound->size);
635 set_type_state(irtype, layout_fixed);
640 static ir_type *create_enum_type(enum_type_t *const type)
642 type->base.base.firm_type = ir_type_int;
644 ir_mode *const mode = mode_int;
645 ir_tarval *const one = get_mode_one(mode);
646 ir_tarval * tv_next = get_mode_null(mode);
648 bool constant_folding_old = constant_folding;
649 constant_folding = true;
651 enum_t *enume = type->enume;
652 entity_t *entry = enume->base.next;
653 for (; entry != NULL; entry = entry->base.next) {
654 if (entry->kind != ENTITY_ENUM_VALUE)
657 expression_t *const init = entry->enum_value.value;
659 ir_node *const cnst = expression_to_firm(init);
660 if (!is_Const(cnst)) {
661 panic("couldn't fold constant");
663 tv_next = get_Const_tarval(cnst);
665 entry->enum_value.tv = tv_next;
666 tv_next = tarval_add(tv_next, one);
669 constant_folding = constant_folding_old;
671 return create_atomic_type(type->base.akind, (const type_t*) type);
674 static ir_type *get_ir_type_incomplete(type_t *type)
676 assert(type != NULL);
677 type = skip_typeref(type);
679 if (type->base.firm_type != NULL) {
680 assert(type->base.firm_type != INVALID_TYPE);
681 return type->base.firm_type;
684 switch (type->kind) {
685 case TYPE_COMPOUND_STRUCT:
686 return create_compound_type(&type->compound, true, COMPOUND_IS_STRUCT);
687 case TYPE_COMPOUND_UNION:
688 return create_compound_type(&type->compound, true, COMPOUND_IS_UNION);
690 return get_ir_type(type);
694 ir_type *get_ir_type(type_t *type)
696 assert(type != NULL);
698 type = skip_typeref(type);
700 if (type->base.firm_type != NULL) {
701 assert(type->base.firm_type != INVALID_TYPE);
702 return type->base.firm_type;
705 ir_type *firm_type = NULL;
706 switch (type->kind) {
708 /* Happens while constant folding, when there was an error */
709 return create_atomic_type(ATOMIC_TYPE_VOID, NULL);
712 firm_type = create_atomic_type(type->atomic.akind, type);
715 firm_type = create_complex_type(&type->atomic);
718 firm_type = create_imaginary_type(&type->atomic);
721 firm_type = create_method_type(&type->function, false);
724 firm_type = create_pointer_type(&type->pointer);
727 firm_type = create_reference_type(&type->reference);
730 firm_type = create_array_type(&type->array);
732 case TYPE_COMPOUND_STRUCT:
733 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_STRUCT);
735 case TYPE_COMPOUND_UNION:
736 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_UNION);
739 firm_type = create_enum_type(&type->enumt);
746 if (firm_type == NULL)
747 panic("unknown type found");
749 type->base.firm_type = firm_type;
753 static ir_mode *get_ir_mode_storage(type_t *type)
755 ir_type *irtype = get_ir_type(type);
757 /* firm doesn't report a mode for arrays somehow... */
758 if (is_Array_type(irtype)) {
762 ir_mode *mode = get_type_mode(irtype);
763 assert(mode != NULL);
768 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
769 * int that it returns bigger modes for floating point on some platforms
770 * (x87 internally does arithemtic with 80bits)
772 static ir_mode *get_ir_mode_arithmetic(type_t *type)
774 ir_mode *mode = get_ir_mode_storage(type);
775 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
776 return mode_float_arithmetic;
782 /** Names of the runtime functions. */
783 static const struct {
784 int id; /**< the rts id */
785 int n_res; /**< number of return values */
786 const char *name; /**< the name of the rts function */
787 int n_params; /**< number of parameters */
788 unsigned flags; /**< language flags */
790 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
791 { rts_abort, 0, "abort", 0, _C89 },
792 { rts_alloca, 1, "alloca", 1, _ALL },
793 { rts_abs, 1, "abs", 1, _C89 },
794 { rts_labs, 1, "labs", 1, _C89 },
795 { rts_llabs, 1, "llabs", 1, _C99 },
796 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
798 { rts_fabs, 1, "fabs", 1, _C89 },
799 { rts_sqrt, 1, "sqrt", 1, _C89 },
800 { rts_cbrt, 1, "cbrt", 1, _C99 },
801 { rts_exp, 1, "exp", 1, _C89 },
802 { rts_exp2, 1, "exp2", 1, _C89 },
803 { rts_exp10, 1, "exp10", 1, _GNUC },
804 { rts_log, 1, "log", 1, _C89 },
805 { rts_log2, 1, "log2", 1, _C89 },
806 { rts_log10, 1, "log10", 1, _C89 },
807 { rts_pow, 1, "pow", 2, _C89 },
808 { rts_sin, 1, "sin", 1, _C89 },
809 { rts_cos, 1, "cos", 1, _C89 },
810 { rts_tan, 1, "tan", 1, _C89 },
811 { rts_asin, 1, "asin", 1, _C89 },
812 { rts_acos, 1, "acos", 1, _C89 },
813 { rts_atan, 1, "atan", 1, _C89 },
814 { rts_sinh, 1, "sinh", 1, _C89 },
815 { rts_cosh, 1, "cosh", 1, _C89 },
816 { rts_tanh, 1, "tanh", 1, _C89 },
818 { rts_fabsf, 1, "fabsf", 1, _C99 },
819 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
820 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
821 { rts_expf, 1, "expf", 1, _C99 },
822 { rts_exp2f, 1, "exp2f", 1, _C99 },
823 { rts_exp10f, 1, "exp10f", 1, _GNUC },
824 { rts_logf, 1, "logf", 1, _C99 },
825 { rts_log2f, 1, "log2f", 1, _C99 },
826 { rts_log10f, 1, "log10f", 1, _C99 },
827 { rts_powf, 1, "powf", 2, _C99 },
828 { rts_sinf, 1, "sinf", 1, _C99 },
829 { rts_cosf, 1, "cosf", 1, _C99 },
830 { rts_tanf, 1, "tanf", 1, _C99 },
831 { rts_asinf, 1, "asinf", 1, _C99 },
832 { rts_acosf, 1, "acosf", 1, _C99 },
833 { rts_atanf, 1, "atanf", 1, _C99 },
834 { rts_sinhf, 1, "sinhf", 1, _C99 },
835 { rts_coshf, 1, "coshf", 1, _C99 },
836 { rts_tanhf, 1, "tanhf", 1, _C99 },
838 { rts_fabsl, 1, "fabsl", 1, _C99 },
839 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
840 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
841 { rts_expl, 1, "expl", 1, _C99 },
842 { rts_exp2l, 1, "exp2l", 1, _C99 },
843 { rts_exp10l, 1, "exp10l", 1, _GNUC },
844 { rts_logl, 1, "logl", 1, _C99 },
845 { rts_log2l, 1, "log2l", 1, _C99 },
846 { rts_log10l, 1, "log10l", 1, _C99 },
847 { rts_powl, 1, "powl", 2, _C99 },
848 { rts_sinl, 1, "sinl", 1, _C99 },
849 { rts_cosl, 1, "cosl", 1, _C99 },
850 { rts_tanl, 1, "tanl", 1, _C99 },
851 { rts_asinl, 1, "asinl", 1, _C99 },
852 { rts_acosl, 1, "acosl", 1, _C99 },
853 { rts_atanl, 1, "atanl", 1, _C99 },
854 { rts_sinhl, 1, "sinhl", 1, _C99 },
855 { rts_coshl, 1, "coshl", 1, _C99 },
856 { rts_tanhl, 1, "tanhl", 1, _C99 },
858 { rts_strcmp, 1, "strcmp", 2, _C89 },
859 { rts_strncmp, 1, "strncmp", 3, _C89 },
860 { rts_strcpy, 1, "strcpy", 2, _C89 },
861 { rts_strlen, 1, "strlen", 1, _C89 },
862 { rts_memcpy, 1, "memcpy", 3, _C89 },
863 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
864 { rts_memmove, 1, "memmove", 3, _C89 },
865 { rts_memset, 1, "memset", 3, _C89 },
866 { rts_memcmp, 1, "memcmp", 3, _C89 },
869 static ident *rts_idents[lengthof(rts_data)];
871 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
873 void set_create_ld_ident(ident *(*func)(entity_t*))
875 create_ld_ident = func;
879 * Handle GNU attributes for entities
881 * @param ent the entity
882 * @param decl the routine declaration
884 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
886 assert(is_declaration(entity));
887 decl_modifiers_t modifiers = entity->declaration.modifiers;
889 if (is_method_entity(irentity)) {
890 if (modifiers & DM_PURE) {
891 set_entity_additional_properties(irentity, mtp_property_pure);
893 if (modifiers & DM_CONST) {
894 add_entity_additional_properties(irentity, mtp_property_const);
897 if (modifiers & DM_USED) {
898 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
900 if (modifiers & DM_WEAK) {
901 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
905 static bool is_main(entity_t *entity)
907 static symbol_t *sym_main = NULL;
908 if (sym_main == NULL) {
909 sym_main = symbol_table_insert("main");
912 if (entity->base.symbol != sym_main)
914 /* must be in outermost scope */
915 if (entity->base.parent_scope != ¤t_translation_unit->scope)
922 * Creates an entity representing a function.
924 * @param entity the function declaration/definition
925 * @param owner_type the owner type of this function, NULL
926 * for global functions
928 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
930 assert(entity->kind == ENTITY_FUNCTION);
931 if (entity->function.irentity != NULL)
932 return entity->function.irentity;
934 switch (entity->function.btk) {
937 case BUILTIN_LIBC_CHECK:
943 if (is_main(entity)) {
944 /* force main to C linkage */
945 type_t *type = entity->declaration.type;
946 assert(is_type_function(type));
947 if (type->function.linkage != LINKAGE_C) {
948 type_t *new_type = duplicate_type(type);
949 new_type->function.linkage = LINKAGE_C;
950 type = identify_new_type(new_type);
951 entity->declaration.type = type;
955 symbol_t *symbol = entity->base.symbol;
956 ident *id = new_id_from_str(symbol->string);
958 /* already an entity defined? */
959 ir_entity *irentity = entitymap_get(&entitymap, symbol);
960 bool const has_body = entity->function.statement != NULL;
961 if (irentity != NULL) {
962 if (get_entity_visibility(irentity) == ir_visibility_external
964 set_entity_visibility(irentity, ir_visibility_default);
969 ir_type *ir_type_method;
970 if (entity->function.need_closure)
971 ir_type_method = create_method_type(&entity->declaration.type->function, true);
973 ir_type_method = get_ir_type(entity->declaration.type);
975 bool nested_function = false;
976 if (owner_type == NULL)
977 owner_type = get_glob_type();
979 nested_function = true;
981 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
982 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
986 ld_id = id_unique("inner.%u");
988 ld_id = create_ld_ident(entity);
989 set_entity_ld_ident(irentity, ld_id);
991 handle_decl_modifiers(irentity, entity);
993 if (! nested_function) {
994 /* static inline => local
995 * extern inline => local
996 * inline without definition => local
997 * inline with definition => external_visible */
998 storage_class_tag_t const storage_class
999 = (storage_class_tag_t) entity->declaration.storage_class;
1000 bool const is_inline = entity->function.is_inline;
1002 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
1003 set_entity_visibility(irentity, ir_visibility_default);
1004 } else if (storage_class == STORAGE_CLASS_STATIC ||
1005 (is_inline && has_body)) {
1006 set_entity_visibility(irentity, ir_visibility_local);
1007 } else if (has_body) {
1008 set_entity_visibility(irentity, ir_visibility_default);
1010 set_entity_visibility(irentity, ir_visibility_external);
1013 /* nested functions are always local */
1014 set_entity_visibility(irentity, ir_visibility_local);
1017 /* We should check for file scope here, but as long as we compile C only
1018 this is not needed. */
1019 if (!freestanding && !has_body) {
1020 /* check for a known runtime function */
1021 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1022 if (id != rts_idents[i])
1025 function_type_t *function_type
1026 = &entity->declaration.type->function;
1027 /* rts_entities code can't handle a "wrong" number of parameters */
1028 if (function_type->unspecified_parameters)
1031 /* check number of parameters */
1032 int n_params = count_parameters(function_type);
1033 if (n_params != rts_data[i].n_params)
1036 type_t *return_type = skip_typeref(function_type->return_type);
1037 int n_res = return_type != type_void ? 1 : 0;
1038 if (n_res != rts_data[i].n_res)
1041 /* ignore those rts functions not necessary needed for current mode */
1042 if ((c_mode & rts_data[i].flags) == 0)
1044 assert(rts_entities[rts_data[i].id] == NULL);
1045 rts_entities[rts_data[i].id] = irentity;
1049 entitymap_insert(&entitymap, symbol, irentity);
1052 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1053 entity->function.irentity = irentity;
1059 * Creates a SymConst for a given entity.
1061 * @param dbgi debug info
1062 * @param entity the entity
1064 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1066 assert(entity != NULL);
1067 union symconst_symbol sym;
1068 sym.entity_p = entity;
1069 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1072 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1074 ir_mode *value_mode = get_irn_mode(value);
1076 if (value_mode == dest_mode)
1079 if (dest_mode == mode_b) {
1080 ir_node *zero = new_Const(get_mode_null(value_mode));
1081 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_less_greater);
1085 return new_d_Conv(dbgi, value, dest_mode);
1088 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1090 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1094 * Creates a SymConst node representing a wide string literal.
1096 * @param literal the wide string literal
1098 static ir_node *wide_string_literal_to_firm(
1099 const string_literal_expression_t *literal)
1101 ir_type *const global_type = get_glob_type();
1102 ir_type *const elem_type = ir_type_wchar_t;
1103 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1104 ir_type *const type = new_type_array(1, elem_type);
1106 ident *const id = id_unique("str.%u");
1107 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1108 set_entity_ld_ident(entity, id);
1109 set_entity_visibility(entity, ir_visibility_private);
1110 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1112 ir_mode *const mode = get_type_mode(elem_type);
1113 const size_t slen = wstrlen(&literal->value);
1115 set_array_lower_bound_int(type, 0, 0);
1116 set_array_upper_bound_int(type, 0, slen);
1117 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1118 set_type_state(type, layout_fixed);
1120 ir_initializer_t *initializer = create_initializer_compound(slen);
1121 const char *p = literal->value.begin;
1122 for (size_t i = 0; i < slen; ++i) {
1123 assert(p < literal->value.begin + literal->value.size);
1124 utf32 v = read_utf8_char(&p);
1125 ir_tarval *tv = new_tarval_from_long(v, mode);
1126 ir_initializer_t *val = create_initializer_tarval(tv);
1127 set_initializer_compound_value(initializer, i, val);
1129 set_entity_initializer(entity, initializer);
1131 return create_symconst(dbgi, entity);
1135 * Creates a SymConst node representing a string constant.
1137 * @param src_pos the source position of the string constant
1138 * @param id_prefix a prefix for the name of the generated string constant
1139 * @param value the value of the string constant
1141 static ir_node *string_to_firm(const source_position_t *const src_pos,
1142 const char *const id_prefix,
1143 const string_t *const value)
1145 ir_type *const global_type = get_glob_type();
1146 dbg_info *const dbgi = get_dbg_info(src_pos);
1147 ir_type *const type = new_type_array(1, ir_type_const_char);
1149 ident *const id = id_unique(id_prefix);
1150 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1151 set_entity_ld_ident(entity, id);
1152 set_entity_visibility(entity, ir_visibility_private);
1153 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1155 ir_type *const elem_type = ir_type_const_char;
1156 ir_mode *const mode = get_type_mode(elem_type);
1158 const char* const string = value->begin;
1159 const size_t slen = value->size;
1161 set_array_lower_bound_int(type, 0, 0);
1162 set_array_upper_bound_int(type, 0, slen);
1163 set_type_size_bytes(type, slen);
1164 set_type_state(type, layout_fixed);
1166 ir_initializer_t *initializer = create_initializer_compound(slen);
1167 for (size_t i = 0; i < slen; ++i) {
1168 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1169 ir_initializer_t *val = create_initializer_tarval(tv);
1170 set_initializer_compound_value(initializer, i, val);
1172 set_entity_initializer(entity, initializer);
1174 return create_symconst(dbgi, entity);
1177 static bool try_create_integer(literal_expression_t *literal,
1178 type_t *type, unsigned char base)
1180 const char *string = literal->value.begin;
1181 size_t size = literal->value.size;
1183 assert(type->kind == TYPE_ATOMIC);
1184 atomic_type_kind_t akind = type->atomic.akind;
1186 ir_mode *mode = atomic_modes[akind];
1187 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1188 if (tv == tarval_bad)
1191 literal->base.type = type;
1192 literal->target_value = tv;
1196 static void create_integer_tarval(literal_expression_t *literal)
1200 const string_t *suffix = &literal->suffix;
1202 if (suffix->size > 0) {
1203 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1204 if (*c == 'u' || *c == 'U') { ++us; }
1205 if (*c == 'l' || *c == 'L') { ++ls; }
1210 switch (literal->base.kind) {
1211 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1212 case EXPR_LITERAL_INTEGER: base = 10; break;
1213 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1214 default: panic("invalid literal kind");
1217 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1219 /* now try if the constant is small enough for some types */
1220 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1222 if (us == 0 && try_create_integer(literal, type_int, base))
1224 if ((us == 1 || base != 10)
1225 && try_create_integer(literal, type_unsigned_int, base))
1229 if (us == 0 && try_create_integer(literal, type_long, base))
1231 if ((us == 1 || base != 10)
1232 && try_create_integer(literal, type_unsigned_long, base))
1235 /* last try? then we should not report tarval_bad */
1236 if (us != 1 && base == 10)
1237 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1238 if (us == 0 && try_create_integer(literal, type_long_long, base))
1242 assert(us == 1 || base != 10);
1243 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1244 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1246 panic("internal error when parsing number literal");
1249 tarval_set_integer_overflow_mode(old_mode);
1252 void determine_literal_type(literal_expression_t *literal)
1254 switch (literal->base.kind) {
1255 case EXPR_LITERAL_INTEGER:
1256 case EXPR_LITERAL_INTEGER_OCTAL:
1257 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1258 create_integer_tarval(literal);
1266 * Creates a Const node representing a constant.
1268 static ir_node *literal_to_firm(const literal_expression_t *literal)
1270 type_t *type = skip_typeref(literal->base.type);
1271 ir_mode *mode = get_ir_mode_storage(type);
1272 const char *string = literal->value.begin;
1273 size_t size = literal->value.size;
1276 switch (literal->base.kind) {
1277 case EXPR_LITERAL_WIDE_CHARACTER: {
1278 utf32 v = read_utf8_char(&string);
1280 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1282 tv = new_tarval_from_str(buf, len, mode);
1285 case EXPR_LITERAL_CHARACTER: {
1288 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1289 if (size == 1 && char_is_signed) {
1290 v = (signed char)string[0];
1293 for (size_t i = 0; i < size; ++i) {
1294 v = (v << 8) | ((unsigned char)string[i]);
1298 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1300 tv = new_tarval_from_str(buf, len, mode);
1303 case EXPR_LITERAL_INTEGER:
1304 case EXPR_LITERAL_INTEGER_OCTAL:
1305 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1306 assert(literal->target_value != NULL);
1307 tv = literal->target_value;
1309 case EXPR_LITERAL_FLOATINGPOINT:
1310 tv = new_tarval_from_str(string, size, mode);
1312 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1313 char buffer[size + 2];
1314 memcpy(buffer, "0x", 2);
1315 memcpy(buffer+2, string, size);
1316 tv = new_tarval_from_str(buffer, size+2, mode);
1319 case EXPR_LITERAL_BOOLEAN:
1320 if (string[0] == 't') {
1321 tv = get_mode_one(mode);
1323 assert(string[0] == 'f');
1324 tv = get_mode_null(mode);
1327 case EXPR_LITERAL_MS_NOOP:
1328 tv = get_mode_null(mode);
1333 panic("Invalid literal kind found");
1336 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1337 ir_node *res = new_d_Const(dbgi, tv);
1338 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1339 return create_conv(dbgi, res, mode_arith);
1343 * Allocate an area of size bytes aligned at alignment
1346 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1348 static unsigned area_cnt = 0;
1351 ir_type *tp = new_type_array(1, ir_type_char);
1352 set_array_bounds_int(tp, 0, 0, size);
1353 set_type_alignment_bytes(tp, alignment);
1355 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1356 ident *name = new_id_from_str(buf);
1357 ir_entity *area = new_entity(frame_type, name, tp);
1359 /* mark this entity as compiler generated */
1360 set_entity_compiler_generated(area, 1);
1365 * Return a node representing a trampoline region
1366 * for a given function entity.
1368 * @param dbgi debug info
1369 * @param entity the function entity
1371 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1373 ir_entity *region = NULL;
1376 if (current_trampolines != NULL) {
1377 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1378 if (current_trampolines[i].function == entity) {
1379 region = current_trampolines[i].region;
1384 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1386 ir_graph *irg = current_ir_graph;
1387 if (region == NULL) {
1388 /* create a new region */
1389 ir_type *frame_tp = get_irg_frame_type(irg);
1390 trampoline_region reg;
1391 reg.function = entity;
1393 reg.region = alloc_trampoline(frame_tp,
1394 be_params->trampoline_size,
1395 be_params->trampoline_align);
1396 ARR_APP1(trampoline_region, current_trampolines, reg);
1397 region = reg.region;
1399 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1404 * Creates a trampoline for a function represented by an entity.
1406 * @param dbgi debug info
1407 * @param mode the (reference) mode for the function address
1408 * @param entity the function entity
1410 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1413 assert(entity != NULL);
1415 in[0] = get_trampoline_region(dbgi, entity);
1416 in[1] = create_symconst(dbgi, entity);
1417 in[2] = get_irg_frame(current_ir_graph);
1419 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1420 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1421 return new_Proj(irn, mode, pn_Builtin_1_result);
1425 * Dereference an address.
1427 * @param dbgi debug info
1428 * @param type the type of the dereferenced result (the points_to type)
1429 * @param addr the address to dereference
1431 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1432 ir_node *const addr)
1434 ir_type *irtype = get_ir_type(type);
1435 if (is_compound_type(irtype)
1436 || is_Method_type(irtype)
1437 || is_Array_type(irtype)) {
1441 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1442 ? cons_volatile : cons_none;
1443 ir_mode *const mode = get_type_mode(irtype);
1444 ir_node *const memory = get_store();
1445 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1446 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1447 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1449 set_store(load_mem);
1451 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(type);
1452 return create_conv(dbgi, load_res, mode_arithmetic);
1456 * Creates a strict Conv (to the node's mode) if necessary.
1458 * @param dbgi debug info
1459 * @param node the node to strict conv
1461 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1463 ir_mode *mode = get_irn_mode(node);
1465 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1467 if (!mode_is_float(mode))
1470 /* check if there is already a Conv */
1471 if (is_Conv(node)) {
1472 /* convert it into a strict Conv */
1473 set_Conv_strict(node, 1);
1477 /* otherwise create a new one */
1478 return new_d_strictConv(dbgi, node, mode);
1482 * Returns the correct base address depending on whether it is a parameter or a
1483 * normal local variable.
1485 static ir_node *get_local_frame(ir_entity *const ent)
1487 ir_graph *const irg = current_ir_graph;
1488 const ir_type *const owner = get_entity_owner(ent);
1489 if (owner == current_outer_frame) {
1490 assert(current_static_link != NULL);
1491 return current_static_link;
1493 return get_irg_frame(irg);
1498 * Keep all memory edges of the given block.
1500 static void keep_all_memory(ir_node *block)
1502 ir_node *old = get_cur_block();
1504 set_cur_block(block);
1505 keep_alive(get_store());
1506 /* TODO: keep all memory edges from restricted pointers */
1510 static ir_node *reference_expression_enum_value_to_firm(
1511 const reference_expression_t *ref)
1513 entity_t *entity = ref->entity;
1514 type_t *type = skip_typeref(entity->enum_value.enum_type);
1515 /* make sure the type is constructed */
1516 (void) get_ir_type(type);
1518 return new_Const(entity->enum_value.tv);
1521 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1523 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1524 entity_t *entity = ref->entity;
1525 assert(is_declaration(entity));
1526 type_t *type = skip_typeref(entity->declaration.type);
1528 /* make sure the type is constructed */
1529 (void) get_ir_type(type);
1531 if (entity->kind == ENTITY_FUNCTION
1532 && entity->function.btk != BUILTIN_NONE) {
1533 ir_entity *irentity = get_function_entity(entity, NULL);
1534 /* for gcc compatibility we have to produce (dummy) addresses for some
1535 * builtins which don't have entities */
1536 if (irentity == NULL) {
1537 source_position_t const *const pos = &ref->base.source_position;
1538 symbol_t const *const sym = ref->entity->base.symbol;
1539 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1541 /* simply create a NULL pointer */
1542 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1543 ir_node *res = new_Const(get_mode_null(mode));
1549 switch ((declaration_kind_t) entity->declaration.kind) {
1550 case DECLARATION_KIND_UNKNOWN:
1553 case DECLARATION_KIND_LOCAL_VARIABLE: {
1554 ir_mode *const mode = get_ir_mode_storage(type);
1555 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1556 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1558 case DECLARATION_KIND_PARAMETER: {
1559 ir_mode *const mode = get_ir_mode_storage(type);
1560 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1561 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1563 case DECLARATION_KIND_FUNCTION: {
1564 return create_symconst(dbgi, entity->function.irentity);
1566 case DECLARATION_KIND_INNER_FUNCTION: {
1567 ir_mode *const mode = get_ir_mode_storage(type);
1568 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1569 /* inner function not using the closure */
1570 return create_symconst(dbgi, entity->function.irentity);
1572 /* need trampoline here */
1573 return create_trampoline(dbgi, mode, entity->function.irentity);
1576 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1577 const variable_t *variable = &entity->variable;
1578 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1579 return deref_address(dbgi, variable->base.type, addr);
1582 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1583 ir_entity *irentity = entity->variable.v.entity;
1584 ir_node *frame = get_local_frame(irentity);
1585 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1586 return deref_address(dbgi, entity->declaration.type, sel);
1588 case DECLARATION_KIND_PARAMETER_ENTITY: {
1589 ir_entity *irentity = entity->parameter.v.entity;
1590 ir_node *frame = get_local_frame(irentity);
1591 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1592 return deref_address(dbgi, entity->declaration.type, sel);
1595 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1596 return entity->variable.v.vla_base;
1598 case DECLARATION_KIND_COMPOUND_MEMBER:
1599 panic("not implemented reference type");
1602 panic("reference to declaration with unknown type found");
1605 static ir_node *reference_addr(const reference_expression_t *ref)
1607 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1608 entity_t *entity = ref->entity;
1609 assert(is_declaration(entity));
1611 switch((declaration_kind_t) entity->declaration.kind) {
1612 case DECLARATION_KIND_UNKNOWN:
1614 case DECLARATION_KIND_PARAMETER:
1615 case DECLARATION_KIND_LOCAL_VARIABLE:
1616 /* you can store to a local variable (so we don't panic but return NULL
1617 * as an indicator for no real address) */
1619 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1620 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1623 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1624 ir_entity *irentity = entity->variable.v.entity;
1625 ir_node *frame = get_local_frame(irentity);
1626 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1630 case DECLARATION_KIND_PARAMETER_ENTITY: {
1631 ir_entity *irentity = entity->parameter.v.entity;
1632 ir_node *frame = get_local_frame(irentity);
1633 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1638 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1639 return entity->variable.v.vla_base;
1641 case DECLARATION_KIND_FUNCTION: {
1642 return create_symconst(dbgi, entity->function.irentity);
1645 case DECLARATION_KIND_INNER_FUNCTION: {
1646 type_t *const type = skip_typeref(entity->declaration.type);
1647 ir_mode *const mode = get_ir_mode_storage(type);
1648 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1649 /* inner function not using the closure */
1650 return create_symconst(dbgi, entity->function.irentity);
1652 /* need trampoline here */
1653 return create_trampoline(dbgi, mode, entity->function.irentity);
1657 case DECLARATION_KIND_COMPOUND_MEMBER:
1658 panic("not implemented reference type");
1661 panic("reference to declaration with unknown type found");
1665 * Transform calls to builtin functions.
1667 static ir_node *process_builtin_call(const call_expression_t *call)
1669 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1671 assert(call->function->kind == EXPR_REFERENCE);
1672 reference_expression_t *builtin = &call->function->reference;
1674 type_t *expr_type = skip_typeref(builtin->base.type);
1675 assert(is_type_pointer(expr_type));
1677 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1679 switch (builtin->entity->function.btk) {
1682 case BUILTIN_ALLOCA: {
1683 expression_t *argument = call->arguments->expression;
1684 ir_node *size = expression_to_firm(argument);
1686 ir_node *store = get_store();
1687 ir_node *alloca = new_d_Alloc(dbgi, store, size, firm_unknown_type,
1689 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1691 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1696 type_t *type = function_type->function.return_type;
1697 ir_mode *mode = get_ir_mode_arithmetic(type);
1698 ir_tarval *tv = get_mode_infinite(mode);
1699 ir_node *res = new_d_Const(dbgi, tv);
1703 /* Ignore string for now... */
1704 assert(is_type_function(function_type));
1705 type_t *type = function_type->function.return_type;
1706 ir_mode *mode = get_ir_mode_arithmetic(type);
1707 ir_tarval *tv = get_mode_NAN(mode);
1708 ir_node *res = new_d_Const(dbgi, tv);
1711 case BUILTIN_EXPECT: {
1712 expression_t *argument = call->arguments->expression;
1713 return _expression_to_firm(argument);
1715 case BUILTIN_VA_END:
1716 /* evaluate the argument of va_end for its side effects */
1717 _expression_to_firm(call->arguments->expression);
1719 case BUILTIN_OBJECT_SIZE: {
1720 /* determine value of "type" */
1721 expression_t *type_expression = call->arguments->next->expression;
1722 long type_val = fold_constant_to_int(type_expression);
1723 type_t *type = function_type->function.return_type;
1724 ir_mode *mode = get_ir_mode_arithmetic(type);
1725 /* just produce a "I don't know" result */
1726 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1727 get_mode_minus_one(mode);
1729 return new_d_Const(dbgi, result);
1731 case BUILTIN_ROTL: {
1732 ir_node *val = expression_to_firm(call->arguments->expression);
1733 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1734 ir_mode *mode = get_irn_mode(val);
1735 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1737 case BUILTIN_ROTR: {
1738 ir_node *val = expression_to_firm(call->arguments->expression);
1739 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1740 ir_mode *mode = get_irn_mode(val);
1741 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1742 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1743 return new_d_Rotl(dbgi, val, sub, mode);
1748 case BUILTIN_LIBC_CHECK:
1749 panic("builtin did not produce an entity");
1751 panic("invalid builtin found");
1755 * Transform a call expression.
1756 * Handles some special cases, like alloca() calls, which must be resolved
1757 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1758 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1761 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1763 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1764 assert(currently_reachable());
1766 expression_t *function = call->function;
1767 ir_node *callee = NULL;
1768 bool firm_builtin = false;
1769 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1770 if (function->kind == EXPR_REFERENCE) {
1771 const reference_expression_t *ref = &function->reference;
1772 entity_t *entity = ref->entity;
1774 if (entity->kind == ENTITY_FUNCTION) {
1775 builtin_kind_t builtin = entity->function.btk;
1776 if (builtin == BUILTIN_FIRM) {
1777 firm_builtin = true;
1778 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1779 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1780 && builtin != BUILTIN_LIBC_CHECK) {
1781 return process_builtin_call(call);
1786 callee = expression_to_firm(function);
1788 type_t *type = skip_typeref(function->base.type);
1789 assert(is_type_pointer(type));
1790 pointer_type_t *pointer_type = &type->pointer;
1791 type_t *points_to = skip_typeref(pointer_type->points_to);
1792 assert(is_type_function(points_to));
1793 function_type_t *function_type = &points_to->function;
1795 int n_parameters = 0;
1796 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1797 ir_type *new_method_type = NULL;
1798 if (function_type->variadic || function_type->unspecified_parameters) {
1799 const call_argument_t *argument = call->arguments;
1800 for ( ; argument != NULL; argument = argument->next) {
1804 /* we need to construct a new method type matching the call
1806 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1807 int n_res = get_method_n_ress(ir_method_type);
1808 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1809 set_method_calling_convention(new_method_type,
1810 get_method_calling_convention(ir_method_type));
1811 set_method_additional_properties(new_method_type,
1812 get_method_additional_properties(ir_method_type));
1813 set_method_variadicity(new_method_type,
1814 get_method_variadicity(ir_method_type));
1816 for (int i = 0; i < n_res; ++i) {
1817 set_method_res_type(new_method_type, i,
1818 get_method_res_type(ir_method_type, i));
1820 argument = call->arguments;
1821 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1822 expression_t *expression = argument->expression;
1823 ir_type *irtype = get_ir_type(expression->base.type);
1824 set_method_param_type(new_method_type, i, irtype);
1826 ir_method_type = new_method_type;
1828 n_parameters = get_method_n_params(ir_method_type);
1831 ir_node *in[n_parameters];
1833 const call_argument_t *argument = call->arguments;
1834 for (int n = 0; n < n_parameters; ++n) {
1835 expression_t *expression = argument->expression;
1836 ir_node *arg_node = expression_to_firm(expression);
1838 type_t *arg_type = skip_typeref(expression->base.type);
1839 if (!is_type_compound(arg_type)) {
1840 ir_mode *mode = get_ir_mode_storage(expression->base.type);
1841 arg_node = create_conv(dbgi, arg_node, mode);
1842 arg_node = do_strict_conv(dbgi, arg_node);
1847 argument = argument->next;
1851 if (function_type->modifiers & DM_CONST) {
1852 store = get_irg_no_mem(current_ir_graph);
1854 store = get_store();
1858 type_t *return_type = skip_typeref(function_type->return_type);
1859 ir_node *result = NULL;
1861 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1863 if (! (function_type->modifiers & DM_CONST)) {
1864 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1868 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1869 assert(is_type_scalar(return_type));
1870 ir_mode *mode = get_ir_mode_storage(return_type);
1871 result = new_Proj(node, mode, pn_Builtin_1_result);
1872 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1873 result = create_conv(NULL, result, mode_arith);
1876 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1877 if (! (function_type->modifiers & DM_CONST)) {
1878 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1882 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1883 ir_node *resproj = new_Proj(node, mode_T, pn_Call_T_result);
1885 if (is_type_scalar(return_type)) {
1886 ir_mode *mode = get_ir_mode_storage(return_type);
1887 result = new_Proj(resproj, mode, 0);
1888 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1889 result = create_conv(NULL, result, mode_arith);
1891 ir_mode *mode = mode_P_data;
1892 result = new_Proj(resproj, mode, 0);
1897 if (function->kind == EXPR_REFERENCE &&
1898 function->reference.entity->declaration.modifiers & DM_NORETURN) {
1899 /* A dead end: Keep the Call and the Block. Also place all further
1900 * nodes into a new and unreachable block. */
1902 keep_alive(get_cur_block());
1903 ir_node *block = new_Block(0, NULL);
1904 set_cur_block(block);
1910 static void statement_to_firm(statement_t *statement);
1911 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1913 static ir_node *expression_to_addr(const expression_t *expression);
1914 static ir_node *create_condition_evaluation(const expression_t *expression,
1915 ir_node *true_block,
1916 ir_node *false_block);
1918 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1921 if (!is_type_compound(type)) {
1922 ir_mode *mode = get_ir_mode_storage(type);
1923 value = create_conv(dbgi, value, mode);
1924 value = do_strict_conv(dbgi, value);
1927 ir_node *memory = get_store();
1929 if (is_type_scalar(type)) {
1930 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1931 ? cons_volatile : cons_none;
1932 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1933 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1934 set_store(store_mem);
1936 ir_type *irtype = get_ir_type(type);
1937 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1938 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1939 set_store(copyb_mem);
1943 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1945 ir_tarval *all_one = get_mode_all_one(mode);
1946 int mode_size = get_mode_size_bits(mode);
1948 assert(offset >= 0);
1950 assert(offset + size <= mode_size);
1951 if (size == mode_size) {
1955 long shiftr = get_mode_size_bits(mode) - size;
1956 long shiftl = offset;
1957 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1958 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1959 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1960 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1965 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1966 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile)
1968 ir_type *entity_type = get_entity_type(entity);
1969 ir_type *base_type = get_primitive_base_type(entity_type);
1970 assert(base_type != NULL);
1971 ir_mode *mode = get_type_mode(base_type);
1973 value = create_conv(dbgi, value, mode);
1975 /* kill upper bits of value and shift to right position */
1976 int bitoffset = get_entity_offset_bits_remainder(entity);
1977 int bitsize = get_mode_size_bits(get_type_mode(entity_type));
1978 ir_tarval *mask = create_bitfield_mask(mode, 0, bitsize);
1979 ir_node *mask_node = new_d_Const(dbgi, mask);
1980 ir_node *value_masked = new_d_And(dbgi, value, mask_node, mode);
1981 ir_tarval *shiftl = new_tarval_from_long(bitoffset, mode_uint);
1982 ir_node *shiftcount = new_d_Const(dbgi, shiftl);
1983 ir_node *value_maskshift = new_d_Shl(dbgi, value_masked, shiftcount, mode);
1985 /* load current value */
1986 ir_node *mem = get_store();
1987 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
1988 set_volatile ? cons_volatile : cons_none);
1989 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1990 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1991 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
1992 ir_tarval *inv_mask = tarval_not(shift_mask);
1993 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
1994 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
1996 /* construct new value and store */
1997 ir_node *new_val = new_d_Or(dbgi, load_res_masked, value_maskshift, mode);
1998 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
1999 set_volatile ? cons_volatile : cons_none);
2000 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2001 set_store(store_mem);
2003 return value_masked;
2006 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2009 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2010 entity_t *entity = expression->compound_entry;
2011 type_t *base_type = entity->declaration.type;
2012 ir_mode *mode = get_ir_mode_storage(base_type);
2013 ir_node *mem = get_store();
2014 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2015 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2016 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2018 ir_mode *amode = mode;
2019 /* optimisation, since shifting in modes < machine_size is usually
2021 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2024 unsigned amode_size = get_mode_size_bits(amode);
2025 load_res = create_conv(dbgi, load_res, amode);
2027 set_store(load_mem);
2029 /* kill upper bits */
2030 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2031 int bitoffset = entity->compound_member.bit_offset;
2032 int bitsize = entity->compound_member.bit_size;
2033 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2034 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2035 ir_node *countl = new_d_Const(dbgi, tvl);
2036 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2038 unsigned shift_bitsr = bitoffset + shift_bitsl;
2039 assert(shift_bitsr <= amode_size);
2040 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2041 ir_node *countr = new_d_Const(dbgi, tvr);
2043 if (mode_is_signed(mode)) {
2044 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2046 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2049 type_t *type = expression->base.type;
2050 ir_mode *resmode = get_ir_mode_arithmetic(type);
2051 return create_conv(dbgi, shiftr, resmode);
2054 /* make sure the selected compound type is constructed */
2055 static void construct_select_compound(const select_expression_t *expression)
2057 type_t *type = skip_typeref(expression->compound->base.type);
2058 if (is_type_pointer(type)) {
2059 type = type->pointer.points_to;
2061 (void) get_ir_type(type);
2064 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2065 ir_node *value, ir_node *addr)
2067 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2068 type_t *type = skip_typeref(expression->base.type);
2070 if (!is_type_compound(type)) {
2071 ir_mode *mode = get_ir_mode_storage(type);
2072 value = create_conv(dbgi, value, mode);
2073 value = do_strict_conv(dbgi, value);
2076 if (expression->kind == EXPR_REFERENCE) {
2077 const reference_expression_t *ref = &expression->reference;
2079 entity_t *entity = ref->entity;
2080 assert(is_declaration(entity));
2081 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2082 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2083 set_value(entity->variable.v.value_number, value);
2085 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2086 set_value(entity->parameter.v.value_number, value);
2092 addr = expression_to_addr(expression);
2093 assert(addr != NULL);
2095 if (expression->kind == EXPR_SELECT) {
2096 const select_expression_t *select = &expression->select;
2098 construct_select_compound(select);
2100 entity_t *entity = select->compound_entry;
2101 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2102 if (entity->compound_member.bitfield) {
2103 ir_entity *irentity = entity->compound_member.entity;
2105 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2106 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2112 assign_value(dbgi, addr, type, value);
2116 static void set_value_for_expression(const expression_t *expression,
2119 set_value_for_expression_addr(expression, value, NULL);
2122 static ir_node *get_value_from_lvalue(const expression_t *expression,
2125 if (expression->kind == EXPR_REFERENCE) {
2126 const reference_expression_t *ref = &expression->reference;
2128 entity_t *entity = ref->entity;
2129 assert(entity->kind == ENTITY_VARIABLE
2130 || entity->kind == ENTITY_PARAMETER);
2131 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2133 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2134 value_number = entity->variable.v.value_number;
2135 assert(addr == NULL);
2136 type_t *type = skip_typeref(expression->base.type);
2137 ir_mode *mode = get_ir_mode_storage(type);
2138 ir_node *res = get_value(value_number, mode);
2139 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2140 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2141 value_number = entity->parameter.v.value_number;
2142 assert(addr == NULL);
2143 type_t *type = skip_typeref(expression->base.type);
2144 ir_mode *mode = get_ir_mode_storage(type);
2145 ir_node *res = get_value(value_number, mode);
2146 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2150 assert(addr != NULL);
2151 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2154 if (expression->kind == EXPR_SELECT &&
2155 expression->select.compound_entry->compound_member.bitfield) {
2156 construct_select_compound(&expression->select);
2157 value = bitfield_extract_to_firm(&expression->select, addr);
2159 value = deref_address(dbgi, expression->base.type, addr);
2166 static ir_node *create_incdec(const unary_expression_t *expression)
2168 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2169 const expression_t *value_expr = expression->value;
2170 ir_node *addr = expression_to_addr(value_expr);
2171 ir_node *value = get_value_from_lvalue(value_expr, addr);
2173 type_t *type = skip_typeref(expression->base.type);
2174 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2177 if (is_type_pointer(type)) {
2178 pointer_type_t *pointer_type = &type->pointer;
2179 offset = get_type_size_node(pointer_type->points_to);
2181 assert(is_type_arithmetic(type));
2182 offset = new_Const(get_mode_one(mode));
2186 ir_node *store_value;
2187 switch(expression->base.kind) {
2188 case EXPR_UNARY_POSTFIX_INCREMENT:
2190 store_value = new_d_Add(dbgi, value, offset, mode);
2192 case EXPR_UNARY_POSTFIX_DECREMENT:
2194 store_value = new_d_Sub(dbgi, value, offset, mode);
2196 case EXPR_UNARY_PREFIX_INCREMENT:
2197 result = new_d_Add(dbgi, value, offset, mode);
2198 store_value = result;
2200 case EXPR_UNARY_PREFIX_DECREMENT:
2201 result = new_d_Sub(dbgi, value, offset, mode);
2202 store_value = result;
2205 panic("no incdec expr in create_incdec");
2208 set_value_for_expression_addr(value_expr, store_value, addr);
2213 static bool is_local_variable(expression_t *expression)
2215 if (expression->kind != EXPR_REFERENCE)
2217 reference_expression_t *ref_expr = &expression->reference;
2218 entity_t *entity = ref_expr->entity;
2219 if (entity->kind != ENTITY_VARIABLE)
2221 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2222 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2225 static ir_relation get_relation(const expression_kind_t kind)
2228 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2229 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2230 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2231 case EXPR_BINARY_ISLESS:
2232 case EXPR_BINARY_LESS: return ir_relation_less;
2233 case EXPR_BINARY_ISLESSEQUAL:
2234 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2235 case EXPR_BINARY_ISGREATER:
2236 case EXPR_BINARY_GREATER: return ir_relation_greater;
2237 case EXPR_BINARY_ISGREATEREQUAL:
2238 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2239 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2244 panic("trying to get pn_Cmp from non-comparison binexpr type");
2248 * Handle the assume optimizer hint: check if a Confirm
2249 * node can be created.
2251 * @param dbi debug info
2252 * @param expr the IL assume expression
2254 * we support here only some simple cases:
2259 static ir_node *handle_assume_compare(dbg_info *dbi,
2260 const binary_expression_t *expression)
2262 expression_t *op1 = expression->left;
2263 expression_t *op2 = expression->right;
2264 entity_t *var2, *var = NULL;
2265 ir_node *res = NULL;
2266 ir_relation relation = get_relation(expression->base.kind);
2268 if (is_local_variable(op1) && is_local_variable(op2)) {
2269 var = op1->reference.entity;
2270 var2 = op2->reference.entity;
2272 type_t *const type = skip_typeref(var->declaration.type);
2273 ir_mode *const mode = get_ir_mode_storage(type);
2275 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2276 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2278 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2279 set_value(var2->variable.v.value_number, res);
2281 res = new_d_Confirm(dbi, irn1, irn2, relation);
2282 set_value(var->variable.v.value_number, res);
2287 expression_t *con = NULL;
2288 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2289 var = op1->reference.entity;
2291 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2292 relation = get_inversed_relation(relation);
2293 var = op2->reference.entity;
2298 type_t *const type = skip_typeref(var->declaration.type);
2299 ir_mode *const mode = get_ir_mode_storage(type);
2301 res = get_value(var->variable.v.value_number, mode);
2302 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2303 set_value(var->variable.v.value_number, res);
2309 * Handle the assume optimizer hint.
2311 * @param dbi debug info
2312 * @param expr the IL assume expression
2314 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2316 switch(expression->kind) {
2317 case EXPR_BINARY_EQUAL:
2318 case EXPR_BINARY_NOTEQUAL:
2319 case EXPR_BINARY_LESS:
2320 case EXPR_BINARY_LESSEQUAL:
2321 case EXPR_BINARY_GREATER:
2322 case EXPR_BINARY_GREATEREQUAL:
2323 return handle_assume_compare(dbi, &expression->binary);
2329 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2330 type_t *from_type, type_t *type)
2332 type = skip_typeref(type);
2333 if (type == type_void) {
2334 /* make sure firm type is constructed */
2335 (void) get_ir_type(type);
2338 if (!is_type_scalar(type)) {
2339 /* make sure firm type is constructed */
2340 (void) get_ir_type(type);
2344 from_type = skip_typeref(from_type);
2345 ir_mode *mode = get_ir_mode_storage(type);
2346 /* check for conversion from / to __based types */
2347 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2348 const variable_t *from_var = from_type->pointer.base_variable;
2349 const variable_t *to_var = type->pointer.base_variable;
2350 if (from_var != to_var) {
2351 if (from_var != NULL) {
2352 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2353 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2354 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2356 if (to_var != NULL) {
2357 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2358 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2359 value_node = new_d_Sub(dbgi, value_node, base, mode);
2364 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2365 /* bool adjustments (we save a mode_Bu, but have to temporarily
2366 * convert to mode_b so we only get a 0/1 value */
2367 value_node = create_conv(dbgi, value_node, mode_b);
2370 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2371 ir_node *node = create_conv(dbgi, value_node, mode);
2372 node = do_strict_conv(dbgi, node);
2373 node = create_conv(dbgi, node, mode_arith);
2378 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2380 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2381 type_t *type = skip_typeref(expression->base.type);
2383 if (expression->base.kind == EXPR_UNARY_TAKE_ADDRESS)
2384 return expression_to_addr(expression->value);
2386 const expression_t *value = expression->value;
2388 switch(expression->base.kind) {
2389 case EXPR_UNARY_NEGATE: {
2390 ir_node *value_node = expression_to_firm(value);
2391 ir_mode *mode = get_ir_mode_arithmetic(type);
2392 return new_d_Minus(dbgi, value_node, mode);
2394 case EXPR_UNARY_PLUS:
2395 return expression_to_firm(value);
2396 case EXPR_UNARY_BITWISE_NEGATE: {
2397 ir_node *value_node = expression_to_firm(value);
2398 ir_mode *mode = get_ir_mode_arithmetic(type);
2399 return new_d_Not(dbgi, value_node, mode);
2401 case EXPR_UNARY_NOT: {
2402 ir_node *value_node = _expression_to_firm(value);
2403 value_node = create_conv(dbgi, value_node, mode_b);
2404 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2407 case EXPR_UNARY_DEREFERENCE: {
2408 ir_node *value_node = expression_to_firm(value);
2409 type_t *value_type = skip_typeref(value->base.type);
2410 assert(is_type_pointer(value_type));
2412 /* check for __based */
2413 const variable_t *const base_var = value_type->pointer.base_variable;
2414 if (base_var != NULL) {
2415 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2416 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2417 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2419 type_t *points_to = value_type->pointer.points_to;
2420 return deref_address(dbgi, points_to, value_node);
2422 case EXPR_UNARY_POSTFIX_INCREMENT:
2423 case EXPR_UNARY_POSTFIX_DECREMENT:
2424 case EXPR_UNARY_PREFIX_INCREMENT:
2425 case EXPR_UNARY_PREFIX_DECREMENT:
2426 return create_incdec(expression);
2427 case EXPR_UNARY_CAST: {
2428 ir_node *value_node = expression_to_firm(value);
2429 type_t *from_type = value->base.type;
2430 return create_cast(dbgi, value_node, from_type, type);
2432 case EXPR_UNARY_ASSUME:
2433 return handle_assume(dbgi, value);
2438 panic("invalid UNEXPR type found");
2442 * produces a 0/1 depending of the value of a mode_b node
2444 static ir_node *produce_condition_result(const expression_t *expression,
2445 ir_mode *mode, dbg_info *dbgi)
2447 ir_node *const one_block = new_immBlock();
2448 ir_node *const zero_block = new_immBlock();
2449 create_condition_evaluation(expression, one_block, zero_block);
2450 mature_immBlock(one_block);
2451 mature_immBlock(zero_block);
2453 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2454 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2455 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2456 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2457 set_cur_block(block);
2459 ir_node *const one = new_Const(get_mode_one(mode));
2460 ir_node *const zero = new_Const(get_mode_null(mode));
2461 ir_node *const in[2] = { one, zero };
2462 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2467 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2468 ir_node *value, type_t *type)
2470 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2471 assert(is_type_pointer(type));
2472 pointer_type_t *const pointer_type = &type->pointer;
2473 type_t *const points_to = skip_typeref(pointer_type->points_to);
2474 ir_node * elem_size = get_type_size_node(points_to);
2475 elem_size = create_conv(dbgi, elem_size, mode);
2476 value = create_conv(dbgi, value, mode);
2477 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2481 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2482 ir_node *left, ir_node *right)
2485 type_t *type_left = skip_typeref(expression->left->base.type);
2486 type_t *type_right = skip_typeref(expression->right->base.type);
2488 expression_kind_t kind = expression->base.kind;
2491 case EXPR_BINARY_SHIFTLEFT:
2492 case EXPR_BINARY_SHIFTRIGHT:
2493 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2494 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2495 mode = get_ir_mode_arithmetic(expression->base.type);
2496 right = create_conv(dbgi, right, mode_uint);
2499 case EXPR_BINARY_SUB:
2500 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2501 const pointer_type_t *const ptr_type = &type_left->pointer;
2503 mode = get_ir_mode_arithmetic(expression->base.type);
2504 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2505 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2506 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2507 ir_node *const no_mem = new_NoMem();
2508 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2509 mode, op_pin_state_floats);
2510 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2513 case EXPR_BINARY_SUB_ASSIGN:
2514 if (is_type_pointer(type_left)) {
2515 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2516 mode = get_ir_mode_arithmetic(type_left);
2521 case EXPR_BINARY_ADD:
2522 case EXPR_BINARY_ADD_ASSIGN:
2523 if (is_type_pointer(type_left)) {
2524 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2525 mode = get_ir_mode_arithmetic(type_left);
2527 } else if (is_type_pointer(type_right)) {
2528 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2529 mode = get_ir_mode_arithmetic(type_right);
2536 mode = get_ir_mode_arithmetic(type_right);
2537 left = create_conv(dbgi, left, mode);
2542 case EXPR_BINARY_ADD_ASSIGN:
2543 case EXPR_BINARY_ADD:
2544 return new_d_Add(dbgi, left, right, mode);
2545 case EXPR_BINARY_SUB_ASSIGN:
2546 case EXPR_BINARY_SUB:
2547 return new_d_Sub(dbgi, left, right, mode);
2548 case EXPR_BINARY_MUL_ASSIGN:
2549 case EXPR_BINARY_MUL:
2550 return new_d_Mul(dbgi, left, right, mode);
2551 case EXPR_BINARY_BITWISE_AND:
2552 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2553 return new_d_And(dbgi, left, right, mode);
2554 case EXPR_BINARY_BITWISE_OR:
2555 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2556 return new_d_Or(dbgi, left, right, mode);
2557 case EXPR_BINARY_BITWISE_XOR:
2558 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2559 return new_d_Eor(dbgi, left, right, mode);
2560 case EXPR_BINARY_SHIFTLEFT:
2561 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2562 return new_d_Shl(dbgi, left, right, mode);
2563 case EXPR_BINARY_SHIFTRIGHT:
2564 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2565 if (mode_is_signed(mode)) {
2566 return new_d_Shrs(dbgi, left, right, mode);
2568 return new_d_Shr(dbgi, left, right, mode);
2570 case EXPR_BINARY_DIV:
2571 case EXPR_BINARY_DIV_ASSIGN: {
2572 ir_node *pin = new_Pin(new_NoMem());
2573 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2574 op_pin_state_floats);
2575 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2578 case EXPR_BINARY_MOD:
2579 case EXPR_BINARY_MOD_ASSIGN: {
2580 ir_node *pin = new_Pin(new_NoMem());
2581 assert(!mode_is_float(mode));
2582 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2583 op_pin_state_floats);
2584 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2588 panic("unexpected expression kind");
2592 static ir_node *create_lazy_op(const binary_expression_t *expression)
2594 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2595 type_t *type = skip_typeref(expression->base.type);
2596 ir_mode *mode = get_ir_mode_arithmetic(type);
2598 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2599 bool val = fold_constant_to_bool(expression->left);
2600 expression_kind_t ekind = expression->base.kind;
2601 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2602 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2604 return new_Const(get_mode_null(mode));
2608 return new_Const(get_mode_one(mode));
2612 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2613 bool valr = fold_constant_to_bool(expression->right);
2614 return create_Const_from_bool(mode, valr);
2617 return produce_condition_result(expression->right, mode, dbgi);
2620 return produce_condition_result((const expression_t*) expression, mode,
2624 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2625 ir_node *right, ir_mode *mode);
2627 static ir_node *create_assign_binop(const binary_expression_t *expression)
2629 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2630 const expression_t *left_expr = expression->left;
2631 type_t *type = skip_typeref(left_expr->base.type);
2632 ir_node *right = expression_to_firm(expression->right);
2633 ir_node *left_addr = expression_to_addr(left_expr);
2634 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2635 ir_node *result = create_op(dbgi, expression, left, right);
2637 result = create_cast(dbgi, result, expression->right->base.type, type);
2638 result = do_strict_conv(dbgi, result);
2640 result = set_value_for_expression_addr(left_expr, result, left_addr);
2642 if (!is_type_compound(type)) {
2643 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2644 result = create_conv(dbgi, result, mode_arithmetic);
2649 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2651 expression_kind_t kind = expression->base.kind;
2654 case EXPR_BINARY_EQUAL:
2655 case EXPR_BINARY_NOTEQUAL:
2656 case EXPR_BINARY_LESS:
2657 case EXPR_BINARY_LESSEQUAL:
2658 case EXPR_BINARY_GREATER:
2659 case EXPR_BINARY_GREATEREQUAL:
2660 case EXPR_BINARY_ISGREATER:
2661 case EXPR_BINARY_ISGREATEREQUAL:
2662 case EXPR_BINARY_ISLESS:
2663 case EXPR_BINARY_ISLESSEQUAL:
2664 case EXPR_BINARY_ISLESSGREATER:
2665 case EXPR_BINARY_ISUNORDERED: {
2666 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2667 ir_node *left = expression_to_firm(expression->left);
2668 ir_node *right = expression_to_firm(expression->right);
2669 ir_relation relation = get_relation(kind);
2670 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2673 case EXPR_BINARY_ASSIGN: {
2674 ir_node *addr = expression_to_addr(expression->left);
2675 ir_node *right = expression_to_firm(expression->right);
2677 = set_value_for_expression_addr(expression->left, right, addr);
2679 type_t *type = skip_typeref(expression->base.type);
2680 if (!is_type_compound(type)) {
2681 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2682 res = create_conv(NULL, res, mode_arithmetic);
2686 case EXPR_BINARY_ADD:
2687 case EXPR_BINARY_SUB:
2688 case EXPR_BINARY_MUL:
2689 case EXPR_BINARY_DIV:
2690 case EXPR_BINARY_MOD:
2691 case EXPR_BINARY_BITWISE_AND:
2692 case EXPR_BINARY_BITWISE_OR:
2693 case EXPR_BINARY_BITWISE_XOR:
2694 case EXPR_BINARY_SHIFTLEFT:
2695 case EXPR_BINARY_SHIFTRIGHT:
2697 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2698 ir_node *left = expression_to_firm(expression->left);
2699 ir_node *right = expression_to_firm(expression->right);
2700 return create_op(dbgi, expression, left, right);
2702 case EXPR_BINARY_LOGICAL_AND:
2703 case EXPR_BINARY_LOGICAL_OR:
2704 return create_lazy_op(expression);
2705 case EXPR_BINARY_COMMA:
2706 /* create side effects of left side */
2707 (void) expression_to_firm(expression->left);
2708 return _expression_to_firm(expression->right);
2710 case EXPR_BINARY_ADD_ASSIGN:
2711 case EXPR_BINARY_SUB_ASSIGN:
2712 case EXPR_BINARY_MUL_ASSIGN:
2713 case EXPR_BINARY_MOD_ASSIGN:
2714 case EXPR_BINARY_DIV_ASSIGN:
2715 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2716 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2717 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2718 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2719 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2720 return create_assign_binop(expression);
2722 panic("TODO binexpr type");
2726 static ir_node *array_access_addr(const array_access_expression_t *expression)
2728 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2729 ir_node *base_addr = expression_to_firm(expression->array_ref);
2730 ir_node *offset = expression_to_firm(expression->index);
2731 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2732 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2733 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2738 static ir_node *array_access_to_firm(
2739 const array_access_expression_t *expression)
2741 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2742 ir_node *addr = array_access_addr(expression);
2743 type_t *type = revert_automatic_type_conversion(
2744 (const expression_t*) expression);
2745 type = skip_typeref(type);
2747 return deref_address(dbgi, type, addr);
2750 static long get_offsetof_offset(const offsetof_expression_t *expression)
2752 type_t *orig_type = expression->type;
2755 designator_t *designator = expression->designator;
2756 for ( ; designator != NULL; designator = designator->next) {
2757 type_t *type = skip_typeref(orig_type);
2758 /* be sure the type is constructed */
2759 (void) get_ir_type(type);
2761 if (designator->symbol != NULL) {
2762 assert(is_type_compound(type));
2763 symbol_t *symbol = designator->symbol;
2765 compound_t *compound = type->compound.compound;
2766 entity_t *iter = compound->members.entities;
2767 for ( ; iter != NULL; iter = iter->base.next) {
2768 if (iter->base.symbol == symbol) {
2772 assert(iter != NULL);
2774 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2775 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2776 offset += get_entity_offset(iter->compound_member.entity);
2778 orig_type = iter->declaration.type;
2780 expression_t *array_index = designator->array_index;
2781 assert(designator->array_index != NULL);
2782 assert(is_type_array(type));
2784 long index = fold_constant_to_int(array_index);
2785 ir_type *arr_type = get_ir_type(type);
2786 ir_type *elem_type = get_array_element_type(arr_type);
2787 long elem_size = get_type_size_bytes(elem_type);
2789 offset += index * elem_size;
2791 orig_type = type->array.element_type;
2798 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2800 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2801 long offset = get_offsetof_offset(expression);
2802 ir_tarval *tv = new_tarval_from_long(offset, mode);
2803 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2805 return new_d_Const(dbgi, tv);
2808 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2809 ir_entity *entity, type_t *type);
2811 static ir_node *compound_literal_to_firm(
2812 const compound_literal_expression_t *expression)
2814 type_t *type = expression->type;
2816 /* create an entity on the stack */
2817 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2819 ident *const id = id_unique("CompLit.%u");
2820 ir_type *const irtype = get_ir_type(type);
2821 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2822 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2823 set_entity_ld_ident(entity, id);
2825 /* create initialisation code */
2826 initializer_t *initializer = expression->initializer;
2827 create_local_initializer(initializer, dbgi, entity, type);
2829 /* create a sel for the compound literal address */
2830 ir_node *frame = get_irg_frame(current_ir_graph);
2831 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2836 * Transform a sizeof expression into Firm code.
2838 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2840 type_t *const type = skip_typeref(expression->type);
2841 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2842 if (is_type_array(type) && type->array.is_vla
2843 && expression->tp_expression != NULL) {
2844 expression_to_firm(expression->tp_expression);
2846 /* strange gnu extensions: sizeof(function) == 1 */
2847 if (is_type_function(type)) {
2848 ir_mode *mode = get_ir_mode_storage(type_size_t);
2849 return new_Const(get_mode_one(mode));
2852 return get_type_size_node(type);
2855 static entity_t *get_expression_entity(const expression_t *expression)
2857 if (expression->kind != EXPR_REFERENCE)
2860 return expression->reference.entity;
2863 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2865 switch(entity->kind) {
2866 DECLARATION_KIND_CASES
2867 return entity->declaration.alignment;
2870 return entity->compound.alignment;
2871 case ENTITY_TYPEDEF:
2872 return entity->typedefe.alignment;
2880 * Transform an alignof expression into Firm code.
2882 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2884 unsigned alignment = 0;
2886 const expression_t *tp_expression = expression->tp_expression;
2887 if (tp_expression != NULL) {
2888 entity_t *entity = get_expression_entity(tp_expression);
2889 if (entity != NULL) {
2890 if (entity->kind == ENTITY_FUNCTION) {
2891 /* a gnu-extension */
2894 alignment = get_cparser_entity_alignment(entity);
2899 if (alignment == 0) {
2900 type_t *type = expression->type;
2901 alignment = get_type_alignment(type);
2904 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2905 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2906 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2907 return new_d_Const(dbgi, tv);
2910 static void init_ir_types(void);
2912 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2914 assert(is_type_valid(skip_typeref(expression->base.type)));
2916 bool constant_folding_old = constant_folding;
2917 constant_folding = true;
2921 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2923 ir_graph *old_current_ir_graph = current_ir_graph;
2924 current_ir_graph = get_const_code_irg();
2926 ir_node *cnst = expression_to_firm(expression);
2927 current_ir_graph = old_current_ir_graph;
2929 if (!is_Const(cnst)) {
2930 panic("couldn't fold constant");
2933 constant_folding = constant_folding_old;
2935 return get_Const_tarval(cnst);
2938 /* this function is only used in parser.c, but it relies on libfirm functionality */
2939 bool constant_is_negative(const expression_t *expression)
2941 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2942 ir_tarval *tv = fold_constant_to_tarval(expression);
2943 return tarval_is_negative(tv);
2946 long fold_constant_to_int(const expression_t *expression)
2948 if (expression->kind == EXPR_ERROR)
2951 ir_tarval *tv = fold_constant_to_tarval(expression);
2952 if (!tarval_is_long(tv)) {
2953 panic("result of constant folding is not integer");
2956 return get_tarval_long(tv);
2959 bool fold_constant_to_bool(const expression_t *expression)
2961 if (expression->kind == EXPR_ERROR)
2963 ir_tarval *tv = fold_constant_to_tarval(expression);
2964 return !tarval_is_null(tv);
2967 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2969 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2971 /* first try to fold a constant condition */
2972 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
2973 bool val = fold_constant_to_bool(expression->condition);
2975 expression_t *true_expression = expression->true_expression;
2976 if (true_expression == NULL)
2977 true_expression = expression->condition;
2978 return expression_to_firm(true_expression);
2980 return expression_to_firm(expression->false_expression);
2984 ir_node *const true_block = new_immBlock();
2985 ir_node *const false_block = new_immBlock();
2986 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
2987 mature_immBlock(true_block);
2988 mature_immBlock(false_block);
2990 set_cur_block(true_block);
2992 if (expression->true_expression != NULL) {
2993 true_val = expression_to_firm(expression->true_expression);
2994 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
2995 true_val = cond_expr;
2997 /* Condition ended with a short circuit (&&, ||, !) operation or a
2998 * comparison. Generate a "1" as value for the true branch. */
2999 true_val = new_Const(get_mode_one(mode_Is));
3001 ir_node *const true_jmp = new_d_Jmp(dbgi);
3003 set_cur_block(false_block);
3004 ir_node *const false_val = expression_to_firm(expression->false_expression);
3005 ir_node *const false_jmp = new_d_Jmp(dbgi);
3007 /* create the common block */
3008 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3009 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3010 set_cur_block(block);
3012 /* TODO improve static semantics, so either both or no values are NULL */
3013 if (true_val == NULL || false_val == NULL)
3016 ir_node *const in[2] = { true_val, false_val };
3017 type_t *const type = skip_typeref(expression->base.type);
3019 if (is_type_compound(type)) {
3022 mode = get_ir_mode_arithmetic(type);
3024 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3030 * Returns an IR-node representing the address of a field.
3032 static ir_node *select_addr(const select_expression_t *expression)
3034 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3036 construct_select_compound(expression);
3038 ir_node *compound_addr = expression_to_firm(expression->compound);
3040 entity_t *entry = expression->compound_entry;
3041 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3042 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3044 if (constant_folding) {
3045 ir_mode *mode = get_irn_mode(compound_addr);
3046 /* FIXME: here, we need an integer mode with the same number of bits as mode */
3047 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3048 return new_d_Add(dbgi, compound_addr, ofs, mode);
3050 ir_entity *irentity = entry->compound_member.entity;
3051 assert(irentity != NULL);
3052 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3056 static ir_node *select_to_firm(const select_expression_t *expression)
3058 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3059 ir_node *addr = select_addr(expression);
3060 type_t *type = revert_automatic_type_conversion(
3061 (const expression_t*) expression);
3062 type = skip_typeref(type);
3064 entity_t *entry = expression->compound_entry;
3065 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3067 if (entry->compound_member.bitfield) {
3068 return bitfield_extract_to_firm(expression, addr);
3071 return deref_address(dbgi, type, addr);
3074 /* Values returned by __builtin_classify_type. */
3075 typedef enum gcc_type_class
3081 enumeral_type_class,
3084 reference_type_class,
3088 function_type_class,
3099 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3101 type_t *type = expr->type_expression->base.type;
3103 /* FIXME gcc returns different values depending on whether compiling C or C++
3104 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3107 type = skip_typeref(type);
3108 switch (type->kind) {
3110 const atomic_type_t *const atomic_type = &type->atomic;
3111 switch (atomic_type->akind) {
3112 /* should not be reached */
3113 case ATOMIC_TYPE_INVALID:
3117 /* gcc cannot do that */
3118 case ATOMIC_TYPE_VOID:
3119 tc = void_type_class;
3122 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3123 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3124 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3125 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3126 case ATOMIC_TYPE_SHORT:
3127 case ATOMIC_TYPE_USHORT:
3128 case ATOMIC_TYPE_INT:
3129 case ATOMIC_TYPE_UINT:
3130 case ATOMIC_TYPE_LONG:
3131 case ATOMIC_TYPE_ULONG:
3132 case ATOMIC_TYPE_LONGLONG:
3133 case ATOMIC_TYPE_ULONGLONG:
3134 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3135 tc = integer_type_class;
3138 case ATOMIC_TYPE_FLOAT:
3139 case ATOMIC_TYPE_DOUBLE:
3140 case ATOMIC_TYPE_LONG_DOUBLE:
3141 tc = real_type_class;
3144 panic("Unexpected atomic type in classify_type_to_firm().");
3147 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3148 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3149 case TYPE_ARRAY: /* gcc handles this as pointer */
3150 case TYPE_FUNCTION: /* gcc handles this as pointer */
3151 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3152 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3153 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3155 /* gcc handles this as integer */
3156 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3158 /* gcc classifies the referenced type */
3159 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3161 /* typedef/typeof should be skipped already */
3167 panic("unexpected TYPE classify_type_to_firm().");
3171 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3172 ir_tarval *const tv = new_tarval_from_long(tc, mode_int);
3173 return new_d_Const(dbgi, tv);
3176 static ir_node *function_name_to_firm(
3177 const funcname_expression_t *const expr)
3179 switch(expr->kind) {
3180 case FUNCNAME_FUNCTION:
3181 case FUNCNAME_PRETTY_FUNCTION:
3182 case FUNCNAME_FUNCDNAME:
3183 if (current_function_name == NULL) {
3184 const source_position_t *const src_pos = &expr->base.source_position;
3185 const char *name = current_function_entity->base.symbol->string;
3186 const string_t string = { name, strlen(name) + 1 };
3187 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3189 return current_function_name;
3190 case FUNCNAME_FUNCSIG:
3191 if (current_funcsig == NULL) {
3192 const source_position_t *const src_pos = &expr->base.source_position;
3193 ir_entity *ent = get_irg_entity(current_ir_graph);
3194 const char *const name = get_entity_ld_name(ent);
3195 const string_t string = { name, strlen(name) + 1 };
3196 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3198 return current_funcsig;
3200 panic("Unsupported function name");
3203 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3205 statement_t *statement = expr->statement;
3207 assert(statement->kind == STATEMENT_COMPOUND);
3208 return compound_statement_to_firm(&statement->compound);
3211 static ir_node *va_start_expression_to_firm(
3212 const va_start_expression_t *const expr)
3214 ir_graph *const irg = current_ir_graph;
3215 type_t *const type = current_function_entity->declaration.type;
3216 ir_type *const method_type = get_ir_type(type);
3217 size_t const n = get_method_n_params(method_type);
3218 ir_type *const frame_type = get_irg_frame_type(irg);
3219 ir_type *const param_type = get_unknown_type();
3220 ir_entity *const param_ent =
3221 new_parameter_entity(frame_type, n, param_type);
3222 ir_node *const frame = get_irg_frame(irg);
3223 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3224 ir_node *const no_mem = new_NoMem();
3225 ir_node *const arg_sel =
3226 new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3228 set_value_for_expression(expr->ap, arg_sel);
3233 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3235 type_t *const type = expr->base.type;
3236 expression_t *const ap_expr = expr->ap;
3237 ir_node *const ap_addr = expression_to_addr(ap_expr);
3238 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3239 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3240 ir_node *const res = deref_address(dbgi, type, ap);
3242 ir_node *const cnst = get_type_size_node(expr->base.type);
3243 ir_mode *const mode = get_irn_mode(cnst);
3244 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3245 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3246 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3247 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3248 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3250 set_value_for_expression_addr(ap_expr, add, ap_addr);
3256 * Generate Firm for a va_copy expression.
3258 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3260 ir_node *const src = expression_to_firm(expr->src);
3261 set_value_for_expression(expr->dst, src);
3265 static ir_node *dereference_addr(const unary_expression_t *const expression)
3267 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3268 return expression_to_firm(expression->value);
3272 * Returns a IR-node representing an lvalue of the given expression.
3274 static ir_node *expression_to_addr(const expression_t *expression)
3276 switch(expression->kind) {
3277 case EXPR_ARRAY_ACCESS:
3278 return array_access_addr(&expression->array_access);
3280 return call_expression_to_firm(&expression->call);
3281 case EXPR_COMPOUND_LITERAL:
3282 return compound_literal_to_firm(&expression->compound_literal);
3283 case EXPR_REFERENCE:
3284 return reference_addr(&expression->reference);
3286 return select_addr(&expression->select);
3287 case EXPR_UNARY_DEREFERENCE:
3288 return dereference_addr(&expression->unary);
3292 panic("trying to get address of non-lvalue");
3295 static ir_node *builtin_constant_to_firm(
3296 const builtin_constant_expression_t *expression)
3298 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3299 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3300 return create_Const_from_bool(mode, v);
3303 static ir_node *builtin_types_compatible_to_firm(
3304 const builtin_types_compatible_expression_t *expression)
3306 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3307 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3308 bool const value = types_compatible(left, right);
3309 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3310 return create_Const_from_bool(mode, value);
3313 static ir_node *get_label_block(label_t *label)
3315 if (label->block != NULL)
3316 return label->block;
3318 /* beware: might be called from create initializer with current_ir_graph
3319 * set to const_code_irg. */
3320 ir_graph *rem = current_ir_graph;
3321 current_ir_graph = current_function;
3323 ir_node *block = new_immBlock();
3325 label->block = block;
3327 ARR_APP1(label_t *, all_labels, label);
3329 current_ir_graph = rem;
3334 * Pointer to a label. This is used for the
3335 * GNU address-of-label extension.
3337 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3339 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3340 ir_node *block = get_label_block(label->label);
3341 ir_entity *entity = create_Block_entity(block);
3343 symconst_symbol value;
3344 value.entity_p = entity;
3345 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3348 static ir_node *error_to_firm(const expression_t *expression)
3350 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3351 return new_Bad(mode);
3355 * creates firm nodes for an expression. The difference between this function
3356 * and expression_to_firm is, that this version might produce mode_b nodes
3357 * instead of mode_Is.
3359 static ir_node *_expression_to_firm(const expression_t *expression)
3362 if (!constant_folding) {
3363 assert(!expression->base.transformed);
3364 ((expression_t*) expression)->base.transformed = true;
3368 switch (expression->kind) {
3370 return literal_to_firm(&expression->literal);
3371 case EXPR_STRING_LITERAL:
3372 return string_to_firm(&expression->base.source_position, "str.%u",
3373 &expression->literal.value);
3374 case EXPR_WIDE_STRING_LITERAL:
3375 return wide_string_literal_to_firm(&expression->string_literal);
3376 case EXPR_REFERENCE:
3377 return reference_expression_to_firm(&expression->reference);
3378 case EXPR_REFERENCE_ENUM_VALUE:
3379 return reference_expression_enum_value_to_firm(&expression->reference);
3381 return call_expression_to_firm(&expression->call);
3383 return unary_expression_to_firm(&expression->unary);
3385 return binary_expression_to_firm(&expression->binary);
3386 case EXPR_ARRAY_ACCESS:
3387 return array_access_to_firm(&expression->array_access);
3389 return sizeof_to_firm(&expression->typeprop);
3391 return alignof_to_firm(&expression->typeprop);
3392 case EXPR_CONDITIONAL:
3393 return conditional_to_firm(&expression->conditional);
3395 return select_to_firm(&expression->select);
3396 case EXPR_CLASSIFY_TYPE:
3397 return classify_type_to_firm(&expression->classify_type);
3399 return function_name_to_firm(&expression->funcname);
3400 case EXPR_STATEMENT:
3401 return statement_expression_to_firm(&expression->statement);
3403 return va_start_expression_to_firm(&expression->va_starte);
3405 return va_arg_expression_to_firm(&expression->va_arge);
3407 return va_copy_expression_to_firm(&expression->va_copye);
3408 case EXPR_BUILTIN_CONSTANT_P:
3409 return builtin_constant_to_firm(&expression->builtin_constant);
3410 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
3411 return builtin_types_compatible_to_firm(&expression->builtin_types_compatible);
3413 return offsetof_to_firm(&expression->offsetofe);
3414 case EXPR_COMPOUND_LITERAL:
3415 return compound_literal_to_firm(&expression->compound_literal);
3416 case EXPR_LABEL_ADDRESS:
3417 return label_address_to_firm(&expression->label_address);
3420 return error_to_firm(expression);
3422 panic("invalid expression found");
3426 * Check if a given expression is a GNU __builtin_expect() call.
3428 static bool is_builtin_expect(const expression_t *expression)
3430 if (expression->kind != EXPR_CALL)
3433 expression_t *function = expression->call.function;
3434 if (function->kind != EXPR_REFERENCE)
3436 reference_expression_t *ref = &function->reference;
3437 if (ref->entity->kind != ENTITY_FUNCTION ||
3438 ref->entity->function.btk != BUILTIN_EXPECT)
3444 static bool produces_mode_b(const expression_t *expression)
3446 switch (expression->kind) {
3447 case EXPR_BINARY_EQUAL:
3448 case EXPR_BINARY_NOTEQUAL:
3449 case EXPR_BINARY_LESS:
3450 case EXPR_BINARY_LESSEQUAL:
3451 case EXPR_BINARY_GREATER:
3452 case EXPR_BINARY_GREATEREQUAL:
3453 case EXPR_BINARY_ISGREATER:
3454 case EXPR_BINARY_ISGREATEREQUAL:
3455 case EXPR_BINARY_ISLESS:
3456 case EXPR_BINARY_ISLESSEQUAL:
3457 case EXPR_BINARY_ISLESSGREATER:
3458 case EXPR_BINARY_ISUNORDERED:
3459 case EXPR_UNARY_NOT:
3463 if (is_builtin_expect(expression)) {
3464 expression_t *argument = expression->call.arguments->expression;
3465 return produces_mode_b(argument);
3468 case EXPR_BINARY_COMMA:
3469 return produces_mode_b(expression->binary.right);
3476 static ir_node *expression_to_firm(const expression_t *expression)
3478 if (!produces_mode_b(expression)) {
3479 ir_node *res = _expression_to_firm(expression);
3480 assert(res == NULL || get_irn_mode(res) != mode_b);
3484 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3485 bool const constant_folding_old = constant_folding;
3486 constant_folding = true;
3487 ir_node *res = _expression_to_firm(expression);
3488 constant_folding = constant_folding_old;
3489 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3490 assert(is_Const(res));
3491 return create_Const_from_bool(mode, !is_Const_null(res));
3494 /* we have to produce a 0/1 from the mode_b expression */
3495 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3496 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3497 return produce_condition_result(expression, mode, dbgi);
3501 * create a short-circuit expression evaluation that tries to construct
3502 * efficient control flow structures for &&, || and ! expressions
3504 static ir_node *create_condition_evaluation(const expression_t *expression,
3505 ir_node *true_block,
3506 ir_node *false_block)
3508 switch(expression->kind) {
3509 case EXPR_UNARY_NOT: {
3510 const unary_expression_t *unary_expression = &expression->unary;
3511 create_condition_evaluation(unary_expression->value, false_block,
3515 case EXPR_BINARY_LOGICAL_AND: {
3516 const binary_expression_t *binary_expression = &expression->binary;
3518 ir_node *extra_block = new_immBlock();
3519 create_condition_evaluation(binary_expression->left, extra_block,
3521 mature_immBlock(extra_block);
3522 set_cur_block(extra_block);
3523 create_condition_evaluation(binary_expression->right, true_block,
3527 case EXPR_BINARY_LOGICAL_OR: {
3528 const binary_expression_t *binary_expression = &expression->binary;
3530 ir_node *extra_block = new_immBlock();
3531 create_condition_evaluation(binary_expression->left, true_block,
3533 mature_immBlock(extra_block);
3534 set_cur_block(extra_block);
3535 create_condition_evaluation(binary_expression->right, true_block,
3543 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3544 ir_node *cond_expr = _expression_to_firm(expression);
3545 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3546 ir_node *cond = new_d_Cond(dbgi, condition);
3547 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3548 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3550 /* set branch prediction info based on __builtin_expect */
3551 if (is_builtin_expect(expression) && is_Cond(cond)) {
3552 call_argument_t *argument = expression->call.arguments->next;
3553 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3554 bool const cnst = fold_constant_to_bool(argument->expression);
3555 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3556 set_Cond_jmp_pred(cond, pred);
3560 add_immBlock_pred(true_block, true_proj);
3561 add_immBlock_pred(false_block, false_proj);
3563 set_unreachable_now();
3567 static void create_variable_entity(entity_t *variable,
3568 declaration_kind_t declaration_kind,
3569 ir_type *parent_type)
3571 assert(variable->kind == ENTITY_VARIABLE);
3572 type_t *type = skip_typeref(variable->declaration.type);
3574 ident *const id = new_id_from_str(variable->base.symbol->string);
3575 ir_type *const irtype = get_ir_type(type);
3576 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3577 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3578 unsigned alignment = variable->declaration.alignment;
3580 set_entity_alignment(irentity, alignment);
3582 handle_decl_modifiers(irentity, variable);
3584 variable->declaration.kind = (unsigned char) declaration_kind;
3585 variable->variable.v.entity = irentity;
3586 set_entity_ld_ident(irentity, create_ld_ident(variable));
3588 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3589 set_entity_volatility(irentity, volatility_is_volatile);
3594 typedef struct type_path_entry_t type_path_entry_t;
3595 struct type_path_entry_t {
3597 ir_initializer_t *initializer;
3599 entity_t *compound_entry;
3602 typedef struct type_path_t type_path_t;
3603 struct type_path_t {
3604 type_path_entry_t *path;
3609 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3611 size_t len = ARR_LEN(path->path);
3613 for (size_t i = 0; i < len; ++i) {
3614 const type_path_entry_t *entry = & path->path[i];
3616 type_t *type = skip_typeref(entry->type);
3617 if (is_type_compound(type)) {
3618 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3619 } else if (is_type_array(type)) {
3620 fprintf(stderr, "[%u]", (unsigned) entry->index);
3622 fprintf(stderr, "-INVALID-");
3625 fprintf(stderr, " (");
3626 print_type(path->top_type);
3627 fprintf(stderr, ")");
3630 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3632 size_t len = ARR_LEN(path->path);
3634 return & path->path[len-1];
3637 static type_path_entry_t *append_to_type_path(type_path_t *path)
3639 size_t len = ARR_LEN(path->path);
3640 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3642 type_path_entry_t *result = & path->path[len];
3643 memset(result, 0, sizeof(result[0]));
3647 static size_t get_compound_member_count(const compound_type_t *type)
3649 compound_t *compound = type->compound;
3650 size_t n_members = 0;
3651 entity_t *member = compound->members.entities;
3652 for ( ; member != NULL; member = member->base.next) {
3659 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3661 type_t *orig_top_type = path->top_type;
3662 type_t *top_type = skip_typeref(orig_top_type);
3664 assert(is_type_compound(top_type) || is_type_array(top_type));
3666 if (ARR_LEN(path->path) == 0) {
3669 type_path_entry_t *top = get_type_path_top(path);
3670 ir_initializer_t *initializer = top->initializer;
3671 return get_initializer_compound_value(initializer, top->index);
3675 static void descend_into_subtype(type_path_t *path)
3677 type_t *orig_top_type = path->top_type;
3678 type_t *top_type = skip_typeref(orig_top_type);
3680 assert(is_type_compound(top_type) || is_type_array(top_type));
3682 ir_initializer_t *initializer = get_initializer_entry(path);
3684 type_path_entry_t *top = append_to_type_path(path);
3685 top->type = top_type;
3689 if (is_type_compound(top_type)) {
3690 compound_t *compound = top_type->compound.compound;
3691 entity_t *entry = compound->members.entities;
3693 top->compound_entry = entry;
3695 len = get_compound_member_count(&top_type->compound);
3696 if (entry != NULL) {
3697 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3698 path->top_type = entry->declaration.type;
3701 assert(is_type_array(top_type));
3702 assert(top_type->array.size > 0);
3705 path->top_type = top_type->array.element_type;
3706 len = top_type->array.size;
3708 if (initializer == NULL
3709 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3710 initializer = create_initializer_compound(len);
3711 /* we have to set the entry at the 2nd latest path entry... */
3712 size_t path_len = ARR_LEN(path->path);
3713 assert(path_len >= 1);
3715 type_path_entry_t *entry = & path->path[path_len-2];
3716 ir_initializer_t *tinitializer = entry->initializer;
3717 set_initializer_compound_value(tinitializer, entry->index,
3721 top->initializer = initializer;
3724 static void ascend_from_subtype(type_path_t *path)
3726 type_path_entry_t *top = get_type_path_top(path);
3728 path->top_type = top->type;
3730 size_t len = ARR_LEN(path->path);
3731 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3734 static void walk_designator(type_path_t *path, const designator_t *designator)
3736 /* designators start at current object type */
3737 ARR_RESIZE(type_path_entry_t, path->path, 1);
3739 for ( ; designator != NULL; designator = designator->next) {
3740 type_path_entry_t *top = get_type_path_top(path);
3741 type_t *orig_type = top->type;
3742 type_t *type = skip_typeref(orig_type);
3744 if (designator->symbol != NULL) {
3745 assert(is_type_compound(type));
3747 symbol_t *symbol = designator->symbol;
3749 compound_t *compound = type->compound.compound;
3750 entity_t *iter = compound->members.entities;
3751 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3752 if (iter->base.symbol == symbol) {
3753 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3757 assert(iter != NULL);
3759 /* revert previous initialisations of other union elements */
3760 if (type->kind == TYPE_COMPOUND_UNION) {
3761 ir_initializer_t *initializer = top->initializer;
3762 if (initializer != NULL
3763 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3764 /* are we writing to a new element? */
3765 ir_initializer_t *oldi
3766 = get_initializer_compound_value(initializer, index);
3767 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3768 /* clear initializer */
3770 = get_initializer_compound_n_entries(initializer);
3771 ir_initializer_t *nulli = get_initializer_null();
3772 for (size_t i = 0; i < len; ++i) {
3773 set_initializer_compound_value(initializer, i,
3780 top->type = orig_type;
3781 top->compound_entry = iter;
3783 orig_type = iter->declaration.type;
3785 expression_t *array_index = designator->array_index;
3786 assert(designator->array_index != NULL);
3787 assert(is_type_array(type));
3789 long index = fold_constant_to_int(array_index);
3792 if (type->array.size_constant) {
3793 long array_size = type->array.size;
3794 assert(index < array_size);
3798 top->type = orig_type;
3799 top->index = (size_t) index;
3800 orig_type = type->array.element_type;
3802 path->top_type = orig_type;
3804 if (designator->next != NULL) {
3805 descend_into_subtype(path);
3809 path->invalid = false;
3812 static void advance_current_object(type_path_t *path)
3814 if (path->invalid) {
3815 /* TODO: handle this... */
3816 panic("invalid initializer in ast2firm (excessive elements)");
3819 type_path_entry_t *top = get_type_path_top(path);
3821 type_t *type = skip_typeref(top->type);
3822 if (is_type_union(type)) {
3823 /* only the first element is initialized in unions */
3824 top->compound_entry = NULL;
3825 } else if (is_type_struct(type)) {
3826 entity_t *entry = top->compound_entry;
3829 entry = entry->base.next;
3830 top->compound_entry = entry;
3831 if (entry != NULL) {
3832 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3833 path->top_type = entry->declaration.type;
3837 assert(is_type_array(type));
3840 if (!type->array.size_constant || top->index < type->array.size) {
3845 /* we're past the last member of the current sub-aggregate, try if we
3846 * can ascend in the type hierarchy and continue with another subobject */
3847 size_t len = ARR_LEN(path->path);
3850 ascend_from_subtype(path);
3851 advance_current_object(path);
3853 path->invalid = true;
3858 static ir_initializer_t *create_ir_initializer(
3859 const initializer_t *initializer, type_t *type);
3861 static ir_initializer_t *create_ir_initializer_value(
3862 const initializer_value_t *initializer)
3864 if (is_type_compound(initializer->value->base.type)) {
3865 panic("initializer creation for compounds not implemented yet");
3867 type_t *type = initializer->value->base.type;
3868 expression_t *expr = initializer->value;
3869 ir_node *value = expression_to_firm(expr);
3870 ir_mode *mode = get_ir_mode_storage(type);
3871 value = create_conv(NULL, value, mode);
3872 return create_initializer_const(value);
3875 /** test wether type can be initialized by a string constant */
3876 static bool is_string_type(type_t *type)
3879 if (is_type_pointer(type)) {
3880 inner = skip_typeref(type->pointer.points_to);
3881 } else if(is_type_array(type)) {
3882 inner = skip_typeref(type->array.element_type);
3887 return is_type_integer(inner);
3890 static ir_initializer_t *create_ir_initializer_list(
3891 const initializer_list_t *initializer, type_t *type)
3894 memset(&path, 0, sizeof(path));
3895 path.top_type = type;
3896 path.path = NEW_ARR_F(type_path_entry_t, 0);
3898 descend_into_subtype(&path);
3900 for (size_t i = 0; i < initializer->len; ++i) {
3901 const initializer_t *sub_initializer = initializer->initializers[i];
3903 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3904 walk_designator(&path, sub_initializer->designator.designator);
3908 if (sub_initializer->kind == INITIALIZER_VALUE) {
3909 /* we might have to descend into types until we're at a scalar
3912 type_t *orig_top_type = path.top_type;
3913 type_t *top_type = skip_typeref(orig_top_type);
3915 if (is_type_scalar(top_type))
3917 descend_into_subtype(&path);
3919 } else if (sub_initializer->kind == INITIALIZER_STRING
3920 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3921 /* we might have to descend into types until we're at a scalar
3924 type_t *orig_top_type = path.top_type;
3925 type_t *top_type = skip_typeref(orig_top_type);
3927 if (is_string_type(top_type))
3929 descend_into_subtype(&path);
3933 ir_initializer_t *sub_irinitializer
3934 = create_ir_initializer(sub_initializer, path.top_type);
3936 size_t path_len = ARR_LEN(path.path);
3937 assert(path_len >= 1);
3938 type_path_entry_t *entry = & path.path[path_len-1];
3939 ir_initializer_t *tinitializer = entry->initializer;
3940 set_initializer_compound_value(tinitializer, entry->index,
3943 advance_current_object(&path);
3946 assert(ARR_LEN(path.path) >= 1);
3947 ir_initializer_t *result = path.path[0].initializer;
3948 DEL_ARR_F(path.path);
3953 static ir_initializer_t *create_ir_initializer_string(
3954 const initializer_string_t *initializer, type_t *type)
3956 type = skip_typeref(type);
3958 size_t string_len = initializer->string.size;
3959 assert(type->kind == TYPE_ARRAY);
3960 assert(type->array.size_constant);
3961 size_t len = type->array.size;
3962 ir_initializer_t *irinitializer = create_initializer_compound(len);
3964 const char *string = initializer->string.begin;
3965 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
3967 for (size_t i = 0; i < len; ++i) {
3972 ir_tarval *tv = new_tarval_from_long(c, mode);
3973 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
3975 set_initializer_compound_value(irinitializer, i, char_initializer);
3978 return irinitializer;
3981 static ir_initializer_t *create_ir_initializer_wide_string(
3982 const initializer_wide_string_t *initializer, type_t *type)
3984 assert(type->kind == TYPE_ARRAY);
3985 assert(type->array.size_constant);
3986 size_t len = type->array.size;
3987 size_t string_len = wstrlen(&initializer->string);
3988 ir_initializer_t *irinitializer = create_initializer_compound(len);
3990 const char *p = initializer->string.begin;
3991 ir_mode *mode = get_type_mode(ir_type_wchar_t);
3993 for (size_t i = 0; i < len; ++i) {
3995 if (i < string_len) {
3996 c = read_utf8_char(&p);
3998 ir_tarval *tv = new_tarval_from_long(c, mode);
3999 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4001 set_initializer_compound_value(irinitializer, i, char_initializer);
4004 return irinitializer;
4007 static ir_initializer_t *create_ir_initializer(
4008 const initializer_t *initializer, type_t *type)
4010 switch(initializer->kind) {
4011 case INITIALIZER_STRING:
4012 return create_ir_initializer_string(&initializer->string, type);
4014 case INITIALIZER_WIDE_STRING:
4015 return create_ir_initializer_wide_string(&initializer->wide_string,
4018 case INITIALIZER_LIST:
4019 return create_ir_initializer_list(&initializer->list, type);
4021 case INITIALIZER_VALUE:
4022 return create_ir_initializer_value(&initializer->value);
4024 case INITIALIZER_DESIGNATOR:
4025 panic("unexpected designator initializer found");
4027 panic("unknown initializer");
4030 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4031 * are elements [...] the remainder of the aggregate shall be initialized
4032 * implicitly the same as objects that have static storage duration. */
4033 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4036 /* for unions we must NOT do anything for null initializers */
4037 ir_type *owner = get_entity_owner(entity);
4038 if (is_Union_type(owner)) {
4042 ir_type *ent_type = get_entity_type(entity);
4043 /* create sub-initializers for a compound type */
4044 if (is_compound_type(ent_type)) {
4045 unsigned n_members = get_compound_n_members(ent_type);
4046 for (unsigned n = 0; n < n_members; ++n) {
4047 ir_entity *member = get_compound_member(ent_type, n);
4048 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4050 create_dynamic_null_initializer(member, dbgi, addr);
4054 if (is_Array_type(ent_type)) {
4055 assert(has_array_upper_bound(ent_type, 0));
4056 long n = get_array_upper_bound_int(ent_type, 0);
4057 for (long i = 0; i < n; ++i) {
4058 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4059 ir_node *cnst = new_d_Const(dbgi, index_tv);
4060 ir_node *in[1] = { cnst };
4061 ir_entity *arrent = get_array_element_entity(ent_type);
4062 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4064 create_dynamic_null_initializer(arrent, dbgi, addr);
4069 ir_mode *value_mode = get_type_mode(ent_type);
4070 ir_node *node = new_Const(get_mode_null(value_mode));
4072 /* is it a bitfield type? */
4073 if (is_Primitive_type(ent_type) &&
4074 get_primitive_base_type(ent_type) != NULL) {
4075 bitfield_store_to_firm(dbgi, entity, base_addr, node, false);
4079 ir_node *mem = get_store();
4080 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4081 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4085 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4086 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4088 switch(get_initializer_kind(initializer)) {
4089 case IR_INITIALIZER_NULL:
4090 create_dynamic_null_initializer(entity, dbgi, base_addr);
4092 case IR_INITIALIZER_CONST: {
4093 ir_node *node = get_initializer_const_value(initializer);
4094 ir_type *ent_type = get_entity_type(entity);
4096 /* is it a bitfield type? */
4097 if (is_Primitive_type(ent_type) &&
4098 get_primitive_base_type(ent_type) != NULL) {
4099 bitfield_store_to_firm(dbgi, entity, base_addr, node, false);
4103 assert(get_type_mode(type) == get_irn_mode(node));
4104 ir_node *mem = get_store();
4105 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4106 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4110 case IR_INITIALIZER_TARVAL: {
4111 ir_tarval *tv = get_initializer_tarval_value(initializer);
4112 ir_node *cnst = new_d_Const(dbgi, tv);
4113 ir_type *ent_type = get_entity_type(entity);
4115 /* is it a bitfield type? */
4116 if (is_Primitive_type(ent_type) &&
4117 get_primitive_base_type(ent_type) != NULL) {
4118 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false);
4122 assert(get_type_mode(type) == get_tarval_mode(tv));
4123 ir_node *mem = get_store();
4124 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4125 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4129 case IR_INITIALIZER_COMPOUND: {
4130 assert(is_compound_type(type) || is_Array_type(type));
4132 if (is_Array_type(type)) {
4133 assert(has_array_upper_bound(type, 0));
4134 n_members = get_array_upper_bound_int(type, 0);
4136 n_members = get_compound_n_members(type);
4139 if (get_initializer_compound_n_entries(initializer)
4140 != (unsigned) n_members)
4141 panic("initializer doesn't match compound type");
4143 for (int i = 0; i < n_members; ++i) {
4146 ir_entity *sub_entity;
4147 if (is_Array_type(type)) {
4148 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4149 ir_node *cnst = new_d_Const(dbgi, index_tv);
4150 ir_node *in[1] = { cnst };
4151 irtype = get_array_element_type(type);
4152 sub_entity = get_array_element_entity(type);
4153 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4156 sub_entity = get_compound_member(type, i);
4157 irtype = get_entity_type(sub_entity);
4158 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4162 ir_initializer_t *sub_init
4163 = get_initializer_compound_value(initializer, i);
4165 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4172 panic("invalid IR_INITIALIZER found");
4175 static void create_dynamic_initializer(ir_initializer_t *initializer,
4176 dbg_info *dbgi, ir_entity *entity)
4178 ir_node *frame = get_irg_frame(current_ir_graph);
4179 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4180 ir_type *type = get_entity_type(entity);
4182 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4185 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4186 ir_entity *entity, type_t *type)
4188 ir_node *memory = get_store();
4189 ir_node *nomem = new_NoMem();
4190 ir_node *frame = get_irg_frame(current_ir_graph);
4191 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4193 if (initializer->kind == INITIALIZER_VALUE) {
4194 initializer_value_t *initializer_value = &initializer->value;
4196 ir_node *value = expression_to_firm(initializer_value->value);
4197 type = skip_typeref(type);
4198 assign_value(dbgi, addr, type, value);
4202 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4203 ir_initializer_t *irinitializer
4204 = create_ir_initializer(initializer, type);
4206 create_dynamic_initializer(irinitializer, dbgi, entity);
4210 /* create the ir_initializer */
4211 ir_graph *const old_current_ir_graph = current_ir_graph;
4212 current_ir_graph = get_const_code_irg();
4214 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
4216 assert(current_ir_graph == get_const_code_irg());
4217 current_ir_graph = old_current_ir_graph;
4219 /* create a "template" entity which is copied to the entity on the stack */
4220 ident *const id = id_unique("initializer.%u");
4221 ir_type *const irtype = get_ir_type(type);
4222 ir_type *const global_type = get_glob_type();
4223 ir_entity *const init_entity = new_d_entity(global_type, id, irtype, dbgi);
4224 set_entity_ld_ident(init_entity, id);
4226 set_entity_visibility(init_entity, ir_visibility_private);
4227 add_entity_linkage(init_entity, IR_LINKAGE_CONSTANT);
4229 set_entity_initializer(init_entity, irinitializer);
4231 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4232 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4234 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4235 set_store(copyb_mem);
4238 static void create_initializer_local_variable_entity(entity_t *entity)
4240 assert(entity->kind == ENTITY_VARIABLE);
4241 initializer_t *initializer = entity->variable.initializer;
4242 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4243 ir_entity *irentity = entity->variable.v.entity;
4244 type_t *type = entity->declaration.type;
4246 create_local_initializer(initializer, dbgi, irentity, type);
4249 static void create_variable_initializer(entity_t *entity)
4251 assert(entity->kind == ENTITY_VARIABLE);
4252 initializer_t *initializer = entity->variable.initializer;
4253 if (initializer == NULL)
4256 declaration_kind_t declaration_kind
4257 = (declaration_kind_t) entity->declaration.kind;
4258 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4259 create_initializer_local_variable_entity(entity);
4263 type_t *type = entity->declaration.type;
4264 type_qualifiers_t tq = get_type_qualifier(type, true);
4266 if (initializer->kind == INITIALIZER_VALUE) {
4267 initializer_value_t *initializer_value = &initializer->value;
4268 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4270 ir_node *value = expression_to_firm(initializer_value->value);
4272 type_t *init_type = initializer_value->value->base.type;
4273 ir_mode *mode = get_ir_mode_storage(init_type);
4274 value = create_conv(dbgi, value, mode);
4275 value = do_strict_conv(dbgi, value);
4277 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4278 set_value(entity->variable.v.value_number, value);
4280 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4282 ir_entity *irentity = entity->variable.v.entity;
4284 if (tq & TYPE_QUALIFIER_CONST
4285 && get_entity_owner(irentity) != get_tls_type()) {
4286 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4288 set_atomic_ent_value(irentity, value);
4291 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4292 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4294 ir_entity *irentity = entity->variable.v.entity;
4295 ir_initializer_t *irinitializer
4296 = create_ir_initializer(initializer, type);
4298 if (tq & TYPE_QUALIFIER_CONST) {
4299 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4301 set_entity_initializer(irentity, irinitializer);
4305 static void create_variable_length_array(entity_t *entity)
4307 assert(entity->kind == ENTITY_VARIABLE);
4308 assert(entity->variable.initializer == NULL);
4310 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4311 entity->variable.v.vla_base = NULL;
4313 /* TODO: record VLA somewhere so we create the free node when we leave
4317 static void allocate_variable_length_array(entity_t *entity)
4319 assert(entity->kind == ENTITY_VARIABLE);
4320 assert(entity->variable.initializer == NULL);
4321 assert(currently_reachable());
4323 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4324 type_t *type = entity->declaration.type;
4325 ir_type *el_type = get_ir_type(type->array.element_type);
4327 /* make sure size_node is calculated */
4328 get_type_size_node(type);
4329 ir_node *elems = type->array.size_node;
4330 ir_node *mem = get_store();
4331 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4333 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4334 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4337 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4338 entity->variable.v.vla_base = addr;
4342 * Creates a Firm local variable from a declaration.
4344 static void create_local_variable(entity_t *entity)
4346 assert(entity->kind == ENTITY_VARIABLE);
4347 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4349 bool needs_entity = entity->variable.address_taken;
4350 type_t *type = skip_typeref(entity->declaration.type);
4352 /* is it a variable length array? */
4353 if (is_type_array(type) && !type->array.size_constant) {
4354 create_variable_length_array(entity);
4356 } else if (is_type_array(type) || is_type_compound(type)) {
4357 needs_entity = true;
4358 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4359 needs_entity = true;
4363 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4364 create_variable_entity(entity,
4365 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4368 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4369 entity->variable.v.value_number = next_value_number_function;
4370 set_irg_loc_description(current_ir_graph, next_value_number_function,
4372 ++next_value_number_function;
4376 static void create_local_static_variable(entity_t *entity)
4378 assert(entity->kind == ENTITY_VARIABLE);
4379 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4381 type_t *type = skip_typeref(entity->declaration.type);
4382 ir_type *const var_type = entity->variable.thread_local ?
4383 get_tls_type() : get_glob_type();
4384 ir_type *const irtype = get_ir_type(type);
4385 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4387 size_t l = strlen(entity->base.symbol->string);
4388 char buf[l + sizeof(".%u")];
4389 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4390 ident *const id = id_unique(buf);
4391 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4393 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4394 set_entity_volatility(irentity, volatility_is_volatile);
4397 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4398 entity->variable.v.entity = irentity;
4400 set_entity_ld_ident(irentity, id);
4401 set_entity_visibility(irentity, ir_visibility_local);
4403 ir_graph *const old_current_ir_graph = current_ir_graph;
4404 current_ir_graph = get_const_code_irg();
4406 create_variable_initializer(entity);
4408 assert(current_ir_graph == get_const_code_irg());
4409 current_ir_graph = old_current_ir_graph;
4414 static void return_statement_to_firm(return_statement_t *statement)
4416 if (!currently_reachable())
4419 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4420 type_t *type = current_function_entity->declaration.type;
4421 ir_type *func_irtype = get_ir_type(type);
4425 if (get_method_n_ress(func_irtype) > 0) {
4426 ir_type *res_type = get_method_res_type(func_irtype, 0);
4428 if (statement->value != NULL) {
4429 ir_node *node = expression_to_firm(statement->value);
4430 if (!is_compound_type(res_type)) {
4431 type_t *ret_value_type = statement->value->base.type;
4432 ir_mode *mode = get_ir_mode_storage(ret_value_type);
4433 node = create_conv(dbgi, node, mode);
4434 node = do_strict_conv(dbgi, node);
4439 if (is_compound_type(res_type)) {
4442 mode = get_type_mode(res_type);
4444 in[0] = new_Unknown(mode);
4448 /* build return_value for its side effects */
4449 if (statement->value != NULL) {
4450 expression_to_firm(statement->value);
4455 ir_node *store = get_store();
4456 ir_node *ret = new_d_Return(dbgi, store, in_len, in);
4458 ir_node *end_block = get_irg_end_block(current_ir_graph);
4459 add_immBlock_pred(end_block, ret);
4461 set_unreachable_now();
4464 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4466 if (!currently_reachable())
4469 return expression_to_firm(statement->expression);
4472 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4474 entity_t *entity = compound->scope.entities;
4475 for ( ; entity != NULL; entity = entity->base.next) {
4476 if (!is_declaration(entity))
4479 create_local_declaration(entity);
4482 ir_node *result = NULL;
4483 statement_t *statement = compound->statements;
4484 for ( ; statement != NULL; statement = statement->base.next) {
4485 if (statement->base.next == NULL
4486 && statement->kind == STATEMENT_EXPRESSION) {
4487 result = expression_statement_to_firm(
4488 &statement->expression);
4491 statement_to_firm(statement);
4497 static void create_global_variable(entity_t *entity)
4499 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4500 ir_visibility visibility = ir_visibility_default;
4501 ir_entity *irentity;
4502 assert(entity->kind == ENTITY_VARIABLE);
4504 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4505 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4506 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4507 case STORAGE_CLASS_NONE:
4508 visibility = ir_visibility_default;
4509 /* uninitialized globals get merged in C */
4510 if (entity->variable.initializer == NULL)
4511 linkage |= IR_LINKAGE_MERGE;
4513 case STORAGE_CLASS_TYPEDEF:
4514 case STORAGE_CLASS_AUTO:
4515 case STORAGE_CLASS_REGISTER:
4516 panic("invalid storage class for global var");
4519 ir_type *var_type = get_glob_type();
4520 if (entity->variable.thread_local) {
4521 var_type = get_tls_type();
4522 /* LINKAGE_MERGE not supported by current linkers */
4523 linkage &= ~IR_LINKAGE_MERGE;
4525 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4526 irentity = entity->variable.v.entity;
4527 add_entity_linkage(irentity, linkage);
4528 set_entity_visibility(irentity, visibility);
4531 static void create_local_declaration(entity_t *entity)
4533 assert(is_declaration(entity));
4535 /* construct type */
4536 (void) get_ir_type(entity->declaration.type);
4537 if (entity->base.symbol == NULL) {
4541 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4542 case STORAGE_CLASS_STATIC:
4543 if (entity->kind == ENTITY_FUNCTION) {
4544 (void)get_function_entity(entity, NULL);
4546 create_local_static_variable(entity);
4549 case STORAGE_CLASS_EXTERN:
4550 if (entity->kind == ENTITY_FUNCTION) {
4551 assert(entity->function.statement == NULL);
4552 (void)get_function_entity(entity, NULL);
4554 create_global_variable(entity);
4555 create_variable_initializer(entity);
4558 case STORAGE_CLASS_NONE:
4559 case STORAGE_CLASS_AUTO:
4560 case STORAGE_CLASS_REGISTER:
4561 if (entity->kind == ENTITY_FUNCTION) {
4562 if (entity->function.statement != NULL) {
4563 ir_type *owner = get_irg_frame_type(current_ir_graph);
4564 (void)get_function_entity(entity, owner);
4565 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4566 enqueue_inner_function(entity);
4568 (void)get_function_entity(entity, NULL);
4571 create_local_variable(entity);
4574 case STORAGE_CLASS_TYPEDEF:
4577 panic("invalid storage class found");
4580 static void initialize_local_declaration(entity_t *entity)
4582 if (entity->base.symbol == NULL)
4585 // no need to emit code in dead blocks
4586 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4587 && !currently_reachable())
4590 switch ((declaration_kind_t) entity->declaration.kind) {
4591 case DECLARATION_KIND_LOCAL_VARIABLE:
4592 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4593 create_variable_initializer(entity);
4596 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4597 allocate_variable_length_array(entity);
4600 case DECLARATION_KIND_COMPOUND_MEMBER:
4601 case DECLARATION_KIND_GLOBAL_VARIABLE:
4602 case DECLARATION_KIND_FUNCTION:
4603 case DECLARATION_KIND_INNER_FUNCTION:
4606 case DECLARATION_KIND_PARAMETER:
4607 case DECLARATION_KIND_PARAMETER_ENTITY:
4608 panic("can't initialize parameters");
4610 case DECLARATION_KIND_UNKNOWN:
4611 panic("can't initialize unknown declaration");
4613 panic("invalid declaration kind");
4616 static void declaration_statement_to_firm(declaration_statement_t *statement)
4618 entity_t *entity = statement->declarations_begin;
4622 entity_t *const last = statement->declarations_end;
4623 for ( ;; entity = entity->base.next) {
4624 if (is_declaration(entity)) {
4625 initialize_local_declaration(entity);
4626 } else if (entity->kind == ENTITY_TYPEDEF) {
4627 /* ยง6.7.7:3 Any array size expressions associated with variable length
4628 * array declarators are evaluated each time the declaration of the
4629 * typedef name is reached in the order of execution. */
4630 type_t *const type = skip_typeref(entity->typedefe.type);
4631 if (is_type_array(type) && type->array.is_vla)
4632 get_vla_size(&type->array);
4639 static void if_statement_to_firm(if_statement_t *statement)
4641 /* Create the condition. */
4642 ir_node *true_block = NULL;
4643 ir_node *false_block = NULL;
4644 if (currently_reachable()) {
4645 true_block = new_immBlock();
4646 false_block = new_immBlock();
4647 create_condition_evaluation(statement->condition, true_block, false_block);
4648 mature_immBlock(true_block);
4651 /* Create the false statement.
4652 * Handle false before true, so if no false statement is present, then the
4653 * empty false block is reused as fallthrough block. */
4654 ir_node *fallthrough_block = NULL;
4655 if (statement->false_statement != NULL) {
4656 if (false_block != NULL) {
4657 mature_immBlock(false_block);
4659 set_cur_block(false_block);
4660 statement_to_firm(statement->false_statement);
4661 if (currently_reachable()) {
4662 fallthrough_block = new_immBlock();
4663 add_immBlock_pred(fallthrough_block, new_Jmp());
4666 fallthrough_block = false_block;
4669 /* Create the true statement. */
4670 set_cur_block(true_block);
4671 statement_to_firm(statement->true_statement);
4672 if (currently_reachable()) {
4673 if (fallthrough_block == NULL) {
4674 fallthrough_block = new_immBlock();
4676 add_immBlock_pred(fallthrough_block, new_Jmp());
4679 /* Handle the block after the if-statement. */
4680 if (fallthrough_block != NULL) {
4681 mature_immBlock(fallthrough_block);
4683 set_cur_block(fallthrough_block);
4686 /* Create a jump node which jumps into target_block, if the current block is
4688 static void jump_if_reachable(ir_node *const target_block)
4690 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4691 add_immBlock_pred(target_block, pred);
4694 static void while_statement_to_firm(while_statement_t *statement)
4696 /* Create the header block */
4697 ir_node *const header_block = new_immBlock();
4698 jump_if_reachable(header_block);
4700 /* Create the condition. */
4701 ir_node * body_block;
4702 ir_node * false_block;
4703 expression_t *const cond = statement->condition;
4704 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4705 fold_constant_to_bool(cond)) {
4706 /* Shortcut for while (true). */
4707 body_block = header_block;
4710 keep_alive(header_block);
4711 keep_all_memory(header_block);
4713 body_block = new_immBlock();
4714 false_block = new_immBlock();
4716 set_cur_block(header_block);
4717 create_condition_evaluation(cond, body_block, false_block);
4718 mature_immBlock(body_block);
4721 ir_node *const old_continue_label = continue_label;
4722 ir_node *const old_break_label = break_label;
4723 continue_label = header_block;
4724 break_label = false_block;
4726 /* Create the loop body. */
4727 set_cur_block(body_block);
4728 statement_to_firm(statement->body);
4729 jump_if_reachable(header_block);
4731 mature_immBlock(header_block);
4732 assert(false_block == NULL || false_block == break_label);
4733 false_block = break_label;
4734 if (false_block != NULL) {
4735 mature_immBlock(false_block);
4737 set_cur_block(false_block);
4739 assert(continue_label == header_block);
4740 continue_label = old_continue_label;
4741 break_label = old_break_label;
4744 static ir_node *get_break_label(void)
4746 if (break_label == NULL) {
4747 break_label = new_immBlock();
4752 static void do_while_statement_to_firm(do_while_statement_t *statement)
4754 /* create the header block */
4755 ir_node *header_block = new_immBlock();
4758 ir_node *body_block = new_immBlock();
4759 jump_if_reachable(body_block);
4761 ir_node *old_continue_label = continue_label;
4762 ir_node *old_break_label = break_label;
4763 continue_label = header_block;
4766 set_cur_block(body_block);
4767 statement_to_firm(statement->body);
4768 ir_node *const false_block = get_break_label();
4770 assert(continue_label == header_block);
4771 continue_label = old_continue_label;
4772 break_label = old_break_label;
4774 jump_if_reachable(header_block);
4776 /* create the condition */
4777 mature_immBlock(header_block);
4778 set_cur_block(header_block);
4780 create_condition_evaluation(statement->condition, body_block, false_block);
4781 mature_immBlock(body_block);
4782 mature_immBlock(false_block);
4784 set_cur_block(false_block);
4787 static void for_statement_to_firm(for_statement_t *statement)
4789 /* create declarations */
4790 entity_t *entity = statement->scope.entities;
4791 for ( ; entity != NULL; entity = entity->base.next) {
4792 if (!is_declaration(entity))
4795 create_local_declaration(entity);
4798 if (currently_reachable()) {
4799 entity = statement->scope.entities;
4800 for ( ; entity != NULL; entity = entity->base.next) {
4801 if (!is_declaration(entity))
4804 initialize_local_declaration(entity);
4807 if (statement->initialisation != NULL) {
4808 expression_to_firm(statement->initialisation);
4812 /* Create the header block */
4813 ir_node *const header_block = new_immBlock();
4814 jump_if_reachable(header_block);
4816 /* Create the condition. */
4817 ir_node *body_block;
4818 ir_node *false_block;
4819 if (statement->condition != NULL) {
4820 body_block = new_immBlock();
4821 false_block = new_immBlock();
4823 set_cur_block(header_block);
4824 create_condition_evaluation(statement->condition, body_block, false_block);
4825 mature_immBlock(body_block);
4828 body_block = header_block;
4831 keep_alive(header_block);
4832 keep_all_memory(header_block);
4835 /* Create the step block, if necessary. */
4836 ir_node * step_block = header_block;
4837 expression_t *const step = statement->step;
4839 step_block = new_immBlock();
4842 ir_node *const old_continue_label = continue_label;
4843 ir_node *const old_break_label = break_label;
4844 continue_label = step_block;
4845 break_label = false_block;
4847 /* Create the loop body. */
4848 set_cur_block(body_block);
4849 statement_to_firm(statement->body);
4850 jump_if_reachable(step_block);
4852 /* Create the step code. */
4854 mature_immBlock(step_block);
4855 set_cur_block(step_block);
4856 expression_to_firm(step);
4857 jump_if_reachable(header_block);
4860 mature_immBlock(header_block);
4861 assert(false_block == NULL || false_block == break_label);
4862 false_block = break_label;
4863 if (false_block != NULL) {
4864 mature_immBlock(false_block);
4866 set_cur_block(false_block);
4868 assert(continue_label == step_block);
4869 continue_label = old_continue_label;
4870 break_label = old_break_label;
4873 static void create_jump_statement(const statement_t *statement,
4874 ir_node *target_block)
4876 if (!currently_reachable())
4879 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4880 ir_node *jump = new_d_Jmp(dbgi);
4881 add_immBlock_pred(target_block, jump);
4883 set_unreachable_now();
4886 static void switch_statement_to_firm(switch_statement_t *statement)
4888 ir_node *first_block = NULL;
4889 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4890 ir_node *cond = NULL;
4892 if (currently_reachable()) {
4893 ir_node *expression = expression_to_firm(statement->expression);
4894 cond = new_d_Cond(dbgi, expression);
4895 first_block = get_cur_block();
4898 set_unreachable_now();
4900 ir_node *const old_switch_cond = current_switch_cond;
4901 ir_node *const old_break_label = break_label;
4902 const bool old_saw_default_label = saw_default_label;
4903 saw_default_label = false;
4904 current_switch_cond = cond;
4906 switch_statement_t *const old_switch = current_switch;
4907 current_switch = statement;
4909 /* determine a free number for the default label */
4910 unsigned long num_cases = 0;
4911 long default_proj_nr = 0;
4912 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
4913 if (l->expression == NULL) {
4917 if (l->last_case >= l->first_case)
4918 num_cases += l->last_case - l->first_case + 1;
4919 if (l->last_case > default_proj_nr)
4920 default_proj_nr = l->last_case;
4923 if (default_proj_nr == LONG_MAX) {
4924 /* Bad: an overflow will occur, we cannot be sure that the
4925 * maximum + 1 is a free number. Scan the values a second
4926 * time to find a free number.
4928 unsigned char *bits = xmalloc((num_cases + 7) >> 3);
4930 memset(bits, 0, (num_cases + 7) >> 3);
4931 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
4932 if (l->expression == NULL) {
4936 unsigned long start = l->first_case > 0 ? (unsigned long)l->first_case : 0;
4937 if (start < num_cases && l->last_case >= 0) {
4938 unsigned long end = (unsigned long)l->last_case < num_cases ?
4939 (unsigned long)l->last_case : num_cases - 1;
4940 for (unsigned long cns = start; cns <= end; ++cns) {
4941 bits[cns >> 3] |= (1 << (cns & 7));
4945 /* We look at the first num_cases constants:
4946 * Either they are dense, so we took the last (num_cases)
4947 * one, or they are not dense, so we will find one free
4951 for (i = 0; i < num_cases; ++i)
4952 if ((bits[i >> 3] & (1 << (i & 7))) == 0)
4956 default_proj_nr = i;
4960 statement->default_proj_nr = default_proj_nr;
4961 /* safety check: cond might already be folded to a Bad */
4962 if (cond != NULL && is_Cond(cond)) {
4963 set_Cond_default_proj(cond, default_proj_nr);
4966 statement_to_firm(statement->body);
4968 jump_if_reachable(get_break_label());
4970 if (!saw_default_label && first_block != NULL) {
4971 set_cur_block(first_block);
4972 ir_node *const proj = new_d_Proj(dbgi, cond, mode_X, default_proj_nr);
4973 add_immBlock_pred(get_break_label(), proj);
4976 if (break_label != NULL) {
4977 mature_immBlock(break_label);
4979 set_cur_block(break_label);
4981 assert(current_switch_cond == cond);
4982 current_switch = old_switch;
4983 current_switch_cond = old_switch_cond;
4984 break_label = old_break_label;
4985 saw_default_label = old_saw_default_label;
4988 static void case_label_to_firm(const case_label_statement_t *statement)
4990 if (statement->is_empty_range)
4993 ir_node *block = new_immBlock();
4994 /* Fallthrough from previous case */
4995 jump_if_reachable(block);
4997 if (current_switch_cond != NULL) {
4998 set_cur_block(get_nodes_block(current_switch_cond));
4999 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5000 if (statement->expression != NULL) {
5001 long pn = statement->first_case;
5002 long end_pn = statement->last_case;
5003 assert(pn <= end_pn);
5004 /* create jumps for all cases in the given range */
5006 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X, pn);
5007 add_immBlock_pred(block, proj);
5008 } while (pn++ < end_pn);
5010 saw_default_label = true;
5011 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X,
5012 current_switch->default_proj_nr);
5013 add_immBlock_pred(block, proj);
5017 mature_immBlock(block);
5018 set_cur_block(block);
5020 statement_to_firm(statement->statement);
5023 static void label_to_firm(const label_statement_t *statement)
5025 ir_node *block = get_label_block(statement->label);
5026 jump_if_reachable(block);
5028 set_cur_block(block);
5030 keep_all_memory(block);
5032 statement_to_firm(statement->statement);
5035 static void goto_to_firm(const goto_statement_t *statement)
5037 if (!currently_reachable())
5040 if (statement->expression) {
5041 ir_node *irn = expression_to_firm(statement->expression);
5042 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5043 ir_node *ijmp = new_d_IJmp(dbgi, irn);
5045 set_irn_link(ijmp, ijmp_list);
5048 ir_node *block = get_label_block(statement->label);
5049 ir_node *jmp = new_Jmp();
5050 add_immBlock_pred(block, jmp);
5052 set_unreachable_now();
5055 static void asm_statement_to_firm(const asm_statement_t *statement)
5057 bool needs_memory = false;
5059 if (statement->is_volatile) {
5060 needs_memory = true;
5063 size_t n_clobbers = 0;
5064 asm_clobber_t *clobber = statement->clobbers;
5065 for ( ; clobber != NULL; clobber = clobber->next) {
5066 const char *clobber_str = clobber->clobber.begin;
5068 if (!be_is_valid_clobber(clobber_str)) {
5069 errorf(&statement->base.source_position,
5070 "invalid clobber '%s' specified", clobber->clobber);
5074 if (strcmp(clobber_str, "memory") == 0) {
5075 needs_memory = true;
5079 ident *id = new_id_from_str(clobber_str);
5080 obstack_ptr_grow(&asm_obst, id);
5083 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5084 ident **clobbers = NULL;
5085 if (n_clobbers > 0) {
5086 clobbers = obstack_finish(&asm_obst);
5089 size_t n_inputs = 0;
5090 asm_argument_t *argument = statement->inputs;
5091 for ( ; argument != NULL; argument = argument->next)
5093 size_t n_outputs = 0;
5094 argument = statement->outputs;
5095 for ( ; argument != NULL; argument = argument->next)
5098 unsigned next_pos = 0;
5100 ir_node *ins[n_inputs + n_outputs + 1];
5103 ir_asm_constraint tmp_in_constraints[n_outputs];
5105 const expression_t *out_exprs[n_outputs];
5106 ir_node *out_addrs[n_outputs];
5107 size_t out_size = 0;
5109 argument = statement->outputs;
5110 for ( ; argument != NULL; argument = argument->next) {
5111 const char *constraints = argument->constraints.begin;
5112 asm_constraint_flags_t asm_flags
5113 = be_parse_asm_constraints(constraints);
5116 source_position_t const *const pos = &statement->base.source_position;
5117 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5118 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5120 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5121 errorf(pos, "some constraints in '%s' are invalid", constraints);
5124 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5125 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5130 unsigned pos = next_pos++;
5131 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5132 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5133 expression_t *expr = argument->expression;
5134 ir_node *addr = expression_to_addr(expr);
5135 /* in+output, construct an artifical same_as constraint on the
5137 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5139 ir_node *value = get_value_from_lvalue(expr, addr);
5141 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5143 ir_asm_constraint constraint;
5144 constraint.pos = pos;
5145 constraint.constraint = new_id_from_str(buf);
5146 constraint.mode = get_ir_mode_storage(expr->base.type);
5147 tmp_in_constraints[in_size] = constraint;
5148 ins[in_size] = value;
5153 out_exprs[out_size] = expr;
5154 out_addrs[out_size] = addr;
5156 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5157 /* pure memory ops need no input (but we have to make sure we
5158 * attach to the memory) */
5159 assert(! (asm_flags &
5160 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5161 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5162 needs_memory = true;
5164 /* we need to attach the address to the inputs */
5165 expression_t *expr = argument->expression;
5167 ir_asm_constraint constraint;
5168 constraint.pos = pos;
5169 constraint.constraint = new_id_from_str(constraints);
5170 constraint.mode = NULL;
5171 tmp_in_constraints[in_size] = constraint;
5173 ins[in_size] = expression_to_addr(expr);
5177 errorf(&statement->base.source_position,
5178 "only modifiers but no place set in constraints '%s'",
5183 ir_asm_constraint constraint;
5184 constraint.pos = pos;
5185 constraint.constraint = new_id_from_str(constraints);
5186 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5188 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5190 assert(obstack_object_size(&asm_obst)
5191 == out_size * sizeof(ir_asm_constraint));
5192 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5195 obstack_grow(&asm_obst, tmp_in_constraints,
5196 in_size * sizeof(tmp_in_constraints[0]));
5197 /* find and count input and output arguments */
5198 argument = statement->inputs;
5199 for ( ; argument != NULL; argument = argument->next) {
5200 const char *constraints = argument->constraints.begin;
5201 asm_constraint_flags_t asm_flags
5202 = be_parse_asm_constraints(constraints);
5204 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5205 errorf(&statement->base.source_position,
5206 "some constraints in '%s' are not supported", constraints);
5209 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5210 errorf(&statement->base.source_position,
5211 "some constraints in '%s' are invalid", constraints);
5214 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5215 errorf(&statement->base.source_position,
5216 "write flag specified for input constraints '%s'",
5222 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5223 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5224 /* we can treat this as "normal" input */
5225 input = expression_to_firm(argument->expression);
5226 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5227 /* pure memory ops need no input (but we have to make sure we
5228 * attach to the memory) */
5229 assert(! (asm_flags &
5230 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5231 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5232 needs_memory = true;
5233 input = expression_to_addr(argument->expression);
5235 errorf(&statement->base.source_position,
5236 "only modifiers but no place set in constraints '%s'",
5241 ir_asm_constraint constraint;
5242 constraint.pos = next_pos++;
5243 constraint.constraint = new_id_from_str(constraints);
5244 constraint.mode = get_irn_mode(input);
5246 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5247 ins[in_size++] = input;
5251 ir_asm_constraint constraint;
5252 constraint.pos = next_pos++;
5253 constraint.constraint = new_id_from_str("");
5254 constraint.mode = mode_M;
5256 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5257 ins[in_size++] = get_store();
5260 assert(obstack_object_size(&asm_obst)
5261 == in_size * sizeof(ir_asm_constraint));
5262 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5264 /* create asm node */
5265 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5267 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5269 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5270 out_size, output_constraints,
5271 n_clobbers, clobbers, asm_text);
5273 if (statement->is_volatile) {
5274 set_irn_pinned(node, op_pin_state_pinned);
5276 set_irn_pinned(node, op_pin_state_floats);
5279 /* create output projs & connect them */
5281 ir_node *projm = new_Proj(node, mode_M, out_size);
5286 for (i = 0; i < out_size; ++i) {
5287 const expression_t *out_expr = out_exprs[i];
5289 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5290 ir_node *proj = new_Proj(node, mode, pn);
5291 ir_node *addr = out_addrs[i];
5293 set_value_for_expression_addr(out_expr, proj, addr);
5297 static void ms_try_statement_to_firm(ms_try_statement_t *statement)
5299 statement_to_firm(statement->try_statement);
5300 source_position_t const *const pos = &statement->base.source_position;
5301 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5304 static void leave_statement_to_firm(leave_statement_t *statement)
5306 errorf(&statement->base.source_position, "__leave not supported yet");
5310 * Transform a statement.
5312 static void statement_to_firm(statement_t *statement)
5315 assert(!statement->base.transformed);
5316 statement->base.transformed = true;
5319 switch (statement->kind) {
5320 case STATEMENT_ERROR:
5321 panic("error statement found");
5322 case STATEMENT_EMPTY:
5325 case STATEMENT_COMPOUND:
5326 compound_statement_to_firm(&statement->compound);
5328 case STATEMENT_RETURN:
5329 return_statement_to_firm(&statement->returns);
5331 case STATEMENT_EXPRESSION:
5332 expression_statement_to_firm(&statement->expression);
5335 if_statement_to_firm(&statement->ifs);
5337 case STATEMENT_WHILE:
5338 while_statement_to_firm(&statement->whiles);
5340 case STATEMENT_DO_WHILE:
5341 do_while_statement_to_firm(&statement->do_while);
5343 case STATEMENT_DECLARATION:
5344 declaration_statement_to_firm(&statement->declaration);
5346 case STATEMENT_BREAK:
5347 create_jump_statement(statement, get_break_label());
5349 case STATEMENT_CONTINUE:
5350 create_jump_statement(statement, continue_label);
5352 case STATEMENT_SWITCH:
5353 switch_statement_to_firm(&statement->switchs);
5355 case STATEMENT_CASE_LABEL:
5356 case_label_to_firm(&statement->case_label);
5359 for_statement_to_firm(&statement->fors);
5361 case STATEMENT_LABEL:
5362 label_to_firm(&statement->label);
5364 case STATEMENT_GOTO:
5365 goto_to_firm(&statement->gotos);
5368 asm_statement_to_firm(&statement->asms);
5370 case STATEMENT_MS_TRY:
5371 ms_try_statement_to_firm(&statement->ms_try);
5373 case STATEMENT_LEAVE:
5374 leave_statement_to_firm(&statement->leave);
5377 panic("statement not implemented");
5380 static int count_local_variables(const entity_t *entity,
5381 const entity_t *const last)
5384 entity_t const *const end = last != NULL ? last->base.next : NULL;
5385 for (; entity != end; entity = entity->base.next) {
5389 if (entity->kind == ENTITY_VARIABLE) {
5390 type = skip_typeref(entity->declaration.type);
5391 address_taken = entity->variable.address_taken;
5392 } else if (entity->kind == ENTITY_PARAMETER) {
5393 type = skip_typeref(entity->declaration.type);
5394 address_taken = entity->parameter.address_taken;
5399 if (!address_taken && is_type_scalar(type))
5405 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5407 int *const count = env;
5409 switch (stmt->kind) {
5410 case STATEMENT_DECLARATION: {
5411 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5412 *count += count_local_variables(decl_stmt->declarations_begin,
5413 decl_stmt->declarations_end);
5418 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5427 * Return the number of local (alias free) variables used by a function.
5429 static int get_function_n_local_vars(entity_t *entity)
5431 const function_t *function = &entity->function;
5434 /* count parameters */
5435 count += count_local_variables(function->parameters.entities, NULL);
5437 /* count local variables declared in body */
5438 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5443 * Build Firm code for the parameters of a function.
5445 static void initialize_function_parameters(entity_t *entity)
5447 assert(entity->kind == ENTITY_FUNCTION);
5448 ir_graph *irg = current_ir_graph;
5449 ir_node *args = get_irg_args(irg);
5451 ir_type *function_irtype;
5453 if (entity->function.need_closure) {
5454 /* add an extra parameter for the static link */
5455 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5458 /* Matze: IMO this is wrong, nested functions should have an own
5459 * type and not rely on strange parameters... */
5460 function_irtype = create_method_type(&entity->declaration.type->function, true);
5462 function_irtype = get_ir_type(entity->declaration.type);
5467 entity_t *parameter = entity->function.parameters.entities;
5468 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5469 if (parameter->kind != ENTITY_PARAMETER)
5472 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5473 type_t *type = skip_typeref(parameter->declaration.type);
5475 bool needs_entity = parameter->parameter.address_taken;
5476 assert(!is_type_array(type));
5477 if (is_type_compound(type)) {
5478 needs_entity = true;
5481 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5483 ir_type *frame_type = get_irg_frame_type(irg);
5485 = new_parameter_entity(frame_type, n, param_irtype);
5486 parameter->declaration.kind
5487 = DECLARATION_KIND_PARAMETER_ENTITY;
5488 parameter->parameter.v.entity = param;
5492 ir_mode *param_mode = get_type_mode(param_irtype);
5494 ir_node *value = new_r_Proj(args, param_mode, pn);
5496 ir_mode *mode = get_ir_mode_storage(type);
5497 value = create_conv(NULL, value, mode);
5498 value = do_strict_conv(NULL, value);
5500 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5501 parameter->parameter.v.value_number = next_value_number_function;
5502 set_irg_loc_description(current_ir_graph, next_value_number_function,
5504 ++next_value_number_function;
5506 set_value(parameter->parameter.v.value_number, value);
5511 * Handle additional decl modifiers for IR-graphs
5513 * @param irg the IR-graph
5514 * @param dec_modifiers additional modifiers
5516 static void handle_decl_modifier_irg(ir_graph_ptr irg,
5517 decl_modifiers_t decl_modifiers)
5519 if (decl_modifiers & DM_RETURNS_TWICE) {
5520 /* TRUE if the declaration includes __attribute__((returns_twice)) */
5521 add_irg_additional_properties(irg, mtp_property_returns_twice);
5523 if (decl_modifiers & DM_NORETURN) {
5524 /* TRUE if the declaration includes the Microsoft
5525 __declspec(noreturn) specifier. */
5526 add_irg_additional_properties(irg, mtp_property_noreturn);
5528 if (decl_modifiers & DM_NOTHROW) {
5529 /* TRUE if the declaration includes the Microsoft
5530 __declspec(nothrow) specifier. */
5531 add_irg_additional_properties(irg, mtp_property_nothrow);
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 set_irg_fp_model(irg, firm_fp_model);
5629 tarval_enable_fp_ops(1);
5630 set_irn_dbg_info(get_irg_start_block(irg),
5631 get_entity_dbg_info(function_entity));
5633 ir_node *first_block = get_cur_block();
5635 /* set inline flags */
5636 if (entity->function.is_inline)
5637 set_irg_inline_property(irg, irg_inline_recomended);
5638 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5640 next_value_number_function = 0;
5641 initialize_function_parameters(entity);
5642 current_static_link = entity->function.static_link;
5644 statement_to_firm(entity->function.statement);
5646 ir_node *end_block = get_irg_end_block(irg);
5648 /* do we have a return statement yet? */
5649 if (currently_reachable()) {
5650 type_t *type = skip_typeref(entity->declaration.type);
5651 assert(is_type_function(type));
5652 const function_type_t *func_type = &type->function;
5653 const type_t *return_type
5654 = skip_typeref(func_type->return_type);
5657 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5658 ret = new_Return(get_store(), 0, NULL);
5661 if (is_type_scalar(return_type)) {
5662 mode = get_ir_mode_storage(func_type->return_type);
5668 /* ยง5.1.2.2.3 main implicitly returns 0 */
5669 if (is_main(entity)) {
5670 in[0] = new_Const(get_mode_null(mode));
5672 in[0] = new_Unknown(mode);
5674 ret = new_Return(get_store(), 1, in);
5676 add_immBlock_pred(end_block, ret);
5679 bool has_computed_gotos = false;
5680 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5681 label_t *label = all_labels[i];
5682 if (label->address_taken) {
5683 gen_ijmp_branches(label->block);
5684 has_computed_gotos = true;
5686 mature_immBlock(label->block);
5688 if (has_computed_gotos) {
5689 /* if we have computed goto's in the function, we cannot inline it */
5690 if (get_irg_inline_property(irg) >= irg_inline_recomended) {
5691 source_position_t const *const pos = &entity->base.source_position;
5692 warningf(WARN_OTHER, pos, "'%N' can never be inlined because it contains a computed goto", entity);
5694 set_irg_inline_property(irg, irg_inline_forbidden);
5697 DEL_ARR_F(all_labels);
5700 mature_immBlock(first_block);
5701 mature_immBlock(end_block);
5703 irg_finalize_cons(irg);
5705 /* finalize the frame type */
5706 ir_type *frame_type = get_irg_frame_type(irg);
5707 int n = get_compound_n_members(frame_type);
5710 for (int i = 0; i < n; ++i) {
5711 ir_entity *member = get_compound_member(frame_type, i);
5712 ir_type *entity_type = get_entity_type(member);
5714 int align = get_type_alignment_bytes(entity_type);
5715 if (align > align_all)
5719 misalign = offset % align;
5721 offset += align - misalign;
5725 set_entity_offset(member, offset);
5726 offset += get_type_size_bytes(entity_type);
5728 set_type_size_bytes(frame_type, offset);
5729 set_type_alignment_bytes(frame_type, align_all);
5731 irg_verify(irg, VERIFY_ENFORCE_SSA);
5732 current_function = old_current_function;
5734 if (current_trampolines != NULL) {
5735 DEL_ARR_F(current_trampolines);
5736 current_trampolines = NULL;
5739 /* create inner functions if any */
5740 entity_t **inner = inner_functions;
5741 if (inner != NULL) {
5742 ir_type *rem_outer_frame = current_outer_frame;
5743 current_outer_frame = get_irg_frame_type(current_ir_graph);
5744 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5745 create_function(inner[i]);
5749 current_outer_frame = rem_outer_frame;
5753 static void scope_to_firm(scope_t *scope)
5755 /* first pass: create declarations */
5756 entity_t *entity = scope->entities;
5757 for ( ; entity != NULL; entity = entity->base.next) {
5758 if (entity->base.symbol == NULL)
5761 if (entity->kind == ENTITY_FUNCTION) {
5762 if (entity->function.btk != BUILTIN_NONE) {
5763 /* builtins have no representation */
5766 (void)get_function_entity(entity, NULL);
5767 } else if (entity->kind == ENTITY_VARIABLE) {
5768 create_global_variable(entity);
5769 } else if (entity->kind == ENTITY_NAMESPACE) {
5770 scope_to_firm(&entity->namespacee.members);
5774 /* second pass: create code/initializers */
5775 entity = scope->entities;
5776 for ( ; entity != NULL; entity = entity->base.next) {
5777 if (entity->base.symbol == NULL)
5780 if (entity->kind == ENTITY_FUNCTION) {
5781 if (entity->function.btk != BUILTIN_NONE) {
5782 /* builtins have no representation */
5785 create_function(entity);
5786 } else if (entity->kind == ENTITY_VARIABLE) {
5787 assert(entity->declaration.kind
5788 == DECLARATION_KIND_GLOBAL_VARIABLE);
5789 current_ir_graph = get_const_code_irg();
5790 create_variable_initializer(entity);
5795 void init_ast2firm(void)
5797 obstack_init(&asm_obst);
5798 init_atomic_modes();
5800 ir_set_debug_retrieve(dbg_retrieve);
5801 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5803 /* create idents for all known runtime functions */
5804 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5805 rts_idents[i] = new_id_from_str(rts_data[i].name);
5808 entitymap_init(&entitymap);
5811 static void init_ir_types(void)
5813 static int ir_types_initialized = 0;
5814 if (ir_types_initialized)
5816 ir_types_initialized = 1;
5818 ir_type_int = get_ir_type(type_int);
5819 ir_type_char = get_ir_type(type_char);
5820 ir_type_const_char = get_ir_type(type_const_char);
5821 ir_type_wchar_t = get_ir_type(type_wchar_t);
5822 ir_type_void = get_ir_type(type_void);
5824 be_params = be_get_backend_param();
5825 mode_float_arithmetic = be_params->mode_float_arithmetic;
5827 stack_param_align = be_params->stack_param_align;
5830 void exit_ast2firm(void)
5832 entitymap_destroy(&entitymap);
5833 obstack_free(&asm_obst, NULL);
5836 static void global_asm_to_firm(statement_t *s)
5838 for (; s != NULL; s = s->base.next) {
5839 assert(s->kind == STATEMENT_ASM);
5841 char const *const text = s->asms.asm_text.begin;
5842 size_t size = s->asms.asm_text.size;
5844 /* skip the last \0 */
5845 if (text[size - 1] == '\0')
5848 ident *const id = new_id_from_chars(text, size);
5853 void translation_unit_to_firm(translation_unit_t *unit)
5855 /* initialize firm arithmetic */
5856 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5857 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5859 /* just to be sure */
5860 continue_label = NULL;
5862 current_switch_cond = NULL;
5863 current_translation_unit = unit;
5867 scope_to_firm(&unit->scope);
5868 global_asm_to_firm(unit->global_asm);
5870 current_ir_graph = NULL;
5871 current_translation_unit = NULL;