X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firprog_t.h;h=46f2d438b5560ce9910c702cd4389877b5fd31e8;hb=cb91bddc9cacdab7c28e4336847bd3dc248aa549;hp=9fc9ad80e265107414935b23e749d223bbb1b01e;hpb=58ed1dbc91297e868c47ffb3b622c66f28065105;p=libfirm diff --git a/ir/ir/irprog_t.h b/ir/ir/irprog_t.h index 9fc9ad80e..46f2d438b 100644 --- a/ir/ir/irprog_t.h +++ b/ir/ir/irprog_t.h @@ -27,29 +27,42 @@ #include "firm_common_t.h" #include "typegmod.h" +#include "callgraph.h" + #include "array.h" /** ir_prog */ struct ir_prog { firm_kind kind; + ident *name; /**< A file name or the like. */ ir_graph *main_irg; /**< entry point to the compiled program - @@@ or a list, in case we compile a library or the like? */ + @@@ or a list, in case we compile a library or the like? */ ir_graph **graphs; /**< all graphs in the ir */ + ir_graph *const_code_irg; /**< This ir graph gives the proper environment + to allocate nodes the represent values + of constant entities. It is not meant as + a procedure. */ type *glob_type; /**< global type. Must be a class as it can - have fields and procedures. */ + have fields and procedures. */ type **types; /**< all types in the ir */ - ir_graph *const_code_irg; /**< This ir graph gives the proper environment - to allocate nodes the represent values - of constant entities. It is not meant as - a procedure. */ - - irg_outs_state outs_state; /**< Out edges. */ - ir_node **ip_outedges; /**< Huge Array that contains all out edges - in interprocedural view. */ - ip_view_state ip_view; /**< State of interprocedural view. */ - ident *name; - /*struct obstack *obst; * @@@ Should we place all types and - entities on an obstack, too? */ + + /* -- states of and access to generated information -- */ + + ip_view_state ip_view; /**< State of interprocedural view. */ + + irg_outs_state outs_state; /**< Out edges. */ + ir_node **ip_outedges; /**< Huge Array that contains all out edges + in interprocedural view. */ + + irg_callee_info_state callee_info_state; /**< Validity of callee information. + Contains the lowest value or all irgs. */ + + + 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. */ @@ -67,14 +80,12 @@ __get_glob_type(void) { 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]; } @@ -82,14 +93,12 @@ __get_irp_irg(int 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]); } @@ -105,6 +114,12 @@ __get_const_code_irg(void) return irp->const_code_irg; } +void set_irp_ip_outedges(ir_node ** ip_outedges); +ir_node** get_irp_ip_outedges(void); + +/** initializes ir_prog. Calls the constructor for an ir_prog. */ +void init_irprog(void); + #define get_irp_n_irgs() __get_irp_n_irgs() #define get_irp_irg(pos) __get_irp_irg(pos) #define get_irp_n_types() __get_irp_n_types()