X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgraph.c;h=e079d1204feeeebf0b3dce7dacf86eb781d2f21e;hb=c80c368f7ae4222880121ed11c78ecd4cc5dec18;hp=0b509e3a2194e73f23326574f54d5ad8a591fdac;hpb=dc87aa49c6d24b8d08f14d26ff42537cf82b559c;p=libfirm

diff --git a/ir/ir/irgraph.c b/ir/ir/irgraph.c
index 0b509e3a2..e079d1204 100644
--- a/ir/ir/irgraph.c
+++ b/ir/ir/irgraph.c
@@ -19,10 +19,14 @@
 # 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 "firmstat.h"
 
 ir_graph *current_ir_graph;
 INLINE ir_graph *get_current_ir_graph(void) {
@@ -33,17 +37,29 @@ INLINE void set_current_ir_graph(ir_graph *graph) {
 }
 
 
-bool interprocedural_view = false;
-INLINE bool get_interprocedural_view(void) {
-  return interprocedural_view;
+int __interprocedural_view = false;
+
+int (get_interprocedural_view)(void) {
+  return __get_interprocedural_view();
 }
-INLINE void set_interprocedural_view(bool state) {
-  interprocedural_view = state;
+
+void (set_interprocedural_view)(int state) {
+  __interprocedural_view = state;
+
+  /* set function vectors for faster access */
+  if (state) {
+    __get_irn_arity = __get_irn_inter_arity;
+    __get_irn_n     = __get_irn_inter_n;
+  }
+  else {
+    __get_irn_arity = __get_irn_intra_arity;
+    __get_irn_n     = __get_irn_intra_n;
+  }
 }
 
 static ident* frame_type_suffix = NULL;
 void init_irgraph(void) {
-  frame_type_suffix = id_from_str(FRAME_TP_SUFFIX, strlen(FRAME_TP_SUFFIX));
+  frame_type_suffix = new_id_from_chars(FRAME_TP_SUFFIX, strlen(FRAME_TP_SUFFIX));
 }
 
 #if USE_EXPLICIT_PHI_IN_STACK
@@ -70,28 +86,32 @@ new_ir_graph (entity *ent, int n_loc)
   ir_node *projX;
 
   res = (ir_graph *) malloc (sizeof (ir_graph));
-  res->kind=k_ir_graph;
+  memset(res, 0, sizeof (ir_graph));
+  res->kind = k_ir_graph;
+
+  /* inform statistics here, as blocks will be already build on this graph */
+  stat_new_graph(res, ent);
 
   current_ir_graph = res;
   add_irp_irg(res);          /* remember this graph global. */
 
-/**
-  * initialized for each graph. **/
-#if PRECISE_EXC_CONTEXT
-  res->n_loc = n_loc + 1 + 1; /* number of local variables that are never
-                                 dereferenced in this graph plus one for
-	    		         the store plus one for links to fragile
-				 operations.  n_loc is not the number of
-				 parameters to the procedure!  */
-#else
-  res->n_loc = n_loc + 1;  /* number of local variables that are never
-                              dereferenced in this graph plus one for
-	    		      the store. This is not the number of parameters
-                              to the procedure!  */
-#endif
+  /*-- initialized for each graph. --*/
+  if (get_opt_precise_exc_context()) {
+    res->n_loc = n_loc + 1 + 1; /* number of local variables that are never
+                   dereferenced in this graph plus one for
+                   the store plus one for links to fragile
+                   operations.  n_loc is not the number of
+                   parameters to the procedure!  */
+  }
+  else {
+    res->n_loc = n_loc + 1;  /* number of local variables that are never
+                dereferenced in this graph plus one for
+                the store. This is not the number of parameters
+                to the procedure!  */
+  }
 
   res->visited = 0;     /* visited flag, for the ir walker */
-  res->block_visited=0; /* visited flag, for the 'block'-walker */
+  res->block_visited = 0; /* visited flag, for the 'block'-walker */
 
 #if USE_EXPLICIT_PHI_IN_STACK
   res->Phi_in_stack = new_Phi_in_stack();  /* A stack needed for automatic Phi
@@ -101,57 +121,59 @@ new_ir_graph (entity *ent, int n_loc)
   res->obst      = (struct obstack *) xmalloc (sizeof (struct obstack));
   obstack_init (res->obst);
   res->value_table = new_identities (); /* value table for global value
-					   numbering for optimizing use in
-					   iropt.c */
+                       numbering for optimizing use in
+                       iropt.c */
   res->outs = NULL;
 
-  res->phase_state = phase_building;
-  res->pinned = pinned;
-  res->outs_state = no_outs;
-  res->dom_state = no_dom;
+  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;
 
-  /** Type information for the procedure of the graph **/
+  /*-- Type information for the procedure of the graph --*/
   res->ent = ent;
   set_entity_irg(ent, res);
 
-/**
-      contain "inner" methods as in Pascal. **/
+  /*--  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);
 
-  /** Nodes needed in every graph **/
-  res->end_block = new_immBlock ();
-  res->end       = new_End ();
+  /*-- 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->unknown = new_ir_node (NULL, res, res->start_block, op_Unknown, mode_T, 0, NULL);
+  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);
 
   /* Proj results of start node */
-  projX        = new_Proj (res->start, mode_X, pns_initial_exec);
-  set_store (new_Proj (res->start, mode_M, pns_global_store));
-  res->frame   = new_Proj (res->start, mode_P_mach, pns_frame_base);
-  res->globals = new_Proj (res->start, mode_P_mach, pns_globals);
-  res->args    = new_Proj (res->start, mode_T, pns_args);
+  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);
 #ifdef DEBUG_libfirm
-  res->graph_nr = get_irp_new_node_nr();
+  res->graph_nr    = get_irp_new_node_nr();
 #endif
 
+  set_store(res->initial_mem);
 
-  add_in_edge(res->start_block, projX);
+  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:
-   * add_in_edge(res->start_block, res->start_block), but invalid typed.
+   * add_immBlock_pred(res->start_block, res->start_block), but invalid typed.
    */
-  mature_block (res->current_block);
+  mature_immBlock (res->current_block);
 
-  /** Make a block to start with **/
-  first_block = new_immBlock ();
-  add_in_edge (first_block, projX);
+  /*-- Make a block to start with --*/
+  first_block = new_immBlock();
+  add_immBlock_pred (first_block, projX);
 
   return res;
 }
@@ -159,13 +181,18 @@ new_ir_graph (entity *ent, int n_loc)
 
 /* Make a rudimentary ir graph for the constant code.
    Must look like a correct irg, spare everything else. */
-ir_graph *new_const_code_irg() {
+ir_graph *new_const_code_irg(void) {
   ir_graph *res;
   ir_node *projX;
 
-  res = (ir_graph *) malloc (sizeof (ir_graph));
+  res = (ir_graph *) malloc (sizeof(*res));
+  memset(res, 0, sizeof(*res));
+
+  /* inform statistics here, as blocks will be already build on this graph */
+  stat_new_graph(res, NULL);
+
   current_ir_graph = res;
-  res->n_loc = 1;      /* Only the memory. */
+  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
@@ -175,34 +202,43 @@ ir_graph *new_const_code_irg() {
   res->obst      = (struct obstack *) xmalloc (sizeof (struct obstack));
   obstack_init (res->obst);
   res->phase_state = phase_building;
-  res->pinned = pinned;
+  res->op_pin_state_pinned = op_pin_state_pinned;
   res->value_table = new_identities (); /* value table for global value
-					   numbering for optimizing use in
-					   iropt.c */
+                       numbering for optimizing use in
+                       iropt.c */
   res->ent = NULL;
-  res->frame_type = NULL;
+  res->frame_type  = NULL;
   res->start_block = new_immBlock ();
-  res->end_block = new_immBlock ();
-  res->end       = new_End ();
-  mature_block(get_cur_block());
+  res->end_block  = new_immBlock ();
+  res->end        = new_End ();
+  res->end_reg    = res->end;
+  res->end_except = res->end;
+  mature_immBlock(get_cur_block());  /* mature the end block */
   res->bad = new_ir_node (NULL, res, res->start_block, op_Bad, mode_T, 0, NULL);
-  res->unknown = new_ir_node (NULL, res, res->start_block, op_Unknown, mode_T, 0, NULL);
   res->start   = new_Start ();
+  res->initial_mem = new_Proj (res->start, mode_M, pn_Start_M);
 
   /* Proj results of start node */
-  projX        = new_Proj (res->start, mode_X, pns_initial_exec);
-  set_store (new_Proj (res->start, mode_M, pns_global_store));
-  add_in_edge(res->start_block, projX);
-  mature_block (res->current_block);
-  add_in_edge (new_immBlock (), projX);
-  mature_block(get_cur_block());
+  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 */
+
+  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 block 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);
+
+  res->phase_state = phase_high;
   return res;
 }
 
+/* Defined in iropt.c */
+void  del_identities (pset *value_table);
+
 /* Frees the passed irgraph.
    Deallocates all nodes in this graph and the ir_graph structure.
    Sets the field irgraph in the corresponding entity to NULL.
@@ -211,12 +247,25 @@ ir_graph *new_const_code_irg() {
    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) {
-  set_entity_irg(irg->ent, NULL);
-  irg->kind = k_BAD;
+
+  stat_free_graph(irg);
+  if (irg->outs_state != outs_none) free_outs(irg);
+  if (irg->frame_type)  free_type(irg->frame_type);
+  if (irg->value_table) del_identities(irg->value_table);
+  if (irg->ent) {
+    peculiarity pec = get_entity_peculiarity (irg->ent);
+    set_entity_peculiarity (irg->ent, peculiarity_description);
+    set_entity_irg(irg->ent, NULL);  /* not set in const code irg */
+    set_entity_peculiarity (irg->ent, pec);
+  }
+
+  free_End(irg->end);
+  obstack_free(irg->obst,NULL);
   free(irg->obst);
 #if USE_EXPLICIT_PHI_IN_STACK
   free_Phi_in_stack(irg->Phi_in_stack);
 #endif
+  irg->kind = k_BAD;
   free(irg);
 }
 
@@ -226,12 +275,8 @@ void free_ir_graph (ir_graph *irg) {
    void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
 
 int
-is_ir_graph(void *thing) {
-  assert(thing);
-  if (get_kind(thing) == k_ir_graph)
-    return 1;
-  else
-    return 0;
+(is_ir_graph)(void *thing) {
+  return __is_ir_graph(thing);
 }
 
 /* Outputs a unique number for this node */
@@ -242,118 +287,132 @@ get_irg_graph_nr(ir_graph *irg) {
 #ifdef DEBUG_libfirm
   return irg->graph_nr;
 #else
-  return 0;
+  return (long)irg;
 #endif
 }
 
 ir_node *
-get_irg_start_block (ir_graph *irg)
-{
-  return irg->start_block;
+(get_irg_start_block)(ir_graph *irg) {
+  return __get_irg_start_block(irg);
 }
 
 void
-set_irg_start_block (ir_graph *irg, ir_node *node)
-{
-  irg->start_block = node;
+(set_irg_start_block)(ir_graph *irg, ir_node *node) {
+  __set_irg_start_block(irg, node);
 }
 
 ir_node *
-get_irg_start (ir_graph *irg)
-{
-  return irg->start;
+(get_irg_start)(ir_graph *irg) {
+  return __get_irg_start(irg);
 }
 
 void
-set_irg_start(ir_graph *irg, ir_node *node)
-{
-  irg->start = node;
+(set_irg_start)(ir_graph *irg, ir_node *node) {
+  __set_irg_start(irg, node);
 }
 
 ir_node *
-get_irg_end_block (ir_graph *irg)
-{
-  return irg->end_block;
+(get_irg_end_block)(ir_graph *irg) {
+  return __get_irg_end_block(irg);
 }
 
 void
-set_irg_end_block (ir_graph *irg, ir_node *node)
-{
-  irg->end_block = node;
+(set_irg_end_block)(ir_graph *irg, ir_node *node) {
+  __set_irg_end_block(irg, node);
 }
 
 ir_node *
-get_irg_end (ir_graph *irg)
-{
-  return irg->end;
+(get_irg_end)(ir_graph *irg) {
+  return __get_irg_end(irg);
 }
 
 void
-set_irg_end (ir_graph *irg, ir_node *node)
-{
-  irg->end = node;
+(set_irg_end)(ir_graph *irg, ir_node *node) {
+  __set_irg_end(irg, node);
 }
 
 ir_node *
-get_irg_cstore (ir_graph *irg)
-{
-  return irg->cstore;
+(get_irg_end_reg)(ir_graph *irg) {
+  return __get_irg_end_reg(irg);
+}
+
+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;
+}
+
+ir_node *
+(get_irg_end_except)(ir_graph *irg) {
+  return __get_irg_end_except(irg);
+}
+
+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)(ir_graph *irg) {
+  return __get_irg_cstore(irg);
 }
 
 void
-set_irg_cstore (ir_graph *irg, ir_node *node)
-{
-  irg->cstore = node;
+(set_irg_cstore)(ir_graph *irg, ir_node *node) {
+  __set_irg_cstore(irg, node);
 }
 
 ir_node *
-get_irg_frame (ir_graph *irg)
-{
-  return irg->frame;
+(get_irg_frame)(ir_graph *irg) {
+  return __get_irg_frame(irg);
 }
 
 void
-set_irg_frame (ir_graph *irg, ir_node *node)
-{
-  irg->frame = node;
+(set_irg_frame)(ir_graph *irg, ir_node *node) {
+  __set_irg_frame(irg, node);
 }
 
 ir_node *
-get_irg_globals (ir_graph *irg)
-{
-  return irg->globals;
+(get_irg_globals)(ir_graph *irg) {
+  return __get_irg_globals(irg);
 }
 
 void
-set_irg_globals (ir_graph *irg, ir_node *node)
-{
-  irg->globals = node;
+(set_irg_globals)(ir_graph *irg, ir_node *node) {
+  __set_irg_globals(irg, node);
 }
 
 ir_node *
-get_irg_args (ir_graph *irg)
+(get_irg_initial_mem)(ir_graph *irg)
 {
-  return irg->args;
+  return __get_irg_initial_mem(irg);
 }
 
 void
-set_irg_args (ir_graph *irg, ir_node *node)
-{
-  irg->args = node;
+(set_irg_initial_mem)(ir_graph *irg, ir_node *node) {
+  __set_irg_initial_mem(irg, node);
 }
 
 ir_node *
-get_irg_bad (ir_graph *irg)
-{
-  return irg->bad;
+(get_irg_args)(ir_graph *irg) {
+  return __get_irg_args(irg);
 }
 
 void
-set_irg_bad (ir_graph *irg, ir_node *node)
-{
-  irg->bad = node;
+(set_irg_args)(ir_graph *irg, ir_node *node) {
+  __set_irg_args(irg, node);
+}
+
+ir_node *
+(get_irg_bad)(ir_graph *irg) {
+  return __get_irg_bad(irg);
+}
+
+void
+(set_irg_bad)(ir_graph *irg, ir_node *node) {
+  __set_irg_bad(irg, node);
 }
 
+/* GL removed: we need unknown with mode for analyses.
 ir_node *
 get_irg_unknown (ir_graph *irg)
 {
@@ -365,44 +424,36 @@ set_irg_unknown (ir_graph *irg, ir_node *node)
 {
   irg->unknown = node;
 }
+*/
 
 ir_node *
-get_irg_current_block (ir_graph *irg)
-{
-  return irg->current_block;
+(get_irg_current_block)(ir_graph *irg) {
+  return __get_irg_current_block(irg);
 }
 
 void
-set_irg_current_block (ir_graph *irg, ir_node *node)
-{
-  irg->current_block = node;
+(set_irg_current_block)(ir_graph *irg, ir_node *node) {
+  __set_irg_current_block(irg, node);
 }
 
 entity *
-get_irg_ent (ir_graph *irg)
-{
-  assert(irg && irg->ent);
-  return irg->ent;
+(get_irg_entity)(ir_graph *irg) {
+  return __get_irg_ent(irg);
 }
 
 void
-set_irg_ent (ir_graph *irg, entity *ent)
-{
-  irg->ent = ent;
+(set_irg_entity)(ir_graph *irg, entity *ent) {
+  __set_irg_ent(irg, ent);
 }
 
 type *
-get_irg_frame_type (ir_graph *irg)
-{
-  assert(irg && irg->frame_type);
-  return irg->frame_type;
+(get_irg_frame_type)(ir_graph *irg) {
+  return __get_irg_frame_type(irg);
 }
 
 void
-set_irg_frame_type (ir_graph *irg, type *ftp)
-{
-  assert(is_class_type(ftp));
-  irg->frame_type = ftp;
+(set_irg_frame_type)(ir_graph *irg, type *ftp) {
+  __set_irg_frame_type(irg, ftp);
 }
 
 
@@ -422,28 +473,27 @@ is_frame_type(type *ftp) {
 int
 get_irg_n_locs (ir_graph *irg)
 {
-#if PRECISE_EXC_CONTEXT
-  return irg->n_loc - 1 - 1;
-#else
-  return irg->n_loc - 1;
-#endif
+  if (get_opt_precise_exc_context())
+    return irg->n_loc - 1 - 1;
+  else
+    return irg->n_loc - 1;
 }
 
 void
 set_irg_n_loc (ir_graph *irg, int n_loc)
 {
-#if PRECISE_EXC_CONTEXT
-  irg->n_loc = n_loc + 1 + 1;
-#else
-  irg->n_loc = n_loc + 1;
-#endif
+  if (get_opt_precise_exc_context())
+    irg->n_loc = n_loc + 1 + 1;
+  else
+    irg->n_loc = n_loc + 1;
 }
 
 
 
 /* Returns the obstack associated with the graph. */
-struct obstack *get_irg_obstack(ir_graph *irg) {
-  return irg->obst;
+struct obstack *
+(get_irg_obstack)(ir_graph *irg) {
+  return __get_irg_obstack(irg);
 }
 
 /*
@@ -453,11 +503,11 @@ struct obstack *get_irg_obstack(ir_graph *irg) {
  */
 int node_is_in_irgs_storage(ir_graph *irg, ir_node *n)
 {
-  struct _obstack_chunk	*p;
+  struct _obstack_chunk *p;
 
   /*
    * checks wheater the ir_node pointer i on the obstack.
-   * A more sophisticated chaeck would test the "whole" ir_node
+   * A more sophisticated check would test the "whole" ir_node
    */
   for (p = irg->obst->chunk; p; p = p->prev) {
     if (((char *)p->contents <= (char *)n) && ((char *)n < (char *)p->limit))
@@ -468,62 +518,106 @@ int node_is_in_irgs_storage(ir_graph *irg, ir_node *n)
 }
 
 irg_phase_state
-get_irg_phase_state (ir_graph *irg) {
-  return irg->phase_state;
+(get_irg_phase_state)(ir_graph *irg) {
+  return __get_irg_phase_state(irg);
 }
 
 void
-set_irg_phase_low(ir_graph *irg) {
-  irg->phase_state = phase_low;
+(set_irg_phase_low)(ir_graph *irg) {
+  __set_irg_phase_low(irg);
 }
 
-op_pinned
-get_irg_pinned (ir_graph *irg) {
-  return irg->pinned;
+op_pin_state
+(get_irg_pinned)(ir_graph *irg) {
+  return __get_irg_pinned(irg);
 }
 
 irg_outs_state
-get_irg_outs_state(ir_graph *irg) {
-  return irg->outs_state;
+(get_irg_outs_state)(ir_graph *irg) {
+  return __get_irg_outs_state(irg);
 }
 
 void
-set_irg_outs_inconsistent(ir_graph *irg) {
-  irg->outs_state = outs_inconsistent;
+(set_irg_outs_inconsistent)(ir_graph *irg) {
+  __set_irg_outs_inconsistent(irg);
 }
 
 irg_dom_state
-get_irg_dom_state(ir_graph *irg) {
-  return irg->dom_state;
+(get_irg_dom_state)(ir_graph *irg) {
+  return __get_irg_dom_state(irg);
 }
 
 void
-set_irg_dom_inconsistent(ir_graph *irg) {
-  irg->dom_state = dom_inconsistent;
+(set_irg_dom_inconsistent)(ir_graph *irg) {
+  __set_irg_dom_inconsistent(irg);
 }
 
-INLINE void
-set_irg_pinned (ir_graph *irg, op_pinned p) {
-  irg->pinned = p;
+irg_loopinfo_state
+(get_irg_loopinfo_state)(ir_graph *irg) {
+  return __get_irg_loopinfo_state(irg);
 }
 
-INLINE void
-set_irg_link (ir_graph *irg, void *thing) {
-  irg->link = thing;
+void
+(set_irg_loopinfo_state)(ir_graph *irg, irg_loopinfo_state s) {
+  __set_irg_loopinfo_state(irg, s);
 }
 
-INLINE void *
-get_irg_link (ir_graph *irg) {
-  return irg->link;
+void
+set_irg_loopinfo_inconsistent(ir_graph *irg) {
+  if (irg->loopinfo_state == loopinfo_ip_consistent)
+    irg->loopinfo_state = loopinfo_ip_inconsistent;
+
+  else if (irg->loopinfo_state == loopinfo_consistent)
+    irg->loopinfo_state = loopinfo_inconsistent;
+
+  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) {
+  __set_irg_pinned(irg, p);
+}
+
+irg_callee_info_state
+(get_irg_callee_info_state)(ir_graph *irg) {
+  return __get_irg_callee_info_state(irg);
+}
+
+void
+(set_irg_callee_info_state)(ir_graph *irg, irg_callee_info_state s) {
+  __set_irg_callee_info_state(irg, s);
+}
+
+irg_inline_property
+(get_irg_inline_property)(ir_graph *irg) {
+  return __get_irg_inline_property(irg);
+}
+
+void
+(set_irg_inline_property)(ir_graph *irg, irg_inline_property s) {
+  __set_irg_inline_property(irg, s);
+}
+
+void
+(set_irg_link)(ir_graph *irg, void *thing) {
+  __set_irg_link(irg, thing);
+}
+
+void *
+(get_irg_link)(ir_graph *irg) {
+  return __get_irg_link(irg);
 }
 
 /* maximum visited flag content of all ir_graph visited fields. */
 static int max_irg_visited = 0;
 
 unsigned long
-get_irg_visited (ir_graph *irg)
-{
-  return irg->visited;
+(get_irg_visited)(ir_graph *irg) {
+  return __get_irg_visited(irg);
 }
 
 void
@@ -571,19 +665,33 @@ inc_max_irg_visited(void)
 }
 
 unsigned long
-get_irg_block_visited (ir_graph *irg)
-{
-  return irg->block_visited;
+(get_irg_block_visited)(ir_graph *irg) {
+  return __get_irg_block_visited(irg);
 }
 
 void
-set_irg_block_visited (ir_graph *irg, unsigned long visited)
-{
-  irg->block_visited = visited;
+(set_irg_block_visited)(ir_graph *irg, unsigned long visited) {
+  __set_irg_block_visited(irg, visited);
 }
 
 void
-inc_irg_block_visited (ir_graph *irg)
+(inc_irg_block_visited)(ir_graph *irg) {
+  __inc_irg_block_visited(irg);
+}
+
+/* is irg a pseudo graph for analysis? */
+int is_pseudo_ir_graph(ir_graph *irg)
 {
-  ++irg->block_visited;
+  int res = false;
+  entity *ent;
+
+  assert(irg && "nothing here");
+  assert(is_ir_graph(irg) && "no ir_graph given");
+
+  ent = get_irg_entity(irg);
+  if(visibility_external_allocated == get_entity_visibility(ent)
+     && peculiarity_existent == get_entity_peculiarity(ent)) {
+    res = true;
+  }
+  return(res);
 }