+2005-10-15 Diego Novillo <dnovillo@redhat.com>
+
+ PR 23141
+ PR 23142
+ * tree-vrp.c (vrp_meet): Fix the intersection of equivalence
+ sets VR0->EQUIV and VR1->EQUIV when meeting a range and an
+ anti-range.
+ (vrp_visit_phi_node): Only prevent infinite iterations when
+ the previous result and the new result are both VR_RANGEs.
+
2005-10-15 Ranjit Mathew <rmathew@gcc.gnu.org>
* tree-into-ssa.c (mark_def_sites): Correct minor typo in
&& !symbolic_range_p (vr1)
&& !value_ranges_intersect_p (vr0, vr1))
{
+ /* Copy most of VR1 into VR0. Don't copy VR1's equivalence
+ set. We need to compute the intersection of the two
+ equivalence sets. */
if (vr1->type == VR_ANTI_RANGE)
- copy_value_range (vr0, vr1);
+ set_value_range (vr0, vr1->type, vr1->min, vr1->max, vr0->equiv);
/* The resulting set of equivalences is the intersection of
the two sets. */
/* To prevent infinite iterations in the algorithm, derive ranges
when the new value is slightly bigger or smaller than the
previous one. */
- if (lhs_vr->type == VR_RANGE)
+ if (lhs_vr->type == VR_RANGE && vr_result.type == VR_RANGE)
{
if (!POINTER_TYPE_P (TREE_TYPE (lhs)))
{