aboutsummaryrefslogtreecommitdiff
path: root/libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt.c
diff options
context:
space:
mode:
authorTom de Vries <tom@codesourcery.com>2015-06-30 08:35:57 +0000
committerTom de Vries <vries@gcc.gnu.org>2015-06-30 08:35:57 +0000
commit4f75d60893e092cffcbe422825ce4dc092d3fb9e (patch)
treeca50ebb2d0d7f8b30b28938281260d4d17f52bd2 /libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt.c
parent4fe651724763ce1a438b5497621510a4185e069e (diff)
downloadgcc-4f75d60893e092cffcbe422825ce4dc092d3fb9e.zip
gcc-4f75d60893e092cffcbe422825ce4dc092d3fb9e.tar.gz
gcc-4f75d60893e092cffcbe422825ce4dc092d3fb9e.tar.bz2
Use max_loop_iterations in transform_to_exit_first_loop_alt
2015-06-30 Tom de Vries <tom@codesourcery.com> PR tree-optimization/66652 * tree-parloops.c (try_transform_to_exit_first_loop_alt): Use max_loop_iterations to determine if nit + 1 overflows. * testsuite/libgomp.c/parloops-exit-first-loop-alt-3.c (f): Rewrite using restrict pointers. (main): Add arguments to calls to f. * testsuite/libgomp.c/parloops-exit-first-loop-alt.c: Same. * gcc.dg/parloops-exit-first-loop-alt-pr66652.c: New test. * gcc.dg/parloops-exit-first-loop-alt-3.c (f): Rewrite using restrict pointers. * gcc.dg/parloops-exit-first-loop-alt.c: Same. From-SVN: r225162
Diffstat (limited to 'libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt.c')
-rw-r--r--libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt.c5
1 files changed, 3 insertions, 2 deletions
diff --git a/libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt.c b/libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt.c
index 1c32ea3..07468a9 100644
--- a/libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt.c
+++ b/libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt.c
@@ -13,7 +13,8 @@ unsigned int b[N];
unsigned int c[N];
void __attribute__((noclone,noinline))
-f (unsigned int n)
+f (unsigned int n, unsigned int *__restrict__ a, unsigned int *__restrict__ b,
+ unsigned int *__restrict__ c)
{
int i;
@@ -36,7 +37,7 @@ main (void)
c[k] = k * 2;
}
- f (N);
+ f (N, a, b, c);
for (i = 0; i < N; i++)
{