3 * File name: ir/ir/irnode_t.h
4 * Purpose: Representation of an intermediate operation -- private 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.
17 * Declarations of an ir node.
19 * @author Martin Trapp, Christian Schaefer
32 # include "firm_common_t.h"
33 # include "irdom_t.h" /* For size of struct dom_info. */
38 /** ir node attributes **/
40 /** Block attributes */
42 /* General attributes */
44 unsigned long block_visited; /**< for the walker that walks over all blocks. */
45 /* Attributes private to construction: */
46 bool matured; /**< if set, all in-nodes of the block are fixed */
47 struct ir_node **graph_arr; /**< array to store all parameters */
48 /* Attributes holding analyses information */
49 struct dom_info dom; /**< Datastructure that holds information about dominators.
51 Eventually overlay with graph_arr as only valid
52 in different phases. Eventually inline the whole
54 // exc_t exc; /**< role of this block for exception handling */
55 // ir_node *handler_entry; /**< handler entry block iff this block is part of a region */
56 ir_node ** in_cg; /**< array with predecessors in
57 * interprocedural_view, if they differ
58 * from intraprocedural predecessors */
59 int *backedge; /**< Field n set to true if pred n is backedge.
60 @@@ @todo Ev. replace by bitfield! */
61 int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
62 @@@ @todo Ev. replace by bitfield! */
65 /** Start attributes */
68 // ir_graph *irg; @@@ now in block
71 /** Cond attributes */
73 cond_kind kind; /**< flavor of Cond */
74 long default_proj; /**< for optimization: biggest Proj number, i.e. the one
78 /** Const attributes */
80 tarval *tv; /**< the target value */
81 type *tp; /**< the source type, for analyses. default: type_unknown. */
84 /** SymConst attributes
85 This union contains the symbolic information represented by the node */
86 typedef union type_or_id {
98 entity *ent; /**< entity to select */
102 type *cld_tp; /**< type of called procedure */
103 #if PRECISE_EXC_CONTEXT
104 struct ir_node **frag_arr; /**< For Phi node construction in case of exceptions */
106 entity ** callee_arr; /**< result of callee analysis */
109 /** Alloc attributes */
111 type *type; /**< Type of the allocated object. */
112 where_alloc where; /**< stack, heap or other managed part of memory */
113 #if PRECISE_EXC_CONTEXT
114 struct ir_node **frag_arr; /**< For Phi node construction in case of exceptions */
118 /** InstOf attributes */
125 /** Filter attributes */
127 long proj; /**< contains the result position to project (Proj) */
128 ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
129 int *backedge; /**< Field n set to true if pred n is backedge.
130 @todo Ev. replace by bitfield! */
133 /** EndReg/EndExcept attributes */
136 // ir_graph * irg; /**< ir_graph this node belongs to (for
137 // * navigating in interprocedural graphs)
138 // @@@ now in block */
141 /** CallBegin attributes */
143 // ir_graph * irg; / **< ir_graph this node belongs to (for
144 // * navigating in interprocedural graphs) */
146 ir_node * call; /**< associated Call-operation */
149 /** Cast attributes */
154 typedef pn_Cmp confirm_attr; /** Attribute to hold compare operation */
156 /** Some irnodes just have one attribute, these are stored here,
157 some have more. Their name is 'irnodename_attr' */
159 start_attr start; /**< For Start */
160 block_attr block; /**< For Block: Fields needed to construct it */
161 cond_attr c; /**< For Cond. */
162 const_attr con; /**< For Const: contains the value of the constant and a type */
163 symconst_attr i; /**< For SymConst. */
164 sel_attr s; /**< For Sel. */
165 call_attr call; /**< For Call: pointer to the type of the method to call */
166 callbegin_attr callbegin; /**< For CallBegin */
167 alloc_attr a; /**< For Alloc. */
168 io_attr io; /**< For InstOf */
169 type *f; /**< For Free. */
170 cast_attr cast; /**< For Cast. */
171 int phi0_pos; /**< For Phi. Used to remember the value defined by
172 this Phi node. Needed when the Phi is completed
173 to call get_r_internal_value to find the
174 predecessors. If this attribute is set, the Phi
175 node takes the role of the obsolete Phi0 node,
176 therefore the name. */
177 int *phi_backedge; /**< For Phi after construction.
178 Field n set to true if pred n is backedge.
179 @todo Ev. replace by bitfield! */
180 long proj; /**< For Proj: contains the result position to project */
181 confirm_attr confirm_cmp; /**< For Confirm: compare operation */
182 filter_attr filter; /**< For Filter */
183 end_attr end; /**< For EndReg, EndExcept */
184 #if PRECISE_EXC_CONTEXT
185 struct ir_node **frag_arr; /**< For Phi node construction in case of exceptions
186 for nodes Store, Load, Div, Mod, Quot, DivMod. */
191 /** common structure of an irnode
192 if the node has some attributes, they are stored in attr */
194 /* ------- Basics of the representation ------- */
195 firm_kind kind; /**< distinguishes this node from others */
196 ir_op *op; /**< Opcode of this node. */
197 ir_mode *mode; /**< Mode of this node. */
198 unsigned long visited; /**< visited counter for walks of the graph */
199 struct ir_node **in; /**< array with predecessors / operands */
200 void *link; /**< to attach additional information to the node, e.g.
201 used while construction to link Phi0 nodes and
202 during optimization to link to nodes that
203 shall replace a node. */
204 /* ------- Fields for optimizations / analysis information ------- */
205 struct ir_node **out; /**< array of out edges */
206 struct dbg_info* dbi; /**< A pointer to information for debug support. */
207 /* ------- For debugging ------- */
209 int node_nr; /**< a unique node number for each node to make output
212 attr attr; /**< attribute of this node. Depends on opcode.
213 Must be last field of struct ir_node. */
216 /** Copies all attributes stored in the old node to the new node.
217 Assumes both have the same opcode and sufficient size. */
219 copy_attrs(const ir_node *old_node, ir_node *new_node);
222 /** Returns the array with the ins. The content of the array may not be
224 ir_node **get_irn_in (const ir_node *node);
227 /** access attributes directly */
228 INLINE const_attr get_irn_const_attr (ir_node *node);
229 INLINE long get_irn_proj_attr (ir_node *node);
230 INLINE alloc_attr get_irn_alloc_attr (ir_node *node);
231 INLINE type *get_irn_free_attr (ir_node *node);
232 INLINE symconst_attr get_irn_symconst_attr (ir_node *node);
233 type *get_irn_call_attr (ir_node *node);
234 sel_attr get_irn_sel_attr (ir_node *node);
235 int get_irn_phi_attr (ir_node *node);
236 block_attr get_irn_block_attr (ir_node *node);
239 # endif /* _IRNODE_T_H_ */