/* ------------------------------------------------------------------- */
#ifdef INTERPROCEDURAL_VIEW
/* ------------------------------------------------------------------- */
#ifdef INTERPROCEDURAL_VIEW
int is_inter_backedge(ir_node *n, int pos);
/** Returns true if the predecessor pos is a backedge in the intraprocedural view. */
int is_intra_backedge(ir_node *n, int pos);
int is_inter_backedge(ir_node *n, int pos);
/** Returns true if the predecessor pos is a backedge in the intraprocedural view. */
int is_intra_backedge(ir_node *n, int pos);
void set_irg_loop(ir_graph *irg, ir_loop *l);
/* Returns the root loop info (if exists) for an irg. */
void set_irg_loop(ir_graph *irg, ir_loop *l);
/* Returns the root loop info (if exists) for an irg. */
/** Returns the loop n is contained in. NULL if node is in no loop. */
ir_loop *get_irn_loop(const ir_node *n);
/** Returns the loop n is contained in. NULL if node is in no loop. */
ir_loop *get_irn_loop(const ir_node *n);
ir_loop *get_loop_son(ir_loop *loop, int pos);
/** Returns the number of nodes contained in loop. */
ir_loop *get_loop_son(ir_loop *loop, int pos);
/** Returns the number of nodes contained in loop. */
/** Returns the number of elements contained in loop. */
int get_loop_n_elements(const ir_loop *loop);
/** Returns the number of elements contained in loop. */
int get_loop_n_elements(const ir_loop *loop);
*
* Returns non-zero, if the node n is not changed in the loop block
* belongs to or in inner loops of this block. */
*
* Returns non-zero, if the node n is not changed in the loop block
* belongs to or in inner loops of this block. */