X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Fabsgraph.h;h=577f7efb743a36dea3dcc5dcb4a205536ccc05eb;hb=fabe62c2752d06a727637122ab5a0a5ccd83c422;hp=356f5719eac79149138f0301667679d8308f53a3;hpb=bd761d8687f89b868057fb823c8abd8f13643c6c;p=libfirm

diff --git a/ir/ana/absgraph.h b/ir/ana/absgraph.h
index 356f5719e..577f7efb7 100644
--- a/ir/ana/absgraph.h
+++ b/ir/ana/absgraph.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -21,17 +21,14 @@
  * @file    absgraph.h
  * @author  Sebastian Hack
  * @date    20.04.2007
- * @version $Id: $
- * @summary
+ * @version $Id$
+ * @brief
  *
  * An abstract graph "interface". Currently
  * only used by the DFS facility.
  *
  * This is just that we can do some graph algos
  * on the CFG, dominance tree, etc.
- *
- * Copyright (C) 2007 Universitaet Karlsruhe
- * Released under the GPL
  */
 #ifndef FIRM_ANA_ABSGRAPH_H
 #define FIRM_ANA_ABSGRAPH_H
@@ -41,9 +38,10 @@
 typedef struct _absgraph_t {
 	void *(*get_root)(void *self);
 	void (*grow_succs)(void *self, void *node, struct obstack *obst);
+	void *(*get_end)(void *self);
 } absgraph_t;
 
-const absgraph_t absgraph_irg_cfg_succ;
-const absgraph_t absgraph_irg_cfg_pred;
+extern const absgraph_t absgraph_irg_cfg_succ;
+extern const absgraph_t absgraph_irg_cfg_pred;
 
 #endif /* FIRM_ANA_ABSGRAPH_H */