2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Definition of the Firm IR base types, concentrated here
23 * @author Michael Beck
26 #ifndef FIRM_IR_IRDEFS_H
27 #define FIRM_IR_IRDEFS_H
29 #include "firm_types.h"
30 #include "firm_common_t.h"
35 #include "iredgekinds.h"
36 #include "irtypeinfo.h"
37 #include "execution_frequency.h"
39 #include "callgraph.h"
40 #include "field_temperature.h"
46 /** The type of an ir_op. */
48 unsigned code; /**< The unique opcode of the op. */
49 ident *name; /**< The name of the op. */
50 size_t attr_size; /**< Space needed in memory for private attributes. */
51 op_pin_state op_pin_state_pinned; /**< How to deal with the node in CSE, PRE. */
52 op_arity opar; /**< The arity of operator. */
53 int op_index; /**< The index of the first data operand, 0 for most cases, 1 for Div etc. */
54 unsigned flags; /**< Flags describing the behavior of the ir_op, a bitmasks of irop_flags. */
55 void *tag; /**< Some custom pointer the op's creator can attach stuff to. */
57 ir_op_ops ops; /**< The operations of the this op. */
61 * Contains relevant information about a mode.
63 * Necessary information about a mode is stored in this struct
64 * which is used by the tarval module to perform calculations
65 * and comparisons of values of a such described mode.
68 * - modecode code: An unambiguous int (enum) for the mode
69 * - ident *name: Name of this mode. Two modes are different if the name is different.
70 * - mode_sort sort: sort of mode specifying possible usage categories
71 * - int size: size of the mode in Bits.
72 * - unsigned sign:1: signedness of this mode
74 * - modulo_shift specifies for modes of kind irms_int_number
75 * whether shift applies modulo to value of bits to shift
78 * The tech report 1999-44 describing FIRM and predefined modes
82 firm_kind kind; /**< distinguishes this node from others */
83 modecode code; /**< unambiguous identifier of a mode */
84 ident *name; /**< Name ident of this mode */
86 /* ----------------------------------------------------------------------- */
87 /* On changing this struct you have to evaluate the mode_are_equal function!*/
88 mode_sort sort; /**< coarse classification of this mode:
89 int, float, reference ...
91 mode_arithmetic arithmetic; /**< different arithmetic operations possible with a mode */
92 int size; /**< size of the mode in Bits. */
93 unsigned sign:1; /**< signedness of this mode */
94 unsigned int modulo_shift; /**< number of bits a values of this mode will be shifted */
95 unsigned vector_elem; /**< if this is not equal 1, this is a vector mode with
96 vector_elem number of elements, size contains the size
97 of all bits and must be dividable by vector_elem */
99 /* ----------------------------------------------------------------------- */
100 tarval *min; /**< the minimum value that can be expressed */
101 tarval *max; /**< the maximum value that can be expressed */
102 tarval *null; /**< the value 0 */
103 tarval *one; /**< the value 1 */
104 tarval *minus_one; /**< the value -1 */
105 ir_mode *eq_signed; /**< For pointer modes, the equivalent signed integer one. */
106 ir_mode *eq_unsigned; /**< For pointer modes, the equivalent unsigned integer one. */
107 void *link; /**< To store some intermediate information */
108 const void *tv_priv; /**< tarval module will save private data here */
111 /** ir node attributes **/
113 /** Block attributes */
115 /* General attributes */
116 ir_graph *irg; /**< The graph this block belongs to. */
117 unsigned long block_visited; /**< For the walker that walks over all blocks. */
118 /* Attributes private to construction: */
119 unsigned is_matured:1; /**< If set, all in-nodes of the block are fixed. */
120 unsigned is_dead:1; /**< If set, the block is dead (and could be replace by a Bad. */
121 unsigned is_mb_head:1; /**< Set if this block is a macroblock head. */
122 unsigned has_label:1; /**< Set if this block has a label assigned. */
123 ir_node **graph_arr; /**< An array to store all parameters. */
124 /* Attributes holding analyses information */
125 ir_dom_info dom; /**< Datastructure that holds information about dominators.
127 Eventually overlay with graph_arr as only valid
128 in different phases. Eventually inline the whole
130 ir_dom_info pdom; /**< Datastructure that holds information about post-dominators. */
131 ir_node ** in_cg; /**< array with predecessors in
132 * interprocedural_view, if they differ
133 * from intraprocedural predecessors */
134 int *backedge; /**< Field n set to true if pred n is backedge.
135 @@@ @todo Ev. replace by bit field! */
136 int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
137 @@@ @todo Ev. replace by bit field! */
138 ir_extblk *extblk; /**< The extended basic block this block belongs to. */
139 ir_region *region; /**< The immediate structural region this block belongs to. */
140 unsigned mb_depth; /**< The macroblock depth: A distance from the macroblock header */
141 ir_label_t label; /**< The block label if assigned. */
143 struct list_head succ_head; /**< A list head for all successor edges of a block. */
146 /** Cond attributes. */
148 cond_kind kind; /**< flavor of Cond */
149 long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
150 cond_jmp_predicate pred; /**< only for binary Conds: The jump predication. */
153 /** Const attributes. */
155 tarval *tv; /**< the target value */
156 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
159 /** SymConst attributes. */
161 symconst_symbol sym; // old tori
163 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
166 /** Sel attributes. */
168 ir_entity *ent; /**< entity to select */
171 /** Exception attributes. */
173 op_pin_state pin_state; /**< the pin state for operations that might generate a exception:
174 If it's know that no exception will be generated, could be set to
175 op_pin_state_floats. */
176 #if PRECISE_EXC_CONTEXT
177 struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
181 /** Call attributes. */
183 except_attr exc; /**< the exception attribute. MUST be the first one. */
184 ir_type *cld_tp; /**< type of called procedure */
185 ir_entity ** callee_arr; /**< result of callee analysis */
188 /** Alloc attributes. */
190 except_attr exc; /**< the exception attribute. MUST be the first one. */
191 ir_type *type; /**< Type of the allocated object. */
192 where_alloc where; /**< stack, heap or other managed part of memory */
195 /** Free attributes. */
197 ir_type *type; /**< Type of the allocated object. */
198 where_alloc where; /**< stack, heap or other managed part of memory */
201 /** InstOf attributes. */
203 except_attr exc; /**< the exception attribute. MUST be the first one. */
204 ir_type *type; /**< the type of which the object pointer must be */
207 /** Filter attributes. */
209 long proj; /**< contains the result position to project (Proj) */
210 ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
211 int *backedge; /**< Field n set to true if pred n is backedge.
212 @todo Ev. replace by bitfield! */
215 /** CallBegin attributes. */
217 ir_node * call; /**< Associated Call-operation. */
220 /** Cast attributes. */
222 ir_type *totype; /**< Type of the casted node. */
225 /** Load attributes. */
227 except_attr exc; /**< The exception attribute. MUST be the first one. */
228 ir_mode *load_mode; /**< The mode of this Load operation. */
229 unsigned volatility:1; /**< The volatility of this Load operation. */
230 unsigned aligned:1; /**< The align attribute of this Load operation. */
233 /** Store attributes. */
235 except_attr exc; /**< the exception attribute. MUST be the first one. */
236 unsigned volatility:1; /**< The volatility of this Store operation. */
237 unsigned aligned:1; /**< The align attribute of this Store operation. */
241 int pos; /**< For Phi0. Used to remember the value defined by
242 this Phi node. Needed when the Phi is completed
243 to call get_r_internal_value to find the
244 predecessors. If this attribute is set, the Phi
245 node takes the role of the obsolete Phi0 node,
246 therefore the name. */
249 /**< Confirm attribute. */
251 pn_Cmp cmp; /**< The compare operation. */
254 /** CopyB attribute. */
256 except_attr exc; /**< The exception attribute. MUST be the first one. */
257 ir_type *data_type; /**< Type of the copied entity. */
260 /** Bound attribute. */
262 except_attr exc; /**< The exception attribute. MUST be the first one. */
265 /** Conv attribute. */
267 char strict; /**< If set, this is a strict Conv that cannot be removed. */
270 /** Div/Mod/DivMod/Quot attribute. */
272 except_attr exc; /**< The exception attribute. MUST be the first one. */
273 ir_mode *res_mode; /**< Result mode for the division. */
276 /** Inline Assembler support attribute. */
278 op_pin_state pin_state; /**< the pin state for operations that might generate a exception */
279 ident *asm_text; /**< The inline assembler text. */
280 ir_asm_constraint *inputs; /**< Input constraints. */
281 ir_asm_constraint *outputs; /**< Output constraints. */
282 ident **clobber; /**< List of clobbered registers. */
285 /** Some IR-nodes just have one attribute, these are stored here,
286 some have more. Their name is 'irnodename_attr' */
288 block_attr block; /**< For Block: Fields needed to construct it */
289 cond_attr cond; /**< For Cond. */
290 const_attr con; /**< For Const: contains the value of the constant and a type */
291 symconst_attr symc; /**< For SymConst. */
292 sel_attr sel; /**< For Sel. */
293 call_attr call; /**< For Call: pointer to the type of the method to call */
294 callbegin_attr callbegin; /**< For CallBegin. */
295 alloc_attr alloc; /**< For Alloc. */
296 free_attr free; /**< For Free. */
297 io_attr instof; /**< For InstOf */
298 cast_attr cast; /**< For Cast. */
299 load_attr load; /**< For Load. */
300 store_attr store; /**< For Store. */
301 phi0_attr phi0; /**< for Phi0 nodes. */
302 int *phi_backedge; /**< For Phi after construction.
303 Field n set to true if pred n is backedge.
304 @todo Ev. replace by bitfield! */
305 long proj; /**< For Proj: contains the result position to project */
306 confirm_attr confirm; /**< For Confirm: compare operation and region. */
307 filter_attr filter; /**< For Filter */
308 except_attr except; /**< For Phi node construction in case of exceptions */
309 copyb_attr copyb; /**< For CopyB operation */
310 bound_attr bound; /**< For Bound operation */
311 conv_attr conv; /**< For Conv operation */
312 divmod_attr divmod; /**< For Div/Mod/DivMod operation */
313 asm_attr assem; /**< For ASM operation. */
317 * Edge info to put into an irn.
319 typedef struct _irn_edge_kind_info_t {
320 struct list_head outs_head; /**< The list of all outs. */
321 int out_count; /**< Number of outs in the list. */
324 typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];
327 * The common structure of an irnode.
328 * If the node has some attributes, they are stored in the attr field.
331 /* ------- Basics of the representation ------- */
332 firm_kind kind; /**< Distinguishes this node from others. */
333 ir_op *op; /**< The Opcode of this node. */
334 ir_mode *mode; /**< The Mode of this node. */
335 struct ir_node **in; /**< The array of predecessors / operands. */
336 unsigned long visited; /**< The visited counter for walks of the graph. */
337 unsigned node_idx; /**< The node index of this node in its graph. */
338 void *link; /**< To attach additional information to the node, e.g.
339 used while construction to link Phi0 nodes and
340 during optimization to link to nodes that
341 shall replace a node. */
342 /* ------- Fields for optimizations / analysis information ------- */
343 struct ir_node **out; /**< @deprecated array of out edges. */
344 struct dbg_info *dbi; /**< A pointer to information for debug support. */
345 /* ------- For debugging ------- */
348 long node_nr; /**< A unique node number for each node to make output
351 /* ------- For analyses -------- */
352 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
353 #ifdef DO_HEAPANALYSIS
354 struct abstval *av; /**< Heapanalysis: The abstract value of this node. */
355 struct section *sec; /**< Heapanalysis: The section of this node. */
357 struct ir_node **deps; /**< Additional dependencies induced by state. */
358 irn_edges_info_t edge_info; /**< Everlasting out edges. */
359 /* ------- Opcode depending fields -------- */
360 attr attr; /**< The set of attributes of this node. Depends on opcode.
361 Must be last field of struct ir_node. */
365 * Edge info to put into an irg.
367 typedef struct _irg_edge_info_t {
368 set *edges; /**< a set containing all edges of a graph. */
369 unsigned activated : 1; /**< set if edges are activated for the graph. */
372 typedef irg_edge_info_t irg_edges_info_t[EDGE_KIND_LAST];
375 * Index constants for nodes that can be accessed through the graph anchor node.
378 anchor_end_block = 0, /**< block the end node will belong to, same as Anchors block */
379 anchor_start_block, /**< block the start node will belong to */
380 anchor_end, /**< end node of this ir_graph */
381 anchor_start, /**< start node of this ir_graph */
382 anchor_end_reg, /**< end node of this ir_graph */
383 anchor_end_except, /**< end node of this ir_graph */
384 anchor_frame, /**< method's frame */
385 anchor_globals, /**< pointer to the data segment containing all
386 globals as well as global procedures. */
387 anchor_tls, /**< pointer to the thread local storage containing all
388 thread local data. */
389 anchor_initial_mem, /**< initial memory of this graph */
390 anchor_args, /**< methods arguments */
391 anchor_value_param_base, /**< method value param base */
392 anchor_bad, /**< bad node of this ir_graph, the one and
393 only in this graph */
394 anchor_no_mem, /**< NoMem node of this ir_graph, the one and only in this graph */
398 /** A callgraph entry for callees. */
399 typedef struct cg_callee_entry {
400 ir_graph *irg; /**< The called irg. */
401 ir_node **call_list; /**< The list of all calls to the irg. */
402 int max_depth; /**< Maximum depth of all Call nodes to irg. */
406 * An ir_graph holds all information for a procedure.
409 firm_kind kind; /**< Always set to k_ir_graph. */
410 /* -- Basics of the representation -- */
411 ir_entity *ent; /**< The entity of this procedure, i.e.,
412 the type of the procedure and the
413 class it belongs to. */
414 ir_type *frame_type; /**< A class type representing the stack frame.
415 Can include "inner" methods. */
416 ir_node *anchor; /**< The anchor node. */
417 ir_node **proj_args; /**< Projs of the methods arguments. */
418 struct obstack *obst; /**< The obstack where all of the ir_nodes live. */
419 ir_node *current_block; /**< Current block for newly gen_*()-erated ir_nodes. */
420 struct obstack *extbb_obst; /**< The obstack for extended basic block info. */
422 unsigned last_node_idx; /**< The last IR node index for this graph. */
424 /* -- Fields for graph properties -- */
425 irg_inline_property inline_property; /**< How to handle inlineing. */
426 unsigned additional_properties; /**< Additional graph properties. */
428 /* -- Fields indicating different states of irgraph -- */
429 irg_phase_state phase_state; /**< Compiler phase. */
430 op_pin_state irg_pinned_state; /**< Flag for status of nodes. */
431 irg_outs_state outs_state; /**< Out edges. */
432 irg_dom_state dom_state; /**< Dominator state information. */
433 irg_dom_state pdom_state; /**< Post Dominator state information. */
434 ir_typeinfo_state typeinfo_state; /**< Validity of type information. */
435 irg_callee_info_state callee_info_state; /**< Validity of callee information. */
436 irg_loopinfo_state loopinfo_state; /**< State of loop information. */
437 ir_class_cast_state class_cast_state; /**< Kind of cast operations in code. */
438 irg_extblk_info_state extblk_state; /**< State of extended basic block info. */
439 exec_freq_state execfreq_state; /**< Execution frequency state. */
440 ir_address_taken_computed_state adr_taken_state; /**< Address taken state. */
441 unsigned mem_disambig_opt; /**< Options for the memory disambiguator. */
442 unsigned fp_model; /**< floating point model of the graph. */
444 /* -- Fields for construction -- */
445 #if USE_EXPLICIT_PHI_IN_STACK
446 struct Phi_in_stack *Phi_in_stack; /**< Needed for automatic Phi construction. */
448 int n_loc; /**< Number of local variables in this
449 procedure including procedure parameters. */
450 void **loc_descriptions; /**< Storage for local variable descriptions. */
452 /* -- Fields for optimizations / analysis information -- */
453 pset *value_table; /**< Hash table for global value numbering (cse)
454 for optimizing use in iropt.c */
455 ir_node **outs; /**< Space for the out arrays. */
457 ir_loop *loop; /**< The outermost loop for this graph. */
458 void *link; /**< A void* field to link any information to
461 ir_graph **callers; /**< For callgraph analysis: list of caller graphs. */
462 unsigned char *caller_isbe; /**< For callgraph analysis: set if backedge. */
463 cg_callee_entry **callees; /**< For callgraph analysis: list of callee calls */
464 unsigned char *callee_isbe; /**< For callgraph analysis: set if backedge. */
465 int callgraph_loop_depth; /**< For callgraph analysis */
466 int callgraph_recursion_depth; /**< For callgraph analysis */
467 double method_execution_frequency; /**< For callgraph analysis */
469 ir_loop *l; /**< For callgraph analysis. */
471 /* -- Fields for Walking the graph -- */
472 unsigned long visited; /**< this flag is an identifier for
473 ir walk. it will be incremented
474 every time someone walks through
476 unsigned long block_visited; /**< same as visited, for a complete block */
478 unsigned estimated_node_count; /**< estimated number of nodes in this graph,
479 updated after every walk */
480 irg_edges_info_t edge_info; /**< edge info for automatic outs */
481 ir_node **idx_irn_map; /**< Array mapping node indexes to nodes. */
484 int n_outs; /**< Size wasted for outs */
485 long graph_nr; /**< a unique graph number for each graph to make output
490 unsigned using_visited : 1; /**< set to 1 if we are currently using the visited flag */
491 unsigned using_block_visited : 1; /**< set to 1 if we are currently using the block_visited flag */
492 unsigned using_irn_link : 1; /**< set to 1 if we are currently using the irn_link fields */
498 firm_kind kind; /**< must be k_ir_prog */
499 ident *name; /**< A file name or the like. */
500 ir_graph *main_irg; /**< The entry point to the compiled program
501 or NULL if no point exists. */
502 ir_graph **graphs; /**< A list of all graphs in the ir. */
503 ir_graph **pseudo_graphs; /**< A list of all pseudo graphs in the ir. See pseudo_irg.c */
504 ir_graph *const_code_irg; /**< This ir graph gives the proper environment
505 to allocate nodes the represent values
506 of constant entities. It is not meant as
508 ir_type *glob_type; /**< The global type. Must be a class as it can
509 have fields and procedures. */
510 ir_type *tls_type; /**< The thread local storage type. Must be a struct as it can
512 ir_type **types; /**< A list of all types in the ir. */
513 ir_mode **modes; /**< A list of all modes in the ir. */
514 ir_op **opcodes; /**< A list of all opcodes in the ir. */
516 /* -- states of and access to generated information -- */
517 irg_phase_state phase_state; /**< The state of construction. */
519 ip_view_state ip_view; /**< The state of interprocedural view. */
521 irg_outs_state outs_state; /**< The state of out edges of ir nodes. */
522 ir_node **ip_outedges; /**< A huge Array that contains all out edges
523 in interprocedural view. */
524 irg_outs_state trouts_state; /**< The state of out edges of type information. */
526 irg_callee_info_state callee_info_state; /**< Validity of callee information.
527 Contains the lowest value or all irgs. */
528 ir_typeinfo_state typeinfo_state; /**< Validity of type information. */
529 inh_transitive_closure_state inh_trans_closure_state; /**< State of transitive closure
530 of inheritance relations. */
532 irp_callgraph_state callgraph_state; /**< The state of the callgraph. */
533 ir_loop *outermost_cg_loop; /**< For callgraph analysis: entry point
534 to looptree over callgraph. */
535 int max_callgraph_loop_depth; /**< needed in callgraph. */
536 int max_callgraph_recursion_depth; /**< needed in callgraph. */
537 double max_method_execution_frequency; /**< needed in callgraph. */
538 irp_temperature_state temperature_state; /**< accumulated temperatures computed? */
539 exec_freq_state execfreq_state; /**< The state of execution frequency information */
540 loop_nesting_depth_state lnd_state; /**< The state of loop nesting depth information. */
541 ir_class_cast_state class_cast_state; /**< The state of cast operations in code. */
542 ir_address_taken_computed_state globals_adr_taken_state; /**< Address taken state of the globals. */
544 ir_exc_region_t last_region_nr; /**< The last exception region number that was assigned. */
545 ir_label_t last_label_nr; /**< The highest label number for generating unique labels. */
547 long max_node_nr; /**< to generate unique numbers for nodes. */