-
/**
- * IRG modifications for be routines.
- * @date 4.5.2005
+ * This file contains the following IRG modifications for be routines:
+ * - backend dominance information
+ * - SSA construction for a set of nodes
+ * - insertion of Perm nodes
+ * - empty block elimination
+ * - a simple dead node elimination (set inputs of unreachable nodes to BAD)
*
- * Copyright (C) 2005 Universitaet Karlsruhe.
- * Released under the GPL.
+ * Author: Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig
+ * Date: 04.05.2005
+ * Copyright: (c) Universitaet Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ * CVS-Id: $Id$
*/
#ifndef _BEIRGMOD_H
* Get the dominance frontier of a block.
* @param info A pointer to the dominance frontier information.
* @param block The block whose dominance frontier you want.
- * @return A set containing the all blocks in the dominance frontier of @p block.
+ * @return A list containing the all blocks in the dominance frontier of @p block.
*/
-pset *be_get_dominance_frontier(be_dom_front_info_t *info, ir_node *block);
+ir_node **be_get_dominance_frontier(be_dom_front_info_t *info, ir_node *block);
/**
* Free some dominance frontier information.
void extreme_liverange_splitting(struct _be_chordal_env_t *cenv);
/**
- * removes basic blocks that only contain a jump instruction
- * (this will potentially create critical edges)
+ * Removes basic blocks that only contain a jump instruction
+ * (this will potentially create critical edges).
+ *
+ * @param irg the graph that will be changed
+ *
+ * @return non-zero if the graph was changed, zero else
*/
-void be_remove_empty_blocks(ir_graph *irg);
+int be_remove_empty_blocks(ir_graph *irg);
#endif /* _BEIRGMOD_H */