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);
746 if (firm_type == NULL)
747 panic("unknown type found");
749 type->base.firm_type = firm_type;
753 static ir_mode *get_ir_mode_storage(type_t *type)
755 ir_type *irtype = get_ir_type(type);
757 /* firm doesn't report a mode for arrays somehow... */
758 if (is_Array_type(irtype)) {
762 ir_mode *mode = get_type_mode(irtype);
763 assert(mode != NULL);
768 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
769 * int that it returns bigger modes for floating point on some platforms
770 * (x87 internally does arithemtic with 80bits)
772 static ir_mode *get_ir_mode_arithmetic(type_t *type)
774 ir_mode *mode = get_ir_mode_storage(type);
775 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
776 return mode_float_arithmetic;
782 /** Names of the runtime functions. */
783 static const struct {
784 int id; /**< the rts id */
785 int n_res; /**< number of return values */
786 const char *name; /**< the name of the rts function */
787 int n_params; /**< number of parameters */
788 unsigned flags; /**< language flags */
790 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
791 { rts_abort, 0, "abort", 0, _C89 },
792 { rts_alloca, 1, "alloca", 1, _ALL },
793 { rts_abs, 1, "abs", 1, _C89 },
794 { rts_labs, 1, "labs", 1, _C89 },
795 { rts_llabs, 1, "llabs", 1, _C99 },
796 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
798 { rts_fabs, 1, "fabs", 1, _C89 },
799 { rts_sqrt, 1, "sqrt", 1, _C89 },
800 { rts_cbrt, 1, "cbrt", 1, _C99 },
801 { rts_exp, 1, "exp", 1, _C89 },
802 { rts_exp2, 1, "exp2", 1, _C89 },
803 { rts_exp10, 1, "exp10", 1, _GNUC },
804 { rts_log, 1, "log", 1, _C89 },
805 { rts_log2, 1, "log2", 1, _C89 },
806 { rts_log10, 1, "log10", 1, _C89 },
807 { rts_pow, 1, "pow", 2, _C89 },
808 { rts_sin, 1, "sin", 1, _C89 },
809 { rts_cos, 1, "cos", 1, _C89 },
810 { rts_tan, 1, "tan", 1, _C89 },
811 { rts_asin, 1, "asin", 1, _C89 },
812 { rts_acos, 1, "acos", 1, _C89 },
813 { rts_atan, 1, "atan", 1, _C89 },
814 { rts_sinh, 1, "sinh", 1, _C89 },
815 { rts_cosh, 1, "cosh", 1, _C89 },
816 { rts_tanh, 1, "tanh", 1, _C89 },
818 { rts_fabsf, 1, "fabsf", 1, _C99 },
819 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
820 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
821 { rts_expf, 1, "expf", 1, _C99 },
822 { rts_exp2f, 1, "exp2f", 1, _C99 },
823 { rts_exp10f, 1, "exp10f", 1, _GNUC },
824 { rts_logf, 1, "logf", 1, _C99 },
825 { rts_log2f, 1, "log2f", 1, _C99 },
826 { rts_log10f, 1, "log10f", 1, _C99 },
827 { rts_powf, 1, "powf", 2, _C99 },
828 { rts_sinf, 1, "sinf", 1, _C99 },
829 { rts_cosf, 1, "cosf", 1, _C99 },
830 { rts_tanf, 1, "tanf", 1, _C99 },
831 { rts_asinf, 1, "asinf", 1, _C99 },
832 { rts_acosf, 1, "acosf", 1, _C99 },
833 { rts_atanf, 1, "atanf", 1, _C99 },
834 { rts_sinhf, 1, "sinhf", 1, _C99 },
835 { rts_coshf, 1, "coshf", 1, _C99 },
836 { rts_tanhf, 1, "tanhf", 1, _C99 },
838 { rts_fabsl, 1, "fabsl", 1, _C99 },
839 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
840 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
841 { rts_expl, 1, "expl", 1, _C99 },
842 { rts_exp2l, 1, "exp2l", 1, _C99 },
843 { rts_exp10l, 1, "exp10l", 1, _GNUC },
844 { rts_logl, 1, "logl", 1, _C99 },
845 { rts_log2l, 1, "log2l", 1, _C99 },
846 { rts_log10l, 1, "log10l", 1, _C99 },
847 { rts_powl, 1, "powl", 2, _C99 },
848 { rts_sinl, 1, "sinl", 1, _C99 },
849 { rts_cosl, 1, "cosl", 1, _C99 },
850 { rts_tanl, 1, "tanl", 1, _C99 },
851 { rts_asinl, 1, "asinl", 1, _C99 },
852 { rts_acosl, 1, "acosl", 1, _C99 },
853 { rts_atanl, 1, "atanl", 1, _C99 },
854 { rts_sinhl, 1, "sinhl", 1, _C99 },
855 { rts_coshl, 1, "coshl", 1, _C99 },
856 { rts_tanhl, 1, "tanhl", 1, _C99 },
858 { rts_strcmp, 1, "strcmp", 2, _C89 },
859 { rts_strncmp, 1, "strncmp", 3, _C89 },
860 { rts_strcpy, 1, "strcpy", 2, _C89 },
861 { rts_strlen, 1, "strlen", 1, _C89 },
862 { rts_memcpy, 1, "memcpy", 3, _C89 },
863 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
864 { rts_memmove, 1, "memmove", 3, _C89 },
865 { rts_memset, 1, "memset", 3, _C89 },
866 { rts_memcmp, 1, "memcmp", 3, _C89 },
869 static ident *rts_idents[lengthof(rts_data)];
871 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
873 void set_create_ld_ident(ident *(*func)(entity_t*))
875 create_ld_ident = func;
879 * Handle GNU attributes for entities
881 * @param ent the entity
882 * @param decl the routine declaration
884 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
886 assert(is_declaration(entity));
887 decl_modifiers_t modifiers = entity->declaration.modifiers;
889 if (is_method_entity(irentity)) {
890 if (modifiers & DM_PURE) {
891 set_entity_additional_properties(irentity, mtp_property_pure);
893 if (modifiers & DM_CONST) {
894 add_entity_additional_properties(irentity, mtp_property_const);
897 if (modifiers & DM_USED) {
898 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
900 if (modifiers & DM_WEAK) {
901 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
905 static bool is_main(entity_t *entity)
907 static symbol_t *sym_main = NULL;
908 if (sym_main == NULL) {
909 sym_main = symbol_table_insert("main");
912 if (entity->base.symbol != sym_main)
914 /* must be in outermost scope */
915 if (entity->base.parent_scope != ¤t_translation_unit->scope)
922 * Creates an entity representing a function.
924 * @param entity the function declaration/definition
925 * @param owner_type the owner type of this function, NULL
926 * for global functions
928 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
930 assert(entity->kind == ENTITY_FUNCTION);
931 if (entity->function.irentity != NULL) {
932 return entity->function.irentity;
935 entity_t *original_entity = entity;
936 if (entity->function.btk != bk_none) {
937 entity = get_builtin_replacement(entity);
942 if (is_main(entity)) {
943 /* force main to C linkage */
944 type_t *type = entity->declaration.type;
945 assert(is_type_function(type));
946 if (type->function.linkage != LINKAGE_C) {
947 type_t *new_type = duplicate_type(type);
948 new_type->function.linkage = LINKAGE_C;
949 type = identify_new_type(new_type);
950 entity->declaration.type = type;
954 symbol_t *symbol = entity->base.symbol;
955 ident *id = new_id_from_str(symbol->string);
957 /* already an entity defined? */
958 ir_entity *irentity = entitymap_get(&entitymap, symbol);
959 bool const has_body = entity->function.statement != NULL;
960 if (irentity != NULL) {
961 if (get_entity_visibility(irentity) == ir_visibility_external
963 set_entity_visibility(irentity, ir_visibility_default);
968 ir_type *ir_type_method;
969 if (entity->function.need_closure)
970 ir_type_method = create_method_type(&entity->declaration.type->function, true);
972 ir_type_method = get_ir_type(entity->declaration.type);
974 bool nested_function = false;
975 if (owner_type == NULL)
976 owner_type = get_glob_type();
978 nested_function = true;
980 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
981 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
985 ld_id = id_unique("inner.%u");
987 ld_id = create_ld_ident(entity);
988 set_entity_ld_ident(irentity, ld_id);
990 handle_decl_modifiers(irentity, entity);
992 if (! nested_function) {
993 /* static inline => local
994 * extern inline => local
995 * inline without definition => local
996 * inline with definition => external_visible */
997 storage_class_tag_t const storage_class
998 = (storage_class_tag_t) entity->declaration.storage_class;
999 bool const is_inline = entity->function.is_inline;
1001 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
1002 set_entity_visibility(irentity, ir_visibility_default);
1003 } else if (storage_class == STORAGE_CLASS_STATIC ||
1004 (is_inline && has_body)) {
1005 set_entity_visibility(irentity, ir_visibility_local);
1006 } else if (has_body) {
1007 set_entity_visibility(irentity, ir_visibility_default);
1009 set_entity_visibility(irentity, ir_visibility_external);
1012 /* nested functions are always local */
1013 set_entity_visibility(irentity, ir_visibility_local);
1016 /* We should check for file scope here, but as long as we compile C only
1017 this is not needed. */
1018 if (!freestanding && !has_body) {
1019 /* check for a known runtime function */
1020 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1021 if (id != rts_idents[i])
1024 function_type_t *function_type
1025 = &entity->declaration.type->function;
1026 /* rts_entities code can't handle a "wrong" number of parameters */
1027 if (function_type->unspecified_parameters)
1030 /* check number of parameters */
1031 int n_params = count_parameters(function_type);
1032 if (n_params != rts_data[i].n_params)
1035 type_t *return_type = skip_typeref(function_type->return_type);
1036 int n_res = return_type != type_void ? 1 : 0;
1037 if (n_res != rts_data[i].n_res)
1040 /* ignore those rts functions not necessary needed for current mode */
1041 if ((c_mode & rts_data[i].flags) == 0)
1043 assert(rts_entities[rts_data[i].id] == NULL);
1044 rts_entities[rts_data[i].id] = irentity;
1048 entitymap_insert(&entitymap, symbol, irentity);
1051 original_entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1052 original_entity->function.irentity = irentity;
1058 * Creates a SymConst for a given entity.
1060 * @param dbgi debug info
1061 * @param entity the entity
1063 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1065 assert(entity != NULL);
1066 union symconst_symbol sym;
1067 sym.entity_p = entity;
1068 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1071 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1073 ir_mode *value_mode = get_irn_mode(value);
1075 if (value_mode == dest_mode)
1078 if (dest_mode == mode_b) {
1079 ir_node *zero = new_Const(get_mode_null(value_mode));
1080 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_less_greater);
1084 return new_d_Conv(dbgi, value, dest_mode);
1087 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1089 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1093 * Creates a SymConst node representing a wide string literal.
1095 * @param literal the wide string literal
1097 static ir_node *wide_string_literal_to_firm(
1098 const string_literal_expression_t *literal)
1100 ir_type *const global_type = get_glob_type();
1101 ir_type *const elem_type = ir_type_wchar_t;
1102 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1103 ir_type *const type = new_type_array(1, elem_type);
1105 ident *const id = id_unique("str.%u");
1106 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1107 set_entity_ld_ident(entity, id);
1108 set_entity_visibility(entity, ir_visibility_private);
1109 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1111 ir_mode *const mode = get_type_mode(elem_type);
1112 const size_t slen = wstrlen(&literal->value);
1114 set_array_lower_bound_int(type, 0, 0);
1115 set_array_upper_bound_int(type, 0, slen);
1116 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1117 set_type_state(type, layout_fixed);
1119 ir_initializer_t *initializer = create_initializer_compound(slen);
1120 const char *p = literal->value.begin;
1121 for (size_t i = 0; i < slen; ++i) {
1122 assert(p < literal->value.begin + literal->value.size);
1123 utf32 v = read_utf8_char(&p);
1124 ir_tarval *tv = new_tarval_from_long(v, mode);
1125 ir_initializer_t *val = create_initializer_tarval(tv);
1126 set_initializer_compound_value(initializer, i, val);
1128 set_entity_initializer(entity, initializer);
1130 return create_symconst(dbgi, entity);
1134 * Creates a SymConst node representing a string constant.
1136 * @param src_pos the source position of the string constant
1137 * @param id_prefix a prefix for the name of the generated string constant
1138 * @param value the value of the string constant
1140 static ir_node *string_to_firm(const source_position_t *const src_pos,
1141 const char *const id_prefix,
1142 const string_t *const value)
1144 ir_type *const global_type = get_glob_type();
1145 dbg_info *const dbgi = get_dbg_info(src_pos);
1146 ir_type *const type = new_type_array(1, ir_type_const_char);
1148 ident *const id = id_unique(id_prefix);
1149 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1150 set_entity_ld_ident(entity, id);
1151 set_entity_visibility(entity, ir_visibility_private);
1152 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1154 ir_type *const elem_type = ir_type_const_char;
1155 ir_mode *const mode = get_type_mode(elem_type);
1157 const char* const string = value->begin;
1158 const size_t slen = value->size;
1160 set_array_lower_bound_int(type, 0, 0);
1161 set_array_upper_bound_int(type, 0, slen);
1162 set_type_size_bytes(type, slen);
1163 set_type_state(type, layout_fixed);
1165 ir_initializer_t *initializer = create_initializer_compound(slen);
1166 for (size_t i = 0; i < slen; ++i) {
1167 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1168 ir_initializer_t *val = create_initializer_tarval(tv);
1169 set_initializer_compound_value(initializer, i, val);
1171 set_entity_initializer(entity, initializer);
1173 return create_symconst(dbgi, entity);
1176 static bool try_create_integer(literal_expression_t *literal,
1177 type_t *type, unsigned char base)
1179 const char *string = literal->value.begin;
1180 size_t size = literal->value.size;
1182 assert(type->kind == TYPE_ATOMIC);
1183 atomic_type_kind_t akind = type->atomic.akind;
1185 ir_mode *mode = atomic_modes[akind];
1186 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1187 if (tv == tarval_bad)
1190 literal->base.type = type;
1191 literal->target_value = tv;
1195 static void create_integer_tarval(literal_expression_t *literal)
1199 const string_t *suffix = &literal->suffix;
1201 if (suffix->size > 0) {
1202 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1203 if (*c == 'u' || *c == 'U') { ++us; }
1204 if (*c == 'l' || *c == 'L') { ++ls; }
1209 switch (literal->base.kind) {
1210 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1211 case EXPR_LITERAL_INTEGER: base = 10; break;
1212 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1213 default: panic("invalid literal kind");
1216 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1218 /* now try if the constant is small enough for some types */
1219 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1221 if (us == 0 && try_create_integer(literal, type_int, base))
1223 if ((us == 1 || base != 10)
1224 && try_create_integer(literal, type_unsigned_int, base))
1228 if (us == 0 && try_create_integer(literal, type_long, base))
1230 if ((us == 1 || base != 10)
1231 && try_create_integer(literal, type_unsigned_long, base))
1234 /* last try? then we should not report tarval_bad */
1235 if (us != 1 && base == 10)
1236 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1237 if (us == 0 && try_create_integer(literal, type_long_long, base))
1241 assert(us == 1 || base != 10);
1242 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1243 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1245 panic("internal error when parsing number literal");
1248 tarval_set_integer_overflow_mode(old_mode);
1251 void determine_literal_type(literal_expression_t *literal)
1253 switch (literal->base.kind) {
1254 case EXPR_LITERAL_INTEGER:
1255 case EXPR_LITERAL_INTEGER_OCTAL:
1256 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1257 create_integer_tarval(literal);
1265 * Creates a Const node representing a constant.
1267 static ir_node *literal_to_firm(const literal_expression_t *literal)
1269 type_t *type = skip_typeref(literal->base.type);
1270 ir_mode *mode = get_ir_mode_storage(type);
1271 const char *string = literal->value.begin;
1272 size_t size = literal->value.size;
1275 switch (literal->base.kind) {
1276 case EXPR_LITERAL_WIDE_CHARACTER: {
1277 utf32 v = read_utf8_char(&string);
1279 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1281 tv = new_tarval_from_str(buf, len, mode);
1284 case EXPR_LITERAL_CHARACTER: {
1287 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1288 if (size == 1 && char_is_signed) {
1289 v = (signed char)string[0];
1292 for (size_t i = 0; i < size; ++i) {
1293 v = (v << 8) | ((unsigned char)string[i]);
1297 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1299 tv = new_tarval_from_str(buf, len, mode);
1302 case EXPR_LITERAL_INTEGER:
1303 case EXPR_LITERAL_INTEGER_OCTAL:
1304 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1305 assert(literal->target_value != NULL);
1306 tv = literal->target_value;
1308 case EXPR_LITERAL_FLOATINGPOINT:
1309 tv = new_tarval_from_str(string, size, mode);
1311 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1312 char buffer[size + 2];
1313 memcpy(buffer, "0x", 2);
1314 memcpy(buffer+2, string, size);
1315 tv = new_tarval_from_str(buffer, size+2, mode);
1318 case EXPR_LITERAL_BOOLEAN:
1319 if (string[0] == 't') {
1320 tv = get_mode_one(mode);
1322 assert(string[0] == 'f');
1323 tv = get_mode_null(mode);
1326 case EXPR_LITERAL_MS_NOOP:
1327 tv = get_mode_null(mode);
1332 panic("Invalid literal kind found");
1335 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1336 ir_node *res = new_d_Const(dbgi, tv);
1337 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1338 return create_conv(dbgi, res, mode_arith);
1342 * Allocate an area of size bytes aligned at alignment
1345 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1347 static unsigned area_cnt = 0;
1350 ir_type *tp = new_type_array(1, ir_type_char);
1351 set_array_bounds_int(tp, 0, 0, size);
1352 set_type_alignment_bytes(tp, alignment);
1354 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1355 ident *name = new_id_from_str(buf);
1356 ir_entity *area = new_entity(frame_type, name, tp);
1358 /* mark this entity as compiler generated */
1359 set_entity_compiler_generated(area, 1);
1364 * Return a node representing a trampoline region
1365 * for a given function entity.
1367 * @param dbgi debug info
1368 * @param entity the function entity
1370 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1372 ir_entity *region = NULL;
1375 if (current_trampolines != NULL) {
1376 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1377 if (current_trampolines[i].function == entity) {
1378 region = current_trampolines[i].region;
1383 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1385 ir_graph *irg = current_ir_graph;
1386 if (region == NULL) {
1387 /* create a new region */
1388 ir_type *frame_tp = get_irg_frame_type(irg);
1389 trampoline_region reg;
1390 reg.function = entity;
1392 reg.region = alloc_trampoline(frame_tp,
1393 be_params->trampoline_size,
1394 be_params->trampoline_align);
1395 ARR_APP1(trampoline_region, current_trampolines, reg);
1396 region = reg.region;
1398 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1403 * Creates a trampoline for a function represented by an entity.
1405 * @param dbgi debug info
1406 * @param mode the (reference) mode for the function address
1407 * @param entity the function entity
1409 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1412 assert(entity != NULL);
1414 in[0] = get_trampoline_region(dbgi, entity);
1415 in[1] = create_symconst(dbgi, entity);
1416 in[2] = get_irg_frame(current_ir_graph);
1418 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1419 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1420 return new_Proj(irn, mode, pn_Builtin_1_result);
1424 * Dereference an address.
1426 * @param dbgi debug info
1427 * @param type the type of the dereferenced result (the points_to type)
1428 * @param addr the address to dereference
1430 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1431 ir_node *const addr)
1433 ir_type *irtype = get_ir_type(type);
1434 if (is_compound_type(irtype)
1435 || is_Method_type(irtype)
1436 || is_Array_type(irtype)) {
1440 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1441 ? cons_volatile : cons_none;
1442 ir_mode *const mode = get_type_mode(irtype);
1443 ir_node *const memory = get_store();
1444 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1445 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1446 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1448 set_store(load_mem);
1450 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(type);
1451 return create_conv(dbgi, load_res, mode_arithmetic);
1455 * Creates a strict Conv (to the node's mode) if necessary.
1457 * @param dbgi debug info
1458 * @param node the node to strict conv
1460 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1462 ir_mode *mode = get_irn_mode(node);
1464 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1466 if (!mode_is_float(mode))
1469 /* check if there is already a Conv */
1470 if (is_Conv(node)) {
1471 /* convert it into a strict Conv */
1472 set_Conv_strict(node, 1);
1476 /* otherwise create a new one */
1477 return new_d_strictConv(dbgi, node, mode);
1481 * Returns the correct base address depending on whether it is a parameter or a
1482 * normal local variable.
1484 static ir_node *get_local_frame(ir_entity *const ent)
1486 ir_graph *const irg = current_ir_graph;
1487 const ir_type *const owner = get_entity_owner(ent);
1488 if (owner == current_outer_frame) {
1489 assert(current_static_link != NULL);
1490 return current_static_link;
1492 return get_irg_frame(irg);
1497 * Keep all memory edges of the given block.
1499 static void keep_all_memory(ir_node *block)
1501 ir_node *old = get_cur_block();
1503 set_cur_block(block);
1504 keep_alive(get_store());
1505 /* TODO: keep all memory edges from restricted pointers */
1509 static ir_node *reference_expression_enum_value_to_firm(
1510 const reference_expression_t *ref)
1512 entity_t *entity = ref->entity;
1513 type_t *type = skip_typeref(entity->enum_value.enum_type);
1514 /* make sure the type is constructed */
1515 (void) get_ir_type(type);
1517 return new_Const(entity->enum_value.tv);
1520 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1522 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1523 entity_t *entity = ref->entity;
1524 assert(is_declaration(entity));
1525 type_t *type = skip_typeref(entity->declaration.type);
1527 /* make sure the type is constructed */
1528 (void) get_ir_type(type);
1530 if (entity->kind == ENTITY_FUNCTION && entity->function.btk != bk_none) {
1531 ir_entity *irentity = get_function_entity(entity, NULL);
1532 /* for gcc compatibility we have to produce (dummy) addresses for some
1533 * builtins which don't have entities */
1534 if (irentity == NULL) {
1535 source_position_t const *const pos = &ref->base.source_position;
1536 symbol_t const *const sym = ref->entity->base.symbol;
1537 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1539 /* simply create a NULL pointer */
1540 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1541 ir_node *res = new_Const(get_mode_null(mode));
1547 switch ((declaration_kind_t) entity->declaration.kind) {
1548 case DECLARATION_KIND_UNKNOWN:
1551 case DECLARATION_KIND_LOCAL_VARIABLE: {
1552 ir_mode *const mode = get_ir_mode_storage(type);
1553 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1554 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1556 case DECLARATION_KIND_PARAMETER: {
1557 ir_mode *const mode = get_ir_mode_storage(type);
1558 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1559 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1561 case DECLARATION_KIND_FUNCTION: {
1562 return create_symconst(dbgi, entity->function.irentity);
1564 case DECLARATION_KIND_INNER_FUNCTION: {
1565 ir_mode *const mode = get_ir_mode_storage(type);
1566 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1567 /* inner function not using the closure */
1568 return create_symconst(dbgi, entity->function.irentity);
1570 /* need trampoline here */
1571 return create_trampoline(dbgi, mode, entity->function.irentity);
1574 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1575 const variable_t *variable = &entity->variable;
1576 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1577 return deref_address(dbgi, variable->base.type, addr);
1580 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1581 ir_entity *irentity = entity->variable.v.entity;
1582 ir_node *frame = get_local_frame(irentity);
1583 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1584 return deref_address(dbgi, entity->declaration.type, sel);
1586 case DECLARATION_KIND_PARAMETER_ENTITY: {
1587 ir_entity *irentity = entity->parameter.v.entity;
1588 ir_node *frame = get_local_frame(irentity);
1589 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1590 return deref_address(dbgi, entity->declaration.type, sel);
1593 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1594 return entity->variable.v.vla_base;
1596 case DECLARATION_KIND_COMPOUND_MEMBER:
1597 panic("not implemented reference type");
1600 panic("reference to declaration with unknown type found");
1603 static ir_node *reference_addr(const reference_expression_t *ref)
1605 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1606 entity_t *entity = ref->entity;
1607 assert(is_declaration(entity));
1609 switch((declaration_kind_t) entity->declaration.kind) {
1610 case DECLARATION_KIND_UNKNOWN:
1612 case DECLARATION_KIND_PARAMETER:
1613 case DECLARATION_KIND_LOCAL_VARIABLE:
1614 /* you can store to a local variable (so we don't panic but return NULL
1615 * as an indicator for no real address) */
1617 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1618 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1621 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1622 ir_entity *irentity = entity->variable.v.entity;
1623 ir_node *frame = get_local_frame(irentity);
1624 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1628 case DECLARATION_KIND_PARAMETER_ENTITY: {
1629 ir_entity *irentity = entity->parameter.v.entity;
1630 ir_node *frame = get_local_frame(irentity);
1631 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1636 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1637 return entity->variable.v.vla_base;
1639 case DECLARATION_KIND_FUNCTION: {
1640 return create_symconst(dbgi, entity->function.irentity);
1643 case DECLARATION_KIND_INNER_FUNCTION: {
1644 type_t *const type = skip_typeref(entity->declaration.type);
1645 ir_mode *const mode = get_ir_mode_storage(type);
1646 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1647 /* inner function not using the closure */
1648 return create_symconst(dbgi, entity->function.irentity);
1650 /* need trampoline here */
1651 return create_trampoline(dbgi, mode, entity->function.irentity);
1655 case DECLARATION_KIND_COMPOUND_MEMBER:
1656 panic("not implemented reference type");
1659 panic("reference to declaration with unknown type found");
1663 * Generate an unary builtin.
1665 * @param kind the builtin kind to generate
1666 * @param op the operand
1667 * @param function_type the function type for the GNU builtin routine
1668 * @param db debug info
1670 static ir_node *gen_unary_builtin(ir_builtin_kind kind, expression_t *op, type_t *function_type, dbg_info *db)
1673 in[0] = expression_to_firm(op);
1675 ir_type *tp = get_ir_type(function_type);
1676 ir_type *res = get_method_res_type(tp, 0);
1677 ir_node *irn = new_d_Builtin(db, get_irg_no_mem(current_ir_graph), 1, in, kind, tp);
1678 set_irn_pinned(irn, op_pin_state_floats);
1679 return new_Proj(irn, get_type_mode(res), pn_Builtin_1_result);
1683 * Generate a pinned unary builtin.
1685 * @param kind the builtin kind to generate
1686 * @param op the operand
1687 * @param function_type the function type for the GNU builtin routine
1688 * @param db debug info
1690 static ir_node *gen_unary_builtin_pinned(ir_builtin_kind kind, expression_t *op,
1691 type_t *function_type, dbg_info *db)
1694 in[0] = expression_to_firm(op);
1696 ir_type *tp = get_ir_type(function_type);
1697 ir_type *res = get_method_res_type(tp, 0);
1698 ir_node *mem = get_store();
1699 ir_node *irn = new_d_Builtin(db, mem, 1, in, kind, tp);
1700 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1701 return new_Proj(irn, get_type_mode(res), pn_Builtin_1_result);
1705 * Generate an binary-void-return builtin.
1707 * @param kind the builtin kind to generate
1708 * @param op1 the first operand
1709 * @param op2 the second operand
1710 * @param function_type the function type for the GNU builtin routine
1711 * @param db debug info
1713 static ir_node *gen_binary_builtin_mem(ir_builtin_kind kind, expression_t *op1,
1714 expression_t *op2, type_t *function_type,
1718 in[0] = expression_to_firm(op1);
1719 in[1] = expression_to_firm(op2);
1721 ir_type *tp = get_ir_type(function_type);
1722 ir_node *mem = get_store();
1723 ir_node *irn = new_d_Builtin(db, mem, 2, in, kind, tp);
1724 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1729 * Transform calls to builtin functions.
1731 static ir_node *process_builtin_call(const call_expression_t *call)
1733 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1735 assert(call->function->kind == EXPR_REFERENCE);
1736 reference_expression_t *builtin = &call->function->reference;
1738 type_t *expr_type = skip_typeref(builtin->base.type);
1739 assert(is_type_pointer(expr_type));
1741 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1743 switch (builtin->entity->function.btk) {
1744 case bk_gnu_builtin_alloca: {
1745 if (call->arguments == NULL || call->arguments->next != NULL) {
1746 panic("invalid number of parameters on __builtin_alloca");
1748 expression_t *argument = call->arguments->expression;
1749 ir_node *size = expression_to_firm(argument);
1751 ir_node *store = get_store();
1752 ir_node *alloca = new_d_Alloc(dbgi, store, size, firm_unknown_type,
1754 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1756 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1761 case bk_gnu_builtin_huge_val:
1762 case bk_gnu_builtin_huge_valf:
1763 case bk_gnu_builtin_huge_vall:
1764 case bk_gnu_builtin_inf:
1765 case bk_gnu_builtin_inff:
1766 case bk_gnu_builtin_infl: {
1767 type_t *type = function_type->function.return_type;
1768 ir_mode *mode = get_ir_mode_arithmetic(type);
1769 ir_tarval *tv = get_mode_infinite(mode);
1770 ir_node *res = new_d_Const(dbgi, tv);
1773 case bk_gnu_builtin_nan:
1774 case bk_gnu_builtin_nanf:
1775 case bk_gnu_builtin_nanl: {
1776 /* Ignore string for now... */
1777 assert(is_type_function(function_type));
1778 type_t *type = function_type->function.return_type;
1779 ir_mode *mode = get_ir_mode_arithmetic(type);
1780 ir_tarval *tv = get_mode_NAN(mode);
1781 ir_node *res = new_d_Const(dbgi, tv);
1784 case bk_gnu_builtin_expect: {
1785 expression_t *argument = call->arguments->expression;
1786 return _expression_to_firm(argument);
1788 case bk_gnu_builtin_va_end:
1789 /* evaluate the argument of va_end for its side effects */
1790 _expression_to_firm(call->arguments->expression);
1792 case bk_gnu_builtin_frame_address: {
1793 expression_t *const expression = call->arguments->expression;
1794 bool val = fold_constant_to_bool(expression);
1797 return get_irg_frame(current_ir_graph);
1799 /* get the argument */
1802 in[0] = expression_to_firm(expression);
1803 in[1] = get_irg_frame(current_ir_graph);
1804 ir_type *tp = get_ir_type(function_type);
1805 ir_node *irn = new_d_Builtin(dbgi, get_irg_no_mem(current_ir_graph), 2, in, ir_bk_frame_address, tp);
1806 return new_Proj(irn, mode_P_data, pn_Builtin_1_result);
1809 case bk_gnu_builtin_return_address: {
1810 expression_t *const expression = call->arguments->expression;
1813 in[0] = expression_to_firm(expression);
1814 in[1] = get_irg_frame(current_ir_graph);
1815 ir_type *tp = get_ir_type(function_type);
1816 ir_node *irn = new_d_Builtin(dbgi, get_irg_no_mem(current_ir_graph), 2, in, ir_bk_return_address, tp);
1817 return new_Proj(irn, mode_P_data, pn_Builtin_1_result);
1819 case bk_gnu_builtin_ffs:
1820 return gen_unary_builtin(ir_bk_ffs, call->arguments->expression, function_type, dbgi);
1821 case bk_gnu_builtin_clz:
1822 case bk_gnu_builtin_clzl:
1823 case bk_gnu_builtin_clzll:
1824 return gen_unary_builtin(ir_bk_clz, call->arguments->expression, function_type, dbgi);
1825 case bk_gnu_builtin_ctz:
1826 case bk_gnu_builtin_ctzl:
1827 case bk_gnu_builtin_ctzll:
1828 return gen_unary_builtin(ir_bk_ctz, call->arguments->expression, function_type, dbgi);
1829 case bk_gnu_builtin_popcount:
1830 case bk_gnu_builtin_popcountl:
1831 case bk_gnu_builtin_popcountll:
1832 case bk_ms__popcount:
1833 return gen_unary_builtin(ir_bk_popcount, call->arguments->expression, function_type, dbgi);
1834 case bk_gnu_builtin_parity:
1835 return gen_unary_builtin(ir_bk_parity, call->arguments->expression, function_type, dbgi);
1836 case bk_gnu_builtin_prefetch: {
1837 call_argument_t *const args = call->arguments;
1838 expression_t *const addr = args->expression;
1841 in[0] = _expression_to_firm(addr);
1842 if (args->next != NULL) {
1843 expression_t *const rw = args->next->expression;
1845 in[1] = _expression_to_firm(rw);
1847 if (args->next->next != NULL) {
1848 expression_t *const locality = args->next->next->expression;
1850 in[2] = expression_to_firm(locality);
1852 in[2] = new_Const_long(mode_int, 3);
1855 in[1] = new_Const_long(mode_int, 0);
1856 in[2] = new_Const_long(mode_int, 3);
1858 ir_type *tp = get_ir_type(function_type);
1859 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_prefetch, tp);
1860 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1863 case bk_gnu_builtin_object_size: {
1864 /* determine value of "type" */
1865 expression_t *type_expression = call->arguments->next->expression;
1866 long type_val = fold_constant_to_int(type_expression);
1867 type_t *type = function_type->function.return_type;
1868 ir_mode *mode = get_ir_mode_arithmetic(type);
1869 /* just produce a "I don't know" result */
1870 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1871 get_mode_minus_one(mode);
1873 return new_d_Const(dbgi, result);
1875 case bk_gnu_builtin_trap:
1878 ir_type *tp = get_ir_type(function_type);
1879 ir_node *irn = new_d_Builtin(dbgi, get_store(), 0, NULL, ir_bk_trap, tp);
1880 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1883 case bk_ms__debugbreak: {
1884 ir_type *tp = get_ir_type(function_type);
1885 ir_node *irn = new_d_Builtin(dbgi, get_store(), 0, NULL, ir_bk_debugbreak, tp);
1886 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1889 case bk_ms_ReturnAddress: {
1892 in[0] = new_Const(get_mode_null(mode_int));
1893 in[1] = get_irg_frame(current_ir_graph);
1894 ir_type *tp = get_ir_type(function_type);
1895 ir_node *irn = new_d_Builtin(dbgi, get_irg_no_mem(current_ir_graph), 2, in, ir_bk_return_address, tp);
1896 return new_Proj(irn, mode_P_data, pn_Builtin_1_result);
1899 case bk_ms_rotl64: {
1900 ir_node *val = expression_to_firm(call->arguments->expression);
1901 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1902 ir_mode *mode = get_irn_mode(val);
1903 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1906 case bk_ms_rotr64: {
1907 ir_node *val = expression_to_firm(call->arguments->expression);
1908 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1909 ir_mode *mode = get_irn_mode(val);
1910 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1911 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1912 return new_d_Rotl(dbgi, val, sub, mode);
1914 case bk_ms_byteswap_ushort:
1915 case bk_ms_byteswap_ulong:
1916 case bk_ms_byteswap_uint64:
1917 return gen_unary_builtin(ir_bk_bswap, call->arguments->expression, function_type, dbgi);
1920 case bk_ms__indword:
1921 return gen_unary_builtin_pinned(ir_bk_inport, call->arguments->expression, function_type, dbgi);
1922 case bk_ms__outbyte:
1923 case bk_ms__outword:
1924 case bk_ms__outdword:
1925 return gen_binary_builtin_mem(ir_bk_outport, call->arguments->expression,
1926 call->arguments->next->expression, function_type, dbgi);
1928 panic("unsupported builtin found");
1933 * Transform a call expression.
1934 * Handles some special cases, like alloca() calls, which must be resolved
1935 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1936 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1939 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1941 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1942 assert(currently_reachable());
1944 expression_t *function = call->function;
1945 if (function->kind == EXPR_REFERENCE) {
1946 const reference_expression_t *ref = &function->reference;
1947 entity_t *entity = ref->entity;
1949 if (entity->kind == ENTITY_FUNCTION) {
1950 ir_entity *irentity = entity->function.irentity;
1951 if (irentity == NULL)
1952 irentity = get_function_entity(entity, NULL);
1954 if (irentity == NULL && entity->function.btk != bk_none) {
1955 return process_builtin_call(call);
1959 if (irentity == rts_entities[rts_alloca]) {
1960 /* handle alloca() call */
1961 expression_t *argument = call->arguments->expression;
1962 ir_node *size = expression_to_firm(argument);
1963 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
1965 size = create_conv(dbgi, size, mode);
1967 ir_node *store = get_store();
1968 ir_node *alloca = new_d_Alloc(dbgi, store, size,
1969 firm_unknown_type, stack_alloc);
1970 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1972 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1979 ir_node *callee = expression_to_firm(function);
1981 type_t *type = skip_typeref(function->base.type);
1982 assert(is_type_pointer(type));
1983 pointer_type_t *pointer_type = &type->pointer;
1984 type_t *points_to = skip_typeref(pointer_type->points_to);
1985 assert(is_type_function(points_to));
1986 function_type_t *function_type = &points_to->function;
1988 int n_parameters = 0;
1989 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1990 ir_type *new_method_type = NULL;
1991 if (function_type->variadic || function_type->unspecified_parameters) {
1992 const call_argument_t *argument = call->arguments;
1993 for ( ; argument != NULL; argument = argument->next) {
1997 /* we need to construct a new method type matching the call
1999 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
2000 int n_res = get_method_n_ress(ir_method_type);
2001 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
2002 set_method_calling_convention(new_method_type,
2003 get_method_calling_convention(ir_method_type));
2004 set_method_additional_properties(new_method_type,
2005 get_method_additional_properties(ir_method_type));
2006 set_method_variadicity(new_method_type,
2007 get_method_variadicity(ir_method_type));
2009 for (int i = 0; i < n_res; ++i) {
2010 set_method_res_type(new_method_type, i,
2011 get_method_res_type(ir_method_type, i));
2013 argument = call->arguments;
2014 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
2015 expression_t *expression = argument->expression;
2016 ir_type *irtype = get_ir_type(expression->base.type);
2017 set_method_param_type(new_method_type, i, irtype);
2019 ir_method_type = new_method_type;
2021 n_parameters = get_method_n_params(ir_method_type);
2024 ir_node *in[n_parameters];
2026 const call_argument_t *argument = call->arguments;
2027 for (int n = 0; n < n_parameters; ++n) {
2028 expression_t *expression = argument->expression;
2029 ir_node *arg_node = expression_to_firm(expression);
2031 type_t *arg_type = skip_typeref(expression->base.type);
2032 if (!is_type_compound(arg_type)) {
2033 ir_mode *mode = get_ir_mode_storage(expression->base.type);
2034 arg_node = create_conv(dbgi, arg_node, mode);
2035 arg_node = do_strict_conv(dbgi, arg_node);
2040 argument = argument->next;
2043 ir_node *store = get_store();
2044 ir_node *node = new_d_Call(dbgi, store, callee, n_parameters, in,
2046 ir_node *mem = new_d_Proj(dbgi, node, mode_M, pn_Call_M);
2049 type_t *return_type = skip_typeref(function_type->return_type);
2050 ir_node *result = NULL;
2052 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
2053 ir_node *resproj = new_d_Proj(dbgi, node, mode_T, pn_Call_T_result);
2055 if (is_type_scalar(return_type)) {
2056 ir_mode *mode = get_ir_mode_storage(return_type);
2057 result = new_d_Proj(dbgi, resproj, mode, 0);
2058 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
2059 result = create_conv(NULL, result, mode_arith);
2061 ir_mode *mode = mode_P_data;
2062 result = new_d_Proj(dbgi, resproj, mode, 0);
2066 if (function->kind == EXPR_REFERENCE &&
2067 function->reference.entity->declaration.modifiers & DM_NORETURN) {
2068 /* A dead end: Keep the Call and the Block. Also place all further
2069 * nodes into a new and unreachable block. */
2071 keep_alive(get_cur_block());
2072 ir_node *block = new_Block(0, NULL);
2073 set_cur_block(block);
2079 static void statement_to_firm(statement_t *statement);
2080 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
2082 static ir_node *expression_to_addr(const expression_t *expression);
2083 static ir_node *create_condition_evaluation(const expression_t *expression,
2084 ir_node *true_block,
2085 ir_node *false_block);
2087 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
2090 if (!is_type_compound(type)) {
2091 ir_mode *mode = get_ir_mode_storage(type);
2092 value = create_conv(dbgi, value, mode);
2093 value = do_strict_conv(dbgi, value);
2096 ir_node *memory = get_store();
2098 if (is_type_scalar(type)) {
2099 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
2100 ? cons_volatile : cons_none;
2101 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
2102 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2103 set_store(store_mem);
2105 ir_type *irtype = get_ir_type(type);
2106 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
2107 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
2108 set_store(copyb_mem);
2112 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
2114 ir_tarval *all_one = get_mode_all_one(mode);
2115 int mode_size = get_mode_size_bits(mode);
2117 assert(offset >= 0);
2119 assert(offset + size <= mode_size);
2120 if (size == mode_size) {
2124 long shiftr = get_mode_size_bits(mode) - size;
2125 long shiftl = offset;
2126 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
2127 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
2128 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
2129 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
2134 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
2135 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile)
2137 ir_type *entity_type = get_entity_type(entity);
2138 ir_type *base_type = get_primitive_base_type(entity_type);
2139 assert(base_type != NULL);
2140 ir_mode *mode = get_type_mode(base_type);
2142 value = create_conv(dbgi, value, mode);
2144 /* kill upper bits of value and shift to right position */
2145 int bitoffset = get_entity_offset_bits_remainder(entity);
2146 int bitsize = get_mode_size_bits(get_type_mode(entity_type));
2147 ir_tarval *mask = create_bitfield_mask(mode, 0, bitsize);
2148 ir_node *mask_node = new_d_Const(dbgi, mask);
2149 ir_node *value_masked = new_d_And(dbgi, value, mask_node, mode);
2150 ir_tarval *shiftl = new_tarval_from_long(bitoffset, mode_uint);
2151 ir_node *shiftcount = new_d_Const(dbgi, shiftl);
2152 ir_node *value_maskshift = new_d_Shl(dbgi, value_masked, shiftcount, mode);
2154 /* load current value */
2155 ir_node *mem = get_store();
2156 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2157 set_volatile ? cons_volatile : cons_none);
2158 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2159 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2160 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2161 ir_tarval *inv_mask = tarval_not(shift_mask);
2162 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2163 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2165 /* construct new value and store */
2166 ir_node *new_val = new_d_Or(dbgi, load_res_masked, value_maskshift, mode);
2167 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2168 set_volatile ? cons_volatile : cons_none);
2169 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2170 set_store(store_mem);
2172 return value_masked;
2175 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2178 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2179 entity_t *entity = expression->compound_entry;
2180 type_t *base_type = entity->declaration.type;
2181 ir_mode *mode = get_ir_mode_storage(base_type);
2182 ir_node *mem = get_store();
2183 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2184 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2185 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2187 ir_mode *amode = mode;
2188 /* optimisation, since shifting in modes < machine_size is usually
2190 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2193 unsigned amode_size = get_mode_size_bits(amode);
2194 load_res = create_conv(dbgi, load_res, amode);
2196 set_store(load_mem);
2198 /* kill upper bits */
2199 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2200 int bitoffset = entity->compound_member.bit_offset;
2201 int bitsize = entity->compound_member.bit_size;
2202 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2203 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2204 ir_node *countl = new_d_Const(dbgi, tvl);
2205 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2207 unsigned shift_bitsr = bitoffset + shift_bitsl;
2208 assert(shift_bitsr <= amode_size);
2209 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2210 ir_node *countr = new_d_Const(dbgi, tvr);
2212 if (mode_is_signed(mode)) {
2213 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2215 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2218 type_t *type = expression->base.type;
2219 ir_mode *resmode = get_ir_mode_arithmetic(type);
2220 return create_conv(dbgi, shiftr, resmode);
2223 /* make sure the selected compound type is constructed */
2224 static void construct_select_compound(const select_expression_t *expression)
2226 type_t *type = skip_typeref(expression->compound->base.type);
2227 if (is_type_pointer(type)) {
2228 type = type->pointer.points_to;
2230 (void) get_ir_type(type);
2233 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2234 ir_node *value, ir_node *addr)
2236 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2237 type_t *type = skip_typeref(expression->base.type);
2239 if (!is_type_compound(type)) {
2240 ir_mode *mode = get_ir_mode_storage(type);
2241 value = create_conv(dbgi, value, mode);
2242 value = do_strict_conv(dbgi, value);
2245 if (expression->kind == EXPR_REFERENCE) {
2246 const reference_expression_t *ref = &expression->reference;
2248 entity_t *entity = ref->entity;
2249 assert(is_declaration(entity));
2250 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2251 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2252 set_value(entity->variable.v.value_number, value);
2254 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2255 set_value(entity->parameter.v.value_number, value);
2261 addr = expression_to_addr(expression);
2262 assert(addr != NULL);
2264 if (expression->kind == EXPR_SELECT) {
2265 const select_expression_t *select = &expression->select;
2267 construct_select_compound(select);
2269 entity_t *entity = select->compound_entry;
2270 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2271 if (entity->compound_member.bitfield) {
2272 ir_entity *irentity = entity->compound_member.entity;
2274 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2275 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2281 assign_value(dbgi, addr, type, value);
2285 static void set_value_for_expression(const expression_t *expression,
2288 set_value_for_expression_addr(expression, value, NULL);
2291 static ir_node *get_value_from_lvalue(const expression_t *expression,
2294 if (expression->kind == EXPR_REFERENCE) {
2295 const reference_expression_t *ref = &expression->reference;
2297 entity_t *entity = ref->entity;
2298 assert(entity->kind == ENTITY_VARIABLE
2299 || entity->kind == ENTITY_PARAMETER);
2300 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2302 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2303 value_number = entity->variable.v.value_number;
2304 assert(addr == NULL);
2305 type_t *type = skip_typeref(expression->base.type);
2306 ir_mode *mode = get_ir_mode_storage(type);
2307 ir_node *res = get_value(value_number, mode);
2308 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2309 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2310 value_number = entity->parameter.v.value_number;
2311 assert(addr == NULL);
2312 type_t *type = skip_typeref(expression->base.type);
2313 ir_mode *mode = get_ir_mode_storage(type);
2314 ir_node *res = get_value(value_number, mode);
2315 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2319 assert(addr != NULL);
2320 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2323 if (expression->kind == EXPR_SELECT &&
2324 expression->select.compound_entry->compound_member.bitfield) {
2325 construct_select_compound(&expression->select);
2326 value = bitfield_extract_to_firm(&expression->select, addr);
2328 value = deref_address(dbgi, expression->base.type, addr);
2335 static ir_node *create_incdec(const unary_expression_t *expression)
2337 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2338 const expression_t *value_expr = expression->value;
2339 ir_node *addr = expression_to_addr(value_expr);
2340 ir_node *value = get_value_from_lvalue(value_expr, addr);
2342 type_t *type = skip_typeref(expression->base.type);
2343 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2346 if (is_type_pointer(type)) {
2347 pointer_type_t *pointer_type = &type->pointer;
2348 offset = get_type_size_node(pointer_type->points_to);
2350 assert(is_type_arithmetic(type));
2351 offset = new_Const(get_mode_one(mode));
2355 ir_node *store_value;
2356 switch(expression->base.kind) {
2357 case EXPR_UNARY_POSTFIX_INCREMENT:
2359 store_value = new_d_Add(dbgi, value, offset, mode);
2361 case EXPR_UNARY_POSTFIX_DECREMENT:
2363 store_value = new_d_Sub(dbgi, value, offset, mode);
2365 case EXPR_UNARY_PREFIX_INCREMENT:
2366 result = new_d_Add(dbgi, value, offset, mode);
2367 store_value = result;
2369 case EXPR_UNARY_PREFIX_DECREMENT:
2370 result = new_d_Sub(dbgi, value, offset, mode);
2371 store_value = result;
2374 panic("no incdec expr in create_incdec");
2377 set_value_for_expression_addr(value_expr, store_value, addr);
2382 static bool is_local_variable(expression_t *expression)
2384 if (expression->kind != EXPR_REFERENCE)
2386 reference_expression_t *ref_expr = &expression->reference;
2387 entity_t *entity = ref_expr->entity;
2388 if (entity->kind != ENTITY_VARIABLE)
2390 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2391 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2394 static ir_relation get_relation(const expression_kind_t kind)
2397 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2398 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2399 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2400 case EXPR_BINARY_ISLESS:
2401 case EXPR_BINARY_LESS: return ir_relation_less;
2402 case EXPR_BINARY_ISLESSEQUAL:
2403 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2404 case EXPR_BINARY_ISGREATER:
2405 case EXPR_BINARY_GREATER: return ir_relation_greater;
2406 case EXPR_BINARY_ISGREATEREQUAL:
2407 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2408 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2413 panic("trying to get pn_Cmp from non-comparison binexpr type");
2417 * Handle the assume optimizer hint: check if a Confirm
2418 * node can be created.
2420 * @param dbi debug info
2421 * @param expr the IL assume expression
2423 * we support here only some simple cases:
2428 static ir_node *handle_assume_compare(dbg_info *dbi,
2429 const binary_expression_t *expression)
2431 expression_t *op1 = expression->left;
2432 expression_t *op2 = expression->right;
2433 entity_t *var2, *var = NULL;
2434 ir_node *res = NULL;
2435 ir_relation relation = get_relation(expression->base.kind);
2437 if (is_local_variable(op1) && is_local_variable(op2)) {
2438 var = op1->reference.entity;
2439 var2 = op2->reference.entity;
2441 type_t *const type = skip_typeref(var->declaration.type);
2442 ir_mode *const mode = get_ir_mode_storage(type);
2444 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2445 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2447 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2448 set_value(var2->variable.v.value_number, res);
2450 res = new_d_Confirm(dbi, irn1, irn2, relation);
2451 set_value(var->variable.v.value_number, res);
2456 expression_t *con = NULL;
2457 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2458 var = op1->reference.entity;
2460 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2461 relation = get_inversed_relation(relation);
2462 var = op2->reference.entity;
2467 type_t *const type = skip_typeref(var->declaration.type);
2468 ir_mode *const mode = get_ir_mode_storage(type);
2470 res = get_value(var->variable.v.value_number, mode);
2471 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2472 set_value(var->variable.v.value_number, res);
2478 * Handle the assume optimizer hint.
2480 * @param dbi debug info
2481 * @param expr the IL assume expression
2483 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2485 switch(expression->kind) {
2486 case EXPR_BINARY_EQUAL:
2487 case EXPR_BINARY_NOTEQUAL:
2488 case EXPR_BINARY_LESS:
2489 case EXPR_BINARY_LESSEQUAL:
2490 case EXPR_BINARY_GREATER:
2491 case EXPR_BINARY_GREATEREQUAL:
2492 return handle_assume_compare(dbi, &expression->binary);
2498 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2499 type_t *from_type, type_t *type)
2501 type = skip_typeref(type);
2502 if (type == type_void) {
2503 /* make sure firm type is constructed */
2504 (void) get_ir_type(type);
2507 if (!is_type_scalar(type)) {
2508 /* make sure firm type is constructed */
2509 (void) get_ir_type(type);
2513 from_type = skip_typeref(from_type);
2514 ir_mode *mode = get_ir_mode_storage(type);
2515 /* check for conversion from / to __based types */
2516 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2517 const variable_t *from_var = from_type->pointer.base_variable;
2518 const variable_t *to_var = type->pointer.base_variable;
2519 if (from_var != to_var) {
2520 if (from_var != NULL) {
2521 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2522 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2523 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2525 if (to_var != NULL) {
2526 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2527 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2528 value_node = new_d_Sub(dbgi, value_node, base, mode);
2533 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2534 /* bool adjustments (we save a mode_Bu, but have to temporarily
2535 * convert to mode_b so we only get a 0/1 value */
2536 value_node = create_conv(dbgi, value_node, mode_b);
2539 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2540 ir_node *node = create_conv(dbgi, value_node, mode);
2541 node = do_strict_conv(dbgi, node);
2542 node = create_conv(dbgi, node, mode_arith);
2547 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2549 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2550 type_t *type = skip_typeref(expression->base.type);
2552 if (expression->base.kind == EXPR_UNARY_TAKE_ADDRESS)
2553 return expression_to_addr(expression->value);
2555 const expression_t *value = expression->value;
2557 switch(expression->base.kind) {
2558 case EXPR_UNARY_NEGATE: {
2559 ir_node *value_node = expression_to_firm(value);
2560 ir_mode *mode = get_ir_mode_arithmetic(type);
2561 return new_d_Minus(dbgi, value_node, mode);
2563 case EXPR_UNARY_PLUS:
2564 return expression_to_firm(value);
2565 case EXPR_UNARY_BITWISE_NEGATE: {
2566 ir_node *value_node = expression_to_firm(value);
2567 ir_mode *mode = get_ir_mode_arithmetic(type);
2568 return new_d_Not(dbgi, value_node, mode);
2570 case EXPR_UNARY_NOT: {
2571 ir_node *value_node = _expression_to_firm(value);
2572 value_node = create_conv(dbgi, value_node, mode_b);
2573 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2576 case EXPR_UNARY_DEREFERENCE: {
2577 ir_node *value_node = expression_to_firm(value);
2578 type_t *value_type = skip_typeref(value->base.type);
2579 assert(is_type_pointer(value_type));
2581 /* check for __based */
2582 const variable_t *const base_var = value_type->pointer.base_variable;
2583 if (base_var != NULL) {
2584 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2585 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2586 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2588 type_t *points_to = value_type->pointer.points_to;
2589 return deref_address(dbgi, points_to, value_node);
2591 case EXPR_UNARY_POSTFIX_INCREMENT:
2592 case EXPR_UNARY_POSTFIX_DECREMENT:
2593 case EXPR_UNARY_PREFIX_INCREMENT:
2594 case EXPR_UNARY_PREFIX_DECREMENT:
2595 return create_incdec(expression);
2596 case EXPR_UNARY_CAST: {
2597 ir_node *value_node = expression_to_firm(value);
2598 type_t *from_type = value->base.type;
2599 return create_cast(dbgi, value_node, from_type, type);
2601 case EXPR_UNARY_ASSUME:
2602 return handle_assume(dbgi, value);
2607 panic("invalid UNEXPR type found");
2611 * produces a 0/1 depending of the value of a mode_b node
2613 static ir_node *produce_condition_result(const expression_t *expression,
2614 ir_mode *mode, dbg_info *dbgi)
2616 ir_node *const one_block = new_immBlock();
2617 ir_node *const zero_block = new_immBlock();
2618 create_condition_evaluation(expression, one_block, zero_block);
2619 mature_immBlock(one_block);
2620 mature_immBlock(zero_block);
2622 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2623 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2624 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2625 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2626 set_cur_block(block);
2628 ir_node *const one = new_Const(get_mode_one(mode));
2629 ir_node *const zero = new_Const(get_mode_null(mode));
2630 ir_node *const in[2] = { one, zero };
2631 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2636 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2637 ir_node *value, type_t *type)
2639 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2640 assert(is_type_pointer(type));
2641 pointer_type_t *const pointer_type = &type->pointer;
2642 type_t *const points_to = skip_typeref(pointer_type->points_to);
2643 ir_node * elem_size = get_type_size_node(points_to);
2644 elem_size = create_conv(dbgi, elem_size, mode);
2645 value = create_conv(dbgi, value, mode);
2646 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2650 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2651 ir_node *left, ir_node *right)
2654 type_t *type_left = skip_typeref(expression->left->base.type);
2655 type_t *type_right = skip_typeref(expression->right->base.type);
2657 expression_kind_t kind = expression->base.kind;
2660 case EXPR_BINARY_SHIFTLEFT:
2661 case EXPR_BINARY_SHIFTRIGHT:
2662 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2663 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2664 mode = get_ir_mode_arithmetic(expression->base.type);
2665 right = create_conv(dbgi, right, mode_uint);
2668 case EXPR_BINARY_SUB:
2669 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2670 const pointer_type_t *const ptr_type = &type_left->pointer;
2672 mode = get_ir_mode_arithmetic(expression->base.type);
2673 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2674 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2675 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2676 ir_node *const no_mem = new_NoMem();
2677 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2678 mode, op_pin_state_floats);
2679 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2682 case EXPR_BINARY_SUB_ASSIGN:
2683 if (is_type_pointer(type_left)) {
2684 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2685 mode = get_ir_mode_arithmetic(type_left);
2690 case EXPR_BINARY_ADD:
2691 case EXPR_BINARY_ADD_ASSIGN:
2692 if (is_type_pointer(type_left)) {
2693 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2694 mode = get_ir_mode_arithmetic(type_left);
2696 } else if (is_type_pointer(type_right)) {
2697 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2698 mode = get_ir_mode_arithmetic(type_right);
2705 mode = get_ir_mode_arithmetic(type_right);
2706 left = create_conv(dbgi, left, mode);
2711 case EXPR_BINARY_ADD_ASSIGN:
2712 case EXPR_BINARY_ADD:
2713 return new_d_Add(dbgi, left, right, mode);
2714 case EXPR_BINARY_SUB_ASSIGN:
2715 case EXPR_BINARY_SUB:
2716 return new_d_Sub(dbgi, left, right, mode);
2717 case EXPR_BINARY_MUL_ASSIGN:
2718 case EXPR_BINARY_MUL:
2719 return new_d_Mul(dbgi, left, right, mode);
2720 case EXPR_BINARY_BITWISE_AND:
2721 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2722 return new_d_And(dbgi, left, right, mode);
2723 case EXPR_BINARY_BITWISE_OR:
2724 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2725 return new_d_Or(dbgi, left, right, mode);
2726 case EXPR_BINARY_BITWISE_XOR:
2727 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2728 return new_d_Eor(dbgi, left, right, mode);
2729 case EXPR_BINARY_SHIFTLEFT:
2730 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2731 return new_d_Shl(dbgi, left, right, mode);
2732 case EXPR_BINARY_SHIFTRIGHT:
2733 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2734 if (mode_is_signed(mode)) {
2735 return new_d_Shrs(dbgi, left, right, mode);
2737 return new_d_Shr(dbgi, left, right, mode);
2739 case EXPR_BINARY_DIV:
2740 case EXPR_BINARY_DIV_ASSIGN: {
2741 ir_node *pin = new_Pin(new_NoMem());
2742 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2743 op_pin_state_floats);
2744 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2747 case EXPR_BINARY_MOD:
2748 case EXPR_BINARY_MOD_ASSIGN: {
2749 ir_node *pin = new_Pin(new_NoMem());
2750 assert(!mode_is_float(mode));
2751 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2752 op_pin_state_floats);
2753 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2757 panic("unexpected expression kind");
2761 static ir_node *create_lazy_op(const binary_expression_t *expression)
2763 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2764 type_t *type = skip_typeref(expression->base.type);
2765 ir_mode *mode = get_ir_mode_arithmetic(type);
2767 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2768 bool val = fold_constant_to_bool(expression->left);
2769 expression_kind_t ekind = expression->base.kind;
2770 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2771 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2773 return new_Const(get_mode_null(mode));
2777 return new_Const(get_mode_one(mode));
2781 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2782 bool valr = fold_constant_to_bool(expression->right);
2783 return create_Const_from_bool(mode, valr);
2786 return produce_condition_result(expression->right, mode, dbgi);
2789 return produce_condition_result((const expression_t*) expression, mode,
2793 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2794 ir_node *right, ir_mode *mode);
2796 static ir_node *create_assign_binop(const binary_expression_t *expression)
2798 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2799 const expression_t *left_expr = expression->left;
2800 type_t *type = skip_typeref(left_expr->base.type);
2801 ir_node *right = expression_to_firm(expression->right);
2802 ir_node *left_addr = expression_to_addr(left_expr);
2803 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2804 ir_node *result = create_op(dbgi, expression, left, right);
2806 result = create_cast(dbgi, result, expression->right->base.type, type);
2807 result = do_strict_conv(dbgi, result);
2809 result = set_value_for_expression_addr(left_expr, result, left_addr);
2811 if (!is_type_compound(type)) {
2812 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2813 result = create_conv(dbgi, result, mode_arithmetic);
2818 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2820 expression_kind_t kind = expression->base.kind;
2823 case EXPR_BINARY_EQUAL:
2824 case EXPR_BINARY_NOTEQUAL:
2825 case EXPR_BINARY_LESS:
2826 case EXPR_BINARY_LESSEQUAL:
2827 case EXPR_BINARY_GREATER:
2828 case EXPR_BINARY_GREATEREQUAL:
2829 case EXPR_BINARY_ISGREATER:
2830 case EXPR_BINARY_ISGREATEREQUAL:
2831 case EXPR_BINARY_ISLESS:
2832 case EXPR_BINARY_ISLESSEQUAL:
2833 case EXPR_BINARY_ISLESSGREATER:
2834 case EXPR_BINARY_ISUNORDERED: {
2835 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2836 ir_node *left = expression_to_firm(expression->left);
2837 ir_node *right = expression_to_firm(expression->right);
2838 ir_relation relation = get_relation(kind);
2839 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2842 case EXPR_BINARY_ASSIGN: {
2843 ir_node *addr = expression_to_addr(expression->left);
2844 ir_node *right = expression_to_firm(expression->right);
2846 = set_value_for_expression_addr(expression->left, right, addr);
2848 type_t *type = skip_typeref(expression->base.type);
2849 if (!is_type_compound(type)) {
2850 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2851 res = create_conv(NULL, res, mode_arithmetic);
2855 case EXPR_BINARY_ADD:
2856 case EXPR_BINARY_SUB:
2857 case EXPR_BINARY_MUL:
2858 case EXPR_BINARY_DIV:
2859 case EXPR_BINARY_MOD:
2860 case EXPR_BINARY_BITWISE_AND:
2861 case EXPR_BINARY_BITWISE_OR:
2862 case EXPR_BINARY_BITWISE_XOR:
2863 case EXPR_BINARY_SHIFTLEFT:
2864 case EXPR_BINARY_SHIFTRIGHT:
2866 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2867 ir_node *left = expression_to_firm(expression->left);
2868 ir_node *right = expression_to_firm(expression->right);
2869 return create_op(dbgi, expression, left, right);
2871 case EXPR_BINARY_LOGICAL_AND:
2872 case EXPR_BINARY_LOGICAL_OR:
2873 return create_lazy_op(expression);
2874 case EXPR_BINARY_COMMA:
2875 /* create side effects of left side */
2876 (void) expression_to_firm(expression->left);
2877 return _expression_to_firm(expression->right);
2879 case EXPR_BINARY_ADD_ASSIGN:
2880 case EXPR_BINARY_SUB_ASSIGN:
2881 case EXPR_BINARY_MUL_ASSIGN:
2882 case EXPR_BINARY_MOD_ASSIGN:
2883 case EXPR_BINARY_DIV_ASSIGN:
2884 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2885 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2886 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2887 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2888 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2889 return create_assign_binop(expression);
2891 panic("TODO binexpr type");
2895 static ir_node *array_access_addr(const array_access_expression_t *expression)
2897 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2898 ir_node *base_addr = expression_to_firm(expression->array_ref);
2899 ir_node *offset = expression_to_firm(expression->index);
2900 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2901 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2902 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2907 static ir_node *array_access_to_firm(
2908 const array_access_expression_t *expression)
2910 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2911 ir_node *addr = array_access_addr(expression);
2912 type_t *type = revert_automatic_type_conversion(
2913 (const expression_t*) expression);
2914 type = skip_typeref(type);
2916 return deref_address(dbgi, type, addr);
2919 static long get_offsetof_offset(const offsetof_expression_t *expression)
2921 type_t *orig_type = expression->type;
2924 designator_t *designator = expression->designator;
2925 for ( ; designator != NULL; designator = designator->next) {
2926 type_t *type = skip_typeref(orig_type);
2927 /* be sure the type is constructed */
2928 (void) get_ir_type(type);
2930 if (designator->symbol != NULL) {
2931 assert(is_type_compound(type));
2932 symbol_t *symbol = designator->symbol;
2934 compound_t *compound = type->compound.compound;
2935 entity_t *iter = compound->members.entities;
2936 for ( ; iter != NULL; iter = iter->base.next) {
2937 if (iter->base.symbol == symbol) {
2941 assert(iter != NULL);
2943 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2944 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2945 offset += get_entity_offset(iter->compound_member.entity);
2947 orig_type = iter->declaration.type;
2949 expression_t *array_index = designator->array_index;
2950 assert(designator->array_index != NULL);
2951 assert(is_type_array(type));
2953 long index = fold_constant_to_int(array_index);
2954 ir_type *arr_type = get_ir_type(type);
2955 ir_type *elem_type = get_array_element_type(arr_type);
2956 long elem_size = get_type_size_bytes(elem_type);
2958 offset += index * elem_size;
2960 orig_type = type->array.element_type;
2967 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2969 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2970 long offset = get_offsetof_offset(expression);
2971 ir_tarval *tv = new_tarval_from_long(offset, mode);
2972 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2974 return new_d_Const(dbgi, tv);
2977 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2978 ir_entity *entity, type_t *type);
2980 static ir_node *compound_literal_to_firm(
2981 const compound_literal_expression_t *expression)
2983 type_t *type = expression->type;
2985 /* create an entity on the stack */
2986 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2988 ident *const id = id_unique("CompLit.%u");
2989 ir_type *const irtype = get_ir_type(type);
2990 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2991 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2992 set_entity_ld_ident(entity, id);
2994 /* create initialisation code */
2995 initializer_t *initializer = expression->initializer;
2996 create_local_initializer(initializer, dbgi, entity, type);
2998 /* create a sel for the compound literal address */
2999 ir_node *frame = get_irg_frame(current_ir_graph);
3000 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
3005 * Transform a sizeof expression into Firm code.
3007 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
3009 type_t *const type = skip_typeref(expression->type);
3010 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
3011 if (is_type_array(type) && type->array.is_vla
3012 && expression->tp_expression != NULL) {
3013 expression_to_firm(expression->tp_expression);
3015 /* strange gnu extensions: sizeof(function) == 1 */
3016 if (is_type_function(type)) {
3017 ir_mode *mode = get_ir_mode_storage(type_size_t);
3018 return new_Const(get_mode_one(mode));
3021 return get_type_size_node(type);
3024 static entity_t *get_expression_entity(const expression_t *expression)
3026 if (expression->kind != EXPR_REFERENCE)
3029 return expression->reference.entity;
3032 static unsigned get_cparser_entity_alignment(const entity_t *entity)
3034 switch(entity->kind) {
3035 DECLARATION_KIND_CASES
3036 return entity->declaration.alignment;
3039 return entity->compound.alignment;
3040 case ENTITY_TYPEDEF:
3041 return entity->typedefe.alignment;
3049 * Transform an alignof expression into Firm code.
3051 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
3053 unsigned alignment = 0;
3055 const expression_t *tp_expression = expression->tp_expression;
3056 if (tp_expression != NULL) {
3057 entity_t *entity = get_expression_entity(tp_expression);
3058 if (entity != NULL) {
3059 if (entity->kind == ENTITY_FUNCTION) {
3060 /* a gnu-extension */
3063 alignment = get_cparser_entity_alignment(entity);
3068 if (alignment == 0) {
3069 type_t *type = expression->type;
3070 alignment = get_type_alignment(type);
3073 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3074 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3075 ir_tarval *tv = new_tarval_from_long(alignment, mode);
3076 return new_d_Const(dbgi, tv);
3079 static void init_ir_types(void);
3081 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
3083 assert(is_type_valid(skip_typeref(expression->base.type)));
3085 bool constant_folding_old = constant_folding;
3086 constant_folding = true;
3090 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
3092 ir_graph *old_current_ir_graph = current_ir_graph;
3093 current_ir_graph = get_const_code_irg();
3095 ir_node *cnst = expression_to_firm(expression);
3096 current_ir_graph = old_current_ir_graph;
3098 if (!is_Const(cnst)) {
3099 panic("couldn't fold constant");
3102 constant_folding = constant_folding_old;
3104 return get_Const_tarval(cnst);
3107 /* this function is only used in parser.c, but it relies on libfirm functionality */
3108 bool constant_is_negative(const expression_t *expression)
3110 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
3111 ir_tarval *tv = fold_constant_to_tarval(expression);
3112 return tarval_is_negative(tv);
3115 long fold_constant_to_int(const expression_t *expression)
3117 if (expression->kind == EXPR_ERROR)
3120 ir_tarval *tv = fold_constant_to_tarval(expression);
3121 if (!tarval_is_long(tv)) {
3122 panic("result of constant folding is not integer");
3125 return get_tarval_long(tv);
3128 bool fold_constant_to_bool(const expression_t *expression)
3130 if (expression->kind == EXPR_ERROR)
3132 ir_tarval *tv = fold_constant_to_tarval(expression);
3133 return !tarval_is_null(tv);
3136 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3138 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3140 /* first try to fold a constant condition */
3141 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3142 bool val = fold_constant_to_bool(expression->condition);
3144 expression_t *true_expression = expression->true_expression;
3145 if (true_expression == NULL)
3146 true_expression = expression->condition;
3147 return expression_to_firm(true_expression);
3149 return expression_to_firm(expression->false_expression);
3153 ir_node *const true_block = new_immBlock();
3154 ir_node *const false_block = new_immBlock();
3155 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3156 mature_immBlock(true_block);
3157 mature_immBlock(false_block);
3159 set_cur_block(true_block);
3161 if (expression->true_expression != NULL) {
3162 true_val = expression_to_firm(expression->true_expression);
3163 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3164 true_val = cond_expr;
3166 /* Condition ended with a short circuit (&&, ||, !) operation or a
3167 * comparison. Generate a "1" as value for the true branch. */
3168 true_val = new_Const(get_mode_one(mode_Is));
3170 ir_node *const true_jmp = new_d_Jmp(dbgi);
3172 set_cur_block(false_block);
3173 ir_node *const false_val = expression_to_firm(expression->false_expression);
3174 ir_node *const false_jmp = new_d_Jmp(dbgi);
3176 /* create the common block */
3177 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3178 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3179 set_cur_block(block);
3181 /* TODO improve static semantics, so either both or no values are NULL */
3182 if (true_val == NULL || false_val == NULL)
3185 ir_node *const in[2] = { true_val, false_val };
3186 type_t *const type = skip_typeref(expression->base.type);
3188 if (is_type_compound(type)) {
3191 mode = get_ir_mode_arithmetic(type);
3193 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3199 * Returns an IR-node representing the address of a field.
3201 static ir_node *select_addr(const select_expression_t *expression)
3203 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3205 construct_select_compound(expression);
3207 ir_node *compound_addr = expression_to_firm(expression->compound);
3209 entity_t *entry = expression->compound_entry;
3210 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3211 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3213 if (constant_folding) {
3214 ir_mode *mode = get_irn_mode(compound_addr);
3215 /* FIXME: here, we need an integer mode with the same number of bits as mode */
3216 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3217 return new_d_Add(dbgi, compound_addr, ofs, mode);
3219 ir_entity *irentity = entry->compound_member.entity;
3220 assert(irentity != NULL);
3221 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3225 static ir_node *select_to_firm(const select_expression_t *expression)
3227 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3228 ir_node *addr = select_addr(expression);
3229 type_t *type = revert_automatic_type_conversion(
3230 (const expression_t*) expression);
3231 type = skip_typeref(type);
3233 entity_t *entry = expression->compound_entry;
3234 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3236 if (entry->compound_member.bitfield) {
3237 return bitfield_extract_to_firm(expression, addr);
3240 return deref_address(dbgi, type, addr);
3243 /* Values returned by __builtin_classify_type. */
3244 typedef enum gcc_type_class
3250 enumeral_type_class,
3253 reference_type_class,
3257 function_type_class,
3268 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3270 type_t *type = expr->type_expression->base.type;
3272 /* FIXME gcc returns different values depending on whether compiling C or C++
3273 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3276 type = skip_typeref(type);
3277 switch (type->kind) {
3279 const atomic_type_t *const atomic_type = &type->atomic;
3280 switch (atomic_type->akind) {
3281 /* should not be reached */
3282 case ATOMIC_TYPE_INVALID:
3286 /* gcc cannot do that */
3287 case ATOMIC_TYPE_VOID:
3288 tc = void_type_class;
3291 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3292 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3293 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3294 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3295 case ATOMIC_TYPE_SHORT:
3296 case ATOMIC_TYPE_USHORT:
3297 case ATOMIC_TYPE_INT:
3298 case ATOMIC_TYPE_UINT:
3299 case ATOMIC_TYPE_LONG:
3300 case ATOMIC_TYPE_ULONG:
3301 case ATOMIC_TYPE_LONGLONG:
3302 case ATOMIC_TYPE_ULONGLONG:
3303 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3304 tc = integer_type_class;
3307 case ATOMIC_TYPE_FLOAT:
3308 case ATOMIC_TYPE_DOUBLE:
3309 case ATOMIC_TYPE_LONG_DOUBLE:
3310 tc = real_type_class;
3313 panic("Unexpected atomic type in classify_type_to_firm().");
3316 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3317 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3318 case TYPE_ARRAY: /* gcc handles this as pointer */
3319 case TYPE_FUNCTION: /* gcc handles this as pointer */
3320 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3321 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3322 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3324 /* gcc handles this as integer */
3325 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3327 /* gcc classifies the referenced type */
3328 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3330 /* typedef/typeof should be skipped already */
3336 panic("unexpected TYPE classify_type_to_firm().");
3340 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3341 ir_tarval *const tv = new_tarval_from_long(tc, mode_int);
3342 return new_d_Const(dbgi, tv);
3345 static ir_node *function_name_to_firm(
3346 const funcname_expression_t *const expr)
3348 switch(expr->kind) {
3349 case FUNCNAME_FUNCTION:
3350 case FUNCNAME_PRETTY_FUNCTION:
3351 case FUNCNAME_FUNCDNAME:
3352 if (current_function_name == NULL) {
3353 const source_position_t *const src_pos = &expr->base.source_position;
3354 const char *name = current_function_entity->base.symbol->string;
3355 const string_t string = { name, strlen(name) + 1 };
3356 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3358 return current_function_name;
3359 case FUNCNAME_FUNCSIG:
3360 if (current_funcsig == NULL) {
3361 const source_position_t *const src_pos = &expr->base.source_position;
3362 ir_entity *ent = get_irg_entity(current_ir_graph);
3363 const char *const name = get_entity_ld_name(ent);
3364 const string_t string = { name, strlen(name) + 1 };
3365 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3367 return current_funcsig;
3369 panic("Unsupported function name");
3372 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3374 statement_t *statement = expr->statement;
3376 assert(statement->kind == STATEMENT_COMPOUND);
3377 return compound_statement_to_firm(&statement->compound);
3380 static ir_node *va_start_expression_to_firm(
3381 const va_start_expression_t *const expr)
3383 ir_graph *const irg = current_ir_graph;
3384 type_t *const type = current_function_entity->declaration.type;
3385 ir_type *const method_type = get_ir_type(type);
3386 size_t const n = get_method_n_params(method_type) - 1;
3387 ir_type *frame_type = get_irg_frame_type(irg);
3388 ir_type *param_irtype = get_method_param_type(method_type, n);
3389 ir_entity *const param_ent =
3390 new_parameter_entity(frame_type, n, param_irtype);
3391 ir_node *const frame = get_irg_frame(irg);
3392 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3393 ir_node *const no_mem = new_NoMem();
3394 ir_node *const arg_sel =
3395 new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3397 type_t *const param_type = expr->parameter->base.type;
3398 ir_node *const cnst = get_type_size_node(param_type);
3399 ir_mode *const mode = get_irn_mode(cnst);
3400 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3401 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3402 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3403 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3404 ir_node *const add = new_d_Add(dbgi, arg_sel, c4, mode_P_data);
3405 set_value_for_expression(expr->ap, add);
3410 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3412 type_t *const type = expr->base.type;
3413 expression_t *const ap_expr = expr->ap;
3414 ir_node *const ap_addr = expression_to_addr(ap_expr);
3415 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3416 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3417 ir_node *const res = deref_address(dbgi, type, ap);
3419 ir_node *const cnst = get_type_size_node(expr->base.type);
3420 ir_mode *const mode = get_irn_mode(cnst);
3421 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3422 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3423 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3424 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3425 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3427 set_value_for_expression_addr(ap_expr, add, ap_addr);
3433 * Generate Firm for a va_copy expression.
3435 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3437 ir_node *const src = expression_to_firm(expr->src);
3438 set_value_for_expression(expr->dst, src);
3442 static ir_node *dereference_addr(const unary_expression_t *const expression)
3444 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3445 return expression_to_firm(expression->value);
3449 * Returns a IR-node representing an lvalue of the given expression.
3451 static ir_node *expression_to_addr(const expression_t *expression)
3453 switch(expression->kind) {
3454 case EXPR_ARRAY_ACCESS:
3455 return array_access_addr(&expression->array_access);
3457 return call_expression_to_firm(&expression->call);
3458 case EXPR_COMPOUND_LITERAL:
3459 return compound_literal_to_firm(&expression->compound_literal);
3460 case EXPR_REFERENCE:
3461 return reference_addr(&expression->reference);
3463 return select_addr(&expression->select);
3464 case EXPR_UNARY_DEREFERENCE:
3465 return dereference_addr(&expression->unary);
3469 panic("trying to get address of non-lvalue");
3472 static ir_node *builtin_constant_to_firm(
3473 const builtin_constant_expression_t *expression)
3475 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3476 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3477 return create_Const_from_bool(mode, v);
3480 static ir_node *builtin_types_compatible_to_firm(
3481 const builtin_types_compatible_expression_t *expression)
3483 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3484 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3485 bool const value = types_compatible(left, right);
3486 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3487 return create_Const_from_bool(mode, value);
3490 static ir_node *get_label_block(label_t *label)
3492 if (label->block != NULL)
3493 return label->block;
3495 /* beware: might be called from create initializer with current_ir_graph
3496 * set to const_code_irg. */
3497 ir_graph *rem = current_ir_graph;
3498 current_ir_graph = current_function;
3500 ir_node *block = new_immBlock();
3502 label->block = block;
3504 ARR_APP1(label_t *, all_labels, label);
3506 current_ir_graph = rem;
3511 * Pointer to a label. This is used for the
3512 * GNU address-of-label extension.
3514 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3516 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3517 ir_node *block = get_label_block(label->label);
3518 ir_entity *entity = create_Block_entity(block);
3520 symconst_symbol value;
3521 value.entity_p = entity;
3522 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3525 static ir_node *error_to_firm(const expression_t *expression)
3527 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3528 return new_Bad(mode);
3532 * creates firm nodes for an expression. The difference between this function
3533 * and expression_to_firm is, that this version might produce mode_b nodes
3534 * instead of mode_Is.
3536 static ir_node *_expression_to_firm(const expression_t *expression)
3539 if (!constant_folding) {
3540 assert(!expression->base.transformed);
3541 ((expression_t*) expression)->base.transformed = true;
3545 switch (expression->kind) {
3547 return literal_to_firm(&expression->literal);
3548 case EXPR_STRING_LITERAL:
3549 return string_to_firm(&expression->base.source_position, "str.%u",
3550 &expression->literal.value);
3551 case EXPR_WIDE_STRING_LITERAL:
3552 return wide_string_literal_to_firm(&expression->string_literal);
3553 case EXPR_REFERENCE:
3554 return reference_expression_to_firm(&expression->reference);
3555 case EXPR_REFERENCE_ENUM_VALUE:
3556 return reference_expression_enum_value_to_firm(&expression->reference);
3558 return call_expression_to_firm(&expression->call);
3560 return unary_expression_to_firm(&expression->unary);
3562 return binary_expression_to_firm(&expression->binary);
3563 case EXPR_ARRAY_ACCESS:
3564 return array_access_to_firm(&expression->array_access);
3566 return sizeof_to_firm(&expression->typeprop);
3568 return alignof_to_firm(&expression->typeprop);
3569 case EXPR_CONDITIONAL:
3570 return conditional_to_firm(&expression->conditional);
3572 return select_to_firm(&expression->select);
3573 case EXPR_CLASSIFY_TYPE:
3574 return classify_type_to_firm(&expression->classify_type);
3576 return function_name_to_firm(&expression->funcname);
3577 case EXPR_STATEMENT:
3578 return statement_expression_to_firm(&expression->statement);
3580 return va_start_expression_to_firm(&expression->va_starte);
3582 return va_arg_expression_to_firm(&expression->va_arge);
3584 return va_copy_expression_to_firm(&expression->va_copye);
3585 case EXPR_BUILTIN_CONSTANT_P:
3586 return builtin_constant_to_firm(&expression->builtin_constant);
3587 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
3588 return builtin_types_compatible_to_firm(&expression->builtin_types_compatible);
3590 return offsetof_to_firm(&expression->offsetofe);
3591 case EXPR_COMPOUND_LITERAL:
3592 return compound_literal_to_firm(&expression->compound_literal);
3593 case EXPR_LABEL_ADDRESS:
3594 return label_address_to_firm(&expression->label_address);
3597 return error_to_firm(expression);
3599 panic("invalid expression found");
3603 * Check if a given expression is a GNU __builtin_expect() call.
3605 static bool is_builtin_expect(const expression_t *expression)
3607 if (expression->kind != EXPR_CALL)
3610 expression_t *function = expression->call.function;
3611 if (function->kind != EXPR_REFERENCE)
3613 reference_expression_t *ref = &function->reference;
3614 if (ref->entity->kind != ENTITY_FUNCTION ||
3615 ref->entity->function.btk != bk_gnu_builtin_expect)
3621 static bool produces_mode_b(const expression_t *expression)
3623 switch (expression->kind) {
3624 case EXPR_BINARY_EQUAL:
3625 case EXPR_BINARY_NOTEQUAL:
3626 case EXPR_BINARY_LESS:
3627 case EXPR_BINARY_LESSEQUAL:
3628 case EXPR_BINARY_GREATER:
3629 case EXPR_BINARY_GREATEREQUAL:
3630 case EXPR_BINARY_ISGREATER:
3631 case EXPR_BINARY_ISGREATEREQUAL:
3632 case EXPR_BINARY_ISLESS:
3633 case EXPR_BINARY_ISLESSEQUAL:
3634 case EXPR_BINARY_ISLESSGREATER:
3635 case EXPR_BINARY_ISUNORDERED:
3636 case EXPR_UNARY_NOT:
3640 if (is_builtin_expect(expression)) {
3641 expression_t *argument = expression->call.arguments->expression;
3642 return produces_mode_b(argument);
3645 case EXPR_BINARY_COMMA:
3646 return produces_mode_b(expression->binary.right);
3653 static ir_node *expression_to_firm(const expression_t *expression)
3655 if (!produces_mode_b(expression)) {
3656 ir_node *res = _expression_to_firm(expression);
3657 assert(res == NULL || get_irn_mode(res) != mode_b);
3661 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3662 bool const constant_folding_old = constant_folding;
3663 constant_folding = true;
3664 ir_node *res = _expression_to_firm(expression);
3665 constant_folding = constant_folding_old;
3666 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3667 assert(is_Const(res));
3668 return create_Const_from_bool(mode, !is_Const_null(res));
3671 /* we have to produce a 0/1 from the mode_b expression */
3672 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3673 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3674 return produce_condition_result(expression, mode, dbgi);
3678 * create a short-circuit expression evaluation that tries to construct
3679 * efficient control flow structures for &&, || and ! expressions
3681 static ir_node *create_condition_evaluation(const expression_t *expression,
3682 ir_node *true_block,
3683 ir_node *false_block)
3685 switch(expression->kind) {
3686 case EXPR_UNARY_NOT: {
3687 const unary_expression_t *unary_expression = &expression->unary;
3688 create_condition_evaluation(unary_expression->value, false_block,
3692 case EXPR_BINARY_LOGICAL_AND: {
3693 const binary_expression_t *binary_expression = &expression->binary;
3695 ir_node *extra_block = new_immBlock();
3696 create_condition_evaluation(binary_expression->left, extra_block,
3698 mature_immBlock(extra_block);
3699 set_cur_block(extra_block);
3700 create_condition_evaluation(binary_expression->right, true_block,
3704 case EXPR_BINARY_LOGICAL_OR: {
3705 const binary_expression_t *binary_expression = &expression->binary;
3707 ir_node *extra_block = new_immBlock();
3708 create_condition_evaluation(binary_expression->left, true_block,
3710 mature_immBlock(extra_block);
3711 set_cur_block(extra_block);
3712 create_condition_evaluation(binary_expression->right, true_block,
3720 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3721 ir_node *cond_expr = _expression_to_firm(expression);
3722 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3723 ir_node *cond = new_d_Cond(dbgi, condition);
3724 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3725 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3727 /* set branch prediction info based on __builtin_expect */
3728 if (is_builtin_expect(expression) && is_Cond(cond)) {
3729 call_argument_t *argument = expression->call.arguments->next;
3730 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3731 bool const cnst = fold_constant_to_bool(argument->expression);
3732 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3733 set_Cond_jmp_pred(cond, pred);
3737 add_immBlock_pred(true_block, true_proj);
3738 add_immBlock_pred(false_block, false_proj);
3740 set_unreachable_now();
3744 static void create_variable_entity(entity_t *variable,
3745 declaration_kind_t declaration_kind,
3746 ir_type *parent_type)
3748 assert(variable->kind == ENTITY_VARIABLE);
3749 type_t *type = skip_typeref(variable->declaration.type);
3751 ident *const id = new_id_from_str(variable->base.symbol->string);
3752 ir_type *const irtype = get_ir_type(type);
3753 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3754 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3755 unsigned alignment = variable->declaration.alignment;
3757 set_entity_alignment(irentity, alignment);
3759 handle_decl_modifiers(irentity, variable);
3761 variable->declaration.kind = (unsigned char) declaration_kind;
3762 variable->variable.v.entity = irentity;
3763 set_entity_ld_ident(irentity, create_ld_ident(variable));
3765 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3766 set_entity_volatility(irentity, volatility_is_volatile);
3771 typedef struct type_path_entry_t type_path_entry_t;
3772 struct type_path_entry_t {
3774 ir_initializer_t *initializer;
3776 entity_t *compound_entry;
3779 typedef struct type_path_t type_path_t;
3780 struct type_path_t {
3781 type_path_entry_t *path;
3786 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3788 size_t len = ARR_LEN(path->path);
3790 for (size_t i = 0; i < len; ++i) {
3791 const type_path_entry_t *entry = & path->path[i];
3793 type_t *type = skip_typeref(entry->type);
3794 if (is_type_compound(type)) {
3795 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3796 } else if (is_type_array(type)) {
3797 fprintf(stderr, "[%u]", (unsigned) entry->index);
3799 fprintf(stderr, "-INVALID-");
3802 fprintf(stderr, " (");
3803 print_type(path->top_type);
3804 fprintf(stderr, ")");
3807 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3809 size_t len = ARR_LEN(path->path);
3811 return & path->path[len-1];
3814 static type_path_entry_t *append_to_type_path(type_path_t *path)
3816 size_t len = ARR_LEN(path->path);
3817 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3819 type_path_entry_t *result = & path->path[len];
3820 memset(result, 0, sizeof(result[0]));
3824 static size_t get_compound_member_count(const compound_type_t *type)
3826 compound_t *compound = type->compound;
3827 size_t n_members = 0;
3828 entity_t *member = compound->members.entities;
3829 for ( ; member != NULL; member = member->base.next) {
3836 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3838 type_t *orig_top_type = path->top_type;
3839 type_t *top_type = skip_typeref(orig_top_type);
3841 assert(is_type_compound(top_type) || is_type_array(top_type));
3843 if (ARR_LEN(path->path) == 0) {
3846 type_path_entry_t *top = get_type_path_top(path);
3847 ir_initializer_t *initializer = top->initializer;
3848 return get_initializer_compound_value(initializer, top->index);
3852 static void descend_into_subtype(type_path_t *path)
3854 type_t *orig_top_type = path->top_type;
3855 type_t *top_type = skip_typeref(orig_top_type);
3857 assert(is_type_compound(top_type) || is_type_array(top_type));
3859 ir_initializer_t *initializer = get_initializer_entry(path);
3861 type_path_entry_t *top = append_to_type_path(path);
3862 top->type = top_type;
3866 if (is_type_compound(top_type)) {
3867 compound_t *compound = top_type->compound.compound;
3868 entity_t *entry = compound->members.entities;
3870 top->compound_entry = entry;
3872 len = get_compound_member_count(&top_type->compound);
3873 if (entry != NULL) {
3874 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3875 path->top_type = entry->declaration.type;
3878 assert(is_type_array(top_type));
3879 assert(top_type->array.size > 0);
3882 path->top_type = top_type->array.element_type;
3883 len = top_type->array.size;
3885 if (initializer == NULL
3886 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3887 initializer = create_initializer_compound(len);
3888 /* we have to set the entry at the 2nd latest path entry... */
3889 size_t path_len = ARR_LEN(path->path);
3890 assert(path_len >= 1);
3892 type_path_entry_t *entry = & path->path[path_len-2];
3893 ir_initializer_t *tinitializer = entry->initializer;
3894 set_initializer_compound_value(tinitializer, entry->index,
3898 top->initializer = initializer;
3901 static void ascend_from_subtype(type_path_t *path)
3903 type_path_entry_t *top = get_type_path_top(path);
3905 path->top_type = top->type;
3907 size_t len = ARR_LEN(path->path);
3908 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3911 static void walk_designator(type_path_t *path, const designator_t *designator)
3913 /* designators start at current object type */
3914 ARR_RESIZE(type_path_entry_t, path->path, 1);
3916 for ( ; designator != NULL; designator = designator->next) {
3917 type_path_entry_t *top = get_type_path_top(path);
3918 type_t *orig_type = top->type;
3919 type_t *type = skip_typeref(orig_type);
3921 if (designator->symbol != NULL) {
3922 assert(is_type_compound(type));
3924 symbol_t *symbol = designator->symbol;
3926 compound_t *compound = type->compound.compound;
3927 entity_t *iter = compound->members.entities;
3928 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3929 if (iter->base.symbol == symbol) {
3930 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3934 assert(iter != NULL);
3936 /* revert previous initialisations of other union elements */
3937 if (type->kind == TYPE_COMPOUND_UNION) {
3938 ir_initializer_t *initializer = top->initializer;
3939 if (initializer != NULL
3940 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3941 /* are we writing to a new element? */
3942 ir_initializer_t *oldi
3943 = get_initializer_compound_value(initializer, index);
3944 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3945 /* clear initializer */
3947 = get_initializer_compound_n_entries(initializer);
3948 ir_initializer_t *nulli = get_initializer_null();
3949 for (size_t i = 0; i < len; ++i) {
3950 set_initializer_compound_value(initializer, i,
3957 top->type = orig_type;
3958 top->compound_entry = iter;
3960 orig_type = iter->declaration.type;
3962 expression_t *array_index = designator->array_index;
3963 assert(designator->array_index != NULL);
3964 assert(is_type_array(type));
3966 long index = fold_constant_to_int(array_index);
3969 if (type->array.size_constant) {
3970 long array_size = type->array.size;
3971 assert(index < array_size);
3975 top->type = orig_type;
3976 top->index = (size_t) index;
3977 orig_type = type->array.element_type;
3979 path->top_type = orig_type;
3981 if (designator->next != NULL) {
3982 descend_into_subtype(path);
3986 path->invalid = false;
3989 static void advance_current_object(type_path_t *path)
3991 if (path->invalid) {
3992 /* TODO: handle this... */
3993 panic("invalid initializer in ast2firm (excessive elements)");
3996 type_path_entry_t *top = get_type_path_top(path);
3998 type_t *type = skip_typeref(top->type);
3999 if (is_type_union(type)) {
4000 /* only the first element is initialized in unions */
4001 top->compound_entry = NULL;
4002 } else if (is_type_struct(type)) {
4003 entity_t *entry = top->compound_entry;
4006 entry = entry->base.next;
4007 top->compound_entry = entry;
4008 if (entry != NULL) {
4009 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
4010 path->top_type = entry->declaration.type;
4014 assert(is_type_array(type));
4017 if (!type->array.size_constant || top->index < type->array.size) {
4022 /* we're past the last member of the current sub-aggregate, try if we
4023 * can ascend in the type hierarchy and continue with another subobject */
4024 size_t len = ARR_LEN(path->path);
4027 ascend_from_subtype(path);
4028 advance_current_object(path);
4030 path->invalid = true;
4035 static ir_initializer_t *create_ir_initializer(
4036 const initializer_t *initializer, type_t *type);
4038 static ir_initializer_t *create_ir_initializer_value(
4039 const initializer_value_t *initializer)
4041 if (is_type_compound(initializer->value->base.type)) {
4042 panic("initializer creation for compounds not implemented yet");
4044 type_t *type = initializer->value->base.type;
4045 expression_t *expr = initializer->value;
4046 ir_node *value = expression_to_firm(expr);
4047 ir_mode *mode = get_ir_mode_storage(type);
4048 value = create_conv(NULL, value, mode);
4049 return create_initializer_const(value);
4052 /** test wether type can be initialized by a string constant */
4053 static bool is_string_type(type_t *type)
4056 if (is_type_pointer(type)) {
4057 inner = skip_typeref(type->pointer.points_to);
4058 } else if(is_type_array(type)) {
4059 inner = skip_typeref(type->array.element_type);
4064 return is_type_integer(inner);
4067 static ir_initializer_t *create_ir_initializer_list(
4068 const initializer_list_t *initializer, type_t *type)
4071 memset(&path, 0, sizeof(path));
4072 path.top_type = type;
4073 path.path = NEW_ARR_F(type_path_entry_t, 0);
4075 descend_into_subtype(&path);
4077 for (size_t i = 0; i < initializer->len; ++i) {
4078 const initializer_t *sub_initializer = initializer->initializers[i];
4080 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
4081 walk_designator(&path, sub_initializer->designator.designator);
4085 if (sub_initializer->kind == INITIALIZER_VALUE) {
4086 /* we might have to descend into types until we're at a scalar
4089 type_t *orig_top_type = path.top_type;
4090 type_t *top_type = skip_typeref(orig_top_type);
4092 if (is_type_scalar(top_type))
4094 descend_into_subtype(&path);
4096 } else if (sub_initializer->kind == INITIALIZER_STRING
4097 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
4098 /* we might have to descend into types until we're at a scalar
4101 type_t *orig_top_type = path.top_type;
4102 type_t *top_type = skip_typeref(orig_top_type);
4104 if (is_string_type(top_type))
4106 descend_into_subtype(&path);
4110 ir_initializer_t *sub_irinitializer
4111 = create_ir_initializer(sub_initializer, path.top_type);
4113 size_t path_len = ARR_LEN(path.path);
4114 assert(path_len >= 1);
4115 type_path_entry_t *entry = & path.path[path_len-1];
4116 ir_initializer_t *tinitializer = entry->initializer;
4117 set_initializer_compound_value(tinitializer, entry->index,
4120 advance_current_object(&path);
4123 assert(ARR_LEN(path.path) >= 1);
4124 ir_initializer_t *result = path.path[0].initializer;
4125 DEL_ARR_F(path.path);
4130 static ir_initializer_t *create_ir_initializer_string(
4131 const initializer_string_t *initializer, type_t *type)
4133 type = skip_typeref(type);
4135 size_t string_len = initializer->string.size;
4136 assert(type->kind == TYPE_ARRAY);
4137 assert(type->array.size_constant);
4138 size_t len = type->array.size;
4139 ir_initializer_t *irinitializer = create_initializer_compound(len);
4141 const char *string = initializer->string.begin;
4142 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
4144 for (size_t i = 0; i < len; ++i) {
4149 ir_tarval *tv = new_tarval_from_long(c, mode);
4150 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4152 set_initializer_compound_value(irinitializer, i, char_initializer);
4155 return irinitializer;
4158 static ir_initializer_t *create_ir_initializer_wide_string(
4159 const initializer_wide_string_t *initializer, type_t *type)
4161 assert(type->kind == TYPE_ARRAY);
4162 assert(type->array.size_constant);
4163 size_t len = type->array.size;
4164 size_t string_len = wstrlen(&initializer->string);
4165 ir_initializer_t *irinitializer = create_initializer_compound(len);
4167 const char *p = initializer->string.begin;
4168 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4170 for (size_t i = 0; i < len; ++i) {
4172 if (i < string_len) {
4173 c = read_utf8_char(&p);
4175 ir_tarval *tv = new_tarval_from_long(c, mode);
4176 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4178 set_initializer_compound_value(irinitializer, i, char_initializer);
4181 return irinitializer;
4184 static ir_initializer_t *create_ir_initializer(
4185 const initializer_t *initializer, type_t *type)
4187 switch(initializer->kind) {
4188 case INITIALIZER_STRING:
4189 return create_ir_initializer_string(&initializer->string, type);
4191 case INITIALIZER_WIDE_STRING:
4192 return create_ir_initializer_wide_string(&initializer->wide_string,
4195 case INITIALIZER_LIST:
4196 return create_ir_initializer_list(&initializer->list, type);
4198 case INITIALIZER_VALUE:
4199 return create_ir_initializer_value(&initializer->value);
4201 case INITIALIZER_DESIGNATOR:
4202 panic("unexpected designator initializer found");
4204 panic("unknown initializer");
4207 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4208 * are elements [...] the remainder of the aggregate shall be initialized
4209 * implicitly the same as objects that have static storage duration. */
4210 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4213 /* for unions we must NOT do anything for null initializers */
4214 ir_type *owner = get_entity_owner(entity);
4215 if (is_Union_type(owner)) {
4219 ir_type *ent_type = get_entity_type(entity);
4220 /* create sub-initializers for a compound type */
4221 if (is_compound_type(ent_type)) {
4222 unsigned n_members = get_compound_n_members(ent_type);
4223 for (unsigned n = 0; n < n_members; ++n) {
4224 ir_entity *member = get_compound_member(ent_type, n);
4225 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4227 create_dynamic_null_initializer(member, dbgi, addr);
4231 if (is_Array_type(ent_type)) {
4232 assert(has_array_upper_bound(ent_type, 0));
4233 long n = get_array_upper_bound_int(ent_type, 0);
4234 for (long i = 0; i < n; ++i) {
4235 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4236 ir_node *cnst = new_d_Const(dbgi, index_tv);
4237 ir_node *in[1] = { cnst };
4238 ir_entity *arrent = get_array_element_entity(ent_type);
4239 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4241 create_dynamic_null_initializer(arrent, dbgi, addr);
4246 ir_mode *value_mode = get_type_mode(ent_type);
4247 ir_node *node = new_Const(get_mode_null(value_mode));
4249 /* is it a bitfield type? */
4250 if (is_Primitive_type(ent_type) &&
4251 get_primitive_base_type(ent_type) != NULL) {
4252 bitfield_store_to_firm(dbgi, entity, base_addr, node, false);
4256 ir_node *mem = get_store();
4257 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4258 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4262 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4263 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4265 switch(get_initializer_kind(initializer)) {
4266 case IR_INITIALIZER_NULL:
4267 create_dynamic_null_initializer(entity, dbgi, base_addr);
4269 case IR_INITIALIZER_CONST: {
4270 ir_node *node = get_initializer_const_value(initializer);
4271 ir_type *ent_type = get_entity_type(entity);
4273 /* is it a bitfield type? */
4274 if (is_Primitive_type(ent_type) &&
4275 get_primitive_base_type(ent_type) != NULL) {
4276 bitfield_store_to_firm(dbgi, entity, base_addr, node, false);
4280 assert(get_type_mode(type) == get_irn_mode(node));
4281 ir_node *mem = get_store();
4282 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4283 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4287 case IR_INITIALIZER_TARVAL: {
4288 ir_tarval *tv = get_initializer_tarval_value(initializer);
4289 ir_node *cnst = new_d_Const(dbgi, tv);
4290 ir_type *ent_type = get_entity_type(entity);
4292 /* is it a bitfield type? */
4293 if (is_Primitive_type(ent_type) &&
4294 get_primitive_base_type(ent_type) != NULL) {
4295 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false);
4299 assert(get_type_mode(type) == get_tarval_mode(tv));
4300 ir_node *mem = get_store();
4301 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4302 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4306 case IR_INITIALIZER_COMPOUND: {
4307 assert(is_compound_type(type) || is_Array_type(type));
4309 if (is_Array_type(type)) {
4310 assert(has_array_upper_bound(type, 0));
4311 n_members = get_array_upper_bound_int(type, 0);
4313 n_members = get_compound_n_members(type);
4316 if (get_initializer_compound_n_entries(initializer)
4317 != (unsigned) n_members)
4318 panic("initializer doesn't match compound type");
4320 for (int i = 0; i < n_members; ++i) {
4323 ir_entity *sub_entity;
4324 if (is_Array_type(type)) {
4325 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4326 ir_node *cnst = new_d_Const(dbgi, index_tv);
4327 ir_node *in[1] = { cnst };
4328 irtype = get_array_element_type(type);
4329 sub_entity = get_array_element_entity(type);
4330 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4333 sub_entity = get_compound_member(type, i);
4334 irtype = get_entity_type(sub_entity);
4335 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4339 ir_initializer_t *sub_init
4340 = get_initializer_compound_value(initializer, i);
4342 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4349 panic("invalid IR_INITIALIZER found");
4352 static void create_dynamic_initializer(ir_initializer_t *initializer,
4353 dbg_info *dbgi, ir_entity *entity)
4355 ir_node *frame = get_irg_frame(current_ir_graph);
4356 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4357 ir_type *type = get_entity_type(entity);
4359 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4362 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4363 ir_entity *entity, type_t *type)
4365 ir_node *memory = get_store();
4366 ir_node *nomem = new_NoMem();
4367 ir_node *frame = get_irg_frame(current_ir_graph);
4368 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4370 if (initializer->kind == INITIALIZER_VALUE) {
4371 initializer_value_t *initializer_value = &initializer->value;
4373 ir_node *value = expression_to_firm(initializer_value->value);
4374 type = skip_typeref(type);
4375 assign_value(dbgi, addr, type, value);
4379 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4380 ir_initializer_t *irinitializer
4381 = create_ir_initializer(initializer, type);
4383 create_dynamic_initializer(irinitializer, dbgi, entity);
4387 /* create the ir_initializer */
4388 ir_graph *const old_current_ir_graph = current_ir_graph;
4389 current_ir_graph = get_const_code_irg();
4391 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
4393 assert(current_ir_graph == get_const_code_irg());
4394 current_ir_graph = old_current_ir_graph;
4396 /* create a "template" entity which is copied to the entity on the stack */
4397 ident *const id = id_unique("initializer.%u");
4398 ir_type *const irtype = get_ir_type(type);
4399 ir_type *const global_type = get_glob_type();
4400 ir_entity *const init_entity = new_d_entity(global_type, id, irtype, dbgi);
4401 set_entity_ld_ident(init_entity, id);
4403 set_entity_visibility(init_entity, ir_visibility_private);
4404 add_entity_linkage(init_entity, IR_LINKAGE_CONSTANT);
4406 set_entity_initializer(init_entity, irinitializer);
4408 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4409 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4411 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4412 set_store(copyb_mem);
4415 static void create_initializer_local_variable_entity(entity_t *entity)
4417 assert(entity->kind == ENTITY_VARIABLE);
4418 initializer_t *initializer = entity->variable.initializer;
4419 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4420 ir_entity *irentity = entity->variable.v.entity;
4421 type_t *type = entity->declaration.type;
4423 create_local_initializer(initializer, dbgi, irentity, type);
4426 static void create_variable_initializer(entity_t *entity)
4428 assert(entity->kind == ENTITY_VARIABLE);
4429 initializer_t *initializer = entity->variable.initializer;
4430 if (initializer == NULL)
4433 declaration_kind_t declaration_kind
4434 = (declaration_kind_t) entity->declaration.kind;
4435 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4436 create_initializer_local_variable_entity(entity);
4440 type_t *type = entity->declaration.type;
4441 type_qualifiers_t tq = get_type_qualifier(type, true);
4443 if (initializer->kind == INITIALIZER_VALUE) {
4444 initializer_value_t *initializer_value = &initializer->value;
4445 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4447 ir_node *value = expression_to_firm(initializer_value->value);
4449 type_t *init_type = initializer_value->value->base.type;
4450 ir_mode *mode = get_ir_mode_storage(init_type);
4451 value = create_conv(dbgi, value, mode);
4452 value = do_strict_conv(dbgi, value);
4454 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4455 set_value(entity->variable.v.value_number, value);
4457 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4459 ir_entity *irentity = entity->variable.v.entity;
4461 if (tq & TYPE_QUALIFIER_CONST
4462 && get_entity_owner(irentity) != get_tls_type()) {
4463 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4465 set_atomic_ent_value(irentity, value);
4468 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4469 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4471 ir_entity *irentity = entity->variable.v.entity;
4472 ir_initializer_t *irinitializer
4473 = create_ir_initializer(initializer, type);
4475 if (tq & TYPE_QUALIFIER_CONST) {
4476 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4478 set_entity_initializer(irentity, irinitializer);
4482 static void create_variable_length_array(entity_t *entity)
4484 assert(entity->kind == ENTITY_VARIABLE);
4485 assert(entity->variable.initializer == NULL);
4487 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4488 entity->variable.v.vla_base = NULL;
4490 /* TODO: record VLA somewhere so we create the free node when we leave
4494 static void allocate_variable_length_array(entity_t *entity)
4496 assert(entity->kind == ENTITY_VARIABLE);
4497 assert(entity->variable.initializer == NULL);
4498 assert(currently_reachable());
4500 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4501 type_t *type = entity->declaration.type;
4502 ir_type *el_type = get_ir_type(type->array.element_type);
4504 /* make sure size_node is calculated */
4505 get_type_size_node(type);
4506 ir_node *elems = type->array.size_node;
4507 ir_node *mem = get_store();
4508 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4510 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4511 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4514 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4515 entity->variable.v.vla_base = addr;
4519 * Creates a Firm local variable from a declaration.
4521 static void create_local_variable(entity_t *entity)
4523 assert(entity->kind == ENTITY_VARIABLE);
4524 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4526 bool needs_entity = entity->variable.address_taken;
4527 type_t *type = skip_typeref(entity->declaration.type);
4529 /* is it a variable length array? */
4530 if (is_type_array(type) && !type->array.size_constant) {
4531 create_variable_length_array(entity);
4533 } else if (is_type_array(type) || is_type_compound(type)) {
4534 needs_entity = true;
4535 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4536 needs_entity = true;
4540 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4541 create_variable_entity(entity,
4542 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4545 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4546 entity->variable.v.value_number = next_value_number_function;
4547 set_irg_loc_description(current_ir_graph, next_value_number_function,
4549 ++next_value_number_function;
4553 static void create_local_static_variable(entity_t *entity)
4555 assert(entity->kind == ENTITY_VARIABLE);
4556 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4558 type_t *type = skip_typeref(entity->declaration.type);
4559 ir_type *const var_type = entity->variable.thread_local ?
4560 get_tls_type() : get_glob_type();
4561 ir_type *const irtype = get_ir_type(type);
4562 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4564 size_t l = strlen(entity->base.symbol->string);
4565 char buf[l + sizeof(".%u")];
4566 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4567 ident *const id = id_unique(buf);
4568 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4570 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4571 set_entity_volatility(irentity, volatility_is_volatile);
4574 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4575 entity->variable.v.entity = irentity;
4577 set_entity_ld_ident(irentity, id);
4578 set_entity_visibility(irentity, ir_visibility_local);
4580 ir_graph *const old_current_ir_graph = current_ir_graph;
4581 current_ir_graph = get_const_code_irg();
4583 create_variable_initializer(entity);
4585 assert(current_ir_graph == get_const_code_irg());
4586 current_ir_graph = old_current_ir_graph;
4591 static void return_statement_to_firm(return_statement_t *statement)
4593 if (!currently_reachable())
4596 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4597 type_t *type = current_function_entity->declaration.type;
4598 ir_type *func_irtype = get_ir_type(type);
4602 if (get_method_n_ress(func_irtype) > 0) {
4603 ir_type *res_type = get_method_res_type(func_irtype, 0);
4605 if (statement->value != NULL) {
4606 ir_node *node = expression_to_firm(statement->value);
4607 if (!is_compound_type(res_type)) {
4608 type_t *ret_value_type = statement->value->base.type;
4609 ir_mode *mode = get_ir_mode_storage(ret_value_type);
4610 node = create_conv(dbgi, node, mode);
4611 node = do_strict_conv(dbgi, node);
4616 if (is_compound_type(res_type)) {
4619 mode = get_type_mode(res_type);
4621 in[0] = new_Unknown(mode);
4625 /* build return_value for its side effects */
4626 if (statement->value != NULL) {
4627 expression_to_firm(statement->value);
4632 ir_node *store = get_store();
4633 ir_node *ret = new_d_Return(dbgi, store, in_len, in);
4635 ir_node *end_block = get_irg_end_block(current_ir_graph);
4636 add_immBlock_pred(end_block, ret);
4638 set_unreachable_now();
4641 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4643 if (!currently_reachable())
4646 return expression_to_firm(statement->expression);
4649 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4651 entity_t *entity = compound->scope.entities;
4652 for ( ; entity != NULL; entity = entity->base.next) {
4653 if (!is_declaration(entity))
4656 create_local_declaration(entity);
4659 ir_node *result = NULL;
4660 statement_t *statement = compound->statements;
4661 for ( ; statement != NULL; statement = statement->base.next) {
4662 if (statement->base.next == NULL
4663 && statement->kind == STATEMENT_EXPRESSION) {
4664 result = expression_statement_to_firm(
4665 &statement->expression);
4668 statement_to_firm(statement);
4674 static void create_global_variable(entity_t *entity)
4676 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4677 ir_visibility visibility = ir_visibility_default;
4678 ir_entity *irentity;
4679 assert(entity->kind == ENTITY_VARIABLE);
4681 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4682 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4683 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4684 case STORAGE_CLASS_NONE:
4685 visibility = ir_visibility_default;
4686 /* uninitialized globals get merged in C */
4687 if (entity->variable.initializer == NULL)
4688 linkage |= IR_LINKAGE_MERGE;
4690 case STORAGE_CLASS_TYPEDEF:
4691 case STORAGE_CLASS_AUTO:
4692 case STORAGE_CLASS_REGISTER:
4693 panic("invalid storage class for global var");
4696 ir_type *var_type = get_glob_type();
4697 if (entity->variable.thread_local) {
4698 var_type = get_tls_type();
4699 /* LINKAGE_MERGE not supported by current linkers */
4700 linkage &= ~IR_LINKAGE_MERGE;
4702 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4703 irentity = entity->variable.v.entity;
4704 add_entity_linkage(irentity, linkage);
4705 set_entity_visibility(irentity, visibility);
4708 static void create_local_declaration(entity_t *entity)
4710 assert(is_declaration(entity));
4712 /* construct type */
4713 (void) get_ir_type(entity->declaration.type);
4714 if (entity->base.symbol == NULL) {
4718 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4719 case STORAGE_CLASS_STATIC:
4720 if (entity->kind == ENTITY_FUNCTION) {
4721 (void)get_function_entity(entity, NULL);
4723 create_local_static_variable(entity);
4726 case STORAGE_CLASS_EXTERN:
4727 if (entity->kind == ENTITY_FUNCTION) {
4728 assert(entity->function.statement == NULL);
4729 (void)get_function_entity(entity, NULL);
4731 create_global_variable(entity);
4732 create_variable_initializer(entity);
4735 case STORAGE_CLASS_NONE:
4736 case STORAGE_CLASS_AUTO:
4737 case STORAGE_CLASS_REGISTER:
4738 if (entity->kind == ENTITY_FUNCTION) {
4739 if (entity->function.statement != NULL) {
4740 ir_type *owner = get_irg_frame_type(current_ir_graph);
4741 (void)get_function_entity(entity, owner);
4742 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4743 enqueue_inner_function(entity);
4745 (void)get_function_entity(entity, NULL);
4748 create_local_variable(entity);
4751 case STORAGE_CLASS_TYPEDEF:
4754 panic("invalid storage class found");
4757 static void initialize_local_declaration(entity_t *entity)
4759 if (entity->base.symbol == NULL)
4762 // no need to emit code in dead blocks
4763 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4764 && !currently_reachable())
4767 switch ((declaration_kind_t) entity->declaration.kind) {
4768 case DECLARATION_KIND_LOCAL_VARIABLE:
4769 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4770 create_variable_initializer(entity);
4773 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4774 allocate_variable_length_array(entity);
4777 case DECLARATION_KIND_COMPOUND_MEMBER:
4778 case DECLARATION_KIND_GLOBAL_VARIABLE:
4779 case DECLARATION_KIND_FUNCTION:
4780 case DECLARATION_KIND_INNER_FUNCTION:
4783 case DECLARATION_KIND_PARAMETER:
4784 case DECLARATION_KIND_PARAMETER_ENTITY:
4785 panic("can't initialize parameters");
4787 case DECLARATION_KIND_UNKNOWN:
4788 panic("can't initialize unknown declaration");
4790 panic("invalid declaration kind");
4793 static void declaration_statement_to_firm(declaration_statement_t *statement)
4795 entity_t *entity = statement->declarations_begin;
4799 entity_t *const last = statement->declarations_end;
4800 for ( ;; entity = entity->base.next) {
4801 if (is_declaration(entity)) {
4802 initialize_local_declaration(entity);
4803 } else if (entity->kind == ENTITY_TYPEDEF) {
4804 /* ยง6.7.7:3 Any array size expressions associated with variable length
4805 * array declarators are evaluated each time the declaration of the
4806 * typedef name is reached in the order of execution. */
4807 type_t *const type = skip_typeref(entity->typedefe.type);
4808 if (is_type_array(type) && type->array.is_vla)
4809 get_vla_size(&type->array);
4816 static void if_statement_to_firm(if_statement_t *statement)
4818 /* Create the condition. */
4819 ir_node *true_block = NULL;
4820 ir_node *false_block = NULL;
4821 if (currently_reachable()) {
4822 true_block = new_immBlock();
4823 false_block = new_immBlock();
4824 create_condition_evaluation(statement->condition, true_block, false_block);
4825 mature_immBlock(true_block);
4828 /* Create the false statement.
4829 * Handle false before true, so if no false statement is present, then the
4830 * empty false block is reused as fallthrough block. */
4831 ir_node *fallthrough_block = NULL;
4832 if (statement->false_statement != NULL) {
4833 if (false_block != NULL) {
4834 mature_immBlock(false_block);
4836 set_cur_block(false_block);
4837 statement_to_firm(statement->false_statement);
4838 if (currently_reachable()) {
4839 fallthrough_block = new_immBlock();
4840 add_immBlock_pred(fallthrough_block, new_Jmp());
4843 fallthrough_block = false_block;
4846 /* Create the true statement. */
4847 set_cur_block(true_block);
4848 statement_to_firm(statement->true_statement);
4849 if (currently_reachable()) {
4850 if (fallthrough_block == NULL) {
4851 fallthrough_block = new_immBlock();
4853 add_immBlock_pred(fallthrough_block, new_Jmp());
4856 /* Handle the block after the if-statement. */
4857 if (fallthrough_block != NULL) {
4858 mature_immBlock(fallthrough_block);
4860 set_cur_block(fallthrough_block);
4863 /* Create a jump node which jumps into target_block, if the current block is
4865 static void jump_if_reachable(ir_node *const target_block)
4867 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4868 add_immBlock_pred(target_block, pred);
4871 static void while_statement_to_firm(while_statement_t *statement)
4873 /* Create the header block */
4874 ir_node *const header_block = new_immBlock();
4875 jump_if_reachable(header_block);
4877 /* Create the condition. */
4878 ir_node * body_block;
4879 ir_node * false_block;
4880 expression_t *const cond = statement->condition;
4881 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4882 fold_constant_to_bool(cond)) {
4883 /* Shortcut for while (true). */
4884 body_block = header_block;
4887 keep_alive(header_block);
4888 keep_all_memory(header_block);
4890 body_block = new_immBlock();
4891 false_block = new_immBlock();
4893 set_cur_block(header_block);
4894 create_condition_evaluation(cond, body_block, false_block);
4895 mature_immBlock(body_block);
4898 ir_node *const old_continue_label = continue_label;
4899 ir_node *const old_break_label = break_label;
4900 continue_label = header_block;
4901 break_label = false_block;
4903 /* Create the loop body. */
4904 set_cur_block(body_block);
4905 statement_to_firm(statement->body);
4906 jump_if_reachable(header_block);
4908 mature_immBlock(header_block);
4909 assert(false_block == NULL || false_block == break_label);
4910 false_block = break_label;
4911 if (false_block != NULL) {
4912 mature_immBlock(false_block);
4914 set_cur_block(false_block);
4916 assert(continue_label == header_block);
4917 continue_label = old_continue_label;
4918 break_label = old_break_label;
4921 static ir_node *get_break_label(void)
4923 if (break_label == NULL) {
4924 break_label = new_immBlock();
4929 static void do_while_statement_to_firm(do_while_statement_t *statement)
4931 /* create the header block */
4932 ir_node *header_block = new_immBlock();
4935 ir_node *body_block = new_immBlock();
4936 jump_if_reachable(body_block);
4938 ir_node *old_continue_label = continue_label;
4939 ir_node *old_break_label = break_label;
4940 continue_label = header_block;
4943 set_cur_block(body_block);
4944 statement_to_firm(statement->body);
4945 ir_node *const false_block = get_break_label();
4947 assert(continue_label == header_block);
4948 continue_label = old_continue_label;
4949 break_label = old_break_label;
4951 jump_if_reachable(header_block);
4953 /* create the condition */
4954 mature_immBlock(header_block);
4955 set_cur_block(header_block);
4957 create_condition_evaluation(statement->condition, body_block, false_block);
4958 mature_immBlock(body_block);
4959 mature_immBlock(false_block);
4961 set_cur_block(false_block);
4964 static void for_statement_to_firm(for_statement_t *statement)
4966 /* create declarations */
4967 entity_t *entity = statement->scope.entities;
4968 for ( ; entity != NULL; entity = entity->base.next) {
4969 if (!is_declaration(entity))
4972 create_local_declaration(entity);
4975 if (currently_reachable()) {
4976 entity = statement->scope.entities;
4977 for ( ; entity != NULL; entity = entity->base.next) {
4978 if (!is_declaration(entity))
4981 initialize_local_declaration(entity);
4984 if (statement->initialisation != NULL) {
4985 expression_to_firm(statement->initialisation);
4989 /* Create the header block */
4990 ir_node *const header_block = new_immBlock();
4991 jump_if_reachable(header_block);
4993 /* Create the condition. */
4994 ir_node *body_block;
4995 ir_node *false_block;
4996 if (statement->condition != NULL) {
4997 body_block = new_immBlock();
4998 false_block = new_immBlock();
5000 set_cur_block(header_block);
5001 create_condition_evaluation(statement->condition, body_block, false_block);
5002 mature_immBlock(body_block);
5005 body_block = header_block;
5008 keep_alive(header_block);
5009 keep_all_memory(header_block);
5012 /* Create the step block, if necessary. */
5013 ir_node * step_block = header_block;
5014 expression_t *const step = statement->step;
5016 step_block = new_immBlock();
5019 ir_node *const old_continue_label = continue_label;
5020 ir_node *const old_break_label = break_label;
5021 continue_label = step_block;
5022 break_label = false_block;
5024 /* Create the loop body. */
5025 set_cur_block(body_block);
5026 statement_to_firm(statement->body);
5027 jump_if_reachable(step_block);
5029 /* Create the step code. */
5031 mature_immBlock(step_block);
5032 set_cur_block(step_block);
5033 expression_to_firm(step);
5034 jump_if_reachable(header_block);
5037 mature_immBlock(header_block);
5038 assert(false_block == NULL || false_block == break_label);
5039 false_block = break_label;
5040 if (false_block != NULL) {
5041 mature_immBlock(false_block);
5043 set_cur_block(false_block);
5045 assert(continue_label == step_block);
5046 continue_label = old_continue_label;
5047 break_label = old_break_label;
5050 static void create_jump_statement(const statement_t *statement,
5051 ir_node *target_block)
5053 if (!currently_reachable())
5056 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5057 ir_node *jump = new_d_Jmp(dbgi);
5058 add_immBlock_pred(target_block, jump);
5060 set_unreachable_now();
5063 static void switch_statement_to_firm(switch_statement_t *statement)
5065 ir_node *first_block = NULL;
5066 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5067 ir_node *cond = NULL;
5069 if (currently_reachable()) {
5070 ir_node *expression = expression_to_firm(statement->expression);
5071 cond = new_d_Cond(dbgi, expression);
5072 first_block = get_cur_block();
5075 set_unreachable_now();
5077 ir_node *const old_switch_cond = current_switch_cond;
5078 ir_node *const old_break_label = break_label;
5079 const bool old_saw_default_label = saw_default_label;
5080 saw_default_label = false;
5081 current_switch_cond = cond;
5083 switch_statement_t *const old_switch = current_switch;
5084 current_switch = statement;
5086 /* determine a free number for the default label */
5087 unsigned long num_cases = 0;
5088 long default_proj_nr = 0;
5089 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
5090 if (l->expression == NULL) {
5094 if (l->last_case >= l->first_case)
5095 num_cases += l->last_case - l->first_case + 1;
5096 if (l->last_case > default_proj_nr)
5097 default_proj_nr = l->last_case;
5100 if (default_proj_nr == LONG_MAX) {
5101 /* Bad: an overflow will occur, we cannot be sure that the
5102 * maximum + 1 is a free number. Scan the values a second
5103 * time to find a free number.
5105 unsigned char *bits = xmalloc((num_cases + 7) >> 3);
5107 memset(bits, 0, (num_cases + 7) >> 3);
5108 for (case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
5109 if (l->expression == NULL) {
5113 unsigned long start = l->first_case > 0 ? (unsigned long)l->first_case : 0;
5114 if (start < num_cases && l->last_case >= 0) {
5115 unsigned long end = (unsigned long)l->last_case < num_cases ?
5116 (unsigned long)l->last_case : num_cases - 1;
5117 for (unsigned long cns = start; cns <= end; ++cns) {
5118 bits[cns >> 3] |= (1 << (cns & 7));
5122 /* We look at the first num_cases constants:
5123 * Either they are dense, so we took the last (num_cases)
5124 * one, or they are not dense, so we will find one free
5128 for (i = 0; i < num_cases; ++i)
5129 if ((bits[i >> 3] & (1 << (i & 7))) == 0)
5133 default_proj_nr = i;
5137 statement->default_proj_nr = default_proj_nr;
5138 /* safety check: cond might already be folded to a Bad */
5139 if (cond != NULL && is_Cond(cond)) {
5140 set_Cond_default_proj(cond, default_proj_nr);
5143 statement_to_firm(statement->body);
5145 jump_if_reachable(get_break_label());
5147 if (!saw_default_label && first_block != NULL) {
5148 set_cur_block(first_block);
5149 ir_node *const proj = new_d_Proj(dbgi, cond, mode_X, default_proj_nr);
5150 add_immBlock_pred(get_break_label(), proj);
5153 if (break_label != NULL) {
5154 mature_immBlock(break_label);
5156 set_cur_block(break_label);
5158 assert(current_switch_cond == cond);
5159 current_switch = old_switch;
5160 current_switch_cond = old_switch_cond;
5161 break_label = old_break_label;
5162 saw_default_label = old_saw_default_label;
5165 static void case_label_to_firm(const case_label_statement_t *statement)
5167 if (statement->is_empty_range)
5170 ir_node *block = new_immBlock();
5171 /* Fallthrough from previous case */
5172 jump_if_reachable(block);
5174 if (current_switch_cond != NULL) {
5175 set_cur_block(get_nodes_block(current_switch_cond));
5176 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5177 if (statement->expression != NULL) {
5178 long pn = statement->first_case;
5179 long end_pn = statement->last_case;
5180 assert(pn <= end_pn);
5181 /* create jumps for all cases in the given range */
5183 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X, pn);
5184 add_immBlock_pred(block, proj);
5185 } while (pn++ < end_pn);
5187 saw_default_label = true;
5188 ir_node *const proj = new_d_Proj(dbgi, current_switch_cond, mode_X,
5189 current_switch->default_proj_nr);
5190 add_immBlock_pred(block, proj);
5194 mature_immBlock(block);
5195 set_cur_block(block);
5197 statement_to_firm(statement->statement);
5200 static void label_to_firm(const label_statement_t *statement)
5202 ir_node *block = get_label_block(statement->label);
5203 jump_if_reachable(block);
5205 set_cur_block(block);
5207 keep_all_memory(block);
5209 statement_to_firm(statement->statement);
5212 static void goto_to_firm(const goto_statement_t *statement)
5214 if (!currently_reachable())
5217 if (statement->expression) {
5218 ir_node *irn = expression_to_firm(statement->expression);
5219 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5220 ir_node *ijmp = new_d_IJmp(dbgi, irn);
5222 set_irn_link(ijmp, ijmp_list);
5225 ir_node *block = get_label_block(statement->label);
5226 ir_node *jmp = new_Jmp();
5227 add_immBlock_pred(block, jmp);
5229 set_unreachable_now();
5232 static void asm_statement_to_firm(const asm_statement_t *statement)
5234 bool needs_memory = false;
5236 if (statement->is_volatile) {
5237 needs_memory = true;
5240 size_t n_clobbers = 0;
5241 asm_clobber_t *clobber = statement->clobbers;
5242 for ( ; clobber != NULL; clobber = clobber->next) {
5243 const char *clobber_str = clobber->clobber.begin;
5245 if (!be_is_valid_clobber(clobber_str)) {
5246 errorf(&statement->base.source_position,
5247 "invalid clobber '%s' specified", clobber->clobber);
5251 if (strcmp(clobber_str, "memory") == 0) {
5252 needs_memory = true;
5256 ident *id = new_id_from_str(clobber_str);
5257 obstack_ptr_grow(&asm_obst, id);
5260 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5261 ident **clobbers = NULL;
5262 if (n_clobbers > 0) {
5263 clobbers = obstack_finish(&asm_obst);
5266 size_t n_inputs = 0;
5267 asm_argument_t *argument = statement->inputs;
5268 for ( ; argument != NULL; argument = argument->next)
5270 size_t n_outputs = 0;
5271 argument = statement->outputs;
5272 for ( ; argument != NULL; argument = argument->next)
5275 unsigned next_pos = 0;
5277 ir_node *ins[n_inputs + n_outputs + 1];
5280 ir_asm_constraint tmp_in_constraints[n_outputs];
5282 const expression_t *out_exprs[n_outputs];
5283 ir_node *out_addrs[n_outputs];
5284 size_t out_size = 0;
5286 argument = statement->outputs;
5287 for ( ; argument != NULL; argument = argument->next) {
5288 const char *constraints = argument->constraints.begin;
5289 asm_constraint_flags_t asm_flags
5290 = be_parse_asm_constraints(constraints);
5293 source_position_t const *const pos = &statement->base.source_position;
5294 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5295 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5297 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5298 errorf(pos, "some constraints in '%s' are invalid", constraints);
5301 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5302 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5307 unsigned pos = next_pos++;
5308 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5309 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5310 expression_t *expr = argument->expression;
5311 ir_node *addr = expression_to_addr(expr);
5312 /* in+output, construct an artifical same_as constraint on the
5314 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5316 ir_node *value = get_value_from_lvalue(expr, addr);
5318 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5320 ir_asm_constraint constraint;
5321 constraint.pos = pos;
5322 constraint.constraint = new_id_from_str(buf);
5323 constraint.mode = get_ir_mode_storage(expr->base.type);
5324 tmp_in_constraints[in_size] = constraint;
5325 ins[in_size] = value;
5330 out_exprs[out_size] = expr;
5331 out_addrs[out_size] = addr;
5333 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5334 /* pure memory ops need no input (but we have to make sure we
5335 * attach to the memory) */
5336 assert(! (asm_flags &
5337 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5338 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5339 needs_memory = true;
5341 /* we need to attach the address to the inputs */
5342 expression_t *expr = argument->expression;
5344 ir_asm_constraint constraint;
5345 constraint.pos = pos;
5346 constraint.constraint = new_id_from_str(constraints);
5347 constraint.mode = NULL;
5348 tmp_in_constraints[in_size] = constraint;
5350 ins[in_size] = expression_to_addr(expr);
5354 errorf(&statement->base.source_position,
5355 "only modifiers but no place set in constraints '%s'",
5360 ir_asm_constraint constraint;
5361 constraint.pos = pos;
5362 constraint.constraint = new_id_from_str(constraints);
5363 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5365 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5367 assert(obstack_object_size(&asm_obst)
5368 == out_size * sizeof(ir_asm_constraint));
5369 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5372 obstack_grow(&asm_obst, tmp_in_constraints,
5373 in_size * sizeof(tmp_in_constraints[0]));
5374 /* find and count input and output arguments */
5375 argument = statement->inputs;
5376 for ( ; argument != NULL; argument = argument->next) {
5377 const char *constraints = argument->constraints.begin;
5378 asm_constraint_flags_t asm_flags
5379 = be_parse_asm_constraints(constraints);
5381 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5382 errorf(&statement->base.source_position,
5383 "some constraints in '%s' are not supported", constraints);
5386 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5387 errorf(&statement->base.source_position,
5388 "some constraints in '%s' are invalid", constraints);
5391 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5392 errorf(&statement->base.source_position,
5393 "write flag specified for input constraints '%s'",
5399 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5400 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5401 /* we can treat this as "normal" input */
5402 input = expression_to_firm(argument->expression);
5403 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5404 /* pure memory ops need no input (but we have to make sure we
5405 * attach to the memory) */
5406 assert(! (asm_flags &
5407 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5408 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5409 needs_memory = true;
5410 input = expression_to_addr(argument->expression);
5412 errorf(&statement->base.source_position,
5413 "only modifiers but no place set in constraints '%s'",
5418 ir_asm_constraint constraint;
5419 constraint.pos = next_pos++;
5420 constraint.constraint = new_id_from_str(constraints);
5421 constraint.mode = get_irn_mode(input);
5423 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5424 ins[in_size++] = input;
5428 ir_asm_constraint constraint;
5429 constraint.pos = next_pos++;
5430 constraint.constraint = new_id_from_str("");
5431 constraint.mode = mode_M;
5433 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5434 ins[in_size++] = get_store();
5437 assert(obstack_object_size(&asm_obst)
5438 == in_size * sizeof(ir_asm_constraint));
5439 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5441 /* create asm node */
5442 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5444 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5446 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5447 out_size, output_constraints,
5448 n_clobbers, clobbers, asm_text);
5450 if (statement->is_volatile) {
5451 set_irn_pinned(node, op_pin_state_pinned);
5453 set_irn_pinned(node, op_pin_state_floats);
5456 /* create output projs & connect them */
5458 ir_node *projm = new_Proj(node, mode_M, out_size);
5463 for (i = 0; i < out_size; ++i) {
5464 const expression_t *out_expr = out_exprs[i];
5466 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5467 ir_node *proj = new_Proj(node, mode, pn);
5468 ir_node *addr = out_addrs[i];
5470 set_value_for_expression_addr(out_expr, proj, addr);
5474 static void ms_try_statement_to_firm(ms_try_statement_t *statement)
5476 statement_to_firm(statement->try_statement);
5477 source_position_t const *const pos = &statement->base.source_position;
5478 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5481 static void leave_statement_to_firm(leave_statement_t *statement)
5483 errorf(&statement->base.source_position, "__leave not supported yet");
5487 * Transform a statement.
5489 static void statement_to_firm(statement_t *statement)
5492 assert(!statement->base.transformed);
5493 statement->base.transformed = true;
5496 switch (statement->kind) {
5497 case STATEMENT_ERROR:
5498 panic("error statement found");
5499 case STATEMENT_EMPTY:
5502 case STATEMENT_COMPOUND:
5503 compound_statement_to_firm(&statement->compound);
5505 case STATEMENT_RETURN:
5506 return_statement_to_firm(&statement->returns);
5508 case STATEMENT_EXPRESSION:
5509 expression_statement_to_firm(&statement->expression);
5512 if_statement_to_firm(&statement->ifs);
5514 case STATEMENT_WHILE:
5515 while_statement_to_firm(&statement->whiles);
5517 case STATEMENT_DO_WHILE:
5518 do_while_statement_to_firm(&statement->do_while);
5520 case STATEMENT_DECLARATION:
5521 declaration_statement_to_firm(&statement->declaration);
5523 case STATEMENT_BREAK:
5524 create_jump_statement(statement, get_break_label());
5526 case STATEMENT_CONTINUE:
5527 create_jump_statement(statement, continue_label);
5529 case STATEMENT_SWITCH:
5530 switch_statement_to_firm(&statement->switchs);
5532 case STATEMENT_CASE_LABEL:
5533 case_label_to_firm(&statement->case_label);
5536 for_statement_to_firm(&statement->fors);
5538 case STATEMENT_LABEL:
5539 label_to_firm(&statement->label);
5541 case STATEMENT_GOTO:
5542 goto_to_firm(&statement->gotos);
5545 asm_statement_to_firm(&statement->asms);
5547 case STATEMENT_MS_TRY:
5548 ms_try_statement_to_firm(&statement->ms_try);
5550 case STATEMENT_LEAVE:
5551 leave_statement_to_firm(&statement->leave);
5554 panic("statement not implemented");
5557 static int count_local_variables(const entity_t *entity,
5558 const entity_t *const last)
5561 entity_t const *const end = last != NULL ? last->base.next : NULL;
5562 for (; entity != end; entity = entity->base.next) {
5566 if (entity->kind == ENTITY_VARIABLE) {
5567 type = skip_typeref(entity->declaration.type);
5568 address_taken = entity->variable.address_taken;
5569 } else if (entity->kind == ENTITY_PARAMETER) {
5570 type = skip_typeref(entity->declaration.type);
5571 address_taken = entity->parameter.address_taken;
5576 if (!address_taken && is_type_scalar(type))
5582 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5584 int *const count = env;
5586 switch (stmt->kind) {
5587 case STATEMENT_DECLARATION: {
5588 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5589 *count += count_local_variables(decl_stmt->declarations_begin,
5590 decl_stmt->declarations_end);
5595 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5604 * Return the number of local (alias free) variables used by a function.
5606 static int get_function_n_local_vars(entity_t *entity)
5608 const function_t *function = &entity->function;
5611 /* count parameters */
5612 count += count_local_variables(function->parameters.entities, NULL);
5614 /* count local variables declared in body */
5615 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5620 * Build Firm code for the parameters of a function.
5622 static void initialize_function_parameters(entity_t *entity)
5624 assert(entity->kind == ENTITY_FUNCTION);
5625 ir_graph *irg = current_ir_graph;
5626 ir_node *args = get_irg_args(irg);
5628 ir_type *function_irtype;
5630 if (entity->function.need_closure) {
5631 /* add an extra parameter for the static link */
5632 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5635 /* Matze: IMO this is wrong, nested functions should have an own
5636 * type and not rely on strange parameters... */
5637 function_irtype = create_method_type(&entity->declaration.type->function, true);
5639 function_irtype = get_ir_type(entity->declaration.type);
5644 entity_t *parameter = entity->function.parameters.entities;
5645 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5646 if (parameter->kind != ENTITY_PARAMETER)
5649 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5650 type_t *type = skip_typeref(parameter->declaration.type);
5652 bool needs_entity = parameter->parameter.address_taken;
5653 assert(!is_type_array(type));
5654 if (is_type_compound(type)) {
5655 needs_entity = true;
5658 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5660 ir_type *frame_type = get_irg_frame_type(irg);
5662 = new_parameter_entity(frame_type, n, param_irtype);
5663 parameter->declaration.kind
5664 = DECLARATION_KIND_PARAMETER_ENTITY;
5665 parameter->parameter.v.entity = param;
5669 ir_mode *param_mode = get_type_mode(param_irtype);
5671 ir_node *value = new_r_Proj(args, param_mode, pn);
5673 ir_mode *mode = get_ir_mode_storage(type);
5674 value = create_conv(NULL, value, mode);
5675 value = do_strict_conv(NULL, value);
5677 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5678 parameter->parameter.v.value_number = next_value_number_function;
5679 set_irg_loc_description(current_ir_graph, next_value_number_function,
5681 ++next_value_number_function;
5683 set_value(parameter->parameter.v.value_number, value);
5688 * Handle additional decl modifiers for IR-graphs
5690 * @param irg the IR-graph
5691 * @param dec_modifiers additional modifiers
5693 static void handle_decl_modifier_irg(ir_graph_ptr irg,
5694 decl_modifiers_t decl_modifiers)
5696 if (decl_modifiers & DM_RETURNS_TWICE) {
5697 /* TRUE if the declaration includes __attribute__((returns_twice)) */
5698 add_irg_additional_properties(irg, mtp_property_returns_twice);
5700 if (decl_modifiers & DM_NORETURN) {
5701 /* TRUE if the declaration includes the Microsoft
5702 __declspec(noreturn) specifier. */
5703 add_irg_additional_properties(irg, mtp_property_noreturn);
5705 if (decl_modifiers & DM_NOTHROW) {
5706 /* TRUE if the declaration includes the Microsoft
5707 __declspec(nothrow) specifier. */
5708 add_irg_additional_properties(irg, mtp_property_nothrow);
5710 if (decl_modifiers & DM_NAKED) {
5711 /* TRUE if the declaration includes the Microsoft
5712 __declspec(naked) specifier. */
5713 add_irg_additional_properties(irg, mtp_property_naked);
5715 if (decl_modifiers & DM_FORCEINLINE) {
5716 /* TRUE if the declaration includes the
5717 Microsoft __forceinline specifier. */
5718 set_irg_inline_property(irg, irg_inline_forced);
5720 if (decl_modifiers & DM_NOINLINE) {
5721 /* TRUE if the declaration includes the Microsoft
5722 __declspec(noinline) specifier. */
5723 set_irg_inline_property(irg, irg_inline_forbidden);
5727 static void add_function_pointer(ir_type *segment, ir_entity *method,
5728 const char *unique_template)
5730 ir_type *method_type = get_entity_type(method);
5731 ir_type *ptr_type = new_type_pointer(method_type);
5733 /* these entities don't really have a name but firm only allows
5735 * Note that we mustn't give these entities a name since for example
5736 * Mach-O doesn't allow them. */
5737 ident *ide = id_unique(unique_template);
5738 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5739 ir_graph *irg = get_const_code_irg();
5740 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5743 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5744 set_entity_compiler_generated(ptr, 1);
5745 set_entity_visibility(ptr, ir_visibility_private);
5746 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5747 set_atomic_ent_value(ptr, val);
5751 * Generate possible IJmp branches to a given label block.
5753 static void gen_ijmp_branches(ir_node *block)
5756 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5757 add_immBlock_pred(block, ijmp);
5762 * Create code for a function and all inner functions.
5764 * @param entity the function entity
5766 static void create_function(entity_t *entity)
5768 assert(entity->kind == ENTITY_FUNCTION);
5769 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5771 if (entity->function.statement == NULL)
5774 if (is_main(entity) && enable_main_collect2_hack) {
5775 prepare_main_collect2(entity);
5778 inner_functions = NULL;
5779 current_trampolines = NULL;
5781 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5782 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5783 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5785 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5786 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5787 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5790 current_function_entity = entity;
5791 current_function_name = NULL;
5792 current_funcsig = NULL;
5794 assert(all_labels == NULL);
5795 all_labels = NEW_ARR_F(label_t *, 0);
5798 int n_local_vars = get_function_n_local_vars(entity);
5799 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5800 current_ir_graph = irg;
5802 ir_graph *old_current_function = current_function;
5803 current_function = irg;
5805 set_irg_fp_model(irg, firm_fp_model);
5806 tarval_enable_fp_ops(1);
5807 set_irn_dbg_info(get_irg_start_block(irg),
5808 get_entity_dbg_info(function_entity));
5810 ir_node *first_block = get_cur_block();
5812 /* set inline flags */
5813 if (entity->function.is_inline)
5814 set_irg_inline_property(irg, irg_inline_recomended);
5815 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5817 next_value_number_function = 0;
5818 initialize_function_parameters(entity);
5819 current_static_link = entity->function.static_link;
5821 statement_to_firm(entity->function.statement);
5823 ir_node *end_block = get_irg_end_block(irg);
5825 /* do we have a return statement yet? */
5826 if (currently_reachable()) {
5827 type_t *type = skip_typeref(entity->declaration.type);
5828 assert(is_type_function(type));
5829 const function_type_t *func_type = &type->function;
5830 const type_t *return_type
5831 = skip_typeref(func_type->return_type);
5834 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5835 ret = new_Return(get_store(), 0, NULL);
5838 if (is_type_scalar(return_type)) {
5839 mode = get_ir_mode_storage(func_type->return_type);
5845 /* ยง5.1.2.2.3 main implicitly returns 0 */
5846 if (is_main(entity)) {
5847 in[0] = new_Const(get_mode_null(mode));
5849 in[0] = new_Unknown(mode);
5851 ret = new_Return(get_store(), 1, in);
5853 add_immBlock_pred(end_block, ret);
5856 bool has_computed_gotos = false;
5857 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5858 label_t *label = all_labels[i];
5859 if (label->address_taken) {
5860 gen_ijmp_branches(label->block);
5861 has_computed_gotos = true;
5863 mature_immBlock(label->block);
5865 if (has_computed_gotos) {
5866 /* if we have computed goto's in the function, we cannot inline it */
5867 if (get_irg_inline_property(irg) >= irg_inline_recomended) {
5868 source_position_t const *const pos = &entity->base.source_position;
5869 warningf(WARN_OTHER, pos, "'%N' can never be inlined because it contains a computed goto", entity);
5871 set_irg_inline_property(irg, irg_inline_forbidden);
5874 DEL_ARR_F(all_labels);
5877 mature_immBlock(first_block);
5878 mature_immBlock(end_block);
5880 irg_finalize_cons(irg);
5882 /* finalize the frame type */
5883 ir_type *frame_type = get_irg_frame_type(irg);
5884 int n = get_compound_n_members(frame_type);
5887 for (int i = 0; i < n; ++i) {
5888 ir_entity *member = get_compound_member(frame_type, i);
5889 ir_type *entity_type = get_entity_type(member);
5891 int align = get_type_alignment_bytes(entity_type);
5892 if (align > align_all)
5896 misalign = offset % align;
5898 offset += align - misalign;
5902 set_entity_offset(member, offset);
5903 offset += get_type_size_bytes(entity_type);
5905 set_type_size_bytes(frame_type, offset);
5906 set_type_alignment_bytes(frame_type, align_all);
5908 irg_verify(irg, VERIFY_ENFORCE_SSA);
5909 current_function = old_current_function;
5911 if (current_trampolines != NULL) {
5912 DEL_ARR_F(current_trampolines);
5913 current_trampolines = NULL;
5916 /* create inner functions if any */
5917 entity_t **inner = inner_functions;
5918 if (inner != NULL) {
5919 ir_type *rem_outer_frame = current_outer_frame;
5920 current_outer_frame = get_irg_frame_type(current_ir_graph);
5921 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5922 create_function(inner[i]);
5926 current_outer_frame = rem_outer_frame;
5930 static void scope_to_firm(scope_t *scope)
5932 /* first pass: create declarations */
5933 entity_t *entity = scope->entities;
5934 for ( ; entity != NULL; entity = entity->base.next) {
5935 if (entity->base.symbol == NULL)
5938 if (entity->kind == ENTITY_FUNCTION) {
5939 if (entity->function.btk != bk_none) {
5940 /* builtins have no representation */
5943 (void)get_function_entity(entity, NULL);
5944 } else if (entity->kind == ENTITY_VARIABLE) {
5945 create_global_variable(entity);
5946 } else if (entity->kind == ENTITY_NAMESPACE) {
5947 scope_to_firm(&entity->namespacee.members);
5951 /* second pass: create code/initializers */
5952 entity = scope->entities;
5953 for ( ; entity != NULL; entity = entity->base.next) {
5954 if (entity->base.symbol == NULL)
5957 if (entity->kind == ENTITY_FUNCTION) {
5958 if (entity->function.btk != bk_none) {
5959 /* builtins have no representation */
5962 create_function(entity);
5963 } else if (entity->kind == ENTITY_VARIABLE) {
5964 assert(entity->declaration.kind
5965 == DECLARATION_KIND_GLOBAL_VARIABLE);
5966 current_ir_graph = get_const_code_irg();
5967 create_variable_initializer(entity);
5972 void init_ast2firm(void)
5974 obstack_init(&asm_obst);
5975 init_atomic_modes();
5977 ir_set_debug_retrieve(dbg_retrieve);
5978 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5980 /* create idents for all known runtime functions */
5981 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5982 rts_idents[i] = new_id_from_str(rts_data[i].name);
5985 entitymap_init(&entitymap);
5988 static void init_ir_types(void)
5990 static int ir_types_initialized = 0;
5991 if (ir_types_initialized)
5993 ir_types_initialized = 1;
5995 ir_type_int = get_ir_type(type_int);
5996 ir_type_char = get_ir_type(type_char);
5997 ir_type_const_char = get_ir_type(type_const_char);
5998 ir_type_wchar_t = get_ir_type(type_wchar_t);
5999 ir_type_void = get_ir_type(type_void);
6001 be_params = be_get_backend_param();
6002 mode_float_arithmetic = be_params->mode_float_arithmetic;
6004 stack_param_align = be_params->stack_param_align;
6007 void exit_ast2firm(void)
6009 entitymap_destroy(&entitymap);
6010 obstack_free(&asm_obst, NULL);
6013 static void global_asm_to_firm(statement_t *s)
6015 for (; s != NULL; s = s->base.next) {
6016 assert(s->kind == STATEMENT_ASM);
6018 char const *const text = s->asms.asm_text.begin;
6019 size_t size = s->asms.asm_text.size;
6021 /* skip the last \0 */
6022 if (text[size - 1] == '\0')
6025 ident *const id = new_id_from_chars(text, size);
6030 void translation_unit_to_firm(translation_unit_t *unit)
6032 /* initialize firm arithmetic */
6033 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
6034 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
6036 /* just to be sure */
6037 continue_label = NULL;
6039 current_switch_cond = NULL;
6040 current_translation_unit = unit;
6044 scope_to_firm(&unit->scope);
6045 global_asm_to_firm(unit->global_asm);
6047 current_ir_graph = NULL;
6048 current_translation_unit = NULL;