X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firprog.c;h=f4ce08b868f73db7b2d2e587d7ad5a085c08db6f;hb=1f66492dac45f1a1cf49ac16ee43894814e2cbf0;hp=b30dac8777f9e5a2cdda66b7785f59ff0c68ea05;hpb=cd51c273d337e69ee1a8f120e74cc0d8c785fb93;p=libfirm diff --git a/ir/ir/irprog.c b/ir/ir/irprog.c index b30dac877..f4ce08b86 100644 --- a/ir/ir/irprog.c +++ b/ir/ir/irprog.c @@ -1,280 +1,526 @@ /* - * Project: libFIRM - * File name: ir/ir/irprog.c - * Purpose: Entry point to the representation of a whole program. - * Author: Goetz Lindenmaier - * Modified by: - * Created: 2000 - * CVS-ID: $Id$ - * Copyright: (c) 2000-2003 Universität Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ -#ifdef HAVE_CONFIG_H -# include "config.h" -#endif +/** + * @file + * @brief Entry point to the representation of a whole program. + * @author Goetz Lindenmaier, Michael Beck + * @date 2000 + * @version $Id$ + */ +#include "config.h" -#ifdef HAVE_STRING_H -# include -#endif +#include -# include "irprog_t.h" -# include "irgraph_t.h" -# include "pseudo_irg.h" -# include "array.h" -# include "obst.h" -# include "typegmod.h" +#include "irprog_t.h" +#include "irgraph_t.h" +#include "irpass_t.h" +#include "array.h" +#include "error.h" +#include "obst.h" +#include "irop_t.h" +#include "irmemory.h" -#define GLOBAL_TYPE_NAME "GlobalType" +/** The initial name of the irp program. */ #define INITAL_PROG_NAME "no_name_set" /* A variable from where everything in the ir can be accessed. */ ir_prog *irp; ir_prog *get_irp(void) { return irp; } - -/* initializes ir_prog. Calles the constructor for an ir_prog. */ -void init_irprog(void) { - new_ir_prog (); +void set_irp(ir_prog *new_irp) +{ + irp = new_irp; } -void remove_irp_type_from_list (type *typ) { - int i; - assert(typ); -#if 0 - for (i = 0; i < (ARR_LEN (irp->types)); i++) { -#else - for (i = ARR_LEN (irp->types) -1; i >= 0; i--) { +/** + * Create a new incomplete ir_prog. + */ +static ir_prog *new_incomplete_ir_prog(void) +{ + ir_prog *res = XMALLOCZ(ir_prog); + + res->kind = k_ir_prog; + res->graphs = NEW_ARR_F(ir_graph *, 0); + res->types = NEW_ARR_F(ir_type *, 0); + res->modes = NEW_ARR_F(ir_mode *, 0); + res->opcodes = NEW_ARR_F(ir_op *, 0); + res->global_asms = NEW_ARR_F(ident *, 0); + res->last_region_nr = 0; + res->last_label_nr = 1; /* 0 is reserved as non-label */ + res->max_irg_idx = 0; + res->max_node_nr = 0; +#ifndef NDEBUG + res->reserved_resources = IR_RESOURCE_NONE; #endif - if (irp->types[i] == typ) { - for(; i < (ARR_LEN (irp->types)) - 1; i++) { - irp->types[i] = irp->types[i+1]; - } - ARR_SETLEN(type*, irp->types, (ARR_LEN(irp->types)) - 1); - break; - } - } + + return res; +} + +/** + * Completes an incomplete irprog. + * + * @param irp the (yet incomplete) irp + * @param module_name the (module) name for this irp + */ +static ir_prog *complete_ir_prog(ir_prog *irp, const char *module_name) +{ + ir_segment_t s; + +#define IDENT(x) new_id_from_chars(x, sizeof(x) - 1) + + irp->name = new_id_from_str(module_name); + irp->segment_types[IR_SEGMENT_GLOBAL] + = new_type_class(IDENT("GlobalType")); + irp->segment_types[IR_SEGMENT_THREAD_LOCAL] + = new_type_struct(IDENT("ThreadLocal")); + irp->segment_types[IR_SEGMENT_CONSTRUCTORS] + = new_type_class(IDENT("Constructors")); + irp->segment_types[IR_SEGMENT_DESTRUCTORS] + = new_type_class(IDENT("Destructors")); + /* Remove these types from type list. Must be treated differently than + other types. */ + for (s = IR_SEGMENT_FIRST; s <= IR_SEGMENT_LAST; ++s) { + remove_irp_type(irp->segment_types[s]); + } + + /* Set these flags for debugging. */ + irp->segment_types[IR_SEGMENT_GLOBAL]->flags |= tf_global_type; + irp->segment_types[IR_SEGMENT_THREAD_LOCAL]->flags |= tf_tls_type; + irp->segment_types[IR_SEGMENT_CONSTRUCTORS]->flags |= tf_constructors; + irp->segment_types[IR_SEGMENT_DESTRUCTORS]->flags |= tf_destructors; + + /* The global type is a class, but we cannot derive from it, so set + the final property to assist optimizations that checks for it. */ + set_class_final(irp->segment_types[IR_SEGMENT_GLOBAL], 1); + + irp->const_code_irg = new_const_code_irg(); + irp->phase_state = phase_building; + irp->outs_state = outs_none; + irp->ip_outedges = NULL; + irp->trouts_state = outs_none; + irp->class_cast_state = ir_class_casts_transitive; + irp->globals_entity_usage_state = ir_entity_usage_not_computed; + + current_ir_graph = irp->const_code_irg; + + return irp; +#undef IDENT +} + +/* initializes ir_prog. Constructs only the basic lists. */ +void init_irprog_1(void) +{ + irp = new_incomplete_ir_prog(); +} + +/* Completes ir_prog. */ +void init_irprog_2(void) +{ + (void)complete_ir_prog(irp, INITAL_PROG_NAME); } /* Create a new ir prog. Automatically called by init_firm through init_irprog. */ -ir_prog *new_ir_prog (void) { - ir_prog *res; - - res = xmalloc (sizeof(*res)); - memset(res, 0, sizeof(*res)); - irp = res; - /* res->obst = xmalloc (sizeof(*res->obst)); */ - res->graphs = NEW_ARR_F (ir_graph *, 0); - res->pseudo_graphs = NEW_ARR_F (ir_graph *, 0); - res->types = NEW_ARR_F (type *, 0); - res->name = new_id_from_str(INITAL_PROG_NAME); - -#ifdef DEBUG_libfirm - res->max_node_nr = 0; -#endif +ir_prog *new_ir_prog(const char *name) +{ + return complete_ir_prog(new_incomplete_ir_prog(), name); +} - res->glob_type = new_type_class(new_id_from_str (GLOBAL_TYPE_NAME)); - /* Remove type from type list. Must be treated differently than - other types. */ - remove_irp_type_from_list(res->glob_type); +/* frees all memory used by irp. Types in type list, irgs in irg + list and entities in global type must be freed by hand before. */ +void free_ir_prog(void) +{ + ir_segment_t s; + for (s = IR_SEGMENT_FIRST; s <= IR_SEGMENT_LAST; ++s) { + free_type(irp->segment_types[s]); + } - res->const_code_irg = new_const_code_irg(); + free_ir_graph(irp->const_code_irg); + DEL_ARR_F(irp->graphs); + DEL_ARR_F(irp->types); + DEL_ARR_F(irp->modes); - res->outs_state = outs_none; - res->ip_outedges = NULL; - res->trouts_state = outs_none; - res->class_cast_state = ir_class_casts_transitive; + finish_op(); + DEL_ARR_F(irp->opcodes); + DEL_ARR_F(irp->global_asms); - return res; + irp->name = NULL; + irp->const_code_irg = NULL; + irp->kind = k_BAD; } -/* frees all memory used by irp. Types in type list, irgs in irg - list and entities in global type must be freed by hand before. */ -void free_ir_prog(void) { - free_type(irp->glob_type); - /* @@@ * free_ir_graph(irp->const_code_irg); * ?? End has no in?? */ - DEL_ARR_F(irp->graphs); - DEL_ARR_F(irp->types); +/*- Functions to access the fields of ir_prog -*/ - irp->kind = k_BAD; - irp->const_code_irg = NULL; + +/* Access the main routine of the compiled program. */ +ir_graph *get_irp_main_irg(void) +{ + assert(irp); + return irp->main_irg; } -/*- Functions to access the fields of ir_prog -*/ +void set_irp_main_irg(ir_graph *main_irg) +{ + assert(irp); + irp->main_irg = main_irg; +} +ir_type *(get_segment_type)(ir_segment_t segment) +{ + return _get_segment_type(segment); +} -/* Access the main routine of the compiled program. */ -ir_graph *get_irp_main_irg(void) { - assert (irp); - return irp->main_irg; +void set_segment_type(ir_segment_t segment, ir_type *new_type) +{ + assert(segment <= IR_SEGMENT_LAST); + irp->segment_types[segment] = new_type; + /* segment types are not in the type list... */ + remove_irp_type(new_type); } -void set_irp_main_irg(ir_graph *main_irg) { - assert (irp); - irp->main_irg = main_irg; +ir_type *(get_glob_type)(void) +{ + return _get_glob_type(); } -type *(get_glob_type)(void) { - return __get_glob_type(); +ir_type *(get_tls_type)(void) +{ + return _get_tls_type(); } /* Adds irg to the list of ir graphs in irp. */ -void add_irp_irg(ir_graph *irg) { - assert (irg != NULL); - assert(irp && irp->graphs); - ARR_APP1 (ir_graph *, irp->graphs, irg); +void add_irp_irg(ir_graph *irg) +{ + assert(irg != NULL); + assert(irp && irp->graphs); + ARR_APP1(ir_graph *, irp->graphs, irg); } /* Removes irg from the list or irgs, shrinks the list by one. */ -void remove_irp_irg_from_list(ir_graph *irg){ - int i, found = false; - assert(irg); - for (i = 0; i < (ARR_LEN (irp->graphs)); i++) { - if (irp->graphs[i] == irg) { - found = true; - for(; i < (ARR_LEN (irp->graphs)) - 1; i++) { - irp->graphs[i] = irp->graphs[i+1]; - } - ARR_SETLEN(ir_graph*, irp->graphs, (ARR_LEN(irp->graphs)) - 1); - break; - } - } - if (!found) { - for (i = 0; i < (ARR_LEN (irp->pseudo_graphs)); i++) { - if (irp->pseudo_graphs[i] == irg) { - for(; i < (ARR_LEN (irp->pseudo_graphs)) - 1; i++) { - irp->pseudo_graphs[i] = irp->pseudo_graphs[i+1]; - } - ARR_SETLEN(ir_graph*, irp->pseudo_graphs, (ARR_LEN(irp->pseudo_graphs)) - 1); - break; - } - } - } +void remove_irp_irg_from_list(ir_graph *irg) +{ + size_t i, l; + + assert(irg); + l = ARR_LEN(irp->graphs); + for (i = 0; i < l; ++i) { + if (irp->graphs[i] == irg) { + for (; i < l - 1; ++i) { + irp->graphs[i] = irp->graphs[i+1]; + } + ARR_SETLEN(ir_graph*, irp->graphs, l - 1); + break; + } + } } /* Removes irg from the list or irgs, shrinks the list by one. */ -void remove_irp_irg(ir_graph *irg){ - assert(irg); - free_ir_graph(irg); - remove_irp_irg_from_list(irg); +void remove_irp_irg(ir_graph *irg) +{ + free_ir_graph(irg); + remove_irp_irg_from_list(irg); } -int (get_irp_n_irgs)(void) { - return __get_irp_n_irgs(); +size_t (get_irp_n_irgs)(void) +{ + return _get_irp_n_irgs(); } -ir_graph *(get_irp_irg)(int pos){ - return __get_irp_irg(pos); +ir_graph *(get_irp_irg)(size_t pos) +{ + return _get_irp_irg(pos); } -void set_irp_irg(int pos, ir_graph *irg) { - assert (irp && irg); - assert (pos < (ARR_LEN((irp)->graphs))); - irp->graphs[pos] = irg; +size_t get_irp_last_idx(void) +{ + return irp->max_irg_idx; } -/* Gets the number of graphs _and_ pseudo graphs. */ -int get_irp_n_allirgs(void) { - /* We can not call get_irp_n_irgs, as we end up in a recursion ... */ - return ARR_LEN((irp)->graphs) + get_irp_n_pseudo_irgs(); +void set_irp_irg(size_t pos, ir_graph *irg) +{ + assert(irp && irg); + assert(pos < ARR_LEN(irp->graphs)); + irp->graphs[pos] = irg; } -/* Returns the ir graph at position pos of all graphs (including - pseudo graphs). Visits first graphs, then pseudo graphs. */ -ir_graph *get_irp_allirg(int pos) { - int n_irgs = ARR_LEN((irp)->graphs); - assert(0 <= pos); - if (pos < n_irgs) { - return (irp)->graphs[pos]; - } else { - return get_irp_pseudo_irg(pos-n_irgs); - } +/* Adds type to the list of types in irp. */ +void add_irp_type(ir_type *typ) +{ + assert(typ != NULL); + assert(irp); + ARR_APP1(ir_type *, irp->types, typ); } +/* Remove type from the list of types in irp. */ +void remove_irp_type(ir_type *typ) +{ + size_t i, l; + assert(typ); + + l = ARR_LEN(irp->types); + for (i = 0; i < l; ++i) { + if (irp->types[i] == typ) { + for (; i < l - 1; ++i) { + irp->types[i] = irp->types[i+1]; + } + ARR_SETLEN(ir_type *, irp->types, l - 1); + break; + } + } +} + +size_t (get_irp_n_types) (void) +{ + return _get_irp_n_types(); +} -/* Adds type to the list of types in irp. */ -void add_irp_type(type *typ) { - assert (typ != NULL); - assert(irp); - ARR_APP1 (type *, irp->types, typ); +ir_type *(get_irp_type) (size_t pos) +{ + return _get_irp_type(pos); } -void remove_irp_type(type *typ) { - remove_irp_type_from_list (typ); +void set_irp_type(size_t pos, ir_type *typ) +{ + assert(irp && typ); + assert(pos < ARR_LEN((irp)->types)); + irp->types[pos] = typ; } -int (get_irp_n_types) (void) { - return __get_irp_n_types(); +/* Returns the number of all modes in the irp. */ +size_t (get_irp_n_modes)(void) +{ + return _get_irp_n_modes(); } -type *(get_irp_type) (int pos) { - return __get_irp_type(pos); +/* Returns the mode at position pos in the irp. */ +ir_mode *(get_irp_mode)(size_t pos) +{ + return _get_irp_mode(pos); } -void set_irp_type(int pos, type *typ) { - assert (irp && typ); - assert (pos < (ARR_LEN((irp)->types))); - irp->types[pos] = typ; +/* Adds mode to the list of modes in irp. */ +void add_irp_mode(ir_mode *mode) +{ + assert(mode != NULL); + assert(irp); + ARR_APP1(ir_mode *, irp->modes, mode); } -#ifdef DEBUG_libfirm -int get_irp_new_node_nr() { - assert(irp); - irp->max_node_nr = irp->max_node_nr + 1; - return irp->max_node_nr - 1; +/* Adds opcode to the list of opcodes in irp. */ +void add_irp_opcode(ir_op *opcode) +{ + size_t len; + size_t code; + assert(opcode != NULL); + assert(irp); + len = ARR_LEN(irp->opcodes); + code = opcode->code; + if (code >= len) { + ARR_RESIZE(ir_op*, irp->opcodes, code+1); + memset(&irp->opcodes[len], 0, (code-len+1) * sizeof(irp->opcodes[0])); + } + + assert(irp->opcodes[code] == NULL && "opcode registered twice"); + irp->opcodes[code] = opcode; +} + +/* Removes opcode from the list of opcodes and shrinks the list by one. */ +void remove_irp_opcode(ir_op *opcode) +{ + assert(opcode->code < ARR_LEN(irp->opcodes)); + irp->opcodes[opcode->code] = NULL; +} + +/* Returns the number of all opcodes in the irp. */ +size_t (get_irp_n_opcodes)(void) +{ + return _get_irp_n_opcodes(); +} + +/* Returns the opcode at position pos in the irp. */ +ir_op *(get_irp_opcode)(size_t pos) +{ + return _get_irp_opcode(pos); +} + +/* Sets the generic function pointer of all opcodes to NULL */ +void clear_irp_opcodes_generic_func(void) +{ + size_t i, n; + + for (i = 0, n = get_irp_n_opcodes(); i < n; ++i) { + ir_op *op = get_irp_opcode(i); + op->ops.generic = (op_func)NULL; + } } -#endif /*- File name / executable name or the like -*/ -void set_irp_prog_name(ident *name) { - irp->name = name; +void set_irp_prog_name(ident *name) +{ + irp->name = name; } -int irp_prog_name_is_set(void) { - return irp->name != new_id_from_str(INITAL_PROG_NAME); +int irp_prog_name_is_set(void) +{ + return irp->name != new_id_from_str(INITAL_PROG_NAME); } -ident *get_irp_prog_ident(void) { - return irp->name; +ident *get_irp_ident(void) +{ + return irp->name; } -const char *get_irp_prog_name(void) { - return get_id_str(irp->name); +const char *get_irp_name(void) +{ + return get_id_str(irp->name); } ir_graph *(get_const_code_irg)(void) { - return __get_const_code_irg(); + return _get_const_code_irg(); } -irg_phase_state get_irp_phase_state(void) { - return irp->phase_state; +irg_phase_state get_irp_phase_state(void) +{ + return irp->phase_state; } -void set_irp_phase_state(irg_phase_state s) { - irp->phase_state = s; + +void set_irp_phase_state(irg_phase_state s) +{ + irp->phase_state = s; +} + +typedef struct pass_t { + ir_prog_pass_t pass; + irg_phase_state state; +} pass_t; + +/** + * Wrapper for setting the state of a whole ir_prog. + */ +static int set_irp_phase_state_wrapper(ir_prog *irp, void *context) +{ + pass_t *pass = (pass_t *)context; + irg_phase_state state = pass->state; + size_t i, n; + + (void)irp; + + /* set the phase of all graphs */ + for (i = 0, n = get_irp_n_irgs(); i < n; ++i) + set_irg_phase_state(get_irp_irg(i), state); + + /* set the irp phase */ + set_irp_phase_state(state); + + return 0; +} + +ir_prog_pass_t *set_irp_phase_state_pass(const char *name, irg_phase_state state) +{ + struct pass_t *pass = XMALLOCZ(struct pass_t); + + def_prog_pass_constructor( + &pass->pass, name ? name : "set_irp_phase", set_irp_phase_state_wrapper); + pass->state = state; + + /* no dump/verify */ + pass->pass.verify_irprog = ir_prog_no_verify; + pass->pass.dump_irprog = ir_prog_no_dump; + + return &pass->pass; } -irg_outs_state get_irp_ip_outs_state() { - return irp->outs_state; +irg_outs_state get_irp_ip_outs_state(void) +{ + return irp->outs_state; } -void set_irp_ip_outs_inconsistent() { - irp->outs_state = outs_inconsistent; +void set_irp_ip_outs_inconsistent(void) +{ + irp->outs_state = outs_inconsistent; } -void set_irp_ip_outedges(ir_node ** ip_outedges) +void set_irp_ip_outedges(ir_node ** ip_outedges) { - irp->ip_outedges = ip_outedges; + irp->ip_outedges = ip_outedges; } ir_node** get_irp_ip_outedges(void) { - return irp->ip_outedges; + return irp->ip_outedges; } +irg_callee_info_state get_irp_callee_info_state(void) +{ + return irp->callee_info_state; +} -irg_callee_info_state get_irp_callee_info_state(void) { - return irp->callee_info_state; +void set_irp_callee_info_state(irg_callee_info_state s) +{ + irp->callee_info_state = s; } -void set_irp_callee_info_state(irg_callee_info_state s) { - irp->callee_info_state = s; +/* Returns a new, unique exception region number. */ +ir_exc_region_t (get_irp_next_region_nr)(void) +{ + return _get_irp_next_region_nr(); } + +/* Returns a new, unique label number. */ +ir_label_t (get_irp_next_label_nr)(void) +{ + return _get_irp_next_label_nr(); +} + +/* Add a new global asm include */ +void add_irp_asm(ident *asm_string) +{ + ARR_APP1(ident *, irp->global_asms, asm_string); +} + +/* Return the number of global asm includes. */ +size_t get_irp_n_asms(void) +{ + return ARR_LEN(irp->global_asms); +} + +/* Return the global asm include at position pos. */ +ident *get_irp_asm(size_t pos) +{ + assert(pos < get_irp_n_asms()); + return irp->global_asms[pos]; +} + +#ifndef NDEBUG +void irp_reserve_resources(ir_prog *irp, irp_resources_t resources) +{ + assert((irp->reserved_resources & resources) == 0); + irp->reserved_resources |= resources; +} + +void irp_free_resources(ir_prog *irp, irp_resources_t resources) +{ + assert((irp->reserved_resources & resources) == resources); + irp->reserved_resources &= ~resources; +} + +irp_resources_t irp_resources_reserved(const ir_prog *irp) +{ + return irp->reserved_resources; +} +#endif