PR tree-optimization/77929
* tree-ssa-reassoc.c (optimize_range_tests_var_bound): Handle
(*ops)[ranges[i].idx]->op != ranges[i].exp case.
* gcc.c-torture/compile/pr77929.c: New test.
From-SVN: r241019
+2016-10-12 Jakub Jelinek <jakub@redhat.com>
+
+ PR tree-optimization/77929
+ * tree-ssa-reassoc.c (optimize_range_tests_var_bound): Handle
+ (*ops)[ranges[i].idx]->op != ranges[i].exp case.
+
2016-10-12 Aaron Sawdey <acsawdey@linux.vnet.ibm.com>
PR target/77934
2016-10-12 Aaron Sawdey <acsawdey@linux.vnet.ibm.com>
PR target/77934
2016-10-12 Jakub Jelinek <jakub@redhat.com>
2016-10-12 Jakub Jelinek <jakub@redhat.com>
+ PR tree-optimization/77929
+ * gcc.c-torture/compile/pr77929.c: New test.
+
* c-c++-common/Wimplicit-fallthrough-25.c: New test.
* c-c++-common/Wimplicit-fallthrough-26.c: New test.
* c-c++-common/Wimplicit-fallthrough-27.c: New test.
* c-c++-common/Wimplicit-fallthrough-25.c: New test.
* c-c++-common/Wimplicit-fallthrough-26.c: New test.
* c-c++-common/Wimplicit-fallthrough-27.c: New test.
--- /dev/null
+/* PR tree-optimization/77929 */
+
+void bar (void);
+
+void
+foo (int x, unsigned short int y)
+{
+ int a = 0;
+ int b = (y != 0) ? (x < y) : (a < 0);
+
+ if (x >= 0 & b)
+ bar ();
+}
- g = gimple_build_assign (make_ssa_name (TREE_TYPE (ranges[i].exp)),
- ccode, rhs1, rhs2);
+ operand_entry *oe = (*ops)[ranges[i].idx];
+ tree ctype = oe->op ? TREE_TYPE (oe->op) : boolean_type_node;
+ if (!INTEGRAL_TYPE_P (ctype)
+ || (TREE_CODE (ctype) != BOOLEAN_TYPE
+ && TYPE_PRECISION (ctype) != 1))
+ ctype = boolean_type_node;
+ g = gimple_build_assign (make_ssa_name (ctype), ccode, rhs1, rhs2);
gimple_set_uid (g, uid);
gsi_insert_before (&gsi, g, GSI_SAME_STMT);
gimple_set_uid (g, uid);
gsi_insert_before (&gsi, g, GSI_SAME_STMT);
+ if (oe->op && ctype != TREE_TYPE (oe->op))
+ {
+ g = gimple_build_assign (make_ssa_name (TREE_TYPE (oe->op)),
+ NOP_EXPR, gimple_assign_lhs (g));
+ gimple_set_uid (g, uid);
+ gsi_insert_before (&gsi, g, GSI_SAME_STMT);
+ }
ranges[i].exp = gimple_assign_lhs (g);
ranges[i].exp = gimple_assign_lhs (g);
- (*ops)[ranges[i].idx]->op = ranges[i].exp;
+ oe->op = ranges[i].exp;
+ ranges[i].low = build_zero_cst (TREE_TYPE (ranges[i].exp));
+ ranges[i].high = ranges[i].low;
}
ranges[i].strict_overflow_p = false;
operand_entry *oe = (*ops)[ranges[*idx].idx];
}
ranges[i].strict_overflow_p = false;
operand_entry *oe = (*ops)[ranges[*idx].idx];