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"
38 #include "jump_target.h"
45 #include "diagnostic.h"
46 #include "lang_features.h"
48 #include "type_hash.h"
53 #include "entitymap_t.h"
54 #include "driver/firm_opt.h"
56 typedef struct trampoline_region trampoline_region;
57 struct trampoline_region {
58 ir_entity *function; /**< The function that is called by this trampoline */
59 ir_entity *region; /**< created region for the trampoline */
62 typedef struct complex_value {
67 typedef struct complex_constant {
72 fp_model_t firm_fp_model = fp_model_precise;
74 static const backend_params *be_params;
76 static ir_type *ir_type_char;
78 /* architecture specific floating point arithmetic mode (if any) */
79 static ir_mode *mode_float_arithmetic;
81 /* alignment of stack parameters */
82 static unsigned stack_param_align;
84 static int next_value_number_function;
85 static jump_target continue_target;
86 static jump_target break_target;
87 static ir_node *current_switch;
88 static bool saw_default_label;
89 static entity_t **inner_functions;
90 static jump_target ijmp_target;
91 static ir_node **ijmp_ops;
92 static ir_node **ijmp_blocks;
93 static bool constant_folding;
95 #define PUSH_BREAK(val) \
96 jump_target const old_break_target = break_target; \
97 (init_jump_target(&break_target, (val)))
99 ((void)(break_target = old_break_target))
101 #define PUSH_CONTINUE(val) \
102 jump_target const old_continue_target = continue_target; \
103 (init_jump_target(&continue_target, (val)))
104 #define POP_CONTINUE() \
105 ((void)(continue_target = old_continue_target))
107 #define PUSH_IRG(val) \
108 ir_graph *const old_irg = current_ir_graph; \
109 ir_graph *const new_irg = (val); \
110 ((void)(current_ir_graph = new_irg))
113 (assert(current_ir_graph == new_irg), (void)(current_ir_graph = old_irg))
115 static const entity_t *current_function_entity;
116 static ir_node *current_function_name;
117 static ir_node *current_funcsig;
118 static ir_graph *current_function;
119 static translation_unit_t *current_translation_unit;
120 static trampoline_region *current_trampolines;
121 static ir_type *current_outer_frame;
122 static ir_node *current_static_link;
123 static ir_entity *current_vararg_entity;
125 static entitymap_t entitymap;
127 static struct obstack asm_obst;
129 typedef enum declaration_kind_t {
130 DECLARATION_KIND_UNKNOWN,
131 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
132 DECLARATION_KIND_GLOBAL_VARIABLE,
133 DECLARATION_KIND_LOCAL_VARIABLE,
134 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
135 DECLARATION_KIND_PARAMETER,
136 DECLARATION_KIND_PARAMETER_ENTITY,
137 DECLARATION_KIND_FUNCTION,
138 DECLARATION_KIND_COMPOUND_MEMBER,
139 DECLARATION_KIND_INNER_FUNCTION
140 } declaration_kind_t;
142 static ir_type *get_ir_type_incomplete(type_t *type);
144 static void enqueue_inner_function(entity_t *entity)
146 if (inner_functions == NULL)
147 inner_functions = NEW_ARR_F(entity_t *, 0);
148 ARR_APP1(entity_t*, inner_functions, entity);
151 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
153 const entity_t *entity = get_irg_loc_description(irg, pos);
155 if (entity != NULL) {
156 position_t const *const pos = &entity->base.pos;
157 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
159 return new_r_Unknown(irg, mode);
162 static src_loc_t dbg_retrieve(const dbg_info *dbg)
164 position_t const *const pos = (position_t const*)dbg;
166 return (src_loc_t){ pos->input_name, pos->lineno, pos->colno };
168 return (src_loc_t){ NULL, 0, 0 };
172 static dbg_info *get_dbg_info(const position_t *pos)
174 return (dbg_info*) pos;
177 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
178 const type_dbg_info *dbg)
181 print_to_buffer(buffer, buffer_size);
182 const type_t *type = (const type_t*) dbg;
184 finish_print_to_buffer();
187 static type_dbg_info *get_type_dbg_info_(const type_t *type)
189 return (type_dbg_info*) type;
192 /* is the current block a reachable one? */
193 static bool currently_reachable(void)
195 ir_node *const block = get_cur_block();
196 return block != NULL && !is_Bad(block);
199 static void set_unreachable_now(void)
204 ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
206 static ir_node *expression_to_control_flow(expression_t const *expr, jump_target *true_target, jump_target *false_target);
207 static ir_node *expression_to_value(expression_t const *expr);
208 static complex_value expression_to_complex(const expression_t *expression);
210 static unsigned decide_modulo_shift(unsigned type_size)
212 if (architecture_modulo_shift == 0)
214 if (type_size < architecture_modulo_shift)
215 return architecture_modulo_shift;
219 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
221 unsigned flags = get_atomic_type_flags(kind);
222 unsigned size = get_atomic_type_size(kind);
223 if (flags & ATOMIC_TYPE_FLAG_FLOAT) {
225 case 4: return get_modeF();
226 case 8: return get_modeD();
227 default: panic("unexpected kind");
229 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
231 unsigned bit_size = size * 8;
232 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
233 unsigned modulo_shift = decide_modulo_shift(bit_size);
235 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
236 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
244 * Initialises the atomic modes depending on the machine size.
246 static void init_atomic_modes(void)
248 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
249 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
250 if (atomic_modes[i] != NULL)
252 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
256 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
258 assert(kind <= ATOMIC_TYPE_LAST);
259 return atomic_modes[kind];
262 static ir_node *get_vla_size(array_type_t *const type)
264 ir_node *size_node = type->size_node;
265 if (size_node == NULL) {
266 size_node = expression_to_value(type->size_expression);
267 type->size_node = size_node;
272 static unsigned count_parameters(const function_type_t *function_type)
276 function_parameter_t *parameter = function_type->parameters;
277 for ( ; parameter != NULL; parameter = parameter->next) {
284 static ir_type *create_primitive_irtype(atomic_type_kind_t akind,
287 ir_mode *mode = atomic_modes[akind];
288 ir_type *irtype = new_d_type_primitive(mode, dbgi);
289 unsigned alignment = get_atomic_type_alignment(akind);
290 unsigned size = get_atomic_type_size(akind);
292 set_type_size_bytes(irtype, size);
293 set_type_alignment_bytes(irtype, alignment);
299 * Creates a Firm type for an atomic type
301 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
303 type_dbg_info *dbgi = get_type_dbg_info_(type);
304 return create_primitive_irtype(akind, dbgi);
308 * Creates a Firm type for a complex type
310 static ir_type *create_complex_type(atomic_type_kind_t akind,
313 type_dbg_info *dbgi = get_type_dbg_info_(type);
314 ir_type *etype = create_primitive_irtype(akind, NULL);
315 ir_type *irtype = new_d_type_array(1, etype, dbgi);
317 int align = get_type_alignment_bytes(etype);
318 set_type_alignment_bytes(irtype, align);
319 unsigned n_elements = 2;
320 set_array_bounds_int(irtype, 0, 0, n_elements);
321 size_t elemsize = get_type_size_bytes(etype);
322 if (elemsize % align > 0) {
323 elemsize += align - (elemsize % align);
325 set_type_size_bytes(irtype, n_elements * elemsize);
326 set_type_state(irtype, layout_fixed);
332 * Creates a Firm type for an imaginary type
334 static ir_type *create_imaginary_type(const atomic_type_t *type)
336 return create_atomic_type(type->akind, (const type_t*)type);
340 * return type of a parameter (and take transparent union gnu extension into
343 static type_t *get_parameter_type(type_t *orig_type)
345 type_t *type = skip_typeref(orig_type);
346 if (is_type_union(type)
347 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
348 compound_t *compound = type->compound.compound;
349 type = compound->members.entities->declaration.type;
355 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
357 type_t *return_type = skip_typeref(function_type->return_type);
359 int n_parameters = count_parameters(function_type)
360 + (for_closure ? 1 : 0);
361 int n_results = is_type_void(return_type) ? 0 : 1;
362 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
363 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
365 if (!is_type_void(return_type)) {
366 ir_type *restype = get_ir_type(return_type);
367 set_method_res_type(irtype, 0, restype);
370 function_parameter_t *parameter = function_type->parameters;
373 ir_type *p_irtype = get_ir_type(type_void_ptr);
374 set_method_param_type(irtype, n, p_irtype);
377 for ( ; parameter != NULL; parameter = parameter->next) {
378 type_t *type = get_parameter_type(parameter->type);
379 ir_type *p_irtype = get_ir_type(type);
380 set_method_param_type(irtype, n, p_irtype);
384 bool is_variadic = function_type->variadic;
387 set_method_variadicity(irtype, variadicity_variadic);
389 unsigned cc = get_method_calling_convention(irtype);
390 switch (function_type->calling_convention) {
391 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
394 set_method_calling_convention(irtype, SET_CDECL(cc));
401 /* only non-variadic function can use stdcall, else use cdecl */
402 set_method_calling_convention(irtype, SET_STDCALL(cc));
408 /* only non-variadic function can use fastcall, else use cdecl */
409 set_method_calling_convention(irtype, SET_FASTCALL(cc));
413 /* Hmm, leave default, not accepted by the parser yet. */
418 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
420 const decl_modifiers_t modifiers = function_type->modifiers;
421 if (modifiers & DM_CONST)
422 add_method_additional_properties(irtype, mtp_property_const);
423 if (modifiers & DM_PURE)
424 add_method_additional_properties(irtype, mtp_property_pure);
425 if (modifiers & DM_RETURNS_TWICE)
426 add_method_additional_properties(irtype, mtp_property_returns_twice);
427 if (modifiers & DM_NORETURN)
428 add_method_additional_properties(irtype, mtp_property_noreturn);
429 if (modifiers & DM_NOTHROW)
430 add_method_additional_properties(irtype, mtp_property_nothrow);
431 if (modifiers & DM_MALLOC)
432 add_method_additional_properties(irtype, mtp_property_malloc);
437 static ir_type *create_pointer_type(pointer_type_t *type)
439 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
440 type_t *points_to = type->points_to;
441 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
442 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
447 static ir_type *create_reference_type(reference_type_t *type)
449 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
450 type_t *refers_to = type->refers_to;
451 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
452 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
457 static ir_type *create_array_type(array_type_t *type)
459 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
460 type_t *element_type = type->element_type;
461 ir_type *ir_element_type = get_ir_type(element_type);
462 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
464 const int align = get_type_alignment_bytes(ir_element_type);
465 set_type_alignment_bytes(irtype, align);
467 if (type->size_constant) {
468 int n_elements = type->size;
470 set_array_bounds_int(irtype, 0, 0, n_elements);
472 size_t elemsize = get_type_size_bytes(ir_element_type);
473 if (elemsize % align > 0) {
474 elemsize += align - (elemsize % align);
476 set_type_size_bytes(irtype, n_elements * elemsize);
478 set_array_lower_bound_int(irtype, 0, 0);
480 set_type_state(irtype, layout_fixed);
486 * Return the signed integer type of size bits.
488 * @param size the size
490 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
494 static ir_mode *s_modes[64 + 1] = {NULL, };
498 if (size <= 0 || size > 64)
501 mode = s_modes[size];
505 snprintf(name, sizeof(name), "bf_I%u", size);
506 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
507 s_modes[size] = mode;
510 type_dbg_info *dbgi = get_type_dbg_info_(type);
511 res = new_d_type_primitive(mode, dbgi);
512 set_primitive_base_type(res, base_tp);
518 * Return the unsigned integer type of size bits.
520 * @param size the size
522 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
526 static ir_mode *u_modes[64 + 1] = {NULL, };
530 if (size <= 0 || size > 64)
533 mode = u_modes[size];
537 snprintf(name, sizeof(name), "bf_U%u", size);
538 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
539 u_modes[size] = mode;
542 type_dbg_info *dbgi = get_type_dbg_info_(type);
543 res = new_d_type_primitive(mode, dbgi);
544 set_primitive_base_type(res, base_tp);
549 static ir_type *create_bitfield_type(const entity_t *entity)
551 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
552 type_t *base = skip_typeref(entity->declaration.type);
553 assert(is_type_integer(base));
554 ir_type *irbase = get_ir_type(base);
556 unsigned bit_size = entity->compound_member.bit_size;
558 if (is_type_signed(base)) {
559 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
561 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
566 * Construct firm type from ast struct type.
568 static ir_type *create_compound_type(compound_type_t *const type, bool const incomplete)
570 compound_t *compound = type->compound;
572 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
573 return compound->irtype;
576 bool const is_union = type->base.kind == TYPE_COMPOUND_UNION;
578 symbol_t *type_symbol = compound->base.symbol;
580 if (type_symbol != NULL) {
581 id = new_id_from_str(type_symbol->string);
584 id = id_unique("__anonymous_union.%u");
586 id = id_unique("__anonymous_struct.%u");
592 irtype = new_type_union(id);
594 irtype = new_type_struct(id);
597 compound->irtype_complete = false;
598 compound->irtype = irtype;
604 layout_union_type(type);
606 layout_struct_type(type);
609 compound->irtype_complete = true;
611 entity_t *entry = compound->members.entities;
612 for ( ; entry != NULL; entry = entry->base.next) {
613 if (entry->kind != ENTITY_COMPOUND_MEMBER)
616 symbol_t *symbol = entry->base.symbol;
617 type_t *entry_type = entry->declaration.type;
619 if (symbol == NULL) {
620 /* anonymous bitfield member, skip */
621 if (entry->compound_member.bitfield)
623 assert(is_type_compound(entry_type));
624 ident = id_unique("anon.%u");
626 ident = new_id_from_str(symbol->string);
629 dbg_info *dbgi = get_dbg_info(&entry->base.pos);
631 ir_type *entry_irtype;
632 if (entry->compound_member.bitfield) {
633 entry_irtype = create_bitfield_type(entry);
635 entry_irtype = get_ir_type(entry_type);
637 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
639 set_entity_offset(entity, entry->compound_member.offset);
640 set_entity_offset_bits_remainder(entity,
641 entry->compound_member.bit_offset);
643 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
644 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
645 entry->compound_member.entity = entity;
648 set_type_alignment_bytes(irtype, compound->alignment);
649 set_type_size_bytes(irtype, compound->size);
650 set_type_state(irtype, layout_fixed);
655 void determine_enum_values(enum_type_t *const type)
657 ir_mode *const mode = atomic_modes[type->base.akind];
658 ir_tarval *const one = get_mode_one(mode);
659 ir_tarval * tv_next = get_mode_null(mode);
661 enum_t *enume = type->enume;
662 entity_t *entry = enume->base.next;
663 for (; entry != NULL; entry = entry->base.next) {
664 if (entry->kind != ENTITY_ENUM_VALUE)
667 expression_t *const init = entry->enum_value.value;
669 tv_next = fold_constant_to_tarval(init);
671 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
672 entry->enum_value.tv = tv_next;
673 tv_next = tarval_add(tv_next, one);
677 static ir_type *create_enum_type(enum_type_t *const type)
679 return create_atomic_type(type->base.akind, (const type_t*) type);
682 static ir_type *get_ir_type_incomplete(type_t *type)
684 type = skip_typeref(type);
686 if (type->base.firm_type != NULL) {
687 return type->base.firm_type;
690 if (is_type_compound(type)) {
691 return create_compound_type(&type->compound, true);
693 return get_ir_type(type);
697 ir_type *get_ir_type(type_t *type)
699 type = skip_typeref(type);
701 if (type->base.firm_type != NULL) {
702 return type->base.firm_type;
705 ir_type *firm_type = NULL;
706 switch (type->kind) {
708 firm_type = create_atomic_type(type->atomic.akind, type);
711 firm_type = create_complex_type(type->atomic.akind, type);
714 firm_type = create_imaginary_type(&type->atomic);
717 firm_type = create_method_type(&type->function, false);
720 firm_type = create_pointer_type(&type->pointer);
723 firm_type = create_reference_type(&type->reference);
726 firm_type = create_array_type(&type->array);
728 case TYPE_COMPOUND_STRUCT:
729 case TYPE_COMPOUND_UNION:
730 firm_type = create_compound_type(&type->compound, false);
733 firm_type = create_enum_type(&type->enumt);
741 if (firm_type == NULL)
742 panic("unknown type found");
744 type->base.firm_type = firm_type;
748 static ir_mode *get_ir_mode_storage(type_t *type)
750 type = skip_typeref(type);
752 /* Firm doesn't report a mode for arrays and structs/unions. */
753 if (!is_type_scalar(type) || is_type_complex(type)) {
757 ir_type *const irtype = get_ir_type(type);
758 ir_mode *const mode = get_type_mode(irtype);
759 assert(mode != NULL);
763 static ir_mode *get_complex_mode_storage(type_t *type)
765 assert(is_type_complex(skip_typeref(type)));
766 ir_type *const irtype = get_ir_type(type);
767 ir_type *const etype = get_array_element_type(irtype);
768 ir_mode *const mode = get_type_mode(etype);
773 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
774 * int that it returns bigger modes for floating point on some platforms
775 * (x87 internally does arithemtic with 80bits)
777 static ir_mode *get_ir_mode_arithmetic(type_t *type)
779 ir_mode *mode = get_ir_mode_storage(type);
780 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
781 return mode_float_arithmetic;
787 static ir_mode *get_complex_mode_arithmetic(type_t *type)
789 ir_mode *mode = get_complex_mode_storage(type);
790 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
791 return mode_float_arithmetic;
798 * Return a node representing the size of a type.
800 static ir_node *get_type_size_node(type_t *type)
802 ir_mode *const mode = get_ir_mode_storage(type_size_t);
803 type = skip_typeref(type);
805 if (is_type_array(type) && type->array.is_vla) {
806 ir_node *size_node = get_vla_size(&type->array);
807 ir_node *elem_size = get_type_size_node(type->array.element_type);
808 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
812 unsigned const size = get_type_size(type);
813 return new_Const_long(mode, size);
816 /** Names of the runtime functions. */
817 static const struct {
818 int id; /**< the rts id */
819 int n_res; /**< number of return values */
820 const char *name; /**< the name of the rts function */
821 int n_params; /**< number of parameters */
822 unsigned flags; /**< language flags */
824 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
825 { rts_abort, 0, "abort", 0, _C89 },
826 { rts_alloca, 1, "alloca", 1, _ALL },
827 { rts_abs, 1, "abs", 1, _C89 },
828 { rts_labs, 1, "labs", 1, _C89 },
829 { rts_llabs, 1, "llabs", 1, _C99 },
830 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
832 { rts_fabs, 1, "fabs", 1, _C89 },
833 { rts_sqrt, 1, "sqrt", 1, _C89 },
834 { rts_cbrt, 1, "cbrt", 1, _C99 },
835 { rts_exp, 1, "exp", 1, _C89 },
836 { rts_exp2, 1, "exp2", 1, _C89 },
837 { rts_exp10, 1, "exp10", 1, _GNUC },
838 { rts_log, 1, "log", 1, _C89 },
839 { rts_log2, 1, "log2", 1, _C89 },
840 { rts_log10, 1, "log10", 1, _C89 },
841 { rts_pow, 1, "pow", 2, _C89 },
842 { rts_sin, 1, "sin", 1, _C89 },
843 { rts_cos, 1, "cos", 1, _C89 },
844 { rts_tan, 1, "tan", 1, _C89 },
845 { rts_asin, 1, "asin", 1, _C89 },
846 { rts_acos, 1, "acos", 1, _C89 },
847 { rts_atan, 1, "atan", 1, _C89 },
848 { rts_sinh, 1, "sinh", 1, _C89 },
849 { rts_cosh, 1, "cosh", 1, _C89 },
850 { rts_tanh, 1, "tanh", 1, _C89 },
852 { rts_fabsf, 1, "fabsf", 1, _C99 },
853 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
854 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
855 { rts_expf, 1, "expf", 1, _C99 },
856 { rts_exp2f, 1, "exp2f", 1, _C99 },
857 { rts_exp10f, 1, "exp10f", 1, _GNUC },
858 { rts_logf, 1, "logf", 1, _C99 },
859 { rts_log2f, 1, "log2f", 1, _C99 },
860 { rts_log10f, 1, "log10f", 1, _C99 },
861 { rts_powf, 1, "powf", 2, _C99 },
862 { rts_sinf, 1, "sinf", 1, _C99 },
863 { rts_cosf, 1, "cosf", 1, _C99 },
864 { rts_tanf, 1, "tanf", 1, _C99 },
865 { rts_asinf, 1, "asinf", 1, _C99 },
866 { rts_acosf, 1, "acosf", 1, _C99 },
867 { rts_atanf, 1, "atanf", 1, _C99 },
868 { rts_sinhf, 1, "sinhf", 1, _C99 },
869 { rts_coshf, 1, "coshf", 1, _C99 },
870 { rts_tanhf, 1, "tanhf", 1, _C99 },
872 { rts_fabsl, 1, "fabsl", 1, _C99 },
873 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
874 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
875 { rts_expl, 1, "expl", 1, _C99 },
876 { rts_exp2l, 1, "exp2l", 1, _C99 },
877 { rts_exp10l, 1, "exp10l", 1, _GNUC },
878 { rts_logl, 1, "logl", 1, _C99 },
879 { rts_log2l, 1, "log2l", 1, _C99 },
880 { rts_log10l, 1, "log10l", 1, _C99 },
881 { rts_powl, 1, "powl", 2, _C99 },
882 { rts_sinl, 1, "sinl", 1, _C99 },
883 { rts_cosl, 1, "cosl", 1, _C99 },
884 { rts_tanl, 1, "tanl", 1, _C99 },
885 { rts_asinl, 1, "asinl", 1, _C99 },
886 { rts_acosl, 1, "acosl", 1, _C99 },
887 { rts_atanl, 1, "atanl", 1, _C99 },
888 { rts_sinhl, 1, "sinhl", 1, _C99 },
889 { rts_coshl, 1, "coshl", 1, _C99 },
890 { rts_tanhl, 1, "tanhl", 1, _C99 },
892 { rts_strcmp, 1, "strcmp", 2, _C89 },
893 { rts_strncmp, 1, "strncmp", 3, _C89 },
894 { rts_strcpy, 1, "strcpy", 2, _C89 },
895 { rts_strlen, 1, "strlen", 1, _C89 },
896 { rts_memcpy, 1, "memcpy", 3, _C89 },
897 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
898 { rts_memmove, 1, "memmove", 3, _C89 },
899 { rts_memset, 1, "memset", 3, _C89 },
900 { rts_memcmp, 1, "memcmp", 3, _C89 },
903 static ident *rts_idents[lengthof(rts_data)];
905 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
907 void set_create_ld_ident(ident *(*func)(entity_t*))
909 create_ld_ident = func;
912 static bool declaration_is_definition(const entity_t *entity)
914 switch (entity->kind) {
915 case ENTITY_VARIABLE:
916 return entity->declaration.storage_class != STORAGE_CLASS_EXTERN;
917 case ENTITY_FUNCTION:
918 return entity->function.body != NULL;
919 case ENTITY_PARAMETER:
920 case ENTITY_COMPOUND_MEMBER:
924 case ENTITY_ENUM_VALUE:
925 case ENTITY_NAMESPACE:
927 case ENTITY_LOCAL_LABEL:
930 panic("entity is not a declaration");
934 * Handle GNU attributes for entities
936 * @param ent the entity
937 * @param decl the routine declaration
939 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
941 assert(is_declaration(entity));
942 decl_modifiers_t modifiers = entity->declaration.modifiers;
944 if (is_method_entity(irentity)) {
945 if (modifiers & DM_PURE)
946 add_entity_additional_properties(irentity, mtp_property_pure);
947 if (modifiers & DM_CONST)
948 add_entity_additional_properties(irentity, mtp_property_const);
949 if (modifiers & DM_NOINLINE)
950 add_entity_additional_properties(irentity, mtp_property_noinline);
951 if (modifiers & DM_FORCEINLINE)
952 add_entity_additional_properties(irentity, mtp_property_always_inline);
953 if (modifiers & DM_NAKED)
954 add_entity_additional_properties(irentity, mtp_property_naked);
955 if (entity->kind == ENTITY_FUNCTION && entity->function.is_inline)
956 add_entity_additional_properties(irentity,
957 mtp_property_inline_recommended);
959 if ((modifiers & DM_USED) && declaration_is_definition(entity)) {
960 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
962 if ((modifiers & DM_WEAK) && declaration_is_definition(entity)
963 && entity->declaration.storage_class != STORAGE_CLASS_EXTERN) {
964 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
968 static bool is_main(entity_t *entity)
970 static symbol_t *sym_main = NULL;
971 if (sym_main == NULL) {
972 sym_main = symbol_table_insert("main");
975 if (entity->base.symbol != sym_main)
977 /* must be in outermost scope */
978 if (entity->base.parent_scope != ¤t_translation_unit->scope)
985 * Creates an entity representing a function.
987 * @param entity the function declaration/definition
988 * @param owner_type the owner type of this function, NULL
989 * for global functions
991 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
993 assert(entity->kind == ENTITY_FUNCTION);
994 if (entity->function.irentity != NULL)
995 return entity->function.irentity;
997 switch (entity->function.btk) {
1000 case BUILTIN_LIBC_CHECK:
1006 symbol_t *symbol = entity->base.symbol;
1007 ident *id = new_id_from_str(symbol->string);
1009 /* already an entity defined? */
1010 ir_entity *irentity = entitymap_get(&entitymap, symbol);
1011 bool const has_body = entity->function.body != NULL;
1012 if (irentity != NULL) {
1013 goto entity_created;
1016 ir_type *ir_type_method;
1017 if (entity->function.need_closure)
1018 ir_type_method = create_method_type(&entity->declaration.type->function, true);
1020 ir_type_method = get_ir_type(entity->declaration.type);
1022 bool nested_function = false;
1023 if (owner_type == NULL)
1024 owner_type = get_glob_type();
1026 nested_function = true;
1028 dbg_info *const dbgi = get_dbg_info(&entity->base.pos);
1029 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
1032 if (nested_function)
1033 ld_id = id_unique("inner.%u");
1035 ld_id = create_ld_ident(entity);
1036 set_entity_ld_ident(irentity, ld_id);
1038 handle_decl_modifiers(irentity, entity);
1040 if (! nested_function) {
1041 storage_class_tag_t const storage_class
1042 = (storage_class_tag_t) entity->declaration.storage_class;
1043 if (storage_class == STORAGE_CLASS_STATIC) {
1044 set_entity_visibility(irentity, ir_visibility_local);
1046 set_entity_visibility(irentity, ir_visibility_external);
1049 bool const is_inline = entity->function.is_inline;
1050 if (is_inline && has_body) {
1051 if (((c_mode & _C99) && storage_class == STORAGE_CLASS_NONE)
1052 || ((c_mode & _C99) == 0
1053 && storage_class == STORAGE_CLASS_EXTERN)) {
1054 add_entity_linkage(irentity, IR_LINKAGE_NO_CODEGEN);
1058 /* nested functions are always local */
1059 set_entity_visibility(irentity, ir_visibility_local);
1062 /* We should check for file scope here, but as long as we compile C only
1063 this is not needed. */
1064 if (!freestanding && !has_body) {
1065 /* check for a known runtime function */
1066 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1067 if (id != rts_idents[i])
1070 function_type_t *function_type
1071 = &entity->declaration.type->function;
1072 /* rts_entities code can't handle a "wrong" number of parameters */
1073 if (function_type->unspecified_parameters)
1076 /* check number of parameters */
1077 int n_params = count_parameters(function_type);
1078 if (n_params != rts_data[i].n_params)
1081 type_t *return_type = skip_typeref(function_type->return_type);
1082 int n_res = is_type_void(return_type) ? 0 : 1;
1083 if (n_res != rts_data[i].n_res)
1086 /* ignore those rts functions not necessary needed for current mode */
1087 if ((c_mode & rts_data[i].flags) == 0)
1089 assert(rts_entities[rts_data[i].id] == NULL);
1090 rts_entities[rts_data[i].id] = irentity;
1094 entitymap_insert(&entitymap, symbol, irentity);
1097 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1098 entity->function.irentity = irentity;
1104 * Creates a SymConst for a given entity.
1106 * @param dbgi debug info
1107 * @param entity the entity
1109 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1111 assert(entity != NULL);
1112 union symconst_symbol sym;
1113 sym.entity_p = entity;
1114 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1117 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1119 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1122 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1124 ir_mode *value_mode = get_irn_mode(value);
1126 if (value_mode == dest_mode)
1129 return new_d_Conv(dbgi, value, dest_mode);
1132 static ir_node *conv_to_storage_type(dbg_info *const dbgi, ir_node *const val, type_t *const type)
1134 ir_mode *const mode = get_ir_mode_storage(type);
1135 return create_conv(dbgi, val, mode);
1139 * Creates a SymConst node representing a string constant.
1141 * @param src_pos the source position of the string constant
1142 * @param id_prefix a prefix for the name of the generated string constant
1143 * @param value the value of the string constant
1145 static ir_node *string_to_firm(position_t const *const src_pos, char const *const id_prefix, string_t const *const value)
1147 size_t const slen = get_string_len(value) + 1;
1148 ir_initializer_t *const initializer = create_initializer_compound(slen);
1149 ir_type * elem_type;
1150 switch (value->encoding) {
1151 case STRING_ENCODING_CHAR:
1152 case STRING_ENCODING_UTF8: {
1153 elem_type = ir_type_char;
1155 ir_mode *const mode = get_type_mode(elem_type);
1156 char const *p = value->begin;
1157 for (size_t i = 0; i < slen; ++i) {
1158 ir_tarval *tv = new_tarval_from_long(*p++, mode);
1159 ir_initializer_t *val = create_initializer_tarval(tv);
1160 set_initializer_compound_value(initializer, i, val);
1167 case STRING_ENCODING_CHAR16: type = type_char16_t; goto init_wide;
1168 case STRING_ENCODING_CHAR32: type = type_char32_t; goto init_wide;
1169 case STRING_ENCODING_WIDE: type = type_wchar_t; goto init_wide;
1171 elem_type = get_ir_type(type);
1173 ir_mode *const mode = get_type_mode(elem_type);
1174 char const *p = value->begin;
1175 for (size_t i = 0; i < slen; ++i) {
1176 assert(p <= value->begin + value->size);
1177 utf32 v = read_utf8_char(&p);
1178 ir_tarval *tv = new_tarval_from_long(v, mode);
1179 ir_initializer_t *val = create_initializer_tarval(tv);
1180 set_initializer_compound_value(initializer, i, val);
1185 panic("invalid string encoding");
1188 ir_type *const type = new_type_array(1, elem_type);
1189 set_array_bounds_int(type, 0, 0, slen);
1190 set_type_size_bytes( type, slen * get_type_size_bytes(elem_type));
1191 set_type_state( type, layout_fixed);
1193 ir_type *const global_type = get_glob_type();
1194 ident *const id = id_unique(id_prefix);
1195 dbg_info *const dbgi = get_dbg_info(src_pos);
1196 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1197 set_entity_ld_ident( entity, id);
1198 set_entity_visibility( entity, ir_visibility_private);
1199 add_entity_linkage( entity, IR_LINKAGE_CONSTANT);
1200 set_entity_initializer(entity, initializer);
1202 return create_symconst(dbgi, entity);
1205 static bool try_create_integer(literal_expression_t *literal, type_t *type)
1207 assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX);
1208 atomic_type_kind_t akind = type->atomic.akind;
1210 ir_mode *const mode = atomic_modes[akind];
1211 char const *const str = literal->value.begin;
1212 ir_tarval *const tv = new_tarval_from_str(str, literal->suffix - str, mode);
1213 if (tv == tarval_bad)
1216 literal->base.type = type;
1217 literal->target_value = tv;
1221 void determine_literal_type(literal_expression_t *const literal)
1223 assert(literal->base.kind == EXPR_LITERAL_INTEGER);
1225 /* -1: signed only, 0: any, 1: unsigned only */
1227 !is_type_signed(literal->base.type) ? 1 :
1228 literal->value.begin[0] == '0' ? 0 :
1229 -1; /* Decimal literals only try signed types. */
1231 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1232 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1234 if (try_create_integer(literal, literal->base.type))
1237 /* now try if the constant is small enough for some types */
1238 if (sign >= 0 && try_create_integer(literal, type_unsigned_int))
1240 if (sign <= 0 && try_create_integer(literal, type_long))
1242 if (sign >= 0 && try_create_integer(literal, type_unsigned_long))
1244 /* last try? then we should not report tarval_bad */
1246 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1247 if (sign <= 0 && try_create_integer(literal, type_long_long))
1252 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1253 bool res = try_create_integer(literal, type_unsigned_long_long);
1255 panic("internal error when parsing number literal");
1258 tarval_set_integer_overflow_mode(old_mode);
1262 * Creates a Const node representing a constant.
1264 static ir_node *literal_to_firm_(const literal_expression_t *literal,
1267 const char *string = literal->value.begin;
1268 size_t size = literal->value.size;
1271 switch (literal->base.kind) {
1272 case EXPR_LITERAL_INTEGER:
1273 assert(literal->target_value != NULL);
1274 tv = literal->target_value;
1277 case EXPR_LITERAL_FLOATINGPOINT:
1278 tv = new_tarval_from_str(string, size, mode);
1281 case EXPR_LITERAL_BOOLEAN:
1282 if (string[0] == 't') {
1283 tv = get_mode_one(mode);
1285 assert(string[0] == 'f');
1286 case EXPR_LITERAL_MS_NOOP:
1287 tv = get_mode_null(mode);
1292 panic("invalid literal kind");
1295 dbg_info *const dbgi = get_dbg_info(&literal->base.pos);
1296 return new_d_Const(dbgi, tv);
1299 static ir_node *literal_to_firm(const literal_expression_t *literal)
1301 type_t *type = skip_typeref(literal->base.type);
1302 ir_mode *mode_storage = get_ir_mode_storage(type);
1303 return literal_to_firm_(literal, mode_storage);
1307 * Creates a Const node representing a character constant.
1309 static ir_node *char_literal_to_firm(string_literal_expression_t const *literal)
1311 type_t *type = skip_typeref(literal->base.type);
1312 ir_mode *mode = get_ir_mode_storage(type);
1313 const char *string = literal->value.begin;
1314 size_t size = literal->value.size;
1317 switch (literal->value.encoding) {
1318 case STRING_ENCODING_WIDE: {
1319 utf32 v = read_utf8_char(&string);
1321 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1323 tv = new_tarval_from_str(buf, len, mode);
1327 case STRING_ENCODING_CHAR: {
1330 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1331 if (size == 1 && char_is_signed) {
1332 v = (signed char)string[0];
1335 for (size_t i = 0; i < size; ++i) {
1336 v = (v << 8) | ((unsigned char)string[i]);
1340 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1342 tv = new_tarval_from_str(buf, len, mode);
1347 panic("invalid literal kind");
1350 dbg_info *const dbgi = get_dbg_info(&literal->base.pos);
1351 return new_d_Const(dbgi, tv);
1355 * Allocate an area of size bytes aligned at alignment
1358 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1360 static unsigned area_cnt = 0;
1363 ir_type *tp = new_type_array(1, ir_type_char);
1364 set_array_bounds_int(tp, 0, 0, size);
1365 set_type_alignment_bytes(tp, alignment);
1367 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1368 ident *name = new_id_from_str(buf);
1369 ir_entity *area = new_entity(frame_type, name, tp);
1371 /* mark this entity as compiler generated */
1372 set_entity_compiler_generated(area, 1);
1377 * Return a node representing a trampoline region
1378 * for a given function entity.
1380 * @param dbgi debug info
1381 * @param entity the function entity
1383 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1385 ir_entity *region = NULL;
1388 if (current_trampolines != NULL) {
1389 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1390 if (current_trampolines[i].function == entity) {
1391 region = current_trampolines[i].region;
1396 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1398 ir_graph *irg = current_ir_graph;
1399 if (region == NULL) {
1400 /* create a new region */
1401 ir_type *frame_tp = get_irg_frame_type(irg);
1402 trampoline_region reg;
1403 reg.function = entity;
1405 reg.region = alloc_trampoline(frame_tp,
1406 be_params->trampoline_size,
1407 be_params->trampoline_align);
1408 ARR_APP1(trampoline_region, current_trampolines, reg);
1409 region = reg.region;
1411 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1416 * Creates a trampoline for a function represented by an entity.
1418 * @param dbgi debug info
1419 * @param mode the (reference) mode for the function address
1420 * @param entity the function entity
1422 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1425 assert(entity != NULL);
1427 in[0] = get_trampoline_region(dbgi, entity);
1428 in[1] = create_symconst(dbgi, entity);
1429 in[2] = get_irg_frame(current_ir_graph);
1431 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1432 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1433 return new_Proj(irn, mode, pn_Builtin_max+1);
1437 * Dereference an address.
1439 * @param dbgi debug info
1440 * @param type the type of the dereferenced result (the points_to type)
1441 * @param addr the address to dereference
1443 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1444 ir_node *const addr)
1446 type_t *skipped = skip_typeref(type);
1447 if (is_type_incomplete(skipped))
1450 ir_type *irtype = get_ir_type(skipped);
1451 if (is_compound_type(irtype)
1452 || is_Method_type(irtype)
1453 || is_Array_type(irtype)) {
1457 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1458 ? cons_volatile : cons_none;
1459 ir_mode *const mode = get_type_mode(irtype);
1460 ir_node *const memory = get_store();
1461 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1462 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1463 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1465 set_store(load_mem);
1470 * Returns the correct base address depending on whether it is a parameter or a
1471 * normal local variable.
1473 static ir_node *get_local_frame(ir_entity *const ent)
1475 ir_graph *const irg = current_ir_graph;
1476 const ir_type *const owner = get_entity_owner(ent);
1477 if (owner == current_outer_frame) {
1478 assert(current_static_link != NULL);
1479 return current_static_link;
1481 return get_irg_frame(irg);
1486 * Keep the current block and memory.
1487 * This is necessary for all loops, because they could become infinite.
1489 static void keep_loop(void)
1491 keep_alive(get_cur_block());
1492 keep_alive(get_store());
1495 static ir_node *enum_constant_to_firm(reference_expression_t const *const ref)
1497 entity_t *entity = ref->entity;
1498 if (entity->enum_value.tv == NULL) {
1499 type_t *type = skip_typeref(entity->enum_value.enum_type);
1500 assert(type->kind == TYPE_ENUM);
1501 determine_enum_values(&type->enumt);
1504 return new_Const(entity->enum_value.tv);
1507 static ir_node *reference_addr(const reference_expression_t *ref)
1509 dbg_info *dbgi = get_dbg_info(&ref->base.pos);
1510 entity_t *entity = ref->entity;
1511 assert(is_declaration(entity));
1513 if (entity->kind == ENTITY_FUNCTION
1514 && entity->function.btk != BUILTIN_NONE) {
1515 ir_entity *irentity = get_function_entity(entity, NULL);
1516 /* for gcc compatibility we have to produce (dummy) addresses for some
1517 * builtins which don't have entities */
1518 if (irentity == NULL) {
1519 position_t const *const pos = &ref->base.pos;
1520 warningf(WARN_OTHER, pos, "taking address of builtin '%N'", ref->entity);
1522 /* simply create a NULL pointer */
1523 ir_mode *const mode = get_ir_mode_storage(type_void_ptr);
1524 return new_Const(get_mode_null(mode));
1528 switch ((declaration_kind_t) entity->declaration.kind) {
1529 case DECLARATION_KIND_UNKNOWN:
1531 case DECLARATION_KIND_PARAMETER:
1532 case DECLARATION_KIND_LOCAL_VARIABLE:
1533 /* you can store to a local variable (so we don't panic but return NULL
1534 * as an indicator for no real address) */
1536 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1537 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1541 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
1542 case DECLARATION_KIND_PARAMETER_ENTITY: {
1543 ir_entity *irentity = entity->variable.v.entity;
1544 ir_node *frame = get_local_frame(irentity);
1545 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1549 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1550 return entity->variable.v.vla_base;
1552 case DECLARATION_KIND_FUNCTION: {
1553 return create_symconst(dbgi, entity->function.irentity);
1556 case DECLARATION_KIND_INNER_FUNCTION: {
1557 type_t *const type = skip_typeref(entity->declaration.type);
1558 ir_mode *const mode = get_ir_mode_storage(type);
1559 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1560 /* inner function not using the closure */
1561 return create_symconst(dbgi, entity->function.irentity);
1563 /* need trampoline here */
1564 return create_trampoline(dbgi, mode, entity->function.irentity);
1568 case DECLARATION_KIND_COMPOUND_MEMBER:
1569 panic("not implemented reference type");
1572 panic("reference to declaration with unknown type");
1575 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1577 dbg_info *const dbgi = get_dbg_info(&ref->base.pos);
1578 entity_t *const entity = ref->entity;
1579 assert(is_declaration(entity));
1581 switch ((declaration_kind_t)entity->declaration.kind) {
1582 case DECLARATION_KIND_LOCAL_VARIABLE:
1583 case DECLARATION_KIND_PARAMETER: {
1584 type_t *const type = skip_typeref(entity->declaration.type);
1585 ir_mode *const mode = get_ir_mode_storage(type);
1586 return get_value(entity->variable.v.value_number, mode);
1590 ir_node *const addr = reference_addr(ref);
1591 return deref_address(dbgi, entity->declaration.type, addr);
1597 * Transform calls to builtin functions.
1599 static ir_node *process_builtin_call(const call_expression_t *call)
1601 dbg_info *dbgi = get_dbg_info(&call->base.pos);
1603 assert(call->function->kind == EXPR_REFERENCE);
1604 reference_expression_t *builtin = &call->function->reference;
1606 type_t *expr_type = skip_typeref(builtin->base.type);
1607 assert(is_type_pointer(expr_type));
1609 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1611 switch (builtin->entity->function.btk) {
1614 case BUILTIN_ALLOCA: {
1615 expression_t *argument = call->arguments->expression;
1616 ir_node *size = expression_to_value(argument);
1618 ir_node *store = get_store();
1619 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1621 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1623 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1628 type_t *type = function_type->function.return_type;
1629 ir_mode *mode = get_ir_mode_storage(type);
1630 ir_tarval *tv = get_mode_infinite(mode);
1631 ir_node *res = new_d_Const(dbgi, tv);
1635 /* Ignore string for now... */
1636 assert(is_type_function(function_type));
1637 type_t *type = function_type->function.return_type;
1638 ir_mode *mode = get_ir_mode_storage(type);
1639 ir_tarval *tv = get_mode_NAN(mode);
1640 ir_node *res = new_d_Const(dbgi, tv);
1643 case BUILTIN_EXPECT: {
1644 expression_t *argument = call->arguments->expression;
1645 return expression_to_value(argument);
1647 case BUILTIN_VA_END:
1648 /* evaluate the argument of va_end for its side effects */
1649 expression_to_value(call->arguments->expression);
1651 case BUILTIN_OBJECT_SIZE: {
1652 /* determine value of "type" */
1653 expression_t *type_expression = call->arguments->next->expression;
1654 long type_val = fold_constant_to_int(type_expression);
1655 type_t *type = function_type->function.return_type;
1656 ir_mode *mode = get_ir_mode_storage(type);
1657 /* just produce a "I don't know" result */
1658 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1659 get_mode_minus_one(mode);
1661 return new_d_Const(dbgi, result);
1663 case BUILTIN_ROTL: {
1664 ir_node *val = expression_to_value(call->arguments->expression);
1665 ir_node *shf = expression_to_value(call->arguments->next->expression);
1666 ir_mode *mode = get_irn_mode(val);
1667 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1668 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1670 case BUILTIN_ROTR: {
1671 ir_node *val = expression_to_value(call->arguments->expression);
1672 ir_node *shf = expression_to_value(call->arguments->next->expression);
1673 ir_mode *mode = get_irn_mode(val);
1674 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1675 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1676 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1677 return new_d_Rotl(dbgi, val, sub, mode);
1682 case BUILTIN_LIBC_CHECK:
1683 panic("builtin did not produce an entity");
1685 panic("invalid builtin");
1688 static ir_node *complex_to_memory(dbg_info *dbgi, type_t *type,
1689 complex_value value);
1692 * Transform a call expression.
1693 * Handles some special cases, like alloca() calls, which must be resolved
1694 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1695 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1698 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1700 dbg_info *const dbgi = get_dbg_info(&call->base.pos);
1701 assert(currently_reachable());
1703 expression_t *function = call->function;
1704 ir_node *callee = NULL;
1705 bool firm_builtin = false;
1706 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1707 if (function->kind == EXPR_REFERENCE) {
1708 const reference_expression_t *ref = &function->reference;
1709 entity_t *entity = ref->entity;
1711 if (entity->kind == ENTITY_FUNCTION) {
1712 builtin_kind_t builtin = entity->function.btk;
1713 if (builtin == BUILTIN_FIRM) {
1714 firm_builtin = true;
1715 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1716 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1717 && builtin != BUILTIN_LIBC_CHECK) {
1718 return process_builtin_call(call);
1723 callee = expression_to_value(function);
1725 type_t *type = skip_typeref(function->base.type);
1726 assert(is_type_pointer(type));
1727 pointer_type_t *pointer_type = &type->pointer;
1728 type_t *points_to = skip_typeref(pointer_type->points_to);
1729 assert(is_type_function(points_to));
1730 function_type_t *function_type = &points_to->function;
1732 int n_parameters = 0;
1733 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1734 ir_type *new_method_type = NULL;
1735 if (function_type->variadic || function_type->unspecified_parameters) {
1736 const call_argument_t *argument = call->arguments;
1737 for ( ; argument != NULL; argument = argument->next) {
1741 /* we need to construct a new method type matching the call
1743 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1744 int n_res = get_method_n_ress(ir_method_type);
1745 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1746 set_method_calling_convention(new_method_type,
1747 get_method_calling_convention(ir_method_type));
1748 set_method_additional_properties(new_method_type,
1749 get_method_additional_properties(ir_method_type));
1750 set_method_variadicity(new_method_type,
1751 get_method_variadicity(ir_method_type));
1753 for (int i = 0; i < n_res; ++i) {
1754 set_method_res_type(new_method_type, i,
1755 get_method_res_type(ir_method_type, i));
1757 argument = call->arguments;
1758 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1759 expression_t *expression = argument->expression;
1760 ir_type *irtype = get_ir_type(expression->base.type);
1761 set_method_param_type(new_method_type, i, irtype);
1763 ir_method_type = new_method_type;
1765 n_parameters = get_method_n_params(ir_method_type);
1768 ir_node *in[n_parameters];
1770 const call_argument_t *argument = call->arguments;
1771 for (int n = 0; n < n_parameters; ++n) {
1772 expression_t *expression = argument->expression;
1773 type_t *const arg_type = skip_typeref(expression->base.type);
1774 if (is_type_complex(arg_type)) {
1775 complex_value value = expression_to_complex(expression);
1776 in[n] = complex_to_memory(dbgi, arg_type, value);
1778 in[n] = conv_to_storage_type(dbgi, expression_to_value(expression), arg_type);
1781 argument = argument->next;
1785 if (function_type->modifiers & DM_CONST) {
1786 store = get_irg_no_mem(current_ir_graph);
1788 store = get_store();
1792 type_t *return_type = skip_typeref(function_type->return_type);
1793 ir_node *result = NULL;
1795 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1797 if (! (function_type->modifiers & DM_CONST)) {
1798 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1802 if (!is_type_void(return_type)) {
1803 assert(is_type_scalar(return_type));
1804 ir_mode *mode = get_ir_mode_storage(return_type);
1805 result = new_Proj(node, mode, pn_Builtin_max+1);
1808 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1809 if (! (function_type->modifiers & DM_CONST)) {
1810 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1814 if (!is_type_void(return_type)) {
1815 ir_node *const resproj = new_Proj(node, mode_T, pn_Call_T_result);
1816 ir_mode *const mode = get_ir_mode_storage(return_type);
1817 result = new_Proj(resproj, mode, 0);
1821 if (function_type->modifiers & DM_NORETURN) {
1822 /* A dead end: Keep the Call and the Block. Also place all further
1823 * nodes into a new and unreachable block. */
1825 keep_alive(get_cur_block());
1826 ir_node *block = new_Block(0, NULL);
1827 set_cur_block(block);
1833 static ir_node *statement_to_firm(statement_t *statement);
1834 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1835 static ir_node *expression_to_addr(const expression_t *expression);
1837 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1840 value = conv_to_storage_type(dbgi, value, type);
1842 ir_node *memory = get_store();
1844 if (is_type_scalar(type) && !is_type_complex(type)) {
1845 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1846 ? cons_volatile : cons_none;
1847 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1848 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1849 set_store(store_mem);
1851 ir_type *irtype = get_ir_type(type);
1852 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1853 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1854 set_store(copyb_mem);
1858 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1860 ir_tarval *all_one = get_mode_all_one(mode);
1861 int mode_size = get_mode_size_bits(mode);
1862 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1864 assert(offset >= 0);
1866 assert(offset + size <= mode_size);
1867 if (size == mode_size) {
1871 long shiftr = get_mode_size_bits(mode) - size;
1872 long shiftl = offset;
1873 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
1874 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
1875 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
1876 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
1881 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
1882 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
1885 ir_type *entity_type = get_entity_type(entity);
1886 ir_type *base_type = get_primitive_base_type(entity_type);
1887 ir_mode *mode = get_type_mode(base_type);
1888 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1890 value = create_conv(dbgi, value, mode);
1892 /* kill upper bits of value and shift to right position */
1893 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
1894 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
1895 unsigned base_bits = get_mode_size_bits(mode);
1896 unsigned shiftwidth = base_bits - bitsize;
1898 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
1899 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
1901 unsigned shrwidth = base_bits - bitsize - bitoffset;
1902 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
1903 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
1905 /* load current value */
1906 ir_node *mem = get_store();
1907 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
1908 set_volatile ? cons_volatile : cons_none);
1909 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1910 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1911 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
1912 ir_tarval *inv_mask = tarval_not(shift_mask);
1913 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
1914 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
1916 /* construct new value and store */
1917 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
1918 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
1919 set_volatile ? cons_volatile : cons_none);
1920 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1921 set_store(store_mem);
1927 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
1928 if (mode_is_signed(mode)) {
1929 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
1931 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
1936 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
1939 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
1940 entity_t *entity = expression->compound_entry;
1941 type_t *base_type = entity->declaration.type;
1942 ir_mode *mode = get_ir_mode_storage(base_type);
1943 ir_node *mem = get_store();
1944 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
1945 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1946 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1947 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1949 ir_mode *amode = mode;
1950 /* optimisation, since shifting in modes < machine_size is usually
1952 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
1955 unsigned amode_size = get_mode_size_bits(amode);
1956 load_res = create_conv(dbgi, load_res, amode);
1958 set_store(load_mem);
1960 /* kill upper bits */
1961 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
1962 unsigned bitoffset = entity->compound_member.bit_offset;
1963 unsigned bitsize = entity->compound_member.bit_size;
1964 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
1965 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
1966 ir_node *countl = new_d_Const(dbgi, tvl);
1967 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
1969 unsigned shift_bitsr = bitoffset + shift_bitsl;
1970 assert(shift_bitsr <= amode_size);
1971 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
1972 ir_node *countr = new_d_Const(dbgi, tvr);
1974 if (mode_is_signed(mode)) {
1975 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
1977 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
1980 return conv_to_storage_type(dbgi, shiftr, expression->base.type);
1983 /* make sure the selected compound type is constructed */
1984 static void construct_select_compound(const select_expression_t *expression)
1986 type_t *type = skip_typeref(expression->compound->base.type);
1987 if (is_type_pointer(type)) {
1988 type = type->pointer.points_to;
1990 (void) get_ir_type(type);
1993 static ir_node *set_value_for_expression_addr(const expression_t *expression,
1994 ir_node *value, ir_node *addr)
1996 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
1997 type_t *type = skip_typeref(expression->base.type);
1998 value = conv_to_storage_type(dbgi, value, type);
2000 if (expression->kind == EXPR_REFERENCE) {
2001 const reference_expression_t *ref = &expression->reference;
2003 entity_t *entity = ref->entity;
2004 assert(is_declaration(entity));
2005 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2006 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2007 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2008 set_value(entity->variable.v.value_number, value);
2014 addr = expression_to_addr(expression);
2015 assert(addr != NULL);
2017 if (expression->kind == EXPR_SELECT) {
2018 const select_expression_t *select = &expression->select;
2020 construct_select_compound(select);
2022 entity_t *entity = select->compound_entry;
2023 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2024 if (entity->compound_member.bitfield) {
2025 ir_entity *irentity = entity->compound_member.entity;
2027 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2028 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2029 set_volatile, true);
2034 assign_value(dbgi, addr, type, value);
2038 static ir_node *get_value_from_lvalue(const expression_t *expression,
2041 if (expression->kind == EXPR_REFERENCE) {
2042 const reference_expression_t *ref = &expression->reference;
2044 entity_t *entity = ref->entity;
2045 assert(entity->kind == ENTITY_VARIABLE
2046 || entity->kind == ENTITY_PARAMETER);
2047 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2049 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
2050 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2051 value_number = entity->variable.v.value_number;
2052 assert(addr == NULL);
2053 type_t *type = skip_typeref(expression->base.type);
2054 ir_mode *mode = get_ir_mode_storage(type);
2055 return get_value(value_number, mode);
2059 assert(addr != NULL);
2060 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2063 if (expression->kind == EXPR_SELECT &&
2064 expression->select.compound_entry->compound_member.bitfield) {
2065 construct_select_compound(&expression->select);
2066 value = bitfield_extract_to_firm(&expression->select, addr);
2068 value = deref_address(dbgi, expression->base.type, addr);
2074 static ir_node *incdec_to_firm(unary_expression_t const *const expr, bool const inc, bool const pre)
2076 type_t *const type = skip_typeref(expr->base.type);
2077 ir_mode *const mode = get_ir_mode_arithmetic(type);
2080 if (is_type_pointer(type)) {
2081 offset = get_type_size_node(type->pointer.points_to);
2083 assert(is_type_arithmetic(type));
2084 offset = new_Const(get_mode_one(mode));
2087 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2088 expression_t const *const value_expr = expr->value;
2089 ir_node *const addr = expression_to_addr(value_expr);
2090 ir_node *const value = get_value_from_lvalue(value_expr, addr);
2091 ir_node *const value_arith = create_conv(dbgi, value, mode);
2092 ir_node *const new_value = inc
2093 ? new_d_Add(dbgi, value_arith, offset, mode)
2094 : new_d_Sub(dbgi, value_arith, offset, mode);
2096 ir_node *const store_value = set_value_for_expression_addr(value_expr, new_value, addr);
2097 return pre ? store_value : value;
2100 static bool is_local_variable(expression_t *expression)
2102 if (expression->kind != EXPR_REFERENCE)
2104 reference_expression_t *ref_expr = &expression->reference;
2105 entity_t *entity = ref_expr->entity;
2106 if (entity->kind != ENTITY_VARIABLE)
2108 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2109 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2112 static ir_relation get_relation(const expression_kind_t kind)
2115 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2116 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2117 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2118 case EXPR_BINARY_ISLESS:
2119 case EXPR_BINARY_LESS: return ir_relation_less;
2120 case EXPR_BINARY_ISLESSEQUAL:
2121 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2122 case EXPR_BINARY_ISGREATER:
2123 case EXPR_BINARY_GREATER: return ir_relation_greater;
2124 case EXPR_BINARY_ISGREATEREQUAL:
2125 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2126 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2131 panic("trying to get ir_relation from non-comparison binexpr type");
2135 * Handle the assume optimizer hint: check if a Confirm
2136 * node can be created.
2138 * @param dbi debug info
2139 * @param expr the IL assume expression
2141 * we support here only some simple cases:
2146 static ir_node *handle_assume_compare(dbg_info *dbi,
2147 const binary_expression_t *expression)
2149 expression_t *op1 = expression->left;
2150 expression_t *op2 = expression->right;
2151 entity_t *var2, *var = NULL;
2152 ir_node *res = NULL;
2153 ir_relation relation = get_relation(expression->base.kind);
2155 if (is_local_variable(op1) && is_local_variable(op2)) {
2156 var = op1->reference.entity;
2157 var2 = op2->reference.entity;
2159 type_t *const type = skip_typeref(var->declaration.type);
2160 ir_mode *const mode = get_ir_mode_storage(type);
2162 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2163 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2165 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2166 set_value(var2->variable.v.value_number, res);
2168 res = new_d_Confirm(dbi, irn1, irn2, relation);
2169 set_value(var->variable.v.value_number, res);
2174 expression_t *con = NULL;
2175 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2176 var = op1->reference.entity;
2178 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2179 relation = get_inversed_relation(relation);
2180 var = op2->reference.entity;
2185 type_t *const type = skip_typeref(var->declaration.type);
2186 ir_mode *const mode = get_ir_mode_storage(type);
2188 res = get_value(var->variable.v.value_number, mode);
2189 res = new_d_Confirm(dbi, res, expression_to_value(con), relation);
2190 set_value(var->variable.v.value_number, res);
2196 * Handle the assume optimizer hint.
2198 * @param dbi debug info
2199 * @param expr the IL assume expression
2201 static ir_node *handle_assume(expression_t const *const expr)
2203 switch (expr->kind) {
2204 case EXPR_BINARY_EQUAL:
2205 case EXPR_BINARY_NOTEQUAL:
2206 case EXPR_BINARY_LESS:
2207 case EXPR_BINARY_LESSEQUAL:
2208 case EXPR_BINARY_GREATER:
2209 case EXPR_BINARY_GREATEREQUAL: {
2210 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2211 return handle_assume_compare(dbgi, &expr->binary);
2219 static ir_node *create_cast(unary_expression_t const *const expr)
2221 type_t *const type = skip_typeref(expr->base.type);
2222 if (is_type_void(type))
2225 ir_node *value = expression_to_value(expr->value);
2226 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2227 type_t *const from_type = skip_typeref(expr->value->base.type);
2228 ir_mode *const mode = get_ir_mode_storage(type);
2229 /* check for conversion from / to __based types */
2230 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2231 const variable_t *from_var = from_type->pointer.base_variable;
2232 const variable_t *to_var = type->pointer.base_variable;
2233 if (from_var != to_var) {
2234 if (from_var != NULL) {
2235 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2236 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2237 value = new_d_Add(dbgi, value, base, mode);
2239 if (to_var != NULL) {
2240 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2241 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2242 value = new_d_Sub(dbgi, value, base, mode);
2247 return create_conv(dbgi, value, mode);
2250 static ir_node *complement_to_firm(unary_expression_t const *const expr)
2252 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2253 type_t *const type = skip_typeref(expr->base.type);
2254 ir_mode *const mode = get_ir_mode_arithmetic(type);
2255 ir_node *const value = create_conv(dbgi, expression_to_value(expr->value), mode);
2256 return new_d_Not(dbgi, value, mode);
2259 static ir_node *dereference_to_firm(unary_expression_t const *const expr)
2261 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2262 ir_node *value = expression_to_value(expr->value);
2263 type_t *const value_type = skip_typeref(expr->value->base.type);
2264 assert(is_type_pointer(value_type));
2266 /* check for __based */
2267 variable_t const *const base_var = value_type->pointer.base_variable;
2269 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2270 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2271 value = new_d_Add(dbgi, value, base, get_ir_mode_storage(value_type));
2273 type_t *const points_to = value_type->pointer.points_to;
2274 return deref_address(dbgi, points_to, value);
2277 static ir_node *negate_to_firm(unary_expression_t const *const expr)
2279 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2280 type_t *const type = skip_typeref(expr->base.type);
2281 ir_mode *const mode = get_ir_mode_arithmetic(type);
2282 ir_node *const value = create_conv(dbgi, expression_to_value(expr->value), mode);
2283 return new_d_Minus(dbgi, value, mode);
2286 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2287 ir_node *value, type_t *type)
2289 ir_mode *const mode = get_ir_mode_storage(type_ptrdiff_t);
2290 assert(is_type_pointer(type));
2291 pointer_type_t *const pointer_type = &type->pointer;
2292 type_t *const points_to = skip_typeref(pointer_type->points_to);
2293 ir_node * elem_size = get_type_size_node(points_to);
2294 elem_size = create_conv(dbgi, elem_size, mode);
2295 value = create_conv(dbgi, value, mode);
2296 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2300 static ir_node *create_div(dbg_info *dbgi, ir_node *left, ir_node *right,
2303 ir_node *pin = new_Pin(new_NoMem());
2304 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2305 op_pin_state_floats);
2306 return new_d_Proj(dbgi, op, mode, pn_Div_res);
2309 static ir_node *create_op(binary_expression_t const *const expr, ir_node *left, ir_node *right)
2312 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2313 type_t *const type_left = skip_typeref(expr->left->base.type);
2314 type_t *const type_right = skip_typeref(expr->right->base.type);
2315 expression_kind_t const kind = expr->base.kind;
2317 case EXPR_BINARY_SHIFTLEFT:
2318 case EXPR_BINARY_SHIFTRIGHT:
2319 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2320 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2321 mode = get_ir_mode_arithmetic(expr->base.type);
2322 left = create_conv(dbgi, left, mode);
2323 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2326 case EXPR_BINARY_SUB:
2327 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2328 const pointer_type_t *const ptr_type = &type_left->pointer;
2330 mode = get_ir_mode_storage(expr->base.type);
2331 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2332 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2333 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2334 ir_node *const no_mem = new_NoMem();
2335 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2336 mode, op_pin_state_floats);
2337 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2340 case EXPR_BINARY_SUB_ASSIGN:
2341 if (is_type_pointer(type_left)) {
2342 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2343 mode = get_ir_mode_storage(type_left);
2348 case EXPR_BINARY_ADD:
2349 case EXPR_BINARY_ADD_ASSIGN:
2350 if (is_type_pointer(type_left)) {
2351 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2352 mode = get_ir_mode_storage(type_left);
2354 } else if (is_type_pointer(type_right)) {
2355 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2356 mode = get_ir_mode_storage(type_right);
2363 mode = get_ir_mode_arithmetic(type_right);
2364 left = create_conv(dbgi, left, mode);
2365 right = create_conv(dbgi, right, mode);
2370 case EXPR_BINARY_ADD_ASSIGN:
2371 case EXPR_BINARY_ADD:
2372 return new_d_Add(dbgi, left, right, mode);
2373 case EXPR_BINARY_SUB_ASSIGN:
2374 case EXPR_BINARY_SUB:
2375 return new_d_Sub(dbgi, left, right, mode);
2376 case EXPR_BINARY_MUL_ASSIGN:
2377 case EXPR_BINARY_MUL:
2378 return new_d_Mul(dbgi, left, right, mode);
2379 case EXPR_BINARY_DIV:
2380 case EXPR_BINARY_DIV_ASSIGN:
2381 return create_div(dbgi, left, right, mode);
2382 case EXPR_BINARY_BITWISE_AND:
2383 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2384 return new_d_And(dbgi, left, right, mode);
2385 case EXPR_BINARY_BITWISE_OR:
2386 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2387 return new_d_Or(dbgi, left, right, mode);
2388 case EXPR_BINARY_BITWISE_XOR:
2389 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2390 return new_d_Eor(dbgi, left, right, mode);
2391 case EXPR_BINARY_SHIFTLEFT:
2392 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2393 return new_d_Shl(dbgi, left, right, mode);
2394 case EXPR_BINARY_SHIFTRIGHT:
2395 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2396 if (mode_is_signed(mode)) {
2397 return new_d_Shrs(dbgi, left, right, mode);
2399 return new_d_Shr(dbgi, left, right, mode);
2401 case EXPR_BINARY_MOD:
2402 case EXPR_BINARY_MOD_ASSIGN: {
2403 ir_node *pin = new_Pin(new_NoMem());
2404 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2405 op_pin_state_floats);
2406 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2410 panic("unexpected expression kind");
2414 static ir_node *binop_to_firm(binary_expression_t const *const expr)
2416 ir_node *const left = expression_to_value(expr->left);
2417 ir_node *const right = expression_to_value(expr->right);
2418 return create_op(expr, left, right);
2422 * Check if a given expression is a GNU __builtin_expect() call.
2424 static bool is_builtin_expect(const expression_t *expression)
2426 if (expression->kind != EXPR_CALL)
2429 expression_t *function = expression->call.function;
2430 if (function->kind != EXPR_REFERENCE)
2432 reference_expression_t *ref = &function->reference;
2433 if (ref->entity->kind != ENTITY_FUNCTION ||
2434 ref->entity->function.btk != BUILTIN_EXPECT)
2440 static void compare_to_control_flow(expression_t const *const expr, ir_node *const left, ir_node *const right, ir_relation const relation, jump_target *const true_target, jump_target *const false_target)
2442 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2443 ir_node *const cmp = new_d_Cmp(dbgi, left, right, relation);
2444 if (is_Const(cmp)) {
2445 if (tarval_is_null(get_Const_tarval(cmp))) {
2446 jump_to_target(false_target);
2448 jump_to_target(true_target);
2451 ir_node *const cond = new_d_Cond(dbgi, cmp);
2452 ir_node *const true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
2453 ir_node *const false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
2455 /* set branch prediction info based on __builtin_expect */
2456 if (is_builtin_expect(expr) && is_Cond(cond)) {
2457 call_argument_t *const argument = expr->call.arguments->next;
2458 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
2459 bool const cnst = fold_constant_to_bool(argument->expression);
2460 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
2461 set_Cond_jmp_pred(cond, pred);
2465 add_pred_to_jump_target(true_target, true_proj);
2466 add_pred_to_jump_target(false_target, false_proj);
2468 set_unreachable_now();
2471 static ir_node *control_flow_to_1_0(expression_t const *const expr, jump_target *const true_target, jump_target *const false_target)
2473 ir_node *val = NULL;
2474 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2475 ir_mode *const mode = get_ir_mode_storage(expr->base.type);
2476 jump_target exit_target;
2477 init_jump_target(&exit_target, NULL);
2479 if (enter_jump_target(true_target)) {
2480 jump_to_target(&exit_target);
2481 val = new_d_Const(dbgi, get_mode_one(mode));
2484 if (enter_jump_target(false_target)) {
2485 jump_to_target(&exit_target);
2486 ir_node *const zero = new_d_Const(dbgi, get_mode_null(mode));
2488 ir_node *const in[] = { val, zero };
2489 val = new_rd_Phi(dbgi, exit_target.block, lengthof(in), in, mode);
2495 if (!enter_jump_target(&exit_target)) {
2496 set_cur_block(new_Block(0, NULL));
2497 val = new_d_Bad(dbgi, mode);
2502 static ir_node *binop_assign_to_firm(binary_expression_t const *const expr)
2504 ir_node *const right = expression_to_value(expr->right);
2505 expression_t const *const left_expr = expr->left;
2506 ir_node *const addr = expression_to_addr(left_expr);
2507 ir_node *const left = get_value_from_lvalue(left_expr, addr);
2508 ir_node *result = create_op(expr, left, right);
2510 type_t *const type = skip_typeref(expr->base.type);
2511 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2512 jump_target true_target;
2513 jump_target false_target;
2514 init_jump_target(&true_target, NULL);
2515 init_jump_target(&false_target, NULL);
2516 ir_mode *const mode = get_irn_mode(result);
2517 ir_node *const zero = new_Const(get_mode_null(mode));
2518 compare_to_control_flow((expression_t const*)expr, result, zero, ir_relation_unordered_less_greater, &true_target, &false_target);
2519 result = control_flow_to_1_0((expression_t const*)expr, &true_target, &false_target);
2522 return set_value_for_expression_addr(left_expr, result, addr);
2525 static ir_node *assign_expression_to_firm(binary_expression_t const *const expr)
2527 ir_node *const addr = expression_to_addr(expr->left);
2528 ir_node *const right = expression_to_value(expr->right);
2529 return set_value_for_expression_addr(expr->left, right, addr);
2532 /** evaluate an expression and discard the result, but still produce the
2534 static void evaluate_expression_discard_result(const expression_t *expression)
2536 type_t *type = skip_typeref(expression->base.type);
2537 if (is_type_complex(type)) {
2538 expression_to_complex(expression);
2540 expression_to_value(expression);
2544 static ir_node *comma_expression_to_firm(binary_expression_t const *const expr)
2546 evaluate_expression_discard_result(expr->left);
2547 return expression_to_value(expr->right);
2550 static ir_node *array_access_addr(const array_access_expression_t *expression)
2552 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2553 ir_node *base_addr = expression_to_value(expression->array_ref);
2554 ir_node *offset = expression_to_value(expression->index);
2555 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2556 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2557 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2562 static ir_node *array_access_to_firm(
2563 const array_access_expression_t *expression)
2565 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2566 ir_node *addr = array_access_addr(expression);
2567 type_t *type = revert_automatic_type_conversion(
2568 (const expression_t*) expression);
2569 type = skip_typeref(type);
2571 return deref_address(dbgi, type, addr);
2574 static long get_offsetof_offset(const offsetof_expression_t *expression)
2576 type_t *orig_type = expression->type;
2579 designator_t *designator = expression->designator;
2580 for ( ; designator != NULL; designator = designator->next) {
2581 type_t *type = skip_typeref(orig_type);
2582 /* be sure the type is constructed */
2583 (void) get_ir_type(type);
2585 if (designator->symbol != NULL) {
2586 assert(is_type_compound(type));
2587 symbol_t *symbol = designator->symbol;
2589 compound_t *compound = type->compound.compound;
2590 entity_t *iter = compound->members.entities;
2591 for (; iter->base.symbol != symbol; iter = iter->base.next) {}
2593 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2594 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2595 offset += get_entity_offset(iter->compound_member.entity);
2597 orig_type = iter->declaration.type;
2599 expression_t *array_index = designator->array_index;
2600 assert(designator->array_index != NULL);
2601 assert(is_type_array(type));
2603 long index = fold_constant_to_int(array_index);
2604 ir_type *arr_type = get_ir_type(type);
2605 ir_type *elem_type = get_array_element_type(arr_type);
2606 long elem_size = get_type_size_bytes(elem_type);
2608 offset += index * elem_size;
2610 orig_type = type->array.element_type;
2617 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2619 ir_mode *mode = get_ir_mode_storage(expression->base.type);
2620 long offset = get_offsetof_offset(expression);
2621 ir_tarval *tv = new_tarval_from_long(offset, mode);
2622 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2624 return new_d_Const(dbgi, tv);
2627 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2628 ir_entity *entity, type_t *type);
2629 static ir_initializer_t *create_ir_initializer(
2630 const initializer_t *initializer, type_t *type);
2632 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2633 initializer_t *initializer,
2636 /* create the ir_initializer */
2637 PUSH_IRG(get_const_code_irg());
2638 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2641 ident *const id = id_unique("initializer.%u");
2642 ir_type *const irtype = get_ir_type(type);
2643 ir_type *const global_type = get_glob_type();
2644 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2645 set_entity_ld_ident(entity, id);
2646 set_entity_visibility(entity, ir_visibility_private);
2647 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2648 set_entity_initializer(entity, irinitializer);
2652 static ir_node *compound_literal_addr(compound_literal_expression_t const *const expression)
2654 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2655 type_t *type = expression->type;
2656 initializer_t *initializer = expression->initializer;
2658 if (expression->global_scope ||
2659 ((type->base.qualifiers & TYPE_QUALIFIER_CONST)
2660 && is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT)) {
2661 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2662 return create_symconst(dbgi, entity);
2664 /* create an entity on the stack */
2665 ident *const id = id_unique("CompLit.%u");
2666 ir_type *const irtype = get_ir_type(type);
2667 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2669 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2670 set_entity_ld_ident(entity, id);
2672 /* create initialisation code */
2673 create_local_initializer(initializer, dbgi, entity, type);
2675 /* create a sel for the compound literal address */
2676 ir_node *frame = get_irg_frame(current_ir_graph);
2677 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2682 static ir_node *compound_literal_to_firm(compound_literal_expression_t const* const expr)
2684 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
2685 type_t *const type = expr->type;
2686 ir_node *const addr = compound_literal_addr(expr);
2687 return deref_address(dbgi, type, addr);
2691 * Transform a sizeof expression into Firm code.
2693 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2695 type_t *const type = skip_typeref(expression->type);
2696 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2697 if (is_type_array(type) && type->array.is_vla
2698 && expression->tp_expression != NULL) {
2699 expression_to_value(expression->tp_expression);
2702 return get_type_size_node(type);
2705 static entity_t *get_expression_entity(const expression_t *expression)
2707 if (expression->kind != EXPR_REFERENCE)
2710 return expression->reference.entity;
2713 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2715 switch (entity->kind) {
2716 case DECLARATION_KIND_CASES:
2717 return entity->declaration.alignment;
2720 return entity->compound.alignment;
2721 case ENTITY_TYPEDEF:
2722 return entity->typedefe.alignment;
2730 * Transform an alignof expression into Firm code.
2732 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2734 unsigned alignment = 0;
2736 const expression_t *tp_expression = expression->tp_expression;
2737 if (tp_expression != NULL) {
2738 entity_t *entity = get_expression_entity(tp_expression);
2739 if (entity != NULL) {
2740 alignment = get_cparser_entity_alignment(entity);
2744 if (alignment == 0) {
2745 type_t *type = expression->type;
2746 alignment = get_type_alignment(type);
2749 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2750 ir_mode *mode = get_ir_mode_storage(expression->base.type);
2751 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2752 return new_d_Const(dbgi, tv);
2755 static void init_ir_types(void);
2757 ir_tarval *fold_constant_to_tarval(const expression_t *expression)
2759 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2761 bool constant_folding_old = constant_folding;
2762 constant_folding = true;
2763 int old_optimize = get_optimize();
2764 int old_constant_folding = get_opt_constant_folding();
2766 set_opt_constant_folding(1);
2770 PUSH_IRG(get_const_code_irg());
2771 ir_node *const cnst = expression_to_value(expression);
2774 set_optimize(old_optimize);
2775 set_opt_constant_folding(old_constant_folding);
2776 constant_folding = constant_folding_old;
2778 if (!is_Const(cnst))
2779 panic("couldn't fold constant");
2780 return get_Const_tarval(cnst);
2783 static complex_constant fold_complex_constant(const expression_t *expression)
2785 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
2787 bool constant_folding_old = constant_folding;
2788 constant_folding = true;
2789 int old_optimize = get_optimize();
2790 int old_constant_folding = get_opt_constant_folding();
2792 set_opt_constant_folding(1);
2796 PUSH_IRG(get_const_code_irg());
2797 complex_value value = expression_to_complex(expression);
2800 set_optimize(old_optimize);
2801 set_opt_constant_folding(old_constant_folding);
2803 if (!is_Const(value.real) || !is_Const(value.imag)) {
2804 panic("couldn't fold constant");
2807 constant_folding = constant_folding_old;
2809 return (complex_constant) {
2810 get_Const_tarval(value.real),
2811 get_Const_tarval(value.imag)
2815 /* this function is only used in parser.c, but it relies on libfirm functionality */
2816 bool constant_is_negative(const expression_t *expression)
2818 ir_tarval *tv = fold_constant_to_tarval(expression);
2819 return tarval_is_negative(tv);
2822 long fold_constant_to_int(const expression_t *expression)
2824 ir_tarval *tv = fold_constant_to_tarval(expression);
2825 if (!tarval_is_long(tv)) {
2826 panic("result of constant folding is not integer");
2829 return get_tarval_long(tv);
2832 bool fold_constant_to_bool(const expression_t *expression)
2834 type_t *type = skip_typeref(expression->base.type);
2835 if (is_type_complex(type)) {
2836 complex_constant tvs = fold_complex_constant(expression);
2837 return !tarval_is_null(tvs.real) || !tarval_is_null(tvs.imag);
2839 ir_tarval *tv = fold_constant_to_tarval(expression);
2840 return !tarval_is_null(tv);
2844 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
2846 jump_target true_target;
2847 jump_target false_target;
2848 init_jump_target(&true_target, NULL);
2849 init_jump_target(&false_target, NULL);
2850 ir_node *const cond_expr = expression_to_control_flow(expression->condition, &true_target, &false_target);
2852 ir_node *val = NULL;
2853 dbg_info *const dbgi = get_dbg_info(&expression->base.pos);
2854 type_t *const type = skip_typeref(expression->base.type);
2855 ir_mode *const mode = get_ir_mode_arithmetic(type);
2856 jump_target exit_target;
2857 init_jump_target(&exit_target, NULL);
2859 if (enter_jump_target(&true_target)) {
2860 if (expression->true_expression) {
2861 val = expression_to_value(expression->true_expression);
2862 } else if (cond_expr) {
2865 /* Condition ended with a short circuit (&&, ||, !) operation or a
2866 * comparison. Generate a "1" as value for the true branch. */
2867 val = new_Const(get_mode_one(mode));
2870 val = create_conv(dbgi, val, mode);
2871 jump_to_target(&exit_target);
2874 if (enter_jump_target(&false_target)) {
2875 ir_node *false_val = expression_to_value(expression->false_expression);
2877 false_val = create_conv(dbgi, false_val, mode);
2878 jump_to_target(&exit_target);
2880 ir_node *const in[] = { val, false_val };
2881 val = new_rd_Phi(dbgi, exit_target.block, lengthof(in), in, get_irn_mode(val));
2887 if (!enter_jump_target(&exit_target)) {
2888 set_cur_block(new_Block(0, NULL));
2889 if (!is_type_void(type))
2890 val = new_Bad(mode);
2896 * Returns an IR-node representing the address of a field.
2898 static ir_node *select_addr(const select_expression_t *expression)
2900 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2902 construct_select_compound(expression);
2904 ir_node *compound_addr = expression_to_value(expression->compound);
2906 entity_t *entry = expression->compound_entry;
2907 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2908 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2910 if (constant_folding) {
2911 ir_mode *mode = get_irn_mode(compound_addr);
2912 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
2913 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
2914 return new_d_Add(dbgi, compound_addr, ofs, mode);
2916 ir_entity *irentity = entry->compound_member.entity;
2917 assert(irentity != NULL);
2918 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
2922 static ir_node *select_to_firm(const select_expression_t *expression)
2924 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
2925 ir_node *addr = select_addr(expression);
2926 type_t *type = revert_automatic_type_conversion(
2927 (const expression_t*) expression);
2928 type = skip_typeref(type);
2930 entity_t *entry = expression->compound_entry;
2931 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2933 if (entry->compound_member.bitfield) {
2934 return bitfield_extract_to_firm(expression, addr);
2937 return deref_address(dbgi, type, addr);
2940 /* Values returned by __builtin_classify_type. */
2941 typedef enum gcc_type_class
2947 enumeral_type_class,
2950 reference_type_class,
2954 function_type_class,
2965 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
2967 type_t *type = expr->type_expression->base.type;
2969 /* FIXME gcc returns different values depending on whether compiling C or C++
2970 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
2973 type = skip_typeref(type);
2974 switch (type->kind) {
2976 const atomic_type_t *const atomic_type = &type->atomic;
2977 switch (atomic_type->akind) {
2978 /* gcc cannot do that */
2979 case ATOMIC_TYPE_VOID:
2980 tc = void_type_class;
2983 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
2984 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
2985 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
2986 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
2987 case ATOMIC_TYPE_SHORT:
2988 case ATOMIC_TYPE_USHORT:
2989 case ATOMIC_TYPE_INT:
2990 case ATOMIC_TYPE_UINT:
2991 case ATOMIC_TYPE_LONG:
2992 case ATOMIC_TYPE_ULONG:
2993 case ATOMIC_TYPE_LONGLONG:
2994 case ATOMIC_TYPE_ULONGLONG:
2995 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
2996 tc = integer_type_class;
2999 case ATOMIC_TYPE_FLOAT:
3000 case ATOMIC_TYPE_DOUBLE:
3001 case ATOMIC_TYPE_LONG_DOUBLE:
3002 tc = real_type_class;
3005 panic("Unexpected atomic type.");
3008 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3009 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3010 case TYPE_ARRAY: /* gcc handles this as pointer */
3011 case TYPE_FUNCTION: /* gcc handles this as pointer */
3012 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3013 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3014 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3016 /* gcc handles this as integer */
3017 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3019 /* gcc classifies the referenced type */
3020 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3022 /* typedef/typeof should be skipped already */
3028 panic("unexpected type.");
3032 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
3033 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3034 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3035 return new_d_Const(dbgi, tv);
3038 static ir_node *function_name_to_firm(
3039 const funcname_expression_t *const expr)
3041 switch (expr->kind) {
3042 case FUNCNAME_FUNCTION:
3043 case FUNCNAME_PRETTY_FUNCTION:
3044 case FUNCNAME_FUNCDNAME:
3045 if (current_function_name == NULL) {
3046 position_t const *const src_pos = &expr->base.pos;
3047 char const *const name = current_function_entity->base.symbol->string;
3048 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3049 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3051 return current_function_name;
3052 case FUNCNAME_FUNCSIG:
3053 if (current_funcsig == NULL) {
3054 position_t const *const src_pos = &expr->base.pos;
3055 ir_entity *const ent = get_irg_entity(current_ir_graph);
3056 char const *const name = get_entity_ld_name(ent);
3057 string_t const string = { name, strlen(name), STRING_ENCODING_CHAR };
3058 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3060 return current_funcsig;
3062 panic("Unsupported function name");
3065 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3067 statement_t *statement = expr->statement;
3069 assert(statement->kind == STATEMENT_COMPOUND);
3070 return compound_statement_to_firm(&statement->compound);
3073 static ir_node *va_start_expression_to_firm(
3074 const va_start_expression_t *const expr)
3076 ir_entity *param_ent = current_vararg_entity;
3077 if (param_ent == NULL) {
3078 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3079 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3080 ir_type *const param_type = get_unknown_type();
3081 param_ent = new_parameter_entity(frame_type, n, param_type);
3082 current_vararg_entity = param_ent;
3085 ir_node *const frame = get_irg_frame(current_ir_graph);
3086 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
3087 ir_node *const no_mem = new_NoMem();
3088 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3090 set_value_for_expression_addr(expr->ap, arg_sel, NULL);
3095 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3097 type_t *const type = expr->base.type;
3098 expression_t *const ap_expr = expr->ap;
3099 ir_node *const ap_addr = expression_to_addr(ap_expr);
3100 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3101 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
3102 ir_node *const res = deref_address(dbgi, type, ap);
3104 ir_node *const cnst = get_type_size_node(expr->base.type);
3105 ir_mode *const mode = get_irn_mode(cnst);
3106 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3107 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3108 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3109 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3110 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3112 set_value_for_expression_addr(ap_expr, add, ap_addr);
3118 * Generate Firm for a va_copy expression.
3120 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3122 ir_node *const src = expression_to_value(expr->src);
3123 set_value_for_expression_addr(expr->dst, src, NULL);
3127 static ir_node *dereference_addr(const unary_expression_t *const expression)
3129 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3130 return expression_to_value(expression->value);
3134 * Returns a IR-node representing an lvalue of the given expression.
3136 static ir_node *expression_to_addr(const expression_t *expression)
3138 switch (expression->kind) {
3139 case EXPR_ARRAY_ACCESS:
3140 return array_access_addr(&expression->array_access);
3141 case EXPR_COMPOUND_LITERAL:
3142 return compound_literal_addr(&expression->compound_literal);
3143 case EXPR_REFERENCE:
3144 return reference_addr(&expression->reference);
3146 return select_addr(&expression->select);
3147 case EXPR_UNARY_DEREFERENCE:
3148 return dereference_addr(&expression->unary);
3152 panic("trying to get address of non-lvalue");
3155 static ir_node *builtin_constant_to_firm(
3156 const builtin_constant_expression_t *expression)
3158 ir_mode *const mode = get_ir_mode_storage(expression->base.type);
3159 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3160 return create_Const_from_bool(mode, v);
3163 static ir_node *builtin_types_compatible_to_firm(
3164 const builtin_types_compatible_expression_t *expression)
3166 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3167 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3168 bool const value = types_compatible(left, right);
3169 ir_mode *const mode = get_ir_mode_storage(expression->base.type);
3170 return create_Const_from_bool(mode, value);
3173 static void prepare_label_target(label_t *const label)
3175 if (label->address_taken && !label->indirect_block) {
3176 ir_node *const iblock = new_immBlock();
3177 label->indirect_block = iblock;
3178 ARR_APP1(ir_node*, ijmp_blocks, iblock);
3179 jump_from_block_to_target(&label->target, iblock);
3184 * Pointer to a label. This is used for the
3185 * GNU address-of-label extension.
3187 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3189 /* Beware: Might be called from create initializer with current_ir_graph
3190 * set to const_code_irg. */
3191 PUSH_IRG(current_function);
3192 prepare_label_target(label->label);
3195 symconst_symbol value;
3196 value.entity_p = create_Block_entity(label->label->indirect_block);
3197 dbg_info *const dbgi = get_dbg_info(&label->base.pos);
3198 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3201 static ir_node *expression_to_value(expression_t const *const expr)
3204 if (!constant_folding) {
3205 assert(!expr->base.transformed);
3206 ((expression_t*)expr)->base.transformed = true;
3208 assert(!is_type_complex(skip_typeref(expr->base.type)));
3211 switch (expr->kind) {
3212 case EXPR_UNARY_CAST:
3213 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_BOOL)) {
3214 case EXPR_BINARY_EQUAL:
3215 case EXPR_BINARY_GREATER:
3216 case EXPR_BINARY_GREATEREQUAL:
3217 case EXPR_BINARY_ISGREATER:
3218 case EXPR_BINARY_ISGREATEREQUAL:
3219 case EXPR_BINARY_ISLESS:
3220 case EXPR_BINARY_ISLESSEQUAL:
3221 case EXPR_BINARY_ISLESSGREATER:
3222 case EXPR_BINARY_ISUNORDERED:
3223 case EXPR_BINARY_LESS:
3224 case EXPR_BINARY_LESSEQUAL:
3225 case EXPR_BINARY_LOGICAL_AND:
3226 case EXPR_BINARY_LOGICAL_OR:
3227 case EXPR_BINARY_NOTEQUAL:
3228 case EXPR_UNARY_NOT:;
3229 jump_target true_target;
3230 jump_target false_target;
3231 init_jump_target(&true_target, NULL);
3232 init_jump_target(&false_target, NULL);
3233 expression_to_control_flow(expr, &true_target, &false_target);
3234 return control_flow_to_1_0(expr, &true_target, &false_target);
3236 return create_cast(&expr->unary);
3239 case EXPR_BINARY_ADD:
3240 case EXPR_BINARY_BITWISE_AND:
3241 case EXPR_BINARY_BITWISE_OR:
3242 case EXPR_BINARY_BITWISE_XOR:
3243 case EXPR_BINARY_DIV:
3244 case EXPR_BINARY_MOD:
3245 case EXPR_BINARY_MUL:
3246 case EXPR_BINARY_SHIFTLEFT:
3247 case EXPR_BINARY_SHIFTRIGHT:
3248 case EXPR_BINARY_SUB:
3249 return binop_to_firm(&expr->binary);
3251 case EXPR_BINARY_ADD_ASSIGN:
3252 case EXPR_BINARY_BITWISE_AND_ASSIGN:
3253 case EXPR_BINARY_BITWISE_OR_ASSIGN:
3254 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
3255 case EXPR_BINARY_DIV_ASSIGN:
3256 case EXPR_BINARY_MOD_ASSIGN:
3257 case EXPR_BINARY_MUL_ASSIGN:
3258 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
3259 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
3260 case EXPR_BINARY_SUB_ASSIGN:
3261 return binop_assign_to_firm(&expr->binary);
3266 case EXPR_UNARY_POSTFIX_DECREMENT: inc = false; pre = false; goto incdec;
3267 case EXPR_UNARY_POSTFIX_INCREMENT: inc = true; pre = false; goto incdec;
3268 case EXPR_UNARY_PREFIX_DECREMENT: inc = false; pre = true; goto incdec;
3269 case EXPR_UNARY_PREFIX_INCREMENT: inc = true; pre = true; goto incdec;
3271 return incdec_to_firm(&expr->unary, inc, pre);
3274 case EXPR_UNARY_IMAG: {
3275 complex_value irvalue = expression_to_complex(expr->unary.value);
3276 return irvalue.imag;
3278 case EXPR_UNARY_REAL: {
3279 complex_value irvalue = expression_to_complex(expr->unary.value);
3280 return irvalue.real;
3283 case EXPR_ALIGNOF: return alignof_to_firm( &expr->typeprop);
3284 case EXPR_ARRAY_ACCESS: return array_access_to_firm( &expr->array_access);
3285 case EXPR_BINARY_ASSIGN: return assign_expression_to_firm( &expr->binary);
3286 case EXPR_BINARY_COMMA: return comma_expression_to_firm( &expr->binary);
3287 case EXPR_BUILTIN_CONSTANT_P: return builtin_constant_to_firm( &expr->builtin_constant);
3288 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return builtin_types_compatible_to_firm(&expr->builtin_types_compatible);
3289 case EXPR_CALL: return call_expression_to_firm( &expr->call);
3290 case EXPR_CLASSIFY_TYPE: return classify_type_to_firm( &expr->classify_type);
3291 case EXPR_COMPOUND_LITERAL: return compound_literal_to_firm( &expr->compound_literal);
3292 case EXPR_CONDITIONAL: return conditional_to_firm( &expr->conditional);
3293 case EXPR_ENUM_CONSTANT: return enum_constant_to_firm( &expr->reference);
3294 case EXPR_FUNCNAME: return function_name_to_firm( &expr->funcname);
3295 case EXPR_LABEL_ADDRESS: return label_address_to_firm( &expr->label_address);
3296 case EXPR_LITERAL_CASES: return literal_to_firm( &expr->literal);
3297 case EXPR_LITERAL_CHARACTER: return char_literal_to_firm( &expr->string_literal);
3298 case EXPR_OFFSETOF: return offsetof_to_firm( &expr->offsetofe);
3299 case EXPR_REFERENCE: return reference_expression_to_firm( &expr->reference);
3300 case EXPR_SELECT: return select_to_firm( &expr->select);
3301 case EXPR_SIZEOF: return sizeof_to_firm( &expr->typeprop);
3302 case EXPR_STATEMENT: return statement_expression_to_firm( &expr->statement);
3303 case EXPR_STRING_LITERAL: return string_to_firm( &expr->base.pos, "str.%u", &expr->string_literal.value);
3304 case EXPR_UNARY_ASSUME: return handle_assume( expr->unary.value);
3305 case EXPR_UNARY_COMPLEMENT: return complement_to_firm( &expr->unary);
3306 case EXPR_UNARY_DEREFERENCE: return dereference_to_firm( &expr->unary);
3307 case EXPR_UNARY_NEGATE: return negate_to_firm( &expr->unary);
3308 case EXPR_UNARY_PLUS: return expression_to_value( expr->unary.value);
3309 case EXPR_UNARY_TAKE_ADDRESS: return expression_to_addr( expr->unary.value);
3310 case EXPR_VA_ARG: return va_arg_expression_to_firm( &expr->va_arge);
3311 case EXPR_VA_COPY: return va_copy_expression_to_firm( &expr->va_copye);
3312 case EXPR_VA_START: return va_start_expression_to_firm( &expr->va_starte);
3314 case EXPR_UNARY_DELETE:
3315 case EXPR_UNARY_DELETE_ARRAY:
3316 case EXPR_UNARY_THROW:
3317 panic("expression not implemented");
3322 panic("invalid expression");
3325 static void complex_equality_evaluation(const binary_expression_t *binexpr,
3326 jump_target *const true_target, jump_target *const false_target,
3327 ir_relation relation);
3329 static complex_value create_complex_condition_evaluation(
3330 const expression_t *const expression, jump_target *const true_target,
3331 jump_target *const false_target);
3334 * create a short-circuit expression evaluation that tries to construct
3335 * efficient control flow structures for &&, || and ! expressions
3337 static ir_node *expression_to_control_flow(expression_t const *const expr, jump_target *const true_target, jump_target *const false_target)
3339 switch (expr->kind) {
3340 case EXPR_UNARY_NOT:
3341 expression_to_control_flow(expr->unary.value, false_target, true_target);
3344 case EXPR_BINARY_LOGICAL_AND: {
3345 jump_target extra_target;
3346 init_jump_target(&extra_target, NULL);
3347 expression_to_control_flow(expr->binary.left, &extra_target, false_target);
3348 if (enter_jump_target(&extra_target))
3349 expression_to_control_flow(expr->binary.right, true_target, false_target);
3353 case EXPR_BINARY_LOGICAL_OR: {
3354 jump_target extra_target;
3355 init_jump_target(&extra_target, NULL);
3356 expression_to_control_flow(expr->binary.left, true_target, &extra_target);
3357 if (enter_jump_target(&extra_target))
3358 expression_to_control_flow(expr->binary.right, true_target, false_target);
3362 case EXPR_BINARY_COMMA:
3363 evaluate_expression_discard_result(expr->binary.left);
3364 return expression_to_control_flow(expr->binary.right, true_target, false_target);
3369 ir_relation relation;
3371 case EXPR_BINARY_EQUAL:
3372 case EXPR_BINARY_GREATER:
3373 case EXPR_BINARY_GREATEREQUAL:
3374 case EXPR_BINARY_ISGREATER:
3375 case EXPR_BINARY_ISGREATEREQUAL:
3376 case EXPR_BINARY_ISLESS:
3377 case EXPR_BINARY_ISLESSEQUAL:
3378 case EXPR_BINARY_ISLESSGREATER:
3379 case EXPR_BINARY_ISUNORDERED:
3380 case EXPR_BINARY_LESS:
3381 case EXPR_BINARY_LESSEQUAL:
3382 case EXPR_BINARY_NOTEQUAL: {
3383 type_t *const type = skip_typeref(expr->binary.left->base.type);
3384 relation = get_relation(expr->kind);
3385 if (is_type_complex(type)) {
3386 complex_equality_evaluation(&expr->binary, true_target,
3387 false_target, relation);
3388 /* TODO return something sensible */
3392 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
3393 ir_mode *const mode = get_ir_mode_arithmetic(type);
3395 left = create_conv(dbgi, expression_to_value(expr->binary.left), mode);
3396 right = create_conv(dbgi, expression_to_value(expr->binary.right), mode);
3400 case EXPR_UNARY_CAST:
3401 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_BOOL)) {
3402 expression_to_control_flow(expr->unary.value, true_target, false_target);
3406 type_t *const type = skip_typeref(expr->base.type);
3407 if (is_type_complex(type)) {
3408 create_complex_condition_evaluation(expr, true_target, false_target);
3412 dbg_info *const dbgi = get_dbg_info(&expr->base.pos);
3413 ir_mode *const mode = get_ir_mode_arithmetic(type);
3414 val = create_conv(dbgi, expression_to_value(expr), mode);
3416 right = new_Const(get_mode_null(get_irn_mode(val)));
3417 relation = ir_relation_unordered_less_greater;
3419 compare_to_control_flow(expr, left, right, relation, true_target, false_target);
3425 static complex_value complex_conv(dbg_info *dbgi, complex_value value,
3428 return (complex_value) {
3429 create_conv(dbgi, value.real, mode),
3430 create_conv(dbgi, value.imag, mode)
3434 static complex_value complex_conv_to_storage(dbg_info *const dbgi,
3435 complex_value const value, type_t *const type)
3437 ir_mode *const mode = get_complex_mode_storage(type);
3438 return complex_conv(dbgi, value, mode);
3441 static void store_complex(dbg_info *dbgi, ir_node *addr, type_t *type,
3442 complex_value value)
3444 value = complex_conv_to_storage(dbgi, value, type);
3445 ir_graph *irg = current_ir_graph;
3446 ir_type *irtype = get_ir_type(type);
3447 ir_node *mem = get_store();
3448 ir_node *nomem = get_irg_no_mem(irg);
3449 ir_mode *mode = get_complex_mode_storage(type);
3450 ir_node *real = create_conv(dbgi, value.real, mode);
3451 ir_node *imag = create_conv(dbgi, value.imag, mode);
3452 ir_node *storer = new_d_Store(dbgi, mem, addr, real, cons_floats);
3453 ir_node *memr = new_Proj(storer, mode_M, pn_Store_M);
3455 ir_node *mem2 = get_store();
3456 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3457 ir_node *one = new_Const(get_mode_one(mode_uint));
3458 ir_node *in[1] = { one };
3459 ir_entity *arrent = get_array_element_entity(irtype);
3460 ir_node *addri = new_d_Sel(dbgi, nomem, addr, 1, in, arrent);
3461 ir_node *storei = new_d_Store(dbgi, mem2, addri, imag, cons_floats);
3462 ir_node *memi = new_Proj(storei, mode_M, pn_Store_M);
3466 static ir_node *complex_to_memory(dbg_info *dbgi, type_t *type,
3467 complex_value value)
3469 ir_graph *irg = current_ir_graph;
3470 ir_type *frame_type = get_irg_frame_type(irg);
3471 ident *id = id_unique("cmplex_tmp.%u");
3472 ir_type *irtype = get_ir_type(type);
3473 ir_entity *tmp_storage = new_entity(frame_type, id, irtype);
3474 set_entity_compiler_generated(tmp_storage, 1);
3475 ir_node *frame = get_irg_frame(irg);
3476 ir_node *nomem = get_irg_no_mem(irg);
3477 ir_node *addr = new_simpleSel(nomem, frame, tmp_storage);
3478 store_complex(dbgi, addr, type, value);
3482 static complex_value read_localvar_complex(dbg_info *dbgi, entity_t *const entity)
3484 assert(entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE
3485 || entity->declaration.kind == DECLARATION_KIND_PARAMETER);
3486 type_t *const type = skip_typeref(entity->declaration.type);
3487 ir_mode *const mode = get_complex_mode_storage(type);
3488 ir_node *const real = get_value(entity->variable.v.value_number, mode);
3489 ir_node *const imag = get_value(entity->variable.v.value_number+1, mode);
3490 ir_mode *const mode_arithmetic = get_complex_mode_arithmetic(type);
3491 return (complex_value) {
3492 create_conv(dbgi, real, mode_arithmetic),
3493 create_conv(dbgi, imag, mode_arithmetic)
3497 static complex_value complex_deref_address(dbg_info *const dbgi,
3498 type_t *type, ir_node *const addr,
3499 ir_cons_flags flags)
3501 type = skip_typeref(type);
3502 assert(is_type_complex(type));
3504 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE)
3505 flags |= cons_volatile;
3506 ir_mode *const mode = get_complex_mode_storage(type);
3507 ir_node *const memory = get_store();
3508 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
3509 ir_node *const load_mem = new_Proj(load, mode_M, pn_Load_M);
3510 ir_node *const load_res = new_Proj(load, mode, pn_Load_res);
3511 set_store(load_mem);
3513 ir_type *const irtype = get_ir_type(type);
3514 ir_mode *const mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
3515 ir_node *const in[1] = { new_Const(get_mode_one(mode_uint)) };
3516 ir_entity *const entity = get_array_element_entity(irtype);
3517 ir_node *const nomem = get_irg_no_mem(current_ir_graph);
3518 ir_node *const addr2 = new_Sel(nomem, addr, 1, in, entity);
3519 ir_node *const mem2 = get_store();
3520 ir_node *const load2 = new_d_Load(dbgi, mem2, addr2, mode, flags);
3521 ir_node *const load_mem2 = new_Proj(load2, mode_M, pn_Load_M);
3522 ir_node *const load_res2 = new_Proj(load2, mode, pn_Load_res);
3523 set_store(load_mem2);
3525 return (complex_value) { load_res, load_res2 };
3528 static complex_value complex_reference_to_firm(const reference_expression_t *ref)
3530 dbg_info *const dbgi = get_dbg_info(&ref->base.pos);
3531 entity_t *const entity = ref->entity;
3532 assert(is_declaration(entity));
3534 switch ((declaration_kind_t)entity->declaration.kind) {
3535 case DECLARATION_KIND_LOCAL_VARIABLE:
3536 case DECLARATION_KIND_PARAMETER:
3537 return read_localvar_complex(dbgi, entity);
3539 ir_node *const addr = reference_addr(ref);
3540 return complex_deref_address(dbgi, entity->declaration.type, addr, cons_none);
3545 static complex_value complex_select_to_firm(const select_expression_t *select)
3547 dbg_info *dbgi = get_dbg_info(&select->base.pos);
3548 ir_node *addr = select_addr(select);
3549 type_t *type = skip_typeref(select->base.type);
3550 assert(is_type_complex(type));
3551 return complex_deref_address(dbgi, type, addr, cons_none);
3554 static complex_value complex_array_access_to_firm(
3555 const array_access_expression_t *expression)
3557 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
3558 ir_node *addr = array_access_addr(expression);
3559 type_t *type = skip_typeref(expression->base.type);
3560 assert(is_type_complex(type));
3561 return complex_deref_address(dbgi, type, addr, cons_none);
3564 static complex_value get_complex_from_lvalue(const expression_t *expression,
3567 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
3569 if (expression->kind == EXPR_REFERENCE) {
3570 const reference_expression_t *ref = &expression->reference;
3572 entity_t *entity = ref->entity;
3573 assert(entity->kind == ENTITY_VARIABLE
3574 || entity->kind == ENTITY_PARAMETER);
3575 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
3576 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
3577 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
3578 return read_localvar_complex(dbgi, entity);
3582 assert(addr != NULL);
3583 return complex_deref_address(dbgi, expression->base.type, addr, cons_none);
3586 static complex_value complex_cast_to_firm(const unary_expression_t *expression)
3588 const expression_t *value = expression->value;
3589 dbg_info *dbgi = get_dbg_info(&expression->base.pos);
3590 type_t *from_type = skip_typeref(value->base.type);
3591 type_t *to_type = skip_typeref(expression->base.type);
3592 ir_mode *mode = get_complex_mode_storage(to_type);
3594 assert(is_type_complex(to_type));
3596 if (is_type_complex(from_type)) {
3597 complex_value cvalue = expression_to_complex(value);
3598 return complex_conv(dbgi, cvalue, mode);
3600 ir_node *value_node = expression_to_value(value);
3601 ir_node *zero = new_Const(get_mode_null(mode));
3602 ir_node *casted = create_conv(dbgi, value_node, mode);
3603 return (complex_value) { casted, zero };
3607 static complex_value complex_literal_to_firm(const literal_expression_t *literal)
3609 type_t *type = skip_typeref(literal->base.type);
3610 ir_mode *mode = get_complex_mode_storage(type);
3611 ir_node *litvalue = literal_to_firm_(literal, mode);
3612 ir_node *zero = new_Const(get_mode_null(mode));
3613 return (complex_value) { zero, litvalue };
3616 typedef complex_value (*new_complex_binop)(dbg_info *dbgi, complex_value left,
3617 complex_value right, ir_mode *mode);
3619 static complex_value new_complex_add(dbg_info *dbgi, complex_value left,
3620 complex_value right, ir_mode *mode)
3622 return (complex_value) {
3623 new_d_Add(dbgi, left.real, right.real, mode),
3624 new_d_Add(dbgi, left.imag, right.imag, mode)
3628 static complex_value new_complex_sub(dbg_info *dbgi, complex_value left,
3629 complex_value right, ir_mode *mode)
3631 return (complex_value) {
3632 new_d_Sub(dbgi, left.real, right.real, mode),
3633 new_d_Sub(dbgi, left.imag, right.imag, mode)
3637 static complex_value new_complex_mul(dbg_info *dbgi, complex_value left,
3638 complex_value right, ir_mode *mode)
3640 ir_node *const op1 = new_d_Mul(dbgi, left.real, right.real, mode);
3641 ir_node *const op2 = new_d_Mul(dbgi, left.imag, right.imag, mode);
3642 ir_node *const op3 = new_d_Mul(dbgi, left.real, right.imag, mode);
3643 ir_node *const op4 = new_d_Mul(dbgi, left.imag, right.real, mode);
3644 return (complex_value) {
3645 new_d_Sub(dbgi, op1, op2, mode),
3646 new_d_Add(dbgi, op3, op4, mode)
3650 static complex_value new_complex_div(dbg_info *dbgi, complex_value left,
3651 complex_value right, ir_mode *mode)
3653 ir_node *const op1 = new_d_Mul(dbgi, left.real, right.real, mode);
3654 ir_node *const op2 = new_d_Mul(dbgi, left.imag, right.imag, mode);
3655 ir_node *const op3 = new_d_Mul(dbgi, left.imag, right.real, mode);
3656 ir_node *const op4 = new_d_Mul(dbgi, left.real, right.imag, mode);
3657 ir_node *const op5 = new_d_Mul(dbgi, right.real, right.real, mode);
3658 ir_node *const op6 = new_d_Mul(dbgi, right.imag, right.imag, mode);
3659 ir_node *const real_dividend = new_d_Add(dbgi, op1, op2, mode);
3660 ir_node *const real_divisor = new_d_Add(dbgi, op5, op6, mode);
3661 ir_node *const imag_dividend = new_d_Sub(dbgi, op3, op4, mode);
3662 ir_node *const imag_divisor = new_d_Add(dbgi, op5, op6, mode);
3663 return (complex_value) {
3664 create_div(dbgi, real_dividend, real_divisor, mode),
3665 create_div(dbgi, imag_dividend, imag_divisor, mode)
3669 typedef complex_value (*new_complex_unop)(dbg_info *dbgi, complex_value value,
3672 static complex_value new_complex_increment(dbg_info *dbgi, complex_value value,
3675 ir_node *one = new_Const(get_mode_one(mode));
3676 return (complex_value) {
3677 new_d_Add(dbgi, value.real, one, mode),
3682 static complex_value new_complex_decrement(dbg_info *dbgi, complex_value value,
3685 ir_node *one = new_Const(get_mode_one(mode));
3686 return (complex_value) {
3687 new_d_Sub(dbgi, value.real, one, mode),
3692 static void set_complex_value_for_expression(dbg_info *dbgi,
3693 const expression_t *expression,
3694 complex_value value,
3697 type_t *type = skip_typeref(expression->base.type);
3698 assert(is_type_complex(type));
3700 ir_mode *mode = get_complex_mode_storage(type);
3701 ir_node *real = create_conv(dbgi, value.real, mode);
3702 ir_node *imag = create_conv(dbgi, value.imag, mode);
3704 if (expression->kind == EXPR_REFERENCE) {
3705 const reference_expression_t *ref = &expression->reference;
3707 entity_t *entity = ref->entity;
3708 assert(is_declaration(entity));
3709 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
3710 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE ||
3711 entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
3712 set_value(entity->variable.v.value_number, real);
3713 set_value(entity->variable.v.value_number+1, imag);
3719 addr = expression_to_addr(expression);
3720 assert(addr != NULL);
3721 store_complex(dbgi, addr, type, value);
3724 static complex_value create_complex_assign_unop(const unary_expression_t *unop,
3725 new_complex_unop constructor,
3728 dbg_info *const dbgi = get_dbg_info(&unop->base.pos);
3729 const expression_t *value_expr = unop->value;
3730 ir_node *addr = expression_to_addr(value_expr);
3731 complex_value value = get_complex_from_lvalue(value_expr, addr);
3732 type_t *type = skip_typeref(unop->base.type);
3733 ir_mode *mode = get_complex_mode_arithmetic(type);
3734 value = complex_conv(dbgi, value, mode);
3735 complex_value new_value = constructor(dbgi, value, mode);
3736 set_complex_value_for_expression(dbgi, value_expr, new_value, addr);
3737 return return_old ? value : new_value;
3740 static complex_value complex_negate_to_firm(const unary_expression_t *expr)
3742 complex_value cvalue = expression_to_complex(expr->value);
3743 dbg_info *dbgi = get_dbg_info(&expr->base.pos);
3744 ir_mode *mode = get_complex_mode_arithmetic(expr->base.type);
3745 cvalue = complex_conv(dbgi, cvalue, mode);
3746 return (complex_value) {
3747 new_d_Minus(dbgi, cvalue.real, mode),
3748 new_d_Minus(dbgi, cvalue.imag, mode)
3752 static complex_value complex_complement_to_firm(const unary_expression_t *expr)
3754 complex_value cvalue = expression_to_complex(expr->value);
3755 dbg_info *dbgi = get_dbg_info(&expr->base.pos);
3756 ir_mode *mode = get_complex_mode_arithmetic(expr->base.type);
3757 cvalue = complex_conv(dbgi, cvalue, mode);
3758 return (complex_value) {
3760 new_d_Minus(dbgi, cvalue.imag, mode)
3764 static complex_value create_complex_binop(const binary_expression_t *binexpr,
3765 new_complex_binop constructor)
3767 dbg_info *dbgi = get_dbg_info(&binexpr->base.pos);
3768 ir_mode *mode = get_complex_mode_arithmetic(binexpr->base.type);
3769 complex_value left = expression_to_complex(binexpr->left);
3770 complex_value right = expression_to_complex(binexpr->right);
3771 left = complex_conv(dbgi, left, mode);
3772 right = complex_conv(dbgi, right, mode);
3773 return constructor(dbgi, left, right, mode);
3776 static complex_value create_complex_assign_binop(const binary_expression_t *binexpr,
3777 new_complex_binop constructor)
3779 dbg_info *dbgi = get_dbg_info(&binexpr->base.pos);
3780 expression_t *lefte = binexpr->left;
3781 expression_t *righte = binexpr->right;
3782 ir_mode *mode = get_complex_mode_arithmetic(righte->base.type);
3783 ir_node *addr = expression_to_addr(lefte);
3784 complex_value left = get_complex_from_lvalue(lefte, addr);
3785 complex_value right = expression_to_complex(righte);
3786 left = complex_conv(dbgi, left, mode);
3787 right = complex_conv(dbgi, right, mode);
3788 complex_value new_value = constructor(dbgi, left, right, mode);
3789 type_t *res_type = skip_typeref(binexpr->base.type);
3790 set_complex_value_for_expression(dbgi, lefte, new_value, addr);
3791 return complex_conv_to_storage(dbgi, new_value, res_type);
3794 static complex_value complex_call_to_firm(const call_expression_t *call)
3796 ir_node *result = call_expression_to_firm(call);
3797 expression_t *function = call->function;
3798 type_t *type = skip_typeref(function->base.type);
3799 assert(is_type_pointer(type));
3800 pointer_type_t *pointer_type = &type->pointer;
3801 type_t *points_to = skip_typeref(pointer_type->points_to);
3802 assert(is_type_function(points_to));
3803 function_type_t *function_type = &points_to->function;
3804 type_t *return_type = skip_typeref(function_type->return_type);
3805 assert(is_type_complex(return_type));
3806 dbg_info *dbgi = get_dbg_info(&call->base.pos);
3807 return complex_deref_address(dbgi, return_type, result, cons_floats);
3810 static void complex_equality_evaluation(const binary_expression_t *binexpr,
3811 jump_target *const true_target, jump_target *const false_target,
3812 ir_relation relation)
3814 jump_target extra_target;
3815 init_jump_target(&extra_target, NULL);
3817 complex_value left = expression_to_complex(binexpr->left);
3818 complex_value right = expression_to_complex(binexpr->right);
3819 dbg_info *dbgi = get_dbg_info(&binexpr->base.pos);
3820 ir_mode *mode = get_complex_mode_arithmetic(binexpr->left->base.type);
3821 left = complex_conv(dbgi, left, mode);
3822 right = complex_conv(dbgi, right, mode);
3824 ir_node *cmp_real = new_d_Cmp(dbgi, left.real, right.real, relation);
3825 ir_node *cond = new_d_Cond(dbgi, cmp_real);
3826 ir_node *true_proj = new_Proj(cond, mode_X, pn_Cond_true);
3827 ir_node *false_proj = new_Proj(cond, mode_X, pn_Cond_false);
3828 add_pred_to_jump_target(&extra_target, true_proj);
3829 add_pred_to_jump_target(false_target, false_proj);
3830 if (!enter_jump_target(&extra_target))
3833 ir_node *cmp_imag = new_d_Cmp(dbgi, left.imag, right.imag, relation);
3834 ir_node *condi = new_d_Cond(dbgi, cmp_imag);
3835 ir_node *true_proj_i = new_Proj(condi, mode_X, pn_Cond_true);
3836 ir_node *false_proj_i = new_Proj(condi, mode_X, pn_Cond_false);
3837 add_pred_to_jump_target(true_target, true_proj_i);
3838 add_pred_to_jump_target(false_target, false_proj_i);
3839 set_unreachable_now();
3842 static complex_value create_complex_condition_evaluation(
3843 const expression_t *const expression, jump_target *const true_target,
3844 jump_target *const false_target)
3846 jump_target extra_target;
3847 init_jump_target(&extra_target, NULL);
3848 complex_value value = expression_to_complex(expression);
3849 dbg_info *const dbgi = get_dbg_info(&expression->base.pos);
3850 type_t *const type = expression->base.type;
3851 ir_mode *const mode = get_complex_mode_arithmetic(type);
3852 value = complex_conv(dbgi, value, mode);
3853 ir_node *const zero = new_Const(get_mode_null(mode));
3854 ir_node *const cmp_real =
3855 new_d_Cmp(dbgi, value.real, zero, ir_relation_unordered_less_greater);
3856 ir_node *const cond_real = new_d_Cond(dbgi, cmp_real);
3857 ir_node *const true_real = new_Proj(cond_real, mode_X, pn_Cond_true);
3858 ir_node *const false_real = new_Proj(cond_real, mode_X, pn_Cond_false);
3859 add_pred_to_jump_target(true_target, true_real);
3860 add_pred_to_jump_target(&extra_target, false_real);
3861 if (!enter_jump_target(&extra_target))
3864 ir_node *const cmp_imag =
3865 new_d_Cmp(dbgi, value.imag, zero, ir_relation_unordered_less_greater);
3866 ir_node *const cond_imag = new_d_Cond(dbgi, cmp_imag);
3867 ir_node *const true_imag = new_Proj(cond_imag, mode_X, pn_Cond_true);
3868 ir_node *const false_imag = new_Proj(cond_imag, mode_X, pn_Cond_false);
3869 add_pred_to_jump_target(true_target, true_imag);
3870 add_pred_to_jump_target(false_target, false_imag);
3871 set_unreachable_now();
3876 static complex_value complex_conditional_to_firm(
3877 const conditional_expression_t *const expression)
3879 /* first try to fold a constant condition */
3880 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3881 bool val = fold_constant_to_bool(expression->condition);
3883 expression_t *true_expression = expression->true_expression;
3884 if (true_expression == NULL) {
3885 /* we will evaluate true_expression a second time here, but in
3886 * this case it is harmless since constant expression have no
3888 true_expression = expression->condition;
3890 return expression_to_complex(true_expression);
3892 return expression_to_complex(expression->false_expression);
3896 jump_target true_target;
3897 jump_target false_target;
3898 init_jump_target(&true_target, NULL);
3899 init_jump_target(&false_target, NULL);
3900 complex_value cond_val;
3901 memset(&cond_val, 0, sizeof(cond_val));
3902 if (expression->true_expression == NULL) {
3903 assert(is_type_complex(skip_typeref(expression->condition->base.type)));
3905 = create_complex_condition_evaluation(expression->condition,
3906 &true_target, &false_target);
3908 expression_to_control_flow(expression->condition, &true_target, &false_target);
3912 memset(&val, 0, sizeof(val));
3913 jump_target exit_target;
3914 init_jump_target(&exit_target, NULL);
3916 if (enter_jump_target(&true_target)) {
3917 if (expression->true_expression) {
3918 val = expression_to_complex(expression->true_expression);
3920 assert(cond_val.real != NULL);
3923 jump_to_target(&exit_target);
3926 type_t *const type = skip_typeref(expression->base.type);
3927 if (enter_jump_target(&false_target)) {
3928 complex_value false_val
3929 = expression_to_complex(expression->false_expression);
3930 jump_to_target(&exit_target);
3931 if (val.real != NULL) {
3932 ir_node *const inr[] = { val.real, false_val.real };
3933 ir_node *const ini[] = { val.imag, false_val.imag };
3934 dbg_info *const dbgi = get_dbg_info(&expression->base.pos);
3935 ir_mode *const mode = get_complex_mode_arithmetic(type);
3936 ir_node *const block = exit_target.block;
3937 val.real = new_rd_Phi(dbgi, block, lengthof(inr), inr, mode);
3938 val.imag = new_rd_Phi(dbgi, block, lengthof(ini), ini, mode);
3944 if (!enter_jump_target(&exit_target)) {
3945 set_cur_block(new_Block(0, NULL));
3946 assert(!is_type_void(type));
3947 ir_mode *mode = get_complex_mode_arithmetic(type);
3948 val.real = new_Unknown(mode);
3949 val.imag = val.real;
3954 static void create_local_declarations(entity_t*);
3956 static complex_value compound_statement_to_firm_complex(
3957 compound_statement_t *compound)
3959 create_local_declarations(compound->scope.entities);
3961 complex_value result = { NULL, NULL };
3962 statement_t *statement = compound->statements;
3964 for ( ; statement != NULL; statement = next) {
3965 next = statement->base.next;
3966 /* last statement is the return value */
3968 /* it must be an expression, otherwise we wouldn't be in the
3969 * complex variant of compound_statement_to_firm */
3970 if (statement->kind != STATEMENT_EXPRESSION)
3971 panic("last member of complex statement expression not an expression statement");
3972 expression_t *expression = statement->expression.expression;
3973 assert(is_type_complex(skip_typeref(expression->base.type)));
3974 result = expression_to_complex(expression);
3976 statement_to_firm(statement);
3983 static complex_value complex_statement_expression_to_firm(
3984 const statement_expression_t *const expr)
3986 statement_t *statement = expr->statement;
3987 assert(statement->kind == STATEMENT_COMPOUND);
3989 return compound_statement_to_firm_complex(&statement->compound);
3992 static complex_value expression_to_complex(const expression_t *expression)
3994 switch (expression->kind) {
3995 case EXPR_REFERENCE:
3996 return complex_reference_to_firm(&expression->reference);
3998 return complex_select_to_firm(&expression->select);
3999 case EXPR_ARRAY_ACCESS:
4000 return complex_array_access_to_firm(&expression->array_access);
4001 case EXPR_UNARY_CAST:
4002 return complex_cast_to_firm(&expression->unary);
4003 case EXPR_BINARY_COMMA:
4004 evaluate_expression_discard_result(expression->binary.left);
4005 return expression_to_complex(expression->binary.right);
4006 case EXPR_BINARY_ADD:
4007 return create_complex_binop(&expression->binary, new_complex_add);
4008 case EXPR_BINARY_ADD_ASSIGN:
4009 return create_complex_assign_binop(&expression->binary, new_complex_add);
4010 case EXPR_BINARY_SUB:
4011 return create_complex_binop(&expression->binary, new_complex_sub);
4012 case EXPR_BINARY_SUB_ASSIGN:
4013 return create_complex_assign_binop(&expression->binary, new_complex_sub);
4014 case EXPR_BINARY_MUL:
4015 return create_complex_binop(&expression->binary, new_complex_mul);
4016 case EXPR_BINARY_MUL_ASSIGN:
4017 return create_complex_assign_binop(&expression->binary, new_complex_mul);
4018 case EXPR_BINARY_DIV:
4019 return create_complex_binop(&expression->binary, new_complex_div);
4020 case EXPR_BINARY_DIV_ASSIGN:
4021 return create_complex_assign_binop(&expression->binary, new_complex_div);
4022 case EXPR_UNARY_PLUS:
4023 return expression_to_complex(expression->unary.value);
4024 case EXPR_UNARY_PREFIX_INCREMENT:
4025 return create_complex_assign_unop(&expression->unary,
4026 new_complex_increment, false);
4027 case EXPR_UNARY_PREFIX_DECREMENT:
4028 return create_complex_assign_unop(&expression->unary,
4029 new_complex_decrement, false);
4030 case EXPR_UNARY_POSTFIX_INCREMENT:
4031 return create_complex_assign_unop(&expression->unary,
4032 new_complex_increment, true);
4033 case EXPR_UNARY_POSTFIX_DECREMENT:
4034 return create_complex_assign_unop(&expression->unary,
4035 new_complex_decrement, true);
4036 case EXPR_UNARY_NEGATE:
4037 return complex_negate_to_firm(&expression->unary);
4038 case EXPR_UNARY_COMPLEMENT:
4039 return complex_complement_to_firm(&expression->unary);
4040 case EXPR_BINARY_ASSIGN: {
4041 const binary_expression_t *binexpr = &expression->binary;
4042 dbg_info *dbgi = get_dbg_info(&binexpr->base.pos);
4043 complex_value value = expression_to_complex(binexpr->right);
4044 ir_node *addr = expression_to_addr(binexpr->left);
4045 set_complex_value_for_expression(dbgi, binexpr->left, value, addr);
4048 case EXPR_LITERAL_CASES:
4049 return complex_literal_to_firm(&expression->literal);
4051 return complex_call_to_firm(&expression->call);
4052 case EXPR_CONDITIONAL:
4053 return complex_conditional_to_firm(&expression->conditional);
4054 case EXPR_STATEMENT:
4055 return complex_statement_expression_to_firm(&expression->statement);
4060 panic("complex expression not implemented yet");
4065 static void create_variable_entity(entity_t *variable,
4066 declaration_kind_t declaration_kind,
4067 ir_type *parent_type)
4069 assert(variable->kind == ENTITY_VARIABLE);
4070 type_t *type = skip_typeref(variable->declaration.type);
4072 ident *const id = new_id_from_str(variable->base.symbol->string);
4073 ir_type *const irtype = get_ir_type(type);
4074 dbg_info *const dbgi = get_dbg_info(&variable->base.pos);
4075 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
4076 unsigned alignment = variable->declaration.alignment;
4078 set_entity_alignment(irentity, alignment);
4080 handle_decl_modifiers(irentity, variable);
4082 variable->declaration.kind = (unsigned char) declaration_kind;
4083 variable->variable.v.entity = irentity;
4084 set_entity_ld_ident(irentity, create_ld_ident(variable));
4086 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4087 set_entity_volatility(irentity, volatility_is_volatile);
4092 typedef struct type_path_entry_t type_path_entry_t;
4093 struct type_path_entry_t {
4095 ir_initializer_t *initializer;
4097 entity_t *compound_entry;
4100 typedef struct type_path_t type_path_t;
4101 struct type_path_t {
4102 type_path_entry_t *path;
4107 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
4109 size_t len = ARR_LEN(path->path);
4111 for (size_t i = 0; i < len; ++i) {
4112 const type_path_entry_t *entry = & path->path[i];
4114 type_t *type = skip_typeref(entry->type);
4115 if (is_type_compound(type)) {
4116 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
4117 } else if (is_type_array(type)) {
4118 fprintf(stderr, "[%u]", (unsigned) entry->index);
4120 fprintf(stderr, "-INVALID-");
4123 fprintf(stderr, " (");
4124 print_type(path->top_type);
4125 fprintf(stderr, ")");
4128 static type_path_entry_t *get_type_path_top(const type_path_t *path)
4130 size_t len = ARR_LEN(path->path);
4132 return & path->path[len-1];
4135 static type_path_entry_t *append_to_type_path(type_path_t *path)
4137 size_t len = ARR_LEN(path->path);
4138 ARR_RESIZE(type_path_entry_t, path->path, len+1);
4140 type_path_entry_t *result = & path->path[len];
4141 memset(result, 0, sizeof(result[0]));
4145 static size_t get_compound_member_count(const compound_type_t *type)
4147 compound_t *compound = type->compound;
4148 size_t n_members = 0;
4149 entity_t *member = compound->members.entities;
4150 for ( ; member != NULL; member = member->base.next) {
4157 static ir_initializer_t *get_initializer_entry(type_path_t *path)
4159 type_t *orig_top_type = path->top_type;
4160 type_t *top_type = skip_typeref(orig_top_type);
4162 assert(is_type_compound(top_type) || is_type_array(top_type));
4164 if (ARR_LEN(path->path) == 0) {
4167 type_path_entry_t *top = get_type_path_top(path);
4168 ir_initializer_t *initializer = top->initializer;
4169 return get_initializer_compound_value(initializer, top->index);
4173 static void descend_into_subtype(type_path_t *path)
4175 type_t *orig_top_type = path->top_type;
4176 type_t *top_type = skip_typeref(orig_top_type);
4178 assert(is_type_compound(top_type) || is_type_array(top_type));
4180 ir_initializer_t *initializer = get_initializer_entry(path);
4182 type_path_entry_t *top = append_to_type_path(path);
4183 top->type = top_type;
4187 if (is_type_compound(top_type)) {
4188 compound_t *const compound = top_type->compound.compound;
4189 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
4191 top->compound_entry = entry;
4193 len = get_compound_member_count(&top_type->compound);
4194 if (entry != NULL) {
4195 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
4196 path->top_type = entry->declaration.type;
4199 assert(is_type_array(top_type));
4200 assert(top_type->array.size > 0);
4203 path->top_type = top_type->array.element_type;
4204 len = top_type->array.size;
4206 if (initializer == NULL
4207 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
4208 initializer = create_initializer_compound(len);
4209 /* we have to set the entry at the 2nd latest path entry... */
4210 size_t path_len = ARR_LEN(path->path);
4211 assert(path_len >= 1);
4213 type_path_entry_t *entry = & path->path[path_len-2];
4214 ir_initializer_t *tinitializer = entry->initializer;
4215 set_initializer_compound_value(tinitializer, entry->index,
4219 top->initializer = initializer;
4222 static void ascend_from_subtype(type_path_t *path)
4224 type_path_entry_t *top = get_type_path_top(path);
4226 path->top_type = top->type;
4228 size_t len = ARR_LEN(path->path);
4229 ARR_RESIZE(type_path_entry_t, path->path, len-1);
4232 static void walk_designator(type_path_t *path, const designator_t *designator)
4234 /* designators start at current object type */
4235 ARR_RESIZE(type_path_entry_t, path->path, 1);
4237 for ( ; designator != NULL; designator = designator->next) {
4238 type_path_entry_t *top = get_type_path_top(path);
4239 type_t *orig_type = top->type;
4240 type_t *type = skip_typeref(orig_type);
4242 if (designator->symbol != NULL) {
4243 assert(is_type_compound(type));
4245 symbol_t *symbol = designator->symbol;
4247 compound_t *compound = type->compound.compound;
4248 entity_t *iter = compound->members.entities;
4249 for (; iter->base.symbol != symbol; iter = iter->base.next, ++index) {}
4250 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
4252 /* revert previous initialisations of other union elements */
4253 if (type->kind == TYPE_COMPOUND_UNION) {
4254 ir_initializer_t *initializer = top->initializer;
4255 if (initializer != NULL
4256 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
4257 /* are we writing to a new element? */
4258 ir_initializer_t *oldi
4259 = get_initializer_compound_value(initializer, index);
4260 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
4261 /* clear initializer */
4263 = get_initializer_compound_n_entries(initializer);
4264 ir_initializer_t *nulli = get_initializer_null();
4265 for (size_t i = 0; i < len; ++i) {
4266 set_initializer_compound_value(initializer, i,
4273 top->type = orig_type;
4274 top->compound_entry = iter;
4276 orig_type = iter->declaration.type;
4278 expression_t *array_index = designator->array_index;
4279 assert(is_type_array(type));
4281 long index = fold_constant_to_int(array_index);
4282 assert(0 <= index && (!type->array.size_constant || (size_t)index < type->array.size));
4284 top->type = orig_type;
4285 top->index = (size_t) index;
4286 orig_type = type->array.element_type;
4288 path->top_type = orig_type;
4290 if (designator->next != NULL) {
4291 descend_into_subtype(path);
4295 path->invalid = false;
4298 static void advance_current_object(type_path_t *path)
4300 if (path->invalid) {
4301 /* TODO: handle this... */
4302 panic("invalid initializer (excessive elements)");
4305 type_path_entry_t *top = get_type_path_top(path);
4307 type_t *type = skip_typeref(top->type);
4308 if (is_type_union(type)) {
4309 /* only the first element is initialized in unions */
4310 top->compound_entry = NULL;
4311 } else if (is_type_struct(type)) {
4312 entity_t *entry = top->compound_entry;
4315 entry = skip_unnamed_bitfields(entry->base.next);
4316 top->compound_entry = entry;
4317 if (entry != NULL) {
4318 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
4319 path->top_type = entry->declaration.type;
4323 assert(is_type_array(type));
4326 if (!type->array.size_constant || top->index < type->array.size) {
4331 /* we're past the last member of the current sub-aggregate, try if we
4332 * can ascend in the type hierarchy and continue with another subobject */
4333 size_t len = ARR_LEN(path->path);
4336 ascend_from_subtype(path);
4337 advance_current_object(path);
4339 path->invalid = true;
4344 static ir_initializer_t *create_ir_initializer_value(
4345 const initializer_value_t *initializer)
4347 expression_t *expr = initializer->value;
4348 type_t *type = skip_typeref(expr->base.type);
4350 if (is_type_compound(type)) {
4351 if (expr->kind == EXPR_UNARY_CAST) {
4352 expr = expr->unary.value;
4353 type = skip_typeref(expr->base.type);
4355 /* must be a compound literal... */
4356 if (expr->kind == EXPR_COMPOUND_LITERAL) {
4357 return create_ir_initializer(expr->compound_literal.initializer,
4360 } else if (is_type_complex(type)) {
4361 complex_value const value = expression_to_complex(expr);
4362 ir_mode *const mode = get_complex_mode_storage(type);
4363 ir_node *const real = create_conv(NULL, value.real, mode);
4364 ir_node *const imag = create_conv(NULL, value.imag, mode);
4365 ir_initializer_t *const res = create_initializer_compound(2);
4366 ir_initializer_t *const init_real = create_initializer_const(real);
4367 ir_initializer_t *const init_imag = create_initializer_const(imag);
4368 set_initializer_compound_value(res, 0, init_real);
4369 set_initializer_compound_value(res, 1, init_imag);
4373 ir_node *value = expression_to_value(expr);
4374 value = conv_to_storage_type(NULL, value, type);
4375 return create_initializer_const(value);
4378 /** Tests whether type can be initialized by a string constant */
4379 static bool is_string_type(type_t *type)
4381 if (!is_type_array(type))
4384 type_t *const inner = skip_typeref(type->array.element_type);
4385 return is_type_integer(inner);
4388 static ir_initializer_t *create_ir_initializer_list(
4389 const initializer_list_t *initializer, type_t *type)
4392 memset(&path, 0, sizeof(path));
4393 path.top_type = type;
4394 path.path = NEW_ARR_F(type_path_entry_t, 0);
4396 descend_into_subtype(&path);
4398 for (size_t i = 0; i < initializer->len; ++i) {
4399 const initializer_t *sub_initializer = initializer->initializers[i];
4401 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
4402 walk_designator(&path, sub_initializer->designator.designator);
4406 if (sub_initializer->kind == INITIALIZER_VALUE) {
4407 const expression_t *expr = sub_initializer->value.value;
4408 const type_t *expr_type = skip_typeref(expr->base.type);
4409 /* we might have to descend into types until the types match */
4411 type_t *orig_top_type = path.top_type;
4412 type_t *top_type = skip_typeref(orig_top_type);
4414 if (types_compatible(top_type, expr_type))
4416 descend_into_subtype(&path);
4418 } else if (sub_initializer->kind == INITIALIZER_STRING) {
4419 /* we might have to descend into types until we're at a scalar
4422 type_t *orig_top_type = path.top_type;
4423 type_t *top_type = skip_typeref(orig_top_type);
4425 if (is_string_type(top_type))
4427 descend_into_subtype(&path);
4431 ir_initializer_t *sub_irinitializer
4432 = create_ir_initializer(sub_initializer, path.top_type);
4434 size_t path_len = ARR_LEN(path.path);
4435 assert(path_len >= 1);
4436 type_path_entry_t *entry = & path.path[path_len-1];
4437 ir_initializer_t *tinitializer = entry->initializer;
4438 set_initializer_compound_value(tinitializer, entry->index,
4441 advance_current_object(&path);
4444 assert(ARR_LEN(path.path) >= 1);
4445 ir_initializer_t *result = path.path[0].initializer;
4446 DEL_ARR_F(path.path);
4451 static ir_initializer_t *create_ir_initializer_string(initializer_t const *const init, type_t *type)
4453 type = skip_typeref(type);
4455 assert(type->kind == TYPE_ARRAY);
4456 assert(type->array.size_constant);
4457 string_literal_expression_t const *const str = get_init_string(init);
4458 size_t const str_len = str->value.size;
4459 size_t const arr_len = type->array.size;
4460 ir_initializer_t *const irinit = create_initializer_compound(arr_len);
4461 ir_mode *const mode = get_ir_mode_storage(type->array.element_type);
4462 char const * p = str->value.begin;
4463 switch (str->value.encoding) {
4464 case STRING_ENCODING_CHAR:
4465 case STRING_ENCODING_UTF8:
4466 for (size_t i = 0; i != arr_len; ++i) {
4467 char const c = i < str_len ? *p++ : 0;
4468 ir_tarval *const tv = new_tarval_from_long(c, mode);
4469 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
4470 set_initializer_compound_value(irinit, i, tvinit);
4474 case STRING_ENCODING_CHAR16:
4475 case STRING_ENCODING_CHAR32:
4476 case STRING_ENCODING_WIDE:
4477 for (size_t i = 0; i != arr_len; ++i) {
4478 utf32 const c = i < str_len ? read_utf8_char(&p) : 0;
4479 ir_tarval *const tv = new_tarval_from_long(c, mode);
4480 ir_initializer_t *const tvinit = create_initializer_tarval(tv);
4481 set_initializer_compound_value(irinit, i, tvinit);
4489 static ir_initializer_t *create_ir_initializer(
4490 const initializer_t *initializer, type_t *type)
4492 switch (initializer->kind) {
4493 case INITIALIZER_STRING:
4494 return create_ir_initializer_string(initializer, type);
4496 case INITIALIZER_LIST:
4497 return create_ir_initializer_list(&initializer->list, type);
4499 case INITIALIZER_VALUE:
4500 return create_ir_initializer_value(&initializer->value);
4502 case INITIALIZER_DESIGNATOR:
4503 panic("unexpected designator initializer");
4505 panic("unknown initializer");
4508 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4509 * are elements [...] the remainder of the aggregate shall be initialized
4510 * implicitly the same as objects that have static storage duration. */
4511 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4514 /* for unions we must NOT do anything for null initializers */
4515 ir_type *owner = get_entity_owner(entity);
4516 if (is_Union_type(owner)) {
4520 ir_type *ent_type = get_entity_type(entity);
4521 /* create sub-initializers for a compound type */
4522 if (is_compound_type(ent_type)) {
4523 unsigned n_members = get_compound_n_members(ent_type);
4524 for (unsigned n = 0; n < n_members; ++n) {
4525 ir_entity *member = get_compound_member(ent_type, n);
4526 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4528 create_dynamic_null_initializer(member, dbgi, addr);
4532 if (is_Array_type(ent_type)) {
4533 assert(has_array_upper_bound(ent_type, 0));
4534 long n = get_array_upper_bound_int(ent_type, 0);
4535 for (long i = 0; i < n; ++i) {
4536 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4537 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4538 ir_node *cnst = new_d_Const(dbgi, index_tv);
4539 ir_node *in[1] = { cnst };
4540 ir_entity *arrent = get_array_element_entity(ent_type);
4541 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4543 create_dynamic_null_initializer(arrent, dbgi, addr);
4548 ir_mode *value_mode = get_type_mode(ent_type);
4549 ir_node *node = new_Const(get_mode_null(value_mode));
4551 /* is it a bitfield type? */
4552 if (is_Primitive_type(ent_type) &&
4553 get_primitive_base_type(ent_type) != NULL) {
4554 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4558 ir_node *mem = get_store();
4559 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4560 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4564 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4565 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4567 switch (get_initializer_kind(initializer)) {
4568 case IR_INITIALIZER_NULL:
4569 create_dynamic_null_initializer(entity, dbgi, base_addr);
4571 case IR_INITIALIZER_CONST: {
4572 ir_node *node = get_initializer_const_value(initializer);
4573 ir_type *ent_type = get_entity_type(entity);
4575 /* is it a bitfield type? */
4576 if (is_Primitive_type(ent_type) &&
4577 get_primitive_base_type(ent_type) != NULL) {
4578 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4582 ir_node *mem = get_store();
4584 if (is_compound_type(ent_type)) {
4585 ir_node *copyb = new_d_CopyB(dbgi, mem, base_addr, node, ent_type);
4586 new_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4588 assert(get_type_mode(type) == get_irn_mode(node));
4589 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4590 new_mem = new_Proj(store, mode_M, pn_Store_M);
4595 case IR_INITIALIZER_TARVAL: {
4596 ir_tarval *tv = get_initializer_tarval_value(initializer);
4597 ir_node *cnst = new_d_Const(dbgi, tv);
4598 ir_type *ent_type = get_entity_type(entity);
4600 /* is it a bitfield type? */
4601 if (is_Primitive_type(ent_type) &&
4602 get_primitive_base_type(ent_type) != NULL) {
4603 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4607 assert(get_type_mode(type) == get_tarval_mode(tv));
4608 ir_node *mem = get_store();
4609 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4610 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4614 case IR_INITIALIZER_COMPOUND: {
4615 assert(is_compound_type(type) || is_Array_type(type));
4617 if (is_Array_type(type)) {
4618 assert(has_array_upper_bound(type, 0));
4619 n_members = get_array_upper_bound_int(type, 0);
4621 n_members = get_compound_n_members(type);
4624 if (get_initializer_compound_n_entries(initializer)
4625 != (unsigned) n_members)
4626 panic("initializer doesn't match compound type");
4628 for (int i = 0; i < n_members; ++i) {
4631 ir_entity *sub_entity;
4632 if (is_Array_type(type)) {
4633 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4634 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4635 ir_node *cnst = new_d_Const(dbgi, index_tv);
4636 ir_node *in[1] = { cnst };
4637 irtype = get_array_element_type(type);
4638 sub_entity = get_array_element_entity(type);
4639 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4642 sub_entity = get_compound_member(type, i);
4643 irtype = get_entity_type(sub_entity);
4644 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4648 ir_initializer_t *sub_init
4649 = get_initializer_compound_value(initializer, i);
4651 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4658 panic("invalid ir_initializer");
4661 static void create_dynamic_initializer(ir_initializer_t *initializer,
4662 dbg_info *dbgi, ir_entity *entity)
4664 ir_node *frame = get_irg_frame(current_ir_graph);
4665 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4666 ir_type *type = get_entity_type(entity);
4668 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4671 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4672 ir_entity *entity, type_t *type)
4674 ir_node *memory = get_store();
4675 ir_node *nomem = new_NoMem();
4676 ir_node *frame = get_irg_frame(current_ir_graph);
4677 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4679 if (initializer->kind == INITIALIZER_VALUE) {
4680 initializer_value_t *initializer_value = &initializer->value;
4682 ir_node *value = expression_to_value(initializer_value->value);
4683 type = skip_typeref(type);
4684 assign_value(dbgi, addr, type, value);
4688 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4689 ir_initializer_t *irinitializer
4690 = create_ir_initializer(initializer, type);
4692 create_dynamic_initializer(irinitializer, dbgi, entity);
4696 /* create a "template" entity which is copied to the entity on the stack */
4697 ir_entity *const init_entity
4698 = create_initializer_entity(dbgi, initializer, type);
4699 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4700 ir_type *const irtype = get_ir_type(type);
4701 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4703 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4704 set_store(copyb_mem);
4707 static void create_initializer_local_variable_entity(entity_t *entity)
4709 assert(entity->kind == ENTITY_VARIABLE);
4710 initializer_t *initializer = entity->variable.initializer;
4711 dbg_info *dbgi = get_dbg_info(&entity->base.pos);
4712 ir_entity *irentity = entity->variable.v.entity;
4713 type_t *type = entity->declaration.type;
4715 create_local_initializer(initializer, dbgi, irentity, type);
4718 static void create_variable_initializer(entity_t *entity)
4720 assert(entity->kind == ENTITY_VARIABLE);
4721 initializer_t *initializer = entity->variable.initializer;
4722 if (initializer == NULL)
4725 declaration_kind_t declaration_kind
4726 = (declaration_kind_t) entity->declaration.kind;
4727 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4728 create_initializer_local_variable_entity(entity);
4732 type_t *type = entity->declaration.type;
4733 type_qualifiers_t tq = get_type_qualifier(type, true);
4735 if (initializer->kind == INITIALIZER_VALUE) {
4736 expression_t * value = initializer->value.value;
4737 type_t *const init_type = skip_typeref(value->base.type);
4739 if (is_type_complex(init_type)) {
4740 complex_value nodes = expression_to_complex(value);
4741 dbg_info *dbgi = get_dbg_info(&entity->base.pos);
4742 ir_mode *mode = get_complex_mode_storage(init_type);
4743 ir_node *real = create_conv(dbgi, nodes.real, mode);
4744 ir_node *imag = create_conv(dbgi, nodes.imag, mode);
4745 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4746 set_value(entity->variable.v.value_number, real);
4747 set_value(entity->variable.v.value_number+1, imag);
4749 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4750 ir_entity *irentity = entity->variable.v.entity;
4751 if (tq & TYPE_QUALIFIER_CONST
4752 && get_entity_owner(irentity) != get_tls_type()) {
4753 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4755 ir_initializer_t *initializer = create_initializer_compound(2);
4756 ir_initializer_t *reali = create_initializer_const(real);
4757 set_initializer_compound_value(initializer, 0, reali);
4758 ir_initializer_t *imagi = create_initializer_const(imag);
4759 set_initializer_compound_value(initializer, 1, imagi);
4760 set_entity_initializer(irentity, initializer);
4763 } else if (!is_type_scalar(init_type)) {
4764 if (value->kind != EXPR_COMPOUND_LITERAL)
4765 panic("expected non-scalar initializer to be a compound literal");
4766 initializer = value->compound_literal.initializer;
4767 goto have_initializer;
4770 ir_node * node = expression_to_value(value);
4771 dbg_info *const dbgi = get_dbg_info(&entity->base.pos);
4772 node = conv_to_storage_type(dbgi, node, init_type);
4774 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4775 set_value(entity->variable.v.value_number, node);
4777 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4779 ir_entity *irentity = entity->variable.v.entity;
4781 if (tq & TYPE_QUALIFIER_CONST
4782 && get_entity_owner(irentity) != get_tls_type()) {
4783 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4785 set_atomic_ent_value(irentity, node);
4789 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4790 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4792 ir_entity *irentity = entity->variable.v.entity;
4793 ir_initializer_t *irinitializer
4794 = create_ir_initializer(initializer, type);
4796 if (tq & TYPE_QUALIFIER_CONST) {
4797 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4799 set_entity_initializer(irentity, irinitializer);
4803 static void create_variable_length_array(entity_t *entity)
4805 assert(entity->kind == ENTITY_VARIABLE);
4806 assert(entity->variable.initializer == NULL);
4808 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4809 entity->variable.v.vla_base = NULL;
4811 /* TODO: record VLA somewhere so we create the free node when we leave
4815 static void allocate_variable_length_array(entity_t *entity)
4817 assert(entity->kind == ENTITY_VARIABLE);
4818 assert(entity->variable.initializer == NULL);
4819 assert(currently_reachable());
4821 dbg_info *dbgi = get_dbg_info(&entity->base.pos);
4822 type_t *type = entity->declaration.type;
4823 ir_type *el_type = get_ir_type(type->array.element_type);
4825 /* make sure size_node is calculated */
4826 get_type_size_node(type);
4827 ir_node *elems = type->array.size_node;
4828 ir_node *mem = get_store();
4829 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4831 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4832 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4835 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4836 entity->variable.v.vla_base = addr;
4839 static bool var_needs_entity(variable_t const *const var)
4841 if (var->address_taken)
4843 type_t *const type = skip_typeref(var->base.type);
4844 return (!is_type_scalar(type) && !is_type_complex(type))
4845 || type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
4849 * Creates a Firm local variable from a declaration.
4851 static void create_local_variable(entity_t *entity)
4853 assert(entity->kind == ENTITY_VARIABLE);
4854 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4856 if (!var_needs_entity(&entity->variable)) {
4857 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4858 entity->variable.v.value_number = next_value_number_function;
4859 set_irg_loc_description(current_ir_graph, next_value_number_function, entity);
4860 ++next_value_number_function;
4861 if (is_type_complex(skip_typeref(entity->declaration.type)))
4862 ++next_value_number_function;
4866 /* is it a variable length array? */
4867 type_t *const type = skip_typeref(entity->declaration.type);
4868 if (is_type_array(type) && !type->array.size_constant) {
4869 create_variable_length_array(entity);
4873 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
4874 create_variable_entity(entity, DECLARATION_KIND_LOCAL_VARIABLE_ENTITY, frame_type);
4877 static void create_local_static_variable(entity_t *entity)
4879 assert(entity->kind == ENTITY_VARIABLE);
4880 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4882 type_t *type = skip_typeref(entity->declaration.type);
4883 ir_type *const var_type = entity->variable.thread_local ?
4884 get_tls_type() : get_glob_type();
4885 ir_type *const irtype = get_ir_type(type);
4886 dbg_info *const dbgi = get_dbg_info(&entity->base.pos);
4888 size_t l = strlen(entity->base.symbol->string);
4889 char buf[l + sizeof(".%u")];
4890 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4891 ident *const id = id_unique(buf);
4892 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4894 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4895 set_entity_volatility(irentity, volatility_is_volatile);
4898 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4899 entity->variable.v.entity = irentity;
4901 set_entity_ld_ident(irentity, id);
4902 set_entity_visibility(irentity, ir_visibility_local);
4904 if (entity->variable.initializer == NULL) {
4905 ir_initializer_t *null_init = get_initializer_null();
4906 set_entity_initializer(irentity, null_init);
4909 PUSH_IRG(get_const_code_irg());
4910 create_variable_initializer(entity);
4914 static ir_node *return_statement_to_firm(return_statement_t *statement)
4916 if (!currently_reachable())
4919 dbg_info *const dbgi = get_dbg_info(&statement->base.pos);
4920 type_t *const type = skip_typeref(current_function_entity->declaration.type->function.return_type);
4924 if (is_type_void(type)) {
4925 /* just create the side effects, don't return anything */
4926 if (statement->value)
4927 evaluate_expression_discard_result(statement->value);
4930 } else if (is_type_complex(type)) {
4931 if (statement->value) {
4932 complex_value value = expression_to_complex(statement->value);
4933 in[0] = complex_to_memory(dbgi, type, value);
4935 in[0] = new_Unknown(mode_P_data);
4939 ir_mode *const mode = get_ir_mode_storage(type);
4940 if (statement->value) {
4941 ir_node *value = expression_to_value(statement->value);
4942 value = conv_to_storage_type(dbgi, value, type);
4943 in[0] = create_conv(dbgi, value, mode);
4945 in[0] = new_Unknown(mode);
4950 ir_node *const store = get_store();
4951 ir_node *const ret = new_d_Return(dbgi, store, in_len, in);
4953 ir_node *end_block = get_irg_end_block(current_ir_graph);
4954 add_immBlock_pred(end_block, ret);
4956 set_unreachable_now();
4960 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4962 if (!currently_reachable())
4965 expression_t *expression = statement->expression;
4966 type_t *type = skip_typeref(expression->base.type);
4967 if (is_type_complex(type)) {
4968 expression_to_complex(expression);
4969 return NULL; /* TODO */
4971 return expression_to_value(statement->expression);
4975 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4977 create_local_declarations(compound->scope.entities);
4979 ir_node *result = NULL;
4980 statement_t *statement = compound->statements;
4981 for ( ; statement != NULL; statement = statement->base.next) {
4982 result = statement_to_firm(statement);
4988 static void create_global_variable(entity_t *entity)
4990 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4991 ir_visibility visibility = ir_visibility_external;
4992 storage_class_tag_t storage
4993 = (storage_class_tag_t)entity->declaration.storage_class;
4994 decl_modifiers_t modifiers = entity->declaration.modifiers;
4995 assert(entity->kind == ENTITY_VARIABLE);
4998 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4999 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
5000 case STORAGE_CLASS_NONE: visibility = ir_visibility_external; break;
5001 case STORAGE_CLASS_TYPEDEF:
5002 case STORAGE_CLASS_AUTO:
5003 case STORAGE_CLASS_REGISTER:
5004 panic("invalid storage class for global var");
5007 /* "common" symbols */
5008 if (storage == STORAGE_CLASS_NONE
5009 && entity->variable.initializer == NULL
5010 && !entity->variable.thread_local
5011 && (modifiers & DM_WEAK) == 0) {
5012 linkage |= IR_LINKAGE_MERGE;
5015 ir_type *var_type = get_glob_type();
5016 if (entity->variable.thread_local) {
5017 var_type = get_tls_type();
5019 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
5020 ir_entity *irentity = entity->variable.v.entity;
5021 add_entity_linkage(irentity, linkage);
5022 set_entity_visibility(irentity, visibility);
5023 if (entity->variable.initializer == NULL
5024 && storage != STORAGE_CLASS_EXTERN) {
5025 ir_initializer_t *null_init = get_initializer_null();
5026 set_entity_initializer(irentity, null_init);
5030 static void create_local_declaration(entity_t *entity)
5032 assert(is_declaration(entity));
5034 /* construct type */
5035 (void) get_ir_type(entity->declaration.type);
5036 if (entity->base.symbol == NULL) {
5040 switch ((storage_class_tag_t) entity->declaration.storage_class) {
5041 case STORAGE_CLASS_STATIC:
5042 if (entity->kind == ENTITY_FUNCTION) {
5043 (void)get_function_entity(entity, NULL);
5045 create_local_static_variable(entity);
5048 case STORAGE_CLASS_EXTERN:
5049 if (entity->kind == ENTITY_FUNCTION) {
5050 assert(entity->function.body == NULL);
5051 (void)get_function_entity(entity, NULL);
5053 create_global_variable(entity);
5054 create_variable_initializer(entity);
5057 case STORAGE_CLASS_NONE:
5058 case STORAGE_CLASS_AUTO:
5059 case STORAGE_CLASS_REGISTER:
5060 if (entity->kind == ENTITY_FUNCTION) {
5061 if (entity->function.body != NULL) {
5062 ir_type *owner = get_irg_frame_type(current_ir_graph);
5063 (void)get_function_entity(entity, owner);
5064 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
5065 enqueue_inner_function(entity);
5067 (void)get_function_entity(entity, NULL);
5070 create_local_variable(entity);
5073 case STORAGE_CLASS_TYPEDEF:
5076 panic("invalid storage class");
5079 static void create_local_declarations(entity_t *e)
5081 for (; e; e = e->base.next) {
5082 if (is_declaration(e))
5083 create_local_declaration(e);
5087 static void initialize_local_declaration(entity_t *entity)
5089 if (entity->base.symbol == NULL)
5092 // no need to emit code in dead blocks
5093 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
5094 && !currently_reachable())
5097 switch ((declaration_kind_t) entity->declaration.kind) {
5098 case DECLARATION_KIND_LOCAL_VARIABLE:
5099 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
5100 create_variable_initializer(entity);
5103 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
5104 allocate_variable_length_array(entity);
5107 case DECLARATION_KIND_COMPOUND_MEMBER:
5108 case DECLARATION_KIND_GLOBAL_VARIABLE:
5109 case DECLARATION_KIND_FUNCTION:
5110 case DECLARATION_KIND_INNER_FUNCTION:
5113 case DECLARATION_KIND_PARAMETER:
5114 case DECLARATION_KIND_PARAMETER_ENTITY:
5115 panic("can't initialize parameters");
5117 case DECLARATION_KIND_UNKNOWN:
5118 panic("can't initialize unknown declaration");
5120 panic("invalid declaration kind");
5123 static ir_node *declaration_statement_to_firm(declaration_statement_t *statement)
5125 entity_t *entity = statement->declarations_begin;
5129 entity_t *const last = statement->declarations_end;
5130 for ( ;; entity = entity->base.next) {
5131 if (is_declaration(entity)) {
5132 initialize_local_declaration(entity);
5133 } else if (entity->kind == ENTITY_TYPEDEF) {
5134 /* ยง6.7.7:3 Any array size expressions associated with variable length
5135 * array declarators are evaluated each time the declaration of the
5136 * typedef name is reached in the order of execution. */
5137 type_t *const type = skip_typeref(entity->typedefe.type);
5138 if (is_type_array(type) && type->array.is_vla)
5139 get_vla_size(&type->array);
5148 static ir_node *if_statement_to_firm(if_statement_t *statement)
5150 create_local_declarations(statement->scope.entities);
5152 /* Create the condition. */
5153 jump_target true_target;
5154 jump_target false_target;
5155 init_jump_target(&true_target, NULL);
5156 init_jump_target(&false_target, NULL);
5157 if (currently_reachable())
5158 expression_to_control_flow(statement->condition, &true_target, &false_target);
5160 jump_target exit_target;
5161 init_jump_target(&exit_target, NULL);
5163 /* Create the true statement. */
5164 enter_jump_target(&true_target);
5165 statement_to_firm(statement->true_statement);
5166 jump_to_target(&exit_target);
5168 /* Create the false statement. */
5169 enter_jump_target(&false_target);
5170 if (statement->false_statement)
5171 statement_to_firm(statement->false_statement);
5172 jump_to_target(&exit_target);
5174 enter_jump_target(&exit_target);
5178 static ir_node *do_while_statement_to_firm(do_while_statement_t *statement)
5180 create_local_declarations(statement->scope.entities);
5183 PUSH_CONTINUE(NULL);
5185 expression_t *const cond = statement->condition;
5186 /* Avoid an explicit body block in case of do ... while (0);. */
5187 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT && !fold_constant_to_bool(cond)) {
5188 /* do ... while (0);. */
5189 statement_to_firm(statement->body);
5190 jump_to_target(&continue_target);
5191 enter_jump_target(&continue_target);
5192 jump_to_target(&break_target);
5194 jump_target body_target;
5195 init_jump_target(&body_target, NULL);
5196 jump_to_target(&body_target);
5197 enter_immature_jump_target(&body_target);
5199 statement_to_firm(statement->body);
5200 jump_to_target(&continue_target);
5201 if (enter_jump_target(&continue_target))
5202 expression_to_control_flow(statement->condition, &body_target, &break_target);
5203 enter_jump_target(&body_target);
5205 enter_jump_target(&break_target);
5212 static ir_node *for_statement_to_firm(for_statement_t *statement)
5214 create_local_declarations(statement->scope.entities);
5216 if (currently_reachable()) {
5217 entity_t *entity = statement->scope.entities;
5218 for ( ; entity != NULL; entity = entity->base.next) {
5219 if (!is_declaration(entity))
5222 initialize_local_declaration(entity);
5225 if (statement->initialisation != NULL) {
5226 expression_to_value(statement->initialisation);
5230 /* Create the header block */
5231 jump_target header_target;
5232 init_jump_target(&header_target, NULL);
5233 jump_to_target(&header_target);
5234 enter_immature_jump_target(&header_target);
5237 expression_t *const step = statement->step;
5239 PUSH_CONTINUE(step ? NULL : header_target.block);
5241 /* Create the condition. */
5242 expression_t *const cond = statement->condition;
5243 if (cond && (is_constant_expression(cond) != EXPR_CLASS_CONSTANT || !fold_constant_to_bool(cond))) {
5244 jump_target body_target;
5245 init_jump_target(&body_target, NULL);
5246 expression_to_control_flow(cond, &body_target, &break_target);
5247 enter_jump_target(&body_target);
5250 /* Create the loop body. */
5251 statement_to_firm(statement->body);
5252 jump_to_target(&continue_target);
5254 /* Create the step code. */
5255 if (step && enter_jump_target(&continue_target)) {
5256 expression_to_value(step);
5257 jump_to_target(&header_target);
5260 enter_jump_target(&header_target);
5261 enter_jump_target(&break_target);
5268 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
5270 /* determine number of cases */
5272 for (case_label_statement_t *l = statement->first_case; l != NULL;
5275 if (l->expression == NULL)
5277 if (l->is_empty_range)
5282 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
5284 for (case_label_statement_t *l = statement->first_case; l != NULL;
5286 if (l->expression == NULL) {
5287 l->pn = pn_Switch_default;
5290 if (l->is_empty_range)
5292 ir_tarval *min = l->first_case;
5293 ir_tarval *max = l->last_case;
5294 long pn = (long) i+1;
5295 ir_switch_table_set(res, i++, min, max, pn);
5301 static ir_node *switch_statement_to_firm(switch_statement_t *statement)
5303 dbg_info *dbgi = get_dbg_info(&statement->base.pos);
5304 ir_node *switch_node = NULL;
5306 if (currently_reachable()) {
5307 ir_node *expression = expression_to_value(statement->expression);
5308 ir_switch_table *table = create_switch_table(statement);
5309 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
5311 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
5314 set_unreachable_now();
5317 ir_node *const old_switch = current_switch;
5318 const bool old_saw_default_label = saw_default_label;
5319 saw_default_label = false;
5320 current_switch = switch_node;
5322 statement_to_firm(statement->body);
5323 jump_to_target(&break_target);
5325 if (!saw_default_label && switch_node) {
5326 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
5327 add_pred_to_jump_target(&break_target, proj);
5330 enter_jump_target(&break_target);
5332 assert(current_switch == switch_node);
5333 current_switch = old_switch;
5334 saw_default_label = old_saw_default_label;
5339 static ir_node *case_label_to_firm(const case_label_statement_t *statement)
5341 if (current_switch != NULL && !statement->is_empty_range) {
5342 jump_target case_target;
5343 init_jump_target(&case_target, NULL);
5345 /* Fallthrough from previous case */
5346 jump_to_target(&case_target);
5348 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
5349 add_pred_to_jump_target(&case_target, proj);
5350 if (statement->expression == NULL)
5351 saw_default_label = true;
5353 enter_jump_target(&case_target);
5356 return statement_to_firm(statement->statement);
5359 static ir_node *label_to_firm(const label_statement_t *statement)
5361 label_t *const label = statement->label;
5362 prepare_label_target(label);
5363 jump_to_target(&label->target);
5364 if (--label->n_users == 0) {
5365 enter_jump_target(&label->target);
5367 enter_immature_jump_target(&label->target);
5371 return statement_to_firm(statement->statement);
5374 static ir_node *goto_statement_to_firm(goto_statement_t *const stmt)
5376 label_t *const label = stmt->label;
5377 prepare_label_target(label);
5378 jump_to_target(&label->target);
5379 if (--label->n_users == 0)
5380 enter_jump_target(&label->target);
5381 set_unreachable_now();
5385 static ir_node *computed_goto_to_firm(computed_goto_statement_t const *const statement)
5387 if (currently_reachable()) {
5388 ir_node *const op = expression_to_value(statement->expression);
5389 ARR_APP1(ir_node*, ijmp_ops, op);
5390 jump_to_target(&ijmp_target);
5391 set_unreachable_now();
5396 static ir_node *asm_statement_to_firm(const asm_statement_t *statement)
5398 bool needs_memory = statement->is_volatile;
5399 size_t n_clobbers = 0;
5400 asm_clobber_t *clobber = statement->clobbers;
5401 for ( ; clobber != NULL; clobber = clobber->next) {
5402 const char *clobber_str = clobber->clobber.begin;
5404 if (!be_is_valid_clobber(clobber_str)) {
5405 errorf(&statement->base.pos,
5406 "invalid clobber '%s' specified", clobber->clobber);
5410 if (streq(clobber_str, "memory")) {
5411 needs_memory = true;
5415 ident *id = new_id_from_str(clobber_str);
5416 obstack_ptr_grow(&asm_obst, id);
5419 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5420 ident **clobbers = NULL;
5421 if (n_clobbers > 0) {
5422 clobbers = obstack_finish(&asm_obst);
5425 size_t n_inputs = 0;
5426 asm_argument_t *argument = statement->inputs;
5427 for ( ; argument != NULL; argument = argument->next)
5429 size_t n_outputs = 0;
5430 argument = statement->outputs;
5431 for ( ; argument != NULL; argument = argument->next)
5434 unsigned next_pos = 0;
5436 ir_node *ins[n_inputs + n_outputs + 1];
5439 ir_asm_constraint tmp_in_constraints[n_outputs];
5441 const expression_t *out_exprs[n_outputs];
5442 ir_node *out_addrs[n_outputs];
5443 size_t out_size = 0;
5445 argument = statement->outputs;
5446 for ( ; argument != NULL; argument = argument->next) {
5447 const char *constraints = argument->constraints.begin;
5448 asm_constraint_flags_t asm_flags
5449 = be_parse_asm_constraints(constraints);
5452 position_t const *const pos = &statement->base.pos;
5453 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5454 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5456 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5457 errorf(pos, "some constraints in '%s' are invalid", constraints);
5460 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5461 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5466 unsigned pos = next_pos++;
5467 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5468 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5469 expression_t *expr = argument->expression;
5470 ir_node *addr = expression_to_addr(expr);
5471 /* in+output, construct an artifical same_as constraint on the
5473 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5475 ir_node *value = get_value_from_lvalue(expr, addr);
5477 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5479 ir_asm_constraint constraint;
5480 constraint.pos = pos;
5481 constraint.constraint = new_id_from_str(buf);
5482 constraint.mode = get_ir_mode_storage(expr->base.type);
5483 tmp_in_constraints[in_size] = constraint;
5484 ins[in_size] = value;
5489 out_exprs[out_size] = expr;
5490 out_addrs[out_size] = addr;
5492 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5493 /* pure memory ops need no input (but we have to make sure we
5494 * attach to the memory) */
5495 assert(! (asm_flags &
5496 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5497 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5498 needs_memory = true;
5500 /* we need to attach the address to the inputs */
5501 expression_t *expr = argument->expression;
5503 ir_asm_constraint constraint;
5504 constraint.pos = pos;
5505 constraint.constraint = new_id_from_str(constraints);
5506 constraint.mode = mode_M;
5507 tmp_in_constraints[in_size] = constraint;
5509 ins[in_size] = expression_to_addr(expr);
5513 errorf(&statement->base.pos,
5514 "only modifiers but no place set in constraints '%s'",
5519 ir_asm_constraint constraint;
5520 constraint.pos = pos;
5521 constraint.constraint = new_id_from_str(constraints);
5522 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5524 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5526 assert(obstack_object_size(&asm_obst)
5527 == out_size * sizeof(ir_asm_constraint));
5528 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5531 obstack_grow(&asm_obst, tmp_in_constraints,
5532 in_size * sizeof(tmp_in_constraints[0]));
5533 /* find and count input and output arguments */
5534 argument = statement->inputs;
5535 for ( ; argument != NULL; argument = argument->next) {
5536 const char *constraints = argument->constraints.begin;
5537 asm_constraint_flags_t asm_flags
5538 = be_parse_asm_constraints(constraints);
5540 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5541 errorf(&statement->base.pos,
5542 "some constraints in '%s' are not supported", constraints);
5545 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5546 errorf(&statement->base.pos,
5547 "some constraints in '%s' are invalid", constraints);
5550 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5551 errorf(&statement->base.pos,
5552 "write flag specified for input constraints '%s'",
5558 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5559 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5560 /* we can treat this as "normal" input */
5561 input = expression_to_value(argument->expression);
5562 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5563 /* pure memory ops need no input (but we have to make sure we
5564 * attach to the memory) */
5565 assert(! (asm_flags &
5566 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5567 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5568 needs_memory = true;
5569 input = expression_to_addr(argument->expression);
5571 errorf(&statement->base.pos,
5572 "only modifiers but no place set in constraints '%s'",
5577 ir_asm_constraint constraint;
5578 constraint.pos = next_pos++;
5579 constraint.constraint = new_id_from_str(constraints);
5580 constraint.mode = get_irn_mode(input);
5582 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5583 ins[in_size++] = input;
5586 ir_node *mem = needs_memory ? get_store() : new_NoMem();
5587 assert(obstack_object_size(&asm_obst)
5588 == in_size * sizeof(ir_asm_constraint));
5589 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5591 /* create asm node */
5592 dbg_info *dbgi = get_dbg_info(&statement->base.pos);
5594 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5596 ir_node *node = new_d_ASM(dbgi, mem, in_size, ins, input_constraints,
5597 out_size, output_constraints,
5598 n_clobbers, clobbers, asm_text);
5600 if (statement->is_volatile) {
5601 set_irn_pinned(node, op_pin_state_pinned);
5603 set_irn_pinned(node, op_pin_state_floats);
5606 /* create output projs & connect them */
5608 ir_node *projm = new_Proj(node, mode_M, out_size);
5613 for (i = 0; i < out_size; ++i) {
5614 const expression_t *out_expr = out_exprs[i];
5616 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5617 ir_node *proj = new_Proj(node, mode, pn);
5618 ir_node *addr = out_addrs[i];
5620 set_value_for_expression_addr(out_expr, proj, addr);
5626 static ir_node *ms_try_statement_to_firm(ms_try_statement_t *statement)
5628 statement_to_firm(statement->try_statement);
5629 position_t const *const pos = &statement->base.pos;
5630 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5634 static ir_node *leave_statement_to_firm(leave_statement_t *statement)
5636 errorf(&statement->base.pos, "__leave not supported yet");
5641 * Transform a statement.
5643 static ir_node *statement_to_firm(statement_t *const stmt)
5646 assert(!stmt->base.transformed);
5647 stmt->base.transformed = true;
5650 switch (stmt->kind) {
5651 case STATEMENT_ASM: return asm_statement_to_firm( &stmt->asms);
5652 case STATEMENT_CASE_LABEL: return case_label_to_firm( &stmt->case_label);
5653 case STATEMENT_COMPOUND: return compound_statement_to_firm( &stmt->compound);
5654 case STATEMENT_COMPUTED_GOTO: return computed_goto_to_firm( &stmt->computed_goto);
5655 case STATEMENT_DECLARATION: return declaration_statement_to_firm(&stmt->declaration);
5656 case STATEMENT_DO_WHILE: return do_while_statement_to_firm( &stmt->do_while);
5657 case STATEMENT_EMPTY: return NULL; /* nothing */
5658 case STATEMENT_EXPRESSION: return expression_statement_to_firm( &stmt->expression);
5659 case STATEMENT_FOR: return for_statement_to_firm( &stmt->fors);
5660 case STATEMENT_GOTO: return goto_statement_to_firm( &stmt->gotos);
5661 case STATEMENT_IF: return if_statement_to_firm( &stmt->ifs);
5662 case STATEMENT_LABEL: return label_to_firm( &stmt->label);
5663 case STATEMENT_LEAVE: return leave_statement_to_firm( &stmt->leave);
5664 case STATEMENT_MS_TRY: return ms_try_statement_to_firm( &stmt->ms_try);
5665 case STATEMENT_RETURN: return return_statement_to_firm( &stmt->returns);
5666 case STATEMENT_SWITCH: return switch_statement_to_firm( &stmt->switchs);
5670 case STATEMENT_BREAK: tgt = &break_target; goto jump;
5671 case STATEMENT_CONTINUE: tgt = &continue_target; goto jump;
5673 jump_to_target(tgt);
5674 set_unreachable_now();
5678 case STATEMENT_ERROR: panic("error statement");
5680 panic("statement not implemented");
5683 static int count_local_variables(const entity_t *entity,
5684 const entity_t *const last)
5687 entity_t const *const end = last != NULL ? last->base.next : NULL;
5688 for (; entity != end; entity = entity->base.next) {
5689 if ((entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER) &&
5690 !var_needs_entity(&entity->variable)) {
5692 if (is_type_complex(skip_typeref(entity->declaration.type)))
5699 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5701 int *const count = env;
5703 switch (stmt->kind) {
5704 case STATEMENT_DECLARATION: {
5705 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5706 *count += count_local_variables(decl_stmt->declarations_begin,
5707 decl_stmt->declarations_end);
5712 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5721 * Return the number of local (alias free) variables used by a function.
5723 static int get_function_n_local_vars(entity_t *entity)
5725 const function_t *function = &entity->function;
5728 /* count parameters */
5729 count += count_local_variables(function->parameters.entities, NULL);
5731 /* count local variables declared in body */
5732 walk_statements(function->body, count_local_variables_in_stmt, &count);
5737 * Build Firm code for the parameters of a function.
5739 static void initialize_function_parameters(entity_t *entity)
5741 assert(entity->kind == ENTITY_FUNCTION);
5742 ir_graph *irg = current_ir_graph;
5743 ir_node *args = get_irg_args(irg);
5745 ir_type *function_irtype;
5747 if (entity->function.need_closure) {
5748 /* add an extra parameter for the static link */
5749 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5752 /* Matze: IMO this is wrong, nested functions should have an own
5753 * type and not rely on strange parameters... */
5754 function_irtype = create_method_type(&entity->declaration.type->function, true);
5756 function_irtype = get_ir_type(entity->declaration.type);
5759 entity_t *parameter = entity->function.parameters.entities;
5760 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5761 if (parameter->kind != ENTITY_PARAMETER)
5764 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5765 type_t *type = skip_typeref(parameter->declaration.type);
5767 dbg_info *const dbgi = get_dbg_info(¶meter->base.pos);
5768 ir_type *const param_irtype = get_method_param_type(function_irtype, n);
5769 if (var_needs_entity(¶meter->variable)) {
5770 ir_type *frame_type = get_irg_frame_type(irg);
5772 = new_d_parameter_entity(frame_type, n, param_irtype, dbgi);
5773 parameter->declaration.kind = DECLARATION_KIND_PARAMETER_ENTITY;
5774 parameter->variable.v.entity = param;
5775 } else if (is_type_complex(type)) {
5776 ir_type *frame_type = get_irg_frame_type(irg);
5778 = new_d_parameter_entity(frame_type, n, param_irtype, dbgi);
5779 ir_node *nomem = get_irg_no_mem(irg);
5780 ir_node *frame = get_irg_frame(irg);
5781 ir_node *addr = new_simpleSel(nomem, frame, param);
5782 complex_value value = complex_deref_address(NULL, type, addr, cons_floats);
5784 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5785 parameter->variable.v.value_number = next_value_number_function;
5786 set_irg_loc_description(irg, next_value_number_function,
5788 set_irg_loc_description(irg, next_value_number_function+1,
5790 set_value(next_value_number_function, value.real);
5791 set_value(next_value_number_function+1, value.imag);
5792 next_value_number_function += 2;
5794 ir_mode *param_mode = get_type_mode(param_irtype);
5796 ir_node *value = new_rd_Proj(dbgi, args, param_mode, pn);
5797 value = conv_to_storage_type(dbgi, value, type);
5799 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5800 parameter->variable.v.value_number = next_value_number_function;
5801 set_irg_loc_description(irg, next_value_number_function,
5803 ++next_value_number_function;
5805 set_value(parameter->variable.v.value_number, value);
5810 static void add_function_pointer(ir_type *segment, ir_entity *method,
5811 const char *unique_template)
5813 ir_type *method_type = get_entity_type(method);
5814 ir_type *ptr_type = new_type_pointer(method_type);
5816 /* these entities don't really have a name but firm only allows
5818 * Note that we mustn't give these entities a name since for example
5819 * Mach-O doesn't allow them. */
5820 ident *ide = id_unique(unique_template);
5821 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5822 ir_graph *irg = get_const_code_irg();
5823 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5826 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5827 set_entity_compiler_generated(ptr, 1);
5828 set_entity_visibility(ptr, ir_visibility_private);
5829 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5830 set_atomic_ent_value(ptr, val);
5834 * Create code for a function and all inner functions.
5836 * @param entity the function entity
5838 static void create_function(entity_t *entity)
5840 assert(entity->kind == ENTITY_FUNCTION);
5841 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5843 if (entity->function.body == NULL)
5846 inner_functions = NULL;
5847 current_trampolines = NULL;
5849 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5850 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5851 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5853 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5854 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5855 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5858 current_function_entity = entity;
5859 current_function_name = NULL;
5860 current_funcsig = NULL;
5863 assert(!ijmp_blocks);
5864 init_jump_target(&ijmp_target, NULL);
5865 ijmp_ops = NEW_ARR_F(ir_node*, 0);
5866 ijmp_blocks = NEW_ARR_F(ir_node*, 0);
5868 int n_local_vars = get_function_n_local_vars(entity);
5869 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5870 current_ir_graph = irg;
5872 ir_graph *old_current_function = current_function;
5873 current_function = irg;
5875 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5876 current_vararg_entity = NULL;
5878 set_irg_fp_model(irg, firm_fp_model);
5879 set_irn_dbg_info(get_irg_start_block(irg),
5880 get_entity_dbg_info(function_entity));
5882 next_value_number_function = 0;
5883 initialize_function_parameters(entity);
5884 current_static_link = entity->function.static_link;
5886 statement_to_firm(entity->function.body);
5888 ir_node *end_block = get_irg_end_block(irg);
5890 /* do we have a return statement yet? */
5891 if (currently_reachable()) {
5892 type_t *type = skip_typeref(entity->declaration.type);
5893 assert(is_type_function(type));
5894 type_t *const return_type = skip_typeref(type->function.return_type);
5897 if (is_type_void(return_type)) {
5898 ret = new_Return(get_store(), 0, NULL);
5900 ir_mode *const mode = get_ir_mode_storage(return_type);
5903 /* ยง5.1.2.2.3 main implicitly returns 0 */
5904 if (is_main(entity)) {
5905 in[0] = new_Const(get_mode_null(mode));
5907 in[0] = new_Unknown(mode);
5909 ret = new_Return(get_store(), 1, in);
5911 add_immBlock_pred(end_block, ret);
5914 if (enter_jump_target(&ijmp_target)) {
5916 size_t const n = ARR_LEN(ijmp_ops);
5917 ir_node *const op = n == 1 ? ijmp_ops[0] : new_Phi(n, ijmp_ops, get_irn_mode(ijmp_ops[0]));
5918 ir_node *const ijmp = new_IJmp(op);
5919 for (size_t i = ARR_LEN(ijmp_blocks); i-- != 0;) {
5920 ir_node *const block = ijmp_blocks[i];
5921 add_immBlock_pred(block, ijmp);
5922 mature_immBlock(block);
5926 DEL_ARR_F(ijmp_ops);
5927 DEL_ARR_F(ijmp_blocks);
5931 irg_finalize_cons(irg);
5933 /* finalize the frame type */
5934 ir_type *frame_type = get_irg_frame_type(irg);
5935 int n = get_compound_n_members(frame_type);
5938 for (int i = 0; i < n; ++i) {
5939 ir_entity *member = get_compound_member(frame_type, i);
5940 ir_type *entity_type = get_entity_type(member);
5942 int align = get_type_alignment_bytes(entity_type);
5943 if (align > align_all)
5947 misalign = offset % align;
5949 offset += align - misalign;
5953 set_entity_offset(member, offset);
5954 offset += get_type_size_bytes(entity_type);
5956 set_type_size_bytes(frame_type, offset);
5957 set_type_alignment_bytes(frame_type, align_all);
5959 irg_verify(irg, VERIFY_ENFORCE_SSA);
5960 current_vararg_entity = old_current_vararg_entity;
5961 current_function = old_current_function;
5963 if (current_trampolines != NULL) {
5964 DEL_ARR_F(current_trampolines);
5965 current_trampolines = NULL;
5968 /* create inner functions if any */
5969 entity_t **inner = inner_functions;
5970 if (inner != NULL) {
5971 ir_type *rem_outer_frame = current_outer_frame;
5972 current_outer_frame = get_irg_frame_type(current_ir_graph);
5973 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5974 create_function(inner[i]);
5978 current_outer_frame = rem_outer_frame;
5982 static void scope_to_firm(scope_t *scope)
5984 /* first pass: create declarations */
5985 entity_t *entity = scope->entities;
5986 for ( ; entity != NULL; entity = entity->base.next) {
5987 if (entity->base.symbol == NULL)
5990 if (entity->kind == ENTITY_FUNCTION) {
5991 if (entity->function.btk != BUILTIN_NONE) {
5992 /* builtins have no representation */
5995 (void)get_function_entity(entity, NULL);
5996 } else if (entity->kind == ENTITY_VARIABLE) {
5997 create_global_variable(entity);
5998 } else if (entity->kind == ENTITY_NAMESPACE) {
5999 scope_to_firm(&entity->namespacee.members);
6003 /* second pass: create code/initializers */
6004 entity = scope->entities;
6005 for ( ; entity != NULL; entity = entity->base.next) {
6006 if (entity->base.symbol == NULL)
6009 if (entity->kind == ENTITY_FUNCTION) {
6010 if (entity->function.btk != BUILTIN_NONE) {
6011 /* builtins have no representation */
6014 create_function(entity);
6015 } else if (entity->kind == ENTITY_VARIABLE) {
6016 assert(entity->declaration.kind
6017 == DECLARATION_KIND_GLOBAL_VARIABLE);
6018 current_ir_graph = get_const_code_irg();
6019 create_variable_initializer(entity);
6024 void init_ast2firm(void)
6026 obstack_init(&asm_obst);
6027 init_atomic_modes();
6029 ir_set_debug_retrieve(dbg_retrieve);
6030 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
6032 /* create idents for all known runtime functions */
6033 for (size_t i = 0; i < lengthof(rts_data); ++i) {
6034 rts_idents[i] = new_id_from_str(rts_data[i].name);
6037 entitymap_init(&entitymap);
6040 static void init_ir_types(void)
6042 static int ir_types_initialized = 0;
6043 if (ir_types_initialized)
6045 ir_types_initialized = 1;
6047 ir_type_char = get_ir_type(type_char);
6049 be_params = be_get_backend_param();
6050 mode_float_arithmetic = be_params->mode_float_arithmetic;
6052 stack_param_align = be_params->stack_param_align;
6055 void exit_ast2firm(void)
6057 entitymap_destroy(&entitymap);
6058 obstack_free(&asm_obst, NULL);
6061 static void global_asm_to_firm(statement_t *s)
6063 for (; s != NULL; s = s->base.next) {
6064 assert(s->kind == STATEMENT_ASM);
6066 char const *const text = s->asms.asm_text.begin;
6067 size_t const size = s->asms.asm_text.size;
6068 ident *const id = new_id_from_chars(text, size);
6073 static const char *get_cwd(void)
6075 static char buf[1024];
6076 if (buf[0] == '\0') {
6077 return getcwd(buf, sizeof(buf));
6082 void translation_unit_to_firm(translation_unit_t *unit)
6084 if (c_mode & _CXX) {
6085 be_dwarf_set_source_language(DW_LANG_C_plus_plus);
6086 } else if (c_mode & _C99) {
6087 be_dwarf_set_source_language(DW_LANG_C99);
6088 } else if (c_mode & _C89) {
6089 be_dwarf_set_source_language(DW_LANG_C89);
6091 be_dwarf_set_source_language(DW_LANG_C);
6093 const char *cwd = get_cwd();
6095 be_dwarf_set_compilation_directory(cwd);
6098 /* initialize firm arithmetic */
6099 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
6100 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
6102 /* just to be sure */
6103 init_jump_target(&break_target, NULL);
6104 init_jump_target(&continue_target, NULL);
6105 current_switch = NULL;
6106 current_translation_unit = unit;
6110 scope_to_firm(&unit->scope);
6111 global_asm_to_firm(unit->global_asm);
6113 current_ir_graph = NULL;
6114 current_translation_unit = NULL;