#include "besched_t.h"
#include "belive_t.h"
+static sched_timestep_t get_time_step(const ir_node *irn)
+{
+ if(is_Phi(irn))
+ return 0;
+
+ return sched_get_time_step(irn);
+}
+
int value_dominates(const ir_node *a, const ir_node *b)
{
int res = 0;
* Dominance is determined by the time steps of the schedule.
*/
} else {
- sched_timestep_t as = sched_get_time_step(a);
- sched_timestep_t bs = sched_get_time_step(b);
+ sched_timestep_t as = get_time_step(a);
+ sched_timestep_t bs = get_time_step(b);
res = as <= bs;
}
* performed.
*/
foreach_out_edge(a, edge) {
- const ir_node *user = edge->src;
+ const ir_node *user = get_edge_src_irn(edge);
if(get_nodes_block(user) == bb && !is_Phi(user) && b != user && value_dominates(b, user))
return 1;
}