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
39 #include "irphase_t.h"
40 #include "iredges_t.h"
42 typedef struct _heights_t heights_t;
55 static void *irn_height_init(ir_phase *ph, ir_node *irn, void *data)
57 irn_height_t *h = data ? data : phase_alloc(ph, sizeof(h[0]));
59 memset(h, 0, sizeof(h[0]));
63 static void height_dump_cb(void *data, FILE *f, const ir_node *irn)
65 heights_t *heights = data;
66 irn_height_t *h = phase_get_irn_data(&heights->ph, irn);
69 fprintf(f, "height: %u\n", h->height);
73 * Check, if we can reach a target node from a given node inside one basic block.
74 * @param h The heights object.
75 * @param curr The current node from which we tried to reach the other one.
76 * @param tgt The node we try to reach.
77 * @return 1, one of tgt can be reached from curr, 0 else.
79 static int search(heights_t *h, const ir_node *curr, const ir_node *tgt)
85 /* if the current node is the one we were looking for, we're done. */
89 /* If we are in another block or at a phi we won't find our target. */
90 if(get_nodes_block(curr) != get_nodes_block(tgt))
95 /* Check, if we have already been here. Coming more often won't help :-) */
96 h_curr = phase_get_irn_data(&h->ph, curr);
97 if(h_curr->visited >= h->visited)
100 /* If we are too deep into the DAG we won't find the target either. */
101 h_tgt = phase_get_irn_data(&h->ph, tgt);
102 if(h_curr->height > h_tgt->height)
105 /* Mark this place as visited. */
106 h_curr->visited = h->visited;
108 /* Start a search from this node. */
109 for(i = 0, n = get_irn_ins_or_deps(curr); i < n; ++i) {
110 ir_node *op = get_irn_in_or_dep(curr, i);
111 if(search(h, op, tgt))
119 * Check, if one node can be reached from another one, according to data dependence.
121 int heights_reachable_in_block(heights_t *h, const ir_node *n, const ir_node *m)
124 irn_height_t *hn = phase_get_irn_data(&h->ph, n);
125 irn_height_t *hm = phase_get_irn_data(&h->ph, m);
127 assert(get_nodes_block(n) == get_nodes_block(m));
128 assert(hn != NULL && hm != NULL);
130 if(hn->height <= hm->height) {
132 res = search(h, n, m);
139 * Compute the height of a node in a block.
140 * @param h The heights object.
141 * @param irn The node.
142 * @param bl The block.
144 static unsigned compute_height(heights_t *h, ir_node *irn, const ir_node *bl)
146 irn_height_t *ih = phase_get_or_set_irn_data(&h->ph, irn);
148 const ir_edge_t *edge;
150 /* bail out if we already visited that node. */
151 if(ih->visited >= h->visited)
154 ih->visited = h->visited;
157 foreach_out_edge(irn, edge) {
158 ir_node *dep = get_edge_src_irn(edge);
160 if(!is_Block(dep) && !is_Phi(dep) && get_nodes_block(dep) == bl) {
161 unsigned dep_height = compute_height(h, dep, bl);
162 ih->height = MAX(ih->height, dep_height);
168 foreach_out_edge_kind(irn, edge, EDGE_KIND_DEP) {
169 ir_node *dep = get_edge_src_irn(edge);
171 assert(!is_Phi(dep));
172 if(!is_Block(dep) && get_nodes_block(dep) == bl) {
173 unsigned dep_height = compute_height(h, dep, bl);
174 ih->height = MAX(ih->height, dep_height);
183 static unsigned compute_heights_in_block(ir_node *bl, heights_t *h)
186 const ir_edge_t *edge;
190 foreach_out_edge(bl, edge) {
191 ir_node *dep = get_edge_src_irn(edge);
192 int curh = compute_height(h, dep, bl);
194 max_height = MAX(curh, max_height);
197 foreach_out_edge_kind(bl, edge, EDGE_KIND_DEP) {
198 ir_node *dep = get_edge_src_irn(edge);
199 int curh = compute_height(h, dep, bl);
201 max_height = MAX(curh, max_height);
207 static void compute_heights_in_block_walker(ir_node *block, void *data)
210 compute_heights_in_block(block, h);
213 unsigned get_irn_height(heights_t *heights, const ir_node *irn)
215 irn_height_t *h = phase_get_irn_data(&heights->ph, irn);
216 assert(h && "No height information for node");
220 unsigned heights_recompute_block(heights_t *h, ir_node *block)
222 const ir_edge_t *edge;
224 edges_assure(phase_get_irg(&h->ph));
226 /* reset phase data for all nodes in the block */
227 foreach_out_edge(block, edge) {
228 ir_node *irn = get_edge_src_irn(edge);
229 irn_height_t *ih = phase_get_irn_data(&h->ph, irn);
231 irn_height_init(&h->ph, irn, ih);
235 return compute_heights_in_block(block, h);
238 void heights_recompute(heights_t *h)
240 edges_assure(phase_get_irg(&h->ph));
241 phase_reinit_irn_data(&h->ph);
243 irg_block_walk_graph(phase_get_irg(&h->ph), compute_heights_in_block_walker, NULL, h);
246 heights_t *heights_new(ir_graph *irg)
248 heights_t *res = xmalloc(sizeof(res[0]));
249 phase_init(&res->ph, "heights", irg, PHASE_DEFAULT_GROWTH, irn_height_init, NULL);
250 res->dump_handle = dump_add_node_info_callback(height_dump_cb, res);
251 heights_recompute(res);
256 void heights_free(heights_t *h)
259 dump_remv_node_info_callback(h->dump_handle);