--- /dev/null
+/* PR tree-optimization/105458 */
+/* { dg-do compile } */
+/* { dg-options "-O1 -fexpensive-optimizations -fno-tree-dominator-opts " } */
+
+void
+yj (int j4)
+{
+ int t3;
+
+ for (t3 = 0; t3 < 6; ++t3)
+ {
+ short int v4 = t3;
+
+ if (v4 == j4 || v4 > t3)
+ for (;;)
+ {
+ }
+ }
+}
+
fprintf (dump_file, " (root: bb%d)\n", bb->index);
}
+ relation_kind curr = query_relation (bb, ssa1, ssa2);
+ if (curr != VREL_NONE)
+ k = relation_intersect (curr, k);
+
if (k == EQ_EXPR)
{
register_equiv (bb, ssa1, ssa2);
return;
}
- relation_kind curr = query_relation (bb, ssa1, ssa2);
- if (curr != VREL_NONE)
- k = relation_intersect (curr, k);
-
bitmap_set_bit (m_relations.m_names, SSA_NAME_VERSION (ssa1));
bitmap_set_bit (m_relations.m_names, SSA_NAME_VERSION (ssa2));
relation_chain *ptr = (relation_chain *) obstack_alloc (&m_chain_obstack,