X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Finterval_analysis.c;h=fca4311221b0d59dbb1ff137fdd1362a92f283a6;hb=ceefa5a3e6ff610b4b7d92033b8c2443cbc07938;hp=9898964625fa642b1fed62e9a1b74c324e70b17d;hpb=32c4dfb7328ed79a6bb939b6915aa7c78042dc5f;p=libfirm diff --git a/ir/ana/interval_analysis.c b/ir/ana/interval_analysis.c index 989896462..fca431122 100644 --- a/ir/ana/interval_analysis.c +++ b/ir/ana/interval_analysis.c @@ -63,7 +63,8 @@ static set *region_attr_set = NULL; /** * Compare two region attributes for identical regions. */ -static int region_attr_cmp(const void *e1, const void *e2, size_t size) { +static int region_attr_cmp(const void *e1, const void *e2, size_t size) +{ region_attr *ra1 = (region_attr *)e1; region_attr *ra2 = (region_attr *)e2; (void) size; @@ -71,7 +72,8 @@ static int region_attr_cmp(const void *e1, const void *e2, size_t size) { } /** Hash a region attribute (the region only). */ -static inline int attr_set_hash(region_attr *a) { +static inline int attr_set_hash(region_attr *a) +{ return HASH_PTR(a->reg); } @@ -81,11 +83,12 @@ static inline int attr_set_hash(region_attr *a) { * * @param region the region */ -static inline region_attr *get_region_attr(void *region) { +static inline region_attr *get_region_attr(void *region) +{ region_attr r_attr, *res; r_attr.reg = region; - res = set_find(region_attr_set, &r_attr, sizeof(r_attr), attr_set_hash(&r_attr)); + res = (region_attr*) set_find(region_attr_set, &r_attr, sizeof(r_attr), attr_set_hash(&r_attr)); if (res == NULL) { r_attr.in_array = NEW_ARR_F(void *, 0); @@ -95,45 +98,53 @@ static inline region_attr *get_region_attr(void *region) { r_attr.op_array = NULL; r_attr.n_outs = 0; r_attr.n_exc_outs = 0; - res = set_insert(region_attr_set, &r_attr, sizeof(r_attr), attr_set_hash(&r_attr)); + res = (region_attr*) set_insert(region_attr_set, &r_attr, sizeof(r_attr), attr_set_hash(&r_attr)); } return res; } -int get_region_n_ins(void *region) { +int get_region_n_ins(void *region) +{ return ARR_LEN(get_region_attr(region)->in_array); } -void *get_region_in(void *region, int pos) { +void *get_region_in(void *region, int pos) +{ assert(0 <= pos && pos < get_region_n_ins(region)); return ((get_region_attr(region)->in_array)[pos]); } -void add_region_in(void *region, void *in) { +void add_region_in(void *region, void *in) +{ ARR_APP1(void *, get_region_attr(region)->in_array, in); get_region_attr(in)->n_outs++; } -int get_region_n_outs(void *region) { +int get_region_n_outs(void *region) +{ return get_region_attr(region)->n_outs; } -int get_region_n_exc_outs(void *region) { +int get_region_n_exc_outs(void *region) +{ return get_region_attr(region)->n_exc_outs; } -void inc_region_n_exc_outs(void *region) { +static void inc_region_n_exc_outs(void *region) +{ (get_region_attr(region)->n_exc_outs)++; } -void *get_loop_cfop(void *region, int pos) { +void *get_loop_cfop(void *region, int pos) +{ assert(0 <= pos && pos < get_region_n_ins(region)); return ((get_region_attr(region)->op_array)[pos]); } /** Add a control flow op to a loop region. */ -static inline void add_loop_cfop(void *region, void *cfop) { +static inline void add_loop_cfop(void *region, void *cfop) +{ assert(cfop); ARR_APP1(void *, get_region_attr(region)->op_array, cfop); } @@ -145,7 +156,8 @@ static inline void add_loop_cfop(void *region, void *cfop) { * @param reg a region * @param cfop a control flow operation leaving this region */ -static inline void exc_outs(void *reg, ir_node *cfop) { +static inline void exc_outs(void *reg, ir_node *cfop) +{ if (is_fragile_op(cfop) || is_fragile_Proj(cfop)) inc_region_n_exc_outs(reg); } @@ -166,7 +178,8 @@ static inline void exc_outs(void *reg, ir_node *cfop) { * * @return non-zero if outer can be reached from inner via the outer loop relation */ -static int find_outer_loop(ir_loop *inner, ir_loop *outer, ir_node *blk, ir_node *cfop) { +static int find_outer_loop(ir_loop *inner, ir_loop *outer, ir_node *blk, ir_node *cfop) +{ if (get_loop_outer_loop(inner) == outer) { add_region_in(inner, blk); add_loop_cfop(inner, cfop); @@ -183,7 +196,8 @@ static int find_outer_loop(ir_loop *inner, ir_loop *outer, ir_node *blk, ir_node * @param blk a block * @param loop a loop */ -static int test_loop_nest(ir_node *blk, ir_loop *loop) { +static int test_loop_nest(ir_node *blk, ir_loop *loop) +{ int i, n_elems = get_loop_n_elements(loop); for (i = 0; i < n_elems; ++i) { @@ -215,7 +229,8 @@ static int test_loop_nest(ir_node *blk, ir_loop *loop) { * * @return non-zero if pred is from an inner loop */ -static int find_inner_loop(ir_node *blk, ir_loop *l, ir_node *pred, ir_node *cfop) { +static int find_inner_loop(ir_node *blk, ir_loop *l, ir_node *pred, ir_node *cfop) +{ int i, n_elems = get_loop_n_elements(l); int found = 0; @@ -300,7 +315,8 @@ static int find_previous_loop(ir_loop *l, ir_loop *pred_l, ir_node *b, * branches directly from loop k to loop l. Add an edge l->k. Watch it: k must * not be a direct predecessor of l in the loop tree! */ -static void construct_interval_block(ir_node *blk, ir_loop *l) { +static void construct_interval_block(ir_node *blk, ir_loop *l) +{ int i, n_cfgpreds; if (blk == get_irg_start_block(current_ir_graph)) @@ -384,7 +400,8 @@ static void construct_interval_block(ir_node *blk, ir_loop *l) { * * @param l the cf loop */ -static void construct_interval_edges(ir_loop *l) { +static void construct_interval_edges(ir_loop *l) +{ int i, n_elems = get_loop_n_elements(l); for (i = 0; i < n_elems; ++i) { loop_element e = get_loop_element(l, i); @@ -401,7 +418,8 @@ static void construct_interval_edges(ir_loop *l) { } } -void construct_intervals(ir_graph *irg) { +void construct_intervals(ir_graph *irg) +{ ir_loop *l; ir_graph *rem = current_ir_graph; @@ -421,15 +439,16 @@ void construct_intervals(ir_graph *irg) { current_ir_graph = rem; } -void free_intervals(void) { +void free_intervals(void) +{ region_attr *res; if (region_attr_set == NULL) return; - for (res = set_first(region_attr_set); + for (res = (region_attr*) set_first(region_attr_set); res != NULL; - res = set_next(region_attr_set)) { + res = (region_attr*) set_next(region_attr_set)) { DEL_ARR_F(res->in_array); if (res->op_array != NULL) DEL_ARR_F(res->op_array); @@ -444,11 +463,12 @@ void free_intervals(void) { /* */ /*------------------------------------------------------------------*/ -void dump_region_edges(FILE *F, void *reg) { +static void dump_region_edges(FILE *F, void *reg) +{ int i, n_ins = get_region_n_ins(reg); if (is_ir_node(reg)) { - ir_node *irn = reg; + ir_node *irn = (ir_node*) reg; if (get_Block_n_cfgpreds(irn) > get_region_n_ins(reg)) { for (i = n_ins; i < get_Block_n_cfgpreds(irn); ++i) { if (is_backedge(irn, i)) @@ -467,7 +487,7 @@ void dump_region_edges(FILE *F, void *reg) { void *target = get_region_in(reg, i); if (is_ir_node(reg)) { - ir_node *irn = reg; + ir_node *irn = (ir_node*) reg; if (get_Block_n_cfgpreds(irn) != get_region_n_ins(reg)) { ir_printf("n_cfgpreds = %d, n_ins = %d\n %+F\n", get_Block_n_cfgpreds(irn), get_region_n_ins(reg), irn); } @@ -500,7 +520,7 @@ void dump_region_edges(FILE *F, void *reg) { PRINT_LOOPID(((ir_loop *)target)); } fprintf(F, "\""); - if (is_ir_node(reg) && is_fragile_op(skip_Proj(get_Block_cfgpred(reg, i)))) + if (is_ir_node(reg) && is_fragile_op(skip_Proj(get_Block_cfgpred((ir_node*) reg, i)))) fprintf(F, EXC_CF_EDGE_ATTR); fprintf(F, "}\n"); } @@ -508,7 +528,8 @@ void dump_region_edges(FILE *F, void *reg) { #include "execution_frequency.h" -static void dump_interval_block(FILE *F, ir_node *block) { +static void dump_interval_block(FILE *F, ir_node *block) +{ int i, fl; /* This is a block. Dump a node for the block. */ fprintf(F, "node: {title: \""); PRINT_NODEID(block); @@ -525,7 +546,7 @@ static void dump_interval_block(FILE *F, ir_node *block) { fprintf(F, " n_exc_outs: %d", get_region_n_exc_outs(block)); fprintf(F, "\" "); fprintf(F, "info1:\""); - if (dump_dominator_information_flag) + if (ir_get_dump_flags() & ir_dump_flag_dominance) fprintf(F, "dom depth %d\n", get_Block_dom_depth(block)); /* show arity and possible Bad predecessors of the block */ @@ -553,7 +574,8 @@ static void dump_interval_block(FILE *F, ir_node *block) { fprintf(F, "}\n"); } -static void dump_interval_loop(FILE *F, ir_loop *l) { +static void dump_interval_loop(FILE *F, ir_loop *l) +{ int i, n_elems = get_loop_n_elements(l); fprintf(F, "graph: { title: \""); @@ -582,24 +604,14 @@ static void dump_interval_loop(FILE *F, ir_loop *l) { fprintf(F, "}\n\n"); } - -void dump_interval_graph(ir_graph *irg, const char *suffix) { - FILE *f; - ir_graph *rem; - - if (!is_filtered_dump_name(get_entity_ident(get_irg_entity(irg)))) - return; - - f = vcg_open(irg, suffix, "-intervals"); - dump_vcg_header(f, get_irg_dump_name(irg), NULL, NULL); - - rem = current_ir_graph; +void dump_interval_graph(FILE *out, ir_graph *irg) +{ + ir_graph *rem = current_ir_graph; current_ir_graph = irg; - dump_interval_loop(f, get_irg_loop(irg)); - - dump_vcg_footer(f); - fclose(f); + dump_vcg_header(out, get_irg_dump_name(irg), NULL, NULL); + dump_interval_loop(out, get_irg_loop(irg)); + dump_vcg_footer(out); current_ir_graph = rem; }