added support for Thread local storage

[libfirm] / ir / ir / irgraph_t.h

diff --git a/ir/ir/irgraph_t.h b/ir/ir/irgraph_t.h
index 8d0d410..04fd734 100644 (file)
--- a/ir/ir/irgraph_t.h
+++ b/ir/ir/irgraph_t.h
@@ -64,6 +64,8 @@ enum irg_anchors {
   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
@@ -112,16 +114,13 @@ struct ir_graph {
 #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. */
@@ -144,10 +143,11 @@ struct ir_graph {
   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
@@ -273,6 +273,16 @@ _set_irg_globals(ir_graph *irg, ir_node *node) {
   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];
@@ -516,17 +526,31 @@ _inc_irg_block_visited(ir_graph *irg) {
   ++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;
 }
 
 /**
- * Returns the next IR node index for the given graph.
+ * 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
-get_irg_next_node_idx(ir_graph *irg) {
-  return irg->last_node_idx++;
+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;
 }
 
 /**
@@ -535,9 +559,24 @@ get_irg_next_node_idx(ir_graph *irg) {
  */
 static INLINE void
 irg_kill_node(ir_graph *irg, ir_node *n) {
-  if (get_irn_idx(n) + 1 == irg->last_node_idx)
-    --irg->last_node_idx;
-  obstack_free(irg->obst, 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()
@@ -556,6 +595,8 @@ irg_kill_node(ir_graph *irg, ir_node *n) {
 #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)
@@ -598,6 +639,7 @@ irg_kill_node(ir_graph *irg, ir_node *n) {
 #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_ */