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 complex_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(imaginary_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.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->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->complex);
718 firm_type = create_imaginary_type(&type->imaginary);
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);
747 if (firm_type == NULL)
748 panic("unknown type found");
750 type->base.firm_type = firm_type;
754 static ir_mode *get_ir_mode_storage(type_t *type)
756 ir_type *irtype = get_ir_type(type);
758 /* firm doesn't report a mode for arrays somehow... */
759 if (is_Array_type(irtype)) {
763 ir_mode *mode = get_type_mode(irtype);
764 assert(mode != NULL);
769 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
770 * int that it returns bigger modes for floating point on some platforms
771 * (x87 internally does arithemtic with 80bits)
773 static ir_mode *get_ir_mode_arithmetic(type_t *type)
775 ir_mode *mode = get_ir_mode_storage(type);
776 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
777 return mode_float_arithmetic;
783 /** Names of the runtime functions. */
784 static const struct {
785 int id; /**< the rts id */
786 int n_res; /**< number of return values */
787 const char *name; /**< the name of the rts function */
788 int n_params; /**< number of parameters */
789 unsigned flags; /**< language flags */
791 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
792 { rts_abort, 0, "abort", 0, _C89 },
793 { rts_alloca, 1, "alloca", 1, _ALL },
794 { rts_abs, 1, "abs", 1, _C89 },
795 { rts_labs, 1, "labs", 1, _C89 },
796 { rts_llabs, 1, "llabs", 1, _C99 },
797 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
799 { rts_fabs, 1, "fabs", 1, _C89 },
800 { rts_sqrt, 1, "sqrt", 1, _C89 },
801 { rts_cbrt, 1, "cbrt", 1, _C99 },
802 { rts_exp, 1, "exp", 1, _C89 },
803 { rts_exp2, 1, "exp2", 1, _C89 },
804 { rts_exp10, 1, "exp10", 1, _GNUC },
805 { rts_log, 1, "log", 1, _C89 },
806 { rts_log2, 1, "log2", 1, _C89 },
807 { rts_log10, 1, "log10", 1, _C89 },
808 { rts_pow, 1, "pow", 2, _C89 },
809 { rts_sin, 1, "sin", 1, _C89 },
810 { rts_cos, 1, "cos", 1, _C89 },
811 { rts_tan, 1, "tan", 1, _C89 },
812 { rts_asin, 1, "asin", 1, _C89 },
813 { rts_acos, 1, "acos", 1, _C89 },
814 { rts_atan, 1, "atan", 1, _C89 },
815 { rts_sinh, 1, "sinh", 1, _C89 },
816 { rts_cosh, 1, "cosh", 1, _C89 },
817 { rts_tanh, 1, "tanh", 1, _C89 },
819 { rts_fabsf, 1, "fabsf", 1, _C99 },
820 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
821 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
822 { rts_expf, 1, "expf", 1, _C99 },
823 { rts_exp2f, 1, "exp2f", 1, _C99 },
824 { rts_exp10f, 1, "exp10f", 1, _GNUC },
825 { rts_logf, 1, "logf", 1, _C99 },
826 { rts_log2f, 1, "log2f", 1, _C99 },
827 { rts_log10f, 1, "log10f", 1, _C99 },
828 { rts_powf, 1, "powf", 2, _C99 },
829 { rts_sinf, 1, "sinf", 1, _C99 },
830 { rts_cosf, 1, "cosf", 1, _C99 },
831 { rts_tanf, 1, "tanf", 1, _C99 },
832 { rts_asinf, 1, "asinf", 1, _C99 },
833 { rts_acosf, 1, "acosf", 1, _C99 },
834 { rts_atanf, 1, "atanf", 1, _C99 },
835 { rts_sinhf, 1, "sinhf", 1, _C99 },
836 { rts_coshf, 1, "coshf", 1, _C99 },
837 { rts_tanhf, 1, "tanhf", 1, _C99 },
839 { rts_fabsl, 1, "fabsl", 1, _C99 },
840 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
841 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
842 { rts_expl, 1, "expl", 1, _C99 },
843 { rts_exp2l, 1, "exp2l", 1, _C99 },
844 { rts_exp10l, 1, "exp10l", 1, _GNUC },
845 { rts_logl, 1, "logl", 1, _C99 },
846 { rts_log2l, 1, "log2l", 1, _C99 },
847 { rts_log10l, 1, "log10l", 1, _C99 },
848 { rts_powl, 1, "powl", 2, _C99 },
849 { rts_sinl, 1, "sinl", 1, _C99 },
850 { rts_cosl, 1, "cosl", 1, _C99 },
851 { rts_tanl, 1, "tanl", 1, _C99 },
852 { rts_asinl, 1, "asinl", 1, _C99 },
853 { rts_acosl, 1, "acosl", 1, _C99 },
854 { rts_atanl, 1, "atanl", 1, _C99 },
855 { rts_sinhl, 1, "sinhl", 1, _C99 },
856 { rts_coshl, 1, "coshl", 1, _C99 },
857 { rts_tanhl, 1, "tanhl", 1, _C99 },
859 { rts_strcmp, 1, "strcmp", 2, _C89 },
860 { rts_strncmp, 1, "strncmp", 3, _C89 },
861 { rts_strcpy, 1, "strcpy", 2, _C89 },
862 { rts_strlen, 1, "strlen", 1, _C89 },
863 { rts_memcpy, 1, "memcpy", 3, _C89 },
864 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
865 { rts_memmove, 1, "memmove", 3, _C89 },
866 { rts_memset, 1, "memset", 3, _C89 },
867 { rts_memcmp, 1, "memcmp", 3, _C89 },
870 static ident *rts_idents[lengthof(rts_data)];
872 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
874 void set_create_ld_ident(ident *(*func)(entity_t*))
876 create_ld_ident = func;
880 * Handle GNU attributes for entities
882 * @param ent the entity
883 * @param decl the routine declaration
885 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
887 assert(is_declaration(entity));
888 decl_modifiers_t modifiers = entity->declaration.modifiers;
890 if (is_method_entity(irentity)) {
891 if (modifiers & DM_PURE) {
892 set_entity_additional_properties(irentity, mtp_property_pure);
894 if (modifiers & DM_CONST) {
895 add_entity_additional_properties(irentity, mtp_property_const);
898 if (modifiers & DM_USED) {
899 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
901 if (modifiers & DM_WEAK) {
902 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
906 static bool is_main(entity_t *entity)
908 static symbol_t *sym_main = NULL;
909 if (sym_main == NULL) {
910 sym_main = symbol_table_insert("main");
913 if (entity->base.symbol != sym_main)
915 /* must be in outermost scope */
916 if (entity->base.parent_scope != ¤t_translation_unit->scope)
923 * Creates an entity representing a function.
925 * @param entity the function declaration/definition
926 * @param owner_type the owner type of this function, NULL
927 * for global functions
929 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
931 assert(entity->kind == ENTITY_FUNCTION);
932 if (entity->function.irentity != NULL) {
933 return entity->function.irentity;
936 entity_t *original_entity = entity;
937 if (entity->function.btk != bk_none) {
938 entity = get_builtin_replacement(entity);
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 original_entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1053 original_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 && entity->function.btk != bk_none) {
1532 ir_entity *irentity = get_function_entity(entity, NULL);
1533 /* for gcc compatibility we have to produce (dummy) addresses for some
1534 * builtins which don't have entities */
1535 if (irentity == NULL) {
1536 source_position_t const *const pos = &ref->base.source_position;
1537 symbol_t const *const sym = ref->entity->base.symbol;
1538 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1540 /* simply create a NULL pointer */
1541 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1542 ir_node *res = new_Const(get_mode_null(mode));
1548 switch ((declaration_kind_t) entity->declaration.kind) {
1549 case DECLARATION_KIND_UNKNOWN:
1552 case DECLARATION_KIND_LOCAL_VARIABLE: {
1553 ir_mode *const mode = get_ir_mode_storage(type);
1554 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1555 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1557 case DECLARATION_KIND_PARAMETER: {
1558 ir_mode *const mode = get_ir_mode_storage(type);
1559 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1560 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1562 case DECLARATION_KIND_FUNCTION: {
1563 return create_symconst(dbgi, entity->function.irentity);
1565 case DECLARATION_KIND_INNER_FUNCTION: {
1566 ir_mode *const mode = get_ir_mode_storage(type);
1567 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1568 /* inner function not using the closure */
1569 return create_symconst(dbgi, entity->function.irentity);
1571 /* need trampoline here */
1572 return create_trampoline(dbgi, mode, entity->function.irentity);
1575 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1576 const variable_t *variable = &entity->variable;
1577 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1578 return deref_address(dbgi, variable->base.type, addr);
1581 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1582 ir_entity *irentity = entity->variable.v.entity;
1583 ir_node *frame = get_local_frame(irentity);
1584 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1585 return deref_address(dbgi, entity->declaration.type, sel);
1587 case DECLARATION_KIND_PARAMETER_ENTITY: {
1588 ir_entity *irentity = entity->parameter.v.entity;
1589 ir_node *frame = get_local_frame(irentity);
1590 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1591 return deref_address(dbgi, entity->declaration.type, sel);
1594 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1595 return entity->variable.v.vla_base;
1597 case DECLARATION_KIND_COMPOUND_MEMBER:
1598 panic("not implemented reference type");
1601 panic("reference to declaration with unknown type found");
1604 static ir_node *reference_addr(const reference_expression_t *ref)
1606 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1607 entity_t *entity = ref->entity;
1608 assert(is_declaration(entity));
1610 switch((declaration_kind_t) entity->declaration.kind) {
1611 case DECLARATION_KIND_UNKNOWN:
1613 case DECLARATION_KIND_PARAMETER:
1614 case DECLARATION_KIND_LOCAL_VARIABLE:
1615 /* you can store to a local variable (so we don't panic but return NULL
1616 * as an indicator for no real address) */
1618 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1619 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1622 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1623 ir_entity *irentity = entity->variable.v.entity;
1624 ir_node *frame = get_local_frame(irentity);
1625 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1629 case DECLARATION_KIND_PARAMETER_ENTITY: {
1630 ir_entity *irentity = entity->parameter.v.entity;
1631 ir_node *frame = get_local_frame(irentity);
1632 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1637 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1638 return entity->variable.v.vla_base;
1640 case DECLARATION_KIND_FUNCTION: {
1641 return create_symconst(dbgi, entity->function.irentity);
1644 case DECLARATION_KIND_INNER_FUNCTION: {
1645 type_t *const type = skip_typeref(entity->declaration.type);
1646 ir_mode *const mode = get_ir_mode_storage(type);
1647 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1648 /* inner function not using the closure */
1649 return create_symconst(dbgi, entity->function.irentity);
1651 /* need trampoline here */
1652 return create_trampoline(dbgi, mode, entity->function.irentity);
1656 case DECLARATION_KIND_COMPOUND_MEMBER:
1657 panic("not implemented reference type");
1660 panic("reference to declaration with unknown type found");
1664 * Generate an unary builtin.
1666 * @param kind the builtin kind to generate
1667 * @param op the operand
1668 * @param function_type the function type for the GNU builtin routine
1669 * @param db debug info
1671 static ir_node *gen_unary_builtin(ir_builtin_kind kind, expression_t *op, type_t *function_type, dbg_info *db)
1674 in[0] = expression_to_firm(op);
1676 ir_type *tp = get_ir_type(function_type);
1677 ir_type *res = get_method_res_type(tp, 0);
1678 ir_node *irn = new_d_Builtin(db, get_irg_no_mem(current_ir_graph), 1, in, kind, tp);
1679 set_irn_pinned(irn, op_pin_state_floats);
1680 return new_Proj(irn, get_type_mode(res), pn_Builtin_1_result);
1684 * Generate a pinned unary builtin.
1686 * @param kind the builtin kind to generate
1687 * @param op the operand
1688 * @param function_type the function type for the GNU builtin routine
1689 * @param db debug info
1691 static ir_node *gen_unary_builtin_pinned(ir_builtin_kind kind, expression_t *op,
1692 type_t *function_type, dbg_info *db)
1695 in[0] = expression_to_firm(op);
1697 ir_type *tp = get_ir_type(function_type);
1698 ir_type *res = get_method_res_type(tp, 0);
1699 ir_node *mem = get_store();
1700 ir_node *irn = new_d_Builtin(db, mem, 1, in, kind, tp);
1701 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1702 return new_Proj(irn, get_type_mode(res), pn_Builtin_1_result);
1706 * Generate an binary-void-return builtin.
1708 * @param kind the builtin kind to generate
1709 * @param op1 the first operand
1710 * @param op2 the second operand
1711 * @param function_type the function type for the GNU builtin routine
1712 * @param db debug info
1714 static ir_node *gen_binary_builtin_mem(ir_builtin_kind kind, expression_t *op1,
1715 expression_t *op2, type_t *function_type,
1719 in[0] = expression_to_firm(op1);
1720 in[1] = expression_to_firm(op2);
1722 ir_type *tp = get_ir_type(function_type);
1723 ir_node *mem = get_store();
1724 ir_node *irn = new_d_Builtin(db, mem, 2, in, kind, tp);
1725 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1730 * Transform calls to builtin functions.
1732 static ir_node *process_builtin_call(const call_expression_t *call)
1734 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1736 assert(call->function->kind == EXPR_REFERENCE);
1737 reference_expression_t *builtin = &call->function->reference;
1739 type_t *expr_type = skip_typeref(builtin->base.type);
1740 assert(is_type_pointer(expr_type));
1742 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1744 switch (builtin->entity->function.btk) {
1745 case bk_gnu_builtin_alloca: {
1746 if (call->arguments == NULL || call->arguments->next != NULL) {
1747 panic("invalid number of parameters on __builtin_alloca");
1749 expression_t *argument = call->arguments->expression;
1750 ir_node *size = expression_to_firm(argument);
1752 ir_node *store = get_store();
1753 ir_node *alloca = new_d_Alloc(dbgi, store, size, firm_unknown_type,
1755 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1757 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1762 case bk_gnu_builtin_huge_val:
1763 case bk_gnu_builtin_huge_valf:
1764 case bk_gnu_builtin_huge_vall:
1765 case bk_gnu_builtin_inf:
1766 case bk_gnu_builtin_inff:
1767 case bk_gnu_builtin_infl: {
1768 type_t *type = function_type->function.return_type;
1769 ir_mode *mode = get_ir_mode_arithmetic(type);
1770 ir_tarval *tv = get_mode_infinite(mode);
1771 ir_node *res = new_d_Const(dbgi, tv);
1774 case bk_gnu_builtin_nan:
1775 case bk_gnu_builtin_nanf:
1776 case bk_gnu_builtin_nanl: {
1777 /* Ignore string for now... */
1778 assert(is_type_function(function_type));
1779 type_t *type = function_type->function.return_type;
1780 ir_mode *mode = get_ir_mode_arithmetic(type);
1781 ir_tarval *tv = get_mode_NAN(mode);
1782 ir_node *res = new_d_Const(dbgi, tv);
1785 case bk_gnu_builtin_expect: {
1786 expression_t *argument = call->arguments->expression;
1787 return _expression_to_firm(argument);
1789 case bk_gnu_builtin_va_end:
1790 /* evaluate the argument of va_end for its side effects */
1791 _expression_to_firm(call->arguments->expression);
1793 case bk_gnu_builtin_frame_address: {
1794 expression_t *const expression = call->arguments->expression;
1795 bool val = fold_constant_to_bool(expression);
1798 return get_irg_frame(current_ir_graph);
1800 /* get the argument */
1803 in[0] = expression_to_firm(expression);
1804 in[1] = get_irg_frame(current_ir_graph);
1805 ir_type *tp = get_ir_type(function_type);
1806 ir_node *irn = new_d_Builtin(dbgi, get_irg_no_mem(current_ir_graph), 2, in, ir_bk_frame_address, tp);
1807 return new_Proj(irn, mode_P_data, pn_Builtin_1_result);
1810 case bk_gnu_builtin_return_address: {
1811 expression_t *const expression = call->arguments->expression;
1814 in[0] = expression_to_firm(expression);
1815 in[1] = get_irg_frame(current_ir_graph);
1816 ir_type *tp = get_ir_type(function_type);
1817 ir_node *irn = new_d_Builtin(dbgi, get_irg_no_mem(current_ir_graph), 2, in, ir_bk_return_address, tp);
1818 return new_Proj(irn, mode_P_data, pn_Builtin_1_result);
1820 case bk_gnu_builtin_ffs:
1821 return gen_unary_builtin(ir_bk_ffs, call->arguments->expression, function_type, dbgi);
1822 case bk_gnu_builtin_clz:
1823 case bk_gnu_builtin_clzl:
1824 case bk_gnu_builtin_clzll:
1825 return gen_unary_builtin(ir_bk_clz, call->arguments->expression, function_type, dbgi);
1826 case bk_gnu_builtin_ctz:
1827 case bk_gnu_builtin_ctzl:
1828 case bk_gnu_builtin_ctzll:
1829 return gen_unary_builtin(ir_bk_ctz, call->arguments->expression, function_type, dbgi);
1830 case bk_gnu_builtin_popcount:
1831 case bk_gnu_builtin_popcountl:
1832 case bk_gnu_builtin_popcountll:
1833 case bk_ms__popcount:
1834 return gen_unary_builtin(ir_bk_popcount, call->arguments->expression, function_type, dbgi);
1835 case bk_gnu_builtin_parity:
1836 return gen_unary_builtin(ir_bk_parity, call->arguments->expression, function_type, dbgi);
1837 case bk_gnu_builtin_prefetch: {
1838 call_argument_t *const args = call->arguments;
1839 expression_t *const addr = args->expression;
1842 in[0] = _expression_to_firm(addr);
1843 if (args->next != NULL) {
1844 expression_t *const rw = args->next->expression;
1846 in[1] = _expression_to_firm(rw);
1848 if (args->next->next != NULL) {
1849 expression_t *const locality = args->next->next->expression;
1851 in[2] = expression_to_firm(locality);
1853 in[2] = new_Const_long(mode_int, 3);
1856 in[1] = new_Const_long(mode_int, 0);
1857 in[2] = new_Const_long(mode_int, 3);
1859 ir_type *tp = get_ir_type(function_type);
1860 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_prefetch, tp);
1861 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1864 case bk_gnu_builtin_object_size: {
1865 /* determine value of "type" */
1866 expression_t *type_expression = call->arguments->next->expression;
1867 long type_val = fold_constant_to_int(type_expression);
1868 type_t *type = function_type->function.return_type;
1869 ir_mode *mode = get_ir_mode_arithmetic(type);
1870 /* just produce a "I don't know" result */
1871 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1872 get_mode_minus_one(mode);
1874 return new_d_Const(dbgi, result);
1876 case bk_gnu_builtin_trap:
1879 ir_type *tp = get_ir_type(function_type);
1880 ir_node *irn = new_d_Builtin(dbgi, get_store(), 0, NULL, ir_bk_trap, tp);
1881 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1884 case bk_ms__debugbreak: {
1885 ir_type *tp = get_ir_type(function_type);
1886 ir_node *irn = new_d_Builtin(dbgi, get_store(), 0, NULL, ir_bk_debugbreak, tp);
1887 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1890 case bk_ms_ReturnAddress: {
1893 in[0] = new_Const(get_mode_null(mode_int));
1894 in[1] = get_irg_frame(current_ir_graph);
1895 ir_type *tp = get_ir_type(function_type);
1896 ir_node *irn = new_d_Builtin(dbgi, get_irg_no_mem(current_ir_graph), 2, in, ir_bk_return_address, tp);
1897 return new_Proj(irn, mode_P_data, pn_Builtin_1_result);
1900 case bk_ms_rotl64: {
1901 ir_node *val = expression_to_firm(call->arguments->expression);
1902 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1903 ir_mode *mode = get_irn_mode(val);
1904 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1907 case bk_ms_rotr64: {
1908 ir_node *val = expression_to_firm(call->arguments->expression);
1909 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1910 ir_mode *mode = get_irn_mode(val);
1911 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1912 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1913 return new_d_Rotl(dbgi, val, sub, mode);
1915 case bk_ms_byteswap_ushort:
1916 case bk_ms_byteswap_ulong:
1917 case bk_ms_byteswap_uint64:
1918 return gen_unary_builtin(ir_bk_bswap, call->arguments->expression, function_type, dbgi);
1921 case bk_ms__indword:
1922 return gen_unary_builtin_pinned(ir_bk_inport, call->arguments->expression, function_type, dbgi);
1923 case bk_ms__outbyte:
1924 case bk_ms__outword:
1925 case bk_ms__outdword:
1926 return gen_binary_builtin_mem(ir_bk_outport, call->arguments->expression,
1927 call->arguments->next->expression, function_type, dbgi);
1929 panic("unsupported builtin found");
1934 * Transform a call expression.
1935 * Handles some special cases, like alloca() calls, which must be resolved
1936 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1937 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1940 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1942 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1943 assert(currently_reachable());
1945 expression_t *function = call->function;
1946 if (function->kind == EXPR_REFERENCE) {
1947 const reference_expression_t *ref = &function->reference;
1948 entity_t *entity = ref->entity;
1950 if (entity->kind == ENTITY_FUNCTION) {
1951 ir_entity *irentity = entity->function.irentity;
1952 if (irentity == NULL)
1953 irentity = get_function_entity(entity, NULL);
1955 if (irentity == NULL && entity->function.btk != bk_none) {
1956 return process_builtin_call(call);
1960 if (irentity == rts_entities[rts_alloca]) {
1961 /* handle alloca() call */
1962 expression_t *argument = call->arguments->expression;
1963 ir_node *size = expression_to_firm(argument);
1964 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
1966 size = create_conv(dbgi, size, mode);
1968 ir_node *store = get_store();
1969 ir_node *alloca = new_d_Alloc(dbgi, store, size,
1970 firm_unknown_type, stack_alloc);
1971 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1973 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1980 ir_node *callee = expression_to_firm(function);
1982 type_t *type = skip_typeref(function->base.type);
1983 assert(is_type_pointer(type));
1984 pointer_type_t *pointer_type = &type->pointer;
1985 type_t *points_to = skip_typeref(pointer_type->points_to);
1986 assert(is_type_function(points_to));
1987 function_type_t *function_type = &points_to->function;
1989 int n_parameters = 0;
1990 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1991 ir_type *new_method_type = NULL;
1992 if (function_type->variadic || function_type->unspecified_parameters) {
1993 const call_argument_t *argument = call->arguments;
1994 for ( ; argument != NULL; argument = argument->next) {
1998 /* we need to construct a new method type matching the call
2000 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
2001 int n_res = get_method_n_ress(ir_method_type);
2002 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
2003 set_method_calling_convention(new_method_type,
2004 get_method_calling_convention(ir_method_type));
2005 set_method_additional_properties(new_method_type,
2006 get_method_additional_properties(ir_method_type));
2007 set_method_variadicity(new_method_type,
2008 get_method_variadicity(ir_method_type));
2010 for (int i = 0; i < n_res; ++i) {
2011 set_method_res_type(new_method_type, i,
2012 get_method_res_type(ir_method_type, i));
2014 argument = call->arguments;
2015 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
2016 expression_t *expression = argument->expression;
2017 ir_type *irtype = get_ir_type(expression->base.type);
2018 set_method_param_type(new_method_type, i, irtype);
2020 ir_method_type = new_method_type;
2022 n_parameters = get_method_n_params(ir_method_type);
2025 ir_node *in[n_parameters];
2027 const call_argument_t *argument = call->arguments;
2028 for (int n = 0; n < n_parameters; ++n) {
2029 expression_t *expression = argument->expression;
2030 ir_node *arg_node = expression_to_firm(expression);
2032 type_t *arg_type = skip_typeref(expression->base.type);
2033 if (!is_type_compound(arg_type)) {
2034 ir_mode *mode = get_ir_mode_storage(expression->base.type);
2035 arg_node = create_conv(dbgi, arg_node, mode);
2036 arg_node = do_strict_conv(dbgi, arg_node);
2041 argument = argument->next;
2044 ir_node *store = get_store();
2045 ir_node *node = new_d_Call(dbgi, store, callee, n_parameters, in,
2047 ir_node *mem = new_d_Proj(dbgi, node, mode_M, pn_Call_M);
2050 type_t *return_type = skip_typeref(function_type->return_type);
2051 ir_node *result = NULL;
2053 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
2054 ir_node *resproj = new_d_Proj(dbgi, node, mode_T, pn_Call_T_result);
2056 if (is_type_scalar(return_type)) {
2057 ir_mode *mode = get_ir_mode_storage(return_type);
2058 result = new_d_Proj(dbgi, resproj, mode, 0);
2059 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
2060 result = create_conv(NULL, result, mode_arith);
2062 ir_mode *mode = mode_P_data;
2063 result = new_d_Proj(dbgi, resproj, mode, 0);
2067 if (function->kind == EXPR_REFERENCE &&
2068 function->reference.entity->declaration.modifiers & DM_NORETURN) {
2069 /* A dead end: Keep the Call and the Block. Also place all further
2070 * nodes into a new and unreachable block. */
2072 keep_alive(get_cur_block());
2073 ir_node *block = new_Block(0, NULL);
2074 set_cur_block(block);
2080 static void statement_to_firm(statement_t *statement);
2081 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
2083 static ir_node *expression_to_addr(const expression_t *expression);
2084 static ir_node *create_condition_evaluation(const expression_t *expression,
2085 ir_node *true_block,
2086 ir_node *false_block);
2088 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
2091 if (!is_type_compound(type)) {
2092 ir_mode *mode = get_ir_mode_storage(type);
2093 value = create_conv(dbgi, value, mode);
2094 value = do_strict_conv(dbgi, value);
2097 ir_node *memory = get_store();
2099 if (is_type_scalar(type)) {
2100 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
2101 ? cons_volatile : cons_none;
2102 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
2103 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2104 set_store(store_mem);
2106 ir_type *irtype = get_ir_type(type);
2107 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
2108 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
2109 set_store(copyb_mem);
2113 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
2115 ir_tarval *all_one = get_mode_all_one(mode);
2116 int mode_size = get_mode_size_bits(mode);
2118 assert(offset >= 0);
2120 assert(offset + size <= mode_size);
2121 if (size == mode_size) {
2125 long shiftr = get_mode_size_bits(mode) - size;
2126 long shiftl = offset;
2127 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
2128 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
2129 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
2130 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
2135 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
2136 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile)
2138 ir_type *entity_type = get_entity_type(entity);
2139 ir_type *base_type = get_primitive_base_type(entity_type);
2140 assert(base_type != NULL);
2141 ir_mode *mode = get_type_mode(base_type);
2143 value = create_conv(dbgi, value, mode);
2145 /* kill upper bits of value and shift to right position */
2146 int bitoffset = get_entity_offset_bits_remainder(entity);
2147 int bitsize = get_mode_size_bits(get_type_mode(entity_type));
2148 ir_tarval *mask = create_bitfield_mask(mode, 0, bitsize);
2149 ir_node *mask_node = new_d_Const(dbgi, mask);
2150 ir_node *value_masked = new_d_And(dbgi, value, mask_node, mode);
2151 ir_tarval *shiftl = new_tarval_from_long(bitoffset, mode_uint);
2152 ir_node *shiftcount = new_d_Const(dbgi, shiftl);
2153 ir_node *value_maskshift = new_d_Shl(dbgi, value_masked, shiftcount, mode);
2155 /* load current value */
2156 ir_node *mem = get_store();
2157 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2158 set_volatile ? cons_volatile : cons_none);
2159 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2160 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2161 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2162 ir_tarval *inv_mask = tarval_not(shift_mask);
2163 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2164 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2166 /* construct new value and store */
2167 ir_node *new_val = new_d_Or(dbgi, load_res_masked, value_maskshift, mode);
2168 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2169 set_volatile ? cons_volatile : cons_none);
2170 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2171 set_store(store_mem);
2173 return value_masked;
2176 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2179 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2180 entity_t *entity = expression->compound_entry;
2181 type_t *base_type = entity->declaration.type;
2182 ir_mode *mode = get_ir_mode_storage(base_type);
2183 ir_node *mem = get_store();
2184 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2185 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2186 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2188 ir_mode *amode = mode;
2189 /* optimisation, since shifting in modes < machine_size is usually
2191 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2194 unsigned amode_size = get_mode_size_bits(amode);
2195 load_res = create_conv(dbgi, load_res, amode);
2197 set_store(load_mem);
2199 /* kill upper bits */
2200 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2201 int bitoffset = entity->compound_member.bit_offset;
2202 int bitsize = entity->compound_member.bit_size;
2203 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2204 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2205 ir_node *countl = new_d_Const(dbgi, tvl);
2206 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2208 unsigned shift_bitsr = bitoffset + shift_bitsl;
2209 assert(shift_bitsr <= amode_size);
2210 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2211 ir_node *countr = new_d_Const(dbgi, tvr);
2213 if (mode_is_signed(mode)) {
2214 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2216 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2219 type_t *type = expression->base.type;
2220 ir_mode *resmode = get_ir_mode_arithmetic(type);
2221 return create_conv(dbgi, shiftr, resmode);
2224 /* make sure the selected compound type is constructed */
2225 static void construct_select_compound(const select_expression_t *expression)
2227 type_t *type = skip_typeref(expression->compound->base.type);
2228 if (is_type_pointer(type)) {
2229 type = type->pointer.points_to;
2231 (void) get_ir_type(type);
2234 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2235 ir_node *value, ir_node *addr)
2237 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2238 type_t *type = skip_typeref(expression->base.type);
2240 if (!is_type_compound(type)) {
2241 ir_mode *mode = get_ir_mode_storage(type);
2242 value = create_conv(dbgi, value, mode);
2243 value = do_strict_conv(dbgi, value);
2246 if (expression->kind == EXPR_REFERENCE) {
2247 const reference_expression_t *ref = &expression->reference;
2249 entity_t *entity = ref->entity;
2250 assert(is_declaration(entity));
2251 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2252 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2253 set_value(entity->variable.v.value_number, value);
2255 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2256 set_value(entity->parameter.v.value_number, value);
2262 addr = expression_to_addr(expression);
2263 assert(addr != NULL);
2265 if (expression->kind == EXPR_SELECT) {
2266 const select_expression_t *select = &expression->select;
2268 construct_select_compound(select);
2270 entity_t *entity = select->compound_entry;
2271 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2272 if (entity->compound_member.bitfield) {
2273 ir_entity *irentity = entity->compound_member.entity;
2275 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2276 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2282 assign_value(dbgi, addr, type, value);
2286 static void set_value_for_expression(const expression_t *expression,
2289 set_value_for_expression_addr(expression, value, NULL);
2292 static ir_node *get_value_from_lvalue(const expression_t *expression,
2295 if (expression->kind == EXPR_REFERENCE) {
2296 const reference_expression_t *ref = &expression->reference;
2298 entity_t *entity = ref->entity;
2299 assert(entity->kind == ENTITY_VARIABLE
2300 || entity->kind == ENTITY_PARAMETER);
2301 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2303 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2304 value_number = entity->variable.v.value_number;
2305 assert(addr == NULL);
2306 type_t *type = skip_typeref(expression->base.type);
2307 ir_mode *mode = get_ir_mode_storage(type);
2308 ir_node *res = get_value(value_number, mode);
2309 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2310 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2311 value_number = entity->parameter.v.value_number;
2312 assert(addr == NULL);
2313 type_t *type = skip_typeref(expression->base.type);
2314 ir_mode *mode = get_ir_mode_storage(type);
2315 ir_node *res = get_value(value_number, mode);
2316 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2320 assert(addr != NULL);
2321 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2324 if (expression->kind == EXPR_SELECT &&
2325 expression->select.compound_entry->compound_member.bitfield) {
2326 construct_select_compound(&expression->select);
2327 value = bitfield_extract_to_firm(&expression->select, addr);
2329 value = deref_address(dbgi, expression->base.type, addr);
2336 static ir_node *create_incdec(const unary_expression_t *expression)
2338 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2339 const expression_t *value_expr = expression->value;
2340 ir_node *addr = expression_to_addr(value_expr);
2341 ir_node *value = get_value_from_lvalue(value_expr, addr);
2343 type_t *type = skip_typeref(expression->base.type);
2344 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2347 if (is_type_pointer(type)) {
2348 pointer_type_t *pointer_type = &type->pointer;
2349 offset = get_type_size_node(pointer_type->points_to);
2351 assert(is_type_arithmetic(type));
2352 offset = new_Const(get_mode_one(mode));
2356 ir_node *store_value;
2357 switch(expression->base.kind) {
2358 case EXPR_UNARY_POSTFIX_INCREMENT:
2360 store_value = new_d_Add(dbgi, value, offset, mode);
2362 case EXPR_UNARY_POSTFIX_DECREMENT:
2364 store_value = new_d_Sub(dbgi, value, offset, mode);
2366 case EXPR_UNARY_PREFIX_INCREMENT:
2367 result = new_d_Add(dbgi, value, offset, mode);
2368 store_value = result;
2370 case EXPR_UNARY_PREFIX_DECREMENT:
2371 result = new_d_Sub(dbgi, value, offset, mode);
2372 store_value = result;
2375 panic("no incdec expr in create_incdec");
2378 set_value_for_expression_addr(value_expr, store_value, addr);
2383 static bool is_local_variable(expression_t *expression)
2385 if (expression->kind != EXPR_REFERENCE)
2387 reference_expression_t *ref_expr = &expression->reference;
2388 entity_t *entity = ref_expr->entity;
2389 if (entity->kind != ENTITY_VARIABLE)
2391 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2392 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2395 static ir_relation get_relation(const expression_kind_t kind)
2398 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2399 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2400 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2401 case EXPR_BINARY_ISLESS:
2402 case EXPR_BINARY_LESS: return ir_relation_less;
2403 case EXPR_BINARY_ISLESSEQUAL:
2404 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2405 case EXPR_BINARY_ISGREATER:
2406 case EXPR_BINARY_GREATER: return ir_relation_greater;
2407 case EXPR_BINARY_ISGREATEREQUAL:
2408 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2409 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2414 panic("trying to get pn_Cmp from non-comparison binexpr type");
2418 * Handle the assume optimizer hint: check if a Confirm
2419 * node can be created.
2421 * @param dbi debug info
2422 * @param expr the IL assume expression
2424 * we support here only some simple cases:
2429 static ir_node *handle_assume_compare(dbg_info *dbi,
2430 const binary_expression_t *expression)
2432 expression_t *op1 = expression->left;
2433 expression_t *op2 = expression->right;
2434 entity_t *var2, *var = NULL;
2435 ir_node *res = NULL;
2436 ir_relation relation = get_relation(expression->base.kind);
2438 if (is_local_variable(op1) && is_local_variable(op2)) {
2439 var = op1->reference.entity;
2440 var2 = op2->reference.entity;
2442 type_t *const type = skip_typeref(var->declaration.type);
2443 ir_mode *const mode = get_ir_mode_storage(type);
2445 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2446 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2448 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2449 set_value(var2->variable.v.value_number, res);
2451 res = new_d_Confirm(dbi, irn1, irn2, relation);
2452 set_value(var->variable.v.value_number, res);
2457 expression_t *con = NULL;
2458 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2459 var = op1->reference.entity;
2461 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2462 relation = get_inversed_relation(relation);
2463 var = op2->reference.entity;
2468 type_t *const type = skip_typeref(var->declaration.type);
2469 ir_mode *const mode = get_ir_mode_storage(type);
2471 res = get_value(var->variable.v.value_number, mode);
2472 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2473 set_value(var->variable.v.value_number, res);
2479 * Handle the assume optimizer hint.
2481 * @param dbi debug info
2482 * @param expr the IL assume expression
2484 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2486 switch(expression->kind) {
2487 case EXPR_BINARY_EQUAL:
2488 case EXPR_BINARY_NOTEQUAL:
2489 case EXPR_BINARY_LESS:
2490 case EXPR_BINARY_LESSEQUAL:
2491 case EXPR_BINARY_GREATER:
2492 case EXPR_BINARY_GREATEREQUAL:
2493 return handle_assume_compare(dbi, &expression->binary);
2499 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2500 type_t *from_type, type_t *type)
2502 type = skip_typeref(type);
2503 if (type == type_void) {
2504 /* make sure firm type is constructed */
2505 (void) get_ir_type(type);
2508 if (!is_type_scalar(type)) {
2509 /* make sure firm type is constructed */
2510 (void) get_ir_type(type);
2514 from_type = skip_typeref(from_type);
2515 ir_mode *mode = get_ir_mode_storage(type);
2516 /* check for conversion from / to __based types */
2517 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2518 const variable_t *from_var = from_type->pointer.base_variable;
2519 const variable_t *to_var = type->pointer.base_variable;
2520 if (from_var != to_var) {
2521 if (from_var != NULL) {
2522 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2523 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2524 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2526 if (to_var != NULL) {
2527 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2528 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2529 value_node = new_d_Sub(dbgi, value_node, base, mode);
2534 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2535 /* bool adjustments (we save a mode_Bu, but have to temporarily
2536 * convert to mode_b so we only get a 0/1 value */
2537 value_node = create_conv(dbgi, value_node, mode_b);
2540 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2541 ir_node *node = create_conv(dbgi, value_node, mode);
2542 node = do_strict_conv(dbgi, node);
2543 node = create_conv(dbgi, node, mode_arith);
2548 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2550 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2551 type_t *type = skip_typeref(expression->base.type);
2553 if (expression->base.kind == EXPR_UNARY_TAKE_ADDRESS)
2554 return expression_to_addr(expression->value);
2556 const expression_t *value = expression->value;
2558 switch(expression->base.kind) {
2559 case EXPR_UNARY_NEGATE: {
2560 ir_node *value_node = expression_to_firm(value);
2561 ir_mode *mode = get_ir_mode_arithmetic(type);
2562 return new_d_Minus(dbgi, value_node, mode);
2564 case EXPR_UNARY_PLUS:
2565 return expression_to_firm(value);
2566 case EXPR_UNARY_BITWISE_NEGATE: {
2567 ir_node *value_node = expression_to_firm(value);
2568 ir_mode *mode = get_ir_mode_arithmetic(type);
2569 return new_d_Not(dbgi, value_node, mode);
2571 case EXPR_UNARY_NOT: {
2572 ir_node *value_node = _expression_to_firm(value);
2573 value_node = create_conv(dbgi, value_node, mode_b);
2574 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2577 case EXPR_UNARY_DEREFERENCE: {
2578 ir_node *value_node = expression_to_firm(value);
2579 type_t *value_type = skip_typeref(value->base.type);
2580 assert(is_type_pointer(value_type));
2582 /* check for __based */
2583 const variable_t *const base_var = value_type->pointer.base_variable;
2584 if (base_var != NULL) {
2585 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2586 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2587 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2589 type_t *points_to = value_type->pointer.points_to;
2590 return deref_address(dbgi, points_to, value_node);
2592 case EXPR_UNARY_POSTFIX_INCREMENT:
2593 case EXPR_UNARY_POSTFIX_DECREMENT:
2594 case EXPR_UNARY_PREFIX_INCREMENT:
2595 case EXPR_UNARY_PREFIX_DECREMENT:
2596 return create_incdec(expression);
2597 case EXPR_UNARY_CAST: {
2598 ir_node *value_node = expression_to_firm(value);
2599 type_t *from_type = value->base.type;
2600 return create_cast(dbgi, value_node, from_type, type);
2602 case EXPR_UNARY_ASSUME:
2603 return handle_assume(dbgi, value);
2608 panic("invalid UNEXPR type found");
2612 * produces a 0/1 depending of the value of a mode_b node
2614 static ir_node *produce_condition_result(const expression_t *expression,
2615 ir_mode *mode, dbg_info *dbgi)
2617 ir_node *const one_block = new_immBlock();
2618 ir_node *const zero_block = new_immBlock();
2619 create_condition_evaluation(expression, one_block, zero_block);
2620 mature_immBlock(one_block);
2621 mature_immBlock(zero_block);
2623 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2624 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2625 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2626 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2627 set_cur_block(block);
2629 ir_node *const one = new_Const(get_mode_one(mode));
2630 ir_node *const zero = new_Const(get_mode_null(mode));
2631 ir_node *const in[2] = { one, zero };
2632 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2637 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2638 ir_node *value, type_t *type)
2640 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2641 assert(is_type_pointer(type));
2642 pointer_type_t *const pointer_type = &type->pointer;
2643 type_t *const points_to = skip_typeref(pointer_type->points_to);
2644 ir_node * elem_size = get_type_size_node(points_to);
2645 elem_size = create_conv(dbgi, elem_size, mode);
2646 value = create_conv(dbgi, value, mode);
2647 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2651 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2652 ir_node *left, ir_node *right)
2655 type_t *type_left = skip_typeref(expression->left->base.type);
2656 type_t *type_right = skip_typeref(expression->right->base.type);
2658 expression_kind_t kind = expression->base.kind;
2661 case EXPR_BINARY_SHIFTLEFT:
2662 case EXPR_BINARY_SHIFTRIGHT:
2663 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2664 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2665 mode = get_ir_mode_arithmetic(expression->base.type);
2666 right = create_conv(dbgi, right, mode_uint);
2669 case EXPR_BINARY_SUB:
2670 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2671 const pointer_type_t *const ptr_type = &type_left->pointer;
2673 mode = get_ir_mode_arithmetic(expression->base.type);
2674 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2675 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2676 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2677 ir_node *const no_mem = new_NoMem();
2678 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2679 mode, op_pin_state_floats);
2680 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2683 case EXPR_BINARY_SUB_ASSIGN:
2684 if (is_type_pointer(type_left)) {
2685 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2686 mode = get_ir_mode_arithmetic(type_left);
2691 case EXPR_BINARY_ADD:
2692 case EXPR_BINARY_ADD_ASSIGN:
2693 if (is_type_pointer(type_left)) {
2694 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2695 mode = get_ir_mode_arithmetic(type_left);
2697 } else if (is_type_pointer(type_right)) {
2698 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2699 mode = get_ir_mode_arithmetic(type_right);
2706 mode = get_ir_mode_arithmetic(type_right);
2707 left = create_conv(dbgi, left, mode);
2712 case EXPR_BINARY_ADD_ASSIGN:
2713 case EXPR_BINARY_ADD:
2714 return new_d_Add(dbgi, left, right, mode);
2715 case EXPR_BINARY_SUB_ASSIGN:
2716 case EXPR_BINARY_SUB:
2717 return new_d_Sub(dbgi, left, right, mode);
2718 case EXPR_BINARY_MUL_ASSIGN:
2719 case EXPR_BINARY_MUL:
2720 return new_d_Mul(dbgi, left, right, mode);
2721 case EXPR_BINARY_BITWISE_AND:
2722 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2723 return new_d_And(dbgi, left, right, mode);
2724 case EXPR_BINARY_BITWISE_OR:
2725 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2726 return new_d_Or(dbgi, left, right, mode);
2727 case EXPR_BINARY_BITWISE_XOR:
2728 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2729 return new_d_Eor(dbgi, left, right, mode);
2730 case EXPR_BINARY_SHIFTLEFT:
2731 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2732 return new_d_Shl(dbgi, left, right, mode);
2733 case EXPR_BINARY_SHIFTRIGHT:
2734 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2735 if (mode_is_signed(mode)) {
2736 return new_d_Shrs(dbgi, left, right, mode);
2738 return new_d_Shr(dbgi, left, right, mode);
2740 case EXPR_BINARY_DIV:
2741 case EXPR_BINARY_DIV_ASSIGN: {
2742 ir_node *pin = new_Pin(new_NoMem());
2743 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2744 op_pin_state_floats);
2745 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2748 case EXPR_BINARY_MOD:
2749 case EXPR_BINARY_MOD_ASSIGN: {
2750 ir_node *pin = new_Pin(new_NoMem());
2751 assert(!mode_is_float(mode));
2752 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2753 op_pin_state_floats);
2754 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2758 panic("unexpected expression kind");
2762 static ir_node *create_lazy_op(const binary_expression_t *expression)
2764 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2765 type_t *type = skip_typeref(expression->base.type);
2766 ir_mode *mode = get_ir_mode_arithmetic(type);
2768 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2769 bool val = fold_constant_to_bool(expression->left);
2770 expression_kind_t ekind = expression->base.kind;
2771 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2772 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2774 return new_Const(get_mode_null(mode));
2778 return new_Const(get_mode_one(mode));
2782 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2783 bool valr = fold_constant_to_bool(expression->right);
2784 return create_Const_from_bool(mode, valr);
2787 return produce_condition_result(expression->right, mode, dbgi);
2790 return produce_condition_result((const expression_t*) expression, mode,
2794 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2795 ir_node *right, ir_mode *mode);
2797 static ir_node *create_assign_binop(const binary_expression_t *expression)
2799 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2800 const expression_t *left_expr = expression->left;
2801 type_t *type = skip_typeref(left_expr->base.type);
2802 ir_node *right = expression_to_firm(expression->right);
2803 ir_node *left_addr = expression_to_addr(left_expr);
2804 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2805 ir_node *result = create_op(dbgi, expression, left, right);
2807 result = create_cast(dbgi, result, expression->right->base.type, type);
2808 result = do_strict_conv(dbgi, result);
2810 result = set_value_for_expression_addr(left_expr, result, left_addr);
2812 if (!is_type_compound(type)) {
2813 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2814 result = create_conv(dbgi, result, mode_arithmetic);
2819 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2821 expression_kind_t kind = expression->base.kind;
2824 case EXPR_BINARY_EQUAL:
2825 case EXPR_BINARY_NOTEQUAL:
2826 case EXPR_BINARY_LESS:
2827 case EXPR_BINARY_LESSEQUAL:
2828 case EXPR_BINARY_GREATER:
2829 case EXPR_BINARY_GREATEREQUAL:
2830 case EXPR_BINARY_ISGREATER:
2831 case EXPR_BINARY_ISGREATEREQUAL:
2832 case EXPR_BINARY_ISLESS:
2833 case EXPR_BINARY_ISLESSEQUAL:
2834 case EXPR_BINARY_ISLESSGREATER:
2835 case EXPR_BINARY_ISUNORDERED: {
2836 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2837 ir_node *left = expression_to_firm(expression->left);
2838 ir_node *right = expression_to_firm(expression->right);
2839 ir_relation relation = get_relation(kind);
2840 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2843 case EXPR_BINARY_ASSIGN: {
2844 ir_node *addr = expression_to_addr(expression->left);
2845 ir_node *right = expression_to_firm(expression->right);
2847 = set_value_for_expression_addr(expression->left, right, addr);
2849 type_t *type = skip_typeref(expression->base.type);
2850 if (!is_type_compound(type)) {
2851 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2852 res = create_conv(NULL, res, mode_arithmetic);
2856 case EXPR_BINARY_ADD:
2857 case EXPR_BINARY_SUB:
2858 case EXPR_BINARY_MUL:
2859 case EXPR_BINARY_DIV:
2860 case EXPR_BINARY_MOD:
2861 case EXPR_BINARY_BITWISE_AND:
2862 case EXPR_BINARY_BITWISE_OR:
2863 case EXPR_BINARY_BITWISE_XOR:
2864 case EXPR_BINARY_SHIFTLEFT:
2865 case EXPR_BINARY_SHIFTRIGHT:
2867 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2868 ir_node *left = expression_to_firm(expression->left);
2869 ir_node *right = expression_to_firm(expression->right);
2870 return create_op(dbgi, expression, left, right);
2872 case EXPR_BINARY_LOGICAL_AND:
2873 case EXPR_BINARY_LOGICAL_OR:
2874 return create_lazy_op(expression);
2875 case EXPR_BINARY_COMMA:
2876 /* create side effects of left side */
2877 (void) expression_to_firm(expression->left);
2878 return _expression_to_firm(expression->right);
2880 case EXPR_BINARY_ADD_ASSIGN:
2881 case EXPR_BINARY_SUB_ASSIGN:
2882 case EXPR_BINARY_MUL_ASSIGN:
2883 case EXPR_BINARY_MOD_ASSIGN:
2884 case EXPR_BINARY_DIV_ASSIGN:
2885 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2886 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2887 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2888 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2889 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2890 return create_assign_binop(expression);
2892 panic("TODO binexpr type");
2896 static ir_node *array_access_addr(const array_access_expression_t *expression)
2898 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2899 ir_node *base_addr = expression_to_firm(expression->array_ref);
2900 ir_node *offset = expression_to_firm(expression->index);
2901 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2902 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2903 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2908 static ir_node *array_access_to_firm(
2909 const array_access_expression_t *expression)
2911 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2912 ir_node *addr = array_access_addr(expression);
2913 type_t *type = revert_automatic_type_conversion(
2914 (const expression_t*) expression);
2915 type = skip_typeref(type);
2917 return deref_address(dbgi, type, addr);
2920 static long get_offsetof_offset(const offsetof_expression_t *expression)
2922 type_t *orig_type = expression->type;
2925 designator_t *designator = expression->designator;
2926 for ( ; designator != NULL; designator = designator->next) {
2927 type_t *type = skip_typeref(orig_type);
2928 /* be sure the type is constructed */
2929 (void) get_ir_type(type);
2931 if (designator->symbol != NULL) {
2932 assert(is_type_compound(type));
2933 symbol_t *symbol = designator->symbol;
2935 compound_t *compound = type->compound.compound;
2936 entity_t *iter = compound->members.entities;
2937 for ( ; iter != NULL; iter = iter->base.next) {
2938 if (iter->base.symbol == symbol) {
2942 assert(iter != NULL);
2944 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2945 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2946 offset += get_entity_offset(iter->compound_member.entity);
2948 orig_type = iter->declaration.type;
2950 expression_t *array_index = designator->array_index;
2951 assert(designator->array_index != NULL);
2952 assert(is_type_array(type));
2954 long index = fold_constant_to_int(array_index);
2955 ir_type *arr_type = get_ir_type(type);
2956 ir_type *elem_type = get_array_element_type(arr_type);
2957 long elem_size = get_type_size_bytes(elem_type);
2959 offset += index * elem_size;
2961 orig_type = type->array.element_type;
2968 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2970 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2971 long offset = get_offsetof_offset(expression);
2972 ir_tarval *tv = new_tarval_from_long(offset, mode);
2973 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2975 return new_d_Const(dbgi, tv);
2978 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2979 ir_entity *entity, type_t *type);
2981 static ir_node *compound_literal_to_firm(
2982 const compound_literal_expression_t *expression)
2984 type_t *type = expression->type;
2986 /* create an entity on the stack */
2987 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2989 ident *const id = id_unique("CompLit.%u");
2990 ir_type *const irtype = get_ir_type(type);
2991 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2992 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2993 set_entity_ld_ident(entity, id);
2995 /* create initialisation code */
2996 initializer_t *initializer = expression->initializer;
2997 create_local_initializer(initializer, dbgi, entity, type);
2999 /* create a sel for the compound literal address */
3000 ir_node *frame = get_irg_frame(current_ir_graph);
3001 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
3006 * Transform a sizeof expression into Firm code.
3008 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
3010 type_t *const type = skip_typeref(expression->type);
3011 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
3012 if (is_type_array(type) && type->array.is_vla
3013 && expression->tp_expression != NULL) {
3014 expression_to_firm(expression->tp_expression);
3016 /* strange gnu extensions: sizeof(function) == 1 */
3017 if (is_type_function(type)) {
3018 ir_mode *mode = get_ir_mode_storage(type_size_t);
3019 return new_Const(get_mode_one(mode));
3022 return get_type_size_node(type);
3025 static entity_t *get_expression_entity(const expression_t *expression)
3027 if (expression->kind != EXPR_REFERENCE)
3030 return expression->reference.entity;
3033 static unsigned get_cparser_entity_alignment(const entity_t *entity)
3035 switch(entity->kind) {
3036 DECLARATION_KIND_CASES
3037 return entity->declaration.alignment;
3040 return entity->compound.alignment;
3041 case ENTITY_TYPEDEF:
3042 return entity->typedefe.alignment;
3050 * Transform an alignof expression into Firm code.
3052 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
3054 unsigned alignment = 0;
3056 const expression_t *tp_expression = expression->tp_expression;
3057 if (tp_expression != NULL) {
3058 entity_t *entity = get_expression_entity(tp_expression);
3059 if (entity != NULL) {
3060 if (entity->kind == ENTITY_FUNCTION) {
3061 /* a gnu-extension */
3064 alignment = get_cparser_entity_alignment(entity);
3069 if (alignment == 0) {
3070 type_t *type = expression->type;
3071 alignment = get_type_alignment(type);
3074 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3075 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3076 ir_tarval *tv = new_tarval_from_long(alignment, mode);
3077 return new_d_Const(dbgi, tv);
3080 static void init_ir_types(void);
3082 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
3084 assert(is_type_valid(skip_typeref(expression->base.type)));
3086 bool constant_folding_old = constant_folding;
3087 constant_folding = true;
3091 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
3093 ir_graph *old_current_ir_graph = current_ir_graph;
3094 current_ir_graph = get_const_code_irg();
3096 ir_node *cnst = expression_to_firm(expression);
3097 current_ir_graph = old_current_ir_graph;
3099 if (!is_Const(cnst)) {
3100 panic("couldn't fold constant");
3103 constant_folding = constant_folding_old;
3105 return get_Const_tarval(cnst);
3108 /* this function is only used in parser.c, but it relies on libfirm functionality */
3109 bool constant_is_negative(const expression_t *expression)
3111 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
3112 ir_tarval *tv = fold_constant_to_tarval(expression);
3113 return tarval_is_negative(tv);
3116 long fold_constant_to_int(const expression_t *expression)
3118 if (expression->kind == EXPR_INVALID)
3121 ir_tarval *tv = fold_constant_to_tarval(expression);
3122 if (!tarval_is_long(tv)) {
3123 panic("result of constant folding is not integer");
3126 return get_tarval_long(tv);
3129 bool fold_constant_to_bool(const expression_t *expression)
3131 if (expression->kind == EXPR_INVALID)
3133 ir_tarval *tv = fold_constant_to_tarval(expression);
3134 return !tarval_is_null(tv);
3137 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3139 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3141 /* first try to fold a constant condition */
3142 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3143 bool val = fold_constant_to_bool(expression->condition);
3145 expression_t *true_expression = expression->true_expression;
3146 if (true_expression == NULL)
3147 true_expression = expression->condition;
3148 return expression_to_firm(true_expression);
3150 return expression_to_firm(expression->false_expression);
3154 ir_node *const true_block = new_immBlock();
3155 ir_node *const false_block = new_immBlock();
3156 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3157 mature_immBlock(true_block);
3158 mature_immBlock(false_block);
3160 set_cur_block(true_block);
3162 if (expression->true_expression != NULL) {
3163 true_val = expression_to_firm(expression->true_expression);
3164 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3165 true_val = cond_expr;
3167 /* Condition ended with a short circuit (&&, ||, !) operation or a
3168 * comparison. Generate a "1" as value for the true branch. */
3169 true_val = new_Const(get_mode_one(mode_Is));
3171 ir_node *const true_jmp = new_d_Jmp(dbgi);
3173 set_cur_block(false_block);
3174 ir_node *const false_val = expression_to_firm(expression->false_expression);
3175 ir_node *const false_jmp = new_d_Jmp(dbgi);
3177 /* create the common block */
3178 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3179 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3180 set_cur_block(block);
3182 /* TODO improve static semantics, so either both or no values are NULL */
3183 if (true_val == NULL || false_val == NULL)
3186 ir_node *const in[2] = { true_val, false_val };
3187 type_t *const type = skip_typeref(expression->base.type);
3189 if (is_type_compound(type)) {
3192 mode = get_ir_mode_arithmetic(type);
3194 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3200 * Returns an IR-node representing the address of a field.
3202 static ir_node *select_addr(const select_expression_t *expression)
3204 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3206 construct_select_compound(expression);
3208 ir_node *compound_addr = expression_to_firm(expression->compound);
3210 entity_t *entry = expression->compound_entry;
3211 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3212 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3214 if (constant_folding) {
3215 ir_mode *mode = get_irn_mode(compound_addr);
3216 /* FIXME: here, we need an integer mode with the same number of bits as mode */
3217 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3218 return new_d_Add(dbgi, compound_addr, ofs, mode);
3220 ir_entity *irentity = entry->compound_member.entity;
3221 assert(irentity != NULL);
3222 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3226 static ir_node *select_to_firm(const select_expression_t *expression)
3228 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3229 ir_node *addr = select_addr(expression);
3230 type_t *type = revert_automatic_type_conversion(
3231 (const expression_t*) expression);
3232 type = skip_typeref(type);
3234 entity_t *entry = expression->compound_entry;
3235 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3237 if (entry->compound_member.bitfield) {
3238 return bitfield_extract_to_firm(expression, addr);
3241 return deref_address(dbgi, type, addr);
3244 /* Values returned by __builtin_classify_type. */
3245 typedef enum gcc_type_class
3251 enumeral_type_class,
3254 reference_type_class,
3258 function_type_class,
3269 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3271 type_t *type = expr->type_expression->base.type;
3273 /* FIXME gcc returns different values depending on whether compiling C or C++
3274 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3277 type = skip_typeref(type);
3278 switch (type->kind) {
3280 const atomic_type_t *const atomic_type = &type->atomic;
3281 switch (atomic_type->akind) {
3282 /* should not be reached */
3283 case ATOMIC_TYPE_INVALID:
3287 /* gcc cannot do that */
3288 case ATOMIC_TYPE_VOID:
3289 tc = void_type_class;
3292 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3293 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3294 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3295 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3296 case ATOMIC_TYPE_SHORT:
3297 case ATOMIC_TYPE_USHORT:
3298 case ATOMIC_TYPE_INT:
3299 case ATOMIC_TYPE_UINT:
3300 case ATOMIC_TYPE_LONG:
3301 case ATOMIC_TYPE_ULONG:
3302 case ATOMIC_TYPE_LONGLONG:
3303 case ATOMIC_TYPE_ULONGLONG:
3304 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3305 tc = integer_type_class;
3308 case ATOMIC_TYPE_FLOAT:
3309 case ATOMIC_TYPE_DOUBLE:
3310 case ATOMIC_TYPE_LONG_DOUBLE:
3311 tc = real_type_class;
3314 panic("Unexpected atomic type in classify_type_to_firm().");
3317 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3318 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3319 case TYPE_ARRAY: /* gcc handles this as pointer */
3320 case TYPE_FUNCTION: /* gcc handles this as pointer */
3321 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3322 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3323 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3325 /* gcc handles this as integer */
3326 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3328 /* gcc classifies the referenced type */
3329 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3331 /* typedef/typeof should be skipped already */
3338 panic("unexpected TYPE classify_type_to_firm().");
3342 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3343 ir_tarval *const tv = new_tarval_from_long(tc, mode_int);
3344 return new_d_Const(dbgi, tv);
3347 static ir_node *function_name_to_firm(
3348 const funcname_expression_t *const expr)
3350 switch(expr->kind) {
3351 case FUNCNAME_FUNCTION:
3352 case FUNCNAME_PRETTY_FUNCTION:
3353 case FUNCNAME_FUNCDNAME:
3354 if (current_function_name == NULL) {
3355 const source_position_t *const src_pos = &expr->base.source_position;
3356 const char *name = current_function_entity->base.symbol->string;
3357 const string_t string = { name, strlen(name) + 1 };
3358 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3360 return current_function_name;
3361 case FUNCNAME_FUNCSIG:
3362 if (current_funcsig == NULL) {
3363 const source_position_t *const src_pos = &expr->base.source_position;
3364 ir_entity *ent = get_irg_entity(current_ir_graph);
3365 const char *const name = get_entity_ld_name(ent);
3366 const string_t string = { name, strlen(name) + 1 };
3367 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3369 return current_funcsig;
3371 panic("Unsupported function name");
3374 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3376 statement_t *statement = expr->statement;
3378 assert(statement->kind == STATEMENT_COMPOUND);
3379 return compound_statement_to_firm(&statement->compound);
3382 static ir_node *va_start_expression_to_firm(
3383 const va_start_expression_t *const expr)
3385 ir_graph *const irg = current_ir_graph;
3386 type_t *const type = current_function_entity->declaration.type;
3387 ir_type *const method_type = get_ir_type(type);
3388 size_t const n = get_method_n_params(method_type) - 1;
3389 ir_type *frame_type = get_irg_frame_type(irg);
3390 ir_type *param_irtype = get_method_param_type(method_type, n);
3391 ir_entity *const param_ent =
3392 new_parameter_entity(frame_type, n, param_irtype);
3393 ir_node *const frame = get_irg_frame(irg);
3394 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3395 ir_node *const no_mem = new_NoMem();
3396 ir_node *const arg_sel =
3397 new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3399 type_t *const param_type = expr->parameter->base.type;
3400 ir_node *const cnst = get_type_size_node(param_type);
3401 ir_mode *const mode = get_irn_mode(cnst);
3402 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3403 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3404 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3405 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3406 ir_node *const add = new_d_Add(dbgi, arg_sel, c4, mode_P_data);
3407 set_value_for_expression(expr->ap, add);
3412 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3414 type_t *const type = expr->base.type;
3415 expression_t *const ap_expr = expr->ap;
3416 ir_node *const ap_addr = expression_to_addr(ap_expr);
3417 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3418 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3419 ir_node *const res = deref_address(dbgi, type, ap);
3421 ir_node *const cnst = get_type_size_node(expr->base.type);
3422 ir_mode *const mode = get_irn_mode(cnst);
3423 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3424 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3425 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3426 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3427 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3429 set_value_for_expression_addr(ap_expr, add, ap_addr);
3435 * Generate Firm for a va_copy expression.
3437 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3439 ir_node *const src = expression_to_firm(expr->src);
3440 set_value_for_expression(expr->dst, src);
3444 static ir_node *dereference_addr(const unary_expression_t *const expression)
3446 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3447 return expression_to_firm(expression->value);
3451 * Returns a IR-node representing an lvalue of the given expression.
3453 static ir_node *expression_to_addr(const expression_t *expression)
3455 switch(expression->kind) {
3456 case EXPR_ARRAY_ACCESS:
3457 return array_access_addr(&expression->array_access);
3459 return call_expression_to_firm(&expression->call);
3460 case EXPR_COMPOUND_LITERAL:
3461 return compound_literal_to_firm(&expression->compound_literal);
3462 case EXPR_REFERENCE:
3463 return reference_addr(&expression->reference);
3465 return select_addr(&expression->select);
3466 case EXPR_UNARY_DEREFERENCE:
3467 return dereference_addr(&expression->unary);
3471 panic("trying to get address of non-lvalue");
3474 static ir_node *builtin_constant_to_firm(
3475 const builtin_constant_expression_t *expression)
3477 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3478 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3479 return create_Const_from_bool(mode, v);
3482 static ir_node *builtin_types_compatible_to_firm(
3483 const builtin_types_compatible_expression_t *expression)
3485 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3486 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3487 bool const value = types_compatible(left, right);
3488 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3489 return create_Const_from_bool(mode, value);
3492 static ir_node *get_label_block(label_t *label)
3494 if (label->block != NULL)
3495 return label->block;
3497 /* beware: might be called from create initializer with current_ir_graph
3498 * set to const_code_irg. */
3499 ir_graph *rem = current_ir_graph;
3500 current_ir_graph = current_function;
3502 ir_node *block = new_immBlock();
3504 label->block = block;
3506 ARR_APP1(label_t *, all_labels, label);
3508 current_ir_graph = rem;
3513 * Pointer to a label. This is used for the
3514 * GNU address-of-label extension.
3516 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3518 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3519 ir_node *block = get_label_block(label->label);
3520 ir_entity *entity = create_Block_entity(block);
3522 symconst_symbol value;
3523 value.entity_p = entity;
3524 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3528 * creates firm nodes for an expression. The difference between this function
3529 * and expression_to_firm is, that this version might produce mode_b nodes
3530 * instead of mode_Is.
3532 static ir_node *_expression_to_firm(const expression_t *expression)
3535 if (!constant_folding) {
3536 assert(!expression->base.transformed);
3537 ((expression_t*) expression)->base.transformed = true;
3541 switch (expression->kind) {
3543 return literal_to_firm(&expression->literal);
3544 case EXPR_STRING_LITERAL:
3545 return string_to_firm(&expression->base.source_position, "str.%u",
3546 &expression->literal.value);
3547 case EXPR_WIDE_STRING_LITERAL:
3548 return wide_string_literal_to_firm(&expression->string_literal);
3549 case EXPR_REFERENCE:
3550 return reference_expression_to_firm(&expression->reference);
3551 case EXPR_REFERENCE_ENUM_VALUE:
3552 return reference_expression_enum_value_to_firm(&expression->reference);
3554 return call_expression_to_firm(&expression->call);
3556 return unary_expression_to_firm(&expression->unary);
3558 return binary_expression_to_firm(&expression->binary);
3559 case EXPR_ARRAY_ACCESS:
3560 return array_access_to_firm(&expression->array_access);
3562 return sizeof_to_firm(&expression->typeprop);
3564 return alignof_to_firm(&expression->typeprop);
3565 case EXPR_CONDITIONAL:
3566 return conditional_to_firm(&expression->conditional);
3568 return select_to_firm(&expression->select);
3569 case EXPR_CLASSIFY_TYPE:
3570 return classify_type_to_firm(&expression->classify_type);
3572 return function_name_to_firm(&expression->funcname);
3573 case EXPR_STATEMENT:
3574 return statement_expression_to_firm(&expression->statement);
3576 return va_start_expression_to_firm(&expression->va_starte);
3578 return va_arg_expression_to_firm(&expression->va_arge);
3580 return va_copy_expression_to_firm(&expression->va_copye);
3581 case EXPR_BUILTIN_CONSTANT_P:
3582 return builtin_constant_to_firm(&expression->builtin_constant);
3583 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
3584 return builtin_types_compatible_to_firm(&expression->builtin_types_compatible);
3586 return offsetof_to_firm(&expression->offsetofe);
3587 case EXPR_COMPOUND_LITERAL:
3588 return compound_literal_to_firm(&expression->compound_literal);
3589 case EXPR_LABEL_ADDRESS:
3590 return label_address_to_firm(&expression->label_address);
3595 panic("invalid expression found");
3599 * Check if a given expression is a GNU __builtin_expect() call.
3601 static bool is_builtin_expect(const expression_t *expression)
3603 if (expression->kind != EXPR_CALL)
3606 expression_t *function = expression->call.function;
3607 if (function->kind != EXPR_REFERENCE)
3609 reference_expression_t *ref = &function->reference;
3610 if (ref->entity->kind != ENTITY_FUNCTION ||
3611 ref->entity->function.btk != bk_gnu_builtin_expect)
3617 static bool produces_mode_b(const expression_t *expression)
3619 switch (expression->kind) {
3620 case EXPR_BINARY_EQUAL:
3621 case EXPR_BINARY_NOTEQUAL:
3622 case EXPR_BINARY_LESS:
3623 case EXPR_BINARY_LESSEQUAL:
3624 case EXPR_BINARY_GREATER:
3625 case EXPR_BINARY_GREATEREQUAL:
3626 case EXPR_BINARY_ISGREATER:
3627 case EXPR_BINARY_ISGREATEREQUAL:
3628 case EXPR_BINARY_ISLESS:
3629 case EXPR_BINARY_ISLESSEQUAL:
3630 case EXPR_BINARY_ISLESSGREATER:
3631 case EXPR_BINARY_ISUNORDERED:
3632 case EXPR_UNARY_NOT:
3636 if (is_builtin_expect(expression)) {
3637 expression_t *argument = expression->call.arguments->expression;
3638 return produces_mode_b(argument);
3641 case EXPR_BINARY_COMMA:
3642 return produces_mode_b(expression->binary.right);
3649 static ir_node *expression_to_firm(const expression_t *expression)
3651 if (!produces_mode_b(expression)) {
3652 ir_node *res = _expression_to_firm(expression);
3653 assert(res == NULL || get_irn_mode(res) != mode_b);
3657 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3658 bool const constant_folding_old = constant_folding;
3659 constant_folding = true;
3660 ir_node *res = _expression_to_firm(expression);
3661 constant_folding = constant_folding_old;
3662 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3663 assert(is_Const(res));
3664 return create_Const_from_bool(mode, !is_Const_null(res));
3667 /* we have to produce a 0/1 from the mode_b expression */
3668 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3669 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3670 return produce_condition_result(expression, mode, dbgi);
3674 * create a short-circuit expression evaluation that tries to construct
3675 * efficient control flow structures for &&, || and ! expressions
3677 static ir_node *create_condition_evaluation(const expression_t *expression,
3678 ir_node *true_block,
3679 ir_node *false_block)
3681 switch(expression->kind) {
3682 case EXPR_UNARY_NOT: {
3683 const unary_expression_t *unary_expression = &expression->unary;
3684 create_condition_evaluation(unary_expression->value, false_block,
3688 case EXPR_BINARY_LOGICAL_AND: {
3689 const binary_expression_t *binary_expression = &expression->binary;
3691 ir_node *extra_block = new_immBlock();
3692 create_condition_evaluation(binary_expression->left, extra_block,
3694 mature_immBlock(extra_block);
3695 set_cur_block(extra_block);
3696 create_condition_evaluation(binary_expression->right, true_block,
3700 case EXPR_BINARY_LOGICAL_OR: {
3701 const binary_expression_t *binary_expression = &expression->binary;
3703 ir_node *extra_block = new_immBlock();
3704 create_condition_evaluation(binary_expression->left, true_block,
3706 mature_immBlock(extra_block);
3707 set_cur_block(extra_block);
3708 create_condition_evaluation(binary_expression->right, true_block,
3716 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3717 ir_node *cond_expr = _expression_to_firm(expression);
3718 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3719 ir_node *cond = new_d_Cond(dbgi, condition);
3720 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3721 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3723 /* set branch prediction info based on __builtin_expect */
3724 if (is_builtin_expect(expression) && is_Cond(cond)) {
3725 call_argument_t *argument = expression->call.arguments->next;
3726 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3727 bool const cnst = fold_constant_to_bool(argument->expression);
3728 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3729 set_Cond_jmp_pred(cond, pred);
3733 add_immBlock_pred(true_block, true_proj);
3734 add_immBlock_pred(false_block, false_proj);
3736 set_unreachable_now();
3740 static void create_variable_entity(entity_t *variable,
3741 declaration_kind_t declaration_kind,
3742 ir_type *parent_type)
3744 assert(variable->kind == ENTITY_VARIABLE);
3745 type_t *type = skip_typeref(variable->declaration.type);
3747 ident *const id = new_id_from_str(variable->base.symbol->string);
3748 ir_type *const irtype = get_ir_type(type);
3749 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3750 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3751 unsigned alignment = variable->declaration.alignment;
3753 set_entity_alignment(irentity, alignment);
3755 handle_decl_modifiers(irentity, variable);
3757 variable->declaration.kind = (unsigned char) declaration_kind;
3758 variable->variable.v.entity = irentity;
3759 set_entity_ld_ident(irentity, create_ld_ident(variable));
3761 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3762 set_entity_volatility(irentity, volatility_is_volatile);
3767 typedef struct type_path_entry_t type_path_entry_t;
3768 struct type_path_entry_t {
3770 ir_initializer_t *initializer;
3772 entity_t *compound_entry;
3775 typedef struct type_path_t type_path_t;
3776 struct type_path_t {
3777 type_path_entry_t *path;
3782 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3784 size_t len = ARR_LEN(path->path);
3786 for (size_t i = 0; i < len; ++i) {
3787 const type_path_entry_t *entry = & path->path[i];
3789 type_t *type = skip_typeref(entry->type);
3790 if (is_type_compound(type)) {
3791 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3792 } else if (is_type_array(type)) {
3793 fprintf(stderr, "[%u]", (unsigned) entry->index);
3795 fprintf(stderr, "-INVALID-");
3798 fprintf(stderr, " (");
3799 print_type(path->top_type);
3800 fprintf(stderr, ")");
3803 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3805 size_t len = ARR_LEN(path->path);
3807 return & path->path[len-1];
3810 static type_path_entry_t *append_to_type_path(type_path_t *path)
3812 size_t len = ARR_LEN(path->path);
3813 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3815 type_path_entry_t *result = & path->path[len];
3816 memset(result, 0, sizeof(result[0]));
3820 static size_t get_compound_member_count(const compound_type_t *type)
3822 compound_t *compound = type->compound;
3823 size_t n_members = 0;
3824 entity_t *member = compound->members.entities;
3825 for ( ; member != NULL; member = member->base.next) {
3832 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3834 type_t *orig_top_type = path->top_type;
3835 type_t *top_type = skip_typeref(orig_top_type);
3837 assert(is_type_compound(top_type) || is_type_array(top_type));
3839 if (ARR_LEN(path->path) == 0) {
3842 type_path_entry_t *top = get_type_path_top(path);
3843 ir_initializer_t *initializer = top->initializer;
3844 return get_initializer_compound_value(initializer, top->index);
3848 static void descend_into_subtype(type_path_t *path)
3850 type_t *orig_top_type = path->top_type;
3851 type_t *top_type = skip_typeref(orig_top_type);
3853 assert(is_type_compound(top_type) || is_type_array(top_type));
3855 ir_initializer_t *initializer = get_initializer_entry(path);
3857 type_path_entry_t *top = append_to_type_path(path);
3858 top->type = top_type;
3862 if (is_type_compound(top_type)) {
3863 compound_t *compound = top_type->compound.compound;
3864 entity_t *entry = compound->members.entities;
3866 top->compound_entry = entry;
3868 len = get_compound_member_count(&top_type->compound);
3869 if (entry != NULL) {
3870 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3871 path->top_type = entry->declaration.type;
3874 assert(is_type_array(top_type));
3875 assert(top_type->array.size > 0);
3878 path->top_type = top_type->array.element_type;
3879 len = top_type->array.size;
3881 if (initializer == NULL
3882 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3883 initializer = create_initializer_compound(len);
3884 /* we have to set the entry at the 2nd latest path entry... */
3885 size_t path_len = ARR_LEN(path->path);
3886 assert(path_len >= 1);
3888 type_path_entry_t *entry = & path->path[path_len-2];
3889 ir_initializer_t *tinitializer = entry->initializer;
3890 set_initializer_compound_value(tinitializer, entry->index,
3894 top->initializer = initializer;
3897 static void ascend_from_subtype(type_path_t *path)
3899 type_path_entry_t *top = get_type_path_top(path);
3901 path->top_type = top->type;
3903 size_t len = ARR_LEN(path->path);
3904 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3907 static void walk_designator(type_path_t *path, const designator_t *designator)
3909 /* designators start at current object type */
3910 ARR_RESIZE(type_path_entry_t, path->path, 1);
3912 for ( ; designator != NULL; designator = designator->next) {
3913 type_path_entry_t *top = get_type_path_top(path);
3914 type_t *orig_type = top->type;
3915 type_t *type = skip_typeref(orig_type);
3917 if (designator->symbol != NULL) {
3918 assert(is_type_compound(type));
3920 symbol_t *symbol = designator->symbol;
3922 compound_t *compound = type->compound.compound;
3923 entity_t *iter = compound->members.entities;
3924 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3925 if (iter->base.symbol == symbol) {
3926 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3930 assert(iter != NULL);
3932 /* revert previous initialisations of other union elements */
3933 if (type->kind == TYPE_COMPOUND_UNION) {
3934 ir_initializer_t *initializer = top->initializer;
3935 if (initializer != NULL
3936 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3937 /* are we writing to a new element? */
3938 ir_initializer_t *oldi
3939 = get_initializer_compound_value(initializer, index);
3940 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3941 /* clear initializer */
3943 = get_initializer_compound_n_entries(initializer);
3944 ir_initializer_t *nulli = get_initializer_null();
3945 for (size_t i = 0; i < len; ++i) {
3946 set_initializer_compound_value(initializer, i,
3953 top->type = orig_type;
3954 top->compound_entry = iter;
3956 orig_type = iter->declaration.type;
3958 expression_t *array_index = designator->array_index;
3959 assert(designator->array_index != NULL);
3960 assert(is_type_array(type));
3962 long index = fold_constant_to_int(array_index);
3965 if (type->array.size_constant) {
3966 long array_size = type->array.size;
3967 assert(index < array_size);
3971 top->type = orig_type;
3972 top->index = (size_t) index;
3973 orig_type = type->array.element_type;
3975 path->top_type = orig_type;
3977 if (designator->next != NULL) {
3978 descend_into_subtype(path);
3982 path->invalid = false;
3985 static void advance_current_object(type_path_t *path)
3987 if (path->invalid) {
3988 /* TODO: handle this... */
3989 panic("invalid initializer in ast2firm (excessive elements)");
3992 type_path_entry_t *top = get_type_path_top(path);
3994 type_t *type = skip_typeref(top->type);
3995 if (is_type_union(type)) {
3996 /* only the first element is initialized in unions */
3997 top->compound_entry = NULL;
3998 } else if (is_type_struct(type)) {
3999 entity_t *entry = top->compound_entry;
4002 entry = entry->base.next;
4003 top->compound_entry = entry;
4004 if (entry != NULL) {
4005 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
4006 path->top_type = entry->declaration.type;
4010 assert(is_type_array(type));
4013 if (!type->array.size_constant || top->index < type->array.size) {
4018 /* we're past the last member of the current sub-aggregate, try if we
4019 * can ascend in the type hierarchy and continue with another subobject */
4020 size_t len = ARR_LEN(path->path);
4023 ascend_from_subtype(path);
4024 advance_current_object(path);
4026 path->invalid = true;
4031 static ir_initializer_t *create_ir_initializer(
4032 const initializer_t *initializer, type_t *type);
4034 static ir_initializer_t *create_ir_initializer_value(
4035 const initializer_value_t *initializer)
4037 if (is_type_compound(initializer->value->base.type)) {
4038 panic("initializer creation for compounds not implemented yet");
4040 type_t *type = initializer->value->base.type;
4041 expression_t *expr = initializer->value;
4042 ir_node *value = expression_to_firm(expr);
4043 ir_mode *mode = get_ir_mode_storage(type);
4044 value = create_conv(NULL, value, mode);
4045 return create_initializer_const(value);
4048 /** test wether type can be initialized by a string constant */
4049 static bool is_string_type(type_t *type)
4052 if (is_type_pointer(type)) {
4053 inner = skip_typeref(type->pointer.points_to);
4054 } else if(is_type_array(type)) {
4055 inner = skip_typeref(type->array.element_type);
4060 return is_type_integer(inner);
4063 static ir_initializer_t *create_ir_initializer_list(
4064 const initializer_list_t *initializer, type_t *type)
4067 memset(&path, 0, sizeof(path));
4068 path.top_type = type;
4069 path.path = NEW_ARR_F(type_path_entry_t, 0);
4071 descend_into_subtype(&path);
4073 for (size_t i = 0; i < initializer->len; ++i) {
4074 const initializer_t *sub_initializer = initializer->initializers[i];
4076 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
4077 walk_designator(&path, sub_initializer->designator.designator);
4081 if (sub_initializer->kind == INITIALIZER_VALUE) {
4082 /* we might have to descend into types until we're at a scalar
4085 type_t *orig_top_type = path.top_type;
4086 type_t *top_type = skip_typeref(orig_top_type);
4088 if (is_type_scalar(top_type))
4090 descend_into_subtype(&path);
4092 } else if (sub_initializer->kind == INITIALIZER_STRING
4093 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
4094 /* we might have to descend into types until we're at a scalar
4097 type_t *orig_top_type = path.top_type;
4098 type_t *top_type = skip_typeref(orig_top_type);
4100 if (is_string_type(top_type))
4102 descend_into_subtype(&path);
4106 ir_initializer_t *sub_irinitializer
4107 = create_ir_initializer(sub_initializer, path.top_type);
4109 size_t path_len = ARR_LEN(path.path);
4110 assert(path_len >= 1);
4111 type_path_entry_t *entry = & path.path[path_len-1];
4112 ir_initializer_t *tinitializer = entry->initializer;
4113 set_initializer_compound_value(tinitializer, entry->index,
4116 advance_current_object(&path);
4119 assert(ARR_LEN(path.path) >= 1);
4120 ir_initializer_t *result = path.path[0].initializer;
4121 DEL_ARR_F(path.path);
4126 static ir_initializer_t *create_ir_initializer_string(
4127 const initializer_string_t *initializer, type_t *type)
4129 type = skip_typeref(type);
4131 size_t string_len = initializer->string.size;
4132 assert(type->kind == TYPE_ARRAY);
4133 assert(type->array.size_constant);
4134 size_t len = type->array.size;
4135 ir_initializer_t *irinitializer = create_initializer_compound(len);
4137 const char *string = initializer->string.begin;
4138 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
4140 for (size_t i = 0; i < len; ++i) {
4145 ir_tarval *tv = new_tarval_from_long(c, mode);
4146 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4148 set_initializer_compound_value(irinitializer, i, char_initializer);
4151 return irinitializer;
4154 static ir_initializer_t *create_ir_initializer_wide_string(
4155 const initializer_wide_string_t *initializer, type_t *type)
4157 assert(type->kind == TYPE_ARRAY);
4158 assert(type->array.size_constant);
4159 size_t len = type->array.size;
4160 size_t string_len = wstrlen(&initializer->string);
4161 ir_initializer_t *irinitializer = create_initializer_compound(len);
4163 const char *p = initializer->string.begin;
4164 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4166 for (size_t i = 0; i < len; ++i) {
4168 if (i < string_len) {
4169 c = read_utf8_char(&p);
4171 ir_tarval *tv = new_tarval_from_long(c, mode);
4172 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4174 set_initializer_compound_value(irinitializer, i, char_initializer);
4177 return irinitializer;
4180 static ir_initializer_t *create_ir_initializer(
4181 const initializer_t *initializer, type_t *type)
4183 switch(initializer->kind) {
4184 case INITIALIZER_STRING:
4185 return create_ir_initializer_string(&initializer->string, type);
4187 case INITIALIZER_WIDE_STRING:
4188 return create_ir_initializer_wide_string(&initializer->wide_string,
4191 case INITIALIZER_LIST:
4192 return create_ir_initializer_list(&initializer->list, type);
4194 case INITIALIZER_VALUE:
4195 return create_ir_initializer_value(&initializer->value);
4197 case INITIALIZER_DESIGNATOR:
4198 panic("unexpected designator initializer found");
4200 panic("unknown initializer");
4203 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4204 * are elements [...] the remainder of the aggregate shall be initialized
4205 * implicitly the same as objects that have static storage duration. */
4206 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4209 /* for unions we must NOT do anything for null initializers */
4210 ir_type *owner = get_entity_owner(entity);
4211 if (is_Union_type(owner)) {
4215 ir_type *ent_type = get_entity_type(entity);
4216 /* create sub-initializers for a compound type */
4217 if (is_compound_type(ent_type)) {
4218 unsigned n_members = get_compound_n_members(ent_type);
4219 for (unsigned n = 0; n < n_members; ++n) {
4220 ir_entity *member = get_compound_member(ent_type, n);
4221 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4223 create_dynamic_null_initializer(member, dbgi, addr);
4227 if (is_Array_type(ent_type)) {
4228 assert(has_array_upper_bound(ent_type, 0));
4229 long n = get_array_upper_bound_int(ent_type, 0);
4230 for (long i = 0; i < n; ++i) {
4231 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4232 ir_node *cnst = new_d_Const(dbgi, index_tv);
4233 ir_node *in[1] = { cnst };
4234 ir_entity *arrent = get_array_element_entity(ent_type);
4235 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4237 create_dynamic_null_initializer(arrent, dbgi, addr);
4242 ir_mode *value_mode = get_type_mode(ent_type);
4243 ir_node *node = new_Const(get_mode_null(value_mode));
4245 /* is it a bitfield type? */
4246 if (is_Primitive_type(ent_type) &&
4247 get_primitive_base_type(ent_type) != NULL) {
4248 bitfield_store_to_firm(dbgi, entity, base_addr, node, false);
4252 ir_node *mem = get_store();
4253 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4254 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4258 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4259 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4261 switch(get_initializer_kind(initializer)) {
4262 case IR_INITIALIZER_NULL:
4263 create_dynamic_null_initializer(entity, dbgi, base_addr);
4265 case IR_INITIALIZER_CONST: {
4266 ir_node *node = get_initializer_const_value(initializer);
4267 ir_type *ent_type = get_entity_type(entity);
4269 /* is it a bitfield type? */
4270 if (is_Primitive_type(ent_type) &&
4271 get_primitive_base_type(ent_type) != NULL) {
4272 bitfield_store_to_firm(dbgi, entity, base_addr, node, false);
4276 assert(get_type_mode(type) == get_irn_mode(node));
4277 ir_node *mem = get_store();
4278 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4279 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4283 case IR_INITIALIZER_TARVAL: {
4284 ir_tarval *tv = get_initializer_tarval_value(initializer);
4285 ir_node *cnst = new_d_Const(dbgi, tv);
4286 ir_type *ent_type = get_entity_type(entity);
4288 /* is it a bitfield type? */
4289 if (is_Primitive_type(ent_type) &&
4290 get_primitive_base_type(ent_type) != NULL) {
4291 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false);
4295 assert(get_type_mode(type) == get_tarval_mode(tv));
4296 ir_node *mem = get_store();
4297 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4298 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4302 case IR_INITIALIZER_COMPOUND: {
4303 assert(is_compound_type(type) || is_Array_type(type));
4305 if (is_Array_type(type)) {
4306 assert(has_array_upper_bound(type, 0));
4307 n_members = get_array_upper_bound_int(type, 0);
4309 n_members = get_compound_n_members(type);
4312 if (get_initializer_compound_n_entries(initializer)
4313 != (unsigned) n_members)
4314 panic("initializer doesn't match compound type");
4316 for (int i = 0; i < n_members; ++i) {
4319 ir_entity *sub_entity;
4320 if (is_Array_type(type)) {
4321 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4322 ir_node *cnst = new_d_Const(dbgi, index_tv);
4323 ir_node *in[1] = { cnst };
4324 irtype = get_array_element_type(type);
4325 sub_entity = get_array_element_entity(type);
4326 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4329 sub_entity = get_compound_member(type, i);
4330 irtype = get_entity_type(sub_entity);
4331 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4335 ir_initializer_t *sub_init
4336 = get_initializer_compound_value(initializer, i);
4338 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4345 panic("invalid IR_INITIALIZER found");
4348 static void create_dynamic_initializer(ir_initializer_t *initializer,
4349 dbg_info *dbgi, ir_entity *entity)
4351 ir_node *frame = get_irg_frame(current_ir_graph);
4352 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4353 ir_type *type = get_entity_type(entity);
4355 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4358 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4359 ir_entity *entity, type_t *type)
4361 ir_node *memory = get_store();
4362 ir_node *nomem = new_NoMem();
4363 ir_node *frame = get_irg_frame(current_ir_graph);
4364 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4366 if (initializer->kind == INITIALIZER_VALUE) {
4367 initializer_value_t *initializer_value = &initializer->value;
4369 ir_node *value = expression_to_firm(initializer_value->value);
4370 type = skip_typeref(type);
4371 assign_value(dbgi, addr, type, value);
4375 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4376 ir_initializer_t *irinitializer
4377 = create_ir_initializer(initializer, type);
4379 create_dynamic_initializer(irinitializer, dbgi, entity);
4383 /* create the ir_initializer */
4384 ir_graph *const old_current_ir_graph = current_ir_graph;
4385 current_ir_graph = get_const_code_irg();
4387 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
4389 assert(current_ir_graph == get_const_code_irg());
4390 current_ir_graph = old_current_ir_graph;
4392 /* create a "template" entity which is copied to the entity on the stack */
4393 ident *const id = id_unique("initializer.%u");
4394 ir_type *const irtype = get_ir_type(type);
4395 ir_type *const global_type = get_glob_type();
4396 ir_entity *const init_entity = new_d_entity(global_type, id, irtype, dbgi);
4397 set_entity_ld_ident(init_entity, id);
4399 set_entity_visibility(init_entity, ir_visibility_private);
4400 add_entity_linkage(init_entity, IR_LINKAGE_CONSTANT);
4402 set_entity_initializer(init_entity, irinitializer);
4404 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4405 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4407 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4408 set_store(copyb_mem);
4411 static void create_initializer_local_variable_entity(entity_t *entity)
4413 assert(entity->kind == ENTITY_VARIABLE);
4414 initializer_t *initializer = entity->variable.initializer;
4415 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4416 ir_entity *irentity = entity->variable.v.entity;
4417 type_t *type = entity->declaration.type;
4419 create_local_initializer(initializer, dbgi, irentity, type);
4422 static void create_variable_initializer(entity_t *entity)
4424 assert(entity->kind == ENTITY_VARIABLE);
4425 initializer_t *initializer = entity->variable.initializer;
4426 if (initializer == NULL)
4429 declaration_kind_t declaration_kind
4430 = (declaration_kind_t) entity->declaration.kind;
4431 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4432 create_initializer_local_variable_entity(entity);
4436 type_t *type = entity->declaration.type;
4437 type_qualifiers_t tq = get_type_qualifier(type, true);
4439 if (initializer->kind == INITIALIZER_VALUE) {
4440 initializer_value_t *initializer_value = &initializer->value;
4441 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4443 ir_node *value = expression_to_firm(initializer_value->value);
4445 type_t *init_type = initializer_value->value->base.type;
4446 ir_mode *mode = get_ir_mode_storage(init_type);
4447 value = create_conv(dbgi, value, mode);
4448 value = do_strict_conv(dbgi, value);
4450 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4451 set_value(entity->variable.v.value_number, value);
4453 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4455 ir_entity *irentity = entity->variable.v.entity;
4457 if (tq & TYPE_QUALIFIER_CONST
4458 && get_entity_owner(irentity) != get_tls_type()) {
4459 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4461 set_atomic_ent_value(irentity, value);
4464 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4465 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4467 ir_entity *irentity = entity->variable.v.entity;
4468 ir_initializer_t *irinitializer
4469 = create_ir_initializer(initializer, type);
4471 if (tq & TYPE_QUALIFIER_CONST) {
4472 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4474 set_entity_initializer(irentity, irinitializer);
4478 static void create_variable_length_array(entity_t *entity)
4480 assert(entity->kind == ENTITY_VARIABLE);
4481 assert(entity->variable.initializer == NULL);
4483 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4484 entity->variable.v.vla_base = NULL;
4486 /* TODO: record VLA somewhere so we create the free node when we leave
4490 static void allocate_variable_length_array(entity_t *entity)
4492 assert(entity->kind == ENTITY_VARIABLE);
4493 assert(entity->variable.initializer == NULL);
4494 assert(currently_reachable());
4496 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4497 type_t *type = entity->declaration.type;
4498 ir_type *el_type = get_ir_type(type->array.element_type);
4500 /* make sure size_node is calculated */
4501 get_type_size_node(type);
4502 ir_node *elems = type->array.size_node;
4503 ir_node *mem = get_store();
4504 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4506 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4507 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4510 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4511 entity->variable.v.vla_base = addr;
4515 * Creates a Firm local variable from a declaration.
4517 static void create_local_variable(entity_t *entity)
4519 assert(entity->kind == ENTITY_VARIABLE);
4520 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4522 bool needs_entity = entity->variable.address_taken;
4523 type_t *type = skip_typeref(entity->declaration.type);
4525 /* is it a variable length array? */
4526 if (is_type_array(type) && !type->array.size_constant) {
4527 create_variable_length_array(entity);
4529 } else if (is_type_array(type) || is_type_compound(type)) {
4530 needs_entity = true;
4531 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4532 needs_entity = true;
4536 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4537 create_variable_entity(entity,
4538 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4541 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4542 entity->variable.v.value_number = next_value_number_function;
4543 set_irg_loc_description(current_ir_graph, next_value_number_function,
4545 ++next_value_number_function;
4549 static void create_local_static_variable(entity_t *entity)
4551 assert(entity->kind == ENTITY_VARIABLE);
4552 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4554 type_t *type = skip_typeref(entity->declaration.type);
4555 ir_type *const var_type = entity->variable.thread_local ?
4556 get_tls_type() : get_glob_type();
4557 ir_type *const irtype = get_ir_type(type);
4558 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4560 size_t l = strlen(entity->base.symbol->string);
4561 char buf[l + sizeof(".%u")];
4562 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4563 ident *const id = id_unique(buf);
4564 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4566 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4567 set_entity_volatility(irentity, volatility_is_volatile);
4570 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4571 entity->variable.v.entity = irentity;
4573 set_entity_ld_ident(irentity, id);
4574 set_entity_visibility(irentity, ir_visibility_local);
4576 ir_graph *const old_current_ir_graph = current_ir_graph;
4577 current_ir_graph = get_const_code_irg();
4579 create_variable_initializer(entity);
4581 assert(current_ir_graph == get_const_code_irg());
4582 current_ir_graph = old_current_ir_graph;
4587 static void return_statement_to_firm(return_statement_t *statement)
4589 if (!currently_reachable())
4592 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4593 type_t *type = current_function_entity->declaration.type;
4594 ir_type *func_irtype = get_ir_type(type);
4598 if (get_method_n_ress(func_irtype) > 0) {
4599 ir_type *res_type = get_method_res_type(func_irtype, 0);
4601 if (statement->value != NULL) {
4602 ir_node *node = expression_to_firm(statement->value);
4603 if (!is_compound_type(res_type)) {
4604 type_t *ret_value_type = statement->value->base.type;
4605 ir_mode *mode = get_ir_mode_storage(ret_value_type);
4606 node = create_conv(dbgi, node, mode);
4607 node = do_strict_conv(dbgi, node);
4612 if (is_compound_type(res_type)) {
4615 mode = get_type_mode(res_type);
4617 in[0] = new_Unknown(mode);
4621 /* build return_value for its side effects */
4622 if (statement->value != NULL) {
4623 expression_to_firm(statement->value);
4628 ir_node *store = get_store();
4629 ir_node *ret = new_d_Return(dbgi, store, in_len, in);
4631 ir_node *end_block = get_irg_end_block(current_ir_graph);
4632 add_immBlock_pred(end_block, ret);
4634 set_unreachable_now();
4637 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4639 if (!currently_reachable())
4642 return expression_to_firm(statement->expression);
4645 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4647 entity_t *entity = compound->scope.entities;
4648 for ( ; entity != NULL; entity = entity->base.next) {
4649 if (!is_declaration(entity))
4652 create_local_declaration(entity);
4655 ir_node *result = NULL;
4656 statement_t *statement = compound->statements;
4657 for ( ; statement != NULL; statement = statement->base.next) {
4658 if (statement->base.next == NULL
4659 && statement->kind == STATEMENT_EXPRESSION) {
4660 result = expression_statement_to_firm(
4661 &statement->expression);
4664 statement_to_firm(statement);
4670 static void create_global_variable(entity_t *entity)
4672 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4673 ir_visibility visibility = ir_visibility_default;
4674 ir_entity *irentity;
4675 assert(entity->kind == ENTITY_VARIABLE);
4677 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4678 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4679 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4680 case STORAGE_CLASS_NONE:
4681 visibility = ir_visibility_default;
4682 /* uninitialized globals get merged in C */
4683 if (entity->variable.initializer == NULL)
4684 linkage |= IR_LINKAGE_MERGE;
4686 case STORAGE_CLASS_TYPEDEF:
4687 case STORAGE_CLASS_AUTO:
4688 case STORAGE_CLASS_REGISTER:
4689 panic("invalid storage class for global var");
4692 ir_type *var_type = get_glob_type();
4693 if (entity->variable.thread_local) {
4694 var_type = get_tls_type();
4695 /* LINKAGE_MERGE not supported by current linkers */
4696 linkage &= ~IR_LINKAGE_MERGE;
4698 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4699 irentity = entity->variable.v.entity;
4700 add_entity_linkage(irentity, linkage);
4701 set_entity_visibility(irentity, visibility);
4704 static void create_local_declaration(entity_t *entity)
4706 assert(is_declaration(entity));
4708 /* construct type */
4709 (void) get_ir_type(entity->declaration.type);
4710 if (entity->base.symbol == NULL) {
4714 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4715 case STORAGE_CLASS_STATIC:
4716 if (entity->kind == ENTITY_FUNCTION) {
4717 (void)get_function_entity(entity, NULL);
4719 create_local_static_variable(entity);
4722 case STORAGE_CLASS_EXTERN:
4723 if (entity->kind == ENTITY_FUNCTION) {
4724 assert(entity->function.statement == NULL);
4725 (void)get_function_entity(entity, NULL);
4727 create_global_variable(entity);
4728 create_variable_initializer(entity);
4731 case STORAGE_CLASS_NONE:
4732 case STORAGE_CLASS_AUTO:
4733 case STORAGE_CLASS_REGISTER:
4734 if (entity->kind == ENTITY_FUNCTION) {
4735 if (entity->function.statement != NULL) {
4736 ir_type *owner = get_irg_frame_type(current_ir_graph);
4737 (void)get_function_entity(entity, owner);
4738 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4739 enqueue_inner_function(entity);
4741 (void)get_function_entity(entity, NULL);
4744 create_local_variable(entity);
4747 case STORAGE_CLASS_TYPEDEF:
4750 panic("invalid storage class found");
4753 static void initialize_local_declaration(entity_t *entity)
4755 if (entity->base.symbol == NULL)
4758 // no need to emit code in dead blocks
4759 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4760 && !currently_reachable())
4763 switch ((declaration_kind_t) entity->declaration.kind) {
4764 case DECLARATION_KIND_LOCAL_VARIABLE:
4765 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4766 create_variable_initializer(entity);
4769 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4770 allocate_variable_length_array(entity);
4773 case DECLARATION_KIND_COMPOUND_MEMBER:
4774 case DECLARATION_KIND_GLOBAL_VARIABLE:
4775 case DECLARATION_KIND_FUNCTION:
4776 case DECLARATION_KIND_INNER_FUNCTION:
4779 case DECLARATION_KIND_PARAMETER:
4780 case DECLARATION_KIND_PARAMETER_ENTITY:
4781 panic("can't initialize parameters");
4783 case DECLARATION_KIND_UNKNOWN:
4784 panic("can't initialize unknown declaration");
4786 panic("invalid declaration kind");
4789 static void declaration_statement_to_firm(declaration_statement_t *statement)
4791 entity_t *entity = statement->declarations_begin;
4795 entity_t *const last = statement->declarations_end;
4796 for ( ;; entity = entity->base.next) {
4797 if (is_declaration(entity)) {
4798 initialize_local_declaration(entity);
4799 } else if (entity->kind == ENTITY_TYPEDEF) {
4800 /* ยง6.7.7:3 Any array size expressions associated with variable length
4801 * array declarators are evaluated each time the declaration of the
4802 * typedef name is reached in the order of execution. */
4803 type_t *const type = skip_typeref(entity->typedefe.type);
4804 if (is_type_array(type) && type->array.is_vla)
4805 get_vla_size(&type->array);
4812 static void if_statement_to_firm(if_statement_t *statement)
4814 /* Create the condition. */
4815 ir_node *true_block = NULL;
4816 ir_node *false_block = NULL;
4817 if (currently_reachable()) {
4818 true_block = new_immBlock();
4819 false_block = new_immBlock();
4820 create_condition_evaluation(statement->condition, true_block, false_block);
4821 mature_immBlock(true_block);
4824 /* Create the false statement.
4825 * Handle false before true, so if no false statement is present, then the
4826 * empty false block is reused as fallthrough block. */
4827 ir_node *fallthrough_block = NULL;
4828 if (statement->false_statement != NULL) {
4829 if (false_block != NULL) {
4830 mature_immBlock(false_block);
4832 set_cur_block(false_block);
4833 statement_to_firm(statement->false_statement);
4834 if (currently_reachable()) {
4835 fallthrough_block = new_immBlock();
4836 add_immBlock_pred(fallthrough_block, new_Jmp());
4839 fallthrough_block = false_block;
4842 /* Create the true statement. */
4843 set_cur_block(true_block);
4844 statement_to_firm(statement->true_statement);
4845 if (currently_reachable()) {
4846 if (fallthrough_block == NULL) {
4847 fallthrough_block = new_immBlock();
4849 add_immBlock_pred(fallthrough_block, new_Jmp());
4852 /* Handle the block after the if-statement. */
4853 if (fallthrough_block != NULL) {
4854 mature_immBlock(fallthrough_block);
4856 set_cur_block(fallthrough_block);
4859 /* Create a jump node which jumps into target_block, if the current block is
4861 static void jump_if_reachable(ir_node *const target_block)
4863 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4864 add_immBlock_pred(target_block, pred);
4867 static void while_statement_to_firm(while_statement_t *statement)
4869 /* Create the header block */
4870 ir_node *const header_block = new_immBlock();
4871 jump_if_reachable(header_block);
4873 /* Create the condition. */
4874 ir_node * body_block;
4875 ir_node * false_block;
4876 expression_t *const cond = statement->condition;
4877 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4878 fold_constant_to_bool(cond)) {
4879 /* Shortcut for while (true). */
4880 body_block = header_block;
4883 keep_alive(header_block);
4884 keep_all_memory(header_block);
4886 body_block = new_immBlock();
4887 false_block = new_immBlock();
4889 set_cur_block(header_block);
4890 create_condition_evaluation(cond, body_block, false_block);
4891 mature_immBlock(body_block);
4894 ir_node *const old_continue_label = continue_label;
4895 ir_node *const old_break_label = break_label;
4896 continue_label = header_block;
4897 break_label = false_block;
4899 /* Create the loop body. */
4900 set_cur_block(body_block);
4901 statement_to_firm(statement->body);
4902 jump_if_reachable(header_block);
4904 mature_immBlock(header_block);
4905 assert(false_block == NULL || false_block == break_label);
4906 false_block = break_label;
4907 if (false_block != NULL) {
4908 mature_immBlock(false_block);
4910 set_cur_block(false_block);
4912 assert(continue_label == header_block);
4913 continue_label = old_continue_label;
4914 break_label = old_break_label;
4917 static ir_node *get_break_label(void)
4919 if (break_label == NULL) {
4920 break_label = new_immBlock();
4925 static void do_while_statement_to_firm(do_while_statement_t *statement)
4927 /* create the header block */
4928 ir_node *header_block = new_immBlock();
4931 ir_node *body_block = new_immBlock();
4932 jump_if_reachable(body_block);
4934 ir_node *old_continue_label = continue_label;
4935 ir_node *old_break_label = break_label;
4936 continue_label = header_block;
4939 set_cur_block(body_block);
4940 statement_to_firm(statement->body);
4941 ir_node *const false_block = get_break_label();
4943 assert(continue_label == header_block);
4944 continue_label = old_continue_label;
4945 break_label = old_break_label;
4947 jump_if_reachable(header_block);
4949 /* create the condition */
4950 mature_immBlock(header_block);
4951 set_cur_block(header_block);
4953 create_condition_evaluation(statement->condition, body_block, false_block);
4954 mature_immBlock(body_block);
4955 mature_immBlock(false_block);
4957 set_cur_block(false_block);
4960 static void for_statement_to_firm(for_statement_t *statement)
4962 /* create declarations */
4963 entity_t *entity = statement->scope.entities;
4964 for ( ; entity != NULL; entity = entity->base.next) {
4965 if (!is_declaration(entity))
4968 create_local_declaration(entity);
4971 if (currently_reachable()) {
4972 entity = statement->scope.entities;
4973 for ( ; entity != NULL; entity = entity->base.next) {
4974 if (!is_declaration(entity))
4977 initialize_local_declaration(entity);
4980 if (statement->initialisation != NULL) {
4981 expression_to_firm(statement->initialisation);
4985 /* Create the header block */
4986 ir_node *const header_block = new_immBlock();
4987 jump_if_reachable(header_block);
4989 /* Create the condition. */
4990 ir_node *body_block;
4991 ir_node *false_block;
4992 if (statement->condition != NULL) {
4993 body_block = new_immBlock();
4994 false_block = new_immBlock();
4996 set_cur_block(header_block);
4997 create_condition_evaluation(statement->condition, body_block, false_block);
4998 mature_immBlock(body_block);
5001 body_block = header_block;
5004 keep_alive(header_block);
5005 keep_all_memory(header_block);
5008 /* Create the step block, if necessary. */
5009 ir_node * step_block = header_block;
5010 expression_t *const step = statement->step;
5012 step_block = new_immBlock();
5015 ir_node *const old_continue_label = continue_label;
5016 ir_node *const old_break_label = break_label;
5017 continue_label = step_block;
5018 break_label = false_block;
5020 /* Create the loop body. */
5021 set_cur_block(body_block);
5022 statement_to_firm(statement->body);
5023 jump_if_reachable(step_block);
5025 /* Create the step code. */
5027 mature_immBlock(step_block);
5028 set_cur_block(step_block);
5029 expression_to_firm(step);
5030 jump_if_reachable(header_block);
5033 mature_immBlock(header_block);
5034 assert(false_block == NULL || false_block == break_label);
5035 false_block = break_label;
5036 if (false_block != NULL) {
5037 mature_immBlock(false_block);
5039 set_cur_block(false_block);
5041 assert(continue_label == step_block);
5042 continue_label = old_continue_label;
5043 break_label = old_break_label;
5046 static void create_jump_statement(const statement_t *statement,
5047 ir_node *target_block)
5049 if (!currently_reachable())
5052 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5053 ir_node *jump = new_d_Jmp(dbgi);
5054 add_immBlock_pred(target_block, jump);
5056 set_unreachable_now();
5059 static void switch_statement_to_firm(switch_statement_t *statement)
5061 ir_node *first_block = NULL;
5062 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5063 ir_node *cond = NULL;
5065 if (currently_reachable()) {
5066 ir_node *expression = expression_to_firm(statement->expression);
5067 cond = new_d_Cond(dbgi, expression);
5068 first_block = get_cur_block();
5071 set_unreachable_now();
5073 ir_node *const old_switch_cond = current_switch_cond;
5074 ir_node *const old_break_label = break_label;
5075 const bool old_saw_default_label = saw_default_label;
5076 saw_default_label = false;
5077 current_switch_cond = cond;
5079 switch_statement_t *const old_switch = current_switch;
5080 current_switch = statement;
5082 /* determine a free number for the default label */
5083 unsigned long num_cases = 0;
5084 long default_proj_nr = 0;
5085 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
5086 if (l->expression == NULL) {
5090 if (l->last_case >= l->first_case)
5091 num_cases += l->last_case - l->first_case + 1;
5092 if (l->last_case > default_proj_nr)
5093 default_proj_nr = l->last_case;
5096 if (default_proj_nr == LONG_MAX) {
5097 /* Bad: an overflow will occur, we cannot be sure that the
5098 * maximum + 1 is a free number. Scan the values a second
5099 * time to find a free number.
5101 unsigned char *bits = xmalloc((num_cases + 7) >> 3);
5103 memset(bits, 0, (num_cases + 7) >> 3);
5104 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
5105 if (l->expression == NULL) {
5109 unsigned long start = l->first_case > 0 ? (unsigned long)l->first_case : 0;
5110 if (start < num_cases && l->last_case >= 0) {
5111 unsigned long end = (unsigned long)l->last_case < num_cases ?
5112 (unsigned long)l->last_case : num_cases - 1;
5113 for (unsigned long cns = start; cns <= end; ++cns) {
5114 bits[cns >> 3] |= (1 << (cns & 7));
5118 /* We look at the first num_cases constants:
5119 * Either they are dense, so we took the last (num_cases)
5120 * one, or they are not dense, so we will find one free
5124 for (i = 0; i < num_cases; ++i)
5125 if ((bits[i >> 3] & (1 << (i & 7))) == 0)
5129 default_proj_nr = i;
5133 statement->default_proj_nr = default_proj_nr;
5134 /* safety check: cond might already be folded to a Bad */
5135 if (cond != NULL && is_Cond(cond)) {
5136 set_Cond_default_proj(cond, default_proj_nr);
5139 statement_to_firm(statement->body);
5141 jump_if_reachable(get_break_label());
5143 if (!saw_default_label && first_block != NULL) {
5144 set_cur_block(first_block);
5145 ir_node *const proj = new_d_Proj(dbgi, cond, mode_X, default_proj_nr);
5146 add_immBlock_pred(get_break_label(), proj);
5149 if (break_label != NULL) {
5150 mature_immBlock(break_label);
5152 set_cur_block(break_label);
5154 assert(current_switch_cond == cond);
5155 current_switch = old_switch;
5156 current_switch_cond = old_switch_cond;
5157 break_label = old_break_label;
5158 saw_default_label = old_saw_default_label;
5161 static void case_label_to_firm(const case_label_statement_t *statement)
5163 if (statement->is_empty_range)
5166 ir_node *block = new_immBlock();
5167 /* Fallthrough from previous case */
5168 jump_if_reachable(block);
5170 if (current_switch_cond != NULL) {
5171 set_cur_block(get_nodes_block(current_switch_cond));
5172 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5173 if (statement->expression != NULL) {
5174 long pn = statement->first_case;
5175 long end_pn = statement->last_case;
5176 assert(pn <= end_pn);
5177 /* create jumps for all cases in the given range */
5179 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X, pn);
5180 add_immBlock_pred(block, proj);
5181 } while (pn++ < end_pn);
5183 saw_default_label = true;
5184 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X,
5185 current_switch->default_proj_nr);
5186 add_immBlock_pred(block, proj);
5190 mature_immBlock(block);
5191 set_cur_block(block);
5193 statement_to_firm(statement->statement);
5196 static void label_to_firm(const label_statement_t *statement)
5198 ir_node *block = get_label_block(statement->label);
5199 jump_if_reachable(block);
5201 set_cur_block(block);
5203 keep_all_memory(block);
5205 statement_to_firm(statement->statement);
5208 static void goto_to_firm(const goto_statement_t *statement)
5210 if (!currently_reachable())
5213 if (statement->expression) {
5214 ir_node *irn = expression_to_firm(statement->expression);
5215 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5216 ir_node *ijmp = new_d_IJmp(dbgi, irn);
5218 set_irn_link(ijmp, ijmp_list);
5221 ir_node *block = get_label_block(statement->label);
5222 ir_node *jmp = new_Jmp();
5223 add_immBlock_pred(block, jmp);
5225 set_unreachable_now();
5228 static void asm_statement_to_firm(const asm_statement_t *statement)
5230 bool needs_memory = false;
5232 if (statement->is_volatile) {
5233 needs_memory = true;
5236 size_t n_clobbers = 0;
5237 asm_clobber_t *clobber = statement->clobbers;
5238 for ( ; clobber != NULL; clobber = clobber->next) {
5239 const char *clobber_str = clobber->clobber.begin;
5241 if (!be_is_valid_clobber(clobber_str)) {
5242 errorf(&statement->base.source_position,
5243 "invalid clobber '%s' specified", clobber->clobber);
5247 if (strcmp(clobber_str, "memory") == 0) {
5248 needs_memory = true;
5252 ident *id = new_id_from_str(clobber_str);
5253 obstack_ptr_grow(&asm_obst, id);
5256 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5257 ident **clobbers = NULL;
5258 if (n_clobbers > 0) {
5259 clobbers = obstack_finish(&asm_obst);
5262 size_t n_inputs = 0;
5263 asm_argument_t *argument = statement->inputs;
5264 for ( ; argument != NULL; argument = argument->next)
5266 size_t n_outputs = 0;
5267 argument = statement->outputs;
5268 for ( ; argument != NULL; argument = argument->next)
5271 unsigned next_pos = 0;
5273 ir_node *ins[n_inputs + n_outputs + 1];
5276 ir_asm_constraint tmp_in_constraints[n_outputs];
5278 const expression_t *out_exprs[n_outputs];
5279 ir_node *out_addrs[n_outputs];
5280 size_t out_size = 0;
5282 argument = statement->outputs;
5283 for ( ; argument != NULL; argument = argument->next) {
5284 const char *constraints = argument->constraints.begin;
5285 asm_constraint_flags_t asm_flags
5286 = be_parse_asm_constraints(constraints);
5289 source_position_t const *const pos = &statement->base.source_position;
5290 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5291 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5293 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5294 errorf(pos, "some constraints in '%s' are invalid", constraints);
5297 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5298 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5303 unsigned pos = next_pos++;
5304 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5305 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5306 expression_t *expr = argument->expression;
5307 ir_node *addr = expression_to_addr(expr);
5308 /* in+output, construct an artifical same_as constraint on the
5310 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5312 ir_node *value = get_value_from_lvalue(expr, addr);
5314 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5316 ir_asm_constraint constraint;
5317 constraint.pos = pos;
5318 constraint.constraint = new_id_from_str(buf);
5319 constraint.mode = get_ir_mode_storage(expr->base.type);
5320 tmp_in_constraints[in_size] = constraint;
5321 ins[in_size] = value;
5326 out_exprs[out_size] = expr;
5327 out_addrs[out_size] = addr;
5329 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5330 /* pure memory ops need no input (but we have to make sure we
5331 * attach to the memory) */
5332 assert(! (asm_flags &
5333 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5334 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5335 needs_memory = true;
5337 /* we need to attach the address to the inputs */
5338 expression_t *expr = argument->expression;
5340 ir_asm_constraint constraint;
5341 constraint.pos = pos;
5342 constraint.constraint = new_id_from_str(constraints);
5343 constraint.mode = NULL;
5344 tmp_in_constraints[in_size] = constraint;
5346 ins[in_size] = expression_to_addr(expr);
5350 errorf(&statement->base.source_position,
5351 "only modifiers but no place set in constraints '%s'",
5356 ir_asm_constraint constraint;
5357 constraint.pos = pos;
5358 constraint.constraint = new_id_from_str(constraints);
5359 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5361 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5363 assert(obstack_object_size(&asm_obst)
5364 == out_size * sizeof(ir_asm_constraint));
5365 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5368 obstack_grow(&asm_obst, tmp_in_constraints,
5369 in_size * sizeof(tmp_in_constraints[0]));
5370 /* find and count input and output arguments */
5371 argument = statement->inputs;
5372 for ( ; argument != NULL; argument = argument->next) {
5373 const char *constraints = argument->constraints.begin;
5374 asm_constraint_flags_t asm_flags
5375 = be_parse_asm_constraints(constraints);
5377 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5378 errorf(&statement->base.source_position,
5379 "some constraints in '%s' are not supported", constraints);
5382 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5383 errorf(&statement->base.source_position,
5384 "some constraints in '%s' are invalid", constraints);
5387 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5388 errorf(&statement->base.source_position,
5389 "write flag specified for input constraints '%s'",
5395 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5396 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5397 /* we can treat this as "normal" input */
5398 input = expression_to_firm(argument->expression);
5399 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5400 /* pure memory ops need no input (but we have to make sure we
5401 * attach to the memory) */
5402 assert(! (asm_flags &
5403 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5404 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5405 needs_memory = true;
5406 input = expression_to_addr(argument->expression);
5408 errorf(&statement->base.source_position,
5409 "only modifiers but no place set in constraints '%s'",
5414 ir_asm_constraint constraint;
5415 constraint.pos = next_pos++;
5416 constraint.constraint = new_id_from_str(constraints);
5417 constraint.mode = get_irn_mode(input);
5419 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5420 ins[in_size++] = input;
5424 ir_asm_constraint constraint;
5425 constraint.pos = next_pos++;
5426 constraint.constraint = new_id_from_str("");
5427 constraint.mode = mode_M;
5429 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5430 ins[in_size++] = get_store();
5433 assert(obstack_object_size(&asm_obst)
5434 == in_size * sizeof(ir_asm_constraint));
5435 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5437 /* create asm node */
5438 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5440 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5442 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5443 out_size, output_constraints,
5444 n_clobbers, clobbers, asm_text);
5446 if (statement->is_volatile) {
5447 set_irn_pinned(node, op_pin_state_pinned);
5449 set_irn_pinned(node, op_pin_state_floats);
5452 /* create output projs & connect them */
5454 ir_node *projm = new_Proj(node, mode_M, out_size);
5459 for (i = 0; i < out_size; ++i) {
5460 const expression_t *out_expr = out_exprs[i];
5462 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5463 ir_node *proj = new_Proj(node, mode, pn);
5464 ir_node *addr = out_addrs[i];
5466 set_value_for_expression_addr(out_expr, proj, addr);
5470 static void ms_try_statement_to_firm(ms_try_statement_t *statement)
5472 statement_to_firm(statement->try_statement);
5473 source_position_t const *const pos = &statement->base.source_position;
5474 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5477 static void leave_statement_to_firm(leave_statement_t *statement)
5479 errorf(&statement->base.source_position, "__leave not supported yet");
5483 * Transform a statement.
5485 static void statement_to_firm(statement_t *statement)
5488 assert(!statement->base.transformed);
5489 statement->base.transformed = true;
5492 switch (statement->kind) {
5493 case STATEMENT_INVALID:
5494 panic("invalid statement found");
5495 case STATEMENT_EMPTY:
5498 case STATEMENT_COMPOUND:
5499 compound_statement_to_firm(&statement->compound);
5501 case STATEMENT_RETURN:
5502 return_statement_to_firm(&statement->returns);
5504 case STATEMENT_EXPRESSION:
5505 expression_statement_to_firm(&statement->expression);
5508 if_statement_to_firm(&statement->ifs);
5510 case STATEMENT_WHILE:
5511 while_statement_to_firm(&statement->whiles);
5513 case STATEMENT_DO_WHILE:
5514 do_while_statement_to_firm(&statement->do_while);
5516 case STATEMENT_DECLARATION:
5517 declaration_statement_to_firm(&statement->declaration);
5519 case STATEMENT_BREAK:
5520 create_jump_statement(statement, get_break_label());
5522 case STATEMENT_CONTINUE:
5523 create_jump_statement(statement, continue_label);
5525 case STATEMENT_SWITCH:
5526 switch_statement_to_firm(&statement->switchs);
5528 case STATEMENT_CASE_LABEL:
5529 case_label_to_firm(&statement->case_label);
5532 for_statement_to_firm(&statement->fors);
5534 case STATEMENT_LABEL:
5535 label_to_firm(&statement->label);
5537 case STATEMENT_GOTO:
5538 goto_to_firm(&statement->gotos);
5541 asm_statement_to_firm(&statement->asms);
5543 case STATEMENT_MS_TRY:
5544 ms_try_statement_to_firm(&statement->ms_try);
5546 case STATEMENT_LEAVE:
5547 leave_statement_to_firm(&statement->leave);
5550 panic("statement not implemented");
5553 static int count_local_variables(const entity_t *entity,
5554 const entity_t *const last)
5557 entity_t const *const end = last != NULL ? last->base.next : NULL;
5558 for (; entity != end; entity = entity->base.next) {
5562 if (entity->kind == ENTITY_VARIABLE) {
5563 type = skip_typeref(entity->declaration.type);
5564 address_taken = entity->variable.address_taken;
5565 } else if (entity->kind == ENTITY_PARAMETER) {
5566 type = skip_typeref(entity->declaration.type);
5567 address_taken = entity->parameter.address_taken;
5572 if (!address_taken && is_type_scalar(type))
5578 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5580 int *const count = env;
5582 switch (stmt->kind) {
5583 case STATEMENT_DECLARATION: {
5584 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5585 *count += count_local_variables(decl_stmt->declarations_begin,
5586 decl_stmt->declarations_end);
5591 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5600 * Return the number of local (alias free) variables used by a function.
5602 static int get_function_n_local_vars(entity_t *entity)
5604 const function_t *function = &entity->function;
5607 /* count parameters */
5608 count += count_local_variables(function->parameters.entities, NULL);
5610 /* count local variables declared in body */
5611 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5616 * Build Firm code for the parameters of a function.
5618 static void initialize_function_parameters(entity_t *entity)
5620 assert(entity->kind == ENTITY_FUNCTION);
5621 ir_graph *irg = current_ir_graph;
5622 ir_node *args = get_irg_args(irg);
5624 ir_type *function_irtype;
5626 if (entity->function.need_closure) {
5627 /* add an extra parameter for the static link */
5628 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5631 /* Matze: IMO this is wrong, nested functions should have an own
5632 * type and not rely on strange parameters... */
5633 function_irtype = create_method_type(&entity->declaration.type->function, true);
5635 function_irtype = get_ir_type(entity->declaration.type);
5640 entity_t *parameter = entity->function.parameters.entities;
5641 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5642 if (parameter->kind != ENTITY_PARAMETER)
5645 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5646 type_t *type = skip_typeref(parameter->declaration.type);
5648 bool needs_entity = parameter->parameter.address_taken;
5649 assert(!is_type_array(type));
5650 if (is_type_compound(type)) {
5651 needs_entity = true;
5654 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5656 ir_type *frame_type = get_irg_frame_type(irg);
5658 = new_parameter_entity(frame_type, n, param_irtype);
5659 parameter->declaration.kind
5660 = DECLARATION_KIND_PARAMETER_ENTITY;
5661 parameter->parameter.v.entity = param;
5665 ir_mode *param_mode = get_type_mode(param_irtype);
5667 ir_node *value = new_r_Proj(args, param_mode, pn);
5669 ir_mode *mode = get_ir_mode_storage(type);
5670 value = create_conv(NULL, value, mode);
5671 value = do_strict_conv(NULL, value);
5673 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5674 parameter->parameter.v.value_number = next_value_number_function;
5675 set_irg_loc_description(current_ir_graph, next_value_number_function,
5677 ++next_value_number_function;
5679 set_value(parameter->parameter.v.value_number, value);
5684 * Handle additional decl modifiers for IR-graphs
5686 * @param irg the IR-graph
5687 * @param dec_modifiers additional modifiers
5689 static void handle_decl_modifier_irg(ir_graph_ptr irg,
5690 decl_modifiers_t decl_modifiers)
5692 if (decl_modifiers & DM_RETURNS_TWICE) {
5693 /* TRUE if the declaration includes __attribute__((returns_twice)) */
5694 add_irg_additional_properties(irg, mtp_property_returns_twice);
5696 if (decl_modifiers & DM_NORETURN) {
5697 /* TRUE if the declaration includes the Microsoft
5698 __declspec(noreturn) specifier. */
5699 add_irg_additional_properties(irg, mtp_property_noreturn);
5701 if (decl_modifiers & DM_NOTHROW) {
5702 /* TRUE if the declaration includes the Microsoft
5703 __declspec(nothrow) specifier. */
5704 add_irg_additional_properties(irg, mtp_property_nothrow);
5706 if (decl_modifiers & DM_NAKED) {
5707 /* TRUE if the declaration includes the Microsoft
5708 __declspec(naked) specifier. */
5709 add_irg_additional_properties(irg, mtp_property_naked);
5711 if (decl_modifiers & DM_FORCEINLINE) {
5712 /* TRUE if the declaration includes the
5713 Microsoft __forceinline specifier. */
5714 set_irg_inline_property(irg, irg_inline_forced);
5716 if (decl_modifiers & DM_NOINLINE) {
5717 /* TRUE if the declaration includes the Microsoft
5718 __declspec(noinline) specifier. */
5719 set_irg_inline_property(irg, irg_inline_forbidden);
5723 static void add_function_pointer(ir_type *segment, ir_entity *method,
5724 const char *unique_template)
5726 ir_type *method_type = get_entity_type(method);
5727 ir_type *ptr_type = new_type_pointer(method_type);
5729 /* these entities don't really have a name but firm only allows
5731 * Note that we mustn't give these entities a name since for example
5732 * Mach-O doesn't allow them. */
5733 ident *ide = id_unique(unique_template);
5734 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5735 ir_graph *irg = get_const_code_irg();
5736 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5739 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5740 set_entity_compiler_generated(ptr, 1);
5741 set_entity_visibility(ptr, ir_visibility_private);
5742 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5743 set_atomic_ent_value(ptr, val);
5747 * Generate possible IJmp branches to a given label block.
5749 static void gen_ijmp_branches(ir_node *block)
5752 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5753 add_immBlock_pred(block, ijmp);
5758 * Create code for a function and all inner functions.
5760 * @param entity the function entity
5762 static void create_function(entity_t *entity)
5764 assert(entity->kind == ENTITY_FUNCTION);
5765 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5767 if (entity->function.statement == NULL)
5770 if (is_main(entity) && enable_main_collect2_hack) {
5771 prepare_main_collect2(entity);
5774 inner_functions = NULL;
5775 current_trampolines = NULL;
5777 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5778 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5779 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5781 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5782 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5783 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5786 current_function_entity = entity;
5787 current_function_name = NULL;
5788 current_funcsig = NULL;
5790 assert(all_labels == NULL);
5791 all_labels = NEW_ARR_F(label_t *, 0);
5794 int n_local_vars = get_function_n_local_vars(entity);
5795 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5796 current_ir_graph = irg;
5798 ir_graph *old_current_function = current_function;
5799 current_function = irg;
5801 set_irg_fp_model(irg, firm_fp_model);
5802 tarval_enable_fp_ops(1);
5803 set_irn_dbg_info(get_irg_start_block(irg),
5804 get_entity_dbg_info(function_entity));
5806 ir_node *first_block = get_cur_block();
5808 /* set inline flags */
5809 if (entity->function.is_inline)
5810 set_irg_inline_property(irg, irg_inline_recomended);
5811 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5813 next_value_number_function = 0;
5814 initialize_function_parameters(entity);
5815 current_static_link = entity->function.static_link;
5817 statement_to_firm(entity->function.statement);
5819 ir_node *end_block = get_irg_end_block(irg);
5821 /* do we have a return statement yet? */
5822 if (currently_reachable()) {
5823 type_t *type = skip_typeref(entity->declaration.type);
5824 assert(is_type_function(type));
5825 const function_type_t *func_type = &type->function;
5826 const type_t *return_type
5827 = skip_typeref(func_type->return_type);
5830 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5831 ret = new_Return(get_store(), 0, NULL);
5834 if (is_type_scalar(return_type)) {
5835 mode = get_ir_mode_storage(func_type->return_type);
5841 /* ยง5.1.2.2.3 main implicitly returns 0 */
5842 if (is_main(entity)) {
5843 in[0] = new_Const(get_mode_null(mode));
5845 in[0] = new_Unknown(mode);
5847 ret = new_Return(get_store(), 1, in);
5849 add_immBlock_pred(end_block, ret);
5852 bool has_computed_gotos = false;
5853 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5854 label_t *label = all_labels[i];
5855 if (label->address_taken) {
5856 gen_ijmp_branches(label->block);
5857 has_computed_gotos = true;
5859 mature_immBlock(label->block);
5861 if (has_computed_gotos) {
5862 /* if we have computed goto's in the function, we cannot inline it */
5863 if (get_irg_inline_property(irg) >= irg_inline_recomended) {
5864 source_position_t const *const pos = &entity->base.source_position;
5865 warningf(WARN_OTHER, pos, "'%N' can never be inlined because it contains a computed goto", entity);
5867 set_irg_inline_property(irg, irg_inline_forbidden);
5870 DEL_ARR_F(all_labels);
5873 mature_immBlock(first_block);
5874 mature_immBlock(end_block);
5876 irg_finalize_cons(irg);
5878 /* finalize the frame type */
5879 ir_type *frame_type = get_irg_frame_type(irg);
5880 int n = get_compound_n_members(frame_type);
5883 for (int i = 0; i < n; ++i) {
5884 ir_entity *member = get_compound_member(frame_type, i);
5885 ir_type *entity_type = get_entity_type(member);
5887 int align = get_type_alignment_bytes(entity_type);
5888 if (align > align_all)
5892 misalign = offset % align;
5894 offset += align - misalign;
5898 set_entity_offset(member, offset);
5899 offset += get_type_size_bytes(entity_type);
5901 set_type_size_bytes(frame_type, offset);
5902 set_type_alignment_bytes(frame_type, align_all);
5904 irg_verify(irg, VERIFY_ENFORCE_SSA);
5905 current_function = old_current_function;
5907 if (current_trampolines != NULL) {
5908 DEL_ARR_F(current_trampolines);
5909 current_trampolines = NULL;
5912 /* create inner functions if any */
5913 entity_t **inner = inner_functions;
5914 if (inner != NULL) {
5915 ir_type *rem_outer_frame = current_outer_frame;
5916 current_outer_frame = get_irg_frame_type(current_ir_graph);
5917 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5918 create_function(inner[i]);
5922 current_outer_frame = rem_outer_frame;
5926 static void scope_to_firm(scope_t *scope)
5928 /* first pass: create declarations */
5929 entity_t *entity = scope->entities;
5930 for ( ; entity != NULL; entity = entity->base.next) {
5931 if (entity->base.symbol == NULL)
5934 if (entity->kind == ENTITY_FUNCTION) {
5935 if (entity->function.btk != bk_none) {
5936 /* builtins have no representation */
5939 (void)get_function_entity(entity, NULL);
5940 } else if (entity->kind == ENTITY_VARIABLE) {
5941 create_global_variable(entity);
5942 } else if (entity->kind == ENTITY_NAMESPACE) {
5943 scope_to_firm(&entity->namespacee.members);
5947 /* second pass: create code/initializers */
5948 entity = scope->entities;
5949 for ( ; entity != NULL; entity = entity->base.next) {
5950 if (entity->base.symbol == NULL)
5953 if (entity->kind == ENTITY_FUNCTION) {
5954 if (entity->function.btk != bk_none) {
5955 /* builtins have no representation */
5958 create_function(entity);
5959 } else if (entity->kind == ENTITY_VARIABLE) {
5960 assert(entity->declaration.kind
5961 == DECLARATION_KIND_GLOBAL_VARIABLE);
5962 current_ir_graph = get_const_code_irg();
5963 create_variable_initializer(entity);
5968 void init_ast2firm(void)
5970 obstack_init(&asm_obst);
5971 init_atomic_modes();
5973 ir_set_debug_retrieve(dbg_retrieve);
5974 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5976 /* create idents for all known runtime functions */
5977 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5978 rts_idents[i] = new_id_from_str(rts_data[i].name);
5981 entitymap_init(&entitymap);
5984 static void init_ir_types(void)
5986 static int ir_types_initialized = 0;
5987 if (ir_types_initialized)
5989 ir_types_initialized = 1;
5991 ir_type_int = get_ir_type(type_int);
5992 ir_type_char = get_ir_type(type_char);
5993 ir_type_const_char = get_ir_type(type_const_char);
5994 ir_type_wchar_t = get_ir_type(type_wchar_t);
5995 ir_type_void = get_ir_type(type_void);
5997 be_params = be_get_backend_param();
5998 mode_float_arithmetic = be_params->mode_float_arithmetic;
6000 stack_param_align = be_params->stack_param_align;
6003 void exit_ast2firm(void)
6005 entitymap_destroy(&entitymap);
6006 obstack_free(&asm_obst, NULL);
6009 static void global_asm_to_firm(statement_t *s)
6011 for (; s != NULL; s = s->base.next) {
6012 assert(s->kind == STATEMENT_ASM);
6014 char const *const text = s->asms.asm_text.begin;
6015 size_t size = s->asms.asm_text.size;
6017 /* skip the last \0 */
6018 if (text[size - 1] == '\0')
6021 ident *const id = new_id_from_chars(text, size);
6026 void translation_unit_to_firm(translation_unit_t *unit)
6028 /* initialize firm arithmetic */
6029 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
6030 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
6032 /* just to be sure */
6033 continue_label = NULL;
6035 current_switch_cond = NULL;
6036 current_translation_unit = unit;
6040 scope_to_firm(&unit->scope);
6041 global_asm_to_firm(unit->global_asm);
6043 current_ir_graph = NULL;
6044 current_translation_unit = NULL;