2 * Copyright (C) 1995-2008 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
32 #include "irgraph_t.h"
34 #include "pseudo_irg.h"
41 /** The initial name of the irp program. */
42 #define INITAL_PROG_NAME "no_name_set"
44 /* A variable from where everything in the ir can be accessed. */
46 ir_prog *get_irp(void) { return irp; }
49 * Create a new incomplete ir_prog.
51 static ir_prog *new_incomplete_ir_prog(void)
53 ir_prog *res = XMALLOCZ(ir_prog);
55 res->kind = k_ir_prog;
56 res->graphs = NEW_ARR_F(ir_graph *, 0);
57 res->pseudo_graphs = NEW_ARR_F(ir_graph *, 0);
58 res->types = NEW_ARR_F(ir_type *, 0);
59 res->modes = NEW_ARR_F(ir_mode *, 0);
60 res->opcodes = NEW_ARR_F(ir_op *, 0);
61 res->global_asms = NEW_ARR_F(ident *, 0);
62 res->last_region_nr = 0;
63 res->last_label_nr = 1; /* 0 is reserved as non-label */
67 res->reserved_resources = 0;
74 * Completes an incomplete irprog.
76 * @param irp the (yet incomplete) irp
77 * @param module_name the (module) name for this irp
79 static ir_prog *complete_ir_prog(ir_prog *irp, const char *module_name)
83 #define IDENT(x) new_id_from_chars(x, sizeof(x) - 1)
85 irp->name = new_id_from_str(module_name);
86 irp->segment_types[IR_SEGMENT_GLOBAL] = new_type_class(IDENT("GlobalType"));
87 irp->segment_types[IR_SEGMENT_THREAD_LOCAL]
88 = new_type_class(IDENT("ThreadLocal"));
89 irp->segment_types[IR_SEGMENT_CONSTRUCTORS]
90 = new_type_class(IDENT("Constructors"));
91 irp->segment_types[IR_SEGMENT_DESTRUCTORS]
92 = new_type_class(IDENT("Destructors"));
93 /* Remove these types from type list. Must be treated differently than
95 for (s = IR_SEGMENT_FIRST; s <= IR_SEGMENT_LAST; ++s) {
96 remove_irp_type(irp->segment_types[s]);
99 /* Set these flags for debugging. */
100 irp->segment_types[IR_SEGMENT_GLOBAL]->flags |= tf_global_type;
101 irp->segment_types[IR_SEGMENT_THREAD_LOCAL]->flags |= tf_tls_type;
102 irp->segment_types[IR_SEGMENT_CONSTRUCTORS]->flags |= tf_constructors;
103 irp->segment_types[IR_SEGMENT_DESTRUCTORS]->flags |= tf_destructors;
105 /* The global type is a class, but we cannot derive from it, so set
106 the final property to assist optimizations that checks for it. */
107 set_class_final(irp->segment_types[IR_SEGMENT_GLOBAL], 1);
109 irp->const_code_irg = new_const_code_irg();
110 irp->phase_state = phase_building;
111 irp->outs_state = outs_none;
112 irp->ip_outedges = NULL;
113 irp->trouts_state = outs_none;
114 irp->class_cast_state = ir_class_casts_transitive;
115 irp->globals_entity_usage_state = ir_entity_usage_not_computed;
121 /* initializes ir_prog. Constructs only the basic lists. */
122 void init_irprog_1(void)
124 irp = new_incomplete_ir_prog();
127 /* Completes ir_prog. */
128 void init_irprog_2(void)
130 (void)complete_ir_prog(irp, INITAL_PROG_NAME);
133 /* Create a new ir prog. Automatically called by init_firm through
135 ir_prog *new_ir_prog(const char *name)
137 return complete_ir_prog(new_incomplete_ir_prog(), name);
140 /* frees all memory used by irp. Types in type list, irgs in irg
141 list and entities in global type must be freed by hand before. */
142 void free_ir_prog(void)
145 for (s = IR_SEGMENT_FIRST; s <= IR_SEGMENT_LAST; ++s) {
146 free_type(irp->segment_types[s]);
149 free_ir_graph(irp->const_code_irg);
150 DEL_ARR_F(irp->graphs);
151 DEL_ARR_F(irp->pseudo_graphs);
152 DEL_ARR_F(irp->types);
153 DEL_ARR_F(irp->modes);
156 DEL_ARR_F(irp->opcodes);
157 DEL_ARR_F(irp->global_asms);
160 irp->const_code_irg = NULL;
164 /*- Functions to access the fields of ir_prog -*/
167 /* Access the main routine of the compiled program. */
168 ir_graph *get_irp_main_irg(void)
171 return irp->main_irg;
174 void set_irp_main_irg(ir_graph *main_irg)
177 irp->main_irg = main_irg;
180 ir_type *(get_segment_type)(ir_segment_t segment)
182 return _get_segment_type(segment);
185 void set_segment_type(ir_segment_t segment, ir_type *new_type)
187 assert(segment <= IR_SEGMENT_LAST);
188 irp->segment_types[segment] = new_type;
189 /* segment types are not in the type list... */
190 remove_irp_type(new_type);
193 ir_type *(get_glob_type)(void)
195 return _get_glob_type();
198 ir_type *(get_tls_type)(void)
200 return _get_tls_type();
203 /* Adds irg to the list of ir graphs in irp. */
204 void add_irp_irg(ir_graph *irg)
207 assert(irp && irp->graphs);
208 ARR_APP1(ir_graph *, irp->graphs, irg);
211 /* Removes irg from the list or irgs, shrinks the list by one. */
212 void remove_irp_irg_from_list(ir_graph *irg)
217 l = ARR_LEN(irp->graphs);
218 for (i = 0; i < l; i++) {
219 if (irp->graphs[i] == irg) {
221 for (; i < l - 1; i++) {
222 irp->graphs[i] = irp->graphs[i+1];
224 ARR_SETLEN(ir_graph*, irp->graphs, l - 1);
229 l = ARR_LEN(irp->pseudo_graphs);
230 for (i = 0; i < l; i++) {
231 if (irp->pseudo_graphs[i] == irg) {
232 for (; i < l - 1; i++) {
233 irp->pseudo_graphs[i] = irp->pseudo_graphs[i+1];
235 ARR_SETLEN(ir_graph*, irp->pseudo_graphs, l - 1);
242 /* Removes irg from the list or irgs, shrinks the list by one. */
243 void remove_irp_irg(ir_graph *irg)
246 remove_irp_irg_from_list(irg);
249 int (get_irp_n_irgs)(void)
251 return _get_irp_n_irgs();
254 ir_graph *(get_irp_irg)(int pos)
256 return _get_irp_irg(pos);
259 int get_irp_last_idx(void)
261 return irp->max_irg_idx;
264 void set_irp_irg(int pos, ir_graph *irg)
267 assert(pos < (ARR_LEN(irp->graphs)));
268 irp->graphs[pos] = irg;
271 /* Gets the number of graphs _and_ pseudo graphs. */
272 int get_irp_n_allirgs(void)
274 /* We can not call get_irp_n_irgs, as we end up in a recursion ... */
275 return ARR_LEN(irp->graphs) + get_irp_n_pseudo_irgs();
278 /* Returns the ir graph at position pos of all graphs (including
279 pseudo graphs). Visits first graphs, then pseudo graphs. */
280 ir_graph *get_irp_allirg(int pos)
282 int n_irgs = ARR_LEN(irp->graphs);
285 return irp->graphs[pos];
287 return get_irp_pseudo_irg(pos-n_irgs);
291 /* Adds type to the list of types in irp. */
292 void add_irp_type(ir_type *typ)
296 ARR_APP1(ir_type *, irp->types, typ);
299 /* Remove type from the list of types in irp. */
300 void remove_irp_type(ir_type *typ)
305 for (i = ARR_LEN(irp->types) - 1; i >= 0; i--) {
306 if (irp->types[i] == typ) {
307 for (; i < (ARR_LEN(irp->types)) - 1; i++) {
308 irp->types[i] = irp->types[i+1];
310 ARR_SETLEN(ir_type *, irp->types, (ARR_LEN(irp->types)) - 1);
316 int (get_irp_n_types) (void)
318 return _get_irp_n_types();
321 ir_type *(get_irp_type) (int pos)
323 return _get_irp_type(pos);
326 void set_irp_type(int pos, ir_type *typ)
329 assert(pos < (ARR_LEN((irp)->types)));
330 irp->types[pos] = typ;
333 /* Returns the number of all modes in the irp. */
334 int (get_irp_n_modes)(void)
336 return _get_irp_n_modes();
339 /* Returns the mode at position pos in the irp. */
340 ir_mode *(get_irp_mode)(int pos)
342 return _get_irp_mode(pos);
345 /* Adds mode to the list of modes in irp. */
346 void add_irp_mode(ir_mode *mode)
348 assert(mode != NULL);
350 ARR_APP1(ir_mode *, irp->modes, mode);
353 /* Adds opcode to the list of opcodes in irp. */
354 void add_irp_opcode(ir_op *opcode)
358 assert(opcode != NULL);
360 len = ARR_LEN(irp->opcodes);
362 if ((int) code >= len) {
363 ARR_RESIZE(ir_op*, irp->opcodes, code+1);
364 memset(&irp->opcodes[len], 0, (code-len+1) * sizeof(irp->opcodes[0]));
367 assert(irp->opcodes[code] == NULL && "opcode registered twice");
368 irp->opcodes[code] = opcode;
371 /* Removes opcode from the list of opcodes and shrinks the list by one. */
372 void remove_irp_opcode(ir_op *opcode)
374 assert((int) opcode->code < ARR_LEN(irp->opcodes));
375 irp->opcodes[opcode->code] = NULL;
378 /* Returns the number of all opcodes in the irp. */
379 int (get_irp_n_opcodes)(void)
381 return _get_irp_n_opcodes();
384 /* Returns the opcode at position pos in the irp. */
385 ir_op *(get_irp_opcode)(int pos)
387 return _get_irp_opcode(pos);
390 /* Sets the generic function pointer of all opcodes to NULL */
391 void clear_irp_opcodes_generic_func(void)
395 for (i = get_irp_n_opcodes() - 1; i >= 0; --i) {
396 ir_op *op = get_irp_opcode(i);
397 op->ops.generic = (op_func)NULL;
401 /*- File name / executable name or the like -*/
402 void set_irp_prog_name(ident *name)
406 int irp_prog_name_is_set(void)
408 return irp->name != new_id_from_str(INITAL_PROG_NAME);
410 ident *get_irp_ident(void)
414 const char *get_irp_name(void)
416 return get_id_str(irp->name);
420 ir_graph *(get_const_code_irg)(void)
422 return _get_const_code_irg();
425 irg_phase_state get_irp_phase_state(void)
427 return irp->phase_state;
430 void set_irp_phase_state(irg_phase_state s)
432 irp->phase_state = s;
437 irg_phase_state state;
441 * Wrapper for setting the state of a whole ir_prog.
443 static int set_irp_phase_state_wrapper(ir_prog *irp, void *context)
445 struct pass_t *pass = context;
446 irg_phase_state state = pass->state;
451 /* set the phase of all graphs */
452 for (i = get_irp_n_irgs() - 1; i >= 0; --i)
453 set_irg_phase_state(get_irp_irg(i), state);
455 /* set the irp phase */
456 set_irp_phase_state(state);
461 ir_prog_pass_t *set_irp_phase_state_pass(const char *name, irg_phase_state state)
463 struct pass_t *pass = XMALLOCZ(struct pass_t);
465 def_prog_pass_constructor(
466 &pass->pass, name ? name : "set_irp_phase", set_irp_phase_state_wrapper);
470 pass->pass.verify_irprog = ir_prog_no_verify;
471 pass->pass.dump_irprog = ir_prog_no_dump;
476 irg_outs_state get_irp_ip_outs_state(void)
478 return irp->outs_state;
481 void set_irp_ip_outs_inconsistent(void)
483 irp->outs_state = outs_inconsistent;
486 void set_irp_ip_outedges(ir_node ** ip_outedges)
488 irp->ip_outedges = ip_outedges;
491 ir_node** get_irp_ip_outedges(void)
493 return irp->ip_outedges;
496 irg_callee_info_state get_irp_callee_info_state(void)
498 return irp->callee_info_state;
501 void set_irp_callee_info_state(irg_callee_info_state s)
503 irp->callee_info_state = s;
506 /* Returns a new, unique exception region number. */
507 ir_exc_region_t (get_irp_next_region_nr)(void)
509 return _get_irp_next_region_nr();
512 /* Returns a new, unique label number. */
513 ir_label_t (get_irp_next_label_nr)(void)
515 return _get_irp_next_label_nr();
518 /* Add a new global asm include */
519 void add_irp_asm(ident *asm_string)
521 ARR_APP1(ident *, irp->global_asms, asm_string);
524 /* Return the number of global asm includes. */
525 int get_irp_n_asms(void)
527 return ARR_LEN(irp->global_asms);
530 /* Return the global asm include at position pos. */
531 ident *get_irp_asm(int pos)
533 assert(0 <= pos && pos < get_irp_n_asms());
534 return irp->global_asms[pos];
538 void irp_reserve_resources(ir_prog *irp, ir_resources_t resources)
540 assert((resources & ~IR_RESOURCE_GLOBAL_MASK) == 0);
541 assert((irp->reserved_resources & resources) == 0);
542 irp->reserved_resources |= resources;
545 void irp_free_resources(ir_prog *irp, ir_resources_t resources)
547 assert((irp->reserved_resources & resources) == resources);
548 irp->reserved_resources &= ~resources;
551 ir_resources_t irp_resources_reserved(const ir_prog *irp)
553 return irp->reserved_resources;