* @brief Compute and access out edges (also called def-use edges).
* @author Goetz Lindenmaier, Michael Beck
* @date 1.2002
- * @version $Id$
*/
#include "config.h"
#include "irgraph_t.h"
#include "irprog_t.h"
#include "irgwalk.h"
-#include "irtools.h"
+#include "util.h"
#include "irprintf.h"
#include "error.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 */
+#include "ircons.h"
/*--------------------------------------------------------------------*/
/** Accessing the out datastructures **/
return node->out != NULL;
}
-/* returns the number of successors of the node: */
int get_irn_n_outs(const ir_node *node)
{
assert(node && node->kind == k_ir_node);
#ifdef DEBUG_libfirm
- /* assert(node->out_valid); */
+ assert(node->out_valid);
#endif /* defined DEBUG_libfirm */
/* we misuse the first for the size info of the out array */
return node->out[0].pos;
}
-/* Access successor n */
ir_node *get_irn_out(const ir_node *def, int pos)
{
assert(pos >= 0 && pos < get_irn_n_outs(def));
#ifdef DEBUG_libfirm
- /* assert(def->out_valid); */
+ assert(def->out_valid);
#endif /* defined DEBUG_libfirm */
return def->out[pos+1].use;
}
-/* Access successor n */
ir_node *get_irn_out_ex(const ir_node *def, int pos, int *in_pos)
{
assert(pos >= 0 && pos < get_irn_n_outs(def));
#ifdef DEBUG_libfirm
- /* assert(def->out_valid); */
+ assert(def->out_valid);
#endif /* defined DEBUG_libfirm */
*in_pos = def->out[pos+1].pos;
return def->out[pos+1].use;
assert(def && use);
assert(pos >= 0 && pos < get_irn_n_outs(def));
#ifdef DEBUG_libfirm
- def->out_valid = 1; /* assume that this function is used correctly */
+ assert(def->out_valid);
#endif /* defined DEBUG_libfirm */
def->out[pos+1].use = use;
def->out[pos+1].pos = in_pos;
}
-/* Return the number of control flow successors, ignore keep-alives. */
int get_Block_n_cfg_outs(const ir_node *bl)
{
int i, n_cfg_outs = 0;
#endif /* defined DEBUG_libfirm */
for (i = 1; i <= bl->out[0].pos; ++i) {
ir_node *succ = bl->out[i].use;
- if (get_irn_mode(succ) == mode_X && !is_End(succ))
+ if (get_irn_mode(succ) == mode_X && !is_End(succ) && !is_Bad(succ))
n_cfg_outs += succ->out[0].pos;
}
return n_cfg_outs;
}
-/* Return the number of control flow successors, honor keep-alives. */
int get_Block_n_cfg_outs_ka(const ir_node *bl)
{
int i, n_cfg_outs = 0;
for (i = 1; i <= bl->out[0].pos; ++i) {
ir_node *succ = bl->out[i].use;
if (get_irn_mode(succ) == mode_X) {
-
+ if (is_Bad(succ))
+ continue;
if (is_End(succ)) {
/* ignore End if we are in the Endblock */
if (get_nodes_block(succ) == bl)
return n_cfg_outs;
}
-/* Access predecessor n, ignore keep-alives. */
ir_node *get_Block_cfg_out(const ir_node *bl, int pos)
{
int i;
#endif /* defined DEBUG_libfirm */
for (i = 1; i <= bl->out[0].pos; ++i) {
ir_node *succ = bl->out[i].use;
- if (get_irn_mode(succ) == mode_X && !is_End(succ)) {
+ if (get_irn_mode(succ) == mode_X && !is_End(succ) && !is_Bad(succ)) {
int n_outs = succ->out[0].pos;
if (pos < n_outs)
return succ->out[pos + 1].use;
return NULL;
}
-/* Access predecessor n, honor keep-alives. */
ir_node *get_Block_cfg_out_ka(const ir_node *bl, int pos)
{
int i, n_outs;
for (i = 1; i <= bl->out[0].pos; ++i) {
ir_node *succ = bl->out[i].use;
if (get_irn_mode(succ) == mode_X) {
+ if (is_Bad(succ))
+ continue;
if (is_End(succ)) {
ir_node *end_bl = get_nodes_block(succ);
if (end_bl == bl) {
void *env)
{
assert(node);
- if (get_irg_outs_state(current_ir_graph) != outs_none) {
- inc_irg_visited (current_ir_graph);
+ ir_graph *irg = get_irn_irg(node);
+ if (irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS)) {
+ inc_irg_visited (irg);
irg_out_walk_2(node, 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)
{
/* Now handle anchored nodes. We need the out count of those
even if they are not visible. */
- for (i = anchor_last - 1; i >= 0; --i) {
+ for (i = anchor_last; i >= anchor_first; --i) {
n = get_irg_anchor(irg, i);
if (!irn_visited_else_mark(n)) {
n->out = (ir_def_use_edge*) INT_TO_PTR(1);
free = _set_out_edges(get_irg_end(irg), free);
/* handle anchored nodes */
- for (i = anchor_last - 1; i >= 0; --i) {
+ for (i = anchor_last; i >= anchor_first; --i) {
n = get_irg_anchor(irg, i);
if (!irn_visited_else_mark(n)) {
size_t n_outs = PTR_TO_INT(n->out);
return free;
}
-/* compute the outs for a given graph */
void compute_irg_outs(ir_graph *irg)
{
ir_graph *rem = current_ir_graph;
/* Update graph state */
assert(get_irg_phase_state(current_ir_graph) != phase_building);
- if (current_ir_graph->outs_state != outs_none)
- free_irg_outs(current_ir_graph);
+ free_irg_outs(current_ir_graph);
/* This first iteration counts the overall number of out edges and the
number of out edges for each node. */
/* Check how much memory we have used */
assert (end == (irg->outs + n_out_edges));
- current_ir_graph->outs_state = outs_consistent;
+ add_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
current_ir_graph = rem;
}
void assure_irg_outs(ir_graph *irg)
{
- if (get_irg_outs_state(irg) != outs_consistent)
+ if (! irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS))
compute_irg_outs(irg);
}
void free_irg_outs(ir_graph *irg)
{
/* current_ir_graph->outs_state = outs_none; */
- irg->outs_state = outs_none;
if (irg->outs) {
#ifdef DEBUG_libfirm
projects / libfirm / blobdiff