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.
20 # include "irgraph_t.h"
21 # include "irprog_t.h"
27 ir_graph *current_ir_graph;
28 INLINE ir_graph *get_current_ir_graph(void) {
29 return current_ir_graph;
31 INLINE void set_current_ir_graph(ir_graph *graph) {
32 current_ir_graph = graph;
36 bool interprocedural_view = false;
37 INLINE bool get_interprocedural_view(void) {
38 return interprocedural_view;
40 INLINE void set_interprocedural_view(bool state) {
41 interprocedural_view = state;
44 static ident* frame_type_suffix = NULL;
45 void init_irgraph(void) {
46 frame_type_suffix = id_from_str(FRAME_TP_SUFFIX, strlen(FRAME_TP_SUFFIX));
49 #if USE_EXPLICIT_PHI_IN_STACK
50 /* really defined in ircons.c */
51 typedef struct Phi_in_stack Phi_in_stack;
52 Phi_in_stack *new_Phi_in_stack();
53 void free_Phi_in_stack(Phi_in_stack *s);
56 /* Allocates a list of nodes:
57 - The start block containing a start node and Proj nodes for it's four
58 results (X, M, P, Tuple).
59 - The end block containing an end node. This block is not matured after
60 new_ir_graph as predecessors need to be added to it.
61 - The current block, which is empty and also not matured.
62 Further it allocates several datastructures needed for graph construction
66 new_ir_graph (entity *ent, int n_loc)
72 res = (ir_graph *) malloc (sizeof (ir_graph));
75 current_ir_graph = res;
76 add_irp_irg(res); /* remember this graph global. */
79 * initialized for each graph. **/
80 #if PRECISE_EXC_CONTEXT
81 res->n_loc = n_loc + 1 + 1; /* number of local variables that are never
82 dereferenced in this graph plus one for
83 the store plus one for links to fragile
84 operations. n_loc is not the number of
85 parameters to the procedure! */
87 res->n_loc = n_loc + 1; /* number of local variables that are never
88 dereferenced in this graph plus one for
89 the store. This is not the number of parameters
93 res->visited = 0; /* visited flag, for the ir walker */
94 res->block_visited=0; /* visited flag, for the 'block'-walker */
96 #if USE_EXPLICIT_PHI_IN_STACK
97 res->Phi_in_stack = new_Phi_in_stack(); /* A stack needed for automatic Phi
100 res->kind = k_ir_graph;
101 res->obst = (struct obstack *) xmalloc (sizeof (struct obstack));
102 obstack_init (res->obst);
103 res->value_table = new_identities (); /* value table for global value
104 numbering for optimizing use in
108 res->phase_state = phase_building;
109 res->pinned = pinned;
110 res->outs_state = no_outs;
111 res->dom_state = no_dom;
113 /** Type information for the procedure of the graph **/
115 set_entity_irg(ent, res);
118 contain "inner" methods as in Pascal. **/
119 res->frame_type = new_type_class(mangle(get_entity_ident(ent), frame_type_suffix));
120 /* Remove type from type list. Must be treated differently than other types. */
121 remove_irp_type_from_list(res->frame_type);
123 /** Nodes needed in every graph **/
124 res->end_block = new_immBlock ();
125 res->end = new_End ();
127 res->start_block = new_immBlock ();
128 res->start = new_Start ();
129 res->bad = new_ir_node (NULL, res, res->start_block, op_Bad, mode_T, 0, NULL);
130 res->unknown = new_ir_node (NULL, res, res->start_block, op_Unknown, mode_T, 0, NULL);
132 /* Proj results of start node */
133 projX = new_Proj (res->start, mode_X, pns_initial_exec);
134 set_store (new_Proj (res->start, mode_M, pns_global_store));
135 res->frame = new_Proj (res->start, mode_P_mach, pns_frame_base);
136 res->globals = new_Proj (res->start, mode_P_mach, pns_globals);
137 res->args = new_Proj (res->start, mode_T, pns_args);
139 res->graph_nr = get_irp_new_node_nr();
143 add_in_edge(res->start_block, projX);
145 * The code generation needs it. leave it in now.
146 * Use of this edge is matter of discussion, unresolved. Also possible:
147 * add_in_edge(res->start_block, res->start_block), but invalid typed.
149 mature_block (res->current_block);
151 /** Make a block to start with **/
152 first_block = new_immBlock ();
153 add_in_edge (first_block, projX);
159 /* Make a rudimentary ir graph for the constant code.
160 Must look like a correct irg, spare everything else. */
161 ir_graph *new_const_code_irg() {
165 res = (ir_graph *) malloc (sizeof (ir_graph));
166 current_ir_graph = res;
167 res->n_loc = 1; /* Only the memory. */
168 res->visited = 0; /* visited flag, for the ir walker */
169 res->block_visited=0; /* visited flag, for the 'block'-walker */
170 #if USE_EXPLICIT_PHI_IN_STACK
171 res->Phi_in_stack = NULL;
173 res->kind = k_ir_graph;
174 res->obst = (struct obstack *) xmalloc (sizeof (struct obstack));
175 obstack_init (res->obst);
176 res->phase_state = phase_building;
177 res->pinned = pinned;
178 res->value_table = new_identities (); /* value table for global value
179 numbering for optimizing use in
182 res->frame_type = NULL;
183 res->start_block = new_immBlock ();
184 res->end_block = new_immBlock ();
185 res->end = new_End ();
186 mature_block(get_cur_block());
187 res->bad = new_ir_node (NULL, res, res->start_block, op_Bad, mode_T, 0, NULL);
188 res->unknown = new_ir_node (NULL, res, res->start_block, op_Unknown, mode_T, 0, NULL);
189 res->start = new_Start ();
191 /* Proj results of start node */
192 projX = new_Proj (res->start, mode_X, pns_initial_exec);
193 set_store (new_Proj (res->start, mode_M, pns_global_store));
194 add_in_edge(res->start_block, projX);
195 mature_block (res->current_block);
196 add_in_edge (new_immBlock (), projX);
197 mature_block(get_cur_block());
198 /* Set the visited flag high enough that the block will never be visited. */
199 set_irn_visited(get_cur_block(), -1);
200 set_Block_block_visited(get_cur_block(), -1);
201 set_Block_block_visited(res->start_block, -1);
205 /* Frees the passed irgraph.
206 Deallocates all nodes in this graph and the ir_graph structure.
207 Sets the field irgraph in the corresponding entity to NULL.
208 Does not remove the irgraph from the list in irprog (requires
209 inefficient search, call remove_irp_irg by hand).
210 Does not free types, entities or modes that are used only by this
211 graph, nor the entity standing for this graph. */
212 void free_ir_graph (ir_graph *irg) {
213 set_entity_irg(irg->ent, NULL);
215 #if USE_EXPLICIT_PHI_IN_STACK
216 free_Phi_in_stack(irg->Phi_in_stack);
221 /* access routines for all ir_graph attributes:
223 {attr type} get_irg_{attribute name} (ir_graph *irg);
224 void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
227 is_ir_graph(void *thing) {
229 if (get_kind(thing) == k_ir_graph)
235 /* Outputs a unique number for this node */
238 get_irg_graph_nr(ir_graph *irg) {
241 return irg->graph_nr;
248 get_irg_start_block (ir_graph *irg)
250 return irg->start_block;
254 set_irg_start_block (ir_graph *irg, ir_node *node)
256 irg->start_block = node;
260 get_irg_start (ir_graph *irg)
266 set_irg_start(ir_graph *irg, ir_node *node)
272 get_irg_end_block (ir_graph *irg)
274 return irg->end_block;
278 set_irg_end_block (ir_graph *irg, ir_node *node)
280 irg->end_block = node;
284 get_irg_end (ir_graph *irg)
290 set_irg_end (ir_graph *irg, ir_node *node)
296 get_irg_cstore (ir_graph *irg)
302 set_irg_cstore (ir_graph *irg, ir_node *node)
308 get_irg_frame (ir_graph *irg)
314 set_irg_frame (ir_graph *irg, ir_node *node)
320 get_irg_globals (ir_graph *irg)
326 set_irg_globals (ir_graph *irg, ir_node *node)
332 get_irg_args (ir_graph *irg)
338 set_irg_args (ir_graph *irg, ir_node *node)
344 get_irg_bad (ir_graph *irg)
350 set_irg_bad (ir_graph *irg, ir_node *node)
356 get_irg_unknown (ir_graph *irg)
362 set_irg_unknown (ir_graph *irg, ir_node *node)
368 get_irg_current_block (ir_graph *irg)
370 return irg->current_block;
374 set_irg_current_block (ir_graph *irg, ir_node *node)
376 irg->current_block = node;
380 get_irg_ent (ir_graph *irg)
382 assert(irg && irg->ent);
387 set_irg_ent (ir_graph *irg, entity *ent)
393 get_irg_frame_type (ir_graph *irg)
395 assert(irg && irg->frame_type);
396 return irg->frame_type;
400 set_irg_frame_type (ir_graph *irg, type *ftp)
402 assert(is_class_type(ftp));
403 irg->frame_type = ftp;
407 /* To test for a frame type */
409 is_frame_type(type *ftp) {
411 if (is_class_type(ftp)) {
412 for (i = 0; i < get_irp_n_irgs(); i++) {
413 type *frame_tp = get_irg_frame_type(get_irp_irg(i));
414 if (ftp == frame_tp) return true;
421 get_irg_n_locs (ir_graph *irg)
423 #if PRECISE_EXC_CONTEXT
424 return irg->n_loc - 1 - 1;
426 return irg->n_loc - 1;
431 set_irg_n_loc (ir_graph *irg, int n_loc)
433 #if PRECISE_EXC_CONTEXT
434 irg->n_loc = n_loc + 1 + 1;
436 irg->n_loc = n_loc + 1;
442 /* Returns the obstack associated with the graph. */
443 struct obstack *get_irg_obstack(ir_graph *irg) {
448 * Returns true if the node n is allocated on the storage of graph irg.
450 * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
452 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n)
454 struct _obstack_chunk *p;
457 * checks wheater the ir_node pointer i on the obstack.
458 * A more sophisticated chaeck would test the "whole" ir_node
460 for (p = irg->obst->chunk; p; p = p->prev) {
461 if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
469 get_irg_phase_state (ir_graph *irg) {
470 return irg->phase_state;
474 set_irg_phase_low(ir_graph *irg) {
475 irg->phase_state = phase_low;
479 get_irg_pinned (ir_graph *irg) {
484 get_irg_outs_state(ir_graph *irg) {
485 return irg->outs_state;
489 set_irg_outs_inconsistent(ir_graph *irg) {
490 irg->outs_state = outs_inconsistent;
494 get_irg_dom_state(ir_graph *irg) {
495 return irg->dom_state;
499 set_irg_dom_inconsistent(ir_graph *irg) {
500 irg->dom_state = dom_inconsistent;
504 set_irg_pinned (ir_graph *irg, op_pinned p) {
509 set_irg_link (ir_graph *irg, void *thing) {
514 get_irg_link (ir_graph *irg) {
518 /* maximum visited flag content of all ir_graph visited fields. */
519 static int max_irg_visited = 0;
522 get_irg_visited (ir_graph *irg)
528 set_irg_visited (ir_graph *irg, unsigned long visited)
530 irg->visited = visited;
531 if (irg->visited > max_irg_visited) {
532 max_irg_visited = irg->visited;
537 inc_irg_visited (ir_graph *irg)
539 if (++irg->visited > max_irg_visited) {
540 max_irg_visited = irg->visited;
545 get_max_irg_visited(void)
549 for(i = 0; i < get_irp_n_irgs(); i++)
550 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
552 return max_irg_visited;
555 void set_max_irg_visited(int val) {
556 max_irg_visited = val;
560 inc_max_irg_visited(void)
564 for(i = 0; i < get_irp_n_irgs(); i++)
565 assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
568 return max_irg_visited;
572 get_irg_block_visited (ir_graph *irg)
574 return irg->block_visited;
578 set_irg_block_visited (ir_graph *irg, unsigned long visited)
580 irg->block_visited = visited;
584 inc_irg_block_visited (ir_graph *irg)
586 ++irg->block_visited;