3 * File name: ir/ir/irgraph.c
4 * Purpose: Entry point to the representation of procedure code.
5 * Author: Martin Trapp, Christian Schaefer
6 * Modified by: Goetz Lindenmaier
9 * Copyright: (c) 1998-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
25 # include "irgraph_t.h"
26 # include "irprog_t.h"
27 # include "irnode_t.h"
29 # include "irflag_t.h"
36 # include "iredges_t.h"
39 * Indicates, whether additional data can be registered to graphs.
40 * If set to 1, this is not possible anymore.
42 static int forbid_new_data = 0;
45 * The amount of additional space for custom data to be allocated upon
46 * creating a new graph.
48 static size_t additional_graph_data_size = 0;
50 ir_graph *current_ir_graph;
51 ir_graph *get_current_ir_graph(void) {
52 return current_ir_graph;
54 void set_current_ir_graph(ir_graph *graph) {
55 current_ir_graph = graph;
59 int __interprocedural_view = false;
61 int (get_interprocedural_view)(void) {
62 return _get_interprocedural_view();
65 void (set_interprocedural_view)(int state) {
66 __interprocedural_view = state;
68 /* set function vectors for faster access */
70 _get_irn_arity = _get_irn_inter_arity;
71 _get_irn_n = _get_irn_inter_n;
74 _get_irn_arity = _get_irn_intra_arity;
75 _get_irn_n = _get_irn_intra_n;
79 /** contains the suffix for frame type names */
80 static ident *frame_type_suffix = NULL;
82 /* initialize the IR graph module */
83 void init_irgraph(void) {
84 frame_type_suffix = new_id_from_str(FRAME_TP_SUFFIX);
89 * Allocate a new IR graph.
90 * This function respects the registered graph data. The only reason for
91 * this function is, that there are two locations, where graphs are
92 * allocated (new_r_ir_graph, new_const_code_irg).
93 * @return Memory for a new graph.
95 static ir_graph *alloc_graph(void) {
96 size_t size = sizeof(ir_graph) + additional_graph_data_size;
97 char *ptr = xmalloc(size);
100 return (ir_graph *) (ptr + additional_graph_data_size);
104 * Frees an allocated IR graph
106 static void free_graph(ir_graph *irg) {
107 char *ptr = (char *)irg;
108 free(ptr - additional_graph_data_size);
111 #if USE_EXPLICIT_PHI_IN_STACK
112 /* really defined in ircons.c */
113 typedef struct Phi_in_stack Phi_in_stack;
114 Phi_in_stack *new_Phi_in_stack();
115 void free_Phi_in_stack(Phi_in_stack *s);
118 /* Allocates a list of nodes:
119 - The start block containing a start node and Proj nodes for it's four
120 results (X, M, P, Tuple).
121 - The end block containing an end node. This block is not matured after
122 new_ir_graph as predecessors need to be added to it.
123 - The current block, which is empty and also not matured.
124 Further it allocates several datastructures needed for graph construction
128 new_r_ir_graph (entity *ent, int n_loc)
131 ir_node *first_block;
135 res->kind = k_ir_graph;
137 edges_init_graph(res);
139 /* inform statistics here, as blocks will be already build on this graph */
140 hook_new_graph(res, ent);
142 current_ir_graph = res;
144 /*-- initialized for each graph. --*/
145 if (get_opt_precise_exc_context()) {
146 res->n_loc = n_loc + 1 + 1; /* number of local variables that are never
147 dereferenced in this graph plus one for
148 the store plus one for links to fragile
149 operations. n_loc is not the number of
150 parameters to the procedure! */
153 res->n_loc = n_loc + 1; /* number of local variables that are never
154 dereferenced in this graph plus one for
155 the store. This is not the number of parameters
159 /* descriptions will be allocated on demand */
160 res->loc_descriptions = NULL;
162 res->visited = 0; /* visited flag, for the ir walker */
163 res->block_visited = 0; /* visited flag, for the 'block'-walker */
165 #if USE_EXPLICIT_PHI_IN_STACK
166 res->Phi_in_stack = new_Phi_in_stack(); /* A stack needed for automatic Phi
169 res->kind = k_ir_graph;
170 res->obst = xmalloc (sizeof(*res->obst));
171 obstack_init(res->obst);
172 res->extbb_obst = NULL;
174 res->value_table = new_identities (); /* value table for global value
175 numbering for optimizing use in
179 res->phase_state = phase_building;
180 res->op_pin_state_pinned = op_pin_state_pinned;
181 res->outs_state = outs_none;
182 res->dom_state = dom_none;
183 res->typeinfo_state = ir_typeinfo_none;
184 set_irp_typeinfo_inconsistent(); /* there is a new graph with typeinfo_none. */
185 res->loopinfo_state = loopinfo_none;
186 res->class_cast_state = ir_class_casts_transitive;
187 res->extblk_state = ir_extblk_info_none;
189 /*-- Type information for the procedure of the graph --*/
191 set_entity_irg(ent, res);
193 /*-- a class type so that it can contain "inner" methods as in Pascal. --*/
194 res->frame_type = new_type_frame(mangle(get_entity_ident(ent), frame_type_suffix));
196 /*-- Nodes needed in every graph --*/
197 res->end_block = new_immBlock();
198 res->end = new_End();
199 res->end_reg = res->end;
200 res->end_except = res->end;
202 res->start_block = new_immBlock();
203 res->start = new_Start();
204 res->bad = new_ir_node(NULL, res, res->start_block, op_Bad, mode_T, 0, NULL);
205 res->no_mem = new_ir_node(NULL, res, res->start_block, op_NoMem, mode_M, 0, NULL);
207 /* Proj results of start node */
208 projX = new_Proj (res->start, mode_X, pn_Start_X_initial_exec);
209 res->frame = new_Proj (res->start, mode_P_data, pn_Start_P_frame_base);
210 res->globals = new_Proj (res->start, mode_P_data, pn_Start_P_globals);
211 res->initial_mem = new_Proj (res->start, mode_M, pn_Start_M);
212 res->args = new_Proj (res->start, mode_T, pn_Start_T_args);
214 res->graph_nr = get_irp_new_node_nr();
216 res->proj_args = NULL;
218 set_store(res->initial_mem);
220 add_immBlock_pred(res->start_block, projX);
222 * The code generation needs it. leave it in now.
223 * Use of this edge is matter of discussion, unresolved. Also possible:
224 * add_immBlock_pred(res->start_block, res->start_block), but invalid typed.
226 mature_immBlock (res->current_block);
228 /*-- Make a block to start with --*/
229 first_block = new_immBlock();
230 add_immBlock_pred (first_block, projX);
232 res->method_execution_frequency = -1;
239 new_ir_graph (entity *ent, int n_loc)
241 ir_graph *res = new_r_ir_graph (ent, n_loc);
242 add_irp_irg(res); /* remember this graph global. */
246 /* Make a rudimentary ir graph for the constant code.
247 Must look like a correct irg, spare everything else. */
248 ir_graph *new_const_code_irg(void) {
254 /* inform statistics here, as blocks will be already build on this graph */
255 hook_new_graph(res, NULL);
257 current_ir_graph = res;
258 res->n_loc = 1; /* Only the memory. */
259 res->visited = 0; /* visited flag, for the ir walker */
260 res->block_visited=0; /* visited flag, for the 'block'-walker */
261 #if USE_EXPLICIT_PHI_IN_STACK
262 res->Phi_in_stack = NULL;
264 res->kind = k_ir_graph;
265 res->obst = xmalloc (sizeof(*res->obst));
266 obstack_init (res->obst);
267 res->extbb_obst = NULL;
269 res->phase_state = phase_building;
270 res->op_pin_state_pinned = op_pin_state_pinned;
271 res->extblk_state = ir_extblk_info_none;
273 res->value_table = new_identities (); /* value table for global value
274 numbering for optimizing use in
277 res->frame_type = NULL;
279 /* -- The end block -- */
280 res->end_block = new_immBlock ();
281 res->end = new_End ();
282 res->end_reg = res->end;
283 res->end_except = res->end;
284 mature_immBlock(get_cur_block()); /* mature the end block */
286 /* -- The start block -- */
287 res->start_block = new_immBlock ();
288 res->bad = new_ir_node (NULL, res, res->start_block, op_Bad, mode_T, 0, NULL);
289 res->no_mem = new_ir_node (NULL, res, res->start_block, op_NoMem, mode_M, 0, NULL);
290 res->start = new_Start ();
291 /* Proj results of start node */
292 res->initial_mem = new_Proj (res->start, mode_M, pn_Start_M);
293 projX = new_Proj (res->start, mode_X, pn_Start_X_initial_exec);
294 add_immBlock_pred (res->start_block, projX);
295 mature_immBlock (res->start_block); /* mature the start block */
297 add_immBlock_pred (new_immBlock (), projX);
298 mature_immBlock (get_cur_block()); /* mature the 'body' block for expressions */
300 /* Set the visited flag high enough that the blocks will never be visited. */
301 set_irn_visited(get_cur_block(), -1);
302 set_Block_block_visited(get_cur_block(), -1);
303 set_Block_block_visited(res->start_block, -1);
304 set_irn_visited(res->start_block, -1);
305 set_irn_visited(res->bad, -1);
306 set_irn_visited(res->no_mem, -1);
308 res->phase_state = phase_high;
313 /* Defined in iropt.c */
314 void del_identities (pset *value_table);
316 /* Frees the passed irgraph.
317 Deallocates all nodes in this graph and the ir_graph structure.
318 Sets the field irgraph in the corresponding entity to NULL.
319 Does not remove the irgraph from the list in irprog (requires
320 inefficient search, call remove_irp_irg by hand).
321 Does not free types, entities or modes that are used only by this
322 graph, nor the entity standing for this graph. */
323 void free_ir_graph (ir_graph *irg) {
324 assert(is_ir_graph(irg));
326 hook_free_graph(irg);
327 if (irg->outs_state != outs_none) free_irg_outs(irg);
328 if (irg->frame_type) free_type(irg->frame_type);
329 if (irg->value_table) del_identities(irg->value_table);
331 peculiarity pec = get_entity_peculiarity (irg->ent);
332 set_entity_peculiarity (irg->ent, peculiarity_description);
333 set_entity_irg(irg->ent, NULL); /* not set in const code irg */
334 set_entity_peculiarity (irg->ent, pec);
338 obstack_free(irg->obst,NULL);
340 #if USE_EXPLICIT_PHI_IN_STACK
341 free_Phi_in_stack(irg->Phi_in_stack);
343 if (irg->loc_descriptions)
344 free(irg->loc_descriptions);
349 /* access routines for all ir_graph attributes:
351 {attr type} get_irg_{attribute name} (ir_graph *irg);
352 void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
355 (is_ir_graph)(const void *thing) {
356 return _is_ir_graph(thing);
359 /* Outputs a unique number for this node */
362 get_irg_graph_nr(ir_graph *irg) {
365 return irg->graph_nr;
372 (get_irg_start_block)(const ir_graph *irg) {
373 return _get_irg_start_block(irg);
377 (set_irg_start_block)(ir_graph *irg, ir_node *node) {
378 _set_irg_start_block(irg, node);
382 (get_irg_start)(const ir_graph *irg) {
383 return _get_irg_start(irg);
387 (set_irg_start)(ir_graph *irg, ir_node *node) {
388 _set_irg_start(irg, node);
392 (get_irg_end_block)(const ir_graph *irg) {
393 return _get_irg_end_block(irg);
397 (set_irg_end_block)(ir_graph *irg, ir_node *node) {
398 _set_irg_end_block(irg, node);
402 (get_irg_end)(const ir_graph *irg) {
403 return _get_irg_end(irg);
407 (set_irg_end)(ir_graph *irg, ir_node *node) {
408 _set_irg_end(irg, node);
412 (get_irg_end_reg)(const ir_graph *irg) {
413 return _get_irg_end_reg(irg);
416 void set_irg_end_reg (ir_graph *irg, ir_node *node) {
417 assert(get_irn_op(node) == op_EndReg || get_irn_op(node) == op_End);
422 (get_irg_end_except)(const ir_graph *irg) {
423 return _get_irg_end_except(irg);
426 void set_irg_end_except (ir_graph *irg, ir_node *node) {
427 assert(get_irn_op(node) == op_EndExcept || get_irn_op(node) == op_End);
428 irg->end_except = node;
432 (get_irg_cstore)(const ir_graph *irg) {
433 return _get_irg_cstore(irg);
437 (set_irg_cstore)(ir_graph *irg, ir_node *node) {
438 _set_irg_cstore(irg, node);
442 (get_irg_frame)(const ir_graph *irg) {
443 return _get_irg_frame(irg);
447 (set_irg_frame)(ir_graph *irg, ir_node *node) {
448 _set_irg_frame(irg, node);
452 (get_irg_globals)(const ir_graph *irg) {
453 return _get_irg_globals(irg);
457 (set_irg_globals)(ir_graph *irg, ir_node *node) {
458 _set_irg_globals(irg, node);
462 (get_irg_initial_mem)(const ir_graph *irg) {
463 return _get_irg_initial_mem(irg);
467 (set_irg_initial_mem)(ir_graph *irg, ir_node *node) {
468 _set_irg_initial_mem(irg, node);
472 (get_irg_args)(const ir_graph *irg) {
473 return _get_irg_args(irg);
477 (set_irg_args)(ir_graph *irg, ir_node *node) {
478 _set_irg_args(irg, node);
482 (get_irg_proj_args) (const ir_graph *irg) {
483 return _get_irg_proj_args (irg);
487 (set_irg_proj_args) (ir_graph *irg, ir_node **nodes) {
488 _set_irg_proj_args (irg, nodes);
492 (get_irg_bad)(const ir_graph *irg) {
493 return _get_irg_bad(irg);
497 (set_irg_bad)(ir_graph *irg, ir_node *node) {
498 _set_irg_bad(irg, node);
502 (get_irg_no_mem)(const ir_graph *irg) {
503 return _get_irg_no_mem(irg);
507 (set_irg_no_mem)(ir_graph *irg, ir_node *node) {
508 _set_irg_no_mem(irg, node);
512 (get_irg_current_block)(const ir_graph *irg) {
513 return _get_irg_current_block(irg);
517 (set_irg_current_block)(ir_graph *irg, ir_node *node) {
518 _set_irg_current_block(irg, node);
522 (get_irg_entity)(const ir_graph *irg) {
523 return _get_irg_entity(irg);
527 (set_irg_entity)(ir_graph *irg, entity *ent) {
528 _set_irg_entity(irg, ent);
532 (get_irg_frame_type)(ir_graph *irg) {
533 return _get_irg_frame_type(irg);
537 (set_irg_frame_type)(ir_graph *irg, type *ftp) {
538 _set_irg_frame_type(irg, ftp);
542 get_irg_n_locs (ir_graph *irg)
544 if (get_opt_precise_exc_context())
545 return irg->n_loc - 1 - 1;
547 return irg->n_loc - 1;
551 set_irg_n_loc (ir_graph *irg, int n_loc)
553 if (get_opt_precise_exc_context())
554 irg->n_loc = n_loc + 1 + 1;
556 irg->n_loc = n_loc + 1;
561 /* Returns the obstack associated with the graph. */
563 (get_irg_obstack)(const ir_graph *irg) {
564 return _get_irg_obstack(irg);
568 * Returns true if the node n is allocated on the storage of graph irg.
570 * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
572 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n)
574 struct _obstack_chunk *p;
577 * checks weather the ir_node pointer is on the obstack.
578 * A more sophisticated check would test the "whole" ir_node
580 for (p = irg->obst->chunk; p; p = p->prev) {
581 if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
589 (get_irg_phase_state)(const ir_graph *irg) {
590 return _get_irg_phase_state(irg);
594 (set_irg_phase_low)(ir_graph *irg) {
595 _set_irg_phase_low(irg);
599 (get_irg_pinned)(const ir_graph *irg) {
600 return _get_irg_pinned(irg);
604 (get_irg_outs_state)(const ir_graph *irg) {
605 return _get_irg_outs_state(irg);
609 (set_irg_outs_inconsistent)(ir_graph *irg) {
610 _set_irg_outs_inconsistent(irg);
614 (get_irg_dom_state)(const ir_graph *irg) {
615 return _get_irg_dom_state(irg);
619 (set_irg_dom_inconsistent)(ir_graph *irg) {
620 _set_irg_dom_inconsistent(irg);
624 (get_irg_loopinfo_state)(const ir_graph *irg) {
625 return _get_irg_loopinfo_state(irg);
629 (set_irg_loopinfo_state)(ir_graph *irg, irg_loopinfo_state s) {
630 _set_irg_loopinfo_state(irg, s);
634 (set_irg_loopinfo_inconsistent)(ir_graph *irg) {
635 _set_irg_loopinfo_inconsistent(irg);
638 void set_irp_loopinfo_inconsistent(void) {
639 int i, n_irgs = get_irp_n_irgs();
640 for (i = 0; i < n_irgs; ++i) {
641 set_irg_loopinfo_inconsistent(get_irp_irg(i));
648 (set_irg_pinned)(ir_graph *irg, op_pin_state p) {
649 _set_irg_pinned(irg, p);
652 irg_callee_info_state
653 (get_irg_callee_info_state)(const ir_graph *irg) {
654 return _get_irg_callee_info_state(irg);
658 (set_irg_callee_info_state)(ir_graph *irg, irg_callee_info_state s) {
659 _set_irg_callee_info_state(irg, s);
663 (get_irg_inline_property)(const ir_graph *irg) {
664 return _get_irg_inline_property(irg);
668 (set_irg_inline_property)(ir_graph *irg, irg_inline_property s) {
669 _set_irg_inline_property(irg, s);
673 (set_irg_link)(ir_graph *irg, void *thing) {
674 _set_irg_link(irg, thing);
678 (get_irg_link)(const ir_graph *irg) {
679 return _get_irg_link(irg);
682 /** maximum visited flag content of all ir_graph visited fields. */
683 static unsigned long max_irg_visited = 0;
686 (get_irg_visited)(const ir_graph *irg) {
687 return _get_irg_visited(irg);
691 set_irg_visited (ir_graph *irg, unsigned long visited)
693 irg->visited = visited;
694 if (irg->visited > max_irg_visited) {
695 max_irg_visited = irg->visited;
700 inc_irg_visited (ir_graph *irg)
702 if (++irg->visited > max_irg_visited) {
703 max_irg_visited = irg->visited;
708 get_max_irg_visited(void)
712 for(i = 0; i < get_irp_n_irgs(); i++)
713 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
715 return max_irg_visited;
718 void set_max_irg_visited(int val) {
719 max_irg_visited = val;
723 inc_max_irg_visited(void)
727 for(i = 0; i < get_irp_n_irgs(); i++)
728 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
731 return max_irg_visited;
735 (get_irg_block_visited)(const ir_graph *irg) {
736 return _get_irg_block_visited(irg);
740 (set_irg_block_visited)(ir_graph *irg, unsigned long visited) {
741 _set_irg_block_visited(irg, visited);
745 (inc_irg_block_visited)(ir_graph *irg) {
746 _inc_irg_block_visited(irg);
751 * walker Start->End: places Proj nodes into the same block
752 * as it's predecessors
757 static void normalize_proj_walker(ir_node *n, void *env)
760 ir_node *pred = get_Proj_pred(n);
761 ir_node *block = get_nodes_block(pred);
763 set_nodes_block(n, block);
767 /* move Proj nodes into the same block as its predecessors */
768 void normalize_proj_nodes(ir_graph *irg)
770 irg_walk_graph(irg, NULL, normalize_proj_walker, NULL);
771 set_irg_outs_inconsistent(irg);
774 /* set a description for local value n */
775 void set_irg_loc_description(ir_graph *irg, int n, void *description)
777 assert(0 <= n && n < irg->n_loc);
779 if (! irg->loc_descriptions)
780 irg->loc_descriptions = xcalloc(sizeof(*irg->loc_descriptions), irg->n_loc);
782 irg->loc_descriptions[n] = description;
785 /* get the description for local value n */
786 void *get_irg_loc_description(ir_graph *irg, int n)
788 assert(0 <= n && n < irg->n_loc);
789 return irg->loc_descriptions ? irg->loc_descriptions[n] : NULL;
792 /* register additional space in an IR graph */
793 size_t register_additional_graph_data(size_t size)
795 assert(!forbid_new_data && "Too late to register additional node data");
800 return additional_graph_data_size += size;