Searched refs:sched_get_time_step (Results 1 – 5 of 5) sorted by relevance
115 if (sched_get_time_step(out3) <= sched_get_time_step(after)) { in can_move()119 } else if (sched_get_time_step(out2) <= sched_get_time_step(after)) { in can_move()129 if (sched_get_time_step(out) <= sched_get_time_step(after)) { in can_move()
33 sched_timestep_t as = sched_is_scheduled(a) ? sched_get_time_step(a) : 0; in _value_dominates_intrablock()34 sched_timestep_t bs = sched_is_scheduled(b) ? sched_get_time_step(b) : 0; in _value_dominates_intrablock()47 sched_timestep_t as = sched_is_scheduled(a) ? sched_get_time_step(a) : 0; in _value_strictly_dominates_intrablock()48 sched_timestep_t bs = sched_is_scheduled(b) ? sched_get_time_step(b) : 0; in _value_strictly_dominates_intrablock()
61 static inline sched_timestep_t sched_get_time_step(const ir_node *irn) in sched_get_time_step() function196 return sched_get_time_step(n1) < sched_get_time_step(n2); in sched_comes_after()
261 assert(sched_get_time_step(node) < sched_get_time_step(before)); in be_can_move_down()
174 int timestep = sched_get_time_step(node); in verify_schedule_walker()214 sched_timestep_t nodetime = sched_get_time_step(node); in verify_schedule_walker()221 if (sched_get_time_step(arg) >= nodetime) { in verify_schedule_walker()