filename stringlengths 19 182 | omp_pragma_line stringlengths 24 416 | context_chars int64 100 100 | text stringlengths 152 177k |
|---|---|---|---|
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB048-firstprivate-orig-no.c | #pragma omp parallel for private(i) | 100 | i;
int _ret_val_0;
#pragma cetus private(i)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<100; i ++ )
{
a[i]=i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB063-outeronly1-orig-no.c | #pragma omp parallel for private(i, j) | 100 | int _ret_val_0;
#pragma cetus private(i, j)
#pragma loop name init#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<n; i ++ )
{
#pragma cetus private(j)
#pragma loop name init#0#0
#pragma cetus parallel
#pragma omp parallel for private(j)
for (j=0; j<m; j ++ )
{
b[i][j]=(i*j);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB063-outeronly1-orig-no.c | #pragma omp parallel for private(j) | 100 | <n; i ++ )
{
#pragma cetus private(j)
#pragma loop name init#0#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<m; j ++ )
{
b[i][j]=(i*j);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB063-outeronly1-orig-no.c | #pragma omp parallel for private(i, j) | 100 | ut bounds of j */
#pragma cetus private(i, j)
#pragma loop name foo#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<n; i ++ )
{
#pragma cetus private(j)
#pragma loop name foo#0#0
for (j=0; j<(m-1); j ++ )
{
b[i][j]=b[i][j+1];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB047-doallchar-orig-no.c | #pragma omp parallel for private(i) | 100 | i;
int _ret_val_0;
#pragma cetus private(i)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<100; i ++ )
{
a[i]=(i%120);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB047-doallchar-orig-no.c | #pragma omp parallel for private(i) | 100 |
a[i]=(i%120);
}
#pragma cetus private(i)
#pragma loop name main#1
#pragma cetus parallel
<LOOP-START>for (i=0; i<100; i ++ )
{
a[i]=(a[i]+1);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB013-nowait-orig-yes.c | #pragma omp parallel for private(i) | 100 | 5;
int _ret_val_0;
#pragma cetus private(i)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<len; i ++ )
{
a[i]=i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB013-nowait-orig-yes.c | #pragma omp parallel for private(i) | 100 | + )
{
a[i]=i;
}
#pragma cetus private(i)
#pragma loop name main#1
#pragma cetus parallel
<LOOP-START>for (i=0; i<len; i ++ )
{
a[i]=(b+(a[i]*5));
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for private(i, j) | 100 | int _ret_val_0;
#pragma cetus private(i, j)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<len; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#0#0
#pragma cetus parallel
#pragma omp parallel for private(j)
for (j=0; j<len; j ++ )
{
a[i][j]=0.5;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for private(j) | 100 | en; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#0#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<len; j ++ )
{
a[i][j]=0.5;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for private(j) | 100 | -1); i+=1)
{
#pragma cetus private(j)
#pragma loop name main#1#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<len; j+=1)
{
a[i][j]+=a[i+1][j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB005-indirectaccess1-orig-yes.c | #pragma omp parallel for | 100 | /* initialize segments touched by indexSet */
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=521; i<=2025; ++ i)
{
base[i]=(0.5*i);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(i, j) | 100 | int _ret_val_0;
#pragma cetus private(i, j)
#pragma loop name init#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<100; i ++ )
{
#pragma cetus private(j)
#pragma loop name init#0#0
#pragma cetus parallel
#pragma omp parallel for private(j)
for (j=0; j<100; j ++ )
{
a[i][j]=(((double)i)*j);
b[i][j]=(((double)i)*j);
c[i][j]=(((double)i)*j);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(j) | 100 | 00; i ++ )
{
#pragma cetus private(j)
#pragma loop name init#0#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<100; j ++ )
{
a[i][j]=(((double)i)*j);
b[i][j]=(((double)i)*j);
c[i][j]=(((double)i)*j);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(i, j, k) | 100 | nt _ret_val_0;
#pragma cetus private(i, j, k)
#pragma loop name mmm#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<100; i ++ )
{
#pragma cetus private(j, k)
#pragma loop name mmm#0#0
#pragma cetus reduction(+: c[i][j])
#pragma cetus parallel
#pragma omp parallel for private(j, k) reduction(+: c[i][j])
for (k=0; k<100; k ++ )
{
#pragma cetus private(j)
#pragma loop name mmm#0#0#0
#pragma cetus parallel
#pragma omp parallel for private(j)
for (j=0; j<100; j ++ )
{
c[i][j]=(c[i][j]+(a[i][k]*b[k][j]));
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j, k)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(j, k) reduction(+: c[i][j]) | 100 | k)
#pragma loop name mmm#0#0
#pragma cetus reduction(+: c[i][j])
#pragma cetus parallel
<LOOP-START>for (k=0; k<100; k ++ )
{
#pragma cetus private(j)
#pragma loop name mmm#0#0#0
#pragma cetus parallel
#pragma omp parallel for private(j)
for (j=0; j<100; j ++ )
{
c[i][j]=(c[i][j]+(a[i][k]*b[k][j]));
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j, k) reduction(+: c[i][j])<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(j) | 100 | ++ )
{
#pragma cetus private(j)
#pragma loop name mmm#0#0#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<100; j ++ )
{
c[i][j]=(c[i][j]+(a[i][k]*b[k][j]));
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB007-indirectaccess3-orig-yes.c | #pragma omp parallel for | 100 | /* initialize segments touched by indexSet */
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=521; i<=2025; ++ i)
{
base[i]=(0.5*i);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB011-minusminus-orig-yes.c | #pragma omp parallel for private(i) | 100 | */
int _ret_val_0;
#pragma cetus private(i)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<len; i ++ )
{
if ((i%2)==0)
{
x[i]=5;
}
else
{
x[i]=( - 5);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB011-minusminus-orig-yes.c | #pragma omp parallel for private(i) reduction(+: numNodes2) | 100 | te(i)
#pragma loop name main#1
#pragma cetus reduction(+: numNodes2)
#pragma cetus parallel
<LOOP-START>for (i=(numNodes-1); i>( - 1); -- i)
{
if (x[i]<=0)
{
numNodes2 -- ;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i) reduction(+: numNodes2)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB046-doall2-orig-no.c | #pragma omp parallel for private(i, j) | 100 | int _ret_val_0;
#pragma cetus private(i, j)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<100; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#0#0
#pragma cetus parallel
#pragma omp parallel for private(j)
for (j=0; j<100; j ++ )
{
a[i][j]=(i+j);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB046-doall2-orig-no.c | #pragma omp parallel for private(j) | 100 | 00; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#0#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<100; j ++ )
{
a[i][j]=(i+j);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB046-doall2-orig-no.c | #pragma omp parallel for private(i, j) | 100 | j]=(i+j);
}
}
#pragma cetus private(i, j)
#pragma loop name main#1
#pragma cetus parallel
<LOOP-START>for (i=0; i<100; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#1#0
#pragma cetus parallel
#pragma omp parallel for private(j)
for (j=0; j<100; j ++ )
{
a[i][j]=(a[i][j]+1);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB046-doall2-orig-no.c | #pragma omp parallel for private(j) | 100 | 00; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#1#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<100; j ++ )
{
a[i][j]=(a[i][j]+1);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB025-simdtruedep-var-yes.c | #pragma omp parallel for private(i) | 100 | n=atoi(argv[1]);
}
#pragma cetus private(i)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<len; i ++ )
{
a[i]=i;
b[i]=(i+1);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB033-truedeplinear-orig-yes.c | #pragma omp parallel for private(i) | 100 | ];
int _ret_val_0;
#pragma cetus private(i)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<2000; i ++ )
{
a[i]=i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB045-doall1-orig-no.c | #pragma omp parallel for private(i) | 100 | i;
int _ret_val_0;
#pragma cetus private(i)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<100; i ++ )
{
a[i]=i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB045-doall1-orig-no.c | #pragma omp parallel for private(i) | 100 | + )
{
a[i]=i;
}
#pragma cetus private(i)
#pragma loop name main#1
#pragma cetus parallel
<LOOP-START>for (i=0; i<100; i ++ )
{
a[i]=(a[i]+1);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB052-indirectaccesssharebase-orig-no.c | #pragma omp parallel for | 100 | \n");
_ret_val_0=1;
return _ret_val_0;
}
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=521; i<=2025; ++ i)
{
base[i]=0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB068-restrictpointer2-orig-no.c | #pragma omp parallel for private(i) | 100 | strict c)
{
int i;
#pragma cetus private(i)
#pragma loop name init#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<n; i ++ )
{
a[i]=1;
b[i]=i;
c[i]=(i*i);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB068-restrictpointer2-orig-no.c | #pragma omp parallel for private(i) | 100 | estrict c)
{
int i;
#pragma cetus private(i)
#pragma loop name foo#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<n; i ++ )
{
a[i]=(b[i]+c[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB040-truedepsingleelement-var-yes.c | #pragma omp parallel for private(i) | 100 | gv[1]);
}
a[0]=2;
#pragma cetus private(i)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<len; i ++ )
{
a[i]=i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB031-truedepfirstdimension-orig-yes.c | #pragma omp parallel for private(i, j) | 100 | int _ret_val_0;
#pragma cetus private(i, j)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<n; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#0#0
#pragma cetus parallel
#pragma omp parallel for private(j)
for (j=0; j<m; j ++ )
{
b[i][j]=0.5;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB031-truedepfirstdimension-orig-yes.c | #pragma omp parallel for private(j) | 100 | <n; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#0#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<m; j ++ )
{
b[i][j]=0.5;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB031-truedepfirstdimension-orig-yes.c | #pragma omp parallel for private(j) | 100 | <n; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#1#0
#pragma cetus parallel
<LOOP-START>for (j=1; j<m; j ++ )
{
b[i][j]=b[i-1][j-1];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for private(i, j) | 100 | toi(argv[1]);
}
#pragma cetus private(i, j)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<len; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#0#0
#pragma cetus parallel
#pragma omp parallel for private(j)
for (j=0; j<len; j ++ )
{
a[i][j]=0.5;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for private(j) | 100 | en; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#0#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<len; j ++ )
{
a[i][j]=0.5;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for private(j) | 100 | -1); i+=1)
{
#pragma cetus private(j)
#pragma loop name main#1#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<len; j+=1)
{
a[i][j]+=a[i+1][j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB104-nowait-barrier-orig-no.c | #pragma omp parallel for private(i) | 100 | 5;
int _ret_val_0;
#pragma cetus private(i)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<len; i ++ )
{
a[i]=i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB104-nowait-barrier-orig-no.c | #pragma omp parallel for private(i) | 100 | + )
{
a[i]=i;
}
#pragma cetus private(i)
#pragma loop name main#1
#pragma cetus parallel
<LOOP-START>for (i=0; i<len; i ++ )
{
a[i]=(b+(a[i]*5));
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB038-truedepseconddimension-var-yes.c | #pragma omp parallel for private(i, j) | 100 | toi(argv[1]);
}
#pragma cetus private(i, j)
#pragma loop name main#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<n; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#0#0
#pragma cetus parallel
#pragma omp parallel for private(j)
for (j=0; j<m; j ++ )
{
b[i][j]=(i+j);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB038-truedepseconddimension-var-yes.c | #pragma omp parallel for private(j) | 100 | <n; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#0#0
#pragma cetus parallel
<LOOP-START>for (j=0; j<m; j ++ )
{
b[i][j]=(i+j);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/dataracebench/DRB038-truedepseconddimension-var-yes.c | #pragma omp parallel for private(i, j) | 100 | j]=(i+j);
}
}
#pragma cetus private(i, j)
#pragma loop name main#1
#pragma cetus parallel
<LOOP-START>for (i=0; i<n; i ++ )
{
#pragma cetus private(j)
#pragma loop name main#1#0
for (j=1; j<m; j ++ )
{
b[i][j]=b[i][j-1];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/rodinia_3.1/openmp/heartwall/kernel.c | #pragma omp parallel for reduction(+: in_final_sum) | 100 | #pragma loop name kernel#3
#pragma cetus reduction(+: in_final_sum)
#pragma cetus parallel
<LOOP-START>for (i=0; i<public.in_mod_elem; i ++ )
{
in_final_sum=(in_final_sum+d_in[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+: in_final_sum)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/rodinia_3.1/openmp/heartwall/kernel.c | #pragma omp parallel for reduction(+: in_sqr_final_sum) | 100 | gma loop name kernel#4
#pragma cetus reduction(+: in_sqr_final_sum)
#pragma cetus parallel
<LOOP-START>for (i=0; i<public.in_mod_elem; i ++ )
{
in_sqr_final_sum=(in_sqr_final_sum+private.d_in_sqr[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+: in_sqr_final_sum)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/rodinia_3.1/openmp/heartwall/kernel.c | #pragma omp parallel for | 100 | _Col[private.point_no])-1);
/* work */
#pragma loop name kernel#16
#pragma cetus parallel
<LOOP-START>for (ei_new=0; ei_new<public.tMask_elem; ei_new ++ )
{
private.d_tMask[ei_new]=0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/rodinia_3.1/openmp/heartwall/AVI/avilib.c | #pragma omp parallel for | 100 | are finished with writing
*/
#pragma loop name AVI_open_output_file#0
#pragma cetus parallel
<LOOP-START>for (i=0; i<2048; i ++ )
{
AVI_header[i]=0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/rodinia_3.1/openmp/heartwall/AVI/avilib.c | #pragma omp parallel for | 100 | audio index arrays */
nvi=0;
#pragma loop name avi_parse_input_file#3
#pragma cetus parallel
<LOOP-START>for (j=0; j<AVI->anum; ++ j)
{
nai[j]=0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/rodinia_3.1/openmp/heartwall/AVI/avilib.c | #pragma omp parallel for | 100 | al_0;
}
;
}
}
nvi=0;
#pragma loop name avi_parse_input_file#7
#pragma cetus parallel
<LOOP-START>for (j=0; j<AVI->anum; ++ j)
{
nai[j]=(tot[j]=0);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/NPB3.0-omp-c/IS/is.c | #pragma omp parallel for reduction(*: R23, T23) | 100 | ;
#pragma loop name randlc#0
#pragma cetus reduction(*: R23, T23)
#pragma cetus parallel
<LOOP-START>for (i=1; i<=23; i ++ )
{
R23=(0.5*R23);
T23=(2.0*T23);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(*: R23, T23)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/NPB3.0-omp-c/IS/is.c | #pragma omp parallel for reduction(*: R46, T46) | 100 | }
#pragma loop name randlc#1
#pragma cetus reduction(*: R46, T46)
#pragma cetus parallel
<LOOP-START>for (i=1; i<=46; i ++ )
{
R46=(0.5*R46);
T46=(2.0*T46);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(*: R46, T46)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/NPB3.0-omp-c/IS/is.c | #pragma omp parallel for reduction(+: j) | 100 | /
j=0;
#pragma loop name full_verify#1
#pragma cetus reduction(+: j)
#pragma cetus parallel
<LOOP-START>for (i=1; i<(1<<23); i ++ )
{
if (key_array[i-1]>key_array[i])
{
j ++ ;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+: j)<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/NPB3.0-omp-c/IS/is.c | #pragma omp parallel for | 100 | dex_array[i]];
}
/* Clear the work array */
#pragma loop name rank#1
#pragma cetus parallel
<LOOP-START>for (i=0; i<(1<<19); i ++ )
{
key_buff1[i]=0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/Cetus/NPB3.0-omp-c/IS/is.c | #pragma omp parallel for | 100 | i=0; i<(1<<19); i ++ )
{
key_buff1[i]=0;
}
#pragma loop name rank#2
#pragma cetus parallel
<LOOP-START>for (i=0; i<(1<<19); i ++ )
{
prv_buff1[i]=0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_gpu_target/dataracebench/DRB031-truedepfirstdimension-orig-yes.c | #pragma omp parallel for private(j) | 100 | [1000][1000];
#pragma omp target data map(from:b[0:1000][0:1000])
{
#pragma omp target
{
<LOOP-START>for (i=0; i<n; i++)
for (j=0; j<m; j++)
b[i][j] = 0.5;
}
}
#pragma omp target data map(tofrom:b[0:1000][0:1000])
{
for (i=1;i<n;i++)
#pragma omp target parallel for
for (j=1;j<m;j++)
b[i][j]=b[i-1][j-1];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB043-adi-parallel-no.c | #pragma omp parallel for private(c1 ,c2 ) | 100 | uble B[500 + 0][500 + 0])
{
//int i;
//int j;
{
int c1;
int c2;
if (n >= 1) {
<LOOP-START>for (c1 = 0; c1 <= n + -1; c1++) {
#pragma omp parallel for private(c2 )
for (c2 = 0; c2 <= n + -1; c2++) {
X[c1][c2] = (((double )c1) * (c2 + 1) + 1) / n;
A[c1][c2] = (((double )c1) * (c2 + 2) + 2) / n;
B[c1][c2] = (((double )c1) * (c2 + 3) + 3) / n;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1 ,c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB043-adi-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | {
#pragma omp parallel for private(c1 ,c2 )
for (c1 = 0; c1 <= n + -1; c1++) {
<LOOP-START>for (c2 = 0; c2 <= n + -1; c2++) {
X[c1][c2] = (((double )c1) * (c2 + 1) + 1) / n;
A[c1][c2] = (((double )c1) * (c2 + 2) + 2) / n;
B[c1][c2] = (((double )c1) * (c2 + 3) + 3) / n;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB043-adi-parallel-no.c | #pragma omp parallel for private(c2 ,c8 ) | 100 | ;
//#pragma scop
{
int c0;
int c2;
int c8;
for (c0 = 0; c0 <= 9; c0++) {
<LOOP-START>for (c2 = 0; c2 <= 499; c2++) {
for (c8 = 1; c8 <= 499; c8++) {
B[c2][c8] = B[c2][c8] - A[c2][c8] * A[c2][c8] / B[c2][c8 - 1];
}
for (c8 = 1; c8 <= 499; c8++) {
X[c2][c8] = X[c2][c8] - X[c2][c8 - 1] * A[c2][c8] / B[c2][c8 - 1];
}
for (c8 = 0; c8 <= 497; c8++) {
X[c2][500 - c8 - 2] = (X[c2][500 - 2 - c8] - X[c2][500 - 2 - c8 - 1] * A[c2][500 - c8 - 3]) / B[c2][500 - 3 - c8];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ,c8 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB043-adi-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | c8] - X[c2][500 - 2 - c8 - 1] * A[c2][500 - c8 - 3]) / B[c2][500 - 3 - c8];
}
}
<LOOP-START>for (c2 = 0; c2 <= 499; c2++) {
X[c2][500 - 1] = X[c2][500 - 1] / B[c2][500 - 1];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB043-adi-parallel-no.c | #pragma omp parallel for private(c2 ,c8 ) | 100 | (c2 = 0; c2 <= 499; c2++) {
X[c2][500 - 1] = X[c2][500 - 1] / B[c2][500 - 1];
}
<LOOP-START>for (c2 = 0; c2 <= 499; c2++) {
for (c8 = 1; c8 <= 499; c8++) {
B[c8][c2] = B[c8][c2] - A[c8][c2] * A[c8][c2] / B[c8 - 1][c2];
}
for (c8 = 1; c8 <= 499; c8++) {
X[c8][c2] = X[c8][c2] - X[c8 - 1][c2] * A[c8][c2] / B[c8 - 1][c2];
}
for (c8 = 0; c8 <= 497; c8++) {
X[500 - 2 - c8][c2] = (X[500 - 2 - c8][c2] - X[500 - c8 - 3][c2] * A[500 - 3 - c8][c2]) / B[500 - 2 - c8][c2];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ,c8 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB043-adi-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | c8][c2] - X[500 - c8 - 3][c2] * A[500 - 3 - c8][c2]) / B[500 - 2 - c8][c2];
}
}
<LOOP-START>for (c2 = 0; c2 <= 499; c2++) {
X[500 - 1][c2] = X[500 - 1][c2] / B[500 - 1][c2];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB021-reductionmissing-orig-yes.c | #pragma omp parallel for private(i ,j ) | 100 | int argc, char* argv[])
{
int i,j;
float temp, sum=0.0;
int len=100;
float u[100][100];
<LOOP-START>for (i = 0; i < len; i++)
#pragma omp parallel for private(j )
for (j = 0; j < len; j++)
u[i][j] = 0.5;
#pragma omp parallel for private(temp ,j ) reduction(+:sum)
for (i = 0; i < len; i++)
#pragma omp parallel for private(temp ,j ) reduction(+:sum)
for (j = 0; j < len; j++)
{
temp = u[i][j];
sum = sum + temp * temp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB021-reductionmissing-orig-yes.c | #pragma omp parallel for private(j ) | 100 | ;
float u[100][100];
#pragma omp parallel for private(i ,j )
for (i = 0; i < len; i++)
<LOOP-START>for (j = 0; j < len; j++)
u[i][j] = 0.5;
#pragma omp parallel for private(temp ,j ) reduction(+:sum)
for (i = 0; i < len; i++)
#pragma omp parallel for private(temp ,j ) reduction(+:sum)
for (j = 0; j < len; j++)
{
temp = u[i][j];
sum = sum + temp * temp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB021-reductionmissing-orig-yes.c | #pragma omp parallel for private(temp ,j ) reduction(+:sum) | 100 |
#pragma omp parallel for private(j )
for (j = 0; j < len; j++)
u[i][j] = 0.5;
<LOOP-START>for (i = 0; i < len; i++)
#pragma omp parallel for private(temp ,j ) reduction(+:sum)
for (j = 0; j < len; j++)
{
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/baseline/dataracebench/DRB021-reductionmissing-orig-yes.c | #pragma omp parallel for private(temp ,j ) reduction(+:sum) | 100 | 5;
#pragma omp parallel for private(temp ,j ) reduction(+:sum)
for (i = 0; i < len; i++)
<LOOP-START>for (j = 0; j < len; j++)
{
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/baseline/dataracebench/DRB019-plusplus-var-yes.c | #pragma omp parallel for private(i ) | 100 | outLen = 0;
if (argc>1)
inLen= atoi(argv[1]);
int input[inLen];
int output[inLen];
<LOOP-START>for (i=0; i<inLen; ++i)
input[i]=i;
for (i=0; i<inLen; ++i) {
output[outLen++] = input[i] ;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB012-minusminus-var-yes.c | #pragma omp parallel for private(i ) | 100 | n=100;
if (argc>1)
len = atoi(argv[1]);
int numNodes=len, numNodes2=0;
int x[len];
<LOOP-START>for (i=0; i< len; i++)
{
if (i%2==0)
x[i]=5;
else
x[i]= -5;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB012-minusminus-var-yes.c | #pragma omp parallel for private(i ) reduction(+:numNodes2) | 100 | ate(i )
for (i=0; i< len; i++)
{
if (i%2==0)
x[i]=5;
else
x[i]= -5;
}
<LOOP-START>for (i=numNodes-1 ; i>-1 ; --i) {
if (x[i]<=0) {
numNodes2+=-1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) reduction(+:numNodes2) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB022-reductionmissing-var-yes.c | #pragma omp parallel for private(i ,j ) | 100 | float temp, sum=0.0;
int len=100;
if (argc>1)
len = atoi(argv[1]);
float u[len][len];
<LOOP-START>for (i = 0; i < len; i++)
#pragma omp parallel for private(j )
for (j = 0; j < len; j++)
u[i][j] = 0.5;
#pragma omp parallel for private(i ,temp ,j ) reduction(+:sum)
for (i = 0; i < len; i++)
#pragma omp parallel for private(temp ,j ) reduction(+:sum)
for (j = 0; j < len; j++)
{
temp = u[i][j];
sum = sum + temp * temp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB022-reductionmissing-var-yes.c | #pragma omp parallel for private(j ) | 100 | );
float u[len][len];
#pragma omp parallel for private(i ,j )
for (i = 0; i < len; i++)
<LOOP-START>for (j = 0; j < len; j++)
u[i][j] = 0.5;
#pragma omp parallel for private(i ,temp ,j ) reduction(+:sum)
for (i = 0; i < len; i++)
#pragma omp parallel for private(temp ,j ) reduction(+:sum)
for (j = 0; j < len; j++)
{
temp = u[i][j];
sum = sum + temp * temp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB022-reductionmissing-var-yes.c | #pragma omp parallel for private(i ,temp ,j ) reduction(+:sum) | 100 | )
#pragma omp parallel for private(j )
for (j = 0; j < len; j++)
u[i][j] = 0.5;
<LOOP-START>for (i = 0; i < len; i++)
#pragma omp parallel for private(temp ,j ) reduction(+:sum)
for (j = 0; j < len; j++)
{
temp = u[i][j];
sum = sum + temp * temp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,temp ,j ) reduction(+:sum) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB022-reductionmissing-var-yes.c | #pragma omp parallel for private(temp ,j ) reduction(+:sum) | 100 |
#pragma omp parallel for private(i ,temp ,j ) reduction(+:sum)
for (i = 0; i < len; i++)
<LOOP-START>for (j = 0; j < len; j++)
{
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/baseline/dataracebench/DRB056-jacobi2d-tile-no.c | #pragma omp parallel for private(c1 ,c3 ,c4 ,c2 ) | 100 | )
{
//int i;
//int j;
{
int c1;
int c2;
int c4;
int c3;
if (n >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c1++) {
#pragma omp parallel for private(c2 ,c3 ,c4 )
for (c2 = 0; c2 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c2++) {
#pragma omp parallel for private(c3 ,c4 )
for (c3 = 16 * c2; c3 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c3++) {
#pragma omp parallel for private(c4 )
for (c4 = 16 * c1; c4 <= ((16 * c1 + 15 < n + -1?16 * c1 + 15 : n + -1)); c4++) {
A[c4][c3] = (((double )c4) * (c3 + 2) + 2) / n;
B[c4][c3] = (((double )c4) * (c3 + 3) + 3) / n;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1 ,c3 ,c4 ,c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB056-jacobi2d-tile-no.c | #pragma omp parallel for private(c2 ,c3 ,c4 ) | 100 | 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c1++) {
<LOOP-START>for (c2 = 0; c2 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c2++) {
#pragma omp parallel for private(c3 ,c4 )
for (c3 = 16 * c2; c3 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c3++) {
#pragma omp parallel for private(c4 )
for (c4 = 16 * c1; c4 <= ((16 * c1 + 15 < n + -1?16 * c1 + 15 : n + -1)); c4++) {
A[c4][c3] = (((double )c4) * (c3 + 2) + 2) / n;
B[c4][c3] = (((double )c4) * (c3 + 3) + 3) / n;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ,c3 ,c4 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB056-jacobi2d-tile-no.c | #pragma omp parallel for private(c3 ,c4 ) | 100 | 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c2++) {
<LOOP-START>for (c3 = 16 * c2; c3 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c3++) {
#pragma omp parallel for private(c4 )
for (c4 = 16 * c1; c4 <= ((16 * c1 + 15 < n + -1?16 * c1 + 15 : n + -1)); c4++) {
A[c4][c3] = (((double )c4) * (c3 + 2) + 2) / n;
B[c4][c3] = (((double )c4) * (c3 + 3) + 3) / n;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c3 ,c4 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB056-jacobi2d-tile-no.c | #pragma omp parallel for private(c4 ) | 100 | )
for (c3 = 16 * c2; c3 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c3++) {
<LOOP-START>for (c4 = 16 * c1; c4 <= ((16 * c1 + 15 < n + -1?16 * c1 + 15 : n + -1)); c4++) {
A[c4][c3] = (((double )c4) * (c3 + 2) + 2) / n;
B[c4][c3] = (((double )c4) * (c3 + 3) + 3) / n;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c4 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB056-jacobi2d-tile-no.c | #pragma omp parallel for private(c1 ,c5 ,c4 ,c2 ,c3 ) | 100 | / 16) : -((-(n + 3 * tsteps + -4) + 16 - 1) / 16))) : (n + 3 * tsteps + -4) / 16)); c0++) {
<LOOP-START>for (c1 = (((2 * c0 * 3 < 0?-(-(2 * c0) / 3) : ((3 < 0?(-(2 * c0) + - 3 - 1) / - 3 : (2 * c0 + 3 - 1) / 3)))) > (((16 * c0 + -1 * tsteps + 1) * 16 < 0?-(-(16 * c0 + -1 * tsteps + 1) / 16) : ((16 < 0?(-(16 * c0 + -1 * tsteps + 1) + - 16 - 1) / - 16 : (16 * c0 + -1 * tsteps + 1 + 16 - 1) / 16))))?((2 * c0 * 3 < 0?-(-(2 * c0) / 3) : ((3 < 0?(-(2 * c0) + - 3 - 1) / - 3 : (2 * c0 + 3 - 1) / 3)))) : (((16 * c0 + -1 * tsteps + 1) * 16 < 0?-(-(16 * c0 + -1 * tsteps + 1) / 16) : ((16 < 0?(-(16 * c0 + -1 * tsteps + 1) + - 16 - 1) / - 16 : (16 * c0 + -1 * tsteps + 1 + 16 - 1) / 16))))); c1 <= (((((((n + 2 * tsteps + -3) * 16 < 0?((16 < 0?-((-(n + 2 * tsteps + -3) + 16 + 1) / 16) : -((-(n + 2 * tsteps + -3) + 16 - 1) / 16))) : (n + 2 * tsteps + -3) / 16)) < (((32 * c0 + n + 29) * 48 < 0?((48 < 0?-((-(32 * c0 + n + 29) + 48 + 1) / 48) : -((-(32 * c0 + n + 29) + 48 - 1) / 48))) : (32 * c0 + n + 29) / 48))?(((n + 2 * tsteps + -3) * 16 < 0?((16 < 0?-((-(n + 2 * tsteps + -3) + 16 + 1) / 16) : -((-(n + 2 * tsteps + -3) + 16 - 1) / 16))) : (n + 2 * tsteps + -3) / 16)) : (((32 * c0 + n + 29) * 48 < 0?((48 < 0?-((-(32 * c0 + n + 29) + 48 + 1) / 48) : -((-(32 * c0 + n + 29) + 48 - 1) / 48))) : (32 * c0 + n + 29) / 48)))) < c0?(((((n + 2 * tsteps + -3) * 16 < 0?((16 < 0?-((-(n + 2 * tsteps + -3) + 16 + 1) / 16) : -((-(n + 2 * tsteps + -3) + 16 - 1) / 16))) : (n + 2 * tsteps + -3) / 16)) < (((32 * c0 + n + 29) * 48 < 0?((48 < 0?-((-(32 * c0 + n + 29) + 48 + 1) / 48) : -((-(32 * c0 + n + 29) + 48 - 1) / 48))) : (32 * c0 + n + 29) / 48))?(((n + 2 * tsteps + -3) * 16 < 0?((16 < 0?-((-(n + 2 * tsteps + -3) + 16 + 1) / 16) : -((-(n + 2 * tsteps + -3) + 16 - 1) / 16))) : (n + 2 * tsteps + -3) / 16)) : (((32 * c0 + n + 29) * 48 < 0?((48 < 0?-((-(32 * c0 + n + 29) + 48 + 1) / 48) : -((-(32 * c0 + n + 29) + 48 - 1) / 48))) : (32 * c0 + n + 29) / 48)))) : c0)); c1++) {
for (c2 = ((((16 * c1 + -1 * n + -12) * 16 < 0?-(-(16 * c1 + -1 * n + -12) / 16) : ((16 < 0?(-(16 * c1 + -1 * n + -12) + - 16 - 1) / - 16 : (16 * c1 + -1 * n + -12 + 16 - 1) / 16)))) > 2 * c0 + -2 * c1?(((16 * c1 + -1 * n + -12) * 16 < 0?-(-(16 * c1 + -1 * n + -12) / 16) : ((16 < 0?(-(16 * c1 + -1 * n + -12) + - 16 - 1) / - 16 : (16 * c1 + -1 * n + -12 + 16 - 1) / 16)))) : 2 * c0 + -2 * c1); c2 <= (((((((16 * c1 + n + 12) * 16 < 0?((16 < 0?-((-(16 * c1 + n + 12) + 16 + 1) / 16) : -((-(16 * c1 + n + 12) + 16 - 1) / 16))) : (16 * c1 + n + 12) / 16)) < (((n + 2 * tsteps + -3) * 16 < 0?((16 < 0?-((-(n + 2 * tsteps + -3) + 16 + 1) / 16) : -((-(n + 2 * tsteps + -3) + 16 - 1) / 16))) : (n + 2 * tsteps + -3) / 16))?(((16 * c1 + n + 12) * 16 < 0?((16 < 0?-((-(16 * c1 + n + 12) + 16 + 1) / 16) : -((-(16 * c1 + n + 12) + 16 - 1) / 16))) : (16 * c1 + n + 12) / 16)) : (((n + 2 * tsteps + -3) * 16 < 0?((16 < 0?-((-(n + 2 * tsteps + -3) + 16 + 1) / 16) : -((-(n + 2 * tsteps + -3) + 16 - 1) / 16))) : (n + 2 * tsteps + -3) / 16)))) < (((32 * c0 + -32 * c1 + n + 29) * 16 < 0?((16 < 0?-((-(32 * c0 + -32 * c1 + n + 29) + 16 + 1) / 16) : -((-(32 * c0 + -32 * c1 + n + 29) + 16 - 1) / 16))) : (32 * c0 + -32 * c1 + n + 29) / 16))?(((((16 * c1 + n + 12) * 16 < 0?((16 < 0?-((-(16 * c1 + n + 12) + 16 + 1) / 16) : -((-(16 * c1 + n + 12) + 16 - 1) / 16))) : (16 * c1 + n + 12) / 16)) < (((n + 2 * tsteps + -3) * 16 < 0?((16 < 0?-((-(n + 2 * tsteps + -3) + 16 + 1) / 16) : -((-(n + 2 * tsteps + -3) + 16 - 1) / 16))) : (n + 2 * tsteps + -3) / 16))?(((16 * c1 + n + 12) * 16 < 0?((16 < 0?-((-(16 * c1 + n + 12) + 16 + 1) / 16) : -((-(16 * c1 + n + 12) + 16 - 1) / 16))) : (16 * c1 + n + 12) / 16)) : (((n + 2 * tsteps + -3) * 16 < 0?((16 < 0?-((-(n + 2 * tsteps + -3) + 16 + 1) / 16) : -((-(n + 2 * tsteps + -3) + 16 - 1) / 16))) : (n + 2 * tsteps + -3) / 16)))) : (((32 * c0 + -32 * c1 + n + 29) * 16 < 0?((16 < 0?-((-(32 * c0 + -32 * c1 + n + 29) + 16 + 1) / 16) : -((-(32 * c0 + -32 * c1 + n + 29) + 16 - 1) / 16))) : (32 * c0 + -32 * c1 + n + 29) / 16)))); c2++) {
if (c0 <= (((32 * c1 + 16 * c2 + -1 * n + 1) * 32 < 0?((32 < 0?-((-(32 * c1 + 16 * c2 + -1 * n + 1) + 32 + 1) / 32) : -((-(32 * c1 + 16 * c2 + -1 * n + 1) + 32 - 1) / 32))) : (32 * c1 + 16 * c2 + -1 * n + 1) / 32)) && c1 <= c2 + -1) {
if ((n + 1) % 2 == 0) {
for (c4 = (16 * c1 > 16 * c2 + -1 * n + 3?16 * c1 : 16 * c2 + -1 * n + 3); c4 <= 16 * c1 + 15; c4++) {
A[-16 * c2 + c4 + n + -2][n + -2] = B[-16 * c2 + c4 + n + -2][n + -2];
}
}
}
if (c0 <= (((48 * c1 + -1 * n + 1) * 32 < 0?((32 < 0?-((-(48 * c1 + -1 * n + 1) + 32 + 1) / 32) : -((-(48 * c1 + -1 * n + 1) + 32 - 1) / 32))) : (48 * c1 + -1 * n + 1) / 32)) && c1 >= c2) {
if ((n + 1) % 2 == 0) {
for (c5 = (16 * c2 > 16 * c1 + -1 * n + 3?16 * c2 : 16 * c1 + -1 * n + 3); c5 <= ((16 * c1 < 16 * c2 + 15?16 * c1 : 16 * c2 + 15)); c5++) {
A[n + -2][-16 * c1 + c5 + n + -2] = B[n + -2][-16 * c1 + c5 + n + -2];
}
}
}
for (c3 = ((((((16 * c1 + -1 * n + 2) * 2 < 0?-(-(16 * c1 + -1 * n + 2) / 2) : ((2 < 0?(-(16 * c1 + -1 * n + 2) + - 2 - 1) / - 2 : (16 * c1 + -1 * n + 2 + 2 - 1) / 2)))) > (((16 * c2 + -1 * n + 2) * 2 < 0?-(-(16 * c2 + -1 * n + 2) / 2) : ((2 < 0?(-(16 * c2 + -1 * n + 2) + - 2 - 1) / - 2 : (16 * c2 + -1 * n + 2 + 2 - 1) / 2))))?(((16 * c1 + -1 * n + 2) * 2 < 0?-(-(16 * c1 + -1 * n + 2) / 2) : ((2 < 0?(-(16 * c1 + -1 * n + 2) + - 2 - 1) / - 2 : (16 * c1 + -1 * n + 2 + 2 - 1) / 2)))) : (((16 * c2 + -1 * n + 2) * 2 < 0?-(-(16 * c2 + -1 * n + 2) / 2) : ((2 < 0?(-(16 * c2 + -1 * n + 2) + - 2 - 1) / - 2 : (16 * c2 + -1 * n + 2 + 2 - 1) / 2)))))) > 16 * c0 + -16 * c1?(((((16 * c1 + -1 * n + 2) * 2 < 0?-(-(16 * c1 + -1 * n + 2) / 2) : ((2 < 0?(-(16 * c1 + -1 * n + 2) + - 2 - 1) / - 2 : (16 * c1 + -1 * n + 2 + 2 - 1) / 2)))) > (((16 * c2 + -1 * n + 2) * 2 < 0?-(-(16 * c2 + -1 * n + 2) / 2) : ((2 < 0?(-(16 * c2 + -1 * n + 2) + - 2 - 1) / - 2 : (16 * c2 + -1 * n + 2 + 2 - 1) / 2))))?(((16 * c1 + -1 * n + 2) * 2 < 0?-(-(16 * c1 + -1 * n + 2) / 2) : ((2 < 0?(-(16 * c1 + -1 * n + 2) + - 2 - 1) / - 2 : (16 * c1 + -1 * n + 2 + 2 - 1) / 2)))) : (((16 * c2 + -1 * n + 2) * 2 < 0?-(-(16 * c2 + -1 * n + 2) / 2) : ((2 < 0?(-(16 * c2 + -1 * n + 2) + - 2 - 1) / - 2 : (16 * c2 + -1 * n + 2 + 2 - 1) / 2)))))) : 16 * c0 + -16 * c1); c3 <= ((((((8 * c1 + 6 < 8 * c2 + 6?8 * c1 + 6 : 8 * c2 + 6)) < tsteps + -1?((8 * c1 + 6 < 8 * c2 + 6?8 * c1 + 6 : 8 * c2 + 6)) : tsteps + -1)) < 16 * c0 + -16 * c1 + 15?((((8 * c1 + 6 < 8 * c2 + 6?8 * c1 + 6 : 8 * c2 + 6)) < tsteps + -1?((8 * c1 + 6 < 8 * c2 + 6?8 * c1 + 6 : 8 * c2 + 6)) : tsteps + -1)) : 16 * c0 + -16 * c1 + 15)); c3++) {
if (c1 <= ((c3 * 8 < 0?((8 < 0?-((-c3 + 8 + 1) / 8) : -((-c3 + 8 - 1) / 8))) : c3 / 8))) {
for (c5 = (16 * c2 > 2 * c3 + 1?16 * c2 : 2 * c3 + 1); c5 <= ((16 * c2 + 15 < 2 * c3 + n + -2?16 * c2 + 15 : 2 * c3 + n + -2)); c5++) {
B[1][-2 * c3 + c5] = 0.2 * (A[1][-2 * c3 + c5] + A[1][-2 * c3 + c5 - 1] + A[1][1 + (-2 * c3 + c5)] + A[1 + 1][-2 * c3 + c5] + A[1 - 1][-2 * c3 + c5]);
}
}
for (c4 = (16 * c1 > 2 * c3 + 2?16 * c1 : 2 * c3 + 2); c4 <= ((16 * c1 + 15 < 2 * c3 + n + -2?16 * c1 + 15 : 2 * c3 + n + -2)); c4++) {
if (c2 <= ((c3 * 8 < 0?((8 < 0?-((-c3 + 8 + 1) / 8) : -((-c3 + 8 - 1) / 8))) : c3 / 8))) {
B[-2 * c3 + c4][1] = 0.2 * (A[-2 * c3 + c4][1] + A[-2 * c3 + c4][1 - 1] + A[-2 * c3 + c4][1 + 1] + A[1 + (-2 * c3 + c4)][1] + A[-2 * c3 + c4 - 1][1]);
}
for (c5 = (16 * c2 > 2 * c3 + 2?16 * c2 : 2 * c3 + 2); c5 <= ((16 * c2 + 15 < 2 * c3 + n + -2?16 * c2 + 15 : 2 * c3 + n + -2)); c5++) {
B[-2 * c3 + c4][-2 * c3 + c5] = 0.2 * (A[-2 * c3 + c4][-2 * c3 + c5] + A[-2 * c3 + c4][-2 * c3 + c5 - 1] + A[-2 * c3 + c4][1 + (-2 * c3 + c5)] + A[1 + (-2 * c3 + c4)][-2 * c3 + c5] + A[-2 * c3 + c4 - 1][-2 * c3 + c5]);
A[-2 * c3 + c4 + -1][-2 * c3 + c5 + -1] = B[-2 * c3 + c4 + -1][-2 * c3 + c5 + -1];
}
if (c2 >= (((2 * c3 + n + -16) * 16 < 0?-(-(2 * c3 + n + -16) / 16) : ((16 < 0?(-(2 * c3 + n + -16) + - 16 - 1) / - 16 : (2 * c3 + n + -16 + 16 - 1) / 16))))) {
A[-2 * c3 + c4 + -1][n + -2] = B[-2 * c3 + c4 + -1][n + -2];
}
}
if (c1 >= (((2 * c3 + n + -16) * 16 < 0?-(-(2 * c3 + n + -16) / 16) : ((16 < 0?(-(2 * c3 + n + -16) + - 16 - 1) / - 16 : (2 * c3 + n + -16 + 16 - 1) / 16))))) {
for (c5 = (16 * c2 > 2 * c3 + 2?16 * c2 : 2 * c3 + 2); c5 <= ((16 * c2 + 15 < 2 * c3 + n + -1?16 * c2 + 15 : 2 * c3 + n + -1)); c5++) {
A[n + -2][-2 * c3 + c5 + -1] = B[n + -2][-2 * c3 + c5 + -1];
}
}
}
if (c0 >= (((2 * c1 + c2 + -1) * 2 < 0?-(-(2 * c1 + c2 + -1) / 2) : ((2 < 0?(-(2 * c1 + c2 + -1) + - 2 - 1) / - 2 : (2 * c1 + c2 + -1 + 2 - 1) / 2)))) && c1 >= c2 + 1 && c2 <= (((tsteps + -8) * 8 < 0?((8 < 0?-((-(tsteps + -8) + 8 + 1) / 8) : -((-(tsteps + -8) + 8 - 1) / 8))) : (tsteps + -8) / 8))) {
for (c4 = 16 * c1; c4 <= ((16 * c1 + 15 < 16 * c2 + n + 12?16 * c1 + 15 : 16 * c2 + n + 12)); c4++) {
B[-16 * c2 + c4 + -14][1] = 0.2 * (A[-16 * c2 + c4 + -14][1] + A[-16 * c2 + c4 + -14][1 - 1] + A[-16 * c2 + c4 + -14][1 + 1] + A[1 + (-16 * c2 + c4 + -14)][1] + A[-16 * c2 + c4 + -14 - 1][1]);
}
}
if (c0 >= (((3 * c1 + -1) * 2 < 0?-(-(3 * c1 + -1) / 2) : ((2 < 0?(-(3 * c1 + -1) + - 2 - 1) / - 2 : (3 * c1 + -1 + 2 - 1) / 2)))) && c1 <= (((((tsteps + -8) * 8 < 0?((8 < 0?-((-(tsteps + -8) + 8 + 1) / 8) : -((-(tsteps + -8) + 8 - 1) / 8))) : (tsteps + -8) / 8)) < c2?(((tsteps + -8) * 8 < 0?((8 < 0?-((-(tsteps + -8) + 8 + 1) / 8) : -((-(tsteps + -8) + 8 - 1) / 8))) : (tsteps + -8) / 8)) : c2))) {
for (c5 = (16 * c2 > 16 * c1 + 15?16 * c2 : 16 * c1 + 15); c5 <= ((16 * c2 + 15 < 16 * c1 + n + 12?16 * c2 + 15 : 16 * c1 + n + 12)); c5++) {
B[1][-16 * c1 + c5 + -14] = 0.2 * (A[1][-16 * c1 + c5 + -14] + A[1][-16 * c1 + c5 + -14 - 1] + A[1][1 + (-16 * c1 + c5 + -14)] + A[1 + 1][-16 * c1 + c5 + -14] + A[1 - 1][-16 * c1 + c5 + -14]);
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1 ,c5 ,c4 ,c2 ,c3 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB053-inneronly1-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | t main(int argc,char *argv[])
{
int i;
int j;
double a[20][20];
memset(a,0,(sizeof(a)));
<LOOP-START>for (i = 0; i < 20; i++)
#pragma omp parallel for private(j )
for (j = 0; j < 20; j++)
a[i][j] = i * 20 + j;
for (i = 0; i < 20 -1; i += 1) {
#pragma omp parallel for private(j )
for (j = 0; j < 20; j += 1) {
a[i][j] += a[i + 1][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB053-inneronly1-orig-no.c | #pragma omp parallel for private(j ) | 100 | memset(a,0,(sizeof(a)));
#pragma omp parallel for private(i ,j )
for (i = 0; i < 20; i++)
<LOOP-START>for (j = 0; j < 20; j++)
a[i][j] = i * 20 + j;
for (i = 0; i < 20 -1; i += 1) {
#pragma omp parallel for private(j )
for (j = 0; j < 20; j += 1) {
a[i][j] += a[i + 1][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB053-inneronly1-orig-no.c | #pragma omp parallel for private(j ) | 100 | )
for (j = 0; j < 20; j++)
a[i][j] = i * 20 + j;
for (i = 0; i < 20 -1; i += 1) {
<LOOP-START>for (j = 0; j < 20; j += 1) {
a[i][j] += a[i + 1][j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB108-atomic-orig-no.c | #pragma omp parallel for reduction(+:a) | 100 | *
* Test if atomic can be recognized properly. No data races.
* */
int main (void)
{
int a=0;
<LOOP-START>for (int i = 0; i < 100; i++)
{
a += 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:a) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB112-linear-orig-no.c | #pragma omp parallel for private(i ) | 100 |
*/
#include <stdio.h>
int main()
{
int len=100;
double a[len], b[len], c[len];
int i,j=0;
<LOOP-START>for (i=0;i<len;i++)
{
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/baseline/dataracebench/DRB112-linear-orig-no.c | #pragma omp parallel for private(i ) linear(j ) | 100 | en;i++)
{
a[i]=((double)i)/2.0;
b[i]=((double)i)/3.0;
c[i]=((double)i)/7.0;
}
<LOOP-START>for (i=0;i<len;i++)
{
c[j]+=a[i]*b[i];
j++;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) linear(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB016-outputdep-orig-yes.c | #pragma omp parallel for firstprivate(i ) lastprivate(i ) | 100 | x@74:5 vs. x@74:5
*/
#include <stdio.h>
int a[100];
int main()
{
int len=100;
int i,x=10;
<LOOP-START>for (i=0;i<len;i++)
{
a[i] = x;
x=i;
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(i ) lastprivate(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB109-orderedmissing-orig-yes.c | #pragma omp parallel for reduction(+:x) | 100 | * Missing the ordered clause
* Data race pair: x@56:5 vs. x@56:5
* */
int main()
{
int x =0;
<LOOP-START>for (int i = 0; i < 100; ++i) {
x++;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:x) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB008-indirectaccess4-orig-yes.c | #pragma omp parallel for private(i ) | 100 | e * xa1 = base;
double * xa2 = xa1 + 12;
int i;
// initialize segments touched by indexSet
<LOOP-START>for (i =521; i<= 2025; ++i)
{
base[i]=0.5*i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB101-task-value-orig-no.c | #pragma omp parallel for private(i ) | 100 | 100
int a[MYLEN];
int b[MYLEN];
void gen_task(int i)
{
a[i]= i+1;
}
int main()
{
int i=0;
<LOOP-START>for (i=0; i<MYLEN; i++)
{
gen_task(i);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB101-task-value-orig-no.c | #pragma omp parallel for private(i ) | 100 | private(i )
for (i=0; i<MYLEN; i++)
{
gen_task(i);
}
/* checking control flow */
<LOOP-START>for (i=0; i<MYLEN; i++)
{
//assert (a[i]==i+1);
if (a[i]!= i+1)
{
b[i] = a[i];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB110-ordered-orig-no.c | #pragma omp parallel for ordered | 100 | niv.
* Proper user of ordered directive and clause, no data races
* */
int main()
{
int x =0;
<LOOP-START>for (int i = 0; i < 100; ++i) {
#pragma omp ordered
x++;
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered<OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB064-outeronly2-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | parallelized so no race condition.
*/
double b[100][100];
#define N 100
int init()
{
int i,j,k;
<LOOP-START>for (i = 0; i < N; i++) {
#pragma omp parallel for private(j )
for (j = 0; j < N; j++) {
b[i][j] = i * j;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB064-outeronly2-orig-no.c | #pragma omp parallel for private(j ) | 100 | nt init()
{
int i,j,k;
#pragma omp parallel for private(i ,j )
for (i = 0; i < N; i++) {
<LOOP-START>for (j = 0; j < N; j++) {
b[i][j] = i * j;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB064-outeronly2-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | j < N; j++) {
b[i][j] = i * j;
}
}
return 0;
}
void foo(int n, int m)
{
int i,j;
<LOOP-START>for (i=0;i<n;i++)
for (j=1;j<m;j++) // Be careful about bounds of j
b[i][j]=b[i][j-1];
}
int print()
{
int i,j,k;
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
printf("%lf\n", b[i][j]);
}
}
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB017-outputdep-var-yes.c | #pragma omp parallel for firstprivate(len ,a ,i ) lastprivate(i ) | 100 | * argv[])
{
int len=100;
if (argc>1)
len = atoi(argv[1]);
int a[len];
int i,x=10;
<LOOP-START>for (i=0;i<len;i++)
{
a[i] = x;
x=i;
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(len ,a ,i ) lastprivate(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB059-lastprivate-orig-no.c | #pragma omp parallel for private(i ) lastprivate(x ) | 100 | back to the shared one within the last iteration.
*/
#include <stdio.h>
void foo()
{
int i,x;
<LOOP-START>for (i=0;i<100;i++)
x=i;
printf("x=%d",x);
}
int main()
{
foo();
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) lastprivate(x ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB044-adi-tile-no.c | #pragma omp parallel for private(c1 ,c4 ,c2 ,c3 ) | 100 | )
{
//int i;
//int j;
{
int c1;
int c3;
int c2;
int c4;
if (n >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c1++) {
#pragma omp parallel for private(c2 ,c4 ,c3 )
for (c2 = 0; c2 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c2++) {
#pragma omp parallel for private(c3 ,c4 )
for (c3 = 16 * c1; c3 <= ((16 * c1 + 15 < n + -1?16 * c1 + 15 : n + -1)); c3++) {
#pragma omp parallel for private(c4 )
for (c4 = 16 * c2; c4 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c4++) {
X[c3][c4] = (((double )c3) * (c4 + 1) + 1) / n;
A[c3][c4] = (((double )c3) * (c4 + 2) + 2) / n;
B[c3][c4] = (((double )c3) * (c4 + 3) + 3) / n;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1 ,c4 ,c2 ,c3 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB044-adi-tile-no.c | #pragma omp parallel for private(c2 ,c4 ,c3 ) | 100 | 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c1++) {
<LOOP-START>for (c2 = 0; c2 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c2++) {
#pragma omp parallel for private(c3 ,c4 )
for (c3 = 16 * c1; c3 <= ((16 * c1 + 15 < n + -1?16 * c1 + 15 : n + -1)); c3++) {
#pragma omp parallel for private(c4 )
for (c4 = 16 * c2; c4 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c4++) {
X[c3][c4] = (((double )c3) * (c4 + 1) + 1) / n;
A[c3][c4] = (((double )c3) * (c4 + 2) + 2) / n;
B[c3][c4] = (((double )c3) * (c4 + 3) + 3) / n;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ,c4 ,c3 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB044-adi-tile-no.c | #pragma omp parallel for private(c3 ,c4 ) | 100 | 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c2++) {
<LOOP-START>for (c3 = 16 * c1; c3 <= ((16 * c1 + 15 < n + -1?16 * c1 + 15 : n + -1)); c3++) {
#pragma omp parallel for private(c4 )
for (c4 = 16 * c2; c4 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c4++) {
X[c3][c4] = (((double )c3) * (c4 + 1) + 1) / n;
A[c3][c4] = (((double )c3) * (c4 + 2) + 2) / n;
B[c3][c4] = (((double )c3) * (c4 + 3) + 3) / n;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c3 ,c4 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB044-adi-tile-no.c | #pragma omp parallel for private(c4 ) | 100 | )
for (c3 = 16 * c1; c3 <= ((16 * c1 + 15 < n + -1?16 * c1 + 15 : n + -1)); c3++) {
<LOOP-START>for (c4 = 16 * c2; c4 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c4++) {
X[c3][c4] = (((double )c3) * (c4 + 1) + 1) / n;
A[c3][c4] = (((double )c3) * (c4 + 2) + 2) / n;
B[c3][c4] = (((double )c3) * (c4 + 3) + 3) / n;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c4 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB044-adi-tile-no.c | #pragma omp parallel for private(c2 ,c15 ,c9 ,c8 ) | 100 | = 1 && tsteps >= 1) {
for (c0 = 0; c0 <= tsteps + -1; c0++) {
if (n >= 2) {
<LOOP-START>for (c2 = 0; c2 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c2++) {
for (c8 = 0; c8 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c8++) {
for (c9 = (1 > 16 * c8?1 : 16 * c8); c9 <= ((16 * c8 + 15 < n + -1?16 * c8 + 15 : n + -1)); c9++) {
for (c15 = 16 * c2; c15 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c15++) {
B[c15][c9] = B[c15][c9] - A[c15][c9] * A[c15][c9] / B[c15][c9 - 1];
}
}
}
for (c8 = 0; c8 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c8++) {
for (c9 = (1 > 16 * c8?1 : 16 * c8); c9 <= ((16 * c8 + 15 < n + -1?16 * c8 + 15 : n + -1)); c9++) {
for (c15 = 16 * c2; c15 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c15++) {
X[c15][c9] = X[c15][c9] - X[c15][c9 - 1] * A[c15][c9] / B[c15][c9 - 1];
}
}
}
for (c8 = 0; c8 <= (((n + -3) * 16 < 0?((16 < 0?-((-(n + -3) + 16 + 1) / 16) : -((-(n + -3) + 16 - 1) / 16))) : (n + -3) / 16)); c8++) {
for (c9 = 16 * c8; c9 <= ((16 * c8 + 15 < n + -3?16 * c8 + 15 : n + -3)); c9++) {
for (c15 = 16 * c2; c15 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c15++) {
X[c15][n - c9 - 2] = (X[c15][n - 2 - c9] - X[c15][n - 2 - c9 - 1] * A[c15][n - c9 - 3]) / B[c15][n - 3 - c9];
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ,c15 ,c9 ,c8 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB044-adi-tile-no.c | #pragma omp parallel for private(c2 ,c15 ) | 100 | / B[c15][n - 3 - c9];
}
}
}
}
}
<LOOP-START>for (c2 = 0; c2 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c2++) {
#pragma omp parallel for
for (c15 = 16 * c2; c15 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c15++) {
X[c15][n - 1] = X[c15][n - 1] / B[c15][n - 1];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ,c15 ) <OMP-END> |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.