3 * File name: ir/ir/irprog_t.h
4 * Purpose: Entry point to the representation of a whole program 0-- private header.
5 * Author: Goetz Lindenmaier
9 * Copyright: (c) 2000-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
27 #include "firm_common_t.h"
30 #include "callgraph.h"
37 ident *name; /**< A file name or the like. */
38 ir_graph *main_irg; /**< entry point to the compiled program
39 @@@ or a list, in case we compile a library or the like? */
40 ir_graph **graphs; /**< all graphs in the ir */
41 ir_graph *const_code_irg; /**< This ir graph gives the proper environment
42 to allocate nodes the represent values
43 of constant entities. It is not meant as
45 type *glob_type; /**< global type. Must be a class as it can
46 have fields and procedures. */
47 type **types; /**< all types in the ir */
49 /* -- states of and access to generated information -- */
51 ip_view_state ip_view; /**< State of interprocedural view. */
53 irg_outs_state outs_state; /**< Out edges. */
54 ir_node **ip_outedges; /**< Huge Array that contains all out edges
55 in interprocedural view. */
57 irg_callee_info_state callee_info_state; /**< Validity of callee information.
58 Contains the lowest value or all irgs. */
61 irp_callgraph_state callgraph_state; /**< State of the callgraph. */
62 struct ir_loop *outermost_cg_loop; /**< For callgraph analysis: entry point
63 to looptree over callgraph. */
64 int max_callgraph_loop_depth;
65 int max_callgraph_recursion_depth;
68 long max_node_nr; /**< to generate unique numbers for nodes. */
72 INLINE void remove_irp_type_from_list (type *typ);
75 __get_glob_type(void) {
77 return irp->glob_type = skip_tid(irp->glob_type);
81 __get_irp_n_irgs(void) {
82 assert (irp && irp->graphs);
83 return (ARR_LEN((irp)->graphs));
86 static INLINE ir_graph *
87 __get_irp_irg(int pos){
88 assert (irp && irp->graphs);
89 return irp->graphs[pos];
94 __get_irp_n_types (void) {
95 assert (irp && irp->types);
96 return (ARR_LEN((irp)->types));
100 __get_irp_type(int pos) {
101 assert (irp && irp->types);
102 /* Don't set the skip_tid result so that no double entries are generated. */
103 return skip_tid(irp->types[pos]);
107 /** Returns a new, unique number to number nodes or the like. */
108 int get_irp_new_node_nr(void);
111 static INLINE ir_graph *
112 __get_const_code_irg(void)
114 return irp->const_code_irg;
117 void set_irp_ip_outedges(ir_node ** ip_outedges);
118 ir_node** get_irp_ip_outedges(void);
120 /** initializes ir_prog. Calls the constructor for an ir_prog. */
121 void init_irprog(void);
123 #define get_irp_n_irgs() __get_irp_n_irgs()
124 #define get_irp_irg(pos) __get_irp_irg(pos)
125 #define get_irp_n_types() __get_irp_n_types()
126 #define get_irp_type(pos) __get_irp_type(pos)
127 #define get_const_code_irg() __get_const_code_irg()
128 #define get_glob_type() __get_glob_type()
130 #endif /* ifndef _IRPROG_T_H_ */