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
28 #include <libfirm/firm.h>
29 #include <libfirm/adt/obst.h>
30 #include <libfirm/be.h>
34 #include "adt/error.h"
35 #include "adt/array.h"
36 #include "adt/strutil.h"
44 #include "diagnostic.h"
45 #include "lang_features.h"
47 #include "type_hash.h"
52 #include "entitymap_t.h"
53 #include "driver/firm_opt.h"
55 typedef struct trampoline_region trampoline_region;
56 struct trampoline_region {
57 ir_entity *function; /**< The function that is called by this trampoline */
58 ir_entity *region; /**< created region for the trampoline */
61 fp_model_t firm_fp_model = fp_model_precise;
63 static const backend_params *be_params;
65 static ir_type *ir_type_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 src_loc_t dbg_retrieve(const dbg_info *dbg)
133 source_position_t const *const pos = (source_position_t const*)dbg;
135 return (src_loc_t){ pos->input_name, pos->lineno, pos->colno };
137 return (src_loc_t){ NULL, 0, 0 };
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);
178 static unsigned decide_modulo_shift(unsigned type_size)
180 if (architecture_modulo_shift == 0)
182 if (type_size < architecture_modulo_shift)
183 return architecture_modulo_shift;
187 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
189 unsigned flags = get_atomic_type_flags(kind);
190 unsigned size = get_atomic_type_size(kind);
191 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
192 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
194 case 4: return get_modeF();
195 case 8: return get_modeD();
196 default: panic("unexpected kind");
198 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
200 unsigned bit_size = size * 8;
201 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
202 unsigned modulo_shift = decide_modulo_shift(bit_size);
204 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
205 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
213 * Initialises the atomic modes depending on the machine size.
215 static void init_atomic_modes(void)
217 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
218 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
219 if (atomic_modes[i] != NULL)
221 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
225 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
227 assert(kind <= ATOMIC_TYPE_LAST);
228 return atomic_modes[kind];
231 static ir_node *get_vla_size(array_type_t *const type)
233 ir_node *size_node = type->size_node;
234 if (size_node == NULL) {
235 size_node = expression_to_firm(type->size_expression);
236 type->size_node = size_node;
241 static unsigned count_parameters(const function_type_t *function_type)
245 function_parameter_t *parameter = function_type->parameters;
246 for ( ; parameter != NULL; parameter = parameter->next) {
254 * Creates a Firm type for an atomic type
256 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
258 ir_mode *mode = atomic_modes[akind];
259 type_dbg_info *dbgi = get_type_dbg_info_(type);
260 ir_type *irtype = new_d_type_primitive(mode, dbgi);
261 il_alignment_t alignment = get_atomic_type_alignment(akind);
263 set_type_size_bytes(irtype, get_atomic_type_size(akind));
264 set_type_alignment_bytes(irtype, alignment);
270 * Creates a Firm type for a complex type
272 static ir_type *create_complex_type(const atomic_type_t *type)
274 atomic_type_kind_t kind = type->akind;
275 ir_mode *mode = atomic_modes[kind];
276 ident *id = get_mode_ident(mode);
280 /* FIXME: finish the array */
285 * Creates a Firm type for an imaginary type
287 static ir_type *create_imaginary_type(const atomic_type_t *type)
289 return create_atomic_type(type->akind, (const type_t*)type);
293 * return type of a parameter (and take transparent union gnu extension into
296 static type_t *get_parameter_type(type_t *orig_type)
298 type_t *type = skip_typeref(orig_type);
299 if (is_type_union(type)
300 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
301 compound_t *compound = type->compound.compound;
302 type = compound->members.entities->declaration.type;
308 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
310 type_t *return_type = skip_typeref(function_type->return_type);
312 int n_parameters = count_parameters(function_type)
313 + (for_closure ? 1 : 0);
314 int n_results = is_type_void(return_type) ? 0 : 1;
315 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
316 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
318 if (!is_type_void(return_type)) {
319 ir_type *restype = get_ir_type(return_type);
320 set_method_res_type(irtype, 0, restype);
323 function_parameter_t *parameter = function_type->parameters;
326 ir_type *p_irtype = get_ir_type(type_void_ptr);
327 set_method_param_type(irtype, n, p_irtype);
330 for ( ; parameter != NULL; parameter = parameter->next) {
331 type_t *type = get_parameter_type(parameter->type);
332 ir_type *p_irtype = get_ir_type(type);
333 set_method_param_type(irtype, n, p_irtype);
337 bool is_variadic = function_type->variadic;
340 set_method_variadicity(irtype, variadicity_variadic);
342 unsigned cc = get_method_calling_convention(irtype);
343 switch (function_type->calling_convention) {
344 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
347 set_method_calling_convention(irtype, SET_CDECL(cc));
354 /* only non-variadic function can use stdcall, else use cdecl */
355 set_method_calling_convention(irtype, SET_STDCALL(cc));
361 /* only non-variadic function can use fastcall, else use cdecl */
362 set_method_calling_convention(irtype, SET_FASTCALL(cc));
366 /* Hmm, leave default, not accepted by the parser yet. */
371 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
373 const decl_modifiers_t modifiers = function_type->modifiers;
374 if (modifiers & DM_CONST)
375 add_method_additional_properties(irtype, mtp_property_const);
376 if (modifiers & DM_PURE)
377 add_method_additional_properties(irtype, mtp_property_pure);
378 if (modifiers & DM_RETURNS_TWICE)
379 add_method_additional_properties(irtype, mtp_property_returns_twice);
380 if (modifiers & DM_NORETURN)
381 add_method_additional_properties(irtype, mtp_property_noreturn);
382 if (modifiers & DM_NOTHROW)
383 add_method_additional_properties(irtype, mtp_property_nothrow);
384 if (modifiers & DM_MALLOC)
385 add_method_additional_properties(irtype, mtp_property_malloc);
390 static ir_type *create_pointer_type(pointer_type_t *type)
392 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
393 type_t *points_to = type->points_to;
394 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
395 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
400 static ir_type *create_reference_type(reference_type_t *type)
402 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
403 type_t *refers_to = type->refers_to;
404 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
405 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
410 static ir_type *create_array_type(array_type_t *type)
412 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
413 type_t *element_type = type->element_type;
414 ir_type *ir_element_type = get_ir_type(element_type);
415 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
417 const int align = get_type_alignment_bytes(ir_element_type);
418 set_type_alignment_bytes(irtype, align);
420 if (type->size_constant) {
421 int n_elements = type->size;
423 set_array_bounds_int(irtype, 0, 0, n_elements);
425 size_t elemsize = get_type_size_bytes(ir_element_type);
426 if (elemsize % align > 0) {
427 elemsize += align - (elemsize % align);
429 set_type_size_bytes(irtype, n_elements * elemsize);
431 set_array_lower_bound_int(irtype, 0, 0);
433 set_type_state(irtype, layout_fixed);
439 * Return the signed integer type of size bits.
441 * @param size the size
443 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
447 static ir_mode *s_modes[64 + 1] = {NULL, };
451 if (size <= 0 || size > 64)
454 mode = s_modes[size];
458 snprintf(name, sizeof(name), "bf_I%u", size);
459 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
460 s_modes[size] = mode;
463 type_dbg_info *dbgi = get_type_dbg_info_(type);
464 res = new_d_type_primitive(mode, dbgi);
465 set_primitive_base_type(res, base_tp);
471 * Return the unsigned integer type of size bits.
473 * @param size the size
475 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
479 static ir_mode *u_modes[64 + 1] = {NULL, };
483 if (size <= 0 || size > 64)
486 mode = u_modes[size];
490 snprintf(name, sizeof(name), "bf_U%u", size);
491 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
492 u_modes[size] = mode;
495 type_dbg_info *dbgi = get_type_dbg_info_(type);
496 res = new_d_type_primitive(mode, dbgi);
497 set_primitive_base_type(res, base_tp);
502 static ir_type *create_bitfield_type(const entity_t *entity)
504 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
505 type_t *base = skip_typeref(entity->declaration.type);
506 assert(is_type_integer(base));
507 ir_type *irbase = get_ir_type(base);
509 unsigned bit_size = entity->compound_member.bit_size;
511 if (is_type_signed(base)) {
512 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
514 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
519 * Construct firm type from ast struct type.
521 static ir_type *create_compound_type(compound_type_t *const type, bool const incomplete)
523 compound_t *compound = type->compound;
525 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
526 return compound->irtype;
529 bool const is_union = type->base.kind == TYPE_COMPOUND_UNION;
531 symbol_t *type_symbol = compound->base.symbol;
533 if (type_symbol != NULL) {
534 id = new_id_from_str(type_symbol->string);
537 id = id_unique("__anonymous_union.%u");
539 id = id_unique("__anonymous_struct.%u");
545 irtype = new_type_union(id);
547 irtype = new_type_struct(id);
550 compound->irtype_complete = false;
551 compound->irtype = irtype;
557 layout_union_type(type);
559 layout_struct_type(type);
562 compound->irtype_complete = true;
564 entity_t *entry = compound->members.entities;
565 for ( ; entry != NULL; entry = entry->base.next) {
566 if (entry->kind != ENTITY_COMPOUND_MEMBER)
569 symbol_t *symbol = entry->base.symbol;
570 type_t *entry_type = entry->declaration.type;
572 if (symbol == NULL) {
573 /* anonymous bitfield member, skip */
574 if (entry->compound_member.bitfield)
576 assert(is_type_compound(entry_type));
577 ident = id_unique("anon.%u");
579 ident = new_id_from_str(symbol->string);
582 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
584 ir_type *entry_irtype;
585 if (entry->compound_member.bitfield) {
586 entry_irtype = create_bitfield_type(entry);
588 entry_irtype = get_ir_type(entry_type);
590 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
592 set_entity_offset(entity, entry->compound_member.offset);
593 set_entity_offset_bits_remainder(entity,
594 entry->compound_member.bit_offset);
596 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
597 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
598 entry->compound_member.entity = entity;
601 set_type_alignment_bytes(irtype, compound->alignment);
602 set_type_size_bytes(irtype, compound->size);
603 set_type_state(irtype, layout_fixed);
608 static ir_tarval *fold_constant_to_tarval(expression_t const *);
610 static void determine_enum_values(enum_type_t *const type)
612 ir_mode *const mode = atomic_modes[type->base.akind];
613 ir_tarval *const one = get_mode_one(mode);
614 ir_tarval * tv_next = get_mode_null(mode);
616 enum_t *enume = type->enume;
617 entity_t *entry = enume->base.next;
618 for (; entry != NULL; entry = entry->base.next) {
619 if (entry->kind != ENTITY_ENUM_VALUE)
622 expression_t *const init = entry->enum_value.value;
624 tv_next = fold_constant_to_tarval(init);
626 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
627 entry->enum_value.tv = tv_next;
628 tv_next = tarval_add(tv_next, one);
632 static ir_type *create_enum_type(enum_type_t *const type)
634 return create_atomic_type(type->base.akind, (const type_t*) type);
637 static ir_type *get_ir_type_incomplete(type_t *type)
639 type = skip_typeref(type);
641 if (type->base.firm_type != NULL) {
642 return type->base.firm_type;
645 if (is_type_compound(type)) {
646 return create_compound_type(&type->compound, true);
648 return get_ir_type(type);
652 ir_type *get_ir_type(type_t *type)
654 type = skip_typeref(type);
656 if (type->base.firm_type != NULL) {
657 return type->base.firm_type;
660 ir_type *firm_type = NULL;
661 switch (type->kind) {
663 firm_type = create_atomic_type(type->atomic.akind, type);
666 firm_type = create_complex_type(&type->atomic);
669 firm_type = create_imaginary_type(&type->atomic);
672 firm_type = create_method_type(&type->function, false);
675 firm_type = create_pointer_type(&type->pointer);
678 firm_type = create_reference_type(&type->reference);
681 firm_type = create_array_type(&type->array);
683 case TYPE_COMPOUND_STRUCT:
684 case TYPE_COMPOUND_UNION:
685 firm_type = create_compound_type(&type->compound, false);
688 firm_type = create_enum_type(&type->enumt);
696 if (firm_type == NULL)
697 panic("unknown type found");
699 type->base.firm_type = firm_type;
703 static ir_mode *get_ir_mode_storage(type_t *type)
705 type = skip_typeref(type);
707 /* Firm doesn't report a mode for arrays and structs/unions. */
708 if (!is_type_scalar(type)) {
712 ir_type *const irtype = get_ir_type(type);
713 ir_mode *const mode = get_type_mode(irtype);
714 assert(mode != NULL);
719 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
720 * int that it returns bigger modes for floating point on some platforms
721 * (x87 internally does arithemtic with 80bits)
723 static ir_mode *get_ir_mode_arithmetic(type_t *type)
725 ir_mode *mode = get_ir_mode_storage(type);
726 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
727 return mode_float_arithmetic;
734 * Return a node representing the size of a type.
736 static ir_node *get_type_size_node(type_t *type)
739 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
740 type = skip_typeref(type);
742 if (is_type_array(type) && type->array.is_vla) {
743 ir_node *size_node = get_vla_size(&type->array);
744 ir_node *elem_size = get_type_size_node(type->array.element_type);
745 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
749 size = get_type_size(type);
750 return new_Const_long(mode, size);
753 /** Names of the runtime functions. */
754 static const struct {
755 int id; /**< the rts id */
756 int n_res; /**< number of return values */
757 const char *name; /**< the name of the rts function */
758 int n_params; /**< number of parameters */
759 unsigned flags; /**< language flags */
761 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
762 { rts_abort, 0, "abort", 0, _C89 },
763 { rts_alloca, 1, "alloca", 1, _ALL },
764 { rts_abs, 1, "abs", 1, _C89 },
765 { rts_labs, 1, "labs", 1, _C89 },
766 { rts_llabs, 1, "llabs", 1, _C99 },
767 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
769 { rts_fabs, 1, "fabs", 1, _C89 },
770 { rts_sqrt, 1, "sqrt", 1, _C89 },
771 { rts_cbrt, 1, "cbrt", 1, _C99 },
772 { rts_exp, 1, "exp", 1, _C89 },
773 { rts_exp2, 1, "exp2", 1, _C89 },
774 { rts_exp10, 1, "exp10", 1, _GNUC },
775 { rts_log, 1, "log", 1, _C89 },
776 { rts_log2, 1, "log2", 1, _C89 },
777 { rts_log10, 1, "log10", 1, _C89 },
778 { rts_pow, 1, "pow", 2, _C89 },
779 { rts_sin, 1, "sin", 1, _C89 },
780 { rts_cos, 1, "cos", 1, _C89 },
781 { rts_tan, 1, "tan", 1, _C89 },
782 { rts_asin, 1, "asin", 1, _C89 },
783 { rts_acos, 1, "acos", 1, _C89 },
784 { rts_atan, 1, "atan", 1, _C89 },
785 { rts_sinh, 1, "sinh", 1, _C89 },
786 { rts_cosh, 1, "cosh", 1, _C89 },
787 { rts_tanh, 1, "tanh", 1, _C89 },
789 { rts_fabsf, 1, "fabsf", 1, _C99 },
790 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
791 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
792 { rts_expf, 1, "expf", 1, _C99 },
793 { rts_exp2f, 1, "exp2f", 1, _C99 },
794 { rts_exp10f, 1, "exp10f", 1, _GNUC },
795 { rts_logf, 1, "logf", 1, _C99 },
796 { rts_log2f, 1, "log2f", 1, _C99 },
797 { rts_log10f, 1, "log10f", 1, _C99 },
798 { rts_powf, 1, "powf", 2, _C99 },
799 { rts_sinf, 1, "sinf", 1, _C99 },
800 { rts_cosf, 1, "cosf", 1, _C99 },
801 { rts_tanf, 1, "tanf", 1, _C99 },
802 { rts_asinf, 1, "asinf", 1, _C99 },
803 { rts_acosf, 1, "acosf", 1, _C99 },
804 { rts_atanf, 1, "atanf", 1, _C99 },
805 { rts_sinhf, 1, "sinhf", 1, _C99 },
806 { rts_coshf, 1, "coshf", 1, _C99 },
807 { rts_tanhf, 1, "tanhf", 1, _C99 },
809 { rts_fabsl, 1, "fabsl", 1, _C99 },
810 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
811 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
812 { rts_expl, 1, "expl", 1, _C99 },
813 { rts_exp2l, 1, "exp2l", 1, _C99 },
814 { rts_exp10l, 1, "exp10l", 1, _GNUC },
815 { rts_logl, 1, "logl", 1, _C99 },
816 { rts_log2l, 1, "log2l", 1, _C99 },
817 { rts_log10l, 1, "log10l", 1, _C99 },
818 { rts_powl, 1, "powl", 2, _C99 },
819 { rts_sinl, 1, "sinl", 1, _C99 },
820 { rts_cosl, 1, "cosl", 1, _C99 },
821 { rts_tanl, 1, "tanl", 1, _C99 },
822 { rts_asinl, 1, "asinl", 1, _C99 },
823 { rts_acosl, 1, "acosl", 1, _C99 },
824 { rts_atanl, 1, "atanl", 1, _C99 },
825 { rts_sinhl, 1, "sinhl", 1, _C99 },
826 { rts_coshl, 1, "coshl", 1, _C99 },
827 { rts_tanhl, 1, "tanhl", 1, _C99 },
829 { rts_strcmp, 1, "strcmp", 2, _C89 },
830 { rts_strncmp, 1, "strncmp", 3, _C89 },
831 { rts_strcpy, 1, "strcpy", 2, _C89 },
832 { rts_strlen, 1, "strlen", 1, _C89 },
833 { rts_memcpy, 1, "memcpy", 3, _C89 },
834 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
835 { rts_memmove, 1, "memmove", 3, _C89 },
836 { rts_memset, 1, "memset", 3, _C89 },
837 { rts_memcmp, 1, "memcmp", 3, _C89 },
840 static ident *rts_idents[lengthof(rts_data)];
842 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
844 void set_create_ld_ident(ident *(*func)(entity_t*))
846 create_ld_ident = func;
849 static bool declaration_is_definition(const entity_t *entity)
851 switch (entity->kind) {
852 case ENTITY_VARIABLE:
853 return entity->declaration.storage_class != STORAGE_CLASS_EXTERN;
854 case ENTITY_FUNCTION:
855 return entity->function.statement != NULL;
856 case ENTITY_PARAMETER:
857 case ENTITY_COMPOUND_MEMBER:
861 case ENTITY_ENUM_VALUE:
862 case ENTITY_NAMESPACE:
864 case ENTITY_LOCAL_LABEL:
867 panic("declaration_is_definition called on non-declaration");
871 * Handle GNU attributes for entities
873 * @param ent the entity
874 * @param decl the routine declaration
876 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
878 assert(is_declaration(entity));
879 decl_modifiers_t modifiers = entity->declaration.modifiers;
881 if (is_method_entity(irentity)) {
882 if (modifiers & DM_PURE) {
883 set_entity_additional_properties(irentity, mtp_property_pure);
885 if (modifiers & DM_CONST) {
886 add_entity_additional_properties(irentity, mtp_property_const);
889 if ((modifiers & DM_USED) && declaration_is_definition(entity)) {
890 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
892 if ((modifiers & DM_WEAK) && declaration_is_definition(entity)
893 && entity->declaration.storage_class != STORAGE_CLASS_EXTERN) {
894 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
898 static bool is_main(entity_t *entity)
900 static symbol_t *sym_main = NULL;
901 if (sym_main == NULL) {
902 sym_main = symbol_table_insert("main");
905 if (entity->base.symbol != sym_main)
907 /* must be in outermost scope */
908 if (entity->base.parent_scope != ¤t_translation_unit->scope)
915 * Creates an entity representing a function.
917 * @param entity the function declaration/definition
918 * @param owner_type the owner type of this function, NULL
919 * for global functions
921 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
923 assert(entity->kind == ENTITY_FUNCTION);
924 if (entity->function.irentity != NULL)
925 return entity->function.irentity;
927 switch (entity->function.btk) {
930 case BUILTIN_LIBC_CHECK:
936 symbol_t *symbol = entity->base.symbol;
937 ident *id = new_id_from_str(symbol->string);
939 /* already an entity defined? */
940 ir_entity *irentity = entitymap_get(&entitymap, symbol);
941 bool const has_body = entity->function.statement != NULL;
942 if (irentity != NULL) {
946 ir_type *ir_type_method;
947 if (entity->function.need_closure)
948 ir_type_method = create_method_type(&entity->declaration.type->function, true);
950 ir_type_method = get_ir_type(entity->declaration.type);
952 bool nested_function = false;
953 if (owner_type == NULL)
954 owner_type = get_glob_type();
956 nested_function = true;
958 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
959 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
963 ld_id = id_unique("inner.%u");
965 ld_id = create_ld_ident(entity);
966 set_entity_ld_ident(irentity, ld_id);
968 handle_decl_modifiers(irentity, entity);
970 if (! nested_function) {
971 storage_class_tag_t const storage_class
972 = (storage_class_tag_t) entity->declaration.storage_class;
973 if (storage_class == STORAGE_CLASS_STATIC) {
974 set_entity_visibility(irentity, ir_visibility_local);
976 set_entity_visibility(irentity, ir_visibility_external);
979 bool const is_inline = entity->function.is_inline;
980 if (is_inline && has_body) {
981 if (((c_mode & _C99) && storage_class == STORAGE_CLASS_NONE)
982 || ((c_mode & _C99) == 0
983 && storage_class == STORAGE_CLASS_EXTERN)) {
984 add_entity_linkage(irentity, IR_LINKAGE_NO_CODEGEN);
988 /* nested functions are always local */
989 set_entity_visibility(irentity, ir_visibility_local);
992 /* We should check for file scope here, but as long as we compile C only
993 this is not needed. */
994 if (!freestanding && !has_body) {
995 /* check for a known runtime function */
996 for (size_t i = 0; i < lengthof(rts_data); ++i) {
997 if (id != rts_idents[i])
1000 function_type_t *function_type
1001 = &entity->declaration.type->function;
1002 /* rts_entities code can't handle a "wrong" number of parameters */
1003 if (function_type->unspecified_parameters)
1006 /* check number of parameters */
1007 int n_params = count_parameters(function_type);
1008 if (n_params != rts_data[i].n_params)
1011 type_t *return_type = skip_typeref(function_type->return_type);
1012 int n_res = is_type_void(return_type) ? 0 : 1;
1013 if (n_res != rts_data[i].n_res)
1016 /* ignore those rts functions not necessary needed for current mode */
1017 if ((c_mode & rts_data[i].flags) == 0)
1019 assert(rts_entities[rts_data[i].id] == NULL);
1020 rts_entities[rts_data[i].id] = irentity;
1024 entitymap_insert(&entitymap, symbol, irentity);
1027 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1028 entity->function.irentity = irentity;
1034 * Creates a SymConst for a given entity.
1036 * @param dbgi debug info
1037 * @param entity the entity
1039 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1041 assert(entity != NULL);
1042 union symconst_symbol sym;
1043 sym.entity_p = entity;
1044 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1047 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1049 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1052 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1055 if (is_Const(value)) {
1056 return create_Const_from_bool(dest_mode, !is_Const_null(value));
1059 ir_node *cond = new_d_Cond(dbgi, value);
1060 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1061 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1062 ir_node *tblock = new_Block(1, &proj_true);
1063 ir_node *fblock = new_Block(1, &proj_false);
1064 set_cur_block(tblock);
1065 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1066 ir_node *tjump = new_Jmp();
1067 set_cur_block(fblock);
1068 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1069 ir_node *fjump = new_Jmp();
1071 ir_node *in[2] = { tjump, fjump };
1072 ir_node *mergeblock = new_Block(2, in);
1073 set_cur_block(mergeblock);
1074 ir_node *phi_in[2] = { const1, const0 };
1075 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1079 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1081 ir_mode *value_mode = get_irn_mode(value);
1083 if (value_mode == dest_mode)
1086 if (dest_mode == mode_b) {
1087 ir_node *zero = new_Const(get_mode_null(value_mode));
1088 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_unordered_less_greater);
1090 } else if (value_mode == mode_b) {
1091 return create_conv_from_b(dbgi, value, dest_mode);
1094 return new_d_Conv(dbgi, value, dest_mode);
1098 * Creates a SymConst node representing a string constant.
1100 * @param src_pos the source position of the string constant
1101 * @param id_prefix a prefix for the name of the generated string constant
1102 * @param value the value of the string constant
1104 static ir_node *string_to_firm(source_position_t const *const src_pos, char const *const id_prefix, string_encoding_t const enc, string_t const *const value)
1106 size_t const slen = get_string_len(enc, value) + 1;
1107 ir_initializer_t *const initializer = create_initializer_compound(slen);
1108 ir_type * elem_type;
1110 case STRING_ENCODING_CHAR: {
1111 elem_type = ir_type_char;
1113 ir_mode *const mode = get_type_mode(elem_type);
1114 char const *p = value->begin;
1115 for (size_t i = 0; i < slen; ++i) {
1116 ir_tarval *tv = new_tarval_from_long(*p++, mode);
1117 ir_initializer_t *val = create_initializer_tarval(tv);
1118 set_initializer_compound_value(initializer, i, val);
1123 case STRING_ENCODING_WIDE: {
1124 elem_type = ir_type_wchar_t;
1126 ir_mode *const mode = get_type_mode(elem_type);
1127 char const *p = value->begin;
1128 for (size_t i = 0; i < slen; ++i) {
1129 assert(p <= value->begin + value->size);
1130 utf32 v = read_utf8_char(&p);
1131 ir_tarval *tv = new_tarval_from_long(v, mode);
1132 ir_initializer_t *val = create_initializer_tarval(tv);
1133 set_initializer_compound_value(initializer, i, val);
1138 panic("invalid string encoding");
1141 ir_type *const type = new_type_array(1, elem_type);
1142 set_array_bounds_int(type, 0, 0, slen);
1143 set_type_size_bytes( type, slen * get_type_size_bytes(elem_type));
1144 set_type_state( type, layout_fixed);
1146 ir_type *const global_type = get_glob_type();
1147 ident *const id = id_unique(id_prefix);
1148 dbg_info *const dbgi = get_dbg_info(src_pos);
1149 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1150 set_entity_ld_ident( entity, id);
1151 set_entity_visibility( entity, ir_visibility_private);
1152 add_entity_linkage( entity, IR_LINKAGE_CONSTANT);
1153 set_entity_initializer(entity, initializer);
1155 return create_symconst(dbgi, entity);
1158 static bool try_create_integer(literal_expression_t *literal, type_t *type)
1160 const char *string = literal->value.begin;
1161 size_t size = literal->value.size;
1163 assert(type->kind == TYPE_ATOMIC);
1164 atomic_type_kind_t akind = type->atomic.akind;
1166 ir_mode *const mode = atomic_modes[akind];
1167 ir_tarval *const tv = new_tarval_from_str(string, size, mode);
1168 if (tv == tarval_bad)
1171 literal->base.type = type;
1172 literal->target_value = tv;
1176 static void create_integer_tarval(literal_expression_t *literal)
1178 /* -1: signed only, 0: any, 1: unsigned only */
1179 int sign = literal->value.begin[0] != '0' /* decimal */ ? -1 : 0;
1181 const string_t *suffix = &literal->suffix;
1183 if (suffix->size > 0) {
1184 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1185 if (*c == 'u' || *c == 'U') sign = 1;
1186 if (*c == 'l' || *c == 'L') { ++ls; }
1190 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1192 /* now try if the constant is small enough for some types */
1193 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1195 if (sign <= 0 && try_create_integer(literal, type_int))
1197 if (sign >= 0 && try_create_integer(literal, type_unsigned_int))
1201 if (sign <= 0 && try_create_integer(literal, type_long))
1203 if (sign >= 0 && try_create_integer(literal, type_unsigned_long))
1206 /* last try? then we should not report tarval_bad */
1208 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1209 if (sign <= 0 && try_create_integer(literal, type_long_long))
1214 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1215 bool res = try_create_integer(literal, type_unsigned_long_long);
1217 panic("internal error when parsing number literal");
1220 tarval_set_integer_overflow_mode(old_mode);
1223 void determine_literal_type(literal_expression_t *literal)
1225 switch (literal->base.kind) {
1226 case EXPR_LITERAL_INTEGER:
1227 create_integer_tarval(literal);
1235 * Creates a Const node representing a constant.
1237 static ir_node *literal_to_firm(const literal_expression_t *literal)
1239 type_t *type = skip_typeref(literal->base.type);
1240 ir_mode *mode = get_ir_mode_storage(type);
1241 const char *string = literal->value.begin;
1242 size_t size = literal->value.size;
1245 switch (literal->base.kind) {
1246 case EXPR_LITERAL_INTEGER:
1247 assert(literal->target_value != NULL);
1248 tv = literal->target_value;
1251 case EXPR_LITERAL_FLOATINGPOINT:
1252 tv = new_tarval_from_str(string, size, mode);
1255 case EXPR_LITERAL_BOOLEAN:
1256 if (string[0] == 't') {
1257 tv = get_mode_one(mode);
1259 assert(string[0] == 'f');
1260 case EXPR_LITERAL_MS_NOOP:
1261 tv = get_mode_null(mode);
1266 panic("Invalid literal kind found");
1269 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1270 ir_node *res = new_d_Const(dbgi, tv);
1271 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1272 return create_conv(dbgi, res, mode_arith);
1276 * Creates a Const node representing a character constant.
1278 static ir_node *char_literal_to_firm(string_literal_expression_t const *literal)
1280 type_t *type = skip_typeref(literal->base.type);
1281 ir_mode *mode = get_ir_mode_storage(type);
1282 const char *string = literal->value.begin;
1283 size_t size = literal->value.size;
1286 switch (literal->encoding) {
1287 case STRING_ENCODING_WIDE: {
1288 utf32 v = read_utf8_char(&string);
1290 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1292 tv = new_tarval_from_str(buf, len, mode);
1296 case STRING_ENCODING_CHAR: {
1299 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1300 if (size == 1 && char_is_signed) {
1301 v = (signed char)string[0];
1304 for (size_t i = 0; i < size; ++i) {
1305 v = (v << 8) | ((unsigned char)string[i]);
1309 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1311 tv = new_tarval_from_str(buf, len, mode);
1316 panic("Invalid literal kind found");
1319 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1320 ir_node *res = new_d_Const(dbgi, tv);
1321 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1322 return create_conv(dbgi, res, mode_arith);
1326 * Allocate an area of size bytes aligned at alignment
1329 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1331 static unsigned area_cnt = 0;
1334 ir_type *tp = new_type_array(1, ir_type_char);
1335 set_array_bounds_int(tp, 0, 0, size);
1336 set_type_alignment_bytes(tp, alignment);
1338 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1339 ident *name = new_id_from_str(buf);
1340 ir_entity *area = new_entity(frame_type, name, tp);
1342 /* mark this entity as compiler generated */
1343 set_entity_compiler_generated(area, 1);
1348 * Return a node representing a trampoline region
1349 * for a given function entity.
1351 * @param dbgi debug info
1352 * @param entity the function entity
1354 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1356 ir_entity *region = NULL;
1359 if (current_trampolines != NULL) {
1360 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1361 if (current_trampolines[i].function == entity) {
1362 region = current_trampolines[i].region;
1367 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1369 ir_graph *irg = current_ir_graph;
1370 if (region == NULL) {
1371 /* create a new region */
1372 ir_type *frame_tp = get_irg_frame_type(irg);
1373 trampoline_region reg;
1374 reg.function = entity;
1376 reg.region = alloc_trampoline(frame_tp,
1377 be_params->trampoline_size,
1378 be_params->trampoline_align);
1379 ARR_APP1(trampoline_region, current_trampolines, reg);
1380 region = reg.region;
1382 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1387 * Creates a trampoline for a function represented by an entity.
1389 * @param dbgi debug info
1390 * @param mode the (reference) mode for the function address
1391 * @param entity the function entity
1393 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1396 assert(entity != NULL);
1398 in[0] = get_trampoline_region(dbgi, entity);
1399 in[1] = create_symconst(dbgi, entity);
1400 in[2] = get_irg_frame(current_ir_graph);
1402 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1403 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1404 return new_Proj(irn, mode, pn_Builtin_max+1);
1408 * Dereference an address.
1410 * @param dbgi debug info
1411 * @param type the type of the dereferenced result (the points_to type)
1412 * @param addr the address to dereference
1414 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1415 ir_node *const addr)
1417 type_t *skipped = skip_typeref(type);
1418 if (is_type_incomplete(skipped))
1421 ir_type *irtype = get_ir_type(skipped);
1422 if (is_compound_type(irtype)
1423 || is_Method_type(irtype)
1424 || is_Array_type(irtype)) {
1428 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1429 ? cons_volatile : cons_none;
1430 ir_mode *const mode = get_type_mode(irtype);
1431 ir_node *const memory = get_store();
1432 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1433 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1434 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1436 set_store(load_mem);
1438 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1439 return create_conv(dbgi, load_res, mode_arithmetic);
1443 * Creates a strict Conv (to the node's mode) if necessary.
1445 * @param dbgi debug info
1446 * @param node the node to strict conv
1448 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1450 ir_mode *mode = get_irn_mode(node);
1452 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1454 if (!mode_is_float(mode))
1457 /* check if there is already a Conv */
1458 if (is_Conv(node)) {
1459 /* convert it into a strict Conv */
1460 set_Conv_strict(node, 1);
1464 /* otherwise create a new one */
1465 return new_d_strictConv(dbgi, node, mode);
1469 * Returns the correct base address depending on whether it is a parameter or a
1470 * normal local variable.
1472 static ir_node *get_local_frame(ir_entity *const ent)
1474 ir_graph *const irg = current_ir_graph;
1475 const ir_type *const owner = get_entity_owner(ent);
1476 if (owner == current_outer_frame) {
1477 assert(current_static_link != NULL);
1478 return current_static_link;
1480 return get_irg_frame(irg);
1485 * Keep all memory edges of the given block.
1487 static void keep_all_memory(ir_node *block)
1489 ir_node *old = get_cur_block();
1491 set_cur_block(block);
1492 keep_alive(get_store());
1493 /* TODO: keep all memory edges from restricted pointers */
1497 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1499 entity_t *entity = ref->entity;
1500 if (entity->enum_value.tv == NULL) {
1501 type_t *type = skip_typeref(entity->enum_value.enum_type);
1502 assert(type->kind == TYPE_ENUM);
1503 determine_enum_values(&type->enumt);
1506 return new_Const(entity->enum_value.tv);
1509 static ir_node *reference_addr(const reference_expression_t *ref)
1511 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1512 entity_t *entity = ref->entity;
1513 assert(is_declaration(entity));
1515 if (entity->kind == ENTITY_FUNCTION
1516 && entity->function.btk != BUILTIN_NONE) {
1517 ir_entity *irentity = get_function_entity(entity, NULL);
1518 /* for gcc compatibility we have to produce (dummy) addresses for some
1519 * builtins which don't have entities */
1520 if (irentity == NULL) {
1521 source_position_t const *const pos = &ref->base.source_position;
1522 warningf(WARN_OTHER, pos, "taking address of builtin '%N'", ref->entity);
1524 /* simply create a NULL pointer */
1525 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1526 ir_node *res = new_Const(get_mode_null(mode));
1532 switch((declaration_kind_t) entity->declaration.kind) {
1533 case DECLARATION_KIND_UNKNOWN:
1535 case DECLARATION_KIND_PARAMETER:
1536 case DECLARATION_KIND_LOCAL_VARIABLE:
1537 /* you can store to a local variable (so we don't panic but return NULL
1538 * as an indicator for no real address) */
1540 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1541 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1545 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
1546 case DECLARATION_KIND_PARAMETER_ENTITY: {
1547 ir_entity *irentity = entity->variable.v.entity;
1548 ir_node *frame = get_local_frame(irentity);
1549 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1553 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1554 return entity->variable.v.vla_base;
1556 case DECLARATION_KIND_FUNCTION: {
1557 return create_symconst(dbgi, entity->function.irentity);
1560 case DECLARATION_KIND_INNER_FUNCTION: {
1561 type_t *const type = skip_typeref(entity->declaration.type);
1562 ir_mode *const mode = get_ir_mode_storage(type);
1563 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1564 /* inner function not using the closure */
1565 return create_symconst(dbgi, entity->function.irentity);
1567 /* need trampoline here */
1568 return create_trampoline(dbgi, mode, entity->function.irentity);
1572 case DECLARATION_KIND_COMPOUND_MEMBER:
1573 panic("not implemented reference type");
1576 panic("reference to declaration with unknown type found");
1579 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1581 dbg_info *const dbgi = get_dbg_info(&ref->base.source_position);
1582 entity_t *const entity = ref->entity;
1583 assert(is_declaration(entity));
1585 switch ((declaration_kind_t)entity->declaration.kind) {
1586 case DECLARATION_KIND_LOCAL_VARIABLE:
1587 case DECLARATION_KIND_PARAMETER: {
1588 type_t *const type = skip_typeref(entity->declaration.type);
1589 ir_mode *const mode = get_ir_mode_storage(type);
1590 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1591 return create_conv(dbgi, value, get_ir_mode_arithmetic(type));
1595 ir_node *const addr = reference_addr(ref);
1596 return deref_address(dbgi, entity->declaration.type, addr);
1602 * Transform calls to builtin functions.
1604 static ir_node *process_builtin_call(const call_expression_t *call)
1606 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1608 assert(call->function->kind == EXPR_REFERENCE);
1609 reference_expression_t *builtin = &call->function->reference;
1611 type_t *expr_type = skip_typeref(builtin->base.type);
1612 assert(is_type_pointer(expr_type));
1614 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1616 switch (builtin->entity->function.btk) {
1619 case BUILTIN_ALLOCA: {
1620 expression_t *argument = call->arguments->expression;
1621 ir_node *size = expression_to_firm(argument);
1623 ir_node *store = get_store();
1624 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1626 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1628 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1633 type_t *type = function_type->function.return_type;
1634 ir_mode *mode = get_ir_mode_arithmetic(type);
1635 ir_tarval *tv = get_mode_infinite(mode);
1636 ir_node *res = new_d_Const(dbgi, tv);
1640 /* Ignore string for now... */
1641 assert(is_type_function(function_type));
1642 type_t *type = function_type->function.return_type;
1643 ir_mode *mode = get_ir_mode_arithmetic(type);
1644 ir_tarval *tv = get_mode_NAN(mode);
1645 ir_node *res = new_d_Const(dbgi, tv);
1648 case BUILTIN_EXPECT: {
1649 expression_t *argument = call->arguments->expression;
1650 return _expression_to_firm(argument);
1652 case BUILTIN_VA_END:
1653 /* evaluate the argument of va_end for its side effects */
1654 _expression_to_firm(call->arguments->expression);
1656 case BUILTIN_OBJECT_SIZE: {
1657 /* determine value of "type" */
1658 expression_t *type_expression = call->arguments->next->expression;
1659 long type_val = fold_constant_to_int(type_expression);
1660 type_t *type = function_type->function.return_type;
1661 ir_mode *mode = get_ir_mode_arithmetic(type);
1662 /* just produce a "I don't know" result */
1663 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1664 get_mode_minus_one(mode);
1666 return new_d_Const(dbgi, result);
1668 case BUILTIN_ROTL: {
1669 ir_node *val = expression_to_firm(call->arguments->expression);
1670 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1671 ir_mode *mode = get_irn_mode(val);
1672 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1673 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1675 case BUILTIN_ROTR: {
1676 ir_node *val = expression_to_firm(call->arguments->expression);
1677 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1678 ir_mode *mode = get_irn_mode(val);
1679 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1680 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1681 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1682 return new_d_Rotl(dbgi, val, sub, mode);
1687 case BUILTIN_LIBC_CHECK:
1688 panic("builtin did not produce an entity");
1690 panic("invalid builtin found");
1694 * Transform a call expression.
1695 * Handles some special cases, like alloca() calls, which must be resolved
1696 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1697 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1700 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1702 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1703 assert(currently_reachable());
1705 expression_t *function = call->function;
1706 ir_node *callee = NULL;
1707 bool firm_builtin = false;
1708 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1709 if (function->kind == EXPR_REFERENCE) {
1710 const reference_expression_t *ref = &function->reference;
1711 entity_t *entity = ref->entity;
1713 if (entity->kind == ENTITY_FUNCTION) {
1714 builtin_kind_t builtin = entity->function.btk;
1715 if (builtin == BUILTIN_FIRM) {
1716 firm_builtin = true;
1717 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1718 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1719 && builtin != BUILTIN_LIBC_CHECK) {
1720 return process_builtin_call(call);
1725 callee = expression_to_firm(function);
1727 type_t *type = skip_typeref(function->base.type);
1728 assert(is_type_pointer(type));
1729 pointer_type_t *pointer_type = &type->pointer;
1730 type_t *points_to = skip_typeref(pointer_type->points_to);
1731 assert(is_type_function(points_to));
1732 function_type_t *function_type = &points_to->function;
1734 int n_parameters = 0;
1735 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1736 ir_type *new_method_type = NULL;
1737 if (function_type->variadic || function_type->unspecified_parameters) {
1738 const call_argument_t *argument = call->arguments;
1739 for ( ; argument != NULL; argument = argument->next) {
1743 /* we need to construct a new method type matching the call
1745 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1746 int n_res = get_method_n_ress(ir_method_type);
1747 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1748 set_method_calling_convention(new_method_type,
1749 get_method_calling_convention(ir_method_type));
1750 set_method_additional_properties(new_method_type,
1751 get_method_additional_properties(ir_method_type));
1752 set_method_variadicity(new_method_type,
1753 get_method_variadicity(ir_method_type));
1755 for (int i = 0; i < n_res; ++i) {
1756 set_method_res_type(new_method_type, i,
1757 get_method_res_type(ir_method_type, i));
1759 argument = call->arguments;
1760 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1761 expression_t *expression = argument->expression;
1762 ir_type *irtype = get_ir_type(expression->base.type);
1763 set_method_param_type(new_method_type, i, irtype);
1765 ir_method_type = new_method_type;
1767 n_parameters = get_method_n_params(ir_method_type);
1770 ir_node *in[n_parameters];
1772 const call_argument_t *argument = call->arguments;
1773 for (int n = 0; n < n_parameters; ++n) {
1774 expression_t *expression = argument->expression;
1775 ir_node *arg_node = expression_to_firm(expression);
1777 type_t *arg_type = skip_typeref(expression->base.type);
1778 if (!is_type_compound(arg_type)) {
1779 ir_mode *const mode = get_ir_mode_storage(arg_type);
1780 arg_node = create_conv(dbgi, arg_node, mode);
1781 arg_node = do_strict_conv(dbgi, arg_node);
1786 argument = argument->next;
1790 if (function_type->modifiers & DM_CONST) {
1791 store = get_irg_no_mem(current_ir_graph);
1793 store = get_store();
1797 type_t *return_type = skip_typeref(function_type->return_type);
1798 ir_node *result = NULL;
1800 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1802 if (! (function_type->modifiers & DM_CONST)) {
1803 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1807 if (!is_type_void(return_type)) {
1808 assert(is_type_scalar(return_type));
1809 ir_mode *mode = get_ir_mode_storage(return_type);
1810 result = new_Proj(node, mode, pn_Builtin_max+1);
1811 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1812 result = create_conv(NULL, result, mode_arith);
1815 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1816 if (! (function_type->modifiers & DM_CONST)) {
1817 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1821 if (!is_type_void(return_type)) {
1822 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1823 ir_mode *const mode = get_ir_mode_storage(return_type);
1824 result = new_Proj(resproj, mode, 0);
1825 ir_mode *const mode_arith = get_ir_mode_arithmetic(return_type);
1826 result = create_conv(NULL, result, mode_arith);
1830 if (function_type->modifiers & DM_NORETURN) {
1831 /* A dead end: Keep the Call and the Block. Also place all further
1832 * nodes into a new and unreachable block. */
1834 keep_alive(get_cur_block());
1835 ir_node *block = new_Block(0, NULL);
1836 set_cur_block(block);
1842 static ir_node *statement_to_firm(statement_t *statement);
1843 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1845 static ir_node *expression_to_addr(const expression_t *expression);
1846 static ir_node *create_condition_evaluation(const expression_t *expression,
1847 ir_node *true_block,
1848 ir_node *false_block);
1850 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1853 if (!is_type_compound(type)) {
1854 ir_mode *mode = get_ir_mode_storage(type);
1855 value = create_conv(dbgi, value, mode);
1856 value = do_strict_conv(dbgi, value);
1859 ir_node *memory = get_store();
1861 if (is_type_scalar(type)) {
1862 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1863 ? cons_volatile : cons_none;
1864 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1865 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1866 set_store(store_mem);
1868 ir_type *irtype = get_ir_type(type);
1869 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1870 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1871 set_store(copyb_mem);
1875 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1877 ir_tarval *all_one = get_mode_all_one(mode);
1878 int mode_size = get_mode_size_bits(mode);
1879 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1881 assert(offset >= 0);
1883 assert(offset + size <= mode_size);
1884 if (size == mode_size) {
1888 long shiftr = get_mode_size_bits(mode) - size;
1889 long shiftl = offset;
1890 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1891 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1892 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1893 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1898 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1899 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1902 ir_type *entity_type = get_entity_type(entity);
1903 ir_type *base_type = get_primitive_base_type(entity_type);
1904 ir_mode *mode = get_type_mode(base_type);
1905 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1907 value = create_conv(dbgi, value, mode);
1909 /* kill upper bits of value and shift to right position */
1910 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1911 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1912 unsigned base_bits = get_mode_size_bits(mode);
1913 unsigned shiftwidth = base_bits - bitsize;
1915 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1916 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1918 unsigned shrwidth = base_bits - bitsize - bitoffset;
1919 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
1920 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
1922 /* load current value */
1923 ir_node *mem = get_store();
1924 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
1925 set_volatile ? cons_volatile : cons_none);
1926 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1927 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1928 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
1929 ir_tarval *inv_mask = tarval_not(shift_mask);
1930 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
1931 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
1933 /* construct new value and store */
1934 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
1935 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
1936 set_volatile ? cons_volatile : cons_none);
1937 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1938 set_store(store_mem);
1944 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
1945 if (mode_is_signed(mode)) {
1946 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
1948 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
1953 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
1956 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
1957 entity_t *entity = expression->compound_entry;
1958 type_t *base_type = entity->declaration.type;
1959 ir_mode *mode = get_ir_mode_storage(base_type);
1960 ir_node *mem = get_store();
1961 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
1962 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1963 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1964 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1966 ir_mode *amode = mode;
1967 /* optimisation, since shifting in modes < machine_size is usually
1969 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
1972 unsigned amode_size = get_mode_size_bits(amode);
1973 load_res = create_conv(dbgi, load_res, amode);
1975 set_store(load_mem);
1977 /* kill upper bits */
1978 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
1979 unsigned bitoffset = entity->compound_member.bit_offset;
1980 unsigned bitsize = entity->compound_member.bit_size;
1981 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
1982 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
1983 ir_node *countl = new_d_Const(dbgi, tvl);
1984 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
1986 unsigned shift_bitsr = bitoffset + shift_bitsl;
1987 assert(shift_bitsr <= amode_size);
1988 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
1989 ir_node *countr = new_d_Const(dbgi, tvr);
1991 if (mode_is_signed(mode)) {
1992 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
1994 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
1997 type_t *type = expression->base.type;
1998 ir_mode *resmode = get_ir_mode_arithmetic(type);
1999 return create_conv(dbgi, shiftr, resmode);
2002 /* make sure the selected compound type is constructed */
2003 static void construct_select_compound(const select_expression_t *expression)
2005 type_t *type = skip_typeref(expression->compound->base.type);
2006 if (is_type_pointer(type)) {
2007 type = type->pointer.points_to;
2009 (void) get_ir_type(type);
2012 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2013 ir_node *value, ir_node *addr)
2015 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2016 type_t *type = skip_typeref(expression->base.type);
2018 if (!is_type_compound(type)) {
2019 ir_mode *mode = get_ir_mode_storage(type);
2020 value = create_conv(dbgi, value, mode);
2021 value = do_strict_conv(dbgi, value);
2024 if (expression->kind == EXPR_REFERENCE) {
2025 const reference_expression_t *ref = &expression->reference;
2027 entity_t *entity = ref->entity;
2028 assert(is_declaration(entity));
2029 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2030 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2031 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2032 set_value(entity->variable.v.value_number, value);
2038 addr = expression_to_addr(expression);
2039 assert(addr != NULL);
2041 if (expression->kind == EXPR_SELECT) {
2042 const select_expression_t *select = &expression->select;
2044 construct_select_compound(select);
2046 entity_t *entity = select->compound_entry;
2047 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2048 if (entity->compound_member.bitfield) {
2049 ir_entity *irentity = entity->compound_member.entity;
2051 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2052 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2053 set_volatile, true);
2058 assign_value(dbgi, addr, type, value);
2062 static void set_value_for_expression(const expression_t *expression,
2065 set_value_for_expression_addr(expression, value, NULL);
2068 static ir_node *get_value_from_lvalue(const expression_t *expression,
2071 if (expression->kind == EXPR_REFERENCE) {
2072 const reference_expression_t *ref = &expression->reference;
2074 entity_t *entity = ref->entity;
2075 assert(entity->kind == ENTITY_VARIABLE
2076 || entity->kind == ENTITY_PARAMETER);
2077 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2079 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2080 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2081 value_number = entity->variable.v.value_number;
2082 assert(addr == NULL);
2083 type_t *type = skip_typeref(expression->base.type);
2084 ir_mode *mode = get_ir_mode_storage(type);
2085 ir_node *res = get_value(value_number, mode);
2086 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2090 assert(addr != NULL);
2091 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2094 if (expression->kind == EXPR_SELECT &&
2095 expression->select.compound_entry->compound_member.bitfield) {
2096 construct_select_compound(&expression->select);
2097 value = bitfield_extract_to_firm(&expression->select, addr);
2099 value = deref_address(dbgi, expression->base.type, addr);
2106 static ir_node *create_incdec(const unary_expression_t *expression)
2108 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2109 const expression_t *value_expr = expression->value;
2110 ir_node *addr = expression_to_addr(value_expr);
2111 ir_node *value = get_value_from_lvalue(value_expr, addr);
2113 type_t *type = skip_typeref(expression->base.type);
2114 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2117 if (is_type_pointer(type)) {
2118 pointer_type_t *pointer_type = &type->pointer;
2119 offset = get_type_size_node(pointer_type->points_to);
2121 assert(is_type_arithmetic(type));
2122 offset = new_Const(get_mode_one(mode));
2126 ir_node *store_value;
2127 switch(expression->base.kind) {
2128 case EXPR_UNARY_POSTFIX_INCREMENT:
2130 store_value = new_d_Add(dbgi, value, offset, mode);
2132 case EXPR_UNARY_POSTFIX_DECREMENT:
2134 store_value = new_d_Sub(dbgi, value, offset, mode);
2136 case EXPR_UNARY_PREFIX_INCREMENT:
2137 result = new_d_Add(dbgi, value, offset, mode);
2138 store_value = result;
2140 case EXPR_UNARY_PREFIX_DECREMENT:
2141 result = new_d_Sub(dbgi, value, offset, mode);
2142 store_value = result;
2145 panic("no incdec expr in create_incdec");
2148 set_value_for_expression_addr(value_expr, store_value, addr);
2153 static bool is_local_variable(expression_t *expression)
2155 if (expression->kind != EXPR_REFERENCE)
2157 reference_expression_t *ref_expr = &expression->reference;
2158 entity_t *entity = ref_expr->entity;
2159 if (entity->kind != ENTITY_VARIABLE)
2161 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2162 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2165 static ir_relation get_relation(const expression_kind_t kind)
2168 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2169 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2170 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2171 case EXPR_BINARY_ISLESS:
2172 case EXPR_BINARY_LESS: return ir_relation_less;
2173 case EXPR_BINARY_ISLESSEQUAL:
2174 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2175 case EXPR_BINARY_ISGREATER:
2176 case EXPR_BINARY_GREATER: return ir_relation_greater;
2177 case EXPR_BINARY_ISGREATEREQUAL:
2178 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2179 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2184 panic("trying to get ir_relation from non-comparison binexpr type");
2188 * Handle the assume optimizer hint: check if a Confirm
2189 * node can be created.
2191 * @param dbi debug info
2192 * @param expr the IL assume expression
2194 * we support here only some simple cases:
2199 static ir_node *handle_assume_compare(dbg_info *dbi,
2200 const binary_expression_t *expression)
2202 expression_t *op1 = expression->left;
2203 expression_t *op2 = expression->right;
2204 entity_t *var2, *var = NULL;
2205 ir_node *res = NULL;
2206 ir_relation relation = get_relation(expression->base.kind);
2208 if (is_local_variable(op1) && is_local_variable(op2)) {
2209 var = op1->reference.entity;
2210 var2 = op2->reference.entity;
2212 type_t *const type = skip_typeref(var->declaration.type);
2213 ir_mode *const mode = get_ir_mode_storage(type);
2215 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2216 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2218 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2219 set_value(var2->variable.v.value_number, res);
2221 res = new_d_Confirm(dbi, irn1, irn2, relation);
2222 set_value(var->variable.v.value_number, res);
2227 expression_t *con = NULL;
2228 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2229 var = op1->reference.entity;
2231 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2232 relation = get_inversed_relation(relation);
2233 var = op2->reference.entity;
2238 type_t *const type = skip_typeref(var->declaration.type);
2239 ir_mode *const mode = get_ir_mode_storage(type);
2241 res = get_value(var->variable.v.value_number, mode);
2242 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2243 set_value(var->variable.v.value_number, res);
2249 * Handle the assume optimizer hint.
2251 * @param dbi debug info
2252 * @param expr the IL assume expression
2254 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2256 switch(expression->kind) {
2257 case EXPR_BINARY_EQUAL:
2258 case EXPR_BINARY_NOTEQUAL:
2259 case EXPR_BINARY_LESS:
2260 case EXPR_BINARY_LESSEQUAL:
2261 case EXPR_BINARY_GREATER:
2262 case EXPR_BINARY_GREATEREQUAL:
2263 return handle_assume_compare(dbi, &expression->binary);
2269 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2270 type_t *from_type, type_t *type)
2272 type = skip_typeref(type);
2273 if (is_type_void(type)) {
2274 /* make sure firm type is constructed */
2275 (void) get_ir_type(type);
2278 if (!is_type_scalar(type)) {
2279 /* make sure firm type is constructed */
2280 (void) get_ir_type(type);
2284 from_type = skip_typeref(from_type);
2285 ir_mode *mode = get_ir_mode_storage(type);
2286 /* check for conversion from / to __based types */
2287 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2288 const variable_t *from_var = from_type->pointer.base_variable;
2289 const variable_t *to_var = type->pointer.base_variable;
2290 if (from_var != to_var) {
2291 if (from_var != NULL) {
2292 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2293 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2294 value_node = new_d_Add(dbgi, value_node, base, mode);
2296 if (to_var != NULL) {
2297 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2298 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2299 value_node = new_d_Sub(dbgi, value_node, base, mode);
2304 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2305 /* bool adjustments (we save a mode_Bu, but have to temporarily
2306 * convert to mode_b so we only get a 0/1 value */
2307 value_node = create_conv(dbgi, value_node, mode_b);
2310 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2311 ir_node *node = create_conv(dbgi, value_node, mode);
2312 node = do_strict_conv(dbgi, node);
2313 node = create_conv(dbgi, node, mode_arith);
2318 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2320 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2321 type_t *type = skip_typeref(expression->base.type);
2323 const expression_t *value = expression->value;
2325 switch(expression->base.kind) {
2326 case EXPR_UNARY_TAKE_ADDRESS:
2327 return expression_to_addr(value);
2329 case EXPR_UNARY_NEGATE: {
2330 ir_node *value_node = expression_to_firm(value);
2331 ir_mode *mode = get_ir_mode_arithmetic(type);
2332 return new_d_Minus(dbgi, value_node, mode);
2334 case EXPR_UNARY_PLUS:
2335 return expression_to_firm(value);
2336 case EXPR_UNARY_BITWISE_NEGATE: {
2337 ir_node *value_node = expression_to_firm(value);
2338 ir_mode *mode = get_ir_mode_arithmetic(type);
2339 return new_d_Not(dbgi, value_node, mode);
2341 case EXPR_UNARY_NOT: {
2342 ir_node *value_node = _expression_to_firm(value);
2343 value_node = create_conv(dbgi, value_node, mode_b);
2344 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2347 case EXPR_UNARY_DEREFERENCE: {
2348 ir_node *value_node = expression_to_firm(value);
2349 type_t *value_type = skip_typeref(value->base.type);
2350 assert(is_type_pointer(value_type));
2352 /* check for __based */
2353 const variable_t *const base_var = value_type->pointer.base_variable;
2354 if (base_var != NULL) {
2355 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2356 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2357 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2359 type_t *points_to = value_type->pointer.points_to;
2360 return deref_address(dbgi, points_to, value_node);
2362 case EXPR_UNARY_POSTFIX_INCREMENT:
2363 case EXPR_UNARY_POSTFIX_DECREMENT:
2364 case EXPR_UNARY_PREFIX_INCREMENT:
2365 case EXPR_UNARY_PREFIX_DECREMENT:
2366 return create_incdec(expression);
2367 case EXPR_UNARY_CAST: {
2368 ir_node *value_node = expression_to_firm(value);
2369 type_t *from_type = value->base.type;
2370 return create_cast(dbgi, value_node, from_type, type);
2372 case EXPR_UNARY_ASSUME:
2373 return handle_assume(dbgi, value);
2378 panic("invalid UNEXPR type found");
2382 * produces a 0/1 depending of the value of a mode_b node
2384 static ir_node *produce_condition_result(const expression_t *expression,
2385 ir_mode *mode, dbg_info *dbgi)
2387 ir_node *const one_block = new_immBlock();
2388 ir_node *const zero_block = new_immBlock();
2389 create_condition_evaluation(expression, one_block, zero_block);
2390 mature_immBlock(one_block);
2391 mature_immBlock(zero_block);
2393 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2394 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2395 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2396 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2397 set_cur_block(block);
2399 ir_node *const one = new_Const(get_mode_one(mode));
2400 ir_node *const zero = new_Const(get_mode_null(mode));
2401 ir_node *const in[2] = { one, zero };
2402 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2407 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2408 ir_node *value, type_t *type)
2410 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2411 assert(is_type_pointer(type));
2412 pointer_type_t *const pointer_type = &type->pointer;
2413 type_t *const points_to = skip_typeref(pointer_type->points_to);
2414 ir_node * elem_size = get_type_size_node(points_to);
2415 elem_size = create_conv(dbgi, elem_size, mode);
2416 value = create_conv(dbgi, value, mode);
2417 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2421 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2422 ir_node *left, ir_node *right)
2425 type_t *type_left = skip_typeref(expression->left->base.type);
2426 type_t *type_right = skip_typeref(expression->right->base.type);
2428 expression_kind_t kind = expression->base.kind;
2431 case EXPR_BINARY_SHIFTLEFT:
2432 case EXPR_BINARY_SHIFTRIGHT:
2433 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2434 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2435 mode = get_ir_mode_arithmetic(expression->base.type);
2436 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2439 case EXPR_BINARY_SUB:
2440 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2441 const pointer_type_t *const ptr_type = &type_left->pointer;
2443 mode = get_ir_mode_arithmetic(expression->base.type);
2444 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2445 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2446 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2447 ir_node *const no_mem = new_NoMem();
2448 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2449 mode, op_pin_state_floats);
2450 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2453 case EXPR_BINARY_SUB_ASSIGN:
2454 if (is_type_pointer(type_left)) {
2455 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2456 mode = get_ir_mode_arithmetic(type_left);
2461 case EXPR_BINARY_ADD:
2462 case EXPR_BINARY_ADD_ASSIGN:
2463 if (is_type_pointer(type_left)) {
2464 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2465 mode = get_ir_mode_arithmetic(type_left);
2467 } else if (is_type_pointer(type_right)) {
2468 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2469 mode = get_ir_mode_arithmetic(type_right);
2476 mode = get_ir_mode_arithmetic(type_right);
2477 left = create_conv(dbgi, left, mode);
2482 case EXPR_BINARY_ADD_ASSIGN:
2483 case EXPR_BINARY_ADD:
2484 return new_d_Add(dbgi, left, right, mode);
2485 case EXPR_BINARY_SUB_ASSIGN:
2486 case EXPR_BINARY_SUB:
2487 return new_d_Sub(dbgi, left, right, mode);
2488 case EXPR_BINARY_MUL_ASSIGN:
2489 case EXPR_BINARY_MUL:
2490 return new_d_Mul(dbgi, left, right, mode);
2491 case EXPR_BINARY_BITWISE_AND:
2492 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2493 return new_d_And(dbgi, left, right, mode);
2494 case EXPR_BINARY_BITWISE_OR:
2495 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2496 return new_d_Or(dbgi, left, right, mode);
2497 case EXPR_BINARY_BITWISE_XOR:
2498 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2499 return new_d_Eor(dbgi, left, right, mode);
2500 case EXPR_BINARY_SHIFTLEFT:
2501 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2502 return new_d_Shl(dbgi, left, right, mode);
2503 case EXPR_BINARY_SHIFTRIGHT:
2504 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2505 if (mode_is_signed(mode)) {
2506 return new_d_Shrs(dbgi, left, right, mode);
2508 return new_d_Shr(dbgi, left, right, mode);
2510 case EXPR_BINARY_DIV:
2511 case EXPR_BINARY_DIV_ASSIGN: {
2512 ir_node *pin = new_Pin(new_NoMem());
2513 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2514 op_pin_state_floats);
2515 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2518 case EXPR_BINARY_MOD:
2519 case EXPR_BINARY_MOD_ASSIGN: {
2520 ir_node *pin = new_Pin(new_NoMem());
2521 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2522 op_pin_state_floats);
2523 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2527 panic("unexpected expression kind");
2531 static ir_node *create_lazy_op(const binary_expression_t *expression)
2533 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2534 type_t *type = skip_typeref(expression->base.type);
2535 ir_mode *mode = get_ir_mode_arithmetic(type);
2537 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2538 bool val = fold_constant_to_bool(expression->left);
2539 expression_kind_t ekind = expression->base.kind;
2540 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2541 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2543 return new_Const(get_mode_null(mode));
2547 return new_Const(get_mode_one(mode));
2551 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2552 bool valr = fold_constant_to_bool(expression->right);
2553 return create_Const_from_bool(mode, valr);
2556 return produce_condition_result(expression->right, mode, dbgi);
2559 return produce_condition_result((const expression_t*) expression, mode,
2563 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2564 ir_node *right, ir_mode *mode);
2566 static ir_node *create_assign_binop(const binary_expression_t *expression)
2568 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2569 const expression_t *left_expr = expression->left;
2570 type_t *type = skip_typeref(left_expr->base.type);
2571 ir_node *right = expression_to_firm(expression->right);
2572 ir_node *left_addr = expression_to_addr(left_expr);
2573 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2574 ir_node *result = create_op(dbgi, expression, left, right);
2576 result = create_cast(dbgi, result, expression->right->base.type, type);
2577 result = do_strict_conv(dbgi, result);
2579 result = set_value_for_expression_addr(left_expr, result, left_addr);
2581 if (!is_type_compound(type)) {
2582 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2583 result = create_conv(dbgi, result, mode_arithmetic);
2588 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2590 expression_kind_t kind = expression->base.kind;
2593 case EXPR_BINARY_EQUAL:
2594 case EXPR_BINARY_NOTEQUAL:
2595 case EXPR_BINARY_LESS:
2596 case EXPR_BINARY_LESSEQUAL:
2597 case EXPR_BINARY_GREATER:
2598 case EXPR_BINARY_GREATEREQUAL:
2599 case EXPR_BINARY_ISGREATER:
2600 case EXPR_BINARY_ISGREATEREQUAL:
2601 case EXPR_BINARY_ISLESS:
2602 case EXPR_BINARY_ISLESSEQUAL:
2603 case EXPR_BINARY_ISLESSGREATER:
2604 case EXPR_BINARY_ISUNORDERED: {
2605 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2606 ir_node *left = expression_to_firm(expression->left);
2607 ir_node *right = expression_to_firm(expression->right);
2608 ir_relation relation = get_relation(kind);
2609 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2612 case EXPR_BINARY_ASSIGN: {
2613 ir_node *addr = expression_to_addr(expression->left);
2614 ir_node *right = expression_to_firm(expression->right);
2616 = set_value_for_expression_addr(expression->left, right, addr);
2618 type_t *type = skip_typeref(expression->base.type);
2619 if (!is_type_compound(type)) {
2620 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2621 res = create_conv(NULL, res, mode_arithmetic);
2625 case EXPR_BINARY_ADD:
2626 case EXPR_BINARY_SUB:
2627 case EXPR_BINARY_MUL:
2628 case EXPR_BINARY_DIV:
2629 case EXPR_BINARY_MOD:
2630 case EXPR_BINARY_BITWISE_AND:
2631 case EXPR_BINARY_BITWISE_OR:
2632 case EXPR_BINARY_BITWISE_XOR:
2633 case EXPR_BINARY_SHIFTLEFT:
2634 case EXPR_BINARY_SHIFTRIGHT:
2636 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2637 ir_node *left = expression_to_firm(expression->left);
2638 ir_node *right = expression_to_firm(expression->right);
2639 return create_op(dbgi, expression, left, right);
2641 case EXPR_BINARY_LOGICAL_AND:
2642 case EXPR_BINARY_LOGICAL_OR:
2643 return create_lazy_op(expression);
2644 case EXPR_BINARY_COMMA:
2645 /* create side effects of left side */
2646 (void) expression_to_firm(expression->left);
2647 return _expression_to_firm(expression->right);
2649 case EXPR_BINARY_ADD_ASSIGN:
2650 case EXPR_BINARY_SUB_ASSIGN:
2651 case EXPR_BINARY_MUL_ASSIGN:
2652 case EXPR_BINARY_MOD_ASSIGN:
2653 case EXPR_BINARY_DIV_ASSIGN:
2654 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2655 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2656 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2657 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2658 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2659 return create_assign_binop(expression);
2661 panic("invalid binexpr type");
2665 static ir_node *array_access_addr(const array_access_expression_t *expression)
2667 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2668 ir_node *base_addr = expression_to_firm(expression->array_ref);
2669 ir_node *offset = expression_to_firm(expression->index);
2670 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2671 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2672 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2677 static ir_node *array_access_to_firm(
2678 const array_access_expression_t *expression)
2680 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2681 ir_node *addr = array_access_addr(expression);
2682 type_t *type = revert_automatic_type_conversion(
2683 (const expression_t*) expression);
2684 type = skip_typeref(type);
2686 return deref_address(dbgi, type, addr);
2689 static long get_offsetof_offset(const offsetof_expression_t *expression)
2691 type_t *orig_type = expression->type;
2694 designator_t *designator = expression->designator;
2695 for ( ; designator != NULL; designator = designator->next) {
2696 type_t *type = skip_typeref(orig_type);
2697 /* be sure the type is constructed */
2698 (void) get_ir_type(type);
2700 if (designator->symbol != NULL) {
2701 assert(is_type_compound(type));
2702 symbol_t *symbol = designator->symbol;
2704 compound_t *compound = type->compound.compound;
2705 entity_t *iter = compound->members.entities;
2706 for (; iter->base.symbol != symbol; iter = iter->base.next) {}
2708 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2709 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2710 offset += get_entity_offset(iter->compound_member.entity);
2712 orig_type = iter->declaration.type;
2714 expression_t *array_index = designator->array_index;
2715 assert(designator->array_index != NULL);
2716 assert(is_type_array(type));
2718 long index = fold_constant_to_int(array_index);
2719 ir_type *arr_type = get_ir_type(type);
2720 ir_type *elem_type = get_array_element_type(arr_type);
2721 long elem_size = get_type_size_bytes(elem_type);
2723 offset += index * elem_size;
2725 orig_type = type->array.element_type;
2732 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2734 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2735 long offset = get_offsetof_offset(expression);
2736 ir_tarval *tv = new_tarval_from_long(offset, mode);
2737 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2739 return new_d_Const(dbgi, tv);
2742 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2743 ir_entity *entity, type_t *type);
2744 static ir_initializer_t *create_ir_initializer(
2745 const initializer_t *initializer, type_t *type);
2747 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2748 initializer_t *initializer,
2751 /* create the ir_initializer */
2752 ir_graph *const old_current_ir_graph = current_ir_graph;
2753 current_ir_graph = get_const_code_irg();
2755 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2757 assert(current_ir_graph == get_const_code_irg());
2758 current_ir_graph = old_current_ir_graph;
2760 ident *const id = id_unique("initializer.%u");
2761 ir_type *const irtype = get_ir_type(type);
2762 ir_type *const global_type = get_glob_type();
2763 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2764 set_entity_ld_ident(entity, id);
2765 set_entity_visibility(entity, ir_visibility_private);
2766 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2767 set_entity_initializer(entity, irinitializer);
2771 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2773 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2774 type_t *type = expression->type;
2775 initializer_t *initializer = expression->initializer;
2777 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2778 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2779 return create_symconst(dbgi, entity);
2781 /* create an entity on the stack */
2782 ident *const id = id_unique("CompLit.%u");
2783 ir_type *const irtype = get_ir_type(type);
2784 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2786 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2787 set_entity_ld_ident(entity, id);
2789 /* create initialisation code */
2790 create_local_initializer(initializer, dbgi, entity, type);
2792 /* create a sel for the compound literal address */
2793 ir_node *frame = get_irg_frame(current_ir_graph);
2794 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2799 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2801 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
2802 type_t *const type = expr->type;
2803 ir_node *const addr = compound_literal_addr(expr);
2804 return deref_address(dbgi, type, addr);
2808 * Transform a sizeof expression into Firm code.
2810 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2812 type_t *const type = skip_typeref(expression->type);
2813 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2814 if (is_type_array(type) && type->array.is_vla
2815 && expression->tp_expression != NULL) {
2816 expression_to_firm(expression->tp_expression);
2819 return get_type_size_node(type);
2822 static entity_t *get_expression_entity(const expression_t *expression)
2824 if (expression->kind != EXPR_REFERENCE)
2827 return expression->reference.entity;
2830 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2832 switch(entity->kind) {
2833 case DECLARATION_KIND_CASES:
2834 return entity->declaration.alignment;
2837 return entity->compound.alignment;
2838 case ENTITY_TYPEDEF:
2839 return entity->typedefe.alignment;
2847 * Transform an alignof expression into Firm code.
2849 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2851 unsigned alignment = 0;
2853 const expression_t *tp_expression = expression->tp_expression;
2854 if (tp_expression != NULL) {
2855 entity_t *entity = get_expression_entity(tp_expression);
2856 if (entity != NULL) {
2857 alignment = get_cparser_entity_alignment(entity);
2861 if (alignment == 0) {
2862 type_t *type = expression->type;
2863 alignment = get_type_alignment(type);
2866 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2867 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2868 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2869 return new_d_Const(dbgi, tv);
2872 static void init_ir_types(void);
2874 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2876 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2878 bool constant_folding_old = constant_folding;
2879 constant_folding = true;
2880 int old_optimize = get_optimize();
2881 int old_constant_folding = get_opt_constant_folding();
2883 set_opt_constant_folding(1);
2887 ir_graph *old_current_ir_graph = current_ir_graph;
2888 current_ir_graph = get_const_code_irg();
2890 ir_node *const cnst = _expression_to_firm(expression);
2892 current_ir_graph = old_current_ir_graph;
2893 set_optimize(old_optimize);
2894 set_opt_constant_folding(old_constant_folding);
2896 if (!is_Const(cnst)) {
2897 panic("couldn't fold constant");
2900 constant_folding = constant_folding_old;
2902 ir_tarval *const tv = get_Const_tarval(cnst);
2903 ir_mode *const mode = get_ir_mode_arithmetic(skip_typeref(expression->base.type));
2904 return tarval_convert_to(tv, mode);
2907 /* this function is only used in parser.c, but it relies on libfirm functionality */
2908 bool constant_is_negative(const expression_t *expression)
2910 ir_tarval *tv = fold_constant_to_tarval(expression);
2911 return tarval_is_negative(tv);
2914 long fold_constant_to_int(const expression_t *expression)
2916 ir_tarval *tv = fold_constant_to_tarval(expression);
2917 if (!tarval_is_long(tv)) {
2918 panic("result of constant folding is not integer");
2921 return get_tarval_long(tv);
2924 bool fold_constant_to_bool(const expression_t *expression)
2926 ir_tarval *tv = fold_constant_to_tarval(expression);
2927 return !tarval_is_null(tv);
2930 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2932 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2934 /* first try to fold a constant condition */
2935 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
2936 bool val = fold_constant_to_bool(expression->condition);
2938 expression_t *true_expression = expression->true_expression;
2939 if (true_expression == NULL)
2940 true_expression = expression->condition;
2941 return expression_to_firm(true_expression);
2943 return expression_to_firm(expression->false_expression);
2947 ir_node *const true_block = new_immBlock();
2948 ir_node *const false_block = new_immBlock();
2949 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
2950 mature_immBlock(true_block);
2951 mature_immBlock(false_block);
2953 set_cur_block(true_block);
2955 if (expression->true_expression != NULL) {
2956 true_val = expression_to_firm(expression->true_expression);
2957 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
2958 true_val = cond_expr;
2960 /* Condition ended with a short circuit (&&, ||, !) operation or a
2961 * comparison. Generate a "1" as value for the true branch. */
2962 true_val = new_Const(get_mode_one(mode_Is));
2964 ir_node *const true_jmp = new_d_Jmp(dbgi);
2966 set_cur_block(false_block);
2967 ir_node *const false_val = expression_to_firm(expression->false_expression);
2968 ir_node *const false_jmp = new_d_Jmp(dbgi);
2970 /* create the common block */
2971 ir_node *const in_cf[2] = { true_jmp, false_jmp };
2972 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2973 set_cur_block(block);
2975 /* TODO improve static semantics, so either both or no values are NULL */
2976 if (true_val == NULL || false_val == NULL)
2979 ir_node *const in[2] = { true_val, false_val };
2980 type_t *const type = skip_typeref(expression->base.type);
2981 ir_mode *const mode = get_ir_mode_arithmetic(type);
2982 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2988 * Returns an IR-node representing the address of a field.
2990 static ir_node *select_addr(const select_expression_t *expression)
2992 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2994 construct_select_compound(expression);
2996 ir_node *compound_addr = expression_to_firm(expression->compound);
2998 entity_t *entry = expression->compound_entry;
2999 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3000 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3002 if (constant_folding) {
3003 ir_mode *mode = get_irn_mode(compound_addr);
3004 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3005 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3006 return new_d_Add(dbgi, compound_addr, ofs, mode);
3008 ir_entity *irentity = entry->compound_member.entity;
3009 assert(irentity != NULL);
3010 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3014 static ir_node *select_to_firm(const select_expression_t *expression)
3016 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3017 ir_node *addr = select_addr(expression);
3018 type_t *type = revert_automatic_type_conversion(
3019 (const expression_t*) expression);
3020 type = skip_typeref(type);
3022 entity_t *entry = expression->compound_entry;
3023 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3025 if (entry->compound_member.bitfield) {
3026 return bitfield_extract_to_firm(expression, addr);
3029 return deref_address(dbgi, type, addr);
3032 /* Values returned by __builtin_classify_type. */
3033 typedef enum gcc_type_class
3039 enumeral_type_class,
3042 reference_type_class,
3046 function_type_class,
3057 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3059 type_t *type = expr->type_expression->base.type;
3061 /* FIXME gcc returns different values depending on whether compiling C or C++
3062 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3065 type = skip_typeref(type);
3066 switch (type->kind) {
3068 const atomic_type_t *const atomic_type = &type->atomic;
3069 switch (atomic_type->akind) {
3070 /* should not be reached */
3071 case ATOMIC_TYPE_INVALID:
3075 /* gcc cannot do that */
3076 case ATOMIC_TYPE_VOID:
3077 tc = void_type_class;
3080 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3081 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3082 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3083 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3084 case ATOMIC_TYPE_SHORT:
3085 case ATOMIC_TYPE_USHORT:
3086 case ATOMIC_TYPE_INT:
3087 case ATOMIC_TYPE_UINT:
3088 case ATOMIC_TYPE_LONG:
3089 case ATOMIC_TYPE_ULONG:
3090 case ATOMIC_TYPE_LONGLONG:
3091 case ATOMIC_TYPE_ULONGLONG:
3092 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3093 tc = integer_type_class;
3096 case ATOMIC_TYPE_FLOAT:
3097 case ATOMIC_TYPE_DOUBLE:
3098 case ATOMIC_TYPE_LONG_DOUBLE:
3099 tc = real_type_class;
3102 panic("Unexpected atomic type in classify_type_to_firm().");
3105 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3106 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3107 case TYPE_ARRAY: /* gcc handles this as pointer */
3108 case TYPE_FUNCTION: /* gcc handles this as pointer */
3109 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3110 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3111 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3113 /* gcc handles this as integer */
3114 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3116 /* gcc classifies the referenced type */
3117 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3119 /* typedef/typeof should be skipped already */
3125 panic("unexpected TYPE classify_type_to_firm().");
3129 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3130 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3131 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3132 return new_d_Const(dbgi, tv);
3135 static ir_node *function_name_to_firm(
3136 const funcname_expression_t *const expr)
3138 switch(expr->kind) {
3139 case FUNCNAME_FUNCTION:
3140 case FUNCNAME_PRETTY_FUNCTION:
3141 case FUNCNAME_FUNCDNAME:
3142 if (current_function_name == NULL) {
3143 const source_position_t *const src_pos = &expr->base.source_position;
3144 const char *name = current_function_entity->base.symbol->string;
3145 const string_t string = { name, strlen(name) };
3146 current_function_name = string_to_firm(src_pos, "__func__.%u", STRING_ENCODING_CHAR, &string);
3148 return current_function_name;
3149 case FUNCNAME_FUNCSIG:
3150 if (current_funcsig == NULL) {
3151 const source_position_t *const src_pos = &expr->base.source_position;
3152 ir_entity *ent = get_irg_entity(current_ir_graph);
3153 const char *const name = get_entity_ld_name(ent);
3154 const string_t string = { name, strlen(name) };
3155 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", STRING_ENCODING_CHAR, &string);
3157 return current_funcsig;
3159 panic("Unsupported function name");
3162 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3164 statement_t *statement = expr->statement;
3166 assert(statement->kind == STATEMENT_COMPOUND);
3167 return compound_statement_to_firm(&statement->compound);
3170 static ir_node *va_start_expression_to_firm(
3171 const va_start_expression_t *const expr)
3173 ir_entity *param_ent = current_vararg_entity;
3174 if (param_ent == NULL) {
3175 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3176 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3177 ir_type *const param_type = get_unknown_type();
3178 param_ent = new_parameter_entity(frame_type, n, param_type);
3179 current_vararg_entity = param_ent;
3182 ir_node *const frame = get_irg_frame(current_ir_graph);
3183 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3184 ir_node *const no_mem = new_NoMem();
3185 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3187 set_value_for_expression(expr->ap, arg_sel);
3192 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3194 type_t *const type = expr->base.type;
3195 expression_t *const ap_expr = expr->ap;
3196 ir_node *const ap_addr = expression_to_addr(ap_expr);
3197 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3198 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3199 ir_node *const res = deref_address(dbgi, type, ap);
3201 ir_node *const cnst = get_type_size_node(expr->base.type);
3202 ir_mode *const mode = get_irn_mode(cnst);
3203 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3204 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3205 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3206 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3207 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3209 set_value_for_expression_addr(ap_expr, add, ap_addr);
3215 * Generate Firm for a va_copy expression.
3217 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3219 ir_node *const src = expression_to_firm(expr->src);
3220 set_value_for_expression(expr->dst, src);
3224 static ir_node *dereference_addr(const unary_expression_t *const expression)
3226 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3227 return expression_to_firm(expression->value);
3231 * Returns a IR-node representing an lvalue of the given expression.
3233 static ir_node *expression_to_addr(const expression_t *expression)
3235 switch(expression->kind) {
3236 case EXPR_ARRAY_ACCESS:
3237 return array_access_addr(&expression->array_access);
3239 return call_expression_to_firm(&expression->call);
3240 case EXPR_COMPOUND_LITERAL:
3241 return compound_literal_addr(&expression->compound_literal);
3242 case EXPR_REFERENCE:
3243 return reference_addr(&expression->reference);
3245 return select_addr(&expression->select);
3246 case EXPR_UNARY_DEREFERENCE:
3247 return dereference_addr(&expression->unary);
3251 panic("trying to get address of non-lvalue");
3254 static ir_node *builtin_constant_to_firm(
3255 const builtin_constant_expression_t *expression)
3257 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3258 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3259 return create_Const_from_bool(mode, v);
3262 static ir_node *builtin_types_compatible_to_firm(
3263 const builtin_types_compatible_expression_t *expression)
3265 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3266 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3267 bool const value = types_compatible(left, right);
3268 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3269 return create_Const_from_bool(mode, value);
3272 static ir_node *get_label_block(label_t *label)
3274 if (label->block != NULL)
3275 return label->block;
3277 /* beware: might be called from create initializer with current_ir_graph
3278 * set to const_code_irg. */
3279 ir_graph *rem = current_ir_graph;
3280 current_ir_graph = current_function;
3282 ir_node *block = new_immBlock();
3284 label->block = block;
3286 ARR_APP1(label_t *, all_labels, label);
3288 current_ir_graph = rem;
3293 * Pointer to a label. This is used for the
3294 * GNU address-of-label extension.
3296 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3298 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3299 ir_node *block = get_label_block(label->label);
3300 ir_entity *entity = create_Block_entity(block);
3302 symconst_symbol value;
3303 value.entity_p = entity;
3304 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3308 * creates firm nodes for an expression. The difference between this function
3309 * and expression_to_firm is, that this version might produce mode_b nodes
3310 * instead of mode_Is.
3312 static ir_node *_expression_to_firm(expression_t const *const expr)
3315 if (!constant_folding) {
3316 assert(!expr->base.transformed);
3317 ((expression_t*)expr)->base.transformed = true;
3321 switch (expr->kind) {
3322 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3323 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3324 case EXPR_BINARY_CASES: return binary_expression_to_firm( &expr->binary);
3325 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3326 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3327 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3328 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3329 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3330 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3331 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3332 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3333 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3334 case EXPR_LITERAL_CHARACTER: return char_literal_to_firm( &expr->string_literal);
3335 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3336 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3337 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3338 case EXPR_SELECT: return select_to_firm( &expr->select);
3339 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3340 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3341 case EXPR_UNARY_CASES: return unary_expression_to_firm( &expr->unary);
3342 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3343 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3344 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3346 case EXPR_STRING_LITERAL: return string_to_firm(&expr->base.source_position, "str.%u", expr->string_literal.encoding, &expr->string_literal.value);
3348 case EXPR_ERROR: break;
3350 panic("invalid expression found");
3354 * Check if a given expression is a GNU __builtin_expect() call.
3356 static bool is_builtin_expect(const expression_t *expression)
3358 if (expression->kind != EXPR_CALL)
3361 expression_t *function = expression->call.function;
3362 if (function->kind != EXPR_REFERENCE)
3364 reference_expression_t *ref = &function->reference;
3365 if (ref->entity->kind != ENTITY_FUNCTION ||
3366 ref->entity->function.btk != BUILTIN_EXPECT)
3372 static bool produces_mode_b(const expression_t *expression)
3374 switch (expression->kind) {
3375 case EXPR_BINARY_EQUAL:
3376 case EXPR_BINARY_NOTEQUAL:
3377 case EXPR_BINARY_LESS:
3378 case EXPR_BINARY_LESSEQUAL:
3379 case EXPR_BINARY_GREATER:
3380 case EXPR_BINARY_GREATEREQUAL:
3381 case EXPR_BINARY_ISGREATER:
3382 case EXPR_BINARY_ISGREATEREQUAL:
3383 case EXPR_BINARY_ISLESS:
3384 case EXPR_BINARY_ISLESSEQUAL:
3385 case EXPR_BINARY_ISLESSGREATER:
3386 case EXPR_BINARY_ISUNORDERED:
3387 case EXPR_UNARY_NOT:
3391 if (is_builtin_expect(expression)) {
3392 expression_t *argument = expression->call.arguments->expression;
3393 return produces_mode_b(argument);
3396 case EXPR_BINARY_COMMA:
3397 return produces_mode_b(expression->binary.right);
3404 static ir_node *expression_to_firm(const expression_t *expression)
3406 if (!produces_mode_b(expression)) {
3407 ir_node *res = _expression_to_firm(expression);
3408 assert(res == NULL || get_irn_mode(res) != mode_b);
3412 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3413 return new_Const(fold_constant_to_tarval(expression));
3416 /* we have to produce a 0/1 from the mode_b expression */
3417 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3418 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3419 return produce_condition_result(expression, mode, dbgi);
3423 * create a short-circuit expression evaluation that tries to construct
3424 * efficient control flow structures for &&, || and ! expressions
3426 static ir_node *create_condition_evaluation(const expression_t *expression,
3427 ir_node *true_block,
3428 ir_node *false_block)
3430 switch(expression->kind) {
3431 case EXPR_UNARY_NOT: {
3432 const unary_expression_t *unary_expression = &expression->unary;
3433 create_condition_evaluation(unary_expression->value, false_block,
3437 case EXPR_BINARY_LOGICAL_AND: {
3438 const binary_expression_t *binary_expression = &expression->binary;
3440 ir_node *extra_block = new_immBlock();
3441 create_condition_evaluation(binary_expression->left, extra_block,
3443 mature_immBlock(extra_block);
3444 set_cur_block(extra_block);
3445 create_condition_evaluation(binary_expression->right, true_block,
3449 case EXPR_BINARY_LOGICAL_OR: {
3450 const binary_expression_t *binary_expression = &expression->binary;
3452 ir_node *extra_block = new_immBlock();
3453 create_condition_evaluation(binary_expression->left, true_block,
3455 mature_immBlock(extra_block);
3456 set_cur_block(extra_block);
3457 create_condition_evaluation(binary_expression->right, true_block,
3465 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3466 ir_node *cond_expr = _expression_to_firm(expression);
3467 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3468 ir_node *cond = new_d_Cond(dbgi, condition);
3469 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3470 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3472 /* set branch prediction info based on __builtin_expect */
3473 if (is_builtin_expect(expression) && is_Cond(cond)) {
3474 call_argument_t *argument = expression->call.arguments->next;
3475 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3476 bool const cnst = fold_constant_to_bool(argument->expression);
3477 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3478 set_Cond_jmp_pred(cond, pred);
3482 add_immBlock_pred(true_block, true_proj);
3483 add_immBlock_pred(false_block, false_proj);
3485 set_unreachable_now();
3489 static void create_variable_entity(entity_t *variable,
3490 declaration_kind_t declaration_kind,
3491 ir_type *parent_type)
3493 assert(variable->kind == ENTITY_VARIABLE);
3494 type_t *type = skip_typeref(variable->declaration.type);
3496 ident *const id = new_id_from_str(variable->base.symbol->string);
3497 ir_type *const irtype = get_ir_type(type);
3498 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3499 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3500 unsigned alignment = variable->declaration.alignment;
3502 set_entity_alignment(irentity, alignment);
3504 handle_decl_modifiers(irentity, variable);
3506 variable->declaration.kind = (unsigned char) declaration_kind;
3507 variable->variable.v.entity = irentity;
3508 set_entity_ld_ident(irentity, create_ld_ident(variable));
3510 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3511 set_entity_volatility(irentity, volatility_is_volatile);
3516 typedef struct type_path_entry_t type_path_entry_t;
3517 struct type_path_entry_t {
3519 ir_initializer_t *initializer;
3521 entity_t *compound_entry;
3524 typedef struct type_path_t type_path_t;
3525 struct type_path_t {
3526 type_path_entry_t *path;
3531 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3533 size_t len = ARR_LEN(path->path);
3535 for (size_t i = 0; i < len; ++i) {
3536 const type_path_entry_t *entry = & path->path[i];
3538 type_t *type = skip_typeref(entry->type);
3539 if (is_type_compound(type)) {
3540 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3541 } else if (is_type_array(type)) {
3542 fprintf(stderr, "[%u]", (unsigned) entry->index);
3544 fprintf(stderr, "-INVALID-");
3547 fprintf(stderr, " (");
3548 print_type(path->top_type);
3549 fprintf(stderr, ")");
3552 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3554 size_t len = ARR_LEN(path->path);
3556 return & path->path[len-1];
3559 static type_path_entry_t *append_to_type_path(type_path_t *path)
3561 size_t len = ARR_LEN(path->path);
3562 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3564 type_path_entry_t *result = & path->path[len];
3565 memset(result, 0, sizeof(result[0]));
3569 static size_t get_compound_member_count(const compound_type_t *type)
3571 compound_t *compound = type->compound;
3572 size_t n_members = 0;
3573 entity_t *member = compound->members.entities;
3574 for ( ; member != NULL; member = member->base.next) {
3581 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3583 type_t *orig_top_type = path->top_type;
3584 type_t *top_type = skip_typeref(orig_top_type);
3586 assert(is_type_compound(top_type) || is_type_array(top_type));
3588 if (ARR_LEN(path->path) == 0) {
3591 type_path_entry_t *top = get_type_path_top(path);
3592 ir_initializer_t *initializer = top->initializer;
3593 return get_initializer_compound_value(initializer, top->index);
3597 static void descend_into_subtype(type_path_t *path)
3599 type_t *orig_top_type = path->top_type;
3600 type_t *top_type = skip_typeref(orig_top_type);
3602 assert(is_type_compound(top_type) || is_type_array(top_type));
3604 ir_initializer_t *initializer = get_initializer_entry(path);
3606 type_path_entry_t *top = append_to_type_path(path);
3607 top->type = top_type;
3611 if (is_type_compound(top_type)) {
3612 compound_t *const compound = top_type->compound.compound;
3613 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3615 top->compound_entry = entry;
3617 len = get_compound_member_count(&top_type->compound);
3618 if (entry != NULL) {
3619 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3620 path->top_type = entry->declaration.type;
3623 assert(is_type_array(top_type));
3624 assert(top_type->array.size > 0);
3627 path->top_type = top_type->array.element_type;
3628 len = top_type->array.size;
3630 if (initializer == NULL
3631 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3632 initializer = create_initializer_compound(len);
3633 /* we have to set the entry at the 2nd latest path entry... */
3634 size_t path_len = ARR_LEN(path->path);
3635 assert(path_len >= 1);
3637 type_path_entry_t *entry = & path->path[path_len-2];
3638 ir_initializer_t *tinitializer = entry->initializer;
3639 set_initializer_compound_value(tinitializer, entry->index,
3643 top->initializer = initializer;
3646 static void ascend_from_subtype(type_path_t *path)
3648 type_path_entry_t *top = get_type_path_top(path);
3650 path->top_type = top->type;
3652 size_t len = ARR_LEN(path->path);
3653 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3656 static void walk_designator(type_path_t *path, const designator_t *designator)
3658 /* designators start at current object type */
3659 ARR_RESIZE(type_path_entry_t, path->path, 1);
3661 for ( ; designator != NULL; designator = designator->next) {
3662 type_path_entry_t *top = get_type_path_top(path);
3663 type_t *orig_type = top->type;
3664 type_t *type = skip_typeref(orig_type);
3666 if (designator->symbol != NULL) {
3667 assert(is_type_compound(type));
3669 symbol_t *symbol = designator->symbol;
3671 compound_t *compound = type->compound.compound;
3672 entity_t *iter = compound->members.entities;
3673 for (; iter->base.symbol != symbol; iter = iter->base.next, ++index) {}
3674 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3676 /* revert previous initialisations of other union elements */
3677 if (type->kind == TYPE_COMPOUND_UNION) {
3678 ir_initializer_t *initializer = top->initializer;
3679 if (initializer != NULL
3680 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3681 /* are we writing to a new element? */
3682 ir_initializer_t *oldi
3683 = get_initializer_compound_value(initializer, index);
3684 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3685 /* clear initializer */
3687 = get_initializer_compound_n_entries(initializer);
3688 ir_initializer_t *nulli = get_initializer_null();
3689 for (size_t i = 0; i < len; ++i) {
3690 set_initializer_compound_value(initializer, i,
3697 top->type = orig_type;
3698 top->compound_entry = iter;
3700 orig_type = iter->declaration.type;
3702 expression_t *array_index = designator->array_index;
3703 assert(is_type_array(type));
3705 long index = fold_constant_to_int(array_index);
3706 assert(0 <= index && (!type->array.size_constant || (size_t)index < type->array.size));
3708 top->type = orig_type;
3709 top->index = (size_t) index;
3710 orig_type = type->array.element_type;
3712 path->top_type = orig_type;
3714 if (designator->next != NULL) {
3715 descend_into_subtype(path);
3719 path->invalid = false;
3722 static void advance_current_object(type_path_t *path)
3724 if (path->invalid) {
3725 /* TODO: handle this... */
3726 panic("invalid initializer in ast2firm (excessive elements)");
3729 type_path_entry_t *top = get_type_path_top(path);
3731 type_t *type = skip_typeref(top->type);
3732 if (is_type_union(type)) {
3733 /* only the first element is initialized in unions */
3734 top->compound_entry = NULL;
3735 } else if (is_type_struct(type)) {
3736 entity_t *entry = top->compound_entry;
3739 entry = skip_unnamed_bitfields(entry->base.next);
3740 top->compound_entry = entry;
3741 if (entry != NULL) {
3742 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3743 path->top_type = entry->declaration.type;
3747 assert(is_type_array(type));
3750 if (!type->array.size_constant || top->index < type->array.size) {
3755 /* we're past the last member of the current sub-aggregate, try if we
3756 * can ascend in the type hierarchy and continue with another subobject */
3757 size_t len = ARR_LEN(path->path);
3760 ascend_from_subtype(path);
3761 advance_current_object(path);
3763 path->invalid = true;
3768 static ir_initializer_t *create_ir_initializer_value(
3769 const initializer_value_t *initializer)
3771 if (is_type_compound(initializer->value->base.type)) {
3772 panic("initializer creation for compounds not implemented yet");
3774 type_t *type = initializer->value->base.type;
3775 expression_t *expr = initializer->value;
3776 ir_node *value = expression_to_firm(expr);
3777 ir_mode *mode = get_ir_mode_storage(type);
3778 value = create_conv(NULL, value, mode);
3779 return create_initializer_const(value);
3782 /** test wether type can be initialized by a string constant */
3783 static bool is_string_type(type_t *type)
3785 if (!is_type_array(type))
3788 type_t *const inner = skip_typeref(type->array.element_type);
3789 return is_type_integer(inner);
3792 static ir_initializer_t *create_ir_initializer_list(
3793 const initializer_list_t *initializer, type_t *type)
3796 memset(&path, 0, sizeof(path));
3797 path.top_type = type;
3798 path.path = NEW_ARR_F(type_path_entry_t, 0);
3800 descend_into_subtype(&path);
3802 for (size_t i = 0; i < initializer->len; ++i) {
3803 const initializer_t *sub_initializer = initializer->initializers[i];
3805 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3806 walk_designator(&path, sub_initializer->designator.designator);
3810 if (sub_initializer->kind == INITIALIZER_VALUE) {
3811 /* we might have to descend into types until we're at a scalar
3814 type_t *orig_top_type = path.top_type;
3815 type_t *top_type = skip_typeref(orig_top_type);
3817 if (is_type_scalar(top_type))
3819 descend_into_subtype(&path);
3821 } else if (sub_initializer->kind == INITIALIZER_STRING) {
3822 /* we might have to descend into types until we're at a scalar
3825 type_t *orig_top_type = path.top_type;
3826 type_t *top_type = skip_typeref(orig_top_type);
3828 if (is_string_type(top_type))
3830 descend_into_subtype(&path);
3834 ir_initializer_t *sub_irinitializer
3835 = create_ir_initializer(sub_initializer, path.top_type);
3837 size_t path_len = ARR_LEN(path.path);
3838 assert(path_len >= 1);
3839 type_path_entry_t *entry = & path.path[path_len-1];
3840 ir_initializer_t *tinitializer = entry->initializer;
3841 set_initializer_compound_value(tinitializer, entry->index,
3844 advance_current_object(&path);
3847 assert(ARR_LEN(path.path) >= 1);
3848 ir_initializer_t *result = path.path[0].initializer;
3849 DEL_ARR_F(path.path);
3854 static ir_initializer_t *create_ir_initializer_string(initializer_t const *const init, type_t *type)
3856 type = skip_typeref(type);
3858 assert(type->kind == TYPE_ARRAY);
3859 assert(type->array.size_constant);
3860 string_literal_expression_t const *const str = get_init_string(init);
3861 size_t const str_len = str->value.size;
3862 size_t const arr_len = type->array.size;
3863 ir_initializer_t *const irinit = create_initializer_compound(arr_len);
3864 ir_mode *const mode = get_ir_mode_storage(type->array.element_type);
3865 char const * p = str->value.begin;
3866 switch (str->encoding) {
3867 case STRING_ENCODING_CHAR:
3868 for (size_t i = 0; i != arr_len; ++i) {
3869 char const c = i < str_len ? *p++ : 0;
3870 ir_tarval *const tv = new_tarval_from_long(c, mode);
3871 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3872 set_initializer_compound_value(irinit, i, tvinit);
3876 case STRING_ENCODING_WIDE:
3877 for (size_t i = 0; i != arr_len; ++i) {
3878 utf32 const c = i < str_len ? read_utf8_char(&p) : 0;
3879 ir_tarval *const tv = new_tarval_from_long(c, mode);
3880 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
3881 set_initializer_compound_value(irinit, i, tvinit);
3889 static ir_initializer_t *create_ir_initializer(
3890 const initializer_t *initializer, type_t *type)
3892 switch(initializer->kind) {
3893 case INITIALIZER_STRING:
3894 return create_ir_initializer_string(initializer, type);
3896 case INITIALIZER_LIST:
3897 return create_ir_initializer_list(&initializer->list, type);
3899 case INITIALIZER_VALUE:
3900 return create_ir_initializer_value(&initializer->value);
3902 case INITIALIZER_DESIGNATOR:
3903 panic("unexpected designator initializer found");
3905 panic("unknown initializer");
3908 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
3909 * are elements [...] the remainder of the aggregate shall be initialized
3910 * implicitly the same as objects that have static storage duration. */
3911 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
3914 /* for unions we must NOT do anything for null initializers */
3915 ir_type *owner = get_entity_owner(entity);
3916 if (is_Union_type(owner)) {
3920 ir_type *ent_type = get_entity_type(entity);
3921 /* create sub-initializers for a compound type */
3922 if (is_compound_type(ent_type)) {
3923 unsigned n_members = get_compound_n_members(ent_type);
3924 for (unsigned n = 0; n < n_members; ++n) {
3925 ir_entity *member = get_compound_member(ent_type, n);
3926 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
3928 create_dynamic_null_initializer(member, dbgi, addr);
3932 if (is_Array_type(ent_type)) {
3933 assert(has_array_upper_bound(ent_type, 0));
3934 long n = get_array_upper_bound_int(ent_type, 0);
3935 for (long i = 0; i < n; ++i) {
3936 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3937 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
3938 ir_node *cnst = new_d_Const(dbgi, index_tv);
3939 ir_node *in[1] = { cnst };
3940 ir_entity *arrent = get_array_element_entity(ent_type);
3941 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
3943 create_dynamic_null_initializer(arrent, dbgi, addr);
3948 ir_mode *value_mode = get_type_mode(ent_type);
3949 ir_node *node = new_Const(get_mode_null(value_mode));
3951 /* is it a bitfield type? */
3952 if (is_Primitive_type(ent_type) &&
3953 get_primitive_base_type(ent_type) != NULL) {
3954 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3958 ir_node *mem = get_store();
3959 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3960 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3964 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
3965 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
3967 switch(get_initializer_kind(initializer)) {
3968 case IR_INITIALIZER_NULL:
3969 create_dynamic_null_initializer(entity, dbgi, base_addr);
3971 case IR_INITIALIZER_CONST: {
3972 ir_node *node = get_initializer_const_value(initializer);
3973 ir_type *ent_type = get_entity_type(entity);
3975 /* is it a bitfield type? */
3976 if (is_Primitive_type(ent_type) &&
3977 get_primitive_base_type(ent_type) != NULL) {
3978 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
3982 assert(get_type_mode(type) == get_irn_mode(node));
3983 ir_node *mem = get_store();
3984 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
3985 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
3989 case IR_INITIALIZER_TARVAL: {
3990 ir_tarval *tv = get_initializer_tarval_value(initializer);
3991 ir_node *cnst = new_d_Const(dbgi, tv);
3992 ir_type *ent_type = get_entity_type(entity);
3994 /* is it a bitfield type? */
3995 if (is_Primitive_type(ent_type) &&
3996 get_primitive_base_type(ent_type) != NULL) {
3997 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4001 assert(get_type_mode(type) == get_tarval_mode(tv));
4002 ir_node *mem = get_store();
4003 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4004 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4008 case IR_INITIALIZER_COMPOUND: {
4009 assert(is_compound_type(type) || is_Array_type(type));
4011 if (is_Array_type(type)) {
4012 assert(has_array_upper_bound(type, 0));
4013 n_members = get_array_upper_bound_int(type, 0);
4015 n_members = get_compound_n_members(type);
4018 if (get_initializer_compound_n_entries(initializer)
4019 != (unsigned) n_members)
4020 panic("initializer doesn't match compound type");
4022 for (int i = 0; i < n_members; ++i) {
4025 ir_entity *sub_entity;
4026 if (is_Array_type(type)) {
4027 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4028 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4029 ir_node *cnst = new_d_Const(dbgi, index_tv);
4030 ir_node *in[1] = { cnst };
4031 irtype = get_array_element_type(type);
4032 sub_entity = get_array_element_entity(type);
4033 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4036 sub_entity = get_compound_member(type, i);
4037 irtype = get_entity_type(sub_entity);
4038 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4042 ir_initializer_t *sub_init
4043 = get_initializer_compound_value(initializer, i);
4045 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4052 panic("invalid IR_INITIALIZER found");
4055 static void create_dynamic_initializer(ir_initializer_t *initializer,
4056 dbg_info *dbgi, ir_entity *entity)
4058 ir_node *frame = get_irg_frame(current_ir_graph);
4059 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4060 ir_type *type = get_entity_type(entity);
4062 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4065 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4066 ir_entity *entity, type_t *type)
4068 ir_node *memory = get_store();
4069 ir_node *nomem = new_NoMem();
4070 ir_node *frame = get_irg_frame(current_ir_graph);
4071 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4073 if (initializer->kind == INITIALIZER_VALUE) {
4074 initializer_value_t *initializer_value = &initializer->value;
4076 ir_node *value = expression_to_firm(initializer_value->value);
4077 type = skip_typeref(type);
4078 assign_value(dbgi, addr, type, value);
4082 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4083 ir_initializer_t *irinitializer
4084 = create_ir_initializer(initializer, type);
4086 create_dynamic_initializer(irinitializer, dbgi, entity);
4090 /* create a "template" entity which is copied to the entity on the stack */
4091 ir_entity *const init_entity
4092 = create_initializer_entity(dbgi, initializer, type);
4093 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4094 ir_type *const irtype = get_ir_type(type);
4095 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4097 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4098 set_store(copyb_mem);
4101 static void create_initializer_local_variable_entity(entity_t *entity)
4103 assert(entity->kind == ENTITY_VARIABLE);
4104 initializer_t *initializer = entity->variable.initializer;
4105 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4106 ir_entity *irentity = entity->variable.v.entity;
4107 type_t *type = entity->declaration.type;
4109 create_local_initializer(initializer, dbgi, irentity, type);
4112 static void create_variable_initializer(entity_t *entity)
4114 assert(entity->kind == ENTITY_VARIABLE);
4115 initializer_t *initializer = entity->variable.initializer;
4116 if (initializer == NULL)
4119 declaration_kind_t declaration_kind
4120 = (declaration_kind_t) entity->declaration.kind;
4121 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4122 create_initializer_local_variable_entity(entity);
4126 type_t *type = entity->declaration.type;
4127 type_qualifiers_t tq = get_type_qualifier(type, true);
4129 if (initializer->kind == INITIALIZER_VALUE) {
4130 expression_t * value = initializer->value.value;
4131 type_t *const init_type = skip_typeref(value->base.type);
4133 if (!is_type_scalar(init_type)) {
4135 while (value->kind == EXPR_UNARY_CAST)
4136 value = value->unary.value;
4138 if (value->kind != EXPR_COMPOUND_LITERAL)
4139 panic("expected non-scalar initializer to be a compound literal");
4140 initializer = value->compound_literal.initializer;
4141 goto have_initializer;
4144 ir_node * node = expression_to_firm(value);
4145 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4146 ir_mode *const mode = get_ir_mode_storage(init_type);
4147 node = create_conv(dbgi, node, mode);
4148 node = do_strict_conv(dbgi, node);
4150 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4151 set_value(entity->variable.v.value_number, node);
4153 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4155 ir_entity *irentity = entity->variable.v.entity;
4157 if (tq & TYPE_QUALIFIER_CONST
4158 && get_entity_owner(irentity) != get_tls_type()) {
4159 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4161 set_atomic_ent_value(irentity, node);
4165 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4166 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4168 ir_entity *irentity = entity->variable.v.entity;
4169 ir_initializer_t *irinitializer
4170 = create_ir_initializer(initializer, type);
4172 if (tq & TYPE_QUALIFIER_CONST) {
4173 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4175 set_entity_initializer(irentity, irinitializer);
4179 static void create_variable_length_array(entity_t *entity)
4181 assert(entity->kind == ENTITY_VARIABLE);
4182 assert(entity->variable.initializer == NULL);
4184 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4185 entity->variable.v.vla_base = NULL;
4187 /* TODO: record VLA somewhere so we create the free node when we leave
4191 static void allocate_variable_length_array(entity_t *entity)
4193 assert(entity->kind == ENTITY_VARIABLE);
4194 assert(entity->variable.initializer == NULL);
4195 assert(currently_reachable());
4197 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4198 type_t *type = entity->declaration.type;
4199 ir_type *el_type = get_ir_type(type->array.element_type);
4201 /* make sure size_node is calculated */
4202 get_type_size_node(type);
4203 ir_node *elems = type->array.size_node;
4204 ir_node *mem = get_store();
4205 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4207 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4208 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4211 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4212 entity->variable.v.vla_base = addr;
4216 * Creates a Firm local variable from a declaration.
4218 static void create_local_variable(entity_t *entity)
4220 assert(entity->kind == ENTITY_VARIABLE);
4221 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4223 bool needs_entity = entity->variable.address_taken;
4224 type_t *type = skip_typeref(entity->declaration.type);
4226 /* is it a variable length array? */
4227 if (is_type_array(type) && !type->array.size_constant) {
4228 create_variable_length_array(entity);
4230 } else if (is_type_array(type) || is_type_compound(type)) {
4231 needs_entity = true;
4232 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4233 needs_entity = true;
4237 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4238 create_variable_entity(entity,
4239 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4242 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4243 entity->variable.v.value_number = next_value_number_function;
4244 set_irg_loc_description(current_ir_graph, next_value_number_function,
4246 ++next_value_number_function;
4250 static void create_local_static_variable(entity_t *entity)
4252 assert(entity->kind == ENTITY_VARIABLE);
4253 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4255 type_t *type = skip_typeref(entity->declaration.type);
4256 ir_type *const var_type = entity->variable.thread_local ?
4257 get_tls_type() : get_glob_type();
4258 ir_type *const irtype = get_ir_type(type);
4259 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4261 size_t l = strlen(entity->base.symbol->string);
4262 char buf[l + sizeof(".%u")];
4263 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4264 ident *const id = id_unique(buf);
4265 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4267 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4268 set_entity_volatility(irentity, volatility_is_volatile);
4271 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4272 entity->variable.v.entity = irentity;
4274 set_entity_ld_ident(irentity, id);
4275 set_entity_visibility(irentity, ir_visibility_local);
4277 if (entity->variable.initializer == NULL) {
4278 ir_initializer_t *null_init = get_initializer_null();
4279 set_entity_initializer(irentity, null_init);
4282 ir_graph *const old_current_ir_graph = current_ir_graph;
4283 current_ir_graph = get_const_code_irg();
4285 create_variable_initializer(entity);
4287 assert(current_ir_graph == get_const_code_irg());
4288 current_ir_graph = old_current_ir_graph;
4293 static ir_node *return_statement_to_firm(return_statement_t *statement)
4295 if (!currently_reachable())
4298 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4299 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4300 ir_node * res = statement->value ? expression_to_firm(statement->value) : NULL;
4303 if (!is_type_void(type)) {
4304 ir_mode *const mode = get_ir_mode_storage(type);
4306 res = create_conv(dbgi, res, mode);
4307 res = do_strict_conv(dbgi, res);
4309 res = new_Unknown(mode);
4316 ir_node *const in[1] = { res };
4317 ir_node *const store = get_store();
4318 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4320 ir_node *end_block = get_irg_end_block(current_ir_graph);
4321 add_immBlock_pred(end_block, ret);
4323 set_unreachable_now();
4327 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4329 if (!currently_reachable())
4332 return expression_to_firm(statement->expression);
4335 static void create_local_declarations(entity_t*);
4337 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4339 create_local_declarations(compound->scope.entities);
4341 ir_node *result = NULL;
4342 statement_t *statement = compound->statements;
4343 for ( ; statement != NULL; statement = statement->base.next) {
4344 result = statement_to_firm(statement);
4350 static void create_global_variable(entity_t *entity)
4352 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4353 ir_visibility visibility = ir_visibility_external;
4354 storage_class_tag_t storage
4355 = (storage_class_tag_t)entity->declaration.storage_class;
4356 decl_modifiers_t modifiers = entity->declaration.modifiers;
4357 assert(entity->kind == ENTITY_VARIABLE);
4360 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4361 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4362 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
4363 case STORAGE_CLASS_TYPEDEF:
4364 case STORAGE_CLASS_AUTO:
4365 case STORAGE_CLASS_REGISTER:
4366 panic("invalid storage class for global var");
4369 /* "common" symbols */
4370 if (storage == STORAGE_CLASS_NONE
4371 && entity->variable.initializer == NULL
4372 && !entity->variable.thread_local
4373 && (modifiers & DM_WEAK) == 0) {
4374 linkage |= IR_LINKAGE_MERGE;
4377 ir_type *var_type = get_glob_type();
4378 if (entity->variable.thread_local) {
4379 var_type = get_tls_type();
4381 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4382 ir_entity *irentity = entity->variable.v.entity;
4383 add_entity_linkage(irentity, linkage);
4384 set_entity_visibility(irentity, visibility);
4385 if (entity->variable.initializer == NULL
4386 && storage != STORAGE_CLASS_EXTERN) {
4387 ir_initializer_t *null_init = get_initializer_null();
4388 set_entity_initializer(irentity, null_init);
4392 static void create_local_declaration(entity_t *entity)
4394 assert(is_declaration(entity));
4396 /* construct type */
4397 (void) get_ir_type(entity->declaration.type);
4398 if (entity->base.symbol == NULL) {
4402 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4403 case STORAGE_CLASS_STATIC:
4404 if (entity->kind == ENTITY_FUNCTION) {
4405 (void)get_function_entity(entity, NULL);
4407 create_local_static_variable(entity);
4410 case STORAGE_CLASS_EXTERN:
4411 if (entity->kind == ENTITY_FUNCTION) {
4412 assert(entity->function.statement == NULL);
4413 (void)get_function_entity(entity, NULL);
4415 create_global_variable(entity);
4416 create_variable_initializer(entity);
4419 case STORAGE_CLASS_NONE:
4420 case STORAGE_CLASS_AUTO:
4421 case STORAGE_CLASS_REGISTER:
4422 if (entity->kind == ENTITY_FUNCTION) {
4423 if (entity->function.statement != NULL) {
4424 ir_type *owner = get_irg_frame_type(current_ir_graph);
4425 (void)get_function_entity(entity, owner);
4426 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4427 enqueue_inner_function(entity);
4429 (void)get_function_entity(entity, NULL);
4432 create_local_variable(entity);
4435 case STORAGE_CLASS_TYPEDEF:
4438 panic("invalid storage class found");
4441 static void create_local_declarations(entity_t *e)
4443 for (; e; e = e->base.next) {
4444 if (is_declaration(e))
4445 create_local_declaration(e);
4449 static void initialize_local_declaration(entity_t *entity)
4451 if (entity->base.symbol == NULL)
4454 // no need to emit code in dead blocks
4455 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4456 && !currently_reachable())
4459 switch ((declaration_kind_t) entity->declaration.kind) {
4460 case DECLARATION_KIND_LOCAL_VARIABLE:
4461 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4462 create_variable_initializer(entity);
4465 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4466 allocate_variable_length_array(entity);
4469 case DECLARATION_KIND_COMPOUND_MEMBER:
4470 case DECLARATION_KIND_GLOBAL_VARIABLE:
4471 case DECLARATION_KIND_FUNCTION:
4472 case DECLARATION_KIND_INNER_FUNCTION:
4475 case DECLARATION_KIND_PARAMETER:
4476 case DECLARATION_KIND_PARAMETER_ENTITY:
4477 panic("can't initialize parameters");
4479 case DECLARATION_KIND_UNKNOWN:
4480 panic("can't initialize unknown declaration");
4482 panic("invalid declaration kind");
4485 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
4487 entity_t *entity = statement->declarations_begin;
4491 entity_t *const last = statement->declarations_end;
4492 for ( ;; entity = entity->base.next) {
4493 if (is_declaration(entity)) {
4494 initialize_local_declaration(entity);
4495 } else if (entity->kind == ENTITY_TYPEDEF) {
4496 /* ยง6.7.7:3 Any array size expressions associated with variable length
4497 * array declarators are evaluated each time the declaration of the
4498 * typedef name is reached in the order of execution. */
4499 type_t *const type = skip_typeref(entity->typedefe.type);
4500 if (is_type_array(type) && type->array.is_vla)
4501 get_vla_size(&type->array);
4510 static ir_node *if_statement_to_firm(if_statement_t *statement)
4512 create_local_declarations(statement->scope.entities);
4514 /* Create the condition. */
4515 ir_node *true_block = NULL;
4516 ir_node *false_block = NULL;
4517 if (currently_reachable()) {
4518 true_block = new_immBlock();
4519 false_block = new_immBlock();
4520 create_condition_evaluation(statement->condition, true_block, false_block);
4521 mature_immBlock(true_block);
4522 mature_immBlock(false_block);
4525 /* Create the true statement. */
4526 set_cur_block(true_block);
4527 statement_to_firm(statement->true_statement);
4528 ir_node *fallthrough_block = get_cur_block();
4530 /* Create the false statement. */
4531 set_cur_block(false_block);
4532 if (statement->false_statement != NULL) {
4533 statement_to_firm(statement->false_statement);
4536 /* Handle the block after the if-statement. Minor simplification and
4537 * optimisation: Reuse the false/true block as fallthrough block, if the
4538 * true/false statement does not pass control to the fallthrough block, e.g.
4539 * in the typical if (x) return; pattern. */
4540 if (fallthrough_block) {
4541 if (currently_reachable()) {
4542 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4543 ir_node *const f_jump = new_Jmp();
4544 ir_node *const in[] = { t_jump, f_jump };
4545 fallthrough_block = new_Block(2, in);
4547 set_cur_block(fallthrough_block);
4554 * Add an unconditional jump to the target block. If the source block is not
4555 * reachable, then a Bad predecessor is created to prevent Phi-less unreachable
4556 * loops. This is necessary if the jump potentially enters a loop.
4558 static void jump_to(ir_node *const target_block)
4560 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4561 add_immBlock_pred(target_block, pred);
4565 * Add an unconditional jump to the target block, if the current block is
4566 * reachable and do nothing otherwise. This is only valid if the jump does not
4567 * enter a loop (a back edge is ok).
4569 static void jump_if_reachable(ir_node *const target_block)
4571 if (currently_reachable())
4572 add_immBlock_pred(target_block, new_Jmp());
4575 static ir_node *while_statement_to_firm(while_statement_t *statement)
4577 create_local_declarations(statement->scope.entities);
4579 /* Create the header block */
4580 ir_node *const header_block = new_immBlock();
4581 jump_to(header_block);
4583 /* Create the condition. */
4584 ir_node * body_block;
4585 ir_node * false_block;
4586 expression_t *const cond = statement->condition;
4587 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4588 fold_constant_to_bool(cond)) {
4589 /* Shortcut for while (true). */
4590 body_block = header_block;
4593 keep_alive(header_block);
4594 keep_all_memory(header_block);
4596 body_block = new_immBlock();
4597 false_block = new_immBlock();
4599 set_cur_block(header_block);
4600 create_condition_evaluation(cond, body_block, false_block);
4601 mature_immBlock(body_block);
4604 ir_node *const old_continue_label = continue_label;
4605 ir_node *const old_break_label = break_label;
4606 continue_label = header_block;
4607 break_label = false_block;
4609 /* Create the loop body. */
4610 set_cur_block(body_block);
4611 statement_to_firm(statement->body);
4612 jump_if_reachable(header_block);
4614 mature_immBlock(header_block);
4615 assert(false_block == NULL || false_block == break_label);
4616 false_block = break_label;
4617 if (false_block != NULL) {
4618 mature_immBlock(false_block);
4620 set_cur_block(false_block);
4622 assert(continue_label == header_block);
4623 continue_label = old_continue_label;
4624 break_label = old_break_label;
4628 static ir_node *get_break_label(void)
4630 if (break_label == NULL) {
4631 break_label = new_immBlock();
4636 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
4638 create_local_declarations(statement->scope.entities);
4640 /* create the header block */
4641 ir_node *header_block = new_immBlock();
4644 ir_node *body_block = new_immBlock();
4645 jump_to(body_block);
4647 ir_node *old_continue_label = continue_label;
4648 ir_node *old_break_label = break_label;
4649 continue_label = header_block;
4652 set_cur_block(body_block);
4653 statement_to_firm(statement->body);
4654 ir_node *const false_block = get_break_label();
4656 assert(continue_label == header_block);
4657 continue_label = old_continue_label;
4658 break_label = old_break_label;
4660 jump_if_reachable(header_block);
4662 /* create the condition */
4663 mature_immBlock(header_block);
4664 set_cur_block(header_block);
4666 create_condition_evaluation(statement->condition, body_block, false_block);
4667 mature_immBlock(body_block);
4668 mature_immBlock(false_block);
4670 set_cur_block(false_block);
4674 static ir_node *for_statement_to_firm(for_statement_t *statement)
4676 create_local_declarations(statement->scope.entities);
4678 if (currently_reachable()) {
4679 entity_t *entity = statement->scope.entities;
4680 for ( ; entity != NULL; entity = entity->base.next) {
4681 if (!is_declaration(entity))
4684 initialize_local_declaration(entity);
4687 if (statement->initialisation != NULL) {
4688 expression_to_firm(statement->initialisation);
4692 /* Create the header block */
4693 ir_node *const header_block = new_immBlock();
4694 jump_to(header_block);
4696 /* Create the condition. */
4697 ir_node *body_block;
4698 ir_node *false_block;
4699 if (statement->condition != NULL) {
4700 body_block = new_immBlock();
4701 false_block = new_immBlock();
4703 set_cur_block(header_block);
4704 create_condition_evaluation(statement->condition, body_block, false_block);
4705 mature_immBlock(body_block);
4708 body_block = header_block;
4711 keep_alive(header_block);
4712 keep_all_memory(header_block);
4715 /* Create the step block, if necessary. */
4716 ir_node * step_block = header_block;
4717 expression_t *const step = statement->step;
4719 step_block = new_immBlock();
4722 ir_node *const old_continue_label = continue_label;
4723 ir_node *const old_break_label = break_label;
4724 continue_label = step_block;
4725 break_label = false_block;
4727 /* Create the loop body. */
4728 set_cur_block(body_block);
4729 statement_to_firm(statement->body);
4730 jump_if_reachable(step_block);
4732 /* Create the step code. */
4734 mature_immBlock(step_block);
4735 set_cur_block(step_block);
4736 expression_to_firm(step);
4737 jump_if_reachable(header_block);
4740 mature_immBlock(header_block);
4741 assert(false_block == NULL || false_block == break_label);
4742 false_block = break_label;
4743 if (false_block != NULL) {
4744 mature_immBlock(false_block);
4746 set_cur_block(false_block);
4748 assert(continue_label == step_block);
4749 continue_label = old_continue_label;
4750 break_label = old_break_label;
4754 static ir_node *create_jump_statement(const statement_t *statement, ir_node *target_block)
4756 if (!currently_reachable())
4759 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4760 ir_node *jump = new_d_Jmp(dbgi);
4761 add_immBlock_pred(target_block, jump);
4763 set_unreachable_now();
4767 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4769 /* determine number of cases */
4771 for (case_label_statement_t *l = statement->first_case; l != NULL;
4774 if (l->expression == NULL)
4776 if (l->is_empty_range)
4781 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4783 for (case_label_statement_t *l = statement->first_case; l != NULL;
4785 if (l->expression == NULL) {
4786 l->pn = pn_Switch_default;
4789 if (l->is_empty_range)
4791 ir_tarval *min = fold_constant_to_tarval(l->expression);
4792 ir_tarval *max = min;
4793 long pn = (long) i+1;
4794 if (l->end_range != NULL)
4795 max = fold_constant_to_tarval(l->end_range);
4796 ir_switch_table_set(res, i++, min, max, pn);
4802 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
4804 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4805 ir_node *switch_node = NULL;
4807 if (currently_reachable()) {
4808 ir_node *expression = expression_to_firm(statement->expression);
4809 ir_switch_table *table = create_switch_table(statement);
4810 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
4812 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
4815 set_unreachable_now();
4817 ir_node *const old_switch = current_switch;
4818 ir_node *const old_break_label = break_label;
4819 const bool old_saw_default_label = saw_default_label;
4820 saw_default_label = false;
4821 current_switch = switch_node;
4824 statement_to_firm(statement->body);
4826 if (currently_reachable()) {
4827 add_immBlock_pred(get_break_label(), new_Jmp());
4830 if (!saw_default_label && switch_node) {
4831 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
4832 add_immBlock_pred(get_break_label(), proj);
4835 if (break_label != NULL) {
4836 mature_immBlock(break_label);
4838 set_cur_block(break_label);
4840 assert(current_switch == switch_node);
4841 current_switch = old_switch;
4842 break_label = old_break_label;
4843 saw_default_label = old_saw_default_label;
4847 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
4849 if (statement->is_empty_range)
4852 if (current_switch != NULL) {
4853 ir_node *block = new_immBlock();
4854 /* Fallthrough from previous case */
4855 jump_if_reachable(block);
4857 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
4858 add_immBlock_pred(block, proj);
4859 if (statement->expression == NULL)
4860 saw_default_label = true;
4862 mature_immBlock(block);
4863 set_cur_block(block);
4866 return statement_to_firm(statement->statement);
4869 static ir_node *label_to_firm(const label_statement_t *statement)
4871 ir_node *block = get_label_block(statement->label);
4874 set_cur_block(block);
4876 keep_all_memory(block);
4878 return statement_to_firm(statement->statement);
4881 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
4883 if (!currently_reachable())
4886 ir_node *const irn = expression_to_firm(statement->expression);
4887 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
4888 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
4890 set_irn_link(ijmp, ijmp_list);
4893 set_unreachable_now();
4897 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
4899 bool needs_memory = false;
4901 if (statement->is_volatile) {
4902 needs_memory = true;
4905 size_t n_clobbers = 0;
4906 asm_clobber_t *clobber = statement->clobbers;
4907 for ( ; clobber != NULL; clobber = clobber->next) {
4908 const char *clobber_str = clobber->clobber.begin;
4910 if (!be_is_valid_clobber(clobber_str)) {
4911 errorf(&statement->base.source_position,
4912 "invalid clobber '%s' specified", clobber->clobber);
4916 if (streq(clobber_str, "memory")) {
4917 needs_memory = true;
4921 ident *id = new_id_from_str(clobber_str);
4922 obstack_ptr_grow(&asm_obst, id);
4925 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
4926 ident **clobbers = NULL;
4927 if (n_clobbers > 0) {
4928 clobbers = obstack_finish(&asm_obst);
4931 size_t n_inputs = 0;
4932 asm_argument_t *argument = statement->inputs;
4933 for ( ; argument != NULL; argument = argument->next)
4935 size_t n_outputs = 0;
4936 argument = statement->outputs;
4937 for ( ; argument != NULL; argument = argument->next)
4940 unsigned next_pos = 0;
4942 ir_node *ins[n_inputs + n_outputs + 1];
4945 ir_asm_constraint tmp_in_constraints[n_outputs];
4947 const expression_t *out_exprs[n_outputs];
4948 ir_node *out_addrs[n_outputs];
4949 size_t out_size = 0;
4951 argument = statement->outputs;
4952 for ( ; argument != NULL; argument = argument->next) {
4953 const char *constraints = argument->constraints.begin;
4954 asm_constraint_flags_t asm_flags
4955 = be_parse_asm_constraints(constraints);
4958 source_position_t const *const pos = &statement->base.source_position;
4959 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
4960 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
4962 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
4963 errorf(pos, "some constraints in '%s' are invalid", constraints);
4966 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
4967 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
4972 unsigned pos = next_pos++;
4973 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
4974 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
4975 expression_t *expr = argument->expression;
4976 ir_node *addr = expression_to_addr(expr);
4977 /* in+output, construct an artifical same_as constraint on the
4979 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
4981 ir_node *value = get_value_from_lvalue(expr, addr);
4983 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
4985 ir_asm_constraint constraint;
4986 constraint.pos = pos;
4987 constraint.constraint = new_id_from_str(buf);
4988 constraint.mode = get_ir_mode_storage(expr->base.type);
4989 tmp_in_constraints[in_size] = constraint;
4990 ins[in_size] = value;
4995 out_exprs[out_size] = expr;
4996 out_addrs[out_size] = addr;
4998 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
4999 /* pure memory ops need no input (but we have to make sure we
5000 * attach to the memory) */
5001 assert(! (asm_flags &
5002 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5003 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5004 needs_memory = true;
5006 /* we need to attach the address to the inputs */
5007 expression_t *expr = argument->expression;
5009 ir_asm_constraint constraint;
5010 constraint.pos = pos;
5011 constraint.constraint = new_id_from_str(constraints);
5012 constraint.mode = mode_M;
5013 tmp_in_constraints[in_size] = constraint;
5015 ins[in_size] = expression_to_addr(expr);
5019 errorf(&statement->base.source_position,
5020 "only modifiers but no place set in constraints '%s'",
5025 ir_asm_constraint constraint;
5026 constraint.pos = pos;
5027 constraint.constraint = new_id_from_str(constraints);
5028 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5030 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5032 assert(obstack_object_size(&asm_obst)
5033 == out_size * sizeof(ir_asm_constraint));
5034 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5037 obstack_grow(&asm_obst, tmp_in_constraints,
5038 in_size * sizeof(tmp_in_constraints[0]));
5039 /* find and count input and output arguments */
5040 argument = statement->inputs;
5041 for ( ; argument != NULL; argument = argument->next) {
5042 const char *constraints = argument->constraints.begin;
5043 asm_constraint_flags_t asm_flags
5044 = be_parse_asm_constraints(constraints);
5046 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5047 errorf(&statement->base.source_position,
5048 "some constraints in '%s' are not supported", constraints);
5051 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5052 errorf(&statement->base.source_position,
5053 "some constraints in '%s' are invalid", constraints);
5056 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5057 errorf(&statement->base.source_position,
5058 "write flag specified for input constraints '%s'",
5064 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5065 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5066 /* we can treat this as "normal" input */
5067 input = expression_to_firm(argument->expression);
5068 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5069 /* pure memory ops need no input (but we have to make sure we
5070 * attach to the memory) */
5071 assert(! (asm_flags &
5072 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5073 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5074 needs_memory = true;
5075 input = expression_to_addr(argument->expression);
5077 errorf(&statement->base.source_position,
5078 "only modifiers but no place set in constraints '%s'",
5083 ir_asm_constraint constraint;
5084 constraint.pos = next_pos++;
5085 constraint.constraint = new_id_from_str(constraints);
5086 constraint.mode = get_irn_mode(input);
5088 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5089 ins[in_size++] = input;
5093 ir_asm_constraint constraint;
5094 constraint.pos = next_pos++;
5095 constraint.constraint = new_id_from_str("");
5096 constraint.mode = mode_M;
5098 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5099 ins[in_size++] = get_store();
5102 assert(obstack_object_size(&asm_obst)
5103 == in_size * sizeof(ir_asm_constraint));
5104 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5106 /* create asm node */
5107 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5109 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5111 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5112 out_size, output_constraints,
5113 n_clobbers, clobbers, asm_text);
5115 if (statement->is_volatile) {
5116 set_irn_pinned(node, op_pin_state_pinned);
5118 set_irn_pinned(node, op_pin_state_floats);
5121 /* create output projs & connect them */
5123 ir_node *projm = new_Proj(node, mode_M, out_size);
5128 for (i = 0; i < out_size; ++i) {
5129 const expression_t *out_expr = out_exprs[i];
5131 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5132 ir_node *proj = new_Proj(node, mode, pn);
5133 ir_node *addr = out_addrs[i];
5135 set_value_for_expression_addr(out_expr, proj, addr);
5141 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5143 statement_to_firm(statement->try_statement);
5144 source_position_t const *const pos = &statement->base.source_position;
5145 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5149 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5151 errorf(&statement->base.source_position, "__leave not supported yet");
5156 * Transform a statement.
5158 static ir_node *statement_to_firm(statement_t *const stmt)
5161 assert(!stmt->base.transformed);
5162 stmt->base.transformed = true;
5165 switch (stmt->kind) {
5166 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5167 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5168 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5169 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5170 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5171 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5172 case STATEMENT_EMPTY: return NULL; /* nothing */
5173 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5174 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5175 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5176 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5177 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5178 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5179 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5180 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5181 case STATEMENT_WHILE: return while_statement_to_firm( &stmt->whiles);
5183 case STATEMENT_BREAK: return create_jump_statement(stmt, get_break_label());
5184 case STATEMENT_CONTINUE: return create_jump_statement(stmt, continue_label);
5185 case STATEMENT_GOTO: return create_jump_statement(stmt, get_label_block(stmt->gotos.label));
5187 case STATEMENT_ERROR: panic("error statement found");
5189 panic("statement not implemented");
5192 static int count_local_variables(const entity_t *entity,
5193 const entity_t *const last)
5196 entity_t const *const end = last != NULL ? last->base.next : NULL;
5197 for (; entity != end; entity = entity->base.next) {
5198 if ((entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER) &&
5199 !entity->variable.address_taken &&
5200 is_type_scalar(skip_typeref(entity->declaration.type)))
5206 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5208 int *const count = env;
5210 switch (stmt->kind) {
5211 case STATEMENT_DECLARATION: {
5212 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5213 *count += count_local_variables(decl_stmt->declarations_begin,
5214 decl_stmt->declarations_end);
5219 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5228 * Return the number of local (alias free) variables used by a function.
5230 static int get_function_n_local_vars(entity_t *entity)
5232 const function_t *function = &entity->function;
5235 /* count parameters */
5236 count += count_local_variables(function->parameters.entities, NULL);
5238 /* count local variables declared in body */
5239 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5244 * Build Firm code for the parameters of a function.
5246 static void initialize_function_parameters(entity_t *entity)
5248 assert(entity->kind == ENTITY_FUNCTION);
5249 ir_graph *irg = current_ir_graph;
5250 ir_node *args = get_irg_args(irg);
5252 ir_type *function_irtype;
5254 if (entity->function.need_closure) {
5255 /* add an extra parameter for the static link */
5256 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5259 /* Matze: IMO this is wrong, nested functions should have an own
5260 * type and not rely on strange parameters... */
5261 function_irtype = create_method_type(&entity->declaration.type->function, true);
5263 function_irtype = get_ir_type(entity->declaration.type);
5268 entity_t *parameter = entity->function.parameters.entities;
5269 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5270 if (parameter->kind != ENTITY_PARAMETER)
5273 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5274 type_t *type = skip_typeref(parameter->declaration.type);
5276 assert(!is_type_array(type));
5277 bool const needs_entity = parameter->variable.address_taken || is_type_compound(type);
5279 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5281 ir_type *frame_type = get_irg_frame_type(irg);
5283 = new_parameter_entity(frame_type, n, param_irtype);
5284 parameter->declaration.kind = DECLARATION_KIND_PARAMETER_ENTITY;
5285 parameter->variable.v.entity = param;
5289 ir_mode *param_mode = get_type_mode(param_irtype);
5291 ir_node *value = new_r_Proj(args, param_mode, pn);
5293 ir_mode *mode = get_ir_mode_storage(type);
5294 value = create_conv(NULL, value, mode);
5295 value = do_strict_conv(NULL, value);
5297 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5298 parameter->variable.v.value_number = next_value_number_function;
5299 set_irg_loc_description(current_ir_graph, next_value_number_function,
5301 ++next_value_number_function;
5303 set_value(parameter->variable.v.value_number, value);
5308 * Handle additional decl modifiers for IR-graphs
5310 * @param irg the IR-graph
5311 * @param dec_modifiers additional modifiers
5313 static void handle_decl_modifier_irg(ir_graph *irg,
5314 decl_modifiers_t decl_modifiers)
5316 if (decl_modifiers & DM_NAKED) {
5317 /* TRUE if the declaration includes the Microsoft
5318 __declspec(naked) specifier. */
5319 add_irg_additional_properties(irg, mtp_property_naked);
5321 if (decl_modifiers & DM_FORCEINLINE) {
5322 /* TRUE if the declaration includes the
5323 Microsoft __forceinline specifier. */
5324 set_irg_inline_property(irg, irg_inline_forced);
5326 if (decl_modifiers & DM_NOINLINE) {
5327 /* TRUE if the declaration includes the Microsoft
5328 __declspec(noinline) specifier. */
5329 set_irg_inline_property(irg, irg_inline_forbidden);
5333 static void add_function_pointer(ir_type *segment, ir_entity *method,
5334 const char *unique_template)
5336 ir_type *method_type = get_entity_type(method);
5337 ir_type *ptr_type = new_type_pointer(method_type);
5339 /* these entities don't really have a name but firm only allows
5341 * Note that we mustn't give these entities a name since for example
5342 * Mach-O doesn't allow them. */
5343 ident *ide = id_unique(unique_template);
5344 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5345 ir_graph *irg = get_const_code_irg();
5346 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5349 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5350 set_entity_compiler_generated(ptr, 1);
5351 set_entity_visibility(ptr, ir_visibility_private);
5352 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5353 set_atomic_ent_value(ptr, val);
5357 * Generate possible IJmp branches to a given label block.
5359 static void gen_ijmp_branches(ir_node *block)
5362 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5363 add_immBlock_pred(block, ijmp);
5368 * Create code for a function and all inner functions.
5370 * @param entity the function entity
5372 static void create_function(entity_t *entity)
5374 assert(entity->kind == ENTITY_FUNCTION);
5375 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5377 if (entity->function.statement == NULL)
5380 inner_functions = NULL;
5381 current_trampolines = NULL;
5383 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5384 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5385 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5387 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5388 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5389 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5392 current_function_entity = entity;
5393 current_function_name = NULL;
5394 current_funcsig = NULL;
5396 assert(all_labels == NULL);
5397 all_labels = NEW_ARR_F(label_t *, 0);
5400 int n_local_vars = get_function_n_local_vars(entity);
5401 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5402 current_ir_graph = irg;
5404 ir_graph *old_current_function = current_function;
5405 current_function = irg;
5407 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5408 current_vararg_entity = NULL;
5410 set_irg_fp_model(irg, firm_fp_model);
5411 tarval_enable_fp_ops(1);
5412 set_irn_dbg_info(get_irg_start_block(irg),
5413 get_entity_dbg_info(function_entity));
5415 /* set inline flags */
5416 if (entity->function.is_inline)
5417 set_irg_inline_property(irg, irg_inline_recomended);
5418 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5420 next_value_number_function = 0;
5421 initialize_function_parameters(entity);
5422 current_static_link = entity->function.static_link;
5424 statement_to_firm(entity->function.statement);
5426 ir_node *end_block = get_irg_end_block(irg);
5428 /* do we have a return statement yet? */
5429 if (currently_reachable()) {
5430 type_t *type = skip_typeref(entity->declaration.type);
5431 assert(is_type_function(type));
5432 type_t *const return_type = skip_typeref(type->function.return_type);
5435 if (is_type_void(return_type)) {
5436 ret = new_Return(get_store(), 0, NULL);
5438 ir_mode *const mode = get_ir_mode_storage(return_type);
5441 /* ยง5.1.2.2.3 main implicitly returns 0 */
5442 if (is_main(entity)) {
5443 in[0] = new_Const(get_mode_null(mode));
5445 in[0] = new_Unknown(mode);
5447 ret = new_Return(get_store(), 1, in);
5449 add_immBlock_pred(end_block, ret);
5452 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5453 label_t *label = all_labels[i];
5454 if (label->address_taken) {
5455 gen_ijmp_branches(label->block);
5457 mature_immBlock(label->block);
5460 DEL_ARR_F(all_labels);
5463 irg_finalize_cons(irg);
5465 /* finalize the frame type */
5466 ir_type *frame_type = get_irg_frame_type(irg);
5467 int n = get_compound_n_members(frame_type);
5470 for (int i = 0; i < n; ++i) {
5471 ir_entity *member = get_compound_member(frame_type, i);
5472 ir_type *entity_type = get_entity_type(member);
5474 int align = get_type_alignment_bytes(entity_type);
5475 if (align > align_all)
5479 misalign = offset % align;
5481 offset += align - misalign;
5485 set_entity_offset(member, offset);
5486 offset += get_type_size_bytes(entity_type);
5488 set_type_size_bytes(frame_type, offset);
5489 set_type_alignment_bytes(frame_type, align_all);
5491 irg_verify(irg, VERIFY_ENFORCE_SSA);
5492 current_vararg_entity = old_current_vararg_entity;
5493 current_function = old_current_function;
5495 if (current_trampolines != NULL) {
5496 DEL_ARR_F(current_trampolines);
5497 current_trampolines = NULL;
5500 /* create inner functions if any */
5501 entity_t **inner = inner_functions;
5502 if (inner != NULL) {
5503 ir_type *rem_outer_frame = current_outer_frame;
5504 current_outer_frame = get_irg_frame_type(current_ir_graph);
5505 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5506 create_function(inner[i]);
5510 current_outer_frame = rem_outer_frame;
5514 static void scope_to_firm(scope_t *scope)
5516 /* first pass: create declarations */
5517 entity_t *entity = scope->entities;
5518 for ( ; entity != NULL; entity = entity->base.next) {
5519 if (entity->base.symbol == NULL)
5522 if (entity->kind == ENTITY_FUNCTION) {
5523 if (entity->function.btk != BUILTIN_NONE) {
5524 /* builtins have no representation */
5527 (void)get_function_entity(entity, NULL);
5528 } else if (entity->kind == ENTITY_VARIABLE) {
5529 create_global_variable(entity);
5530 } else if (entity->kind == ENTITY_NAMESPACE) {
5531 scope_to_firm(&entity->namespacee.members);
5535 /* second pass: create code/initializers */
5536 entity = scope->entities;
5537 for ( ; entity != NULL; entity = entity->base.next) {
5538 if (entity->base.symbol == NULL)
5541 if (entity->kind == ENTITY_FUNCTION) {
5542 if (entity->function.btk != BUILTIN_NONE) {
5543 /* builtins have no representation */
5546 create_function(entity);
5547 } else if (entity->kind == ENTITY_VARIABLE) {
5548 assert(entity->declaration.kind
5549 == DECLARATION_KIND_GLOBAL_VARIABLE);
5550 current_ir_graph = get_const_code_irg();
5551 create_variable_initializer(entity);
5556 void init_ast2firm(void)
5558 obstack_init(&asm_obst);
5559 init_atomic_modes();
5561 ir_set_debug_retrieve(dbg_retrieve);
5562 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5564 /* create idents for all known runtime functions */
5565 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5566 rts_idents[i] = new_id_from_str(rts_data[i].name);
5569 entitymap_init(&entitymap);
5572 static void init_ir_types(void)
5574 static int ir_types_initialized = 0;
5575 if (ir_types_initialized)
5577 ir_types_initialized = 1;
5579 ir_type_char = get_ir_type(type_char);
5580 ir_type_wchar_t = get_ir_type(type_wchar_t);
5582 be_params = be_get_backend_param();
5583 mode_float_arithmetic = be_params->mode_float_arithmetic;
5585 stack_param_align = be_params->stack_param_align;
5588 void exit_ast2firm(void)
5590 entitymap_destroy(&entitymap);
5591 obstack_free(&asm_obst, NULL);
5594 static void global_asm_to_firm(statement_t *s)
5596 for (; s != NULL; s = s->base.next) {
5597 assert(s->kind == STATEMENT_ASM);
5599 char const *const text = s->asms.asm_text.begin;
5600 size_t const size = s->asms.asm_text.size;
5601 ident *const id = new_id_from_chars(text, size);
5606 static const char *get_cwd(void)
5608 static char buf[1024];
5610 getcwd(buf, sizeof(buf));
5614 void translation_unit_to_firm(translation_unit_t *unit)
5616 if (c_mode & _CXX) {
5617 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
5618 } else if (c_mode & _C99) {
5619 be_dwarf_set_source_language(DW_LANG_C99);
5620 } else if (c_mode & _C89) {
5621 be_dwarf_set_source_language(DW_LANG_C89);
5623 be_dwarf_set_source_language(DW_LANG_C);
5625 be_dwarf_set_compilation_directory(get_cwd());
5627 /* initialize firm arithmetic */
5628 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5629 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5631 /* just to be sure */
5632 continue_label = NULL;
5634 current_switch = NULL;
5635 current_translation_unit = unit;
5639 scope_to_firm(&unit->scope);
5640 global_asm_to_firm(unit->global_asm);
5642 current_ir_graph = NULL;
5643 current_translation_unit = NULL;