X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbedomfront.h;h=9a1385850b32e7dbba8385ee1d7ae90074dea40c;hb=0378ccc621a98322785250f96d85d3b32dc0cad1;hp=5bd9ea1c0583cb840533a7d1b82df7716ff37235;hpb=1ce363f80e6a204d4011f85813362d9bd1d0e7e4;p=libfirm

diff --git a/ir/be/bedomfront.h b/ir/be/bedomfront.h
index 5bd9ea1c0..9a1385850 100644
--- a/ir/be/bedomfront.h
+++ b/ir/be/bedomfront.h
@@ -19,7 +19,7 @@
 
 /**
  * @file
- * @brief       Algorithms for computing normal and iterated dominance frontiers
+ * @brief       Algorithms for computing dominance frontiers
  * @author      Sebastian Hack, Daniel Grund
  * @date:       04.05.2005
  * @version     $Id$
@@ -28,11 +28,7 @@
 #define FIRM_BE_BEDOMFRONT_H
 
 #include "firm_types.h"
-
-/*
- * Forward type declaration.
- */
-typedef struct _be_dom_front_info_t be_dom_front_info_t;
+#include "be_types.h"
 
 /**
  * Compute the dominance frontiers for a given graph.
@@ -55,4 +51,4 @@ void be_free_dominance_frontiers(be_dom_front_info_t *info);
  */
 ir_node **be_get_dominance_frontier(const be_dom_front_info_t *info, ir_node *block);
 
-#endif /* FIRM_BE_BEDOMFRONT_H */
+#endif