X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.c;h=1637c4d2115408a5c59aa9f5db55959aff43aa2f;hb=bc7b5ee69d084e629590a6977b79a2fab7cd1aa1;hp=ef9ce6dbaa63cd0bb866844d38926e58470f0c70;hpb=39f3a8dbd0f00f90b7b12a849d1bf7b9c1329479;p=libfirm diff --git a/ir/be/beutil.c b/ir/be/beutil.c index ef9ce6dba..1637c4d21 100644 --- a/ir/be/beutil.c +++ b/ir/be/beutil.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. * @@ -23,9 +23,7 @@ * @author Sebastian Hack * @version $Id$ */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif #include @@ -58,77 +56,14 @@ pset *be_empty_set(void) return empty_set; } -struct dump_env { - FILE *f; - arch_env_t *env; -}; - -static void dump_allocated_block(ir_node *block, void *data) -{ - int i, n; - const ir_node *irn; - struct dump_env *dump_env = data; - FILE *f = dump_env->f; - arch_env_t *env = dump_env->env; - - ir_fprintf(f, "node:{title:\"b%N\"\nlabel:\"", block); - sched_foreach(block, irn) { - const char *prefix = ""; - - const arch_register_t *reg = arch_get_irn_register(env, irn); - - ir_fprintf(f, "\n"); - if(reg) - ir_fprintf(f, "%s = ", arch_register_get_name(reg)); - - ir_fprintf(f, "%n(", irn); - - if(block != get_irg_start_block(get_irn_irg(block))) { - for(i = 0, n = get_irn_arity(irn); i < n; ++i) { - ir_node *op = get_irn_n(irn, i); - if(arch_is_register_operand(dump_env->env, op, -1)) { - ir_fprintf(f, "%s%s", prefix, - arch_register_get_name(arch_get_irn_register(env, op))); - prefix = ", "; - } - } - } - - ir_fprintf(f, ")"); - } - ir_fprintf(f, "\"}\n"); - - if(get_irg_start_block(get_irn_irg(block)) != block) { - for(i = 0, n = get_irn_arity(block); i < n; ++i) { - ir_node *pred_bl = get_nodes_block(get_irn_n(block, i)); - ir_fprintf(f, "edge:{sourcename:\"b%N\" targetname:\"b%N\"}\n", block, pred_bl); - } - } -} - -void dump_allocated_irg(arch_env_t *arch_env, ir_graph *irg, char *suffix) -{ - char buf[1024]; - struct dump_env env; - - env.env = arch_env; - - ir_snprintf(buf, sizeof(buf), "%F-alloc%s.vcg", irg, suffix); - - if((env.f = fopen(buf, "wt")) != NULL) { - fprintf(env.f, "graph:{title:\"prg\"\n"); - irg_block_walk_graph(irg, dump_allocated_block, NULL, &env); - fprintf(env.f, "}\n"); - fclose(env.f); - } -} - /** * Edge hook to dump the schedule edges. */ static int sched_edge_hook(FILE *F, ir_node *irn) { - if(sched_is_scheduled(irn) && sched_has_prev(irn)) { + if (is_Proj(irn)) + return 1; + if (sched_is_scheduled(irn) && sched_has_prev(irn)) { ir_node *prev = sched_prev(irn); fprintf(F, "edge:{sourcename:\""); PRINT_NODEID(irn); @@ -143,7 +78,8 @@ void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix) { DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook(); dump_consts_local(0); - set_dump_node_edge_hook(sched_edge_hook); + if (have_sched_info(irg)) + set_dump_node_edge_hook(sched_edge_hook); dump_ir_block_graph(irg, suffix); set_dump_node_edge_hook(old); } @@ -152,7 +88,8 @@ void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix) { DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook(); dump_consts_local(0); - set_dump_node_edge_hook(sched_edge_hook); + if (have_sched_info(irg)) + set_dump_node_edge_hook(sched_edge_hook); dump_ir_extblock_graph(irg, suffix); set_dump_node_edge_hook(old); } @@ -178,30 +115,18 @@ void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const dumper(irg, buf); } - - -static void collect_phis(ir_node *irn, void *data) -{ - if(is_Phi(irn)) { - ir_node *bl = get_nodes_block(irn); - set_irn_link(irn, get_irn_link(bl)); - set_irn_link(bl, irn); - } -} - void be_clear_links(ir_graph *irg) { + ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK); irg_walk_graph(irg, firm_clear_link, NULL, NULL); + ir_free_resources(irg, IR_RESOURCE_IRN_LINK); } -void be_collect_phis(ir_graph *irg) +static void count_num_reachable_nodes(ir_node *irn, void *env) { - irg_walk_graph(irg, collect_phis, NULL, NULL); -} - -static void count_num_reachable_nodes(ir_node *irn, void *env) { int *num = env; (*num)++; + (void) irn; } unsigned get_num_reachable_nodes(ir_graph *irg) { @@ -210,48 +135,6 @@ unsigned get_num_reachable_nodes(ir_graph *irg) { return num; } -/** - * Sets all node inputs to BAD node. - */ -void be_kill_node(ir_node *irn) { - ir_graph *irg = get_irn_irg(irn); - - assert(!is_Bad(irn)); - -#ifdef DEBUG_libfirm - { - int i, first; - first = 0 - ! is_Block(irn); - - for (i = get_irn_arity(irn) - 1; i >= first; --i) { - set_irn_n(irn, i, get_irg_bad(irg)); - } - } -#endif - - edges_node_deleted(irn, irg); -} - -/* FIXME: not used. can be deleted? */ -ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) { - ir_node *irn, *idom; - - /* search the current block */ - for (irn=sched_prev(start_point_exclusive); irn; irn=sched_prev(irn)) - if (pset_find_ptr(accept, irn)) - return irn; - - /* FIXME: This is obviously buggy: after the first recursive call idom is a block - and get_nodes_block will fail. - Moreover, why not a simple iteration instead of recursion */ - idom = get_Block_idom(get_nodes_block(start_point_exclusive)); - - if (idom) - return dom_up_search(accept, idom); /* continue search in idom-block */ - else - return NULL; /* this was the start block and we did not find an acceptable irn */ -} - /** * Gets the Proj with number pn from irn. */ @@ -263,9 +146,22 @@ ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn) { foreach_out_edge(irn, edge) { proj = get_edge_src_irn(edge); - if (get_Proj_proj(proj) == pn) + if (is_Proj(proj) && get_Proj_proj(proj) == pn) return proj; } return NULL; } + +FILE *be_ffopen(const char *base, const char *ext, const char *mode) { + FILE *out; + char buf[1024]; + + snprintf(buf, sizeof(buf), "%s.%s", base, ext); + buf[sizeof(buf) - 1] = '\0'; + if (! (out = fopen(buf, mode))) { + fprintf(stderr, "Cannot open file %s in mode %s\n", buf, mode); + return NULL; + } + return out; +}