2 * Copyright (C) 1995-2007 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
27 #ifndef FIRM_ANA_HEIGHTS_H
28 #define FIRM_ANA_HEIGHTS_H
30 typedef struct _heights_t heights_t;
33 * Get the height of a node inside a basic block.
34 * The height of the node is the maximal number of edges between a sink node in that block and the node itself (plus 1).
35 * @param h The heights object.
36 * @param irn The node.
37 * @return The height of the node.
39 unsigned get_irn_height(heights_t *h, const ir_node *irn);
42 * Check, if a certain node is reachable according to data dependence edges from another node.
43 * @param h The heights object.
44 * @param n The first node.
45 * @param m The other node.
46 * @return 1, if n is data dependent on m, 0 if not.
48 int heights_reachable_in_block(heights_t *h, const ir_node *n, const ir_node *m);
51 * Recompute the height information.
52 * This can be used to recompute the height information if the graph has changed since the last computation.
53 * @param h The heights object.
55 void heights_recompute(heights_t *h);
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 unsigned heights_recompute_block(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 heights_t *heights_new(ir_graph *irg);
74 * Free a heights object.
75 * @param h The heights object.
77 void heights_free(heights_t *h);
80 #endif /* FIRM_ANA_HEIGHTS_H */