projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
comments converted to doxygen
[libfirm]
/
ir
/
ana
/
irouts.c
diff --git
a/ir/ana/irouts.c
b/ir/ana/irouts.c
index
087bae2
..
29c7c14
100644
(file)
--- a/
ir/ana/irouts.c
+++ b/
ir/ana/irouts.c
@@
-1,11
+1,11
@@
/* Copyright (C) 2002 by Universitaet Karlsruhe
/* Copyright (C) 2002 by Universitaet Karlsruhe
-*
*
All rights reserved.
-*
*
-*
*
Authors: Goetz Lindenmaier
-*
*
-*
*
irouts.c --- Compute out edges for ir nodes (also called def-use
-*
*
edges).
-*
*
+* All rights reserved.
+*
+* Authors: Goetz Lindenmaier
+*
+* irouts.c --- Compute out edges for ir nodes (also called def-use
+* edges).
+*
*/
/* $Id$ */
*/
/* $Id$ */
@@
-20,25
+20,25
@@
/**********************************************************************/
/* returns the number of successors of the node: */
/**********************************************************************/
/* returns the number of successors of the node: */
-
inline
int get_irn_n_outs (ir_node *node) {
+
INLINE
int get_irn_n_outs (ir_node *node) {
return (int)(node->out[0]);
}
/* Access successor n */
return (int)(node->out[0]);
}
/* Access successor n */
-
inline
ir_node *get_irn_out (ir_node *node, int pos) {
+
INLINE
ir_node *get_irn_out (ir_node *node, int pos) {
assert(node);
assert(pos >= 0 && pos < get_irn_n_outs(node));
return node->out[pos+1];
}
assert(node);
assert(pos >= 0 && pos < get_irn_n_outs(node));
return node->out[pos+1];
}
-
inline
void set_irn_out (ir_node *node, int pos, ir_node *out) {
+
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));
node->out[pos+1] = out;
}
assert(node && out);
assert(pos >= 0 && pos < get_irn_n_outs(node));
node->out[pos+1] = out;
}
-
inline
int get_Block_n_cfg_outs (ir_node *bl) {
+
INLINE
int get_Block_n_cfg_outs (ir_node *bl) {
int i, n_cfg_outs = 0;
assert(bl && (get_irn_op(bl) == op_Block));
for (i = 0; i < (int)bl->out[0]; i++)
int i, n_cfg_outs = 0;
assert(bl && (get_irn_op(bl) == op_Block));
for (i = 0; i < (int)bl->out[0]; i++)
@@
-48,7
+48,7
@@
inline int get_Block_n_cfg_outs (ir_node *bl) {
}
}
-
inline
ir_node *get_Block_cfg_out (ir_node *bl, int pos) {
+
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));
for (i = 0; i < (int)bl->out[0]; i++)
int i, out_pos = 0;
assert(bl && (get_irn_op(bl) == op_Block));
for (i = 0; i < (int)bl->out[0]; i++)
@@
-64,13
+64,11
@@
inline ir_node *get_Block_cfg_out (ir_node *bl, int pos) {
return NULL;
}
return NULL;
}
-void irg_out_walk_2(ir_node *node,
void (pre)(ir_node*, void*)
,
-
void (post)(ir_node*, void*)
, void *env) {
+void irg_out_walk_2(ir_node *node,
irg_walk_func *pre
,
+
irg_walk_func *post
, void *env) {
int i;
ir_node *succ;
int i;
ir_node *succ;
- //printf("++ in walker (%d outs) ", get_irn_n_outs(node)); DDMSG2(node);
-
assert(node);
assert(get_irn_visited(node) < get_irg_visited(current_ir_graph));
assert(node);
assert(get_irn_visited(node) < get_irg_visited(current_ir_graph));
@@
-86,13
+84,12
@@
void irg_out_walk_2(ir_node *node, void (pre)(ir_node*, void*),
if (post) post(node, env);
if (post) post(node, env);
- //printf("++ done walking "); DDMSG2(node);
return;
}
void irg_out_walk(ir_node *node,
return;
}
void irg_out_walk(ir_node *node,
-
void (pre)(ir_node*, void*), void (post)(ir_node*, void*)
,
- 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);
assert(node);
if (get_irg_outs_state(current_ir_graph) != no_outs) {
inc_irg_visited (current_ir_graph);
@@
-102,7
+99,7
@@
void irg_out_walk(ir_node *node,
}
void irg_out_block_walk2(ir_node *bl,
}
void irg_out_block_walk2(ir_node *bl,
-
void (pre)(ir_node*, void*), void (post)(ir_node*, void*)
,
+
irg_walk_func *pre, irg_walk_func *post
,
void *env) {
int i;
void *env) {
int i;
@@
-131,7
+128,7
@@
void irg_out_block_walk2(ir_node *bl,
/* 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,
/* 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,
-
void (pre)(ir_node*, void*), void (post)(ir_node*, void*)
,
+
irg_walk_func *pre, irg_walk_func *post
,
void *env) {
assert((get_irn_op(node) == op_Block) || (get_irn_mode(node) == mode_X));
void *env) {
assert((get_irn_op(node) == op_Block) || (get_irn_mode(node) == mode_X));
@@
-167,7
+164,7
@@
void irg_out_block_walk(ir_node *node,
/* Returns the amount of out edges for not yet visited successors. */
/* Returns the amount of out edges for not yet visited successors. */
-int count_outs(ir_node *n) {
+
static
int count_outs(ir_node *n) {
int start, i, res;
ir_node *succ;
int start, i, res;
ir_node *succ;
@@
-189,7
+186,7
@@
int count_outs(ir_node *n) {
return res;
}
return res;
}
-ir_node **set_out_edges(ir_node *n, ir_node **free) {
+
static
ir_node **set_out_edges(ir_node *n, ir_node **free) {
int n_outs, start, i;
ir_node *succ;
int n_outs, start, i;
ir_node *succ;
@@
-217,7
+214,7
@@
ir_node **set_out_edges(ir_node *n, ir_node **free) {
return free;
}
return free;
}
-
inline
void fix_start_proj(ir_graph *irg) {
+
static INLINE
void fix_start_proj(ir_graph *irg) {
ir_node *proj = NULL, *startbl;
int i;
if (get_Block_n_cfg_outs(get_irg_start_block(irg))) {
ir_node *proj = NULL, *startbl;
int i;
if (get_Block_n_cfg_outs(get_irg_start_block(irg))) {