#include "benode_t.h"
#include "besched_t.h"
#include "beirgmod.h"
-#include "bearch.h"
+#include "bearch_t.h"
#include "beuses_t.h"
#include "benodesets.h"
static int be_is_phi_argument(const be_lv_t *lv, const ir_node *block, const ir_node *def)
{
ir_node *node;
- ir_node *succ_block;
+ ir_node *succ_block = NULL;
const ir_edge_t *edge;
int arity, i;
const ir_node *operand = get_irn_n(node, i);
if (operand == def) {
+ be_next_use_t result;
+
DBG((env->dbg, LEVEL_3, "found use of %+F at %+F\n", operand, node));
/**
* Spills/Reloads are a special case, they're not really a
* usage of a value, continue searching
*/
- if(be_is_Spill(node) || be_is_Reload(node)) {
+ if (be_is_Spill(node) || be_is_Reload(node)) {
return be_get_next_use(env, node, step, node, 1);
}
- be_next_use_t result;
result.time = step;
result.outermost_loop = get_loop_depth(get_irn_loop(block));
return result;
const be_use_t *use;
const ir_node *succ_block = get_edge_src_irn(edge);
ir_loop *succ_loop;
- int use_dist;
+ unsigned use_dist;
if(succ_block == startblock)
continue;
succ_loop = get_irn_loop(succ_block);
if(get_loop_depth(succ_loop) < loopdepth) {
- int factor = (loopdepth - get_loop_depth(succ_loop)) * 5000;
+ 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;