filename stringlengths 19 182 | omp_pragma_line stringlengths 24 416 | context_chars int64 100 100 | text stringlengths 152 177k |
|---|---|---|---|
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB044-adi-tile-no.c | #pragma omp parallel for | 100 | ?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c2++) {
<LOOP-START>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 <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB044-adi-tile-no.c | #pragma omp parallel for private(c2 ,c15 ,c9 ,c8 ) | 100 | [c15][n - 1] = X[c15][n - 1] / B[c15][n - 1];
}
}
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[c9][c15] = B[c9][c15] - A[c9][c15] * A[c9][c15] / B[c9 - 1][c15];
}
}
}
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[c9][c15] = X[c9][c15] - X[c9 - 1][c15] * A[c9][c15] / B[c9 - 1][c15];
}
}
}
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[n - 2 - c9][c15] = (X[n - 2 - c9][c15] - X[n - c9 - 3][c15] * A[n - 3 - c9][c15]) / B[n - 2 - c9][c15];
}
}
}
}<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[n - 2 - c9][c15];
}
}
}
}
}
<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[n - 1][c15] = X[n - 1][c15] / B[n - 1][c15];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ,c15 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB044-adi-tile-no.c | #pragma omp parallel for | 100 | ?-((-(n + -1) + 16 + 1) / 16) : -((-(n + -1) + 16 - 1) / 16))) : (n + -1) / 16)); c2++) {
<LOOP-START>for (c15 = 16 * c2; c15 <= ((16 * c2 + 15 < n + -1?16 * c2 + 15 : n + -1)); c15++) {
X[n - 1][c15] = X[n - 1][c15] / B[n - 1][c15];
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB067-restrictpointer1-orig-no.c | #pragma omp parallel for private(i ) | 100 | double real8;
void foo(real8 * restrict newSxx, real8 * restrict newSyy, int length)
{
int i;
<LOOP-START>for (i = 0; i <= length - 1; i += 1) {
newSxx[i] = 0.0;
newSyy[i] = 0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB024-simdtruedep-orig-yes.c | #pragma omp parallel for private(i ) | 100 | clude <stdio.h>
int main(int argc, char* argv[])
{
int i;
int len=100;
int a[100], b[100];
<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/baseline/dataracebench/DRB091-threadprivate2-orig-no.c | #pragma omp parallel for private(i ) reduction(+:sum0) | 100 | o.h>
#include <assert.h>
int sum0=0, sum1=0;
int main()
{
int len=1000;
int i, sum=0;
{
<LOOP-START>for (i=0;i<len;i++)
{
sum0=sum0+i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) reduction(+:sum0) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB091-threadprivate2-orig-no.c | #pragma omp parallel for private(i ) reduction(+:sum1) | 100 | ;i<len;i++)
{
sum0=sum0+i;
}
}
sum= sum+sum0;
/* reference calculation */
<LOOP-START>for (i=0;i<len;i++)
{
sum1=sum1+i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) reduction(+:sum1) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB018-plusplus-orig-yes.c | #pragma omp parallel for private(i ) | 100 | nt input[1000];
int output[1000];
int main()
{
int i ;
int inLen=1000 ;
int outLen = 0;
<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/DRB097-target-teams-distribute-orig-no.c | #pragma omp parallel for private(i ) | 100 | n = 2560;
double sum =0.0, sum2=0.0;
double a[len], b[len];
/*Initialize with some values*/
<LOOP-START>for (i=0; i<len; i++)
{
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/baseline/dataracebench/DRB084-threadprivatemissing-orig-yes.c | #pragma omp parallel for private(i ) reduction(+:sum0) | 100 | pragma omp threadprivate(sum0)
void foo (int i)
{
sum0=sum0+i;
}
int main()
{
int i, sum=0;
<LOOP-START>for (i=1;i<=1000;i++)
{
foo (i);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) reduction(+:sum0) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB084-threadprivatemissing-orig-yes.c | #pragma omp parallel for private(i ) reduction(+:sum1) | 100 | )
for (i=1;i<=1000;i++)
{
foo (i);
}
sum=sum+sum0;
/* reference calculation */
<LOOP-START>for (i=1;i<=1000;i++)
{
sum1=sum1+i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) reduction(+:sum1) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/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; i++)
A[i]=i;
pfile = fopen("mytempfile.txt","a+");
if (pfile ==NULL)
{
fprintf(stderr,"Error in fopen()\n");
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB099-targetparallelfor2-orig-no.c | #pragma omp parallel for private(i ) | 100 | map + array sections derived from pointers
*/
void foo (double* a, double* b, int N)
{
int i;
<LOOP-START>for (i=0;i< N ;i++)
b[i]=a[i]*(double)i;
}
int main(int argc, char* argv[])
{
int i;
int len = 1000;
double a[len], b[len];
#pragma omp parallel for private(i )
for (i=0; i<len; i++)
{
a[i]= ((double)i)/2.0;
b[i]=0.0;
}
foo(a, b, len);
printf("b[50]=%f\n",b[50]);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB099-targetparallelfor2-orig-no.c | #pragma omp parallel for private(i ) | 100 | uble)i;
}
int main(int argc, char* argv[])
{
int i;
int len = 1000;
double a[len], b[len];
<LOOP-START>for (i=0; i<len; i++)
{
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/baseline/dataracebench/DRB066-pointernoaliasing-orig-no.c | #pragma omp parallel for | 100 | * ) malloc (sizeof (double) * N );
double * m_nvol = (double* ) malloc (sizeof (double) * N );
<LOOP-START>for (int i=0; i < N; ++i )
{
m_pdv_sum[ i ] = 0.0;
m_nvol[ i ] = i*2.5;
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB092-threadprivatemissing2-orig-yes.c | #pragma omp parallel for private(i ) reduction(+:sum0) | 100 | sert.h>
int sum0=0, sum1=0;
//#pragma omp threadprivate(sum0)
int main()
{
int i, sum=0;
{
<LOOP-START>for (i=1;i<=1000;i++)
{
sum0=sum0+i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) reduction(+:sum0) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB092-threadprivatemissing2-orig-yes.c | #pragma omp parallel for private(i ) reduction(+:sum1) | 100 | =1000;i++)
{
sum0=sum0+i;
}
}
sum= sum+sum0;
/* reference calculation */
<LOOP-START>for (i=1;i<=1000;i++)
{
sum1=sum1+i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) reduction(+:sum1) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB061-matrixvector1-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | l loop parallelization
*/
#define N 100
double a[N][N],v[N],v_out[N];
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++) {
a[i][j] = i * j;
}
v_out[i] = i * j;
v[i] = i * j;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB061-matrixvector1-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++) {
a[i][j] = i * j;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB061-matrixvector1-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | }
v_out[i] = i * j;
v[i] = i * j;
}
return 0;
}
int mv()
{
int i,j;
<LOOP-START>for (i = 0; i < N; i++)
{
float sum = 0.0;
#pragma omp parallel for private(j ) reduction(+:sum)
for (j = 0; j < N; j++)
{
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/baseline/dataracebench/DRB061-matrixvector1-orig-no.c | #pragma omp parallel for private(j ) reduction(+:sum) | 100 | ma omp parallel for private(i ,j )
for (i = 0; i < N; i++)
{
float sum = 0.0;
<LOOP-START>for (j = 0; j < N; j++)
{
sum += a[i][j]*v[j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) reduction(+:sum) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB055-jacobi2d-parallel-no.c | #pragma omp parallel for private(c1 ,c2 ) | 100 | uble B[500 + 0][500 + 0])
{
//int i;
//int j;
{
int c2;
int c1;
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++) {
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/DRB055-jacobi2d-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++) {
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/DRB055-jacobi2d-parallel-no.c | #pragma omp parallel for private(c1 ,c2 ) | 100 | c0 + 3 * c2 + 2) / 3] + A[1 - 1][(-2 * c0 + 3 * c2 + 2) / 3]);
}
}
}
<LOOP-START>for (c1 = ((((2 * c0 + 2) * 3 < 0?-(-(2 * c0 + 2) / 3) : ((3 < 0?(-(2 * c0 + 2) + - 3 - 1) / - 3 : (2 * c0 + 2 + 3 - 1) / 3)))) > c0 + -9?(((2 * c0 + 2) * 3 < 0?-(-(2 * c0 + 2) / 3) : ((3 < 0?(-(2 * c0 + 2) + - 3 - 1) / - 3 : (2 * c0 + 2 + 3 - 1) / 3)))) : c0 + -9); c1 <= (((((2 * c0 + 498) * 3 < 0?((3 < 0?-((-(2 * c0 + 498) + 3 + 1) / 3) : -((-(2 * c0 + 498) + 3 - 1) / 3))) : (2 * c0 + 498) / 3)) < c0?(((2 * c0 + 498) * 3 < 0?((3 < 0?-((-(2 * c0 + 498) + 3 + 1) / 3) : -((-(2 * c0 + 498) + 3 - 1) / 3))) : (2 * c0 + 498) / 3)) : c0)); c1++) {
B[-2 * c0 + 3 * c1][1] = 0.2 * (A[-2 * c0 + 3 * c1][1] + A[-2 * c0 + 3 * c1][1 - 1] + A[-2 * c0 + 3 * c1][1 + 1] + A[1 + (-2 * c0 + 3 * c1)][1] + A[-2 * c0 + 3 * c1 - 1][1]);
for (c2 = 2 * c0 + -2 * c1 + 2; c2 <= 2 * c0 + -2 * c1 + 498; c2++) {
A[-2 * c0 + 3 * c1 + -1][-2 * c0 + 2 * c1 + c2 + -1] = B[-2 * c0 + 3 * c1 + -1][-2 * c0 + 2 * c1 + c2 + -1];
B[-2 * c0 + 3 * c1][-2 * c0 + 2 * c1 + c2] = 0.2 * (A[-2 * c0 + 3 * c1][-2 * c0 + 2 * c1 + c2] + A[-2 * c0 + 3 * c1][-2 * c0 + 2 * c1 + c2 - 1] + A[-2 * c0 + 3 * c1][1 + (-2 * c0 + 2 * c1 + c2)] + A[1 + (-2 * c0 + 3 * c1)][-2 * c0 + 2 * c1 + c2] + A[-2 * c0 + 3 * c1 - 1][-2 * c0 + 2 * c1 + c2]);
}
A[-2 * c0 + 3 * c1 + -1][498] = B[-2 * c0 + 3 * c1 + -1][498];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1 ,c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB055-jacobi2d-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | + 3 * c1 + -1][498];
}
if (c0 >= 499) {
if ((2 * c0 + 1) % 3 == 0) {
<LOOP-START>for (c2 = ((2 * c0 + -992) * 3 < 0?-(-(2 * c0 + -992) / 3) : ((3 < 0?(-(2 * c0 + -992) + - 3 - 1) / - 3 : (2 * c0 + -992 + 3 - 1) / 3))); c2 <= (((2 * c0 + 499) * 3 < 0?((3 < 0?-((-(2 * c0 + 499) + 3 + 1) / 3) : -((-(2 * c0 + 499) + 3 - 1) / 3))) : (2 * c0 + 499) / 3)); c2++) {
A[498][(-2 * c0 + 3 * c2 + 995) / 3] = B[498][(-2 * c0 + 3 * c2 + 995) / 3];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB055-jacobi2d-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | 3 * c2 + 995) / 3] = B[498][(-2 * c0 + 3 * c2 + 995) / 3];
}
}
}
}
<LOOP-START>for (c2 = 20; c2 <= 517; c2++) {
A[498][c2 + -19] = B[498][c2 + -19];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB065-pireduction-orig-no.c | #pragma omp parallel for private(i ,x ) reduction(+:pi) | 100 | le pi = 0.0;
long int i;
double x, interval_width;
interval_width = 1.0/(double)num_steps;
<LOOP-START>for (i = 0; i < num_steps; i++) {
x = (i+ 0.5) * interval_width;
pi += 1.0 / (x*x + 1.0);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,x ) reduction(+:pi) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB020-privatemissing-var-yes.c | #pragma omp parallel for private(i ) | 100 | rgv[])
{
int i;
int tmp;
int len=100;
if (argc>1)
len = atoi(argv[1]);
int a[len];
<LOOP-START>for (i=0;i<len;i++)
a[i]=i;
#pragma omp parallel for private(tmp )
for (i=0;i<len;i++)
{
tmp =a[i]+i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB020-privatemissing-var-yes.c | #pragma omp parallel for private(tmp ) | 100 | gv[1]);
int a[len];
#pragma omp parallel for private(i )
for (i=0;i<len;i++)
a[i]=i;
<LOOP-START>for (i=0;i<len;i++)
{
tmp =a[i]+i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(tmp ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB006-indirectaccess2-orig-yes.c | #pragma omp parallel for private(i ) | 100 | c(). Aborting ...\n");
return 1;
}
int i;
// initialize segments touched by indexSet
<LOOP-START>for (i =521; i<= 2025; ++i)
{
xa1[i]=0.5*i;
xa2[i]=1.5*i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB006-indirectaccess2-orig-yes.c | #pragma omp parallel for private(i ) | 100 | allel for private(i )
for (i =521; i<= 2025; ++i)
{
xa1[i]=0.5*i;
xa2[i]=1.5*i;
}
<LOOP-START>for (i =0; i< N; ++i)
{
int idx = indexSet[i];
xa1[idx]+= 1.0;
xa2[idx]+= 3.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB050-functionparameter-orig-yes.c | #pragma omp parallel for firstprivate(c ,o1 ,i ,len ) | 100 | Arrays passed as function parameters
*/
void foo1(double o1[], double c[], int len)
{
int i ;
<LOOP-START>for (i = 0; i < len; ++i) {
double volnew_o8 = 0.5 * c[i];
o1[i] = volnew_o8;
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(c ,o1 ,i ,len ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB050-functionparameter-orig-yes.c | #pragma omp parallel for private(i ) | 100 | i] = volnew_o8;
}
}
int main()
{
double o1[101];
double c[101];
int i;
int len = 100;
<LOOP-START>for (i = 0; i < len; ++i) {
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/baseline/dataracebench/DRB050-functionparameter-orig-no.c | #pragma omp parallel for private(i ) | 100 | Arrays passed as function parameters
*/
void foo1(double o1[], double c[], int len)
{
int i ;
<LOOP-START>for (i = 0; i < len; ++i) {
double volnew_o8 = 0.5 * c[i];
o1[i] = volnew_o8;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB050-functionparameter-orig-no.c | #pragma omp parallel for private(i ) | 100 | o1[i] = volnew_o8;
}
}
double o1[100];
double c[100];
int main()
{
int i;
int len = 100;
<LOOP-START>for (i = 0; i < len; ++i) {
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/baseline/dataracebench/DRB098-simd2-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | vate.
*/
int main()
{
int len=100;
double a[len][len], b[len][len], c[len][len];
int i,j;
<LOOP-START>for (i=0;i<len;i++)
#pragma omp parallel for private(j )
for (j=0;j<len;j++)
{
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/baseline/dataracebench/DRB098-simd2-orig-no.c | #pragma omp parallel for private(j ) | 100 | len], c[len][len];
int i,j;
#pragma omp parallel for private(i ,j )
for (i=0;i<len;i++)
<LOOP-START>for (j=0;j<len;j++)
{
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/baseline/dataracebench/DRB113-default-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | lt(shared) to cover another option.
*/
int a[100][100];
int b[100][100];
int main()
{
int i,j;
<LOOP-START>for (i=0;i<100;i++) {
#pragma omp parallel for private(j )
for (j=0;j<100;j++) {
a[i][j] = i;
b[i][j] = i;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB113-default-orig-no.c | #pragma omp parallel for private(j ) | 100 | 00];
int main()
{
int i,j;
#pragma omp parallel for private(i ,j )
for (i=0;i<100;i++) {
<LOOP-START>for (j=0;j<100;j++) {
a[i][j] = i;
b[i][j] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB100-task-reference-orig-no.c | #pragma omp parallel for private(i ) | 100 | MYLEN 100
int a[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/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private(i ,j ,xx ,yy ) | 100 | xx, yy;
dx = 2.0 / (n - 1);
dy = 2.0 / (m - 1);
/* Initialize initial condition and RHS */
<LOOP-START>for (i = 0; i < n; i++)
#pragma omp parallel for private(j ,xx ,yy )
for (j = 0; j < m; j++)
{
xx = (int) (-1.0 + dx * (i - 1)); /* -1 < x < 1 */
yy = (int) (-1.0 + dy * (j - 1)); /* -1 < y < 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/baseline/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private(j ,xx ,yy ) | 100 | ndition and RHS */
#pragma omp parallel for private(i ,j ,xx ,yy )
for (i = 0; i < n; i++)
<LOOP-START>for (j = 0; j < m; j++)
{
xx = (int) (-1.0 + dx * (i - 1)); /* -1 < x < 1 */
yy = (int) (-1.0 + dy * (j - 1)); /* -1 < y < 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(j ,xx ,yy ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private(j ) | 100 | k = 1;
while (k <= mits)
{
error = 0.0;
/* Copy new solution into old */
<LOOP-START>for (i = 0; i < n; i++)
#pragma omp parallel for
for (j = 0; j < m; j++)
uold[i][j] = u[i][j];
#pragma omp parallel for private(j ,resid ) reduction(+:error)
for (i = 1; i < (n - 1); i++)
#pragma omp parallel for private(resid ) reduction(+:error)
for (j = 1; j < (m - 1); j++)
{
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(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for | 100 | into old */
#pragma omp parallel for private(j )
for (i = 0; i < n; i++)
<LOOP-START>for (j = 0; j < m; j++)
uold[i][j] = u[i][j];
#pragma omp parallel for private(j ,resid ) reduction(+:error)
for (i = 1; i < (n - 1); i++)
#pragma omp parallel for private(resid ) reduction(+:error)
for (j = 1; j < (m - 1); j++)
{
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 <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private(j ,resid ) reduction(+:error) | 100 | agma omp parallel for
for (j = 0; j < m; j++)
uold[i][j] = u[i][j];
<LOOP-START>for (i = 1; i < (n - 1); i++)
#pragma omp parallel for private(resid ) reduction(+:error)
for (j = 1; j < (m - 1); j++)
{
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(j ,resid ) reduction(+:error) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB058-jacobikernel-orig-no.c | #pragma omp parallel for private(resid ) reduction(+:error) | 100 | parallel for private(j ,resid ) reduction(+:error)
for (i = 1; i < (n - 1); i++)
<LOOP-START>for (j = 1; j < (m - 1); j++)
{
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 ) reduction(+:error) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB070-simd1-orig-no.c | #pragma omp parallel for private(i ) | 100 | ay computation with a vetorization directive
*/
int a[100], b[100], c[100];
int main()
{
int i;
<LOOP-START>for (i=0;i<100;i++) {
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/baseline/dataracebench/DRB070-simd1-orig-no.c | #pragma omp parallel for private(i ) | 100 | el for private(i )
for (i=0;i<100;i++) {
a[i]= i * 40;
b[i] = i - 1;
c[i] = i;
}
<LOOP-START>for (i=0;i<100;i++)
a[i]=b[i]*c[i];
for (i=0;i<100;i++) {
printf("%d %d %d\n", a[i], b[i], c[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB090-static-local-orig-yes.c | #pragma omp parallel for private(i ) | 100 | clude<stdio.h>
int main(int argc, char* argv[])
{
int i;
int len=100;
int a[len], b[len];
<LOOP-START>for (i=0;i<len;i++)
{
a[i]=i;
b[i]=i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB090-static-local-orig-yes.c | #pragma omp parallel for private(i ,tmp ) | 100 |
a[i]=i;
b[i]=i;
}
/* static storage for a local variable */
{
static int tmp;
<LOOP-START>for (i=0;i<len;i++)
{
tmp = a[i]+i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,tmp ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB090-static-local-orig-yes.c | #pragma omp parallel for private(i ,tmp ) | 100 | ]+i;
a[i] = tmp;
}
}
/* automatic storage for a local variable */
{
int tmp;
<LOOP-START>for (i=0;i<len;i++)
{
tmp = b[i]+i;
b[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,tmp ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB062-matrixvector2-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | level parallelization.
*/
#define N 1000
double a[N][N],v[N],v_out[N];
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++) {
a[i][j] = i * j;
}
v_out[i] = i * j;
v[i] = i * j;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB062-matrixvector2-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++) {
a[i][j] = i * j;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB062-matrixvector2-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | }
v_out[i] = i * j;
v[i] = i * j;
}
return 0;
}
void mv()
{
int i,j;
<LOOP-START>for (i = 0; i < N; i++)
{
float sum = 0.0;
#pragma omp parallel for private(j ) reduction(+:sum)
for (j = 0; j < N; j++)
{
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/baseline/dataracebench/DRB062-matrixvector2-orig-no.c | #pragma omp parallel for private(j ) reduction(+:sum) | 100 | ma omp parallel for private(i ,j )
for (i = 0; i < N; i++)
{
float sum = 0.0;
<LOOP-START>for (j = 0; j < N; j++)
{
sum += a[i][j]*v[j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) reduction(+:sum) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB111-linearmissing-orig-yes.c | #pragma omp parallel for private(i ) | 100 | j@67:7 vs. j@68:5
*/
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/DRB111-linearmissing-orig-yes.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/DRB028-privatemissing-orig-yes.c | #pragma omp parallel for private(i ) | 100 | de <stdio.h>
int main(int argc, char* argv[])
{
int i;
int tmp;
int len=100;
int a[100];
<LOOP-START>for (i=0;i<len;i++)
a[i]=i;
#pragma omp parallel for private(i ,tmp )
for (i=0;i<len;i++)
{
tmp =a[i]+i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB028-privatemissing-orig-yes.c | #pragma omp parallel for private(i ,tmp ) | 100 | en=100;
int a[100];
#pragma omp parallel for private(i )
for (i=0;i<len;i++)
a[i]=i;
<LOOP-START>for (i=0;i<len;i++)
{
tmp =a[i]+i;
a[i] = tmp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,tmp ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB048-firstprivate-orig-no.c | #pragma omp parallel for private(i ) | 100 | nclude <stdlib.h>
/*
Example use of firstprivate()
*/
void foo(int * a, int n, int g)
{
int i;
<LOOP-START>for (i=0;i<n;i++)
{
a[i] = a[i]+g;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB048-firstprivate-orig-no.c | #pragma omp parallel for private(i ) | 100 | for (i=0;i<n;i++)
{
a[i] = a[i]+g;
}
}
int a[100];
int main()
{
int i;
int n = 100;
<LOOP-START>for (i=0;i<n;i++)
{
a[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB063-outeronly1-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | rallelized.
*/
int n=100, m=100;
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/DRB063-outeronly1-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/DRB063-outeronly1-orig-no.c | #pragma omp parallel for private(i ,j ) | 100 | for (j = 0; j < N; j++) {
b[i][j] = i * j;
}
}
return 0;
}
void foo()
{
int i,j;
<LOOP-START>for (i=0;i<n;i++)
for (j=0;j<m-1;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/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1 ,c2 ) | 100 | ble D[128 + 0][128 + 0])
{
//int i;
//int j;
{
int c2;
int c1;
if (nl >= 1) {
<LOOP-START>for (c1 = 0; c1 <= ((((((ni + -1 < nj + -1?ni + -1 : nj + -1)) < nk + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nk + -1)) < nm + -1?((((ni + -1 < nj + -1?ni + -1 : nj + -1)) < nk + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nk + -1)) : nm + -1)); c1++) {
#pragma omp parallel for private(c2 )
for (c2 = 0; c2 <= ((((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nl + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nl + -1)) < nm + -1?((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nl + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nl + -1)) : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
#pragma omp parallel for private(c2 )
for (c2 = nl; c2 <= ((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nm + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
#pragma omp parallel for private(c2 )
for (c2 = nm; c2 <= ((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nl + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nl + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
#pragma omp parallel for private(c2 )
for (c2 = (nl > nm?nl : nm); c2 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
#pragma omp parallel for private(c2 )
for (c2 = nj; c2 <= ((((nk + -1 < nl + -1?nk + -1 : nl + -1)) < nm + -1?((nk + -1 < nl + -1?nk + -1 : nl + -1)) : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
#pragma omp parallel for private(c2 )
for (c2 = (nj > nl?nj : nl); c2 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
#pragma omp parallel for private(c2 )
for (c2 = (nj > nm?nj : nm); c2 <= ((nk + -1 < nl + -1?nk + -1 : nl + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
#pragma omp parallel for private(c2 )
for (c2 = (((nj > nl?nj : nl)) > nm?((nj > nl?nj : nl)) : nm); c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
#pragma omp parallel for private(c2 )
for (c2 = nk; c2 <= ((((nj + -1 < nl + -1?nj + -1 : nl + -1)) < nm + -1?((nj + -1 < nl + -1?nj + -1 : nl + -1)) : nm + -1)); c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
#pragma omp parallel for private(c2 )
for (c2 = (nk > nl?nk : nl); c2 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
#pragma omp parallel for private(c2 )
for (c2 = (nk > nm?nk : nm); c2 <= ((nj + -1 < nl + -1?nj + -1 : nl + -1)); c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
#pragma omp parallel for private(c2 )
for (c2 = (((nk > nl?nk : nl)) > nm?((nk > nl?nk : nl)) : nm); c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
#pragma omp parallel for private(c2 )
for (c2 = (nj > nk?nj : nk); c2 <= ((nl + -1 < nm + -1?nl + -1 : nm + -1)); c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
#pragma omp parallel for private(c2 )
for (c2 = (((nj > nk?nj : nk)) > nl?((nj > nk?nj : nk)) : nl); c2 <= nm + -1; c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
#pragma omp parallel for private(c2 )
for (c2 = (((nj > nk?nj : nk)) > nm?((nj > nk?nj : nk)) : nm); c2 <= nl + -1; c2++) {
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1 ,c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | nj + -1)) < nk + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nk + -1)) : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; c2 <= ((((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nl + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nl + -1)) < nm + -1?((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nl + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nl + -1)) : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | (double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
<LOOP-START>for (c2 = nl; c2 <= ((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nm + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
<LOOP-START>for (c2 = nm; c2 <= ((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nl + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nl + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | double )c1) * (c2 + 1) / nj;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
<LOOP-START>for (c2 = (nl > nm?nl : nm); c2 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | ] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
<LOOP-START>for (c2 = nj; c2 <= ((((nk + -1 < nl + -1?nk + -1 : nl + -1)) < nm + -1?((nk + -1 < nl + -1?nk + -1 : nl + -1)) : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
<LOOP-START>for (c2 = (nj > nl?nj : nl); c2 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | ] = ((double )c1) * c2 / ni;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
<LOOP-START>for (c2 = (nj > nm?nj : nm); c2 <= ((nk + -1 < nl + -1?nk + -1 : nl + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | ] = ((double )c1) * c2 / ni;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
<LOOP-START>for (c2 = (((nj > nl?nj : nl)) > nm?((nj > nl?nj : nl)) : nm); c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | nl)) : nm); c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
<LOOP-START>for (c2 = nk; c2 <= ((((nj + -1 < nl + -1?nj + -1 : nl + -1)) < nm + -1?((nj + -1 < nl + -1?nj + -1 : nl + -1)) : nm + -1)); c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
<LOOP-START>for (c2 = (nk > nl?nk : nl); c2 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
<LOOP-START>for (c2 = (nk > nm?nk : nm); c2 <= ((nj + -1 < nl + -1?nj + -1 : nl + -1)); c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | double )c1) * (c2 + 1) / nj;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
<LOOP-START>for (c2 = (((nk > nl?nk : nl)) > nm?((nk > nl?nk : nl)) : nm); c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | nm); c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
<LOOP-START>for (c2 = (nj > nk?nj : nk); c2 <= ((nl + -1 < nm + -1?nl + -1 : nm + -1)); c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | double )c1) * (c2 + 3) / nl;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
<LOOP-START>for (c2 = (((nj > nk?nj : nk)) > nl?((nj > nk?nj : nk)) : nl); c2 <= nm + -1; c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | nl); c2 <= nm + -1; c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
<LOOP-START>for (c2 = (((nj > nk?nj : nk)) > nm?((nj > nk?nj : nk)) : nm); c2 <= nl + -1; c2++) {
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1 ,c2 ) | 100 | D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nl <= 0) {
<LOOP-START>for (c1 = 0; c1 <= ((((((ni + -1 < nj + -1?ni + -1 : nj + -1)) < nk + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nk + -1)) < nm + -1?((((ni + -1 < nj + -1?ni + -1 : nj + -1)) < nk + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nk + -1)) : nm + -1)); c1++) {
#pragma omp parallel for private(c2 )
for (c2 = 0; c2 <= ((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nm + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
#pragma omp parallel for private(c2 )
for (c2 = nm; c2 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
#pragma omp parallel for private(c2 )
for (c2 = nj; c2 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
#pragma omp parallel for private(c2 )
for (c2 = (nj > nm?nj : nm); c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
#pragma omp parallel for private(c2 )
for (c2 = nk; c2 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
#pragma omp parallel for private(c2 )
for (c2 = (nk > nm?nk : nm); c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
#pragma omp parallel for private(c2 )
for (c2 = (nj > nk?nj : nk); c2 <= nm + -1; c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1 ,c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | 1 : nj + -1)) < nk + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nk + -1)) : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; c2 <= ((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nm + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
<LOOP-START>for (c2 = nm; c2 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | ] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
<LOOP-START>for (c2 = nj; c2 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | ] = ((double )c1) * c2 / ni;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
<LOOP-START>for (c2 = (nj > nm?nj : nm); c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | m?nj : nm); c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
<LOOP-START>for (c2 = nk; c2 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
<LOOP-START>for (c2 = (nk > nm?nk : nm); c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | nm); c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
<LOOP-START>for (c2 = (nj > nk?nj : nk); c2 <= nm + -1; c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1 ,c2 ) | 100 | C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}
}
if (nm >= 1) {
<LOOP-START>for (c1 = nm; c1 <= ((((ni + -1 < nj + -1?ni + -1 : nj + -1)) < nk + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nk + -1)); c1++) {
#pragma omp parallel for private(c2 )
for (c2 = 0; c2 <= nm + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
#pragma omp parallel for private(c2 )
for (c2 = nm; c2 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
#pragma omp parallel for private(c2 )
for (c2 = nj; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
#pragma omp parallel for private(c2 )
for (c2 = nk; c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1 ,c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | + -1?ni + -1 : nj + -1)) < nk + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nk + -1)); c1++) {
<LOOP-START>for (c2 = 0; c2 <= nm + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
<LOOP-START>for (c2 = nm; c2 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | ] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
<LOOP-START>for (c2 = nj; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | r (c2 = nj; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
<LOOP-START>for (c2 = nk; c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1 ,c2 ) | 100 | B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}
}
if (nm <= 0) {
<LOOP-START>for (c1 = 0; c1 <= ((((ni + -1 < nj + -1?ni + -1 : nj + -1)) < nk + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nk + -1)); c1++) {
#pragma omp parallel for private(c2 )
for (c2 = 0; c2 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
#pragma omp parallel for private(c2 )
for (c2 = nj; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
#pragma omp parallel for private(c2 )
for (c2 = nk; c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1 ,c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | j + -1?ni + -1 : nj + -1)) < nk + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nk + -1)); c1++) {
<LOOP-START>for (c2 = 0; c2 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | ] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
<LOOP-START>for (c2 = nj; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | r (c2 = nj; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
<LOOP-START>for (c2 = nk; c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1 ,c2 ) | 100 | 1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}
}
if (nj >= 1 && nl >= 1) {
<LOOP-START>for (c1 = nj; c1 <= ((((ni + -1 < nk + -1?ni + -1 : nk + -1)) < nm + -1?((ni + -1 < nk + -1?ni + -1 : nk + -1)) : nm + -1)); c1++) {
#pragma omp parallel for private(c2 )
for (c2 = 0; c2 <= ((nj + -1 < nl + -1?nj + -1 : nl + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
#pragma omp parallel for private(c2 )
for (c2 = nl; c2 <= nj + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
#pragma omp parallel for private(c2 )
for (c2 = nj; c2 <= ((nk + -1 < nl + -1?nk + -1 : nl + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
#pragma omp parallel for private(c2 )
for (c2 = (nj > nl?nj : nl); c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
#pragma omp parallel for private(c2 )
for (c2 = nk; c2 <= nl + -1; c2++) {
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1 ,c2 ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2 ) | 100 | nk + -1?ni + -1 : nk + -1)) < nm + -1?((ni + -1 < nk + -1?ni + -1 : nk + -1)) : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; c2 <= ((nj + -1 < nl + -1?nj + -1 : nl + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2 ) <OMP-END> |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.