X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Ftr%2Ftypewalk.c;h=629084abb474661e42504168ffac84194eb0865f;hb=ee219efe0bdf11f6a392436a2444fc48895a227b;hp=0b95917a66d8066480afec65bc0bfa243679e9e5;hpb=512afc22ee29255cfeef35deb41980831691c0fb;p=libfirm diff --git a/ir/tr/typewalk.c b/ir/tr/typewalk.c index 0b95917a6..629084abb 100644 --- a/ir/tr/typewalk.c +++ b/ir/tr/typewalk.c @@ -1,291 +1,551 @@ -/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Author: Goetz Lindenmaier -** -** traverse the type information. The walker walks the whole ir graph -** to find the distinct type trees in the type graph forest. -** - execute the pre function before recursion -** - execute the post function after recursion -*/ - -/* $Id$ */ +/* + * Copyright (C) 1995-2007 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. + */ +/** + * @file typewalk.c + * @brief Functionality to modify the type graph. + * @author Goetz Lindenmaier + * @version $Id$ + * @summary + * + * Traverse the type information. The walker walks the whole ir graph + * to find the distinct type trees in the type graph forest. + * - execute the pre function before recursion + * - execute the post function after recursion + */ #ifdef HAVE_CONFIG_H -# include +# include "config.h" +#endif + +#ifdef HAVE_STDLIB_H +# include #endif -#include #include -#include "irgwalk.h" -#include "irgraph.h" -#include "irnode.h" -#include "irprog.h" -#include "type_or_entity.h" -#include "typegmod.h" -/* Make types visible to allow most efficient access */ #include "entity_t.h" #include "type_t.h" +#include "irprog_t.h" +#include "irgraph_t.h" +#include "irnode_t.h" +#include "irgwalk.h" + +/** + * The walker environment + */ typedef struct type_walk_env { - void *pre; - void *post; - void *env; + type_walk_func *pre; /**< Pre-walker function */ + type_walk_func *post; /**< Post-walker function */ + void *env; /**< environment for walker functions */ } type_walk_env; +/* a walker for irn's */ +static void irn_type_walker( + ir_node *node, type_walk_func *pre, type_walk_func *post, void *env); -void type_walk_2(type_or_ent *tore, - void (pre)(type_or_ent*, void*), - void (post)(type_or_ent*, void*), - void *env) +/** + * Main walker: walks over all used types/entities of a + * type entity. + */ +static void do_type_walk(type_or_ent *tore, + type_walk_func *pre, + type_walk_func *post, + void *env) { - int i; - - /* marked? */ - switch (get_kind(tore)) { - case k_entity: - if (((entity *)tore)->visit >= type_visited) return; - break; - case k_type: - if(type_id == get_type_tpop((type*)tore)) { - type_walk_2((type_or_ent *)skip_tid((type *)tore), pre, post, env); - return; - } - if (((type *)tore)->visit >= type_visited) return; - break; - default: - break; - } - - /* execute pre method */ - if(pre) - pre(tore, env); - - /* iterate */ - switch (get_kind(tore)) { - case k_entity: - { - - entity *ent = (entity *)tore; - ent->visit = type_visited; - type_walk_2((type_or_ent *)get_entity_owner(ent), pre, post, env); - type_walk_2((type_or_ent *)get_entity_type(ent), pre, post, env); - } - break; - case k_type: - { - type *tp = (type *)tore; - mark_type_visited(tp); - switch (get_type_tpop_code(tp)) { - case tpo_class: - { - for (i=0; ipre; + post = env->post; + envi = env->env; + + irn_type_walker(node, pre, post, envi); +} + +/* walker: walks over all types */ +void type_walk(type_walk_func *pre, type_walk_func *post, void *env) { + int i, n_types = get_irp_n_types(); + + inc_master_type_visited(); + for (i = 0; i < n_types; ++i) { + do_type_walk((type_or_ent *)get_irp_type(i), pre, post, env); + } + do_type_walk((type_or_ent *)get_glob_type(), pre, post, env); +} + +void type_walk_irg(ir_graph *irg, + type_walk_func *pre, + type_walk_func *post, + void *env) +{ + ir_graph *rem = current_ir_graph; + /* this is needed to pass the parameters to the walker that actually + walks the type information */ + type_walk_env type_env; + + type_env.pre = pre; + type_env.post = post; + type_env.env = env; + + current_ir_graph = irg; + + /* We walk over the irg to find all irnodes that contain an attribute + with type information. If we find one we call a type walker to + touch the reachable type information. + The same type can be referenced by several irnodes. To avoid + repeated visits of the same type node we must decrease the + type visited flag for each walk. This is done in start_type_walk(). + Here we initially increase the flag. We only call do_type_walk that does + not increase the flag. + */ + inc_master_type_visited(); + irg_walk(get_irg_end(irg), start_type_walk, NULL, &type_env); + + do_type_walk((type_or_ent *)get_irg_entity(irg), pre, post, env); + + do_type_walk((type_or_ent *)get_irg_frame_type(irg), pre, post, env); + + current_ir_graph = rem; + return; +} + +static void type_walk_s2s_2(type_or_ent *tore, + type_walk_func *pre, + type_walk_func *post, + void *env) +{ + int i, n; + + /* marked? */ + switch (get_kind(tore)) { + case k_entity: + if (entity_visited((ir_entity *)tore)) return; + break; + case k_type: + if (type_id == get_type_tpop((ir_type*)tore)) { + type_walk_s2s_2((type_or_ent *)skip_tid((ir_type *)tore), pre, post, env); + return; + } + if (type_visited((ir_type *)tore)) return; + break; + default: + break; } - break; - case tpo_method: - { - for (i = 0; i < get_method_n_params(tp); i++) - type_walk_2((type_or_ent *)get_method_param_type(tp, i), pre, post, env); - for (i = 0; i < get_method_n_res(tp); i++) - type_walk_2((type_or_ent *)get_method_res_type(tp, i), pre, post, env); + + /* iterate */ + switch (get_kind(tore)) { + case k_type: + { + ir_type *tp = (ir_type *)tore; + mark_type_visited(tp); + switch (get_type_tpop_code(tp)) { + case tpo_class: + { + n = get_class_n_supertypes(tp); + for (i = 0; i < n; ++i) { + type_walk_s2s_2((type_or_ent *)get_class_supertype(tp, i), pre, post, env); + } + /* execute pre method */ + if (pre) + pre(tore, env); + tp = skip_tid((ir_type*)tore); + + n = get_class_n_subtypes(tp); + for (i = 0; i < n; ++i) { + type_walk_s2s_2((type_or_ent *)get_class_subtype(tp, i), pre, post, env); + } + + /* execute post method */ + if (post) + post(tore, env); + } + break; + case tpo_struct: + case tpo_method: + case tpo_union: + case tpo_array: + case tpo_enumeration: + case tpo_pointer: + case tpo_primitive: + case tpo_id: + /* dont care */ + break; + default: + printf(" *** Faulty type! \n"); + break; + } + } break; /* end case k_type */ + case k_entity: + /* dont care */ + break; + default: + printf(" *** Faulty type or entity! \n"); + break; } - break; - case tpo_union: - { - for (i = 0; i < get_union_n_members(tp); i++) - type_walk_2((type_or_ent *)get_union_member(tp, i), pre, post, env); + return; +} + +void type_walk_super2sub(type_walk_func *pre, + type_walk_func *post, + void *env) +{ + int i, n_types = get_irp_n_types(); + ir_type *tp; + + inc_master_type_visited(); + type_walk_s2s_2((type_or_ent *)get_glob_type(), pre, post, env); + for (i = 0; i < n_types; ++i) { + tp = get_irp_type(i); + type_walk_s2s_2((type_or_ent *)tp, pre, post, env); } - break; - case tpo_array: - type_walk_2((type_or_ent *)get_array_element_type(tp), - pre, post, env); - type_walk_2((type_or_ent *)get_array_element_entity(tp), - pre, post, env); - break; - case tpo_enumeration: - /* a leave */ - break; - case tpo_pointer: - type_walk_2((type_or_ent *)get_pointer_points_to_type(tp), - pre, post, env); - break; - case tpo_primitive: - case tpo_id: - /* a leave. */ - break; - default: - printf(" *** Faulty type! \n"); - break; - } - } break; /* end case k_type */ - default: - printf(" *** Faulty type or entity! \n"); - break; - } - - /* execute post method */ - if(post) - post(tore, env); - - return; } -void start_type_walk(ir_node *node, void *env) { - void *pre = ((type_walk_env *)env)->pre; - void *post = ((type_walk_env *)env)->post; - void *envi = ((type_walk_env *)env)->env; - - assert(node); - - switch (get_irn_opcode(node)) { /* node label */ - case iro_SymConst: - if ( (get_SymConst_kind(node) == type_tag) - || (get_SymConst_kind(node) == size)) - type_walk_2((type_or_ent *)get_SymConst_type(node), pre, post, envi); - break; - case iro_Sel: - type_walk_2((type_or_ent *)get_Sel_entity(node), pre, post, envi); - break; - case iro_Call: - type_walk_2((type_or_ent *)get_Call_type(node), pre, post, envi); - break; - case iro_Alloc: - type_walk_2((type_or_ent *)get_Alloc_type(node), pre, post, envi); - break; - case iro_Free: - type_walk_2((type_or_ent *)get_Free_type(node), pre, post, envi); - break; - default: - break; - } +/*****************************************************************************/ + +static void +type_walk_super_2(type_or_ent *tore, + type_walk_func *pre, + type_walk_func *post, + void *env) { + int i, n; + + /* marked? */ + switch (get_kind(tore)) { + case k_entity: + if (entity_visited((ir_entity *)tore)) return; + break; + case k_type: + if (type_id == get_type_tpop((ir_type*)tore)) { + type_walk_super_2((type_or_ent *)skip_tid((ir_type *)tore), pre, post, env); + return; + } + if (type_visited((ir_type *)tore)) return; + break; + default: + break; + } + + /* iterate */ + switch (get_kind(tore)) { + case k_type: + { + ir_type *tp = (ir_type *)tore; + mark_type_visited(tp); + switch (get_type_tpop_code(tp)) { + case tpo_class: + { + /* execute pre method */ + if (pre) + pre(tore, env); + tp = skip_tid((ir_type*)tore); + + n = get_class_n_supertypes(tp); + for (i = 0; i < n; ++i) { + type_walk_super_2((type_or_ent *)get_class_supertype(tp, i), pre, + post, env); + } + + /* execute post method */ + if (post) + post(tore, env); + } + break; + case tpo_struct: + case tpo_method: + case tpo_union: + case tpo_array: + case tpo_enumeration: + case tpo_pointer: + case tpo_primitive: + case tpo_id: + /* dont care */ + break; + default: + printf(" *** Faulty type! \n"); + break; + } + } break; /* end case k_type */ + case k_entity: + /* dont care */ + break; + default: + printf(" *** Faulty type or entity! \n"); + break; + } + return; } -void type_walk(void (pre)(type_or_ent*, void*), - void (post)(type_or_ent*, void*), - void *env) { - int i; - ++type_visited; - /*type_walk_2((type_or_ent *)get_glob_type(), pre, post, env); - global type is on the list visited below, too. */ - for (i = 0; i < get_irp_n_types(); i++) { - type_walk_2((type_or_ent *)get_irp_type(i), pre, post, env); - } +void type_walk_super(type_walk_func *pre, + type_walk_func *post, + void *env) { + int i, n_types = get_irp_n_types(); + ir_type *tp; + + inc_master_type_visited(); + type_walk_super_2((type_or_ent *)get_glob_type(), pre, post, env); + for (i = 0; i < n_types; ++i) { + tp = get_irp_type(i); + type_walk_super_2((type_or_ent *)tp, pre, post, env); + } } -void type_walk_irg (ir_graph *irg, - void (pre)(type_or_ent*, void*), - void (post)(type_or_ent*, void*), - void *env) +/*****************************************************************************/ + + +static void +class_walk_s2s_2(ir_type *tp, + class_walk_func *pre, + class_walk_func *post, + void *env) { - /* this is needed to pass the parameters to the walker that actually - walks the type information */ - type_walk_env* type_env; - type_env = (type_walk_env *) malloc (sizeof(type_walk_env)); - type_env->pre = pre; - type_env->post = post; - type_env->env = env; + int i, n; - ++type_visited; - irg_walk(get_irg_end(irg), start_type_walk, NULL, type_env); + /* marked? */ + if (type_visited(tp)) return; - type_walk_2((type_or_ent *)get_irg_ent(irg), pre, post, env); + assert(is_Class_type(tp)); + /* Assure all supertypes are visited before */ + n = get_class_n_supertypes(tp); + for (i = 0; i < n; ++i) { + if (type_not_visited(get_class_supertype(tp, i))) + return; + } - free(type_env); - return; + mark_type_visited(tp); + + /* execute pre method */ + if (pre) + pre(tp, env); + + tp = skip_tid(tp); + n = get_class_n_subtypes(tp); + for (i = 0; i < n; ++i) { + class_walk_s2s_2(get_class_subtype(tp, i), pre, post, env); + } + /* execute post method */ + if (post) + post(tp, env); + + return; } -void type_walk_s2s_2(type_or_ent *tore, - void (pre)(type_or_ent*, void*), - void (post)(type_or_ent*, void*), - void *env) +void class_walk_super2sub(class_walk_func *pre, + class_walk_func *post, + void *env) { - int i; - - /* marked? */ - switch (get_kind(tore)) { - case k_entity: - if (((entity *)tore)->visit >= type_visited) return; - break; - case k_type: - if(type_id == get_type_tpop((type*)tore)) { - type_walk_s2s_2((type_or_ent *)skip_tid((type *)tore), pre, post, env); - return; - } - if (((type *)tore)->visit >= type_visited) return; - break; - default: - break; - } - - /* iterate */ - switch (get_kind(tore)) { - case k_type: - { - type *tp = (type *)tore; - mark_type_visited(tp); - switch (get_type_tpop_code(tp)) { - case tpo_class: - { - for (i=0; i