procyberian/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

prefetch-5.c: xfail.

Browse source 
* gcc.dg/tree-ssa/prefetch-5.c: xfail.
	* tree-ssa-loop-niter.c (idx_infer_loop_bounds): We can not produce
	realistic upper bounds here.

From-SVN: r236508
This commit is contained in:
Jan Hubicka 2016-05-20 14:41:45 +02:00 • committed by Jan Hubicka
parent 11f8114b51
commit 77c9d5b4e6
4 changed files with 17 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
gcc/ChangeLog
View file

@ -1,3 +1,8 @@
2016-05-20 Jan Hubicka <hubicka@ucw.cz>
* tree-ssa-loop-niter.c (idx_infer_loop_bounds): We can not produce
realistic upper bounds here.
2016-05-20 Jakub Jelinek <jakub@redhat.com>
PR c++/71210

4
gcc/testsuite/ChangeLog
View file

@ -1,3 +1,7 @@
2016-05-20 Jan Hubicka <hubicka@ucw.cz>
* gcc.dg/tree-ssa/prefetch-5.c: xfail.
2016-05-20 Jakub Jelinek <jakub@redhat.com>
PR c++/71210

6
gcc/testsuite/gcc.dg/tree-ssa/prefetch-5.c
View file

@ -54,5 +54,7 @@ int loop5 (int n, struct tail5 *x)
return s;
}
/* { dg-final { scan-tree-dump-times "Issued prefetch" 2 "aprefetch" } } */
/* { dg-final { scan-tree-dump-times "Not prefetching" 1 "aprefetch" } } */
/* Until we are able to track likely upper bounds, we can't really work out that
small trailing arrays should not be prefetched. */
/* { dg-final { scan-tree-dump-times "Issued prefetch" 2 "aprefetch" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "Not prefetching" 1 "aprefetch" { xfail *-*-* } } } */

9
gcc/tree-ssa-loop-niter.c
View file

@ -3115,7 +3115,6 @@ idx_infer_loop_bounds (tree base, tree *idx, void *dta)
tree low, high, type, next;
bool sign, upper = true, at_end = false;
struct loop *loop = data->loop;
bool reliable = true;
if (TREE_CODE (base) != ARRAY_REF)
return true;
@ -3187,14 +3186,14 @@ idx_infer_loop_bounds (tree base, tree *idx, void *dta)
&& tree_int_cst_compare (next, high) <= 0)
return true;
/* If access is not executed on every iteration, we must ensure that overlow may
not make the access valid later. */
/* If access is not executed on every iteration, we must ensure that overlow
may not make the access valid later. */
if (!dominated_by_p (CDI_DOMINATORS, loop->latch, gimple_bb (data->stmt))
&& scev_probably_wraps_p (initial_condition_in_loop_num (ev, loop->num),
step, data->stmt, loop, true))
reliable = false;
upper = false;
record_nonwrapping_iv (loop, init, step, data->stmt, low, high, reliable, upper);
record_nonwrapping_iv (loop, init, step, data->stmt, low, high, false, upper);
return true;
}