2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include <libfirm/firm.h>
28 #include <libfirm/adt/obst.h>
29 #include <libfirm/be.h>
33 #include "adt/error.h"
34 #include "adt/array.h"
35 #include "adt/strutil.h"
43 #include "diagnostic.h"
44 #include "lang_features.h"
46 #include "type_hash.h"
51 #include "entitymap_t.h"
52 #include "driver/firm_opt.h"
54 typedef struct trampoline_region trampoline_region;
55 struct trampoline_region {
56 ir_entity *function; /**< The function that is called by this trampoline */
57 ir_entity *region; /**< created region for the trampoline */
60 fp_model_t firm_fp_model = fp_model_precise;
62 static const backend_params *be_params;
64 static ir_type *ir_type_char;
65 static ir_type *ir_type_const_char;
66 static ir_type *ir_type_wchar_t;
68 /* architecture specific floating point arithmetic mode (if any) */
69 static ir_mode *mode_float_arithmetic;
71 /* alignment of stack parameters */
72 static unsigned stack_param_align;
74 static int next_value_number_function;
75 static ir_node *continue_label;
76 static ir_node *break_label;
77 static ir_node *current_switch;
78 static bool saw_default_label;
79 static label_t **all_labels;
80 static entity_t **inner_functions;
81 static ir_node *ijmp_list;
82 static bool constant_folding;
84 static const entity_t *current_function_entity;
85 static ir_node *current_function_name;
86 static ir_node *current_funcsig;
87 static ir_graph *current_function;
88 static translation_unit_t *current_translation_unit;
89 static trampoline_region *current_trampolines;
90 static ir_type *current_outer_frame;
91 static ir_node *current_static_link;
92 static ir_entity *current_vararg_entity;
94 static entitymap_t entitymap;
96 static struct obstack asm_obst;
98 typedef enum declaration_kind_t {
99 DECLARATION_KIND_UNKNOWN,
100 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
101 DECLARATION_KIND_GLOBAL_VARIABLE,
102 DECLARATION_KIND_LOCAL_VARIABLE,
103 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
104 DECLARATION_KIND_PARAMETER,
105 DECLARATION_KIND_PARAMETER_ENTITY,
106 DECLARATION_KIND_FUNCTION,
107 DECLARATION_KIND_COMPOUND_MEMBER,
108 DECLARATION_KIND_INNER_FUNCTION
109 } declaration_kind_t;
111 static ir_type *get_ir_type_incomplete(type_t *type);
113 static void enqueue_inner_function(entity_t *entity)
115 if (inner_functions == NULL)
116 inner_functions = NEW_ARR_F(entity_t *, 0);
117 ARR_APP1(entity_t*, inner_functions, entity);
120 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
122 const entity_t *entity = get_irg_loc_description(irg, pos);
124 if (entity != NULL) {
125 source_position_t const *const pos = &entity->base.source_position;
126 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
128 return new_r_Unknown(irg, mode);
131 static const char *dbg_retrieve(const dbg_info *dbg, unsigned *line)
133 const source_position_t *pos = (const source_position_t*) dbg;
138 return pos->input_name;
141 static dbg_info *get_dbg_info(const source_position_t *pos)
143 return (dbg_info*) pos;
146 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
147 const type_dbg_info *dbg)
150 print_to_buffer(buffer, buffer_size);
151 const type_t *type = (const type_t*) dbg;
153 finish_print_to_buffer();
156 static type_dbg_info *get_type_dbg_info_(const type_t *type)
158 return (type_dbg_info*) type;
161 /* is the current block a reachable one? */
162 static bool currently_reachable(void)
164 ir_node *const block = get_cur_block();
165 return block != NULL && !is_Bad(block);
168 static void set_unreachable_now(void)
173 ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
175 static ir_node *_expression_to_firm(const expression_t *expression);
176 static ir_node *expression_to_firm(const expression_t *expression);
177 static void create_local_declaration(entity_t *entity);
179 static unsigned decide_modulo_shift(unsigned type_size)
181 if (architecture_modulo_shift == 0)
183 if (type_size < architecture_modulo_shift)
184 return architecture_modulo_shift;
188 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
190 unsigned flags = get_atomic_type_flags(kind);
191 unsigned size = get_atomic_type_size(kind);
192 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
193 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
196 } else if (size == 8) {
199 panic("unexpected kind");
201 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
203 unsigned bit_size = size * 8;
204 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
205 unsigned modulo_shift = decide_modulo_shift(bit_size);
207 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
208 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
216 * Initialises the atomic modes depending on the machine size.
218 static void init_atomic_modes(void)
220 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
221 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
222 if (atomic_modes[i] != NULL)
224 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
228 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
230 assert(kind <= ATOMIC_TYPE_LAST);
231 return atomic_modes[kind];
234 static ir_node *get_vla_size(array_type_t *const type)
236 ir_node *size_node = type->size_node;
237 if (size_node == NULL) {
238 size_node = expression_to_firm(type->size_expression);
239 type->size_node = size_node;
244 static unsigned count_parameters(const function_type_t *function_type)
248 function_parameter_t *parameter = function_type->parameters;
249 for ( ; parameter != NULL; parameter = parameter->next) {
257 * Creates a Firm type for an atomic type
259 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
261 ir_mode *mode = atomic_modes[akind];
262 type_dbg_info *dbgi = get_type_dbg_info_(type);
263 ir_type *irtype = new_d_type_primitive(mode, dbgi);
264 il_alignment_t alignment = get_atomic_type_alignment(akind);
266 set_type_size_bytes(irtype, get_atomic_type_size(akind));
267 set_type_alignment_bytes(irtype, alignment);
273 * Creates a Firm type for a complex type
275 static ir_type *create_complex_type(const atomic_type_t *type)
277 atomic_type_kind_t kind = type->akind;
278 ir_mode *mode = atomic_modes[kind];
279 ident *id = get_mode_ident(mode);
283 /* FIXME: finish the array */
288 * Creates a Firm type for an imaginary type
290 static ir_type *create_imaginary_type(const atomic_type_t *type)
292 return create_atomic_type(type->akind, (const type_t*)type);
296 * return type of a parameter (and take transparent union gnu extension into
299 static type_t *get_parameter_type(type_t *orig_type)
301 type_t *type = skip_typeref(orig_type);
302 if (is_type_union(type)
303 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
304 compound_t *compound = type->compound.compound;
305 type = compound->members.entities->declaration.type;
311 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
313 type_t *return_type = skip_typeref(function_type->return_type);
315 int n_parameters = count_parameters(function_type)
316 + (for_closure ? 1 : 0);
317 int n_results = is_type_void(return_type) ? 0 : 1;
318 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
319 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
321 if (!is_type_void(return_type)) {
322 ir_type *restype = get_ir_type(return_type);
323 set_method_res_type(irtype, 0, restype);
326 function_parameter_t *parameter = function_type->parameters;
329 ir_type *p_irtype = get_ir_type(type_void_ptr);
330 set_method_param_type(irtype, n, p_irtype);
333 for ( ; parameter != NULL; parameter = parameter->next) {
334 type_t *type = get_parameter_type(parameter->type);
335 ir_type *p_irtype = get_ir_type(type);
336 set_method_param_type(irtype, n, p_irtype);
340 bool is_variadic = function_type->variadic;
343 set_method_variadicity(irtype, variadicity_variadic);
345 unsigned cc = get_method_calling_convention(irtype);
346 switch (function_type->calling_convention) {
347 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
350 set_method_calling_convention(irtype, SET_CDECL(cc));
357 /* only non-variadic function can use stdcall, else use cdecl */
358 set_method_calling_convention(irtype, SET_STDCALL(cc));
364 /* only non-variadic function can use fastcall, else use cdecl */
365 set_method_calling_convention(irtype, SET_FASTCALL(cc));
369 /* Hmm, leave default, not accepted by the parser yet. */
374 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
376 const decl_modifiers_t modifiers = function_type->modifiers;
377 if (modifiers & DM_CONST)
378 add_method_additional_properties(irtype, mtp_property_const);
379 if (modifiers & DM_PURE)
380 add_method_additional_properties(irtype, mtp_property_pure);
381 if (modifiers & DM_RETURNS_TWICE)
382 add_method_additional_properties(irtype, mtp_property_returns_twice);
383 if (modifiers & DM_NORETURN)
384 add_method_additional_properties(irtype, mtp_property_noreturn);
385 if (modifiers & DM_NOTHROW)
386 add_method_additional_properties(irtype, mtp_property_nothrow);
387 if (modifiers & DM_MALLOC)
388 add_method_additional_properties(irtype, mtp_property_malloc);
393 static ir_type *create_pointer_type(pointer_type_t *type)
395 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
396 type_t *points_to = type->points_to;
397 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
398 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
403 static ir_type *create_reference_type(reference_type_t *type)
405 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
406 type_t *refers_to = type->refers_to;
407 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
408 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
413 static ir_type *create_array_type(array_type_t *type)
415 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
416 type_t *element_type = type->element_type;
417 ir_type *ir_element_type = get_ir_type(element_type);
418 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
420 const int align = get_type_alignment_bytes(ir_element_type);
421 set_type_alignment_bytes(irtype, align);
423 if (type->size_constant) {
424 int n_elements = type->size;
426 set_array_bounds_int(irtype, 0, 0, n_elements);
428 size_t elemsize = get_type_size_bytes(ir_element_type);
429 if (elemsize % align > 0) {
430 elemsize += align - (elemsize % align);
432 set_type_size_bytes(irtype, n_elements * elemsize);
434 set_array_lower_bound_int(irtype, 0, 0);
436 set_type_state(irtype, layout_fixed);
442 * Return the signed integer type of size bits.
444 * @param size the size
446 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
450 static ir_mode *s_modes[64 + 1] = {NULL, };
454 if (size <= 0 || size > 64)
457 mode = s_modes[size];
461 snprintf(name, sizeof(name), "bf_I%u", size);
462 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
463 s_modes[size] = mode;
466 type_dbg_info *dbgi = get_type_dbg_info_(type);
467 res = new_d_type_primitive(mode, dbgi);
468 set_primitive_base_type(res, base_tp);
474 * Return the unsigned integer type of size bits.
476 * @param size the size
478 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
482 static ir_mode *u_modes[64 + 1] = {NULL, };
486 if (size <= 0 || size > 64)
489 mode = u_modes[size];
493 snprintf(name, sizeof(name), "bf_U%u", size);
494 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
495 u_modes[size] = mode;
498 type_dbg_info *dbgi = get_type_dbg_info_(type);
499 res = new_d_type_primitive(mode, dbgi);
500 set_primitive_base_type(res, base_tp);
505 static ir_type *create_bitfield_type(const entity_t *entity)
507 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
508 type_t *base = skip_typeref(entity->declaration.type);
509 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
510 ir_type *irbase = get_ir_type(base);
512 unsigned bit_size = entity->compound_member.bit_size;
514 assert(!is_type_float(base));
515 if (is_type_signed(base)) {
516 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
518 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
522 #define INVALID_TYPE ((ir_type*)-1)
525 COMPOUND_IS_STRUCT = false,
526 COMPOUND_IS_UNION = true
530 * Construct firm type from ast struct type.
532 static ir_type *create_compound_type(compound_type_t *type,
533 bool incomplete, bool is_union)
535 compound_t *compound = type->compound;
537 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
538 return compound->irtype;
541 symbol_t *type_symbol = compound->base.symbol;
543 if (type_symbol != NULL) {
544 id = new_id_from_str(type_symbol->string);
547 id = id_unique("__anonymous_union.%u");
549 id = id_unique("__anonymous_struct.%u");
555 irtype = new_type_union(id);
557 irtype = new_type_struct(id);
560 compound->irtype_complete = false;
561 compound->irtype = irtype;
567 layout_union_type(type);
569 layout_struct_type(type);
572 compound->irtype_complete = true;
574 entity_t *entry = compound->members.entities;
575 for ( ; entry != NULL; entry = entry->base.next) {
576 if (entry->kind != ENTITY_COMPOUND_MEMBER)
579 symbol_t *symbol = entry->base.symbol;
580 type_t *entry_type = entry->declaration.type;
582 if (symbol == NULL) {
583 /* anonymous bitfield member, skip */
584 if (entry->compound_member.bitfield)
586 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
587 || entry_type->kind == TYPE_COMPOUND_UNION);
588 ident = id_unique("anon.%u");
590 ident = new_id_from_str(symbol->string);
593 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
595 ir_type *entry_irtype;
596 if (entry->compound_member.bitfield) {
597 entry_irtype = create_bitfield_type(entry);
599 entry_irtype = get_ir_type(entry_type);
601 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
603 set_entity_offset(entity, entry->compound_member.offset);
604 set_entity_offset_bits_remainder(entity,
605 entry->compound_member.bit_offset);
607 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
608 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
609 entry->compound_member.entity = entity;
612 set_type_alignment_bytes(irtype, compound->alignment);
613 set_type_size_bytes(irtype, compound->size);
614 set_type_state(irtype, layout_fixed);
619 static ir_tarval *fold_constant_to_tarval(expression_t const *);
621 static void determine_enum_values(enum_type_t *const type)
623 ir_mode *const mode = atomic_modes[type->base.akind];
624 ir_tarval *const one = get_mode_one(mode);
625 ir_tarval * tv_next = get_mode_null(mode);
627 enum_t *enume = type->enume;
628 entity_t *entry = enume->base.next;
629 for (; entry != NULL; entry = entry->base.next) {
630 if (entry->kind != ENTITY_ENUM_VALUE)
633 expression_t *const init = entry->enum_value.value;
635 tv_next = fold_constant_to_tarval(init);
637 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
638 entry->enum_value.tv = tv_next;
639 tv_next = tarval_add(tv_next, one);
643 static ir_type *create_enum_type(enum_type_t *const type)
645 return create_atomic_type(type->base.akind, (const type_t*) type);
648 static ir_type *get_ir_type_incomplete(type_t *type)
650 assert(type != NULL);
651 type = skip_typeref(type);
653 if (type->base.firm_type != NULL) {
654 assert(type->base.firm_type != INVALID_TYPE);
655 return type->base.firm_type;
658 switch (type->kind) {
659 case TYPE_COMPOUND_STRUCT:
660 return create_compound_type(&type->compound, true, COMPOUND_IS_STRUCT);
661 case TYPE_COMPOUND_UNION:
662 return create_compound_type(&type->compound, true, COMPOUND_IS_UNION);
664 return get_ir_type(type);
668 ir_type *get_ir_type(type_t *type)
670 assert(type != NULL);
672 type = skip_typeref(type);
674 if (type->base.firm_type != NULL) {
675 assert(type->base.firm_type != INVALID_TYPE);
676 return type->base.firm_type;
679 ir_type *firm_type = NULL;
680 switch (type->kind) {
682 firm_type = create_atomic_type(type->atomic.akind, type);
685 firm_type = create_complex_type(&type->atomic);
688 firm_type = create_imaginary_type(&type->atomic);
691 firm_type = create_method_type(&type->function, false);
694 firm_type = create_pointer_type(&type->pointer);
697 firm_type = create_reference_type(&type->reference);
700 firm_type = create_array_type(&type->array);
702 case TYPE_COMPOUND_STRUCT:
703 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_STRUCT);
705 case TYPE_COMPOUND_UNION:
706 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_UNION);
709 firm_type = create_enum_type(&type->enumt);
717 if (firm_type == NULL)
718 panic("unknown type found");
720 type->base.firm_type = firm_type;
724 static ir_mode *get_ir_mode_storage(type_t *type)
726 ir_type *irtype = get_ir_type(type);
728 /* firm doesn't report a mode for arrays somehow... */
729 if (is_Array_type(irtype)) {
733 ir_mode *mode = get_type_mode(irtype);
734 assert(mode != NULL);
739 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
740 * int that it returns bigger modes for floating point on some platforms
741 * (x87 internally does arithemtic with 80bits)
743 static ir_mode *get_ir_mode_arithmetic(type_t *type)
745 ir_mode *mode = get_ir_mode_storage(type);
746 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
747 return mode_float_arithmetic;
754 * Return a node representing the size of a type.
756 static ir_node *get_type_size_node(type_t *type)
759 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
760 type = skip_typeref(type);
762 if (is_type_array(type) && type->array.is_vla) {
763 ir_node *size_node = get_vla_size(&type->array);
764 ir_node *elem_size = get_type_size_node(type->array.element_type);
765 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
769 size = get_type_size(type);
770 return new_Const_long(mode, size);
773 /** Names of the runtime functions. */
774 static const struct {
775 int id; /**< the rts id */
776 int n_res; /**< number of return values */
777 const char *name; /**< the name of the rts function */
778 int n_params; /**< number of parameters */
779 unsigned flags; /**< language flags */
781 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
782 { rts_abort, 0, "abort", 0, _C89 },
783 { rts_alloca, 1, "alloca", 1, _ALL },
784 { rts_abs, 1, "abs", 1, _C89 },
785 { rts_labs, 1, "labs", 1, _C89 },
786 { rts_llabs, 1, "llabs", 1, _C99 },
787 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
789 { rts_fabs, 1, "fabs", 1, _C89 },
790 { rts_sqrt, 1, "sqrt", 1, _C89 },
791 { rts_cbrt, 1, "cbrt", 1, _C99 },
792 { rts_exp, 1, "exp", 1, _C89 },
793 { rts_exp2, 1, "exp2", 1, _C89 },
794 { rts_exp10, 1, "exp10", 1, _GNUC },
795 { rts_log, 1, "log", 1, _C89 },
796 { rts_log2, 1, "log2", 1, _C89 },
797 { rts_log10, 1, "log10", 1, _C89 },
798 { rts_pow, 1, "pow", 2, _C89 },
799 { rts_sin, 1, "sin", 1, _C89 },
800 { rts_cos, 1, "cos", 1, _C89 },
801 { rts_tan, 1, "tan", 1, _C89 },
802 { rts_asin, 1, "asin", 1, _C89 },
803 { rts_acos, 1, "acos", 1, _C89 },
804 { rts_atan, 1, "atan", 1, _C89 },
805 { rts_sinh, 1, "sinh", 1, _C89 },
806 { rts_cosh, 1, "cosh", 1, _C89 },
807 { rts_tanh, 1, "tanh", 1, _C89 },
809 { rts_fabsf, 1, "fabsf", 1, _C99 },
810 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
811 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
812 { rts_expf, 1, "expf", 1, _C99 },
813 { rts_exp2f, 1, "exp2f", 1, _C99 },
814 { rts_exp10f, 1, "exp10f", 1, _GNUC },
815 { rts_logf, 1, "logf", 1, _C99 },
816 { rts_log2f, 1, "log2f", 1, _C99 },
817 { rts_log10f, 1, "log10f", 1, _C99 },
818 { rts_powf, 1, "powf", 2, _C99 },
819 { rts_sinf, 1, "sinf", 1, _C99 },
820 { rts_cosf, 1, "cosf", 1, _C99 },
821 { rts_tanf, 1, "tanf", 1, _C99 },
822 { rts_asinf, 1, "asinf", 1, _C99 },
823 { rts_acosf, 1, "acosf", 1, _C99 },
824 { rts_atanf, 1, "atanf", 1, _C99 },
825 { rts_sinhf, 1, "sinhf", 1, _C99 },
826 { rts_coshf, 1, "coshf", 1, _C99 },
827 { rts_tanhf, 1, "tanhf", 1, _C99 },
829 { rts_fabsl, 1, "fabsl", 1, _C99 },
830 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
831 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
832 { rts_expl, 1, "expl", 1, _C99 },
833 { rts_exp2l, 1, "exp2l", 1, _C99 },
834 { rts_exp10l, 1, "exp10l", 1, _GNUC },
835 { rts_logl, 1, "logl", 1, _C99 },
836 { rts_log2l, 1, "log2l", 1, _C99 },
837 { rts_log10l, 1, "log10l", 1, _C99 },
838 { rts_powl, 1, "powl", 2, _C99 },
839 { rts_sinl, 1, "sinl", 1, _C99 },
840 { rts_cosl, 1, "cosl", 1, _C99 },
841 { rts_tanl, 1, "tanl", 1, _C99 },
842 { rts_asinl, 1, "asinl", 1, _C99 },
843 { rts_acosl, 1, "acosl", 1, _C99 },
844 { rts_atanl, 1, "atanl", 1, _C99 },
845 { rts_sinhl, 1, "sinhl", 1, _C99 },
846 { rts_coshl, 1, "coshl", 1, _C99 },
847 { rts_tanhl, 1, "tanhl", 1, _C99 },
849 { rts_strcmp, 1, "strcmp", 2, _C89 },
850 { rts_strncmp, 1, "strncmp", 3, _C89 },
851 { rts_strcpy, 1, "strcpy", 2, _C89 },
852 { rts_strlen, 1, "strlen", 1, _C89 },
853 { rts_memcpy, 1, "memcpy", 3, _C89 },
854 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
855 { rts_memmove, 1, "memmove", 3, _C89 },
856 { rts_memset, 1, "memset", 3, _C89 },
857 { rts_memcmp, 1, "memcmp", 3, _C89 },
860 static ident *rts_idents[lengthof(rts_data)];
862 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
864 void set_create_ld_ident(ident *(*func)(entity_t*))
866 create_ld_ident = func;
870 * Handle GNU attributes for entities
872 * @param ent the entity
873 * @param decl the routine declaration
875 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
877 assert(is_declaration(entity));
878 decl_modifiers_t modifiers = entity->declaration.modifiers;
880 if (is_method_entity(irentity)) {
881 if (modifiers & DM_PURE) {
882 set_entity_additional_properties(irentity, mtp_property_pure);
884 if (modifiers & DM_CONST) {
885 add_entity_additional_properties(irentity, mtp_property_const);
888 if (modifiers & DM_USED) {
889 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
891 if (modifiers & DM_WEAK) {
892 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
896 static bool is_main(entity_t *entity)
898 static symbol_t *sym_main = NULL;
899 if (sym_main == NULL) {
900 sym_main = symbol_table_insert("main");
903 if (entity->base.symbol != sym_main)
905 /* must be in outermost scope */
906 if (entity->base.parent_scope != ¤t_translation_unit->scope)
913 * Creates an entity representing a function.
915 * @param entity the function declaration/definition
916 * @param owner_type the owner type of this function, NULL
917 * for global functions
919 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
921 assert(entity->kind == ENTITY_FUNCTION);
922 if (entity->function.irentity != NULL)
923 return entity->function.irentity;
925 switch (entity->function.btk) {
928 case BUILTIN_LIBC_CHECK:
934 if (is_main(entity)) {
935 /* force main to C linkage */
936 type_t *type = entity->declaration.type;
937 assert(is_type_function(type));
938 if (type->function.linkage != LINKAGE_C) {
939 type_t *new_type = duplicate_type(type);
940 new_type->function.linkage = LINKAGE_C;
941 type = identify_new_type(new_type);
942 entity->declaration.type = type;
946 symbol_t *symbol = entity->base.symbol;
947 ident *id = new_id_from_str(symbol->string);
949 /* already an entity defined? */
950 ir_entity *irentity = entitymap_get(&entitymap, symbol);
951 bool const has_body = entity->function.statement != NULL;
952 if (irentity != NULL) {
953 if (get_entity_visibility(irentity) == ir_visibility_external
955 set_entity_visibility(irentity, ir_visibility_default);
960 ir_type *ir_type_method;
961 if (entity->function.need_closure)
962 ir_type_method = create_method_type(&entity->declaration.type->function, true);
964 ir_type_method = get_ir_type(entity->declaration.type);
966 bool nested_function = false;
967 if (owner_type == NULL)
968 owner_type = get_glob_type();
970 nested_function = true;
972 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
973 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
977 ld_id = id_unique("inner.%u");
979 ld_id = create_ld_ident(entity);
980 set_entity_ld_ident(irentity, ld_id);
982 handle_decl_modifiers(irentity, entity);
984 if (! nested_function) {
985 /* static inline => local
986 * extern inline => local
987 * inline without definition => local
988 * inline with definition => external_visible */
989 storage_class_tag_t const storage_class
990 = (storage_class_tag_t) entity->declaration.storage_class;
991 bool const is_inline = entity->function.is_inline;
993 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
994 set_entity_visibility(irentity, ir_visibility_default);
995 } else if (storage_class == STORAGE_CLASS_STATIC ||
996 (is_inline && has_body)) {
997 set_entity_visibility(irentity, ir_visibility_local);
998 } else if (has_body) {
999 set_entity_visibility(irentity, ir_visibility_default);
1001 set_entity_visibility(irentity, ir_visibility_external);
1004 /* nested functions are always local */
1005 set_entity_visibility(irentity, ir_visibility_local);
1008 /* We should check for file scope here, but as long as we compile C only
1009 this is not needed. */
1010 if (!freestanding && !has_body) {
1011 /* check for a known runtime function */
1012 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1013 if (id != rts_idents[i])
1016 function_type_t *function_type
1017 = &entity->declaration.type->function;
1018 /* rts_entities code can't handle a "wrong" number of parameters */
1019 if (function_type->unspecified_parameters)
1022 /* check number of parameters */
1023 int n_params = count_parameters(function_type);
1024 if (n_params != rts_data[i].n_params)
1027 type_t *return_type = skip_typeref(function_type->return_type);
1028 int n_res = is_type_void(return_type) ? 0 : 1;
1029 if (n_res != rts_data[i].n_res)
1032 /* ignore those rts functions not necessary needed for current mode */
1033 if ((c_mode & rts_data[i].flags) == 0)
1035 assert(rts_entities[rts_data[i].id] == NULL);
1036 rts_entities[rts_data[i].id] = irentity;
1040 entitymap_insert(&entitymap, symbol, irentity);
1043 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1044 entity->function.irentity = irentity;
1050 * Creates a SymConst for a given entity.
1052 * @param dbgi debug info
1053 * @param entity the entity
1055 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1057 assert(entity != NULL);
1058 union symconst_symbol sym;
1059 sym.entity_p = entity;
1060 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1063 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1065 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1068 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1071 if (is_Const(value)) {
1072 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1075 ir_node *cond = new_d_Cond(dbgi, value);
1076 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1077 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1078 ir_node *tblock = new_Block(1, &proj_true);
1079 ir_node *fblock = new_Block(1, &proj_false);
1080 set_cur_block(tblock);
1081 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1082 ir_node *tjump = new_Jmp();
1083 set_cur_block(fblock);
1084 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1085 ir_node *fjump = new_Jmp();
1087 ir_node *in[2] = { tjump, fjump };
1088 ir_node *mergeblock = new_Block(2, in);
1089 set_cur_block(mergeblock);
1090 ir_node *phi_in[2] = { const1, const0 };
1091 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1095 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1097 ir_mode *value_mode = get_irn_mode(value);
1099 if (value_mode == dest_mode)
1102 if (dest_mode == mode_b) {
1103 ir_node *zero = new_Const(get_mode_null(value_mode));
1104 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1106 } else if (value_mode == mode_b) {
1107 return create_conv_from_b(dbgi, value, dest_mode);
1110 return new_d_Conv(dbgi, value, dest_mode);
1114 * Creates a SymConst node representing a wide string literal.
1116 * @param literal the wide string literal
1118 static ir_node *wide_string_literal_to_firm(
1119 const string_literal_expression_t *literal)
1121 ir_type *const global_type = get_glob_type();
1122 ir_type *const elem_type = ir_type_wchar_t;
1123 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1124 ir_type *const type = new_type_array(1, elem_type);
1126 ident *const id = id_unique("str.%u");
1127 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1128 set_entity_ld_ident(entity, id);
1129 set_entity_visibility(entity, ir_visibility_private);
1130 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1132 ir_mode *const mode = get_type_mode(elem_type);
1133 const size_t slen = wstrlen(&literal->value);
1135 set_array_lower_bound_int(type, 0, 0);
1136 set_array_upper_bound_int(type, 0, slen);
1137 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1138 set_type_state(type, layout_fixed);
1140 ir_initializer_t *initializer = create_initializer_compound(slen);
1141 const char *p = literal->value.begin;
1142 for (size_t i = 0; i < slen; ++i) {
1143 assert(p < literal->value.begin + literal->value.size);
1144 utf32 v = read_utf8_char(&p);
1145 ir_tarval *tv = new_tarval_from_long(v, mode);
1146 ir_initializer_t *val = create_initializer_tarval(tv);
1147 set_initializer_compound_value(initializer, i, val);
1149 set_entity_initializer(entity, initializer);
1151 return create_symconst(dbgi, entity);
1155 * Creates a SymConst node representing a string constant.
1157 * @param src_pos the source position of the string constant
1158 * @param id_prefix a prefix for the name of the generated string constant
1159 * @param value the value of the string constant
1161 static ir_node *string_to_firm(const source_position_t *const src_pos,
1162 const char *const id_prefix,
1163 const string_t *const value)
1165 ir_type *const global_type = get_glob_type();
1166 dbg_info *const dbgi = get_dbg_info(src_pos);
1167 ir_type *const type = new_type_array(1, ir_type_const_char);
1169 ident *const id = id_unique(id_prefix);
1170 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1171 set_entity_ld_ident(entity, id);
1172 set_entity_visibility(entity, ir_visibility_private);
1173 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1175 ir_type *const elem_type = ir_type_const_char;
1176 ir_mode *const mode = get_type_mode(elem_type);
1178 const char* const string = value->begin;
1179 const size_t slen = value->size;
1181 set_array_lower_bound_int(type, 0, 0);
1182 set_array_upper_bound_int(type, 0, slen);
1183 set_type_size_bytes(type, slen);
1184 set_type_state(type, layout_fixed);
1186 ir_initializer_t *initializer = create_initializer_compound(slen);
1187 for (size_t i = 0; i < slen; ++i) {
1188 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1189 ir_initializer_t *val = create_initializer_tarval(tv);
1190 set_initializer_compound_value(initializer, i, val);
1192 set_entity_initializer(entity, initializer);
1194 return create_symconst(dbgi, entity);
1197 static bool try_create_integer(literal_expression_t *literal,
1198 type_t *type, unsigned char base)
1200 const char *string = literal->value.begin;
1201 size_t size = literal->value.size;
1203 assert(type->kind == TYPE_ATOMIC);
1204 atomic_type_kind_t akind = type->atomic.akind;
1206 ir_mode *mode = atomic_modes[akind];
1207 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1208 if (tv == tarval_bad)
1211 literal->base.type = type;
1212 literal->target_value = tv;
1216 static void create_integer_tarval(literal_expression_t *literal)
1220 const string_t *suffix = &literal->suffix;
1222 if (suffix->size > 0) {
1223 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1224 if (*c == 'u' || *c == 'U') { ++us; }
1225 if (*c == 'l' || *c == 'L') { ++ls; }
1230 switch (literal->base.kind) {
1231 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1232 case EXPR_LITERAL_INTEGER: base = 10; break;
1233 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1234 default: panic("invalid literal kind");
1237 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1239 /* now try if the constant is small enough for some types */
1240 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1242 if (us == 0 && try_create_integer(literal, type_int, base))
1244 if ((us == 1 || base != 10)
1245 && try_create_integer(literal, type_unsigned_int, base))
1249 if (us == 0 && try_create_integer(literal, type_long, base))
1251 if ((us == 1 || base != 10)
1252 && try_create_integer(literal, type_unsigned_long, base))
1255 /* last try? then we should not report tarval_bad */
1256 if (us != 1 && base == 10)
1257 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1258 if (us == 0 && try_create_integer(literal, type_long_long, base))
1262 assert(us == 1 || base != 10);
1263 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1264 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1266 panic("internal error when parsing number literal");
1269 tarval_set_integer_overflow_mode(old_mode);
1272 void determine_literal_type(literal_expression_t *literal)
1274 switch (literal->base.kind) {
1275 case EXPR_LITERAL_INTEGER:
1276 case EXPR_LITERAL_INTEGER_OCTAL:
1277 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1278 create_integer_tarval(literal);
1286 * Creates a Const node representing a constant.
1288 static ir_node *literal_to_firm(const literal_expression_t *literal)
1290 type_t *type = skip_typeref(literal->base.type);
1291 ir_mode *mode = get_ir_mode_storage(type);
1292 const char *string = literal->value.begin;
1293 size_t size = literal->value.size;
1296 switch (literal->base.kind) {
1297 case EXPR_LITERAL_WIDE_CHARACTER: {
1298 utf32 v = read_utf8_char(&string);
1300 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1302 tv = new_tarval_from_str(buf, len, mode);
1305 case EXPR_LITERAL_CHARACTER: {
1308 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1309 if (size == 1 && char_is_signed) {
1310 v = (signed char)string[0];
1313 for (size_t i = 0; i < size; ++i) {
1314 v = (v << 8) | ((unsigned char)string[i]);
1318 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1320 tv = new_tarval_from_str(buf, len, mode);
1323 case EXPR_LITERAL_INTEGER:
1324 case EXPR_LITERAL_INTEGER_OCTAL:
1325 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1326 assert(literal->target_value != NULL);
1327 tv = literal->target_value;
1329 case EXPR_LITERAL_FLOATINGPOINT:
1330 tv = new_tarval_from_str(string, size, mode);
1332 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1333 char buffer[size + 2];
1334 memcpy(buffer, "0x", 2);
1335 memcpy(buffer+2, string, size);
1336 tv = new_tarval_from_str(buffer, size+2, mode);
1339 case EXPR_LITERAL_BOOLEAN:
1340 if (string[0] == 't') {
1341 tv = get_mode_one(mode);
1343 assert(string[0] == 'f');
1344 tv = get_mode_null(mode);
1347 case EXPR_LITERAL_MS_NOOP:
1348 tv = get_mode_null(mode);
1353 panic("Invalid literal kind found");
1356 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1357 ir_node *res = new_d_Const(dbgi, tv);
1358 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1359 return create_conv(dbgi, res, mode_arith);
1363 * Allocate an area of size bytes aligned at alignment
1366 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1368 static unsigned area_cnt = 0;
1371 ir_type *tp = new_type_array(1, ir_type_char);
1372 set_array_bounds_int(tp, 0, 0, size);
1373 set_type_alignment_bytes(tp, alignment);
1375 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1376 ident *name = new_id_from_str(buf);
1377 ir_entity *area = new_entity(frame_type, name, tp);
1379 /* mark this entity as compiler generated */
1380 set_entity_compiler_generated(area, 1);
1385 * Return a node representing a trampoline region
1386 * for a given function entity.
1388 * @param dbgi debug info
1389 * @param entity the function entity
1391 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1393 ir_entity *region = NULL;
1396 if (current_trampolines != NULL) {
1397 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1398 if (current_trampolines[i].function == entity) {
1399 region = current_trampolines[i].region;
1404 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1406 ir_graph *irg = current_ir_graph;
1407 if (region == NULL) {
1408 /* create a new region */
1409 ir_type *frame_tp = get_irg_frame_type(irg);
1410 trampoline_region reg;
1411 reg.function = entity;
1413 reg.region = alloc_trampoline(frame_tp,
1414 be_params->trampoline_size,
1415 be_params->trampoline_align);
1416 ARR_APP1(trampoline_region, current_trampolines, reg);
1417 region = reg.region;
1419 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1424 * Creates a trampoline for a function represented by an entity.
1426 * @param dbgi debug info
1427 * @param mode the (reference) mode for the function address
1428 * @param entity the function entity
1430 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1433 assert(entity != NULL);
1435 in[0] = get_trampoline_region(dbgi, entity);
1436 in[1] = create_symconst(dbgi, entity);
1437 in[2] = get_irg_frame(current_ir_graph);
1439 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1440 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1441 return new_Proj(irn, mode, pn_Builtin_max+1);
1445 * Dereference an address.
1447 * @param dbgi debug info
1448 * @param type the type of the dereferenced result (the points_to type)
1449 * @param addr the address to dereference
1451 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1452 ir_node *const addr)
1454 type_t *skipped = skip_typeref(type);
1455 if (is_type_incomplete(skipped))
1458 ir_type *irtype = get_ir_type(skipped);
1459 if (is_compound_type(irtype)
1460 || is_Method_type(irtype)
1461 || is_Array_type(irtype)) {
1465 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1466 ? cons_volatile : cons_none;
1467 ir_mode *const mode = get_type_mode(irtype);
1468 ir_node *const memory = get_store();
1469 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1470 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1471 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1473 set_store(load_mem);
1475 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1476 return create_conv(dbgi, load_res, mode_arithmetic);
1480 * Creates a strict Conv (to the node's mode) if necessary.
1482 * @param dbgi debug info
1483 * @param node the node to strict conv
1485 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1487 ir_mode *mode = get_irn_mode(node);
1489 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1491 if (!mode_is_float(mode))
1494 /* check if there is already a Conv */
1495 if (is_Conv(node)) {
1496 /* convert it into a strict Conv */
1497 set_Conv_strict(node, 1);
1501 /* otherwise create a new one */
1502 return new_d_strictConv(dbgi, node, mode);
1506 * Returns the correct base address depending on whether it is a parameter or a
1507 * normal local variable.
1509 static ir_node *get_local_frame(ir_entity *const ent)
1511 ir_graph *const irg = current_ir_graph;
1512 const ir_type *const owner = get_entity_owner(ent);
1513 if (owner == current_outer_frame) {
1514 assert(current_static_link != NULL);
1515 return current_static_link;
1517 return get_irg_frame(irg);
1522 * Keep all memory edges of the given block.
1524 static void keep_all_memory(ir_node *block)
1526 ir_node *old = get_cur_block();
1528 set_cur_block(block);
1529 keep_alive(get_store());
1530 /* TODO: keep all memory edges from restricted pointers */
1534 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1536 entity_t *entity = ref->entity;
1537 if (entity->enum_value.tv == NULL) {
1538 type_t *type = skip_typeref(entity->enum_value.enum_type);
1539 assert(type->kind == TYPE_ENUM);
1540 determine_enum_values(&type->enumt);
1543 return new_Const(entity->enum_value.tv);
1546 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1548 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1549 entity_t *entity = ref->entity;
1550 assert(is_declaration(entity));
1551 type_t *type = skip_typeref(entity->declaration.type);
1553 /* make sure the type is constructed */
1554 (void) get_ir_type(type);
1556 if (entity->kind == ENTITY_FUNCTION
1557 && entity->function.btk != BUILTIN_NONE) {
1558 ir_entity *irentity = get_function_entity(entity, NULL);
1559 /* for gcc compatibility we have to produce (dummy) addresses for some
1560 * builtins which don't have entities */
1561 if (irentity == NULL) {
1562 source_position_t const *const pos = &ref->base.source_position;
1563 symbol_t const *const sym = ref->entity->base.symbol;
1564 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1566 /* simply create a NULL pointer */
1567 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1568 ir_node *res = new_Const(get_mode_null(mode));
1574 switch ((declaration_kind_t) entity->declaration.kind) {
1575 case DECLARATION_KIND_UNKNOWN:
1578 case DECLARATION_KIND_LOCAL_VARIABLE: {
1579 ir_mode *const mode = get_ir_mode_storage(type);
1580 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1581 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1583 case DECLARATION_KIND_PARAMETER: {
1584 ir_mode *const mode = get_ir_mode_storage(type);
1585 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1586 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1588 case DECLARATION_KIND_FUNCTION: {
1589 return create_symconst(dbgi, entity->function.irentity);
1591 case DECLARATION_KIND_INNER_FUNCTION: {
1592 ir_mode *const mode = get_ir_mode_storage(type);
1593 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1594 /* inner function not using the closure */
1595 return create_symconst(dbgi, entity->function.irentity);
1597 /* need trampoline here */
1598 return create_trampoline(dbgi, mode, entity->function.irentity);
1601 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1602 const variable_t *variable = &entity->variable;
1603 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1604 return deref_address(dbgi, variable->base.type, addr);
1607 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1608 ir_entity *irentity = entity->variable.v.entity;
1609 ir_node *frame = get_local_frame(irentity);
1610 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1611 return deref_address(dbgi, entity->declaration.type, sel);
1613 case DECLARATION_KIND_PARAMETER_ENTITY: {
1614 ir_entity *irentity = entity->parameter.v.entity;
1615 ir_node *frame = get_local_frame(irentity);
1616 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1617 return deref_address(dbgi, entity->declaration.type, sel);
1620 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1621 return entity->variable.v.vla_base;
1623 case DECLARATION_KIND_COMPOUND_MEMBER:
1624 panic("not implemented reference type");
1627 panic("reference to declaration with unknown type found");
1630 static ir_node *reference_addr(const reference_expression_t *ref)
1632 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1633 entity_t *entity = ref->entity;
1634 assert(is_declaration(entity));
1636 switch((declaration_kind_t) entity->declaration.kind) {
1637 case DECLARATION_KIND_UNKNOWN:
1639 case DECLARATION_KIND_PARAMETER:
1640 case DECLARATION_KIND_LOCAL_VARIABLE:
1641 /* you can store to a local variable (so we don't panic but return NULL
1642 * as an indicator for no real address) */
1644 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1645 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1648 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1649 ir_entity *irentity = entity->variable.v.entity;
1650 ir_node *frame = get_local_frame(irentity);
1651 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1655 case DECLARATION_KIND_PARAMETER_ENTITY: {
1656 ir_entity *irentity = entity->parameter.v.entity;
1657 ir_node *frame = get_local_frame(irentity);
1658 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1663 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1664 return entity->variable.v.vla_base;
1666 case DECLARATION_KIND_FUNCTION: {
1667 return create_symconst(dbgi, entity->function.irentity);
1670 case DECLARATION_KIND_INNER_FUNCTION: {
1671 type_t *const type = skip_typeref(entity->declaration.type);
1672 ir_mode *const mode = get_ir_mode_storage(type);
1673 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1674 /* inner function not using the closure */
1675 return create_symconst(dbgi, entity->function.irentity);
1677 /* need trampoline here */
1678 return create_trampoline(dbgi, mode, entity->function.irentity);
1682 case DECLARATION_KIND_COMPOUND_MEMBER:
1683 panic("not implemented reference type");
1686 panic("reference to declaration with unknown type found");
1690 * Transform calls to builtin functions.
1692 static ir_node *process_builtin_call(const call_expression_t *call)
1694 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1696 assert(call->function->kind == EXPR_REFERENCE);
1697 reference_expression_t *builtin = &call->function->reference;
1699 type_t *expr_type = skip_typeref(builtin->base.type);
1700 assert(is_type_pointer(expr_type));
1702 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1704 switch (builtin->entity->function.btk) {
1707 case BUILTIN_ALLOCA: {
1708 expression_t *argument = call->arguments->expression;
1709 ir_node *size = expression_to_firm(argument);
1711 ir_node *store = get_store();
1712 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1714 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1716 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1721 type_t *type = function_type->function.return_type;
1722 ir_mode *mode = get_ir_mode_arithmetic(type);
1723 ir_tarval *tv = get_mode_infinite(mode);
1724 ir_node *res = new_d_Const(dbgi, tv);
1728 /* Ignore string for now... */
1729 assert(is_type_function(function_type));
1730 type_t *type = function_type->function.return_type;
1731 ir_mode *mode = get_ir_mode_arithmetic(type);
1732 ir_tarval *tv = get_mode_NAN(mode);
1733 ir_node *res = new_d_Const(dbgi, tv);
1736 case BUILTIN_EXPECT: {
1737 expression_t *argument = call->arguments->expression;
1738 return _expression_to_firm(argument);
1740 case BUILTIN_VA_END:
1741 /* evaluate the argument of va_end for its side effects */
1742 _expression_to_firm(call->arguments->expression);
1744 case BUILTIN_OBJECT_SIZE: {
1745 /* determine value of "type" */
1746 expression_t *type_expression = call->arguments->next->expression;
1747 long type_val = fold_constant_to_int(type_expression);
1748 type_t *type = function_type->function.return_type;
1749 ir_mode *mode = get_ir_mode_arithmetic(type);
1750 /* just produce a "I don't know" result */
1751 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1752 get_mode_minus_one(mode);
1754 return new_d_Const(dbgi, result);
1756 case BUILTIN_ROTL: {
1757 ir_node *val = expression_to_firm(call->arguments->expression);
1758 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1759 ir_mode *mode = get_irn_mode(val);
1760 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1761 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1763 case BUILTIN_ROTR: {
1764 ir_node *val = expression_to_firm(call->arguments->expression);
1765 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1766 ir_mode *mode = get_irn_mode(val);
1767 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1768 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1769 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1770 return new_d_Rotl(dbgi, val, sub, mode);
1775 case BUILTIN_LIBC_CHECK:
1776 panic("builtin did not produce an entity");
1778 panic("invalid builtin found");
1782 * Transform a call expression.
1783 * Handles some special cases, like alloca() calls, which must be resolved
1784 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1785 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1788 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1790 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1791 assert(currently_reachable());
1793 expression_t *function = call->function;
1794 ir_node *callee = NULL;
1795 bool firm_builtin = false;
1796 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1797 if (function->kind == EXPR_REFERENCE) {
1798 const reference_expression_t *ref = &function->reference;
1799 entity_t *entity = ref->entity;
1801 if (entity->kind == ENTITY_FUNCTION) {
1802 builtin_kind_t builtin = entity->function.btk;
1803 if (builtin == BUILTIN_FIRM) {
1804 firm_builtin = true;
1805 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1806 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1807 && builtin != BUILTIN_LIBC_CHECK) {
1808 return process_builtin_call(call);
1813 callee = expression_to_firm(function);
1815 type_t *type = skip_typeref(function->base.type);
1816 assert(is_type_pointer(type));
1817 pointer_type_t *pointer_type = &type->pointer;
1818 type_t *points_to = skip_typeref(pointer_type->points_to);
1819 assert(is_type_function(points_to));
1820 function_type_t *function_type = &points_to->function;
1822 int n_parameters = 0;
1823 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1824 ir_type *new_method_type = NULL;
1825 if (function_type->variadic || function_type->unspecified_parameters) {
1826 const call_argument_t *argument = call->arguments;
1827 for ( ; argument != NULL; argument = argument->next) {
1831 /* we need to construct a new method type matching the call
1833 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1834 int n_res = get_method_n_ress(ir_method_type);
1835 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1836 set_method_calling_convention(new_method_type,
1837 get_method_calling_convention(ir_method_type));
1838 set_method_additional_properties(new_method_type,
1839 get_method_additional_properties(ir_method_type));
1840 set_method_variadicity(new_method_type,
1841 get_method_variadicity(ir_method_type));
1843 for (int i = 0; i < n_res; ++i) {
1844 set_method_res_type(new_method_type, i,
1845 get_method_res_type(ir_method_type, i));
1847 argument = call->arguments;
1848 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1849 expression_t *expression = argument->expression;
1850 ir_type *irtype = get_ir_type(expression->base.type);
1851 set_method_param_type(new_method_type, i, irtype);
1853 ir_method_type = new_method_type;
1855 n_parameters = get_method_n_params(ir_method_type);
1858 ir_node *in[n_parameters];
1860 const call_argument_t *argument = call->arguments;
1861 for (int n = 0; n < n_parameters; ++n) {
1862 expression_t *expression = argument->expression;
1863 ir_node *arg_node = expression_to_firm(expression);
1865 type_t *arg_type = skip_typeref(expression->base.type);
1866 if (!is_type_compound(arg_type)) {
1867 ir_mode *mode = get_ir_mode_storage(expression->base.type);
1868 arg_node = create_conv(dbgi, arg_node, mode);
1869 arg_node = do_strict_conv(dbgi, arg_node);
1874 argument = argument->next;
1878 if (function_type->modifiers & DM_CONST) {
1879 store = get_irg_no_mem(current_ir_graph);
1881 store = get_store();
1885 type_t *return_type = skip_typeref(function_type->return_type);
1886 ir_node *result = NULL;
1888 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1890 if (! (function_type->modifiers & DM_CONST)) {
1891 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1895 if (!is_type_void(return_type)) {
1896 assert(is_type_scalar(return_type));
1897 ir_mode *mode = get_ir_mode_storage(return_type);
1898 result = new_Proj(node, mode, pn_Builtin_max+1);
1899 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1900 result = create_conv(NULL, result, mode_arith);
1903 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1904 if (! (function_type->modifiers & DM_CONST)) {
1905 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1909 if (!is_type_void(return_type)) {
1910 ir_node *resproj = new_Proj(node, mode_T, pn_Call_T_result);
1912 if (is_type_scalar(return_type)) {
1913 ir_mode *mode = get_ir_mode_storage(return_type);
1914 result = new_Proj(resproj, mode, 0);
1915 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1916 result = create_conv(NULL, result, mode_arith);
1918 ir_mode *mode = mode_P_data;
1919 result = new_Proj(resproj, mode, 0);
1924 if (function_type->modifiers & DM_NORETURN) {
1925 /* A dead end: Keep the Call and the Block. Also place all further
1926 * nodes into a new and unreachable block. */
1928 keep_alive(get_cur_block());
1929 ir_node *block = new_Block(0, NULL);
1930 set_cur_block(block);
1936 static ir_node *statement_to_firm(statement_t *statement);
1937 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1939 static ir_node *expression_to_addr(const expression_t *expression);
1940 static ir_node *create_condition_evaluation(const expression_t *expression,
1941 ir_node *true_block,
1942 ir_node *false_block);
1944 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1947 if (!is_type_compound(type)) {
1948 ir_mode *mode = get_ir_mode_storage(type);
1949 value = create_conv(dbgi, value, mode);
1950 value = do_strict_conv(dbgi, value);
1953 ir_node *memory = get_store();
1955 if (is_type_scalar(type)) {
1956 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1957 ? cons_volatile : cons_none;
1958 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1959 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1960 set_store(store_mem);
1962 ir_type *irtype = get_ir_type(type);
1963 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1964 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1965 set_store(copyb_mem);
1969 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1971 ir_tarval *all_one = get_mode_all_one(mode);
1972 int mode_size = get_mode_size_bits(mode);
1973 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1975 assert(offset >= 0);
1977 assert(offset + size <= mode_size);
1978 if (size == mode_size) {
1982 long shiftr = get_mode_size_bits(mode) - size;
1983 long shiftl = offset;
1984 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1985 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1986 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1987 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1992 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1993 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1996 ir_type *entity_type = get_entity_type(entity);
1997 ir_type *base_type = get_primitive_base_type(entity_type);
1998 ir_mode *mode = get_type_mode(base_type);
1999 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2001 value = create_conv(dbgi, value, mode);
2003 /* kill upper bits of value and shift to right position */
2004 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
2005 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
2006 unsigned base_bits = get_mode_size_bits(mode);
2007 unsigned shiftwidth = base_bits - bitsize;
2009 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
2010 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
2012 unsigned shrwidth = base_bits - bitsize - bitoffset;
2013 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
2014 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
2016 /* load current value */
2017 ir_node *mem = get_store();
2018 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2019 set_volatile ? cons_volatile : cons_none);
2020 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2021 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2022 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2023 ir_tarval *inv_mask = tarval_not(shift_mask);
2024 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2025 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2027 /* construct new value and store */
2028 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2029 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2030 set_volatile ? cons_volatile : cons_none);
2031 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2032 set_store(store_mem);
2038 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2039 if (mode_is_signed(mode)) {
2040 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2042 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2047 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2050 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2051 entity_t *entity = expression->compound_entry;
2052 type_t *base_type = entity->declaration.type;
2053 ir_mode *mode = get_ir_mode_storage(base_type);
2054 ir_node *mem = get_store();
2055 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2056 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2057 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2058 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2060 ir_mode *amode = mode;
2061 /* optimisation, since shifting in modes < machine_size is usually
2063 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2066 unsigned amode_size = get_mode_size_bits(amode);
2067 load_res = create_conv(dbgi, load_res, amode);
2069 set_store(load_mem);
2071 /* kill upper bits */
2072 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2073 unsigned bitoffset = entity->compound_member.bit_offset;
2074 unsigned bitsize = entity->compound_member.bit_size;
2075 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2076 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2077 ir_node *countl = new_d_Const(dbgi, tvl);
2078 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2080 unsigned shift_bitsr = bitoffset + shift_bitsl;
2081 assert(shift_bitsr <= amode_size);
2082 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2083 ir_node *countr = new_d_Const(dbgi, tvr);
2085 if (mode_is_signed(mode)) {
2086 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2088 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2091 type_t *type = expression->base.type;
2092 ir_mode *resmode = get_ir_mode_arithmetic(type);
2093 return create_conv(dbgi, shiftr, resmode);
2096 /* make sure the selected compound type is constructed */
2097 static void construct_select_compound(const select_expression_t *expression)
2099 type_t *type = skip_typeref(expression->compound->base.type);
2100 if (is_type_pointer(type)) {
2101 type = type->pointer.points_to;
2103 (void) get_ir_type(type);
2106 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2107 ir_node *value, ir_node *addr)
2109 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2110 type_t *type = skip_typeref(expression->base.type);
2112 if (!is_type_compound(type)) {
2113 ir_mode *mode = get_ir_mode_storage(type);
2114 value = create_conv(dbgi, value, mode);
2115 value = do_strict_conv(dbgi, value);
2118 if (expression->kind == EXPR_REFERENCE) {
2119 const reference_expression_t *ref = &expression->reference;
2121 entity_t *entity = ref->entity;
2122 assert(is_declaration(entity));
2123 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2124 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2125 set_value(entity->variable.v.value_number, value);
2127 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2128 set_value(entity->parameter.v.value_number, value);
2134 addr = expression_to_addr(expression);
2135 assert(addr != NULL);
2137 if (expression->kind == EXPR_SELECT) {
2138 const select_expression_t *select = &expression->select;
2140 construct_select_compound(select);
2142 entity_t *entity = select->compound_entry;
2143 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2144 if (entity->compound_member.bitfield) {
2145 ir_entity *irentity = entity->compound_member.entity;
2147 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2148 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2149 set_volatile, true);
2154 assign_value(dbgi, addr, type, value);
2158 static void set_value_for_expression(const expression_t *expression,
2161 set_value_for_expression_addr(expression, value, NULL);
2164 static ir_node *get_value_from_lvalue(const expression_t *expression,
2167 if (expression->kind == EXPR_REFERENCE) {
2168 const reference_expression_t *ref = &expression->reference;
2170 entity_t *entity = ref->entity;
2171 assert(entity->kind == ENTITY_VARIABLE
2172 || entity->kind == ENTITY_PARAMETER);
2173 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2175 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2176 value_number = entity->variable.v.value_number;
2177 assert(addr == NULL);
2178 type_t *type = skip_typeref(expression->base.type);
2179 ir_mode *mode = get_ir_mode_storage(type);
2180 ir_node *res = get_value(value_number, mode);
2181 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2182 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2183 value_number = entity->parameter.v.value_number;
2184 assert(addr == NULL);
2185 type_t *type = skip_typeref(expression->base.type);
2186 ir_mode *mode = get_ir_mode_storage(type);
2187 ir_node *res = get_value(value_number, mode);
2188 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2192 assert(addr != NULL);
2193 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2196 if (expression->kind == EXPR_SELECT &&
2197 expression->select.compound_entry->compound_member.bitfield) {
2198 construct_select_compound(&expression->select);
2199 value = bitfield_extract_to_firm(&expression->select, addr);
2201 value = deref_address(dbgi, expression->base.type, addr);
2208 static ir_node *create_incdec(const unary_expression_t *expression)
2210 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2211 const expression_t *value_expr = expression->value;
2212 ir_node *addr = expression_to_addr(value_expr);
2213 ir_node *value = get_value_from_lvalue(value_expr, addr);
2215 type_t *type = skip_typeref(expression->base.type);
2216 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2219 if (is_type_pointer(type)) {
2220 pointer_type_t *pointer_type = &type->pointer;
2221 offset = get_type_size_node(pointer_type->points_to);
2223 assert(is_type_arithmetic(type));
2224 offset = new_Const(get_mode_one(mode));
2228 ir_node *store_value;
2229 switch(expression->base.kind) {
2230 case EXPR_UNARY_POSTFIX_INCREMENT:
2232 store_value = new_d_Add(dbgi, value, offset, mode);
2234 case EXPR_UNARY_POSTFIX_DECREMENT:
2236 store_value = new_d_Sub(dbgi, value, offset, mode);
2238 case EXPR_UNARY_PREFIX_INCREMENT:
2239 result = new_d_Add(dbgi, value, offset, mode);
2240 store_value = result;
2242 case EXPR_UNARY_PREFIX_DECREMENT:
2243 result = new_d_Sub(dbgi, value, offset, mode);
2244 store_value = result;
2247 panic("no incdec expr in create_incdec");
2250 set_value_for_expression_addr(value_expr, store_value, addr);
2255 static bool is_local_variable(expression_t *expression)
2257 if (expression->kind != EXPR_REFERENCE)
2259 reference_expression_t *ref_expr = &expression->reference;
2260 entity_t *entity = ref_expr->entity;
2261 if (entity->kind != ENTITY_VARIABLE)
2263 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2264 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2267 static ir_relation get_relation(const expression_kind_t kind)
2270 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2271 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2272 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2273 case EXPR_BINARY_ISLESS:
2274 case EXPR_BINARY_LESS: return ir_relation_less;
2275 case EXPR_BINARY_ISLESSEQUAL:
2276 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2277 case EXPR_BINARY_ISGREATER:
2278 case EXPR_BINARY_GREATER: return ir_relation_greater;
2279 case EXPR_BINARY_ISGREATEREQUAL:
2280 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2281 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2286 panic("trying to get pn_Cmp from non-comparison binexpr type");
2290 * Handle the assume optimizer hint: check if a Confirm
2291 * node can be created.
2293 * @param dbi debug info
2294 * @param expr the IL assume expression
2296 * we support here only some simple cases:
2301 static ir_node *handle_assume_compare(dbg_info *dbi,
2302 const binary_expression_t *expression)
2304 expression_t *op1 = expression->left;
2305 expression_t *op2 = expression->right;
2306 entity_t *var2, *var = NULL;
2307 ir_node *res = NULL;
2308 ir_relation relation = get_relation(expression->base.kind);
2310 if (is_local_variable(op1) && is_local_variable(op2)) {
2311 var = op1->reference.entity;
2312 var2 = op2->reference.entity;
2314 type_t *const type = skip_typeref(var->declaration.type);
2315 ir_mode *const mode = get_ir_mode_storage(type);
2317 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2318 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2320 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2321 set_value(var2->variable.v.value_number, res);
2323 res = new_d_Confirm(dbi, irn1, irn2, relation);
2324 set_value(var->variable.v.value_number, res);
2329 expression_t *con = NULL;
2330 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2331 var = op1->reference.entity;
2333 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2334 relation = get_inversed_relation(relation);
2335 var = op2->reference.entity;
2340 type_t *const type = skip_typeref(var->declaration.type);
2341 ir_mode *const mode = get_ir_mode_storage(type);
2343 res = get_value(var->variable.v.value_number, mode);
2344 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2345 set_value(var->variable.v.value_number, res);
2351 * Handle the assume optimizer hint.
2353 * @param dbi debug info
2354 * @param expr the IL assume expression
2356 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2358 switch(expression->kind) {
2359 case EXPR_BINARY_EQUAL:
2360 case EXPR_BINARY_NOTEQUAL:
2361 case EXPR_BINARY_LESS:
2362 case EXPR_BINARY_LESSEQUAL:
2363 case EXPR_BINARY_GREATER:
2364 case EXPR_BINARY_GREATEREQUAL:
2365 return handle_assume_compare(dbi, &expression->binary);
2371 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2372 type_t *from_type, type_t *type)
2374 type = skip_typeref(type);
2375 if (is_type_void(type)) {
2376 /* make sure firm type is constructed */
2377 (void) get_ir_type(type);
2380 if (!is_type_scalar(type)) {
2381 /* make sure firm type is constructed */
2382 (void) get_ir_type(type);
2386 from_type = skip_typeref(from_type);
2387 ir_mode *mode = get_ir_mode_storage(type);
2388 /* check for conversion from / to __based types */
2389 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2390 const variable_t *from_var = from_type->pointer.base_variable;
2391 const variable_t *to_var = type->pointer.base_variable;
2392 if (from_var != to_var) {
2393 if (from_var != NULL) {
2394 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2395 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2396 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2398 if (to_var != NULL) {
2399 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2400 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2401 value_node = new_d_Sub(dbgi, value_node, base, mode);
2406 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2407 /* bool adjustments (we save a mode_Bu, but have to temporarily
2408 * convert to mode_b so we only get a 0/1 value */
2409 value_node = create_conv(dbgi, value_node, mode_b);
2412 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2413 ir_node *node = create_conv(dbgi, value_node, mode);
2414 node = do_strict_conv(dbgi, node);
2415 node = create_conv(dbgi, node, mode_arith);
2420 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2422 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2423 type_t *type = skip_typeref(expression->base.type);
2425 const expression_t *value = expression->value;
2427 switch(expression->base.kind) {
2428 case EXPR_UNARY_TAKE_ADDRESS:
2429 return expression_to_addr(value);
2431 case EXPR_UNARY_NEGATE: {
2432 ir_node *value_node = expression_to_firm(value);
2433 ir_mode *mode = get_ir_mode_arithmetic(type);
2434 return new_d_Minus(dbgi, value_node, mode);
2436 case EXPR_UNARY_PLUS:
2437 return expression_to_firm(value);
2438 case EXPR_UNARY_BITWISE_NEGATE: {
2439 ir_node *value_node = expression_to_firm(value);
2440 ir_mode *mode = get_ir_mode_arithmetic(type);
2441 return new_d_Not(dbgi, value_node, mode);
2443 case EXPR_UNARY_NOT: {
2444 ir_node *value_node = _expression_to_firm(value);
2445 value_node = create_conv(dbgi, value_node, mode_b);
2446 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2449 case EXPR_UNARY_DEREFERENCE: {
2450 ir_node *value_node = expression_to_firm(value);
2451 type_t *value_type = skip_typeref(value->base.type);
2452 assert(is_type_pointer(value_type));
2454 /* check for __based */
2455 const variable_t *const base_var = value_type->pointer.base_variable;
2456 if (base_var != NULL) {
2457 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2458 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2459 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2461 type_t *points_to = value_type->pointer.points_to;
2462 return deref_address(dbgi, points_to, value_node);
2464 case EXPR_UNARY_POSTFIX_INCREMENT:
2465 case EXPR_UNARY_POSTFIX_DECREMENT:
2466 case EXPR_UNARY_PREFIX_INCREMENT:
2467 case EXPR_UNARY_PREFIX_DECREMENT:
2468 return create_incdec(expression);
2469 case EXPR_UNARY_CAST: {
2470 ir_node *value_node = expression_to_firm(value);
2471 type_t *from_type = value->base.type;
2472 return create_cast(dbgi, value_node, from_type, type);
2474 case EXPR_UNARY_ASSUME:
2475 return handle_assume(dbgi, value);
2480 panic("invalid UNEXPR type found");
2484 * produces a 0/1 depending of the value of a mode_b node
2486 static ir_node *produce_condition_result(const expression_t *expression,
2487 ir_mode *mode, dbg_info *dbgi)
2489 ir_node *const one_block = new_immBlock();
2490 ir_node *const zero_block = new_immBlock();
2491 create_condition_evaluation(expression, one_block, zero_block);
2492 mature_immBlock(one_block);
2493 mature_immBlock(zero_block);
2495 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2496 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2497 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2498 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2499 set_cur_block(block);
2501 ir_node *const one = new_Const(get_mode_one(mode));
2502 ir_node *const zero = new_Const(get_mode_null(mode));
2503 ir_node *const in[2] = { one, zero };
2504 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2509 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2510 ir_node *value, type_t *type)
2512 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2513 assert(is_type_pointer(type));
2514 pointer_type_t *const pointer_type = &type->pointer;
2515 type_t *const points_to = skip_typeref(pointer_type->points_to);
2516 ir_node * elem_size = get_type_size_node(points_to);
2517 elem_size = create_conv(dbgi, elem_size, mode);
2518 value = create_conv(dbgi, value, mode);
2519 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2523 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2524 ir_node *left, ir_node *right)
2527 type_t *type_left = skip_typeref(expression->left->base.type);
2528 type_t *type_right = skip_typeref(expression->right->base.type);
2530 expression_kind_t kind = expression->base.kind;
2533 case EXPR_BINARY_SHIFTLEFT:
2534 case EXPR_BINARY_SHIFTRIGHT:
2535 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2536 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2537 mode = get_ir_mode_arithmetic(expression->base.type);
2538 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2541 case EXPR_BINARY_SUB:
2542 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2543 const pointer_type_t *const ptr_type = &type_left->pointer;
2545 mode = get_ir_mode_arithmetic(expression->base.type);
2546 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2547 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2548 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2549 ir_node *const no_mem = new_NoMem();
2550 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2551 mode, op_pin_state_floats);
2552 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2555 case EXPR_BINARY_SUB_ASSIGN:
2556 if (is_type_pointer(type_left)) {
2557 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2558 mode = get_ir_mode_arithmetic(type_left);
2563 case EXPR_BINARY_ADD:
2564 case EXPR_BINARY_ADD_ASSIGN:
2565 if (is_type_pointer(type_left)) {
2566 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2567 mode = get_ir_mode_arithmetic(type_left);
2569 } else if (is_type_pointer(type_right)) {
2570 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2571 mode = get_ir_mode_arithmetic(type_right);
2578 mode = get_ir_mode_arithmetic(type_right);
2579 left = create_conv(dbgi, left, mode);
2584 case EXPR_BINARY_ADD_ASSIGN:
2585 case EXPR_BINARY_ADD:
2586 return new_d_Add(dbgi, left, right, mode);
2587 case EXPR_BINARY_SUB_ASSIGN:
2588 case EXPR_BINARY_SUB:
2589 return new_d_Sub(dbgi, left, right, mode);
2590 case EXPR_BINARY_MUL_ASSIGN:
2591 case EXPR_BINARY_MUL:
2592 return new_d_Mul(dbgi, left, right, mode);
2593 case EXPR_BINARY_BITWISE_AND:
2594 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2595 return new_d_And(dbgi, left, right, mode);
2596 case EXPR_BINARY_BITWISE_OR:
2597 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2598 return new_d_Or(dbgi, left, right, mode);
2599 case EXPR_BINARY_BITWISE_XOR:
2600 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2601 return new_d_Eor(dbgi, left, right, mode);
2602 case EXPR_BINARY_SHIFTLEFT:
2603 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2604 return new_d_Shl(dbgi, left, right, mode);
2605 case EXPR_BINARY_SHIFTRIGHT:
2606 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2607 if (mode_is_signed(mode)) {
2608 return new_d_Shrs(dbgi, left, right, mode);
2610 return new_d_Shr(dbgi, left, right, mode);
2612 case EXPR_BINARY_DIV:
2613 case EXPR_BINARY_DIV_ASSIGN: {
2614 ir_node *pin = new_Pin(new_NoMem());
2615 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2616 op_pin_state_floats);
2617 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2620 case EXPR_BINARY_MOD:
2621 case EXPR_BINARY_MOD_ASSIGN: {
2622 ir_node *pin = new_Pin(new_NoMem());
2623 assert(!mode_is_float(mode));
2624 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2625 op_pin_state_floats);
2626 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2630 panic("unexpected expression kind");
2634 static ir_node *create_lazy_op(const binary_expression_t *expression)
2636 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2637 type_t *type = skip_typeref(expression->base.type);
2638 ir_mode *mode = get_ir_mode_arithmetic(type);
2640 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2641 bool val = fold_constant_to_bool(expression->left);
2642 expression_kind_t ekind = expression->base.kind;
2643 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2644 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2646 return new_Const(get_mode_null(mode));
2650 return new_Const(get_mode_one(mode));
2654 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2655 bool valr = fold_constant_to_bool(expression->right);
2656 return create_Const_from_bool(mode, valr);
2659 return produce_condition_result(expression->right, mode, dbgi);
2662 return produce_condition_result((const expression_t*) expression, mode,
2666 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2667 ir_node *right, ir_mode *mode);
2669 static ir_node *create_assign_binop(const binary_expression_t *expression)
2671 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2672 const expression_t *left_expr = expression->left;
2673 type_t *type = skip_typeref(left_expr->base.type);
2674 ir_node *right = expression_to_firm(expression->right);
2675 ir_node *left_addr = expression_to_addr(left_expr);
2676 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2677 ir_node *result = create_op(dbgi, expression, left, right);
2679 result = create_cast(dbgi, result, expression->right->base.type, type);
2680 result = do_strict_conv(dbgi, result);
2682 result = set_value_for_expression_addr(left_expr, result, left_addr);
2684 if (!is_type_compound(type)) {
2685 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2686 result = create_conv(dbgi, result, mode_arithmetic);
2691 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2693 expression_kind_t kind = expression->base.kind;
2696 case EXPR_BINARY_EQUAL:
2697 case EXPR_BINARY_NOTEQUAL:
2698 case EXPR_BINARY_LESS:
2699 case EXPR_BINARY_LESSEQUAL:
2700 case EXPR_BINARY_GREATER:
2701 case EXPR_BINARY_GREATEREQUAL:
2702 case EXPR_BINARY_ISGREATER:
2703 case EXPR_BINARY_ISGREATEREQUAL:
2704 case EXPR_BINARY_ISLESS:
2705 case EXPR_BINARY_ISLESSEQUAL:
2706 case EXPR_BINARY_ISLESSGREATER:
2707 case EXPR_BINARY_ISUNORDERED: {
2708 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2709 ir_node *left = expression_to_firm(expression->left);
2710 ir_node *right = expression_to_firm(expression->right);
2711 ir_relation relation = get_relation(kind);
2712 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2715 case EXPR_BINARY_ASSIGN: {
2716 ir_node *addr = expression_to_addr(expression->left);
2717 ir_node *right = expression_to_firm(expression->right);
2719 = set_value_for_expression_addr(expression->left, right, addr);
2721 type_t *type = skip_typeref(expression->base.type);
2722 if (!is_type_compound(type)) {
2723 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2724 res = create_conv(NULL, res, mode_arithmetic);
2728 case EXPR_BINARY_ADD:
2729 case EXPR_BINARY_SUB:
2730 case EXPR_BINARY_MUL:
2731 case EXPR_BINARY_DIV:
2732 case EXPR_BINARY_MOD:
2733 case EXPR_BINARY_BITWISE_AND:
2734 case EXPR_BINARY_BITWISE_OR:
2735 case EXPR_BINARY_BITWISE_XOR:
2736 case EXPR_BINARY_SHIFTLEFT:
2737 case EXPR_BINARY_SHIFTRIGHT:
2739 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2740 ir_node *left = expression_to_firm(expression->left);
2741 ir_node *right = expression_to_firm(expression->right);
2742 return create_op(dbgi, expression, left, right);
2744 case EXPR_BINARY_LOGICAL_AND:
2745 case EXPR_BINARY_LOGICAL_OR:
2746 return create_lazy_op(expression);
2747 case EXPR_BINARY_COMMA:
2748 /* create side effects of left side */
2749 (void) expression_to_firm(expression->left);
2750 return _expression_to_firm(expression->right);
2752 case EXPR_BINARY_ADD_ASSIGN:
2753 case EXPR_BINARY_SUB_ASSIGN:
2754 case EXPR_BINARY_MUL_ASSIGN:
2755 case EXPR_BINARY_MOD_ASSIGN:
2756 case EXPR_BINARY_DIV_ASSIGN:
2757 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2758 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2759 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2760 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2761 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2762 return create_assign_binop(expression);
2764 panic("TODO binexpr type");
2768 static ir_node *array_access_addr(const array_access_expression_t *expression)
2770 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2771 ir_node *base_addr = expression_to_firm(expression->array_ref);
2772 ir_node *offset = expression_to_firm(expression->index);
2773 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2774 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2775 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2780 static ir_node *array_access_to_firm(
2781 const array_access_expression_t *expression)
2783 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2784 ir_node *addr = array_access_addr(expression);
2785 type_t *type = revert_automatic_type_conversion(
2786 (const expression_t*) expression);
2787 type = skip_typeref(type);
2789 return deref_address(dbgi, type, addr);
2792 static long get_offsetof_offset(const offsetof_expression_t *expression)
2794 type_t *orig_type = expression->type;
2797 designator_t *designator = expression->designator;
2798 for ( ; designator != NULL; designator = designator->next) {
2799 type_t *type = skip_typeref(orig_type);
2800 /* be sure the type is constructed */
2801 (void) get_ir_type(type);
2803 if (designator->symbol != NULL) {
2804 assert(is_type_compound(type));
2805 symbol_t *symbol = designator->symbol;
2807 compound_t *compound = type->compound.compound;
2808 entity_t *iter = compound->members.entities;
2809 for ( ; iter != NULL; iter = iter->base.next) {
2810 if (iter->base.symbol == symbol) {
2814 assert(iter != NULL);
2816 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2817 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2818 offset += get_entity_offset(iter->compound_member.entity);
2820 orig_type = iter->declaration.type;
2822 expression_t *array_index = designator->array_index;
2823 assert(designator->array_index != NULL);
2824 assert(is_type_array(type));
2826 long index = fold_constant_to_int(array_index);
2827 ir_type *arr_type = get_ir_type(type);
2828 ir_type *elem_type = get_array_element_type(arr_type);
2829 long elem_size = get_type_size_bytes(elem_type);
2831 offset += index * elem_size;
2833 orig_type = type->array.element_type;
2840 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2842 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2843 long offset = get_offsetof_offset(expression);
2844 ir_tarval *tv = new_tarval_from_long(offset, mode);
2845 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2847 return new_d_Const(dbgi, tv);
2850 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2851 ir_entity *entity, type_t *type);
2852 static ir_initializer_t *create_ir_initializer(
2853 const initializer_t *initializer, type_t *type);
2855 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2856 initializer_t *initializer,
2859 /* create the ir_initializer */
2860 ir_graph *const old_current_ir_graph = current_ir_graph;
2861 current_ir_graph = get_const_code_irg();
2863 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2865 assert(current_ir_graph == get_const_code_irg());
2866 current_ir_graph = old_current_ir_graph;
2868 ident *const id = id_unique("initializer.%u");
2869 ir_type *const irtype = get_ir_type(type);
2870 ir_type *const global_type = get_glob_type();
2871 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2872 set_entity_ld_ident(entity, id);
2873 set_entity_visibility(entity, ir_visibility_private);
2874 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2875 set_entity_initializer(entity, irinitializer);
2879 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2881 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2882 type_t *type = expression->type;
2883 initializer_t *initializer = expression->initializer;
2885 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2886 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2887 return create_symconst(dbgi, entity);
2889 /* create an entity on the stack */
2890 ident *const id = id_unique("CompLit.%u");
2891 ir_type *const irtype = get_ir_type(type);
2892 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2894 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2895 set_entity_ld_ident(entity, id);
2897 /* create initialisation code */
2898 create_local_initializer(initializer, dbgi, entity, type);
2900 /* create a sel for the compound literal address */
2901 ir_node *frame = get_irg_frame(current_ir_graph);
2902 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2907 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2909 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2910 type_t *const type = expr->type;
2911 ir_node *const addr = compound_literal_addr(expr);
2912 return deref_address(dbgi, type, addr);
2916 * Transform a sizeof expression into Firm code.
2918 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2920 type_t *const type = skip_typeref(expression->type);
2921 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2922 if (is_type_array(type) && type->array.is_vla
2923 && expression->tp_expression != NULL) {
2924 expression_to_firm(expression->tp_expression);
2926 /* strange gnu extensions: sizeof(function) == 1 */
2927 if (is_type_function(type)) {
2928 ir_mode *mode = get_ir_mode_storage(type_size_t);
2929 return new_Const(get_mode_one(mode));
2932 return get_type_size_node(type);
2935 static entity_t *get_expression_entity(const expression_t *expression)
2937 if (expression->kind != EXPR_REFERENCE)
2940 return expression->reference.entity;
2943 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2945 switch(entity->kind) {
2946 case DECLARATION_KIND_CASES:
2947 return entity->declaration.alignment;
2950 return entity->compound.alignment;
2951 case ENTITY_TYPEDEF:
2952 return entity->typedefe.alignment;
2960 * Transform an alignof expression into Firm code.
2962 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2964 unsigned alignment = 0;
2966 const expression_t *tp_expression = expression->tp_expression;
2967 if (tp_expression != NULL) {
2968 entity_t *entity = get_expression_entity(tp_expression);
2969 if (entity != NULL) {
2970 if (entity->kind == ENTITY_FUNCTION) {
2971 /* a gnu-extension */
2974 alignment = get_cparser_entity_alignment(entity);
2979 if (alignment == 0) {
2980 type_t *type = expression->type;
2981 alignment = get_type_alignment(type);
2984 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2985 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2986 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2987 return new_d_Const(dbgi, tv);
2990 static void init_ir_types(void);
2992 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2994 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2996 bool constant_folding_old = constant_folding;
2997 constant_folding = true;
2998 int old_optimize = get_optimize();
2999 int old_constant_folding = get_opt_constant_folding();
3001 set_opt_constant_folding(1);
3005 ir_graph *old_current_ir_graph = current_ir_graph;
3006 current_ir_graph = get_const_code_irg();
3008 ir_node *cnst = expression_to_firm(expression);
3009 current_ir_graph = old_current_ir_graph;
3010 set_optimize(old_optimize);
3011 set_opt_constant_folding(old_constant_folding);
3013 if (!is_Const(cnst)) {
3014 panic("couldn't fold constant");
3017 constant_folding = constant_folding_old;
3019 return get_Const_tarval(cnst);
3022 /* this function is only used in parser.c, but it relies on libfirm functionality */
3023 bool constant_is_negative(const expression_t *expression)
3025 ir_tarval *tv = fold_constant_to_tarval(expression);
3026 return tarval_is_negative(tv);
3029 long fold_constant_to_int(const expression_t *expression)
3031 ir_tarval *tv = fold_constant_to_tarval(expression);
3032 if (!tarval_is_long(tv)) {
3033 panic("result of constant folding is not integer");
3036 return get_tarval_long(tv);
3039 bool fold_constant_to_bool(const expression_t *expression)
3041 ir_tarval *tv = fold_constant_to_tarval(expression);
3042 return !tarval_is_null(tv);
3045 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3047 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3049 /* first try to fold a constant condition */
3050 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3051 bool val = fold_constant_to_bool(expression->condition);
3053 expression_t *true_expression = expression->true_expression;
3054 if (true_expression == NULL)
3055 true_expression = expression->condition;
3056 return expression_to_firm(true_expression);
3058 return expression_to_firm(expression->false_expression);
3062 ir_node *const true_block = new_immBlock();
3063 ir_node *const false_block = new_immBlock();
3064 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3065 mature_immBlock(true_block);
3066 mature_immBlock(false_block);
3068 set_cur_block(true_block);
3070 if (expression->true_expression != NULL) {
3071 true_val = expression_to_firm(expression->true_expression);
3072 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3073 true_val = cond_expr;
3075 /* Condition ended with a short circuit (&&, ||, !) operation or a
3076 * comparison. Generate a "1" as value for the true branch. */
3077 true_val = new_Const(get_mode_one(mode_Is));
3079 ir_node *const true_jmp = new_d_Jmp(dbgi);
3081 set_cur_block(false_block);
3082 ir_node *const false_val = expression_to_firm(expression->false_expression);
3083 ir_node *const false_jmp = new_d_Jmp(dbgi);
3085 /* create the common block */
3086 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3087 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3088 set_cur_block(block);
3090 /* TODO improve static semantics, so either both or no values are NULL */
3091 if (true_val == NULL || false_val == NULL)
3094 ir_node *const in[2] = { true_val, false_val };
3095 type_t *const type = skip_typeref(expression->base.type);
3097 if (is_type_compound(type)) {
3100 mode = get_ir_mode_arithmetic(type);
3102 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3108 * Returns an IR-node representing the address of a field.
3110 static ir_node *select_addr(const select_expression_t *expression)
3112 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3114 construct_select_compound(expression);
3116 ir_node *compound_addr = expression_to_firm(expression->compound);
3118 entity_t *entry = expression->compound_entry;
3119 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3120 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3122 if (constant_folding) {
3123 ir_mode *mode = get_irn_mode(compound_addr);
3124 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3125 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3126 return new_d_Add(dbgi, compound_addr, ofs, mode);
3128 ir_entity *irentity = entry->compound_member.entity;
3129 assert(irentity != NULL);
3130 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3134 static ir_node *select_to_firm(const select_expression_t *expression)
3136 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3137 ir_node *addr = select_addr(expression);
3138 type_t *type = revert_automatic_type_conversion(
3139 (const expression_t*) expression);
3140 type = skip_typeref(type);
3142 entity_t *entry = expression->compound_entry;
3143 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3145 if (entry->compound_member.bitfield) {
3146 return bitfield_extract_to_firm(expression, addr);
3149 return deref_address(dbgi, type, addr);
3152 /* Values returned by __builtin_classify_type. */
3153 typedef enum gcc_type_class
3159 enumeral_type_class,
3162 reference_type_class,
3166 function_type_class,
3177 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3179 type_t *type = expr->type_expression->base.type;
3181 /* FIXME gcc returns different values depending on whether compiling C or C++
3182 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3185 type = skip_typeref(type);
3186 switch (type->kind) {
3188 const atomic_type_t *const atomic_type = &type->atomic;
3189 switch (atomic_type->akind) {
3190 /* should not be reached */
3191 case ATOMIC_TYPE_INVALID:
3195 /* gcc cannot do that */
3196 case ATOMIC_TYPE_VOID:
3197 tc = void_type_class;
3200 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3201 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3202 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3203 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3204 case ATOMIC_TYPE_SHORT:
3205 case ATOMIC_TYPE_USHORT:
3206 case ATOMIC_TYPE_INT:
3207 case ATOMIC_TYPE_UINT:
3208 case ATOMIC_TYPE_LONG:
3209 case ATOMIC_TYPE_ULONG:
3210 case ATOMIC_TYPE_LONGLONG:
3211 case ATOMIC_TYPE_ULONGLONG:
3212 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3213 tc = integer_type_class;
3216 case ATOMIC_TYPE_FLOAT:
3217 case ATOMIC_TYPE_DOUBLE:
3218 case ATOMIC_TYPE_LONG_DOUBLE:
3219 tc = real_type_class;
3222 panic("Unexpected atomic type in classify_type_to_firm().");
3225 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3226 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3227 case TYPE_ARRAY: /* gcc handles this as pointer */
3228 case TYPE_FUNCTION: /* gcc handles this as pointer */
3229 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3230 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3231 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3233 /* gcc handles this as integer */
3234 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3236 /* gcc classifies the referenced type */
3237 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3239 /* typedef/typeof should be skipped already */
3245 panic("unexpected TYPE classify_type_to_firm().");
3249 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3250 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3251 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3252 return new_d_Const(dbgi, tv);
3255 static ir_node *function_name_to_firm(
3256 const funcname_expression_t *const expr)
3258 switch(expr->kind) {
3259 case FUNCNAME_FUNCTION:
3260 case FUNCNAME_PRETTY_FUNCTION:
3261 case FUNCNAME_FUNCDNAME:
3262 if (current_function_name == NULL) {
3263 const source_position_t *const src_pos = &expr->base.source_position;
3264 const char *name = current_function_entity->base.symbol->string;
3265 const string_t string = { name, strlen(name) + 1 };
3266 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3268 return current_function_name;
3269 case FUNCNAME_FUNCSIG:
3270 if (current_funcsig == NULL) {
3271 const source_position_t *const src_pos = &expr->base.source_position;
3272 ir_entity *ent = get_irg_entity(current_ir_graph);
3273 const char *const name = get_entity_ld_name(ent);
3274 const string_t string = { name, strlen(name) + 1 };
3275 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3277 return current_funcsig;
3279 panic("Unsupported function name");
3282 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3284 statement_t *statement = expr->statement;
3286 assert(statement->kind == STATEMENT_COMPOUND);
3287 return compound_statement_to_firm(&statement->compound);
3290 static ir_node *va_start_expression_to_firm(
3291 const va_start_expression_t *const expr)
3293 ir_entity *param_ent = current_vararg_entity;
3294 if (param_ent == NULL) {
3295 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3296 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3297 ir_type *const param_type = get_unknown_type();
3298 param_ent = new_parameter_entity(frame_type, n, param_type);
3299 current_vararg_entity = param_ent;
3302 ir_node *const frame = get_irg_frame(current_ir_graph);
3303 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3304 ir_node *const no_mem = new_NoMem();
3305 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3307 set_value_for_expression(expr->ap, arg_sel);
3312 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3314 type_t *const type = expr->base.type;
3315 expression_t *const ap_expr = expr->ap;
3316 ir_node *const ap_addr = expression_to_addr(ap_expr);
3317 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3318 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3319 ir_node *const res = deref_address(dbgi, type, ap);
3321 ir_node *const cnst = get_type_size_node(expr->base.type);
3322 ir_mode *const mode = get_irn_mode(cnst);
3323 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3324 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3325 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3326 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3327 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3329 set_value_for_expression_addr(ap_expr, add, ap_addr);
3335 * Generate Firm for a va_copy expression.
3337 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3339 ir_node *const src = expression_to_firm(expr->src);
3340 set_value_for_expression(expr->dst, src);
3344 static ir_node *dereference_addr(const unary_expression_t *const expression)
3346 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3347 return expression_to_firm(expression->value);
3351 * Returns a IR-node representing an lvalue of the given expression.
3353 static ir_node *expression_to_addr(const expression_t *expression)
3355 switch(expression->kind) {
3356 case EXPR_ARRAY_ACCESS:
3357 return array_access_addr(&expression->array_access);
3359 return call_expression_to_firm(&expression->call);
3360 case EXPR_COMPOUND_LITERAL:
3361 return compound_literal_addr(&expression->compound_literal);
3362 case EXPR_REFERENCE:
3363 return reference_addr(&expression->reference);
3365 return select_addr(&expression->select);
3366 case EXPR_UNARY_DEREFERENCE:
3367 return dereference_addr(&expression->unary);
3371 panic("trying to get address of non-lvalue");
3374 static ir_node *builtin_constant_to_firm(
3375 const builtin_constant_expression_t *expression)
3377 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3378 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3379 return create_Const_from_bool(mode, v);
3382 static ir_node *builtin_types_compatible_to_firm(
3383 const builtin_types_compatible_expression_t *expression)
3385 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3386 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3387 bool const value = types_compatible(left, right);
3388 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3389 return create_Const_from_bool(mode, value);
3392 static ir_node *get_label_block(label_t *label)
3394 if (label->block != NULL)
3395 return label->block;
3397 /* beware: might be called from create initializer with current_ir_graph
3398 * set to const_code_irg. */
3399 ir_graph *rem = current_ir_graph;
3400 current_ir_graph = current_function;
3402 ir_node *block = new_immBlock();
3404 label->block = block;
3406 ARR_APP1(label_t *, all_labels, label);
3408 current_ir_graph = rem;
3413 * Pointer to a label. This is used for the
3414 * GNU address-of-label extension.
3416 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3418 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3419 ir_node *block = get_label_block(label->label);
3420 ir_entity *entity = create_Block_entity(block);
3422 symconst_symbol value;
3423 value.entity_p = entity;
3424 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3428 * creates firm nodes for an expression. The difference between this function
3429 * and expression_to_firm is, that this version might produce mode_b nodes
3430 * instead of mode_Is.
3432 static ir_node *_expression_to_firm(expression_t const *const expr)
3435 if (!constant_folding) {
3436 assert(!expr->base.transformed);
3437 ((expression_t*)expr)->base.transformed = true;
3441 switch (expr->kind) {
3442 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3443 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3444 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3445 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3446 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3447 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3448 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3449 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3450 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3451 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3452 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3453 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3454 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3455 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3456 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3457 case EXPR_SELECT: return select_to_firm( &expr->select);
3458 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3459 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3460 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3461 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3462 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3463 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3464 case EXPR_WIDE_STRING_LITERAL: return wide_string_literal_to_firm( &expr->string_literal);
3466 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", &expr->literal.value);
3468 case EXPR_ERROR: break;
3470 panic("invalid expression found");
3474 * Check if a given expression is a GNU __builtin_expect() call.
3476 static bool is_builtin_expect(const expression_t *expression)
3478 if (expression->kind != EXPR_CALL)
3481 expression_t *function = expression->call.function;
3482 if (function->kind != EXPR_REFERENCE)
3484 reference_expression_t *ref = &function->reference;
3485 if (ref->entity->kind != ENTITY_FUNCTION ||
3486 ref->entity->function.btk != BUILTIN_EXPECT)
3492 static bool produces_mode_b(const expression_t *expression)
3494 switch (expression->kind) {
3495 case EXPR_BINARY_EQUAL:
3496 case EXPR_BINARY_NOTEQUAL:
3497 case EXPR_BINARY_LESS:
3498 case EXPR_BINARY_LESSEQUAL:
3499 case EXPR_BINARY_GREATER:
3500 case EXPR_BINARY_GREATEREQUAL:
3501 case EXPR_BINARY_ISGREATER:
3502 case EXPR_BINARY_ISGREATEREQUAL:
3503 case EXPR_BINARY_ISLESS:
3504 case EXPR_BINARY_ISLESSEQUAL:
3505 case EXPR_BINARY_ISLESSGREATER:
3506 case EXPR_BINARY_ISUNORDERED:
3507 case EXPR_UNARY_NOT:
3511 if (is_builtin_expect(expression)) {
3512 expression_t *argument = expression->call.arguments->expression;
3513 return produces_mode_b(argument);
3516 case EXPR_BINARY_COMMA:
3517 return produces_mode_b(expression->binary.right);
3524 static ir_node *expression_to_firm(const expression_t *expression)
3526 if (!produces_mode_b(expression)) {
3527 ir_node *res = _expression_to_firm(expression);
3528 assert(res == NULL || get_irn_mode(res) != mode_b);
3532 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3533 bool const constant_folding_old = constant_folding;
3534 constant_folding = true;
3535 ir_node *res = _expression_to_firm(expression);
3536 constant_folding = constant_folding_old;
3537 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3538 assert(is_Const(res));
3539 return create_Const_from_bool(mode, !is_Const_null(res));
3542 /* we have to produce a 0/1 from the mode_b expression */
3543 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3544 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3545 return produce_condition_result(expression, mode, dbgi);
3549 * create a short-circuit expression evaluation that tries to construct
3550 * efficient control flow structures for &&, || and ! expressions
3552 static ir_node *create_condition_evaluation(const expression_t *expression,
3553 ir_node *true_block,
3554 ir_node *false_block)
3556 switch(expression->kind) {
3557 case EXPR_UNARY_NOT: {
3558 const unary_expression_t *unary_expression = &expression->unary;
3559 create_condition_evaluation(unary_expression->value, false_block,
3563 case EXPR_BINARY_LOGICAL_AND: {
3564 const binary_expression_t *binary_expression = &expression->binary;
3566 ir_node *extra_block = new_immBlock();
3567 create_condition_evaluation(binary_expression->left, extra_block,
3569 mature_immBlock(extra_block);
3570 set_cur_block(extra_block);
3571 create_condition_evaluation(binary_expression->right, true_block,
3575 case EXPR_BINARY_LOGICAL_OR: {
3576 const binary_expression_t *binary_expression = &expression->binary;
3578 ir_node *extra_block = new_immBlock();
3579 create_condition_evaluation(binary_expression->left, true_block,
3581 mature_immBlock(extra_block);
3582 set_cur_block(extra_block);
3583 create_condition_evaluation(binary_expression->right, true_block,
3591 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3592 ir_node *cond_expr = _expression_to_firm(expression);
3593 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3594 ir_node *cond = new_d_Cond(dbgi, condition);
3595 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3596 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3598 /* set branch prediction info based on __builtin_expect */
3599 if (is_builtin_expect(expression) && is_Cond(cond)) {
3600 call_argument_t *argument = expression->call.arguments->next;
3601 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3602 bool const cnst = fold_constant_to_bool(argument->expression);
3603 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3604 set_Cond_jmp_pred(cond, pred);
3608 add_immBlock_pred(true_block, true_proj);
3609 add_immBlock_pred(false_block, false_proj);
3611 set_unreachable_now();
3615 static void create_variable_entity(entity_t *variable,
3616 declaration_kind_t declaration_kind,
3617 ir_type *parent_type)
3619 assert(variable->kind == ENTITY_VARIABLE);
3620 type_t *type = skip_typeref(variable->declaration.type);
3622 ident *const id = new_id_from_str(variable->base.symbol->string);
3623 ir_type *const irtype = get_ir_type(type);
3624 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3625 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3626 unsigned alignment = variable->declaration.alignment;
3628 set_entity_alignment(irentity, alignment);
3630 handle_decl_modifiers(irentity, variable);
3632 variable->declaration.kind = (unsigned char) declaration_kind;
3633 variable->variable.v.entity = irentity;
3634 set_entity_ld_ident(irentity, create_ld_ident(variable));
3636 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3637 set_entity_volatility(irentity, volatility_is_volatile);
3642 typedef struct type_path_entry_t type_path_entry_t;
3643 struct type_path_entry_t {
3645 ir_initializer_t *initializer;
3647 entity_t *compound_entry;
3650 typedef struct type_path_t type_path_t;
3651 struct type_path_t {
3652 type_path_entry_t *path;
3657 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3659 size_t len = ARR_LEN(path->path);
3661 for (size_t i = 0; i < len; ++i) {
3662 const type_path_entry_t *entry = & path->path[i];
3664 type_t *type = skip_typeref(entry->type);
3665 if (is_type_compound(type)) {
3666 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3667 } else if (is_type_array(type)) {
3668 fprintf(stderr, "[%u]", (unsigned) entry->index);
3670 fprintf(stderr, "-INVALID-");
3673 fprintf(stderr, " (");
3674 print_type(path->top_type);
3675 fprintf(stderr, ")");
3678 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3680 size_t len = ARR_LEN(path->path);
3682 return & path->path[len-1];
3685 static type_path_entry_t *append_to_type_path(type_path_t *path)
3687 size_t len = ARR_LEN(path->path);
3688 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3690 type_path_entry_t *result = & path->path[len];
3691 memset(result, 0, sizeof(result[0]));
3695 static size_t get_compound_member_count(const compound_type_t *type)
3697 compound_t *compound = type->compound;
3698 size_t n_members = 0;
3699 entity_t *member = compound->members.entities;
3700 for ( ; member != NULL; member = member->base.next) {
3707 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3709 type_t *orig_top_type = path->top_type;
3710 type_t *top_type = skip_typeref(orig_top_type);
3712 assert(is_type_compound(top_type) || is_type_array(top_type));
3714 if (ARR_LEN(path->path) == 0) {
3717 type_path_entry_t *top = get_type_path_top(path);
3718 ir_initializer_t *initializer = top->initializer;
3719 return get_initializer_compound_value(initializer, top->index);
3723 static void descend_into_subtype(type_path_t *path)
3725 type_t *orig_top_type = path->top_type;
3726 type_t *top_type = skip_typeref(orig_top_type);
3728 assert(is_type_compound(top_type) || is_type_array(top_type));
3730 ir_initializer_t *initializer = get_initializer_entry(path);
3732 type_path_entry_t *top = append_to_type_path(path);
3733 top->type = top_type;
3737 if (is_type_compound(top_type)) {
3738 compound_t *const compound = top_type->compound.compound;
3739 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3741 top->compound_entry = entry;
3743 len = get_compound_member_count(&top_type->compound);
3744 if (entry != NULL) {
3745 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3746 path->top_type = entry->declaration.type;
3749 assert(is_type_array(top_type));
3750 assert(top_type->array.size > 0);
3753 path->top_type = top_type->array.element_type;
3754 len = top_type->array.size;
3756 if (initializer == NULL
3757 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3758 initializer = create_initializer_compound(len);
3759 /* we have to set the entry at the 2nd latest path entry... */
3760 size_t path_len = ARR_LEN(path->path);
3761 assert(path_len >= 1);
3763 type_path_entry_t *entry = & path->path[path_len-2];
3764 ir_initializer_t *tinitializer = entry->initializer;
3765 set_initializer_compound_value(tinitializer, entry->index,
3769 top->initializer = initializer;
3772 static void ascend_from_subtype(type_path_t *path)
3774 type_path_entry_t *top = get_type_path_top(path);
3776 path->top_type = top->type;
3778 size_t len = ARR_LEN(path->path);
3779 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3782 static void walk_designator(type_path_t *path, const designator_t *designator)
3784 /* designators start at current object type */
3785 ARR_RESIZE(type_path_entry_t, path->path, 1);
3787 for ( ; designator != NULL; designator = designator->next) {
3788 type_path_entry_t *top = get_type_path_top(path);
3789 type_t *orig_type = top->type;
3790 type_t *type = skip_typeref(orig_type);
3792 if (designator->symbol != NULL) {
3793 assert(is_type_compound(type));
3795 symbol_t *symbol = designator->symbol;
3797 compound_t *compound = type->compound.compound;
3798 entity_t *iter = compound->members.entities;
3799 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3800 if (iter->base.symbol == symbol) {
3801 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3805 assert(iter != NULL);
3807 /* revert previous initialisations of other union elements */
3808 if (type->kind == TYPE_COMPOUND_UNION) {
3809 ir_initializer_t *initializer = top->initializer;
3810 if (initializer != NULL
3811 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3812 /* are we writing to a new element? */
3813 ir_initializer_t *oldi
3814 = get_initializer_compound_value(initializer, index);
3815 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3816 /* clear initializer */
3818 = get_initializer_compound_n_entries(initializer);
3819 ir_initializer_t *nulli = get_initializer_null();
3820 for (size_t i = 0; i < len; ++i) {
3821 set_initializer_compound_value(initializer, i,
3828 top->type = orig_type;
3829 top->compound_entry = iter;
3831 orig_type = iter->declaration.type;
3833 expression_t *array_index = designator->array_index;
3834 assert(designator->array_index != NULL);
3835 assert(is_type_array(type));
3837 long index = fold_constant_to_int(array_index);
3840 if (type->array.size_constant) {
3841 long array_size = type->array.size;
3842 assert(index < array_size);
3846 top->type = orig_type;
3847 top->index = (size_t) index;
3848 orig_type = type->array.element_type;
3850 path->top_type = orig_type;
3852 if (designator->next != NULL) {
3853 descend_into_subtype(path);
3857 path->invalid = false;
3860 static void advance_current_object(type_path_t *path)
3862 if (path->invalid) {
3863 /* TODO: handle this... */
3864 panic("invalid initializer in ast2firm (excessive elements)");
3867 type_path_entry_t *top = get_type_path_top(path);
3869 type_t *type = skip_typeref(top->type);
3870 if (is_type_union(type)) {
3871 /* only the first element is initialized in unions */
3872 top->compound_entry = NULL;
3873 } else if (is_type_struct(type)) {
3874 entity_t *entry = top->compound_entry;
3877 entry = skip_unnamed_bitfields(entry->base.next);
3878 top->compound_entry = entry;
3879 if (entry != NULL) {
3880 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3881 path->top_type = entry->declaration.type;
3885 assert(is_type_array(type));
3888 if (!type->array.size_constant || top->index < type->array.size) {
3893 /* we're past the last member of the current sub-aggregate, try if we
3894 * can ascend in the type hierarchy and continue with another subobject */
3895 size_t len = ARR_LEN(path->path);
3898 ascend_from_subtype(path);
3899 advance_current_object(path);
3901 path->invalid = true;
3906 static ir_initializer_t *create_ir_initializer_value(
3907 const initializer_value_t *initializer)
3909 if (is_type_compound(initializer->value->base.type)) {
3910 panic("initializer creation for compounds not implemented yet");
3912 type_t *type = initializer->value->base.type;
3913 expression_t *expr = initializer->value;
3914 ir_node *value = expression_to_firm(expr);
3915 ir_mode *mode = get_ir_mode_storage(type);
3916 value = create_conv(NULL, value, mode);
3917 return create_initializer_const(value);
3920 /** test wether type can be initialized by a string constant */
3921 static bool is_string_type(type_t *type)
3924 if (is_type_pointer(type)) {
3925 inner = skip_typeref(type->pointer.points_to);
3926 } else if(is_type_array(type)) {
3927 inner = skip_typeref(type->array.element_type);
3932 return is_type_integer(inner);
3935 static ir_initializer_t *create_ir_initializer_list(
3936 const initializer_list_t *initializer, type_t *type)
3939 memset(&path, 0, sizeof(path));
3940 path.top_type = type;
3941 path.path = NEW_ARR_F(type_path_entry_t, 0);
3943 descend_into_subtype(&path);
3945 for (size_t i = 0; i < initializer->len; ++i) {
3946 const initializer_t *sub_initializer = initializer->initializers[i];
3948 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3949 walk_designator(&path, sub_initializer->designator.designator);
3953 if (sub_initializer->kind == INITIALIZER_VALUE) {
3954 /* we might have to descend into types until we're at a scalar
3957 type_t *orig_top_type = path.top_type;
3958 type_t *top_type = skip_typeref(orig_top_type);
3960 if (is_type_scalar(top_type))
3962 descend_into_subtype(&path);
3964 } else if (sub_initializer->kind == INITIALIZER_STRING
3965 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
3966 /* we might have to descend into types until we're at a scalar
3969 type_t *orig_top_type = path.top_type;
3970 type_t *top_type = skip_typeref(orig_top_type);
3972 if (is_string_type(top_type))
3974 descend_into_subtype(&path);
3978 ir_initializer_t *sub_irinitializer
3979 = create_ir_initializer(sub_initializer, path.top_type);
3981 size_t path_len = ARR_LEN(path.path);
3982 assert(path_len >= 1);
3983 type_path_entry_t *entry = & path.path[path_len-1];
3984 ir_initializer_t *tinitializer = entry->initializer;
3985 set_initializer_compound_value(tinitializer, entry->index,
3988 advance_current_object(&path);
3991 assert(ARR_LEN(path.path) >= 1);
3992 ir_initializer_t *result = path.path[0].initializer;
3993 DEL_ARR_F(path.path);
3998 static ir_initializer_t *create_ir_initializer_string(
3999 const initializer_string_t *initializer, type_t *type)
4001 type = skip_typeref(type);
4003 size_t string_len = initializer->string.size;
4004 assert(type->kind == TYPE_ARRAY);
4005 assert(type->array.size_constant);
4006 size_t len = type->array.size;
4007 ir_initializer_t *irinitializer = create_initializer_compound(len);
4009 const char *string = initializer->string.begin;
4010 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
4012 for (size_t i = 0; i < len; ++i) {
4017 ir_tarval *tv = new_tarval_from_long(c, mode);
4018 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4020 set_initializer_compound_value(irinitializer, i, char_initializer);
4023 return irinitializer;
4026 static ir_initializer_t *create_ir_initializer_wide_string(
4027 const initializer_wide_string_t *initializer, type_t *type)
4029 assert(type->kind == TYPE_ARRAY);
4030 assert(type->array.size_constant);
4031 size_t len = type->array.size;
4032 size_t string_len = wstrlen(&initializer->string);
4033 ir_initializer_t *irinitializer = create_initializer_compound(len);
4035 const char *p = initializer->string.begin;
4036 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4038 for (size_t i = 0; i < len; ++i) {
4040 if (i < string_len) {
4041 c = read_utf8_char(&p);
4043 ir_tarval *tv = new_tarval_from_long(c, mode);
4044 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4046 set_initializer_compound_value(irinitializer, i, char_initializer);
4049 return irinitializer;
4052 static ir_initializer_t *create_ir_initializer(
4053 const initializer_t *initializer, type_t *type)
4055 switch(initializer->kind) {
4056 case INITIALIZER_STRING:
4057 return create_ir_initializer_string(&initializer->string, type);
4059 case INITIALIZER_WIDE_STRING:
4060 return create_ir_initializer_wide_string(&initializer->wide_string,
4063 case INITIALIZER_LIST:
4064 return create_ir_initializer_list(&initializer->list, type);
4066 case INITIALIZER_VALUE:
4067 return create_ir_initializer_value(&initializer->value);
4069 case INITIALIZER_DESIGNATOR:
4070 panic("unexpected designator initializer found");
4072 panic("unknown initializer");
4075 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4076 * are elements [...] the remainder of the aggregate shall be initialized
4077 * implicitly the same as objects that have static storage duration. */
4078 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4081 /* for unions we must NOT do anything for null initializers */
4082 ir_type *owner = get_entity_owner(entity);
4083 if (is_Union_type(owner)) {
4087 ir_type *ent_type = get_entity_type(entity);
4088 /* create sub-initializers for a compound type */
4089 if (is_compound_type(ent_type)) {
4090 unsigned n_members = get_compound_n_members(ent_type);
4091 for (unsigned n = 0; n < n_members; ++n) {
4092 ir_entity *member = get_compound_member(ent_type, n);
4093 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4095 create_dynamic_null_initializer(member, dbgi, addr);
4099 if (is_Array_type(ent_type)) {
4100 assert(has_array_upper_bound(ent_type, 0));
4101 long n = get_array_upper_bound_int(ent_type, 0);
4102 for (long i = 0; i < n; ++i) {
4103 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4104 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4105 ir_node *cnst = new_d_Const(dbgi, index_tv);
4106 ir_node *in[1] = { cnst };
4107 ir_entity *arrent = get_array_element_entity(ent_type);
4108 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4110 create_dynamic_null_initializer(arrent, dbgi, addr);
4115 ir_mode *value_mode = get_type_mode(ent_type);
4116 ir_node *node = new_Const(get_mode_null(value_mode));
4118 /* is it a bitfield type? */
4119 if (is_Primitive_type(ent_type) &&
4120 get_primitive_base_type(ent_type) != NULL) {
4121 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4125 ir_node *mem = get_store();
4126 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4127 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4131 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4132 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4134 switch(get_initializer_kind(initializer)) {
4135 case IR_INITIALIZER_NULL:
4136 create_dynamic_null_initializer(entity, dbgi, base_addr);
4138 case IR_INITIALIZER_CONST: {
4139 ir_node *node = get_initializer_const_value(initializer);
4140 ir_type *ent_type = get_entity_type(entity);
4142 /* is it a bitfield type? */
4143 if (is_Primitive_type(ent_type) &&
4144 get_primitive_base_type(ent_type) != NULL) {
4145 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4149 assert(get_type_mode(type) == get_irn_mode(node));
4150 ir_node *mem = get_store();
4151 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4152 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4156 case IR_INITIALIZER_TARVAL: {
4157 ir_tarval *tv = get_initializer_tarval_value(initializer);
4158 ir_node *cnst = new_d_Const(dbgi, tv);
4159 ir_type *ent_type = get_entity_type(entity);
4161 /* is it a bitfield type? */
4162 if (is_Primitive_type(ent_type) &&
4163 get_primitive_base_type(ent_type) != NULL) {
4164 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4168 assert(get_type_mode(type) == get_tarval_mode(tv));
4169 ir_node *mem = get_store();
4170 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4171 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4175 case IR_INITIALIZER_COMPOUND: {
4176 assert(is_compound_type(type) || is_Array_type(type));
4178 if (is_Array_type(type)) {
4179 assert(has_array_upper_bound(type, 0));
4180 n_members = get_array_upper_bound_int(type, 0);
4182 n_members = get_compound_n_members(type);
4185 if (get_initializer_compound_n_entries(initializer)
4186 != (unsigned) n_members)
4187 panic("initializer doesn't match compound type");
4189 for (int i = 0; i < n_members; ++i) {
4192 ir_entity *sub_entity;
4193 if (is_Array_type(type)) {
4194 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4195 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4196 ir_node *cnst = new_d_Const(dbgi, index_tv);
4197 ir_node *in[1] = { cnst };
4198 irtype = get_array_element_type(type);
4199 sub_entity = get_array_element_entity(type);
4200 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4203 sub_entity = get_compound_member(type, i);
4204 irtype = get_entity_type(sub_entity);
4205 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4209 ir_initializer_t *sub_init
4210 = get_initializer_compound_value(initializer, i);
4212 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4219 panic("invalid IR_INITIALIZER found");
4222 static void create_dynamic_initializer(ir_initializer_t *initializer,
4223 dbg_info *dbgi, ir_entity *entity)
4225 ir_node *frame = get_irg_frame(current_ir_graph);
4226 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4227 ir_type *type = get_entity_type(entity);
4229 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4232 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4233 ir_entity *entity, type_t *type)
4235 ir_node *memory = get_store();
4236 ir_node *nomem = new_NoMem();
4237 ir_node *frame = get_irg_frame(current_ir_graph);
4238 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4240 if (initializer->kind == INITIALIZER_VALUE) {
4241 initializer_value_t *initializer_value = &initializer->value;
4243 ir_node *value = expression_to_firm(initializer_value->value);
4244 type = skip_typeref(type);
4245 assign_value(dbgi, addr, type, value);
4249 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4250 ir_initializer_t *irinitializer
4251 = create_ir_initializer(initializer, type);
4253 create_dynamic_initializer(irinitializer, dbgi, entity);
4257 /* create a "template" entity which is copied to the entity on the stack */
4258 ir_entity *const init_entity
4259 = create_initializer_entity(dbgi, initializer, type);
4260 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4261 ir_type *const irtype = get_ir_type(type);
4262 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4264 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4265 set_store(copyb_mem);
4268 static void create_initializer_local_variable_entity(entity_t *entity)
4270 assert(entity->kind == ENTITY_VARIABLE);
4271 initializer_t *initializer = entity->variable.initializer;
4272 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4273 ir_entity *irentity = entity->variable.v.entity;
4274 type_t *type = entity->declaration.type;
4276 create_local_initializer(initializer, dbgi, irentity, type);
4279 static void create_variable_initializer(entity_t *entity)
4281 assert(entity->kind == ENTITY_VARIABLE);
4282 initializer_t *initializer = entity->variable.initializer;
4283 if (initializer == NULL)
4286 declaration_kind_t declaration_kind
4287 = (declaration_kind_t) entity->declaration.kind;
4288 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4289 create_initializer_local_variable_entity(entity);
4293 type_t *type = entity->declaration.type;
4294 type_qualifiers_t tq = get_type_qualifier(type, true);
4296 if (initializer->kind == INITIALIZER_VALUE) {
4297 initializer_value_t *initializer_value = &initializer->value;
4298 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4299 expression_t *value = initializer_value->value;
4300 type_t *init_type = value->base.type;
4301 type_t *skipped = skip_typeref(init_type);
4303 if (!is_type_scalar(skipped)) {
4305 while (value->kind == EXPR_UNARY_CAST)
4306 value = value->unary.value;
4308 if (value->kind != EXPR_COMPOUND_LITERAL)
4309 panic("expected non-scalar initializer to be a compound literal");
4310 initializer = value->compound_literal.initializer;
4311 goto have_initializer;
4314 ir_node *node = expression_to_firm(initializer_value->value);
4316 ir_mode *mode = get_ir_mode_storage(init_type);
4317 node = create_conv(dbgi, node, mode);
4318 node = do_strict_conv(dbgi, node);
4320 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4321 set_value(entity->variable.v.value_number, node);
4323 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4325 ir_entity *irentity = entity->variable.v.entity;
4327 if (tq & TYPE_QUALIFIER_CONST
4328 && get_entity_owner(irentity) != get_tls_type()) {
4329 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4331 set_atomic_ent_value(irentity, node);
4335 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4336 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4338 ir_entity *irentity = entity->variable.v.entity;
4339 ir_initializer_t *irinitializer
4340 = create_ir_initializer(initializer, type);
4342 if (tq & TYPE_QUALIFIER_CONST) {
4343 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4345 set_entity_initializer(irentity, irinitializer);
4349 static void create_variable_length_array(entity_t *entity)
4351 assert(entity->kind == ENTITY_VARIABLE);
4352 assert(entity->variable.initializer == NULL);
4354 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4355 entity->variable.v.vla_base = NULL;
4357 /* TODO: record VLA somewhere so we create the free node when we leave
4361 static void allocate_variable_length_array(entity_t *entity)
4363 assert(entity->kind == ENTITY_VARIABLE);
4364 assert(entity->variable.initializer == NULL);
4365 assert(currently_reachable());
4367 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4368 type_t *type = entity->declaration.type;
4369 ir_type *el_type = get_ir_type(type->array.element_type);
4371 /* make sure size_node is calculated */
4372 get_type_size_node(type);
4373 ir_node *elems = type->array.size_node;
4374 ir_node *mem = get_store();
4375 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4377 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4378 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4381 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4382 entity->variable.v.vla_base = addr;
4386 * Creates a Firm local variable from a declaration.
4388 static void create_local_variable(entity_t *entity)
4390 assert(entity->kind == ENTITY_VARIABLE);
4391 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4393 bool needs_entity = entity->variable.address_taken;
4394 type_t *type = skip_typeref(entity->declaration.type);
4396 /* is it a variable length array? */
4397 if (is_type_array(type) && !type->array.size_constant) {
4398 create_variable_length_array(entity);
4400 } else if (is_type_array(type) || is_type_compound(type)) {
4401 needs_entity = true;
4402 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4403 needs_entity = true;
4407 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4408 create_variable_entity(entity,
4409 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4412 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4413 entity->variable.v.value_number = next_value_number_function;
4414 set_irg_loc_description(current_ir_graph, next_value_number_function,
4416 ++next_value_number_function;
4420 static void create_local_static_variable(entity_t *entity)
4422 assert(entity->kind == ENTITY_VARIABLE);
4423 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4425 type_t *type = skip_typeref(entity->declaration.type);
4426 ir_type *const var_type = entity->variable.thread_local ?
4427 get_tls_type() : get_glob_type();
4428 ir_type *const irtype = get_ir_type(type);
4429 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4431 size_t l = strlen(entity->base.symbol->string);
4432 char buf[l + sizeof(".%u")];
4433 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4434 ident *const id = id_unique(buf);
4435 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4437 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4438 set_entity_volatility(irentity, volatility_is_volatile);
4441 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4442 entity->variable.v.entity = irentity;
4444 set_entity_ld_ident(irentity, id);
4445 set_entity_visibility(irentity, ir_visibility_local);
4447 ir_graph *const old_current_ir_graph = current_ir_graph;
4448 current_ir_graph = get_const_code_irg();
4450 create_variable_initializer(entity);
4452 assert(current_ir_graph == get_const_code_irg());
4453 current_ir_graph = old_current_ir_graph;
4458 static ir_node *return_statement_to_firm(return_statement_t *statement)
4460 if (!currently_reachable())
4463 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4464 type_t *type = current_function_entity->declaration.type;
4465 ir_type *func_irtype = get_ir_type(type);
4469 if (get_method_n_ress(func_irtype) > 0) {
4470 ir_type *res_type = get_method_res_type(func_irtype, 0);
4472 if (statement->value != NULL) {
4473 ir_node *node = expression_to_firm(statement->value);
4474 if (!is_compound_type(res_type)) {
4475 type_t *ret_value_type = statement->value->base.type;
4476 ir_mode *mode = get_ir_mode_storage(ret_value_type);
4477 node = create_conv(dbgi, node, mode);
4478 node = do_strict_conv(dbgi, node);
4483 if (is_compound_type(res_type)) {
4486 mode = get_type_mode(res_type);
4488 in[0] = new_Unknown(mode);
4492 /* build return_value for its side effects */
4493 if (statement->value != NULL) {
4494 expression_to_firm(statement->value);
4499 ir_node *store = get_store();
4500 ir_node *ret = new_d_Return(dbgi, store, in_len, in);
4502 ir_node *end_block = get_irg_end_block(current_ir_graph);
4503 add_immBlock_pred(end_block, ret);
4505 set_unreachable_now();
4509 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4511 if (!currently_reachable())
4514 return expression_to_firm(statement->expression);
4517 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4519 entity_t *entity = compound->scope.entities;
4520 for ( ; entity != NULL; entity = entity->base.next) {
4521 if (!is_declaration(entity))
4524 create_local_declaration(entity);
4527 ir_node *result = NULL;
4528 statement_t *statement = compound->statements;
4529 for ( ; statement != NULL; statement = statement->base.next) {
4530 result = statement_to_firm(statement);
4536 static void create_global_variable(entity_t *entity)
4538 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4539 ir_visibility visibility = ir_visibility_default;
4540 ir_entity *irentity;
4541 assert(entity->kind == ENTITY_VARIABLE);
4543 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4544 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4545 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4546 case STORAGE_CLASS_NONE:
4547 visibility = ir_visibility_default;
4548 /* uninitialized globals get merged in C */
4549 if (entity->variable.initializer == NULL)
4550 linkage |= IR_LINKAGE_MERGE;
4552 case STORAGE_CLASS_TYPEDEF:
4553 case STORAGE_CLASS_AUTO:
4554 case STORAGE_CLASS_REGISTER:
4555 panic("invalid storage class for global var");
4558 ir_type *var_type = get_glob_type();
4559 if (entity->variable.thread_local) {
4560 var_type = get_tls_type();
4561 /* LINKAGE_MERGE not supported by current linkers */
4562 linkage &= ~IR_LINKAGE_MERGE;
4564 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4565 irentity = entity->variable.v.entity;
4566 add_entity_linkage(irentity, linkage);
4567 set_entity_visibility(irentity, visibility);
4570 static void create_local_declaration(entity_t *entity)
4572 assert(is_declaration(entity));
4574 /* construct type */
4575 (void) get_ir_type(entity->declaration.type);
4576 if (entity->base.symbol == NULL) {
4580 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4581 case STORAGE_CLASS_STATIC:
4582 if (entity->kind == ENTITY_FUNCTION) {
4583 (void)get_function_entity(entity, NULL);
4585 create_local_static_variable(entity);
4588 case STORAGE_CLASS_EXTERN:
4589 if (entity->kind == ENTITY_FUNCTION) {
4590 assert(entity->function.statement == NULL);
4591 (void)get_function_entity(entity, NULL);
4593 create_global_variable(entity);
4594 create_variable_initializer(entity);
4597 case STORAGE_CLASS_NONE:
4598 case STORAGE_CLASS_AUTO:
4599 case STORAGE_CLASS_REGISTER:
4600 if (entity->kind == ENTITY_FUNCTION) {
4601 if (entity->function.statement != NULL) {
4602 ir_type *owner = get_irg_frame_type(current_ir_graph);
4603 (void)get_function_entity(entity, owner);
4604 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4605 enqueue_inner_function(entity);
4607 (void)get_function_entity(entity, NULL);
4610 create_local_variable(entity);
4613 case STORAGE_CLASS_TYPEDEF:
4616 panic("invalid storage class found");
4619 static void initialize_local_declaration(entity_t *entity)
4621 if (entity->base.symbol == NULL)
4624 // no need to emit code in dead blocks
4625 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4626 && !currently_reachable())
4629 switch ((declaration_kind_t) entity->declaration.kind) {
4630 case DECLARATION_KIND_LOCAL_VARIABLE:
4631 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4632 create_variable_initializer(entity);
4635 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4636 allocate_variable_length_array(entity);
4639 case DECLARATION_KIND_COMPOUND_MEMBER:
4640 case DECLARATION_KIND_GLOBAL_VARIABLE:
4641 case DECLARATION_KIND_FUNCTION:
4642 case DECLARATION_KIND_INNER_FUNCTION:
4645 case DECLARATION_KIND_PARAMETER:
4646 case DECLARATION_KIND_PARAMETER_ENTITY:
4647 panic("can't initialize parameters");
4649 case DECLARATION_KIND_UNKNOWN:
4650 panic("can't initialize unknown declaration");
4652 panic("invalid declaration kind");
4655 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4657 entity_t *entity = statement->declarations_begin;
4661 entity_t *const last = statement->declarations_end;
4662 for ( ;; entity = entity->base.next) {
4663 if (is_declaration(entity)) {
4664 initialize_local_declaration(entity);
4665 } else if (entity->kind == ENTITY_TYPEDEF) {
4666 /* ยง6.7.7:3 Any array size expressions associated with variable length
4667 * array declarators are evaluated each time the declaration of the
4668 * typedef name is reached in the order of execution. */
4669 type_t *const type = skip_typeref(entity->typedefe.type);
4670 if (is_type_array(type) && type->array.is_vla)
4671 get_vla_size(&type->array);
4680 static ir_node *if_statement_to_firm(if_statement_t *statement)
4682 /* Create the condition. */
4683 ir_node *true_block = NULL;
4684 ir_node *false_block = NULL;
4685 if (currently_reachable()) {
4686 true_block = new_immBlock();
4687 false_block = new_immBlock();
4688 create_condition_evaluation(statement->condition, true_block, false_block);
4689 mature_immBlock(true_block);
4690 mature_immBlock(false_block);
4693 /* Create the true statement. */
4694 set_cur_block(true_block);
4695 statement_to_firm(statement->true_statement);
4696 ir_node *fallthrough_block = get_cur_block();
4698 /* Create the false statement. */
4699 set_cur_block(false_block);
4700 if (statement->false_statement != NULL) {
4701 statement_to_firm(statement->false_statement);
4704 /* Handle the block after the if-statement. Minor simplification and
4705 * optimisation: Reuse the false/true block as fallthrough block, if the
4706 * true/false statement does not pass control to the fallthrough block, e.g.
4707 * in the typical if (x) return; pattern. */
4708 if (fallthrough_block) {
4709 if (currently_reachable()) {
4710 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4711 ir_node *const f_jump = new_Jmp();
4712 ir_node *const in[] = { t_jump, f_jump };
4713 fallthrough_block = new_Block(2, in);
4715 set_cur_block(fallthrough_block);
4722 * Add an unconditional jump to the target block. If the source block is not
4723 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4724 * loops. This is necessary if the jump potentially enters a loop.
4726 static void jump_to(ir_node *const target_block)
4728 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4729 add_immBlock_pred(target_block, pred);
4733 * Add an unconditional jump to the target block, if the current block is
4734 * reachable and do nothing otherwise. This is only valid if the jump does not
4735 * enter a loop (a back edge is ok).
4737 static void jump_if_reachable(ir_node *const target_block)
4739 if (currently_reachable())
4740 add_immBlock_pred(target_block, new_Jmp());
4743 static ir_node *while_statement_to_firm(while_statement_t *statement)
4745 /* Create the header block */
4746 ir_node *const header_block = new_immBlock();
4747 jump_to(header_block);
4749 /* Create the condition. */
4750 ir_node * body_block;
4751 ir_node * false_block;
4752 expression_t *const cond = statement->condition;
4753 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4754 fold_constant_to_bool(cond)) {
4755 /* Shortcut for while (true). */
4756 body_block = header_block;
4759 keep_alive(header_block);
4760 keep_all_memory(header_block);
4762 body_block = new_immBlock();
4763 false_block = new_immBlock();
4765 set_cur_block(header_block);
4766 create_condition_evaluation(cond, body_block, false_block);
4767 mature_immBlock(body_block);
4770 ir_node *const old_continue_label = continue_label;
4771 ir_node *const old_break_label = break_label;
4772 continue_label = header_block;
4773 break_label = false_block;
4775 /* Create the loop body. */
4776 set_cur_block(body_block);
4777 statement_to_firm(statement->body);
4778 jump_if_reachable(header_block);
4780 mature_immBlock(header_block);
4781 assert(false_block == NULL || false_block == break_label);
4782 false_block = break_label;
4783 if (false_block != NULL) {
4784 mature_immBlock(false_block);
4786 set_cur_block(false_block);
4788 assert(continue_label == header_block);
4789 continue_label = old_continue_label;
4790 break_label = old_break_label;
4794 static ir_node *get_break_label(void)
4796 if (break_label == NULL) {
4797 break_label = new_immBlock();
4802 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4804 /* create the header block */
4805 ir_node *header_block = new_immBlock();
4808 ir_node *body_block = new_immBlock();
4809 jump_to(body_block);
4811 ir_node *old_continue_label = continue_label;
4812 ir_node *old_break_label = break_label;
4813 continue_label = header_block;
4816 set_cur_block(body_block);
4817 statement_to_firm(statement->body);
4818 ir_node *const false_block = get_break_label();
4820 assert(continue_label == header_block);
4821 continue_label = old_continue_label;
4822 break_label = old_break_label;
4824 jump_if_reachable(header_block);
4826 /* create the condition */
4827 mature_immBlock(header_block);
4828 set_cur_block(header_block);
4830 create_condition_evaluation(statement->condition, body_block, false_block);
4831 mature_immBlock(body_block);
4832 mature_immBlock(false_block);
4834 set_cur_block(false_block);
4838 static ir_node *for_statement_to_firm(for_statement_t *statement)
4840 /* create declarations */
4841 entity_t *entity = statement->scope.entities;
4842 for ( ; entity != NULL; entity = entity->base.next) {
4843 if (!is_declaration(entity))
4846 create_local_declaration(entity);
4849 if (currently_reachable()) {
4850 entity = statement->scope.entities;
4851 for ( ; entity != NULL; entity = entity->base.next) {
4852 if (!is_declaration(entity))
4855 initialize_local_declaration(entity);
4858 if (statement->initialisation != NULL) {
4859 expression_to_firm(statement->initialisation);
4863 /* Create the header block */
4864 ir_node *const header_block = new_immBlock();
4865 jump_to(header_block);
4867 /* Create the condition. */
4868 ir_node *body_block;
4869 ir_node *false_block;
4870 if (statement->condition != NULL) {
4871 body_block = new_immBlock();
4872 false_block = new_immBlock();
4874 set_cur_block(header_block);
4875 create_condition_evaluation(statement->condition, body_block, false_block);
4876 mature_immBlock(body_block);
4879 body_block = header_block;
4882 keep_alive(header_block);
4883 keep_all_memory(header_block);
4886 /* Create the step block, if necessary. */
4887 ir_node * step_block = header_block;
4888 expression_t *const step = statement->step;
4890 step_block = new_immBlock();
4893 ir_node *const old_continue_label = continue_label;
4894 ir_node *const old_break_label = break_label;
4895 continue_label = step_block;
4896 break_label = false_block;
4898 /* Create the loop body. */
4899 set_cur_block(body_block);
4900 statement_to_firm(statement->body);
4901 jump_if_reachable(step_block);
4903 /* Create the step code. */
4905 mature_immBlock(step_block);
4906 set_cur_block(step_block);
4907 expression_to_firm(step);
4908 jump_if_reachable(header_block);
4911 mature_immBlock(header_block);
4912 assert(false_block == NULL || false_block == break_label);
4913 false_block = break_label;
4914 if (false_block != NULL) {
4915 mature_immBlock(false_block);
4917 set_cur_block(false_block);
4919 assert(continue_label == step_block);
4920 continue_label = old_continue_label;
4921 break_label = old_break_label;
4925 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4927 if (!currently_reachable())
4930 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4931 ir_node *jump = new_d_Jmp(dbgi);
4932 add_immBlock_pred(target_block, jump);
4934 set_unreachable_now();
4938 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4940 /* determine number of cases */
4942 for (case_label_statement_t *l = statement->first_case; l != NULL;
4945 if (l->expression == NULL)
4947 if (l->is_empty_range)
4952 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4954 for (case_label_statement_t *l = statement->first_case; l != NULL;
4956 if (l->expression == NULL) {
4957 l->pn = pn_Switch_default;
4960 if (l->is_empty_range)
4962 ir_tarval *min = fold_constant_to_tarval(l->expression);
4963 ir_tarval *max = min;
4964 long pn = (long) i+1;
4965 if (l->end_range != NULL)
4966 max = fold_constant_to_tarval(l->end_range);
4967 ir_switch_table_set(res, i++, min, max, pn);
4973 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4975 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4976 ir_node *switch_node = NULL;
4978 if (currently_reachable()) {
4979 ir_node *expression = expression_to_firm(statement->expression);
4980 ir_switch_table *table = create_switch_table(statement);
4981 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4983 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4986 set_unreachable_now();
4988 ir_node *const old_switch = current_switch;
4989 ir_node *const old_break_label = break_label;
4990 const bool old_saw_default_label = saw_default_label;
4991 saw_default_label = false;
4992 current_switch = switch_node;
4995 statement_to_firm(statement->body);
4997 if (currently_reachable()) {
4998 add_immBlock_pred(get_break_label(), new_Jmp());
5001 if (!saw_default_label && switch_node) {
5002 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
5003 add_immBlock_pred(get_break_label(), proj);
5006 if (break_label != NULL) {
5007 mature_immBlock(break_label);
5009 set_cur_block(break_label);
5011 assert(current_switch == switch_node);
5012 current_switch = old_switch;
5013 break_label = old_break_label;
5014 saw_default_label = old_saw_default_label;
5018 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
5020 if (statement->is_empty_range)
5023 if (current_switch != NULL) {
5024 ir_node *block = new_immBlock();
5025 /* Fallthrough from previous case */
5026 jump_if_reachable(block);
5028 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
5029 add_immBlock_pred(block, proj);
5030 if (statement->expression == NULL)
5031 saw_default_label = true;
5033 mature_immBlock(block);
5034 set_cur_block(block);
5037 return statement_to_firm(statement->statement);
5040 static ir_node *label_to_firm(const label_statement_t *statement)
5042 ir_node *block = get_label_block(statement->label);
5045 set_cur_block(block);
5047 keep_all_memory(block);
5049 return statement_to_firm(statement->statement);
5052 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
5054 if (!currently_reachable())
5057 ir_node *const irn = expression_to_firm(statement->expression);
5058 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5059 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
5061 set_irn_link(ijmp, ijmp_list);
5064 set_unreachable_now();
5068 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
5070 bool needs_memory = false;
5072 if (statement->is_volatile) {
5073 needs_memory = true;
5076 size_t n_clobbers = 0;
5077 asm_clobber_t *clobber = statement->clobbers;
5078 for ( ; clobber != NULL; clobber = clobber->next) {
5079 const char *clobber_str = clobber->clobber.begin;
5081 if (!be_is_valid_clobber(clobber_str)) {
5082 errorf(&statement->base.source_position,
5083 "invalid clobber '%s' specified", clobber->clobber);
5087 if (streq(clobber_str, "memory")) {
5088 needs_memory = true;
5092 ident *id = new_id_from_str(clobber_str);
5093 obstack_ptr_grow(&asm_obst, id);
5096 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5097 ident **clobbers = NULL;
5098 if (n_clobbers > 0) {
5099 clobbers = obstack_finish(&asm_obst);
5102 size_t n_inputs = 0;
5103 asm_argument_t *argument = statement->inputs;
5104 for ( ; argument != NULL; argument = argument->next)
5106 size_t n_outputs = 0;
5107 argument = statement->outputs;
5108 for ( ; argument != NULL; argument = argument->next)
5111 unsigned next_pos = 0;
5113 ir_node *ins[n_inputs + n_outputs + 1];
5116 ir_asm_constraint tmp_in_constraints[n_outputs];
5118 const expression_t *out_exprs[n_outputs];
5119 ir_node *out_addrs[n_outputs];
5120 size_t out_size = 0;
5122 argument = statement->outputs;
5123 for ( ; argument != NULL; argument = argument->next) {
5124 const char *constraints = argument->constraints.begin;
5125 asm_constraint_flags_t asm_flags
5126 = be_parse_asm_constraints(constraints);
5129 source_position_t const *const pos = &statement->base.source_position;
5130 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5131 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5133 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5134 errorf(pos, "some constraints in '%s' are invalid", constraints);
5137 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5138 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5143 unsigned pos = next_pos++;
5144 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5145 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5146 expression_t *expr = argument->expression;
5147 ir_node *addr = expression_to_addr(expr);
5148 /* in+output, construct an artifical same_as constraint on the
5150 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5152 ir_node *value = get_value_from_lvalue(expr, addr);
5154 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5156 ir_asm_constraint constraint;
5157 constraint.pos = pos;
5158 constraint.constraint = new_id_from_str(buf);
5159 constraint.mode = get_ir_mode_storage(expr->base.type);
5160 tmp_in_constraints[in_size] = constraint;
5161 ins[in_size] = value;
5166 out_exprs[out_size] = expr;
5167 out_addrs[out_size] = addr;
5169 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5170 /* pure memory ops need no input (but we have to make sure we
5171 * attach to the memory) */
5172 assert(! (asm_flags &
5173 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5174 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5175 needs_memory = true;
5177 /* we need to attach the address to the inputs */
5178 expression_t *expr = argument->expression;
5180 ir_asm_constraint constraint;
5181 constraint.pos = pos;
5182 constraint.constraint = new_id_from_str(constraints);
5183 constraint.mode = mode_M;
5184 tmp_in_constraints[in_size] = constraint;
5186 ins[in_size] = expression_to_addr(expr);
5190 errorf(&statement->base.source_position,
5191 "only modifiers but no place set in constraints '%s'",
5196 ir_asm_constraint constraint;
5197 constraint.pos = pos;
5198 constraint.constraint = new_id_from_str(constraints);
5199 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5201 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5203 assert(obstack_object_size(&asm_obst)
5204 == out_size * sizeof(ir_asm_constraint));
5205 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5208 obstack_grow(&asm_obst, tmp_in_constraints,
5209 in_size * sizeof(tmp_in_constraints[0]));
5210 /* find and count input and output arguments */
5211 argument = statement->inputs;
5212 for ( ; argument != NULL; argument = argument->next) {
5213 const char *constraints = argument->constraints.begin;
5214 asm_constraint_flags_t asm_flags
5215 = be_parse_asm_constraints(constraints);
5217 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5218 errorf(&statement->base.source_position,
5219 "some constraints in '%s' are not supported", constraints);
5222 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5223 errorf(&statement->base.source_position,
5224 "some constraints in '%s' are invalid", constraints);
5227 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5228 errorf(&statement->base.source_position,
5229 "write flag specified for input constraints '%s'",
5235 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5236 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5237 /* we can treat this as "normal" input */
5238 input = expression_to_firm(argument->expression);
5239 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5240 /* pure memory ops need no input (but we have to make sure we
5241 * attach to the memory) */
5242 assert(! (asm_flags &
5243 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5244 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5245 needs_memory = true;
5246 input = expression_to_addr(argument->expression);
5248 errorf(&statement->base.source_position,
5249 "only modifiers but no place set in constraints '%s'",
5254 ir_asm_constraint constraint;
5255 constraint.pos = next_pos++;
5256 constraint.constraint = new_id_from_str(constraints);
5257 constraint.mode = get_irn_mode(input);
5259 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5260 ins[in_size++] = input;
5264 ir_asm_constraint constraint;
5265 constraint.pos = next_pos++;
5266 constraint.constraint = new_id_from_str("");
5267 constraint.mode = mode_M;
5269 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5270 ins[in_size++] = get_store();
5273 assert(obstack_object_size(&asm_obst)
5274 == in_size * sizeof(ir_asm_constraint));
5275 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5277 /* create asm node */
5278 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5280 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5282 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5283 out_size, output_constraints,
5284 n_clobbers, clobbers, asm_text);
5286 if (statement->is_volatile) {
5287 set_irn_pinned(node, op_pin_state_pinned);
5289 set_irn_pinned(node, op_pin_state_floats);
5292 /* create output projs & connect them */
5294 ir_node *projm = new_Proj(node, mode_M, out_size);
5299 for (i = 0; i < out_size; ++i) {
5300 const expression_t *out_expr = out_exprs[i];
5302 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5303 ir_node *proj = new_Proj(node, mode, pn);
5304 ir_node *addr = out_addrs[i];
5306 set_value_for_expression_addr(out_expr, proj, addr);
5312 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5314 statement_to_firm(statement->try_statement);
5315 source_position_t const *const pos = &statement->base.source_position;
5316 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5320 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5322 errorf(&statement->base.source_position, "__leave not supported yet");
5327 * Transform a statement.
5329 static ir_node *statement_to_firm(statement_t *const stmt)
5332 assert(!stmt->base.transformed);
5333 stmt->base.transformed = true;
5336 switch (stmt->kind) {
5337 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5338 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5339 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5340 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5341 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5342 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5343 case STATEMENT_EMPTY: return NULL; /* nothing */
5344 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5345 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5346 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5347 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5348 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5349 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5350 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5351 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5352 case STATEMENT_WHILE: return while_statement_to_firm( &stmt->whiles);
5354 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5355 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5356 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5358 case STATEMENT_ERROR: panic("error statement found");
5360 panic("statement not implemented");
5363 static int count_local_variables(const entity_t *entity,
5364 const entity_t *const last)
5367 entity_t const *const end = last != NULL ? last->base.next : NULL;
5368 for (; entity != end; entity = entity->base.next) {
5372 if (entity->kind == ENTITY_VARIABLE) {
5373 type = skip_typeref(entity->declaration.type);
5374 address_taken = entity->variable.address_taken;
5375 } else if (entity->kind == ENTITY_PARAMETER) {
5376 type = skip_typeref(entity->declaration.type);
5377 address_taken = entity->parameter.address_taken;
5382 if (!address_taken && is_type_scalar(type))
5388 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5390 int *const count = env;
5392 switch (stmt->kind) {
5393 case STATEMENT_DECLARATION: {
5394 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5395 *count += count_local_variables(decl_stmt->declarations_begin,
5396 decl_stmt->declarations_end);
5401 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5410 * Return the number of local (alias free) variables used by a function.
5412 static int get_function_n_local_vars(entity_t *entity)
5414 const function_t *function = &entity->function;
5417 /* count parameters */
5418 count += count_local_variables(function->parameters.entities, NULL);
5420 /* count local variables declared in body */
5421 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5426 * Build Firm code for the parameters of a function.
5428 static void initialize_function_parameters(entity_t *entity)
5430 assert(entity->kind == ENTITY_FUNCTION);
5431 ir_graph *irg = current_ir_graph;
5432 ir_node *args = get_irg_args(irg);
5434 ir_type *function_irtype;
5436 if (entity->function.need_closure) {
5437 /* add an extra parameter for the static link */
5438 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5441 /* Matze: IMO this is wrong, nested functions should have an own
5442 * type and not rely on strange parameters... */
5443 function_irtype = create_method_type(&entity->declaration.type->function, true);
5445 function_irtype = get_ir_type(entity->declaration.type);
5450 entity_t *parameter = entity->function.parameters.entities;
5451 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5452 if (parameter->kind != ENTITY_PARAMETER)
5455 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5456 type_t *type = skip_typeref(parameter->declaration.type);
5458 bool needs_entity = parameter->parameter.address_taken;
5459 assert(!is_type_array(type));
5460 if (is_type_compound(type)) {
5461 needs_entity = true;
5464 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5466 ir_type *frame_type = get_irg_frame_type(irg);
5468 = new_parameter_entity(frame_type, n, param_irtype);
5469 parameter->declaration.kind
5470 = DECLARATION_KIND_PARAMETER_ENTITY;
5471 parameter->parameter.v.entity = param;
5475 ir_mode *param_mode = get_type_mode(param_irtype);
5477 ir_node *value = new_r_Proj(args, param_mode, pn);
5479 ir_mode *mode = get_ir_mode_storage(type);
5480 value = create_conv(NULL, value, mode);
5481 value = do_strict_conv(NULL, value);
5483 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5484 parameter->parameter.v.value_number = next_value_number_function;
5485 set_irg_loc_description(current_ir_graph, next_value_number_function,
5487 ++next_value_number_function;
5489 set_value(parameter->parameter.v.value_number, value);
5494 * Handle additional decl modifiers for IR-graphs
5496 * @param irg the IR-graph
5497 * @param dec_modifiers additional modifiers
5499 static void handle_decl_modifier_irg(ir_graph *irg,
5500 decl_modifiers_t decl_modifiers)
5502 if (decl_modifiers & DM_NAKED) {
5503 /* TRUE if the declaration includes the Microsoft
5504 __declspec(naked) specifier. */
5505 add_irg_additional_properties(irg, mtp_property_naked);
5507 if (decl_modifiers & DM_FORCEINLINE) {
5508 /* TRUE if the declaration includes the
5509 Microsoft __forceinline specifier. */
5510 set_irg_inline_property(irg, irg_inline_forced);
5512 if (decl_modifiers & DM_NOINLINE) {
5513 /* TRUE if the declaration includes the Microsoft
5514 __declspec(noinline) specifier. */
5515 set_irg_inline_property(irg, irg_inline_forbidden);
5519 static void add_function_pointer(ir_type *segment, ir_entity *method,
5520 const char *unique_template)
5522 ir_type *method_type = get_entity_type(method);
5523 ir_type *ptr_type = new_type_pointer(method_type);
5525 /* these entities don't really have a name but firm only allows
5527 * Note that we mustn't give these entities a name since for example
5528 * Mach-O doesn't allow them. */
5529 ident *ide = id_unique(unique_template);
5530 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5531 ir_graph *irg = get_const_code_irg();
5532 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5535 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5536 set_entity_compiler_generated(ptr, 1);
5537 set_entity_visibility(ptr, ir_visibility_private);
5538 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5539 set_atomic_ent_value(ptr, val);
5543 * Generate possible IJmp branches to a given label block.
5545 static void gen_ijmp_branches(ir_node *block)
5548 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5549 add_immBlock_pred(block, ijmp);
5554 * Create code for a function and all inner functions.
5556 * @param entity the function entity
5558 static void create_function(entity_t *entity)
5560 assert(entity->kind == ENTITY_FUNCTION);
5561 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5563 if (entity->function.statement == NULL)
5566 inner_functions = NULL;
5567 current_trampolines = NULL;
5569 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5570 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5571 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5573 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5574 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5575 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5578 current_function_entity = entity;
5579 current_function_name = NULL;
5580 current_funcsig = NULL;
5582 assert(all_labels == NULL);
5583 all_labels = NEW_ARR_F(label_t *, 0);
5586 int n_local_vars = get_function_n_local_vars(entity);
5587 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5588 current_ir_graph = irg;
5590 ir_graph *old_current_function = current_function;
5591 current_function = irg;
5593 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5594 current_vararg_entity = NULL;
5596 set_irg_fp_model(irg, firm_fp_model);
5597 tarval_enable_fp_ops(1);
5598 set_irn_dbg_info(get_irg_start_block(irg),
5599 get_entity_dbg_info(function_entity));
5601 /* set inline flags */
5602 if (entity->function.is_inline)
5603 set_irg_inline_property(irg, irg_inline_recomended);
5604 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5606 next_value_number_function = 0;
5607 initialize_function_parameters(entity);
5608 current_static_link = entity->function.static_link;
5610 statement_to_firm(entity->function.statement);
5612 ir_node *end_block = get_irg_end_block(irg);
5614 /* do we have a return statement yet? */
5615 if (currently_reachable()) {
5616 type_t *type = skip_typeref(entity->declaration.type);
5617 assert(is_type_function(type));
5618 const function_type_t *func_type = &type->function;
5619 const type_t *return_type
5620 = skip_typeref(func_type->return_type);
5623 if (is_type_void(return_type)) {
5624 ret = new_Return(get_store(), 0, NULL);
5627 if (is_type_scalar(return_type)) {
5628 mode = get_ir_mode_storage(func_type->return_type);
5634 /* ยง5.1.2.2.3 main implicitly returns 0 */
5635 if (is_main(entity)) {
5636 in[0] = new_Const(get_mode_null(mode));
5638 in[0] = new_Unknown(mode);
5640 ret = new_Return(get_store(), 1, in);
5642 add_immBlock_pred(end_block, ret);
5645 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5646 label_t *label = all_labels[i];
5647 if (label->address_taken) {
5648 gen_ijmp_branches(label->block);
5650 mature_immBlock(label->block);
5653 DEL_ARR_F(all_labels);
5656 irg_finalize_cons(irg);
5658 /* finalize the frame type */
5659 ir_type *frame_type = get_irg_frame_type(irg);
5660 int n = get_compound_n_members(frame_type);
5663 for (int i = 0; i < n; ++i) {
5664 ir_entity *member = get_compound_member(frame_type, i);
5665 ir_type *entity_type = get_entity_type(member);
5667 int align = get_type_alignment_bytes(entity_type);
5668 if (align > align_all)
5672 misalign = offset % align;
5674 offset += align - misalign;
5678 set_entity_offset(member, offset);
5679 offset += get_type_size_bytes(entity_type);
5681 set_type_size_bytes(frame_type, offset);
5682 set_type_alignment_bytes(frame_type, align_all);
5684 irg_verify(irg, VERIFY_ENFORCE_SSA);
5685 current_vararg_entity = old_current_vararg_entity;
5686 current_function = old_current_function;
5688 if (current_trampolines != NULL) {
5689 DEL_ARR_F(current_trampolines);
5690 current_trampolines = NULL;
5693 /* create inner functions if any */
5694 entity_t **inner = inner_functions;
5695 if (inner != NULL) {
5696 ir_type *rem_outer_frame = current_outer_frame;
5697 current_outer_frame = get_irg_frame_type(current_ir_graph);
5698 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5699 create_function(inner[i]);
5703 current_outer_frame = rem_outer_frame;
5707 static void scope_to_firm(scope_t *scope)
5709 /* first pass: create declarations */
5710 entity_t *entity = scope->entities;
5711 for ( ; entity != NULL; entity = entity->base.next) {
5712 if (entity->base.symbol == NULL)
5715 if (entity->kind == ENTITY_FUNCTION) {
5716 if (entity->function.btk != BUILTIN_NONE) {
5717 /* builtins have no representation */
5720 (void)get_function_entity(entity, NULL);
5721 } else if (entity->kind == ENTITY_VARIABLE) {
5722 create_global_variable(entity);
5723 } else if (entity->kind == ENTITY_NAMESPACE) {
5724 scope_to_firm(&entity->namespacee.members);
5728 /* second pass: create code/initializers */
5729 entity = scope->entities;
5730 for ( ; entity != NULL; entity = entity->base.next) {
5731 if (entity->base.symbol == NULL)
5734 if (entity->kind == ENTITY_FUNCTION) {
5735 if (entity->function.btk != BUILTIN_NONE) {
5736 /* builtins have no representation */
5739 create_function(entity);
5740 } else if (entity->kind == ENTITY_VARIABLE) {
5741 assert(entity->declaration.kind
5742 == DECLARATION_KIND_GLOBAL_VARIABLE);
5743 current_ir_graph = get_const_code_irg();
5744 create_variable_initializer(entity);
5749 void init_ast2firm(void)
5751 obstack_init(&asm_obst);
5752 init_atomic_modes();
5754 ir_set_debug_retrieve(dbg_retrieve);
5755 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5757 /* create idents for all known runtime functions */
5758 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5759 rts_idents[i] = new_id_from_str(rts_data[i].name);
5762 entitymap_init(&entitymap);
5765 static void init_ir_types(void)
5767 static int ir_types_initialized = 0;
5768 if (ir_types_initialized)
5770 ir_types_initialized = 1;
5772 ir_type_char = get_ir_type(type_char);
5773 ir_type_const_char = get_ir_type(type_const_char);
5774 ir_type_wchar_t = get_ir_type(type_wchar_t);
5776 be_params = be_get_backend_param();
5777 mode_float_arithmetic = be_params->mode_float_arithmetic;
5779 stack_param_align = be_params->stack_param_align;
5782 void exit_ast2firm(void)
5784 entitymap_destroy(&entitymap);
5785 obstack_free(&asm_obst, NULL);
5788 static void global_asm_to_firm(statement_t *s)
5790 for (; s != NULL; s = s->base.next) {
5791 assert(s->kind == STATEMENT_ASM);
5793 char const *const text = s->asms.asm_text.begin;
5794 size_t size = s->asms.asm_text.size;
5796 /* skip the last \0 */
5797 if (text[size - 1] == '\0')
5800 ident *const id = new_id_from_chars(text, size);
5805 void translation_unit_to_firm(translation_unit_t *unit)
5807 /* initialize firm arithmetic */
5808 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5809 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5811 /* just to be sure */
5812 continue_label = NULL;
5814 current_switch = NULL;
5815 current_translation_unit = unit;
5819 scope_to_firm(&unit->scope);
5820 global_asm_to_firm(unit->global_asm);
5822 current_ir_graph = NULL;
5823 current_translation_unit = NULL;