/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
#include "besched_t.h"
#include "beintlive_t.h"
#include "beirg_t.h"
+#include "be_t.h"
#include "debug.h"
#include "error.h"
env->min_dom = INT_MAX;
env->max_dom = 0;
- set_using_visited(irg);
+ set_using_irn_visited(irg);
set_using_block_visited(irg);
set_using_irn_link(irg);
* and blocks that already have the relevant value at the end calculated */
inc_irg_visited(irg);
/* We use the block visited flag to indicate blocks in the dominance
- * froniter of some values (and this potentially needing phis) */
+ * frontier of some values (and this potentially needing phis) */
inc_irg_block_visited(irg);
}
del_waitq(env->worklist);
DEL_ARR_F(env->new_phis);
- clear_using_visited(env->irg);
+ clear_using_irn_visited(env->irg);
clear_using_block_visited(env->irg);
clear_using_irn_link(env->irg);
const ir_edge_t *edge, *next;
size_t i;
+ BE_TIMER_PUSH(t_ssa_constr);
+
if(!env->iterated_domfront_calculated) {
mark_iterated_dominance_frontiers(env);
env->iterated_domfront_calculated = 1;
stat_ev_cnt_inc(uses);
}
}
+ BE_TIMER_POP(t_ssa_constr);
+
stat_ev_tim_pop("bessaconstr_fix_time");
stat_ev_cnt_done(uses, "bessaconstr_uses");
}
{
int i, n;
+ BE_TIMER_PUSH(t_ssa_constr);
+
n = ARR_LEN(env->new_phis);
for(i = 0; i < n; ++i) {
ir_node *phi = env->new_phis[i];
be_liveness_introduce(lv, phi);
}
+
+ BE_TIMER_POP(t_ssa_constr);
}
void be_init_ssaconstr(void)