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_r_Anchor(res);
215 /*-- Nodes needed in every graph --*/
216 set_irg_end_block (res, new_immBlock());
217 end = new_r_End(get_irg_end_block(res));
218 set_irg_end(res, end);
220 start_block = new_immBlock();
221 set_irg_start_block(res, start_block);
222 bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL);
223 bad->attr.irg.irg = res;
224 set_irg_bad (res, bad);
225 set_irg_no_mem (res, new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
226 start = new_r_Start(start_block);
227 set_irg_start (res, start);
229 /* Proj results of start node */
230 projX = new_r_Proj(start, mode_X, pn_Start_X_initial_exec);
231 set_irg_initial_exec (res, projX);
232 set_irg_frame (res, new_r_Proj(start, mode_P_data, pn_Start_P_frame_base));
233 set_irg_tls (res, new_r_Proj(start, mode_P_data, pn_Start_P_tls));
234 set_irg_args (res, new_r_Proj(start, mode_T, pn_Start_T_args));
235 initial_mem = new_r_Proj(start, mode_M, pn_Start_M);
236 set_irg_initial_mem(res, initial_mem);
238 set_cur_block(start_block);
239 set_store(initial_mem);
241 res->index = get_irp_new_irg_idx();
243 res->graph_nr = get_irp_new_node_nr();
246 mature_immBlock(start_block);
248 /*-- Make a block to start with --*/
249 first_block = new_immBlock();
250 set_cur_block(first_block);
251 add_immBlock_pred(first_block, projX);
253 res->method_execution_frequency = -1.0;
254 res->estimated_node_count = 0;
259 ir_graph *new_ir_graph(ir_entity *ent, int n_loc)
261 ir_graph *res = new_r_ir_graph(ent, n_loc);
262 add_irp_irg(res); /* remember this graph global. */
266 /* Make a rudimentary IR graph for the constant code.
267 Must look like a correct irg, spare everything else. */
268 ir_graph *new_const_code_irg(void)
270 ir_graph *res = alloc_graph();
277 ir_node *start_block;
280 /* inform statistics here, as blocks will be already build on this graph */
281 hook_new_graph(res, NULL);
283 current_ir_graph = res;
284 res->n_loc = 1; /* Only the memory. */
285 res->visited = 0; /* visited flag, for the ir walker */
286 res->block_visited = 0; /* visited flag, for the 'block'-walker */
287 res->obst = XMALLOC(struct obstack);
288 obstack_init(res->obst);
289 res->extbb_obst = NULL;
291 res->last_node_idx = 0;
293 res->phase_state = phase_building;
294 res->irg_pinned_state = op_pin_state_pinned;
295 res->extblk_state = ir_extblk_info_none;
296 res->fp_model = fp_model_precise;
298 /* value table for global value numbering for optimizing use in iropt.c */
301 res->frame_type = NULL;
303 /* the Anchor node must be created first */
304 res->anchor = new_r_Anchor(res);
306 /* -- The end block -- */
307 end_block = new_immBlock();
308 set_irg_end_block(res, end_block);
309 end = new_r_End(end_block);
310 set_irg_end(res, end);
311 mature_immBlock(end_block);
313 /* -- The start block -- */
314 start_block = new_immBlock();
315 set_cur_block(start_block);
316 set_irg_start_block(res, start_block);
317 bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL);
318 bad->attr.irg.irg = res;
319 set_irg_bad(res, bad);
320 no_mem = new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL);
321 set_irg_no_mem(res, no_mem);
322 start = new_r_Start(start_block);
323 set_irg_start(res, start);
325 /* Proj results of start node */
326 set_irg_initial_mem(res, new_r_Proj(start, mode_M, pn_Start_M));
327 projX = new_r_Proj(start, mode_X, pn_Start_X_initial_exec);
328 mature_immBlock(start_block);
330 body_block = new_immBlock();
331 add_immBlock_pred(body_block, projX);
332 mature_immBlock(body_block); /* mature the 'body' block for expressions */
333 set_cur_block(body_block);
335 /* Set the visited flag high enough that the blocks will never be visited. */
336 set_irn_visited(body_block, -1);
337 set_Block_block_visited(body_block, -1);
338 set_Block_block_visited(start_block, -1);
339 set_irn_visited(start_block, -1);
340 set_irn_visited(bad, -1);
341 set_irn_visited(no_mem, -1);
347 * Pre-Walker: Copies blocks and nodes from the original method graph
348 * to the copied graph.
350 * @param n A node from the original method graph.
351 * @param env The copied graph.
353 static void copy_all_nodes(ir_node *node, void *env)
356 ir_node *new_node = irn_copy_into_irg(node, irg);
358 set_irn_link(node, new_node);
360 /* fix access to entities on the stack frame */
361 if (is_Sel(new_node)) {
362 ir_entity *ent = get_Sel_entity(new_node);
363 ir_type *tp = get_entity_owner(ent);
365 if (is_frame_type(tp)) {
366 /* replace by the copied entity */
367 ent = get_entity_link(ent);
369 assert(is_entity(ent));
370 assert(get_entity_owner(ent) == get_irg_frame_type(irg));
371 set_Sel_entity(new_node, ent);
377 * Post-walker: Set the predecessors of the copied nodes.
378 * The copied nodes are set as link of their original nodes. The links of
379 * "irn" predecessors are the predecessors of copied node.
381 static void rewire(ir_node *irn, void *env)
384 irn_rewire_inputs(irn);
387 static ir_node *get_new_node(const ir_node *old_node)
389 return (ir_node*) get_irn_link(old_node);
393 * Create a new graph that is a copy of a given one.
395 ir_graph *create_irg_copy(ir_graph *irg)
402 res->visited = 0; /* visited flag, for the ir walker */
403 res->block_visited = 0; /* visited flag, for the 'block'-walker */
404 res->obst = XMALLOC(struct obstack);
405 obstack_init(res->obst);
406 res->extbb_obst = NULL;
408 res->last_node_idx = 0;
410 res->phase_state = irg->phase_state;
411 res->irg_pinned_state = irg->irg_pinned_state;
412 res->extblk_state = ir_extblk_info_none;
413 res->fp_model = irg->fp_model;
417 /* clone the frame type here for safety */
418 irp_reserve_resources(irp, IR_RESOURCE_ENTITY_LINK);
419 res->frame_type = clone_frame_type(irg->frame_type);
421 res->phase_state = irg->phase_state;
423 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
425 /* copy all nodes from the graph irg to the new graph res */
426 irg_walk_anchors(irg, copy_all_nodes, rewire, res);
428 /* copy the Anchor node */
429 res->anchor = get_new_node(irg->anchor);
431 /* -- The end block -- */
432 set_irg_end_block (res, get_new_node(get_irg_end_block(irg)));
433 set_irg_end (res, get_new_node(get_irg_end(irg)));
435 /* -- The start block -- */
436 set_irg_start_block(res, get_new_node(get_irg_start_block(irg)));
437 set_irg_bad (res, get_new_node(get_irg_bad(irg)));
438 set_irg_no_mem (res, get_new_node(get_irg_no_mem(irg)));
439 set_irg_start (res, get_new_node(get_irg_start(irg)));
441 /* Proj results of start node */
442 set_irg_initial_mem(res, get_new_node(get_irg_initial_mem(irg)));
444 /* Copy the node count estimation. Would be strange if this
445 is different from the original one. */
446 res->estimated_node_count = irg->estimated_node_count;
448 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
449 irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK);
454 /* Frees the passed irgraph.
455 Deallocates all nodes in this graph and the ir_graph structure.
456 Sets the field irgraph in the corresponding entity to NULL.
457 Does not remove the irgraph from the list in irprog (requires
458 inefficient search, call remove_irp_irg by hand).
459 Does not free types, entities or modes that are used only by this
460 graph, nor the entity standing for this graph. */
461 void free_ir_graph(ir_graph *irg)
463 assert(is_ir_graph(irg));
465 edges_deactivate(irg);
467 hook_free_graph(irg);
468 if (irg->outs_state != outs_none)
471 free_type(irg->frame_type);
474 set_entity_irg(irg->ent, NULL); /* not set in const code irg */
477 free_End(get_irg_end(irg));
478 obstack_free(irg->obst,NULL);
480 if (irg->loc_descriptions)
481 free(irg->loc_descriptions);
486 /* access routines for all ir_graph attributes:
488 {attr type} get_irg_{attribute name} (ir_graph *irg);
489 void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
491 int (is_ir_graph)(const void *thing)
493 return _is_ir_graph(thing);
497 /* Outputs a unique number for this node */
498 long get_irg_graph_nr(const ir_graph *irg)
500 return irg->graph_nr;
503 long get_irg_graph_nr(const ir_graph *irg)
505 return PTR_TO_INT(irg);
509 int get_irg_idx(const ir_graph *irg)
514 ir_node *(get_idx_irn)(ir_graph *irg, unsigned idx)
516 return _get_idx_irn(irg, idx);
519 ir_node *(get_irg_start_block)(const ir_graph *irg)
521 return _get_irg_start_block(irg);
524 void (set_irg_start_block)(ir_graph *irg, ir_node *node)
526 _set_irg_start_block(irg, node);
529 ir_node *(get_irg_start)(const ir_graph *irg)
531 return _get_irg_start(irg);
534 void (set_irg_start)(ir_graph *irg, ir_node *node)
536 _set_irg_start(irg, node);
539 ir_node *(get_irg_end_block)(const ir_graph *irg)
541 return _get_irg_end_block(irg);
544 void (set_irg_end_block)(ir_graph *irg, ir_node *node)
546 _set_irg_end_block(irg, node);
549 ir_node *(get_irg_end)(const ir_graph *irg)
551 return _get_irg_end(irg);
554 void (set_irg_end)(ir_graph *irg, ir_node *node)
556 _set_irg_end(irg, node);
559 ir_node *(get_irg_initial_exec)(const ir_graph *irg)
561 return _get_irg_initial_exec(irg);
564 void (set_irg_initial_exec)(ir_graph *irg, ir_node *node)
566 _set_irg_initial_exec(irg, node);
569 ir_node *(get_irg_frame)(const ir_graph *irg)
571 return _get_irg_frame(irg);
574 void (set_irg_frame)(ir_graph *irg, ir_node *node)
576 _set_irg_frame(irg, node);
579 ir_node *(get_irg_tls)(const ir_graph *irg)
581 return _get_irg_tls(irg);
584 void (set_irg_tls)(ir_graph *irg, ir_node *node)
586 _set_irg_tls(irg, node);
589 ir_node *(get_irg_initial_mem)(const ir_graph *irg)
591 return _get_irg_initial_mem(irg);
594 void (set_irg_initial_mem)(ir_graph *irg, ir_node *node)
596 _set_irg_initial_mem(irg, node);
599 ir_node *(get_irg_args)(const ir_graph *irg)
601 return _get_irg_args(irg);
604 void (set_irg_args)(ir_graph *irg, ir_node *node)
606 _set_irg_args(irg, node);
609 ir_node *(get_irg_bad)(const ir_graph *irg)
611 return _get_irg_bad(irg);
614 void (set_irg_bad)(ir_graph *irg, ir_node *node)
616 _set_irg_bad(irg, node);
619 ir_node *(get_irg_no_mem)(const ir_graph *irg)
621 return _get_irg_no_mem(irg);
624 void (set_irg_no_mem)(ir_graph *irg, ir_node *node)
626 _set_irg_no_mem(irg, node);
629 ir_node *(get_irg_current_block)(const ir_graph *irg)
631 return _get_irg_current_block(irg);
634 void (set_irg_current_block)(ir_graph *irg, ir_node *node)
636 _set_irg_current_block(irg, node);
639 ir_entity *(get_irg_entity)(const ir_graph *irg)
641 return _get_irg_entity(irg);
644 void (set_irg_entity)(ir_graph *irg, ir_entity *ent)
646 _set_irg_entity(irg, ent);
649 ir_type *(get_irg_frame_type)(ir_graph *irg)
651 return _get_irg_frame_type(irg);
654 void (set_irg_frame_type)(ir_graph *irg, ir_type *ftp)
656 _set_irg_frame_type(irg, ftp);
659 /* Returns the value parameter type of an IR graph. */
660 ir_type *get_irg_value_param_type(ir_graph *irg)
662 ir_entity *ent = get_irg_entity(irg);
663 ir_type *mtp = get_entity_type(ent);
664 return get_method_value_param_type(mtp);
667 int get_irg_n_locs(ir_graph *irg)
669 return irg->n_loc - 1;
672 /* Returns the obstack associated with the graph. */
674 (get_irg_obstack)(const ir_graph *irg) {
675 return _get_irg_obstack(irg);
679 * Returns true if the node n is allocated on the storage of graph irg.
681 * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
683 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n)
685 struct _obstack_chunk *p;
688 * checks weather the ir_node pointer is on the obstack.
689 * A more sophisticated check would test the "whole" ir_node
691 for (p = irg->obst->chunk; p; p = p->prev) {
692 if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
699 irg_phase_state (get_irg_phase_state)(const ir_graph *irg)
701 return _get_irg_phase_state(irg);
704 void (set_irg_phase_state)(ir_graph *irg, irg_phase_state state)
706 _set_irg_phase_state(irg, state);
709 op_pin_state (get_irg_pinned)(const ir_graph *irg)
711 return _get_irg_pinned(irg);
714 irg_outs_state (get_irg_outs_state)(const ir_graph *irg)
716 return _get_irg_outs_state(irg);
719 void (set_irg_outs_inconsistent)(ir_graph *irg)
721 _set_irg_outs_inconsistent(irg);
724 irg_extblk_state (get_irg_extblk_state)(const ir_graph *irg)
726 return _get_irg_extblk_state(irg);
729 void (set_irg_extblk_inconsistent)(ir_graph *irg)
731 _set_irg_extblk_inconsistent(irg);
734 irg_dom_state (get_irg_dom_state)(const ir_graph *irg)
736 return _get_irg_dom_state(irg);
739 irg_dom_state (get_irg_postdom_state)(const ir_graph *irg)
741 return _get_irg_postdom_state(irg);
744 void (set_irg_doms_inconsistent)(ir_graph *irg)
746 _set_irg_doms_inconsistent(irg);
749 irg_loopinfo_state (get_irg_loopinfo_state)(const ir_graph *irg)
751 return _get_irg_loopinfo_state(irg);
754 void (set_irg_loopinfo_state)(ir_graph *irg, irg_loopinfo_state s)
756 _set_irg_loopinfo_state(irg, s);
759 void (set_irg_loopinfo_inconsistent)(ir_graph *irg)
761 _set_irg_loopinfo_inconsistent(irg);
764 void set_irp_loopinfo_inconsistent(void)
767 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
768 set_irg_loopinfo_inconsistent(get_irp_irg(i));
774 void (set_irg_pinned)(ir_graph *irg, op_pin_state p)
776 _set_irg_pinned(irg, p);
779 irg_callee_info_state (get_irg_callee_info_state)(const ir_graph *irg)
781 return _get_irg_callee_info_state(irg);
784 void (set_irg_callee_info_state)(ir_graph *irg, irg_callee_info_state s)
786 _set_irg_callee_info_state(irg, s);
789 irg_inline_property (get_irg_inline_property)(const ir_graph *irg)
791 return _get_irg_inline_property(irg);
794 void (set_irg_inline_property)(ir_graph *irg, irg_inline_property s)
796 _set_irg_inline_property(irg, s);
799 unsigned (get_irg_additional_properties)(const ir_graph *irg)
801 return _get_irg_additional_properties(irg);
804 void (set_irg_additional_properties)(ir_graph *irg, unsigned property_mask)
806 _set_irg_additional_properties(irg, property_mask);
809 void (set_irg_additional_property)(ir_graph *irg, mtp_additional_property flag)
811 _set_irg_additional_property(irg, flag);
814 void (set_irg_link)(ir_graph *irg, void *thing)
816 _set_irg_link(irg, thing);
819 void *(get_irg_link)(const ir_graph *irg)
821 return _get_irg_link(irg);
824 ir_visited_t (get_irg_visited)(const ir_graph *irg)
826 return _get_irg_visited(irg);
829 /** maximum visited flag content of all ir_graph visited fields. */
830 static ir_visited_t max_irg_visited = 0;
832 void set_irg_visited(ir_graph *irg, ir_visited_t visited)
834 irg->visited = visited;
835 if (irg->visited > max_irg_visited) {
836 max_irg_visited = irg->visited;
840 void inc_irg_visited(ir_graph *irg)
843 if (irg->visited > max_irg_visited) {
844 max_irg_visited = irg->visited;
848 ir_visited_t get_max_irg_visited(void)
850 return max_irg_visited;
853 void set_max_irg_visited(int val)
855 max_irg_visited = val;
858 ir_visited_t inc_max_irg_visited(void)
862 for (i = 0; i < get_irp_n_irgs(); i++)
863 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
865 return ++max_irg_visited;
868 ir_visited_t (get_irg_block_visited)(const ir_graph *irg)
870 return _get_irg_block_visited(irg);
873 void (set_irg_block_visited)(ir_graph *irg, ir_visited_t visited)
875 _set_irg_block_visited(irg, visited);
878 void (inc_irg_block_visited)(ir_graph *irg)
880 _inc_irg_block_visited(irg);
883 /* Return the floating point model of this graph. */
884 unsigned (get_irg_fp_model)(const ir_graph *irg)
886 return _get_irg_fp_model(irg);
889 /* Sets the floating point model for this graph. */
890 void set_irg_fp_model(ir_graph *irg, unsigned model)
892 irg->fp_model = model;
895 /* set a description for local value n */
896 void set_irg_loc_description(ir_graph *irg, int n, void *description)
898 assert(0 <= n && n < irg->n_loc);
900 if (! irg->loc_descriptions)
901 irg->loc_descriptions = XMALLOCNZ(void*, irg->n_loc);
903 irg->loc_descriptions[n] = description;
906 /* get the description for local value n */
907 void *get_irg_loc_description(ir_graph *irg, int n)
909 assert(0 <= n && n < irg->n_loc);
910 return irg->loc_descriptions ? irg->loc_descriptions[n] : NULL;
913 void irg_register_phase(ir_graph *irg, ir_phase_id id, ir_phase *phase)
915 assert(id <= PHASE_LAST);
916 assert(irg->phases[id] == NULL);
917 irg->phases[id] = phase;
920 void irg_invalidate_phases(ir_graph *irg)
923 for (p = 0; p <= PHASE_LAST; ++p) {
924 ir_phase *phase = irg->phases[p];
929 irg->phases[p] = NULL;
934 void ir_reserve_resources(ir_graph *irg, ir_resources_t resources)
936 assert((resources & ~IR_RESOURCE_LOCAL_MASK) == 0);
937 assert((irg->reserved_resources & resources) == 0);
938 irg->reserved_resources |= resources;
941 void ir_free_resources(ir_graph *irg, ir_resources_t resources)
943 assert((irg->reserved_resources & resources) == resources);
944 irg->reserved_resources &= ~resources;
947 ir_resources_t ir_resources_reserved(const ir_graph *irg)
949 return irg->reserved_resources;
953 /* Returns a estimated node count of the irg. */
954 unsigned (get_irg_estimated_node_cnt)(const ir_graph *irg)
956 return _get_irg_estimated_node_cnt(irg);
959 /* Returns the last irn index for this graph. */
960 unsigned get_irg_last_idx(const ir_graph *irg)
962 return irg->last_node_idx;
965 /* register additional space in an IR graph */
966 size_t register_additional_graph_data(size_t size)
968 assert(!forbid_new_data && "Too late to register additional node data");
973 return additional_graph_data_size += size;
976 void (set_irg_state)(ir_graph *irg, ir_graph_state_t state)
978 _set_irg_state(irg, state);
981 void (clear_irg_state)(ir_graph *irg, ir_graph_state_t state)
983 _clear_irg_state(irg, state);
986 int (is_irg_state)(const ir_graph *irg, ir_graph_state_t state)
988 return _is_irg_state(irg, state);