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 procedure code.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
33 #include "irgraph_t.h"
35 #include "irgraph_t.h"
45 #include "irbackedge_t.h"
46 #include "iredges_t.h"
51 #define INITIAL_IDX_IRN_MAP_SIZE 1024
54 * Indicates, whether additional data can be registered to graphs.
55 * If set to 1, this is not possible anymore.
57 static int forbid_new_data = 0;
60 * The amount of additional space for custom data to be allocated upon
61 * creating a new graph.
63 static size_t additional_graph_data_size = 0;
65 ir_graph *current_ir_graph;
66 ir_graph *get_current_ir_graph(void)
68 return current_ir_graph;
71 void set_current_ir_graph(ir_graph *graph)
73 current_ir_graph = graph;
76 /** contains the suffix for frame type names */
77 static ident *frame_type_suffix = NULL;
79 /* initialize the IR graph module */
80 void firm_init_irgraph(void)
82 frame_type_suffix = new_id_from_str(FRAME_TP_SUFFIX);
87 * Allocate a new IR graph.
88 * This function respects the registered graph data. The only reason for
89 * this function is, that there are two locations, where graphs are
90 * allocated (new_r_ir_graph, new_const_code_irg).
91 * @return Memory for a new graph.
93 static ir_graph *alloc_graph(void)
96 size_t size = sizeof(ir_graph) + additional_graph_data_size;
97 char *ptr = XMALLOCNZ(char, size);
99 res = (ir_graph *)(ptr + additional_graph_data_size);
100 res->kind = k_ir_graph;
102 /* initialize the idx->node map. */
103 res->idx_irn_map = NEW_ARR_F(ir_node *, INITIAL_IDX_IRN_MAP_SIZE);
104 memset(res->idx_irn_map, 0, INITIAL_IDX_IRN_MAP_SIZE * sizeof(res->idx_irn_map[0]));
110 * Frees an allocated IR graph
112 static void free_graph(ir_graph *irg)
114 char *ptr = (char *)irg;
117 for (i = 0; i < EDGE_KIND_LAST; ++i)
118 edges_deactivate_kind(irg, i);
119 DEL_ARR_F(irg->idx_irn_map);
120 free(ptr - additional_graph_data_size);
124 * Set the number of locals for a given graph.
126 * @param irg the graph
127 * @param n_loc number of locals
129 void irg_set_nloc(ir_graph *res, int n_loc)
131 assert(res->phase_state == phase_building);
133 res->n_loc = n_loc + 1; /* number of local variables that are never
134 dereferenced in this graph plus one for
135 the store. This is not the number of
136 parameters to the procedure! */
138 if (res->loc_descriptions) {
139 xfree(res->loc_descriptions);
140 res->loc_descriptions = NULL;
144 /* Allocates a list of nodes:
145 - The start block containing a start node and Proj nodes for it's four
146 results (X, M, P, Tuple).
147 - The end block containing an end node. This block is not matured after
148 new_ir_graph as predecessors need to be added to it.
149 - The current block, which is empty and also not matured.
150 Further it allocates several datastructures needed for graph construction
153 ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc)
156 ir_node *first_block;
157 ir_node *end, *start, *start_block, *initial_mem, *projX, *bad;
161 /* inform statistics here, as blocks will be already build on this graph */
162 hook_new_graph(res, ent);
164 current_ir_graph = res;
166 /*-- initialized for each graph. --*/
167 res->kind = k_ir_graph;
168 res->obst = XMALLOC(struct obstack);
169 obstack_init(res->obst);
171 res->phase_state = phase_building;
172 irg_set_nloc(res, n_loc);
174 /* descriptions will be allocated on demand */
175 res->loc_descriptions = NULL;
177 res->visited = 0; /* visited flag, for the ir walker */
178 res->block_visited = 0; /* visited flag, for the 'block'-walker */
180 res->extbb_obst = NULL;
182 res->last_node_idx = 0;
187 res->inline_property = irg_inline_any;
188 res->additional_properties = mtp_property_inherited; /* inherited from type */
190 res->irg_pinned_state = op_pin_state_pinned;
191 res->outs_state = outs_none;
192 res->dom_state = dom_none;
193 res->pdom_state = dom_none;
194 res->typeinfo_state = ir_typeinfo_none;
195 set_irp_typeinfo_inconsistent(); /* there is a new graph with typeinfo_none. */
196 res->callee_info_state = irg_callee_info_none;
197 res->loopinfo_state = loopinfo_none;
198 res->class_cast_state = ir_class_casts_transitive;
199 res->extblk_state = ir_extblk_info_none;
200 res->execfreq_state = exec_freq_none;
201 res->fp_model = fp_model_precise;
202 res->entity_usage_state = ir_entity_usage_not_computed;
203 res->mem_disambig_opt = aa_opt_inherited;
205 /*-- Type information for the procedure of the graph --*/
207 set_entity_irg(ent, res);
209 /*-- a class type so that it can contain "inner" methods as in Pascal. --*/
210 res->frame_type = new_type_frame();
212 /* the Anchor node must be created first */
213 res->anchor = new_Anchor(res);
215 /*-- Nodes needed in every graph --*/
216 set_irg_end_block (res, new_immBlock());
217 set_cur_block(get_irg_end_block(res));
219 set_irg_end (res, end);
221 start_block = new_immBlock();
222 set_cur_block(start_block);
223 set_irg_start_block(res, start_block);
224 bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL);
225 bad->attr.irg.irg = res;
226 set_irg_bad (res, bad);
227 set_irg_no_mem (res, new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
229 set_irg_start (res, start);
231 /* Proj results of start node */
232 projX = new_Proj(start, mode_X, pn_Start_X_initial_exec);
233 set_irg_initial_exec (res, projX);
234 set_irg_frame (res, new_Proj(start, mode_P_data, pn_Start_P_frame_base));
235 set_irg_tls (res, new_Proj(start, mode_P_data, pn_Start_P_tls));
236 set_irg_args (res, new_Proj(start, mode_T, pn_Start_T_args));
237 initial_mem = new_Proj(start, mode_M, pn_Start_M);
238 set_irg_initial_mem(res, initial_mem);
240 set_store(initial_mem);
242 res->index = get_irp_new_irg_idx();
244 res->graph_nr = get_irp_new_node_nr();
247 mature_immBlock(res->current_block);
249 /*-- Make a block to start with --*/
250 first_block = new_immBlock();
251 set_cur_block(first_block);
252 add_immBlock_pred(first_block, projX);
254 res->method_execution_frequency = -1.0;
255 res->estimated_node_count = 0;
260 ir_graph *new_ir_graph(ir_entity *ent, int n_loc)
262 ir_graph *res = new_r_ir_graph(ent, n_loc);
263 add_irp_irg(res); /* remember this graph global. */
267 /* Make a rudimentary IR graph for the constant code.
268 Must look like a correct irg, spare everything else. */
269 ir_graph *new_const_code_irg(void)
271 ir_graph *res = alloc_graph();
278 ir_node *start_block;
281 /* inform statistics here, as blocks will be already build on this graph */
282 hook_new_graph(res, NULL);
284 current_ir_graph = res;
285 res->n_loc = 1; /* Only the memory. */
286 res->visited = 0; /* visited flag, for the ir walker */
287 res->block_visited = 0; /* visited flag, for the 'block'-walker */
288 res->obst = XMALLOC(struct obstack);
289 obstack_init(res->obst);
290 res->extbb_obst = NULL;
292 res->last_node_idx = 0;
294 res->phase_state = phase_building;
295 res->irg_pinned_state = op_pin_state_pinned;
296 res->extblk_state = ir_extblk_info_none;
297 res->fp_model = fp_model_precise;
299 /* value table for global value numbering for optimizing use in iropt.c */
302 res->frame_type = NULL;
304 /* the Anchor node must be created first */
305 res->anchor = new_Anchor(res);
307 /* -- The end block -- */
308 end_block = new_immBlock();
309 set_irg_end_block(res, end_block);
310 set_cur_block(end_block);
312 set_irg_end (res, end);
313 mature_immBlock(end_block);
315 /* -- The start block -- */
316 start_block = new_immBlock();
317 set_cur_block(start_block);
318 set_irg_start_block(res, start_block);
319 bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL);
320 bad->attr.irg.irg = res;
321 set_irg_bad(res, bad);
322 no_mem = new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL);
323 set_irg_no_mem(res, no_mem);
325 set_irg_start(res, start);
327 /* Proj results of start node */
328 set_irg_initial_mem(res, new_Proj(start, mode_M, pn_Start_M));
329 projX = new_Proj(start, mode_X, pn_Start_X_initial_exec);
330 mature_immBlock(start_block);
332 body_block = new_immBlock();
333 add_immBlock_pred(body_block, projX);
334 mature_immBlock(body_block); /* mature the 'body' block for expressions */
335 set_cur_block(body_block);
337 /* Set the visited flag high enough that the blocks will never be visited. */
338 set_irn_visited(body_block, -1);
339 set_Block_block_visited(body_block, -1);
340 set_Block_block_visited(start_block, -1);
341 set_irn_visited(start_block, -1);
342 set_irn_visited(bad, -1);
343 set_irn_visited(no_mem, -1);
345 res->phase_state = phase_high;
351 * Pre-Walker: Copies blocks and nodes from the original method graph
352 * to the copied graph.
354 * @param n A node from the original method graph.
355 * @param env The copied graph.
357 static void copy_all_nodes(ir_node *node, void *env)
360 ir_node *new_node = irn_copy_into_irg(node, irg);
362 set_irn_link(node, new_node);
364 /* fix access to entities on the stack frame */
365 if (is_Sel(new_node)) {
366 ir_entity *ent = get_Sel_entity(new_node);
367 ir_type *tp = get_entity_owner(ent);
369 if (is_frame_type(tp)) {
370 /* replace by the copied entity */
371 ent = get_entity_link(ent);
373 assert(is_entity(ent));
374 assert(get_entity_owner(ent) == get_irg_frame_type(irg));
375 set_Sel_entity(new_node, ent);
381 * Post-walker: Set the predecessors of the copied nodes.
382 * The copied nodes are set as link of their original nodes. The links of
383 * "irn" predecessors are the predecessors of copied node.
385 static void rewire(ir_node *irn, void *env)
388 irn_rewire_inputs(irn);
391 static ir_node *get_new_node(const ir_node *old_node)
393 return (ir_node*) get_irn_link(old_node);
397 * Create a new graph that is a copy of a given one.
399 ir_graph *create_irg_copy(ir_graph *irg)
406 res->visited = 0; /* visited flag, for the ir walker */
407 res->block_visited = 0; /* visited flag, for the 'block'-walker */
408 res->obst = XMALLOC(struct obstack);
409 obstack_init(res->obst);
410 res->extbb_obst = NULL;
412 res->last_node_idx = 0;
414 res->phase_state = irg->phase_state;
415 res->irg_pinned_state = irg->irg_pinned_state;
416 res->extblk_state = ir_extblk_info_none;
417 res->fp_model = irg->fp_model;
421 /* clone the frame type here for safety */
422 irp_reserve_resources(irp, IR_RESOURCE_ENTITY_LINK);
423 res->frame_type = clone_frame_type(irg->frame_type);
425 res->phase_state = irg->phase_state;
427 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
429 /* copy all nodes from the graph irg to the new graph res */
430 irg_walk_anchors(irg, copy_all_nodes, rewire, res);
432 /* copy the Anchor node */
433 res->anchor = get_new_node(irg->anchor);
435 /* -- The end block -- */
436 set_irg_end_block (res, get_new_node(get_irg_end_block(irg)));
437 set_irg_end (res, get_new_node(get_irg_end(irg)));
439 /* -- The start block -- */
440 set_irg_start_block(res, get_new_node(get_irg_start_block(irg)));
441 set_irg_bad (res, get_new_node(get_irg_bad(irg)));
442 set_irg_no_mem (res, get_new_node(get_irg_no_mem(irg)));
443 set_irg_start (res, get_new_node(get_irg_start(irg)));
445 /* Proj results of start node */
446 set_irg_initial_mem(res, get_new_node(get_irg_initial_mem(irg)));
448 /* Copy the node count estimation. Would be strange if this
449 is different from the original one. */
450 res->estimated_node_count = irg->estimated_node_count;
452 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
453 irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK);
458 /* Frees the passed irgraph.
459 Deallocates all nodes in this graph and the ir_graph structure.
460 Sets the field irgraph in the corresponding entity to NULL.
461 Does not remove the irgraph from the list in irprog (requires
462 inefficient search, call remove_irp_irg by hand).
463 Does not free types, entities or modes that are used only by this
464 graph, nor the entity standing for this graph. */
465 void free_ir_graph(ir_graph *irg)
467 assert(is_ir_graph(irg));
469 edges_deactivate(irg);
471 hook_free_graph(irg);
472 if (irg->outs_state != outs_none)
475 free_type(irg->frame_type);
478 set_entity_irg(irg->ent, NULL); /* not set in const code irg */
481 free_End(get_irg_end(irg));
482 obstack_free(irg->obst,NULL);
484 if (irg->loc_descriptions)
485 free(irg->loc_descriptions);
490 /* access routines for all ir_graph attributes:
492 {attr type} get_irg_{attribute name} (ir_graph *irg);
493 void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
495 int (is_ir_graph)(const void *thing)
497 return _is_ir_graph(thing);
501 /* Outputs a unique number for this node */
502 long get_irg_graph_nr(const ir_graph *irg)
504 return irg->graph_nr;
507 long get_irg_graph_nr(const ir_graph *irg)
509 return PTR_TO_INT(irg);
513 int get_irg_idx(const ir_graph *irg)
518 ir_node *(get_idx_irn)(ir_graph *irg, unsigned idx)
520 return _get_idx_irn(irg, idx);
523 ir_node *(get_irg_start_block)(const ir_graph *irg)
525 return _get_irg_start_block(irg);
528 void (set_irg_start_block)(ir_graph *irg, ir_node *node)
530 _set_irg_start_block(irg, node);
533 ir_node *(get_irg_start)(const ir_graph *irg)
535 return _get_irg_start(irg);
538 void (set_irg_start)(ir_graph *irg, ir_node *node)
540 _set_irg_start(irg, node);
543 ir_node *(get_irg_end_block)(const ir_graph *irg)
545 return _get_irg_end_block(irg);
548 void (set_irg_end_block)(ir_graph *irg, ir_node *node)
550 _set_irg_end_block(irg, node);
553 ir_node *(get_irg_end)(const ir_graph *irg)
555 return _get_irg_end(irg);
558 void (set_irg_end)(ir_graph *irg, ir_node *node)
560 _set_irg_end(irg, node);
563 ir_node *(get_irg_initial_exec)(const ir_graph *irg)
565 return _get_irg_initial_exec(irg);
568 void (set_irg_initial_exec)(ir_graph *irg, ir_node *node)
570 _set_irg_initial_exec(irg, node);
573 ir_node *(get_irg_frame)(const ir_graph *irg)
575 return _get_irg_frame(irg);
578 void (set_irg_frame)(ir_graph *irg, ir_node *node)
580 _set_irg_frame(irg, node);
583 ir_node *(get_irg_tls)(const ir_graph *irg)
585 return _get_irg_tls(irg);
588 void (set_irg_tls)(ir_graph *irg, ir_node *node)
590 _set_irg_tls(irg, node);
593 ir_node *(get_irg_initial_mem)(const ir_graph *irg)
595 return _get_irg_initial_mem(irg);
598 void (set_irg_initial_mem)(ir_graph *irg, ir_node *node)
600 _set_irg_initial_mem(irg, node);
603 ir_node *(get_irg_args)(const ir_graph *irg)
605 return _get_irg_args(irg);
608 void (set_irg_args)(ir_graph *irg, ir_node *node)
610 _set_irg_args(irg, node);
613 ir_node *(get_irg_bad)(const ir_graph *irg)
615 return _get_irg_bad(irg);
618 void (set_irg_bad)(ir_graph *irg, ir_node *node)
620 _set_irg_bad(irg, node);
623 ir_node *(get_irg_no_mem)(const ir_graph *irg)
625 return _get_irg_no_mem(irg);
628 void (set_irg_no_mem)(ir_graph *irg, ir_node *node)
630 _set_irg_no_mem(irg, node);
633 ir_node *(get_irg_current_block)(const ir_graph *irg)
635 return _get_irg_current_block(irg);
638 void (set_irg_current_block)(ir_graph *irg, ir_node *node)
640 _set_irg_current_block(irg, node);
643 ir_entity *(get_irg_entity)(const ir_graph *irg)
645 return _get_irg_entity(irg);
648 void (set_irg_entity)(ir_graph *irg, ir_entity *ent)
650 _set_irg_entity(irg, ent);
653 ir_type *(get_irg_frame_type)(ir_graph *irg)
655 return _get_irg_frame_type(irg);
658 void (set_irg_frame_type)(ir_graph *irg, ir_type *ftp)
660 _set_irg_frame_type(irg, ftp);
663 /* Returns the value parameter type of an IR graph. */
664 ir_type *get_irg_value_param_type(ir_graph *irg)
666 ir_entity *ent = get_irg_entity(irg);
667 ir_type *mtp = get_entity_type(ent);
668 return get_method_value_param_type(mtp);
671 int get_irg_n_locs(ir_graph *irg)
673 return irg->n_loc - 1;
676 /* Returns the obstack associated with the graph. */
678 (get_irg_obstack)(const ir_graph *irg) {
679 return _get_irg_obstack(irg);
683 * Returns true if the node n is allocated on the storage of graph irg.
685 * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
687 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n)
689 struct _obstack_chunk *p;
692 * checks weather the ir_node pointer is on the obstack.
693 * A more sophisticated check would test the "whole" ir_node
695 for (p = irg->obst->chunk; p; p = p->prev) {
696 if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
703 irg_phase_state (get_irg_phase_state)(const ir_graph *irg)
705 return _get_irg_phase_state(irg);
708 void (set_irg_phase_state)(ir_graph *irg, irg_phase_state state)
710 _set_irg_phase_state(irg, state);
713 op_pin_state (get_irg_pinned)(const ir_graph *irg)
715 return _get_irg_pinned(irg);
718 irg_outs_state (get_irg_outs_state)(const ir_graph *irg)
720 return _get_irg_outs_state(irg);
723 void (set_irg_outs_inconsistent)(ir_graph *irg)
725 _set_irg_outs_inconsistent(irg);
728 irg_extblk_state (get_irg_extblk_state)(const ir_graph *irg)
730 return _get_irg_extblk_state(irg);
733 void (set_irg_extblk_inconsistent)(ir_graph *irg)
735 _set_irg_extblk_inconsistent(irg);
738 irg_dom_state (get_irg_dom_state)(const ir_graph *irg)
740 return _get_irg_dom_state(irg);
743 irg_dom_state (get_irg_postdom_state)(const ir_graph *irg)
745 return _get_irg_postdom_state(irg);
748 void (set_irg_doms_inconsistent)(ir_graph *irg)
750 _set_irg_doms_inconsistent(irg);
753 irg_loopinfo_state (get_irg_loopinfo_state)(const ir_graph *irg)
755 return _get_irg_loopinfo_state(irg);
758 void (set_irg_loopinfo_state)(ir_graph *irg, irg_loopinfo_state s)
760 _set_irg_loopinfo_state(irg, s);
763 void (set_irg_loopinfo_inconsistent)(ir_graph *irg)
765 _set_irg_loopinfo_inconsistent(irg);
768 void set_irp_loopinfo_inconsistent(void)
771 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
772 set_irg_loopinfo_inconsistent(get_irp_irg(i));
778 void (set_irg_pinned)(ir_graph *irg, op_pin_state p)
780 _set_irg_pinned(irg, p);
783 irg_callee_info_state (get_irg_callee_info_state)(const ir_graph *irg)
785 return _get_irg_callee_info_state(irg);
788 void (set_irg_callee_info_state)(ir_graph *irg, irg_callee_info_state s)
790 _set_irg_callee_info_state(irg, s);
793 irg_inline_property (get_irg_inline_property)(const ir_graph *irg)
795 return _get_irg_inline_property(irg);
798 void (set_irg_inline_property)(ir_graph *irg, irg_inline_property s)
800 _set_irg_inline_property(irg, s);
803 unsigned (get_irg_additional_properties)(const ir_graph *irg)
805 return _get_irg_additional_properties(irg);
808 void (set_irg_additional_properties)(ir_graph *irg, unsigned property_mask)
810 _set_irg_additional_properties(irg, property_mask);
813 void (set_irg_additional_property)(ir_graph *irg, mtp_additional_property flag)
815 _set_irg_additional_property(irg, flag);
818 void (set_irg_link)(ir_graph *irg, void *thing)
820 _set_irg_link(irg, thing);
823 void *(get_irg_link)(const ir_graph *irg)
825 return _get_irg_link(irg);
828 ir_visited_t (get_irg_visited)(const ir_graph *irg)
830 return _get_irg_visited(irg);
833 /** maximum visited flag content of all ir_graph visited fields. */
834 static ir_visited_t max_irg_visited = 0;
836 void set_irg_visited(ir_graph *irg, ir_visited_t visited)
838 irg->visited = visited;
839 if (irg->visited > max_irg_visited) {
840 max_irg_visited = irg->visited;
844 void inc_irg_visited(ir_graph *irg)
847 if (irg->visited > max_irg_visited) {
848 max_irg_visited = irg->visited;
852 ir_visited_t get_max_irg_visited(void)
854 return max_irg_visited;
857 void set_max_irg_visited(int val)
859 max_irg_visited = val;
862 ir_visited_t inc_max_irg_visited(void)
866 for (i = 0; i < get_irp_n_irgs(); i++)
867 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
869 return ++max_irg_visited;
872 ir_visited_t (get_irg_block_visited)(const ir_graph *irg)
874 return _get_irg_block_visited(irg);
877 void (set_irg_block_visited)(ir_graph *irg, ir_visited_t visited)
879 _set_irg_block_visited(irg, visited);
882 void (inc_irg_block_visited)(ir_graph *irg)
884 _inc_irg_block_visited(irg);
887 /* Return the floating point model of this graph. */
888 unsigned (get_irg_fp_model)(const ir_graph *irg)
890 return _get_irg_fp_model(irg);
893 /* Sets the floating point model for this graph. */
894 void set_irg_fp_model(ir_graph *irg, unsigned model)
896 irg->fp_model = model;
899 /* set a description for local value n */
900 void set_irg_loc_description(ir_graph *irg, int n, void *description)
902 assert(0 <= n && n < irg->n_loc);
904 if (! irg->loc_descriptions)
905 irg->loc_descriptions = XMALLOCNZ(void*, irg->n_loc);
907 irg->loc_descriptions[n] = description;
910 /* get the description for local value n */
911 void *get_irg_loc_description(ir_graph *irg, int n)
913 assert(0 <= n && n < irg->n_loc);
914 return irg->loc_descriptions ? irg->loc_descriptions[n] : NULL;
917 void irg_register_phase(ir_graph *irg, ir_phase_id id, ir_phase *phase)
919 assert(id <= PHASE_LAST);
920 assert(irg->phases[id] == NULL);
921 irg->phases[id] = phase;
924 void irg_invalidate_phases(ir_graph *irg)
927 for (p = 0; p <= PHASE_LAST; ++p) {
928 ir_phase *phase = irg->phases[p];
933 irg->phases[p] = NULL;
938 void ir_reserve_resources(ir_graph *irg, ir_resources_t resources)
940 assert((resources & ~IR_RESOURCE_LOCAL_MASK) == 0);
941 assert((irg->reserved_resources & resources) == 0);
942 irg->reserved_resources |= resources;
945 void ir_free_resources(ir_graph *irg, ir_resources_t resources)
947 assert((irg->reserved_resources & resources) == resources);
948 irg->reserved_resources &= ~resources;
951 ir_resources_t ir_resources_reserved(const ir_graph *irg)
953 return irg->reserved_resources;
957 /* Returns a estimated node count of the irg. */
958 unsigned (get_irg_estimated_node_cnt)(const ir_graph *irg)
960 return _get_irg_estimated_node_cnt(irg);
963 /* Returns the last irn index for this graph. */
964 unsigned get_irg_last_idx(const ir_graph *irg)
966 return irg->last_node_idx;
969 /* register additional space in an IR graph */
970 size_t register_additional_graph_data(size_t size)
972 assert(!forbid_new_data && "Too late to register additional node data");
977 return additional_graph_data_size += size;
980 void (set_irg_state)(ir_graph *irg, ir_graph_state_t state)
982 _set_irg_state(irg, state);
985 void (clear_irg_state)(ir_graph *irg, ir_graph_state_t state)
987 _clear_irg_state(irg, state);
990 int (is_irg_state)(const ir_graph *irg, ir_graph_state_t state)
992 return _is_irg_state(irg, state);