#define LV_USE_BINARY_SEARCH
#undef LV_INTESIVE_CHECKS
+static INLINE int is_liveness_node(const ir_node *irn)
+{
+ return is_Phi(irn) || is_data_node(irn);
+}
+
int (be_lv_next_irn)(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i)
{
return _be_lv_next_irn(lv, bl, flags, i);
ir_node *def_block;
/* Don't compute liveness information for non-data nodes. */
- if(!is_data_node(irn))
+ if(!is_liveness_node(irn))
return;
bitset_clear_all(visited);
* If the usage is no data node, skip this use, since it does not
* affect the liveness of the node.
*/
- if(!is_data_node(use))
+ if(!is_liveness_node(use))
continue;
/* Get the block where the usage is in. */
#include "besched_t.h"
#include "belive_t.h"
+static sched_timestep_t get_time_step(const ir_node *irn)
+{
+ return is_Phi(irn) ? 0 : 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;
}