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
36 #include "irnodemap.h"
37 #include "iredges_t.h"
53 static irn_height_t *maybe_get_height_data(const ir_heights_t *heights,
56 irn_height_t *height = ir_nodemap_get(irn_height_t, &heights->data, node);
60 static irn_height_t *get_height_data(ir_heights_t *heights, const ir_node *node)
62 irn_height_t *height = ir_nodemap_get(irn_height_t, &heights->data, node);
64 height = OALLOCZ(&heights->obst, irn_height_t);
65 ir_nodemap_insert(&heights->data, node, height);
70 static void height_dump_cb(void *data, FILE *f, const ir_node *irn)
72 const ir_heights_t *heights = (const ir_heights_t*) data;
73 const irn_height_t *h = maybe_get_height_data(heights, irn);
75 fprintf(f, "height: %u\n", h->height);
79 * Check, if we can reach a target node from a given node inside one basic block.
80 * @param h The heights object.
81 * @param curr The current node from which we tried to reach the other one.
82 * @param tgt The node we try to reach.
83 * @return 1, one of tgt can be reached from curr, 0 else.
85 static bool search(ir_heights_t *h, const ir_node *curr, const ir_node *tgt)
91 /* if the current node is the one we were looking for, we're done. */
95 /* If we are in another block or at a phi we won't find our target. */
96 if (get_nodes_block(curr) != get_nodes_block(tgt))
101 /* Check, if we have already been here. Coming more often won't help :-) */
102 h_curr = maybe_get_height_data(h, curr);
103 if (h_curr->visited >= h->visited)
106 /* If we are too deep into the DAG we won't find the target either. */
107 h_tgt = maybe_get_height_data(h, tgt);
108 if (h_curr->height > h_tgt->height)
111 /* Mark this place as visited. */
112 h_curr->visited = h->visited;
114 /* Start a search from this node. */
115 for (i = 0, n = get_irn_ins_or_deps(curr); i < n; ++i) {
116 ir_node *op = get_irn_in_or_dep(curr, i);
117 if (search(h, op, tgt))
124 int heights_reachable_in_block(ir_heights_t *h, const ir_node *n,
128 irn_height_t *hn = maybe_get_height_data(h, n);
129 irn_height_t *hm = maybe_get_height_data(h, m);
131 assert(get_nodes_block(n) == get_nodes_block(m));
132 assert(hn != NULL && hm != NULL);
134 if (hn->height <= hm->height) {
136 res = search(h, n, m);
143 * Compute the height of a node in a block.
144 * @param h The heights object.
145 * @param irn The node.
146 * @param bl The block.
148 static unsigned compute_height(ir_heights_t *h, ir_node *irn, const ir_node *bl)
150 irn_height_t *ih = get_height_data(h, irn);
152 /* bail out if we already visited that node. */
153 if (ih->visited >= h->visited)
156 ih->visited = h->visited;
159 foreach_out_edge(irn, edge) {
160 ir_node *dep = get_edge_src_irn(edge);
162 if (!is_Block(dep) && !is_Phi(dep) && get_nodes_block(dep) == bl) {
163 unsigned dep_height = compute_height(h, dep, bl);
164 ih->height = MAX(ih->height, dep_height);
170 foreach_out_edge_kind(irn, edge, EDGE_KIND_DEP) {
171 ir_node *dep = get_edge_src_irn(edge);
173 assert(!is_Phi(dep));
174 if (!is_Block(dep) && get_nodes_block(dep) == bl) {
175 unsigned dep_height = compute_height(h, dep, bl);
176 ih->height = MAX(ih->height, dep_height);
185 static unsigned compute_heights_in_block(ir_node *bl, ir_heights_t *h)
191 foreach_out_edge(bl, edge) {
192 ir_node *dep = get_edge_src_irn(edge);
193 int curh = compute_height(h, dep, bl);
195 max_height = MAX(curh, max_height);
198 foreach_out_edge_kind(bl, edge, EDGE_KIND_DEP) {
199 ir_node *dep = get_edge_src_irn(edge);
200 int curh = compute_height(h, dep, bl);
202 max_height = MAX(curh, max_height);
208 static void compute_heights_in_block_walker(ir_node *block, void *data)
210 ir_heights_t *h = (ir_heights_t*) data;
211 compute_heights_in_block(block, h);
214 unsigned get_irn_height(const ir_heights_t *heights, const ir_node *irn)
216 const irn_height_t *height = maybe_get_height_data(heights, irn);
217 assert(height != NULL && "No height information for node");
218 return height->height;
221 unsigned heights_recompute_block(ir_heights_t *h, ir_node *block)
223 ir_graph *irg = get_irn_irg(block);
227 /* reset data for all nodes in the block */
228 foreach_out_edge(block, edge) {
229 ir_node *irn = get_edge_src_irn(edge);
230 irn_height_t *ih = get_height_data(h, irn);
231 memset(ih, 0, sizeof(*ih));
235 return compute_heights_in_block(block, h);
238 ir_heights_t *heights_new(ir_graph *irg)
240 ir_heights_t *res = XMALLOCZ(ir_heights_t);
241 ir_nodemap_init(&res->data, irg);
242 obstack_init(&res->obst);
243 res->dump_handle = dump_add_node_info_callback(height_dump_cb, res);
246 irg_block_walk_graph(irg, compute_heights_in_block_walker, NULL, res);
251 void heights_free(ir_heights_t *h)
253 dump_remove_node_info_callback(h->dump_handle);
254 obstack_free(&h->obst, NULL);
255 ir_nodemap_destroy(&h->data);