irp_callgraph_state callgraph_state; /**< State of the callgraph. */
struct ir_loop *outermost_cg_loop; /**< For callgraph analysis: entry point
to looptree over callgraph. */
+ int max_callgraph_loop_depth;
+ int max_callgraph_recursion_depth;
#ifdef DEBUG_libfirm
long max_node_nr; /**< to generate unique numbers for nodes. */
static INLINE int
__get_irp_n_irgs(void) {
assert (irp && irp->graphs);
- /* Strangely the first element of the array is NULL. Why?? */
return (ARR_LEN((irp)->graphs));
}
static INLINE ir_graph *
__get_irp_irg(int pos){
assert (irp && irp->graphs);
- /* Strangely the first element of the array is NULL. Why?? */
return irp->graphs[pos];
}
static INLINE int
__get_irp_n_types (void) {
assert (irp && irp->types);
- /* Strangely the first element of the array is NULL. Why?? */
return (ARR_LEN((irp)->types));
}
static INLINE type *
__get_irp_type(int pos) {
assert (irp && irp->types);
- /* Strangely the first element of the array is NULL. Why?? */
/* Don't set the skip_tid result so that no double entries are generated. */
return skip_tid(irp->types[pos]);
}