filename
stringlengths 78
241
| omp_pragma_line
stringlengths 24
416
| context_chars
int64 100
100
| text
stringlengths 152
177k
|
|---|---|---|---|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr39154.c
|
#pragma omp parallel for shared (n, a, b)
| 100
|
t j = 0; j < n; j++)
if (b[i][j] != i + 5)
abort ();
if (a[i] != i + 5)
abort ();
}
<LOOP-START>for (int i = 0; i < n; i++)
{
a[i] = i + 7;
#pragma omp parallel for shared (n, a, b)
for (int j = 0; j < n; j++)
b[i][j] = a[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared (n, a, b)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr39154.c
|
#pragma omp parallel for shared (n, a, b)
| 100
|
}
#pragma omp parallel for shared (n, a, b)
for (int i = 0; i < n; i++)
{
a[i] = i + 7;
<LOOP-START>for (int j = 0; j < n; j++)
b[i][j] = a[i];
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
if (b[i][j] != i + 7)
abort ();
if (a[i] != i + 7)
abort ();
}<LOOP-END> <OMP-START>#pragma omp parallel for shared (n, a, b)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr39154.c
|
#pragma omp parallel for private (a, b)
| 100
|
t j = 0; j < n; j++)
if (b[i][j] != i + 7)
abort ();
if (a[i] != i + 7)
abort ();
}
<LOOP-START>for (int i = 0; i < n; i++)
{
a[i] = i + 1;
#pragma omp parallel for
for (int j = 0; j < n; j++)
b[i][j] = a[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (a, b)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr39154.c
|
#pragma omp parallel for
| 100
|
}
#pragma omp parallel for private (a, b)
for (int i = 0; i < n; i++)
{
a[i] = i + 1;
<LOOP-START>for (int j = 0; j < n; j++)
b[i][j] = a[i];
}
#pragma omp parallel for private (a, b)
for (int i = 0; i < n; i++)
{
a[i] = i + 1;
#pragma omp parallel for private (b)
for (int j = 0; j < n; j++)
b[i][j] = a[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr39154.c
|
#pragma omp parallel for private (a, b)
| 100
|
{
a[i] = i + 1;
#pragma omp parallel for
for (int j = 0; j < n; j++)
b[i][j] = a[i];
}
<LOOP-START>for (int i = 0; i < n; i++)
{
a[i] = i + 1;
#pragma omp parallel for private (b)
for (int j = 0; j < n; j++)
b[i][j] = a[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (a, b)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/collapse-1.c
|
#pragma omp parallel for collapse(4 - 1) schedule(static, 4)
| 100
|
ib.h>
int
main (void)
{
int i, j, k, l = 0;
int a[3][3][3];
memset (a, '\0', sizeof (a));
<LOOP-START>for (i = 0; i < 2; i++)
for (j = 0; j < 2; j++)
for (k = 0; k < 2; k++)
a[i][j][k] = i + j * 4 + k * 16;
#pragma omp parallel
{
#pragma omp for collapse(2) reduction(|:l) private(k)
for (i = 0; i < 2; i++)
for (j = 0; j < 2; j++)
for (k = 0; k < 2; k++)
if (a[i][j][k] != i + j * 4 + k * 16)
l = 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for collapse(4 - 1) schedule(static, 4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/simd-15.c
|
#pragma omp parallel for simd schedule (static, 4) linear(b:2) reduction(+:c)
| 100
|
}
if (c || i != 8 || j != 8 || b != 7 + 64 * 2)
__builtin_abort ();
i = 4; j = 4; b = 7;
<LOOP-START>for (i = 0; i < 64; i++)
{
c = c + (b != 7 + 2 * i);
foo (&b, &i, &j, 2);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd schedule (static, 4) linear(b:2) reduction(+:c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/simd-15.c
|
#pragma omp parallel for simd schedule (static, 4) linear(b:3) reduction(+:c)
| 100
|
, 2);
}
if (c || i != 64 || b != 7 + 64 * 2)
__builtin_abort ();
i = 4; j = 4; b = 7;
<LOOP-START>for (i = 0; i < 64; i += 4)
{
c = c + (b != 7 + i / 4 * 3);
foo (&b, &i, &j, 3);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd schedule (static, 4) linear(b:3) reduction(+:c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/simd-15.c
|
#pragma omp parallel for simd schedule (static, 4) linear(i) linear(b:2) reduction(+:c)
| 100
|
, 3);
}
if (c || i != 64 || b != 7 + 16 * 3)
__builtin_abort ();
i = 4; j = 4; b = 7;
<LOOP-START>for (i = 0; i < 64; i++)
{
c = c + (b != 7 + 2 * i);
foo (&b, &i, &j, 2);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd schedule (static, 4) linear(i) linear(b:2) reduction(+:c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/simd-15.c
|
#pragma omp parallel for simd schedule (static, 4) linear(i:4) linear(b:3) reduction(+:c)
| 100
|
, 2);
}
if (c || i != 64 || b != 7 + 64 * 2)
__builtin_abort ();
i = 4; j = 4; b = 7;
<LOOP-START>for (i = 0; i < 64; i += 4)
{
c = c + (b != 7 + i / 4 * 3);
foo (&b, &i, &j, 3);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd schedule (static, 4) linear(i:4) linear(b:3) reduction(+:c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/simd-15.c
|
#pragma omp parallel for simd lastprivate (i, j) collapse (2) schedule (static, 4) linear(b:2) reduction(+:c)
| 100
|
, 3);
}
if (c || i != 64 || b != 7 + 16 * 3)
__builtin_abort ();
i = 4; j = 4; b = 7;
<LOOP-START>for (i = 0; i < 8; i++)
for (j = 0; j < 8; j++)
{
c = c + (b != 7 + 2 * j + 2 * 8 * i);
foo (&b, &i, &j, 2);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd lastprivate (i, j) collapse (2) schedule (static, 4) linear(b:2) reduction(+:c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/simd-15.c
|
#pragma omp parallel for simd collapse (2) schedule (static, 4) linear(b:2) reduction(+:c)
| 100
|
}
if (c || i != 8 || j != 8 || b != 7 + 64 * 2)
__builtin_abort ();
i = 4; j = 4; b = 7;
<LOOP-START>for (i = 0; i < 8; i++)
for (j = 0; j < 8; j++)
{
c = c + (b != 7 + 2 * j + 2 * 8 * i);
foo (&b, &i, &j, 2);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd collapse (2) schedule (static, 4) linear(b:2) reduction(+:c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr26943-4.c
|
#pragma omp parallel for shared (a, e) firstprivate (b, f) \
| 100
|
ion (+:l) \
firstprivate (a, b, c, d, e, f, g, h, j)
if (k == omp_get_thread_num ())
{
<LOOP-START>lastprivate (c, g) private (d, h) \
schedule (static, 1) num_threads (4) \
reduction (+:j)
for (i = 0; i < 4; i++)
{
if (a != 8 || b != 12 || e[0] != 'a' || f[0] != 'b')
j++;
GOMP_barrier ();
#pragma omp atomic
a += i;
b += i;
c = i;
d = i;
#pragma omp atomic
e[0] += i;
f[0] += i;
g[0] = 'g' + i;
h[0] = 'h' + i;
GOMP_barrier ();
if (a != 8 + 6 || b != 12 + i || c != i || d != i)
j += 8;
if (e[0] != 'a' + 6 || f[0] != 'b' + i || g[0] != 'g' + i)
j += 64;
if (h[0] != 'h' + i)
j += 512;
}<LOOP-END> <OMP-START>#pragma omp parallel for shared (a, e) firstprivate (b, f) \<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr33880.c
|
#pragma omp parallel for num_threads(4)
| 100
|
);
void
test1 (void)
{
int i = 0, j = 0;
void bar (void)
{
i++;
j++;
}
bar ();
<LOOP-START>for (i = 0; i < 100; i++)
#pragma omp atomic
j += 1;
if (j != 101)
abort ();
#pragma omp parallel for lastprivate(i) num_threads(2)
for (i = 0; i < 100; i++)
#pragma omp atomic
j += 1;
if (i != 100)
abort ();
i = 3;
bar ();
if (j != 202)
abort ();
if (i != 4)
abort ();
}
void
test2 (void)
{
int i = -1, j = 99, k, l = 9, m = 0;
void bar (void)
{
i++;
j++;
l++;
m++;
}
bar ();
#pragma omp parallel for num_threads(4)
for (k = i; k < j; k += l)
#pragma omp atomic
m += 1;
bar ();
if (i != 1 || j != 101 || l != 11 || m != 12)
abort ();
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr33880.c
|
#pragma omp parallel for lastprivate(i) num_threads(2)
| 100
|
(4)
for (i = 0; i < 100; i++)
#pragma omp atomic
j += 1;
if (j != 101)
abort ();
<LOOP-START>for (i = 0; i < 100; i++)
#pragma omp atomic
j += 1;
if (i != 100)
abort ();
i = 3;
bar ();
if (j != 202)
abort ();
if (i != 4)
abort ();
}
void
test2 (void)
{
int i = -1, j = 99, k, l = 9, m = 0;
void bar (void)
{
i++;
j++;
l++;
m++;
}
bar ();
#pragma omp parallel for num_threads(4)
for (k = i; k < j; k += l)
#pragma omp atomic
m += 1;
bar ();
if (i != 1 || j != 101 || l != 11 || m != 12)
abort ();
}<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate(i) num_threads(2)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr33880.c
|
#pragma omp parallel for num_threads(4)
| 100
|
j = 99, k, l = 9, m = 0;
void bar (void)
{
i++;
j++;
l++;
m++;
}
bar ();
<LOOP-START>for (k = i; k < j; k += l)
#pragma omp atomic
m += 1;
bar ();
if (i != 1 || j != 101 || l != 11 || m != 12)
abort ();
}
void
test3 (void)
{
int i, j, k, l, m;
void bar (void)
{
#pragma omp parallel for num_threads(4)
for (i = j; i < k; i += l)
#pragma omp atomic
m += 1;
}
void baz (void)
{
#pragma omp parallel for num_threads(2) lastprivate(i)
for (i = j; i < k * 2; i += l / 2)
#pragma omp atomic
m += 1;
}
i = 7;
j = 0;
k = 100;
l = 2;
m = 0;
bar ();
if (j != 0 || k != 100 || l != 2 || m != 50)
abort ();
baz ();
if (i != 200 || j != 0 || k != 100 || l != 2 || m != 250)
abort ();
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr33880.c
|
#pragma omp parallel for num_threads(4)
| 100
|
!= 11 || m != 12)
abort ();
}
void
test3 (void)
{
int i, j, k, l, m;
void bar (void)
{
<LOOP-START>for (i = j; i < k; i += l)
#pragma omp atomic
m += 1;
}
void baz (void)
{
#pragma omp parallel for num_threads(2) lastprivate(i)
for (i = j; i < k * 2; i += l / 2)
#pragma omp atomic
m += 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr33880.c
|
#pragma omp parallel for num_threads(2) lastprivate(i)
| 100
|
for (i = j; i < k; i += l)
#pragma omp atomic
m += 1;
}
void baz (void)
{
<LOOP-START>for (i = j; i < k * 2; i += l / 2)
#pragma omp atomic
m += 1;
}
i = 7;
j = 0;
k = 100;
l = 2;
m = 0;
bar ();
if (j != 0 || k != 100 || l != 2 || m != 50)
abort ();
baz ();
if (i != 200 || j != 0 || k != 100 || l != 2 || m != 250)
abort ();
}
void
test4 (void)
{
int i, j, k, l, m = 0;
int foo (void)
{
return j;
}
int bar (void)
{
return k;
}
int baz (void)
{
return l;
}
j = 0;
k = 1000;
l = 2;
#pragma omp parallel for num_threads(8) lastprivate(i)
for (i = foo (); i < bar (); i += baz ())
#pragma omp atomic
m += 1;
if (i != 1000 || m != 500 || j != 0 || k != 1000 || l != 2)
abort ();
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(2) lastprivate(i)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr33880.c
|
#pragma omp parallel for num_threads(8) lastprivate(i)
| 100
|
(void)
{
return k;
}
int baz (void)
{
return l;
}
j = 0;
k = 1000;
l = 2;
<LOOP-START>for (i = foo (); i < bar (); i += baz ())
#pragma omp atomic
m += 1;
if (i != 1000 || m != 500 || j != 0 || k != 1000 || l != 2)
abort ();
}
int
main (void)
{
test1 ();
test2 ();
test3 ();
test4 ();
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(8) lastprivate(i)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/reduction-11.c
|
#pragma omp parallel for reduction(+:x[-1:2][:][0:2], z[t + 2:4]) \
| 100
|
int *y, long w[1][2], int s, int t)
{
unsigned long long a[9] = {};
short b[5] = {};
int i;
<LOOP-START>reduction(*:y[-s:3]) reduction(|:a[s + 3:4]) \
reduction(&:w[s + 1:1][t:2]) reduction(max:b[2:])
for (i = 0; i < 128; i++)
{
x[i / 64 - 1][i % 3][(i / 4) & 1] += i;
if ((i & 15) == 1)
y[1] *= 3;
if ((i & 31) == 2)
y[2] *= 7;
if ((i & 63) == 3)
y[3] *= 17;
z[i / 32 + 2] += (i & 3);
if (i < 4)
z[i + 2] += i;
a[i / 32 + 2] |= 1ULL << (i & 30);
w[0][i & 1] &= ~(1L << (i / 17 * 3));
if ((i % 23) > b[2])
b[2] = i % 23;
if ((i % 85) > b[3])
b[3] = i % 85;
if ((i % 192) > b[4])
b[4] = i % 192;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:x[-1:2][:][0:2], z[t + 2:4]) \<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/static-chunk-size-one.c
|
#pragma omp parallel for num_threads (3) reduction (+:a) schedule(static, 1)
| 100
|
extern void abort ();
int
bar ()
{
int a = 0, i;
<LOOP-START>for (i = 0; i < 10; i++)
a += i;
return a;
}
int
main (void)
{
int res;
res = bar ();
if (res != 45)
abort ();
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads (3) reduction (+:a) schedule(static, 1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr58756.c
|
#pragma omp parallel for reduction(+: c)
| 100
|
id);
int d[32 * 32];
__attribute__((noinline, noclone)) int
foo (int a, int b)
{
int j, c = 0;
<LOOP-START>for (j = 0; j < a; j += 32)
{
int l;
#pragma omp simd reduction(+: c) safelen(1)
for (l = 0; l < b; ++l)
c += d[j + l];
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+: c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr58756.c
|
#pragma omp parallel for simd reduction(+: c) safelen(1)
| 100
|
+ l];
}
return c;
}
__attribute__((noinline, noclone)) int
bar (int a)
{
int j, c = 0;
<LOOP-START>for (j = 0; j < a; ++j)
c += d[j];
return c;
}
__attribute__((noinline)) static int
baz (int a)
{
int j, c = 0;
#pragma omp simd reduction(+: c) safelen(1)
for (j = 0; j < a; ++j)
c += d[j];
return c;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd reduction(+: c) safelen(1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/simd-17.c
|
#pragma omp parallel for simd schedule (static, 4) linear(b:2) reduction(+:c)
| 100
|
* i);
foo (&b, &i, &j, 2);
}
if (c || b != 7 + 64 * 2)
__builtin_abort ();
b = 7;
<LOOP-START>for (int i = 0; i < 64; i++)
{
c = c + (b != 7 + 2 * i);
foo (&b, &i, &i, 2);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd schedule (static, 4) linear(b:2) reduction(+:c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/simd-17.c
|
#pragma omp parallel for simd schedule (static, 4) linear(b:3) reduction(+:c)
| 100
|
i);
foo (&b, &i, &i, 2);
}
if (c || b != 7 + 64 * 2)
__builtin_abort ();
b = 7;
<LOOP-START>for (int i = 0; i < 64; i += 4)
{
c = c + (b != 7 + i / 4 * 3);
foo (&b, &i, &i, 3);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd schedule (static, 4) linear(b:3) reduction(+:c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/simd-17.c
|
#pragma omp parallel for simd collapse (2) schedule (static, 4) linear(b:2) reduction(+:c)
| 100
|
3);
foo (&b, &i, &i, 3);
}
if (c || b != 7 + 16 * 3)
__builtin_abort ();
b = 7;
<LOOP-START>for (int i = 0; i < 8; i++)
for (int j = 0; j < 8; j++)
{
c = c + (b != 7 + 2 * j + 2 * 8 * i);
foo (&b, &i, &j, 2);
}<LOOP-END> <OMP-START>#pragma omp parallel for simd collapse (2) schedule (static, 4) linear(b:2) reduction(+:c)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr29947-2.c
|
#pragma omp parallel for reduction (+:e,c) schedule (static)
| 100
|
j2 + 1))
abort ();
}
void
test9 (long j1, long k1, long j2, long k2)
{
long i, e = 0, c = 0;
<LOOP-START>for (i = j1; i <= k1; ++i)
{
if (i < j2 || i > k2)
++e;
++c;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:e,c) schedule (static)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr29947-2.c
|
#pragma omp parallel for reduction (+:e,c) schedule (static)
| 100
|
2 + 1))
abort ();
}
void
test10 (long j1, long k1, long j2, long k2)
{
long i, e = 0, c = 0;
<LOOP-START>for (i = k1; i >= j1; --i)
{
if (i < j2 || i > k2)
++e;
++c;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:e,c) schedule (static)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr29947-2.c
|
#pragma omp parallel for reduction (+:e,c) schedule (static, 1)
| 100
|
2 + 1))
abort ();
}
void
test11 (long j1, long k1, long j2, long k2)
{
long i, e = 0, c = 0;
<LOOP-START>for (i = j1; i <= k1; ++i)
{
if (i < j2 || i > k2)
++e;
++c;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:e,c) schedule (static, 1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr29947-2.c
|
#pragma omp parallel for reduction (+:e,c) schedule (static, 1)
| 100
|
2 + 1))
abort ();
}
void
test12 (long j1, long k1, long j2, long k2)
{
long i, e = 0, c = 0;
<LOOP-START>for (i = k1; i >= j1; --i)
{
if (i < j2 || i > k2)
++e;
++c;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:e,c) schedule (static, 1)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr29947-2.c
|
#pragma omp parallel for reduction (+:e,c) schedule (static) ordered
| 100
|
2 + 1))
abort ();
}
void
test13 (long j1, long k1, long j2, long k2)
{
long i, e = 0, c = 0;
<LOOP-START>for (i = j1; i <= k1; ++i)
{
if (i < j2 || i > k2)
++e;
#pragma omp ordered
++c;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:e,c) schedule (static) ordered<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr29947-2.c
|
#pragma omp parallel for reduction (+:e,c) schedule (static) ordered
| 100
|
2 + 1))
abort ();
}
void
test14 (long j1, long k1, long j2, long k2)
{
long i, e = 0, c = 0;
<LOOP-START>for (i = k1; i >= j1; --i)
{
if (i < j2 || i > k2)
++e;
#pragma omp ordered
++c;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:e,c) schedule (static) ordered<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr29947-2.c
|
#pragma omp parallel for reduction (+:e,c) schedule (static, 1) ordered
| 100
|
2 + 1))
abort ();
}
void
test15 (long j1, long k1, long j2, long k2)
{
long i, e = 0, c = 0;
<LOOP-START>for (i = j1; i <= k1; ++i)
{
if (i < j2 || i > k2)
++e;
#pragma omp ordered
++c;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:e,c) schedule (static, 1) ordered<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr29947-2.c
|
#pragma omp parallel for reduction (+:e,c) schedule (static, 1) ordered
| 100
|
2 + 1))
abort ();
}
void
test16 (long j1, long k1, long j2, long k2)
{
long i, e = 0, c = 0;
<LOOP-START>for (i = k1; i >= j1; --i)
{
if (i < j2 || i > k2)
++e;
#pragma omp ordered
++c;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:e,c) schedule (static, 1) ordered<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/reduction-13.c
|
#pragma omp parallel for reduction(+:x[-1:p1 + 1][:p2], z[t + 2:p3]) \
| 100
|
int i;
for (i = 0; i < p7 + 4; i++)
{
if (i < p7)
b[i] = -6;
a[i] = 0;
}
<LOOP-START>reduction(*:y[-s:p4]) reduction(|:a[s + 3:p5]) \
reduction(&:w[s + 1:p6 - 1][t:p6]) reduction(max:b[2:])
for (i = 0; i < 128; i++)
{
x[i / 64 - 1][i % 3][(i / 4) & 1] += i;
if ((i & 15) == 1)
y[1] *= 3;
if ((i & 31) == 2)
y[2] *= 7;
if ((i & 63) == 3)
y[3] *= 17;
z[i / 32 + 2] += (i & 3);
if (i < 4)
z[i + 2] += i;
a[i / 32 + 2] |= 1ULL << (i & 30);
w[0][i & 1] &= ~(1L << (i / 17 * 3));
if ((i % 23) > b[2])
b[2] = i % 23;
if ((i % 85) > b[3])
b[3] = i % 85;
if ((i % 192) > b[4])
b[4] = i % 192;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:x[-1:p1 + 1][:p2], z[t + 2:p3]) \<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/omp_workshare3.c
|
#pragma omp parallel for \
| 100
|
[N];
/* Some initializations */
for (i=0; i < N; i++)
a[i] = b[i] = i * 1.0;
chunk = CHUNKSIZE;
<LOOP-START>shared(a,b,c,chunk) \
private(i,tid) \
schedule(static,chunk)
{ /* { dg-error "expected" } */
tid = omp_get_thread_num();
for (i=0; i < N; i++)
{
c[i] = a[i] + b[i];
printf("tid= %d i= %d c[i]= %f\n", tid, i, c[i]);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for \<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr66199-3.c
|
#pragma omp parallel for lastprivate (d) default(none) firstprivate (a, b) shared(u, v, w)
| 100
|
1024], v[1024], w[1024];
__attribute__((noinline, noclone)) long
f1 (long a, long b)
{
long d;
<LOOP-START>for (d = a; d < b; d++)
u[d] = v[d] + w[d];
return d;
}
__attribute__((noinline, noclone)) long
f2 (long a, long b, long c)
{
long d, e;
#pragma omp parallel for lastprivate (d) default(none) firstprivate (a, b) shared(u, v, w) linear(c:5) lastprivate(e)
for (d = a; d < b; d++)
{
u[d] = v[d] + w[d];
c += 5;
e = c;
}
return d + c + e;
}<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate (d) default(none) firstprivate (a, b) shared(u, v, w)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr66199-3.c
|
#pragma omp parallel for lastprivate (d) default(none) firstprivate (a, b) shared(u, v, w) linear(c:5) lastprivate(e)
| 100
|
return d;
}
__attribute__((noinline, noclone)) long
f2 (long a, long b, long c)
{
long d, e;
<LOOP-START>for (d = a; d < b; d++)
{
u[d] = v[d] + w[d];
c += 5;
e = c;
}<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate (d) default(none) firstprivate (a, b) shared(u, v, w) linear(c:5) lastprivate(e)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr66199-3.c
|
#pragma omp parallel for default(none) firstprivate (a1, b1, a2, b2) shared(u, v, w) lastprivate(d1, d2) collapse(2)
| 100
|
__attribute__((noinline, noclone)) long
f3 (long a1, long b1, long a2, long b2)
{
long d1, d2;
<LOOP-START>for (d1 = a1; d1 < b1; d1++)
for (d2 = a2; d2 < b2; d2++)
u[d1 * 32 + d2] = v[d1 * 32 + d2] + w[d1 * 32 + d2];
return d1 + d2;
}
int
main ()
{
if (f1 (0, 1024) != 1024
|| f2 (0, 1024, 17) != 1024 + 2 * (17 + 5 * 1024)
|| f3 (0, 32, 0, 32) != 64)
__builtin_abort ();
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for default(none) firstprivate (a1, b1, a2, b2) shared(u, v, w) lastprivate(d1, d2) collapse(2)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr66199-1.c
|
#pragma omp parallel for simd default(none) firstprivate (a, b) shared(u, v, w)
| 100
|
1024], v[1024], w[1024];
__attribute__((noinline, noclone)) long
f1 (long a, long b)
{
long d;
<LOOP-START>for (d = a; d < b; d++)
u[d] = v[d] + w[d];
return d;
}
__attribute__((noinline, noclone)) long
f2 (long a, long b, long c)
{
long d, e;
#pragma omp parallel for simd default(none) firstprivate (a, b) shared(u, v, w) linear(d) linear(c:5) lastprivate(e)
for (d = a; d < b; d++)
{
u[d] = v[d] + w[d];
c += 5;
e = c;
}
return d + c + e;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd default(none) firstprivate (a, b) shared(u, v, w)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr66199-1.c
|
#pragma omp parallel for simd default(none) firstprivate (a, b) shared(u, v, w) linear(d) linear(c:5) lastprivate(e)
| 100
|
return d;
}
__attribute__((noinline, noclone)) long
f2 (long a, long b, long c)
{
long d, e;
<LOOP-START>for (d = a; d < b; d++)
{
u[d] = v[d] + w[d];
c += 5;
e = c;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd default(none) firstprivate (a, b) shared(u, v, w) linear(d) linear(c:5) lastprivate(e)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr66199-1.c
|
#pragma omp parallel for simd default(none) firstprivate (a1, b1, a2, b2) shared(u, v, w) lastprivate(d1, d2) collapse(2)
| 100
|
__attribute__((noinline, noclone)) long
f3 (long a1, long b1, long a2, long b2)
{
long d1, d2;
<LOOP-START>for (d1 = a1; d1 < b1; d1++)
for (d2 = a2; d2 < b2; d2++)
u[d1 * 32 + d2] = v[d1 * 32 + d2] + w[d1 * 32 + d2];
return d1 + d2;
}
__attribute__((noinline, noclone)) long
f4 (long a1, long b1, long a2, long b2)
{
long d1, d2;
#pragma omp parallel for simd default(none) firstprivate (a1, b1, a2, b2) shared(u, v, w) collapse(2)
for (d1 = a1; d1 < b1; d1++)
for (d2 = a2; d2 < b2; d2++)
u[d1 * 32 + d2] = v[d1 * 32 + d2] + w[d1 * 32 + d2];
return d1 + d2;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd default(none) firstprivate (a1, b1, a2, b2) shared(u, v, w) lastprivate(d1, d2) collapse(2)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/pr66199-1.c
|
#pragma omp parallel for simd default(none) firstprivate (a1, b1, a2, b2) shared(u, v, w) collapse(2)
| 100
|
__attribute__((noinline, noclone)) long
f4 (long a1, long b1, long a2, long b2)
{
long d1, d2;
<LOOP-START>for (d1 = a1; d1 < b1; d1++)
for (d2 = a2; d2 < b2; d2++)
u[d1 * 32 + d2] = v[d1 * 32 + d2] + w[d1 * 32 + d2];
return d1 + d2;
}
int
main ()
{
if (f1 (0, 1024) != 1024
|| f2 (0, 1024, 17) != 1024 + 2 * (17 + 5 * 1024)
|| f3 (0, 32, 0, 32) != 64
|| f4 (0, 32, 0, 32) != 64)
__builtin_abort ();
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd default(none) firstprivate (a1, b1, a2, b2) shared(u, v, w) collapse(2)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/appendix-a/a.16.1.c
|
#pragma omp parallel for shared(x, y, index, n)
| 100
|
at
work2 (int i)
{
return 2.0 * i;
}
void
a16 (float *x, float *y, int *index, int n)
{
int i;
<LOOP-START>for (i = 0; i < n; i++)
{
#pragma omp atomic
x[index[i]] += work1 (i);
y[i] += work2 (i);
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(x, y, index, n)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/appendix-a/a.21.1.c
|
#pragma omp parallel for ordered schedule(dynamic)
| 100
|
k)
{
#pragma omp ordered
printf (" %d\n", k);
}
void
a21 (int lb, int ub, int stride)
{
int i;
<LOOP-START>for (i = lb; i < ub; i += stride)
work (i);
}
int
main ()
{
a21 (0, 100, 5);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered schedule(dynamic)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_data-1.c
|
#pragma omp parallel for
| 100
|
;
#pragma omp target data map(to: v1[0:N], v2[:N]) map(from: p[0:N])
#pragma omp target
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
}
int main ()
{
long long *p1 = (long long *) malloc (MAX * sizeof (long long));
long long *p2 = (long long *) malloc (MAX * sizeof (long long));
long long *v1 = (long long *) malloc (MAX * sizeof (long long));
long long *v2 = (long long *) malloc (MAX * sizeof (long long));
init (v1, v2, MAX);
vec_mult_ref (p1, v1, v2, MAX);
vec_mult (p2, v1, v2, MAX);
check (p1, p2, MAX);
free (p1);
free (p2);
free (v1);
free (v2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_data-4.c
|
#pragma omp parallel for
| 100
|
double *v4, int N)
{
int i;
#pragma omp target map(to: v3[0:N], v4[:N]) map(from: p1[0:N])
<LOOP-START>for (i = 0; i < N; i++)
p1[i] = v3[i] * v4[i];
}
void foo (double *p0, double *v1, double *v2, int N)
{
init (v1, v2, N);
#pragma omp target data map(to: v1[0:N], v2[:N]) map(from: p0[0:N])
vec_mult (p0, v1, v2, N);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target-2.c
|
#pragma omp parallel for
| 100
|
r *p)
{
int i;
char v1[N], v2[N];
init (v1, v2);
#pragma omp target map(from: p[0:N])
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
}
int main ()
{
char p1[N], p2[N];
char v1[N], v2[N];
init (v1, v2);
vec_mult_ref (p1);
vec_mult (p2);
check (p1, p2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/declare_target-4.c
|
#pragma omp parallel for reduction(+:tmp)
| 100
|
tmp;
}
float accum (int k)
{
int i;
float tmp = 0.0;
#pragma omp target map(tofrom:tmp)
<LOOP-START>for (i = 0; i < N; i++)
tmp += Pfun (i, k);
return tmp;
}
void check (float a, float b)
{
float err = (b == 0.0) ? a : (a - b) / b;
if (((err > 0) ? err : -err) > EPS)
abort ();
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:tmp)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_update-1.c
|
#pragma omp parallel for
| 100
|
#pragma omp target data map(to: v1[:N], v2[:N]) map(from: p[0:N])
{
#pragma omp target
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
init_again (v1, v2, N);
#pragma omp target update to(v1[:N], v2[:N])
#pragma omp target
#pragma omp parallel for
for (i = 0; i < N; i++)
p[i] = p[i] + (v1[i] * v2[i]);
}
}
int main ()
{
int *p1 = (int *) malloc (MAX * sizeof (int));
int *p2 = (int *) malloc (MAX * sizeof (int));
int *v1 = (int *) malloc (MAX * sizeof (int));
int *v2 = (int *) malloc (MAX * sizeof (int));
vec_mult_ref (p1, v1, v2, MAX);
vec_mult (p2, v1, v2, MAX);
check (p1, p2, MAX);
free (p1);
free (p2);
free (v1);
free (v2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_update-1.c
|
#pragma omp parallel for
| 100
|
t_again (v1, v2, N);
#pragma omp target update to(v1[:N], v2[:N])
#pragma omp target
<LOOP-START>for (i = 0; i < N; i++)
p[i] = p[i] + (v1[i] * v2[i]);
}
}
int main ()
{
int *p1 = (int *) malloc (MAX * sizeof (int));
int *p2 = (int *) malloc (MAX * sizeof (int));
int *v1 = (int *) malloc (MAX * sizeof (int));
int *v2 = (int *) malloc (MAX * sizeof (int));
vec_mult_ref (p1, v1, v2, MAX);
vec_mult (p2, v1, v2, MAX);
check (p1, p2, MAX);
free (p1);
free (p2);
free (v1);
free (v2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/declare_target-3.c
|
#pragma omp parallel for
| 100
|
];
}
void vec_mult ()
{
int i;
#pragma omp target update to(v1, v2)
#pragma omp target
<LOOP-START>for (i = 0; i < N; i++)
p2[i] = v1[i] * v2[i];
#pragma omp target update from(p2)
}
int main ()
{
init ();
vec_mult_ref ();
vec_mult ();
check ();
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/async_target-1.c
|
#pragma omp parallel for
| 100
|
(C = 0; C < N; C += CHUNKSZ)
{
#pragma omp task
#pragma omp target map(Z[C:CHUNKSZ])
<LOOP-START>for (i = C; i < C + CHUNKSZ; i++)
Z[i] = F (Z[i]);
}
#pragma omp taskwait
}
void init ()
{
int i;
for (i = 0; i < N; i++)
Y[i] = Z[i] = 0.1 * i;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target-1.c
|
#pragma omp parallel for
| 100
|
ult (int *p)
{
int i;
int v1[N], v2[N];
init (v1, v2);
#pragma omp target map(p[0:N])
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
}
int main ()
{
int p1[N], p2[N];
int v1[N], v2[N];
init (v1, v2);
vec_mult_ref (p1);
vec_mult (p2);
check (p1, p2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/teams-2.c
|
#pragma omp parallel for reduction(+:sum)
| 100
|
\
reduction(+:sum)
#pragma omp distribute
for (i0 = 0; i0 < n; i0 += block_size)
<LOOP-START>for (i = i0; i < ((i0 + block_size > n) ? n : i0 + block_size); i++)
sum += B[i] * C[i];
return sum;
}
void check (float a, float b)
{
float err = (b == 0.0) ? a : (a - b) / b;
if (((err > 0) ? err : -err) > EPS)
abort ();
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_data-6.c
|
#pragma omp parallel for
| 100
|
rget if (N > THRESHOLD) map(to: v1[:N], v2[:N])
{
if (omp_is_initial_device ())
abort;
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
}
init_again (v1, v2, N);
#pragma omp target if (N > THRESHOLD) map(to: v1[:N], v2[:N])
{
if (omp_is_initial_device ())
abort ();
#pragma omp parallel for
for (i = 0; i < N; i++)
p[i] = p[i] + (v1[i] * v2[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_data-6.c
|
#pragma omp parallel for
| 100
|
t if (N > THRESHOLD) map(to: v1[:N], v2[:N])
{
if (omp_is_initial_device ())
abort ();
<LOOP-START>for (i = 0; i < N; i++)
p[i] = p[i] + (v1[i] * v2[i]);
}
}
}
int main ()
{
float *p1 = (float *) malloc (MAX * sizeof (float));
float *p2 = (float *) malloc (MAX * sizeof (float));
float *v1 = (float *) malloc (MAX * sizeof (float));
float *v2 = (float *) malloc (MAX * sizeof (float));
vec_mult_ref (p1, v1, v2, MAX);
vec_mult (p2, v1, v2, MAX);
check (p1, p2, MAX);
free (p1);
free (p2);
free (v1);
free (v2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target-4.c
|
#pragma omp parallel for
| 100
|
ble *v1, double *v2)
{
int i;
#pragma omp target map(to: v1[0:N], v2[:N]) map(from: p[0:N])
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
}
int main ()
{
double p1[N], p2[N];
double v1[N], v2[N];
init (v1, v2);
vec_mult_ref (p1, v1, v2);
vec_mult (p2, v1, v2);
check (p1, p2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/async_target-2.c
|
#pragma omp parallel for
| 100
|
omp target map(to: v1, v2) map(from: p[0:n])
{
if (omp_is_initial_device ())
abort ();
<LOOP-START>for (i = 0; i < n; i++)
p[i] = v1[i] * v2[i];
free (v1);
free (v2);
}
#pragma omp taskwait
}
void check (float *a, float *b, int n)
{
int i;
for (i = 0 ; i < n ; i++)
{
float err = (a[i] == 0.0) ? b[i] : (b[i] - a[i]) / a[i];
if (((err > 0) ? err : -err) > EPS)
abort ();
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target-3.c
|
#pragma omp parallel for
| 100
|
int i;
long long v1[N], v2[N];
init (v1, v2);
#pragma omp target map(v1, v2, p[0:N])
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
}
int main ()
{
long long p1[N], p2[N];
long long v1[N], v2[N];
init (v1, v2);
vec_mult_ref (p1);
vec_mult (p2);
check (p1, p2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_data-3.c
|
#pragma omp parallel for reduction(+:tmp)
| 100
|
:COLS)
for (k = 0; k < cols; k++)
{
int tmp = 0;
#pragma omp target map(tofrom:tmp)
<LOOP-START>for (i = 0; i < rows; i++)
tmp += (Q[i][k] * Q[i][k]);
#pragma omp target
#pragma omp parallel for
for (i = 0; i < rows; i++)
Q[i][k] *= tmp;
}
}
int main ()
{
int (*Q1)[COLS] = (int(*)[COLS]) malloc (ROWS * COLS * sizeof (int));
int (*Q2)[COLS] = (int(*)[COLS]) malloc (ROWS * COLS * sizeof (int));
init (Q1, ROWS, COLS);
init (Q2, ROWS, COLS);
gramSchmidt_ref (Q1, ROWS, COLS);
gramSchmidt (Q2, ROWS, COLS);
check (Q1, Q2, ROWS, COLS);
free (Q1);
free (Q2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:tmp)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_data-3.c
|
#pragma omp parallel for
| 100
|
n(+:tmp)
for (i = 0; i < rows; i++)
tmp += (Q[i][k] * Q[i][k]);
#pragma omp target
<LOOP-START>for (i = 0; i < rows; i++)
Q[i][k] *= tmp;
}
}
int main ()
{
int (*Q1)[COLS] = (int(*)[COLS]) malloc (ROWS * COLS * sizeof (int));
int (*Q2)[COLS] = (int(*)[COLS]) malloc (ROWS * COLS * sizeof (int));
init (Q1, ROWS, COLS);
init (Q2, ROWS, COLS);
gramSchmidt_ref (Q1, ROWS, COLS);
gramSchmidt (Q2, ROWS, COLS);
check (Q1, Q2, ROWS, COLS);
free (Q1);
free (Q2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_update-2.c
|
#pragma omp parallel for
| 100
|
data map(to: v1[:N], v2[:N]) map(from: p[0:N])
{
int changed;
#pragma omp target
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
changed = maybe_init_again (v1, N);
#pragma omp target update if (changed) to(v1[:N])
changed = maybe_init_again (v2, N);
#pragma omp target update if (changed) to(v2[:N])
#pragma omp target
#pragma omp parallel for
for (i = 0; i < N; i++)
p[i] = p[i] + (v1[i] * v2[i]);
}
}
int main ()
{
int *p = (int *) malloc (MAX * sizeof (int));
int *p1 = (int *) malloc (MAX * sizeof (int));
int *v1 = (int *) malloc (MAX * sizeof (int));
int *v2 = (int *) malloc (MAX * sizeof (int));
vec_mult_ref (p, v1, v2, MAX);
vec_mult (p1, v1, v2, MAX);
check (p, p1, MAX);
free (p);
free (p1);
free (v1);
free (v2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_update-2.c
|
#pragma omp parallel for
| 100
|
t_again (v2, N);
#pragma omp target update if (changed) to(v2[:N])
#pragma omp target
<LOOP-START>for (i = 0; i < N; i++)
p[i] = p[i] + (v1[i] * v2[i]);
}
}
int main ()
{
int *p = (int *) malloc (MAX * sizeof (int));
int *p1 = (int *) malloc (MAX * sizeof (int));
int *v1 = (int *) malloc (MAX * sizeof (int));
int *v2 = (int *) malloc (MAX * sizeof (int));
vec_mult_ref (p, v1, v2, MAX);
vec_mult (p1, v1, v2, MAX);
check (p, p1, MAX);
free (p);
free (p1);
free (v1);
free (v2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_data-7.c
|
#pragma omp parallel for
| 100
|
get if (N > THRESHOLD) map(to: v1[:N], v2[:N])
{
if (omp_is_initial_device ())
abort ();
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
}
}
int main ()
{
short *p1 = (short *) malloc (MAX * sizeof (short));
short *p2 = (short *) malloc (MAX * sizeof (short));
short *v1 = (short *) malloc (MAX * sizeof (short));
short *v2 = (short *) malloc (MAX * sizeof (short));
init (v1, v2, MAX);
vec_mult_ref (p1, v1, v2, MAX);
vec_mult (p2, v1, v2, MAX);
check (p1, p2, MAX);
free (p1);
free (p2);
free (v1);
free (v2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/declare_target-5.c
|
#pragma omp parallel for reduction(+:tmp)
| 100
|
n tmp;
}
float accum ()
{
int i, k;
float tmp = 0.0;
#pragma omp target map(tofrom:tmp)
<LOOP-START>for (i = 0; i < N; i++)
{
float tmp1 = 0.0;
#pragma omp simd reduction(+:tmp1)
for (k = 0; k < M; k++)
tmp1 += Pfun(i,k);
tmp += tmp1;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:tmp)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target-5.c
|
#pragma omp parallel for if(N > THRESHOLD2)
| 100
|
:N], v2[:N]) \
map(from: p[0:N])
{
if (omp_is_initial_device ())
abort ();
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
}
}
int main ()
{
float p1[N], p2[N];
float v1[N], v2[N];
init (v1, v2);
vec_mult_ref (p1, v1, v2);
vec_mult (p2, v1, v2);
check (p1, p2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for if(N > THRESHOLD2)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_data-2.c
|
#pragma omp parallel for
| 100
|
#pragma omp target data map(from: p[0:N])
{
#pragma omp target map(to: v1[:N], v2[:N])
<LOOP-START>for (i = 0; i < N; i++)
p[i] = v1[i] * v2[i];
init_again (v1, v2, N);
#pragma omp target map(to: v1[:N], v2[:N])
#pragma omp parallel for
for (i = 0; i < N; i++)
p[i] = p[i] + (v1[i] * v2[i]);
}
}
int main ()
{
char *p1 = (char *) malloc (MAX * sizeof (char));
char *p2 = (char *) malloc (MAX * sizeof (char));
char *v1 = (char *) malloc (MAX * sizeof (char));
char *v2 = (char *) malloc (MAX * sizeof (char));
vec_mult_ref (p1, v1, v2, MAX);
vec_mult (p2, v1, v2, MAX);
check (p1, p2, MAX);
free (p1);
free (p2);
free (v1);
free (v2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/HPDCS/ULMT-OpenMP-GCC/testsuite/libgomp.c/examples-4/target_data-2.c
|
#pragma omp parallel for
| 100
|
= v1[i] * v2[i];
init_again (v1, v2, N);
#pragma omp target map(to: v1[:N], v2[:N])
<LOOP-START>for (i = 0; i < N; i++)
p[i] = p[i] + (v1[i] * v2[i]);
}
}
int main ()
{
char *p1 = (char *) malloc (MAX * sizeof (char));
char *p2 = (char *) malloc (MAX * sizeof (char));
char *v1 = (char *) malloc (MAX * sizeof (char));
char *v2 = (char *) malloc (MAX * sizeof (char));
vec_mult_ref (p1, v1, v2, MAX);
vec_mult (p2, v1, v2, MAX);
check (p1, p2, MAX);
free (p1);
free (p2);
free (v1);
free (v2);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/andyfratello/PAR/Laboratori/Lab4/codesLab4/multisort-optional2.c
|
#pragma omp parallel for
| 100
|
basicsort(n, data);
}
}
static void initialize(long length, T data[length]) {
long i;
<LOOP-START>for (i = 0; i < length; i++) {
if (i==0) {
data[i] = rand();
} else {
data[i] = ((data[i-1]+1) * i * 104723L) % N;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/andyfratello/PAR/Laboratori/Lab4/codesLab4/multisort-optional2.c
|
#pragma omp parallel for
| 100
|
* 104723L) % N;
}
}
}
static void clear(long length, T data[length]) {
long i;
<LOOP-START>for (i = 0; i < length; i++) {
data[i] = 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/sine_x_estimation.c
|
#pragma omp parallel for shared(sum)
| 100
|
double itime, ftime, timetaken;
itime = omp_get_wtime();
rads = x * (3.1415 / 180);
<LOOP-START>for (i = 1; i <= 15; i++)
{
intm_value = pow(rads, j) / fact(j);
sign = 1;
if (i % 2 == 0)
{
sign = -1;
}
sum += (sign * intm_value);
j = j + 2;
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/armstrong_num.c
|
#pragma omp parallel for schedule(dynamic) private(num,res,rem)
| 100
|
rds = omp_get_max_threads();
omp_set_num_threads(max_thrds);
int i, j, num, flag,rem,res;
<LOOP-START>for (i = 2; i < 1000; i++)
{
rem=0,res=0;
num=i;
while (num != 0) {
rem = num % 10;
res += (rem * rem * rem);
num /= 10;
}
if (res == i){
int tid = omp_get_thread_num();
printf("%d is Armstrong number from thread-%d\n",i,tid);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(dynamic) private(num,res,rem)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/pi_estimation_integration.c
|
#pragma omp parallel for schedule(dynamic) reduction(+: area) private(x, y, i, dx)
| 100
|
itime = omp_get_wtime();
int iters = 10000000;
dx = 1.0 / (double)iters;
x = dx;
<LOOP-START>for (i = 1; i < iters; i++)
{
dx = 1.0 / (double)iters;
x = (double)i * dx;
y = sqrt((double)1.0 - (pow(x, 2)));
area += dx * y;
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(dynamic) reduction(+: area) private(x, y, i, dx)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/cosine_x_estimation.c
|
#pragma omp parallel for shared(sum)
| 100
|
ftime, timetaken;
itime = omp_get_wtime();
rads = x * (3.1415 / 180);
sum = 1.0;
<LOOP-START>for (i = 1; i <= 15; i++)
{
intm_value = pow(rads, j) / fact(j);
sign = 1;
if (i % 2 != 0)
{
sign = -1;
}
sum += (sign * intm_value);
j = j + 2;
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/histogram_plotting.c
|
#pragma omp parallel for private(i)
| 100
|
me = omp_get_wtime();
// Generating random float data
printf("Random Float data\n");
srand(0);
<LOOP-START>for (i = 0; i < n; i++)
{
float random = ((float)rand() / (float)(RAND_MAX));
float_arr[i] = random;
printf("%f ", random);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/histogram_plotting.c
|
#pragma omp parallel for
| 100
|
ndom = ((float)rand() / (float)(RAND_MAX));
float_arr[i] = random;
printf("%f ", random);
}
<LOOP-START>for (i = 0; i <= bins; i++)
hist[i] = 0;
//Dividing float data into bins
#pragma omp parallel for schedule(dynamic) private(i, j)
for (i = 0; i < n; i++)
{
for (j = 1; j <= bins; j++)
{
float bin_max = (float)j / (float)bins;
if (float_arr[i] <= bin_max)
{
hist[j]++;
break;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/histogram_plotting.c
|
#pragma omp parallel for schedule(dynamic) private(i, j)
| 100
|
omp parallel for
for (i = 0; i <= bins; i++)
hist[i] = 0;
//Dividing float data into bins
<LOOP-START>for (i = 0; i < n; i++)
{
for (j = 1; j <= bins; j++)
{
float bin_max = (float)j / (float)bins;
if (float_arr[i] <= bin_max)
{
hist[j]++;
break;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(dynamic) private(i, j)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/prime_num_sum.c
|
#pragma omp parallel for schedule(dynamic) shared(primesum, arr) private(num, j, flag)
| 100
|
tial Array Declaration:\n");
for (i = 0; i < 6; i++){
printf("%d ", arr[i]);
}
<LOOP-START>for (i = 0; i < 6; i++){
num = arr[i];
flag = 1;
for (j = 2; j < num; j++){
if (num % j == 0){
flag = 0;
}
}
if (flag == 1){
#pragma omp critical
primesum = primesum + num;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(dynamic) shared(primesum, arr) private(num, j, flag)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Sorting/selection_sort.c
|
#pragma omp parallel for schedule(dynamic) private(j)
| 100
|
e();
// Selection Sort
int i, j, t, min_idx;
for (i = 0; i < n; i++)
{
min_idx = i;
<LOOP-START>for (j = i; j < n; j++)
{
if (arr[j] < arr[min_idx]){
min_idx=j;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(dynamic) private(j)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Sorting/bucket_sort.c
|
#pragma omp parallel for
| 100
|
intf("%d ", arr[x]);
}
itime = omp_get_wtime();
int i, b, bi = -1, bj = -1, bk = -1, bl = -1;
<LOOP-START>for (i = 0; i < n; i++)
{
b = arr[i] / numbuc;
if (b == 0)
{
bucket[b][++bi] = arr[i];
}
else if (b == 1)
{
bucket[b][++bj] = arr[i];
}
else if (b == 2)
{
bucket[b][++bk] = arr[i];
}
if (b == 3)
{
bucket[b][++bl] = arr[i];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Matrices/matrix_sum.c
|
#pragma omp parallel for
| 100
|
printf("%d ", mat2[i][j]);
}
printf("\n");
}
omp_set_num_threads(5);
<LOOP-START>for (i = 0; i < 3; i++){
for (j = 0; j < 3; j++){
sum[i][j] = mat1[i][j] + mat2[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Matrices/matrix_difference.c
|
#pragma omp parallel for
| 100
|
printf("%d ", mat2[i][j]);
}
printf("\n");
}
omp_set_num_threads(5);
<LOOP-START>for (i = 0; i < 3; i++){
for (j = 0; j < 3; j++){
diff[i][j] = mat1[i][j] - mat2[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Matrices/matrix_col_sum.c
|
#pragma omp parallel for shared(col_sum)
| 100
|
printf("%d ", mat[i][j]);
}
printf("\n");
}
omp_set_num_threads(5);
<LOOP-START>for (i = 0; i < 3; i++){
col_sum[i] = 0;
for (j = 0; j < 3; j++){
col_sum[i] += mat[j][i];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(col_sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Matrices/matrix_multiplication.c
|
#pragma omp parallel for
| 100
|
intf("%d ", mat2[i][j]);
}
printf("\n");
}
omp_set_num_threads(5);
<LOOP-START>for (i = 0; i < 3; i++){
for (j = 0; j < 3; j++){
sum[i][j] = 0;
for (k = 0; k < 3; k++){
sum[i][j] += mat1[i][k] * mat2[k][j];
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Matrices/matrix_row_sum.c
|
#pragma omp parallel for shared(row_sum)
| 100
|
printf("%d ", mat[i][j]);
}
printf("\n");
}
omp_set_num_threads(15);
<LOOP-START>for (i = 0; i < 3; i++){
row_sum[i] = 0;
for (j = 0; j < 3; j++){
row_sum[i] += mat[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(row_sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Constructs/ordered_construct.c
|
#pragma omp parallel for ordered schedule(dynamic)
| 100
|
= {1, 2, 3, 4, 5};
int i;
printf("\nPrinting array elements using ordered construct\n");
<LOOP-START>for (i = 0; i < 5; i++)
{
#pragma omp ordered
printf("%d ", arr[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered schedule(dynamic)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Constructs/atomic_construct.c
|
#pragma omp parallel for shared(x)
| 100
|
nInitial Declaration:\n");
for (i = 0; i < 5; i++){
printf("%d ", stack[i]);
}
<LOOP-START>for(i = 0; i < 5; i++)
{
#pragma omp atomic write
x[i] = x[0]*2*i;
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(x)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Arrays/array_linear_search.c
|
#pragma omp parallel for
| 100
|
0; i < n; i++)
{
printf("%d ",arr[i]);
}
printf("\nTarget : %d",target);
<LOOP-START>for (i = 0; i < n; i++)
{
if (arr[i]==target){
index=i;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Arrays/array_factorial.c
|
#pragma omp parallel for
| 100
|
printf("\nArray of number:\n");
for(i=0;i<10;i++){
printf("%d ",arr[i]);
}
<LOOP-START>for(i=0;i<10;i++)
{
num = arr[i];
fact=1;
for(j=1;j<=num;j++)
{
fact*=j;
}
printf("\nFactorial of %d is %d from thread-%d",num,fact,omp_get_thread_num());
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Arrays/operation_on_array.c
|
#pragma omp parallel for ordered schedule(dynamic)
| 100
|
tial Array Declaration:\n");
for (i = 0; i < 5; i++){
printf("%d ", arr[i]);
}
<LOOP-START>for (i = 0; i < 5; i++){
arr[i] = arr[i] * 5;
arr[i] = arr[i] + 3;
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered schedule(dynamic)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Arrays/array_evenodd_count.c
|
#pragma omp parallel for schedule(dynamic) shared(e, o)
| 100
|
ial Array Declaration:\n");
for (i = 0; i < 10; i++){
printf("%d ", arr[i]);
}
<LOOP-START>for (i = 0; i < 10; i++){
if (arr[i] % 2 == 0)
e++;
else
o++;
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(dynamic) shared(e, o)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Arrays/array_squares_cubes_sum.c
|
#pragma omp parallel for schedule(dynamic) shared(ssquares, scubes)
| 100
|
tial Array Declaration:\n");
for (i = 0; i < 9; i++){
printf("%d ", arr[i]);
}
<LOOP-START>for (i = 0; i < 9; i++){
ssquares += pow(arr[i], 2);
scubes += pow(arr[i], 3);
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(dynamic) shared(ssquares, scubes)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Arrays/array_sum.c
|
#pragma omp parallel for schedule(dynamic) shared(sum)
| 100
|
tial Array Declaration:\n");
for (i = 0; i < 5; i++){
printf("%d ", arr[i]);
}
<LOOP-START>for (i = 0; i < 5; i++){
sum += arr[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(dynamic) shared(sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/Defcon27/Parallel-Computing-in-C-using-OpenMP/Arrays/array_min_max.c
|
#pragma omp parallel for schedule(dynamic)
| 100
|
tial Array Declaration:\n");
for (i = 0; i < 9; i++){
printf("%d ", arr[i]);
}
<LOOP-START>for (i = 0; i < 9; i++){
if (arr[i] > max_)
max_ = arr[i];
if ((arr[i]) < min_)
min_ = arr[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for schedule(dynamic)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/ysh329/OpenMP-101/relu/relu.c
|
#pragma omp parallel for
| 100
|
s);
int nthreads = omp_get_num_threads();
printf("Number of threads = %d\n", nthreads);
<LOOP-START>for(int idx=0; idx<len; ++idx)
{
res[idx] = x[idx]>0 ? x[idx] : 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/ysh329/OpenMP-101/Mattson_OMP_exercise/mandel.c
|
#pragma omp parallel for default(shared) private(c,eps)
| 100
|
ntains the Mandelbrot set,
// testing each point to see whether it is inside or outside the set.
<LOOP-START>for (i=0; i<NPOINTS; i++) {
for (j=0; j<NPOINTS; j++) {
c.r = -2.0+2.5*(double)(i)/(double)(NPOINTS)+eps;
c.i = 1.125*(double)(j)/(double)(NPOINTS)+eps;
testpoint();
}
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) private(c,eps)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/ysh329/OpenMP-101/Mattson_OMP_exercise/pi_mc.c
|
#pragma omp parallel for private(x,y,test) reduction(+:Ncirc)
| 100
|
rcle. Side of squrare is 2*r
seed(-r, r); // The circle and square are centered at the origin
<LOOP-START>for(i=0;i<num_trials; i++)
{
x = drandom();
y = drandom();
test = x*x + y*y;
if (test <= r*r) Ncirc++;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(x,y,test) reduction(+:Ncirc)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/ysh329/OpenMP-101/Mattson_OMP_exercise/solutions/matmul_par.c
|
#pragma omp parallel for private(tmp, i, j, k)
| 100
|
im; j++)
*(C+(i*Ndim+j)) = 0.0;
start_time = omp_get_wtime();
/* Do the matrix product */
<LOOP-START>for (i=0; i<Ndim; i++){
for (j=0; j<Mdim; j++){
tmp = 0.0;
for(k=0;k<Pdim;k++){
/* C(i,j) = sum(over k) A(i,k) * B(k,j) */
tmp += *(A+(i*Ndim+k)) * *(B+(k*Pdim+j));
}
*(C+(i*Ndim+j)) = tmp;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(tmp, i, j, k) <OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/ysh329/OpenMP-101/Mattson_OMP_exercise/solutions/mandel_par.c
|
#pragma omp parallel for default(shared) firstprivate(eps) private(c, j)
| 100
|
// testing each point to see whether it is inside or outside the set.
omp_set_num_threads(4);
<LOOP-START>for (i=0; i<NPOINTS; i++) {
for (j=0; j<NPOINTS; j++) {
c.r = -2.0+2.5*(double)(i)/(double)(NPOINTS)+eps;
c.i = 1.125*(double)(j)/(double)(NPOINTS)+eps;
testpoint(c);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for default(shared) firstprivate(eps) private(c, j)<OMP-END>
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.