OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
773ec47fe6
gcc/libgomp/testsuite/libgomp.c/loop-14.c
Jakub Jelinek 5a0f4dd395 omp-low.c (extract_omp_for_data): For collapsed loops... 
* omp-low.c (extract_omp_for_data): For collapsed loops,
	if at least one of the loops is known at compile time to
	iterate zero times, set count to 0.
	(expand_omp_regimplify_p): New function.
	(expand_omp_for_generic): For collapsed loops, if at least
	one of the loops isn't known to iterate at least once,
	add runtime check with setting count to 0.
	(expand_omp_for_static_nochunk, expand_omp_for_static_chunk):
	For unsigned types if it isn't known at compile time that
	the loop will iterate at least once, add runtime check to bypass
	the whole loop if initial condition isn't true.

	* testsuite/libgomp.c/loop-13.c: New test.
	* testsuite/libgomp.c/loop-14.c: New test.
	* testsuite/libgomp.c/loop-15.c: New test.
	* testsuite/libgomp.c++/loop-13.C: New test.
	* testsuite/libgomp.c++/loop-14.C: New test.
	* testsuite/libgomp.c++/loop-15.C: New test.

From-SVN: r198966
2013-05-16 12:43:33 +02:00

254 lines
6.5 KiB
C
Raw Blame History

/* { dg-do run } */
volatile int ji = 100, ki = 2;
volatile unsigned int ju = 100, ku = 2;
volatile long long int jll = 100, kll = 2;
volatile unsigned long long int jull = 100, kull = 2;
unsigned long long l;
void
f0 (void)
{
int i, j, k;
unsigned int j2, k2;
#pragma omp for reduction(+: l) schedule(static, 2)
for (i = ji; i < ki; i++)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) schedule(static, 2)
for (i = ji; i < ki; i++)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = ji; i < ki; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = ji; i < ki; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp for reduction(+: l) collapse(3) schedule(static, 2)
for (j2 = 0; j2 < 4; j2++)
for (i = ji; i < ki; i++)
for (k2 = 0; k2 < 5; k2 += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j2 = 0; j2 < 4; j2++)
for (i = ji; i < ki; i++)
for (k2 = 0; k2 < 5; k2 += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = ji; i < ki; i++)
for (k = ki + 10; k < ji - 10; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = ki + 10; j < ji - 10; j++)
for (i = ji; i < ki; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
}
void
f1 (void)
{
unsigned int i, j, k;
int j2, k2;
#pragma omp for reduction(+: l) schedule(static, 2)
for (i = ju; i < ku; i++)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) schedule(static, 2)
for (i = ju; i < ku; i++)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = ju; i < ku; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = ju; i < ku; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp for reduction(+: l) collapse(3) schedule(static, 2)
for (j2 = 0; j2 < 4; j2++)
for (i = ju; i < ku; i++)
for (k2 = 0; k2 < 5; k2 += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j2 = 0; j2 < 4; j2++)
for (i = ju; i < ku; i++)
for (k2 = 0; k2 < 5; k2 += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = ju; i < ku; i++)
for (k = ku; k < ju; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = ku; j < ju; j++)
for (i = ju; i < ku; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
}
void
f2 (void)
{
long long int i, j, k;
unsigned long long int j2, k2;
#pragma omp for reduction(+: l) schedule(static, 2)
for (i = jll; i < kll; i++)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) schedule(static, 2)
for (i = jll; i < kll; i++)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = jll; i < kll; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = jll; i < kll; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp for reduction(+: l) collapse(3) schedule(static, 2)
for (j2 = 0; j2 < 4; j2++)
for (i = jll; i < kll; i++)
for (k2 = 0; k2 < 5; k2 += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j2 = 0; j2 < 4; j2++)
for (i = jll; i < kll; i++)
for (k2 = 0; k2 < 5; k2 += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = jll; i < kll; i++)
for (k = kll; k < jll; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = kll; j < jll; j++)
for (i = jll; i < kll; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
}
void
f3 (void)
{
unsigned long long int i, j, k;
long long int j2, k2;
#pragma omp for reduction(+: l) schedule(static, 2)
for (i = jull; i < kull; i++)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) schedule(static, 2)
for (i = jull; i < kull; i++)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = jull; i < kull; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = jull; i < kull; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp for reduction(+: l) collapse(3) schedule(static, 2)
for (j2 = 0; j2 < 4; j2++)
for (i = jull; i < kull; i++)
for (k2 = 0; k2 < 5; k2 += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j2 = 0; j2 < 4; j2++)
for (i = jull; i < kull; i++)
for (k2 = 0; k2 < 5; k2 += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = 0; j < 4; j++)
for (i = jull; i < kull; i++)
for (k = kull; k < jull; k += 2)
l++;
if (l != 0)
__builtin_abort ();
#pragma omp parallel for reduction(+: l) collapse(3) schedule(static, 2)
for (j = kull; j < jull; j++)
for (i = jull; i < kull; i++)
for (k = 0; k < 5; k += 2)
l++;
if (l != 0)
__builtin_abort ();
}
int
main ()
{
f0 ();
f1 ();
f2 ();
f3 ();
return 0;
}
Reference in New Issue View Git Blame Copy Permalink