* @date 27.06.2005
* @version $Id$
*/
-#ifdef HAVE_CONFIG_H
#include "config.h"
-#endif
#include <limits.h>
#include <stdlib.h>
#include "be_t.h"
#include "beutil.h"
#include "belive_t.h"
-#include "benode_t.h"
-#include "besched_t.h"
+#include "benode.h"
+#include "besched.h"
#include "beirgmod.h"
-#include "bearch_t.h"
+#include "bearch.h"
#include "beuses.h"
#define SCAN_INTERBLOCK_USES
temp.node = def;
result = set_find(env->uses, &temp, sizeof(temp), hash);
- if(result == NULL) {
+ if (result == NULL) {
// insert templ first as we might end in a loop in the get_next_use
// call otherwise
temp.next_use = USES_INFINITY;
result = set_insert(env->uses, &temp, sizeof(temp), hash);
}
- if(result->outermost_loop < 0 && result->visited < env->visited_counter) {
+ if (result->outermost_loop < 0 && result->visited < env->visited_counter) {
be_next_use_t next_use;
result->visited = env->visited_counter;
next_use = get_next_use(env, sched_first(block), 0, def, 0);
- if(next_use.outermost_loop >= 0) {
+ if (next_use.outermost_loop >= 0) {
result->next_use = next_use.time;
result->outermost_loop = next_use.outermost_loop;
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));
{
ir_node *node;
ir_node *succ_block = NULL;
- const ir_edge_t *edge;
int arity, i;
#if 1
#endif
return 0;
- foreach_block_succ(block, edge) {
- succ_block = get_edge_src_irn(edge);
- break;
- }
+ succ_block = get_first_block_succ(block);
arity = get_Block_n_cfgpreds(succ_block);
- if(arity <= 1)
+ if (arity <= 1)
return 0;
- for(i = 0; i < arity; ++i) {
- if(get_Block_cfgpred_block(succ_block, i) == block)
+ for (i = 0; i < arity; ++i) {
+ if (get_Block_cfgpred_block(succ_block, i) == block)
break;
}
assert(i < arity);
sched_foreach(succ_block, node) {
ir_node *arg;
- if(!is_Phi(node))
+ if (!is_Phi(node))
break;
arg = get_irn_n(node, i);
- if(arg == def)
+ if (arg == def)
return 1;
}
return 0;
}
-static INLINE
-unsigned get_step(const ir_node *node)
+static inline unsigned get_step(const ir_node *node)
{
return PTR_TO_INT(get_irn_link(node));
}
#if 1
assert(skip_from_uses == 0 || skip_from_uses == 1);
- if(skip_from_uses) {
+ if (skip_from_uses) {
from = sched_next(from);
}
ir_node *node = get_edge_src_irn(edge);
unsigned node_step;
- if(is_Anchor(node))
+ if (is_Anchor(node))
continue;
- if(get_nodes_block(node) != block)
+ if (get_nodes_block(node) != block)
continue;
- if(is_Phi(node))
+ if (is_Phi(node))
continue;
node_step = get_step(node);
- if(node_step < timestep)
+ if (node_step < timestep)
continue;
- if(node_step < next_use_step) {
+ if (node_step < next_use_step) {
next_use = node;
next_use_step = node_step;
}
}
- if(next_use != NULL) {
+ if (next_use != NULL) {
be_next_use_t result;
result.time = next_use_step - timestep + skip_from_uses;
result.outermost_loop = get_loop_depth(get_irn_loop(block));
step = get_step(node) + 1 + timestep + skip_from_uses;
#else
- if(skip_from_uses) {
+ if (skip_from_uses) {
from = sched_next(from);
++step;
}
sched_foreach_from(from, node) {
int i, arity;
- if(is_Phi(node)) {
+ if (is_Phi(node)) {
step++;
continue;
}
}
#endif
- if(be_is_phi_argument(block, def)) {
+ if (be_is_phi_argument(block, def)) {
// TODO we really should continue searching the uses of the phi,
// as a phi isn't a real use that implies a reload (because we could
// easily spill the whole phi)
ir_loop *succ_loop;
unsigned use_dist;
- if(succ_block == startblock)
+ if (succ_block == startblock)
continue;
DBG((env->dbg, LEVEL_5, "Checking succ of block %+F: %+F (for use of %+F)\n", block, succ_block, def));
- if(!be_is_live_in(env->lv, succ_block, def)) {
+ if (!be_is_live_in(env->lv, succ_block, def)) {
//next_use = USES_INFINITY;
DBG((env->dbg, LEVEL_5, " not live in\n"));
continue;
use = get_or_set_use_block(env, succ_block, def);
DBG((env->dbg, LEVEL_5, "Found %u (loopdepth %d) (we're in block %+F)\n", use->next_use,
use->outermost_loop, block));
- if(USES_IS_INFINITE(use->next_use)) {
- if(use->outermost_loop < 0) {
+ if (USES_IS_INFINITE(use->next_use)) {
+ if (use->outermost_loop < 0) {
found_visited = 1;
}
continue;
use_dist = use->next_use;
succ_loop = get_irn_loop(succ_block);
- if(get_loop_depth(succ_loop) < loopdepth) {
+ if (get_loop_depth(succ_loop) < loopdepth) {
unsigned factor = (loopdepth - get_loop_depth(succ_loop)) * 5000;
DBG((env->dbg, LEVEL_5, "Increase usestep because of loop out edge %d -> %d (%u)\n", factor));
// TODO we should use the number of nodes in the loop or so...
use_dist += factor;
}
- if(use_dist < next_use) {
+ if (use_dist < next_use) {
next_use = use_dist;
outermost_loop = use->outermost_loop;
result.before = use->node;
}
}
- if(loopdepth < outermost_loop)
+ if (loopdepth < outermost_loop)
outermost_loop = loopdepth;
result.time = next_use + step;
result.outermost_loop = outermost_loop;
- if(!found_use && found_visited) {
+ if (!found_use && found_visited) {
// the current result is correct for the current search, but isn't
// generally correct, so mark it
result.outermost_loop = -1;
return get_next_use(env, from, from_step, def, skip_from_uses);
}
-static
-void set_sched_step_walker(ir_node *block, void *data)
+static void set_sched_step_walker(ir_node *block, void *data)
{
ir_node *node;
unsigned step = 0;
sched_foreach(block, node) {
set_irn_link(node, INT_TO_PTR(step));
- if(is_Phi(node))
+ if (is_Phi(node))
continue;
++step;
}
projects / libfirm / blobdiff