X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgraph.c;h=00fa68708dcd222af0229cec8684d19c3cffe2e0;hb=2080968df998886ef494ff80bac44cac5773eb14;hp=35a6c40b5e1a44461837c6389b8f2ebf86923248;hpb=882967f2eae16b3d98c305cc2e92cf013eedc208;p=libfirm

diff --git a/ir/ir/irgraph.c b/ir/ir/irgraph.c
index 35a6c40b5..00fa68708 100644
--- a/ir/ir/irgraph.c
+++ b/ir/ir/irgraph.c
@@ -20,19 +20,22 @@
 
 #include <stddef.h>
 
-# include "xmalloc.h"
-# include "ircons.h"
-# include "irgraph_t.h"
-# include "irprog_t.h"
-# include "irnode_t.h"
-# include "iropt_t.h"
-# include "irflag_t.h"
-# include "array.h"
-# include "irgmod.h"
-# include "mangle.h"
-# include "irouts.h"
-# include "irhooks.h"
-# include "irgwalk.h"
+#include "xmalloc.h"
+#include "ircons.h"
+#include "irgraph_t.h"
+#include "irprog_t.h"
+#include "irnode_t.h"
+#include "iropt_t.h"
+#include "irflag_t.h"
+#include "array.h"
+#include "irgmod.h"
+#include "mangle.h"
+#include "irouts.h"
+#include "irhooks.h"
+#include "irtools.h"
+#include "irgwalk.h"
+#include "iredges_t.h"
+#include "type_t.h"
 
 /**
  * Indicates, whether additional data can be registered to graphs.
@@ -55,14 +58,14 @@ void set_current_ir_graph(ir_graph *graph) {
 }
 
 
-int __interprocedural_view = false;
+int firm_interprocedural_view = 0;
 
 int (get_interprocedural_view)(void) {
   return _get_interprocedural_view();
 }
 
 void (set_interprocedural_view)(int state) {
-  __interprocedural_view = state;
+  firm_interprocedural_view = state;
 
   /* set function vectors for faster access */
   if (state) {
@@ -75,26 +78,36 @@ void (set_interprocedural_view)(int state) {
   }
 }
 
-static ident* frame_type_suffix = NULL;
-void init_irgraph(void) {
+/** contains the suffix for frame type names */
+static ident *frame_type_suffix = NULL;
+
+/* initialize the IR graph module */
+void firm_init_irgraph(void) {
   frame_type_suffix = new_id_from_str(FRAME_TP_SUFFIX);
-	forbid_new_data = 1;
+  forbid_new_data   = 1;
 }
 
 /**
- * Allocate a new ir graph.
+ * Allocate a new IR graph.
  * This function respects the registered graph data. The only reason for
  * this function is, that there are two locations, where graphs are
  * allocated (new_r_ir_graph, new_const_code_irg).
  * @return Memory for a new graph.
  */
-ir_graph *alloc_graph(void)
-{
-	size_t size = sizeof(ir_graph) + additional_graph_data_size;
-	char *ptr = xmalloc(size);
-	memset(ptr, 0, size);
+static ir_graph *alloc_graph(void) {
+  size_t size = sizeof(ir_graph) + additional_graph_data_size;
+  char *ptr = xmalloc(size);
+  memset(ptr, 0, size);
 
-	return (ir_graph *) (ptr + additional_graph_data_size);
+  return (ir_graph *) (ptr + additional_graph_data_size);
+}
+
+/**
+ * Frees an allocated IR graph
+ */
+static void free_graph(ir_graph *irg) {
+  char *ptr = (char *)irg;
+  free(ptr - additional_graph_data_size);
 }
 
 #if USE_EXPLICIT_PHI_IN_STACK
@@ -117,12 +130,14 @@ ir_graph *
 new_r_ir_graph (entity *ent, int n_loc)
 {
   ir_graph *res;
-  ir_node *first_block;
-  ir_node *projX;
+  ir_node  *first_block;
+  ir_node  *end, *start, *start_block, *initial_mem, *projX;
 
   res = alloc_graph();
   res->kind = k_ir_graph;
 
+  edges_init_graph(res);
+
   /* inform statistics here, as blocks will be already build on this graph */
   hook_new_graph(res, ent);
 
@@ -143,7 +158,10 @@ new_r_ir_graph (entity *ent, int n_loc)
                 to the procedure!  */
   }
 
-  res->visited = 0;     /* visited flag, for the ir walker */
+  /* descriptions will be allocated on demand */
+  res->loc_descriptions = NULL;
+
+  res->visited       = 0; /* visited flag, for the ir walker */
   res->block_visited = 0; /* visited flag, for the 'block'-walker */
 
 #if USE_EXPLICIT_PHI_IN_STACK
@@ -151,55 +169,70 @@ new_r_ir_graph (entity *ent, int n_loc)
                                 generation */
 #endif
   res->kind = k_ir_graph;
-  res->obst      = xmalloc (sizeof(*res->obst));
-  obstack_init (res->obst);
+  res->obst = xmalloc (sizeof(*res->obst));
+  obstack_init(res->obst);
+  res->extbb_obst = NULL;
+
+  res->last_node_idx = 0;
+
   res->value_table = new_identities (); /* value table for global value
                        numbering for optimizing use in
                        iropt.c */
   res->outs = NULL;
 
-  res->phase_state    = phase_building;
-  res->op_pin_state_pinned = op_pin_state_pinned;
-  res->outs_state     = outs_none;
-  res->dom_state      = dom_none;
-  res->typeinfo_state = irg_typeinfo_none;
-  res->loopinfo_state = loopinfo_none;
+  res->inline_property       = irg_inline_any;
+  res->additional_properties = mtp_property_inherited;  /* inherited from type */
+
+  res->phase_state         = phase_building;
+  res->irg_pinned_state    = op_pin_state_pinned;
+  res->outs_state          = outs_none;
+  res->dom_state           = dom_none;
+  res->pdom_state          = dom_none;
+  res->typeinfo_state      = ir_typeinfo_none;
+  set_irp_typeinfo_inconsistent();           /* there is a new graph with typeinfo_none. */
+  res->callee_info_state   = irg_callee_info_none;
+  res->loopinfo_state      = loopinfo_none;
+  res->execfreq_state      = exec_freq_none;
+  res->class_cast_state    = ir_class_casts_transitive;
+  res->extblk_state        = ir_extblk_info_none;
 
   /*-- Type information for the procedure of the graph --*/
   res->ent = ent;
   set_entity_irg(ent, res);
 
   /*--  a class type so that it can contain "inner" methods as in Pascal. --*/
-  res->frame_type = new_type_class(mangle(get_entity_ident(ent), frame_type_suffix));
-
-  /* Remove type from type list.  Must be treated differently than other types. */
-  remove_irp_type_from_list(res->frame_type);
+  res->frame_type = new_type_frame(mangle(get_entity_ident(ent), frame_type_suffix));
 
   /*-- Nodes needed in every graph --*/
-  res->end_block  = new_immBlock();
-  res->end        = new_End();
-  res->end_reg    = res->end;
-  res->end_except = res->end;
-
-  res->start_block = new_immBlock();
-  res->start   = new_Start();
-  res->bad     = new_ir_node(NULL, res, res->start_block, op_Bad, mode_T, 0, NULL);
-  res->no_mem  = new_ir_node(NULL, res, res->start_block, op_NoMem, mode_M, 0, NULL);
+  set_irg_end_block (res, new_immBlock());
+  end               = new_End();
+  set_irg_end       (res, end);
+  set_irg_end_reg   (res, end);
+  set_irg_end_except(res, end);
+
+  start_block = new_immBlock();
+  set_irg_start_block(res, start_block);
+  set_irg_bad        (res, new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL));
+  set_irg_no_mem     (res, new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
+  start = new_Start();
+  set_irg_start      (res, start);
 
   /* Proj results of start node */
-  projX            = new_Proj (res->start, mode_X, pn_Start_X_initial_exec);
-  res->frame       = new_Proj (res->start, mode_P_mach, pn_Start_P_frame_base);
-  res->globals     = new_Proj (res->start, mode_P_mach, pn_Start_P_globals);
-  res->initial_mem = new_Proj (res->start, mode_M, pn_Start_M);
-  res->args        = new_Proj (res->start, mode_T, pn_Start_T_args);
+  projX              = new_Proj(start, mode_X, pn_Start_X_initial_exec);
+  set_irg_frame      (res, new_Proj(start, mode_P_data, pn_Start_P_frame_base));
+  set_irg_globals    (res, new_Proj(start, mode_P_data, pn_Start_P_globals));
+  set_irg_args       (res, new_Proj(start, mode_T, pn_Start_T_args));
+  initial_mem        = new_Proj(start, mode_M, pn_Start_M);
+  set_irg_initial_mem(res, initial_mem);
+
+  add_immBlock_pred(start_block, projX);
+  set_store(initial_mem);
+
 #ifdef DEBUG_libfirm
   res->graph_nr    = get_irp_new_node_nr();
 #endif
   res->proj_args   = NULL;
 
-  set_store(res->initial_mem);
-
-  add_immBlock_pred(res->start_block, projX);
   /*
    * The code generation needs it. leave it in now.
    * Use of this edge is matter of discussion, unresolved. Also possible:
@@ -212,6 +245,7 @@ new_r_ir_graph (entity *ent, int n_loc)
   add_immBlock_pred (first_block, projX);
 
   res->method_execution_frequency = -1;
+  res->estimated_node_count       = 0;
 
   return res;
 }
@@ -229,7 +263,7 @@ new_ir_graph (entity *ent, int n_loc)
    Must look like a correct irg, spare everything else. */
 ir_graph *new_const_code_irg(void) {
   ir_graph *res;
-  ir_node *projX;
+  ir_node  *end, *start_block, *start, *projX;
 
   res = alloc_graph();
 
@@ -237,17 +271,23 @@ ir_graph *new_const_code_irg(void) {
   hook_new_graph(res, NULL);
 
   current_ir_graph = res;
-  res->n_loc = 1;       /* Only the memory. */
-  res->visited = 0;     /* visited flag, for the ir walker */
-  res->block_visited=0; /* visited flag, for the 'block'-walker */
+  res->n_loc = 1;         /* Only the memory. */
+  res->visited = 0;       /* visited flag, for the ir walker */
+  res->block_visited = 0; /* visited flag, for the 'block'-walker */
 #if USE_EXPLICIT_PHI_IN_STACK
   res->Phi_in_stack = NULL;
 #endif
   res->kind = k_ir_graph;
   res->obst      = xmalloc (sizeof(*res->obst));
   obstack_init (res->obst);
-  res->phase_state = phase_building;
-  res->op_pin_state_pinned = op_pin_state_pinned;
+  res->extbb_obst = NULL;
+
+  res->last_node_idx = 0;
+
+  res->phase_state      = phase_building;
+  res->irg_pinned_state = op_pin_state_pinned;
+  res->extblk_state     = ir_extblk_info_none;
+
   res->value_table = new_identities (); /* value table for global value
                        numbering for optimizing use in
                        iropt.c */
@@ -255,35 +295,40 @@ ir_graph *new_const_code_irg(void) {
   res->frame_type  = NULL;
 
   /* -- The end block -- */
-  res->end_block  = new_immBlock ();
-  res->end        = new_End ();
-  res->end_reg    = res->end;
-  res->end_except = res->end;
+  set_irg_end_block (res, new_immBlock());
+  end = new_End();
+  set_irg_end       (res, end);
+  set_irg_end_reg   (res, end);
+  set_irg_end_except(res, end);
   mature_immBlock(get_cur_block());  /* mature the end block */
 
   /* -- The start block -- */
-  res->start_block = new_immBlock ();
-  res->bad     = new_ir_node (NULL, res, res->start_block, op_Bad, mode_T, 0, NULL);
-  res->no_mem  = new_ir_node (NULL, res, res->start_block, op_NoMem, mode_M, 0, NULL);
-  res->start   = new_Start ();
+  start_block        = new_immBlock();
+  set_irg_start_block(res, start_block);
+  set_irg_bad        (res, new_ir_node (NULL, res, start_block, op_Bad, mode_T, 0, NULL));
+  set_irg_no_mem     (res, new_ir_node (NULL, res, start_block, op_NoMem, mode_M, 0, NULL));
+  start              = new_Start();
+  set_irg_start      (res, start);
+
   /* Proj results of start node */
-  res->initial_mem = new_Proj (res->start, mode_M, pn_Start_M);
-  projX            = new_Proj (res->start, mode_X, pn_Start_X_initial_exec);
-  add_immBlock_pred (res->start_block, projX);
-  mature_immBlock   (res->start_block);  /* mature the start block */
+  set_irg_initial_mem(res, new_Proj(start, mode_M, pn_Start_M));
+  projX = new_Proj(start, mode_X, pn_Start_X_initial_exec);
+  add_immBlock_pred(start_block, projX);
+  mature_immBlock  (start_block);  /* mature the start block */
 
-  add_immBlock_pred (new_immBlock (), projX);
-  mature_immBlock   (get_cur_block());   /* mature the 'body' block for expressions */
+  add_immBlock_pred(new_immBlock(), projX);
+  mature_immBlock  (get_cur_block());   /* mature the 'body' block for expressions */
 
   /* Set the visited flag high enough that the blocks will never be visited. */
   set_irn_visited(get_cur_block(), -1);
   set_Block_block_visited(get_cur_block(), -1);
-  set_Block_block_visited(res->start_block, -1);
-  set_irn_visited(res->start_block, -1);
-  set_irn_visited(res->bad, -1);
-  set_irn_visited(res->no_mem, -1);
+  set_Block_block_visited(start_block, -1);
+  set_irn_visited(start_block, -1);
+  set_irn_visited(get_irg_bad(res), -1);
+  set_irn_visited(get_irg_no_mem(res), -1);
 
   res->phase_state = phase_high;
+
   return res;
 }
 
@@ -298,9 +343,10 @@ void  del_identities (pset *value_table);
    Does not free types, entities or modes that are used only by this
    graph, nor the entity standing for this graph. */
 void free_ir_graph (ir_graph *irg) {
+  assert(is_ir_graph(irg));
 
   hook_free_graph(irg);
-  if (irg->outs_state != outs_none) free_outs(irg);
+  if (irg->outs_state != outs_none) free_irg_outs(irg);
   if (irg->frame_type)  free_type(irg->frame_type);
   if (irg->value_table) del_identities(irg->value_table);
   if (irg->ent) {
@@ -310,14 +356,16 @@ void free_ir_graph (ir_graph *irg) {
     set_entity_peculiarity (irg->ent, pec);
   }
 
-  free_End(irg->end);
+  free_End(get_irg_end(irg));
   obstack_free(irg->obst,NULL);
   free(irg->obst);
 #if USE_EXPLICIT_PHI_IN_STACK
   free_Phi_in_stack(irg->Phi_in_stack);
 #endif
+  if (irg->loc_descriptions)
+    free(irg->loc_descriptions);
   irg->kind = k_BAD;
-  free(irg);
+  free_graph(irg);
 }
 
 /* access routines for all ir_graph attributes:
@@ -331,14 +379,12 @@ int
 }
 
 /* Outputs a unique number for this node */
-
-long
-get_irg_graph_nr(ir_graph *irg) {
+long get_irg_graph_nr(ir_graph *irg) {
   assert(irg);
 #ifdef DEBUG_libfirm
   return irg->graph_nr;
 #else
-  return (long)irg;
+  return (long)PTR_TO_INT(irg);
 #endif
 }
 
@@ -389,7 +435,7 @@ ir_node *
 
 void     set_irg_end_reg (ir_graph *irg, ir_node *node) {
   assert(get_irn_op(node) == op_EndReg || get_irn_op(node) == op_End);
-  irg->end_reg = node;
+  irg->anchors[anchor_end_reg] = node;
 }
 
 ir_node *
@@ -399,17 +445,7 @@ ir_node *
 
 void     set_irg_end_except (ir_graph *irg, ir_node *node) {
   assert(get_irn_op(node) == op_EndExcept || get_irn_op(node) == op_End);
-  irg->end_except = node;
-}
-
-ir_node *
-(get_irg_cstore)(const ir_graph *irg) {
-  return _get_irg_cstore(irg);
-}
-
-void
-(set_irg_cstore)(ir_graph *irg, ir_node *node) {
-  _set_irg_cstore(irg, node);
+  irg->anchors[anchor_end_except] = node;
 }
 
 ir_node *
@@ -502,30 +538,16 @@ void
   _set_irg_entity(irg, ent);
 }
 
-type *
-(get_irg_frame_type)(const ir_graph *irg) {
+ir_type *
+(get_irg_frame_type)(ir_graph *irg) {
   return _get_irg_frame_type(irg);
 }
 
 void
-(set_irg_frame_type)(ir_graph *irg, type *ftp) {
+(set_irg_frame_type)(ir_graph *irg, ir_type *ftp) {
   _set_irg_frame_type(irg, ftp);
 }
 
-
-/* To test for a frame type */
-int
-is_frame_type(const type *ftp) {
-  int i;
-  if (is_Class_type(ftp)) {
-    for (i = 0; i < get_irp_n_irgs(); i++) {
-      const type *frame_tp = get_irg_frame_type(get_irp_irg(i));
-      if (ftp == frame_tp) return true;
-    }
-  }
-  return false;
-}
-
 int
 get_irg_n_locs (ir_graph *irg)
 {
@@ -562,7 +584,7 @@ int node_is_in_irgs_storage(ir_graph *irg, ir_node *n)
   struct _obstack_chunk *p;
 
   /*
-   * checks wheater the ir_node pointer i on the obstack.
+   * checks weather the ir_node pointer is on the obstack.
    * A more sophisticated check would test the "whole" ir_node
    */
   for (p = irg->obst->chunk; p; p = p->prev) {
@@ -579,8 +601,8 @@ irg_phase_state
 }
 
 void
-(set_irg_phase_low)(ir_graph *irg) {
-  _set_irg_phase_low(irg);
+(set_irg_phase_state)(ir_graph *irg, irg_phase_state state) {
+  _set_irg_phase_state(irg, state);
 }
 
 op_pin_state
@@ -598,14 +620,29 @@ void
   _set_irg_outs_inconsistent(irg);
 }
 
+irg_extblk_state
+(get_irg_extblk_state)(const ir_graph *irg) {
+  return _get_irg_extblk_state(irg);
+}
+
+void
+(set_irg_extblk_inconsistent)(ir_graph *irg) {
+  _set_irg_extblk_inconsistent(irg);
+}
+
 irg_dom_state
 (get_irg_dom_state)(const ir_graph *irg) {
   return _get_irg_dom_state(irg);
 }
 
+irg_dom_state
+(get_irg_postdom_state)(const ir_graph *irg) {
+  return _get_irg_postdom_state(irg);
+}
+
 void
-(set_irg_dom_inconsistent)(ir_graph *irg) {
-  _set_irg_dom_inconsistent(irg);
+(set_irg_doms_inconsistent)(ir_graph *irg) {
+  _set_irg_doms_inconsistent(irg);
 }
 
 irg_loopinfo_state
@@ -619,19 +656,18 @@ void
 }
 
 void
-set_irg_loopinfo_inconsistent(ir_graph *irg) {
-  if (irg->loopinfo_state == loopinfo_ip_consistent)
-    irg->loopinfo_state = loopinfo_ip_inconsistent;
+(set_irg_loopinfo_inconsistent)(ir_graph *irg) {
+  _set_irg_loopinfo_inconsistent(irg);
+}
 
-  else if (irg->loopinfo_state == loopinfo_consistent)
-    irg->loopinfo_state = loopinfo_inconsistent;
+void set_irp_loopinfo_inconsistent(void) {
+  int i, n_irgs = get_irp_n_irgs();
+  for (i = 0; i < n_irgs; ++i) {
+    set_irg_loopinfo_inconsistent(get_irp_irg(i));
+  }
+}
 
-  else if (irg->loopinfo_state == loopinfo_cf_ip_consistent)
-    irg->loopinfo_state = loopinfo_cf_ip_inconsistent;
 
-  else if (irg->loopinfo_state == loopinfo_cf_consistent)
-    irg->loopinfo_state = loopinfo_cf_inconsistent;
-}
 
 void
 (set_irg_pinned)(ir_graph *irg, op_pin_state p) {
@@ -658,6 +694,21 @@ void
   _set_irg_inline_property(irg, s);
 }
 
+unsigned
+(get_irg_additional_properties)(const ir_graph *irg) {
+  return _get_irg_additional_properties(irg);
+}
+
+void
+(set_irg_additional_properties)(ir_graph *irg, unsigned property_mask) {
+  _set_irg_additional_properties(irg, property_mask);
+}
+
+void
+(set_irg_additional_property)(ir_graph *irg, mtp_additional_property flag) {
+  _set_irg_additional_property(irg, flag);
+}
+
 void
 (set_irg_link)(ir_graph *irg, void *thing) {
   _set_irg_link(irg, thing);
@@ -753,19 +804,43 @@ static void normalize_proj_walker(ir_node *n, void *env)
   }
 }
 
-/* put the proj's into the same block as its predecessors */
+/* move Proj nodes into the same block as its predecessors */
 void normalize_proj_nodes(ir_graph *irg)
 {
   irg_walk_graph(irg, NULL, normalize_proj_walker, NULL);
-	set_irg_outs_inconsistent(irg);
+  set_irg_outs_inconsistent(irg);
+}
+
+/* set a description for local value n */
+void set_irg_loc_description(ir_graph *irg, int n, void *description)
+{
+  assert(0 <= n && n < irg->n_loc);
+
+  if (! irg->loc_descriptions)
+    irg->loc_descriptions = xcalloc(sizeof(*irg->loc_descriptions), irg->n_loc);
+
+  irg->loc_descriptions[n] = description;
+}
+
+/* get the description for local value n */
+void *get_irg_loc_description(ir_graph *irg, int n)
+{
+  assert(0 <= n && n < irg->n_loc);
+  return irg->loc_descriptions ? irg->loc_descriptions[n] : NULL;
+}
+
+/* Returns a estimated node count of the irg. */
+unsigned (get_irg_estimated_node_cnt)(const ir_graph *irg) {
+  return _get_irg_estimated_node_cnt(irg);
 }
 
+/* register additional space in an IR graph */
 size_t register_additional_graph_data(size_t size)
 {
-	assert(!forbid_new_data && "Too late to register additional node data");
+  assert(!forbid_new_data && "Too late to register additional node data");
 
-	if(forbid_new_data)
-		return 0;
+  if (forbid_new_data)
+    return 0;
 
-	return additional_graph_data_size += size;
+  return additional_graph_data_size += size;
 }