X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgraph.c;h=b2ff2072232974437be9cb78fb16fda1f670c3a5;hb=e5bab593a4048c0a320d7794fb2cb17697da8389;hp=e5b9fe61d593d98617cef216b3d4c197e446cec2;hpb=3841faf71dcf8efa8312d0ebd9941f1e0fc08d72;p=libfirm

diff --git a/ir/ir/irgraph.c b/ir/ir/irgraph.c
index e5b9fe61d..b2ff20722 100644
--- a/ir/ir/irgraph.c
+++ b/ir/ir/irgraph.c
@@ -1,23 +1,60 @@
-/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
-** All rights reserved.
-**
-** Authors: Martin Trapp, Christian Schaefer
-**
-**
-*/
+/*
+ * Project:     libFIRM
+ * File name:   ir/ir/irgraph.c
+ * Purpose:     Entry point to the representation of procedure code.
+ * Author:      Martin Trapp, Christian Schaefer
+ * Modified by: Goetz Lindenmaier
+ * Created:
+ * CVS-ID:      $Id$
+ * Copyright:   (c) 1998-2003 Universität Karlsruhe
+ * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
+ */
+
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
+# include <string.h>
 
 # include "ircons.h"
-# include "irgraph.h"
-# include "irprog.h"
-# include "iropt.h"
+# include "irgraph_t.h"
+# include "irprog_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) {
+  return current_ir_graph;
+}
+INLINE void set_current_ir_graph(ir_graph *graph) {
+  current_ir_graph = graph;
+}
 
-unsigned long ir_visited = 0;
-unsigned long block_visited = 0;
 
+bool interprocedural_view = false;
+INLINE bool get_interprocedural_view(void) {
+  return interprocedural_view;
+}
+INLINE void set_interprocedural_view(bool state) {
+  interprocedural_view = state;
+}
+
+static ident* frame_type_suffix = NULL;
+void init_irgraph(void) {
+  frame_type_suffix = new_id_from_chars(FRAME_TP_SUFFIX, strlen(FRAME_TP_SUFFIX));
+}
+
+#if USE_EXPLICIT_PHI_IN_STACK
+/* really defined in ircons.c */
+typedef struct Phi_in_stack Phi_in_stack;
+Phi_in_stack *new_Phi_in_stack();
+void free_Phi_in_stack(Phi_in_stack *s);
+#endif
 
 /* Allocates a list of nodes:
     - The start block containing a start node and Proj nodes for it's four
@@ -29,208 +66,602 @@ unsigned long block_visited = 0;
    and optimization.
 */
 ir_graph *
-new_ir_graph (entity *ent, int params)
+new_ir_graph (entity *ent, int n_loc)
 {
   ir_graph *res;
   ir_node *first_block;
   ir_node *projX;
 
   res = (ir_graph *) malloc (sizeof (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. */
 
-  /** Internal information for graph construction either held in the graph or
-  *** initialized for each graph. **/
-  res->params = params + 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!  */
-#if USE_EXPICIT_PHI_IN_STACK
+  /*-- 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 */
+
+#if USE_EXPLICIT_PHI_IN_STACK
   res->Phi_in_stack = new_Phi_in_stack();  /* A stack needed for automatic Phi
                                 generation */
 #endif
+  res->kind = k_ir_graph;
   res->obst      = (struct obstack *) xmalloc (sizeof (struct obstack));
   obstack_init (res->obst);
-  res->value_table = new_identities (); /* Symbol table for local variables
-					   of this procedure */
-
-  /** Type inforamtion for the procedure of the graph **/
+  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;
+
+  /*-- 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);
 
-  /** Nodes needed in every graph **/
-  res->end_block = new_Block ();
-  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_Block ();
-  res->start     = new_Start ();
-  res->bad       = new_ir_node (res, res->start_block, op_Bad, 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, pns_frame_base);
-  res->globals = new_Proj (res->start, mode_p, 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();
+#endif
+
+  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:
+   * add_immBlock_pred(res->start_block, res->start_block), but invalid typed.
+   */
+  mature_immBlock (res->current_block);
+
+  /*-- Make a block to start with --*/
+  first_block = new_immBlock();
+  add_immBlock_pred (first_block, projX);
+
+  return res;
+}
+
 
-  add_in_edge(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.
+/* Make a rudimentary ir graph for the constant code.
+   Must look like a correct irg, spare everything else. */
+ir_graph *new_const_code_irg(void) {
+  ir_graph *res;
+  ir_node *projX;
 
-  mature_block (res->current_block);
+  res = (ir_graph *) malloc (sizeof(*res));
+  memset(res, 0, sizeof(*res));
 
-  /** Make a block to start with **/
-  first_block = new_Block ();
-  add_in_edge (first_block, projX);
+  /* 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->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      = (struct obstack *) xmalloc (sizeof (struct obstack));
+  obstack_init (res->obst);
+  res->phase_state = phase_building;
+  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 */
+  res->ent = NULL;
+  res->frame_type  = NULL;
+  res->start_block = new_immBlock ();
+  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->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, 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;
 }
 
-/* access routines for all ir_graph attributes */
+/* 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.
+   Does not remove the irgraph from the list in irprog (requires
+   inefficient search, call remove_irp_irg by hand).
+   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) {
+
+  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);
+}
+
+/* access routines for all ir_graph attributes:
+   templates:
+   {attr type} get_irg_{attribute name} (ir_graph *irg);
+   void set_irg_{attr name} (ir_graph *irg, {attr type} {attr}); */
+
+int
+(is_ir_graph)(void *thing) {
+  return __is_ir_graph(thing);
+}
+
+/* Outputs a unique number for this node */
+
+INLINE long
+get_irg_graph_nr(ir_graph *irg) {
+  assert(irg);
+#ifdef DEBUG_libfirm
+  return irg->graph_nr;
+#else
+  return (long)irg;
+#endif
+}
 
 ir_node *
-get_start_block_of_irgraph (ir_graph *irg)
-{
-  return irg->start_block;
+(get_irg_start_block)(ir_graph *irg) {
+  return __get_irg_start_block(irg);
 }
 
 void
-set_start_block_of_irgraph (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_start_of_irgraph (ir_graph *irg)
-{
-  return irg->start;
+(get_irg_start)(ir_graph *irg) {
+  return __get_irg_start(irg);
 }
 
 void
-set_start_of_irgraph(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_end_block_of_irgraph (ir_graph *irg)
-{
-  return irg->end_block;
+(get_irg_end_block)(ir_graph *irg) {
+  return __get_irg_end_block(irg);
 }
 
 void
-set_end_block_of_irgraph (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_end_of_irgraph (ir_graph *irg)
-{
-  return irg->end;
+(get_irg_end)(ir_graph *irg) {
+  return __get_irg_end(irg);
 }
 
 void
-set_end_of_irgraph (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_cstore_of_irgraph (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_cstore_of_irgraph (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_frame_of_irgraph (ir_graph *irg)
-{
-  return irg->frame;
+(get_irg_frame)(ir_graph *irg) {
+  return __get_irg_frame(irg);
 }
 
 void
-set_frame_of_irgraph(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 __get_irg_globals(irg);
 }
 
+void
+(set_irg_globals)(ir_graph *irg, ir_node *node) {
+  __set_irg_globals(irg, node);
+}
 
 ir_node *
-get_irg_globals (ir_graph *irg)
+(get_irg_initial_mem)(ir_graph *irg)
 {
-  return irg->globals;
+  return __get_irg_initial_mem(irg);
 }
 
 void
-set_irg_globals (ir_graph *irg, ir_node *node)
-{
-  irg->globals = node;
+(set_irg_initial_mem)(ir_graph *irg, ir_node *node) {
+  __set_irg_initial_mem(irg, node);
 }
 
+ir_node *
+(get_irg_args)(ir_graph *irg) {
+  return __get_irg_args(irg);
+}
 
+void
+(set_irg_args)(ir_graph *irg, ir_node *node) {
+  __set_irg_args(irg, node);
+}
 
 ir_node *
-get_args_of_irgraph (ir_graph *irg)
-{
-  return irg->args;
+(get_irg_bad)(ir_graph *irg) {
+  return __get_irg_bad(irg);
 }
 
 void
-set_args_of_irgraph(ir_graph *irg, ir_node *node)
-{
-  irg->args = node;
+(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_bad_of_irgraph (ir_graph *irg)
+get_irg_unknown (ir_graph *irg)
 {
-  return irg->bad;
+  return irg->unknown;
 }
 
 void
-set_bad_of_irgraph(ir_graph *irg, ir_node *node)
+set_irg_unknown (ir_graph *irg, ir_node *node)
 {
-  irg->bad = node;
+  irg->unknown = node;
 }
+*/
 
 ir_node *
-get_current_block_of_irgraph (ir_graph *irg)
-{
-  return irg->current_block;
+(get_irg_current_block)(ir_graph *irg) {
+  return __get_irg_current_block(irg);
 }
 
 void
-set_current_block_of_irgraph(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_ent_of_irgraph(ir_graph *irg)
+(get_irg_entity)(ir_graph *irg) {
+  return __get_irg_ent(irg);
+}
+
+void
+(set_irg_entity)(ir_graph *irg, entity *ent) {
+  __set_irg_ent(irg, ent);
+}
+
+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(irg, ftp);
+}
+
+
+/* To test for a frame type */
+int
+is_frame_type(type *ftp) {
+  int i;
+  if (is_class_type(ftp)) {
+    for (i = 0; i < get_irp_n_irgs(); i++) {
+      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)
 {
-  return irg->ent;
+  if (get_opt_precise_exc_context())
+    return irg->n_loc - 1 - 1;
+  else
+    return irg->n_loc - 1;
 }
 
 void
-set_ent_of_irgraph(ir_graph *irg, entity *ent)
+set_irg_n_loc (ir_graph *irg, int n_loc)
 {
-  irg->ent = ent;
+  if (get_opt_precise_exc_context())
+    irg->n_loc = n_loc + 1 + 1;
+  else
+    irg->n_loc = n_loc + 1;
 }
 
-int
-get_params_of_irgraph(ir_graph *irg)
+
+
+/* Returns the obstack associated with the graph. */
+struct obstack *
+(get_irg_obstack)(ir_graph *irg) {
+  return __get_irg_obstack(irg);
+}
+
+/*
+ * Returns true if the node n is allocated on the storage of graph irg.
+ *
+ * Implementation is GLIBC specific as is uses the internal _obstack_chunk implementation.
+ */
+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.
+   * 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))
+      return 1;
+  }
+
+  return 0;
+}
+
+irg_phase_state
+(get_irg_phase_state)(ir_graph *irg) {
+  return __get_irg_phase_state(irg);
+}
+
+void
+(set_irg_phase_low)(ir_graph *irg) {
+  __set_irg_phase_low(irg);
+}
+
+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 __get_irg_outs_state(irg);
+}
+
+void
+(set_irg_outs_inconsistent)(ir_graph *irg) {
+  __set_irg_outs_inconsistent(irg);
+}
+
+irg_dom_state
+(get_irg_dom_state)(ir_graph *irg) {
+  return __get_irg_dom_state(irg);
+}
+
+void
+(set_irg_dom_inconsistent)(ir_graph *irg) {
+  __set_irg_dom_inconsistent(irg);
+}
+
+irg_loopinfo_state
+(get_irg_loopinfo_state)(ir_graph *irg) {
+  return __get_irg_loopinfo_state(irg);
+}
+
+void
+(set_irg_loopinfo_state)(ir_graph *irg, irg_loopinfo_state s) {
+  __set_irg_loopinfo_state(irg, s);
+}
+
+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 __get_irg_visited(irg);
+}
+
+void
+set_irg_visited (ir_graph *irg, unsigned long visited)
 {
-  return irg->params;
+  irg->visited = visited;
+  if (irg->visited > max_irg_visited) {
+    max_irg_visited = irg->visited;
+  }
 }
 
 void
-set_params_of_irgraph(ir_graph *irg, int params)
+inc_irg_visited (ir_graph *irg)
 {
-  irg->params = params;
+  if (++irg->visited > max_irg_visited) {
+    max_irg_visited = irg->visited;
+  }
+}
+
+unsigned long
+get_max_irg_visited(void)
+{
+  /*
+  int i;
+  for(i = 0; i < get_irp_n_irgs(); i++)
+  assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
+   */
+  return max_irg_visited;
+}
+
+void set_max_irg_visited(int val) {
+  max_irg_visited = val;
+}
+
+unsigned long
+inc_max_irg_visited(void)
+{
+  /*
+  int i;
+  for(i = 0; i < get_irp_n_irgs(); i++)
+  assert(max_irg_visited >= get_irg_visited(get_irp_irg(i)));
+  */
+  max_irg_visited++;
+  return max_irg_visited;
+}
+
+unsigned long
+(get_irg_block_visited)(ir_graph *irg) {
+  return __get_irg_block_visited(irg);
+}
+
+void
+(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(irg);
 }