X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Ftrouts.c;h=15e231d0b9381058b557612200abe9f296b8a92d;hb=b1ac8fe5c7b3b462f66a99e6c780be9826414b7d;hp=d8557db5d4c1059fc28aa727fe55e569cf48c461;hpb=ea75e9d38674b468f602a0699fb64b9c01254797;p=libfirm diff --git a/ir/ana/trouts.c b/ir/ana/trouts.c index d8557db5d..15e231d0b 100644 --- a/ir/ana/trouts.c +++ b/ir/ana/trouts.c @@ -1,20 +1,6 @@ /* - * Copyright (C) 1995-2008 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. + * Copyright (C) 2012 University of Karlsruhe. */ /** @@ -22,11 +8,10 @@ * @brief Reverse edges that reference types/entities. * @author Goetz Lindenmaier * @date 29.10.2004 - * @version $Id$ */ #include "config.h" -#include "trouts.h" +#include "trouts_t.h" #include "array.h" #include "pmap.h" @@ -44,7 +29,6 @@ static pmap *entity_access_map = NULL; static pmap *entity_reference_map = NULL; static pmap *type_alloc_map = NULL; -static pmap *type_cast_map = NULL; static pmap *type_pointertype_map = NULL; static pmap *type_arraytype_map = NULL; @@ -54,12 +38,10 @@ static pmap *type_arraytype_map = NULL; */ static ir_node **get_entity_access_array(const ir_entity *ent) { - ir_node **res; if (!entity_access_map) entity_access_map = pmap_create(); - if (pmap_contains(entity_access_map, ent)) { - res = (ir_node **) pmap_get(entity_access_map, ent); - } else { + ir_node **res = pmap_get(ir_node*, entity_access_map, ent); + if (!res) { res = NEW_ARR_F(ir_node *, 0); pmap_insert(entity_access_map, ent, (void *)res); } @@ -69,9 +51,7 @@ static ir_node **get_entity_access_array(const ir_entity *ent) static void set_entity_access_array(const ir_entity *ent, ir_node **accs) { - ir_node **old = pmap_get(entity_access_map, ent); - if (old != accs) - pmap_insert(entity_access_map, ent, (void *)accs); + pmap_insert(entity_access_map, ent, (void *)accs); } /** @@ -80,12 +60,10 @@ static void set_entity_access_array(const ir_entity *ent, ir_node **accs) */ static ir_node **get_entity_reference_array(const ir_entity *ent) { - ir_node **res; if (!entity_reference_map) entity_reference_map = pmap_create(); - if (pmap_contains(entity_reference_map, ent)) { - res = (ir_node **) pmap_get(entity_reference_map, ent); - } else { + ir_node **res = pmap_get(ir_node*, entity_reference_map, ent); + if (!res) { res = NEW_ARR_F(ir_node *, 0); pmap_insert(entity_reference_map, ent, (void *)res); } @@ -95,9 +73,7 @@ static ir_node **get_entity_reference_array(const ir_entity *ent) static void set_entity_reference_array(const ir_entity *ent, ir_node **refs) { - ir_node **old = pmap_get(entity_reference_map, ent); - if (old != refs) - pmap_insert(entity_reference_map, ent, (void *)refs); + pmap_insert(entity_reference_map, ent, (void *)refs); } /** @@ -106,12 +82,10 @@ static void set_entity_reference_array(const ir_entity *ent, ir_node **refs) */ static ir_node **get_type_alloc_array(const ir_type *tp) { - ir_node **res; if (!type_alloc_map) type_alloc_map = pmap_create(); - if (pmap_contains(type_alloc_map, tp)) { - res = (ir_node **) pmap_get(type_alloc_map, tp); - } else { + ir_node **res = pmap_get(ir_node*, type_alloc_map, tp); + if (!res) { res = NEW_ARR_F(ir_node *, 0); pmap_insert(type_alloc_map, tp, (void *)res); } @@ -121,34 +95,7 @@ static ir_node **get_type_alloc_array(const ir_type *tp) static void set_type_alloc_array(const ir_type *tp, ir_node **alls) { - ir_node **old = pmap_get(type_alloc_map, tp); - if (old != alls) - pmap_insert(type_alloc_map, tp, (void *)alls); -} - -/** - * Return a flexible array containing all Cast-nodes - * that "create" a given type. - */ -static ir_node **get_type_cast_array(const ir_type *tp) -{ - ir_node **res; - if (!type_cast_map) type_cast_map = pmap_create(); - - if (pmap_contains(type_cast_map, tp)) { - res = (ir_node **) pmap_get(type_cast_map, tp); - } else { - res = NEW_ARR_F(ir_node *, 0); - pmap_insert(type_cast_map, tp, (void *)res); - } - return res; -} - -static void set_type_cast_array(const ir_type *tp, ir_node **alls) -{ - ir_node **old = pmap_get(type_cast_map, tp); - if (old != alls) - pmap_insert(type_cast_map, tp, (void *)alls); + pmap_insert(type_alloc_map, tp, (void *)alls); } /** @@ -157,12 +104,10 @@ static void set_type_cast_array(const ir_type *tp, ir_node **alls) */ static ir_type **get_type_pointertype_array(const ir_type *tp) { - ir_type **res; if (!type_pointertype_map) type_pointertype_map = pmap_create(); - if (pmap_contains(type_pointertype_map, tp)) { - res = (ir_type **) pmap_get(type_pointertype_map, tp); - } else { + ir_type **res = pmap_get(ir_type*, type_pointertype_map, tp); + if (!res) { res = NEW_ARR_F(ir_type *, 0); pmap_insert(type_pointertype_map, tp, (void *)res); } @@ -172,9 +117,7 @@ static ir_type **get_type_pointertype_array(const ir_type *tp) static void set_type_pointertype_array(const ir_type *tp, ir_type **pts) { - ir_type **old = pmap_get(type_pointertype_map, tp); - if (old != pts) - pmap_insert(type_pointertype_map, tp, (void *)pts); + pmap_insert(type_pointertype_map, tp, (void *)pts); } /** @@ -183,12 +126,10 @@ static void set_type_pointertype_array(const ir_type *tp, ir_type **pts) */ static ir_type **get_type_arraytype_array(const ir_type *tp) { - ir_type **res; if (!type_arraytype_map) type_arraytype_map = pmap_create(); - if (pmap_contains(type_arraytype_map, tp)) { - res = (ir_type **) pmap_get(type_arraytype_map, tp); - } else { + ir_type **res = pmap_get(ir_type*, type_arraytype_map, tp); + if (!res) { res = NEW_ARR_F(ir_type *, 0); pmap_insert(type_arraytype_map, tp, (void *)res); } @@ -198,9 +139,7 @@ static ir_type **get_type_arraytype_array(const ir_type *tp) static void set_type_arraytype_array(const ir_type *tp, ir_type **pts) { - ir_type **old = pmap_get(type_arraytype_map, tp); - if (old != pts) - pmap_insert(type_arraytype_map, tp, (void *)pts); + pmap_insert(type_arraytype_map, tp, (void *)pts); } /*------------------------------------------------------------------*/ @@ -213,7 +152,7 @@ static void set_type_arraytype_array(const ir_type *tp, ir_type **pts) /* Access routines for entities */ /**------------------------------------------------------------------*/ -int get_entity_n_accesses(const ir_entity *ent) +size_t get_entity_n_accesses(const ir_entity *ent) { ir_node ** accs; @@ -223,11 +162,11 @@ int get_entity_n_accesses(const ir_entity *ent) return ARR_LEN(accs); } -ir_node *get_entity_access(const ir_entity *ent, int pos) +ir_node *get_entity_access(const ir_entity *ent, size_t pos) { ir_node ** accs; - assert(0 <= pos && pos < get_entity_n_accesses(ent)); + assert(pos < get_entity_n_accesses(ent)); accs = get_entity_access_array(ent); return accs[pos]; @@ -245,22 +184,9 @@ static void add_entity_access(const ir_entity *ent, ir_node *n) set_entity_access_array(ent, accs); } -#if 0 -void set_entity_access(const ir_entity *ent, int pos, ir_node *n) -{ - ir_node ** accs; - - assert(0 <= pos && pos < get_entity_n_accesses(ent)); - assert(n && is_ir_node(n)); - - accs = get_entity_access_array(ent); - accs[pos] = n; -} -#endif - /*------------------------------------------------------------------*/ -int get_entity_n_references(const ir_entity *ent) +size_t get_entity_n_references(const ir_entity *ent) { ir_node ** refs; @@ -270,11 +196,11 @@ int get_entity_n_references(const ir_entity *ent) return ARR_LEN(refs); } -ir_node *get_entity_reference(const ir_entity *ent, int pos) +ir_node *get_entity_reference(const ir_entity *ent, size_t pos) { ir_node ** refs; - assert(0 <= pos && pos < get_entity_n_references(ent)); + assert( pos < get_entity_n_references(ent)); refs = get_entity_reference_array(ent); return refs[pos]; @@ -292,25 +218,12 @@ static void add_entity_reference(const ir_entity *ent, ir_node *n) set_entity_reference_array(ent, refs); } -#if 0 -void set_entity_reference(const ir_entity *ent, int pos, ir_node *n) -{ - ir_node ** refs; - - assert(0 <= pos && pos < get_entity_n_references(ent)); - assert(n && is_ir_node(n)); - - refs = get_entity_reference_array(ent); - refs[pos] = n; -} -#endif - /**------------------------------------------------------------------*/ /* Access routines for types */ /**------------------------------------------------------------------*/ /* Number of Alloc nodes that create an instance of this type */ -int get_type_n_allocs(const ir_type *tp) +size_t get_type_n_allocs(const ir_type *tp) { ir_node **allocs; @@ -321,10 +234,10 @@ int get_type_n_allocs(const ir_type *tp) } /* Alloc node that creates an instance of this type */ -ir_node *get_type_alloc(const ir_type *tp, int pos) +ir_node *get_type_alloc(const ir_type *tp, size_t pos) { ir_node **allocs; - assert(0 <= pos && pos < get_type_n_allocs(tp)); + assert( pos < get_type_n_allocs(tp)); allocs = get_type_alloc_array(tp); return allocs[pos]; @@ -342,93 +255,9 @@ static void add_type_alloc(const ir_type *tp, ir_node *n) set_type_alloc_array(tp, allocs); } -#if 0 -void set_type_alloc(const ir_type *tp, int pos, ir_node *n) -{ - ir_node **allocs; - - assert(0 <= pos && pos < get_type_n_allocs(tp)); - assert(n && is_ir_node(n)); - - allocs = get_type_alloc_array(tp); - allocs[pos] = n; -} -#endif - -/* Number of Cast nodes that create an instance of this type */ -int get_type_n_casts(const ir_type *tp) -{ - ir_node **casts; - - assert(tp && is_type(tp)); - - casts = get_type_cast_array(tp); - return ARR_LEN(casts); -} - - -int get_class_n_upcasts(const ir_type *clss) -{ - int i, n_casts = get_type_n_casts(clss); - int n_instances = 0; - for (i = 0; i < n_casts; ++i) { - ir_node *cast = get_type_cast(clss, i); - if (is_Cast_upcast(cast)) - ++n_instances; - } - return n_instances; -} - -int get_class_n_downcasts(const ir_type *clss) -{ - int i, n_casts = get_type_n_casts(clss); - int n_instances = 0; - for (i = 0; i < n_casts; ++i) { - ir_node *cast = get_type_cast(clss, i); - if (is_Cast_downcast(cast)) - ++n_instances; - } - return n_instances; -} - -/* Cast node that creates an instance of this type */ -ir_node *get_type_cast(const ir_type *tp, int pos) -{ - ir_node **casts; - assert(0 <= pos && pos < get_type_n_casts(tp)); - - casts = get_type_cast_array(tp); - return casts[pos]; -} - -void add_type_cast(const ir_type *tp, ir_node *n) -{ - ir_node **casts; - - assert(tp && is_type(tp)); - assert(n && is_ir_node(n)); - - casts = get_type_cast_array(tp); - ARR_APP1(ir_node *, casts, n); - set_type_cast_array(tp, casts); -} - -#if 0 -void set_type_cast(const ir_type *tp, int pos, ir_node *n) -{ - ir_node **casts; - - assert(0 <= pos && pos < get_type_n_casts(tp)); - assert(n && is_ir_node(n)); - - casts = get_type_cast_array(tp); - casts[pos] = n; -} -#endif - /*------------------------------------------------------------------*/ -int get_type_n_pointertypes_to(const ir_type *tp) +size_t get_type_n_pointertypes_to(const ir_type *tp) { ir_type ** pts; @@ -438,11 +267,11 @@ int get_type_n_pointertypes_to(const ir_type *tp) return ARR_LEN(pts); } -ir_type *get_type_pointertype_to(const ir_type *tp, int pos) +ir_type *get_type_pointertype_to(const ir_type *tp, size_t pos) { ir_type ** pts; - assert(0 <= pos && pos < get_type_n_pointertypes_to(tp)); + assert(pos < get_type_n_pointertypes_to(tp)); pts = get_type_pointertype_array(tp); return pts[pos]; @@ -456,26 +285,13 @@ void add_type_pointertype_to(const ir_type *tp, ir_type *ptp) assert(ptp && is_Pointer_type(ptp)); pts = get_type_pointertype_array(tp); - ARR_APP1(ir_node *, pts, ptp); + ARR_APP1(ir_type*, pts, ptp); set_type_pointertype_array(tp, pts); } -#if 0 -void set_type_pointertype_to(const ir_type *tp, int pos, ir_type *ptp) -{ - ir_type ** pts; - - assert(0 <= pos && pos < get_type_n_pointertypes_to(tp)); - assert(ptp && is_Pointer_type(ptp)); - - pts = get_type_pointertype_array(tp); - pts[pos] = ptp; -} -#endif - /*------------------------------------------------------------------*/ -int get_type_n_arraytypes_of(const ir_type *tp) +size_t get_type_n_arraytypes_of(const ir_type *tp) { ir_type ** pts; @@ -485,11 +301,11 @@ int get_type_n_arraytypes_of(const ir_type *tp) return ARR_LEN(pts); } -ir_type *get_type_arraytype_of(const ir_type *tp, int pos) +ir_type *get_type_arraytype_of(const ir_type *tp, size_t pos) { ir_type ** pts; - assert(0 <= pos && pos < get_type_n_arraytypes_of(tp)); + assert(pos < get_type_n_arraytypes_of(tp)); pts = get_type_arraytype_array(tp); return pts[pos]; @@ -503,23 +319,10 @@ void add_type_arraytype_of(const ir_type *tp, ir_type *atp) assert(atp && is_Array_type(atp)); pts = get_type_arraytype_array(tp); - ARR_APP1(ir_node *, pts, atp); + ARR_APP1(ir_type*, pts, atp); set_type_arraytype_array(tp, pts); } -#if 0 -void set_type_arraytype_of(const ir_type *tp, int pos, ir_type *atp) -{ - ir_type ** pts; - - assert(0 <= pos && pos < get_type_n_arraytypes_of(tp)); - assert(atp && is_Array_type(atp)); - - pts = get_type_arraytype_array(tp); - pts[pos] = atp; -} -#endif - /*------------------------------------------------------------------*/ /* Building and Removing the out datastructure */ /*------------------------------------------------------------------*/ @@ -595,17 +398,16 @@ static void chain_accesses(ir_node *n, void *env) if (is_Alloc(n)) { add_type_alloc(get_Alloc_type(n), n); return; - } else if (is_Cast(n)) { - add_type_cast(get_Cast_type(n), n); - return; } else if (is_Sel(n)) { add_entity_reference(get_Sel_entity(n), n); return; } else if (is_SymConst_addr_ent(n)) { add_entity_reference(get_SymConst_entity(n), n); return; - } else if (is_memop(n)) { - addr = get_memop_ptr(n); + } else if (is_Store(n)) { + addr = get_Store_ptr(n); + } else if (is_Load(n)) { + addr = get_Load_ptr(n); } else if (is_Call(n)) { addr = get_Call_ptr(n); if (! is_Sel(addr)) return; /* Sels before Calls mean a Load / polymorphic Call. */ @@ -636,37 +438,25 @@ static void chain_types(ir_type *tp) } } -irg_outs_state get_trouts_state(void) -{ - return irp->trouts_state; -} - -void set_trouts_inconsistent(void) -{ - if (irp->trouts_state == outs_consistent) - irp->trouts_state = outs_inconsistent; -} - -/* compute the trouts data structures. */ void compute_trouts(void) { - int i; + size_t i; free_trouts(); init_trouts(); /* Compute outs for IR nodes. */ - for (i = get_irp_n_irgs() - 1; i >= 0; --i) { - irg_walk_graph(get_irp_irg(i), NULL, chain_accesses, NULL); + for (i = get_irp_n_irgs(); i > 0;) { + ir_graph *irg = get_irp_irg(--i); + irg_walk_graph(irg, NULL, chain_accesses, NULL); } walk_const_code(NULL, chain_accesses, NULL); /* Compute outs for types */ - for (i = get_irp_n_types() - 1; i >= 0; --i) { - chain_types(get_irp_type(i)); + for (i = get_irp_n_types(); i > 0;) { + ir_type *type = get_irp_type(--i); + chain_types(type); } - - irp->trouts_state = outs_consistent; } void free_trouts(void) @@ -675,8 +465,9 @@ void free_trouts(void) ir_node **accs; for (accs = (ir_node **)pmap_first(entity_access_map); accs; - accs = (ir_node **)pmap_next(entity_access_map)) - ; //DEL_ARR_F(accs); + accs = (ir_node **)pmap_next(entity_access_map)) { + /* DEL_ARR_F(accs); */ + } pmap_destroy(entity_access_map); entity_access_map = NULL; } @@ -685,8 +476,9 @@ void free_trouts(void) ir_node **refs; for (refs = (ir_node **)pmap_first(entity_reference_map); refs; - refs = (ir_node **)pmap_next(entity_reference_map)) - ; //DEL_ARR_F(refs); + refs = (ir_node **)pmap_next(entity_reference_map)) { + /* DEL_ARR_F(refs); */ + } pmap_destroy(entity_reference_map); entity_reference_map = NULL; } @@ -695,28 +487,20 @@ void free_trouts(void) ir_node **alls; for (alls = (ir_node **)pmap_first(type_alloc_map); alls; - alls = (ir_node **)pmap_next(type_alloc_map)) - ; //DEL_ARR_F(alls); + alls = (ir_node **)pmap_next(type_alloc_map)) { + /* DEL_ARR_F(alls); */ + } pmap_destroy(type_alloc_map); type_alloc_map = NULL; } - if (type_cast_map) { - ir_node **casts; - for (casts = (ir_node **)pmap_first(type_cast_map); - casts; - casts = (ir_node **)pmap_next(type_cast_map)) - ; //DEL_ARR_F(alls); - pmap_destroy(type_cast_map); - type_cast_map = NULL; - } - if (type_pointertype_map) { ir_node **pts; for (pts = (ir_node **)pmap_first(type_pointertype_map); pts; - pts = (ir_node **)pmap_next(type_pointertype_map)) - ; //DEL_ARR_F(pts); + pts = (ir_node **)pmap_next(type_pointertype_map)) { + /* DEL_ARR_F(pts); */ + } pmap_destroy(type_pointertype_map); type_pointertype_map = NULL; } @@ -725,11 +509,10 @@ void free_trouts(void) ir_node **pts; for (pts = (ir_node **)pmap_first(type_arraytype_map); pts; - pts = (ir_node **)pmap_next(type_arraytype_map)) - ; //DEL_ARR_F(pts); + pts = (ir_node **)pmap_next(type_arraytype_map)) { + /* DEL_ARR_F(pts); */ + } pmap_destroy(type_arraytype_map); type_arraytype_map = NULL; } - - irp->trouts_state = outs_none; }