/*
- * Project: libFIRM
- * File name: ir/ana/irouts.c
- * Purpose: Compute and access out edges.
- * Author: Goetz Lindenmaier
- * Modified by: Michael Beck
- * Created: 1.2002
- * CVS-ID: $Id$
- * Copyright: (c) 2002-2007 Universität Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
- */
-
-/**
- * @file irouts.c Compute out edges for ir nodes (also called def-use edges).
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
+ *
+ * This file is part of libFirm.
*
- * Copyright (C) 2002 by Universitaet Karlsruhe
- * All rights reserved.
+ * 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.
*
- * Authors: Goetz Lindenmaier
+ * 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.
*/
+/**
+ * @file
+ * @brief Compute and access out edges (also called def-use edges).
+ * @author Goetz Lindenmaier, Michael Beck
+ * @date 1.2002
+ * @version $Id$
+ */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#ifdef DEBUG_libfirm
/** Clear the outs of a node */
static void reset_outs(ir_node *node, void *unused) {
+ (void) unused;
node->out = NULL;
node->out_valid = 0;
}
#ifdef DEBUG_libfirm
assert(bl->out_valid);
#endif /* defined DEBUG_libfirm */
- for (i = 1; i <= PTR_TO_INT(bl->out[0]); ++i)
- if ((get_irn_mode(bl->out[i]) == mode_X) &&
- (get_irn_op(bl->out[i]) != op_End))
- ++n_cfg_outs;
+ for (i = 1; i <= PTR_TO_INT(bl->out[0]); ++i) {
+ ir_node *succ = bl->out[i];
+ if (get_irn_mode(succ) == mode_X && get_irn_op(succ) != op_End)
+ n_cfg_outs += PTR_TO_INT(succ->out[0]);
+ }
return n_cfg_outs;
}
#ifdef DEBUG_libfirm
assert(bl->out_valid);
#endif /* defined DEBUG_libfirm */
- for (i = 1; i <= PTR_TO_INT(bl->out[0]); ++i)
- if (get_irn_mode(bl->out[i]) == mode_X) {
- /* ignore End if we are in the Endblock */
- if (get_irn_op(bl->out[i]) == op_End &&
- get_irn_n(bl->out[i], -1) == bl)
- continue;
- else
- ++n_cfg_outs;
+ for (i = 1; i <= PTR_TO_INT(bl->out[0]); ++i) {
+ ir_node *succ = bl->out[i];
+ if (get_irn_mode(succ) == mode_X) {
+
+ if (get_irn_op(succ) == op_End) {
+ /* ignore End if we are in the Endblock */
+ if (get_irn_n(succ, -1) == bl)
+ continue;
+ else /* count Keep-alive as one */
+ n_cfg_outs += 1;
+ } else
+ n_cfg_outs += PTR_TO_INT(succ->out[0]);
}
+ }
return n_cfg_outs;
}
/* Access predecessor n, ignore keep-alives. */
ir_node *get_Block_cfg_out(ir_node *bl, int pos) {
- int i, out_pos = 0;
+ int i;
assert(bl && is_Block(bl));
#ifdef DEBUG_libfirm
assert (bl->out_valid);
#endif /* defined DEBUG_libfirm */
- for (i = 1; i <= PTR_TO_INT(bl->out[0]); ++i)
- if ((get_irn_mode(bl->out[i]) == mode_X) &&
- (get_irn_op(bl->out[i]) != op_End)) {
- if (out_pos == pos) {
- ir_node *cfop = bl->out[i];
- return cfop->out[1];
- } else
- ++out_pos;
+ for (i = 1; i <= PTR_TO_INT(bl->out[0]); ++i) {
+ ir_node *succ = bl->out[i];
+ if (get_irn_mode(succ) == mode_X && get_irn_op(succ) != op_End) {
+ int n_outs = PTR_TO_INT(succ->out[0]);
+ if (pos < n_outs)
+ return succ->out[pos + 1];
+ else
+ pos -= n_outs;
}
+ }
return NULL;
}
/* Access predecessor n, honor keep-alives. */
ir_node *get_Block_cfg_out_ka(ir_node *bl, int pos) {
- int i, out_pos = 0;
+ int i, n_outs;
assert(bl && is_Block(bl));
#ifdef DEBUG_libfirm
assert (bl->out_valid);
#endif /* defined DEBUG_libfirm */
- for (i = 1; i <= PTR_TO_INT(bl->out[0]); ++i)
- if (get_irn_mode(bl->out[i]) == mode_X) {
- /* ignore End if we are in the Endblock */
- if (get_irn_op(bl->out[i]) == op_End &&
- get_irn_n(bl->out[i], -1) == bl)
- continue;
- if (out_pos == pos) {
- ir_node *cfop = bl->out[i];
- /* handle keep-alive here */
- if (get_irn_op(cfop) == op_End)
- return get_irn_n(cfop, -1);
- return cfop->out[1];
- } else
- ++out_pos;
+ for (i = 1; i <= PTR_TO_INT(bl->out[0]); ++i) {
+ ir_node *succ = bl->out[i];
+ if (get_irn_mode(succ) == mode_X) {
+ if (get_irn_op(succ) == op_End) {
+ if (get_irn_n(succ, -1) == bl) {
+ /* ignore End if we are in the Endblock */
+ continue;
+ }
+ if (pos == 0) {
+ /* handle keep-alive here: return the Endblock instead of the End node */
+ return get_irn_n(succ, -1);
+ } else
+ --pos;
+ } else {
+ n_outs = PTR_TO_INT(succ->out[0]);
+ if (pos < n_outs)
+ return succ->out[pos + 1];
+ else
+ pos -= n_outs;
+ }
}
+ }
return NULL;
}
inc_irg_block_visited(current_ir_graph);
- if (get_irn_mode(node) == mode_X)
- node = node->out[1];
+ if (get_irn_mode(node) == mode_X) {
+ int i, n;
- irg_out_block_walk2(node, pre, post, env);
+ for (i = 0, n = get_irn_n_outs(node); i < n; ++i) {
+ ir_node *succ = get_irn_out(node, i);
+ if (get_irn_visited(succ) < get_irg_visited(current_ir_graph))
+ irg_out_walk_2(succ, pre, post, env);
+ }
+ }
+ else {
+ irg_out_block_walk2(node, pre, post, env);
+ }
}
/*--------------------------------------------------------------------*/
-/** Building and Removing the out datasturcture **/
+/** Building and Removing the out datastructure **/
/** **/
/** The outs of a graph are allocated in a single, large array. **/
/** This allows to allocate and deallocate the memory for the outs **/
inc_irg_visited(irg);
res = _count_outs(get_irg_end(irg));
- /* now handle special nodes */
+ /* Now handle special nodes. We need the out count of those
+ even if they are not visible. */
n = get_irg_frame(irg);
- if (irn_not_visited(n)) {
+ if (! is_Bad(n) && irn_not_visited(n)) {
n->out = (ir_node **)1;
++res;
}
n = get_irg_args(irg);
- if (irn_not_visited(n)) {
+ if (! is_Bad(n) && irn_not_visited(n)) {
+ n->out = (ir_node **)1;
+ ++res;
+ }
+
+ n = get_irg_value_param_base(irg);
+ if (! is_Bad(n) && irn_not_visited(n)) {
n->out = (ir_node **)1;
++res;
}
* @return The next free address
*/
static ir_node **set_out_edges(ir_graph *irg, ir_node **free) {
- ir_node *n, *special[2];
+ ir_node *n, *special[3];
int i, n_outs;
inc_irg_visited(irg);
/* handle special nodes */
special[0] = get_irg_frame(irg);
special[1] = get_irg_args(irg);
+ special[2] = get_irg_value_param_base(irg);
- for (i = 1; i >= 0; --i) {
+ for (i = 2; i >= 0; --i) {
n = special[i];
+ if (is_Bad(n))
+ continue;
if (get_irn_visited(n) < get_irg_visited(current_ir_graph)) {
n_outs = PTR_TO_INT(n->out);
*------------------------------------------------------------*/
+#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 */
}
}
}
-
/*
* Inits all nodes for setting the outedges
* Returns the overall count of edges
* Adds an outedge from the predecessor to the
* current node.
*/
-static void set_out_pointer(ir_node * node, void * env) {
+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);
}
irp->outs_state = outs_none;
}
+#endif
void free_irg_outs(ir_graph *irg) {
projects / libfirm / blobdiff