#define FIRM_IR_IRDEFS_H
#include "firm_types.h"
-#include "firm_common_t.h"
#include "irdom_t.h"
#include "irmode.h"
#include "irnode.h"
#include "callgraph.h"
#include "irprog.h"
#include "field_temperature.h"
-#include "irphases_t.h"
+#include "irphase.h"
#include "pset.h"
#include "set.h"
#include "list.h"
#include "obst.h"
+#include "vrp.h"
-struct ir_phase;
+/**
+ * List of phases. (We will add a register/unregister interface if managing
+ * this gets too tedious)
+ */
+typedef enum ir_phase_id {
+ PHASE_VRP,
+ PHASE_LAST = PHASE_VRP
+} ir_phase_id;
/** The type of an ir_op. */
struct ir_op {
struct ir_mode {
firm_kind kind; /**< distinguishes this node from others */
ident *name; /**< Name ident of this mode */
+ ir_type *type; /**< corresponding primitive type */
/* ----------------------------------------------------------------------- */
/* On changing this struct you have to evaluate the mode_are_equal function!*/
const void *tv_priv; /**< tarval module will save private data here */
};
-/** ir node attributes **/
+/* ir node attributes */
+
+/** first attribute of Bad, Block, Anchor nodes */
+typedef struct {
+ ir_graph *irg; /**< The graph this block like node belongs to. */
+} irg_attr;
/** Block attributes */
typedef struct {
/* General attributes */
- ir_graph *irg; /**< The graph this block belongs to. */
+ irg_attr irg; /**< The graph this block belongs to. */
ir_visited_t block_visited; /**< For the walker that walks over all blocks. */
/* Attributes private to construction: */
unsigned is_matured:1; /**< If set, all in-nodes of the block are fixed. */
/** Cond attributes. */
typedef struct {
- cond_kind kind; /**< flavor of Cond */
long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
cond_jmp_predicate jmp_pred; /**< only for binary Conds: The jump predication. */
} cond_attr;
/** Const attributes. */
typedef struct {
- tarval *tv; /**< the target value */
- ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
+ tarval *tarval; /**< the target value */
+ ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
} const_attr;
/** SymConst attributes. */
op_pin_state pin_state; /**< the pin state for operations that might generate a exception:
If it's know that no exception will be generated, could be set to
op_pin_state_floats. */
-#if PRECISE_EXC_CONTEXT
struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
-#endif
} except_attr;
/** Call attributes. */
typedef struct {
- except_attr exc; /**< the exception attribute. MUST be the first one. */
- ir_type *type; /**< type of called procedure */
- ir_entity ** callee_arr; /**< result of callee analysis */
+ except_attr exc; /**< the exception attribute. MUST be the first one. */
+ ir_type *type; /**< type of called procedure */
+ ir_entity **callee_arr; /**< result of callee analysis */
+ unsigned tail_call:1; /**< if set, can be a tail call */
} call_attr;
/** Builtin attributes. */
ir_type *type; /**< the type of which the object pointer must be */
} io_attr;
-/** Filter attributes. */
-typedef struct {
- long proj; /**< contains the result position to project (Proj) */
- ir_node **in_cg; /**< array with interprocedural predecessors (Phi) */
- unsigned *backedge; /**< Raw Bitfield n set to true if pred n is backedge. */
-} filter_attr;
-
-/** CallBegin attributes. */
-typedef struct {
- ir_node *call; /**< Associated Call-operation. */
-} callbegin_attr;
-
/** Cast attributes. */
typedef struct {
ir_type *type; /**< Type of the casted node. */
/** Inline Assembler support attribute. */
typedef struct {
/* BEWARE: pin state MUST be the first attribute */
- op_pin_state pin_state; /**< the pin state for operations that might generate a exception */
- ident *asm_text; /**< The inline assembler text. */
- ir_asm_constraint *inputs; /**< Input constraints. */
- ir_asm_constraint *outputs; /**< Output constraints. */
- ident **clobber; /**< List of clobbered registers. */
+ op_pin_state pin_state; /**< the pin state for operations that might generate a exception */
+ ident *text; /**< The inline assembler text. */
+ ir_asm_constraint *input_constraints; /**< Input constraints. */
+ ir_asm_constraint *output_constraints; /**< Output constraints. */
+ ident **clobbers; /**< List of clobbered registers. */
} asm_attr;
/** Some IR-nodes just have one attribute, these are stored here,
some have more. Their name is 'irnodename_attr' */
typedef union {
+ irg_attr irg; /**< For Blocks and Bad: its belonging irg */
block_attr block; /**< For Block: Fields needed to construct it */
cond_attr cond; /**< For Cond. */
const_attr con; /**< For Const: contains the value of the constant and a type */
sel_attr sel; /**< For Sel. */
call_attr call; /**< For Call. */
builtin_attr builtin; /**< For Builtin. */
- callbegin_attr callbegin; /**< For CallBegin. */
alloc_attr alloc; /**< For Alloc. */
free_attr free; /**< For Free. */
io_attr instof; /**< For InstOf */
phi_attr phi; /**< For Phi. */
long proj; /**< For Proj: contains the result position to project */
confirm_attr confirm; /**< For Confirm: compare operation and region. */
- filter_attr filter; /**< For Filter */
except_attr except; /**< For Phi node construction in case of exceptions */
copyb_attr copyb; /**< For CopyB operation */
bound_attr bound; /**< For Bound operation */
/**
* Edge info to put into an irn.
*/
-typedef struct _irn_edge_kind_info_t {
+typedef struct irn_edge_kind_info_t {
struct list_head outs_head; /**< The list of all outs. */
- int out_count; /**< Number of outs in the list. */
+ unsigned edges_built : 1; /**< Set edges where built for this node. */
+ unsigned out_count : 31; /**< Number of outs in the list. */
} irn_edge_info_t;
typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];
/**
* A Def-Use edge.
*/
-typedef struct _ir_def_use_edge {
+typedef struct ir_def_use_edge {
ir_node *use; /** The use node of that edge. */
int pos; /** The position of this edge in use's input array. */
} ir_def_use_edge;
struct ir_node **deps; /**< Additional dependencies induced by state. */
void *backend_info;
irn_edges_info_t edge_info; /**< Everlasting out edges. */
+
/* ------- Opcode depending fields -------- */
attr attr; /**< The set of attributes of this node. Depends on opcode.
Must be last field of struct ir_node. */
/**
* Edge info to put into an irg.
*/
-typedef struct _irg_edge_info_t {
+typedef struct irg_edge_info_t {
ir_edgeset_t edges; /**< A set containing all edges of the current graph. */
struct list_head free_edges; /**< list of all free edges. */
struct obstack edges_obst; /**< Obstack, where edges are allocated on. */
anchor_start_block, /**< block the start node will belong to */
anchor_end, /**< end node of this ir_graph */
anchor_start, /**< start node of this ir_graph */
- anchor_end_reg, /**< end node of this ir_graph */
- anchor_end_except, /**< end node of this ir_graph */
anchor_initial_exec, /**< methods initial control flow */
anchor_frame, /**< methods frame */
anchor_tls, /**< pointer to the thread local storage containing all
unsigned additional_properties; /**< Additional graph properties. */
/* -- Fields indicating different states of irgraph -- */
- unsigned state;
- irg_phase_state phase_state; /**< Compiler phase. */
- op_pin_state irg_pinned_state; /**< Flag for status of nodes. */
- irg_outs_state outs_state; /**< Out edges. */
- irg_dom_state dom_state; /**< Dominator state information. */
- irg_dom_state pdom_state; /**< Post Dominator state information. */
- ir_typeinfo_state typeinfo_state; /**< Validity of type information. */
+ ir_graph_state_t state;
+ irg_phase_state phase_state; /**< Compiler phase. */
+ op_pin_state irg_pinned_state; /**< Flag for status of nodes. */
+ irg_outs_state outs_state; /**< Out edges. */
+ irg_dom_state dom_state; /**< Dominator state information. */
+ irg_dom_state pdom_state; /**< Post Dominator state information. */
+ ir_typeinfo_state typeinfo_state; /**< Validity of type information. */
irg_callee_info_state callee_info_state; /**< Validity of callee information. */
- irg_loopinfo_state loopinfo_state; /**< State of loop information. */
- ir_class_cast_state class_cast_state; /**< Kind of cast operations in code. */
+ irg_loopinfo_state loopinfo_state; /**< State of loop information. */
+ ir_class_cast_state class_cast_state; /**< Kind of cast operations in code. */
irg_extblk_info_state extblk_state; /**< State of extended basic block info. */
- exec_freq_state execfreq_state; /**< Execution frequency state. */
+ exec_freq_state execfreq_state; /**< Execution frequency state. */
ir_entity_usage_computed_state entity_usage_state;
unsigned mem_disambig_opt; /**< Options for the memory disambiguator. */
unsigned fp_model; /**< floating point model of the graph. */
ir_node **idx_irn_map; /**< Array mapping node indexes to nodes. */
int index; /**< a unique number for each graph */
- ir_phase *phases[PHASE_LAST]; /**< Phase information. */
+ ir_phase *phases[PHASE_LAST+1]; /**< Phase information. */
+ void *be_data; /**< backend can put in private data here */
+
+ unsigned dump_nr; /**< number of graph dumps */
#ifdef DEBUG_libfirm
int n_outs; /**< Size wasted for outs */
long graph_nr; /**< a unique graph number for each
#endif
};
-/** ir_prog */
+/**
+ * Data structure that holds central information about a program
+ * or a module.
+ * One irp is created by libFirm on construction, so irp should never be NULL.
+ *
+ * - main_irg: The ir graph that is the entry point to the program.
+ * (Anything not reachable from here may be optimized away
+ * if this irp represents a whole program.
+ * - irg: List of all ir graphs in the program or module.
+ * - type: A list containing all types known to the translated program.
+ * Some types can have several entries in this list (as a result of
+ * using exchange_types()).
+ * - glob_type: The unique global type that is owner of all global entities
+ * of this module.
+ */
struct ir_prog {
firm_kind kind; /**< must be k_ir_prog */
ident *name; /**< A file name or the like. */
ir_graph *main_irg; /**< The entry point to the compiled program
or NULL if no point exists. */
ir_graph **graphs; /**< A list of all graphs in the ir. */
- ir_graph **pseudo_graphs; /**< A list of all pseudo graphs in the ir. See pseudo_irg.c */
ir_graph *const_code_irg; /**< This ir graph gives the proper environment
to allocate nodes the represent values
of constant entities. It is not meant as
a procedure. */
- ir_type *segment_types[IR_SEGMENT_COUNT];
+ ir_type *segment_types[IR_SEGMENT_LAST+1];
ir_type **types; /**< A list of all types in the ir. */
ir_mode **modes; /**< A list of all modes in the ir. */
ir_op **opcodes; /**< A list of all opcodes in the ir. */
/* -- states of and access to generated information -- */
irg_phase_state phase_state; /**< The state of construction. */
- ip_view_state ip_view; /**< The state of interprocedural view. */
-
irg_outs_state outs_state; /**< The state of out edges of ir nodes. */
ir_node **ip_outedges; /**< A huge Array that contains all out edges
in interprocedural view. */
ir_label_t last_label_nr; /**< The highest label number for generating unique labels. */
int max_irg_idx; /**< highest unused irg index */
long max_node_nr; /**< to generate unique numbers for nodes. */
+ unsigned dump_nr; /**< number of program info dumps */
#ifndef NDEBUG
ir_resources_t reserved_resources; /**< Bitset for tracking used global resources. */
#endif
projects / libfirm / blobdiff