X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbedomfront.h;h=9a1385850b32e7dbba8385ee1d7ae90074dea40c;hb=5d6cfd12693c34b702aab148038ebb562f2695f9;hp=6d3f06eb9ae349136aec3971957f12b198373d2a;hpb=4d5c3365a58cba59993045a9e08e686d8ae079a7;p=libfirm

diff --git a/ir/be/bedomfront.h b/ir/be/bedomfront.h
index 6d3f06eb9..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,22 +19,16 @@
 
 /**
  * @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$
- * Copyright:   (c) Universitaet Karlsruhe
- * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
  */
-#ifndef _FIRM_BE_DOMFRONT_H_
-#define _FIRM_BE_DOMFRONT_H_
+#ifndef FIRM_BE_BEDOMFRONT_H
+#define FIRM_BE_BEDOMFRONT_H
 
-#include "irnodeset.h"
-
-/*
- * Forward type declaration.
- */
-typedef struct _be_dom_front_info_t be_dom_front_info_t;
+#include "firm_types.h"
+#include "be_types.h"
 
 /**
  * Compute the dominance frontiers for a given graph.
@@ -55,7 +49,6 @@ void be_free_dominance_frontiers(be_dom_front_info_t *info);
  * @param block The block whose dominance frontier you want.
  * @return A list containing the all blocks in the dominance frontier of @p block.
  */
-ir_node **be_get_dominance_frontier(const be_dom_front_info_t *info,
-                                    ir_node *block);
+ir_node **be_get_dominance_frontier(const be_dom_front_info_t *info, ir_node *block);
 
 #endif