* File name: ir/ir/irgraph.c
* Purpose: Entry point to the representation of procedure code -- internal header.
* Author: Martin Trapp, Christian Schaefer
- * Modified by: Goetz Lindenmaier
+ * Modified by: Goetz Lindenmaier, Michael Beck
* Created:
* CVS-ID: $Id$
* Copyright: (c) 1998-2003 Universität Karlsruhe
/**
* @file irgraph_t.h
*
- * ir graph construction.
- *
- * @author Martin Trapp, Christian Schaefer
+ * IR graph construction.
*/
-
-
#ifndef _IRGRAPH_T_H_
#define _IRGRAPH_T_H_
#include "pset.h"
#include "set.h"
+/** Prefix that is added to every frame type. */
#define FRAME_TP_SUFFIX "frame_tp"
/**
* Edge info to put into an irg.
*/
typedef struct _irg_edge_info_t {
- set *edges;
- unsigned activated : 1;
+ set *edges; /**< a set containing all edges of a graph. */
+ unsigned activated : 1; /**< set if edges are activated for the graph. */
} 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_cstore, /**< constant store -- no more needed!! */
- anchor_frame, /**< method's frame */
- anchor_globals, /**< pointer to the data segment containing all
- globals as well as global procedures. */
- 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_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_value_param_base, /**< method value param base */
+ 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_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. */
/* -- Fields indicating different states of irgraph -- */
- irg_phase_state phase_state; /**< compiler phase */
- op_pin_state irg_pinned_state; /**< Flag for status of nodes */
+ 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 */
- exec_freq_state execfreq_state; /**< state of execution frequency 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 */
+ 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. */
+ exec_freq_state execfreq_state; /**< State of execution frequency 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. */
+ unsigned fp_model; /**< floating point model of the graph. */
/* -- Fields for construction -- */
#if USE_EXPLICIT_PHI_IN_STACK
#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 */
ir_node **outs; /**< Space for the out arrays. */
-#ifdef DEBUG_libfirm
- int n_outs; /**< Size wasted for outs */
-#endif /* defined DEBUG_libfirm */
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 n_outs; /**< Size wasted for outs */
long graph_nr; /**< a unique graph number for each graph to make output
readable. */
#endif
return irg->anchors[anchor_end_except];
}
-static INLINE ir_node *
-_get_irg_cstore(const ir_graph *irg) {
- return irg->anchors[anchor_cstore];
-}
-
-static INLINE void
-_set_irg_cstore(ir_graph *irg, ir_node *node) {
- irg->anchors[anchor_cstore] = node;
-}
-
static INLINE ir_node *
_get_irg_frame(const ir_graph *irg) {
return irg->anchors[anchor_frame];
irg->anchors[anchor_globals] = node;
}
+static INLINE ir_node *
+_get_irg_tls(const ir_graph *irg) {
+ return irg->anchors[anchor_tls];
+}
+
+static INLINE void
+_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->anchors[anchor_initial_mem];
irg->anchors[anchor_args] = node;
}
+static INLINE ir_node *
+_get_irg_value_param_base(const ir_graph *irg) {
+ return irg->anchors[anchor_value_param_base];
+}
+
+static INLINE void
+_set_irg_value_param_base(ir_graph *irg, ir_node *node) {
+ irg->anchors[anchor_value_param_base] = node;
+}
+
static INLINE ir_node **
_get_irg_proj_args(const ir_graph *irg) {
return irg->proj_args;
++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;
}
+/* Return the floating point model of this graph. */
+static INLINE unsigned
+_get_irg_fp_model(const ir_graph *irg) {
+ return irg->fp_model;
+}
+
+/**
+ * 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_args(irg, node) _set_irg_args(irg, node)
+#define get_irg_value_param_base(irg) _get_irg_value_param_base(irg)
+#define set_irg_value_param_base(irg, node) _set_irg_value_param_base(irg, node)
#define get_irg_bad(irg) _get_irg_bad(irg)
#define set_irg_bad(irg, node) _set_irg_bad(irg, node)
#define get_irg_no_mem(irg) _get_irg_no_mem(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)
+#define get_irg_fp_model(irg) _get_irg_fp_model(irg)
# endif /* _IRGRAPH_T_H_ */