/*
- * 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)
*/
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));
}