X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Ftr%2Ftr_inheritance.c;h=65433b03921bc7c6ef69f4a3b310e7d51c0674de;hb=f2edb6301aa7affb0673e76436d9b4dbaef6b9e1;hp=b03f42e0f79f30f09224d4f6647bde71d85c9483;hpb=1ec30d95387eb392ba5a1adc7958ebd91383d59c;p=libfirm diff --git a/ir/tr/tr_inheritance.c b/ir/tr/tr_inheritance.c index b03f42e0f..65433b039 100644 --- a/ir/tr/tr_inheritance.c +++ b/ir/tr/tr_inheritance.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -27,6 +27,7 @@ # include "config.h" #endif +#include "debug.h" #include "typerep.h" #include "irgraph_t.h" #include "irprog_t.h" @@ -36,6 +37,7 @@ #include "irgwalk.h" #include "irflag.h" +DEBUG_ONLY(static firm_dbg_module_t *dbg); /* ----------------------------------------------------------------------- */ /* Resolve implicit inheritance. */ @@ -145,26 +147,33 @@ typedef enum { } dir; typedef struct { - firm_kind *kind; /* An entity or type. */ + const firm_kind *kind; /**< An entity or type. */ pset *directions[2]; } tr_inh_trans_tp; /* We use this set for all types and entities. */ static set *tr_inh_trans_set = NULL; +/** + * Compare two tr_inh_trans_tp entries. + */ static int tr_inh_trans_cmp(const void *e1, const void *e2, size_t size) { - tr_inh_trans_tp *ef1 = (tr_inh_trans_tp *)e1; - tr_inh_trans_tp *ef2 = (tr_inh_trans_tp *)e2; - return (ef1->kind != ef2->kind); + const tr_inh_trans_tp *ef1 = e1; + const tr_inh_trans_tp *ef2 = e2; + (void) size; + + return ef1->kind != ef2->kind; } -static INLINE unsigned int tr_inh_trans_hash(void *e) { - tr_inh_trans_tp *v = e; +/** + * calculate the hash value of an tr_inh_trans_tp + */ +static INLINE unsigned int tr_inh_trans_hash(const tr_inh_trans_tp *v) { return HASH_PTR(v->kind); } /* This always completes successfully. */ -static tr_inh_trans_tp* get_firm_kind_entry(firm_kind *k) { +static tr_inh_trans_tp *get_firm_kind_entry(const firm_kind *k) { tr_inh_trans_tp a, *found; a.kind = k; @@ -179,38 +188,21 @@ static tr_inh_trans_tp* get_firm_kind_entry(firm_kind *k) { return found; } -static pset *get_entity_map(ir_entity *ent, dir d) { +static pset *get_entity_map(const ir_entity *ent, dir d) { tr_inh_trans_tp *found; assert(is_entity(ent)); - found = get_firm_kind_entry((firm_kind *)ent); + found = get_firm_kind_entry((const firm_kind *)ent); return found->directions[d]; } -/* -static void add_entity_map(ir_entity *ent, dir d, ir_entity *new) { - tr_inh_trans_tp *found; - assert(is_entity(ent) && is_entity(new)); - tr_inh_trans_tp *found = get_firm_kind_entry((firm_kind *)ent); - pset_insert_ptr(found->directions[d], new); -} -*/ -static pset *get_type_map(ir_type *tp, dir d) { +static pset *get_type_map(const ir_type *tp, dir d) { tr_inh_trans_tp *found; assert(is_type(tp)); - found = get_firm_kind_entry((firm_kind *)tp); + found = get_firm_kind_entry((const firm_kind *)tp); return found->directions[d]; } -/* -static void add_type_map(ir_type *tp, dir d, type *new) { - tr_inh_trans_tp *found; - - assert(is_type(tp) && is_type(new)); - found = get_firm_kind_entry((firm_kind *)tp); - pset_insert_ptr(found->directions[d], new); -} -*/ /** @@ -232,7 +224,7 @@ static void add_type_map(ir_type *tp, dir d, type *new) { static void compute_down_closure(ir_type *tp) { pset *myset, *subset; int i, n_subtypes, n_members, n_supertypes; - unsigned long master_visited = get_master_type_visited(); + ir_visited_t master_visited = get_master_type_visited(); assert(is_Class_type(tp)); @@ -286,7 +278,7 @@ static void compute_down_closure(ir_type *tp) { static void compute_up_closure(ir_type *tp) { pset *myset, *subset; int i, n_subtypes, n_members, n_supertypes; - unsigned long master_visited = get_master_type_visited(); + ir_visited_t master_visited = get_master_type_visited(); assert(is_Class_type(tp)); @@ -413,41 +405,41 @@ void free_inh_transitive_closure(void) { /* - subtype ------------------------------------------------------------- */ -ir_type *get_class_trans_subtype_first(ir_type *tp) { +ir_type *get_class_trans_subtype_first(const ir_type *tp) { assert_valid_state(); return pset_first(get_type_map(tp, d_down)); } -ir_type *get_class_trans_subtype_next (ir_type *tp) { +ir_type *get_class_trans_subtype_next(const ir_type *tp) { assert_valid_state(); return pset_next(get_type_map(tp, d_down)); } -int is_class_trans_subtype (ir_type *tp, ir_type *subtp) { +int is_class_trans_subtype(const ir_type *tp, const ir_type *subtp) { assert_valid_state(); return (pset_find_ptr(get_type_map(tp, d_down), subtp) != NULL); } /* - supertype ----------------------------------------------------------- */ -ir_type *get_class_trans_supertype_first(ir_type *tp) { +ir_type *get_class_trans_supertype_first(const ir_type *tp) { assert_valid_state(); return pset_first(get_type_map(tp, d_up)); } -ir_type *get_class_trans_supertype_next (ir_type *tp) { +ir_type *get_class_trans_supertype_next(const ir_type *tp) { assert_valid_state(); return pset_next(get_type_map(tp, d_up)); } /* - overwrittenby ------------------------------------------------------- */ -ir_entity *get_entity_trans_overwrittenby_first(ir_entity *ent) { +ir_entity *get_entity_trans_overwrittenby_first(const ir_entity *ent) { assert_valid_state(); return pset_first(get_entity_map(ent, d_down)); } -ir_entity *get_entity_trans_overwrittenby_next (ir_entity *ent) { +ir_entity *get_entity_trans_overwrittenby_next(const ir_entity *ent) { assert_valid_state(); return pset_next(get_entity_map(ent, d_down)); } @@ -456,20 +448,17 @@ ir_entity *get_entity_trans_overwrittenby_next (ir_entity *ent) { /** Iterate over all transitive overwritten entities. */ -ir_entity *get_entity_trans_overwrites_first(ir_entity *ent) { +ir_entity *get_entity_trans_overwrites_first(const ir_entity *ent) { assert_valid_state(); return pset_first(get_entity_map(ent, d_up)); } -ir_entity *get_entity_trans_overwrites_next (ir_entity *ent) { +ir_entity *get_entity_trans_overwrites_next(const ir_entity *ent) { assert_valid_state(); return pset_next(get_entity_map(ent, d_up)); } - - - /* ----------------------------------------------------------------------- */ /* Classify pairs of types/entities in the inheritance relations. */ /* ----------------------------------------------------------------------- */ @@ -595,9 +584,11 @@ ir_class_cast_state get_irg_class_cast_state(ir_graph *irg) { } void set_irp_class_cast_state(ir_class_cast_state s) { +#ifndef NDEBUG int i; - for (i = 0; i < get_irp_n_irgs(); ++i) + for (i = get_irp_n_irgs() - 1; i >= 0; --i) assert(get_irg_class_cast_state(get_irp_irg(i)) >= s); +#endif irp->class_cast_state = s; } @@ -630,7 +621,7 @@ void verify_irn_class_cast_state(ir_node *n, void *env) { ir_type *fromtype, *totype; int ref_depth = 0; - if (get_irn_op(n) != op_Cast) return; + if (!is_Cast(n)) return; fromtype = get_irn_typeinfo_type(get_Cast_op(n)); totype = get_Cast_type(n); @@ -671,20 +662,22 @@ void verify_irn_class_cast_state(ir_node *n, void *env) { ccs->worst_situation = this_state; } - /** Verify that the graph meets requirements of state set. */ void verify_irg_class_cast_state(ir_graph *irg) { ccs_env env; + FIRM_DBG_REGISTER(dbg, "firm.tr.inheritance"); + env.expected_state = get_irg_class_cast_state(irg); env.worst_situation = ir_class_casts_normalized; irg_walk_graph(irg, NULL, verify_irn_class_cast_state, &env); - if ((env.worst_situation > env.expected_state) && get_firm_verbosity()) { - ir_printf("Note: class cast state is set lower than reqired in graph \n\t%+F\n", irg); - printf(" state is %s, reqired is %s\n", + if ((env.worst_situation > env.expected_state)) { + DB((dbg, LEVEL_1, "Note: class cast state is set lower than reqired " + "in graph \n\t%+F\n", irg)); + DB((dbg, LEVEL_1, " state is %s, reqired is %s\n", get_class_cast_state_string(env.expected_state), - get_class_cast_state_string(env.worst_situation)); + get_class_cast_state_string(env.worst_situation))); } }