X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Firtypeinfo.c;h=4c20305b11be08d9fba89edd4d829393a1e856d7;hb=ebdaa596d904a0651c8d794481288d2d629bdb3a;hp=3ec3895f30b69a3613d0daf43697915ec6036f65;hpb=863d31d7a5c8210432fef88b30fc3e8353131538;p=libfirm diff --git a/ir/ana/irtypeinfo.c b/ir/ana/irtypeinfo.c index 3ec3895f3..4c20305b1 100644 --- a/ir/ana/irtypeinfo.c +++ b/ir/ana/irtypeinfo.c @@ -1,39 +1,47 @@ -/** +/* + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * - * @file irtypeinfo.c + * This file is part of libFirm. * - * Project: libFIRM - * File name: ir/ana/irtypeinfo.c - * Purpose: Data structure to hold type information for nodes. - * Author: Goetz Lindenmaier - * Modified by: - * Created: 28.8.2003 - * CVS-ID: $Id$ - * Copyright: (c) 2003 Universität Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + * 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. * - * Data structure to hold type information for nodes. + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. * - * This module defines a field "type" of type "type *" for each ir node. - * It defines a flag for irgraphs to mark whether the type info of the - * graph is valid. Further it defines an auxiliary type "initial_type". + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. + */ + +/** + * @file + * @brief Data structure to hold type information for nodes. + * @author Goetz Lindenmaier + * @date 28.8.2003 + * @version $Id$ + * @brief + * Data structure to hold type information for nodes. * - * The module defines a map that contains pairs (irnode, type). If an irnode - * is not in the map it is assumed to be initialized, i.e., the initialization - * requires no compute time. As firm nodes can not be freed and reallocated - * pointers for nodes are unique (until a call of dead_node_elimination). + * This module defines a field "type" of type "type *" for each ir node. + * It defines a flag for irgraphs to mark whether the type info of the + * graph is valid. Further it defines an auxiliary type "initial_type". * + * The module defines a map that contains pairs (irnode, type). If an irnode + * is not in the map it is assumed to be initialized, i.e., the initialization + * requires no compute time. As firm nodes can not be freed and reallocated + * pointers for nodes are unique (until a call of dead_node_elimination). */ - -#ifdef HAVE_CONFIG_H #include "config.h" -#endif #include "irtypeinfo.h" #include -#include "irgraph_t.h" /* for setting the state flag. */ +#include "irgraph_t.h" #include "irprog_t.h" #include "irnode_t.h" #include "pmap.h" @@ -60,55 +68,52 @@ ir_type *initial_type = NULL; * in the order of MIN(, #irnodes). */ void init_irtypeinfo(void) { - int i, n; + int i; - if (!initial_type) - initial_type = new_type_class(new_id_from_str("initial_type")); + if (initial_type == NULL) + initial_type = new_type_class(new_id_from_str("initial_type")); - /* We need a new, empty map. */ - if (type_node_map) pmap_destroy(type_node_map); - type_node_map = pmap_create(); + /* We need a new, empty map. */ + if (type_node_map != NULL) + pmap_destroy(type_node_map); + type_node_map = pmap_create(); - n = get_irp_n_irgs(); - for (i = 0; i < n; ++i) - set_irg_typeinfo_state(get_irp_irg(i), ir_typeinfo_none); + for (i = get_irp_n_irgs() - 1; i >= 0; --i) + set_irg_typeinfo_state(get_irp_irg(i), ir_typeinfo_none); } void free_irtypeinfo(void) { - int i, n; - - if (initial_type) { - free_type(initial_type); - initial_type = NULL; - } - //else assert(0 && "call init_type_info before freeing"); - - if (type_node_map) { - pmap_destroy(type_node_map); - type_node_map = NULL; - } - //else assert(0 && "call init_type_info before freeing"); - - n = get_irp_n_irgs(); - for (i = 0; i < n; ++i) - set_irg_typeinfo_state(get_irp_irg(i), ir_typeinfo_none); + int i; + + if (initial_type != NULL) { + free_type(initial_type); + initial_type = NULL; + } + + if (type_node_map != NULL) { + pmap_destroy(type_node_map); + type_node_map = NULL; + } + + for (i = get_irp_n_irgs() - 1; i >= 0; --i) + set_irg_typeinfo_state(get_irp_irg(i), ir_typeinfo_none); } /* ------------ Irgraph state handling. ------------------------------- */ void set_irg_typeinfo_state(ir_graph *irg, ir_typeinfo_state s) { - assert(is_ir_graph(irg)); - irg->typeinfo_state = s; - if ((irg->typeinfo_state == ir_typeinfo_consistent) && - (irp->typeinfo_state == ir_typeinfo_consistent) && - (s != ir_typeinfo_consistent) ) - irp->typeinfo_state = ir_typeinfo_inconsistent; + assert(is_ir_graph(irg)); + irg->typeinfo_state = s; + if ((irg->typeinfo_state == ir_typeinfo_consistent) && + (irp->typeinfo_state == ir_typeinfo_consistent) && + (s != ir_typeinfo_consistent) ) + irp->typeinfo_state = ir_typeinfo_inconsistent; } -ir_typeinfo_state get_irg_typeinfo_state(ir_graph *irg) { - assert(is_ir_graph(irg)); - return irg->typeinfo_state; +ir_typeinfo_state get_irg_typeinfo_state(const ir_graph *irg) { + assert(is_ir_graph(irg)); + return irg->typeinfo_state; } @@ -119,15 +124,15 @@ ir_typeinfo_state get_irg_typeinfo_state(ir_graph *irg) { * or no type information. Returns ir_typeinfo_none if no irg contains type information. */ ir_typeinfo_state get_irp_typeinfo_state(void) { - return irp->typeinfo_state; + return irp->typeinfo_state; } void set_irp_typeinfo_state(ir_typeinfo_state s) { - irp->typeinfo_state = s; + irp->typeinfo_state = s; } /* If typeinfo is consistent, sets it to inconsistent. */ void set_irp_typeinfo_inconsistent(void) { - if (irp->typeinfo_state == ir_typeinfo_consistent) - irp->typeinfo_state = ir_typeinfo_inconsistent; + if (irp->typeinfo_state == ir_typeinfo_consistent) + irp->typeinfo_state = ir_typeinfo_inconsistent; } @@ -137,22 +142,21 @@ void set_irp_typeinfo_inconsistent(void) { * ir_typeinfo_consistent or ir_typeinfo_inconsistent. They * assume current_ir_graph set properly. */ -ir_type *get_irn_typeinfo_type(ir_node *n) { - ir_type *res = initial_type; - pmap_entry *entry; - assert(get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent || - get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent ); +ir_type *get_irn_typeinfo_type(const ir_node *n) { + ir_type *res = initial_type; + pmap_entry *entry; + + assert(get_irg_typeinfo_state(get_irn_irg(n)) != ir_typeinfo_none); - entry = pmap_find(type_node_map, n); - if (entry) - res = entry->value; + entry = pmap_find(type_node_map, n); + if (entry != NULL) + res = entry->value; - return res; + return res; } void set_irn_typeinfo_type(ir_node *n, ir_type *tp) { - assert(get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_consistent || - get_irg_typeinfo_state(current_ir_graph) == ir_typeinfo_inconsistent ); + assert(get_irg_typeinfo_state(current_ir_graph) != ir_typeinfo_none); - pmap_insert(type_node_map, (void *)n, (void *)tp); + pmap_insert(type_node_map, (void *)n, (void *)tp); }