X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.c;h=2e884d0c7aa7c700fd71ddd22cc3d0aced83fec8;hb=5728d0c2eae6d6f026d1a5435f9f0e4fa67382a2;hp=bcf3c286d2816fdbe0aa3be321b5e94dd11d2a7d;hpb=a7fc1375330ff549c0382b662e123adeb6de46ed;p=libfirm diff --git a/ir/be/beutil.c b/ir/be/beutil.c index bcf3c286d..2e884d0c7 100644 --- a/ir/be/beutil.c +++ b/ir/be/beutil.c @@ -1,11 +1,29 @@ +/* + * 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. + */ + /** - * Contains some useful function for the backend. - * @author Sebastian Hack - * @cvsid $Id$ + * @file + * @brief Contains some useful function for the backend. + * @author Sebastian Hack + * @version $Id$ */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif #include @@ -20,9 +38,10 @@ #include "irgopt.h" #include "irtools.h" #include "irprintf.h" +#include "iredges.h" #include "beutil.h" -#include "besched_t.h" +#include "besched.h" #include "bearch.h" /* Get an always empty set. */ @@ -37,111 +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); - } -} - -static void localize_const_walker(ir_node *irn, void *data) -{ - if(!is_Block(irn)) { - int i, n; - - for(i = 0, n = get_irn_arity(irn); i < n; ++i) { - ir_node *op = get_irn_n(irn, i); - if(get_irn_opcode(op) == iro_Const) { - ir_node *tgt_block, *cnst; - - /* Special treatment for phi nodes, because phi-usage is different */ - tgt_block = get_nodes_block(irn); - if(is_Phi(irn)) - tgt_block = get_nodes_block(get_irn_n(tgt_block, i)); - - /* - * We have to create the const node by ourselves, since the - * firmcons implementation always places it in the start block. - */ - cnst = new_ir_node(NULL, get_irn_irg(irn), - tgt_block, op_Const, get_irn_mode(op), 0, NULL); - cnst->attr.con.tv = get_Const_tarval(op); - set_irn_n(irn, i, cnst); - } - } - } -} - -void localize_consts(ir_graph *irg) -{ - irg_walk_graph(irg, localize_const_walker, NULL, NULL); - dead_node_elimination(irg); -} - /** * 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); @@ -156,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); } @@ -165,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); } @@ -183,7 +107,7 @@ void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const if (irg != last_irg) { last_irg = irg; - nr = 0; + nr = strcmp(suffix, "-abi") ? 0 : 1; } snprintf(buf, sizeof(buf), "-%02d%s", nr++, suffix); @@ -191,30 +115,16 @@ 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) { irg_walk_graph(irg, firm_clear_link, NULL, NULL); } -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) { @@ -223,22 +133,55 @@ unsigned get_num_reachable_nodes(ir_graph *irg) { return num; } -/* FIXME: not used. can be deleted? */ -ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) { - ir_node *irn, *idom; +/** + * Gets the Proj with number pn from irn. + */ +ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn) { + const ir_edge_t *edge; + ir_node *proj; + assert(get_irn_mode(irn) == mode_T && "need mode_T"); + + foreach_out_edge(irn, edge) { + proj = get_edge_src_irn(edge); + + 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; +} + +static void add_to_postorder(ir_node *block, void *data) +{ + ir_node ***list = (ir_node***) data; + ARR_APP1(ir_node*, *list, block); +} + +ir_node **be_get_cfgpostorder(ir_graph *irg) +{ + ir_node **list = NEW_ARR_F(ir_node*, 0); + ir_node *end_block = get_irg_end_block(irg); - /* search the current block */ - for (irn=sched_prev(start_point_exclusive); irn; irn=sched_prev(irn)) - if (pset_find_ptr(accept, irn)) - return irn; + /* end block may be unreachable in case of endless loops */ + if (get_Block_n_cfgpreds(end_block) == 0) + ARR_APP1(ir_node*, list, end_block); - /* 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)); + /* walk blocks */ + irg_block_edges_walk(get_irg_start_block(irg), NULL, add_to_postorder, + &list); - 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 */ + return list; }