+/*
+ * 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 <stdio.h>
#include "beutil.h"
#include "besched_t.h"
-#include "bearch.h"
+#include "bearch_t.h"
/* Get an always empty set. */
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);
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);
}
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);
}
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) {
return num;
}
-/**
- * Sets all node inputs to BAD node.
- */
-void be_kill_node(ir_node *irn) {
- int i;
- ir_graph *irg;
-
- if (is_Bad(irn))
- return;
-
- irg = get_irn_irg(irn);
-
- for (i = get_irn_arity(irn) - 1; i >= 0; --i) {
- set_irn_n(irn, i, get_irg_bad(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.
*/
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;
+}
projects / libfirm / blobdiff