2 * Copyright (C) 1995-2008 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"
34 #include "iredgekinds.h"
35 #include "irtypeinfo.h"
37 #include "execution_frequency.h"
39 #include "callgraph.h"
41 #include "field_temperature.h"
51 * List of phases. (We will add a register/unregister interface if managing
52 * this gets too tedious)
54 typedef enum ir_phase_id {
56 PHASE_LAST = PHASE_VRP
59 /** The type of an ir_op. */
61 unsigned code; /**< The unique opcode of the op. */
62 ident *name; /**< The name of the op. */
63 size_t attr_size; /**< Space needed in memory for private attributes. */
64 op_pin_state pin_state; /**< How to deal with the node in CSE, PRE. */
65 op_arity opar; /**< The arity of operator. */
66 int op_index; /**< The index of the first data operand, 0 for most cases, 1 for Div etc. */
67 unsigned flags; /**< Flags describing the behavior of the ir_op, a bitmasks of irop_flags. */
68 unsigned tag; /**< Some custom TAG value the op's creator set to. */
69 void *attr; /**< custom pointer where op's creator can attach attribute stuff to. */
71 ir_op_ops ops; /**< The operations of the this op. */
75 * Contains relevant information about a mode.
77 * Necessary information about a mode is stored in this struct
78 * which is used by the tarval module to perform calculations
79 * and comparisons of values of a such described mode.
82 * - ident *name: Name of this mode. Two modes are different if the name is different.
83 * - ir_mode_sort sort: sort of mode specifying possible usage categories
84 * - int size: size of the mode in Bits.
85 * - unsigned sign:1: signedness of this mode
87 * - modulo_shift specifies for modes of kind irms_int_number
88 * whether shift applies modulo to value of bits to shift
91 * The tech report 1999-44 describing FIRM and predefined modes
95 firm_kind kind; /**< distinguishes this node from others */
96 ident *name; /**< Name ident of this mode */
97 ir_type *type; /**< corresponding primitive type */
99 /* ----------------------------------------------------------------------- */
100 /* On changing this struct you have to evaluate the mode_are_equal function!*/
101 ir_mode_sort sort; /**< coarse classification of this mode:
102 int, float, reference ...
105 arithmetic; /**< different arithmetic operations possible with a mode */
106 unsigned size; /**< size of the mode in Bits. */
107 unsigned sign:1; /**< signedness of this mode */
108 unsigned int modulo_shift; /**< number of bits a values of this mode will be shifted */
109 unsigned vector_elem; /**< if this is not equal 1, this is a vector mode with
110 vector_elem number of elements, size contains the size
111 of all bits and must be dividable by vector_elem */
113 /* ----------------------------------------------------------------------- */
114 tarval *min; /**< the minimum value that can be expressed */
115 tarval *max; /**< the maximum value that can be expressed */
116 tarval *null; /**< the value 0 */
117 tarval *one; /**< the value 1 */
118 tarval *minus_one; /**< the value -1 */
119 tarval *all_one; /**< the value ~0 */
120 ir_mode *eq_signed; /**< For pointer modes, the equivalent signed integer one. */
121 ir_mode *eq_unsigned; /**< For pointer modes, the equivalent unsigned integer one. */
122 void *link; /**< To store some intermediate information */
123 const void *tv_priv; /**< tarval module will save private data here */
126 /* ir node attributes */
128 /** first attribute of Bad and Block nodes */
130 ir_graph *irg; /**< The graph this block like node belongs to. */
133 /** Block attributes */
135 /* General attributes */
136 irg_attr irg; /**< The graph this block belongs to. */
137 ir_visited_t block_visited; /**< For the walker that walks over all blocks. */
138 /* Attributes private to construction: */
139 unsigned is_matured:1; /**< If set, all in-nodes of the block are fixed. */
140 unsigned is_dead:1; /**< If set, the block is dead (and could be replace by a Bad. */
141 unsigned is_mb_head:1; /**< Set if this block is a macroblock head. */
142 unsigned marked:1; /**< Can be set/unset to temporary mark a block. */
143 ir_node **graph_arr; /**< An array to store all parameters. */
144 /* Attributes holding analyses information */
145 ir_dom_info dom; /**< Datastructure that holds information about dominators.
147 Eventually overlay with graph_arr as only valid
148 in different phases. Eventually inline the whole
150 ir_dom_info pdom; /**< Datastructure that holds information about post-dominators. */
151 ir_node ** in_cg; /**< array with predecessors in
152 * interprocedural_view, if they differ
153 * from intraprocedural predecessors */
154 unsigned *backedge; /**< Raw Bitfield n set to true if pred n is backedge.*/
155 unsigned *cg_backedge; /**< Raw Bitfield n set to true if pred n is interprocedural backedge. */
156 ir_extblk *extblk; /**< The extended basic block this block belongs to. */
157 ir_region *region; /**< The immediate structural region this block belongs to. */
158 unsigned mb_depth; /**< The macroblock depth: A distance from the macroblock header */
159 ir_entity *entity; /**< entitiy representing this block */
160 ir_node *phis; /**< The list of Phi nodes in this block. */
162 struct list_head succ_head; /**< A list head for all successor edges of a block. */
165 /** Cond attributes. */
167 long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
168 cond_jmp_predicate jmp_pred; /**< only for binary Conds: The jump predication. */
171 /** Const attributes. */
173 tarval *tarval; /**< the target value */
174 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
177 /** SymConst attributes. */
179 symconst_symbol sym; // old tori
181 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
184 /** Sel attributes. */
186 ir_entity *entity; /**< entity to select */
189 /** Exception attributes. */
191 op_pin_state pin_state; /**< the pin state for operations that might generate a exception:
192 If it's know that no exception will be generated, could be set to
193 op_pin_state_floats. */
194 struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
197 /** Call attributes. */
199 except_attr exc; /**< the exception attribute. MUST be the first one. */
200 ir_type *type; /**< type of called procedure */
201 ir_entity **callee_arr; /**< result of callee analysis */
202 unsigned tail_call:1; /**< if set, can be a tail call */
205 /** Builtin attributes. */
207 except_attr exc; /**< the exception attribute. MUST be the first one. */
208 ir_builtin_kind kind; /**< kind of the called builtin procedure */
209 ir_type *type; /**< type of called builtin procedure */
212 /** Alloc attributes. */
214 except_attr exc; /**< the exception attribute. MUST be the first one. */
215 ir_where_alloc where; /**< stack, heap or other managed part of memory */
216 ir_type *type; /**< Type of the allocated object. */
219 /** Free attributes. */
221 ir_type *type; /**< Type of the allocated object. */
222 ir_where_alloc where; /**< stack, heap or other managed part of memory */
225 /** InstOf attributes. */
227 except_attr exc; /**< the exception attribute. MUST be the first one. */
228 ir_type *type; /**< the type of which the object pointer must be */
231 /** Filter attributes. */
233 long proj; /**< contains the result position to project (Proj) */
234 ir_node **in_cg; /**< array with interprocedural predecessors (Phi) */
235 unsigned *backedge; /**< Raw Bitfield n set to true if pred n is backedge. */
238 /** CallBegin attributes. */
240 ir_node *call; /**< Associated Call-operation. */
243 /** Cast attributes. */
245 ir_type *type; /**< Type of the casted node. */
248 /** Load attributes. */
250 except_attr exc; /**< The exception attribute. MUST be the first one. */
251 unsigned volatility:1; /**< The volatility of this Load operation. */
252 unsigned aligned:1; /**< The align attribute of this Load operation. */
253 ir_mode *mode; /**< The mode of this Load operation. */
256 /** Store attributes. */
258 except_attr exc; /**< the exception attribute. MUST be the first one. */
259 unsigned volatility:1; /**< The volatility of this Store operation. */
260 unsigned aligned:1; /**< The align attribute of this Store operation. */
264 ir_node *next; /**< Points to the next Phi in the Phi list of a block. */
266 unsigned *backedge; /**< Raw Bitfield: bit n is set to true if pred n is backedge. */
267 int pos; /**< For Phi0. Used to remember the value defined by
268 this Phi node. Needed when the Phi is completed
269 to call get_r_internal_value() to find the
270 predecessors. If this attribute is set, the Phi
271 node takes the role of the obsolete Phi0 node,
272 therefore the name. */
277 /**< Confirm attribute. */
279 pn_Cmp cmp; /**< The compare operation. */
282 /** CopyB attribute. */
284 except_attr exc; /**< The exception attribute. MUST be the first one. */
285 ir_type *type; /**< Type of the copied entity. */
288 /** Bound attribute. */
290 except_attr exc; /**< The exception attribute. MUST be the first one. */
293 /** Conv attribute. */
295 char strict; /**< If set, this is a strict Conv that cannot be removed. */
298 /** Div/Mod/DivMod/Quot attribute. */
300 except_attr exc; /**< The exception attribute. MUST be the first one. */
301 ir_mode *resmode; /**< Result mode for the division. */
302 char no_remainder; /**< Set, if known that a division can be done without a remainder. */
305 /** Inline Assembler support attribute. */
307 /* BEWARE: pin state MUST be the first attribute */
308 op_pin_state pin_state; /**< the pin state for operations that might generate a exception */
309 ident *text; /**< The inline assembler text. */
310 ir_asm_constraint *input_constraints; /**< Input constraints. */
311 ir_asm_constraint *output_constraints; /**< Output constraints. */
312 ident **clobbers; /**< List of clobbered registers. */
315 /** Some IR-nodes just have one attribute, these are stored here,
316 some have more. Their name is 'irnodename_attr' */
318 irg_attr irg; /**< For Blocks and Bad: its belonging irg */
319 block_attr block; /**< For Block: Fields needed to construct it */
320 cond_attr cond; /**< For Cond. */
321 const_attr con; /**< For Const: contains the value of the constant and a type */
322 symconst_attr symc; /**< For SymConst. */
323 sel_attr sel; /**< For Sel. */
324 call_attr call; /**< For Call. */
325 builtin_attr builtin; /**< For Builtin. */
326 callbegin_attr callbegin; /**< For CallBegin. */
327 alloc_attr alloc; /**< For Alloc. */
328 free_attr free; /**< For Free. */
329 io_attr instof; /**< For InstOf */
330 cast_attr cast; /**< For Cast. */
331 load_attr load; /**< For Load. */
332 store_attr store; /**< For Store. */
333 phi_attr phi; /**< For Phi. */
334 long proj; /**< For Proj: contains the result position to project */
335 confirm_attr confirm; /**< For Confirm: compare operation and region. */
336 filter_attr filter; /**< For Filter */
337 except_attr except; /**< For Phi node construction in case of exceptions */
338 copyb_attr copyb; /**< For CopyB operation */
339 bound_attr bound; /**< For Bound operation */
340 conv_attr conv; /**< For Conv operation */
341 divmod_attr divmod; /**< For Div/Mod/DivMod operation */
342 asm_attr assem; /**< For ASM operation. */
346 * Edge info to put into an irn.
348 typedef struct _irn_edge_kind_info_t {
349 struct list_head outs_head; /**< The list of all outs. */
350 unsigned edges_built : 1; /**< Set edges where built for this node. */
351 unsigned out_count : 31; /**< Number of outs in the list. */
354 typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];
359 typedef struct _ir_def_use_edge {
360 ir_node *use; /** The use node of that edge. */
361 int pos; /** The position of this edge in use's input array. */
365 * The common structure of an irnode.
366 * If the node has some attributes, they are stored in the attr field.
369 /* ------- Basics of the representation ------- */
370 firm_kind kind; /**< Distinguishes this node from others. */
371 unsigned node_idx; /**< The node index of this node in its graph. */
372 ir_op *op; /**< The Opcode of this node. */
373 ir_mode *mode; /**< The Mode of this node. */
374 struct ir_node **in; /**< The array of predecessors / operands. */
375 ir_visited_t visited; /**< The visited counter for walks of the graph. */
376 void *link; /**< To attach additional information to the node, e.g.
377 used during optimization to link to nodes that
378 shall replace a node. */
379 long node_nr; /**< A globally unique node number for each node. */
380 /* ------- Fields for optimizations / analysis information ------- */
381 ir_def_use_edge *out; /**< array of def-use edges. */
382 struct dbg_info *dbi; /**< A pointer to information for debug support. */
383 /* ------- For debugging ------- */
385 unsigned out_valid : 1;
388 /* ------- For analyses -------- */
389 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
390 struct ir_node **deps; /**< Additional dependencies induced by state. */
392 irn_edges_info_t edge_info; /**< Everlasting out edges. */
394 /* ------- Opcode depending fields -------- */
395 attr attr; /**< The set of attributes of this node. Depends on opcode.
396 Must be last field of struct ir_node. */
399 #include "iredgeset.h"
402 * Edge info to put into an irg.
404 typedef struct _irg_edge_info_t {
405 ir_edgeset_t edges; /**< A set containing all edges of the current graph. */
406 struct list_head free_edges; /**< list of all free edges. */
407 struct obstack edges_obst; /**< Obstack, where edges are allocated on. */
408 unsigned allocated : 1; /**< Set if edges are allocated on the obstack. */
409 unsigned activated : 1; /**< Set if edges are activated for the graph. */
412 typedef irg_edge_info_t irg_edges_info_t[EDGE_KIND_LAST];
415 * Index constants for nodes that can be accessed through the graph anchor node.
418 anchor_end_block = 0, /**< block the end node will belong to, same as Anchors block */
419 anchor_start_block, /**< block the start node will belong to */
420 anchor_end, /**< end node of this ir_graph */
421 anchor_start, /**< start node of this ir_graph */
422 anchor_initial_exec, /**< methods initial control flow */
423 anchor_frame, /**< methods frame */
424 anchor_tls, /**< pointer to the thread local storage containing all
425 thread local data. */
426 anchor_initial_mem, /**< initial memory of this graph */
427 anchor_args, /**< methods arguments */
428 anchor_bad, /**< bad node of this ir_graph, the one and
429 only in this graph */
430 anchor_no_mem, /**< NoMem node of this ir_graph, the one and only in this graph */
434 /** A callgraph entry for callees. */
435 typedef struct cg_callee_entry {
436 ir_graph *irg; /**< The called irg. */
437 ir_node **call_list; /**< The list of all calls to the irg. */
438 int max_depth; /**< Maximum depth of all Call nodes to irg. */
442 * An ir_graph holds all information for a procedure.
445 firm_kind kind; /**< Always set to k_ir_graph. */
446 /* -- Basics of the representation -- */
447 unsigned last_node_idx; /**< The last IR node index for this graph. */
448 ir_entity *ent; /**< The entity of this procedure, i.e.,
449 the type of the procedure and the
450 class it belongs to. */
451 ir_type *frame_type; /**< A class type representing the stack frame.
452 Can include "inner" methods. */
453 ir_node *anchor; /**< Pointer to the anchor node of this graph. */
454 struct obstack *obst; /**< The obstack where all of the ir_nodes live. */
455 ir_node *current_block; /**< Current block for newly gen_*()-erated ir_nodes. */
456 struct obstack *extbb_obst; /**< The obstack for extended basic block info. */
458 /* -- Fields for graph properties -- */
459 irg_inline_property inline_property; /**< How to handle inlineing. */
460 unsigned additional_properties; /**< Additional graph properties. */
462 /* -- Fields indicating different states of irgraph -- */
463 ir_graph_state_t state;
464 irg_phase_state phase_state; /**< Compiler phase. */
465 op_pin_state irg_pinned_state; /**< Flag for status of nodes. */
466 irg_outs_state outs_state; /**< Out edges. */
467 irg_dom_state dom_state; /**< Dominator state information. */
468 irg_dom_state pdom_state; /**< Post Dominator state information. */
469 ir_typeinfo_state typeinfo_state; /**< Validity of type information. */
470 irg_callee_info_state callee_info_state; /**< Validity of callee information. */
471 irg_loopinfo_state loopinfo_state; /**< State of loop information. */
472 ir_class_cast_state class_cast_state; /**< Kind of cast operations in code. */
473 irg_extblk_info_state extblk_state; /**< State of extended basic block info. */
474 exec_freq_state execfreq_state; /**< Execution frequency state. */
475 ir_entity_usage_computed_state entity_usage_state;
476 unsigned mem_disambig_opt; /**< Options for the memory disambiguator. */
477 unsigned fp_model; /**< floating point model of the graph. */
479 /* -- Fields for construction -- */
480 int n_loc; /**< Number of local variables in this
481 procedure including procedure parameters. */
482 void **loc_descriptions; /**< Storage for local variable descriptions. */
484 /* -- Fields for optimizations / analysis information -- */
485 pset *value_table; /**< Hash table for global value numbering (cse)
486 for optimizing use in iropt.c */
487 ir_def_use_edge *outs; /**< Space for the Def-Use arrays. */
489 ir_loop *loop; /**< The outermost loop for this graph. */
490 void *link; /**< A void* field to link any information to
493 ir_graph **callers; /**< For callgraph analysis: list of caller graphs. */
494 unsigned *caller_isbe; /**< For callgraph analysis: raw bitset if backedge info calculated. */
495 cg_callee_entry **callees; /**< For callgraph analysis: list of callee calls */
496 unsigned *callee_isbe; /**< For callgraph analysis: raw bitset if backedge info calculated. */
497 ir_loop *l; /**< For callgraph analysis. */
498 int callgraph_loop_depth; /**< For callgraph analysis */
499 int callgraph_recursion_depth; /**< For callgraph analysis */
500 double method_execution_frequency; /**< For callgraph analysis */
503 /* -- Fields for Walking the graph -- */
504 ir_visited_t visited; /**< this flag is an identifier for
505 ir walk. it will be incremented
506 every time someone walks through
508 ir_visited_t block_visited; /**< same as visited, for a complete block */
510 ir_visited_t self_visited; /**< visited flag of the irg */
512 unsigned estimated_node_count; /**< estimated number of nodes in this graph,
513 updated after every walk */
514 irg_edges_info_t edge_info; /**< edge info for automatic outs */
515 ir_node **idx_irn_map; /**< Array mapping node indexes to nodes. */
517 int index; /**< a unique number for each graph */
518 ir_phase *phases[PHASE_LAST+1]; /**< Phase information. */
519 void *be_data; /**< backend can put in private data here */
521 unsigned dump_nr; /**< number of graph dumps */
523 int n_outs; /**< Size wasted for outs */
524 long graph_nr; /**< a unique graph number for each
525 graph to make output readable. */
529 ir_resources_t reserved_resources; /**< Bitset for tracking used local resources. */
534 * Data structure that holds central information about a program
536 * One irp is created by libFirm on construction, so irp should never be NULL.
538 * - main_irg: The ir graph that is the entry point to the program.
539 * (Anything not reachable from here may be optimized away
540 * if this irp represents a whole program.
541 * - irg: List of all ir graphs in the program or module.
542 * - type: A list containing all types known to the translated program.
543 * Some types can have several entries in this list (as a result of
544 * using exchange_types()).
545 * - glob_type: The unique global type that is owner of all global entities
549 firm_kind kind; /**< must be k_ir_prog */
550 ident *name; /**< A file name or the like. */
551 ir_graph *main_irg; /**< The entry point to the compiled program
552 or NULL if no point exists. */
553 ir_graph **graphs; /**< A list of all graphs in the ir. */
554 ir_graph *const_code_irg; /**< This ir graph gives the proper environment
555 to allocate nodes the represent values
556 of constant entities. It is not meant as
558 ir_type *segment_types[IR_SEGMENT_LAST+1];
559 ir_type **types; /**< A list of all types in the ir. */
560 ir_mode **modes; /**< A list of all modes in the ir. */
561 ir_op **opcodes; /**< A list of all opcodes in the ir. */
562 ident **global_asms; /**< An array of global ASM insertions. */
564 /* -- states of and access to generated information -- */
565 irg_phase_state phase_state; /**< The state of construction. */
567 irg_outs_state outs_state; /**< The state of out edges of ir nodes. */
568 ir_node **ip_outedges; /**< A huge Array that contains all out edges
569 in interprocedural view. */
570 irg_outs_state trouts_state; /**< The state of out edges of type information. */
572 irg_callee_info_state callee_info_state; /**< Validity of callee information.
573 Contains the lowest value or all irgs. */
574 ir_typeinfo_state typeinfo_state; /**< Validity of type information. */
575 inh_transitive_closure_state inh_trans_closure_state; /**< State of transitive closure
576 of inheritance relations. */
578 irp_callgraph_state callgraph_state; /**< The state of the callgraph. */
579 ir_loop *outermost_cg_loop; /**< For callgraph analysis: entry point
580 to looptree over callgraph. */
581 int max_callgraph_loop_depth; /**< needed in callgraph. */
582 int max_callgraph_recursion_depth; /**< needed in callgraph. */
583 double max_method_execution_frequency; /**< needed in callgraph. */
584 irp_temperature_state temperature_state; /**< accumulated temperatures computed? */
585 exec_freq_state execfreq_state; /**< The state of execution frequency information */
586 loop_nesting_depth_state lnd_state; /**< The state of loop nesting depth information. */
587 ir_class_cast_state class_cast_state; /**< The state of cast operations in code. */
588 ir_entity_usage_computed_state globals_entity_usage_state;
590 ir_exc_region_t last_region_nr; /**< The last exception region number that was assigned. */
591 ir_label_t last_label_nr; /**< The highest label number for generating unique labels. */
592 int max_irg_idx; /**< highest unused irg index */
593 long max_node_nr; /**< to generate unique numbers for nodes. */
594 unsigned dump_nr; /**< number of program info dumps */
596 ir_resources_t reserved_resources; /**< Bitset for tracking used global resources. */