}
/* returns the number of successors of the node: */
-INLINE int get_irn_n_outs (ir_node *node) {
+int get_irn_n_outs (ir_node *node) {
assert(node && node->kind == k_ir_node);
#ifdef DEBUG_libfirm
/* assert (node->out_valid); */
}
/* Access successor n */
-INLINE ir_node *get_irn_out (ir_node *node, int pos) {
+ir_node *get_irn_out (ir_node *node, int pos) {
assert(pos >= 0 && pos < get_irn_n_outs(node));
#ifdef DEBUG_libfirm
/* assert (node->out_valid); */
return node->out[pos+1];
}
-INLINE void set_irn_out (ir_node *node, int pos, ir_node *out) {
+void set_irn_out (ir_node *node, int pos, ir_node *out) {
assert(node && out);
assert(pos >= 0 && pos < get_irn_n_outs(node));
#ifdef DEBUG_libfirm
}
-INLINE int get_Block_n_cfg_outs (ir_node *bl) {
+int get_Block_n_cfg_outs (ir_node *bl) {
int i, n_cfg_outs = 0;
assert(bl && (get_irn_op(bl) == op_Block));
#ifdef DEBUG_libfirm
}
-INLINE ir_node *get_Block_cfg_out (ir_node *bl, int pos) {
+ir_node *get_Block_cfg_out (ir_node *bl, int pos) {
int i, out_pos = 0;
assert(bl && (get_irn_op(bl) == op_Block));
#ifdef DEBUG_libfirm
This reduces the depth of the loop tree. */
#define NO_LOOPS_WITHOUT_HEAD 1
-
-INLINE void add_loop_son(ir_loop *loop, ir_loop *son);
-
-INLINE void add_loop_node(ir_loop *loop, ir_node *n);
-
static ir_graph *outermost_ir_graph; /* The outermost graph the scc is computed
for */
static ir_loop *current_loop; /* Current loop construction is working
scc->uplink = uplink;
}
-INLINE int
+int
get_irn_uplink (ir_node *n) {
scc_info *scc = get_irn_link(n);
assert(scc);
scc->dfn = dfn;
}
-INLINE int
+int
get_irn_dfn (ir_node *n) {
scc_info *scc = get_irn_link(n);
assert(scc);
}
-INLINE void
+void
set_irn_loop (ir_node *n, ir_loop *loop) {
n->loop = loop;
}
/* Uses temporary information to get the loop */
-INLINE ir_loop *
+ir_loop *
get_irn_loop (ir_node *n) {
return n->loop;
}
/* Use EXCLUSIVELY this function to add sons, otherwise the loop->n_sons
is invalid! */
-INLINE void
+void
add_loop_son(ir_loop *loop, ir_loop *son) {
loop_element lson;
lson.son = son;
/* Use EXCLUSIVELY this function to add nodes, otherwise the loop->n_nodes
is invalid! */
-INLINE void
+void
add_loop_node(ir_loop *loop, ir_node *n) {
loop_element ln;
ln.node = n;
#endif
/* Test for legal loop header: Block, Phi, ... */
-INLINE static bool is_possible_loop_head(ir_node *n) {
+static INLINE bool is_possible_loop_head(ir_node *n) {
ir_op *op = get_irn_op(n);
return ((op == op_Block) ||
(op == op_Phi) ||
#endif
-INLINE static int
+static INLINE int
is_outermost_loop(ir_loop *l) {
return l == get_loop_outer_loop(l);
}
static size_t additional_graph_data_size = 0;
ir_graph *current_ir_graph;
-INLINE ir_graph *get_current_ir_graph(void) {
+ir_graph *get_current_ir_graph(void) {
return current_ir_graph;
}
-INLINE void set_current_ir_graph(ir_graph *graph) {
+void set_current_ir_graph(ir_graph *graph) {
current_ir_graph = graph;
}
/* Outputs a unique number for this node */
-INLINE long
+long
get_irg_graph_nr(ir_graph *irg) {
assert(irg);
#ifdef DEBUG_libfirm