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
35 #include "irgraph_t.h"
37 #include "irgraph_t.h"
47 #include "irbackedge_t.h"
48 #include "iredges_t.h"
52 #define INITIAL_IDX_IRN_MAP_SIZE 1024
55 * Indicates, whether additional data can be registered to graphs.
56 * If set to 1, this is not possible anymore.
58 static int forbid_new_data = 0;
61 * The amount of additional space for custom data to be allocated upon
62 * creating a new graph.
64 static size_t additional_graph_data_size = 0;
66 ir_graph *current_ir_graph;
67 ir_graph *get_current_ir_graph(void) {
68 return current_ir_graph;
71 void set_current_ir_graph(ir_graph *graph) {
72 current_ir_graph = graph;
75 #ifdef INTERPROCEDURAL_VIEW
76 int firm_interprocedural_view = 0;
78 int (get_interprocedural_view)(void) {
79 return _get_interprocedural_view();
82 void (set_interprocedural_view)(int state) {
83 firm_interprocedural_view = state;
85 /* set function vectors for faster access */
87 _get_irn_arity = _get_irn_inter_arity;
88 _get_irn_n = _get_irn_inter_n;
91 _get_irn_arity = _get_irn_intra_arity;
92 _get_irn_n = _get_irn_intra_n;
97 /** contains the suffix for frame type names */
98 static ident *frame_type_suffix = NULL;
100 /* initialize the IR graph module */
101 void firm_init_irgraph(void) {
102 frame_type_suffix = new_id_from_str(FRAME_TP_SUFFIX);
107 * Allocate a new IR graph.
108 * This function respects the registered graph data. The only reason for
109 * this function is, that there are two locations, where graphs are
110 * allocated (new_r_ir_graph, new_const_code_irg).
111 * @return Memory for a new graph.
113 static ir_graph *alloc_graph(void) {
115 size_t size = sizeof(ir_graph) + additional_graph_data_size;
116 char *ptr = xmalloc(size);
117 memset(ptr, 0, size);
119 res = (ir_graph *)(ptr + additional_graph_data_size);
120 res->kind = k_ir_graph;
122 /* initialize the idx->node map. */
123 res->idx_irn_map = NEW_ARR_F(ir_node *, INITIAL_IDX_IRN_MAP_SIZE);
124 memset(res->idx_irn_map, 0, INITIAL_IDX_IRN_MAP_SIZE * sizeof(res->idx_irn_map[0]));
130 * Frees an allocated IR graph
132 static void free_graph(ir_graph *irg) {
133 char *ptr = (char *)irg;
136 for (i = 0; i < EDGE_KIND_LAST; ++i)
137 edges_deactivate_kind(irg, i);
138 DEL_ARR_F(irg->idx_irn_map);
139 free(ptr - additional_graph_data_size);
143 * Set the number of locals for a given graph.
145 * @param irg the graph
146 * @param n_loc number of locals
148 void irg_set_nloc(ir_graph *res, int n_loc) {
149 assert(res->phase_state == phase_building);
151 if (get_opt_precise_exc_context()) {
152 res->n_loc = n_loc + 1 + 1; /* number of local variables that are never
153 dereferenced in this graph plus one for
154 the store plus one for links to fragile
155 operations. n_loc is not the number of
156 parameters to the procedure! */
158 res->n_loc = n_loc + 1; /* number of local variables that are never
159 dereferenced in this graph plus one for
160 the store. This is not the number of parameters
163 if (res->loc_descriptions) {
164 xfree(res->loc_descriptions);
165 res->loc_descriptions = NULL;
169 /* Allocates a list of nodes:
170 - The start block containing a start node and Proj nodes for it's four
171 results (X, M, P, Tuple).
172 - The end block containing an end node. This block is not matured after
173 new_ir_graph as predecessors need to be added to it.
174 - The current block, which is empty and also not matured.
175 Further it allocates several datastructures needed for graph construction
178 ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc) {
180 ir_node *first_block;
181 ir_node *end, *start, *start_block, *initial_mem, *projX;
185 /* inform statistics here, as blocks will be already build on this graph */
186 hook_new_graph(res, ent);
188 current_ir_graph = res;
190 /*-- initialized for each graph. --*/
191 res->kind = k_ir_graph;
192 res->obst = XMALLOC(struct obstack);
193 obstack_init(res->obst);
195 res->phase_state = phase_building;
196 irg_set_nloc(res, n_loc);
198 /* descriptions will be allocated on demand */
199 res->loc_descriptions = NULL;
201 res->visited = 0; /* visited flag, for the ir walker */
202 res->block_visited = 0; /* visited flag, for the 'block'-walker */
204 res->extbb_obst = NULL;
206 res->last_node_idx = 0;
208 res->value_table = new_identities (); /* value table for global value
209 numbering for optimizing use in iropt.c */
212 res->inline_property = irg_inline_any;
213 res->additional_properties = mtp_property_inherited; /* inherited from type */
215 res->irg_pinned_state = op_pin_state_pinned;
216 res->outs_state = outs_none;
217 res->dom_state = dom_none;
218 res->pdom_state = dom_none;
219 res->typeinfo_state = ir_typeinfo_none;
220 set_irp_typeinfo_inconsistent(); /* there is a new graph with typeinfo_none. */
221 res->callee_info_state = irg_callee_info_none;
222 res->loopinfo_state = loopinfo_none;
223 res->class_cast_state = ir_class_casts_transitive;
224 res->extblk_state = ir_extblk_info_none;
225 res->execfreq_state = exec_freq_none;
226 res->fp_model = fp_model_precise;
227 res->entity_usage_state = ir_entity_usage_not_computed;
228 res->mem_disambig_opt = aa_opt_inherited;
230 /*-- Type information for the procedure of the graph --*/
232 set_entity_irg(ent, res);
234 /*-- a class type so that it can contain "inner" methods as in Pascal. --*/
235 res->frame_type = new_type_frame(id_mangle(get_entity_ident(ent), frame_type_suffix));
237 /* the Anchor node must be created first */
238 res->anchor = new_Anchor(res);
240 /*-- Nodes needed in every graph --*/
241 set_irg_end_block (res, new_immBlock());
242 set_cur_block(get_irg_end_block(res));
244 set_irg_end (res, end);
245 set_irg_end_reg (res, end);
246 set_irg_end_except(res, end);
248 start_block = new_immBlock();
249 set_cur_block(start_block);
250 set_irg_start_block(res, start_block);
251 set_irg_bad (res, new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL));
252 set_irg_no_mem (res, new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
254 set_irg_start (res, start);
256 /* Proj results of start node */
257 projX = new_Proj(start, mode_X, pn_Start_X_initial_exec);
258 set_irg_initial_exec (res, projX);
259 set_irg_frame (res, new_Proj(start, mode_P_data, pn_Start_P_frame_base));
260 set_irg_tls (res, new_Proj(start, mode_P_data, pn_Start_P_tls));
261 set_irg_args (res, new_Proj(start, mode_T, pn_Start_T_args));
262 initial_mem = new_Proj(start, mode_M, pn_Start_M);
263 set_irg_initial_mem(res, initial_mem);
265 add_immBlock_pred(start_block, projX);
266 set_store(initial_mem);
268 res->index = get_irp_new_irg_idx();
270 res->graph_nr = get_irp_new_node_nr();
274 * The code generation needs it. leave it in now.
275 * Use of this edge is matter of discussion, unresolved. Also possible:
276 * add_immBlock_pred(res->start_block, res->start_block), but invalid typed.
278 mature_immBlock(res->current_block);
280 /*-- Make a block to start with --*/
281 first_block = new_immBlock();
282 set_cur_block(first_block);
283 add_immBlock_pred(first_block, projX);
285 res->method_execution_frequency = -1.0;
286 res->estimated_node_count = 0;
291 ir_graph *new_ir_graph(ir_entity *ent, int n_loc) {
292 ir_graph *res = new_r_ir_graph(ent, n_loc);
293 add_irp_irg(res); /* remember this graph global. */
297 /* Make a rudimentary IR graph for the constant code.
298 Must look like a correct irg, spare everything else. */
299 ir_graph *new_const_code_irg(void)
301 ir_graph *res = alloc_graph();
308 ir_node *start_block;
311 /* inform statistics here, as blocks will be already build on this graph */
312 hook_new_graph(res, NULL);
314 current_ir_graph = res;
315 res->n_loc = 1; /* Only the memory. */
316 res->visited = 0; /* visited flag, for the ir walker */
317 res->block_visited = 0; /* visited flag, for the 'block'-walker */
318 res->obst = XMALLOC(struct obstack);
319 obstack_init(res->obst);
320 res->extbb_obst = NULL;
322 res->last_node_idx = 0;
324 res->phase_state = phase_building;
325 res->irg_pinned_state = op_pin_state_pinned;
326 res->extblk_state = ir_extblk_info_none;
327 res->fp_model = fp_model_precise;
329 /* value table for global value numbering for optimizing use in iropt.c */
330 res->value_table = new_identities();
332 res->frame_type = NULL;
334 /* the Anchor node must be created first */
335 res->anchor = new_Anchor(res);
337 /* -- The end block -- */
338 end_block = new_immBlock();
339 set_irg_end_block(res, end_block);
340 set_cur_block(end_block);
342 set_irg_end (res, end);
343 set_irg_end_reg (res, end);
344 set_irg_end_except(res, end);
345 mature_immBlock(end_block);
347 /* -- The start block -- */
348 start_block = new_immBlock();
349 set_cur_block(start_block);
350 set_irg_start_block(res, start_block);
351 bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL);
352 set_irg_bad(res, bad);
353 no_mem = new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL);
354 set_irg_no_mem(res, no_mem);
356 set_irg_start(res, start);
358 /* Proj results of start node */
359 set_irg_initial_mem(res, new_Proj(start, mode_M, pn_Start_M));
360 projX = new_Proj(start, mode_X, pn_Start_X_initial_exec);
361 add_immBlock_pred(start_block, projX);
362 mature_immBlock(start_block);
364 body_block = new_immBlock();
365 add_immBlock_pred(body_block, projX);
366 mature_immBlock(body_block); /* mature the 'body' block for expressions */
367 set_cur_block(body_block);
369 /* Set the visited flag high enough that the blocks will never be visited. */
370 set_irn_visited(body_block, -1);
371 set_Block_block_visited(body_block, -1);
372 set_Block_block_visited(start_block, -1);
373 set_irn_visited(start_block, -1);
374 set_irn_visited(bad, -1);
375 set_irn_visited(no_mem, -1);
377 res->phase_state = phase_high;
383 * Pre-Walker: Copies blocks and nodes from the original method graph
384 * to the copied graph.
386 * @param n A node from the original method graph.
387 * @param env The copied graph.
389 static void copy_all_nodes(ir_node *n, void *env) {
391 ir_op *op = get_irn_op(n);
394 nn = new_ir_node(get_irn_dbg_info(n),
396 NULL, /* no block yet, will be set later */
403 /* Copy the attributes. These might point to additional data. If this
404 was allocated on the old obstack the pointers now are dangling. This
405 frees e.g. the memory of the graph_arr allocated in new_immBlock. */
406 copy_node_attr(n, nn);
407 new_backedge_info(nn);
410 /* fix the irg for blocks */
412 nn->attr.block.irg = irg;
414 /* fix access to entities on the stack frame */
416 ir_entity *ent = get_Sel_entity(nn);
417 ir_type *tp = get_entity_owner(ent);
419 if (is_frame_type(tp)) {
420 /* replace by the copied entity */
421 ent = get_entity_link(ent);
423 assert(is_entity(ent));
424 assert(get_entity_owner(ent) == get_irg_frame_type(irg));
425 set_Sel_entity(nn, ent);
431 * Post-walker: Set the predecessors of the copied nodes.
432 * The copied nodes are set as link of their original nodes. The links of
433 * "irn" predecessors are the predecessors of copied node.
435 static void set_all_preds(ir_node *irn, void *env) {
440 nn = get_irn_link(irn);
443 ir_node *mbh = get_Block_MacroBlock(irn);
444 set_Block_MacroBlock(nn, get_irn_link(mbh));
445 for (i = get_Block_n_cfgpreds(irn) - 1; i >= 0; i--) {
446 pred = get_Block_cfgpred(irn, i);
447 set_Block_cfgpred(nn, i, get_irn_link(pred));
450 /* First we set the block our copy if it is not a block.*/
451 set_nodes_block(nn, get_irn_link(get_nodes_block(irn)));
452 for (i = get_irn_arity(irn) - 1; i >= 0; i--) {
453 pred = get_irn_n(irn, i);
454 set_irn_n(nn, i, get_irn_link(pred));
459 #define NN(irn) get_irn_link(irn)
462 * Create a new graph that is a copy of a given one.
464 ir_graph *create_irg_copy(ir_graph *irg) {
470 res->visited = 0; /* visited flag, for the ir walker */
471 res->block_visited = 0; /* visited flag, for the 'block'-walker */
472 res->obst = XMALLOC(struct obstack);
473 obstack_init(res->obst);
474 res->extbb_obst = NULL;
476 res->last_node_idx = 0;
478 res->phase_state = irg->phase_state;
479 res->irg_pinned_state = irg->irg_pinned_state;
480 res->extblk_state = ir_extblk_info_none;
481 res->fp_model = irg->fp_model;
483 res->value_table = new_identities();
485 /* clone the frame type here for safety */
486 irp_reserve_resources(irp, IR_RESOURCE_ENTITY_LINK);
487 res->frame_type = clone_frame_type(irg->frame_type);
489 res->phase_state = irg->phase_state;
491 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
493 /* copy all nodes from the graph irg to the new graph res */
494 irg_walk_anchors(irg, copy_all_nodes, set_all_preds, res);
496 /* copy the Anchor node */
497 res->anchor = NN(irg->anchor);
499 /* -- The end block -- */
500 set_irg_end_block (res, NN(get_irg_end_block(irg)));
501 set_irg_end (res, NN(get_irg_end(irg)));
502 set_irg_end_reg (res, NN(get_irg_end_reg(irg)));
503 set_irg_end_except(res, NN(get_irg_end_except(irg)));
505 /* -- The start block -- */
506 set_irg_start_block(res, NN(get_irg_start_block(irg)));
507 set_irg_bad (res, NN(get_irg_bad(irg)));
508 set_irg_no_mem (res, NN(get_irg_no_mem(irg)));
509 set_irg_start (res, NN(get_irg_start(irg)));
511 /* Proj results of start node */
512 set_irg_initial_mem(res, NN(get_irg_initial_mem(irg)));
514 /* Copy the node count estimation. Would be strange if this
515 is different from the original one. */
516 res->estimated_node_count = irg->estimated_node_count;
518 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
519 irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK);
526 /* Frees the passed irgraph.
527 Deallocates all nodes in this graph and the ir_graph structure.
528 Sets the field irgraph in the corresponding entity to NULL.
529 Does not remove the irgraph from the list in irprog (requires
530 inefficient search, call remove_irp_irg by hand).
531 Does not free types, entities or modes that are used only by this
532 graph, nor the entity standing for this graph. */
533 void free_ir_graph(ir_graph *irg) {
534 assert(is_ir_graph(irg));
536 edges_deactivate(irg);
538 hook_free_graph(irg);
539 if (irg->outs_state != outs_none)
542 free_type(irg->frame_type);
543 if (irg->value_table)
544 del_identities(irg->value_table);
546 ir_peculiarity pec = get_entity_peculiarity (irg->ent);
547 set_entity_peculiarity (irg->ent, peculiarity_description);
548 set_entity_irg(irg->ent, NULL); /* not set in const code irg */
549 set_entity_peculiarity (irg->ent, pec);
552 free_End(get_irg_end(irg));
553 obstack_free(irg->obst,NULL);
555 if (irg->loc_descriptions)
556 free(irg->loc_descriptions);
561 /* access routines for all ir_graph attributes:
563 {attr type} get_irg_{attribute name} (ir_graph *irg);
564 void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
567 (is_ir_graph)(const void *thing) {
568 return _is_ir_graph(thing);
572 /* Outputs a unique number for this node */
573 long get_irg_graph_nr(const ir_graph *irg) {
574 return irg->graph_nr;
577 long get_irg_graph_nr(const ir_graph *irg) {
578 return PTR_TO_INT(irg);
582 int get_irg_idx(const ir_graph *irg) {
586 ir_node *(get_idx_irn)(ir_graph *irg, unsigned idx) {
587 return _get_idx_irn(irg, idx);
591 (get_irg_start_block)(const ir_graph *irg) {
592 return _get_irg_start_block(irg);
596 (set_irg_start_block)(ir_graph *irg, ir_node *node) {
597 _set_irg_start_block(irg, node);
601 (get_irg_start)(const ir_graph *irg) {
602 return _get_irg_start(irg);
606 (set_irg_start)(ir_graph *irg, ir_node *node) {
607 _set_irg_start(irg, node);
611 (get_irg_end_block)(const ir_graph *irg) {
612 return _get_irg_end_block(irg);
616 (set_irg_end_block)(ir_graph *irg, ir_node *node) {
617 _set_irg_end_block(irg, node);
621 (get_irg_end)(const ir_graph *irg) {
622 return _get_irg_end(irg);
626 (set_irg_end)(ir_graph *irg, ir_node *node) {
627 _set_irg_end(irg, node);
631 (get_irg_end_reg)(const ir_graph *irg) {
632 return _get_irg_end_reg(irg);
636 (set_irg_end_reg)(ir_graph *irg, ir_node *node) {
637 _set_irg_end_reg(irg, node);
641 (get_irg_end_except)(const ir_graph *irg) {
642 return _get_irg_end_except(irg);
646 (set_irg_end_except)(ir_graph *irg, ir_node *node) {
647 assert(get_irn_op(node) == op_EndExcept || is_End(node));
648 _set_irg_end_except(irg, node);
652 (get_irg_initial_exec)(const ir_graph *irg) {
653 return _get_irg_initial_exec(irg);
657 (set_irg_initial_exec)(ir_graph *irg, ir_node *node) {
658 _set_irg_initial_exec(irg, node);
662 (get_irg_frame)(const ir_graph *irg) {
663 return _get_irg_frame(irg);
667 (set_irg_frame)(ir_graph *irg, ir_node *node) {
668 _set_irg_frame(irg, node);
672 (get_irg_tls)(const ir_graph *irg) {
673 return _get_irg_tls(irg);
677 (set_irg_tls)(ir_graph *irg, ir_node *node) {
678 _set_irg_tls(irg, node);
682 (get_irg_initial_mem)(const ir_graph *irg) {
683 return _get_irg_initial_mem(irg);
687 (set_irg_initial_mem)(ir_graph *irg, ir_node *node) {
688 _set_irg_initial_mem(irg, node);
692 (get_irg_args)(const ir_graph *irg) {
693 return _get_irg_args(irg);
697 (set_irg_args)(ir_graph *irg, ir_node *node) {
698 _set_irg_args(irg, node);
702 (get_irg_bad)(const ir_graph *irg) {
703 return _get_irg_bad(irg);
707 (set_irg_bad)(ir_graph *irg, ir_node *node) {
708 _set_irg_bad(irg, node);
712 (get_irg_no_mem)(const ir_graph *irg) {
713 return _get_irg_no_mem(irg);
717 (set_irg_no_mem)(ir_graph *irg, ir_node *node) {
718 _set_irg_no_mem(irg, node);
722 (get_irg_current_block)(const ir_graph *irg) {
723 return _get_irg_current_block(irg);
727 (set_irg_current_block)(ir_graph *irg, ir_node *node) {
728 _set_irg_current_block(irg, node);
732 (get_irg_entity)(const ir_graph *irg) {
733 return _get_irg_entity(irg);
737 (set_irg_entity)(ir_graph *irg, ir_entity *ent) {
738 _set_irg_entity(irg, ent);
742 (get_irg_frame_type)(ir_graph *irg) {
743 return _get_irg_frame_type(irg);
747 (set_irg_frame_type)(ir_graph *irg, ir_type *ftp) {
748 _set_irg_frame_type(irg, ftp);
751 /* Returns the value parameter type of an IR graph. */
752 ir_type *get_irg_value_param_type(ir_graph *irg) {
753 ir_entity *ent = get_irg_entity(irg);
754 ir_type *mtp = get_entity_type(ent);
755 return get_method_value_param_type(mtp);
759 get_irg_n_locs(ir_graph *irg) {
760 if (get_opt_precise_exc_context())
761 return irg->n_loc - 1 - 1;
763 return irg->n_loc - 1;
767 set_irg_n_loc(ir_graph *irg, int n_loc) {
768 if (get_opt_precise_exc_context())
769 irg->n_loc = n_loc + 1 + 1;
771 irg->n_loc = n_loc + 1;
776 /* Returns the obstack associated with the graph. */
778 (get_irg_obstack)(const ir_graph *irg) {
779 return _get_irg_obstack(irg);
783 * Returns true if the node n is allocated on the storage of graph irg.
785 * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
787 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n) {
788 struct _obstack_chunk *p;
791 * checks weather the ir_node pointer is on the obstack.
792 * A more sophisticated check would test the "whole" ir_node
794 for (p = irg->obst->chunk; p; p = p->prev) {
795 if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
803 (get_irg_phase_state)(const ir_graph *irg) {
804 return _get_irg_phase_state(irg);
808 (set_irg_phase_state)(ir_graph *irg, irg_phase_state state) {
809 _set_irg_phase_state(irg, state);
813 (get_irg_pinned)(const ir_graph *irg) {
814 return _get_irg_pinned(irg);
818 (get_irg_outs_state)(const ir_graph *irg) {
819 return _get_irg_outs_state(irg);
823 (set_irg_outs_inconsistent)(ir_graph *irg) {
824 _set_irg_outs_inconsistent(irg);
828 (get_irg_extblk_state)(const ir_graph *irg) {
829 return _get_irg_extblk_state(irg);
833 (set_irg_extblk_inconsistent)(ir_graph *irg) {
834 _set_irg_extblk_inconsistent(irg);
838 (get_irg_dom_state)(const ir_graph *irg) {
839 return _get_irg_dom_state(irg);
843 (get_irg_postdom_state)(const ir_graph *irg) {
844 return _get_irg_postdom_state(irg);
848 (set_irg_doms_inconsistent)(ir_graph *irg) {
849 _set_irg_doms_inconsistent(irg);
853 (get_irg_loopinfo_state)(const ir_graph *irg) {
854 return _get_irg_loopinfo_state(irg);
858 (set_irg_loopinfo_state)(ir_graph *irg, irg_loopinfo_state s) {
859 _set_irg_loopinfo_state(irg, s);
863 (set_irg_loopinfo_inconsistent)(ir_graph *irg) {
864 _set_irg_loopinfo_inconsistent(irg);
867 void set_irp_loopinfo_inconsistent(void) {
869 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
870 set_irg_loopinfo_inconsistent(get_irp_irg(i));
877 (set_irg_pinned)(ir_graph *irg, op_pin_state p) {
878 _set_irg_pinned(irg, p);
881 irg_callee_info_state
882 (get_irg_callee_info_state)(const ir_graph *irg) {
883 return _get_irg_callee_info_state(irg);
887 (set_irg_callee_info_state)(ir_graph *irg, irg_callee_info_state s) {
888 _set_irg_callee_info_state(irg, s);
892 (get_irg_inline_property)(const ir_graph *irg) {
893 return _get_irg_inline_property(irg);
897 (set_irg_inline_property)(ir_graph *irg, irg_inline_property s) {
898 _set_irg_inline_property(irg, s);
902 (get_irg_additional_properties)(const ir_graph *irg) {
903 return _get_irg_additional_properties(irg);
907 (set_irg_additional_properties)(ir_graph *irg, unsigned property_mask) {
908 _set_irg_additional_properties(irg, property_mask);
912 (set_irg_additional_property)(ir_graph *irg, mtp_additional_property flag) {
913 _set_irg_additional_property(irg, flag);
917 (set_irg_link)(ir_graph *irg, void *thing) {
918 _set_irg_link(irg, thing);
922 (get_irg_link)(const ir_graph *irg) {
923 return _get_irg_link(irg);
927 (get_irg_visited)(const ir_graph *irg) {
928 return _get_irg_visited(irg);
931 #ifdef INTERPROCEDURAL_VIEW
932 /** maximum visited flag content of all ir_graph visited fields. */
933 static ir_visited_t max_irg_visited = 0;
934 #endif /* INTERPROCEDURAL_VIEW */
937 set_irg_visited(ir_graph *irg, ir_visited_t visited) {
938 irg->visited = visited;
939 #ifdef INTERPROCEDURAL_VIEW
940 if (irg->visited > max_irg_visited) {
941 max_irg_visited = irg->visited;
943 #endif /* INTERPROCEDURAL_VIEW */
947 inc_irg_visited(ir_graph *irg) {
948 #ifdef INTERPROCEDURAL_VIEW
949 if (++irg->visited > max_irg_visited) {
950 max_irg_visited = irg->visited;
954 #endif /* INTERPROCEDURAL_VIEW */
957 #ifdef INTERPROCEDURAL_VIEW
959 get_max_irg_visited(void) {
962 for(i = 0; i < get_irp_n_irgs(); i++)
963 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
965 return max_irg_visited;
968 void set_max_irg_visited(int val) {
969 max_irg_visited = val;
973 inc_max_irg_visited(void) {
976 for(i = 0; i < get_irp_n_irgs(); i++)
977 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
979 return ++max_irg_visited;
981 #endif /* INTERPROCEDURAL_VIEW */
984 (get_irg_block_visited)(const ir_graph *irg) {
985 return _get_irg_block_visited(irg);
989 (set_irg_block_visited)(ir_graph *irg, ir_visited_t visited) {
990 _set_irg_block_visited(irg, visited);
994 (inc_irg_block_visited)(ir_graph *irg) {
995 _inc_irg_block_visited(irg);
998 /* Return the floating point model of this graph. */
999 unsigned (get_irg_fp_model)(const ir_graph *irg) {
1000 return _get_irg_fp_model(irg);
1003 /* Sets the floating point model for this graph. */
1004 void set_irg_fp_model(ir_graph *irg, unsigned model) {
1005 irg->fp_model = model;
1009 * walker Start->End: places Proj nodes into the same block
1010 * as it's predecessors
1013 * @param env ignored
1015 static void normalize_proj_walker(ir_node *n, void *env) {
1018 ir_node *pred = get_Proj_pred(n);
1019 ir_node *block = get_nodes_block(pred);
1021 set_nodes_block(n, block);
1025 /* move Proj nodes into the same block as its predecessors */
1026 void normalize_proj_nodes(ir_graph *irg) {
1027 irg_walk_graph(irg, NULL, normalize_proj_walker, NULL);
1028 set_irg_outs_inconsistent(irg);
1031 /* set a description for local value n */
1032 void set_irg_loc_description(ir_graph *irg, int n, void *description) {
1033 assert(0 <= n && n < irg->n_loc);
1035 if (! irg->loc_descriptions)
1036 irg->loc_descriptions = XMALLOCNZ(void*, irg->n_loc);
1038 irg->loc_descriptions[n] = description;
1041 /* get the description for local value n */
1042 void *get_irg_loc_description(ir_graph *irg, int n) {
1043 assert(0 <= n && n < irg->n_loc);
1044 return irg->loc_descriptions ? irg->loc_descriptions[n] : NULL;
1048 void ir_reserve_resources(ir_graph *irg, ir_resources_t resources) {
1049 assert((resources & ~IR_RESOURCE_LOCAL_MASK) == 0);
1050 assert((irg->reserved_resources & resources) == 0);
1051 irg->reserved_resources |= resources;
1054 void ir_free_resources(ir_graph *irg, ir_resources_t resources) {
1055 assert((irg->reserved_resources & resources) == resources);
1056 irg->reserved_resources &= ~resources;
1059 ir_resources_t ir_resources_reserved(const ir_graph *irg) {
1060 return irg->reserved_resources;
1064 /* Returns a estimated node count of the irg. */
1065 unsigned (get_irg_estimated_node_cnt)(const ir_graph *irg) {
1066 return _get_irg_estimated_node_cnt(irg);
1069 /* Returns the last irn index for this graph. */
1070 unsigned get_irg_last_idx(const ir_graph *irg) {
1071 return irg->last_node_idx;
1074 /* register additional space in an IR graph */
1075 size_t register_additional_graph_data(size_t size) {
1076 assert(!forbid_new_data && "Too late to register additional node data");
1078 if (forbid_new_data)
1081 return additional_graph_data_size += size;
1084 void (set_irg_state)(ir_graph *irg, ir_graph_state_t state)
1086 _set_irg_state(irg, state);
1089 void (clear_irg_state)(ir_graph *irg, ir_graph_state_t state)
1091 _clear_irg_state(irg, state);
1094 int (is_irg_state)(const ir_graph *irg, ir_graph_state_t state)
1096 return _is_irg_state(irg, state);