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
39 #include "irgraph_t.h"
41 #include "irgraph_t.h"
51 #include "iredges_t.h"
55 #define INITIAL_IDX_IRN_MAP_SIZE 1024
58 * Indicates, whether additional data can be registered to graphs.
59 * If set to 1, this is not possible anymore.
61 static int forbid_new_data = 0;
64 * The amount of additional space for custom data to be allocated upon
65 * creating a new graph.
67 static size_t additional_graph_data_size = 0;
69 ir_graph *current_ir_graph;
70 ir_graph *get_current_ir_graph(void) {
71 return current_ir_graph;
74 void set_current_ir_graph(ir_graph *graph) {
75 current_ir_graph = graph;
78 #ifdef INTERPROCEDURAL_VIEW
79 int firm_interprocedural_view = 0;
81 int (get_interprocedural_view)(void) {
82 return _get_interprocedural_view();
85 void (set_interprocedural_view)(int state) {
86 firm_interprocedural_view = state;
88 /* set function vectors for faster access */
90 _get_irn_arity = _get_irn_inter_arity;
91 _get_irn_n = _get_irn_inter_n;
94 _get_irn_arity = _get_irn_intra_arity;
95 _get_irn_n = _get_irn_intra_n;
100 /** contains the suffix for frame type names */
101 static ident *frame_type_suffix = NULL;
103 /* initialize the IR graph module */
104 void firm_init_irgraph(void) {
105 frame_type_suffix = new_id_from_str(FRAME_TP_SUFFIX);
110 * Allocate a new IR graph.
111 * This function respects the registered graph data. The only reason for
112 * this function is, that there are two locations, where graphs are
113 * allocated (new_r_ir_graph, new_const_code_irg).
114 * @return Memory for a new graph.
116 static ir_graph *alloc_graph(void) {
117 size_t size = sizeof(ir_graph) + additional_graph_data_size;
118 char *ptr = xmalloc(size);
119 memset(ptr, 0, size);
121 return (ir_graph *) (ptr + additional_graph_data_size);
125 * Frees an allocated IR graph
127 static void free_graph(ir_graph *irg) {
128 char *ptr = (char *)irg;
129 free(ptr - additional_graph_data_size);
132 #if USE_EXPLICIT_PHI_IN_STACK
133 /* really defined in ircons.c */
134 typedef struct Phi_in_stack Phi_in_stack;
135 Phi_in_stack *new_Phi_in_stack();
136 void free_Phi_in_stack(Phi_in_stack *s);
139 /* Allocates a list of nodes:
140 - The start block containing a start node and Proj nodes for it's four
141 results (X, M, P, Tuple).
142 - The end block containing an end node. This block is not matured after
143 new_ir_graph as predecessors need to be added to it.
144 - The current block, which is empty and also not matured.
145 Further it allocates several datastructures needed for graph construction
148 ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc) {
150 ir_node *first_block;
151 ir_node *end, *start, *start_block, *initial_mem, *projX;
154 res->kind = k_ir_graph;
156 //edges_init_graph_kind(res, EDGE_KIND_NORMAL);
157 //edges_init_graph_kind(res, EDGE_KIND_BLOCK);
159 /* initialize the idx->node map. */
160 res->idx_irn_map = NEW_ARR_F(ir_node *, INITIAL_IDX_IRN_MAP_SIZE);
161 memset(res->idx_irn_map, 0, INITIAL_IDX_IRN_MAP_SIZE * sizeof(res->idx_irn_map[0]));
163 /* inform statistics here, as blocks will be already build on this graph */
164 hook_new_graph(res, ent);
166 current_ir_graph = res;
168 /*-- initialized for each graph. --*/
169 if (get_opt_precise_exc_context()) {
170 res->n_loc = n_loc + 1 + 1; /* number of local variables that are never
171 dereferenced in this graph plus one for
172 the store plus one for links to fragile
173 operations. n_loc is not the number of
174 parameters to the procedure! */
176 res->n_loc = n_loc + 1; /* number of local variables that are never
177 dereferenced in this graph plus one for
178 the store. This is not the number of parameters
182 /* descriptions will be allocated on demand */
183 res->loc_descriptions = NULL;
185 res->visited = 0; /* visited flag, for the ir walker */
186 res->block_visited = 0; /* visited flag, for the 'block'-walker */
188 #if USE_EXPLICIT_PHI_IN_STACK
189 res->Phi_in_stack = new_Phi_in_stack(); /* A stack needed for automatic Phi
192 res->kind = k_ir_graph;
193 res->obst = xmalloc (sizeof(*res->obst));
194 obstack_init(res->obst);
195 res->extbb_obst = NULL;
197 res->last_node_idx = 0;
199 res->value_table = new_identities (); /* value table for global value
200 numbering for optimizing use in iropt.c */
203 res->inline_property = irg_inline_any;
204 res->additional_properties = mtp_property_inherited; /* inherited from type */
206 res->phase_state = phase_building;
207 res->irg_pinned_state = op_pin_state_pinned;
208 res->outs_state = outs_none;
209 res->dom_state = dom_none;
210 res->pdom_state = dom_none;
211 res->typeinfo_state = ir_typeinfo_none;
212 set_irp_typeinfo_inconsistent(); /* there is a new graph with typeinfo_none. */
213 res->callee_info_state = irg_callee_info_none;
214 res->loopinfo_state = loopinfo_none;
215 res->class_cast_state = ir_class_casts_transitive;
216 res->extblk_state = ir_extblk_info_none;
217 res->execfreq_state = exec_freq_none;
218 res->fp_model = fp_model_precise;
219 res->adr_taken_state = ir_address_taken_not_computed;
220 res->mem_disambig_opt = aa_opt_inherited;
222 /*-- Type information for the procedure of the graph --*/
224 set_entity_irg(ent, res);
226 /*-- a class type so that it can contain "inner" methods as in Pascal. --*/
227 res->frame_type = new_type_frame(mangle(get_entity_ident(ent), frame_type_suffix));
229 /* the Anchor node must be created first */
230 res->anchor = new_Anchor(res);
232 /*-- Nodes needed in every graph --*/
233 set_irg_end_block (res, new_immBlock());
235 set_irg_end (res, end);
236 set_irg_end_reg (res, end);
237 set_irg_end_except(res, end);
239 start_block = new_immBlock();
240 set_irg_start_block(res, start_block);
241 set_irg_bad (res, new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL));
242 set_irg_no_mem (res, new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
244 set_irg_start (res, start);
246 /* Proj results of start node */
247 projX = new_Proj(start, mode_X, pn_Start_X_initial_exec);
248 set_irg_frame (res, new_Proj(start, mode_P_data, pn_Start_P_frame_base));
249 set_irg_globals (res, new_Proj(start, mode_P_data, pn_Start_P_globals));
250 set_irg_tls (res, new_Proj(start, mode_P_data, pn_Start_P_tls));
251 set_irg_args (res, new_Proj(start, mode_T, pn_Start_T_args));
252 set_irg_value_param_base(res, new_Proj(start, mode_P_data, pn_Start_P_value_arg_base));
253 initial_mem = new_Proj(start, mode_M, pn_Start_M);
254 set_irg_initial_mem(res, initial_mem);
256 add_immBlock_pred(start_block, projX);
257 set_store(initial_mem);
259 res->index = get_irp_new_irg_idx();
261 res->graph_nr = get_irp_new_node_nr();
265 * The code generation needs it. leave it in now.
266 * Use of this edge is matter of discussion, unresolved. Also possible:
267 * add_immBlock_pred(res->start_block, res->start_block), but invalid typed.
269 mature_immBlock(res->current_block);
271 /*-- Make a block to start with --*/
272 first_block = new_immBlock();
273 add_immBlock_pred(first_block, projX);
275 res->method_execution_frequency = -1.0;
276 res->estimated_node_count = 0;
283 new_ir_graph(ir_entity *ent, int n_loc) {
284 ir_graph *res = new_r_ir_graph(ent, n_loc);
285 add_irp_irg(res); /* remember this graph global. */
289 /* Make a rudimentary IR graph for the constant code.
290 Must look like a correct irg, spare everything else. */
291 ir_graph *new_const_code_irg(void) {
293 ir_node *end, *start_block, *start, *projX;
297 /* initialize the idx->node map. */
298 res->idx_irn_map = NEW_ARR_F(ir_node *, INITIAL_IDX_IRN_MAP_SIZE);
299 memset(res->idx_irn_map, 0, INITIAL_IDX_IRN_MAP_SIZE * sizeof(res->idx_irn_map[0]));
301 /* inform statistics here, as blocks will be already build on this graph */
302 hook_new_graph(res, NULL);
304 current_ir_graph = res;
305 res->n_loc = 1; /* Only the memory. */
306 res->visited = 0; /* visited flag, for the ir walker */
307 res->block_visited = 0; /* visited flag, for the 'block'-walker */
308 #if USE_EXPLICIT_PHI_IN_STACK
309 res->Phi_in_stack = NULL;
311 res->kind = k_ir_graph;
312 res->obst = xmalloc (sizeof(*res->obst));
313 obstack_init (res->obst);
314 res->extbb_obst = NULL;
316 res->last_node_idx = 0;
318 res->phase_state = phase_building;
319 res->irg_pinned_state = op_pin_state_pinned;
320 res->extblk_state = ir_extblk_info_none;
321 res->fp_model = fp_model_precise;
323 res->value_table = new_identities (); /* value table for global value
324 numbering for optimizing use in
327 res->frame_type = NULL;
329 /* the Anchor node must be created first */
330 res->anchor = new_Anchor(res);
332 /* -- The end block -- */
333 set_irg_end_block (res, new_immBlock());
335 set_irg_end (res, end);
336 set_irg_end_reg (res, end);
337 set_irg_end_except(res, end);
338 mature_immBlock(get_cur_block()); /* mature the end block */
340 /* -- The start block -- */
341 start_block = new_immBlock();
342 set_irg_start_block(res, start_block);
343 set_irg_bad (res, new_ir_node (NULL, res, start_block, op_Bad, mode_T, 0, NULL));
344 set_irg_no_mem (res, new_ir_node (NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
346 set_irg_start (res, start);
348 /* Proj results of start node */
349 set_irg_initial_mem(res, new_Proj(start, mode_M, pn_Start_M));
350 projX = new_Proj(start, mode_X, pn_Start_X_initial_exec);
351 add_immBlock_pred(start_block, projX);
352 mature_immBlock (start_block); /* mature the start block */
354 add_immBlock_pred(new_immBlock(), projX);
355 mature_immBlock (get_cur_block()); /* mature the 'body' block for expressions */
357 /* Set the visited flag high enough that the blocks will never be visited. */
358 set_irn_visited(get_cur_block(), -1);
359 set_Block_block_visited(get_cur_block(), -1);
360 set_Block_block_visited(start_block, -1);
361 set_irn_visited(start_block, -1);
362 set_irn_visited(get_irg_bad(res), -1);
363 set_irn_visited(get_irg_no_mem(res), -1);
365 res->phase_state = phase_high;
370 /* Defined in iropt.c */
371 void del_identities (pset *value_table);
373 /* Frees the passed irgraph.
374 Deallocates all nodes in this graph and the ir_graph structure.
375 Sets the field irgraph in the corresponding entity to NULL.
376 Does not remove the irgraph from the list in irprog (requires
377 inefficient search, call remove_irp_irg by hand).
378 Does not free types, entities or modes that are used only by this
379 graph, nor the entity standing for this graph. */
380 void free_ir_graph (ir_graph *irg) {
381 assert(is_ir_graph(irg));
383 hook_free_graph(irg);
384 if (irg->outs_state != outs_none) free_irg_outs(irg);
385 if (irg->frame_type) free_type(irg->frame_type);
386 if (irg->value_table) del_identities(irg->value_table);
388 ir_peculiarity pec = get_entity_peculiarity (irg->ent);
389 set_entity_peculiarity (irg->ent, peculiarity_description);
390 set_entity_irg(irg->ent, NULL); /* not set in const code irg */
391 set_entity_peculiarity (irg->ent, pec);
394 free_End(get_irg_end(irg));
395 obstack_free(irg->obst,NULL);
397 #if USE_EXPLICIT_PHI_IN_STACK
398 free_Phi_in_stack(irg->Phi_in_stack);
400 if (irg->loc_descriptions)
401 free(irg->loc_descriptions);
406 /* access routines for all ir_graph attributes:
408 {attr type} get_irg_{attribute name} (ir_graph *irg);
409 void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
412 (is_ir_graph)(const void *thing) {
413 return _is_ir_graph(thing);
417 /* Outputs a unique number for this node */
418 long get_irg_graph_nr(const ir_graph *irg) {
419 return irg->graph_nr;
422 long get_irg_graph_nr(const ir_graph *irg) {
423 return PTR_TO_INT(irg);
427 int get_irg_idx(const ir_graph *irg) {
432 (get_irg_start_block)(const ir_graph *irg) {
433 return _get_irg_start_block(irg);
437 (set_irg_start_block)(ir_graph *irg, ir_node *node) {
438 _set_irg_start_block(irg, node);
442 (get_irg_start)(const ir_graph *irg) {
443 return _get_irg_start(irg);
447 (set_irg_start)(ir_graph *irg, ir_node *node) {
448 _set_irg_start(irg, node);
452 (get_irg_end_block)(const ir_graph *irg) {
453 return _get_irg_end_block(irg);
457 (set_irg_end_block)(ir_graph *irg, ir_node *node) {
458 _set_irg_end_block(irg, node);
462 (get_irg_end)(const ir_graph *irg) {
463 return _get_irg_end(irg);
467 (set_irg_end)(ir_graph *irg, ir_node *node) {
468 _set_irg_end(irg, node);
472 (get_irg_end_reg)(const ir_graph *irg) {
473 return _get_irg_end_reg(irg);
477 (set_irg_end_reg)(ir_graph *irg, ir_node *node) {
478 _set_irg_end_reg(irg, node);
482 (get_irg_end_except)(const ir_graph *irg) {
483 return _get_irg_end_except(irg);
487 (set_irg_end_except)(ir_graph *irg, ir_node *node) {
488 assert(get_irn_op(node) == op_EndExcept || get_irn_op(node) == op_End);
489 _set_irg_end_except(irg, node);
493 (get_irg_frame)(const ir_graph *irg) {
494 return _get_irg_frame(irg);
498 (set_irg_frame)(ir_graph *irg, ir_node *node) {
499 _set_irg_frame(irg, node);
503 (get_irg_globals)(const ir_graph *irg) {
504 return _get_irg_globals(irg);
508 (set_irg_globals)(ir_graph *irg, ir_node *node) {
509 _set_irg_globals(irg, node);
513 (get_irg_tls)(const ir_graph *irg) {
514 return _get_irg_tls(irg);
518 (set_irg_tls)(ir_graph *irg, ir_node *node) {
519 _set_irg_tls(irg, node);
523 (get_irg_initial_mem)(const ir_graph *irg) {
524 return _get_irg_initial_mem(irg);
528 (set_irg_initial_mem)(ir_graph *irg, ir_node *node) {
529 _set_irg_initial_mem(irg, node);
533 (get_irg_args)(const ir_graph *irg) {
534 return _get_irg_args(irg);
538 (set_irg_args)(ir_graph *irg, ir_node *node) {
539 _set_irg_args(irg, node);
543 (get_irg_value_param_base)(const ir_graph *irg) {
544 return _get_irg_value_param_base(irg);
548 (set_irg_value_param_base)(ir_graph *irg, ir_node *node) {
549 _set_irg_value_param_base(irg, node);
553 (get_irg_bad)(const ir_graph *irg) {
554 return _get_irg_bad(irg);
558 (set_irg_bad)(ir_graph *irg, ir_node *node) {
559 _set_irg_bad(irg, node);
563 (get_irg_no_mem)(const ir_graph *irg) {
564 return _get_irg_no_mem(irg);
568 (set_irg_no_mem)(ir_graph *irg, ir_node *node) {
569 _set_irg_no_mem(irg, node);
573 (get_irg_current_block)(const ir_graph *irg) {
574 return _get_irg_current_block(irg);
578 (set_irg_current_block)(ir_graph *irg, ir_node *node) {
579 _set_irg_current_block(irg, node);
583 (get_irg_entity)(const ir_graph *irg) {
584 return _get_irg_entity(irg);
588 (set_irg_entity)(ir_graph *irg, ir_entity *ent) {
589 _set_irg_entity(irg, ent);
593 (get_irg_frame_type)(ir_graph *irg) {
594 return _get_irg_frame_type(irg);
598 (set_irg_frame_type)(ir_graph *irg, ir_type *ftp) {
599 _set_irg_frame_type(irg, ftp);
603 get_irg_n_locs(ir_graph *irg) {
604 if (get_opt_precise_exc_context())
605 return irg->n_loc - 1 - 1;
607 return irg->n_loc - 1;
611 set_irg_n_loc(ir_graph *irg, int n_loc) {
612 if (get_opt_precise_exc_context())
613 irg->n_loc = n_loc + 1 + 1;
615 irg->n_loc = n_loc + 1;
620 /* Returns the obstack associated with the graph. */
622 (get_irg_obstack)(const ir_graph *irg) {
623 return _get_irg_obstack(irg);
627 * Returns true if the node n is allocated on the storage of graph irg.
629 * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
631 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n) {
632 struct _obstack_chunk *p;
635 * checks weather the ir_node pointer is on the obstack.
636 * A more sophisticated check would test the "whole" ir_node
638 for (p = irg->obst->chunk; p; p = p->prev) {
639 if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
647 (get_irg_phase_state)(const ir_graph *irg) {
648 return _get_irg_phase_state(irg);
652 (set_irg_phase_state)(ir_graph *irg, irg_phase_state state) {
653 _set_irg_phase_state(irg, state);
657 (get_irg_pinned)(const ir_graph *irg) {
658 return _get_irg_pinned(irg);
662 (get_irg_outs_state)(const ir_graph *irg) {
663 return _get_irg_outs_state(irg);
667 (set_irg_outs_inconsistent)(ir_graph *irg) {
668 _set_irg_outs_inconsistent(irg);
672 (get_irg_extblk_state)(const ir_graph *irg) {
673 return _get_irg_extblk_state(irg);
677 (set_irg_extblk_inconsistent)(ir_graph *irg) {
678 _set_irg_extblk_inconsistent(irg);
682 (get_irg_dom_state)(const ir_graph *irg) {
683 return _get_irg_dom_state(irg);
687 (get_irg_postdom_state)(const ir_graph *irg) {
688 return _get_irg_postdom_state(irg);
692 (set_irg_doms_inconsistent)(ir_graph *irg) {
693 _set_irg_doms_inconsistent(irg);
697 (get_irg_loopinfo_state)(const ir_graph *irg) {
698 return _get_irg_loopinfo_state(irg);
702 (set_irg_loopinfo_state)(ir_graph *irg, irg_loopinfo_state s) {
703 _set_irg_loopinfo_state(irg, s);
707 (set_irg_loopinfo_inconsistent)(ir_graph *irg) {
708 _set_irg_loopinfo_inconsistent(irg);
711 void set_irp_loopinfo_inconsistent(void) {
713 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
714 set_irg_loopinfo_inconsistent(get_irp_irg(i));
721 (set_irg_pinned)(ir_graph *irg, op_pin_state p) {
722 _set_irg_pinned(irg, p);
725 irg_callee_info_state
726 (get_irg_callee_info_state)(const ir_graph *irg) {
727 return _get_irg_callee_info_state(irg);
731 (set_irg_callee_info_state)(ir_graph *irg, irg_callee_info_state s) {
732 _set_irg_callee_info_state(irg, s);
736 (get_irg_inline_property)(const ir_graph *irg) {
737 return _get_irg_inline_property(irg);
741 (set_irg_inline_property)(ir_graph *irg, irg_inline_property s) {
742 _set_irg_inline_property(irg, s);
746 (get_irg_additional_properties)(const ir_graph *irg) {
747 return _get_irg_additional_properties(irg);
751 (set_irg_additional_properties)(ir_graph *irg, unsigned property_mask) {
752 _set_irg_additional_properties(irg, property_mask);
756 (set_irg_additional_property)(ir_graph *irg, mtp_additional_property flag) {
757 _set_irg_additional_property(irg, flag);
761 (set_irg_link)(ir_graph *irg, void *thing) {
762 _set_irg_link(irg, thing);
766 (get_irg_link)(const ir_graph *irg) {
767 return _get_irg_link(irg);
771 (get_irg_visited)(const ir_graph *irg) {
772 return _get_irg_visited(irg);
775 #ifdef INTERPROCEDURAL_VIEW
776 /** maximum visited flag content of all ir_graph visited fields. */
777 static unsigned long max_irg_visited = 0;
778 #endif /* INTERPROCEDURAL_VIEW */
781 set_irg_visited(ir_graph *irg, unsigned long visited) {
782 irg->visited = visited;
783 #ifdef INTERPROCEDURAL_VIEW
784 if (irg->visited > max_irg_visited) {
785 max_irg_visited = irg->visited;
787 #endif /* INTERPROCEDURAL_VIEW */
791 inc_irg_visited(ir_graph *irg) {
792 #ifdef INTERPROCEDURAL_VIEW
793 if (++irg->visited > max_irg_visited) {
794 max_irg_visited = irg->visited;
798 #endif /* INTERPROCEDURAL_VIEW */
801 #ifdef INTERPROCEDURAL_VIEW
803 get_max_irg_visited(void) {
806 for(i = 0; i < get_irp_n_irgs(); i++)
807 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
809 return max_irg_visited;
812 void set_max_irg_visited(int val) {
813 max_irg_visited = val;
817 inc_max_irg_visited(void) {
820 for(i = 0; i < get_irp_n_irgs(); i++)
821 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
823 return ++max_irg_visited;
825 #endif /* INTERPROCEDURAL_VIEW */
828 (get_irg_block_visited)(const ir_graph *irg) {
829 return _get_irg_block_visited(irg);
833 (set_irg_block_visited)(ir_graph *irg, unsigned long visited) {
834 _set_irg_block_visited(irg, visited);
838 (inc_irg_block_visited)(ir_graph *irg) {
839 _inc_irg_block_visited(irg);
842 /* Return the floating point model of this graph. */
843 unsigned (get_irg_fp_model)(const ir_graph *irg) {
844 return _get_irg_fp_model(irg);
847 /* Sets the floating point model for this graph. */
848 void set_irg_fp_model(ir_graph *irg, unsigned model) {
849 irg->fp_model = model;
853 * walker Start->End: places Proj nodes into the same block
854 * as it's predecessors
859 static void normalize_proj_walker(ir_node *n, void *env) {
862 ir_node *pred = get_Proj_pred(n);
863 ir_node *block = get_nodes_block(pred);
865 set_nodes_block(n, block);
869 /* move Proj nodes into the same block as its predecessors */
870 void normalize_proj_nodes(ir_graph *irg) {
871 irg_walk_graph(irg, NULL, normalize_proj_walker, NULL);
872 set_irg_outs_inconsistent(irg);
875 /* set a description for local value n */
876 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 = xcalloc(sizeof(*irg->loc_descriptions), 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) {
887 assert(0 <= n && n < irg->n_loc);
888 return irg->loc_descriptions ? irg->loc_descriptions[n] : NULL;
892 void set_using_block_visited(ir_graph *irg) {
893 assert(irg->using_block_visited == 0);
894 irg->using_block_visited = 1;
897 void clear_using_block_visited(ir_graph *irg) {
898 assert(irg->using_block_visited == 1);
899 irg->using_block_visited = 0;
902 int using_block_visited(const ir_graph *irg) {
903 return irg->using_block_visited;
907 void set_using_visited(ir_graph *irg) {
908 assert(irg->using_visited == 0);
909 irg->using_visited = 1;
912 void clear_using_visited(ir_graph *irg) {
913 assert(irg->using_visited == 1);
914 irg->using_visited = 0;
917 int using_visited(const ir_graph *irg) {
918 return irg->using_visited;
922 void set_using_irn_link(ir_graph *irg) {
923 assert(irg->using_irn_link == 0);
924 irg->using_irn_link = 1;
927 void clear_using_irn_link(ir_graph *irg) {
928 assert(irg->using_irn_link == 1);
929 irg->using_irn_link = 0;
932 int using_irn_link(const ir_graph *irg) {
933 return irg->using_irn_link;
937 /* Returns a estimated node count of the irg. */
938 unsigned (get_irg_estimated_node_cnt)(const ir_graph *irg) {
939 return _get_irg_estimated_node_cnt(irg);
942 /* Returns the last irn index for this graph. */
943 unsigned get_irg_last_idx(const ir_graph *irg) {
944 return irg->last_node_idx;
947 /* register additional space in an IR graph */
948 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;