2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include <libfirm/firm.h>
28 #include <libfirm/adt/obst.h>
29 #include <libfirm/be.h>
33 #include "adt/error.h"
34 #include "adt/array.h"
35 #include "adt/strutil.h"
43 #include "diagnostic.h"
44 #include "lang_features.h"
46 #include "type_hash.h"
51 #include "entitymap_t.h"
52 #include "driver/firm_opt.h"
54 typedef struct trampoline_region trampoline_region;
55 struct trampoline_region {
56 ir_entity *function; /**< The function that is called by this trampoline */
57 ir_entity *region; /**< created region for the trampoline */
60 fp_model_t firm_fp_model = fp_model_precise;
62 static const backend_params *be_params;
64 static ir_type *ir_type_char;
65 static ir_type *ir_type_const_char;
66 static ir_type *ir_type_wchar_t;
67 static ir_type *ir_type_void;
68 static ir_type *ir_type_int;
70 /* architecture specific floating point arithmetic mode (if any) */
71 static ir_mode *mode_float_arithmetic;
73 /* alignment of stack parameters */
74 static unsigned stack_param_align;
76 static int next_value_number_function;
77 static ir_node *continue_label;
78 static ir_node *break_label;
79 static ir_node *current_switch;
80 static bool saw_default_label;
81 static label_t **all_labels;
82 static entity_t **inner_functions;
83 static ir_node *ijmp_list;
84 static bool constant_folding;
86 static const entity_t *current_function_entity;
87 static ir_node *current_function_name;
88 static ir_node *current_funcsig;
89 static ir_graph *current_function;
90 static translation_unit_t *current_translation_unit;
91 static trampoline_region *current_trampolines;
92 static ir_type *current_outer_frame;
93 static ir_node *current_static_link;
94 static ir_entity *current_vararg_entity;
96 static entitymap_t entitymap;
98 static struct obstack asm_obst;
100 typedef enum declaration_kind_t {
101 DECLARATION_KIND_UNKNOWN,
102 DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
103 DECLARATION_KIND_GLOBAL_VARIABLE,
104 DECLARATION_KIND_LOCAL_VARIABLE,
105 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
106 DECLARATION_KIND_PARAMETER,
107 DECLARATION_KIND_PARAMETER_ENTITY,
108 DECLARATION_KIND_FUNCTION,
109 DECLARATION_KIND_COMPOUND_MEMBER,
110 DECLARATION_KIND_INNER_FUNCTION
111 } declaration_kind_t;
113 static ir_type *get_ir_type_incomplete(type_t *type);
115 static void enqueue_inner_function(entity_t *entity)
117 if (inner_functions == NULL)
118 inner_functions = NEW_ARR_F(entity_t *, 0);
119 ARR_APP1(entity_t*, inner_functions, entity);
122 static ir_node *uninitialized_local_var(ir_graph *irg, ir_mode *mode, int pos)
124 const entity_t *entity = get_irg_loc_description(irg, pos);
126 if (entity != NULL) {
127 source_position_t const *const pos = &entity->base.source_position;
128 warningf(WARN_UNINITIALIZED, pos, "'%N' might be used uninitialized", entity);
130 return new_r_Unknown(irg, mode);
133 static const char *dbg_retrieve(const dbg_info *dbg, unsigned *line)
135 const source_position_t *pos = (const source_position_t*) dbg;
140 return pos->input_name;
143 static dbg_info *get_dbg_info(const source_position_t *pos)
145 return (dbg_info*) pos;
148 static void dbg_print_type_dbg_info(char *buffer, size_t buffer_size,
149 const type_dbg_info *dbg)
152 print_to_buffer(buffer, buffer_size);
153 const type_t *type = (const type_t*) dbg;
155 finish_print_to_buffer();
158 static type_dbg_info *get_type_dbg_info_(const type_t *type)
160 return (type_dbg_info*) type;
163 /* is the current block a reachable one? */
164 static bool currently_reachable(void)
166 ir_node *const block = get_cur_block();
167 return block != NULL && !is_Bad(block);
170 static void set_unreachable_now(void)
175 ir_mode *atomic_modes[ATOMIC_TYPE_LAST+1];
177 static ir_node *_expression_to_firm(const expression_t *expression);
178 static ir_node *expression_to_firm(const expression_t *expression);
179 static void create_local_declaration(entity_t *entity);
181 static unsigned decide_modulo_shift(unsigned type_size)
183 if (architecture_modulo_shift == 0)
185 if (type_size < architecture_modulo_shift)
186 return architecture_modulo_shift;
190 static ir_mode *init_atomic_ir_mode(atomic_type_kind_t kind)
192 unsigned flags = get_atomic_type_flags(kind);
193 unsigned size = get_atomic_type_size(kind);
194 if ((flags & ATOMIC_TYPE_FLAG_FLOAT)
195 && !(flags & ATOMIC_TYPE_FLAG_COMPLEX)) {
198 } else if (size == 8) {
201 panic("unexpected kind");
203 } else if (flags & ATOMIC_TYPE_FLAG_INTEGER) {
205 unsigned bit_size = size * 8;
206 bool is_signed = (flags & ATOMIC_TYPE_FLAG_SIGNED) != 0;
207 unsigned modulo_shift = decide_modulo_shift(bit_size);
209 snprintf(name, sizeof(name), "%s%u", is_signed ? "I" : "U", bit_size);
210 return new_int_mode(name, irma_twos_complement, bit_size, is_signed,
218 * Initialises the atomic modes depending on the machine size.
220 static void init_atomic_modes(void)
222 atomic_modes[ATOMIC_TYPE_VOID] = mode_ANY;
223 for (int i = 0; i <= ATOMIC_TYPE_LAST; ++i) {
224 if (atomic_modes[i] != NULL)
226 atomic_modes[i] = init_atomic_ir_mode((atomic_type_kind_t) i);
230 ir_mode *get_atomic_mode(atomic_type_kind_t kind)
232 assert(kind <= ATOMIC_TYPE_LAST);
233 return atomic_modes[kind];
236 static ir_node *get_vla_size(array_type_t *const type)
238 ir_node *size_node = type->size_node;
239 if (size_node == NULL) {
240 size_node = expression_to_firm(type->size_expression);
241 type->size_node = size_node;
246 static unsigned count_parameters(const function_type_t *function_type)
250 function_parameter_t *parameter = function_type->parameters;
251 for ( ; parameter != NULL; parameter = parameter->next) {
259 * Creates a Firm type for an atomic type
261 static ir_type *create_atomic_type(atomic_type_kind_t akind, const type_t *type)
263 ir_mode *mode = atomic_modes[akind];
264 type_dbg_info *dbgi = get_type_dbg_info_(type);
265 ir_type *irtype = new_d_type_primitive(mode, dbgi);
266 il_alignment_t alignment = get_atomic_type_alignment(akind);
268 set_type_size_bytes(irtype, get_atomic_type_size(akind));
269 set_type_alignment_bytes(irtype, alignment);
275 * Creates a Firm type for a complex type
277 static ir_type *create_complex_type(const atomic_type_t *type)
279 atomic_type_kind_t kind = type->akind;
280 ir_mode *mode = atomic_modes[kind];
281 ident *id = get_mode_ident(mode);
285 /* FIXME: finish the array */
290 * Creates a Firm type for an imaginary type
292 static ir_type *create_imaginary_type(const atomic_type_t *type)
294 return create_atomic_type(type->akind, (const type_t*)type);
298 * return type of a parameter (and take transparent union gnu extension into
301 static type_t *get_parameter_type(type_t *orig_type)
303 type_t *type = skip_typeref(orig_type);
304 if (is_type_union(type)
305 && get_type_modifiers(orig_type) & DM_TRANSPARENT_UNION) {
306 compound_t *compound = type->compound.compound;
307 type = compound->members.entities->declaration.type;
313 static ir_type *create_method_type(const function_type_t *function_type, bool for_closure)
315 type_t *return_type = skip_typeref(function_type->return_type);
317 int n_parameters = count_parameters(function_type)
318 + (for_closure ? 1 : 0);
319 int n_results = return_type == type_void ? 0 : 1;
320 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) function_type);
321 ir_type *irtype = new_d_type_method(n_parameters, n_results, dbgi);
323 if (return_type != type_void) {
324 ir_type *restype = get_ir_type(return_type);
325 set_method_res_type(irtype, 0, restype);
328 function_parameter_t *parameter = function_type->parameters;
331 ir_type *p_irtype = get_ir_type(type_void_ptr);
332 set_method_param_type(irtype, n, p_irtype);
335 for ( ; parameter != NULL; parameter = parameter->next) {
336 type_t *type = get_parameter_type(parameter->type);
337 ir_type *p_irtype = get_ir_type(type);
338 set_method_param_type(irtype, n, p_irtype);
342 bool is_variadic = function_type->variadic;
345 set_method_variadicity(irtype, variadicity_variadic);
347 unsigned cc = get_method_calling_convention(irtype);
348 switch (function_type->calling_convention) {
349 case CC_DEFAULT: /* unspecified calling convention, equal to one of the other, typically cdecl */
352 set_method_calling_convention(irtype, SET_CDECL(cc));
359 /* only non-variadic function can use stdcall, else use cdecl */
360 set_method_calling_convention(irtype, SET_STDCALL(cc));
366 /* only non-variadic function can use fastcall, else use cdecl */
367 set_method_calling_convention(irtype, SET_FASTCALL(cc));
371 /* Hmm, leave default, not accepted by the parser yet. */
376 set_method_calling_convention(irtype, get_method_calling_convention(irtype) | cc_this_call);
378 const decl_modifiers_t modifiers = function_type->modifiers;
379 if (modifiers & DM_CONST)
380 add_method_additional_properties(irtype, mtp_property_const);
381 if (modifiers & DM_PURE)
382 add_method_additional_properties(irtype, mtp_property_pure);
383 if (modifiers & DM_RETURNS_TWICE)
384 add_method_additional_properties(irtype, mtp_property_returns_twice);
385 if (modifiers & DM_NORETURN)
386 add_method_additional_properties(irtype, mtp_property_noreturn);
387 if (modifiers & DM_NOTHROW)
388 add_method_additional_properties(irtype, mtp_property_nothrow);
389 if (modifiers & DM_MALLOC)
390 add_method_additional_properties(irtype, mtp_property_malloc);
395 static ir_type *create_pointer_type(pointer_type_t *type)
397 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
398 type_t *points_to = type->points_to;
399 ir_type *ir_points_to = get_ir_type_incomplete(points_to);
400 ir_type *irtype = new_d_type_pointer(ir_points_to, dbgi);
405 static ir_type *create_reference_type(reference_type_t *type)
407 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
408 type_t *refers_to = type->refers_to;
409 ir_type *ir_refers_to = get_ir_type_incomplete(refers_to);
410 ir_type *irtype = new_d_type_pointer(ir_refers_to, dbgi);
415 static ir_type *create_array_type(array_type_t *type)
417 type_dbg_info *dbgi = get_type_dbg_info_((const type_t*) type);
418 type_t *element_type = type->element_type;
419 ir_type *ir_element_type = get_ir_type(element_type);
420 ir_type *irtype = new_d_type_array(1, ir_element_type, dbgi);
422 const int align = get_type_alignment_bytes(ir_element_type);
423 set_type_alignment_bytes(irtype, align);
425 if (type->size_constant) {
426 int n_elements = type->size;
428 set_array_bounds_int(irtype, 0, 0, n_elements);
430 size_t elemsize = get_type_size_bytes(ir_element_type);
431 if (elemsize % align > 0) {
432 elemsize += align - (elemsize % align);
434 set_type_size_bytes(irtype, n_elements * elemsize);
436 set_array_lower_bound_int(irtype, 0, 0);
438 set_type_state(irtype, layout_fixed);
444 * Return the signed integer type of size bits.
446 * @param size the size
448 static ir_type *get_signed_int_type_for_bit_size(ir_type *base_tp,
452 static ir_mode *s_modes[64 + 1] = {NULL, };
456 if (size <= 0 || size > 64)
459 mode = s_modes[size];
463 snprintf(name, sizeof(name), "bf_I%u", size);
464 mode = new_int_mode(name, irma_twos_complement, size, 1, 0);
465 s_modes[size] = mode;
468 type_dbg_info *dbgi = get_type_dbg_info_(type);
469 res = new_d_type_primitive(mode, dbgi);
470 set_primitive_base_type(res, base_tp);
476 * Return the unsigned integer type of size bits.
478 * @param size the size
480 static ir_type *get_unsigned_int_type_for_bit_size(ir_type *base_tp,
484 static ir_mode *u_modes[64 + 1] = {NULL, };
488 if (size <= 0 || size > 64)
491 mode = u_modes[size];
495 snprintf(name, sizeof(name), "bf_U%u", size);
496 mode = new_int_mode(name, irma_twos_complement, size, 0, 0);
497 u_modes[size] = mode;
500 type_dbg_info *dbgi = get_type_dbg_info_(type);
501 res = new_d_type_primitive(mode, dbgi);
502 set_primitive_base_type(res, base_tp);
507 static ir_type *create_bitfield_type(const entity_t *entity)
509 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
510 type_t *base = skip_typeref(entity->declaration.type);
511 assert(base->kind == TYPE_ATOMIC || base->kind == TYPE_ENUM);
512 ir_type *irbase = get_ir_type(base);
514 unsigned bit_size = entity->compound_member.bit_size;
516 assert(!is_type_float(base));
517 if (is_type_signed(base)) {
518 return get_signed_int_type_for_bit_size(irbase, bit_size, base);
520 return get_unsigned_int_type_for_bit_size(irbase, bit_size, base);
524 #define INVALID_TYPE ((ir_type*)-1)
527 COMPOUND_IS_STRUCT = false,
528 COMPOUND_IS_UNION = true
532 * Construct firm type from ast struct type.
534 static ir_type *create_compound_type(compound_type_t *type,
535 bool incomplete, bool is_union)
537 compound_t *compound = type->compound;
539 if (compound->irtype != NULL && (compound->irtype_complete || incomplete)) {
540 return compound->irtype;
543 symbol_t *type_symbol = compound->base.symbol;
545 if (type_symbol != NULL) {
546 id = new_id_from_str(type_symbol->string);
549 id = id_unique("__anonymous_union.%u");
551 id = id_unique("__anonymous_struct.%u");
557 irtype = new_type_union(id);
559 irtype = new_type_struct(id);
562 compound->irtype_complete = false;
563 compound->irtype = irtype;
569 layout_union_type(type);
571 layout_struct_type(type);
574 compound->irtype_complete = true;
576 entity_t *entry = compound->members.entities;
577 for ( ; entry != NULL; entry = entry->base.next) {
578 if (entry->kind != ENTITY_COMPOUND_MEMBER)
581 symbol_t *symbol = entry->base.symbol;
582 type_t *entry_type = entry->declaration.type;
584 if (symbol == NULL) {
585 /* anonymous bitfield member, skip */
586 if (entry->compound_member.bitfield)
588 assert(entry_type->kind == TYPE_COMPOUND_STRUCT
589 || entry_type->kind == TYPE_COMPOUND_UNION);
590 ident = id_unique("anon.%u");
592 ident = new_id_from_str(symbol->string);
595 dbg_info *dbgi = get_dbg_info(&entry->base.source_position);
597 ir_type *entry_irtype;
598 if (entry->compound_member.bitfield) {
599 entry_irtype = create_bitfield_type(entry);
601 entry_irtype = get_ir_type(entry_type);
603 ir_entity *entity = new_d_entity(irtype, ident, entry_irtype, dbgi);
605 set_entity_offset(entity, entry->compound_member.offset);
606 set_entity_offset_bits_remainder(entity,
607 entry->compound_member.bit_offset);
609 assert(entry->declaration.kind == DECLARATION_KIND_UNKNOWN);
610 entry->declaration.kind = DECLARATION_KIND_COMPOUND_MEMBER;
611 entry->compound_member.entity = entity;
614 set_type_alignment_bytes(irtype, compound->alignment);
615 set_type_size_bytes(irtype, compound->size);
616 set_type_state(irtype, layout_fixed);
621 static void determine_enum_values(enum_type_t *const type)
623 ir_mode *const mode = atomic_modes[type->base.akind];
624 ir_tarval *const one = get_mode_one(mode);
625 ir_tarval * tv_next = get_mode_null(mode);
627 bool constant_folding_old = constant_folding;
628 constant_folding = true;
630 enum_t *enume = type->enume;
631 entity_t *entry = enume->base.next;
632 for (; entry != NULL; entry = entry->base.next) {
633 if (entry->kind != ENTITY_ENUM_VALUE)
636 expression_t *const init = entry->enum_value.value;
638 ir_node *const cnst = expression_to_firm(init);
639 if (!is_Const(cnst)) {
640 panic("couldn't fold constant");
642 tv_next = get_Const_tarval(cnst);
644 assert(entry->enum_value.tv == NULL || entry->enum_value.tv == tv_next);
645 entry->enum_value.tv = tv_next;
646 tv_next = tarval_add(tv_next, one);
649 constant_folding = constant_folding_old;
652 static ir_type *create_enum_type(enum_type_t *const type)
654 return create_atomic_type(type->base.akind, (const type_t*) type);
657 static ir_type *get_ir_type_incomplete(type_t *type)
659 assert(type != NULL);
660 type = skip_typeref(type);
662 if (type->base.firm_type != NULL) {
663 assert(type->base.firm_type != INVALID_TYPE);
664 return type->base.firm_type;
667 switch (type->kind) {
668 case TYPE_COMPOUND_STRUCT:
669 return create_compound_type(&type->compound, true, COMPOUND_IS_STRUCT);
670 case TYPE_COMPOUND_UNION:
671 return create_compound_type(&type->compound, true, COMPOUND_IS_UNION);
673 return get_ir_type(type);
677 ir_type *get_ir_type(type_t *type)
679 assert(type != NULL);
681 type = skip_typeref(type);
683 if (type->base.firm_type != NULL) {
684 assert(type->base.firm_type != INVALID_TYPE);
685 return type->base.firm_type;
688 ir_type *firm_type = NULL;
689 switch (type->kind) {
691 /* Happens while constant folding, when there was an error */
692 return create_atomic_type(ATOMIC_TYPE_VOID, NULL);
695 firm_type = create_atomic_type(type->atomic.akind, type);
698 firm_type = create_complex_type(&type->atomic);
701 firm_type = create_imaginary_type(&type->atomic);
704 firm_type = create_method_type(&type->function, false);
707 firm_type = create_pointer_type(&type->pointer);
710 firm_type = create_reference_type(&type->reference);
713 firm_type = create_array_type(&type->array);
715 case TYPE_COMPOUND_STRUCT:
716 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_STRUCT);
718 case TYPE_COMPOUND_UNION:
719 firm_type = create_compound_type(&type->compound, false, COMPOUND_IS_UNION);
722 firm_type = create_enum_type(&type->enumt);
729 if (firm_type == NULL)
730 panic("unknown type found");
732 type->base.firm_type = firm_type;
736 static ir_mode *get_ir_mode_storage(type_t *type)
738 ir_type *irtype = get_ir_type(type);
740 /* firm doesn't report a mode for arrays somehow... */
741 if (is_Array_type(irtype)) {
745 ir_mode *mode = get_type_mode(irtype);
746 assert(mode != NULL);
751 * get arithmetic mode for a type. This is different from get_ir_mode_storage,
752 * int that it returns bigger modes for floating point on some platforms
753 * (x87 internally does arithemtic with 80bits)
755 static ir_mode *get_ir_mode_arithmetic(type_t *type)
757 ir_mode *mode = get_ir_mode_storage(type);
758 if (mode_is_float(mode) && mode_float_arithmetic != NULL) {
759 return mode_float_arithmetic;
766 * Return a node representing the size of a type.
768 static ir_node *get_type_size_node(type_t *type)
771 ir_mode *mode = get_ir_mode_arithmetic(type_size_t);
772 type = skip_typeref(type);
774 if (is_type_array(type) && type->array.is_vla) {
775 ir_node *size_node = get_vla_size(&type->array);
776 ir_node *elem_size = get_type_size_node(type->array.element_type);
777 ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
781 size = get_type_size(type);
782 return new_Const_long(mode, size);
785 /** Names of the runtime functions. */
786 static const struct {
787 int id; /**< the rts id */
788 int n_res; /**< number of return values */
789 const char *name; /**< the name of the rts function */
790 int n_params; /**< number of parameters */
791 unsigned flags; /**< language flags */
793 { rts_debugbreak, 0, "__debugbreak", 0, _MS },
794 { rts_abort, 0, "abort", 0, _C89 },
795 { rts_alloca, 1, "alloca", 1, _ALL },
796 { rts_abs, 1, "abs", 1, _C89 },
797 { rts_labs, 1, "labs", 1, _C89 },
798 { rts_llabs, 1, "llabs", 1, _C99 },
799 { rts_imaxabs, 1, "imaxabs", 1, _C99 },
801 { rts_fabs, 1, "fabs", 1, _C89 },
802 { rts_sqrt, 1, "sqrt", 1, _C89 },
803 { rts_cbrt, 1, "cbrt", 1, _C99 },
804 { rts_exp, 1, "exp", 1, _C89 },
805 { rts_exp2, 1, "exp2", 1, _C89 },
806 { rts_exp10, 1, "exp10", 1, _GNUC },
807 { rts_log, 1, "log", 1, _C89 },
808 { rts_log2, 1, "log2", 1, _C89 },
809 { rts_log10, 1, "log10", 1, _C89 },
810 { rts_pow, 1, "pow", 2, _C89 },
811 { rts_sin, 1, "sin", 1, _C89 },
812 { rts_cos, 1, "cos", 1, _C89 },
813 { rts_tan, 1, "tan", 1, _C89 },
814 { rts_asin, 1, "asin", 1, _C89 },
815 { rts_acos, 1, "acos", 1, _C89 },
816 { rts_atan, 1, "atan", 1, _C89 },
817 { rts_sinh, 1, "sinh", 1, _C89 },
818 { rts_cosh, 1, "cosh", 1, _C89 },
819 { rts_tanh, 1, "tanh", 1, _C89 },
821 { rts_fabsf, 1, "fabsf", 1, _C99 },
822 { rts_sqrtf, 1, "sqrtf", 1, _C99 },
823 { rts_cbrtf, 1, "cbrtf", 1, _C99 },
824 { rts_expf, 1, "expf", 1, _C99 },
825 { rts_exp2f, 1, "exp2f", 1, _C99 },
826 { rts_exp10f, 1, "exp10f", 1, _GNUC },
827 { rts_logf, 1, "logf", 1, _C99 },
828 { rts_log2f, 1, "log2f", 1, _C99 },
829 { rts_log10f, 1, "log10f", 1, _C99 },
830 { rts_powf, 1, "powf", 2, _C99 },
831 { rts_sinf, 1, "sinf", 1, _C99 },
832 { rts_cosf, 1, "cosf", 1, _C99 },
833 { rts_tanf, 1, "tanf", 1, _C99 },
834 { rts_asinf, 1, "asinf", 1, _C99 },
835 { rts_acosf, 1, "acosf", 1, _C99 },
836 { rts_atanf, 1, "atanf", 1, _C99 },
837 { rts_sinhf, 1, "sinhf", 1, _C99 },
838 { rts_coshf, 1, "coshf", 1, _C99 },
839 { rts_tanhf, 1, "tanhf", 1, _C99 },
841 { rts_fabsl, 1, "fabsl", 1, _C99 },
842 { rts_sqrtl, 1, "sqrtl", 1, _C99 },
843 { rts_cbrtl, 1, "cbrtl", 1, _C99 },
844 { rts_expl, 1, "expl", 1, _C99 },
845 { rts_exp2l, 1, "exp2l", 1, _C99 },
846 { rts_exp10l, 1, "exp10l", 1, _GNUC },
847 { rts_logl, 1, "logl", 1, _C99 },
848 { rts_log2l, 1, "log2l", 1, _C99 },
849 { rts_log10l, 1, "log10l", 1, _C99 },
850 { rts_powl, 1, "powl", 2, _C99 },
851 { rts_sinl, 1, "sinl", 1, _C99 },
852 { rts_cosl, 1, "cosl", 1, _C99 },
853 { rts_tanl, 1, "tanl", 1, _C99 },
854 { rts_asinl, 1, "asinl", 1, _C99 },
855 { rts_acosl, 1, "acosl", 1, _C99 },
856 { rts_atanl, 1, "atanl", 1, _C99 },
857 { rts_sinhl, 1, "sinhl", 1, _C99 },
858 { rts_coshl, 1, "coshl", 1, _C99 },
859 { rts_tanhl, 1, "tanhl", 1, _C99 },
861 { rts_strcmp, 1, "strcmp", 2, _C89 },
862 { rts_strncmp, 1, "strncmp", 3, _C89 },
863 { rts_strcpy, 1, "strcpy", 2, _C89 },
864 { rts_strlen, 1, "strlen", 1, _C89 },
865 { rts_memcpy, 1, "memcpy", 3, _C89 },
866 { rts_mempcpy, 1, "mempcpy", 3, _GNUC },
867 { rts_memmove, 1, "memmove", 3, _C89 },
868 { rts_memset, 1, "memset", 3, _C89 },
869 { rts_memcmp, 1, "memcmp", 3, _C89 },
872 static ident *rts_idents[lengthof(rts_data)];
874 static create_ld_ident_func create_ld_ident = create_name_linux_elf;
876 void set_create_ld_ident(ident *(*func)(entity_t*))
878 create_ld_ident = func;
882 * Handle GNU attributes for entities
884 * @param ent the entity
885 * @param decl the routine declaration
887 static void handle_decl_modifiers(ir_entity *irentity, entity_t *entity)
889 assert(is_declaration(entity));
890 decl_modifiers_t modifiers = entity->declaration.modifiers;
892 if (is_method_entity(irentity)) {
893 if (modifiers & DM_PURE) {
894 set_entity_additional_properties(irentity, mtp_property_pure);
896 if (modifiers & DM_CONST) {
897 add_entity_additional_properties(irentity, mtp_property_const);
900 if (modifiers & DM_USED) {
901 add_entity_linkage(irentity, IR_LINKAGE_HIDDEN_USER);
903 if (modifiers & DM_WEAK) {
904 add_entity_linkage(irentity, IR_LINKAGE_WEAK);
908 static bool is_main(entity_t *entity)
910 static symbol_t *sym_main = NULL;
911 if (sym_main == NULL) {
912 sym_main = symbol_table_insert("main");
915 if (entity->base.symbol != sym_main)
917 /* must be in outermost scope */
918 if (entity->base.parent_scope != ¤t_translation_unit->scope)
925 * Creates an entity representing a function.
927 * @param entity the function declaration/definition
928 * @param owner_type the owner type of this function, NULL
929 * for global functions
931 static ir_entity *get_function_entity(entity_t *entity, ir_type *owner_type)
933 assert(entity->kind == ENTITY_FUNCTION);
934 if (entity->function.irentity != NULL)
935 return entity->function.irentity;
937 switch (entity->function.btk) {
940 case BUILTIN_LIBC_CHECK:
946 if (is_main(entity)) {
947 /* force main to C linkage */
948 type_t *type = entity->declaration.type;
949 assert(is_type_function(type));
950 if (type->function.linkage != LINKAGE_C) {
951 type_t *new_type = duplicate_type(type);
952 new_type->function.linkage = LINKAGE_C;
953 type = identify_new_type(new_type);
954 entity->declaration.type = type;
958 symbol_t *symbol = entity->base.symbol;
959 ident *id = new_id_from_str(symbol->string);
961 /* already an entity defined? */
962 ir_entity *irentity = entitymap_get(&entitymap, symbol);
963 bool const has_body = entity->function.statement != NULL;
964 if (irentity != NULL) {
965 if (get_entity_visibility(irentity) == ir_visibility_external
967 set_entity_visibility(irentity, ir_visibility_default);
972 ir_type *ir_type_method;
973 if (entity->function.need_closure)
974 ir_type_method = create_method_type(&entity->declaration.type->function, true);
976 ir_type_method = get_ir_type(entity->declaration.type);
978 bool nested_function = false;
979 if (owner_type == NULL)
980 owner_type = get_glob_type();
982 nested_function = true;
984 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
985 irentity = new_d_entity(owner_type, id, ir_type_method, dbgi);
989 ld_id = id_unique("inner.%u");
991 ld_id = create_ld_ident(entity);
992 set_entity_ld_ident(irentity, ld_id);
994 handle_decl_modifiers(irentity, entity);
996 if (! nested_function) {
997 /* static inline => local
998 * extern inline => local
999 * inline without definition => local
1000 * inline with definition => external_visible */
1001 storage_class_tag_t const storage_class
1002 = (storage_class_tag_t) entity->declaration.storage_class;
1003 bool const is_inline = entity->function.is_inline;
1005 if (is_inline && storage_class == STORAGE_CLASS_NONE && has_body) {
1006 set_entity_visibility(irentity, ir_visibility_default);
1007 } else if (storage_class == STORAGE_CLASS_STATIC ||
1008 (is_inline && has_body)) {
1009 set_entity_visibility(irentity, ir_visibility_local);
1010 } else if (has_body) {
1011 set_entity_visibility(irentity, ir_visibility_default);
1013 set_entity_visibility(irentity, ir_visibility_external);
1016 /* nested functions are always local */
1017 set_entity_visibility(irentity, ir_visibility_local);
1020 /* We should check for file scope here, but as long as we compile C only
1021 this is not needed. */
1022 if (!freestanding && !has_body) {
1023 /* check for a known runtime function */
1024 for (size_t i = 0; i < lengthof(rts_data); ++i) {
1025 if (id != rts_idents[i])
1028 function_type_t *function_type
1029 = &entity->declaration.type->function;
1030 /* rts_entities code can't handle a "wrong" number of parameters */
1031 if (function_type->unspecified_parameters)
1034 /* check number of parameters */
1035 int n_params = count_parameters(function_type);
1036 if (n_params != rts_data[i].n_params)
1039 type_t *return_type = skip_typeref(function_type->return_type);
1040 int n_res = return_type != type_void ? 1 : 0;
1041 if (n_res != rts_data[i].n_res)
1044 /* ignore those rts functions not necessary needed for current mode */
1045 if ((c_mode & rts_data[i].flags) == 0)
1047 assert(rts_entities[rts_data[i].id] == NULL);
1048 rts_entities[rts_data[i].id] = irentity;
1052 entitymap_insert(&entitymap, symbol, irentity);
1055 entity->declaration.kind = DECLARATION_KIND_FUNCTION;
1056 entity->function.irentity = irentity;
1062 * Creates a SymConst for a given entity.
1064 * @param dbgi debug info
1065 * @param entity the entity
1067 static ir_node *create_symconst(dbg_info *dbgi, ir_entity *entity)
1069 assert(entity != NULL);
1070 union symconst_symbol sym;
1071 sym.entity_p = entity;
1072 return new_d_SymConst(dbgi, mode_P, sym, symconst_addr_ent);
1075 static ir_node *create_conv_from_b(dbg_info *dbgi, ir_node *value,
1078 if (is_Const(value)) {
1079 if (is_Const_null(value)) {
1080 return new_Const(get_mode_null(dest_mode));
1082 return new_Const(get_mode_one(dest_mode));
1086 ir_node *cond = new_d_Cond(dbgi, value);
1087 ir_node *proj_true = new_Proj(cond, mode_X, pn_Cond_true);
1088 ir_node *proj_false = new_Proj(cond, mode_X, pn_Cond_false);
1089 ir_node *tblock = new_Block(1, &proj_true);
1090 ir_node *fblock = new_Block(1, &proj_false);
1091 set_cur_block(tblock);
1092 ir_node *const1 = new_Const(get_mode_one(dest_mode));
1093 ir_node *tjump = new_Jmp();
1094 set_cur_block(fblock);
1095 ir_node *const0 = new_Const(get_mode_null(dest_mode));
1096 ir_node *fjump = new_Jmp();
1098 ir_node *in[2] = { tjump, fjump };
1099 ir_node *mergeblock = new_Block(2, in);
1100 set_cur_block(mergeblock);
1101 ir_node *phi_in[2] = { const1, const0 };
1102 ir_node *phi = new_Phi(2, phi_in, dest_mode);
1106 static ir_node *create_conv(dbg_info *dbgi, ir_node *value, ir_mode *dest_mode)
1108 ir_mode *value_mode = get_irn_mode(value);
1110 if (value_mode == dest_mode)
1113 if (dest_mode == mode_b) {
1114 ir_node *zero = new_Const(get_mode_null(value_mode));
1115 ir_node *cmp = new_d_Cmp(dbgi, value, zero, ir_relation_less_greater);
1117 } else if (value_mode == mode_b) {
1118 return create_conv_from_b(dbgi, value, dest_mode);
1121 return new_d_Conv(dbgi, value, dest_mode);
1124 static ir_node *create_Const_from_bool(ir_mode *const mode, bool const v)
1126 return new_Const((v ? get_mode_one : get_mode_null)(mode));
1130 * Creates a SymConst node representing a wide string literal.
1132 * @param literal the wide string literal
1134 static ir_node *wide_string_literal_to_firm(
1135 const string_literal_expression_t *literal)
1137 ir_type *const global_type = get_glob_type();
1138 ir_type *const elem_type = ir_type_wchar_t;
1139 dbg_info *const dbgi = get_dbg_info(&literal->base.source_position);
1140 ir_type *const type = new_type_array(1, elem_type);
1142 ident *const id = id_unique("str.%u");
1143 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1144 set_entity_ld_ident(entity, id);
1145 set_entity_visibility(entity, ir_visibility_private);
1146 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1148 ir_mode *const mode = get_type_mode(elem_type);
1149 const size_t slen = wstrlen(&literal->value);
1151 set_array_lower_bound_int(type, 0, 0);
1152 set_array_upper_bound_int(type, 0, slen);
1153 set_type_size_bytes(type, slen * get_mode_size_bytes(mode));
1154 set_type_state(type, layout_fixed);
1156 ir_initializer_t *initializer = create_initializer_compound(slen);
1157 const char *p = literal->value.begin;
1158 for (size_t i = 0; i < slen; ++i) {
1159 assert(p < literal->value.begin + literal->value.size);
1160 utf32 v = read_utf8_char(&p);
1161 ir_tarval *tv = new_tarval_from_long(v, mode);
1162 ir_initializer_t *val = create_initializer_tarval(tv);
1163 set_initializer_compound_value(initializer, i, val);
1165 set_entity_initializer(entity, initializer);
1167 return create_symconst(dbgi, entity);
1171 * Creates a SymConst node representing a string constant.
1173 * @param src_pos the source position of the string constant
1174 * @param id_prefix a prefix for the name of the generated string constant
1175 * @param value the value of the string constant
1177 static ir_node *string_to_firm(const source_position_t *const src_pos,
1178 const char *const id_prefix,
1179 const string_t *const value)
1181 ir_type *const global_type = get_glob_type();
1182 dbg_info *const dbgi = get_dbg_info(src_pos);
1183 ir_type *const type = new_type_array(1, ir_type_const_char);
1185 ident *const id = id_unique(id_prefix);
1186 ir_entity *const entity = new_d_entity(global_type, id, type, dbgi);
1187 set_entity_ld_ident(entity, id);
1188 set_entity_visibility(entity, ir_visibility_private);
1189 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
1191 ir_type *const elem_type = ir_type_const_char;
1192 ir_mode *const mode = get_type_mode(elem_type);
1194 const char* const string = value->begin;
1195 const size_t slen = value->size;
1197 set_array_lower_bound_int(type, 0, 0);
1198 set_array_upper_bound_int(type, 0, slen);
1199 set_type_size_bytes(type, slen);
1200 set_type_state(type, layout_fixed);
1202 ir_initializer_t *initializer = create_initializer_compound(slen);
1203 for (size_t i = 0; i < slen; ++i) {
1204 ir_tarval *tv = new_tarval_from_long(string[i], mode);
1205 ir_initializer_t *val = create_initializer_tarval(tv);
1206 set_initializer_compound_value(initializer, i, val);
1208 set_entity_initializer(entity, initializer);
1210 return create_symconst(dbgi, entity);
1213 static bool try_create_integer(literal_expression_t *literal,
1214 type_t *type, unsigned char base)
1216 const char *string = literal->value.begin;
1217 size_t size = literal->value.size;
1219 assert(type->kind == TYPE_ATOMIC);
1220 atomic_type_kind_t akind = type->atomic.akind;
1222 ir_mode *mode = atomic_modes[akind];
1223 ir_tarval *tv = new_integer_tarval_from_str(string, size, 1, base, mode);
1224 if (tv == tarval_bad)
1227 literal->base.type = type;
1228 literal->target_value = tv;
1232 static void create_integer_tarval(literal_expression_t *literal)
1236 const string_t *suffix = &literal->suffix;
1238 if (suffix->size > 0) {
1239 for (const char *c = suffix->begin; *c != '\0'; ++c) {
1240 if (*c == 'u' || *c == 'U') { ++us; }
1241 if (*c == 'l' || *c == 'L') { ++ls; }
1246 switch (literal->base.kind) {
1247 case EXPR_LITERAL_INTEGER_OCTAL: base = 8; break;
1248 case EXPR_LITERAL_INTEGER: base = 10; break;
1249 case EXPR_LITERAL_INTEGER_HEXADECIMAL: base = 16; break;
1250 default: panic("invalid literal kind");
1253 tarval_int_overflow_mode_t old_mode = tarval_get_integer_overflow_mode();
1255 /* now try if the constant is small enough for some types */
1256 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
1258 if (us == 0 && try_create_integer(literal, type_int, base))
1260 if ((us == 1 || base != 10)
1261 && try_create_integer(literal, type_unsigned_int, base))
1265 if (us == 0 && try_create_integer(literal, type_long, base))
1267 if ((us == 1 || base != 10)
1268 && try_create_integer(literal, type_unsigned_long, base))
1271 /* last try? then we should not report tarval_bad */
1272 if (us != 1 && base == 10)
1273 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1274 if (us == 0 && try_create_integer(literal, type_long_long, base))
1278 assert(us == 1 || base != 10);
1279 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
1280 bool res = try_create_integer(literal, type_unsigned_long_long, base);
1282 panic("internal error when parsing number literal");
1285 tarval_set_integer_overflow_mode(old_mode);
1288 void determine_literal_type(literal_expression_t *literal)
1290 switch (literal->base.kind) {
1291 case EXPR_LITERAL_INTEGER:
1292 case EXPR_LITERAL_INTEGER_OCTAL:
1293 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1294 create_integer_tarval(literal);
1302 * Creates a Const node representing a constant.
1304 static ir_node *literal_to_firm(const literal_expression_t *literal)
1306 type_t *type = skip_typeref(literal->base.type);
1307 ir_mode *mode = get_ir_mode_storage(type);
1308 const char *string = literal->value.begin;
1309 size_t size = literal->value.size;
1312 switch (literal->base.kind) {
1313 case EXPR_LITERAL_WIDE_CHARACTER: {
1314 utf32 v = read_utf8_char(&string);
1316 size_t len = snprintf(buf, sizeof(buf), UTF32_PRINTF_FORMAT, v);
1318 tv = new_tarval_from_str(buf, len, mode);
1321 case EXPR_LITERAL_CHARACTER: {
1324 = get_atomic_type_flags(ATOMIC_TYPE_CHAR) & ATOMIC_TYPE_FLAG_SIGNED;
1325 if (size == 1 && char_is_signed) {
1326 v = (signed char)string[0];
1329 for (size_t i = 0; i < size; ++i) {
1330 v = (v << 8) | ((unsigned char)string[i]);
1334 size_t len = snprintf(buf, sizeof(buf), "%lld", v);
1336 tv = new_tarval_from_str(buf, len, mode);
1339 case EXPR_LITERAL_INTEGER:
1340 case EXPR_LITERAL_INTEGER_OCTAL:
1341 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
1342 assert(literal->target_value != NULL);
1343 tv = literal->target_value;
1345 case EXPR_LITERAL_FLOATINGPOINT:
1346 tv = new_tarval_from_str(string, size, mode);
1348 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: {
1349 char buffer[size + 2];
1350 memcpy(buffer, "0x", 2);
1351 memcpy(buffer+2, string, size);
1352 tv = new_tarval_from_str(buffer, size+2, mode);
1355 case EXPR_LITERAL_BOOLEAN:
1356 if (string[0] == 't') {
1357 tv = get_mode_one(mode);
1359 assert(string[0] == 'f');
1360 tv = get_mode_null(mode);
1363 case EXPR_LITERAL_MS_NOOP:
1364 tv = get_mode_null(mode);
1369 panic("Invalid literal kind found");
1372 dbg_info *dbgi = get_dbg_info(&literal->base.source_position);
1373 ir_node *res = new_d_Const(dbgi, tv);
1374 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
1375 return create_conv(dbgi, res, mode_arith);
1379 * Allocate an area of size bytes aligned at alignment
1382 static ir_entity *alloc_trampoline(ir_type *frame_type, int size, unsigned alignment)
1384 static unsigned area_cnt = 0;
1387 ir_type *tp = new_type_array(1, ir_type_char);
1388 set_array_bounds_int(tp, 0, 0, size);
1389 set_type_alignment_bytes(tp, alignment);
1391 snprintf(buf, sizeof(buf), "trampolin%u", area_cnt++);
1392 ident *name = new_id_from_str(buf);
1393 ir_entity *area = new_entity(frame_type, name, tp);
1395 /* mark this entity as compiler generated */
1396 set_entity_compiler_generated(area, 1);
1401 * Return a node representing a trampoline region
1402 * for a given function entity.
1404 * @param dbgi debug info
1405 * @param entity the function entity
1407 static ir_node *get_trampoline_region(dbg_info *dbgi, ir_entity *entity)
1409 ir_entity *region = NULL;
1412 if (current_trampolines != NULL) {
1413 for (i = ARR_LEN(current_trampolines) - 1; i >= 0; --i) {
1414 if (current_trampolines[i].function == entity) {
1415 region = current_trampolines[i].region;
1420 current_trampolines = NEW_ARR_F(trampoline_region, 0);
1422 ir_graph *irg = current_ir_graph;
1423 if (region == NULL) {
1424 /* create a new region */
1425 ir_type *frame_tp = get_irg_frame_type(irg);
1426 trampoline_region reg;
1427 reg.function = entity;
1429 reg.region = alloc_trampoline(frame_tp,
1430 be_params->trampoline_size,
1431 be_params->trampoline_align);
1432 ARR_APP1(trampoline_region, current_trampolines, reg);
1433 region = reg.region;
1435 return new_d_simpleSel(dbgi, get_irg_no_mem(irg), get_irg_frame(irg),
1440 * Creates a trampoline for a function represented by an entity.
1442 * @param dbgi debug info
1443 * @param mode the (reference) mode for the function address
1444 * @param entity the function entity
1446 static ir_node *create_trampoline(dbg_info *dbgi, ir_mode *mode,
1449 assert(entity != NULL);
1451 in[0] = get_trampoline_region(dbgi, entity);
1452 in[1] = create_symconst(dbgi, entity);
1453 in[2] = get_irg_frame(current_ir_graph);
1455 ir_node *irn = new_d_Builtin(dbgi, get_store(), 3, in, ir_bk_inner_trampoline, get_unknown_type());
1456 set_store(new_Proj(irn, mode_M, pn_Builtin_M));
1457 return new_Proj(irn, mode, pn_Builtin_max+1);
1461 * Dereference an address.
1463 * @param dbgi debug info
1464 * @param type the type of the dereferenced result (the points_to type)
1465 * @param addr the address to dereference
1467 static ir_node *deref_address(dbg_info *const dbgi, type_t *const type,
1468 ir_node *const addr)
1470 type_t *skipped = skip_typeref(type);
1471 if (is_type_incomplete(skipped))
1474 ir_type *irtype = get_ir_type(skipped);
1475 if (is_compound_type(irtype)
1476 || is_Method_type(irtype)
1477 || is_Array_type(irtype)) {
1481 ir_cons_flags flags = skipped->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1482 ? cons_volatile : cons_none;
1483 ir_mode *const mode = get_type_mode(irtype);
1484 ir_node *const memory = get_store();
1485 ir_node *const load = new_d_Load(dbgi, memory, addr, mode, flags);
1486 ir_node *const load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
1487 ir_node *const load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
1489 set_store(load_mem);
1491 ir_mode *const mode_arithmetic = get_ir_mode_arithmetic(skipped);
1492 return create_conv(dbgi, load_res, mode_arithmetic);
1496 * Creates a strict Conv (to the node's mode) if necessary.
1498 * @param dbgi debug info
1499 * @param node the node to strict conv
1501 static ir_node *do_strict_conv(dbg_info *dbgi, ir_node *node)
1503 ir_mode *mode = get_irn_mode(node);
1505 if (!(get_irg_fp_model(current_ir_graph) & fp_explicit_rounding))
1507 if (!mode_is_float(mode))
1510 /* check if there is already a Conv */
1511 if (is_Conv(node)) {
1512 /* convert it into a strict Conv */
1513 set_Conv_strict(node, 1);
1517 /* otherwise create a new one */
1518 return new_d_strictConv(dbgi, node, mode);
1522 * Returns the correct base address depending on whether it is a parameter or a
1523 * normal local variable.
1525 static ir_node *get_local_frame(ir_entity *const ent)
1527 ir_graph *const irg = current_ir_graph;
1528 const ir_type *const owner = get_entity_owner(ent);
1529 if (owner == current_outer_frame) {
1530 assert(current_static_link != NULL);
1531 return current_static_link;
1533 return get_irg_frame(irg);
1538 * Keep all memory edges of the given block.
1540 static void keep_all_memory(ir_node *block)
1542 ir_node *old = get_cur_block();
1544 set_cur_block(block);
1545 keep_alive(get_store());
1546 /* TODO: keep all memory edges from restricted pointers */
1550 static ir_node *reference_expression_enum_value_to_firm(
1551 const reference_expression_t *ref)
1553 entity_t *entity = ref->entity;
1554 if (entity->enum_value.tv == NULL) {
1555 type_t *type = skip_typeref(entity->enum_value.enum_type);
1556 assert(type->kind == TYPE_ENUM);
1557 determine_enum_values(&type->enumt);
1560 return new_Const(entity->enum_value.tv);
1563 static ir_node *reference_expression_to_firm(const reference_expression_t *ref)
1565 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1566 entity_t *entity = ref->entity;
1567 assert(is_declaration(entity));
1568 type_t *type = skip_typeref(entity->declaration.type);
1570 /* make sure the type is constructed */
1571 (void) get_ir_type(type);
1573 if (entity->kind == ENTITY_FUNCTION
1574 && entity->function.btk != BUILTIN_NONE) {
1575 ir_entity *irentity = get_function_entity(entity, NULL);
1576 /* for gcc compatibility we have to produce (dummy) addresses for some
1577 * builtins which don't have entities */
1578 if (irentity == NULL) {
1579 source_position_t const *const pos = &ref->base.source_position;
1580 symbol_t const *const sym = ref->entity->base.symbol;
1581 warningf(WARN_OTHER, pos, "taking address of builtin '%Y'", sym);
1583 /* simply create a NULL pointer */
1584 ir_mode *mode = get_ir_mode_arithmetic(type_void_ptr);
1585 ir_node *res = new_Const(get_mode_null(mode));
1591 switch ((declaration_kind_t) entity->declaration.kind) {
1592 case DECLARATION_KIND_UNKNOWN:
1595 case DECLARATION_KIND_LOCAL_VARIABLE: {
1596 ir_mode *const mode = get_ir_mode_storage(type);
1597 ir_node *const value = get_value(entity->variable.v.value_number, mode);
1598 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1600 case DECLARATION_KIND_PARAMETER: {
1601 ir_mode *const mode = get_ir_mode_storage(type);
1602 ir_node *const value = get_value(entity->parameter.v.value_number,mode);
1603 return create_conv(NULL, value, get_ir_mode_arithmetic(type));
1605 case DECLARATION_KIND_FUNCTION: {
1606 return create_symconst(dbgi, entity->function.irentity);
1608 case DECLARATION_KIND_INNER_FUNCTION: {
1609 ir_mode *const mode = get_ir_mode_storage(type);
1610 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1611 /* inner function not using the closure */
1612 return create_symconst(dbgi, entity->function.irentity);
1614 /* need trampoline here */
1615 return create_trampoline(dbgi, mode, entity->function.irentity);
1618 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1619 const variable_t *variable = &entity->variable;
1620 ir_node *const addr = create_symconst(dbgi, variable->v.entity);
1621 return deref_address(dbgi, variable->base.type, addr);
1624 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1625 ir_entity *irentity = entity->variable.v.entity;
1626 ir_node *frame = get_local_frame(irentity);
1627 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1628 return deref_address(dbgi, entity->declaration.type, sel);
1630 case DECLARATION_KIND_PARAMETER_ENTITY: {
1631 ir_entity *irentity = entity->parameter.v.entity;
1632 ir_node *frame = get_local_frame(irentity);
1633 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1634 return deref_address(dbgi, entity->declaration.type, sel);
1637 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1638 return entity->variable.v.vla_base;
1640 case DECLARATION_KIND_COMPOUND_MEMBER:
1641 panic("not implemented reference type");
1644 panic("reference to declaration with unknown type found");
1647 static ir_node *reference_addr(const reference_expression_t *ref)
1649 dbg_info *dbgi = get_dbg_info(&ref->base.source_position);
1650 entity_t *entity = ref->entity;
1651 assert(is_declaration(entity));
1653 switch((declaration_kind_t) entity->declaration.kind) {
1654 case DECLARATION_KIND_UNKNOWN:
1656 case DECLARATION_KIND_PARAMETER:
1657 case DECLARATION_KIND_LOCAL_VARIABLE:
1658 /* you can store to a local variable (so we don't panic but return NULL
1659 * as an indicator for no real address) */
1661 case DECLARATION_KIND_GLOBAL_VARIABLE: {
1662 ir_node *const addr = create_symconst(dbgi, entity->variable.v.entity);
1665 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY: {
1666 ir_entity *irentity = entity->variable.v.entity;
1667 ir_node *frame = get_local_frame(irentity);
1668 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1672 case DECLARATION_KIND_PARAMETER_ENTITY: {
1673 ir_entity *irentity = entity->parameter.v.entity;
1674 ir_node *frame = get_local_frame(irentity);
1675 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, irentity);
1680 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
1681 return entity->variable.v.vla_base;
1683 case DECLARATION_KIND_FUNCTION: {
1684 return create_symconst(dbgi, entity->function.irentity);
1687 case DECLARATION_KIND_INNER_FUNCTION: {
1688 type_t *const type = skip_typeref(entity->declaration.type);
1689 ir_mode *const mode = get_ir_mode_storage(type);
1690 if (!entity->function.goto_to_outer && !entity->function.need_closure) {
1691 /* inner function not using the closure */
1692 return create_symconst(dbgi, entity->function.irentity);
1694 /* need trampoline here */
1695 return create_trampoline(dbgi, mode, entity->function.irentity);
1699 case DECLARATION_KIND_COMPOUND_MEMBER:
1700 panic("not implemented reference type");
1703 panic("reference to declaration with unknown type found");
1707 * Transform calls to builtin functions.
1709 static ir_node *process_builtin_call(const call_expression_t *call)
1711 dbg_info *dbgi = get_dbg_info(&call->base.source_position);
1713 assert(call->function->kind == EXPR_REFERENCE);
1714 reference_expression_t *builtin = &call->function->reference;
1716 type_t *expr_type = skip_typeref(builtin->base.type);
1717 assert(is_type_pointer(expr_type));
1719 type_t *function_type = skip_typeref(expr_type->pointer.points_to);
1721 switch (builtin->entity->function.btk) {
1724 case BUILTIN_ALLOCA: {
1725 expression_t *argument = call->arguments->expression;
1726 ir_node *size = expression_to_firm(argument);
1728 ir_node *store = get_store();
1729 ir_node *alloca = new_d_Alloc(dbgi, store, size, get_unknown_type(),
1731 ir_node *proj_m = new_Proj(alloca, mode_M, pn_Alloc_M);
1733 ir_node *res = new_Proj(alloca, mode_P_data, pn_Alloc_res);
1738 type_t *type = function_type->function.return_type;
1739 ir_mode *mode = get_ir_mode_arithmetic(type);
1740 ir_tarval *tv = get_mode_infinite(mode);
1741 ir_node *res = new_d_Const(dbgi, tv);
1745 /* Ignore string for now... */
1746 assert(is_type_function(function_type));
1747 type_t *type = function_type->function.return_type;
1748 ir_mode *mode = get_ir_mode_arithmetic(type);
1749 ir_tarval *tv = get_mode_NAN(mode);
1750 ir_node *res = new_d_Const(dbgi, tv);
1753 case BUILTIN_EXPECT: {
1754 expression_t *argument = call->arguments->expression;
1755 return _expression_to_firm(argument);
1757 case BUILTIN_VA_END:
1758 /* evaluate the argument of va_end for its side effects */
1759 _expression_to_firm(call->arguments->expression);
1761 case BUILTIN_OBJECT_SIZE: {
1762 /* determine value of "type" */
1763 expression_t *type_expression = call->arguments->next->expression;
1764 long type_val = fold_constant_to_int(type_expression);
1765 type_t *type = function_type->function.return_type;
1766 ir_mode *mode = get_ir_mode_arithmetic(type);
1767 /* just produce a "I don't know" result */
1768 ir_tarval *result = type_val & 2 ? get_mode_null(mode) :
1769 get_mode_minus_one(mode);
1771 return new_d_Const(dbgi, result);
1773 case BUILTIN_ROTL: {
1774 ir_node *val = expression_to_firm(call->arguments->expression);
1775 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1776 ir_mode *mode = get_irn_mode(val);
1777 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1778 return new_d_Rotl(dbgi, val, create_conv(dbgi, shf, mode_uint), mode);
1780 case BUILTIN_ROTR: {
1781 ir_node *val = expression_to_firm(call->arguments->expression);
1782 ir_node *shf = expression_to_firm(call->arguments->next->expression);
1783 ir_mode *mode = get_irn_mode(val);
1784 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1785 ir_node *c = new_Const_long(mode_uint, get_mode_size_bits(mode));
1786 ir_node *sub = new_d_Sub(dbgi, c, create_conv(dbgi, shf, mode_uint), mode_uint);
1787 return new_d_Rotl(dbgi, val, sub, mode);
1792 case BUILTIN_LIBC_CHECK:
1793 panic("builtin did not produce an entity");
1795 panic("invalid builtin found");
1799 * Transform a call expression.
1800 * Handles some special cases, like alloca() calls, which must be resolved
1801 * BEFORE the inlines runs. Inlining routines calling alloca() is dangerous,
1802 * 176.gcc for instance might allocate 2GB instead of 256 MB if alloca is not
1805 static ir_node *call_expression_to_firm(const call_expression_t *const call)
1807 dbg_info *const dbgi = get_dbg_info(&call->base.source_position);
1808 assert(currently_reachable());
1810 expression_t *function = call->function;
1811 ir_node *callee = NULL;
1812 bool firm_builtin = false;
1813 ir_builtin_kind firm_builtin_kind = ir_bk_trap;
1814 if (function->kind == EXPR_REFERENCE) {
1815 const reference_expression_t *ref = &function->reference;
1816 entity_t *entity = ref->entity;
1818 if (entity->kind == ENTITY_FUNCTION) {
1819 builtin_kind_t builtin = entity->function.btk;
1820 if (builtin == BUILTIN_FIRM) {
1821 firm_builtin = true;
1822 firm_builtin_kind = entity->function.b.firm_builtin_kind;
1823 } else if (builtin != BUILTIN_NONE && builtin != BUILTIN_LIBC
1824 && builtin != BUILTIN_LIBC_CHECK) {
1825 return process_builtin_call(call);
1830 callee = expression_to_firm(function);
1832 type_t *type = skip_typeref(function->base.type);
1833 assert(is_type_pointer(type));
1834 pointer_type_t *pointer_type = &type->pointer;
1835 type_t *points_to = skip_typeref(pointer_type->points_to);
1836 assert(is_type_function(points_to));
1837 function_type_t *function_type = &points_to->function;
1839 int n_parameters = 0;
1840 ir_type *ir_method_type = get_ir_type((type_t*) function_type);
1841 ir_type *new_method_type = NULL;
1842 if (function_type->variadic || function_type->unspecified_parameters) {
1843 const call_argument_t *argument = call->arguments;
1844 for ( ; argument != NULL; argument = argument->next) {
1848 /* we need to construct a new method type matching the call
1850 type_dbg_info *tdbgi = get_type_dbg_info_((const type_t*) function_type);
1851 int n_res = get_method_n_ress(ir_method_type);
1852 new_method_type = new_d_type_method(n_parameters, n_res, tdbgi);
1853 set_method_calling_convention(new_method_type,
1854 get_method_calling_convention(ir_method_type));
1855 set_method_additional_properties(new_method_type,
1856 get_method_additional_properties(ir_method_type));
1857 set_method_variadicity(new_method_type,
1858 get_method_variadicity(ir_method_type));
1860 for (int i = 0; i < n_res; ++i) {
1861 set_method_res_type(new_method_type, i,
1862 get_method_res_type(ir_method_type, i));
1864 argument = call->arguments;
1865 for (int i = 0; i < n_parameters; ++i, argument = argument->next) {
1866 expression_t *expression = argument->expression;
1867 ir_type *irtype = get_ir_type(expression->base.type);
1868 set_method_param_type(new_method_type, i, irtype);
1870 ir_method_type = new_method_type;
1872 n_parameters = get_method_n_params(ir_method_type);
1875 ir_node *in[n_parameters];
1877 const call_argument_t *argument = call->arguments;
1878 for (int n = 0; n < n_parameters; ++n) {
1879 expression_t *expression = argument->expression;
1880 ir_node *arg_node = expression_to_firm(expression);
1882 type_t *arg_type = skip_typeref(expression->base.type);
1883 if (!is_type_compound(arg_type)) {
1884 ir_mode *mode = get_ir_mode_storage(expression->base.type);
1885 arg_node = create_conv(dbgi, arg_node, mode);
1886 arg_node = do_strict_conv(dbgi, arg_node);
1891 argument = argument->next;
1895 if (function_type->modifiers & DM_CONST) {
1896 store = get_irg_no_mem(current_ir_graph);
1898 store = get_store();
1902 type_t *return_type = skip_typeref(function_type->return_type);
1903 ir_node *result = NULL;
1905 node = new_d_Builtin(dbgi, store, n_parameters, in, firm_builtin_kind,
1907 if (! (function_type->modifiers & DM_CONST)) {
1908 ir_node *mem = new_Proj(node, mode_M, pn_Builtin_M);
1912 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1913 assert(is_type_scalar(return_type));
1914 ir_mode *mode = get_ir_mode_storage(return_type);
1915 result = new_Proj(node, mode, pn_Builtin_max+1);
1916 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1917 result = create_conv(NULL, result, mode_arith);
1920 node = new_d_Call(dbgi, store, callee, n_parameters, in, ir_method_type);
1921 if (! (function_type->modifiers & DM_CONST)) {
1922 ir_node *mem = new_Proj(node, mode_M, pn_Call_M);
1926 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
1927 ir_node *resproj = new_Proj(node, mode_T, pn_Call_T_result);
1929 if (is_type_scalar(return_type)) {
1930 ir_mode *mode = get_ir_mode_storage(return_type);
1931 result = new_Proj(resproj, mode, 0);
1932 ir_mode *mode_arith = get_ir_mode_arithmetic(return_type);
1933 result = create_conv(NULL, result, mode_arith);
1935 ir_mode *mode = mode_P_data;
1936 result = new_Proj(resproj, mode, 0);
1941 if (function_type->modifiers & DM_NORETURN) {
1942 /* A dead end: Keep the Call and the Block. Also place all further
1943 * nodes into a new and unreachable block. */
1945 keep_alive(get_cur_block());
1946 ir_node *block = new_Block(0, NULL);
1947 set_cur_block(block);
1953 static void statement_to_firm(statement_t *statement);
1954 static ir_node *compound_statement_to_firm(compound_statement_t *compound);
1956 static ir_node *expression_to_addr(const expression_t *expression);
1957 static ir_node *create_condition_evaluation(const expression_t *expression,
1958 ir_node *true_block,
1959 ir_node *false_block);
1961 static void assign_value(dbg_info *dbgi, ir_node *addr, type_t *type,
1964 if (!is_type_compound(type)) {
1965 ir_mode *mode = get_ir_mode_storage(type);
1966 value = create_conv(dbgi, value, mode);
1967 value = do_strict_conv(dbgi, value);
1970 ir_node *memory = get_store();
1972 if (is_type_scalar(type)) {
1973 ir_cons_flags flags = type->base.qualifiers & TYPE_QUALIFIER_VOLATILE
1974 ? cons_volatile : cons_none;
1975 ir_node *store = new_d_Store(dbgi, memory, addr, value, flags);
1976 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
1977 set_store(store_mem);
1979 ir_type *irtype = get_ir_type(type);
1980 ir_node *copyb = new_d_CopyB(dbgi, memory, addr, value, irtype);
1981 ir_node *copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
1982 set_store(copyb_mem);
1986 static ir_tarval *create_bitfield_mask(ir_mode *mode, int offset, int size)
1988 ir_tarval *all_one = get_mode_all_one(mode);
1989 int mode_size = get_mode_size_bits(mode);
1990 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
1992 assert(offset >= 0);
1994 assert(offset + size <= mode_size);
1995 if (size == mode_size) {
1999 long shiftr = get_mode_size_bits(mode) - size;
2000 long shiftl = offset;
2001 ir_tarval *tv_shiftr = new_tarval_from_long(shiftr, mode_uint);
2002 ir_tarval *tv_shiftl = new_tarval_from_long(shiftl, mode_uint);
2003 ir_tarval *mask0 = tarval_shr(all_one, tv_shiftr);
2004 ir_tarval *mask1 = tarval_shl(mask0, tv_shiftl);
2009 static ir_node *bitfield_store_to_firm(dbg_info *dbgi,
2010 ir_entity *entity, ir_node *addr, ir_node *value, bool set_volatile,
2013 ir_type *entity_type = get_entity_type(entity);
2014 ir_type *base_type = get_primitive_base_type(entity_type);
2015 ir_mode *mode = get_type_mode(base_type);
2016 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2018 value = create_conv(dbgi, value, mode);
2020 /* kill upper bits of value and shift to right position */
2021 unsigned bitoffset = get_entity_offset_bits_remainder(entity);
2022 unsigned bitsize = get_mode_size_bits(get_type_mode(entity_type));
2023 unsigned base_bits = get_mode_size_bits(mode);
2024 unsigned shiftwidth = base_bits - bitsize;
2026 ir_node *shiftcount = new_Const_long(mode_uint, shiftwidth);
2027 ir_node *shiftl = new_d_Shl(dbgi, value, shiftcount, mode);
2029 unsigned shrwidth = base_bits - bitsize - bitoffset;
2030 ir_node *shrconst = new_Const_long(mode_uint, shrwidth);
2031 ir_node *shiftr = new_d_Shr(dbgi, shiftl, shrconst, mode);
2033 /* load current value */
2034 ir_node *mem = get_store();
2035 ir_node *load = new_d_Load(dbgi, mem, addr, mode,
2036 set_volatile ? cons_volatile : cons_none);
2037 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2038 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2039 ir_tarval *shift_mask = create_bitfield_mask(mode, bitoffset, bitsize);
2040 ir_tarval *inv_mask = tarval_not(shift_mask);
2041 ir_node *inv_mask_node = new_d_Const(dbgi, inv_mask);
2042 ir_node *load_res_masked = new_d_And(dbgi, load_res, inv_mask_node, mode);
2044 /* construct new value and store */
2045 ir_node *new_val = new_d_Or(dbgi, load_res_masked, shiftr, mode);
2046 ir_node *store = new_d_Store(dbgi, load_mem, addr, new_val,
2047 set_volatile ? cons_volatile : cons_none);
2048 ir_node *store_mem = new_d_Proj(dbgi, store, mode_M, pn_Store_M);
2049 set_store(store_mem);
2055 ir_node *count_res_shr = new_Const_long(mode_uint, base_bits - bitsize);
2056 if (mode_is_signed(mode)) {
2057 res_shr = new_d_Shrs(dbgi, shiftl, count_res_shr, mode);
2059 res_shr = new_d_Shr(dbgi, shiftl, count_res_shr, mode);
2064 static ir_node *bitfield_extract_to_firm(const select_expression_t *expression,
2067 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2068 entity_t *entity = expression->compound_entry;
2069 type_t *base_type = entity->declaration.type;
2070 ir_mode *mode = get_ir_mode_storage(base_type);
2071 ir_node *mem = get_store();
2072 ir_node *load = new_d_Load(dbgi, mem, addr, mode, cons_none);
2073 ir_node *load_mem = new_d_Proj(dbgi, load, mode_M, pn_Load_M);
2074 ir_node *load_res = new_d_Proj(dbgi, load, mode, pn_Load_res);
2075 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
2077 ir_mode *amode = mode;
2078 /* optimisation, since shifting in modes < machine_size is usually
2080 if (get_mode_size_bits(amode) < get_mode_size_bits(mode_uint)) {
2083 unsigned amode_size = get_mode_size_bits(amode);
2084 load_res = create_conv(dbgi, load_res, amode);
2086 set_store(load_mem);
2088 /* kill upper bits */
2089 assert(expression->compound_entry->kind == ENTITY_COMPOUND_MEMBER);
2090 unsigned bitoffset = entity->compound_member.bit_offset;
2091 unsigned bitsize = entity->compound_member.bit_size;
2092 unsigned shift_bitsl = amode_size - bitoffset - bitsize;
2093 ir_tarval *tvl = new_tarval_from_long((long)shift_bitsl, mode_uint);
2094 ir_node *countl = new_d_Const(dbgi, tvl);
2095 ir_node *shiftl = new_d_Shl(dbgi, load_res, countl, amode);
2097 unsigned shift_bitsr = bitoffset + shift_bitsl;
2098 assert(shift_bitsr <= amode_size);
2099 ir_tarval *tvr = new_tarval_from_long((long)shift_bitsr, mode_uint);
2100 ir_node *countr = new_d_Const(dbgi, tvr);
2102 if (mode_is_signed(mode)) {
2103 shiftr = new_d_Shrs(dbgi, shiftl, countr, amode);
2105 shiftr = new_d_Shr(dbgi, shiftl, countr, amode);
2108 type_t *type = expression->base.type;
2109 ir_mode *resmode = get_ir_mode_arithmetic(type);
2110 return create_conv(dbgi, shiftr, resmode);
2113 /* make sure the selected compound type is constructed */
2114 static void construct_select_compound(const select_expression_t *expression)
2116 type_t *type = skip_typeref(expression->compound->base.type);
2117 if (is_type_pointer(type)) {
2118 type = type->pointer.points_to;
2120 (void) get_ir_type(type);
2123 static ir_node *set_value_for_expression_addr(const expression_t *expression,
2124 ir_node *value, ir_node *addr)
2126 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2127 type_t *type = skip_typeref(expression->base.type);
2129 if (!is_type_compound(type)) {
2130 ir_mode *mode = get_ir_mode_storage(type);
2131 value = create_conv(dbgi, value, mode);
2132 value = do_strict_conv(dbgi, value);
2135 if (expression->kind == EXPR_REFERENCE) {
2136 const reference_expression_t *ref = &expression->reference;
2138 entity_t *entity = ref->entity;
2139 assert(is_declaration(entity));
2140 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2141 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2142 set_value(entity->variable.v.value_number, value);
2144 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2145 set_value(entity->parameter.v.value_number, value);
2151 addr = expression_to_addr(expression);
2152 assert(addr != NULL);
2154 if (expression->kind == EXPR_SELECT) {
2155 const select_expression_t *select = &expression->select;
2157 construct_select_compound(select);
2159 entity_t *entity = select->compound_entry;
2160 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
2161 if (entity->compound_member.bitfield) {
2162 ir_entity *irentity = entity->compound_member.entity;
2164 = select->base.type->base.qualifiers & TYPE_QUALIFIER_VOLATILE;
2165 value = bitfield_store_to_firm(dbgi, irentity, addr, value,
2166 set_volatile, true);
2171 assign_value(dbgi, addr, type, value);
2175 static void set_value_for_expression(const expression_t *expression,
2178 set_value_for_expression_addr(expression, value, NULL);
2181 static ir_node *get_value_from_lvalue(const expression_t *expression,
2184 if (expression->kind == EXPR_REFERENCE) {
2185 const reference_expression_t *ref = &expression->reference;
2187 entity_t *entity = ref->entity;
2188 assert(entity->kind == ENTITY_VARIABLE
2189 || entity->kind == ENTITY_PARAMETER);
2190 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2192 if (entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE) {
2193 value_number = entity->variable.v.value_number;
2194 assert(addr == NULL);
2195 type_t *type = skip_typeref(expression->base.type);
2196 ir_mode *mode = get_ir_mode_storage(type);
2197 ir_node *res = get_value(value_number, mode);
2198 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2199 } else if (entity->declaration.kind == DECLARATION_KIND_PARAMETER) {
2200 value_number = entity->parameter.v.value_number;
2201 assert(addr == NULL);
2202 type_t *type = skip_typeref(expression->base.type);
2203 ir_mode *mode = get_ir_mode_storage(type);
2204 ir_node *res = get_value(value_number, mode);
2205 return create_conv(NULL, res, get_ir_mode_arithmetic(type));
2209 assert(addr != NULL);
2210 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2213 if (expression->kind == EXPR_SELECT &&
2214 expression->select.compound_entry->compound_member.bitfield) {
2215 construct_select_compound(&expression->select);
2216 value = bitfield_extract_to_firm(&expression->select, addr);
2218 value = deref_address(dbgi, expression->base.type, addr);
2225 static ir_node *create_incdec(const unary_expression_t *expression)
2227 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2228 const expression_t *value_expr = expression->value;
2229 ir_node *addr = expression_to_addr(value_expr);
2230 ir_node *value = get_value_from_lvalue(value_expr, addr);
2232 type_t *type = skip_typeref(expression->base.type);
2233 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2236 if (is_type_pointer(type)) {
2237 pointer_type_t *pointer_type = &type->pointer;
2238 offset = get_type_size_node(pointer_type->points_to);
2240 assert(is_type_arithmetic(type));
2241 offset = new_Const(get_mode_one(mode));
2245 ir_node *store_value;
2246 switch(expression->base.kind) {
2247 case EXPR_UNARY_POSTFIX_INCREMENT:
2249 store_value = new_d_Add(dbgi, value, offset, mode);
2251 case EXPR_UNARY_POSTFIX_DECREMENT:
2253 store_value = new_d_Sub(dbgi, value, offset, mode);
2255 case EXPR_UNARY_PREFIX_INCREMENT:
2256 result = new_d_Add(dbgi, value, offset, mode);
2257 store_value = result;
2259 case EXPR_UNARY_PREFIX_DECREMENT:
2260 result = new_d_Sub(dbgi, value, offset, mode);
2261 store_value = result;
2264 panic("no incdec expr in create_incdec");
2267 set_value_for_expression_addr(value_expr, store_value, addr);
2272 static bool is_local_variable(expression_t *expression)
2274 if (expression->kind != EXPR_REFERENCE)
2276 reference_expression_t *ref_expr = &expression->reference;
2277 entity_t *entity = ref_expr->entity;
2278 if (entity->kind != ENTITY_VARIABLE)
2280 assert(entity->declaration.kind != DECLARATION_KIND_UNKNOWN);
2281 return entity->declaration.kind == DECLARATION_KIND_LOCAL_VARIABLE;
2284 static ir_relation get_relation(const expression_kind_t kind)
2287 case EXPR_BINARY_EQUAL: return ir_relation_equal;
2288 case EXPR_BINARY_ISLESSGREATER: return ir_relation_less_greater;
2289 case EXPR_BINARY_NOTEQUAL: return ir_relation_unordered_less_greater;
2290 case EXPR_BINARY_ISLESS:
2291 case EXPR_BINARY_LESS: return ir_relation_less;
2292 case EXPR_BINARY_ISLESSEQUAL:
2293 case EXPR_BINARY_LESSEQUAL: return ir_relation_less_equal;
2294 case EXPR_BINARY_ISGREATER:
2295 case EXPR_BINARY_GREATER: return ir_relation_greater;
2296 case EXPR_BINARY_ISGREATEREQUAL:
2297 case EXPR_BINARY_GREATEREQUAL: return ir_relation_greater_equal;
2298 case EXPR_BINARY_ISUNORDERED: return ir_relation_unordered;
2303 panic("trying to get pn_Cmp from non-comparison binexpr type");
2307 * Handle the assume optimizer hint: check if a Confirm
2308 * node can be created.
2310 * @param dbi debug info
2311 * @param expr the IL assume expression
2313 * we support here only some simple cases:
2318 static ir_node *handle_assume_compare(dbg_info *dbi,
2319 const binary_expression_t *expression)
2321 expression_t *op1 = expression->left;
2322 expression_t *op2 = expression->right;
2323 entity_t *var2, *var = NULL;
2324 ir_node *res = NULL;
2325 ir_relation relation = get_relation(expression->base.kind);
2327 if (is_local_variable(op1) && is_local_variable(op2)) {
2328 var = op1->reference.entity;
2329 var2 = op2->reference.entity;
2331 type_t *const type = skip_typeref(var->declaration.type);
2332 ir_mode *const mode = get_ir_mode_storage(type);
2334 ir_node *const irn1 = get_value(var->variable.v.value_number, mode);
2335 ir_node *const irn2 = get_value(var2->variable.v.value_number, mode);
2337 res = new_d_Confirm(dbi, irn2, irn1, get_inversed_relation(relation));
2338 set_value(var2->variable.v.value_number, res);
2340 res = new_d_Confirm(dbi, irn1, irn2, relation);
2341 set_value(var->variable.v.value_number, res);
2346 expression_t *con = NULL;
2347 if (is_local_variable(op1) && is_constant_expression(op2) == EXPR_CLASS_CONSTANT) {
2348 var = op1->reference.entity;
2350 } else if (is_constant_expression(op1) == EXPR_CLASS_CONSTANT && is_local_variable(op2)) {
2351 relation = get_inversed_relation(relation);
2352 var = op2->reference.entity;
2357 type_t *const type = skip_typeref(var->declaration.type);
2358 ir_mode *const mode = get_ir_mode_storage(type);
2360 res = get_value(var->variable.v.value_number, mode);
2361 res = new_d_Confirm(dbi, res, expression_to_firm(con), relation);
2362 set_value(var->variable.v.value_number, res);
2368 * Handle the assume optimizer hint.
2370 * @param dbi debug info
2371 * @param expr the IL assume expression
2373 static ir_node *handle_assume(dbg_info *dbi, const expression_t *expression)
2375 switch(expression->kind) {
2376 case EXPR_BINARY_EQUAL:
2377 case EXPR_BINARY_NOTEQUAL:
2378 case EXPR_BINARY_LESS:
2379 case EXPR_BINARY_LESSEQUAL:
2380 case EXPR_BINARY_GREATER:
2381 case EXPR_BINARY_GREATEREQUAL:
2382 return handle_assume_compare(dbi, &expression->binary);
2388 static ir_node *create_cast(dbg_info *dbgi, ir_node *value_node,
2389 type_t *from_type, type_t *type)
2391 type = skip_typeref(type);
2392 if (type == type_void) {
2393 /* make sure firm type is constructed */
2394 (void) get_ir_type(type);
2397 if (!is_type_scalar(type)) {
2398 /* make sure firm type is constructed */
2399 (void) get_ir_type(type);
2403 from_type = skip_typeref(from_type);
2404 ir_mode *mode = get_ir_mode_storage(type);
2405 /* check for conversion from / to __based types */
2406 if (is_type_pointer(type) && is_type_pointer(from_type)) {
2407 const variable_t *from_var = from_type->pointer.base_variable;
2408 const variable_t *to_var = type->pointer.base_variable;
2409 if (from_var != to_var) {
2410 if (from_var != NULL) {
2411 ir_node *const addr = create_symconst(dbgi, from_var->v.entity);
2412 ir_node *const base = deref_address(dbgi, from_var->base.type, addr);
2413 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(from_type));
2415 if (to_var != NULL) {
2416 ir_node *const addr = create_symconst(dbgi, to_var->v.entity);
2417 ir_node *const base = deref_address(dbgi, to_var->base.type, addr);
2418 value_node = new_d_Sub(dbgi, value_node, base, mode);
2423 if (is_type_atomic(type, ATOMIC_TYPE_BOOL)) {
2424 /* bool adjustments (we save a mode_Bu, but have to temporarily
2425 * convert to mode_b so we only get a 0/1 value */
2426 value_node = create_conv(dbgi, value_node, mode_b);
2429 ir_mode *mode_arith = get_ir_mode_arithmetic(type);
2430 ir_node *node = create_conv(dbgi, value_node, mode);
2431 node = do_strict_conv(dbgi, node);
2432 node = create_conv(dbgi, node, mode_arith);
2437 static ir_node *unary_expression_to_firm(const unary_expression_t *expression)
2439 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2440 type_t *type = skip_typeref(expression->base.type);
2442 if (expression->base.kind == EXPR_UNARY_TAKE_ADDRESS)
2443 return expression_to_addr(expression->value);
2445 const expression_t *value = expression->value;
2447 switch(expression->base.kind) {
2448 case EXPR_UNARY_NEGATE: {
2449 ir_node *value_node = expression_to_firm(value);
2450 ir_mode *mode = get_ir_mode_arithmetic(type);
2451 return new_d_Minus(dbgi, value_node, mode);
2453 case EXPR_UNARY_PLUS:
2454 return expression_to_firm(value);
2455 case EXPR_UNARY_BITWISE_NEGATE: {
2456 ir_node *value_node = expression_to_firm(value);
2457 ir_mode *mode = get_ir_mode_arithmetic(type);
2458 return new_d_Not(dbgi, value_node, mode);
2460 case EXPR_UNARY_NOT: {
2461 ir_node *value_node = _expression_to_firm(value);
2462 value_node = create_conv(dbgi, value_node, mode_b);
2463 ir_node *res = new_d_Not(dbgi, value_node, mode_b);
2466 case EXPR_UNARY_DEREFERENCE: {
2467 ir_node *value_node = expression_to_firm(value);
2468 type_t *value_type = skip_typeref(value->base.type);
2469 assert(is_type_pointer(value_type));
2471 /* check for __based */
2472 const variable_t *const base_var = value_type->pointer.base_variable;
2473 if (base_var != NULL) {
2474 ir_node *const addr = create_symconst(dbgi, base_var->v.entity);
2475 ir_node *const base = deref_address(dbgi, base_var->base.type, addr);
2476 value_node = new_d_Add(dbgi, value_node, base, get_ir_mode_storage(value_type));
2478 type_t *points_to = value_type->pointer.points_to;
2479 return deref_address(dbgi, points_to, value_node);
2481 case EXPR_UNARY_POSTFIX_INCREMENT:
2482 case EXPR_UNARY_POSTFIX_DECREMENT:
2483 case EXPR_UNARY_PREFIX_INCREMENT:
2484 case EXPR_UNARY_PREFIX_DECREMENT:
2485 return create_incdec(expression);
2486 case EXPR_UNARY_CAST: {
2487 ir_node *value_node = expression_to_firm(value);
2488 type_t *from_type = value->base.type;
2489 return create_cast(dbgi, value_node, from_type, type);
2491 case EXPR_UNARY_ASSUME:
2492 return handle_assume(dbgi, value);
2497 panic("invalid UNEXPR type found");
2501 * produces a 0/1 depending of the value of a mode_b node
2503 static ir_node *produce_condition_result(const expression_t *expression,
2504 ir_mode *mode, dbg_info *dbgi)
2506 ir_node *const one_block = new_immBlock();
2507 ir_node *const zero_block = new_immBlock();
2508 create_condition_evaluation(expression, one_block, zero_block);
2509 mature_immBlock(one_block);
2510 mature_immBlock(zero_block);
2512 ir_node *const jmp_one = new_rd_Jmp(dbgi, one_block);
2513 ir_node *const jmp_zero = new_rd_Jmp(dbgi, zero_block);
2514 ir_node *const in_cf[2] = { jmp_one, jmp_zero };
2515 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
2516 set_cur_block(block);
2518 ir_node *const one = new_Const(get_mode_one(mode));
2519 ir_node *const zero = new_Const(get_mode_null(mode));
2520 ir_node *const in[2] = { one, zero };
2521 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
2526 static ir_node *adjust_for_pointer_arithmetic(dbg_info *dbgi,
2527 ir_node *value, type_t *type)
2529 ir_mode *const mode = get_ir_mode_arithmetic(type_ptrdiff_t);
2530 assert(is_type_pointer(type));
2531 pointer_type_t *const pointer_type = &type->pointer;
2532 type_t *const points_to = skip_typeref(pointer_type->points_to);
2533 ir_node * elem_size = get_type_size_node(points_to);
2534 elem_size = create_conv(dbgi, elem_size, mode);
2535 value = create_conv(dbgi, value, mode);
2536 ir_node *const mul = new_d_Mul(dbgi, value, elem_size, mode);
2540 static ir_node *create_op(dbg_info *dbgi, const binary_expression_t *expression,
2541 ir_node *left, ir_node *right)
2544 type_t *type_left = skip_typeref(expression->left->base.type);
2545 type_t *type_right = skip_typeref(expression->right->base.type);
2547 expression_kind_t kind = expression->base.kind;
2550 case EXPR_BINARY_SHIFTLEFT:
2551 case EXPR_BINARY_SHIFTRIGHT:
2552 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2553 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2554 mode = get_ir_mode_arithmetic(expression->base.type);
2555 right = create_conv(dbgi, right, atomic_modes[ATOMIC_TYPE_UINT]);
2558 case EXPR_BINARY_SUB:
2559 if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
2560 const pointer_type_t *const ptr_type = &type_left->pointer;
2562 mode = get_ir_mode_arithmetic(expression->base.type);
2563 ir_node *const elem_size = get_type_size_node(ptr_type->points_to);
2564 ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
2565 ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
2566 ir_node *const no_mem = new_NoMem();
2567 ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size,
2568 mode, op_pin_state_floats);
2569 return new_d_Proj(dbgi, div, mode, pn_Div_res);
2572 case EXPR_BINARY_SUB_ASSIGN:
2573 if (is_type_pointer(type_left)) {
2574 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2575 mode = get_ir_mode_arithmetic(type_left);
2580 case EXPR_BINARY_ADD:
2581 case EXPR_BINARY_ADD_ASSIGN:
2582 if (is_type_pointer(type_left)) {
2583 right = adjust_for_pointer_arithmetic(dbgi, right, type_left);
2584 mode = get_ir_mode_arithmetic(type_left);
2586 } else if (is_type_pointer(type_right)) {
2587 left = adjust_for_pointer_arithmetic(dbgi, left, type_right);
2588 mode = get_ir_mode_arithmetic(type_right);
2595 mode = get_ir_mode_arithmetic(type_right);
2596 left = create_conv(dbgi, left, mode);
2601 case EXPR_BINARY_ADD_ASSIGN:
2602 case EXPR_BINARY_ADD:
2603 return new_d_Add(dbgi, left, right, mode);
2604 case EXPR_BINARY_SUB_ASSIGN:
2605 case EXPR_BINARY_SUB:
2606 return new_d_Sub(dbgi, left, right, mode);
2607 case EXPR_BINARY_MUL_ASSIGN:
2608 case EXPR_BINARY_MUL:
2609 return new_d_Mul(dbgi, left, right, mode);
2610 case EXPR_BINARY_BITWISE_AND:
2611 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2612 return new_d_And(dbgi, left, right, mode);
2613 case EXPR_BINARY_BITWISE_OR:
2614 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2615 return new_d_Or(dbgi, left, right, mode);
2616 case EXPR_BINARY_BITWISE_XOR:
2617 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2618 return new_d_Eor(dbgi, left, right, mode);
2619 case EXPR_BINARY_SHIFTLEFT:
2620 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2621 return new_d_Shl(dbgi, left, right, mode);
2622 case EXPR_BINARY_SHIFTRIGHT:
2623 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2624 if (mode_is_signed(mode)) {
2625 return new_d_Shrs(dbgi, left, right, mode);
2627 return new_d_Shr(dbgi, left, right, mode);
2629 case EXPR_BINARY_DIV:
2630 case EXPR_BINARY_DIV_ASSIGN: {
2631 ir_node *pin = new_Pin(new_NoMem());
2632 ir_node *op = new_d_Div(dbgi, pin, left, right, mode,
2633 op_pin_state_floats);
2634 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Div_res);
2637 case EXPR_BINARY_MOD:
2638 case EXPR_BINARY_MOD_ASSIGN: {
2639 ir_node *pin = new_Pin(new_NoMem());
2640 assert(!mode_is_float(mode));
2641 ir_node *op = new_d_Mod(dbgi, pin, left, right, mode,
2642 op_pin_state_floats);
2643 ir_node *res = new_d_Proj(dbgi, op, mode, pn_Mod_res);
2647 panic("unexpected expression kind");
2651 static ir_node *create_lazy_op(const binary_expression_t *expression)
2653 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2654 type_t *type = skip_typeref(expression->base.type);
2655 ir_mode *mode = get_ir_mode_arithmetic(type);
2657 if (is_constant_expression(expression->left) == EXPR_CLASS_CONSTANT) {
2658 bool val = fold_constant_to_bool(expression->left);
2659 expression_kind_t ekind = expression->base.kind;
2660 assert(ekind == EXPR_BINARY_LOGICAL_AND || ekind == EXPR_BINARY_LOGICAL_OR);
2661 if (ekind == EXPR_BINARY_LOGICAL_AND) {
2663 return new_Const(get_mode_null(mode));
2667 return new_Const(get_mode_one(mode));
2671 if (is_constant_expression(expression->right) == EXPR_CLASS_CONSTANT) {
2672 bool valr = fold_constant_to_bool(expression->right);
2673 return create_Const_from_bool(mode, valr);
2676 return produce_condition_result(expression->right, mode, dbgi);
2679 return produce_condition_result((const expression_t*) expression, mode,
2683 typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
2684 ir_node *right, ir_mode *mode);
2686 static ir_node *create_assign_binop(const binary_expression_t *expression)
2688 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
2689 const expression_t *left_expr = expression->left;
2690 type_t *type = skip_typeref(left_expr->base.type);
2691 ir_node *right = expression_to_firm(expression->right);
2692 ir_node *left_addr = expression_to_addr(left_expr);
2693 ir_node *left = get_value_from_lvalue(left_expr, left_addr);
2694 ir_node *result = create_op(dbgi, expression, left, right);
2696 result = create_cast(dbgi, result, expression->right->base.type, type);
2697 result = do_strict_conv(dbgi, result);
2699 result = set_value_for_expression_addr(left_expr, result, left_addr);
2701 if (!is_type_compound(type)) {
2702 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2703 result = create_conv(dbgi, result, mode_arithmetic);
2708 static ir_node *binary_expression_to_firm(const binary_expression_t *expression)
2710 expression_kind_t kind = expression->base.kind;
2713 case EXPR_BINARY_EQUAL:
2714 case EXPR_BINARY_NOTEQUAL:
2715 case EXPR_BINARY_LESS:
2716 case EXPR_BINARY_LESSEQUAL:
2717 case EXPR_BINARY_GREATER:
2718 case EXPR_BINARY_GREATEREQUAL:
2719 case EXPR_BINARY_ISGREATER:
2720 case EXPR_BINARY_ISGREATEREQUAL:
2721 case EXPR_BINARY_ISLESS:
2722 case EXPR_BINARY_ISLESSEQUAL:
2723 case EXPR_BINARY_ISLESSGREATER:
2724 case EXPR_BINARY_ISUNORDERED: {
2725 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2726 ir_node *left = expression_to_firm(expression->left);
2727 ir_node *right = expression_to_firm(expression->right);
2728 ir_relation relation = get_relation(kind);
2729 ir_node *cmp = new_d_Cmp(dbgi, left, right, relation);
2732 case EXPR_BINARY_ASSIGN: {
2733 ir_node *addr = expression_to_addr(expression->left);
2734 ir_node *right = expression_to_firm(expression->right);
2736 = set_value_for_expression_addr(expression->left, right, addr);
2738 type_t *type = skip_typeref(expression->base.type);
2739 if (!is_type_compound(type)) {
2740 ir_mode *mode_arithmetic = get_ir_mode_arithmetic(type);
2741 res = create_conv(NULL, res, mode_arithmetic);
2745 case EXPR_BINARY_ADD:
2746 case EXPR_BINARY_SUB:
2747 case EXPR_BINARY_MUL:
2748 case EXPR_BINARY_DIV:
2749 case EXPR_BINARY_MOD:
2750 case EXPR_BINARY_BITWISE_AND:
2751 case EXPR_BINARY_BITWISE_OR:
2752 case EXPR_BINARY_BITWISE_XOR:
2753 case EXPR_BINARY_SHIFTLEFT:
2754 case EXPR_BINARY_SHIFTRIGHT:
2756 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2757 ir_node *left = expression_to_firm(expression->left);
2758 ir_node *right = expression_to_firm(expression->right);
2759 return create_op(dbgi, expression, left, right);
2761 case EXPR_BINARY_LOGICAL_AND:
2762 case EXPR_BINARY_LOGICAL_OR:
2763 return create_lazy_op(expression);
2764 case EXPR_BINARY_COMMA:
2765 /* create side effects of left side */
2766 (void) expression_to_firm(expression->left);
2767 return _expression_to_firm(expression->right);
2769 case EXPR_BINARY_ADD_ASSIGN:
2770 case EXPR_BINARY_SUB_ASSIGN:
2771 case EXPR_BINARY_MUL_ASSIGN:
2772 case EXPR_BINARY_MOD_ASSIGN:
2773 case EXPR_BINARY_DIV_ASSIGN:
2774 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2775 case EXPR_BINARY_BITWISE_OR_ASSIGN:
2776 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2777 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2778 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2779 return create_assign_binop(expression);
2781 panic("TODO binexpr type");
2785 static ir_node *array_access_addr(const array_access_expression_t *expression)
2787 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2788 ir_node *base_addr = expression_to_firm(expression->array_ref);
2789 ir_node *offset = expression_to_firm(expression->index);
2790 type_t *ref_type = skip_typeref(expression->array_ref->base.type);
2791 ir_node *real_offset = adjust_for_pointer_arithmetic(dbgi, offset, ref_type);
2792 ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
2797 static ir_node *array_access_to_firm(
2798 const array_access_expression_t *expression)
2800 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2801 ir_node *addr = array_access_addr(expression);
2802 type_t *type = revert_automatic_type_conversion(
2803 (const expression_t*) expression);
2804 type = skip_typeref(type);
2806 return deref_address(dbgi, type, addr);
2809 static long get_offsetof_offset(const offsetof_expression_t *expression)
2811 type_t *orig_type = expression->type;
2814 designator_t *designator = expression->designator;
2815 for ( ; designator != NULL; designator = designator->next) {
2816 type_t *type = skip_typeref(orig_type);
2817 /* be sure the type is constructed */
2818 (void) get_ir_type(type);
2820 if (designator->symbol != NULL) {
2821 assert(is_type_compound(type));
2822 symbol_t *symbol = designator->symbol;
2824 compound_t *compound = type->compound.compound;
2825 entity_t *iter = compound->members.entities;
2826 for ( ; iter != NULL; iter = iter->base.next) {
2827 if (iter->base.symbol == symbol) {
2831 assert(iter != NULL);
2833 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2834 assert(iter->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
2835 offset += get_entity_offset(iter->compound_member.entity);
2837 orig_type = iter->declaration.type;
2839 expression_t *array_index = designator->array_index;
2840 assert(designator->array_index != NULL);
2841 assert(is_type_array(type));
2843 long index = fold_constant_to_int(array_index);
2844 ir_type *arr_type = get_ir_type(type);
2845 ir_type *elem_type = get_array_element_type(arr_type);
2846 long elem_size = get_type_size_bytes(elem_type);
2848 offset += index * elem_size;
2850 orig_type = type->array.element_type;
2857 static ir_node *offsetof_to_firm(const offsetof_expression_t *expression)
2859 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2860 long offset = get_offsetof_offset(expression);
2861 ir_tarval *tv = new_tarval_from_long(offset, mode);
2862 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2864 return new_d_Const(dbgi, tv);
2867 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
2868 ir_entity *entity, type_t *type);
2869 static ir_initializer_t *create_ir_initializer(
2870 const initializer_t *initializer, type_t *type);
2872 static ir_entity *create_initializer_entity(dbg_info *dbgi,
2873 initializer_t *initializer,
2876 /* create the ir_initializer */
2877 ir_graph *const old_current_ir_graph = current_ir_graph;
2878 current_ir_graph = get_const_code_irg();
2880 ir_initializer_t *irinitializer = create_ir_initializer(initializer, type);
2882 assert(current_ir_graph == get_const_code_irg());
2883 current_ir_graph = old_current_ir_graph;
2885 ident *const id = id_unique("initializer.%u");
2886 ir_type *const irtype = get_ir_type(type);
2887 ir_type *const global_type = get_glob_type();
2888 ir_entity *const entity = new_d_entity(global_type, id, irtype, dbgi);
2889 set_entity_ld_ident(entity, id);
2890 set_entity_visibility(entity, ir_visibility_private);
2891 add_entity_linkage(entity, IR_LINKAGE_CONSTANT);
2892 set_entity_initializer(entity, irinitializer);
2896 static ir_node *compound_literal_to_firm(
2897 const compound_literal_expression_t *expression)
2899 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2900 type_t *type = expression->type;
2901 initializer_t *initializer = expression->initializer;
2903 if (is_constant_initializer(initializer) == EXPR_CLASS_CONSTANT) {
2904 ir_entity *entity = create_initializer_entity(dbgi, initializer, type);
2905 return create_symconst(dbgi, entity);
2907 /* create an entity on the stack */
2908 ident *const id = id_unique("CompLit.%u");
2909 ir_type *const irtype = get_ir_type(type);
2910 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
2912 ir_entity *const entity = new_d_entity(frame_type, id, irtype, dbgi);
2913 set_entity_ld_ident(entity, id);
2915 /* create initialisation code */
2916 create_local_initializer(initializer, dbgi, entity, type);
2918 /* create a sel for the compound literal address */
2919 ir_node *frame = get_irg_frame(current_ir_graph);
2920 ir_node *sel = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
2926 * Transform a sizeof expression into Firm code.
2928 static ir_node *sizeof_to_firm(const typeprop_expression_t *expression)
2930 type_t *const type = skip_typeref(expression->type);
2931 /* ยง6.5.3.4:2 if the type is a VLA, evaluate the expression. */
2932 if (is_type_array(type) && type->array.is_vla
2933 && expression->tp_expression != NULL) {
2934 expression_to_firm(expression->tp_expression);
2936 /* strange gnu extensions: sizeof(function) == 1 */
2937 if (is_type_function(type)) {
2938 ir_mode *mode = get_ir_mode_storage(type_size_t);
2939 return new_Const(get_mode_one(mode));
2942 return get_type_size_node(type);
2945 static entity_t *get_expression_entity(const expression_t *expression)
2947 if (expression->kind != EXPR_REFERENCE)
2950 return expression->reference.entity;
2953 static unsigned get_cparser_entity_alignment(const entity_t *entity)
2955 switch(entity->kind) {
2956 case DECLARATION_KIND_CASES:
2957 return entity->declaration.alignment;
2960 return entity->compound.alignment;
2961 case ENTITY_TYPEDEF:
2962 return entity->typedefe.alignment;
2970 * Transform an alignof expression into Firm code.
2972 static ir_node *alignof_to_firm(const typeprop_expression_t *expression)
2974 unsigned alignment = 0;
2976 const expression_t *tp_expression = expression->tp_expression;
2977 if (tp_expression != NULL) {
2978 entity_t *entity = get_expression_entity(tp_expression);
2979 if (entity != NULL) {
2980 if (entity->kind == ENTITY_FUNCTION) {
2981 /* a gnu-extension */
2984 alignment = get_cparser_entity_alignment(entity);
2989 if (alignment == 0) {
2990 type_t *type = expression->type;
2991 alignment = get_type_alignment(type);
2994 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
2995 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
2996 ir_tarval *tv = new_tarval_from_long(alignment, mode);
2997 return new_d_Const(dbgi, tv);
3000 static void init_ir_types(void);
3002 static ir_tarval *fold_constant_to_tarval(const expression_t *expression)
3004 assert(is_type_valid(skip_typeref(expression->base.type)));
3006 bool constant_folding_old = constant_folding;
3007 constant_folding = true;
3008 int old_optimize = get_optimize();
3009 int old_constant_folding = get_opt_constant_folding();
3011 set_opt_constant_folding(1);
3015 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
3017 ir_graph *old_current_ir_graph = current_ir_graph;
3018 current_ir_graph = get_const_code_irg();
3020 ir_node *cnst = expression_to_firm(expression);
3021 current_ir_graph = old_current_ir_graph;
3022 set_optimize(old_optimize);
3023 set_opt_constant_folding(old_constant_folding);
3025 if (!is_Const(cnst)) {
3026 panic("couldn't fold constant");
3029 constant_folding = constant_folding_old;
3031 return get_Const_tarval(cnst);
3034 /* this function is only used in parser.c, but it relies on libfirm functionality */
3035 bool constant_is_negative(const expression_t *expression)
3037 assert(is_constant_expression(expression) == EXPR_CLASS_CONSTANT);
3038 ir_tarval *tv = fold_constant_to_tarval(expression);
3039 return tarval_is_negative(tv);
3042 long fold_constant_to_int(const expression_t *expression)
3044 if (expression->kind == EXPR_ERROR)
3047 ir_tarval *tv = fold_constant_to_tarval(expression);
3048 if (!tarval_is_long(tv)) {
3049 panic("result of constant folding is not integer");
3052 return get_tarval_long(tv);
3055 bool fold_constant_to_bool(const expression_t *expression)
3057 if (expression->kind == EXPR_ERROR)
3059 ir_tarval *tv = fold_constant_to_tarval(expression);
3060 return !tarval_is_null(tv);
3063 static ir_node *conditional_to_firm(const conditional_expression_t *expression)
3065 dbg_info *const dbgi = get_dbg_info(&expression->base.source_position);
3067 /* first try to fold a constant condition */
3068 if (is_constant_expression(expression->condition) == EXPR_CLASS_CONSTANT) {
3069 bool val = fold_constant_to_bool(expression->condition);
3071 expression_t *true_expression = expression->true_expression;
3072 if (true_expression == NULL)
3073 true_expression = expression->condition;
3074 return expression_to_firm(true_expression);
3076 return expression_to_firm(expression->false_expression);
3080 ir_node *const true_block = new_immBlock();
3081 ir_node *const false_block = new_immBlock();
3082 ir_node *const cond_expr = create_condition_evaluation(expression->condition, true_block, false_block);
3083 mature_immBlock(true_block);
3084 mature_immBlock(false_block);
3086 set_cur_block(true_block);
3088 if (expression->true_expression != NULL) {
3089 true_val = expression_to_firm(expression->true_expression);
3090 } else if (cond_expr != NULL && get_irn_mode(cond_expr) != mode_b) {
3091 true_val = cond_expr;
3093 /* Condition ended with a short circuit (&&, ||, !) operation or a
3094 * comparison. Generate a "1" as value for the true branch. */
3095 true_val = new_Const(get_mode_one(mode_Is));
3097 ir_node *const true_jmp = new_d_Jmp(dbgi);
3099 set_cur_block(false_block);
3100 ir_node *const false_val = expression_to_firm(expression->false_expression);
3101 ir_node *const false_jmp = new_d_Jmp(dbgi);
3103 /* create the common block */
3104 ir_node *const in_cf[2] = { true_jmp, false_jmp };
3105 ir_node *const block = new_Block(lengthof(in_cf), in_cf);
3106 set_cur_block(block);
3108 /* TODO improve static semantics, so either both or no values are NULL */
3109 if (true_val == NULL || false_val == NULL)
3112 ir_node *const in[2] = { true_val, false_val };
3113 type_t *const type = skip_typeref(expression->base.type);
3115 if (is_type_compound(type)) {
3118 mode = get_ir_mode_arithmetic(type);
3120 ir_node *const val = new_d_Phi(dbgi, lengthof(in), in, mode);
3126 * Returns an IR-node representing the address of a field.
3128 static ir_node *select_addr(const select_expression_t *expression)
3130 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3132 construct_select_compound(expression);
3134 ir_node *compound_addr = expression_to_firm(expression->compound);
3136 entity_t *entry = expression->compound_entry;
3137 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3138 assert(entry->declaration.kind == DECLARATION_KIND_COMPOUND_MEMBER);
3140 if (constant_folding) {
3141 ir_mode *mode = get_irn_mode(compound_addr);
3142 ir_mode *mode_uint = get_reference_mode_unsigned_eq(mode);
3143 ir_node *ofs = new_Const_long(mode_uint, entry->compound_member.offset);
3144 return new_d_Add(dbgi, compound_addr, ofs, mode);
3146 ir_entity *irentity = entry->compound_member.entity;
3147 assert(irentity != NULL);
3148 return new_d_simpleSel(dbgi, new_NoMem(), compound_addr, irentity);
3152 static ir_node *select_to_firm(const select_expression_t *expression)
3154 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3155 ir_node *addr = select_addr(expression);
3156 type_t *type = revert_automatic_type_conversion(
3157 (const expression_t*) expression);
3158 type = skip_typeref(type);
3160 entity_t *entry = expression->compound_entry;
3161 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3163 if (entry->compound_member.bitfield) {
3164 return bitfield_extract_to_firm(expression, addr);
3167 return deref_address(dbgi, type, addr);
3170 /* Values returned by __builtin_classify_type. */
3171 typedef enum gcc_type_class
3177 enumeral_type_class,
3180 reference_type_class,
3184 function_type_class,
3195 static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
3197 type_t *type = expr->type_expression->base.type;
3199 /* FIXME gcc returns different values depending on whether compiling C or C++
3200 * e.g. int x[10] is pointer_type_class in C, but array_type_class in C++ */
3203 type = skip_typeref(type);
3204 switch (type->kind) {
3206 const atomic_type_t *const atomic_type = &type->atomic;
3207 switch (atomic_type->akind) {
3208 /* should not be reached */
3209 case ATOMIC_TYPE_INVALID:
3213 /* gcc cannot do that */
3214 case ATOMIC_TYPE_VOID:
3215 tc = void_type_class;
3218 case ATOMIC_TYPE_WCHAR_T: /* gcc handles this as integer */
3219 case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
3220 case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
3221 case ATOMIC_TYPE_UCHAR: /* gcc handles this as integer */
3222 case ATOMIC_TYPE_SHORT:
3223 case ATOMIC_TYPE_USHORT:
3224 case ATOMIC_TYPE_INT:
3225 case ATOMIC_TYPE_UINT:
3226 case ATOMIC_TYPE_LONG:
3227 case ATOMIC_TYPE_ULONG:
3228 case ATOMIC_TYPE_LONGLONG:
3229 case ATOMIC_TYPE_ULONGLONG:
3230 case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
3231 tc = integer_type_class;
3234 case ATOMIC_TYPE_FLOAT:
3235 case ATOMIC_TYPE_DOUBLE:
3236 case ATOMIC_TYPE_LONG_DOUBLE:
3237 tc = real_type_class;
3240 panic("Unexpected atomic type in classify_type_to_firm().");
3243 case TYPE_COMPLEX: tc = complex_type_class; goto make_const;
3244 case TYPE_IMAGINARY: tc = complex_type_class; goto make_const;
3245 case TYPE_ARRAY: /* gcc handles this as pointer */
3246 case TYPE_FUNCTION: /* gcc handles this as pointer */
3247 case TYPE_POINTER: tc = pointer_type_class; goto make_const;
3248 case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
3249 case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
3251 /* gcc handles this as integer */
3252 case TYPE_ENUM: tc = integer_type_class; goto make_const;
3254 /* gcc classifies the referenced type */
3255 case TYPE_REFERENCE: type = type->reference.refers_to; continue;
3257 /* typedef/typeof should be skipped already */
3263 panic("unexpected TYPE classify_type_to_firm().");
3267 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3268 ir_mode *const mode = atomic_modes[ATOMIC_TYPE_INT];
3269 ir_tarval *const tv = new_tarval_from_long(tc, mode);
3270 return new_d_Const(dbgi, tv);
3273 static ir_node *function_name_to_firm(
3274 const funcname_expression_t *const expr)
3276 switch(expr->kind) {
3277 case FUNCNAME_FUNCTION:
3278 case FUNCNAME_PRETTY_FUNCTION:
3279 case FUNCNAME_FUNCDNAME:
3280 if (current_function_name == NULL) {
3281 const source_position_t *const src_pos = &expr->base.source_position;
3282 const char *name = current_function_entity->base.symbol->string;
3283 const string_t string = { name, strlen(name) + 1 };
3284 current_function_name = string_to_firm(src_pos, "__func__.%u", &string);
3286 return current_function_name;
3287 case FUNCNAME_FUNCSIG:
3288 if (current_funcsig == NULL) {
3289 const source_position_t *const src_pos = &expr->base.source_position;
3290 ir_entity *ent = get_irg_entity(current_ir_graph);
3291 const char *const name = get_entity_ld_name(ent);
3292 const string_t string = { name, strlen(name) + 1 };
3293 current_funcsig = string_to_firm(src_pos, "__FUNCSIG__.%u", &string);
3295 return current_funcsig;
3297 panic("Unsupported function name");
3300 static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
3302 statement_t *statement = expr->statement;
3304 assert(statement->kind == STATEMENT_COMPOUND);
3305 return compound_statement_to_firm(&statement->compound);
3308 static ir_node *va_start_expression_to_firm(
3309 const va_start_expression_t *const expr)
3311 ir_entity *param_ent = current_vararg_entity;
3312 if (param_ent == NULL) {
3313 size_t const n = IR_VA_START_PARAMETER_NUMBER;
3314 ir_type *const frame_type = get_irg_frame_type(current_ir_graph);
3315 ir_type *const param_type = get_unknown_type();
3316 param_ent = new_parameter_entity(frame_type, n, param_type);
3317 current_vararg_entity = param_ent;
3320 ir_node *const frame = get_irg_frame(current_ir_graph);
3321 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3322 ir_node *const no_mem = new_NoMem();
3323 ir_node *const arg_sel = new_d_simpleSel(dbgi, no_mem, frame, param_ent);
3325 set_value_for_expression(expr->ap, arg_sel);
3330 static ir_node *va_arg_expression_to_firm(const va_arg_expression_t *const expr)
3332 type_t *const type = expr->base.type;
3333 expression_t *const ap_expr = expr->ap;
3334 ir_node *const ap_addr = expression_to_addr(ap_expr);
3335 ir_node *const ap = get_value_from_lvalue(ap_expr, ap_addr);
3336 dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
3337 ir_node *const res = deref_address(dbgi, type, ap);
3339 ir_node *const cnst = get_type_size_node(expr->base.type);
3340 ir_mode *const mode = get_irn_mode(cnst);
3341 ir_node *const c1 = new_Const_long(mode, stack_param_align - 1);
3342 ir_node *const c2 = new_d_Add(dbgi, cnst, c1, mode);
3343 ir_node *const c3 = new_Const_long(mode, -(long)stack_param_align);
3344 ir_node *const c4 = new_d_And(dbgi, c2, c3, mode);
3345 ir_node *const add = new_d_Add(dbgi, ap, c4, mode_P_data);
3347 set_value_for_expression_addr(ap_expr, add, ap_addr);
3353 * Generate Firm for a va_copy expression.
3355 static ir_node *va_copy_expression_to_firm(const va_copy_expression_t *const expr)
3357 ir_node *const src = expression_to_firm(expr->src);
3358 set_value_for_expression(expr->dst, src);
3362 static ir_node *dereference_addr(const unary_expression_t *const expression)
3364 assert(expression->base.kind == EXPR_UNARY_DEREFERENCE);
3365 return expression_to_firm(expression->value);
3369 * Returns a IR-node representing an lvalue of the given expression.
3371 static ir_node *expression_to_addr(const expression_t *expression)
3373 switch(expression->kind) {
3374 case EXPR_ARRAY_ACCESS:
3375 return array_access_addr(&expression->array_access);
3377 return call_expression_to_firm(&expression->call);
3378 case EXPR_COMPOUND_LITERAL:
3379 return compound_literal_to_firm(&expression->compound_literal);
3380 case EXPR_REFERENCE:
3381 return reference_addr(&expression->reference);
3383 return select_addr(&expression->select);
3384 case EXPR_UNARY_DEREFERENCE:
3385 return dereference_addr(&expression->unary);
3389 panic("trying to get address of non-lvalue");
3392 static ir_node *builtin_constant_to_firm(
3393 const builtin_constant_expression_t *expression)
3395 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3396 bool const v = is_constant_expression(expression->value) == EXPR_CLASS_CONSTANT;
3397 return create_Const_from_bool(mode, v);
3400 static ir_node *builtin_types_compatible_to_firm(
3401 const builtin_types_compatible_expression_t *expression)
3403 type_t *const left = get_unqualified_type(skip_typeref(expression->left));
3404 type_t *const right = get_unqualified_type(skip_typeref(expression->right));
3405 bool const value = types_compatible(left, right);
3406 ir_mode *const mode = get_ir_mode_arithmetic(expression->base.type);
3407 return create_Const_from_bool(mode, value);
3410 static ir_node *get_label_block(label_t *label)
3412 if (label->block != NULL)
3413 return label->block;
3415 /* beware: might be called from create initializer with current_ir_graph
3416 * set to const_code_irg. */
3417 ir_graph *rem = current_ir_graph;
3418 current_ir_graph = current_function;
3420 ir_node *block = new_immBlock();
3422 label->block = block;
3424 ARR_APP1(label_t *, all_labels, label);
3426 current_ir_graph = rem;
3431 * Pointer to a label. This is used for the
3432 * GNU address-of-label extension.
3434 static ir_node *label_address_to_firm(const label_address_expression_t *label)
3436 dbg_info *dbgi = get_dbg_info(&label->base.source_position);
3437 ir_node *block = get_label_block(label->label);
3438 ir_entity *entity = create_Block_entity(block);
3440 symconst_symbol value;
3441 value.entity_p = entity;
3442 return new_d_SymConst(dbgi, mode_P_code, value, symconst_addr_ent);
3445 static ir_node *error_to_firm(const expression_t *expression)
3447 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3448 return new_Bad(mode);
3452 * creates firm nodes for an expression. The difference between this function
3453 * and expression_to_firm is, that this version might produce mode_b nodes
3454 * instead of mode_Is.
3456 static ir_node *_expression_to_firm(const expression_t *expression)
3459 if (!constant_folding) {
3460 assert(!expression->base.transformed);
3461 ((expression_t*) expression)->base.transformed = true;
3465 switch (expression->kind) {
3466 case EXPR_LITERAL_CASES:
3467 return literal_to_firm(&expression->literal);
3468 case EXPR_STRING_LITERAL:
3469 return string_to_firm(&expression->base.source_position, "str.%u",
3470 &expression->literal.value);
3471 case EXPR_WIDE_STRING_LITERAL:
3472 return wide_string_literal_to_firm(&expression->string_literal);
3473 case EXPR_REFERENCE:
3474 return reference_expression_to_firm(&expression->reference);
3475 case EXPR_REFERENCE_ENUM_VALUE:
3476 return reference_expression_enum_value_to_firm(&expression->reference);
3478 return call_expression_to_firm(&expression->call);
3479 case EXPR_UNARY_CASES:
3480 return unary_expression_to_firm(&expression->unary);
3481 case EXPR_BINARY_CASES:
3482 return binary_expression_to_firm(&expression->binary);
3483 case EXPR_ARRAY_ACCESS:
3484 return array_access_to_firm(&expression->array_access);
3486 return sizeof_to_firm(&expression->typeprop);
3488 return alignof_to_firm(&expression->typeprop);
3489 case EXPR_CONDITIONAL:
3490 return conditional_to_firm(&expression->conditional);
3492 return select_to_firm(&expression->select);
3493 case EXPR_CLASSIFY_TYPE:
3494 return classify_type_to_firm(&expression->classify_type);
3496 return function_name_to_firm(&expression->funcname);
3497 case EXPR_STATEMENT:
3498 return statement_expression_to_firm(&expression->statement);
3500 return va_start_expression_to_firm(&expression->va_starte);
3502 return va_arg_expression_to_firm(&expression->va_arge);
3504 return va_copy_expression_to_firm(&expression->va_copye);
3505 case EXPR_BUILTIN_CONSTANT_P:
3506 return builtin_constant_to_firm(&expression->builtin_constant);
3507 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
3508 return builtin_types_compatible_to_firm(&expression->builtin_types_compatible);
3510 return offsetof_to_firm(&expression->offsetofe);
3511 case EXPR_COMPOUND_LITERAL:
3512 return compound_literal_to_firm(&expression->compound_literal);
3513 case EXPR_LABEL_ADDRESS:
3514 return label_address_to_firm(&expression->label_address);
3517 return error_to_firm(expression);
3519 panic("invalid expression found");
3523 * Check if a given expression is a GNU __builtin_expect() call.
3525 static bool is_builtin_expect(const expression_t *expression)
3527 if (expression->kind != EXPR_CALL)
3530 expression_t *function = expression->call.function;
3531 if (function->kind != EXPR_REFERENCE)
3533 reference_expression_t *ref = &function->reference;
3534 if (ref->entity->kind != ENTITY_FUNCTION ||
3535 ref->entity->function.btk != BUILTIN_EXPECT)
3541 static bool produces_mode_b(const expression_t *expression)
3543 switch (expression->kind) {
3544 case EXPR_BINARY_EQUAL:
3545 case EXPR_BINARY_NOTEQUAL:
3546 case EXPR_BINARY_LESS:
3547 case EXPR_BINARY_LESSEQUAL:
3548 case EXPR_BINARY_GREATER:
3549 case EXPR_BINARY_GREATEREQUAL:
3550 case EXPR_BINARY_ISGREATER:
3551 case EXPR_BINARY_ISGREATEREQUAL:
3552 case EXPR_BINARY_ISLESS:
3553 case EXPR_BINARY_ISLESSEQUAL:
3554 case EXPR_BINARY_ISLESSGREATER:
3555 case EXPR_BINARY_ISUNORDERED:
3556 case EXPR_UNARY_NOT:
3560 if (is_builtin_expect(expression)) {
3561 expression_t *argument = expression->call.arguments->expression;
3562 return produces_mode_b(argument);
3565 case EXPR_BINARY_COMMA:
3566 return produces_mode_b(expression->binary.right);
3573 static ir_node *expression_to_firm(const expression_t *expression)
3575 if (!produces_mode_b(expression)) {
3576 ir_node *res = _expression_to_firm(expression);
3577 assert(res == NULL || get_irn_mode(res) != mode_b);
3581 if (is_constant_expression(expression) == EXPR_CLASS_CONSTANT) {
3582 bool const constant_folding_old = constant_folding;
3583 constant_folding = true;
3584 ir_node *res = _expression_to_firm(expression);
3585 constant_folding = constant_folding_old;
3586 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3587 assert(is_Const(res));
3588 return create_Const_from_bool(mode, !is_Const_null(res));
3591 /* we have to produce a 0/1 from the mode_b expression */
3592 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3593 ir_mode *mode = get_ir_mode_arithmetic(expression->base.type);
3594 return produce_condition_result(expression, mode, dbgi);
3598 * create a short-circuit expression evaluation that tries to construct
3599 * efficient control flow structures for &&, || and ! expressions
3601 static ir_node *create_condition_evaluation(const expression_t *expression,
3602 ir_node *true_block,
3603 ir_node *false_block)
3605 switch(expression->kind) {
3606 case EXPR_UNARY_NOT: {
3607 const unary_expression_t *unary_expression = &expression->unary;
3608 create_condition_evaluation(unary_expression->value, false_block,
3612 case EXPR_BINARY_LOGICAL_AND: {
3613 const binary_expression_t *binary_expression = &expression->binary;
3615 ir_node *extra_block = new_immBlock();
3616 create_condition_evaluation(binary_expression->left, extra_block,
3618 mature_immBlock(extra_block);
3619 set_cur_block(extra_block);
3620 create_condition_evaluation(binary_expression->right, true_block,
3624 case EXPR_BINARY_LOGICAL_OR: {
3625 const binary_expression_t *binary_expression = &expression->binary;
3627 ir_node *extra_block = new_immBlock();
3628 create_condition_evaluation(binary_expression->left, true_block,
3630 mature_immBlock(extra_block);
3631 set_cur_block(extra_block);
3632 create_condition_evaluation(binary_expression->right, true_block,
3640 dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
3641 ir_node *cond_expr = _expression_to_firm(expression);
3642 ir_node *condition = create_conv(dbgi, cond_expr, mode_b);
3643 ir_node *cond = new_d_Cond(dbgi, condition);
3644 ir_node *true_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_true);
3645 ir_node *false_proj = new_d_Proj(dbgi, cond, mode_X, pn_Cond_false);
3647 /* set branch prediction info based on __builtin_expect */
3648 if (is_builtin_expect(expression) && is_Cond(cond)) {
3649 call_argument_t *argument = expression->call.arguments->next;
3650 if (is_constant_expression(argument->expression) == EXPR_CLASS_CONSTANT) {
3651 bool const cnst = fold_constant_to_bool(argument->expression);
3652 cond_jmp_predicate const pred = cnst ? COND_JMP_PRED_TRUE : COND_JMP_PRED_FALSE;
3653 set_Cond_jmp_pred(cond, pred);
3657 add_immBlock_pred(true_block, true_proj);
3658 add_immBlock_pred(false_block, false_proj);
3660 set_unreachable_now();
3664 static void create_variable_entity(entity_t *variable,
3665 declaration_kind_t declaration_kind,
3666 ir_type *parent_type)
3668 assert(variable->kind == ENTITY_VARIABLE);
3669 type_t *type = skip_typeref(variable->declaration.type);
3671 ident *const id = new_id_from_str(variable->base.symbol->string);
3672 ir_type *const irtype = get_ir_type(type);
3673 dbg_info *const dbgi = get_dbg_info(&variable->base.source_position);
3674 ir_entity *const irentity = new_d_entity(parent_type, id, irtype, dbgi);
3675 unsigned alignment = variable->declaration.alignment;
3677 set_entity_alignment(irentity, alignment);
3679 handle_decl_modifiers(irentity, variable);
3681 variable->declaration.kind = (unsigned char) declaration_kind;
3682 variable->variable.v.entity = irentity;
3683 set_entity_ld_ident(irentity, create_ld_ident(variable));
3685 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
3686 set_entity_volatility(irentity, volatility_is_volatile);
3691 typedef struct type_path_entry_t type_path_entry_t;
3692 struct type_path_entry_t {
3694 ir_initializer_t *initializer;
3696 entity_t *compound_entry;
3699 typedef struct type_path_t type_path_t;
3700 struct type_path_t {
3701 type_path_entry_t *path;
3706 static __attribute__((unused)) void debug_print_type_path(const type_path_t *path)
3708 size_t len = ARR_LEN(path->path);
3710 for (size_t i = 0; i < len; ++i) {
3711 const type_path_entry_t *entry = & path->path[i];
3713 type_t *type = skip_typeref(entry->type);
3714 if (is_type_compound(type)) {
3715 fprintf(stderr, ".%s", entry->compound_entry->base.symbol->string);
3716 } else if (is_type_array(type)) {
3717 fprintf(stderr, "[%u]", (unsigned) entry->index);
3719 fprintf(stderr, "-INVALID-");
3722 fprintf(stderr, " (");
3723 print_type(path->top_type);
3724 fprintf(stderr, ")");
3727 static type_path_entry_t *get_type_path_top(const type_path_t *path)
3729 size_t len = ARR_LEN(path->path);
3731 return & path->path[len-1];
3734 static type_path_entry_t *append_to_type_path(type_path_t *path)
3736 size_t len = ARR_LEN(path->path);
3737 ARR_RESIZE(type_path_entry_t, path->path, len+1);
3739 type_path_entry_t *result = & path->path[len];
3740 memset(result, 0, sizeof(result[0]));
3744 static size_t get_compound_member_count(const compound_type_t *type)
3746 compound_t *compound = type->compound;
3747 size_t n_members = 0;
3748 entity_t *member = compound->members.entities;
3749 for ( ; member != NULL; member = member->base.next) {
3756 static ir_initializer_t *get_initializer_entry(type_path_t *path)
3758 type_t *orig_top_type = path->top_type;
3759 type_t *top_type = skip_typeref(orig_top_type);
3761 assert(is_type_compound(top_type) || is_type_array(top_type));
3763 if (ARR_LEN(path->path) == 0) {
3766 type_path_entry_t *top = get_type_path_top(path);
3767 ir_initializer_t *initializer = top->initializer;
3768 return get_initializer_compound_value(initializer, top->index);
3772 static void descend_into_subtype(type_path_t *path)
3774 type_t *orig_top_type = path->top_type;
3775 type_t *top_type = skip_typeref(orig_top_type);
3777 assert(is_type_compound(top_type) || is_type_array(top_type));
3779 ir_initializer_t *initializer = get_initializer_entry(path);
3781 type_path_entry_t *top = append_to_type_path(path);
3782 top->type = top_type;
3786 if (is_type_compound(top_type)) {
3787 compound_t *const compound = top_type->compound.compound;
3788 entity_t *const entry = skip_unnamed_bitfields(compound->members.entities);
3790 top->compound_entry = entry;
3792 len = get_compound_member_count(&top_type->compound);
3793 if (entry != NULL) {
3794 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3795 path->top_type = entry->declaration.type;
3798 assert(is_type_array(top_type));
3799 assert(top_type->array.size > 0);
3802 path->top_type = top_type->array.element_type;
3803 len = top_type->array.size;
3805 if (initializer == NULL
3806 || get_initializer_kind(initializer) == IR_INITIALIZER_NULL) {
3807 initializer = create_initializer_compound(len);
3808 /* we have to set the entry at the 2nd latest path entry... */
3809 size_t path_len = ARR_LEN(path->path);
3810 assert(path_len >= 1);
3812 type_path_entry_t *entry = & path->path[path_len-2];
3813 ir_initializer_t *tinitializer = entry->initializer;
3814 set_initializer_compound_value(tinitializer, entry->index,
3818 top->initializer = initializer;
3821 static void ascend_from_subtype(type_path_t *path)
3823 type_path_entry_t *top = get_type_path_top(path);
3825 path->top_type = top->type;
3827 size_t len = ARR_LEN(path->path);
3828 ARR_RESIZE(type_path_entry_t, path->path, len-1);
3831 static void walk_designator(type_path_t *path, const designator_t *designator)
3833 /* designators start at current object type */
3834 ARR_RESIZE(type_path_entry_t, path->path, 1);
3836 for ( ; designator != NULL; designator = designator->next) {
3837 type_path_entry_t *top = get_type_path_top(path);
3838 type_t *orig_type = top->type;
3839 type_t *type = skip_typeref(orig_type);
3841 if (designator->symbol != NULL) {
3842 assert(is_type_compound(type));
3844 symbol_t *symbol = designator->symbol;
3846 compound_t *compound = type->compound.compound;
3847 entity_t *iter = compound->members.entities;
3848 for ( ; iter != NULL; iter = iter->base.next, ++index) {
3849 if (iter->base.symbol == symbol) {
3850 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
3854 assert(iter != NULL);
3856 /* revert previous initialisations of other union elements */
3857 if (type->kind == TYPE_COMPOUND_UNION) {
3858 ir_initializer_t *initializer = top->initializer;
3859 if (initializer != NULL
3860 && get_initializer_kind(initializer) == IR_INITIALIZER_COMPOUND) {
3861 /* are we writing to a new element? */
3862 ir_initializer_t *oldi
3863 = get_initializer_compound_value(initializer, index);
3864 if (get_initializer_kind(oldi) == IR_INITIALIZER_NULL) {
3865 /* clear initializer */
3867 = get_initializer_compound_n_entries(initializer);
3868 ir_initializer_t *nulli = get_initializer_null();
3869 for (size_t i = 0; i < len; ++i) {
3870 set_initializer_compound_value(initializer, i,
3877 top->type = orig_type;
3878 top->compound_entry = iter;
3880 orig_type = iter->declaration.type;
3882 expression_t *array_index = designator->array_index;
3883 assert(designator->array_index != NULL);
3884 assert(is_type_array(type));
3886 long index = fold_constant_to_int(array_index);
3889 if (type->array.size_constant) {
3890 long array_size = type->array.size;
3891 assert(index < array_size);
3895 top->type = orig_type;
3896 top->index = (size_t) index;
3897 orig_type = type->array.element_type;
3899 path->top_type = orig_type;
3901 if (designator->next != NULL) {
3902 descend_into_subtype(path);
3906 path->invalid = false;
3909 static void advance_current_object(type_path_t *path)
3911 if (path->invalid) {
3912 /* TODO: handle this... */
3913 panic("invalid initializer in ast2firm (excessive elements)");
3916 type_path_entry_t *top = get_type_path_top(path);
3918 type_t *type = skip_typeref(top->type);
3919 if (is_type_union(type)) {
3920 /* only the first element is initialized in unions */
3921 top->compound_entry = NULL;
3922 } else if (is_type_struct(type)) {
3923 entity_t *entry = top->compound_entry;
3926 entry = skip_unnamed_bitfields(entry->base.next);
3927 top->compound_entry = entry;
3928 if (entry != NULL) {
3929 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
3930 path->top_type = entry->declaration.type;
3934 assert(is_type_array(type));
3937 if (!type->array.size_constant || top->index < type->array.size) {
3942 /* we're past the last member of the current sub-aggregate, try if we
3943 * can ascend in the type hierarchy and continue with another subobject */
3944 size_t len = ARR_LEN(path->path);
3947 ascend_from_subtype(path);
3948 advance_current_object(path);
3950 path->invalid = true;
3955 static ir_initializer_t *create_ir_initializer_value(
3956 const initializer_value_t *initializer)
3958 if (is_type_compound(initializer->value->base.type)) {
3959 panic("initializer creation for compounds not implemented yet");
3961 type_t *type = initializer->value->base.type;
3962 expression_t *expr = initializer->value;
3963 ir_node *value = expression_to_firm(expr);
3964 ir_mode *mode = get_ir_mode_storage(type);
3965 value = create_conv(NULL, value, mode);
3966 return create_initializer_const(value);
3969 /** test wether type can be initialized by a string constant */
3970 static bool is_string_type(type_t *type)
3973 if (is_type_pointer(type)) {
3974 inner = skip_typeref(type->pointer.points_to);
3975 } else if(is_type_array(type)) {
3976 inner = skip_typeref(type->array.element_type);
3981 return is_type_integer(inner);
3984 static ir_initializer_t *create_ir_initializer_list(
3985 const initializer_list_t *initializer, type_t *type)
3988 memset(&path, 0, sizeof(path));
3989 path.top_type = type;
3990 path.path = NEW_ARR_F(type_path_entry_t, 0);
3992 descend_into_subtype(&path);
3994 for (size_t i = 0; i < initializer->len; ++i) {
3995 const initializer_t *sub_initializer = initializer->initializers[i];
3997 if (sub_initializer->kind == INITIALIZER_DESIGNATOR) {
3998 walk_designator(&path, sub_initializer->designator.designator);
4002 if (sub_initializer->kind == INITIALIZER_VALUE) {
4003 /* we might have to descend into types until we're at a scalar
4006 type_t *orig_top_type = path.top_type;
4007 type_t *top_type = skip_typeref(orig_top_type);
4009 if (is_type_scalar(top_type))
4011 descend_into_subtype(&path);
4013 } else if (sub_initializer->kind == INITIALIZER_STRING
4014 || sub_initializer->kind == INITIALIZER_WIDE_STRING) {
4015 /* we might have to descend into types until we're at a scalar
4018 type_t *orig_top_type = path.top_type;
4019 type_t *top_type = skip_typeref(orig_top_type);
4021 if (is_string_type(top_type))
4023 descend_into_subtype(&path);
4027 ir_initializer_t *sub_irinitializer
4028 = create_ir_initializer(sub_initializer, path.top_type);
4030 size_t path_len = ARR_LEN(path.path);
4031 assert(path_len >= 1);
4032 type_path_entry_t *entry = & path.path[path_len-1];
4033 ir_initializer_t *tinitializer = entry->initializer;
4034 set_initializer_compound_value(tinitializer, entry->index,
4037 advance_current_object(&path);
4040 assert(ARR_LEN(path.path) >= 1);
4041 ir_initializer_t *result = path.path[0].initializer;
4042 DEL_ARR_F(path.path);
4047 static ir_initializer_t *create_ir_initializer_string(
4048 const initializer_string_t *initializer, type_t *type)
4050 type = skip_typeref(type);
4052 size_t string_len = initializer->string.size;
4053 assert(type->kind == TYPE_ARRAY);
4054 assert(type->array.size_constant);
4055 size_t len = type->array.size;
4056 ir_initializer_t *irinitializer = create_initializer_compound(len);
4058 const char *string = initializer->string.begin;
4059 ir_mode *mode = get_ir_mode_storage(type->array.element_type);
4061 for (size_t i = 0; i < len; ++i) {
4066 ir_tarval *tv = new_tarval_from_long(c, mode);
4067 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4069 set_initializer_compound_value(irinitializer, i, char_initializer);
4072 return irinitializer;
4075 static ir_initializer_t *create_ir_initializer_wide_string(
4076 const initializer_wide_string_t *initializer, type_t *type)
4078 assert(type->kind == TYPE_ARRAY);
4079 assert(type->array.size_constant);
4080 size_t len = type->array.size;
4081 size_t string_len = wstrlen(&initializer->string);
4082 ir_initializer_t *irinitializer = create_initializer_compound(len);
4084 const char *p = initializer->string.begin;
4085 ir_mode *mode = get_type_mode(ir_type_wchar_t);
4087 for (size_t i = 0; i < len; ++i) {
4089 if (i < string_len) {
4090 c = read_utf8_char(&p);
4092 ir_tarval *tv = new_tarval_from_long(c, mode);
4093 ir_initializer_t *char_initializer = create_initializer_tarval(tv);
4095 set_initializer_compound_value(irinitializer, i, char_initializer);
4098 return irinitializer;
4101 static ir_initializer_t *create_ir_initializer(
4102 const initializer_t *initializer, type_t *type)
4104 switch(initializer->kind) {
4105 case INITIALIZER_STRING:
4106 return create_ir_initializer_string(&initializer->string, type);
4108 case INITIALIZER_WIDE_STRING:
4109 return create_ir_initializer_wide_string(&initializer->wide_string,
4112 case INITIALIZER_LIST:
4113 return create_ir_initializer_list(&initializer->list, type);
4115 case INITIALIZER_VALUE:
4116 return create_ir_initializer_value(&initializer->value);
4118 case INITIALIZER_DESIGNATOR:
4119 panic("unexpected designator initializer found");
4121 panic("unknown initializer");
4124 /** ANSI C ยง6.7.8:21: If there are fewer initializers [..] than there
4125 * are elements [...] the remainder of the aggregate shall be initialized
4126 * implicitly the same as objects that have static storage duration. */
4127 static void create_dynamic_null_initializer(ir_entity *entity, dbg_info *dbgi,
4130 /* for unions we must NOT do anything for null initializers */
4131 ir_type *owner = get_entity_owner(entity);
4132 if (is_Union_type(owner)) {
4136 ir_type *ent_type = get_entity_type(entity);
4137 /* create sub-initializers for a compound type */
4138 if (is_compound_type(ent_type)) {
4139 unsigned n_members = get_compound_n_members(ent_type);
4140 for (unsigned n = 0; n < n_members; ++n) {
4141 ir_entity *member = get_compound_member(ent_type, n);
4142 ir_node *addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4144 create_dynamic_null_initializer(member, dbgi, addr);
4148 if (is_Array_type(ent_type)) {
4149 assert(has_array_upper_bound(ent_type, 0));
4150 long n = get_array_upper_bound_int(ent_type, 0);
4151 for (long i = 0; i < n; ++i) {
4152 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4153 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4154 ir_node *cnst = new_d_Const(dbgi, index_tv);
4155 ir_node *in[1] = { cnst };
4156 ir_entity *arrent = get_array_element_entity(ent_type);
4157 ir_node *addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4159 create_dynamic_null_initializer(arrent, dbgi, addr);
4164 ir_mode *value_mode = get_type_mode(ent_type);
4165 ir_node *node = new_Const(get_mode_null(value_mode));
4167 /* is it a bitfield type? */
4168 if (is_Primitive_type(ent_type) &&
4169 get_primitive_base_type(ent_type) != NULL) {
4170 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4174 ir_node *mem = get_store();
4175 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4176 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4180 static void create_dynamic_initializer_sub(ir_initializer_t *initializer,
4181 ir_entity *entity, ir_type *type, dbg_info *dbgi, ir_node *base_addr)
4183 switch(get_initializer_kind(initializer)) {
4184 case IR_INITIALIZER_NULL:
4185 create_dynamic_null_initializer(entity, dbgi, base_addr);
4187 case IR_INITIALIZER_CONST: {
4188 ir_node *node = get_initializer_const_value(initializer);
4189 ir_type *ent_type = get_entity_type(entity);
4191 /* is it a bitfield type? */
4192 if (is_Primitive_type(ent_type) &&
4193 get_primitive_base_type(ent_type) != NULL) {
4194 bitfield_store_to_firm(dbgi, entity, base_addr, node, false, false);
4198 assert(get_type_mode(type) == get_irn_mode(node));
4199 ir_node *mem = get_store();
4200 ir_node *store = new_d_Store(dbgi, mem, base_addr, node, cons_none);
4201 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4205 case IR_INITIALIZER_TARVAL: {
4206 ir_tarval *tv = get_initializer_tarval_value(initializer);
4207 ir_node *cnst = new_d_Const(dbgi, tv);
4208 ir_type *ent_type = get_entity_type(entity);
4210 /* is it a bitfield type? */
4211 if (is_Primitive_type(ent_type) &&
4212 get_primitive_base_type(ent_type) != NULL) {
4213 bitfield_store_to_firm(dbgi, entity, base_addr, cnst, false, false);
4217 assert(get_type_mode(type) == get_tarval_mode(tv));
4218 ir_node *mem = get_store();
4219 ir_node *store = new_d_Store(dbgi, mem, base_addr, cnst, cons_none);
4220 ir_node *proj_m = new_Proj(store, mode_M, pn_Store_M);
4224 case IR_INITIALIZER_COMPOUND: {
4225 assert(is_compound_type(type) || is_Array_type(type));
4227 if (is_Array_type(type)) {
4228 assert(has_array_upper_bound(type, 0));
4229 n_members = get_array_upper_bound_int(type, 0);
4231 n_members = get_compound_n_members(type);
4234 if (get_initializer_compound_n_entries(initializer)
4235 != (unsigned) n_members)
4236 panic("initializer doesn't match compound type");
4238 for (int i = 0; i < n_members; ++i) {
4241 ir_entity *sub_entity;
4242 if (is_Array_type(type)) {
4243 ir_mode *mode_uint = atomic_modes[ATOMIC_TYPE_UINT];
4244 ir_tarval *index_tv = new_tarval_from_long(i, mode_uint);
4245 ir_node *cnst = new_d_Const(dbgi, index_tv);
4246 ir_node *in[1] = { cnst };
4247 irtype = get_array_element_type(type);
4248 sub_entity = get_array_element_entity(type);
4249 addr = new_d_Sel(dbgi, new_NoMem(), base_addr, 1, in,
4252 sub_entity = get_compound_member(type, i);
4253 irtype = get_entity_type(sub_entity);
4254 addr = new_d_simpleSel(dbgi, new_NoMem(), base_addr,
4258 ir_initializer_t *sub_init
4259 = get_initializer_compound_value(initializer, i);
4261 create_dynamic_initializer_sub(sub_init, sub_entity, irtype, dbgi,
4268 panic("invalid IR_INITIALIZER found");
4271 static void create_dynamic_initializer(ir_initializer_t *initializer,
4272 dbg_info *dbgi, ir_entity *entity)
4274 ir_node *frame = get_irg_frame(current_ir_graph);
4275 ir_node *base_addr = new_d_simpleSel(dbgi, new_NoMem(), frame, entity);
4276 ir_type *type = get_entity_type(entity);
4278 create_dynamic_initializer_sub(initializer, entity, type, dbgi, base_addr);
4281 static void create_local_initializer(initializer_t *initializer, dbg_info *dbgi,
4282 ir_entity *entity, type_t *type)
4284 ir_node *memory = get_store();
4285 ir_node *nomem = new_NoMem();
4286 ir_node *frame = get_irg_frame(current_ir_graph);
4287 ir_node *addr = new_d_simpleSel(dbgi, nomem, frame, entity);
4289 if (initializer->kind == INITIALIZER_VALUE) {
4290 initializer_value_t *initializer_value = &initializer->value;
4292 ir_node *value = expression_to_firm(initializer_value->value);
4293 type = skip_typeref(type);
4294 assign_value(dbgi, addr, type, value);
4298 if (is_constant_initializer(initializer) == EXPR_CLASS_VARIABLE) {
4299 ir_initializer_t *irinitializer
4300 = create_ir_initializer(initializer, type);
4302 create_dynamic_initializer(irinitializer, dbgi, entity);
4306 /* create a "template" entity which is copied to the entity on the stack */
4307 ir_entity *const init_entity
4308 = create_initializer_entity(dbgi, initializer, type);
4309 ir_node *const src_addr = create_symconst(dbgi, init_entity);
4310 ir_type *const irtype = get_ir_type(type);
4311 ir_node *const copyb = new_d_CopyB(dbgi, memory, addr, src_addr, irtype);
4313 ir_node *const copyb_mem = new_Proj(copyb, mode_M, pn_CopyB_M);
4314 set_store(copyb_mem);
4317 static void create_initializer_local_variable_entity(entity_t *entity)
4319 assert(entity->kind == ENTITY_VARIABLE);
4320 initializer_t *initializer = entity->variable.initializer;
4321 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4322 ir_entity *irentity = entity->variable.v.entity;
4323 type_t *type = entity->declaration.type;
4325 create_local_initializer(initializer, dbgi, irentity, type);
4328 static void create_variable_initializer(entity_t *entity)
4330 assert(entity->kind == ENTITY_VARIABLE);
4331 initializer_t *initializer = entity->variable.initializer;
4332 if (initializer == NULL)
4335 declaration_kind_t declaration_kind
4336 = (declaration_kind_t) entity->declaration.kind;
4337 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY) {
4338 create_initializer_local_variable_entity(entity);
4342 type_t *type = entity->declaration.type;
4343 type_qualifiers_t tq = get_type_qualifier(type, true);
4345 if (initializer->kind == INITIALIZER_VALUE) {
4346 initializer_value_t *initializer_value = &initializer->value;
4347 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4348 expression_t *value = initializer_value->value;
4349 type_t *init_type = value->base.type;
4350 type_t *skipped = skip_typeref(init_type);
4352 if (!is_type_scalar(skipped)) {
4354 while (value->kind == EXPR_UNARY_CAST)
4355 value = value->unary.value;
4357 if (value->kind != EXPR_COMPOUND_LITERAL)
4358 panic("expected non-scalar initializer to be a compound literal");
4359 initializer = value->compound_literal.initializer;
4360 goto have_initializer;
4363 ir_node *node = expression_to_firm(initializer_value->value);
4365 ir_mode *mode = get_ir_mode_storage(init_type);
4366 node = create_conv(dbgi, node, mode);
4367 node = do_strict_conv(dbgi, node);
4369 if (declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE) {
4370 set_value(entity->variable.v.value_number, node);
4372 assert(declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4374 ir_entity *irentity = entity->variable.v.entity;
4376 if (tq & TYPE_QUALIFIER_CONST
4377 && get_entity_owner(irentity) != get_tls_type()) {
4378 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4380 set_atomic_ent_value(irentity, node);
4384 assert(declaration_kind == DECLARATION_KIND_LOCAL_VARIABLE_ENTITY ||
4385 declaration_kind == DECLARATION_KIND_GLOBAL_VARIABLE);
4387 ir_entity *irentity = entity->variable.v.entity;
4388 ir_initializer_t *irinitializer
4389 = create_ir_initializer(initializer, type);
4391 if (tq & TYPE_QUALIFIER_CONST) {
4392 add_entity_linkage(irentity, IR_LINKAGE_CONSTANT);
4394 set_entity_initializer(irentity, irinitializer);
4398 static void create_variable_length_array(entity_t *entity)
4400 assert(entity->kind == ENTITY_VARIABLE);
4401 assert(entity->variable.initializer == NULL);
4403 entity->declaration.kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
4404 entity->variable.v.vla_base = NULL;
4406 /* TODO: record VLA somewhere so we create the free node when we leave
4410 static void allocate_variable_length_array(entity_t *entity)
4412 assert(entity->kind == ENTITY_VARIABLE);
4413 assert(entity->variable.initializer == NULL);
4414 assert(currently_reachable());
4416 dbg_info *dbgi = get_dbg_info(&entity->base.source_position);
4417 type_t *type = entity->declaration.type;
4418 ir_type *el_type = get_ir_type(type->array.element_type);
4420 /* make sure size_node is calculated */
4421 get_type_size_node(type);
4422 ir_node *elems = type->array.size_node;
4423 ir_node *mem = get_store();
4424 ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
4426 ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
4427 ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
4430 assert(entity->declaration.kind == DECLARATION_KIND_VARIABLE_LENGTH_ARRAY);
4431 entity->variable.v.vla_base = addr;
4435 * Creates a Firm local variable from a declaration.
4437 static void create_local_variable(entity_t *entity)
4439 assert(entity->kind == ENTITY_VARIABLE);
4440 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4442 bool needs_entity = entity->variable.address_taken;
4443 type_t *type = skip_typeref(entity->declaration.type);
4445 /* is it a variable length array? */
4446 if (is_type_array(type) && !type->array.size_constant) {
4447 create_variable_length_array(entity);
4449 } else if (is_type_array(type) || is_type_compound(type)) {
4450 needs_entity = true;
4451 } else if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4452 needs_entity = true;
4456 ir_type *frame_type = get_irg_frame_type(current_ir_graph);
4457 create_variable_entity(entity,
4458 DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
4461 entity->declaration.kind = DECLARATION_KIND_LOCAL_VARIABLE;
4462 entity->variable.v.value_number = next_value_number_function;
4463 set_irg_loc_description(current_ir_graph, next_value_number_function,
4465 ++next_value_number_function;
4469 static void create_local_static_variable(entity_t *entity)
4471 assert(entity->kind == ENTITY_VARIABLE);
4472 assert(entity->declaration.kind == DECLARATION_KIND_UNKNOWN);
4474 type_t *type = skip_typeref(entity->declaration.type);
4475 ir_type *const var_type = entity->variable.thread_local ?
4476 get_tls_type() : get_glob_type();
4477 ir_type *const irtype = get_ir_type(type);
4478 dbg_info *const dbgi = get_dbg_info(&entity->base.source_position);
4480 size_t l = strlen(entity->base.symbol->string);
4481 char buf[l + sizeof(".%u")];
4482 snprintf(buf, sizeof(buf), "%s.%%u", entity->base.symbol->string);
4483 ident *const id = id_unique(buf);
4484 ir_entity *const irentity = new_d_entity(var_type, id, irtype, dbgi);
4486 if (type->base.qualifiers & TYPE_QUALIFIER_VOLATILE) {
4487 set_entity_volatility(irentity, volatility_is_volatile);
4490 entity->declaration.kind = DECLARATION_KIND_GLOBAL_VARIABLE;
4491 entity->variable.v.entity = irentity;
4493 set_entity_ld_ident(irentity, id);
4494 set_entity_visibility(irentity, ir_visibility_local);
4496 ir_graph *const old_current_ir_graph = current_ir_graph;
4497 current_ir_graph = get_const_code_irg();
4499 create_variable_initializer(entity);
4501 assert(current_ir_graph == get_const_code_irg());
4502 current_ir_graph = old_current_ir_graph;
4507 static void return_statement_to_firm(return_statement_t *statement)
4509 if (!currently_reachable())
4512 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4513 type_t *type = current_function_entity->declaration.type;
4514 ir_type *func_irtype = get_ir_type(type);
4518 if (get_method_n_ress(func_irtype) > 0) {
4519 ir_type *res_type = get_method_res_type(func_irtype, 0);
4521 if (statement->value != NULL) {
4522 ir_node *node = expression_to_firm(statement->value);
4523 if (!is_compound_type(res_type)) {
4524 type_t *ret_value_type = statement->value->base.type;
4525 ir_mode *mode = get_ir_mode_storage(ret_value_type);
4526 node = create_conv(dbgi, node, mode);
4527 node = do_strict_conv(dbgi, node);
4532 if (is_compound_type(res_type)) {
4535 mode = get_type_mode(res_type);
4537 in[0] = new_Unknown(mode);
4541 /* build return_value for its side effects */
4542 if (statement->value != NULL) {
4543 expression_to_firm(statement->value);
4548 ir_node *store = get_store();
4549 ir_node *ret = new_d_Return(dbgi, store, in_len, in);
4551 ir_node *end_block = get_irg_end_block(current_ir_graph);
4552 add_immBlock_pred(end_block, ret);
4554 set_unreachable_now();
4557 static ir_node *expression_statement_to_firm(expression_statement_t *statement)
4559 if (!currently_reachable())
4562 return expression_to_firm(statement->expression);
4565 static ir_node *compound_statement_to_firm(compound_statement_t *compound)
4567 entity_t *entity = compound->scope.entities;
4568 for ( ; entity != NULL; entity = entity->base.next) {
4569 if (!is_declaration(entity))
4572 create_local_declaration(entity);
4575 ir_node *result = NULL;
4576 statement_t *statement = compound->statements;
4577 for ( ; statement != NULL; statement = statement->base.next) {
4578 if (statement->base.next == NULL
4579 && statement->kind == STATEMENT_EXPRESSION) {
4580 result = expression_statement_to_firm(
4581 &statement->expression);
4584 statement_to_firm(statement);
4590 static void create_global_variable(entity_t *entity)
4592 ir_linkage linkage = IR_LINKAGE_DEFAULT;
4593 ir_visibility visibility = ir_visibility_default;
4594 ir_entity *irentity;
4595 assert(entity->kind == ENTITY_VARIABLE);
4597 switch ((storage_class_tag_t)entity->declaration.storage_class) {
4598 case STORAGE_CLASS_EXTERN: visibility = ir_visibility_external; break;
4599 case STORAGE_CLASS_STATIC: visibility = ir_visibility_local; break;
4600 case STORAGE_CLASS_NONE:
4601 visibility = ir_visibility_default;
4602 /* uninitialized globals get merged in C */
4603 if (entity->variable.initializer == NULL)
4604 linkage |= IR_LINKAGE_MERGE;
4606 case STORAGE_CLASS_TYPEDEF:
4607 case STORAGE_CLASS_AUTO:
4608 case STORAGE_CLASS_REGISTER:
4609 panic("invalid storage class for global var");
4612 ir_type *var_type = get_glob_type();
4613 if (entity->variable.thread_local) {
4614 var_type = get_tls_type();
4615 /* LINKAGE_MERGE not supported by current linkers */
4616 linkage &= ~IR_LINKAGE_MERGE;
4618 create_variable_entity(entity, DECLARATION_KIND_GLOBAL_VARIABLE, var_type);
4619 irentity = entity->variable.v.entity;
4620 add_entity_linkage(irentity, linkage);
4621 set_entity_visibility(irentity, visibility);
4624 static void create_local_declaration(entity_t *entity)
4626 assert(is_declaration(entity));
4628 /* construct type */
4629 (void) get_ir_type(entity->declaration.type);
4630 if (entity->base.symbol == NULL) {
4634 switch ((storage_class_tag_t) entity->declaration.storage_class) {
4635 case STORAGE_CLASS_STATIC:
4636 if (entity->kind == ENTITY_FUNCTION) {
4637 (void)get_function_entity(entity, NULL);
4639 create_local_static_variable(entity);
4642 case STORAGE_CLASS_EXTERN:
4643 if (entity->kind == ENTITY_FUNCTION) {
4644 assert(entity->function.statement == NULL);
4645 (void)get_function_entity(entity, NULL);
4647 create_global_variable(entity);
4648 create_variable_initializer(entity);
4651 case STORAGE_CLASS_NONE:
4652 case STORAGE_CLASS_AUTO:
4653 case STORAGE_CLASS_REGISTER:
4654 if (entity->kind == ENTITY_FUNCTION) {
4655 if (entity->function.statement != NULL) {
4656 ir_type *owner = get_irg_frame_type(current_ir_graph);
4657 (void)get_function_entity(entity, owner);
4658 entity->declaration.kind = DECLARATION_KIND_INNER_FUNCTION;
4659 enqueue_inner_function(entity);
4661 (void)get_function_entity(entity, NULL);
4664 create_local_variable(entity);
4667 case STORAGE_CLASS_TYPEDEF:
4670 panic("invalid storage class found");
4673 static void initialize_local_declaration(entity_t *entity)
4675 if (entity->base.symbol == NULL)
4678 // no need to emit code in dead blocks
4679 if (entity->declaration.storage_class != STORAGE_CLASS_STATIC
4680 && !currently_reachable())
4683 switch ((declaration_kind_t) entity->declaration.kind) {
4684 case DECLARATION_KIND_LOCAL_VARIABLE:
4685 case DECLARATION_KIND_LOCAL_VARIABLE_ENTITY:
4686 create_variable_initializer(entity);
4689 case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
4690 allocate_variable_length_array(entity);
4693 case DECLARATION_KIND_COMPOUND_MEMBER:
4694 case DECLARATION_KIND_GLOBAL_VARIABLE:
4695 case DECLARATION_KIND_FUNCTION:
4696 case DECLARATION_KIND_INNER_FUNCTION:
4699 case DECLARATION_KIND_PARAMETER:
4700 case DECLARATION_KIND_PARAMETER_ENTITY:
4701 panic("can't initialize parameters");
4703 case DECLARATION_KIND_UNKNOWN:
4704 panic("can't initialize unknown declaration");
4706 panic("invalid declaration kind");
4709 static void declaration_statement_to_firm(declaration_statement_t *statement)
4711 entity_t *entity = statement->declarations_begin;
4715 entity_t *const last = statement->declarations_end;
4716 for ( ;; entity = entity->base.next) {
4717 if (is_declaration(entity)) {
4718 initialize_local_declaration(entity);
4719 } else if (entity->kind == ENTITY_TYPEDEF) {
4720 /* ยง6.7.7:3 Any array size expressions associated with variable length
4721 * array declarators are evaluated each time the declaration of the
4722 * typedef name is reached in the order of execution. */
4723 type_t *const type = skip_typeref(entity->typedefe.type);
4724 if (is_type_array(type) && type->array.is_vla)
4725 get_vla_size(&type->array);
4732 static void if_statement_to_firm(if_statement_t *statement)
4734 /* Create the condition. */
4735 ir_node *true_block = NULL;
4736 ir_node *false_block = NULL;
4737 if (currently_reachable()) {
4738 true_block = new_immBlock();
4739 false_block = new_immBlock();
4740 create_condition_evaluation(statement->condition, true_block, false_block);
4741 mature_immBlock(true_block);
4742 mature_immBlock(false_block);
4745 /* Create the true statement. */
4746 set_cur_block(true_block);
4747 statement_to_firm(statement->true_statement);
4748 ir_node *fallthrough_block = get_cur_block();
4750 /* Create the false statement. */
4751 set_cur_block(false_block);
4752 if (statement->false_statement != NULL) {
4753 statement_to_firm(statement->false_statement);
4756 /* Handle the block after the if-statement. Minor simplification and
4757 * optimisation: Reuse the false/true block as fallthrough block, if the
4758 * true/false statement does not pass control to the fallthrough block, e.g.
4759 * in the typical if (x) return; pattern. */
4760 if (fallthrough_block) {
4761 if (currently_reachable()) {
4762 ir_node *const t_jump = new_r_Jmp(fallthrough_block);
4763 ir_node *const f_jump = new_Jmp();
4764 ir_node *const in[] = { t_jump, f_jump };
4765 fallthrough_block = new_Block(2, in);
4767 set_cur_block(fallthrough_block);
4771 /* Create a jump node which jumps into target_block, if the current block is
4773 static void jump_if_reachable(ir_node *const target_block)
4775 ir_node *const pred = currently_reachable() ? new_Jmp() : new_Bad(mode_X);
4776 add_immBlock_pred(target_block, pred);
4779 static void while_statement_to_firm(while_statement_t *statement)
4781 /* Create the header block */
4782 ir_node *const header_block = new_immBlock();
4783 jump_if_reachable(header_block);
4785 /* Create the condition. */
4786 ir_node * body_block;
4787 ir_node * false_block;
4788 expression_t *const cond = statement->condition;
4789 if (is_constant_expression(cond) == EXPR_CLASS_CONSTANT &&
4790 fold_constant_to_bool(cond)) {
4791 /* Shortcut for while (true). */
4792 body_block = header_block;
4795 keep_alive(header_block);
4796 keep_all_memory(header_block);
4798 body_block = new_immBlock();
4799 false_block = new_immBlock();
4801 set_cur_block(header_block);
4802 create_condition_evaluation(cond, body_block, false_block);
4803 mature_immBlock(body_block);
4806 ir_node *const old_continue_label = continue_label;
4807 ir_node *const old_break_label = break_label;
4808 continue_label = header_block;
4809 break_label = false_block;
4811 /* Create the loop body. */
4812 set_cur_block(body_block);
4813 statement_to_firm(statement->body);
4814 jump_if_reachable(header_block);
4816 mature_immBlock(header_block);
4817 assert(false_block == NULL || false_block == break_label);
4818 false_block = break_label;
4819 if (false_block != NULL) {
4820 mature_immBlock(false_block);
4822 set_cur_block(false_block);
4824 assert(continue_label == header_block);
4825 continue_label = old_continue_label;
4826 break_label = old_break_label;
4829 static ir_node *get_break_label(void)
4831 if (break_label == NULL) {
4832 break_label = new_immBlock();
4837 static void do_while_statement_to_firm(do_while_statement_t *statement)
4839 /* create the header block */
4840 ir_node *header_block = new_immBlock();
4843 ir_node *body_block = new_immBlock();
4844 jump_if_reachable(body_block);
4846 ir_node *old_continue_label = continue_label;
4847 ir_node *old_break_label = break_label;
4848 continue_label = header_block;
4851 set_cur_block(body_block);
4852 statement_to_firm(statement->body);
4853 ir_node *const false_block = get_break_label();
4855 assert(continue_label == header_block);
4856 continue_label = old_continue_label;
4857 break_label = old_break_label;
4859 jump_if_reachable(header_block);
4861 /* create the condition */
4862 mature_immBlock(header_block);
4863 set_cur_block(header_block);
4865 create_condition_evaluation(statement->condition, body_block, false_block);
4866 mature_immBlock(body_block);
4867 mature_immBlock(false_block);
4869 set_cur_block(false_block);
4872 static void for_statement_to_firm(for_statement_t *statement)
4874 /* create declarations */
4875 entity_t *entity = statement->scope.entities;
4876 for ( ; entity != NULL; entity = entity->base.next) {
4877 if (!is_declaration(entity))
4880 create_local_declaration(entity);
4883 if (currently_reachable()) {
4884 entity = statement->scope.entities;
4885 for ( ; entity != NULL; entity = entity->base.next) {
4886 if (!is_declaration(entity))
4889 initialize_local_declaration(entity);
4892 if (statement->initialisation != NULL) {
4893 expression_to_firm(statement->initialisation);
4897 /* Create the header block */
4898 ir_node *const header_block = new_immBlock();
4899 jump_if_reachable(header_block);
4901 /* Create the condition. */
4902 ir_node *body_block;
4903 ir_node *false_block;
4904 if (statement->condition != NULL) {
4905 body_block = new_immBlock();
4906 false_block = new_immBlock();
4908 set_cur_block(header_block);
4909 create_condition_evaluation(statement->condition, body_block, false_block);
4910 mature_immBlock(body_block);
4913 body_block = header_block;
4916 keep_alive(header_block);
4917 keep_all_memory(header_block);
4920 /* Create the step block, if necessary. */
4921 ir_node * step_block = header_block;
4922 expression_t *const step = statement->step;
4924 step_block = new_immBlock();
4927 ir_node *const old_continue_label = continue_label;
4928 ir_node *const old_break_label = break_label;
4929 continue_label = step_block;
4930 break_label = false_block;
4932 /* Create the loop body. */
4933 set_cur_block(body_block);
4934 statement_to_firm(statement->body);
4935 jump_if_reachable(step_block);
4937 /* Create the step code. */
4939 mature_immBlock(step_block);
4940 set_cur_block(step_block);
4941 expression_to_firm(step);
4942 jump_if_reachable(header_block);
4945 mature_immBlock(header_block);
4946 assert(false_block == NULL || false_block == break_label);
4947 false_block = break_label;
4948 if (false_block != NULL) {
4949 mature_immBlock(false_block);
4951 set_cur_block(false_block);
4953 assert(continue_label == step_block);
4954 continue_label = old_continue_label;
4955 break_label = old_break_label;
4958 static void create_jump_statement(const statement_t *statement,
4959 ir_node *target_block)
4961 if (!currently_reachable())
4964 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
4965 ir_node *jump = new_d_Jmp(dbgi);
4966 add_immBlock_pred(target_block, jump);
4968 set_unreachable_now();
4971 static ir_switch_table *create_switch_table(const switch_statement_t *statement)
4973 /* determine number of cases */
4975 for (case_label_statement_t *l = statement->first_case; l != NULL;
4978 if (l->expression == NULL)
4980 if (l->is_empty_range)
4985 ir_switch_table *res = ir_new_switch_table(current_ir_graph, n_cases);
4987 for (case_label_statement_t *l = statement->first_case; l != NULL;
4989 if (l->expression == NULL) {
4990 l->pn = pn_Switch_default;
4993 if (l->is_empty_range)
4995 ir_tarval *min = fold_constant_to_tarval(l->expression);
4996 ir_tarval *max = min;
4997 long pn = (long) i+1;
4998 if (l->end_range != NULL)
4999 max = fold_constant_to_tarval(l->end_range);
5000 ir_switch_table_set(res, i++, min, max, pn);
5006 static void switch_statement_to_firm(switch_statement_t *statement)
5008 ir_node *first_block = NULL;
5009 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5010 ir_node *switch_node = NULL;
5012 if (currently_reachable()) {
5013 ir_node *expression = expression_to_firm(statement->expression);
5014 ir_switch_table *table = create_switch_table(statement);
5015 unsigned n_outs = (unsigned)ir_switch_table_get_n_entries(table) + 1;
5017 switch_node = new_d_Switch(dbgi, expression, n_outs, table);
5018 first_block = get_cur_block();
5021 set_unreachable_now();
5023 ir_node *const old_switch = current_switch;
5024 ir_node *const old_break_label = break_label;
5025 const bool old_saw_default_label = saw_default_label;
5026 saw_default_label = false;
5027 current_switch = switch_node;
5030 statement_to_firm(statement->body);
5032 jump_if_reachable(get_break_label());
5034 if (!saw_default_label && first_block != NULL) {
5035 set_cur_block(first_block);
5036 ir_node *proj = new_d_Proj(dbgi, switch_node, mode_X, pn_Switch_default);
5037 add_immBlock_pred(get_break_label(), proj);
5040 if (break_label != NULL) {
5041 mature_immBlock(break_label);
5043 set_cur_block(break_label);
5045 assert(current_switch == switch_node);
5046 current_switch = old_switch;
5047 break_label = old_break_label;
5048 saw_default_label = old_saw_default_label;
5051 static void case_label_to_firm(const case_label_statement_t *statement)
5053 if (statement->is_empty_range)
5056 if (current_switch != NULL) {
5057 ir_node *block = new_immBlock();
5058 /* Fallthrough from previous case */
5059 jump_if_reachable(block);
5061 ir_node *const proj = new_Proj(current_switch, mode_X, statement->pn);
5062 add_immBlock_pred(block, proj);
5063 if (statement->expression == NULL)
5064 saw_default_label = true;
5066 mature_immBlock(block);
5067 set_cur_block(block);
5070 statement_to_firm(statement->statement);
5073 static void label_to_firm(const label_statement_t *statement)
5075 ir_node *block = get_label_block(statement->label);
5076 jump_if_reachable(block);
5078 set_cur_block(block);
5080 keep_all_memory(block);
5082 statement_to_firm(statement->statement);
5085 static void computed_goto_to_firm(computed_goto_statement_t const *const statement)
5087 if (!currently_reachable())
5090 ir_node *const irn = expression_to_firm(statement->expression);
5091 dbg_info *const dbgi = get_dbg_info(&statement->base.source_position);
5092 ir_node *const ijmp = new_d_IJmp(dbgi, irn);
5094 set_irn_link(ijmp, ijmp_list);
5097 set_unreachable_now();
5100 static void goto_to_firm(const goto_statement_t *statement)
5102 if (!currently_reachable())
5105 ir_node *block = get_label_block(statement->label);
5106 ir_node *jmp = new_Jmp();
5107 add_immBlock_pred(block, jmp);
5109 set_unreachable_now();
5112 static void asm_statement_to_firm(const asm_statement_t *statement)
5114 bool needs_memory = false;
5116 if (statement->is_volatile) {
5117 needs_memory = true;
5120 size_t n_clobbers = 0;
5121 asm_clobber_t *clobber = statement->clobbers;
5122 for ( ; clobber != NULL; clobber = clobber->next) {
5123 const char *clobber_str = clobber->clobber.begin;
5125 if (!be_is_valid_clobber(clobber_str)) {
5126 errorf(&statement->base.source_position,
5127 "invalid clobber '%s' specified", clobber->clobber);
5131 if (streq(clobber_str, "memory")) {
5132 needs_memory = true;
5136 ident *id = new_id_from_str(clobber_str);
5137 obstack_ptr_grow(&asm_obst, id);
5140 assert(obstack_object_size(&asm_obst) == n_clobbers * sizeof(ident*));
5141 ident **clobbers = NULL;
5142 if (n_clobbers > 0) {
5143 clobbers = obstack_finish(&asm_obst);
5146 size_t n_inputs = 0;
5147 asm_argument_t *argument = statement->inputs;
5148 for ( ; argument != NULL; argument = argument->next)
5150 size_t n_outputs = 0;
5151 argument = statement->outputs;
5152 for ( ; argument != NULL; argument = argument->next)
5155 unsigned next_pos = 0;
5157 ir_node *ins[n_inputs + n_outputs + 1];
5160 ir_asm_constraint tmp_in_constraints[n_outputs];
5162 const expression_t *out_exprs[n_outputs];
5163 ir_node *out_addrs[n_outputs];
5164 size_t out_size = 0;
5166 argument = statement->outputs;
5167 for ( ; argument != NULL; argument = argument->next) {
5168 const char *constraints = argument->constraints.begin;
5169 asm_constraint_flags_t asm_flags
5170 = be_parse_asm_constraints(constraints);
5173 source_position_t const *const pos = &statement->base.source_position;
5174 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5175 warningf(WARN_OTHER, pos, "some constraints in '%s' are not supported", constraints);
5177 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5178 errorf(pos, "some constraints in '%s' are invalid", constraints);
5181 if (! (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE)) {
5182 errorf(pos, "no write flag specified for output constraints '%s'", constraints);
5187 unsigned pos = next_pos++;
5188 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5189 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5190 expression_t *expr = argument->expression;
5191 ir_node *addr = expression_to_addr(expr);
5192 /* in+output, construct an artifical same_as constraint on the
5194 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ) {
5196 ir_node *value = get_value_from_lvalue(expr, addr);
5198 snprintf(buf, sizeof(buf), "%u", (unsigned) out_size);
5200 ir_asm_constraint constraint;
5201 constraint.pos = pos;
5202 constraint.constraint = new_id_from_str(buf);
5203 constraint.mode = get_ir_mode_storage(expr->base.type);
5204 tmp_in_constraints[in_size] = constraint;
5205 ins[in_size] = value;
5210 out_exprs[out_size] = expr;
5211 out_addrs[out_size] = addr;
5213 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5214 /* pure memory ops need no input (but we have to make sure we
5215 * attach to the memory) */
5216 assert(! (asm_flags &
5217 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5218 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5219 needs_memory = true;
5221 /* we need to attach the address to the inputs */
5222 expression_t *expr = argument->expression;
5224 ir_asm_constraint constraint;
5225 constraint.pos = pos;
5226 constraint.constraint = new_id_from_str(constraints);
5227 constraint.mode = mode_M;
5228 tmp_in_constraints[in_size] = constraint;
5230 ins[in_size] = expression_to_addr(expr);
5234 errorf(&statement->base.source_position,
5235 "only modifiers but no place set in constraints '%s'",
5240 ir_asm_constraint constraint;
5241 constraint.pos = pos;
5242 constraint.constraint = new_id_from_str(constraints);
5243 constraint.mode = get_ir_mode_storage(argument->expression->base.type);
5245 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5247 assert(obstack_object_size(&asm_obst)
5248 == out_size * sizeof(ir_asm_constraint));
5249 ir_asm_constraint *output_constraints = obstack_finish(&asm_obst);
5252 obstack_grow(&asm_obst, tmp_in_constraints,
5253 in_size * sizeof(tmp_in_constraints[0]));
5254 /* find and count input and output arguments */
5255 argument = statement->inputs;
5256 for ( ; argument != NULL; argument = argument->next) {
5257 const char *constraints = argument->constraints.begin;
5258 asm_constraint_flags_t asm_flags
5259 = be_parse_asm_constraints(constraints);
5261 if (asm_flags & ASM_CONSTRAINT_FLAG_NO_SUPPORT) {
5262 errorf(&statement->base.source_position,
5263 "some constraints in '%s' are not supported", constraints);
5266 if (asm_flags & ASM_CONSTRAINT_FLAG_INVALID) {
5267 errorf(&statement->base.source_position,
5268 "some constraints in '%s' are invalid", constraints);
5271 if (asm_flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE) {
5272 errorf(&statement->base.source_position,
5273 "write flag specified for input constraints '%s'",
5279 if ( (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE)
5280 || (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER) ) {
5281 /* we can treat this as "normal" input */
5282 input = expression_to_firm(argument->expression);
5283 } else if (asm_flags & ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP) {
5284 /* pure memory ops need no input (but we have to make sure we
5285 * attach to the memory) */
5286 assert(! (asm_flags &
5287 (ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE
5288 | ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER)));
5289 needs_memory = true;
5290 input = expression_to_addr(argument->expression);
5292 errorf(&statement->base.source_position,
5293 "only modifiers but no place set in constraints '%s'",
5298 ir_asm_constraint constraint;
5299 constraint.pos = next_pos++;
5300 constraint.constraint = new_id_from_str(constraints);
5301 constraint.mode = get_irn_mode(input);
5303 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5304 ins[in_size++] = input;
5308 ir_asm_constraint constraint;
5309 constraint.pos = next_pos++;
5310 constraint.constraint = new_id_from_str("");
5311 constraint.mode = mode_M;
5313 obstack_grow(&asm_obst, &constraint, sizeof(constraint));
5314 ins[in_size++] = get_store();
5317 assert(obstack_object_size(&asm_obst)
5318 == in_size * sizeof(ir_asm_constraint));
5319 ir_asm_constraint *input_constraints = obstack_finish(&asm_obst);
5321 /* create asm node */
5322 dbg_info *dbgi = get_dbg_info(&statement->base.source_position);
5324 ident *asm_text = new_id_from_str(statement->asm_text.begin);
5326 ir_node *node = new_d_ASM(dbgi, in_size, ins, input_constraints,
5327 out_size, output_constraints,
5328 n_clobbers, clobbers, asm_text);
5330 if (statement->is_volatile) {
5331 set_irn_pinned(node, op_pin_state_pinned);
5333 set_irn_pinned(node, op_pin_state_floats);
5336 /* create output projs & connect them */
5338 ir_node *projm = new_Proj(node, mode_M, out_size);
5343 for (i = 0; i < out_size; ++i) {
5344 const expression_t *out_expr = out_exprs[i];
5346 ir_mode *mode = get_ir_mode_storage(out_expr->base.type);
5347 ir_node *proj = new_Proj(node, mode, pn);
5348 ir_node *addr = out_addrs[i];
5350 set_value_for_expression_addr(out_expr, proj, addr);
5354 static void ms_try_statement_to_firm(ms_try_statement_t *statement)
5356 statement_to_firm(statement->try_statement);
5357 source_position_t const *const pos = &statement->base.source_position;
5358 warningf(WARN_OTHER, pos, "structured exception handling ignored");
5361 static void leave_statement_to_firm(leave_statement_t *statement)
5363 errorf(&statement->base.source_position, "__leave not supported yet");
5367 * Transform a statement.
5369 static void statement_to_firm(statement_t *statement)
5372 assert(!statement->base.transformed);
5373 statement->base.transformed = true;
5376 switch (statement->kind) {
5377 case STATEMENT_ERROR:
5378 panic("error statement found");
5379 case STATEMENT_EMPTY:
5382 case STATEMENT_COMPOUND:
5383 compound_statement_to_firm(&statement->compound);
5385 case STATEMENT_RETURN:
5386 return_statement_to_firm(&statement->returns);
5388 case STATEMENT_EXPRESSION:
5389 expression_statement_to_firm(&statement->expression);
5392 if_statement_to_firm(&statement->ifs);
5394 case STATEMENT_WHILE:
5395 while_statement_to_firm(&statement->whiles);
5397 case STATEMENT_DO_WHILE:
5398 do_while_statement_to_firm(&statement->do_while);
5400 case STATEMENT_DECLARATION:
5401 declaration_statement_to_firm(&statement->declaration);
5403 case STATEMENT_BREAK:
5404 create_jump_statement(statement, get_break_label());
5406 case STATEMENT_CONTINUE:
5407 create_jump_statement(statement, continue_label);
5409 case STATEMENT_SWITCH:
5410 switch_statement_to_firm(&statement->switchs);
5412 case STATEMENT_CASE_LABEL:
5413 case_label_to_firm(&statement->case_label);
5416 for_statement_to_firm(&statement->fors);
5418 case STATEMENT_LABEL:
5419 label_to_firm(&statement->label);
5421 case STATEMENT_COMPUTED_GOTO:
5422 computed_goto_to_firm(&statement->computed_goto);
5424 case STATEMENT_GOTO:
5425 goto_to_firm(&statement->gotos);
5428 asm_statement_to_firm(&statement->asms);
5430 case STATEMENT_MS_TRY:
5431 ms_try_statement_to_firm(&statement->ms_try);
5433 case STATEMENT_LEAVE:
5434 leave_statement_to_firm(&statement->leave);
5437 panic("statement not implemented");
5440 static int count_local_variables(const entity_t *entity,
5441 const entity_t *const last)
5444 entity_t const *const end = last != NULL ? last->base.next : NULL;
5445 for (; entity != end; entity = entity->base.next) {
5449 if (entity->kind == ENTITY_VARIABLE) {
5450 type = skip_typeref(entity->declaration.type);
5451 address_taken = entity->variable.address_taken;
5452 } else if (entity->kind == ENTITY_PARAMETER) {
5453 type = skip_typeref(entity->declaration.type);
5454 address_taken = entity->parameter.address_taken;
5459 if (!address_taken && is_type_scalar(type))
5465 static void count_local_variables_in_stmt(statement_t *stmt, void *const env)
5467 int *const count = env;
5469 switch (stmt->kind) {
5470 case STATEMENT_DECLARATION: {
5471 const declaration_statement_t *const decl_stmt = &stmt->declaration;
5472 *count += count_local_variables(decl_stmt->declarations_begin,
5473 decl_stmt->declarations_end);
5478 *count += count_local_variables(stmt->fors.scope.entities, NULL);
5487 * Return the number of local (alias free) variables used by a function.
5489 static int get_function_n_local_vars(entity_t *entity)
5491 const function_t *function = &entity->function;
5494 /* count parameters */
5495 count += count_local_variables(function->parameters.entities, NULL);
5497 /* count local variables declared in body */
5498 walk_statements(function->statement, count_local_variables_in_stmt, &count);
5503 * Build Firm code for the parameters of a function.
5505 static void initialize_function_parameters(entity_t *entity)
5507 assert(entity->kind == ENTITY_FUNCTION);
5508 ir_graph *irg = current_ir_graph;
5509 ir_node *args = get_irg_args(irg);
5511 ir_type *function_irtype;
5513 if (entity->function.need_closure) {
5514 /* add an extra parameter for the static link */
5515 entity->function.static_link = new_r_Proj(args, mode_P_data, 0);
5518 /* Matze: IMO this is wrong, nested functions should have an own
5519 * type and not rely on strange parameters... */
5520 function_irtype = create_method_type(&entity->declaration.type->function, true);
5522 function_irtype = get_ir_type(entity->declaration.type);
5527 entity_t *parameter = entity->function.parameters.entities;
5528 for ( ; parameter != NULL; parameter = parameter->base.next, ++n) {
5529 if (parameter->kind != ENTITY_PARAMETER)
5532 assert(parameter->declaration.kind == DECLARATION_KIND_UNKNOWN);
5533 type_t *type = skip_typeref(parameter->declaration.type);
5535 bool needs_entity = parameter->parameter.address_taken;
5536 assert(!is_type_array(type));
5537 if (is_type_compound(type)) {
5538 needs_entity = true;
5541 ir_type *param_irtype = get_method_param_type(function_irtype, n);
5543 ir_type *frame_type = get_irg_frame_type(irg);
5545 = new_parameter_entity(frame_type, n, param_irtype);
5546 parameter->declaration.kind
5547 = DECLARATION_KIND_PARAMETER_ENTITY;
5548 parameter->parameter.v.entity = param;
5552 ir_mode *param_mode = get_type_mode(param_irtype);
5554 ir_node *value = new_r_Proj(args, param_mode, pn);
5556 ir_mode *mode = get_ir_mode_storage(type);
5557 value = create_conv(NULL, value, mode);
5558 value = do_strict_conv(NULL, value);
5560 parameter->declaration.kind = DECLARATION_KIND_PARAMETER;
5561 parameter->parameter.v.value_number = next_value_number_function;
5562 set_irg_loc_description(current_ir_graph, next_value_number_function,
5564 ++next_value_number_function;
5566 set_value(parameter->parameter.v.value_number, value);
5571 * Handle additional decl modifiers for IR-graphs
5573 * @param irg the IR-graph
5574 * @param dec_modifiers additional modifiers
5576 static void handle_decl_modifier_irg(ir_graph *irg,
5577 decl_modifiers_t decl_modifiers)
5579 if (decl_modifiers & DM_NAKED) {
5580 /* TRUE if the declaration includes the Microsoft
5581 __declspec(naked) specifier. */
5582 add_irg_additional_properties(irg, mtp_property_naked);
5584 if (decl_modifiers & DM_FORCEINLINE) {
5585 /* TRUE if the declaration includes the
5586 Microsoft __forceinline specifier. */
5587 set_irg_inline_property(irg, irg_inline_forced);
5589 if (decl_modifiers & DM_NOINLINE) {
5590 /* TRUE if the declaration includes the Microsoft
5591 __declspec(noinline) specifier. */
5592 set_irg_inline_property(irg, irg_inline_forbidden);
5596 static void add_function_pointer(ir_type *segment, ir_entity *method,
5597 const char *unique_template)
5599 ir_type *method_type = get_entity_type(method);
5600 ir_type *ptr_type = new_type_pointer(method_type);
5602 /* these entities don't really have a name but firm only allows
5604 * Note that we mustn't give these entities a name since for example
5605 * Mach-O doesn't allow them. */
5606 ident *ide = id_unique(unique_template);
5607 ir_entity *ptr = new_entity(segment, ide, ptr_type);
5608 ir_graph *irg = get_const_code_irg();
5609 ir_node *val = new_rd_SymConst_addr_ent(NULL, irg, mode_P_code,
5612 set_entity_ld_ident(ptr, new_id_from_chars("", 0));
5613 set_entity_compiler_generated(ptr, 1);
5614 set_entity_visibility(ptr, ir_visibility_private);
5615 add_entity_linkage(ptr, IR_LINKAGE_CONSTANT|IR_LINKAGE_HIDDEN_USER);
5616 set_atomic_ent_value(ptr, val);
5620 * Generate possible IJmp branches to a given label block.
5622 static void gen_ijmp_branches(ir_node *block)
5625 for (ijmp = ijmp_list; ijmp != NULL; ijmp = get_irn_link(ijmp)) {
5626 add_immBlock_pred(block, ijmp);
5631 * Create code for a function and all inner functions.
5633 * @param entity the function entity
5635 static void create_function(entity_t *entity)
5637 assert(entity->kind == ENTITY_FUNCTION);
5638 ir_entity *function_entity = get_function_entity(entity, current_outer_frame);
5640 if (entity->function.statement == NULL)
5643 inner_functions = NULL;
5644 current_trampolines = NULL;
5646 if (entity->declaration.modifiers & DM_CONSTRUCTOR) {
5647 ir_type *segment = get_segment_type(IR_SEGMENT_CONSTRUCTORS);
5648 add_function_pointer(segment, function_entity, "constructor_ptr.%u");
5650 if (entity->declaration.modifiers & DM_DESTRUCTOR) {
5651 ir_type *segment = get_segment_type(IR_SEGMENT_DESTRUCTORS);
5652 add_function_pointer(segment, function_entity, "destructor_ptr.%u");
5655 current_function_entity = entity;
5656 current_function_name = NULL;
5657 current_funcsig = NULL;
5659 assert(all_labels == NULL);
5660 all_labels = NEW_ARR_F(label_t *, 0);
5663 int n_local_vars = get_function_n_local_vars(entity);
5664 ir_graph *irg = new_ir_graph(function_entity, n_local_vars);
5665 current_ir_graph = irg;
5667 ir_graph *old_current_function = current_function;
5668 current_function = irg;
5670 ir_entity *const old_current_vararg_entity = current_vararg_entity;
5671 current_vararg_entity = NULL;
5673 set_irg_fp_model(irg, firm_fp_model);
5674 tarval_enable_fp_ops(1);
5675 set_irn_dbg_info(get_irg_start_block(irg),
5676 get_entity_dbg_info(function_entity));
5678 /* set inline flags */
5679 if (entity->function.is_inline)
5680 set_irg_inline_property(irg, irg_inline_recomended);
5681 handle_decl_modifier_irg(irg, entity->declaration.modifiers);
5683 next_value_number_function = 0;
5684 initialize_function_parameters(entity);
5685 current_static_link = entity->function.static_link;
5687 statement_to_firm(entity->function.statement);
5689 ir_node *end_block = get_irg_end_block(irg);
5691 /* do we have a return statement yet? */
5692 if (currently_reachable()) {
5693 type_t *type = skip_typeref(entity->declaration.type);
5694 assert(is_type_function(type));
5695 const function_type_t *func_type = &type->function;
5696 const type_t *return_type
5697 = skip_typeref(func_type->return_type);
5700 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
5701 ret = new_Return(get_store(), 0, NULL);
5704 if (is_type_scalar(return_type)) {
5705 mode = get_ir_mode_storage(func_type->return_type);
5711 /* ยง5.1.2.2.3 main implicitly returns 0 */
5712 if (is_main(entity)) {
5713 in[0] = new_Const(get_mode_null(mode));
5715 in[0] = new_Unknown(mode);
5717 ret = new_Return(get_store(), 1, in);
5719 add_immBlock_pred(end_block, ret);
5722 for (int i = ARR_LEN(all_labels) - 1; i >= 0; --i) {
5723 label_t *label = all_labels[i];
5724 if (label->address_taken) {
5725 gen_ijmp_branches(label->block);
5727 mature_immBlock(label->block);
5730 DEL_ARR_F(all_labels);
5733 irg_finalize_cons(irg);
5735 /* finalize the frame type */
5736 ir_type *frame_type = get_irg_frame_type(irg);
5737 int n = get_compound_n_members(frame_type);
5740 for (int i = 0; i < n; ++i) {
5741 ir_entity *member = get_compound_member(frame_type, i);
5742 ir_type *entity_type = get_entity_type(member);
5744 int align = get_type_alignment_bytes(entity_type);
5745 if (align > align_all)
5749 misalign = offset % align;
5751 offset += align - misalign;
5755 set_entity_offset(member, offset);
5756 offset += get_type_size_bytes(entity_type);
5758 set_type_size_bytes(frame_type, offset);
5759 set_type_alignment_bytes(frame_type, align_all);
5761 irg_verify(irg, VERIFY_ENFORCE_SSA);
5762 current_vararg_entity = old_current_vararg_entity;
5763 current_function = old_current_function;
5765 if (current_trampolines != NULL) {
5766 DEL_ARR_F(current_trampolines);
5767 current_trampolines = NULL;
5770 /* create inner functions if any */
5771 entity_t **inner = inner_functions;
5772 if (inner != NULL) {
5773 ir_type *rem_outer_frame = current_outer_frame;
5774 current_outer_frame = get_irg_frame_type(current_ir_graph);
5775 for (int i = ARR_LEN(inner) - 1; i >= 0; --i) {
5776 create_function(inner[i]);
5780 current_outer_frame = rem_outer_frame;
5784 static void scope_to_firm(scope_t *scope)
5786 /* first pass: create declarations */
5787 entity_t *entity = scope->entities;
5788 for ( ; entity != NULL; entity = entity->base.next) {
5789 if (entity->base.symbol == NULL)
5792 if (entity->kind == ENTITY_FUNCTION) {
5793 if (entity->function.btk != BUILTIN_NONE) {
5794 /* builtins have no representation */
5797 (void)get_function_entity(entity, NULL);
5798 } else if (entity->kind == ENTITY_VARIABLE) {
5799 create_global_variable(entity);
5800 } else if (entity->kind == ENTITY_NAMESPACE) {
5801 scope_to_firm(&entity->namespacee.members);
5805 /* second pass: create code/initializers */
5806 entity = scope->entities;
5807 for ( ; entity != NULL; entity = entity->base.next) {
5808 if (entity->base.symbol == NULL)
5811 if (entity->kind == ENTITY_FUNCTION) {
5812 if (entity->function.btk != BUILTIN_NONE) {
5813 /* builtins have no representation */
5816 create_function(entity);
5817 } else if (entity->kind == ENTITY_VARIABLE) {
5818 assert(entity->declaration.kind
5819 == DECLARATION_KIND_GLOBAL_VARIABLE);
5820 current_ir_graph = get_const_code_irg();
5821 create_variable_initializer(entity);
5826 void init_ast2firm(void)
5828 obstack_init(&asm_obst);
5829 init_atomic_modes();
5831 ir_set_debug_retrieve(dbg_retrieve);
5832 ir_set_type_debug_retrieve(dbg_print_type_dbg_info);
5834 /* create idents for all known runtime functions */
5835 for (size_t i = 0; i < lengthof(rts_data); ++i) {
5836 rts_idents[i] = new_id_from_str(rts_data[i].name);
5839 entitymap_init(&entitymap);
5842 static void init_ir_types(void)
5844 static int ir_types_initialized = 0;
5845 if (ir_types_initialized)
5847 ir_types_initialized = 1;
5849 ir_type_int = get_ir_type(type_int);
5850 ir_type_char = get_ir_type(type_char);
5851 ir_type_const_char = get_ir_type(type_const_char);
5852 ir_type_wchar_t = get_ir_type(type_wchar_t);
5853 ir_type_void = get_ir_type(type_void);
5855 be_params = be_get_backend_param();
5856 mode_float_arithmetic = be_params->mode_float_arithmetic;
5858 stack_param_align = be_params->stack_param_align;
5861 void exit_ast2firm(void)
5863 entitymap_destroy(&entitymap);
5864 obstack_free(&asm_obst, NULL);
5867 static void global_asm_to_firm(statement_t *s)
5869 for (; s != NULL; s = s->base.next) {
5870 assert(s->kind == STATEMENT_ASM);
5872 char const *const text = s->asms.asm_text.begin;
5873 size_t size = s->asms.asm_text.size;
5875 /* skip the last \0 */
5876 if (text[size - 1] == '\0')
5879 ident *const id = new_id_from_chars(text, size);
5884 void translation_unit_to_firm(translation_unit_t *unit)
5886 /* initialize firm arithmetic */
5887 tarval_set_integer_overflow_mode(TV_OVERFLOW_WRAP);
5888 ir_set_uninitialized_local_variable_func(uninitialized_local_var);
5890 /* just to be sure */
5891 continue_label = NULL;
5893 current_switch = NULL;
5894 current_translation_unit = unit;
5898 scope_to_firm(&unit->scope);
5899 global_asm_to_firm(unit->global_asm);
5901 current_ir_graph = NULL;
5902 current_translation_unit = NULL;