X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbedomfront.h;h=9a1385850b32e7dbba8385ee1d7ae90074dea40c;hb=8a907f80824671f3ff21569442566dceca8d4f5f;hp=eaa08f53567cb3acb93440e9f691ead5ec74428c;hpb=d1de7107f847963fbce099597e6c42c2371b053c;p=libfirm

diff --git a/ir/be/bedomfront.h b/ir/be/bedomfront.h
index eaa08f535..9a1385850 100644
--- a/ir/be/bedomfront.h
+++ b/ir/be/bedomfront.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.
  *
@@ -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