2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Entry point to the representation of a whole program.
23 * @author Goetz Lindenmaier, Michael Beck
31 #include "irgraph_t.h"
40 /** The initial name of the irp program. */
41 #define INITAL_PROG_NAME "no_name_set"
44 ir_prog *get_irp(void) { return irp; }
45 void set_irp(ir_prog *new_irp)
51 * Create a new incomplete ir_prog.
53 static ir_prog *new_incomplete_ir_prog(void)
55 ir_prog *res = XMALLOCZ(ir_prog);
57 res->kind = k_ir_prog;
58 res->graphs = NEW_ARR_F(ir_graph *, 0);
59 res->types = NEW_ARR_F(ir_type *, 0);
60 res->global_asms = NEW_ARR_F(ident *, 0);
61 res->last_label_nr = 1; /* 0 is reserved as non-label */
65 res->reserved_resources = IRP_RESOURCE_NONE;
72 * Completes an incomplete irprog.
74 * @param irp the (yet incomplete) irp
75 * @param module_name the (module) name for this irp
77 static void complete_ir_prog(ir_prog *irp, const char *module_name)
79 #define IDENT(x) new_id_from_chars(x, sizeof(x) - 1)
81 irp->name = new_id_from_str(module_name);
82 irp->segment_types[IR_SEGMENT_GLOBAL] = new_type_segment(IDENT("GlobalType"), tf_global_type);
83 irp->segment_types[IR_SEGMENT_THREAD_LOCAL] = new_type_segment(IDENT("ThreadLocal"), tf_tls_type);
84 irp->segment_types[IR_SEGMENT_CONSTRUCTORS] = new_type_segment(IDENT("Constructors"), tf_constructors);
85 irp->segment_types[IR_SEGMENT_DESTRUCTORS] = new_type_segment(IDENT("Destructors"), tf_destructors);
87 /* The global type is a class, but we cannot derive from it, so set
88 the final property to assist optimizations that checks for it. */
89 set_class_final(irp->segment_types[IR_SEGMENT_GLOBAL], 1);
91 irp->const_code_irg = new_const_code_irg();
92 irp->globals_entity_usage_state = ir_entity_usage_not_computed;
96 void init_irprog_1(void)
98 irp = new_incomplete_ir_prog();
101 void init_irprog_2(void)
103 complete_ir_prog(irp, INITAL_PROG_NAME);
108 ir_prog *new_ir_prog(const char *name)
110 ir_prog *irp = new_incomplete_ir_prog();
111 complete_ir_prog(irp, name);
115 void free_ir_prog(void)
121 /* must iterate backwards here */
122 for (i = get_irp_n_irgs(); i > 0;)
123 free_ir_graph(get_irp_irg(--i));
125 /* free entities first to avoid entity types being destroyed before
126 * the entities using them */
127 for (i = get_irp_n_types(); i > 0;)
128 free_type_entities(get_irp_type(--i));
130 ir_finish_entity(irp);
132 for (i = get_irp_n_types(); i > 0;)
133 free_type(get_irp_type(--i));
135 free_ir_graph(irp->const_code_irg);
139 DEL_ARR_F(irp->graphs);
140 DEL_ARR_F(irp->types);
142 DEL_ARR_F(irp->global_asms);
145 irp->const_code_irg = NULL;
151 ir_graph *get_irp_main_irg(void)
154 return irp->main_irg;
157 void set_irp_main_irg(ir_graph *main_irg)
160 irp->main_irg = main_irg;
163 ir_type *(get_segment_type)(ir_segment_t segment)
165 return get_segment_type_(segment);
168 void set_segment_type(ir_segment_t segment, ir_type *new_type)
170 assert(segment <= IR_SEGMENT_LAST);
171 irp->segment_types[segment] = new_type;
174 ir_type *(get_glob_type)(void)
176 return get_glob_type_();
179 ir_type *(get_tls_type)(void)
181 return get_tls_type_();
184 void add_irp_irg(ir_graph *irg)
187 assert(irp && irp->graphs);
188 ARR_APP1(ir_graph *, irp->graphs, irg);
191 void remove_irp_irg(ir_graph *irg)
196 l = ARR_LEN(irp->graphs);
197 for (i = 0; i < l; ++i) {
198 if (irp->graphs[i] == irg) {
199 for (; i < l - 1; ++i) {
200 irp->graphs[i] = irp->graphs[i+1];
202 ARR_SETLEN(ir_graph*, irp->graphs, l - 1);
208 size_t (get_irp_n_irgs)(void)
210 return get_irp_n_irgs_();
213 ir_graph *(get_irp_irg)(size_t pos)
215 return get_irp_irg_(pos);
218 size_t get_irp_last_idx(void)
220 return irp->max_irg_idx;
223 void set_irp_irg(size_t pos, ir_graph *irg)
226 assert(pos < ARR_LEN(irp->graphs));
227 irp->graphs[pos] = irg;
230 void add_irp_type(ir_type *typ)
234 ARR_APP1(ir_type *, irp->types, typ);
237 void remove_irp_type(ir_type *typ)
242 l = ARR_LEN(irp->types);
243 for (i = 0; i < l; ++i) {
244 if (irp->types[i] == typ) {
245 for (; i < l - 1; ++i) {
246 irp->types[i] = irp->types[i+1];
248 ARR_SETLEN(ir_type *, irp->types, l - 1);
254 size_t (get_irp_n_types) (void)
256 return get_irp_n_types_();
259 ir_type *(get_irp_type) (size_t pos)
261 return get_irp_type_(pos);
264 void set_irp_type(size_t pos, ir_type *typ)
267 assert(pos < ARR_LEN((irp)->types));
268 irp->types[pos] = typ;
271 void set_irp_prog_name(ident *name)
275 int irp_prog_name_is_set(void)
277 return irp->name != new_id_from_str(INITAL_PROG_NAME);
279 ident *get_irp_ident(void)
283 const char *get_irp_name(void)
285 return get_id_str(irp->name);
289 ir_graph *(get_const_code_irg)(void)
291 return get_const_code_irg_();
294 void set_irp_ip_outedges(ir_node ** ip_outedges)
296 irp->ip_outedges = ip_outedges;
299 ir_node** get_irp_ip_outedges(void)
301 return irp->ip_outedges;
304 irg_callee_info_state get_irp_callee_info_state(void)
306 return irp->callee_info_state;
309 void set_irp_callee_info_state(irg_callee_info_state s)
311 irp->callee_info_state = s;
314 ir_label_t (get_irp_next_label_nr)(void)
316 return get_irp_next_label_nr_();
319 void add_irp_asm(ident *asm_string)
321 ARR_APP1(ident *, irp->global_asms, asm_string);
324 size_t get_irp_n_asms(void)
326 return ARR_LEN(irp->global_asms);
329 ident *get_irp_asm(size_t pos)
331 assert(pos < get_irp_n_asms());
332 return irp->global_asms[pos];
336 void irp_reserve_resources(ir_prog *irp, irp_resources_t resources)
338 assert((irp->reserved_resources & resources) == 0);
339 irp->reserved_resources |= resources;
342 void irp_free_resources(ir_prog *irp, irp_resources_t resources)
344 assert((irp->reserved_resources & resources) == resources);
345 irp->reserved_resources &= ~resources;
348 irp_resources_t irp_resources_reserved(const ir_prog *irp)
350 return irp->reserved_resources;