OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
b6dd195aac
gcc/libgomp/testsuite/libgomp.c/loop-21.c
Jakub Jelinek f418bd4b92 openmp: Adjust outer bounds of non-rect loops 
In loops like:
  #pragma omp parallel for collapse(2)
  for (i = -4; i < 8; i++)
    for (j = 3 * i; j > 2 * i; j--)
for some outer loop iterations there are no inner loop iterations at all,
the condition is false.  In order to use Summæ Potestate to count number
of iterations or to transform the logical iteration number to actual
iterator values using quadratic non-equation root discovery the outer
iterator range needs to be adjusted, such that the inner loop has at least
one iteration for each of the outer loop iterator value in the reduced
range.  Sometimes this adjustment is done at the start of the range,
at other times at the end.

This patch implements it during the compile time number of loop computation
(if all expressions are compile time constants).

2020-07-14  Jakub Jelinek  <jakub@redhat.com>

	* omp-general.h (struct omp_for_data): Add adjn1 member.
	* omp-general.c (omp_extract_for_data): For non-rect loop, punt on
	count computing if n1, n2 or step are not INTEGER_CST earlier.
	Narrow the outer iterator range if needed so that non-rect loop
	has at least one iteration for each outer range iteration.  Compute
	adjn1.
	* omp-expand.c (expand_omp_for_init_vars): Use adjn1 if non-NULL
	instead of the outer loop's n1.

	* testsuite/libgomp.c/loop-21.c: New test.
2020-07-14 10:31:59 +02:00

231 lines
7.1 KiB
C
Raw Blame History

/* { dg-do run } */
extern void abort (void);
int x, i, j;
volatile int a, b, c, d, e, f, g, h;
int k[13][27];
int
main ()
{
int niters;
for (i = -4; i < 8; i++)
for (j = 3 * i; j > 2 * i; j--)
k[i + 5][j + 5] = 1;
a = -4; b = 8; c = 1; d = 3; e = 0; f = 2; g = 0; h = -1;
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = -4; i < 8; i++)
for (j = 3 * i; j > 2 * i; j--)
{
if (i < -4 || i >= 8 || j > 3 * i || j <= i * 2 || k[i + 5][j + 5] != 1)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (i != 8 || j != 14 || x != 7183 || niters != 28)
abort ();
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = a; i < b; i += c)
for (j = d * i + e; j > g + i * f; j += h)
{
if (i < -4 || i >= 8 || j > 3 * i || j <= i * 2 || k[i + 5][j + 5] != 2)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (i != 8 || j != 14 || x != 7183 || niters != 28)
abort ();
for (int i = -4; i < 8; i++)
for (int j = 3 * i; j > 2 * i; j--)
if (k[i + 5][j + 5] == 3)
k[i + 5][j + 5] = 0;
else
abort ();
for (i = -2; i < 4; i++)
for (j = -2 * i + 3; j > -3; j -= 2)
k[i + 5][j + 5] = 1;
a = -2; b = 4; c = 1; d = -2; e = 3; f = 0; g = -3; h = -2;
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = -2; i < 4; i++)
for (j = -2 * i + 3; j > -3; j -= 2)
{
if (i < -2 || i >= 4 || j <= -3 || j > -2 * i + 3 || k[i + 5][j + 5] != 1)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (/* i != 4 || j != -3 || */x != 3071 || niters != 15)
abort ();
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = a; i < b; i += c)
for (j = d * i + e; j > g + i * f; j += h)
{
if (i < -2 || i >= 4 || j <= -3 || j > -2 * i + 3 || k[i + 5][j + 5] != 2)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (/*i != 4 || j != -3 || */x != 3071 || niters != 15)
abort ();
for (i = -2; i < 4; i++)
for (j = -2 * i + 3; j > -3; j -= 2)
if (k[i + 5][j + 5] == 3)
k[i + 5][j + 5] = 0;
else
abort ();
for (i = 3; i > -3; i--)
for (j = -2 * i + 7; j > 2 * i + 1; j--)
k[i + 5][j + 5] = 1;
a = 3; b = -3; c = -1; d = -2; e = 7; f = 2; g = 1; h = -1;
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = 3; i > -3; i--)
for (j = -2 * i + 7; j > 2 * i + 1; j--)
{
if (i <= -3 || i > 3 || j <= 2 * i + 1 || j > -2 * i + 7 || k[i + 5][j + 5] != 1)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (i != -3 || j != -3 || x != -1026 || niters != 32)
abort ();
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = a; i > b; i += c)
for (j = d * i + e; j > g + i * f; j += h)
{
if (i <= -3 || i > 3 || j <= 2 * i + 1 || j > -2 * i + 7 || k[i + 5][j + 5] != 2)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (i != -3 || j != -3 || x != -1026 || niters != 32)
abort ();
for (i = 3; i > -3; i--)
for (j = -2 * i + 7; j > 2 * i + 1; j--)
if (k[i + 5][j + 5] == 3)
k[i + 5][j + 5] = 0;
else
abort ();
for (i = 3; i > -3; i--)
for (j = 2 * i + 7; j > -2 * i + 1; j--)
k[i + 5][j + 5] = 1;
a = 3; b = -3; c = -1; d = 2; e = 7; f = -2; g = 1; h = -1;
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = 3; i > -3; i--)
for (j = 2 * i + 7; j > -2 * i + 1; j--)
{
if (i <= -3 || i > 3 || j <= -2 * i + 1 || j > 2 * i + 7 || k[i + 5][j + 5] != 1)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (/*i != -3 || j != 3 || */x != -1020 || niters != 50)
abort ();
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = a; i > b; i += c)
for (j = d * i + e; j > g + i * f; j += h)
{
if (i <= -3 || i > 3 || j <= -2 * i + 1 || j > 2 * i + 7 || k[i + 5][j + 5] != 2)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (/*i != -3 || j != 3 || */x != -1020 || niters != 50)
abort ();
for (i = 3; i > -3; i--)
for (j = 2 * i + 7; j > -2 * i + 1; j--)
if (k[i + 5][j + 5] == 3)
k[i + 5][j + 5] = 0;
else
abort ();
for (i = 6; i > -6; i--)
for (j = 2 * i + 7; j <= -2 * i + 1; j++)
k[i + 5][j + 5] = 1;
a = 6; b = -6; c = -1; d = 2; e = 7; f = -2; g = 2; h = 1;
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = 6; i > -6; i--)
for (j = 2 * i + 7; j <= -2 * i + 1; j++)
{
if (i <= -6 || i > 6 || j < 2 * i + 7 || j >= -2 * i + 2 || k[i + 5][j + 5] != 1)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (i != -6 || j != 12 || x != -5109 || niters != 36)
abort ();
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = a; i > b; i += c)
for (j = d * i + e; j < g + i * f; j += h)
{
if (i <= -6 || i > 6 || j < 2 * i + 7 || j >= -2 * i + 2 || k[i + 5][j + 5] != 2)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (i != -6 || j != 12 || x != -5109 || niters != 36)
abort ();
for (i = 6; i > -6; i--)
for (j = 2 * i + 7; j <= -2 * i + 1; j++)
if (k[i + 5][j + 5] == 3)
k[i + 5][j + 5] = 0;
else
abort ();
for (i = 6; i > -6; i -= 2)
for (j = -2 * i + 7; j <= 2 * i + 1; j++)
k[i + 5][j + 5] = 1;
a = 6; b = -6; c = -2; d = -2; e = 7; f = 2; g = 2; h = 1;
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = 6; i > -6; i -= 2)
for (j = -2 * i + 7; j <= 2 * i + 1; j++)
{
if (i <= -6 || i > 6 || j < -2 * i + 7 || j >= 2 * i + 2 || k[i + 5][j + 5] != 1)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (/*i != -6 || j != 15 || */x != 2053 || niters != 33)
abort ();
niters = 0; i = -100; j = -100; x = -100;
#pragma omp parallel for collapse(2) lastprivate (i, j, x) reduction(+:niters)
for (i = a; i > b; i += c)
for (j = d * i + e; j < g + i * f; j += h)
{
if (i <= -6 || i > 6 || j < -2 * i + 7 || j >= 2 * i + 2 || k[i + 5][j + 5] != 2)
abort ();
k[i + 5][j + 5]++;
x = i * 1024 + (j & 1023);
niters++;
}
if (/*i != -6 || j != 15 || */x != 2053 || niters != 33)
abort ();
for (i = 6; i > -6; i -= 2)
for (j = -2 * i + 7; j <= 2 * i + 1; j++)
if (k[i + 5][j + 5] == 3)
k[i + 5][j + 5] = 0;
else
abort ();
return 0;
}
Reference in New Issue View Git Blame Copy Permalink