/*
- * 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.
*
* @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
#include "obst.h"
-typedef struct _absgraph_t {
+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 */