* @brief Compute heights of nodes inside basic blocks
* @author Sebastian Hack
* @date 19.04.2006
- * @version $Id$
- *
- * The height is a measure for the longest datadependencies path from a node to
- * the end of a basic block. This is usefull for scheduling heuristics and can
- * also be used to speedup reachability queries.
*/
#ifndef FIRM_ANA_HEIGHTS_H
#define FIRM_ANA_HEIGHTS_H
#include "firm_types.h"
#include "begin.h"
+/**
+ * @ingroup irana
+ * @defgroup ir_heights Node Heights
+ *
+ * The height is a measure for the longest datadependencies path from a node to
+ * the end of a basic block. This is usefull for scheduling heuristics and can
+ * also be used to speedup reachability queries.
+ *
+ * @{
+ */
+
/**
* Get the height of a node inside a basic block.
* The height of the node is the maximal number of edges between a sink node in
FIRM_API int heights_reachable_in_block(ir_heights_t *h, const ir_node *n,
const ir_node *m);
-/**
- * Recompute the height information.
- * This can be used to recompute the height information if the graph has changed since the last computation.
- * @param h The heights object.
- */
-FIRM_API void heights_recompute(ir_heights_t *h);
-
/**
* Recompute the height information for a certain block.
* This can be used to recompute the height information of a block.
*/
FIRM_API void heights_free(ir_heights_t *h);
+/** @} */
+
#include "end.h"
#endif