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 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 = EDGE_KIND_FIRST; 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 /*-- initialized for each graph. --*/
165 res->kind = k_ir_graph;
166 res->obst = XMALLOC(struct obstack);
167 obstack_init(res->obst);
169 res->phase_state = phase_building;
170 irg_set_nloc(res, n_loc);
172 /* descriptions will be allocated on demand */
173 res->loc_descriptions = NULL;
175 res->visited = 0; /* visited flag, for the ir walker */
176 res->block_visited = 0; /* visited flag, for the 'block'-walker */
178 res->extbb_obst = NULL;
180 res->last_node_idx = 0;
185 res->inline_property = irg_inline_any;
186 res->additional_properties = mtp_property_inherited; /* inherited from type */
188 res->irg_pinned_state = op_pin_state_pinned;
189 res->outs_state = outs_none;
190 res->dom_state = dom_none;
191 res->pdom_state = dom_none;
192 res->typeinfo_state = ir_typeinfo_none;
193 set_irp_typeinfo_inconsistent(); /* there is a new graph with typeinfo_none. */
194 res->callee_info_state = irg_callee_info_none;
195 res->loopinfo_state = loopinfo_none;
196 res->class_cast_state = ir_class_casts_transitive;
197 res->extblk_state = ir_extblk_info_none;
198 res->execfreq_state = exec_freq_none;
199 res->fp_model = fp_model_precise;
200 res->entity_usage_state = ir_entity_usage_not_computed;
201 res->mem_disambig_opt = aa_opt_inherited;
203 /*-- Type information for the procedure of the graph --*/
205 set_entity_irg(ent, res);
207 /*-- a class type so that it can contain "inner" methods as in Pascal. --*/
208 res->frame_type = new_type_frame();
210 /* the Anchor node must be created first */
211 res->anchor = new_r_Anchor(res);
213 /*-- Nodes needed in every graph --*/
214 set_irg_end_block (res, new_r_immBlock(res));
215 end = new_r_End(res, 0, NULL);
216 set_irg_end(res, end);
218 start_block = new_r_Block_noopt(res, 0, NULL);
219 set_irg_start_block(res, start_block);
220 bad = new_r_Bad(res);
221 set_irg_bad (res, bad);
222 set_irg_no_mem (res, new_r_NoMem(res));
223 start = new_r_Start(res);
224 set_irg_start (res, start);
226 /* Proj results of start node */
227 projX = new_r_Proj(start, mode_X, pn_Start_X_initial_exec);
228 set_irg_initial_exec (res, projX);
229 set_irg_frame (res, new_r_Proj(start, mode_P_data, pn_Start_P_frame_base));
230 set_irg_tls (res, new_r_Proj(start, mode_P_data, pn_Start_P_tls));
231 set_irg_args (res, new_r_Proj(start, mode_T, pn_Start_T_args));
232 initial_mem = new_r_Proj(start, mode_M, pn_Start_M);
233 set_irg_initial_mem(res, initial_mem);
235 res->index = get_irp_new_irg_idx();
237 res->graph_nr = get_irp_new_node_nr();
240 set_r_cur_block(res, start_block);
241 set_r_store(res, initial_mem);
243 /*-- Make a block to start with --*/
244 first_block = new_r_immBlock(res);
245 set_r_cur_block(res, first_block);
246 add_immBlock_pred(first_block, projX);
248 res->method_execution_frequency = -1.0;
249 res->estimated_node_count = 0;
254 ir_graph *new_ir_graph(ir_entity *ent, int n_loc)
256 ir_graph *res = new_r_ir_graph(ent, n_loc);
257 add_irp_irg(res); /* remember this graph global. */
261 /* Make a rudimentary IR graph for the constant code.
262 Must look like a correct irg, spare everything else. */
263 ir_graph *new_const_code_irg(void)
265 ir_graph *res = alloc_graph();
272 ir_node *start_block;
275 /* inform statistics here, as blocks will be already build on this graph */
276 hook_new_graph(res, NULL);
278 res->n_loc = 1; /* Only the memory. */
279 res->visited = 0; /* visited flag, for the ir walker */
280 res->block_visited = 0; /* visited flag, for the 'block'-walker */
281 res->obst = XMALLOC(struct obstack);
282 obstack_init(res->obst);
283 res->extbb_obst = NULL;
285 res->last_node_idx = 0;
287 res->phase_state = phase_building;
288 res->irg_pinned_state = op_pin_state_pinned;
289 res->extblk_state = ir_extblk_info_none;
290 res->fp_model = fp_model_precise;
292 /* value table for global value numbering for optimizing use in iropt.c */
295 res->frame_type = NULL;
297 /* the Anchor node must be created first */
298 res->anchor = new_r_Anchor(res);
300 /* -- The end block -- */
301 end_block = new_r_Block_noopt(res, 0, NULL);
302 set_irg_end_block(res, end_block);
303 end = new_r_End(res, 0, NULL);
304 set_irg_end(res, end);
306 /* -- The start block -- */
307 start_block = new_r_Block_noopt(res, 0, NULL);
308 set_irg_start_block(res, start_block);
309 bad = new_r_Bad(res);
310 set_irg_bad(res, bad);
311 no_mem = new_r_NoMem(res);
312 set_irg_no_mem(res, no_mem);
313 start = new_r_Start(res);
314 set_irg_start(res, start);
316 /* Proj results of start node */
317 set_irg_initial_mem(res, new_r_Proj(start, mode_M, pn_Start_M));
318 projX = new_r_Proj(start, mode_X, pn_Start_X_initial_exec);
320 body_block = new_r_Block(res, 1, &projX);
322 set_r_cur_block(res, body_block);
324 /* Set the visited flag high enough that the blocks will never be visited. */
325 set_irn_visited(body_block, -1);
326 set_Block_block_visited(body_block, -1);
327 set_Block_block_visited(start_block, -1);
328 set_irn_visited(start_block, -1);
329 set_irn_visited(bad, -1);
330 set_irn_visited(no_mem, -1);
336 * Pre-Walker: Copies blocks and nodes from the original method graph
337 * to the copied graph.
339 * @param n A node from the original method graph.
340 * @param env The copied graph.
342 static void copy_all_nodes(ir_node *node, void *env)
344 ir_graph *irg = (ir_graph*)env;
345 ir_node *new_node = irn_copy_into_irg(node, irg);
347 set_irn_link(node, new_node);
349 /* fix access to entities on the stack frame */
350 if (is_Sel(new_node)) {
351 ir_entity *ent = get_Sel_entity(new_node);
352 ir_type *tp = get_entity_owner(ent);
354 if (is_frame_type(tp)) {
355 /* replace by the copied entity */
356 ent = (ir_entity*)get_entity_link(ent);
358 assert(is_entity(ent));
359 assert(get_entity_owner(ent) == get_irg_frame_type(irg));
360 set_Sel_entity(new_node, ent);
366 * Post-walker: Set the predecessors of the copied nodes.
367 * The copied nodes are set as link of their original nodes. The links of
368 * "irn" predecessors are the predecessors of copied node.
370 static void rewire(ir_node *irn, void *env)
373 irn_rewire_inputs(irn);
376 static ir_node *get_new_node(const ir_node *old_node)
378 return (ir_node*) get_irn_link(old_node);
382 * Create a new graph that is a copy of a given one.
384 ir_graph *create_irg_copy(ir_graph *irg)
391 res->visited = 0; /* visited flag, for the ir walker */
392 res->block_visited = 0; /* visited flag, for the 'block'-walker */
393 res->obst = XMALLOC(struct obstack);
394 obstack_init(res->obst);
395 res->extbb_obst = NULL;
397 res->last_node_idx = 0;
399 res->phase_state = irg->phase_state;
400 res->irg_pinned_state = irg->irg_pinned_state;
401 res->extblk_state = ir_extblk_info_none;
402 res->fp_model = irg->fp_model;
406 /* clone the frame type here for safety */
407 irp_reserve_resources(irp, IR_RESOURCE_ENTITY_LINK);
408 res->frame_type = clone_frame_type(irg->frame_type);
410 res->phase_state = irg->phase_state;
412 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
414 /* copy all nodes from the graph irg to the new graph res */
415 irg_walk_anchors(irg, copy_all_nodes, rewire, res);
417 /* copy the Anchor node */
418 res->anchor = get_new_node(irg->anchor);
420 /* -- The end block -- */
421 set_irg_end_block (res, get_new_node(get_irg_end_block(irg)));
422 set_irg_end (res, get_new_node(get_irg_end(irg)));
424 /* -- The start block -- */
425 set_irg_start_block(res, get_new_node(get_irg_start_block(irg)));
426 set_irg_bad (res, get_new_node(get_irg_bad(irg)));
427 set_irg_no_mem (res, get_new_node(get_irg_no_mem(irg)));
428 set_irg_start (res, get_new_node(get_irg_start(irg)));
430 /* Proj results of start node */
431 set_irg_initial_mem(res, get_new_node(get_irg_initial_mem(irg)));
433 /* Copy the node count estimation. Would be strange if this
434 is different from the original one. */
435 res->estimated_node_count = irg->estimated_node_count;
437 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
438 irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK);
443 /* Frees the passed irgraph.
444 Deallocates all nodes in this graph and the ir_graph structure.
445 Sets the field irgraph in the corresponding entity to NULL.
446 Does not remove the irgraph from the list in irprog (requires
447 inefficient search, call remove_irp_irg by hand).
448 Does not free types, entities or modes that are used only by this
449 graph, nor the entity standing for this graph. */
450 void free_ir_graph(ir_graph *irg)
452 assert(is_ir_graph(irg));
454 edges_deactivate(irg);
456 hook_free_graph(irg);
457 if (irg->outs_state != outs_none)
460 free_type(irg->frame_type);
463 set_entity_irg(irg->ent, NULL); /* not set in const code irg */
466 free_End(get_irg_end(irg));
467 obstack_free(irg->obst,NULL);
469 if (irg->loc_descriptions)
470 free(irg->loc_descriptions);
475 /* access routines for all ir_graph attributes:
477 {attr type} get_irg_{attribute name} (ir_graph *irg);
478 void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
480 int (is_ir_graph)(const void *thing)
482 return _is_ir_graph(thing);
486 /* Outputs a unique number for this node */
487 long get_irg_graph_nr(const ir_graph *irg)
489 return irg->graph_nr;
492 long get_irg_graph_nr(const ir_graph *irg)
494 return PTR_TO_INT(irg);
498 int get_irg_idx(const ir_graph *irg)
503 ir_node *(get_idx_irn)(ir_graph *irg, unsigned idx)
505 return _get_idx_irn(irg, idx);
508 ir_node *(get_irg_start_block)(const ir_graph *irg)
510 return _get_irg_start_block(irg);
513 void (set_irg_start_block)(ir_graph *irg, ir_node *node)
515 _set_irg_start_block(irg, node);
518 ir_node *(get_irg_start)(const ir_graph *irg)
520 return _get_irg_start(irg);
523 void (set_irg_start)(ir_graph *irg, ir_node *node)
525 _set_irg_start(irg, node);
528 ir_node *(get_irg_end_block)(const ir_graph *irg)
530 return _get_irg_end_block(irg);
533 void (set_irg_end_block)(ir_graph *irg, ir_node *node)
535 _set_irg_end_block(irg, node);
538 ir_node *(get_irg_end)(const ir_graph *irg)
540 return _get_irg_end(irg);
543 void (set_irg_end)(ir_graph *irg, ir_node *node)
545 _set_irg_end(irg, node);
548 ir_node *(get_irg_initial_exec)(const ir_graph *irg)
550 return _get_irg_initial_exec(irg);
553 void (set_irg_initial_exec)(ir_graph *irg, ir_node *node)
555 _set_irg_initial_exec(irg, node);
558 ir_node *(get_irg_frame)(const ir_graph *irg)
560 return _get_irg_frame(irg);
563 void (set_irg_frame)(ir_graph *irg, ir_node *node)
565 _set_irg_frame(irg, node);
568 ir_node *(get_irg_tls)(const ir_graph *irg)
570 return _get_irg_tls(irg);
573 void (set_irg_tls)(ir_graph *irg, ir_node *node)
575 _set_irg_tls(irg, node);
578 ir_node *(get_irg_initial_mem)(const ir_graph *irg)
580 return _get_irg_initial_mem(irg);
583 void (set_irg_initial_mem)(ir_graph *irg, ir_node *node)
585 _set_irg_initial_mem(irg, node);
588 ir_node *(get_irg_args)(const ir_graph *irg)
590 return _get_irg_args(irg);
593 void (set_irg_args)(ir_graph *irg, ir_node *node)
595 _set_irg_args(irg, node);
598 ir_node *(get_irg_bad)(const ir_graph *irg)
600 return _get_irg_bad(irg);
603 void (set_irg_bad)(ir_graph *irg, ir_node *node)
605 _set_irg_bad(irg, node);
608 ir_node *(get_irg_no_mem)(const ir_graph *irg)
610 return _get_irg_no_mem(irg);
613 void (set_irg_no_mem)(ir_graph *irg, ir_node *node)
615 _set_irg_no_mem(irg, node);
618 ir_entity *(get_irg_entity)(const ir_graph *irg)
620 return _get_irg_entity(irg);
623 void (set_irg_entity)(ir_graph *irg, ir_entity *ent)
625 _set_irg_entity(irg, ent);
628 ir_type *(get_irg_frame_type)(ir_graph *irg)
630 return _get_irg_frame_type(irg);
633 void (set_irg_frame_type)(ir_graph *irg, ir_type *ftp)
635 _set_irg_frame_type(irg, ftp);
638 /* Returns the value parameter type of an IR graph. */
639 ir_type *get_irg_value_param_type(ir_graph *irg)
641 ir_entity *ent = get_irg_entity(irg);
642 ir_type *mtp = get_entity_type(ent);
643 return get_method_value_param_type(mtp);
646 int get_irg_n_locs(ir_graph *irg)
648 return irg->n_loc - 1;
651 /* Returns the obstack associated with the graph. */
653 (get_irg_obstack)(const ir_graph *irg) {
654 return _get_irg_obstack(irg);
658 * Returns true if the node n is allocated on the storage of graph irg.
660 * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
662 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n)
664 struct _obstack_chunk *p;
667 * checks weather the ir_node pointer is on the obstack.
668 * A more sophisticated check would test the "whole" ir_node
670 for (p = irg->obst->chunk; p; p = p->prev) {
671 if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
678 irg_phase_state (get_irg_phase_state)(const ir_graph *irg)
680 return _get_irg_phase_state(irg);
683 void (set_irg_phase_state)(ir_graph *irg, irg_phase_state state)
685 _set_irg_phase_state(irg, state);
688 op_pin_state (get_irg_pinned)(const ir_graph *irg)
690 return _get_irg_pinned(irg);
693 irg_outs_state (get_irg_outs_state)(const ir_graph *irg)
695 return _get_irg_outs_state(irg);
698 void (set_irg_outs_inconsistent)(ir_graph *irg)
700 _set_irg_outs_inconsistent(irg);
703 irg_extblk_info_state (get_irg_extblk_state)(const ir_graph *irg)
705 return _get_irg_extblk_state(irg);
708 void (set_irg_extblk_inconsistent)(ir_graph *irg)
710 _set_irg_extblk_inconsistent(irg);
713 irg_dom_state (get_irg_dom_state)(const ir_graph *irg)
715 return _get_irg_dom_state(irg);
718 irg_dom_state (get_irg_postdom_state)(const ir_graph *irg)
720 return _get_irg_postdom_state(irg);
723 void (set_irg_doms_inconsistent)(ir_graph *irg)
725 _set_irg_doms_inconsistent(irg);
728 irg_loopinfo_state (get_irg_loopinfo_state)(const ir_graph *irg)
730 return _get_irg_loopinfo_state(irg);
733 void (set_irg_loopinfo_state)(ir_graph *irg, irg_loopinfo_state s)
735 _set_irg_loopinfo_state(irg, s);
738 void (set_irg_loopinfo_inconsistent)(ir_graph *irg)
740 _set_irg_loopinfo_inconsistent(irg);
743 void set_irp_loopinfo_inconsistent(void)
746 for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
747 set_irg_loopinfo_inconsistent(get_irp_irg(i));
753 void (set_irg_pinned)(ir_graph *irg, op_pin_state p)
755 _set_irg_pinned(irg, p);
758 irg_callee_info_state (get_irg_callee_info_state)(const ir_graph *irg)
760 return _get_irg_callee_info_state(irg);
763 void (set_irg_callee_info_state)(ir_graph *irg, irg_callee_info_state s)
765 _set_irg_callee_info_state(irg, s);
768 irg_inline_property (get_irg_inline_property)(const ir_graph *irg)
770 return _get_irg_inline_property(irg);
773 void (set_irg_inline_property)(ir_graph *irg, irg_inline_property s)
775 _set_irg_inline_property(irg, s);
778 mtp_additional_properties (get_irg_additional_properties)(const ir_graph *irg)
780 return _get_irg_additional_properties(irg);
783 void (set_irg_additional_properties)(ir_graph *irg, mtp_additional_properties property_mask)
785 _set_irg_additional_properties(irg, property_mask);
788 void (add_irg_additional_properties)(ir_graph *irg, mtp_additional_properties flag)
790 _add_irg_additional_properties(irg, flag);
793 void (set_irg_link)(ir_graph *irg, void *thing)
795 _set_irg_link(irg, thing);
798 void *(get_irg_link)(const ir_graph *irg)
800 return _get_irg_link(irg);
803 ir_visited_t (get_irg_visited)(const ir_graph *irg)
805 return _get_irg_visited(irg);
808 /** maximum visited flag content of all ir_graph visited fields. */
809 static ir_visited_t max_irg_visited = 0;
811 void set_irg_visited(ir_graph *irg, ir_visited_t visited)
813 irg->visited = visited;
814 if (irg->visited > max_irg_visited) {
815 max_irg_visited = irg->visited;
819 void inc_irg_visited(ir_graph *irg)
822 if (irg->visited > max_irg_visited) {
823 max_irg_visited = irg->visited;
827 ir_visited_t get_max_irg_visited(void)
829 return max_irg_visited;
832 void set_max_irg_visited(int val)
834 max_irg_visited = val;
837 ir_visited_t inc_max_irg_visited(void)
841 for (i = 0; i < get_irp_n_irgs(); i++)
842 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
844 return ++max_irg_visited;
847 ir_visited_t (get_irg_block_visited)(const ir_graph *irg)
849 return _get_irg_block_visited(irg);
852 void (set_irg_block_visited)(ir_graph *irg, ir_visited_t visited)
854 _set_irg_block_visited(irg, visited);
857 void (inc_irg_block_visited)(ir_graph *irg)
859 _inc_irg_block_visited(irg);
862 /* Return the floating point model of this graph. */
863 unsigned (get_irg_fp_model)(const ir_graph *irg)
865 return _get_irg_fp_model(irg);
868 /* Sets the floating point model for this graph. */
869 void set_irg_fp_model(ir_graph *irg, unsigned model)
871 irg->fp_model = model;
874 /* set a description for local value n */
875 void set_irg_loc_description(ir_graph *irg, int n, void *description)
877 assert(0 <= n && n < irg->n_loc);
879 if (! irg->loc_descriptions)
880 irg->loc_descriptions = XMALLOCNZ(void*, irg->n_loc);
882 irg->loc_descriptions[n] = description;
885 /* get the description for local value n */
886 void *get_irg_loc_description(ir_graph *irg, int n)
888 assert(0 <= n && n < irg->n_loc);
889 return irg->loc_descriptions ? irg->loc_descriptions[n] : NULL;
892 void irg_register_phase(ir_graph *irg, ir_phase_id id, ir_phase *phase)
894 assert(id <= PHASE_LAST);
895 assert(irg->phases[id] == NULL);
896 irg->phases[id] = phase;
899 void irg_invalidate_phases(ir_graph *irg)
902 for (p = 0; p <= PHASE_LAST; ++p) {
903 ir_phase *phase = irg->phases[p];
908 irg->phases[p] = NULL;
913 void ir_reserve_resources(ir_graph *irg, ir_resources_t resources)
915 assert((resources & ~IR_RESOURCE_LOCAL_MASK) == 0);
916 assert((irg->reserved_resources & resources) == 0);
917 irg->reserved_resources |= resources;
920 void ir_free_resources(ir_graph *irg, ir_resources_t resources)
922 assert((irg->reserved_resources & resources) == resources);
923 irg->reserved_resources &= ~resources;
926 ir_resources_t ir_resources_reserved(const ir_graph *irg)
928 return irg->reserved_resources;
932 /* Returns a estimated node count of the irg. */
933 unsigned (get_irg_estimated_node_cnt)(const ir_graph *irg)
935 return _get_irg_estimated_node_cnt(irg);
938 /* Returns the last irn index for this graph. */
939 unsigned get_irg_last_idx(const ir_graph *irg)
941 return irg->last_node_idx;
944 /* register additional space in an IR graph */
945 size_t register_additional_graph_data(size_t size)
947 assert(!forbid_new_data && "Too late to register additional node data");
952 return additional_graph_data_size += size;
955 void (set_irg_state)(ir_graph *irg, ir_graph_state_t state)
957 _set_irg_state(irg, state);
960 void (clear_irg_state)(ir_graph *irg, ir_graph_state_t state)
962 _clear_irg_state(irg, state);
965 int (is_irg_state)(const ir_graph *irg, ir_graph_state_t state)
967 return _is_irg_state(irg, state);