2 * Copyright (C) 1995-2011 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"
52 * List of phases. (We will add a register/unregister interface if managing
53 * this gets too tedious)
55 typedef enum ir_phase_id {
57 PHASE_VRP = PHASE_FIRST,
58 PHASE_LAST = PHASE_VRP
60 ENUM_COUNTABLE(ir_phase_id)
62 /** The type of an ir_op. */
64 unsigned code; /**< The unique opcode of the op. */
65 ident *name; /**< The name of the op. */
66 size_t attr_size; /**< Space needed in memory for private attributes
68 op_pin_state pin_state; /**< How to deal with the node in CSE, PRE. */
69 op_arity opar; /**< The arity of operator. */
70 int op_index; /**< The index of the first data operand, 0 for
71 most cases, 1 for Div etc. */
72 int fragile_mem_index; /**< index of memory input for fragile nodes */
73 int pn_x_regular; /**< for fragile ops the position of the
75 int pn_x_except; /**< for fragile ops the position of the
77 unsigned flags; /**< Flags describing the behavior of the ir_op,
78 a bitmasks of irop_flags. */
79 unsigned tag; /**< Some custom TAG value the op's creator set */
80 void *attr; /**< custom pointer where op's creator can attach
81 attribute stuff to. */
82 ir_op_ops ops; /**< The operations of the this op. */
86 * Contains relevant information about a mode.
88 * Necessary information about a mode is stored in this struct
89 * which is used by the tarval module to perform calculations
90 * and comparisons of values of a such described mode.
93 * - ident *name: Name of this mode. Two modes are different if the name is different.
94 * - ir_mode_sort sort: sort of mode specifying possible usage categories
95 * - int size: size of the mode in Bits.
96 * - unsigned sign:1: signedness of this mode
98 * - modulo_shift specifies for modes of kind irms_int_number
99 * whether shift applies modulo to value of bits to shift
102 * The tech report 1999-44 describing FIRM and predefined modes
106 firm_kind kind; /**< distinguishes this node from others */
107 ident *name; /**< Name ident of this mode */
108 ir_type *type; /**< corresponding primitive type */
110 /* ----------------------------------------------------------------------- */
111 /* On changing this struct you have to evaluate the mode_are_equal function!*/
112 ir_mode_sort sort; /**< coarse classification of this mode:
113 int, float, reference ...
116 arithmetic; /**< different arithmetic operations possible with a mode */
117 unsigned size; /**< size of the mode in Bits. */
118 unsigned sign:1; /**< signedness of this mode */
119 unsigned int modulo_shift; /**< number of bits a values of this mode will be shifted */
120 unsigned vector_elem; /**< if this is not equal 1, this is a vector mode with
121 vector_elem number of elements, size contains the size
122 of all bits and must be dividable by vector_elem */
124 /* ----------------------------------------------------------------------- */
125 ir_tarval *min; /**< the minimum value that can be expressed */
126 ir_tarval *max; /**< the maximum value that can be expressed */
127 ir_tarval *null; /**< the value 0 */
128 ir_tarval *one; /**< the value 1 */
129 ir_tarval *minus_one; /**< the value -1 */
130 ir_tarval *all_one; /**< the value ~0 */
131 ir_mode *eq_signed; /**< For pointer modes, the equivalent signed integer one. */
132 ir_mode *eq_unsigned; /**< For pointer modes, the equivalent unsigned integer one. */
133 void *link; /**< To store some intermediate information */
134 const void *tv_priv; /**< tarval module will save private data here */
137 /* ir node attributes */
139 /** first attribute of Bad, Block, Anchor nodes */
140 typedef struct irg_attr {
141 ir_graph *irg; /**< The graph this block like node belongs to. */
144 typedef struct bad_attr {
148 typedef struct anchor_attr {
152 /** Block attributes */
153 typedef struct block_attr {
154 /* General attributes */
155 irg_attr irg; /**< The graph this block belongs to. */
156 ir_visited_t block_visited; /**< For the walker that walks over all blocks. */
157 /* Attributes private to construction: */
158 unsigned is_matured:1; /**< If set, all in-nodes of the block are fixed. */
159 unsigned marked:1; /**< Can be set/unset to temporary mark a block. */
160 ir_node **graph_arr; /**< An array to store all parameters. */
161 /* Attributes holding analyses information */
162 ir_dom_info dom; /**< Datastructure that holds information about dominators.
164 Eventually overlay with graph_arr as only valid
165 in different phases. Eventually inline the whole
167 ir_dom_info pdom; /**< Datastructure that holds information about post-dominators. */
168 ir_node ** in_cg; /**< array with predecessors in
169 * interprocedural_view, if they differ
170 * from intraprocedural predecessors */
171 bitset_t *backedge; /**< Bitfield n set to true if pred n is backedge.*/
172 bitset_t *cg_backedge; /**< Bitfield n set to true if pred n is interprocedural backedge. */
173 ir_extblk *extblk; /**< The extended basic block this block belongs to. */
174 ir_region *region; /**< The immediate structural region this block belongs to. */
175 ir_entity *entity; /**< entitiy representing this block */
176 ir_node *phis; /**< The list of Phi nodes in this block. */
178 struct list_head succ_head; /**< A list head for all successor edges of a block. */
181 /** Cond attributes. */
182 typedef struct cond_attr {
183 long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
184 cond_jmp_predicate jmp_pred; /**< only for binary Conds: The jump predication. */
187 /** Const attributes. */
188 typedef struct const_attr {
189 ir_tarval *tarval; /**< the target value */
192 /** SymConst attributes. */
193 typedef struct symconst_attr {
194 symconst_symbol sym; // old tori
198 /** Sel attributes. */
199 typedef struct sel_attr {
200 ir_entity *entity; /**< entity to select */
203 /** Exception attributes. */
204 typedef struct except_attr {
205 unsigned pin_state : 2; /**< the pin state for operations with
206 variable pinned state. Contains a
208 unsigned throws_exception : 1; /**< if true a fragile op throws and
209 must produce X_except and X_regular
213 /** Call attributes. */
214 typedef struct call_attr {
215 except_attr exc; /**< the exception attribute. MUST be the first one. */
216 ir_type *type; /**< type of called procedure */
217 ir_entity **callee_arr; /**< result of callee analysis */
218 unsigned tail_call:1; /**< if set, can be a tail call */
221 /** Builtin attributes. */
222 typedef struct builtin_attr {
223 except_attr exc; /**< the exception attribute. MUST be the first one. */
224 ir_builtin_kind kind; /**< kind of the called builtin procedure */
225 ir_type *type; /**< type of called builtin procedure */
228 /** Alloc attributes. */
229 typedef struct alloc_attr {
230 except_attr exc; /**< the exception attribute. MUST be the first one. */
231 ir_where_alloc where; /**< stack, heap or other managed part of memory */
232 ir_type *type; /**< Type of the allocated object. */
235 /** Free attributes. */
236 typedef struct free_attr {
237 ir_type *type; /**< Type of the allocated object. */
238 ir_where_alloc where; /**< stack, heap or other managed part of memory */
241 /** InstOf attributes. */
242 typedef struct io_attr {
243 except_attr exc; /**< the exception attribute. MUST be the first one. */
244 ir_type *type; /**< the type of which the object pointer must be */
247 /** Cast attributes. */
248 typedef struct cast_attr {
249 ir_type *type; /**< Type of the casted node. */
252 /** Load attributes. */
253 typedef struct load_attr {
254 except_attr exc; /**< The exception attribute. MUST be the first one. */
255 unsigned volatility:1; /**< The volatility of this Load operation. */
256 unsigned unaligned:1; /**< The align attribute of this Load operation. */
257 ir_mode *mode; /**< The mode of this Load operation. */
260 /** Store attributes. */
261 typedef struct store_attr {
262 except_attr exc; /**< the exception attribute. MUST be the first one. */
263 unsigned volatility:1; /**< The volatility of this Store operation. */
264 unsigned unaligned:1; /**< The align attribute of this Store operation. */
267 typedef struct phi_attr {
268 ir_node *next; /**< Points to the next Phi in the Phi list of a block. */
270 bitset_t *backedge; /**< Raw Bitfield: bit n is set to true if pred n is backedge. */
271 int pos; /**< For Phi0. Used to remember the value defined by
272 this Phi node. Needed when the Phi is completed
273 to call get_r_internal_value() to find the
274 predecessors. If this attribute is set, the Phi
275 node takes the role of the obsolete Phi0 node,
276 therefore the name. */
280 /**< Cmp attribute. */
281 typedef struct cmp_attr {
282 ir_relation relation; /**< comparison condition. */
285 /**< Confirm attribute. */
286 typedef struct confirm_attr {
287 ir_relation relation; /**< relation between value and bound */
290 /** CopyB attribute. */
291 typedef struct copyb_attr {
292 except_attr exc; /**< The exception attribute. MUST be the first one. */
293 ir_type *type; /**< Type of the copied entity. */
296 /** Bound attribute. */
297 typedef struct bound_attr {
298 except_attr exc; /**< The exception attribute. MUST be the first one. */
301 /** Conv attribute. */
302 typedef struct conv_attr {
303 char strict; /**< If set, this is a strict Conv that cannot be removed. */
306 /** Div attribute. */
307 typedef struct div_attr {
308 except_attr exc; /**< The exception attribute. MUST be the first one. */
309 ir_mode *resmode; /**< Result mode for the division. */
310 char no_remainder; /**< Set, if known that a division can be done without a remainder. */
313 /** Mod attribute. */
314 typedef struct mod_attr {
315 except_attr exc; /**< The exception attribute. MUST be the first one. */
316 ir_mode *resmode; /**< Result mode for the division. */
319 /** Inline Assembler support attribute. */
320 typedef struct asm_attr {
321 /* BEWARE: pin state MUST be the first attribute */
322 op_pin_state pin_state; /**< the pin state for operations that might generate a exception */
323 ident *text; /**< The inline assembler text. */
324 ir_asm_constraint *input_constraints; /**< Input constraints. */
325 ir_asm_constraint *output_constraints; /**< Output constraints. */
326 ident **clobbers; /**< List of clobbered registers. */
329 typedef struct proj_attr {
330 long proj; /**< position of tuple sub-value which is projected */
333 /** Some IR-nodes just have one attribute, these are stored here,
334 some have more. Their name is 'irnodename_attr' */
335 typedef union ir_attr {
336 irg_attr irg; /**< For Blocks and Bad: its belonging irg */
337 bad_attr bad; /**< for Bads: irg reference */
338 anchor_attr anchor; /**< for Anchor: irg reference */
339 block_attr block; /**< For Block: Fields needed to construct it */
340 cmp_attr cmp; /**< For Cmp. */
341 cond_attr cond; /**< For Cond. */
342 const_attr con; /**< For Const: contains the value of the constant and a type */
343 symconst_attr symc; /**< For SymConst. */
344 sel_attr sel; /**< For Sel. */
345 call_attr call; /**< For Call. */
346 builtin_attr builtin; /**< For Builtin. */
347 alloc_attr alloc; /**< For Alloc. */
348 free_attr free; /**< For Free. */
349 io_attr instof; /**< For InstOf */
350 cast_attr cast; /**< For Cast. */
351 load_attr load; /**< For Load. */
352 store_attr store; /**< For Store. */
353 phi_attr phi; /**< For Phi. */
354 proj_attr proj; /**< For Proj. */
355 confirm_attr confirm; /**< For Confirm: compare operation and region. */
356 except_attr except; /**< For Phi node construction in case of exceptions */
357 copyb_attr copyb; /**< For CopyB operation */
358 bound_attr bound; /**< For Bound operation */
359 conv_attr conv; /**< For Conv operation */
360 div_attr div; /**< For Div operation */
361 mod_attr mod; /**< For Mod operation */
362 asm_attr assem; /**< For ASM operation. */
366 * Edge info to put into an irn.
368 typedef struct irn_edge_kind_info_t {
369 struct list_head outs_head; /**< The list of all outs. */
370 unsigned edges_built : 1; /**< Set edges where built for this node. */
371 unsigned out_count : 31; /**< Number of outs in the list. */
374 typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];
379 typedef struct ir_def_use_edge {
380 ir_node *use; /** The use node of that edge. */
381 int pos; /** The position of this edge in use's input array. */
385 * The common structure of an irnode.
386 * If the node has some attributes, they are stored in the attr field.
389 /* ------- Basics of the representation ------- */
390 firm_kind kind; /**< Distinguishes this node from others. */
391 unsigned node_idx; /**< The node index of this node in its graph. */
392 ir_op *op; /**< The Opcode of this node. */
393 ir_mode *mode; /**< The Mode of this node. */
394 struct ir_node **in; /**< The array of predecessors / operands. */
395 ir_visited_t visited; /**< The visited counter for walks of the graph. */
396 void *link; /**< To attach additional information to the node, e.g.
397 used during optimization to link to nodes that
398 shall replace a node. */
399 long node_nr; /**< A globally unique node number for each node. */
400 /* ------- Fields for optimizations / analysis information ------- */
401 ir_def_use_edge *out; /**< array of def-use edges. */
402 struct dbg_info *dbi; /**< A pointer to information for debug support. */
403 /* ------- For debugging ------- */
405 unsigned out_valid : 1;
408 /* ------- For analyses -------- */
409 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
410 struct ir_node **deps; /**< Additional dependencies induced by state. */
412 irn_edges_info_t edge_info; /**< Everlasting out edges. */
414 /* ------- Opcode depending fields -------- */
415 ir_attr attr; /**< The set of attributes of this node. Depends on opcode.
416 Must be last field of struct ir_node. */
419 #include "iredgeset.h"
422 * Edge info to put into an irg.
424 typedef struct irg_edge_info_t {
425 ir_edgeset_t edges; /**< A set containing all edges of the current graph. */
426 struct list_head free_edges; /**< list of all free edges. */
427 struct obstack edges_obst; /**< Obstack, where edges are allocated on. */
428 unsigned allocated : 1; /**< Set if edges are allocated on the obstack. */
429 unsigned activated : 1; /**< Set if edges are activated for the graph. */
432 typedef irg_edge_info_t irg_edges_info_t[EDGE_KIND_LAST];
435 * Index constants for nodes that can be accessed through the graph anchor node.
438 anchor_end_block = 0, /**< block the end node will belong to, same as Anchors block */
439 anchor_start_block, /**< block the start node will belong to */
440 anchor_end, /**< end node of this ir_graph */
441 anchor_start, /**< start node of this ir_graph */
442 anchor_initial_exec, /**< methods initial control flow */
443 anchor_frame, /**< methods frame */
444 anchor_initial_mem, /**< initial memory of this graph */
445 anchor_args, /**< methods arguments */
446 anchor_no_mem, /**< NoMem node of this ir_graph, the one and only in this graph */
450 /** A callgraph entry for callees. */
451 typedef struct cg_callee_entry {
452 ir_graph *irg; /**< The called irg. */
453 ir_node **call_list; /**< The list of all calls to the irg. */
454 size_t max_depth; /**< Maximum depth of all Call nodes to irg. */
458 * An ir_graph holds all information for a procedure.
461 firm_kind kind; /**< Always set to k_ir_graph. */
462 /* -- Basics of the representation -- */
463 unsigned last_node_idx; /**< The last IR node index for this graph. */
464 ir_entity *ent; /**< The entity of this procedure, i.e.,
465 the type of the procedure and the
466 class it belongs to. */
467 ir_type *frame_type; /**< A class type representing the stack frame.
468 Can include "inner" methods. */
469 ir_node *anchor; /**< Pointer to the anchor node of this graph. */
470 struct obstack *obst; /**< The obstack where all of the ir_nodes live. */
471 ir_node *current_block; /**< Current block for newly gen_*()-erated ir_nodes. */
472 struct obstack *extbb_obst; /**< The obstack for extended basic block info. */
474 /* -- Fields for graph properties -- */
475 irg_inline_property inline_property; /**< How to handle inlineing. */
476 mtp_additional_properties additional_properties; /**< Additional graph properties. */
478 /* -- Fields indicating different states of irgraph -- */
479 ir_graph_state_t state;
480 irg_phase_state phase_state; /**< Compiler phase. */
481 op_pin_state irg_pinned_state; /**< Flag for status of nodes. */
482 irg_outs_state outs_state; /**< Out edges. */
483 irg_dom_state dom_state; /**< Dominator state information. */
484 irg_dom_state pdom_state; /**< Post Dominator state information. */
485 ir_typeinfo_state typeinfo_state; /**< Validity of type information. */
486 irg_callee_info_state callee_info_state; /**< Validity of callee information. */
487 irg_loopinfo_state loopinfo_state; /**< State of loop information. */
488 ir_class_cast_state class_cast_state; /**< Kind of cast operations in code. */
489 irg_extblk_info_state extblk_state; /**< State of extended basic block info. */
490 exec_freq_state execfreq_state; /**< Execution frequency state. */
491 ir_entity_usage_computed_state entity_usage_state;
492 unsigned mem_disambig_opt; /**< Options for the memory disambiguator. */
493 unsigned fp_model; /**< floating point model of the graph. */
495 /* -- Fields for construction -- */
496 int n_loc; /**< Number of local variables in this
497 procedure including procedure parameters. */
498 void **loc_descriptions; /**< Storage for local variable descriptions. */
500 /* -- Fields for optimizations / analysis information -- */
501 pset *value_table; /**< Hash table for global value numbering (cse)
502 for optimizing use in iropt.c */
503 ir_def_use_edge *outs; /**< Space for the Def-Use arrays. */
505 ir_loop *loop; /**< The outermost loop for this graph. */
506 void *link; /**< A void* field to link any information to
509 ir_graph **callers; /**< For callgraph analysis: list of caller graphs. */
510 unsigned *caller_isbe; /**< For callgraph analysis: raw bitset if backedge info calculated. */
511 cg_callee_entry **callees; /**< For callgraph analysis: list of callee calls */
512 unsigned *callee_isbe; /**< For callgraph analysis: raw bitset if backedge info calculated. */
513 ir_loop *l; /**< For callgraph analysis. */
514 size_t callgraph_loop_depth; /**< For callgraph analysis */
515 size_t callgraph_recursion_depth; /**< For callgraph analysis */
516 double method_execution_frequency; /**< For callgraph analysis */
519 /* -- Fields for Walking the graph -- */
520 ir_visited_t visited; /**< this flag is an identifier for
521 ir walk. it will be incremented
522 every time someone walks through
524 ir_visited_t block_visited; /**< same as visited, for a complete block */
526 ir_visited_t self_visited; /**< visited flag of the irg */
528 unsigned estimated_node_count; /**< estimated number of nodes in this graph,
529 updated after every walk */
530 irg_edges_info_t edge_info; /**< edge info for automatic outs */
531 ir_node **idx_irn_map; /**< Array mapping node indexes to nodes. */
533 size_t index; /**< a unique number for each graph */
534 ir_phase *phases[PHASE_LAST+1]; /**< Phase information. */
535 void *be_data; /**< backend can put in private data here */
537 unsigned dump_nr; /**< number of graph dumps */
539 int n_outs; /**< Size wasted for outs */
540 long graph_nr; /**< a unique graph number for each
541 graph to make output readable. */
545 ir_resources_t reserved_resources; /**< Bitset for tracking used local resources. */
550 * Data structure that holds central information about a program
552 * One irp is created by libFirm on construction, so irp should never be NULL.
554 * - main_irg: The ir graph that is the entry point to the program.
555 * (Anything not reachable from here may be optimized away
556 * if this irp represents a whole program.
557 * - irg: List of all ir graphs in the program or module.
558 * - type: A list containing all types known to the translated program.
559 * Some types can have several entries in this list (as a result of
560 * using exchange_types()).
561 * - glob_type: The unique global type that is owner of all global entities
565 firm_kind kind; /**< must be k_ir_prog */
566 ident *name; /**< A file name or the like. */
567 ir_graph *main_irg; /**< The entry point to the compiled program
568 or NULL if no point exists. */
569 ir_graph **graphs; /**< A list of all graphs in the ir. */
570 ir_graph *const_code_irg; /**< This ir graph gives the proper environment
571 to allocate nodes the represent values
572 of constant entities. It is not meant as
574 ir_type *segment_types[IR_SEGMENT_LAST+1];
575 ir_type **types; /**< A list of all types in the ir. */
576 ir_mode **modes; /**< A list of all modes in the ir. */
577 ir_op **opcodes; /**< A list of all opcodes in the ir. */
578 ident **global_asms; /**< An array of global ASM insertions. */
580 /* -- states of and access to generated information -- */
581 irg_phase_state phase_state; /**< The state of construction. */
583 irg_outs_state outs_state; /**< The state of out edges of ir nodes. */
584 ir_node **ip_outedges; /**< A huge Array that contains all out edges
585 in interprocedural view. */
586 irg_outs_state trouts_state; /**< The state of out edges of type information. */
588 irg_callee_info_state callee_info_state; /**< Validity of callee information.
589 Contains the lowest value or all irgs. */
590 ir_typeinfo_state typeinfo_state; /**< Validity of type information. */
591 inh_transitive_closure_state inh_trans_closure_state; /**< State of transitive closure
592 of inheritance relations. */
594 irp_callgraph_state callgraph_state; /**< The state of the callgraph. */
595 ir_loop *outermost_cg_loop; /**< For callgraph analysis: entry point
596 to looptree over callgraph. */
597 size_t max_callgraph_loop_depth; /**< needed in callgraph. */
598 size_t max_callgraph_recursion_depth; /**< needed in callgraph. */
599 double max_method_execution_frequency; /**< needed in callgraph. */
600 irp_temperature_state temperature_state; /**< accumulated temperatures computed? */
601 exec_freq_state execfreq_state; /**< The state of execution frequency information */
602 loop_nesting_depth_state lnd_state; /**< The state of loop nesting depth information. */
603 ir_class_cast_state class_cast_state; /**< The state of cast operations in code. */
604 ir_entity_usage_computed_state globals_entity_usage_state;
606 ir_exc_region_t last_region_nr; /**< The last exception region number that was assigned. */
607 ir_label_t last_label_nr; /**< The highest label number for generating unique labels. */
608 size_t max_irg_idx; /**< highest unused irg index */
609 long max_node_nr; /**< to generate unique numbers for nodes. */
610 unsigned dump_nr; /**< number of program info dumps */
612 ir_resources_t reserved_resources; /**< Bitset for tracking used global resources. */