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

Add libgomp.c-c++-common/pr106449-2.c

Browse source 
This run-time test test pointer-based iteration with collapse,
similar to the '(parallel) simd' test for PR106449 but for 'for'.

libgomp/ChangeLog:

	* testsuite/libgomp.c-c++-common/pr106449-2.c: New test.
This commit is contained in:
Tobias Burnus 2022-07-29 12:41:08 +02:00
parent a6afbe5e95
commit 85fe7e7dd1
1 changed files with 64 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

64
libgomp/testsuite/libgomp.c-c++-common/pr106449-2.c Normal file
View file

@ -0,0 +1,64 @@
/* { dg-do run } */
/* Based on pr106449.c - but using 'for' instead of 'simd'.
Cf. PR middle-end/106449 (for pr106449.c) and PR middle-end/106467. */
void
foo (void)
{
int a[1024], *b[65536], *c[65536];
int *p, *q, **r = &b[0], **r2 = &c[0], i;
#pragma omp for collapse(2)
for (p = &a[0]; p < &a[512]; p++)
for (q = p + 64; q < p + 128; q++)
{
*r++ = p;
*r2++ = q;
}
for (i = 0; i < 32768; i++)
if (b[i] != &a[i / 64] || c[i] != &a[(i / 64) + 64 + (i % 64)])
__builtin_abort ();
}
void
bar (int n, int m)
{
int a[1024], *b[32768], *c[32768];
int *p, *q, **r = &b[0], **r2 = &c[0], i;
#pragma omp for collapse(2)
for (p = &a[0]; p < &a[512]; p++)
for (q = p + n; q < p + m; q++)
{
*r++ = p;
*r2++ = q;
}
for (i = 0; i < 32768; i++)
if (b[i] != &a[i / 64] || c[i] != &a[(i / 64) + 64 + (i % 64)])
__builtin_abort ();
}
void
baz (int n, int m)
{
int a[1024], *b[8192], *c[8192];
int *p, *q, **r = &b[0], **r2 = &c[0], i;
#pragma omp for collapse(2)
for (p = &a[0]; p < &a[512]; p += 4)
for (q = p + n; q < p + m; q += 2)
{
*r++ = p;
*r2++ = q;
}
for (i = 0; i < 4096; i++)
if (b[i] != &a[(i / 32) * 4] || c[i] != &a[(i / 32) * 4 + 64 + (i % 32) * 2])
__builtin_abort ();
}
int
main ()
{
foo ();
bar (64, 128);
baz (64, 128);
return 0;
}