/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
}
}
-/* Walks only over Block nodes in the graph. Has it's own visited
+/* Walks only over Block nodes in the graph. Has its 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)
int start, i, res, irn_arity;
mark_irn_visited(n);
- n->out = INT_TO_PTR(1); /* Space for array size. */
+ n->out = (ir_def_use_edge*) INT_TO_PTR(1); /* Space for array size. */
start = is_Block(n) ? 0 : -1;
irn_arity = get_irn_arity(n);
res += _count_outs(skipped_pred);
/*count my Def-Use edges */
- skipped_pred->out = INT_TO_PTR(PTR_TO_INT(skipped_pred->out) + 1);
+ skipped_pred->out = (ir_def_use_edge*) INT_TO_PTR(PTR_TO_INT(skipped_pred->out) + 1);
}
return res;
}
for (i = anchor_last - 1; i >= 0; --i) {
n = get_irg_anchor(irg, i);
if (!irn_visited_else_mark(n)) {
- n->out = INT_TO_PTR(1);
+ n->out = (ir_def_use_edge*) INT_TO_PTR(1);
++res;
}
}
*/
static ir_def_use_edge *_set_out_edges(ir_node *use, ir_def_use_edge *free)
{
- int n_outs, start, i, irn_arity, pos;
+ int start, i, irn_arity, pos;
+ size_t n_outs;
mark_irn_visited(use);
static ir_def_use_edge *set_out_edges(ir_graph *irg, ir_def_use_edge *free)
{
ir_node *n;
- int i, n_outs;
+ int i;
inc_irg_visited(irg);
free = _set_out_edges(get_irg_end(irg), free);
for (i = anchor_last - 1; i >= 0; --i) {
n = get_irg_anchor(irg, i);
if (!irn_visited_else_mark(n)) {
- n_outs = PTR_TO_INT(n->out);
+ size_t n_outs = PTR_TO_INT(n->out);
n->out = free;
#ifdef DEBUG_libfirm
n->out_valid = 1;
void compute_irp_outs(void)
{
- int i;
- for (i = get_irp_n_irgs() -1; i >= 0; --i)
+ size_t i, n;
+ for (i = 0, n = get_irp_n_irgs(); i < n; ++i)
compute_irg_outs(get_irp_irg(i));
}
void free_irp_outs(void)
{
- int i;
- for (i = get_irp_n_irgs() -1; i >= 0; --i)
+ size_t i, n;
+ for (i = 0, n = get_irp_n_irgs(); i < n; ++i)
free_irg_outs(get_irp_irg(i));
}
-
-/*------------------------------------------------------------*
- * 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... *
- *------------------------------------------------------------*/
-
-
-#ifdef INTERPROCEDURAL_VIEW
-/**
- * Inits the number of outedges for each node
- * before counting.
- */
-static void init_count(ir_node * node, void *env)
-{
- (void) env;
- node->out = (ir_node **) 1; /* 1 for the array size */
-}
-
-
-/**
- * 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, n_outs, i, start;
- ir_node *succ;
-
- arity = get_irn_arity(node);
- start = (is_Block(node)) ? 0 : -1;
-
- n_outs = 1 + arity + (-start); // ((is_Block(node)) ? 0 : 1); // Why + 1??
- *anz += n_outs;
-
- for (i = start; i < arity; i++) {
- succ = get_irn_n(node, i);
- succ->out = (ir_node **)INT_TO_PTR(PTR_TO_INT(succ->out) + 1);
- }
-}
-
-/*
- * Inits all nodes for setting the outedges
- * Returns the overall count of edges
- */
-int count_ip_outs(void)
-{
- int res = 0;
-
- cg_walk(init_count, node_arity_count, &res);
-
- return(res);
-}
-
-static 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 = PTR_TO_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, arity = get_irn_arity(node);
- ir_node *succ;
- int start = (!is_Block(node)) ? -1 : 0;
- (void) env;
-
- for (i = start; i < arity; ++i) {
- succ = get_irn_n(node, i);
- succ->out[get_irn_n_outs(succ)+1] = node;
- succ->out[0] = INT_TO_PTR(get_irn_n_outs(succ) + 1);
- }
-}
-
-
-/*
- * 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 != outs_none) {
- free_ip_outs();
- }
-
- global_count = n_out_edges = count_ip_outs();
- out_edges = XMALLOCNZ(ir_node*, n_out_edges);
- 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 = outs_none;
-}
-#endif
-
-
void free_irg_outs(ir_graph *irg)
{
/* current_ir_graph->outs_state = outs_none; */
irg_walk_graph (irg, reset_outs, NULL, NULL);
#endif /* defined DEBUG_libfirm */
}
-
-static void check_out_edges(ir_node *irn, void *env)
-{
- int i, j, pos;
- int *pError = env;
- int error = *pError;
- int last = is_Block(irn) ? 0 : -1;
-
- /* check forward: every input must have an out edge */
- for (i = get_irn_arity(irn) - 1; i >= last; --i) {
- ir_node *pred = get_irn_n(irn, i);
-
- for (j = get_irn_n_outs(pred) - 1; j >= 0; --j) {
- ir_node *user = get_irn_out_ex(pred, j, &pos);
-
- if (user == irn && pos == i) {
- break;
- }
- }
- if (j < 0) {
- ir_fprintf(stderr, "Missing out edge from %+F input %d to %+F", irn, i, pred);
- ++error;
- }
- }
-
- /* checking backward */
- for (i = get_irn_n_outs(irn) - 1; i >= 0; --i) {
- ir_node *user = get_irn_out_ex(irn, i, &pos);
-
- if (get_irn_n(user, pos) != irn) {
- ir_fprintf(stderr, "Spurious out edge from %+F output %d to %+F", irn, i, user);
- ++error;
- }
- }
- *pError = error;
-}
-
-/* verify outs edges. */
-void verify_outs(ir_graph *irg)
-{
- int errors = 0;
- irg_walk_graph(irg, NULL, check_out_edges, &errors);
- if (errors > 0)
- panic("Out edges are corrupt");
-}
projects / libfirm / blobdiff