2018-01-24 Richard Biener <rguenther@suse.de>
PR tree-optimization/82819
* graphite-isl-ast-to-gimple.c (binary_op_to_tree): Avoid
code generating pluses that are no-ops in the target precision.
* gcc.dg/graphite/pr82819.c: New testcase.
From-SVN: r257012
+2018-01-24 Richard Biener <rguenther@suse.de>
+
+ PR tree-optimization/82819
+ * graphite-isl-ast-to-gimple.c (binary_op_to_tree): Avoid
+ code generating pluses that are no-ops in the target precision.
+
2018-01-24 Richard Biener <rguenther@suse.de>
PR middle-end/84000
/* From our constraint generation we may get modulo operations that
we cannot represent explicitely but that are no-ops for TYPE.
Elide those. */
- if (expr_type == isl_ast_op_pdiv_r
+ if ((expr_type == isl_ast_op_pdiv_r
+ || expr_type == isl_ast_op_add)
&& isl_ast_expr_get_type (arg_expr) == isl_ast_expr_int
&& (wi::exact_log2 (widest_int_from_isl_expr_int (arg_expr))
>= TYPE_PRECISION (type)))
+2018-01-24 Richard Biener <rguenther@suse.de>
+
+ PR tree-optimization/82819
+ * gcc.dg/graphite/pr82819.c: New testcase.
+
2018-01-23 Paolo Carlini <paolo.carlini@oracle.com>
PR c++/83921
--- /dev/null
+/* { dg-do compile } */
+/* { dg-options "-O2 -floop-nest-optimize" } */
+
+short int *ts;
+
+void
+c2 (unsigned long long int s4, int ns)
+{
+ short int *b2 = (short int *)&ns;
+
+ while (ns != 0)
+ {
+ int xn;
+
+ for (xn = 0; xn < 3; ++xn)
+ for (*b2 = 0; *b2 < 2; ++*b2)
+ s4 += xn;
+ if (s4 != 0)
+ b2 = ts;
+ ++ns;
+ }
+}