projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
put register classes into arch_env struct, no need for complicated callbacks
[libfirm]
/
ir
/
be
/
bedomfront.h
diff --git
a/ir/be/bedomfront.h
b/ir/be/bedomfront.h
index
b012c96
..
9a13858
100644
(file)
--- a/
ir/be/bedomfront.h
+++ b/
ir/be/bedomfront.h
@@
-1,5
+1,5
@@
/*
/*
- * Copyright (C) 1995-200
7
University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-200
8
University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
*
* This file is part of libFirm.
*
@@
-19,7
+19,7
@@
/**
* @file
/**
* @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$
* @author Sebastian Hack, Daniel Grund
* @date: 04.05.2005
* @version $Id$
@@
-27,13
+27,8
@@
#ifndef FIRM_BE_BEDOMFRONT_H
#define FIRM_BE_BEDOMFRONT_H
#ifndef FIRM_BE_BEDOMFRONT_H
#define FIRM_BE_BEDOMFRONT_H
-#include "irnode.h"
-#include "irgraph.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.
/**
* Compute the dominance frontiers for a given graph.
@@
-56,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);
*/
ir_node **be_get_dominance_frontier(const be_dom_front_info_t *info, ir_node *block);
-#endif
/* FIRM_BE_BEDOMFRONT_H */
+#endif