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 Compute heights of nodes inside basic blocks
23 * @author Sebastian Hack
26 * The height is a measure for the longest datadependencies path from a node to
27 * the end of a basic block. This is usefull for scheduling heuristics and can
28 * also be used to speedup reachability queries.
30 #ifndef FIRM_ANA_HEIGHTS_H
31 #define FIRM_ANA_HEIGHTS_H
33 #include "firm_types.h"
37 * Get the height of a node inside a basic block.
38 * The height of the node is the maximal number of edges between a sink node in
39 * that block and the node itself (plus 1).
40 * @param h The heights object.
41 * @param irn The node.
42 * @return The height of the node.
44 FIRM_API unsigned get_irn_height(const ir_heights_t *h, const ir_node *irn);
47 * Check, if a certain node is reachable according to data dependence edges
48 * from another node. Both nodes must be in the same block.
49 * @param h The heights object.
50 * @param n The first node.
51 * @param m The other node.
52 * @return 1, if n is data dependent on m, 0 if not.
54 FIRM_API int heights_reachable_in_block(ir_heights_t *h, const ir_node *n,
58 * Recompute the height information for a certain block.
59 * This can be used to recompute the height information of a block.
60 * @param h The heights object.
61 * @param block The block
62 * @return The maximum over all heights in the block.
64 FIRM_API unsigned heights_recompute_block(ir_heights_t *h, ir_node *block);
67 * Make a new heights object.
68 * This also computes the heights for each block in the graph.
69 * @param irg The graph.
71 FIRM_API ir_heights_t *heights_new(ir_graph *irg);
74 * Free a heights object.
75 * @param h The heights object.
77 FIRM_API void heights_free(ir_heights_t *h);