2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Algorithms for computing dominance frontiers
23 * @author Sebastian Hack, Daniel Grund
27 #ifndef FIRM_BE_BEDOMFRONT_H
28 #define FIRM_BE_BEDOMFRONT_H
30 #include "firm_types.h"
34 * Compute the dominance frontiers for a given graph.
35 * @param irg The graphs.
36 * @return A pointer to the dominance frontier information.
38 be_dom_front_info_t *be_compute_dominance_frontiers(ir_graph *irg);
41 * Free some dominance frontier information.
42 * @param info Some dominance frontier information.
44 void be_free_dominance_frontiers(be_dom_front_info_t *info);
47 * Get the dominance frontier of a block.
48 * @param info A pointer to the dominance frontier information.
49 * @param block The block whose dominance frontier you want.
50 * @return A list containing the all blocks in the dominance frontier of @p block.
52 ir_node **be_get_dominance_frontier(const be_dom_front_info_t *info, ir_node *block);