/* $Id$ */
#ifdef HAVE_CONFIG_H
#include "config.h"
-#endif
+#endif /* defined HAVE_CONFIG_H */
#include "irouts.h"
#include "irnode_t.h"
#include "irgraph_t.h" /* To access irg->outs field (which is private to this module)
- without public access routine */
-#include "irprog.h"
+ without public access routine */
+#include "irprog_t.h"
+#include "irgwalk.h"
+#include "string.h"
+
+#ifdef DEBUG_libfirm
+/* Note: ir_node.out_valid and ir_graph.n_outs are only present when DEBUG_libfirm is defined */
+/* Accesses to out_valid and n_outs are fenced out to avoid breakage
+ when compiling with neither DEBUG_libfirm or NDEBUG defined */
+#endif /* defined DEBUG_libfirm */
/**********************************************************************/
/** Accessing the out datastructures **/
/**********************************************************************/
+static void reset_outs (ir_node *node, void *unused)
+{
+ node->out = NULL;
+#ifdef DEBUG_libfirm
+ node->out_valid = 0;
+#endif /* defined DEBUG_libfirm */
+}
+
/* returns the number of successors of the node: */
INLINE int get_irn_n_outs (ir_node *node) {
+#ifdef DEBUG_libfirm
+ assert (node->out_valid);
+#endif /* defined DEBUG_libfirm */
return (int)(node->out[0]);
}
INLINE ir_node *get_irn_out (ir_node *node, int pos) {
assert(node);
assert(pos >= 0 && pos < get_irn_n_outs(node));
+#ifdef DEBUG_libfirm
+ assert (node->out_valid);
+#endif /* defined DEBUG_libfirm */
return node->out[pos+1];
}
INLINE void set_irn_out (ir_node *node, int pos, ir_node *out) {
assert(node && out);
assert(pos >= 0 && pos < get_irn_n_outs(node));
+#ifdef DEBUG_libfirm
+ assert (node->out_valid);
+#endif /* defined DEBUG_libfirm */
node->out[pos+1] = out;
}
INLINE int get_Block_n_cfg_outs (ir_node *bl) {
int i, n_cfg_outs = 0;
assert(bl && (get_irn_op(bl) == op_Block));
+#ifdef DEBUG_libfirm
+ assert (bl->out_valid);
+#endif /* defined DEBUG_libfirm */
for (i = 0; i < (int)bl->out[0]; i++)
if ((get_irn_mode(bl->out[i+1]) == mode_X) &&
- (get_irn_op(bl->out[i+1]) != op_End)) n_cfg_outs++;
+ (get_irn_op(bl->out[i+1]) != op_End)) n_cfg_outs++;
return n_cfg_outs;
}
INLINE ir_node *get_Block_cfg_out (ir_node *bl, int pos) {
int i, out_pos = 0;
assert(bl && (get_irn_op(bl) == op_Block));
+#ifdef DEBUG_libfirm
+ assert (bl->out_valid);
+#endif /* defined DEBUG_libfirm */
for (i = 0; i < (int)bl->out[0]; i++)
if ((get_irn_mode(bl->out[i+1]) == mode_X) &&
- (get_irn_op(bl->out[i+1]) != op_End)) {
+ (get_irn_op(bl->out[i+1]) != op_End)) {
if (out_pos == pos) {
- ir_node *cfop = bl->out[i+1];
- return cfop->out[0+1];
+ ir_node *cfop = bl->out[i+1];
+ return cfop->out[0+1];
} else {
- out_pos++;
+ out_pos++;
}
}
return NULL;
}
void irg_out_walk_2(ir_node *node, irg_walk_func *pre,
- irg_walk_func *post, void *env) {
+ irg_walk_func *post, void *env) {
int i;
ir_node *succ;
}
void irg_out_walk(ir_node *node,
- irg_walk_func *pre, irg_walk_func *post,
- void *env) {
+ irg_walk_func *pre, irg_walk_func *post,
+ void *env) {
assert(node);
if (get_irg_outs_state(current_ir_graph) != no_outs) {
inc_irg_visited (current_ir_graph);
}
void irg_out_block_walk2(ir_node *bl,
- irg_walk_func *pre, irg_walk_func *post,
- void *env) {
+ irg_walk_func *pre, irg_walk_func *post,
+ void *env) {
int i;
- assert(get_irn_opcode(bl) == iro_Block);
-
if(get_Block_block_visited(bl) < get_irg_block_visited(current_ir_graph)) {
set_Block_block_visited(bl, get_irg_block_visited(current_ir_graph));
for(i = 0; i < get_Block_n_cfg_outs(bl); i++) {
/* find the corresponding predecessor block. */
ir_node *pred = get_Block_cfg_out(bl, i);
- assert(get_irn_opcode(pred) == iro_Block);
/* recursion */
irg_out_block_walk2(pred, pre, post, env);
}
/* Walks only over Block nodes in the graph. Has it's own visited
flag, so that it can be interleaved with the other walker. */
void irg_out_block_walk(ir_node *node,
- irg_walk_func *pre, irg_walk_func *post,
- void *env) {
+ irg_walk_func *pre, irg_walk_func *post,
+ void *env) {
assert((get_irn_op(node) == op_Block) || (get_irn_mode(node) == mode_X));
inc_irg_block_visited(current_ir_graph);
if (get_irn_mode(node) == mode_X) node = node->out[1];
- assert(get_irn_opcode(node) == iro_Block);
irg_out_block_walk2(node, pre, post, env);
/** Then the large array is allocated. The second iteration chops **/
/** the large array into smaller parts, sets the out edges and **/
/** recounts the out edges. **/
+/** Removes Tuple nodes! **/
/**********************************************************************/
set_irn_visited(n, get_irg_visited(current_ir_graph));
n->out = (ir_node **) 1; /* Space for array size. */
- if ((get_irn_op(n) == op_Block)) start = 0; else start = -1;
+ start = get_irn_op(n) == op_Block ? 0 : -1;
irn_arity = get_irn_arity(n);
res = irn_arity - start +1; /* --1 or --0; 1 for array size. */
for (i = start; i < irn_arity; i++) {
succ = skip_Tuple(get_irn_n(n, i));
set_irn_n(n, i, succ);
/* count outs for successors */
- if (get_irn_visited(succ) < get_irg_visited(current_ir_graph))
+ if (get_irn_visited(succ) < get_irg_visited(current_ir_graph)) {
res += count_outs(succ);
+ }
/* Count my outs */
succ->out = (ir_node **)( (int)succ->out +1);
}
/* Allocate my array */
n_outs = (int) n->out;
n->out = free;
+#ifdef DEBUG_libfirm
+ n->out_valid = 1;
+#endif /* defined DEBUG_libfirm */
free = &free[n_outs];
/* We count the successors again, the space will be sufficient.
We use this counter to remember the position for the next back
startbl = get_irg_start_block(irg);
for (i = 0; i < get_irn_n_outs(startbl); i++)
if (get_irn_mode(get_irn_out(startbl, i)) == mode_X)
- proj = get_irn_out(startbl, i);
+ proj = get_irn_out(startbl, i);
if (get_irn_out(proj, 0) == startbl) {
assert(get_irn_n_outs(proj) == 2);
set_irn_out(proj, 0, get_irn_out(proj, 1));
void compute_outs(ir_graph *irg) {
ir_graph *rem = current_ir_graph;
int n_out_edges = 0;
+ ir_node **end = NULL; /* Only for debugging */
current_ir_graph = irg;
/* Update graph state */
assert(get_irg_phase_state(current_ir_graph) != phase_building);
+ if (current_ir_graph->outs_state != no_outs) free_outs(current_ir_graph);
current_ir_graph->outs_state = outs_consistent;
/* This first iteration counts the overall number of out edges and the
n_out_edges = count_outs(get_irg_end(irg));
/* allocate memory for all out edges. */
- irg->outs = (ir_node **) malloc (n_out_edges * sizeof(ir_node *));
+ irg->outs = (ir_node **) xmalloc (n_out_edges * sizeof(ir_node *));
+#ifdef DEBUG_libfirm
+ irg->n_outs = n_out_edges;
+#endif /* defined DEBUG_libfirm */
/* The second iteration splits the irg->outs array into smaller arrays
for each node and writes the back edges into this array. */
inc_irg_visited(irg);
- set_out_edges(get_irg_end(irg), irg->outs);
+ end = set_out_edges(get_irg_end(irg), irg->outs);
+
+#ifdef DEBUG_libfirm
+ /* Check how much memory we have used */
+ assert (end == (irg->outs + n_out_edges));
+#endif /* defined DEBUG_libfirm */
/* We want that the out of ProjX from Start contains the next block at
position 1, the Start block at position 2. This is necessary for
current_ir_graph = rem;
}
-/*
- This computes the outedges for in interprocedural graph.
-*/
-void compute_ip_outs(ir_graph *irg) {
- int i;
- ir_graph *rem = current_ir_graph;
- int rem_view = interprocedural_view;
- interprocedural_view = true;
- inc_max_irg_visited();
- /* Fix all irg_visited flags */
- for (i = 0; i < get_irp_n_irgs(); i++)
- set_irg_visited(get_irp_irg(i), get_max_irg_visited());
+/*------------------------------------------------------------*
+ * This computes the outedges for in interprocedural graph. *
+ * There is one quirk: *
+ * The number of the outedges for each node is saved in *
+ * the first member of the ir_node** array. Maybe we should *
+ * change this to make it more portable... *
+ *------------------------------------------------------------*/
- /* Walk starting at unreachable procedures. Only these
- * have End blocks visible in interprocedural view. */
- for (i = 0; i < get_irp_n_irgs(); i++) {
- ir_node *sb;
- current_ir_graph = get_irp_irg(i);
- sb = get_irg_start_block(current_ir_graph);
+/* ------------------------------------------
+ Inits the number of outedges for each node
+ before counting.
+ ------------------------------------------ */
- if ((get_Block_n_cfgpreds(sb) > 1) ||
- (get_nodes_block(get_Block_cfgpred(sb, 0)) != sb)) continue;
+static void init_count(ir_node * node, void * env)
+{
+ node->out = (ir_node **) 1; /* 1 for the array size */
+}
- compute_outs(current_ir_graph); /*cg_walk_2(get_irg_end(current_ir_graph), pre, post, env);*/
- }
- /* Check whether we walked all procedures: there could be procedures
- with cyclic calls but no call from the outside. */
- for (i = 0; i < get_irp_n_irgs(); i++) {
- ir_node *sb;
- current_ir_graph = get_irp_irg(i);
-
- /* Test start block: if inner procedure end and end block are not
- * visible and therefore not marked. */
- sb = get_irg_start_block(current_ir_graph);
- if (get_irn_visited(sb) < get_irg_visited(current_ir_graph)) {
- compute_outs(current_ir_graph); /*cg_walk_2(sb, pre, post, env); */
- }
+/* -----------------------------------------------
+ Adjusts the out edge count for its predecessors
+ and adds the current arity to the overall count,
+ which is saved in "env"
+ ------------------------------------------------ */
+
+static void node_arity_count(ir_node * node, void * env)
+{
+ int *anz = (int *) env, arity, i, start;
+ ir_node *succ;
+
+ arity = 1 + get_irn_arity(node)
+ + ((is_Block(node)) ? 0 : 1);
+ *anz += arity;
+
+ start = (is_Block(node)) ? 0 : -1;
+ for(i = start; i < get_irn_arity(node); i++) {
+ succ = get_irn_n(node, i);
+ succ->out = (ir_node **)((int)succ->out + 1);
}
+}
- /* Walk all endless loops in inner procedures.
- * We recognize an inner procedure if the End node is not visited. */
+/* ----------------------------------------
+ Inits all nodes for setting the outedges
+ Returns the overall count of edges
+ ---------------------------------------- */
- /* AS: Don't know if we need this... Goetz? */
+int count_ip_outs(void) {
-#if 0
- for (i = 0; i < get_irp_n_irgs(); i++) {
- ir_node *e;
- current_ir_graph = get_irp_irg(i);
- e = get_irg_end(current_ir_graph);
- if (get_irn_visited(e) < get_irg_visited(current_ir_graph)) {
- /* Don't visit the End node. */
- /* int j;
- for (j = 0; j < get_End_n_keepalives(e); j++)
- cg_walk_2(get_End_keepalive(e, j), pre, post, env);*/
- printf("Found one inner procedure\n");
- compute_outs(current_ir_graph);
- }
+ int res = 0;
+
+ cg_walk(init_count, node_arity_count, &res);
+
+ return(res);
+}
+
+int dummy_count = 0, global_count; /* Only for debugging */
+
+/* ---------------------------------------------
+ For each node: Sets the pointer to array
+ in which the outedges are written later.
+ The current array start is transported in env
+ --------------------------------------------- */
+
+static void set_array_pointer(ir_node *node, void *env) {
+
+ int n_outs;
+ ir_node ***free = (ir_node ***) env;
+
+ /* Allocate my array */
+ n_outs = (int) node -> out; /* We wrote the count here in count_ip_outs */
+ dummy_count += n_outs;
+ assert(dummy_count <= global_count && "More outedges than initially counted!");
+ node -> out = *free;
+ *free = &((*free)[n_outs]);
+ /* We count the successors again, the space will be sufficient.
+ We use this counter to remember the position for the next back
+ edge. */
+ node -> out[0] = (ir_node *) 0;
+}
+
+
+/* -------------------------------------------
+ Adds an outedge from the predecessor to the
+ current node.
+ ------------------------------------------- */
+
+static void set_out_pointer(ir_node * node, void * env) {
+ int i;
+ ir_node *succ;
+ int start = (!is_Block(node)) ? -1 : 0;
+
+ for(i = start; i < get_irn_arity(node); i++) {
+ succ = get_irn_n(node, i);
+ succ->out[get_irn_n_outs(succ)+1] = node;
+ succ->out[0] = (ir_node *) (get_irn_n_outs(succ) + 1);
}
-#endif
+}
- interprocedural_view = rem_view;
- current_ir_graph = rem;
+
+/* -------------------------------
+ Sets the outedges for all nodes.
+ -------------------------------- */
+
+void set_ip_outs(void)
+{
+ ir_node **outedge_array = get_irp_ip_outedges();
+ cg_walk(set_array_pointer, set_out_pointer, (void *) &outedge_array);
}
+/* --------------------------------------------------------
+ Counts the outedges, allocates memory to save the
+ outedges and fills this outedge array in interprocedural
+ view!
+ -------------------------------------------------------- */
+
+void compute_ip_outs(void) {
+
+ int n_out_edges;
+ ir_node **out_edges;
+
+ assert(get_irp_ip_view_state() == ip_view_valid &&
+ "Cannot construct outs for invalid ip view.");
+
+ if (irp->outs_state != no_outs) {
+ free_ip_outs();
+ }
+
+ global_count = n_out_edges = count_ip_outs();
+ out_edges = (ir_node **) malloc (n_out_edges * sizeof(ir_node *));
+ set_irp_ip_outedges(out_edges);
+ set_ip_outs();
+}
+
+void free_ip_outs(void)
+{
+ ir_node **out_edges = get_irp_ip_outedges();
+ if (out_edges != NULL) {
+ free(out_edges);
+ set_irp_ip_outedges(NULL);
+ }
+ irp->outs_state = no_outs;
+}
+
void free_outs(ir_graph *irg) {
- /* Update graph state */
- assert(get_irg_phase_state(current_ir_graph) != phase_building);
- current_ir_graph->outs_state = no_outs;
+ /* current_ir_graph->outs_state = no_outs; */
+ irg->outs_state = no_outs;
+
+ if (irg->outs) {
+#ifdef DEBUG_libfirm
+ memset(irg->outs, 0, irg->n_outs);
+#endif /* defined DEBUG_libfirm */
+ free(irg->outs);
+ irg->outs = NULL;
+#ifdef DEBUG_libfirm
+ irg->n_outs = 0;
+#endif /* defined DEBUG_libfirm */
+ }
- if (irg->outs) free(irg->outs);
- irg->outs = NULL;
+#ifdef DEBUG_libfirm
+ /* when debugging, *always* reset all nodes' outs! irg->outs might
+ have been lying to us */
+ irg_walk_graph (irg, reset_outs, NULL, NULL);
+#endif /* defined DEBUG_libfirm */
}
projects / libfirm / blobdiff