unsigned activated : 1;
} irg_edge_info_t;
+/**
+ * Index constants for nodes that can be accessed through the graph itself.
+ */
+enum irg_anchors {
+ anchor_start_block = 0, /**< block the start node will belong to */
+ anchor_start, /**< start node of this ir_graph */
+ anchor_end_block, /**< block the end node will belong to */
+ anchor_end, /**< end node of this ir_graph */
+ anchor_end_reg, /**< end node of this ir_graph */
+ anchor_end_except, /**< end node of this ir_graph */
+ anchor_frame, /**< method's frame */
+ anchor_globals, /**< pointer to the data segment containing all
+ globals as well as global procedures. */
+ anchor_tls, /**< pointer to the thread local storage containing all
+ thread local data. */
+ anchor_initial_mem, /**< initial memory of this graph */
+ anchor_args, /**< methods arguments */
+ anchor_bad, /**< bad node of this ir_graph, the one and
+ only in this graph */
+ anchor_no_mem, /**< NoMem node of this ir_graph, the one and only in this graph */
+ anchor_max
+};
/** ir_graph holds all information for a procedure */
struct ir_graph {
firm_kind kind; /**< always set to k_ir_graph*/
/* -- Basics of the representation -- */
- struct entity *ent; /**< The entity of this procedure, i.e.,
+ entity *ent; /**< The entity of this procedure, i.e.,
the type of the procedure and the
class it belongs to. */
- ir_type *frame_type; /**< A class type representing the stack frame.
- Can include "inner" methods. */
- ir_node *start_block; /**< block the start node will belong to */
- ir_node *start; /**< start node of this ir_graph */
- ir_node *end_block; /**< block the end node will belong to */
- ir_node *end; /**< end node of this ir_graph */
- ir_node *end_reg; /**< end node of this ir_graph */
- ir_node *end_except; /**< end node of this ir_graph */
- ir_node *cstore; /**< constant store -- no more needed!! */
- ir_node *frame; /**< method's frame */
- ir_node *globals; /**< pointer to the data segment containing all
- globals as well as global procedures. */
- ir_node *initial_mem; /**< initial memory of this graph */
- ir_node *args; /**< methods arguments */
- ir_node **proj_args; /**< projs of the methods arguments */
- ir_node *bad; /**< bad node of this ir_graph, the one and
- only in this graph */
- ir_node *no_mem; /**< NoMem node of this ir_graph, the one and
- only in this graph */
- /* GL removed: we need unknown with mode for analyses. */
- /* struct ir_node *unknown;*/ /**< unknown node of this ir_graph */
+ ir_type *frame_type; /**< A class type representing the stack frame.
+ Can include "inner" methods. */
+ ir_node *anchors[anchor_max]; /**< anchor nodes */
+ ir_node **proj_args; /**< projs of the methods arguments */
struct obstack *obst; /**< obstack where all of the ir_nodes live */
ir_node *current_block; /**< block for newly gen_*()-erated ir_nodes */
struct obstack *extbb_obst; /**< obstack for extended basic block info */
+ unsigned last_node_idx; /**< last IR node index for this graph */
+
/* -- Fields for graph properties -- */
irg_inline_property inline_property; /**< How to handle inlineing. */
unsigned additional_properties; /**< additional graph properties. */
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 information */
+ 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 */
#endif
int n_loc; /**< number of local variable in this
procedure including procedure parameters. */
- void **loc_descriptions; /**< storage for local variable desriptions */
+ void **loc_descriptions; /**< storage for local variable descriptions */
/* -- Fields for optimizations / analysis information -- */
pset *value_table; /**< hash table for global value numbering (cse)
for optimizing use in iropt.c */
- struct ir_node **outs; /**< Space for the out arrays. */
+ ir_node **outs; /**< Space for the out arrays. */
-#ifdef DEBUG_libfirm
- int n_outs; /**< Size wasted for outs */
-#endif /* defined DEBUG_libfirm */
- struct ir_loop *loop; /**< The outermost loop */
+ ir_loop *loop; /**< The outermost loop */
void *link; /**< A void* field to link any information to
the node. */
unsigned long block_visited; /**< same as visited, for a complete block */
unsigned estimated_node_count; /**< estimated number of nodes in this graph,
updated after every walk */
-#if FIRM_EDGES_INPLACE
- irg_edge_info_t edge_info; /**< edge info for automatic outs */
-#endif
+ irg_edge_info_t edge_info; /**< edge info for automatic outs */
+ ir_node **idx_irn_map; /**< Array mapping node indexes to nodes. */
+
#ifdef DEBUG_libfirm
- int graph_nr; /**< a unique graph number for each graph to make output
+ int n_outs; /**< Size wasted for outs */
+ long graph_nr; /**< a unique graph number for each graph to make output
readable. */
#endif
/** Returns the start block of a graph. */
static INLINE ir_node *
_get_irg_start_block(const ir_graph *irg) {
- return irg->start_block;
+ return irg->anchors[anchor_start_block];
}
static INLINE void
_set_irg_start_block(ir_graph *irg, ir_node *node) {
- irg->start_block = node;
+ irg->anchors[anchor_start_block] = node;
}
static INLINE ir_node *
_get_irg_start(const ir_graph *irg) {
- return irg->start;
+ return irg->anchors[anchor_start];
}
static INLINE void
_set_irg_start(ir_graph *irg, ir_node *node) {
- irg->start = node;
+ irg->anchors[anchor_start] = node;
}
static INLINE ir_node *
_get_irg_end_block(const ir_graph *irg) {
- return irg->end_block;
+ return irg->anchors[anchor_end_block];
}
static INLINE void
_set_irg_end_block(ir_graph *irg, ir_node *node) {
- irg->end_block = node;
+ irg->anchors[anchor_end_block] = node;
}
static INLINE ir_node *
_get_irg_end(const ir_graph *irg) {
- return irg->end;
+ return irg->anchors[anchor_end];
}
static INLINE void
_set_irg_end(ir_graph *irg, ir_node *node) {
- irg->end = node;
+ irg->anchors[anchor_end] = node;
}
static INLINE ir_node *
_get_irg_end_reg(const ir_graph *irg) {
- return irg->end_reg;
+ return irg->anchors[anchor_end_reg];
}
static INLINE ir_node *
_get_irg_end_except (const ir_graph *irg) {
- return irg->end_except;
+ return irg->anchors[anchor_end_except];
}
static INLINE ir_node *
-_get_irg_cstore(const ir_graph *irg) {
- return irg->cstore;
+_get_irg_frame(const ir_graph *irg) {
+ return irg->anchors[anchor_frame];
}
static INLINE void
-_set_irg_cstore(ir_graph *irg, ir_node *node) {
- irg->cstore = node;
+_set_irg_frame(ir_graph *irg, ir_node *node) {
+ irg->anchors[anchor_frame] = node;
}
static INLINE ir_node *
-_get_irg_frame(const ir_graph *irg) {
- return irg->frame;
+_get_irg_globals(const ir_graph *irg) {
+ return irg->anchors[anchor_globals];
}
static INLINE void
-_set_irg_frame(ir_graph *irg, ir_node *node) {
- irg->frame = node;
+_set_irg_globals(ir_graph *irg, ir_node *node) {
+ irg->anchors[anchor_globals] = node;
}
static INLINE ir_node *
-_get_irg_globals(const ir_graph *irg) {
- return irg->globals;
+_get_irg_tls(const ir_graph *irg) {
+ return irg->anchors[anchor_tls];
}
static INLINE void
-_set_irg_globals(ir_graph *irg, ir_node *node) {
- irg->globals = node;
+_set_irg_tls(ir_graph *irg, ir_node *node) {
+ irg->anchors[anchor_tls] = node;
}
static INLINE ir_node *
_get_irg_initial_mem(const ir_graph *irg) {
- return irg->initial_mem;
+ return irg->anchors[anchor_initial_mem];
}
static INLINE void
_set_irg_initial_mem(ir_graph *irg, ir_node *node) {
- irg->initial_mem = node;
+ irg->anchors[anchor_initial_mem] = node;
}
static INLINE ir_node *
_get_irg_args(const ir_graph *irg) {
- return irg->args;
+ return irg->anchors[anchor_args];
}
static INLINE void
_set_irg_args(ir_graph *irg, ir_node *node) {
- irg->args = node;
+ irg->anchors[anchor_args] = node;
}
static INLINE ir_node **
static INLINE ir_node *
_get_irg_bad(const ir_graph *irg) {
- return irg->bad;
+ return irg->anchors[anchor_bad];
}
static INLINE void
_set_irg_bad(ir_graph *irg, ir_node *node) {
- irg->bad = node;
+ irg->anchors[anchor_bad] = node;
}
static INLINE ir_node *
_get_irg_no_mem(const ir_graph *irg) {
- return irg->no_mem;
+ return irg->anchors[anchor_no_mem];
}
static INLINE void
_set_irg_no_mem(ir_graph *irg, ir_node *node) {
- irg->no_mem = node;
+ irg->anchors[anchor_no_mem] = node;
}
static INLINE ir_node *
_get_irg_current_block(const ir_graph *irg) {
irg->ent = ent;
}
-static INLINE type *
+static INLINE ir_type *
_get_irg_frame_type(ir_graph *irg) {
assert(irg && irg->frame_type);
return irg->frame_type = skip_tid(irg->frame_type);
}
static INLINE void
-_set_irg_frame_type(ir_graph *irg, type *ftp) {
- assert(is_Class_type(ftp));
+_set_irg_frame_type(ir_graph *irg, ir_type *ftp) {
+ assert(is_frame_type(ftp));
irg->frame_type = ftp;
}
}
static INLINE void
-_set_irg_phase_low(ir_graph *irg) {
- irg->phase_state = phase_low;
+_set_irg_phase_state(ir_graph *irg, irg_phase_state state) {
+ irg->phase_state = state;
}
static INLINE op_pin_state
irg->outs_state = outs_inconsistent;
}
+static INLINE irg_extblk_state
+_get_irg_extblk_state(const ir_graph *irg) {
+ return irg->extblk_state;
+}
+
+static INLINE void
+_set_irg_extblk_inconsistent(ir_graph *irg) {
+ if (irg->extblk_state == extblk_valid)
+ irg->extblk_state = extblk_invalid;
+}
+
static INLINE irg_dom_state
_get_irg_dom_state(const ir_graph *irg) {
return irg->dom_state;
}
+static INLINE irg_dom_state
+_get_irg_postdom_state(const ir_graph *irg) {
+ return irg->pdom_state;
+}
+
static INLINE void
-_set_irg_dom_inconsistent(ir_graph *irg) {
- irg->dom_state = dom_inconsistent;
+_set_irg_doms_inconsistent(ir_graph *irg) {
+ if (irg->dom_state != dom_none)
+ irg->dom_state = dom_inconsistent;
+ if (irg->pdom_state != dom_none)
+ irg->pdom_state = dom_inconsistent;
}
static INLINE irg_loopinfo_state
++irg->block_visited;
}
+static INLINE void
+_dec_irg_block_visited(ir_graph *irg) {
+ --irg->block_visited;
+}
+
static INLINE unsigned
_get_irg_estimated_node_cnt(const ir_graph *irg) {
return irg->estimated_node_count;
}
+/**
+ * Allocates a new idx in the irg for the node and adds the irn to the idx -> irn map.
+ * @param irg The graph.
+ * @param irn The node.
+ * @return The index allocated for the node.
+ */
+static INLINE unsigned
+irg_register_node_idx(ir_graph *irg, ir_node *irn)
+{
+ unsigned idx = irg->last_node_idx++;
+ if(idx >= (unsigned) ARR_LEN(irg->idx_irn_map))
+ ARR_RESIZE(ir_node *, irg->idx_irn_map, idx + 1);
+
+ irg->idx_irn_map[idx] = irn;
+ return idx;
+}
+
+/**
+ * Kill a node from the irg. BEWARE: this kills
+ * all later created nodes.
+ */
+static INLINE void
+irg_kill_node(ir_graph *irg, ir_node *n) {
+ unsigned idx = get_irn_idx(n);
+ if (idx + 1 == irg->last_node_idx)
+ --irg->last_node_idx;
+ irg->idx_irn_map[idx] = NULL;
+ obstack_free(irg->obst, n);
+}
+
+/**
+ * Get the node for an index.
+ * @param irg The graph.
+ * @param idx The index you want the node for.
+ * @return The node with that index or NULL, if there is no node with that index.
+ * @note The node you got might be dead.
+ */
+static INLINE ir_node *
+get_idx_irn(ir_graph *irg, unsigned idx) {
+ assert(idx < (unsigned) ARR_LEN(irg->idx_irn_map));
+ return irg->idx_irn_map[idx];
+}
+
#define get_interprocedural_view() _get_interprocedural_view()
#define is_ir_graph(thing) _is_ir_graph(thing)
#define get_irg_start_block(irg) _get_irg_start_block(irg)
#define set_irg_end(irg, node) _set_irg_end(irg, node)
#define get_irg_end_reg(irg) _get_irg_end_reg(irg)
#define get_irg_end_except(irg) _get_irg_end_except(irg)
-#define get_irg_cstore(irg) _get_irg_cstore(irg)
-#define set_irg_cstore(irg, node) _set_irg_cstore(irg, node)
#define get_irg_frame(irg) _get_irg_frame(irg)
#define set_irg_frame(irg, node) _set_irg_frame(irg, node)
#define get_irg_globals(irg) _get_irg_globals(irg)
#define set_irg_globals(irg, node) _set_irg_globals(irg, node)
+#define get_irg_tls(irg) _get_irg_tls(irg)
+#define set_irg_tls(irg, node) _set_irg_tls(irg, node)
#define get_irg_initial_mem(irg) _get_irg_initial_mem(irg)
#define set_irg_initial_mem(irg, node) _set_irg_initial_mem(irg, node)
#define get_irg_args(irg) _get_irg_args(irg)
#define set_irg_frame_type(irg, ftp) _set_irg_frame_type(irg, ftp)
#define get_irg_obstack(irg) _get_irg_obstack(irg)
#define get_irg_phase_state(irg) _get_irg_phase_state(irg)
-#define set_irg_phase_low(irg) _set_irg_phase_low(irg)
+#define set_irg_phase_state(irg, state) _set_irg_phase_state(irg, state)
#define get_irg_pinned(irg) _get_irg_pinned(irg)
#define get_irg_outs_state(irg) _get_irg_outs_state(irg)
#define set_irg_outs_inconsistent(irg) _set_irg_outs_inconsistent(irg)
+#define get_irg_extblk_state(irg) _get_irg_extblk_state(irg)
+#define set_irg_extblk_inconsistent(irg) _set_irg_extblk_inconsistent(irg)
#define get_irg_dom_state(irg) _get_irg_dom_state(irg)
-#define set_irg_dom_inconsistent(irg) _set_irg_dom_inconsistent(irg)
+#define get_irg_postdom_state(irg) _get_irg_postdom_state(irg)
+#define set_irg_doms_inconsistent(irg) _set_irg_doms_inconsistent(irg)
#define get_irg_loopinfo_state(irg) _get_irg_loopinfo_state(irg)
#define set_irg_loopinfo_state(irg, s) _set_irg_loopinfo_state(irg, s)
#define set_irg_loopinfo_inconsistent(irg) _set_irg_loopinfo_inconsistent(irg)
#define get_irg_block_visited(irg) _get_irg_block_visited(irg)
#define set_irg_block_visited(irg, v) _set_irg_block_visited(irg, v)
#define inc_irg_block_visited(irg) _inc_irg_block_visited(irg)
+#define dec_irg_block_visited(irg) _dec_irg_block_visited(irg)
#define get_irg_estimated_node_cnt(irg) _get_irg_estimated_node_cnt(irg)
# endif /* _IRGRAPH_T_H_ */
projects / libfirm / blobdiff