1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
2 ** All rights reserved.
4 ** Authors: Martin Trapp, Christian Schaefer
6 ** irgraph.h: ir graph construction
11 # ifndef _IRGRAPH_T_H_
12 # define _IRGRAPH_T_H_
17 /* ir_graph holds all information for a procedure */
19 struct entity *ent; /* The entity of this procedure, i.e.,
20 the type of the procedure and the
21 class it belongs to. */
22 struct ir_node *start_block; /* block the start node will belong to */
23 struct ir_node *start; /* start node of this ir_graph */
24 struct ir_node *end_block; /* block the end node will belong to */
25 struct ir_node *end; /* end node of this ir_graph */
26 struct ir_node *cstore; /* constant store -- no more needed!! */
27 struct ir_node *frame; /* method's frame */
28 struct ir_node *globals; /* pointer to the data segment containing all
29 globals as well as global procedures. */
30 struct ir_node *args; /* methods arguments */
31 struct ir_node *bad; /* bad node of this ir_graph, the one and
33 struct obstack *obst; /* obstack where all of the ir_nodes live */
34 #if USE_EXPICIT_PHI_IN_STACK
35 struct Phi_in_stack *Phi_in_stack; /* needed for automatic Phi construction */
37 struct ir_node *current_block; /* block for newly gen_*()-erated
39 int n_loc; /* number of local variable in this
40 procedure including procedure parameters. */
41 pset *value_table; /* value table for global value numbering
42 for optimizing use in iropt.c */
43 unsigned long visited; /* this flag is an identifier for
44 ir walk. it will be incremented,
45 every time, someone walk through
47 unsigned long block_visited; /* same as visited, for a
50 # endif /* _IRGRAPH_T_H_ */