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
23 * @author Sebastian Hack, Matthias Braun
25 * Methods to compute when a value will be used again.
27 * Copyright (C) 2005 Universitaet Karlsruhe
28 * Released under the GPL
45 #include "irgraph_t.h"
46 #include "iredges_t.h"
53 #include "besched_t.h"
57 #include "benodesets.h"
59 #define SCAN_INTERBLOCK_USES
61 typedef struct _be_use_t {
73 unsigned visited_counter;
74 DEBUG_ONLY(firm_dbg_module_t *dbg;)
77 static int cmp_use(const void *a, const void *b, size_t n)
79 const be_use_t *p = a;
80 const be_use_t *q = b;
81 return !(p->block == q->block && p->node == q->node);
84 static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
85 unsigned from_step, const ir_node *def,
88 static const be_use_t *get_or_set_use_block(be_uses_t *env,
92 unsigned hash = HASH_COMBINE(nodeset_hash(block), nodeset_hash(def));
98 result = set_find(env->uses, &temp, sizeof(temp), hash);
101 // insert templ first as we might end in a loop in the get_next_use
103 temp.next_use = USES_INFINITY;
104 temp.outermost_loop = -1;
106 result = set_insert(env->uses, &temp, sizeof(temp), hash);
109 if(result->outermost_loop < 0 && result->visited < env->visited_counter) {
110 be_next_use_t next_use;
112 result->visited = env->visited_counter;
113 next_use = get_next_use(env, sched_first(block), 0, def, 0);
114 if(next_use.outermost_loop >= 0) {
115 result->next_use = next_use.time;
116 result->outermost_loop = next_use.outermost_loop;
117 DBG((env->dbg, LEVEL_5, "Setting nextuse of %+F in block %+F to %u (outermostloop %d)\n", def, block, result->next_use, result->outermost_loop));
124 static int be_is_phi_argument(const be_lv_t *lv, const ir_node *block, const ir_node *def)
127 ir_node *succ_block = NULL;
128 const ir_edge_t *edge;
132 if(get_irn_n_edges_kind(block, EDGE_KIND_BLOCK) > 1)
136 foreach_block_succ(block, edge) {
137 succ_block = get_edge_src_irn(edge);
141 arity = get_Block_n_cfgpreds(succ_block);
145 for(i = 0; i < arity; ++i) {
146 if(get_Block_cfgpred_block(succ_block, i) == block)
151 sched_foreach(succ_block, node) {
157 arg = get_irn_n(node, i);
165 static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
166 unsigned from_step, const ir_node *def,
169 unsigned step = from_step;
170 ir_node *block = get_nodes_block(from);
172 const ir_edge_t *edge;
176 from = sched_next(from);
179 sched_foreach_from(from, node) {
187 arity = get_irn_arity(node);
188 for (i = 0; i < arity; ++i) {
189 const ir_node *operand = get_irn_n(node, i);
191 if (operand == def) {
192 be_next_use_t result;
194 DBG((env->dbg, LEVEL_3, "found use of %+F at %+F\n", operand, node));
197 * Spills/Reloads are a special case, they're not really a
198 * usage of a value, continue searching
200 if (be_is_Spill(node) || be_is_Reload(node)) {
201 return be_get_next_use(env, node, step, node, 1);
205 result.outermost_loop = get_loop_depth(get_irn_loop(block));
213 if(be_is_phi_argument(env->lv, block, def)) {
214 // TODO we really should continue searching the uses of the phi,
215 // as a phi isn't a real use that implies a reload (because we could
216 // easily spill the whole phi)
218 be_next_use_t result;
220 result.outermost_loop = get_loop_depth(get_irn_loop(block));
224 #ifdef SCAN_INTERBLOCK_USES
226 unsigned next_use = USES_INFINITY;
228 be_next_use_t result;
229 ir_loop *loop = get_irn_loop(block);
230 int loopdepth = get_loop_depth(loop);
231 int found_visited = 0;
233 ir_graph *irg = get_irn_irg(block);
234 ir_node *startblock = get_irg_start_block(irg);
236 outermost_loop = loopdepth;
237 foreach_block_succ(block, edge) {
239 const ir_node *succ_block = get_edge_src_irn(edge);
243 if(succ_block == startblock)
246 DBG((env->dbg, LEVEL_5, "Checking succ of block %+F: %+F (for use of %+F)\n", block, succ_block, def));
247 if(!be_is_live_in(env->lv, succ_block, def)) {
248 //next_use = USES_INFINITY;
249 DBG((env->dbg, LEVEL_5, " not live in\n"));
253 use = get_or_set_use_block(env, succ_block, def);
254 DBG((env->dbg, LEVEL_5, "Found %u (loopdepth %d) (we're in block %+F)\n", use->next_use,
255 use->outermost_loop, block));
256 if(USES_IS_INFINITE(use->next_use)) {
257 if(use->outermost_loop < 0) {
264 use_dist = use->next_use;
266 succ_loop = get_irn_loop(succ_block);
267 if(get_loop_depth(succ_loop) < loopdepth) {
268 unsigned factor = (loopdepth - get_loop_depth(succ_loop)) * 5000;
269 DBG((env->dbg, LEVEL_5, "Increase usestep because of loop out edge %d -> %d (%u)\n", factor));
270 // TODO we should use the number of nodes in the loop or so...
274 if(use_dist < next_use) {
276 outermost_loop = use->outermost_loop;
280 if(loopdepth < outermost_loop)
281 outermost_loop = loopdepth;
283 result.time = next_use + step;
284 result.outermost_loop = outermost_loop;
286 if(!found_use && found_visited) {
287 // the current result is correct for the current search, but isn't
288 // generally correct, so mark it
289 result.outermost_loop = -1;
291 DBG((env->dbg, LEVEL_5, "Result: %d (outerloop: %d)\n", result.time, result.outermost_loop));
295 return USES_INFINITY;
299 be_next_use_t be_get_next_use(be_uses_t *env, ir_node *from,
300 unsigned from_step, const ir_node *def,
303 env->visited_counter++;
304 return get_next_use(env, from, from_step, def, skip_from_uses);
307 be_uses_t *be_begin_uses(ir_graph *irg, const be_lv_t *lv)
309 be_uses_t *env = xmalloc(sizeof(env[0]));
313 env->uses = new_set(cmp_use, 512);
316 env->visited_counter = 0;
317 FIRM_DBG_REGISTER(env->dbg, "firm.be.uses");
322 void be_end_uses(be_uses_t *env)