X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firprog.c;h=06d79f44a1a3206f1f280d0ba0b7fe99837d1d42;hb=44fec44bd47ef88ae276179866d4a65cda6e0253;hp=5fd231a0512f14cf3832836b158d61a78dc35c8b;hpb=66f846a2a301d938700fee41d0e1bccc7c6d6935;p=libfirm diff --git a/ir/ir/irprog.c b/ir/ir/irprog.c index 5fd231a05..06d79f44a 100644 --- a/ir/ir/irprog.c +++ b/ir/ir/irprog.c @@ -1,65 +1,118 @@ -/* Copyright (C) 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** irprog.c: ir representation of a program -*/ - -/* $Id$ */ +/* + * 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. + */ #ifdef HAVE_CONFIG_H -# include +# include "config.h" #endif +#ifdef HAVE_STRING_H # include +#endif # include "irprog_t.h" # include "irgraph_t.h" +# include "pseudo_irg.h" # include "array.h" # include "obst.h" # include "typegmod.h" #define GLOBAL_TYPE_NAME "GlobalType" +#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 (); -} - -/* Create a new ir prog. Automatically called by init_firm through - init_irprog. */ -ir_prog *new_ir_prog (void) { +/** + * Create a new incomplete ir_prog. + */ +static ir_prog *new_incomplete_ir_prog (void) { ir_prog *res; - res = (ir_prog *) malloc (sizeof(ir_prog)); + res = xmalloc (sizeof(*res)); + memset(res, 0, sizeof(*res)); irp = res; - /* res->obst = (struct obstack *) xmalloc (sizeof (struct obstack)); */ - res->graphs = NEW_ARR_F (ir_graph *, 1); - res->types = NEW_ARR_F (type *, 1); - res->glob_type = new_type_class(id_from_str (GLOBAL_TYPE_NAME, - strlen(GLOBAL_TYPE_NAME))); - /* Remove type from type list. Must be treated differently than - other types. */ - remove_irp_type_from_list(res->glob_type); - res->const_code_irg = new_const_code_irg(); + res->kind = k_ir_prog; + res->graphs = NEW_ARR_F(ir_graph *, 0); + res->pseudo_graphs = NEW_ARR_F(ir_graph *, 0); + res->types = NEW_ARR_F(ir_type *, 0); + res->modes = NEW_ARR_F(ir_mode *, 0); #ifdef DEBUG_libfirm - res->max_node_nr = 1; + res->max_node_nr = 0; #endif return res; } -/** Functions to access the fields of ir_prog **/ +/** Completes an incomplete irprog. */ +static ir_prog *complete_ir_prog(ir_prog *irp) { + + irp->name = new_id_from_str(INITAL_PROG_NAME); + + irp->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(irp->glob_type); + + irp->const_code_irg = new_const_code_irg(); + + irp->outs_state = outs_none; + irp->ip_outedges = NULL; + irp->trouts_state = outs_none; + irp->class_cast_state = ir_class_casts_transitive; + + return irp; +} + +/* initializes ir_prog. Constructs only the basic lists */ +void init_irprog_1(void) { + new_incomplete_ir_prog(); +} + +/* Completes ir_prog. */ +void init_irprog_2(void) { + complete_ir_prog(irp); +} + +/* Create a new ir prog. Automatically called by init_firm through + init_irprog. */ +ir_prog *new_ir_prog (void) { + return complete_ir_prog(new_incomplete_ir_prog()); +} + +/* 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) { + if (irp->glob_type) + 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->pseudo_graphs); + DEL_ARR_F(irp->types); + DEL_ARR_F(irp->modes); + + irp->name = NULL; + irp->const_code_irg = NULL; + irp->kind = k_BAD; +} + +/*- Functions to access the fields of ir_prog -*/ /* Access the main routine of the compiled program. */ -ir_graph *get_irp_main_irg() { +ir_graph *get_irp_main_irg(void) { assert (irp); return irp->main_irg; } @@ -69,9 +122,8 @@ void set_irp_main_irg(ir_graph *main_irg) { irp->main_irg = main_irg; } -type *get_glob_type(void) { - assert(irp); - return irp->glob_type = skip_tid(irp->glob_type); +ir_type *(get_glob_type)(void) { + return _get_glob_type(); } /* Adds irg to the list of ir graphs in irp. */ @@ -82,83 +134,123 @@ void add_irp_irg(ir_graph *irg) { } /* Removes irg from the list or irgs, shrinks the list by one. */ -void remove_irp_irg(ir_graph *irg){ - int i; +void remove_irp_irg_from_list(ir_graph *irg){ + int i, found = 0; assert(irg); - free_ir_graph(irg); - for (i = 1; i < (ARR_LEN (irp->graphs)); i++) { + for (i = 0; i < (ARR_LEN (irp->graphs)); i++) { if (irp->graphs[i] == irg) { + found = 1; for(; i < (ARR_LEN (irp->graphs)) - 1; i++) { - irp->graphs[i] = irp->graphs[i+1]; + 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; + } + } + } +} + +/* 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); } -int get_irp_n_irgs() { - assert (irp && irp->graphs); - /* Strangely the first element of the array is NULL. Why?? */ - return (ARR_LEN((irp)->graphs) - 1); +int (get_irp_n_irgs)(void) { + return _get_irp_n_irgs(); } -ir_graph *get_irp_irg(int pos){ - assert (irp && irp->graphs); - /* Strangely the first element of the array is NULL. Why?? */ - return irp->graphs[pos+1]; +ir_graph *(get_irp_irg)(int pos){ + return _get_irp_irg(pos); } void set_irp_irg(int pos, ir_graph *irg) { assert (irp && irg); - assert (pos < (ARR_LEN((irp)->graphs) - 1)); - /* Strangely the first element of the array is NULL. Why?? */ - irp->graphs[pos+1] = irg; + assert (pos < (ARR_LEN(irp->graphs))); + irp->graphs[pos] = irg; +} + +/* 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(); +} + +/* 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(type *typ) { +void add_irp_type(ir_type *typ) { assert (typ != NULL); assert(irp); - ARR_APP1 (type *, irp->types, typ); + ARR_APP1 (ir_type *, irp->types, typ); } -INLINE void remove_irp_type_from_list (type *typ) { +/* Remove type form the list of types in irp. */ +void remove_irp_type(ir_type *typ) { int i; assert(typ); - for (i = 1; i < (ARR_LEN (irp->types)); i++) { + + for (i = ARR_LEN(irp->types) -1; i >= 0; i--) { if (irp->types[i] == typ) { - for(; i < (ARR_LEN (irp->types)) - 1; i++) { - irp->types[i] = irp->types[i+1]; + 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); + ARR_SETLEN(ir_type *, irp->types, (ARR_LEN(irp->types)) - 1); break; } } } -void remove_irp_type(type *typ) { - remove_irp_type_from_list (typ); +int (get_irp_n_types) (void) { + return _get_irp_n_types(); } -int get_irp_n_types (void) { - assert (irp && irp->types); - /* Strangely the first element of the array is NULL. Why?? */ - return (ARR_LEN((irp)->types) - 1); +ir_type *(get_irp_type) (int pos) { + return _get_irp_type(pos); } -type *get_irp_type(int pos) { - assert (irp && irp->types); - /* Strangely the first element of the array is NULL. Why?? */ - /* Don't set the skip_tid result so that no double entries are generated. */ - return skip_tid(irp->types[pos+1]); +void set_irp_type(int pos, ir_type *typ) { + assert (irp && typ); + assert (pos < (ARR_LEN((irp)->types))); + irp->types[pos] = typ; } -void set_irp_type(int pos, type *typ) { - assert (irp && typ); - assert (pos < (ARR_LEN((irp)->types) - 1)); - /* Strangely the first element of the array is NULL. Why?? */ - irp->types[pos+1] = typ; +/* Returns the number of all modes in the irp. */ +int (get_irp_n_modes)(void) { + return _get_irp_n_modes(); +} + +/* Returns the mode at position pos in the irp. */ +ir_mode *(get_irp_mode)(int pos) { + return _get_irp_mode(pos); +} + +/* 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 @@ -169,7 +261,55 @@ int get_irp_new_node_nr() { } #endif -ir_graph *get_const_code_irg() +/*- File name / executable name or the like -*/ +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); +} +ident *get_irp_prog_ident(void) { + return irp->name; +} +const char *get_irp_prog_name(void) { + return get_id_str(irp->name); +} + + +ir_graph *(get_const_code_irg)(void) { + return _get_const_code_irg(); +} + +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; +} + +irg_outs_state get_irp_ip_outs_state(void) { + return irp->outs_state; +} + +void set_irp_ip_outs_inconsistent(void) { + irp->outs_state = outs_inconsistent; +} + +void set_irp_ip_outedges(ir_node ** ip_outedges) +{ + irp->ip_outedges = ip_outedges; +} + +ir_node** get_irp_ip_outedges(void) { - return irp->const_code_irg; + return irp->ip_outedges; +} + + +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; }