+2013-04-19 Marek Polacek <polacek@redhat.com>
+
+ Backport from mainline
+ 2013-01-08 Steven Bosscher <steven@gcc.gnu.org>
+ Jakub Jelinek <jakub@redhat.com>
+
+ PR tree-optimization/48189
+ * predict.c (predict_loops): If max is 0, don't call compare_tree_int.
+ If nitercst is 0, don't predict the exit edge.
+
2013-04-16 Jack Howarth <howarth@bromo.med.uc.edu>
Backport from mainline
if (TREE_CODE (niter) == INTEGER_CST)
{
if (host_integerp (niter, 1)
- && compare_tree_int (niter, max-1) == -1)
+ && max
+ && compare_tree_int (niter, max - 1) == -1)
nitercst = tree_low_cst (niter, 1) + 1;
else
nitercst = max;
else
continue;
+ /* If the prediction for number of iterations is zero, do not
+ predict the exit edges. */
+ if (nitercst == 0)
+ continue;
+
probability = ((REG_BR_PROB_BASE + nitercst / 2) / nitercst);
predict_edge (ex, predictor, probability);
}
+2013-04-19 Marek Polacek <polacek@redhat.com>
+
+ Backport from mainline
+ 2013-01-08 Steven Bosscher <steven@gcc.gnu.org>
+ Jakub Jelinek <jakub@redhat.com>
+
+ PR tree-optimization/48189
+ * gcc.dg/pr48189.c: New test.
+
2013-04-15 Rainer Orth <ro@CeBiTec.Uni-Bielefeld.DE>
* gcc.dg/torture/pr53922.c: Skip on alpha*-*-osf*.
--- /dev/null
+/* PR tree-optimization/48189 */
+/* { dg-do compile } */
+/* { dg-options "-O --param max-predicted-iterations=0" } */
+
+struct S { int s[8]; };
+
+void
+foo (int *x, struct S *y)
+{
+ int i;
+ for (i = 0; y[i].s[i]; i++)
+ *x++ = y[i].s[i];
+}