filename stringlengths 19 182 | omp_pragma_line stringlengths 24 416 | context_chars int64 100 100 | text stringlengths 152 177k |
|---|---|---|---|
LLNL/dataracebench/micro-benchmarks/DRB043-adi-parallel-no.c | #pragma omp parallel for private(c8) | 100 | int i2;
//#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[c... |
LLNL/dataracebench/micro-benchmarks/DRB043-adi-parallel-no.c | #pragma omp parallel for | 100 | - 2 - 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<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB043-adi-parallel-no.c | #pragma omp parallel for private(c8) | 100 | for (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[c... |
LLNL/dataracebench/micro-benchmarks/DRB043-adi-parallel-no.c | #pragma omp parallel for | 100 | - 2 - 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<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB195-diffusion1-yes.c | #pragma omp parallel for | 100 | ) / RAND_MAX;
u1[0] = u1[n - 1] = u2[0] = u2[n - 1] = 0.5;
for (int t = 0; t < nsteps; t++)
{
<LOOP-START>for (int i = 1; i < n - 1; i++)
{
u2[i] = u1[i] + c * (u1[i - 1] + u1[i + 1] - 2 * u1[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB021-reductionmissing-orig-yes.c | #pragma omp parallel for private (temp,i,j) | 100 | oat u[100][100];
for (i = 0; i < len; i++)
for (j = 0; j < len; j++)
u[i][j] = 0.5;
<LOOP-START>for (i = 0; i < len; i++)
for (j = 0; j < len; j++)
{
temp = u[i][j];
sum = sum + temp * temp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (temp,i,j)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB019-plusplus-var-yes.c | #pragma omp parallel for | 100 | i(argv[1]);
int input[inLen];
int output[inLen];
for (i=0; i<inLen; ++i)
input[i]=i;
<LOOP-START>for (i=0; i<inLen; ++i) {
output[outLen++] = input[i] ;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB012-minusminus-var-yes.c | #pragma omp parallel for | 100 | x[len];
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-- ;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB022-reductionmissing-var-yes.c | #pragma omp parallel for private (temp,i,j) | 100 | loat u[len][len];
for (i = 0; i < len; i++)
for (j = 0; j < len; j++)
u[i][j] = 0.5;
<LOOP-START>for (i = 0; i < len; i++)
for (j = 0; j < len; j++)
{
temp = u[i][j];
sum = sum + temp * temp;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (temp,i,j)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB056-jacobi2d-tile-no.c | #pragma omp parallel for private(c3, c4, c2) | 100 | 0 + 0])
{
//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++) {
for (c2 = 0; c2 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + ... |
LLNL/dataracebench/micro-benchmarks/DRB056-jacobi2d-tile-no.c | #pragma omp parallel for private(c5, c4, c2, c3) | 100 | 16 + 1) / 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 * c... |
LLNL/dataracebench/micro-benchmarks/DRB171-threadprivate3-orig-no.c | #pragma omp parallel for default(shared) | 100 | <stdio.h>
static double x[20];
#pragma omp threadprivate(x)
int main(){
int i;
double j,k;
<LOOP-START>for (i = 0; i < 20; i++){
x[i] = -1.0;
if(omp_get_thread_num()==0){
j = x[0];
}
if(omp_get_thread_num()==0){
k = i+0.05;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for def... |
LLNL/dataracebench/micro-benchmarks/DRB053-inneronly1-orig-no.c | #pragma omp parallel for | 100 | int i;
int j;
double a[20][20];
memset(a,0,(sizeof(a)));
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<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB197-diffusion2-yes.c | #pragma omp parallel for | 100 | 0] = u[0][n - 1] = u[1][0] = u[1][n - 1] = 0.5;
int p = 0;
for (int t = 0; t < nsteps; t++)
{
<LOOP-START>for (int i = 1; i < n - 1; i++)
{
u[1 - p][i] = u[p][i] + c * (u[p][i - 1] + u[p][i + 1] - 2 * u[p][i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB112-linear-orig-no.c | #pragma omp parallel for linear(j) | 100 | <len;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 linear(j)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB199-prodcons-yes.c | #pragma omp parallel for shared(size, cap, nprod, ncons, nthread) firstprivate(packages) num_threads(nthread) | 100 | = 4, ncons = 4;
int cap = 5, size = 0, packages = 1000;
int main()
{
int nthread = nprod + ncons;
<LOOP-START>for (int i = 0; i < nthread; i++)
{
if (i < nprod)
while (packages)
{ // I am a producer
#pragma omp critical(A)
if (size < cap)
{
size++; // produce
pack... |
LLNL/dataracebench/micro-benchmarks/DRB016-outputdep-orig-yes.c | #pragma omp parallel for | 100 | 74:5:W vs. x@74:5:W
*/
#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 <OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB109-orderedmissing-orig-yes.c | #pragma omp parallel for ordered | 100 | Missing the ordered clause
* Data race pair: x@56:5:W vs. x@56:5:W
* */
int main()
{
int x =0;
<LOOP-START>for (int i = 0; i < 100; ++i) {
x++;
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered <OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB194-diffusion1-no.c | #pragma omp parallel for | 100 | ) / RAND_MAX;
u1[0] = u1[n - 1] = u2[0] = u2[n - 1] = 0.5;
for (int t = 0; t < nsteps; t++)
{
<LOOP-START>for (int i = 1; i < n - 1; i++)
{
u2[i] = u1[i] + c * (u1[i - 1] + u1[i + 1] - 2 * u1[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB196-diffusion2-no.c | #pragma omp parallel for | 100 | 0] = u[0][n - 1] = u[1][0] = u[1][n - 1] = 0.5;
int p = 0;
for (int t = 0; t < nsteps; t++)
{
<LOOP-START>for (int i = 1; i < n - 1; i++)
{
u[1 - p][i] = u[p][i] + c * (u[p][i - 1] + u[p][i + 1] - 2 * u[p][i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB008-indirectaccess4-orig-yes.c | #pragma omp parallel for | 100 | / initialize segments touched by indexSet
for (i =521; i<= 2025; ++i)
{
base[i]=0.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 <OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB110-ordered-orig-no.c | #pragma omp parallel for ordered | 100 | Univ.
* 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/dataracebench/micro-benchmarks/DRB064-outeronly2-orig-no.c | #pragma omp parallel for private(j) | 100 | arallelized so no race condition.
*/
int n=100, m=100;
double b[100][100];
void foo()
{
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 main()
{
foo();
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB017-outputdep-var-yes.c | #pragma omp parallel for | 100 | ar* 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 <OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB059-lastprivate-orig-no.c | #pragma omp parallel for private (i) lastprivate (x) | 100 | ue 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/dataracebench/micro-benchmarks/DRB044-adi-tile-no.c | #pragma omp parallel for private(c4, c2, c3) | 100 | 0 + 0])
{
//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++) {
for (c2 = 0; c2 <= (((n + -1) * 16 < 0?((16 < 0?-((-(n + -1) + ... |
LLNL/dataracebench/micro-benchmarks/DRB044-adi-tile-no.c | #pragma omp parallel for private(c15, c9, c8) | 100 | if (n >= 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... |
LLNL/dataracebench/micro-benchmarks/DRB044-adi-tile-no.c | #pragma omp parallel for private(c15) | 100 | 9 - 3]) / 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 simd
for (c15 = 16 * c2; c15 <= ((16 * c2 + 15 < ... |
LLNL/dataracebench/micro-benchmarks/DRB044-adi-tile-no.c | #pragma omp parallel for private(c15, c9, c8) | 100 | X[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... |
LLNL/dataracebench/micro-benchmarks/DRB044-adi-tile-no.c | #pragma omp parallel for private(c15) | 100 | ][c15]) / 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 simd
for (c15 = 16 * c2; c15 <= ((16 * c2 + 15 < ... |
LLNL/dataracebench/micro-benchmarks/DRB067-restrictpointer1-orig-no.c | #pragma omp parallel for private (i) firstprivate (length) | 100 | f 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) firstprivate (length)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB018-plusplus-orig-yes.c | #pragma omp parallel for | 100 | )
{
int i ;
int inLen=1000 ;
int outLen = 0;
for (i=0; i<inLen; ++i)
input[i]= i;
<LOOP-START>for (i=0; i<inLen; ++i)
{
output[outLen++] = input[i] ;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB035-truedepscalar-orig-yes.c | #pragma omp parallel for | 100 | int main(int argc, char* argv[])
{
int i;
int tmp;
tmp = 10;
int len=100;
int a[100];
<LOOP-START>for (i=0;i<len;i++)
{
a[i] = tmp;
tmp =a[i]+i;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB049-fprintf-orig-no.c | #pragma omp parallel for | 100 | open("mytempfile.txt","a+");
if (pfile ==NULL)
{
fprintf(stderr,"Error in fopen()\n");
}
<LOOP-START>for (i=0; i<len; ++i)
{
fprintf(pfile, "%d\n", A[i] );
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB099-targetparallelfor2-orig-no.c | #pragma omp parallel for | 100 | id foo (double* a, double* b, int N)
{
int i;
#pragma omp target map(to:a[0:N]) map(from:b[0:N])
<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];
for (i=0; i<len; i++)
{
a[i]= ((double)i)/2.0;
b[i]=0.0;
}
... |
LLNL/dataracebench/micro-benchmarks/DRB066-pointernoaliasing-orig-no.c | #pragma omp parallel for schedule(static) | 100 | le* ) 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 schedule(static)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB061-matrixvector1-orig-no.c | #pragma omp parallel for private (i,j) | 100 | op parallelization
*/
#define N 100
double a[N][N],v[N],v_out[N];
int mv()
{
int i,j;
<LOOP-START>for (i = 0; i < N; i++)
{
float sum = 0.0;
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... |
LLNL/dataracebench/micro-benchmarks/DRB094-doall2-ordered-orig-no.c | #pragma omp parallel for ordered(2) | 100 | s needed to compile this test."
#endif
#include <stdio.h>
int a[100][100];
int main()
{
int i, j;
<LOOP-START>for (i = 0; i < 100; i++)
for (j = 0; j < 100; j++)
{
a[i][j] = a[i][j] + 1;
#pragma omp ordered depend(sink:i-1,j) depend (sink:i,j-1)
printf ("test i=%d j=%d\n",i,j);
#pragma omp ordered... |
LLNL/dataracebench/micro-benchmarks/DRB055-jacobi2d-parallel-no.c | #pragma omp parallel for private(c2) | 100 | 0],double 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++) {
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;
}
... |
LLNL/dataracebench/micro-benchmarks/DRB055-jacobi2d-parallel-no.c | #pragma omp parallel for private(c2) | 100 | [(-2 * 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) +... |
LLNL/dataracebench/micro-benchmarks/DRB036-truedepscalar-var-yes.c | #pragma omp parallel for | 100 | nt i;
int tmp;
tmp = 10;
int len=100;
if (argc>1)
len = atoi(argv[1]);
int a[len];
<LOOP-START>for (i=0;i<len;i++)
{
a[i] = tmp;
tmp =a[i]+i;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB065-pireduction-orig-no.c | #pragma omp parallel for reduction(+:pi) private(x) | 100 | uble 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 reduction(+:pi) private(x)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB020-privatemissing-var-yes.c | #pragma omp parallel for | 100 | nt len=100;
if (argc>1)
len = atoi(argv[1]);
int a[len];
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<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB006-indirectaccess2-orig-yes.c | #pragma omp parallel for | 100 | / initialize segments touched by indexSet
for (i =521; i<= 2025; ++i)
{
base[i]=0.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 <OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB179-thread-sensitivity-yes.c | #pragma omp parallel for shared(A) | 100 | ain(int argc, char *argv[]) {
int *A;
int N = 100;
A = (int*) malloc(sizeof(int) * N);
<LOOP-START>for(int i = 0; i < N; i++) {
A[i] = i;
if (i == 1)
{
A[0] = 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(A)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB170-nestedloops-orig-no.c | #pragma omp parallel for private(j,k,tmp1) | 100 | #include <omp.h>
int main(){
int i,j,k,m;
double tmp1;
double a[12][12][12];
m = 3.0;
<LOOP-START>for (i = 0; i < 12; i++) {
for (j = 0; j < 12; j++) {
for (k = 0; k < 12; k++) {
tmp1 = 6.0/m;
a[i][j][k] = tmp1+4;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for pr... |
LLNL/dataracebench/micro-benchmarks/DRB050-functionparameter-orig-no.c | #pragma omp parallel for | 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<OMP-END> |
LLNL/dataracebench/micro-benchmarks/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++)
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;
... |
LLNL/dataracebench/micro-benchmarks/DRB062-matrixvector2-orig-no.c | #pragma omp parallel for reduction(+:sum) | 100 | [N];
void mv()
{
int 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 reduction(+:sum)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | 1?0 : -1 * nj + -1 * nm + 1)) && nj >= 0 && nk >= ((0 > -1 * nm + 1?0 : -1 * nm + 1)) && nm >= 0) {
<LOOP-START>for (c1 = 0; c1 <= (((((nk + ni + nj + nm + -1) * 16 < 0?((16 < 0?-((-(nk + ni + nj + nm + -1) + 16 + 1) / 16) : -((-(nk + ni + nj + nm + -1) + 16 - 1) / 16))) : (nk + ni + nj + nm + -1) / 16)) < (((nk + ni +... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | }
}
if (ni >= ((0 > -1 * nj + 1?0 : -1 * nj + 1)) && nj >= 0 && nk >= 1 && nm <= -1) {
<LOOP-START>for (c1 = 0; c1 <= (((((nk + ni + -1) * 16 < 0?((16 < 0?-((-(nk + ni + -1) + 16 + 1) / 16) : -((-(nk + ni + -1) + 16 - 1) / 16))) : (nk + ni + -1) / 16)) < (((nk + ni + nj + -2) * 16 < 0?((16 < 0?-((-(nk + ni... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | }
}
if (ni >= 0 && nj <= -1 && nk >= ((0 > -1 * nm + 1?0 : -1 * nm + 1)) && nm >= 0) {
<LOOP-START>for (c1 = 0; c1 <= (((ni + nm + -1) * 16 < 0?((16 < 0?-((-(ni + nm + -1) + 16 + 1) / 16) : -((-(ni + nm + -1) + 16 - 1) / 16))) : (ni + nm + -1) / 16)); c1++) {
if (c1 <= (((((ni + -1) * 16 < 0?((16 <... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | }
}
}
}
}
}
if (nj <= -1 && nk >= 1 && nm <= -1) {
<LOOP-START>for (c1 = 0; c1 <= (((ni + -1) * 16 < 0?((16 < 0?-((-(ni + -1) + 16 + 1) / 16) : -((-(ni + -1) + 16 - 1) / 16))) : (ni + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nk + -1) * 16 < 0?((16 < 0?-((-(nk + ... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | }
}
}
}
}
if (ni >= 0 && nj >= 0 && nk <= -1 && nm >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((nj + nm + -1) * 16 < 0?((16 < 0?-((-(nj + nm + -1) + 16 + 1) / 16) : -((-(nj + nm + -1) + 16 - 1) / 16))) : (nj + nm + -1) / 16)); c1++) {
if (c1 <= (((((nj + -1) * 16 < 0?((16 <... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | }
}
}
}
}
if (ni >= 0 && nj <= -1 && nk <= -1 && nl >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((nm + -1) * 16 < 0?((16 < 0?-((-(nm + -1) + 16 + 1) / 16) : -((-(nm + -1) + 16 - 1) / 16))) : (nm + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nl + -1) * 16 < 0?((16 < 0?-((-(nl + ... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | j >= ((0 > -1 * nm + 1?0 : -1 * nm + 1)) && nk >= ((0 > -1 * nm + 1?0 : -1 * nm + 1)) && nm >= 0) {
<LOOP-START>for (c1 = 0; c1 <= (((((nk + nj + nm + -1) * 16 < 0?((16 < 0?-((-(nk + nj + nm + -1) + 16 + 1) / 16) : -((-(nk + nj + nm + -1) + 16 - 1) / 16))) : (nk + nj + nm + -1) / 16)) < (((nk + nj + 2 * nm + -2) * 16 <... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | }
}
}
}
}
}
if (ni <= -1 && nj >= 1 && nm <= -1) {
<LOOP-START>for (c1 = 0; c1 <= (((nk + -1) * 16 < 0?((16 < 0?-((-(nk + -1) + 16 + 1) / 16) : -((-(nk + -1) + 16 - 1) / 16))) : (nk + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nj + -1) * 16 < 0?((16 < 0?-((-(nj + ... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | }
}
}
}
}
if (ni <= -1 && nj <= -1 && nk >= 0 && nl >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((nm + -1) * 16 < 0?((16 < 0?-((-(nm + -1) + 16 + 1) / 16) : -((-(nm + -1) + 16 - 1) / 16))) : (nm + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nl + -1) * 16 < 0?((16 < 0?-((-(nl + ... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | }
}
}
}
}
if (ni <= -1 && nj >= 0 && nk <= -1 && nm >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((nj + nm + -1) * 16 < 0?((16 < 0?-((-(nj + nm + -1) + 16 + 1) / 16) : -((-(nj + nm + -1) + 16 - 1) / 16))) : (nj + nm + -1) / 16)); c1++) {
if (c1 <= (((((nj + -1) * 16 < 0?((16 <... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c2, c4, c3) | 100 | }
}
}
}
}
if (ni <= -1 && nj <= -1 && nk <= -1 && nl >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((nm + -1) * 16 < 0?((16 < 0?-((-(nm + -1) + 16 + 1) / 16) : -((-(nm + -1) + 16 - 1) / 16))) : (nm + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nl + -1) * 16 < 0?((16 < 0?-((-(nl + ... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c7, c2, c10) | 100 | int c10;
int c2;
int c1;
int c6;
int c7;
if (ni >= 0 && nj >= 0 && nl >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((nj + ni + -1) * 16 < 0?((16 < 0?-((-(nj + ni + -1) + 16 + 1) / 16) : -((-(nj + ni + -1) + 16 - 1) / 16))) : (nj + ni + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nl + -1) * 16 < 0... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c7, c2, c10) | 100 | 0;
}
}
}
}
}
}
if (ni <= -1 && nl >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((nj + -1) * 16 < 0?((16 < 0?-((-(nj + -1) + 16 + 1) / 16) : -((-(nj + -1) + 16 - 1) / 16))) : (nj + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nl + -1) * 16 < 0?((16 < 0?-((-(nl + ... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c7, c2, c10) | 100 | F[c10][c7] = 0;
}
}
}
}
}
if (nj <= -1 && nl >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((ni + -1) * 16 < 0?((16 < 0?-((-(ni + -1) + 16 + 1) / 16) : -((-(ni + -1) + 16 - 1) / 16))) : (ni + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nl + -1) * 16 < 0?((16 < 0?-((-(nl + ... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c7, c6, c2, c10, c5) | 100 | G[c10][c7] = 0;
}
}
}
}
}
if (nl >= 1 && nm >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((nj + -1) * 16 < 0?((16 < 0?-((-(nj + -1) + 16 + 1) / 16) : -((-(nj + -1) + 16 - 1) / 16))) : (nj + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nl + -1) * 16 < 0?((16 < 0?-((-(nl + ... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c7, c2, c10) | 100 | }
}
}
}
}
}
}
if (nj >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((ni + -1) * 16 < 0?((16 < 0?-((-(ni + -1) + 16 + 1) / 16) : -((-(ni + -1) + 16 - 1) / 16))) : (ni + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nj + -1) * 16 < 0?((16 < 0?-((-(nj + ... |
LLNL/dataracebench/micro-benchmarks/DRB042-3mm-tile-no.c | #pragma omp parallel for private(c7, c6, c2, c10, c5) | 100 |
E[c10][c7] = 0;
}
}
}
}
}
if (nj >= 1) {
<LOOP-START>for (c1 = 0; c1 <= (((ni + -1) * 16 < 0?((16 < 0?-((-(ni + -1) + 16 + 1) / 16) : -((-(ni + -1) + 16 - 1) / 16))) : (ni + -1) / 16)); c1++) {
for (c2 = 0; c2 <= (((nj + -1) * 16 < 0?((16 < 0?-((-(nj + ... |
LLNL/dataracebench/micro-benchmarks/DRB111-linearmissing-orig-yes.c | #pragma omp parallel for | 100 | <len;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 <OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB028-privatemissing-orig-yes.c | #pragma omp parallel for | 100 | char* argv[])
{
int i;
int tmp;
int len=100;
int a[100];
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<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB048-firstprivate-orig-no.c | #pragma omp parallel for firstprivate (g) | 100 | OF SUCH DAMAGE.
*/
/*
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 firstprivate (g)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB155-missingordered-orig-gpu-no.c | #pragma omp parallel for ordered | 100 | for(int i=0; i<N; i++){
var[i]=0;
}
#pragma omp target map(tofrom:var[0:N]) device(0)
<LOOP-START>for (int i=1; i<N; i++){
#pragma omp ordered
{
var[i]=var[i-1]+1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for ordered<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB063-outeronly1-orig-no.c | #pragma omp parallel for private(j) | 100 | ost loop can be parallelized.
*/
int n=100, m=100;
double b[100][100];
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 main()
{
foo();
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB178-input-dependence-var-yes.c | #pragma omp parallel for shared(A) | 100 | (argc>1)
N = atoi(argv[1]);
A = (int*) malloc(sizeof(int) * N);
load_from_input(A, N);
<LOOP-START>for(int i = 0; i < N; i++) {
A[i] = i;
if (N > 10000)
{
A[0] = 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(A)<OMP-END> |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | 0],double 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?n... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(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?n... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(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++) {
for (c2 = 0; c2 <= nm + -1; c2++) {
A[c1][c2] = ((double ... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(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++) {
for (c2 = 0; c2 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c2++) {
... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | B[c1][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++) {
for (c2 = 0; c2 <= ((nj + -1 < nl + -1?nj + -1 : nl + -1)); c2++) {... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nj >= 1 && nl <= 0) {
<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++) {
for (c2 = 0; c2 <= nj + -1; c2++) {
A[c1][c2] = ((double ... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
}
}
if (nj >= 1) {
<LOOP-START>for (c1 = (nj > nm?nj : nm); c1 <= ((ni + -1 < nk + -1?ni + -1 : nk + -1)); c1++) {
for (c2 = 0; c2 <= nj + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
B[c1][c2] = ((double )c... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | A[c1][c2] = ((double )c1) * c2 / ni;
}
}
}
if (nj <= 0 && nl >= 1) {
<LOOP-START>for (c1 = 0; c1 <= ((((ni + -1 < nk + -1?ni + -1 : nk + -1)) < nm + -1?((ni + -1 < nk + -1?ni + -1 : nk + -1)) : nm + -1)); c1++) {
for (c2 = 0; c2 <= ((nk + -1 < nl + -1?nk + -1 : nl + -1)); c2++) {
... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nj <= 0 && nl <= 0) {
<LOOP-START>for (c1 = 0; c1 <= ((((ni + -1 < nk + -1?ni + -1 : nk + -1)) < nm + -1?((ni + -1 < nk + -1?ni + -1 : nk + -1)) : nm + -1)); c1++) {
for (c2 = 0; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
}
}
if (nj <= 0) {
<LOOP-START>for (c1 = (0 > nm?0 : nm); c1 <= ((ni + -1 < nk + -1?ni + -1 : nk + -1)); c1++) {
for (c2 = 0; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
}<LOOP-END> <OMP-ST... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | A[c1][c2] = ((double )c1) * c2 / ni;
}
}
}
if (nk >= 1 && nl >= 1) {
<LOOP-START>for (c1 = nk; c1 <= ((((ni + -1 < nj + -1?ni + -1 : nj + -1)) < nm + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nm + -1)); c1++) {
for (c2 = 0; c2 <= ((nk + -1 < nl + -1?nk + -1 : nl + -1)); c2++) {... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nk >= 1 && nl <= 0) {
<LOOP-START>for (c1 = nk; c1 <= ((((ni + -1 < nj + -1?ni + -1 : nj + -1)) < nm + -1?((ni + -1 < nj + -1?ni + -1 : nj + -1)) : nm + -1)); c1++) {
for (c2 = 0; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double ... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}
}
if (nk >= 1 && nm >= 1) {
<LOOP-START>for (c1 = (nk > nm?nk : nm); c1 <= ((ni + -1 < nj + -1?ni + -1 : nj + -1)); c1++) {
for (c2 = 0; c2 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}
}
if (nk >= 1 && nm <= 0) {
<LOOP-START>for (c1 = nk; c1 <= ((ni + -1 < nj + -1?ni + -1 : nj + -1)); c1++) {
for (c2 = 0; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
}<LOOP-END> <OMP-START>#pragma o... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | A[c1][c2] = ((double )c1) * c2 / ni;
}
}
}
if (nk >= 1 && nl >= 1) {
<LOOP-START>for (c1 = (nj > nk?nj : nk); c1 <= ((ni + -1 < nm + -1?ni + -1 : nm + -1)); c1++) {
for (c2 = 0; c2 <= ((nk + -1 < nl + -1?nk + -1 : nl + -1)); c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nk >= 1 && nl <= 0) {
<LOOP-START>for (c1 = (nj > nk?nj : nk); c1 <= ((ni + -1 < nm + -1?ni + -1 : nm + -1)); c1++) {
for (c2 = 0; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
}<LOOP-END> <OMP-... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
}
}
if (nk >= 1) {
<LOOP-START>for (c1 = (((nj > nk?nj : nk)) > nm?((nj > nk?nj : nk)) : nm); c1 <= ni + -1; c1++) {
for (c2 = 0; c2 <= nk + -1; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
}<LOOP-END> <OM... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ; c2++) {
A[c1][c2] = ((double )c1) * c2 / ni;
}
}
}
if (nl >= 1) {
<LOOP-START>for (c1 = (0 > ni?0 : ni); c1 <= ((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nm + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nm + -1)); c1++) {
for (c2 = 0; c2 <= ((((nj + -1 < nl + -1?nj + -1 : nl ... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ) {
D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nl <= 0) {
<LOOP-START>for (c1 = (0 > ni?0 : ni); c1 <= ((((nj + -1 < nk + -1?nj + -1 : nk + -1)) < nm + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nm + -1)); c1++) {
for (c2 = 0; c2 <= ((nj + -1 < nm + -1?nj + -1 : nm + ... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}
}
if (nm >= 1) {
<LOOP-START>for (c1 = (ni > nm?ni : nm); c1 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c1++) {
for (c2 = 0; c2 <= nm + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
C[c1][c2] = ((dou... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}
}
if (nm <= 0) {
<LOOP-START>for (c1 = (0 > ni?0 : ni); c1 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c1++) {
for (c2 = 0; c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}<LOOP-END> <... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}
}
if (nj >= 1 && nl >= 1) {
<LOOP-START>for (c1 = (ni > nj?ni : nj); c1 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c1++) {
for (c2 = 0; c2 <= ((nj + -1 < nl + -1?nj + -1 : nl + -1)); c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) /... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nj >= 1 && nl <= 0) {
<LOOP-START>for (c1 = (ni > nj?ni : nj); c1 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c1++) {
for (c2 = 0; c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}<LOOP-END>... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}
}
if (nj >= 1) {
<LOOP-START>for (c1 = (((ni > nj?ni : nj)) > nm?((ni > nj?ni : nj)) : nm); c1 <= nk + -1; c1++) {
for (c2 = 0; c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}<LOOP-EN... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
}
}
if (nk >= 1 && nl >= 1) {
<LOOP-START>for (c1 = (ni > nk?ni : nk); c1 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c1++) {
for (c2 = 0; c2 <= ((nl + -1 < nm + -1?nl + -1 : nm + -1)); c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) /... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | D[c1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nk >= 1 && nl <= 0) {
<LOOP-START>for (c1 = (ni > nk?ni : nk); c1 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c1++) {
for (c2 = 0; c2 <= nm + -1; c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}<LOOP-END>... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}
}
if (nk >= 1 && nm >= 1) {
<LOOP-START>for (c1 = (((ni > nk?ni : nk)) > nm?((ni > nk?ni : nk)) : nm); c1 <= nj + -1; c1++) {
for (c2 = 0; c2 <= nm + -1; c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}<LOOP-EN... |
LLNL/dataracebench/micro-benchmarks/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}
}
if (nk <= 0 && nl >= 1) {
<LOOP-START>for (c1 = 0; c1 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c1++) {
for (c2 = 0; c2 <= ((nl + -1 < nm + -1?nl + -1 : nm + -1)); c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
D... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.