}
-// Implement range_on_edge. Return TRUE if the edge generates a range,
-// otherwise false.. but still return a range.
+// Implement range_on_edge. Always return the best available range.
bool
ranger_cache::range_on_edge (irange &r, edge e, tree expr)
exit_range (r, expr, e->src);
int_range_max edge_range;
if (m_gori.outgoing_edge_range_p (edge_range, e, expr, *this))
- {
- r.intersect (edge_range);
- return true;
- }
+ r.intersect (edge_range);
+ return true;
}
- else
- get_tree_range (r, expr, NULL);
- return false;
+
+ return get_tree_range (r, expr, NULL);
}
for (x = 1; x < num_ssa_names; x++)
{
tree name = gimple_range_ssa_p (ssa_name (x));
- if (name && m_cache.range_on_edge (range, e, name))
+ if (name && gori ().has_edge_range_p (name, e)
+ && m_cache.range_on_edge (range, e, name))
{
gimple *s = SSA_NAME_DEF_STMT (name);
// Only print the range if this is the def block, or