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
37 #include "irgraph_t.h"
39 #include "irgraph_t.h"
49 #include "irbackedge_t.h"
50 #include "iredges_t.h"
54 #define INITIAL_IDX_IRN_MAP_SIZE 1024
57 * Indicates, whether additional data can be registered to graphs.
58 * If set to 1, this is not possible anymore.
60 static int forbid_new_data = 0;
63 * The amount of additional space for custom data to be allocated upon
64 * creating a new graph.
66 static size_t additional_graph_data_size = 0;
68 ir_graph *current_ir_graph;
69 ir_graph *get_current_ir_graph(void) {
70 return current_ir_graph;
73 void set_current_ir_graph(ir_graph *graph) {
74 current_ir_graph = graph;
77 #ifdef INTERPROCEDURAL_VIEW
78 int firm_interprocedural_view = 0;
80 int (get_interprocedural_view)(void) {
81 return _get_interprocedural_view();
84 void (set_interprocedural_view)(int state) {
85 firm_interprocedural_view = state;
87 /* set function vectors for faster access */
89 _get_irn_arity = _get_irn_inter_arity;
90 _get_irn_n = _get_irn_inter_n;
93 _get_irn_arity = _get_irn_intra_arity;
94 _get_irn_n = _get_irn_intra_n;
99 /** contains the suffix for frame type names */
100 static ident *frame_type_suffix = NULL;
102 /* initialize the IR graph module */
103 void firm_init_irgraph(void) {
104 frame_type_suffix = new_id_from_str(FRAME_TP_SUFFIX);
109 * Allocate a new IR graph.
110 * This function respects the registered graph data. The only reason for
111 * this function is, that there are two locations, where graphs are
112 * allocated (new_r_ir_graph, new_const_code_irg).
113 * @return Memory for a new graph.
115 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 res = (ir_graph *)(ptr + additional_graph_data_size);
122 res->kind = k_ir_graph;
124 /* initialize the idx->node map. */
125 res->idx_irn_map = NEW_ARR_F(ir_node *, INITIAL_IDX_IRN_MAP_SIZE);
126 memset(res->idx_irn_map, 0, INITIAL_IDX_IRN_MAP_SIZE * sizeof(res->idx_irn_map[0]));
132 * Frees an allocated IR graph
134 static void free_graph(ir_graph *irg) {
135 char *ptr = (char *)irg;
138 for (i = 0; i < EDGE_KIND_LAST; ++i)
139 edges_deactivate_kind(irg, i);
140 DEL_ARR_F(irg->idx_irn_map);
141 free(ptr - additional_graph_data_size);
144 #if USE_EXPLICIT_PHI_IN_STACK
145 /* really defined in ircons.c */
146 typedef struct Phi_in_stack Phi_in_stack;
147 Phi_in_stack *new_Phi_in_stack();
148 void free_Phi_in_stack(Phi_in_stack *s);
152 * Set the number of locals for a given graph.
154 * @param irg the graph
155 * @param n_loc number of locals
157 void irg_set_nloc(ir_graph *res, int n_loc) {
158 assert(res->phase_state == phase_building);
160 if (get_opt_precise_exc_context()) {
161 res->n_loc = n_loc + 1 + 1; /* number of local variables that are never
162 dereferenced in this graph plus one for
163 the store plus one for links to fragile
164 operations. n_loc is not the number of
165 parameters to the procedure! */
167 res->n_loc = n_loc + 1; /* number of local variables that are never
168 dereferenced in this graph plus one for
169 the store. This is not the number of parameters
172 if (res->loc_descriptions) {
173 xfree(res->loc_descriptions);
174 res->loc_descriptions = NULL;
178 /* Allocates a list of nodes:
179 - The start block containing a start node and Proj nodes for it's four
180 results (X, M, P, Tuple).
181 - The end block containing an end node. This block is not matured after
182 new_ir_graph as predecessors need to be added to it.
183 - The current block, which is empty and also not matured.
184 Further it allocates several datastructures needed for graph construction
187 ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc) {
189 ir_node *first_block;
190 ir_node *end, *start, *start_block, *initial_mem, *projX;
194 /* inform statistics here, as blocks will be already build on this graph */
195 hook_new_graph(res, ent);
197 current_ir_graph = res;
199 /*-- initialized for each graph. --*/
200 res->kind = k_ir_graph;
201 res->obst = XMALLOC(struct obstack);
202 obstack_init(res->obst);
204 res->phase_state = phase_building;
205 irg_set_nloc(res, n_loc);
207 /* descriptions will be allocated on demand */
208 res->loc_descriptions = NULL;
210 res->visited = 0; /* visited flag, for the ir walker */
211 res->block_visited = 0; /* visited flag, for the 'block'-walker */
213 #if USE_EXPLICIT_PHI_IN_STACK
214 res->Phi_in_stack = new_Phi_in_stack(); /* A stack needed for automatic Phi
217 res->extbb_obst = NULL;
219 res->last_node_idx = 0;
221 res->value_table = new_identities (); /* value table for global value
222 numbering for optimizing use in iropt.c */
225 res->inline_property = irg_inline_any;
226 res->additional_properties = mtp_property_inherited; /* inherited from type */
228 res->irg_pinned_state = op_pin_state_pinned;
229 res->outs_state = outs_none;
230 res->dom_state = dom_none;
231 res->pdom_state = dom_none;
232 res->typeinfo_state = ir_typeinfo_none;
233 set_irp_typeinfo_inconsistent(); /* there is a new graph with typeinfo_none. */
234 res->callee_info_state = irg_callee_info_none;
235 res->loopinfo_state = loopinfo_none;
236 res->class_cast_state = ir_class_casts_transitive;
237 res->extblk_state = ir_extblk_info_none;
238 res->execfreq_state = exec_freq_none;
239 res->fp_model = fp_model_precise;
240 res->entity_usage_state = ir_entity_usage_not_computed;
241 res->mem_disambig_opt = aa_opt_inherited;
243 /*-- Type information for the procedure of the graph --*/
245 set_entity_irg(ent, res);
247 /*-- a class type so that it can contain "inner" methods as in Pascal. --*/
248 res->frame_type = new_type_frame(mangle(get_entity_ident(ent), frame_type_suffix));
250 /* the Anchor node must be created first */
251 res->anchor = new_Anchor(res);
253 /*-- Nodes needed in every graph --*/
254 set_irg_end_block (res, new_immBlock());
256 set_irg_end (res, end);
257 set_irg_end_reg (res, end);
258 set_irg_end_except(res, end);
260 start_block = new_immBlock();
261 set_irg_start_block(res, start_block);
262 set_irg_bad (res, new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL));
263 set_irg_no_mem (res, new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
265 set_irg_start (res, start);
267 /* Proj results of start node */
268 projX = new_Proj(start, mode_X, pn_Start_X_initial_exec);
269 set_irg_initial_exec (res, projX);
270 set_irg_frame (res, new_Proj(start, mode_P_data, pn_Start_P_frame_base));
271 set_irg_tls (res, new_Proj(start, mode_P_data, pn_Start_P_tls));
272 set_irg_args (res, new_Proj(start, mode_T, pn_Start_T_args));
273 set_irg_value_param_base(res, new_Proj(start, mode_P_data, pn_Start_P_value_arg_base));
274 initial_mem = new_Proj(start, mode_M, pn_Start_M);
275 set_irg_initial_mem(res, initial_mem);
277 add_immBlock_pred(start_block, projX);
278 set_store(initial_mem);
280 res->index = get_irp_new_irg_idx();
282 res->graph_nr = get_irp_new_node_nr();
286 * The code generation needs it. leave it in now.
287 * Use of this edge is matter of discussion, unresolved. Also possible:
288 * add_immBlock_pred(res->start_block, res->start_block), but invalid typed.
290 mature_immBlock(res->current_block);
292 /*-- Make a block to start with --*/
293 first_block = new_immBlock();
294 add_immBlock_pred(first_block, projX);
296 res->method_execution_frequency = -1.0;
297 res->estimated_node_count = 0;
302 ir_graph *new_ir_graph(ir_entity *ent, int n_loc) {
303 ir_graph *res = new_r_ir_graph(ent, n_loc);
304 add_irp_irg(res); /* remember this graph global. */
308 /* Make a rudimentary IR graph for the constant code.
309 Must look like a correct irg, spare everything else. */
310 ir_graph *new_const_code_irg(void) {
312 ir_node *end, *start_block, *start, *projX;
316 /* inform statistics here, as blocks will be already build on this graph */
317 hook_new_graph(res, NULL);
319 current_ir_graph = res;
320 res->n_loc = 1; /* Only the memory. */
321 res->visited = 0; /* visited flag, for the ir walker */
322 res->block_visited = 0; /* visited flag, for the 'block'-walker */
323 #if USE_EXPLICIT_PHI_IN_STACK
324 res->Phi_in_stack = NULL;
326 res->obst = XMALLOC(struct obstack);
327 obstack_init (res->obst);
328 res->extbb_obst = NULL;
330 res->last_node_idx = 0;
332 res->phase_state = phase_building;
333 res->irg_pinned_state = op_pin_state_pinned;
334 res->extblk_state = ir_extblk_info_none;
335 res->fp_model = fp_model_precise;
337 res->value_table = new_identities(); /* value table for global value
338 numbering for optimizing use in
341 res->frame_type = NULL;
343 /* the Anchor node must be created first */
344 res->anchor = new_Anchor(res);
346 /* -- The end block -- */
347 set_irg_end_block (res, new_immBlock());
349 set_irg_end (res, end);
350 set_irg_end_reg (res, end);
351 set_irg_end_except(res, end);
352 mature_immBlock(get_cur_block()); /* mature the end block */
354 /* -- The start block -- */
355 start_block = new_immBlock();
356 set_irg_start_block(res, start_block);
357 set_irg_bad (res, new_ir_node (NULL, res, start_block, op_Bad, mode_T, 0, NULL));
358 set_irg_no_mem (res, new_ir_node (NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
360 set_irg_start (res, start);
362 /* Proj results of start node */
363 set_irg_initial_mem(res, new_Proj(start, mode_M, pn_Start_M));
364 projX = new_Proj(start, mode_X, pn_Start_X_initial_exec);
365 add_immBlock_pred(start_block, projX);
366 mature_immBlock (start_block); /* mature the start block */
368 add_immBlock_pred(new_immBlock(), projX);
369 mature_immBlock (get_cur_block()); /* mature the 'body' block for expressions */
371 /* Set the visited flag high enough that the blocks will never be visited. */
372 set_irn_visited(get_cur_block(), -1);
373 set_Block_block_visited(get_cur_block(), -1);
374 set_Block_block_visited(start_block, -1);
375 set_irn_visited(start_block, -1);
376 set_irn_visited(get_irg_bad(res), -1);
377 set_irn_visited(get_irg_no_mem(res), -1);
379 res->phase_state = phase_high;
385 * Pre-Walker: Copies blocks and nodes from the original method graph
386 * to the copied graph.
388 * @param n A node from the original method graph.
389 * @param env The copied graph.
391 static void copy_all_nodes(ir_node *n, void *env) {
393 ir_op *op = get_irn_op(n);
396 nn = new_ir_node(get_irn_dbg_info(n),
398 NULL, /* no block yet, will be set later */
405 /* Copy the attributes. These might point to additional data. If this
406 was allocated on the old obstack the pointers now are dangling. This
407 frees e.g. the memory of the graph_arr allocated in new_immBlock. */
408 copy_node_attr(n, nn);
409 new_backedge_info(nn);
412 /* fix the irg for blocks */
414 nn->attr.block.irg = irg;
416 /* fix access to entities on the stack frame */
418 ir_entity *ent = get_Sel_entity(nn);
419 ir_type *tp = get_entity_owner(ent);
421 if (is_frame_type(tp)) {
422 /* replace by the copied entity */
423 ent = get_entity_link(ent);
425 assert(is_entity(ent));
426 assert(get_entity_owner(ent) == get_irg_frame_type(irg));
427 set_Sel_entity(nn, ent);
433 * Post-walker: Set the predecessors of the copied nodes.
434 * The copied nodes are set as link of their original nodes. The links of
435 * "irn" predecessors are the predecessors of copied node.
437 static void set_all_preds(ir_node *irn, void *env) {
442 nn = get_irn_link(irn);
445 ir_node *mbh = get_Block_MacroBlock(irn);
446 set_Block_MacroBlock(nn, get_irn_link(mbh));
447 for (i = get_Block_n_cfgpreds(irn) - 1; i >= 0; i--) {
448 pred = get_Block_cfgpred(irn, i);
449 set_Block_cfgpred(nn, i, get_irn_link(pred));
452 /* First we set the block our copy if it is not a block.*/
453 set_nodes_block(nn, get_irn_link(get_nodes_block(irn)));
454 for (i = get_irn_arity(irn) - 1; i >= 0; i--) {
455 pred = get_irn_n(irn, i);
456 set_irn_n(nn, i, get_irn_link(pred));
461 #define NN(irn) get_irn_link(irn)
464 * Create a new graph that is a copy of a given one.
466 ir_graph *create_irg_copy(ir_graph *irg) {
472 res->visited = 0; /* visited flag, for the ir walker */
473 res->block_visited = 0; /* visited flag, for the 'block'-walker */
474 #if USE_EXPLICIT_PHI_IN_STACK
475 res->Phi_in_stack = NULL;
477 res->obst = XMALLOC(struct obstack);
478 obstack_init(res->obst);
479 res->extbb_obst = NULL;
481 res->last_node_idx = 0;
483 res->phase_state = irg->phase_state;
484 res->irg_pinned_state = irg->irg_pinned_state;
485 res->extblk_state = ir_extblk_info_none;
486 res->fp_model = irg->fp_model;
488 res->value_table = new_identities();
490 /* clone the frame type here for safety */
491 res->frame_type = clone_frame_type(irg->frame_type);
493 res->phase_state = irg->phase_state;
495 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
497 /* copy all nodes from the graph irg to the new graph res */
498 irg_walk_anchors(irg, copy_all_nodes, set_all_preds, res);
500 /* copy the Anchor node */
501 res->anchor = NN(irg->anchor);
503 /* -- The end block -- */
504 set_irg_end_block (res, NN(get_irg_end_block(irg)));
505 set_irg_end (res, NN(get_irg_end(irg)));
506 set_irg_end_reg (res, NN(get_irg_end_reg(irg)));
507 set_irg_end_except(res, NN(get_irg_end_except(irg)));
509 /* -- The start block -- */
510 set_irg_start_block(res, NN(get_irg_start_block(irg)));
511 set_irg_bad (res, NN(get_irg_bad(irg)));
512 set_irg_no_mem (res, NN(get_irg_no_mem(irg)));
513 set_irg_start (res, NN(get_irg_start(irg)));
515 /* Proj results of start node */
516 set_irg_initial_mem(res, NN(get_irg_initial_mem(irg)));
518 /* Copy the node count estimation. Would be strange if this
519 is different from the original one. */
520 res->estimated_node_count = irg->estimated_node_count;
522 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
529 /* Frees the passed irgraph.
530 Deallocates all nodes in this graph and the ir_graph structure.
531 Sets the field irgraph in the corresponding entity to NULL.
532 Does not remove the irgraph from the list in irprog (requires
533 inefficient search, call remove_irp_irg by hand).
534 Does not free types, entities or modes that are used only by this
535 graph, nor the entity standing for this graph. */
536 void free_ir_graph(ir_graph *irg) {
537 assert(is_ir_graph(irg));
539 edges_deactivate(irg);
541 hook_free_graph(irg);
542 if (irg->outs_state != outs_none)
545 free_type(irg->frame_type);
546 if (irg->value_table)
547 del_identities(irg->value_table);
549 ir_peculiarity pec = get_entity_peculiarity (irg->ent);
550 set_entity_peculiarity (irg->ent, peculiarity_description);
551 set_entity_irg(irg->ent, NULL); /* not set in const code irg */
552 set_entity_peculiarity (irg->ent, pec);
555 free_End(get_irg_end(irg));
556 obstack_free(irg->obst,NULL);
558 #if USE_EXPLICIT_PHI_IN_STACK
559 free_Phi_in_stack(irg->Phi_in_stack);
561 if (irg->loc_descriptions)
562 free(irg->loc_descriptions);
567 /* access routines for all ir_graph attributes:
569 {attr type} get_irg_{attribute name} (ir_graph *irg);
570 void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
573 (is_ir_graph)(const void *thing) {
574 return _is_ir_graph(thing);
578 /* Outputs a unique number for this node */
579 long get_irg_graph_nr(const ir_graph *irg) {
580 return irg->graph_nr;
583 long get_irg_graph_nr(const ir_graph *irg) {
584 return PTR_TO_INT(irg);
588 int get_irg_idx(const ir_graph *irg) {
593 (get_irg_start_block)(const ir_graph *irg) {
594 return _get_irg_start_block(irg);
598 (set_irg_start_block)(ir_graph *irg, ir_node *node) {
599 _set_irg_start_block(irg, node);
603 (get_irg_start)(const ir_graph *irg) {
604 return _get_irg_start(irg);
608 (set_irg_start)(ir_graph *irg, ir_node *node) {
609 _set_irg_start(irg, node);
613 (get_irg_end_block)(const ir_graph *irg) {
614 return _get_irg_end_block(irg);
618 (set_irg_end_block)(ir_graph *irg, ir_node *node) {
619 _set_irg_end_block(irg, node);
623 (get_irg_end)(const ir_graph *irg) {
624 return _get_irg_end(irg);
628 (set_irg_end)(ir_graph *irg, ir_node *node) {
629 _set_irg_end(irg, node);
633 (get_irg_end_reg)(const ir_graph *irg) {
634 return _get_irg_end_reg(irg);
638 (set_irg_end_reg)(ir_graph *irg, ir_node *node) {
639 _set_irg_end_reg(irg, node);
643 (get_irg_end_except)(const ir_graph *irg) {
644 return _get_irg_end_except(irg);
648 (set_irg_end_except)(ir_graph *irg, ir_node *node) {
649 assert(get_irn_op(node) == op_EndExcept || is_End(node));
650 _set_irg_end_except(irg, node);
654 (get_irg_initial_exec)(const ir_graph *irg) {
655 return _get_irg_initial_exec(irg);
659 (set_irg_initial_exec)(ir_graph *irg, ir_node *node) {
660 _set_irg_initial_exec(irg, node);
664 (get_irg_frame)(const ir_graph *irg) {
665 return _get_irg_frame(irg);
669 (set_irg_frame)(ir_graph *irg, ir_node *node) {
670 _set_irg_frame(irg, node);
674 (get_irg_tls)(const ir_graph *irg) {
675 return _get_irg_tls(irg);
679 (set_irg_tls)(ir_graph *irg, ir_node *node) {
680 _set_irg_tls(irg, node);
684 (get_irg_initial_mem)(const ir_graph *irg) {
685 return _get_irg_initial_mem(irg);
689 (set_irg_initial_mem)(ir_graph *irg, ir_node *node) {
690 _set_irg_initial_mem(irg, node);
694 (get_irg_args)(const ir_graph *irg) {
695 return _get_irg_args(irg);
699 (set_irg_args)(ir_graph *irg, ir_node *node) {
700 _set_irg_args(irg, node);
704 (get_irg_value_param_base)(const ir_graph *irg) {
705 return _get_irg_value_param_base(irg);
709 (set_irg_value_param_base)(ir_graph *irg, ir_node *node) {
710 _set_irg_value_param_base(irg, node);
714 (get_irg_bad)(const ir_graph *irg) {
715 return _get_irg_bad(irg);
719 (set_irg_bad)(ir_graph *irg, ir_node *node) {
720 _set_irg_bad(irg, node);
724 (get_irg_no_mem)(const ir_graph *irg) {
725 return _get_irg_no_mem(irg);
729 (set_irg_no_mem)(ir_graph *irg, ir_node *node) {
730 _set_irg_no_mem(irg, node);
734 (get_irg_current_block)(const ir_graph *irg) {
735 return _get_irg_current_block(irg);
739 (set_irg_current_block)(ir_graph *irg, ir_node *node) {
740 _set_irg_current_block(irg, node);
744 (get_irg_entity)(const ir_graph *irg) {
745 return _get_irg_entity(irg);
749 (set_irg_entity)(ir_graph *irg, ir_entity *ent) {
750 _set_irg_entity(irg, ent);
754 (get_irg_frame_type)(ir_graph *irg) {
755 return _get_irg_frame_type(irg);
759 (set_irg_frame_type)(ir_graph *irg, ir_type *ftp) {
760 _set_irg_frame_type(irg, ftp);
764 get_irg_n_locs(ir_graph *irg) {
765 if (get_opt_precise_exc_context())
766 return irg->n_loc - 1 - 1;
768 return irg->n_loc - 1;
772 set_irg_n_loc(ir_graph *irg, int n_loc) {
773 if (get_opt_precise_exc_context())
774 irg->n_loc = n_loc + 1 + 1;
776 irg->n_loc = n_loc + 1;
781 /* Returns the obstack associated with the graph. */
783 (get_irg_obstack)(const ir_graph *irg) {
784 return _get_irg_obstack(irg);
788 * Returns true if the node n is allocated on the storage of graph irg.
790 * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
792 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n) {
793 struct _obstack_chunk *p;
796 * checks weather the ir_node pointer is on the obstack.
797 * A more sophisticated check would test the "whole" ir_node
799 for (p = irg->obst->chunk; p; p = p->prev) {
800 if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
808 (get_irg_phase_state)(const ir_graph *irg) {
809 return _get_irg_phase_state(irg);
813 (set_irg_phase_state)(ir_graph *irg, irg_phase_state state) {
814 _set_irg_phase_state(irg, state);
818 (get_irg_pinned)(const ir_graph *irg) {
819 return _get_irg_pinned(irg);
823 (get_irg_outs_state)(const ir_graph *irg) {
824 return _get_irg_outs_state(irg);
828 (set_irg_outs_inconsistent)(ir_graph *irg) {
829 _set_irg_outs_inconsistent(irg);
833 (get_irg_extblk_state)(const ir_graph *irg) {
834 return _get_irg_extblk_state(irg);
838 (set_irg_extblk_inconsistent)(ir_graph *irg) {
839 _set_irg_extblk_inconsistent(irg);
843 (get_irg_dom_state)(const ir_graph *irg) {
844 return _get_irg_dom_state(irg);
848 (get_irg_postdom_state)(const ir_graph *irg) {
849 return _get_irg_postdom_state(irg);
853 (set_irg_doms_inconsistent)(ir_graph *irg) {
854 _set_irg_doms_inconsistent(irg);
858 (get_irg_loopinfo_state)(const ir_graph *irg) {
859 return _get_irg_loopinfo_state(irg);
863 (set_irg_loopinfo_state)(ir_graph *irg, irg_loopinfo_state s) {
864 _set_irg_loopinfo_state(irg, s);
868 (set_irg_loopinfo_inconsistent)(ir_graph *irg) {
869 _set_irg_loopinfo_inconsistent(irg);
872 void set_irp_loopinfo_inconsistent(void) {
874 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
875 set_irg_loopinfo_inconsistent(get_irp_irg(i));
882 (set_irg_pinned)(ir_graph *irg, op_pin_state p) {
883 _set_irg_pinned(irg, p);
886 irg_callee_info_state
887 (get_irg_callee_info_state)(const ir_graph *irg) {
888 return _get_irg_callee_info_state(irg);
892 (set_irg_callee_info_state)(ir_graph *irg, irg_callee_info_state s) {
893 _set_irg_callee_info_state(irg, s);
897 (get_irg_inline_property)(const ir_graph *irg) {
898 return _get_irg_inline_property(irg);
902 (set_irg_inline_property)(ir_graph *irg, irg_inline_property s) {
903 _set_irg_inline_property(irg, s);
907 (get_irg_additional_properties)(const ir_graph *irg) {
908 return _get_irg_additional_properties(irg);
912 (set_irg_additional_properties)(ir_graph *irg, unsigned property_mask) {
913 _set_irg_additional_properties(irg, property_mask);
917 (set_irg_additional_property)(ir_graph *irg, mtp_additional_property flag) {
918 _set_irg_additional_property(irg, flag);
922 (set_irg_link)(ir_graph *irg, void *thing) {
923 _set_irg_link(irg, thing);
927 (get_irg_link)(const ir_graph *irg) {
928 return _get_irg_link(irg);
932 (get_irg_visited)(const ir_graph *irg) {
933 return _get_irg_visited(irg);
936 #ifdef INTERPROCEDURAL_VIEW
937 /** maximum visited flag content of all ir_graph visited fields. */
938 static ir_visited_t max_irg_visited = 0;
939 #endif /* INTERPROCEDURAL_VIEW */
942 set_irg_visited(ir_graph *irg, ir_visited_t visited) {
943 irg->visited = visited;
944 #ifdef INTERPROCEDURAL_VIEW
945 if (irg->visited > max_irg_visited) {
946 max_irg_visited = irg->visited;
948 #endif /* INTERPROCEDURAL_VIEW */
952 inc_irg_visited(ir_graph *irg) {
953 #ifdef INTERPROCEDURAL_VIEW
954 if (++irg->visited > max_irg_visited) {
955 max_irg_visited = irg->visited;
959 #endif /* INTERPROCEDURAL_VIEW */
962 #ifdef INTERPROCEDURAL_VIEW
964 get_max_irg_visited(void) {
967 for(i = 0; i < get_irp_n_irgs(); i++)
968 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
970 return max_irg_visited;
973 void set_max_irg_visited(int val) {
974 max_irg_visited = val;
978 inc_max_irg_visited(void) {
981 for(i = 0; i < get_irp_n_irgs(); i++)
982 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
984 return ++max_irg_visited;
986 #endif /* INTERPROCEDURAL_VIEW */
989 (get_irg_block_visited)(const ir_graph *irg) {
990 return _get_irg_block_visited(irg);
994 (set_irg_block_visited)(ir_graph *irg, ir_visited_t visited) {
995 _set_irg_block_visited(irg, visited);
999 (inc_irg_block_visited)(ir_graph *irg) {
1000 _inc_irg_block_visited(irg);
1003 /* Return the floating point model of this graph. */
1004 unsigned (get_irg_fp_model)(const ir_graph *irg) {
1005 return _get_irg_fp_model(irg);
1008 /* Sets the floating point model for this graph. */
1009 void set_irg_fp_model(ir_graph *irg, unsigned model) {
1010 irg->fp_model = model;
1014 * walker Start->End: places Proj nodes into the same block
1015 * as it's predecessors
1018 * @param env ignored
1020 static void normalize_proj_walker(ir_node *n, void *env) {
1023 ir_node *pred = get_Proj_pred(n);
1024 ir_node *block = get_nodes_block(pred);
1026 set_nodes_block(n, block);
1030 /* move Proj nodes into the same block as its predecessors */
1031 void normalize_proj_nodes(ir_graph *irg) {
1032 irg_walk_graph(irg, NULL, normalize_proj_walker, NULL);
1033 set_irg_outs_inconsistent(irg);
1036 /* set a description for local value n */
1037 void set_irg_loc_description(ir_graph *irg, int n, void *description) {
1038 assert(0 <= n && n < irg->n_loc);
1040 if (! irg->loc_descriptions)
1041 irg->loc_descriptions = XMALLOCNZ(void*, irg->n_loc);
1043 irg->loc_descriptions[n] = description;
1046 /* get the description for local value n */
1047 void *get_irg_loc_description(ir_graph *irg, int n) {
1048 assert(0 <= n && n < irg->n_loc);
1049 return irg->loc_descriptions ? irg->loc_descriptions[n] : NULL;
1053 void ir_reserve_resources(ir_graph *irg, ir_resources_t resources) {
1054 assert((irg->reserved_resources & resources) == 0);
1055 irg->reserved_resources |= resources;
1058 void ir_free_resources(ir_graph *irg, ir_resources_t resources) {
1059 assert((irg->reserved_resources & resources) == resources);
1060 irg->reserved_resources &= ~resources;
1063 ir_resources_t ir_resources_reserved(const ir_graph *irg) {
1064 return irg->reserved_resources;
1068 /* Returns a estimated node count of the irg. */
1069 unsigned (get_irg_estimated_node_cnt)(const ir_graph *irg) {
1070 return _get_irg_estimated_node_cnt(irg);
1073 /* Returns the last irn index for this graph. */
1074 unsigned get_irg_last_idx(const ir_graph *irg) {
1075 return irg->last_node_idx;
1078 /* register additional space in an IR graph */
1079 size_t register_additional_graph_data(size_t size) {
1080 assert(!forbid_new_data && "Too late to register additional node data");
1082 if (forbid_new_data)
1085 return additional_graph_data_size += size;