filename stringlengths 19 182 | omp_pragma_line stringlengths 24 416 | context_chars int64 100 100 | text stringlengths 152 177k |
|---|---|---|---|
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB022-reductionmissing-var-yes.c | #pragma omp parallel for private (j) | 100 | t u[len][len];
#pragma omp parallel for private (i,j)
for (i = 0; i <= len - 1; i += 1) {
<LOOP-START>for (j = 0; j <= len - 1; j += 1) {
u[i][j] = 0.5;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB022-reductionmissing-var-yes.c | #pragma omp parallel for private (temp,i,j) reduction (+:sum) firstprivate (len) | 100 | parallel for private (j)
for (j = 0; j <= len - 1; j += 1) {
u[i][j] = 0.5;
}
}
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
#pragma omp parallel for private (temp,j) reduction (+:sum)
for (j = 0; j <= len - 1; j += 1) {
temp = u[i][j];
sum = sum + temp * temp;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (temp,i,j) reduction (+:sum) firstprivate (len)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB022-reductionmissing-var-yes.c | #pragma omp parallel for private (temp,j) reduction (+:sum) | 100 | private (temp,i,j) reduction (+:sum) firstprivate (len)
for (i = 0; i <= len - 1; i += 1) {
<LOOP-START>for (j = 0; j <= len - 1; j += 1) {
temp = u[i][j];
sum = sum + temp * temp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (temp,j) reduction (+:sum)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB053-inneronly1-orig-no.c | #pragma omp parallel for private (i,j) | 100 | int main(int argc,char *argv[])
{
int i;
int j;
double a[20][20];
memset(a,0,sizeof(a));
<LOOP-START>for (i = 0; i <= 19; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 19; j += 1) {
a[i][j] += (i + j) + 0.1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB053-inneronly1-orig-no.c | #pragma omp parallel for private (j) | 100 | set(a,0,sizeof(a));
#pragma omp parallel for private (i,j)
for (i = 0; i <= 19; i += 1) {
<LOOP-START>for (j = 0; j <= 19; j += 1) {
a[i][j] += (i + j) + 0.1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB053-inneronly1-orig-no.c | #pragma omp parallel for private (j) | 100 | j <= 19; j += 1) {
a[i][j] += (i + j) + 0.1;
}
}
for (i = 0; i <= 18; i += 1) {
<LOOP-START>for (j = 0; j <= 19; j += 1) {
a[i][j] += a[i + 1][j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB071-targetparallelfor-orig-no.c | #pragma omp parallel for private (i) | 100 | */
#include <omp.h>
int main(int argc,char *argv[])
{
int i;
int len = 1000;
int a[len];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB071-targetparallelfor-orig-no.c | #pragma omp parallel for private (i) | 100 |
#pragma omp parallel for private (i)
for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = a[i] + 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB034-truedeplinear-var-yes.c | #pragma omp parallel for private (i) | 100 | ar *argv[])
{
int i;
int len = 2000;
if (argc > 1)
len = atoi(argv[1]);
int a[len];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB109-orderedmissing-orig-yes.c | #pragma omp parallel for reduction (+:x) | 100 | d clause
* Data race pair: x@56:5 vs. x@56:5
* */
#include <omp.h>
int main()
{
int x = 0;
<LOOP-START>for (int i = 0; i <= 99; i += 1) {
x++;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:x)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB008-indirectaccess4-orig-yes.c | #pragma omp parallel for private (i) | 100 | ouble *xa1 = base;
double *xa2 = xa1 + 12;
int i;
// initialize segments touched by indexSet
<LOOP-START>for (i = 521; i <= 2025; i += 1) {
base[i] = 0.5 * i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB002-antidep1-var-yes.c | #pragma omp parallel for private (i) | 100 | ar *argv[])
{
int i;
int len = 1000;
if (argc > 1)
len = atoi(argv[1]);
int a[len];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB093-doall2-collapse-orig-no.c | #pragma omp parallel for private (i,j) | 100 | ivate.
*/
#include <stdio.h>
#include <omp.h>
int a[100][100];
int main()
{
int i;
int j;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = i;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB093-doall2-collapse-orig-no.c | #pragma omp parallel for private (j) | 100 | {
int i;
int j;
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
a[i][j] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB093-doall2-collapse-orig-no.c | #pragma omp parallel for private (i,j) | 100 | gma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = i;
}
}
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = a[i][j] + 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB093-doall2-collapse-orig-no.c | #pragma omp parallel for private (j) | 100 | ][j] = i;
}
}
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
a[i][j] = a[i][j] + 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB110-ordered-orig-no.c | #pragma omp parallel for reduction (+:x) | 100 | f ordered directive and clause, no data races
* */
#include <omp.h>
int main()
{
int x = 0;
<LOOP-START>for (int i = 0; i <= 99; i += 1) {
x++;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction (+:x)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB064-outeronly2-orig-no.c | #pragma omp parallel for private (i,j) firstprivate (n,m) | 100 | <omp.h>
int n = 100;
int m = 100;
double b[100][100];
int init()
{
int i;
int j;
int k;
<LOOP-START>for (i = 0; i <= n - 1; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= m - 1; j += 1) {
b[i][j] = (i * j);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j) firstprivate (n,m)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB064-outeronly2-orig-no.c | #pragma omp parallel for private (j) | 100 |
#pragma omp parallel for private (i,j) firstprivate (n,m)
for (i = 0; i <= n - 1; i += 1) {
<LOOP-START>for (j = 0; j <= m - 1; j += 1) {
b[i][j] = (i * j);
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB064-outeronly2-orig-no.c | #pragma omp parallel for private (i,j) firstprivate (n,m) | 100 | 1) {
b[i][j] = (i * j);
}
}
return 0;
}
void foo(int n,int m)
{
int i;
int j;
<LOOP-START>for (i = 0; i <= n - 1; i += 1) {
// Be careful about bounds of j
for (j = 1; j <= m - 1; j += 1) {
b[i][j] = b[i][j - 1];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j) firstprivate (n,m)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB059-lastprivate-orig-no.c | #pragma omp parallel for private (i) lastprivate (x) | 100 | thin the last iteration.
*/
#include <stdio.h>
#include <omp.h>
void foo()
{
int i;
int x;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
x = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) lastprivate (x)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB037-truedepseconddimension-orig-yes.c | #pragma omp parallel for private (i,j) | 100 | 000][1000];
int main(int argc,char *argv[])
{
int i;
int j;
int n = 1000;
int m = 1000;
<LOOP-START>for (i = 0; i <= n - 1; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= m - 1; j += 1) {
b[i][j] = (i + j);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB037-truedepseconddimension-orig-yes.c | #pragma omp parallel for private (j) | 100 |
int m = 1000;
#pragma omp parallel for private (i,j)
for (i = 0; i <= n - 1; i += 1) {
<LOOP-START>for (j = 0; j <= m - 1; j += 1) {
b[i][j] = (i + j);
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB037-truedepseconddimension-orig-yes.c | #pragma omp parallel for private (i,j) firstprivate (n,m) | 100 | arallel for private (j)
for (j = 0; j <= m - 1; j += 1) {
b[i][j] = (i + j);
}
}
<LOOP-START>for (i = 0; i <= n - 1; i += 1) {
for (j = 1; j <= m - 1; j += 1) {
b[i][j] = b[i][j - 1];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j) firstprivate (n,m)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB114-if-orig-yes.c | #pragma omp parallel for private (i) | 100 | .h>
#include <omp.h>
int main(int argc,char *argv[])
{
int i;
int len = 100;
int a[100];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB001-antidep1-orig-yes.c | #pragma omp parallel for private (i) | 100 | >
#include <omp.h>
int main(int argc,char *argv[])
{
int i;
int len = 1000;
int a[1000];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB024-simdtruedep-orig-yes.c | #pragma omp parallel for private (i) | 100 | omp.h>
int main(int argc,char *argv[])
{
int i;
int len = 100;
int a[100];
int b[100];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
b[i] = i + 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB091-threadprivate2-orig-no.c | #pragma omp parallel for private (i) reduction (+:sum0) | 100 | <omp.h>
int sum0 = 0;
int sum1 = 0;
int main()
{
int len = 1000;
int i;
int sum = 0;
{
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
sum0 = sum0 + i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) reduction (+:sum0)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB091-threadprivate2-orig-no.c | #pragma omp parallel for private (i) reduction (+:sum1) firstprivate (len) | 100 | - 1; i += 1) {
sum0 = sum0 + i;
}
}
sum = sum + sum0;
/* reference calculation */
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
sum1 = sum1 + i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) reduction (+:sum1) firstprivate (len)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB095-doall2-taskloop-orig-yes.c | #pragma omp parallel for private (i,j) | 100 | e pair.
*/
#include <stdio.h>
#include <omp.h>
int a[100][100];
int main()
{
int i;
int j;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = i + j;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB095-doall2-taskloop-orig-yes.c | #pragma omp parallel for private (j) | 100 | {
int i;
int j;
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
a[i][j] = i + j;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB095-doall2-taskloop-orig-yes.c | #pragma omp parallel for private (i,j) | 100 | omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = i + j;
}
}
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] += 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB095-doall2-taskloop-orig-yes.c | #pragma omp parallel for private (j) | 100 | = i + j;
}
}
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
a[i][j] += 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB054-inneronly2-orig-no.c | #pragma omp parallel for private (i,j) | 100 | include <omp.h>
int main()
{
int i;
int j;
int n = 100;
int m = 100;
double b[n][m];
<LOOP-START>for (i = 0; i <= n - 1; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= n - 1; j += 1) {
b[i][j] = ((double )(i * j));
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB054-inneronly2-orig-no.c | #pragma omp parallel for private (j) | 100 | double b[n][m];
#pragma omp parallel for private (i,j)
for (i = 0; i <= n - 1; i += 1) {
<LOOP-START>for (j = 0; j <= n - 1; j += 1) {
b[i][j] = ((double )(i * j));
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB054-inneronly2-orig-no.c | #pragma omp parallel for private (j) | 100 | 1; j += 1) {
b[i][j] = ((double )(i * j));
}
}
for (i = 1; i <= n - 1; i += 1) {
<LOOP-START>for (j = 1; j <= m - 1; j += 1) {
b[i][j] = b[i - 1][j - 1];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB018-plusplus-orig-yes.c | #pragma omp parallel for private (i) | 100 |
int input[1000];
int output[1000];
int main()
{
int i;
int inLen = 1000;
int outLen = 0;
<LOOP-START>for (i = 0; i <= inLen - 1; i += 1) {
input[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB097-target-teams-distribute-orig-no.c | #pragma omp parallel for private (i) | 100 | um = 0.0;
double sum2 = 0.0;
double a[len];
double b[len];
/*Initialize with some values*/
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = ((double )i) / 2.0;
b[i] = ((double )i) / 3.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB097-target-teams-distribute-orig-no.c | #pragma omp parallel for private (i,i2) reduction (+:sum) | 100 | i = 0; i <= len - 1; i += 1) {
a[i] = ((double )i) / 2.0;
b[i] = ((double )i) / 3.0;
}
<LOOP-START>for (i2 = 0; i2 <= len - 1; i2 += 256) {
#pragma omp parallel for private (i) reduction (+:sum)
for (i = i2; i <= ((i2 + 256 < len?i2 + 256 : len)) - 1; i += 1) {
sum += a[i] * b[i];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,i2) reduction (+:sum)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB097-target-teams-distribute-orig-no.c | #pragma omp parallel for private (i) reduction (+:sum) | 100 | a omp parallel for private (i,i2) reduction (+:sum)
for (i2 = 0; i2 <= len - 1; i2 += 256) {
<LOOP-START>for (i = i2; i <= ((i2 + 256 < len?i2 + 256 : len)) - 1; i += 1) {
sum += a[i] * b[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) reduction (+:sum)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB097-target-teams-distribute-orig-no.c | #pragma omp parallel for private (i) reduction (+:sum2) firstprivate (len) | 100 | + 256 : len)) - 1; i += 1) {
sum += a[i] * b[i];
}
}
/* CPU reference computation */
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
sum2 += a[i] * b[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) reduction (+:sum2) firstprivate (len)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB084-threadprivatemissing-orig-yes.c | #pragma omp parallel for private (i) reduction (+:sum1) | 100 | or (i = 1; i <= 1000; i += 1) {
foo(i);
}
sum = sum + sum0;
/* reference calculation */
<LOOP-START>for (i = 1; i <= 1000; i += 1) {
sum1 = sum1 + i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) reduction (+:sum1)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB049-fprintf-orig-no.c | #pragma omp parallel for private (i) | 100 | ain(int argc,char *argv[])
{
int i;
int ret;
FILE *pfile;
int len = 1000;
int A[1000];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
A[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB099-targetparallelfor2-orig-no.c | #pragma omp parallel for private (i) | 100 |
int main(int argc,char *argv[])
{
int i;
int len = 1000;
double a[len];
double b[len];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = ((double )i) / 2.0;
b[i] = 0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB032-truedepfirstdimension-var-yes.c | #pragma omp parallel for private (i,j) | 100 | 0;
if (argc > 1)
len = atoi(argv[1]);
int n = len;
int m = len;
double b[len][len];
<LOOP-START>for (i = 0; i <= n - 1; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= m - 1; j += 1) {
b[i][j] = 0.5;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB032-truedepfirstdimension-var-yes.c | #pragma omp parallel for private (j) | 100 | ble b[len][len];
#pragma omp parallel for private (i,j)
for (i = 0; i <= n - 1; i += 1) {
<LOOP-START>for (j = 0; j <= m - 1; j += 1) {
b[i][j] = 0.5;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB032-truedepfirstdimension-var-yes.c | #pragma omp parallel for private (j) | 100 | = 0; j <= m - 1; j += 1) {
b[i][j] = 0.5;
}
}
for (i = 1; i <= n - 1; i += 1) {
<LOOP-START>for (j = 1; j <= m - 1; j += 1) {
b[i][j] = b[i - 1][j - 1];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB092-threadprivatemissing2-orig-yes.c | #pragma omp parallel for private (i) reduction (+:sum0) | 100 | 0 = 0;
int sum1 = 0;
//#pragma omp threadprivate(sum0)
int main()
{
int i;
int sum = 0;
{
<LOOP-START>for (i = 1; i <= 1000; i += 1) {
sum0 = sum0 + i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) reduction (+:sum0)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB092-threadprivatemissing2-orig-yes.c | #pragma omp parallel for private (i) reduction (+:sum1) | 100 | 000; i += 1) {
sum0 = sum0 + i;
}
}
sum = sum + sum0;
/* reference calculation */
<LOOP-START>for (i = 1; i <= 1000; i += 1) {
sum1 = sum1 + i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) reduction (+:sum1)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB061-matrixvector1-orig-no.c | #pragma omp parallel for private (i,j) | 100 |
double a[100][100];
double v[100];
double v_out[100];
int init()
{
int i;
int j;
int k;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = (i * j) + 0.01;
}
v_out[i] = (i * j) + 0.01;
v[i] = (i * j) + 0.01;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB061-matrixvector1-orig-no.c | #pragma omp parallel for private (j) | 100 | ;
int j;
int k;
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
a[i][j] = (i * j) + 0.01;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB061-matrixvector1-orig-no.c | #pragma omp parallel for private (i,j) | 100 | [i] = (i * j) + 0.01;
v[i] = (i * j) + 0.01;
}
return 0;
}
int mv()
{
int i;
int j;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
double sum = 0.0;
#pragma omp parallel for private (j) reduction (+:sum)
for (j = 0; j <= 99; j += 1) {
sum += a[i][j] * v[j];
}
v_out[i] = sum;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB061-matrixvector1-orig-no.c | #pragma omp parallel for private (j) reduction (+:sum) | 100 |
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
double sum = 0.0;
<LOOP-START>for (j = 0; j <= 99; j += 1) {
sum += a[i][j] * v[j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j) reduction (+:sum)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB026-targetparallelfor-orig-yes.c | #pragma omp parallel for private (i) | 100 | /
#include <omp.h>
int main(int argc,char *argv[])
{
int i;
int len = 1000;
int a[1000];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB094-doall2-ordered-orig-no.c | #pragma omp parallel for private (i,j) | 100 | ition.
*/
#include <stdio.h>
#include <omp.h>
int a[100][100];
int main()
{
int i;
int j;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = i + j;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB094-doall2-ordered-orig-no.c | #pragma omp parallel for private (j) | 100 | {
int i;
int j;
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
a[i][j] = i + j;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB010-lastprivatemissing-var-yes.c | #pragma omp parallel for private (i) lastprivate (x) firstprivate (len) | 100 | c,char *argv[])
{
int i;
int x;
int len = 10000;
if (argc > 1)
len = atoi(argv[1]);
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
x = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) lastprivate (x) firstprivate (len)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB065-pireduction-orig-no.c | #pragma omp parallel for private (x,i) reduction (+:pi) | 100 | ;
long i;
double x;
double interval_width;
interval_width = 1.0 / ((double )2000000000);
<LOOP-START>for (i = 0; i <= ((long )2000000000) - 1; i += 1) {
x = (i + 0.5) * interval_width;
pi += 1.0 / (x * x + 1.0);
}<LOOP-END> <OMP-START>#pragma omp parallel for private (x,i) reduction (+:pi)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB020-privatemissing-var-yes.c | #pragma omp parallel for private (i) | 100 | )
{
int i;
int tmp;
int len = 100;
if (argc > 1)
len = atoi(argv[1]);
int a[len];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB020-privatemissing-var-yes.c | #pragma omp parallel for private (tmp,i) | 100 |
#pragma omp parallel for private (i)
for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
tmp = a[i] + i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (tmp,i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB073-doall2-orig-yes.c | #pragma omp parallel for private (i,j) | 100 | d_set is a data race pair.
*/
#include <omp.h>
int a[100][100];
int main()
{
int i;
int j;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = i;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB073-doall2-orig-yes.c | #pragma omp parallel for private (j) | 100 | {
int i;
int j;
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
a[i][j] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB073-doall2-orig-yes.c | #pragma omp parallel for private (i,j) | 100 | gma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = i;
}
}
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = a[i][j] + 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB073-doall2-orig-yes.c | #pragma omp parallel for private (j) | 100 | ][j] = i;
}
}
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
a[i][j] = a[i][j] + 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB006-indirectaccess2-orig-yes.c | #pragma omp parallel for private (i) | 100 | ouble *xa1 = base;
double *xa2 = xa1 + 12;
int i;
// initialize segments touched by indexSet
<LOOP-START>for (i = 521; i <= 2025; i += 1) {
base[i] = 0.5 * i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB030-truedep1-var-yes.c | #pragma omp parallel for private (i) | 100 | har *argv[])
{
int i;
int len = 100;
if (argc > 1)
len = atoi(argv[1]);
int a[len];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB050-functionparameter-orig-no.c | #pragma omp parallel for private (i) firstprivate (len) | 100 | s function parameters
*/
#include <omp.h>
void foo1(double o1[],double c[],int len)
{
int i;
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
double volnew_o8 = 0.5 * c[i];
o1[i] = volnew_o8;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) firstprivate (len)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB050-functionparameter-orig-no.c | #pragma omp parallel for private (i) | 100 | = 0.5 * c[i];
o1[i] = volnew_o8;
}
}
double o1[100];
double c[100];
int main()
{
int i;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
c[i] = i + 1.01;
o1[i] = i + 1.01;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB098-simd2-orig-no.c | #pragma omp parallel for private (i,j) | 100 | t len = 100;
double a[len][len];
double b[len][len];
double c[len][len];
int i;
int j;
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= len - 1; j += 1) {
a[i][j] = ((double )i) / 2.0;
b[i][j] = ((double )i) / 3.0;
c[i][j] = ((double )i) / 7.0;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB098-simd2-orig-no.c | #pragma omp parallel for private (j) | 100 | nt i;
int j;
#pragma omp parallel for private (i,j)
for (i = 0; i <= len - 1; i += 1) {
<LOOP-START>for (j = 0; j <= len - 1; j += 1) {
a[i][j] = ((double )i) / 2.0;
b[i][j] = ((double )i) / 3.0;
c[i][j] = ((double )i) / 7.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB098-simd2-orig-no.c | #pragma omp parallel for private (i,j) firstprivate (len) | 100 | ble )i) / 2.0;
b[i][j] = ((double )i) / 3.0;
c[i][j] = ((double )i) / 7.0;
}
}
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= len - 1; j += 1) {
c[i][j] = a[i][j] * b[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j) firstprivate (len)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB098-simd2-orig-no.c | #pragma omp parallel for private (j) | 100 | pragma omp parallel for private (i,j) firstprivate (len)
for (i = 0; i <= len - 1; i += 1) {
<LOOP-START>for (j = 0; j <= len - 1; j += 1) {
c[i][j] = a[i][j] * b[i][j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB113-default-orig-no.c | #pragma omp parallel for private (i,j) | 100 | r option.
*/
#include <omp.h>
int a[100][100];
int b[100][100];
int main()
{
int i;
int j;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = i;
b[i][j] = i;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB113-default-orig-no.c | #pragma omp parallel for private (j) | 100 | {
int i;
int j;
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
a[i][j] = i;
b[i][j] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB113-default-orig-no.c | #pragma omp parallel for private (i,j) | 100 | r private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = i;
b[i][j] = i;
}
}
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = a[i][j] + 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB113-default-orig-no.c | #pragma omp parallel for private (j) | 100 | ][j] = i;
}
}
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
a[i][j] = a[i][j] + 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB113-default-orig-no.c | #pragma omp parallel for private (i,j) | 100 | rallel for private (j)
for (j = 0; j <= 99; j += 1) {
a[i][j] = a[i][j] + 1;
}
}
<LOOP-START>for (i = 0; i <= 99; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 99; j += 1) {
b[i][j] = b[i][j] + 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB113-default-orig-no.c | #pragma omp parallel for private (j) | 100 | ][j] + 1;
}
}
#pragma omp parallel for private (i,j)
for (i = 0; i <= 99; i += 1) {
<LOOP-START>for (j = 0; j <= 99; j += 1) {
b[i][j] = b[i][j] + 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private(i,j,xx,yy) | 100 |
int yy;
dx = 2.0 / (n - 1);
dy = 2.0 / (m - 1);
/* Initialize initial condition and RHS */
//<LOOP-START>#pragma omp parallel for private (xx,yy,i,j) firstprivate (n,m)
for (i = 0; i <= n - 1; i += 1) {
#pragma omp parallel for private (xx,yy,j) firstprivate (alpha,dx,dy)
for (j = 0; j <= m - 1; j += 1) {
/* -1 < x < 1 */
xx = ((int )(- 1.0 + dx * (i - 1)));
/* -1 < y < 1 */
yy = ((int )(- 1.0 + dy * (j - 1)));
u[i][j] = 0.0;
f[i][j] = - 1.0 * alpha * (1.0 - (xx * xx)) * (1.0 - (yy * yy)) - 2.0 * (1.0 - (xx * xx)) - 2.0 * (1.0 - (yy * yy));
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i,j,xx,yy)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private (xx,yy,i,j) firstprivate (n,m) | 100 | m - 1);
/* Initialize initial condition and RHS */
//#pragma omp parallel for private(i,j,xx,yy)
<LOOP-START>for (i = 0; i <= n - 1; i += 1) {
#pragma omp parallel for private (xx,yy,j) firstprivate (alpha,dx,dy)
for (j = 0; j <= m - 1; j += 1) {
/* -1 < x < 1 */
xx = ((int )(- 1.0 + dx * (i - 1)));
/* -1 < y < 1 */
yy = ((int )(- 1.0 + dy * (j - 1)));
u[i][j] = 0.0;
f[i][j] = - 1.0 * alpha * (1.0 - (xx * xx)) * (1.0 - (yy * yy)) - 2.0 * (1.0 - (xx * xx)) - 2.0 * (1.0 - (yy * yy));
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (xx,yy,i,j) firstprivate (n,m)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private (xx,yy,j) firstprivate (alpha,dx,dy) | 100 | ma omp parallel for private (xx,yy,i,j) firstprivate (n,m)
for (i = 0; i <= n - 1; i += 1) {
<LOOP-START>for (j = 0; j <= m - 1; j += 1) {
/* -1 < x < 1 */
xx = ((int )(- 1.0 + dx * (i - 1)));
/* -1 < y < 1 */
yy = ((int )(- 1.0 + dy * (j - 1)));
u[i][j] = 0.0;
f[i][j] = - 1.0 * alpha * (1.0 - (xx * xx)) * (1.0 - (yy * yy)) - 2.0 * (1.0 - (xx * xx)) - 2.0 * (1.0 - (yy * yy));
}<LOOP-END> <OMP-START>#pragma omp parallel for private (xx,yy,j) firstprivate (alpha,dx,dy)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private (i,j) | 100 | r = 10.0 * tol;
k = 1;
while(k <= mits){
error = 0.0;
/* Copy new solution into old */
<LOOP-START>for (i = 0; i <= n - 1; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= m - 1; j += 1) {
uold[i][j] = u[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private (j) | 100 | nto old */
#pragma omp parallel for private (i,j)
for (i = 0; i <= n - 1; i += 1) {
<LOOP-START>for (j = 0; j <= m - 1; j += 1) {
uold[i][j] = u[i][j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private (resid,i,j) reduction (+:error) | 100 | rivate (j)
for (j = 0; j <= m - 1; j += 1) {
uold[i][j] = u[i][j];
}
}
<LOOP-START>for (i = 1; i <= n - 1 - 1; i += 1) {
#pragma omp parallel for private (resid,j) reduction (+:error) firstprivate (omega,ax,ay,b)
for (j = 1; j <= m - 1 - 1; j += 1) {
resid = (ax * (uold[i - 1][j] + uold[i + 1][j]) + ay * (uold[i][j - 1] + uold[i][j + 1]) + b * uold[i][j] - f[i][j]) / b;
u[i][j] = uold[i][j] - omega * resid;
error = error + resid * resid;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private (resid,i,j) reduction (+:error)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private (resid,j) reduction (+:error) firstprivate (omega,ax,ay,b) | 100 | rallel for private (resid,i,j) reduction (+:error)
for (i = 1; i <= n - 1 - 1; i += 1) {
<LOOP-START>for (j = 1; j <= m - 1 - 1; j += 1) {
resid = (ax * (uold[i - 1][j] + uold[i + 1][j]) + ay * (uold[i][j - 1] + uold[i][j + 1]) + b * uold[i][j] - f[i][j]) / b;
u[i][j] = uold[i][j] - omega * resid;
error = error + resid * resid;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (resid,j) reduction (+:error) firstprivate (omega,ax,ay,b)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB070-simd1-orig-no.c | #pragma omp parallel for private (i) | 100 | zation directive
*/
#include <omp.h>
int a[100];
int b[100];
int c[100];
int main()
{
int i;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
a[i] = i * 40;
b[i] = i - 1;
c[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB070-simd1-orig-no.c | #pragma omp parallel for private (i) | 100 | vate (i)
for (i = 0; i <= 99; i += 1) {
a[i] = i * 40;
b[i] = i - 1;
c[i] = i;
}
<LOOP-START>for (i = 0; i <= 99; i += 1) {
a[i] = b[i] * c[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB090-static-local-orig-yes.c | #pragma omp parallel for private (i) | 100 | omp.h>
int main(int argc,char *argv[])
{
int i;
int len = 100;
int a[len];
int b[len];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
b[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB090-static-local-orig-yes.c | #pragma omp parallel for private (tmp,i) | 100 | a[i] = i;
b[i] = i;
}
/* static storage for a local variable */
{
static int tmp;
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
tmp = a[i] + i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (tmp,i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB090-static-local-orig-yes.c | #pragma omp parallel for private (tmp,i) firstprivate (len) | 100 | ] + i;
a[i] = tmp;
}
}
/* automatic storage for a local variable */
{
int tmp;
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
tmp = b[i] + i;
b[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (tmp,i) firstprivate (len)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB062-matrixvector2-orig-no.c | #pragma omp parallel for private (i,j) | 100 | uble a[1000][1000];
double v[1000];
double v_out[1000];
int init()
{
int i;
int j;
int k;
<LOOP-START>for (i = 0; i <= 999; i += 1) {
#pragma omp parallel for private (j)
for (j = 0; j <= 999; j += 1) {
a[i][j] = (i * j) + 0.01;
}
v_out[i] = (i * j) + 0.01;
v[i] = (i * j) + 0.01;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB062-matrixvector2-orig-no.c | #pragma omp parallel for private (j) | 100 |
int j;
int k;
#pragma omp parallel for private (i,j)
for (i = 0; i <= 999; i += 1) {
<LOOP-START>for (j = 0; j <= 999; j += 1) {
a[i][j] = (i * j) + 0.01;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB062-matrixvector2-orig-no.c | #pragma omp parallel for private (i,j) | 100 | i] = (i * j) + 0.01;
v[i] = (i * j) + 0.01;
}
return 0;
}
void mv()
{
int i;
int j;
<LOOP-START>for (i = 0; i <= 999; i += 1) {
double sum = 0.0;
#pragma omp parallel for private (j) reduction (+:sum)
for (j = 0; j <= 999; j += 1) {
sum += a[i][j] * v[j];
}
v_out[i] = sum;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i,j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB062-matrixvector2-orig-no.c | #pragma omp parallel for private (j) reduction (+:sum) | 100 | #pragma omp parallel for private (i,j)
for (i = 0; i <= 999; i += 1) {
double sum = 0.0;
<LOOP-START>for (j = 0; j <= 999; j += 1) {
sum += a[i][j] * v[j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j) reduction (+:sum)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB029-truedep1-orig-yes.c | #pragma omp parallel for private (i) | 100 | .h>
#include <omp.h>
int main(int argc,char *argv[])
{
int i;
int len = 100;
int a[100];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB111-linearmissing-orig-yes.c | #pragma omp parallel for private (i) | 100 | in()
{
int len = 100;
double a[len];
double b[len];
double c[len];
int i;
int j = 0;
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = ((double )i) / 2.0;
b[i] = ((double )i) / 3.0;
c[i] = ((double )i) / 7.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB028-privatemissing-orig-yes.c | #pragma omp parallel for private (i) | 100 | e <omp.h>
int main(int argc,char *argv[])
{
int i;
int tmp;
int len = 100;
int a[100];
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB028-privatemissing-orig-yes.c | #pragma omp parallel for private (tmp,i) firstprivate (len) | 100 |
#pragma omp parallel for private (i)
for (i = 0; i <= len - 1; i += 1) {
a[i] = i;
}
<LOOP-START>for (i = 0; i <= len - 1; i += 1) {
tmp = a[i] + i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (tmp,i) firstprivate (len)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB048-firstprivate-orig-no.c | #pragma omp parallel for private (i) firstprivate (n,g) | 100 | /
/*
Example use of firstprivate()
*/
#include <omp.h>
void foo(int *a,int n,int g)
{
int i;
<LOOP-START>for (i = 0; i <= n - 1; i += 1) {
a[i] = a[i] + g;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i) firstprivate (n,g)<OMP-END> |
LLNL/AutoParBench/benchmarks/Autopar/dataracebench/DRB048-firstprivate-orig-no.c | #pragma omp parallel for private (i) | 100 | for (i = 0; i <= n - 1; i += 1) {
a[i] = a[i] + g;
}
}
int a[100];
int main()
{
int i;
<LOOP-START>for (i = 0; i <= 99; i += 1) {
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.