3 * File name: ir/ir/irgraph.c
4 * Purpose: Entry point to the representation of procedure code -- internal header.
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.
16 * ir graph construction.
18 * @author Martin Trapp, Christian Schaefer
22 # ifndef _IRGRAPH_T_H_
23 # define _IRGRAPH_T_H_
27 # include "firm_common_t.h"
28 # include "irtypeinfo.h"
30 #define FRAME_TP_SUFFIX "frame_tp"
32 /** ir_graph holds all information for a procedure */
34 firm_kind kind; /**< always set to k_ir_graph*/
35 /* -- Basics of the representation -- */
36 struct entity *ent; /**< The entity of this procedure, i.e.,
37 the type of the procedure and the
38 class it belongs to. */
39 struct type *frame_type; /**< A class type representing the stack frame.
40 Can include "inner" methods. */
41 struct ir_node *start_block; /**< block the start node will belong to */
42 struct ir_node *start; /**< start node of this ir_graph */
43 struct ir_node *end_block; /**< block the end node will belong to */
44 struct ir_node *end; /**< end node of this ir_graph */
45 struct ir_node *cstore; /**< constant store -- no more needed!! */
46 struct ir_node *frame; /**< method's frame */
47 struct ir_node *globals; /**< pointer to the data segment containing all
48 globals as well as global procedures. */
49 struct ir_node *args; /**< methods arguments */
50 struct ir_node *bad; /**< bad node of this ir_graph, the one and
52 /* GL removed: we need unknown with mode for analyses. */
53 // struct ir_node *unknown; /**< unknown node of this ir_graph */
54 struct obstack *obst; /**< obstack where all of the ir_nodes live */
55 struct ir_node *current_block; /**< block for newly gen_*()-erated
58 /* -- Fields indicating different states of irgraph -- */
59 irg_phase_state phase_state; /**< compiler phase */
60 op_pinned pinned; /**< Flag for status of nodes */
61 irg_outs_state outs_state; /**< Out edges. */
62 irg_dom_state dom_state; /**< Dominator information */
63 irg_typeinfo_state typeinfo_state; /**< Validity of type information */
64 irg_callee_info_state callee_info_state; /**< Validity of callee information */
66 /* -- Fields for construction -- */
67 #if USE_EXPLICIT_PHI_IN_STACK
68 struct Phi_in_stack *Phi_in_stack; /**< needed for automatic Phi construction */
70 int n_loc; /**< number of local variable in this
71 procedure including procedure parameters. */
73 /* -- Fields for optimizations / analysis information -- */
74 pset *value_table; /**< hash table for global value numbering (cse)
75 for optimizing use in iropt.c */
76 struct ir_node **outs; /**< Space for the out arrays. */
77 struct ir_loop *loop; /**< The outermost loop */
78 void *link; /**< A void* field to link any information to
81 /* -- Fields for Walking the graph -- */
82 unsigned long visited; /**< this flag is an identifier for
83 ir walk. it will be incremented
84 every time someone walks through
86 unsigned long block_visited; /**< same as visited, for a complete block */
88 int graph_nr; /**< a unique graph number for each graph to make output
93 void init_irgraph(void);
95 /** Make a rudimentary ir graph for the constant code.
96 Must look like a correct irg, spare everything else. */
97 ir_graph *new_const_code_irg(void);
100 * Set the pinned state of a graph.
106 set_irg_pinned (ir_graph *irg, op_pinned p);
108 /** Returns the obstack associated with the graph. */
109 struct obstack *get_irg_obstack(ir_graph *irg);
112 * Returns true if the node n is allocated on the storage of graph irg.
114 * @param irg the IR graph
115 * @param n the IR node
117 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n);
119 # endif /* _IRGRAPH_T_H_ */