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 /*-- 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);
216 set_irg_end(res, end);
218 start_block = new_r_Block(res, 0, NULL);
219 set_irg_start_block(res, start_block);
220 bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL);
221 bad->attr.irg.irg = res;
222 set_irg_bad (res, bad);
223 set_irg_no_mem (res, new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
224 start = new_r_Start(res);
225 set_irg_start (res, start);
227 /* Proj results of start node */
228 projX = new_r_Proj(start, mode_X, pn_Start_X_initial_exec);
229 set_irg_initial_exec (res, projX);
230 set_irg_frame (res, new_r_Proj(start, mode_P_data, pn_Start_P_frame_base));
231 set_irg_tls (res, new_r_Proj(start, mode_P_data, pn_Start_P_tls));
232 set_irg_args (res, new_r_Proj(start, mode_T, pn_Start_T_args));
233 initial_mem = new_r_Proj(start, mode_M, pn_Start_M);
234 set_irg_initial_mem(res, initial_mem);
236 res->index = get_irp_new_irg_idx();
238 res->graph_nr = get_irp_new_node_nr();
241 set_r_cur_block(res, start_block);
242 set_r_store(res, initial_mem);
244 /*-- Make a block to start with --*/
245 first_block = new_r_immBlock(res);
246 set_r_cur_block(res, first_block);
247 add_immBlock_pred(first_block, projX);
249 res->method_execution_frequency = -1.0;
250 res->estimated_node_count = 0;
255 ir_graph *new_ir_graph(ir_entity *ent, int n_loc)
257 ir_graph *res = new_r_ir_graph(ent, n_loc);
258 add_irp_irg(res); /* remember this graph global. */
262 /* Make a rudimentary IR graph for the constant code.
263 Must look like a correct irg, spare everything else. */
264 ir_graph *new_const_code_irg(void)
266 ir_graph *res = alloc_graph();
273 ir_node *start_block;
276 /* inform statistics here, as blocks will be already build on this graph */
277 hook_new_graph(res, NULL);
279 res->n_loc = 1; /* Only the memory. */
280 res->visited = 0; /* visited flag, for the ir walker */
281 res->block_visited = 0; /* visited flag, for the 'block'-walker */
282 res->obst = XMALLOC(struct obstack);
283 obstack_init(res->obst);
284 res->extbb_obst = NULL;
286 res->last_node_idx = 0;
288 res->phase_state = phase_building;
289 res->irg_pinned_state = op_pin_state_pinned;
290 res->extblk_state = ir_extblk_info_none;
291 res->fp_model = fp_model_precise;
293 /* value table for global value numbering for optimizing use in iropt.c */
296 res->frame_type = NULL;
298 /* the Anchor node must be created first */
299 res->anchor = new_r_Anchor(res);
301 /* -- The end block -- */
302 end_block = new_r_Block(res, 0, NULL);
303 set_irg_end_block(res, end_block);
304 end = new_r_End(res);
305 set_irg_end(res, end);
307 /* -- The start block -- */
308 start_block = new_r_Block(res, 0, NULL);
309 set_irg_start_block(res, start_block);
310 bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL);
311 bad->attr.irg.irg = res;
312 set_irg_bad(res, bad);
313 no_mem = new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL);
314 set_irg_no_mem(res, no_mem);
315 start = new_r_Start(res);
316 set_irg_start(res, start);
318 /* Proj results of start node */
319 set_irg_initial_mem(res, new_r_Proj(start, mode_M, pn_Start_M));
320 projX = new_r_Proj(start, mode_X, pn_Start_X_initial_exec);
322 body_block = new_r_Block(res, 1, &projX);
324 set_r_cur_block(res, body_block);
326 /* Set the visited flag high enough that the blocks will never be visited. */
327 set_irn_visited(body_block, -1);
328 set_Block_block_visited(body_block, -1);
329 set_Block_block_visited(start_block, -1);
330 set_irn_visited(start_block, -1);
331 set_irn_visited(bad, -1);
332 set_irn_visited(no_mem, -1);
338 * Pre-Walker: Copies blocks and nodes from the original method graph
339 * to the copied graph.
341 * @param n A node from the original method graph.
342 * @param env The copied graph.
344 static void copy_all_nodes(ir_node *node, void *env)
347 ir_node *new_node = irn_copy_into_irg(node, irg);
349 set_irn_link(node, new_node);
351 /* fix access to entities on the stack frame */
352 if (is_Sel(new_node)) {
353 ir_entity *ent = get_Sel_entity(new_node);
354 ir_type *tp = get_entity_owner(ent);
356 if (is_frame_type(tp)) {
357 /* replace by the copied entity */
358 ent = get_entity_link(ent);
360 assert(is_entity(ent));
361 assert(get_entity_owner(ent) == get_irg_frame_type(irg));
362 set_Sel_entity(new_node, ent);
368 * Post-walker: Set the predecessors of the copied nodes.
369 * The copied nodes are set as link of their original nodes. The links of
370 * "irn" predecessors are the predecessors of copied node.
372 static void rewire(ir_node *irn, void *env)
375 irn_rewire_inputs(irn);
378 static ir_node *get_new_node(const ir_node *old_node)
380 return (ir_node*) get_irn_link(old_node);
384 * Create a new graph that is a copy of a given one.
386 ir_graph *create_irg_copy(ir_graph *irg)
393 res->visited = 0; /* visited flag, for the ir walker */
394 res->block_visited = 0; /* visited flag, for the 'block'-walker */
395 res->obst = XMALLOC(struct obstack);
396 obstack_init(res->obst);
397 res->extbb_obst = NULL;
399 res->last_node_idx = 0;
401 res->phase_state = irg->phase_state;
402 res->irg_pinned_state = irg->irg_pinned_state;
403 res->extblk_state = ir_extblk_info_none;
404 res->fp_model = irg->fp_model;
408 /* clone the frame type here for safety */
409 irp_reserve_resources(irp, IR_RESOURCE_ENTITY_LINK);
410 res->frame_type = clone_frame_type(irg->frame_type);
412 res->phase_state = irg->phase_state;
414 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
416 /* copy all nodes from the graph irg to the new graph res */
417 irg_walk_anchors(irg, copy_all_nodes, rewire, res);
419 /* copy the Anchor node */
420 res->anchor = get_new_node(irg->anchor);
422 /* -- The end block -- */
423 set_irg_end_block (res, get_new_node(get_irg_end_block(irg)));
424 set_irg_end (res, get_new_node(get_irg_end(irg)));
426 /* -- The start block -- */
427 set_irg_start_block(res, get_new_node(get_irg_start_block(irg)));
428 set_irg_bad (res, get_new_node(get_irg_bad(irg)));
429 set_irg_no_mem (res, get_new_node(get_irg_no_mem(irg)));
430 set_irg_start (res, get_new_node(get_irg_start(irg)));
432 /* Proj results of start node */
433 set_irg_initial_mem(res, get_new_node(get_irg_initial_mem(irg)));
435 /* Copy the node count estimation. Would be strange if this
436 is different from the original one. */
437 res->estimated_node_count = irg->estimated_node_count;
439 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
440 irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK);
445 /* Frees the passed irgraph.
446 Deallocates all nodes in this graph and the ir_graph structure.
447 Sets the field irgraph in the corresponding entity to NULL.
448 Does not remove the irgraph from the list in irprog (requires
449 inefficient search, call remove_irp_irg by hand).
450 Does not free types, entities or modes that are used only by this
451 graph, nor the entity standing for this graph. */
452 void free_ir_graph(ir_graph *irg)
454 assert(is_ir_graph(irg));
456 edges_deactivate(irg);
458 hook_free_graph(irg);
459 if (irg->outs_state != outs_none)
462 free_type(irg->frame_type);
465 set_entity_irg(irg->ent, NULL); /* not set in const code irg */
468 free_End(get_irg_end(irg));
469 obstack_free(irg->obst,NULL);
471 if (irg->loc_descriptions)
472 free(irg->loc_descriptions);
477 /* access routines for all ir_graph attributes:
479 {attr type} get_irg_{attribute name} (ir_graph *irg);
480 void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
482 int (is_ir_graph)(const void *thing)
484 return _is_ir_graph(thing);
488 /* Outputs a unique number for this node */
489 long get_irg_graph_nr(const ir_graph *irg)
491 return irg->graph_nr;
494 long get_irg_graph_nr(const ir_graph *irg)
496 return PTR_TO_INT(irg);
500 int get_irg_idx(const ir_graph *irg)
505 ir_node *(get_idx_irn)(ir_graph *irg, unsigned idx)
507 return _get_idx_irn(irg, idx);
510 ir_node *(get_irg_start_block)(const ir_graph *irg)
512 return _get_irg_start_block(irg);
515 void (set_irg_start_block)(ir_graph *irg, ir_node *node)
517 _set_irg_start_block(irg, node);
520 ir_node *(get_irg_start)(const ir_graph *irg)
522 return _get_irg_start(irg);
525 void (set_irg_start)(ir_graph *irg, ir_node *node)
527 _set_irg_start(irg, node);
530 ir_node *(get_irg_end_block)(const ir_graph *irg)
532 return _get_irg_end_block(irg);
535 void (set_irg_end_block)(ir_graph *irg, ir_node *node)
537 _set_irg_end_block(irg, node);
540 ir_node *(get_irg_end)(const ir_graph *irg)
542 return _get_irg_end(irg);
545 void (set_irg_end)(ir_graph *irg, ir_node *node)
547 _set_irg_end(irg, node);
550 ir_node *(get_irg_initial_exec)(const ir_graph *irg)
552 return _get_irg_initial_exec(irg);
555 void (set_irg_initial_exec)(ir_graph *irg, ir_node *node)
557 _set_irg_initial_exec(irg, node);
560 ir_node *(get_irg_frame)(const ir_graph *irg)
562 return _get_irg_frame(irg);
565 void (set_irg_frame)(ir_graph *irg, ir_node *node)
567 _set_irg_frame(irg, node);
570 ir_node *(get_irg_tls)(const ir_graph *irg)
572 return _get_irg_tls(irg);
575 void (set_irg_tls)(ir_graph *irg, ir_node *node)
577 _set_irg_tls(irg, node);
580 ir_node *(get_irg_initial_mem)(const ir_graph *irg)
582 return _get_irg_initial_mem(irg);
585 void (set_irg_initial_mem)(ir_graph *irg, ir_node *node)
587 _set_irg_initial_mem(irg, node);
590 ir_node *(get_irg_args)(const ir_graph *irg)
592 return _get_irg_args(irg);
595 void (set_irg_args)(ir_graph *irg, ir_node *node)
597 _set_irg_args(irg, node);
600 ir_node *(get_irg_bad)(const ir_graph *irg)
602 return _get_irg_bad(irg);
605 void (set_irg_bad)(ir_graph *irg, ir_node *node)
607 _set_irg_bad(irg, node);
610 ir_node *(get_irg_no_mem)(const ir_graph *irg)
612 return _get_irg_no_mem(irg);
615 void (set_irg_no_mem)(ir_graph *irg, ir_node *node)
617 _set_irg_no_mem(irg, node);
620 ir_entity *(get_irg_entity)(const ir_graph *irg)
622 return _get_irg_entity(irg);
625 void (set_irg_entity)(ir_graph *irg, ir_entity *ent)
627 _set_irg_entity(irg, ent);
630 ir_type *(get_irg_frame_type)(ir_graph *irg)
632 return _get_irg_frame_type(irg);
635 void (set_irg_frame_type)(ir_graph *irg, ir_type *ftp)
637 _set_irg_frame_type(irg, ftp);
640 /* Returns the value parameter type of an IR graph. */
641 ir_type *get_irg_value_param_type(ir_graph *irg)
643 ir_entity *ent = get_irg_entity(irg);
644 ir_type *mtp = get_entity_type(ent);
645 return get_method_value_param_type(mtp);
648 int get_irg_n_locs(ir_graph *irg)
650 return irg->n_loc - 1;
653 /* Returns the obstack associated with the graph. */
655 (get_irg_obstack)(const ir_graph *irg) {
656 return _get_irg_obstack(irg);
660 * Returns true if the node n is allocated on the storage of graph irg.
662 * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
664 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n)
666 struct _obstack_chunk *p;
669 * checks weather the ir_node pointer is on the obstack.
670 * A more sophisticated check would test the "whole" ir_node
672 for (p = irg->obst->chunk; p; p = p->prev) {
673 if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
680 irg_phase_state (get_irg_phase_state)(const ir_graph *irg)
682 return _get_irg_phase_state(irg);
685 void (set_irg_phase_state)(ir_graph *irg, irg_phase_state state)
687 _set_irg_phase_state(irg, state);
690 op_pin_state (get_irg_pinned)(const ir_graph *irg)
692 return _get_irg_pinned(irg);
695 irg_outs_state (get_irg_outs_state)(const ir_graph *irg)
697 return _get_irg_outs_state(irg);
700 void (set_irg_outs_inconsistent)(ir_graph *irg)
702 _set_irg_outs_inconsistent(irg);
705 irg_extblk_info_state (get_irg_extblk_state)(const ir_graph *irg)
707 return _get_irg_extblk_state(irg);
710 void (set_irg_extblk_inconsistent)(ir_graph *irg)
712 _set_irg_extblk_inconsistent(irg);
715 irg_dom_state (get_irg_dom_state)(const ir_graph *irg)
717 return _get_irg_dom_state(irg);
720 irg_dom_state (get_irg_postdom_state)(const ir_graph *irg)
722 return _get_irg_postdom_state(irg);
725 void (set_irg_doms_inconsistent)(ir_graph *irg)
727 _set_irg_doms_inconsistent(irg);
730 irg_loopinfo_state (get_irg_loopinfo_state)(const ir_graph *irg)
732 return _get_irg_loopinfo_state(irg);
735 void (set_irg_loopinfo_state)(ir_graph *irg, irg_loopinfo_state s)
737 _set_irg_loopinfo_state(irg, s);
740 void (set_irg_loopinfo_inconsistent)(ir_graph *irg)
742 _set_irg_loopinfo_inconsistent(irg);
745 void set_irp_loopinfo_inconsistent(void)
748 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
749 set_irg_loopinfo_inconsistent(get_irp_irg(i));
755 void (set_irg_pinned)(ir_graph *irg, op_pin_state p)
757 _set_irg_pinned(irg, p);
760 irg_callee_info_state (get_irg_callee_info_state)(const ir_graph *irg)
762 return _get_irg_callee_info_state(irg);
765 void (set_irg_callee_info_state)(ir_graph *irg, irg_callee_info_state s)
767 _set_irg_callee_info_state(irg, s);
770 irg_inline_property (get_irg_inline_property)(const ir_graph *irg)
772 return _get_irg_inline_property(irg);
775 void (set_irg_inline_property)(ir_graph *irg, irg_inline_property s)
777 _set_irg_inline_property(irg, s);
780 unsigned (get_irg_additional_properties)(const ir_graph *irg)
782 return _get_irg_additional_properties(irg);
785 void (set_irg_additional_properties)(ir_graph *irg, unsigned property_mask)
787 _set_irg_additional_properties(irg, property_mask);
790 void (set_irg_additional_property)(ir_graph *irg, mtp_additional_property flag)
792 _set_irg_additional_property(irg, flag);
795 void (set_irg_link)(ir_graph *irg, void *thing)
797 _set_irg_link(irg, thing);
800 void *(get_irg_link)(const ir_graph *irg)
802 return _get_irg_link(irg);
805 ir_visited_t (get_irg_visited)(const ir_graph *irg)
807 return _get_irg_visited(irg);
810 /** maximum visited flag content of all ir_graph visited fields. */
811 static ir_visited_t max_irg_visited = 0;
813 void set_irg_visited(ir_graph *irg, ir_visited_t visited)
815 irg->visited = visited;
816 if (irg->visited > max_irg_visited) {
817 max_irg_visited = irg->visited;
821 void inc_irg_visited(ir_graph *irg)
824 if (irg->visited > max_irg_visited) {
825 max_irg_visited = irg->visited;
829 ir_visited_t get_max_irg_visited(void)
831 return max_irg_visited;
834 void set_max_irg_visited(int val)
836 max_irg_visited = val;
839 ir_visited_t inc_max_irg_visited(void)
843 for (i = 0; i < get_irp_n_irgs(); i++)
844 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
846 return ++max_irg_visited;
849 ir_visited_t (get_irg_block_visited)(const ir_graph *irg)
851 return _get_irg_block_visited(irg);
854 void (set_irg_block_visited)(ir_graph *irg, ir_visited_t visited)
856 _set_irg_block_visited(irg, visited);
859 void (inc_irg_block_visited)(ir_graph *irg)
861 _inc_irg_block_visited(irg);
864 /* Return the floating point model of this graph. */
865 unsigned (get_irg_fp_model)(const ir_graph *irg)
867 return _get_irg_fp_model(irg);
870 /* Sets the floating point model for this graph. */
871 void set_irg_fp_model(ir_graph *irg, unsigned model)
873 irg->fp_model = model;
876 /* set a description for local value n */
877 void set_irg_loc_description(ir_graph *irg, int n, void *description)
879 assert(0 <= n && n < irg->n_loc);
881 if (! irg->loc_descriptions)
882 irg->loc_descriptions = XMALLOCNZ(void*, irg->n_loc);
884 irg->loc_descriptions[n] = description;
887 /* get the description for local value n */
888 void *get_irg_loc_description(ir_graph *irg, int n)
890 assert(0 <= n && n < irg->n_loc);
891 return irg->loc_descriptions ? irg->loc_descriptions[n] : NULL;
894 void irg_register_phase(ir_graph *irg, ir_phase_id id, ir_phase *phase)
896 assert(id <= PHASE_LAST);
897 assert(irg->phases[id] == NULL);
898 irg->phases[id] = phase;
901 void irg_invalidate_phases(ir_graph *irg)
904 for (p = 0; p <= PHASE_LAST; ++p) {
905 ir_phase *phase = irg->phases[p];
910 irg->phases[p] = NULL;
915 void ir_reserve_resources(ir_graph *irg, ir_resources_t resources)
917 assert((resources & ~IR_RESOURCE_LOCAL_MASK) == 0);
918 assert((irg->reserved_resources & resources) == 0);
919 irg->reserved_resources |= resources;
922 void ir_free_resources(ir_graph *irg, ir_resources_t resources)
924 assert((irg->reserved_resources & resources) == resources);
925 irg->reserved_resources &= ~resources;
928 ir_resources_t ir_resources_reserved(const ir_graph *irg)
930 return irg->reserved_resources;
934 /* Returns a estimated node count of the irg. */
935 unsigned (get_irg_estimated_node_cnt)(const ir_graph *irg)
937 return _get_irg_estimated_node_cnt(irg);
940 /* Returns the last irn index for this graph. */
941 unsigned get_irg_last_idx(const ir_graph *irg)
943 return irg->last_node_idx;
946 /* register additional space in an IR graph */
947 size_t register_additional_graph_data(size_t size)
949 assert(!forbid_new_data && "Too late to register additional node data");
954 return additional_graph_data_size += size;
957 void (set_irg_state)(ir_graph *irg, ir_graph_state_t state)
959 _set_irg_state(irg, state);
962 void (clear_irg_state)(ir_graph *irg, ir_graph_state_t state)
964 _clear_irg_state(irg, state);
967 int (is_irg_state)(const ir_graph *irg, ir_graph_state_t state)
969 return _is_irg_state(irg, state);