filename stringlengths 19 182 | omp_pragma_line stringlengths 24 416 | context_chars int64 100 100 | text stringlengths 152 177k |
|---|---|---|---|
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ?nj + -1 : nk + -1)) < nm + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/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 < 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/reference_cpu_threading/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 < 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/reference_cpu_threading/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; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/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; 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/reference_cpu_threading/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 <= 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/reference_cpu_threading/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 > nm?nj : 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/reference_cpu_threading/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 > 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++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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 = nm; c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
#pragma omp parallel for private(c2)
for (c2 = nj; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ?nj + -1 : nk + -1)) < nm + -1?((nj + -1 < nk + -1?nj + -1 : nk + -1)) : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/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; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/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; 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/reference_cpu_threading/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 = (ni > nm?ni : nm); c1 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c1++) {
#pragma omp parallel for private(c2)
for (c2 = 0; c2 <= 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 = nm; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | )
for (c1 = (ni > nm?ni : nm); c1 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c1++) {
<LOOP-START>for (c2 = 0; c2 <= 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/reference_cpu_threading/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; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/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 > ni?0 : ni); c1 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c1++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | c2)
for (c1 = (0 > ni?0 : ni); c1 <= ((nj + -1 < nk + -1?nj + -1 : nk + -1)); c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/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 = (ni > nj?ni : nj); c1 <= ((nk + -1 < nm + -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++) {
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++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
#pragma omp parallel for private(c2)
for (c2 = nj; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | )
for (c1 = (ni > nj?ni : nj); c1 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/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; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | = nl; c2 <= nj + -1; c2++) {
B[c1][c2] = ((double )c1) * (c2 + 1) / nj;
}
<LOOP-START>for (c2 = nj; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | 1][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++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | )
for (c1 = (ni > nj?ni : nj); c1 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, 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++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | for (c1 = (((ni > nj?ni : nj)) > nm?((ni > nj?ni : nj)) : nm); c1 <= nk + -1; c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | 1][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++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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 = nl; c2 <= nm + -1; c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
#pragma omp parallel for private(c2)
for (c2 = 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | )
for (c1 = (ni > nk?ni : nk); c1 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/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 <= 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/reference_cpu_threading/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 = 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | 1][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++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | )
for (c1 = (ni > nk?ni : nk); c1 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | 1][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++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | for (c1 = (((ni > nk?ni : nk)) > nm?((ni > nk?ni : nk)) : nm); c1 <= nj + -1; c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | 1][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++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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 = nl; c2 <= nm + -1; c2++) {
C[c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
#pragma omp parallel for private(c2)
for (c2 = 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | r private(c1, c2)
for (c1 = 0; c1 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/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 <= 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/reference_cpu_threading/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 = 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | 1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nk <= 0 && nl <= 0) {
<LOOP-START>for (c1 = 0; c1 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c1++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | r private(c1, c2)
for (c1 = 0; c1 <= ((nj + -1 < nm + -1?nj + -1 : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | 1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}
}
if (nk <= 0 && nm >= 1) {
<LOOP-START>for (c1 = nm; c1 <= nj + -1; c1++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | {
#pragma omp parallel for private(c1, c2)
for (c1 = nm; c1 <= nj + -1; c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | c1][c2] = ((double )c1) * (c2 + 3) / nl;
}
}
}
if (nj <= 0 && nl >= 1) {
<LOOP-START>for (c1 = (0 > ni?0 : ni); c1 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c1++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | c2)
for (c1 = (0 > ni?0 : ni); c1 <= ((nk + -1 < nm + -1?nk + -1 : nm + -1)); c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | 1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nk >= 1 && nl >= 1) {
<LOOP-START>for (c1 = (((ni > nj?ni : nj)) > nk?((ni > nj?ni : nj)) : nk); c1 <= nm + -1; c1++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | for (c1 = (((ni > nj?ni : nj)) > nk?((ni > nj?ni : nj)) : nk); c1 <= nm + -1; c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | 1][c2] = ((double )c1) * (c2 + 2) / nk;
}
}
}
if (nk <= 0 && nl >= 1) {
<LOOP-START>for (c1 = (0 > nj?0 : nj); c1 <= nm + -1; c1++) {
#pragma omp parallel for private(c2)
for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | ma omp parallel for private(c1, c2)
for (c1 = (0 > nj?0 : nj); c1 <= nm + -1; c1++) {
<LOOP-START>for (c2 = 0; 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/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | ])
{
//int i;
//int j;
//int k;
//#pragma scop
{
int c1;
int c2;
int c5;
<LOOP-START>for (c1 = 0; c1 <= 127; c1++) {
#pragma omp parallel for private(c2)
for (c2 = 0; c2 <= 127; c2++) {
G[c1][c2] = 0;
F[c1][c2] = 0;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1, c2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 |
int c5;
#pragma omp parallel for private(c1, c2)
for (c1 = 0; c1 <= 127; c1++) {
<LOOP-START>for (c2 = 0; c2 <= 127; c2++) {
G[c1][c2] = 0;
F[c1][c2] = 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c5, c2) | 100 | for (c2 = 0; c2 <= 127; c2++) {
G[c1][c2] = 0;
F[c1][c2] = 0;
}
}
<LOOP-START>for (c1 = 0; c1 <= 127; c1++) {
#pragma omp parallel for private(c2, c5)
for (c2 = 0; c2 <= 127; c2++) {
#pragma omp parallel for private(c5)
for (c5 = 0; c5 <= 127; c5++) {
F[c1][c2] += C[c1][c5] * D[c5][c2];
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1, c5, c2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2, c5) | 100 | }
}
#pragma omp parallel for private(c1, c5, c2)
for (c1 = 0; c1 <= 127; c1++) {
<LOOP-START>for (c2 = 0; c2 <= 127; c2++) {
#pragma omp parallel for private(c5)
for (c5 = 0; c5 <= 127; c5++) {
F[c1][c2] += C[c1][c5] * D[c5][c2];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2, c5)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c5) | 100 | 1++) {
#pragma omp parallel for private(c2, c5)
for (c2 = 0; c2 <= 127; c2++) {
<LOOP-START>for (c5 = 0; c5 <= 127; c5++) {
F[c1][c2] += C[c1][c5] * D[c5][c2];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c5)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c2) | 100 | 5 = 0; c5 <= 127; c5++) {
F[c1][c2] += C[c1][c5] * D[c5][c2];
}
}
}
<LOOP-START>for (c1 = 0; c1 <= 127; c1++) {
#pragma omp parallel for private(c2)
for (c2 = 0; c2 <= 127; c2++) {
E[c1][c2] = 0;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1, c2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c2) | 100 | }
}
#pragma omp parallel for private(c1, c2)
for (c1 = 0; c1 <= 127; c1++) {
<LOOP-START>for (c2 = 0; c2 <= 127; c2++) {
E[c1][c2] = 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c1, c5, c2) | 100 | llel for private(c2)
for (c2 = 0; c2 <= 127; c2++) {
E[c1][c2] = 0;
}
}
<LOOP-START>for (c1 = 0; c1 <= 127; c1++) {
#pragma omp parallel for private(c5, c2)
for (c2 = 0; c2 <= 127; c2++) {
#pragma omp parallel for private(c5)
for (c5 = 0; c5 <= 127; c5++) {
E[c1][c2] += A[c1][c5] * B[c5][c2];
}
#pragma omp parallel for private(c5)
for (c5 = 0; c5 <= 127; c5++) {
G[c1][c5] += E[c1][c2] * F[c2][c5];
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c1, c5, c2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c5, c2) | 100 | }
}
#pragma omp parallel for private(c1, c5, c2)
for (c1 = 0; c1 <= 127; c1++) {
<LOOP-START>for (c2 = 0; c2 <= 127; c2++) {
#pragma omp parallel for private(c5)
for (c5 = 0; c5 <= 127; c5++) {
E[c1][c2] += A[c1][c5] * B[c5][c2];
}
#pragma omp parallel for private(c5)
for (c5 = 0; c5 <= 127; c5++) {
G[c1][c5] += E[c1][c2] * F[c2][c5];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c5, c2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c5) | 100 | 127; c1++) {
#pragma omp parallel for private(c5, c2)
for (c2 = 0; c2 <= 127; c2++) {
<LOOP-START>for (c5 = 0; c5 <= 127; c5++) {
E[c1][c2] += A[c1][c5] * B[c5][c2];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c5)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB041-3mm-parallel-no.c | #pragma omp parallel for private(c5) | 100 | for (c5 = 0; c5 <= 127; c5++) {
E[c1][c2] += A[c1][c5] * B[c5][c2];
}
<LOOP-START>for (c5 = 0; c5 <= 127; c5++) {
G[c1][c5] += E[c1][c2] * F[c2][c5];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(c5)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB013-nowait-orig-yes.c | #pragma omp parallel for | 100 | ]@75:13.
*/
#include <stdio.h>
int main()
{
int i,error;
int len = 1000;
int a[len], b=5;
<LOOP-START>for (i=0; i<len; i++)
a[i]= i;
#pragma omp parallel shared(b, error)
{
#pragma omp for
for(i = 0; i < len; i++)
a[i] = b + a[i]*5;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for | 100 | e <stdio.h>
int main(int argc,char *argv[])
{
int i, j;
int len = 20;
double a[20][20];
<LOOP-START>for (i=0; i< len; i++)
#pragma omp parallel for
for (j=0; j<len; j++)
a[i][j] = 0.5;
for (i = 0; i < len - 1; i += 1) {
#pragma omp parallel for
for (j = 0; j < len ; j += 1) {
a[i][j] += a[i + 1][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for | 100 | , j;
int len = 20;
double a[20][20];
#pragma omp parallel for
for (i=0; i< len; i++)
<LOOP-START>for (j=0; j<len; j++)
a[i][j] = 0.5;
for (i = 0; i < len - 1; i += 1) {
#pragma omp parallel for
for (j = 0; j < len ; j += 1) {
a[i][j] += a[i + 1][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for | 100 | allel for
for (j=0; j<len; j++)
a[i][j] = 0.5;
for (i = 0; i < len - 1; i += 1) {
<LOOP-START>for (j = 0; j < len ; j += 1) {
a[i][j] += a[i + 1][j];
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB005-indirectaccess1-orig-yes.c | #pragma omp parallel for | 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<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for | 100 | define K 100
double a[N][M],b[M][K],c[N][K];
int init()
{
int i,j,k;
<LOOP-START>for (i = 0; i < N; i++)
#pragma omp parallel for
for (j = 0; j < M; 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 <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for | 100 |
int init()
{
int i,j,k;
#pragma omp parallel for
for (i = 0; i < N; i++)
<LOOP-START>for (j = 0; j < M; 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<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(j,k) | 100 | * j;
c[i][j] = (double)i * j;
}
return 0;
}
int mmm()
{
int i,j,k;
<LOOP-START>for (i = 0; i < N; i++)
for (k = 0; k < K; k++)
for (j = 0; j < M; j++)
c[i][j]= c[i][j]+a[i][k]*b[k][j];
return 0;
}
int print()
{
int i,j,k;
for (i = 0; i < N; i++)
for (j = 0; j < M; j++)
printf("%lf %lf %lf\n", c[i][j],a[i][j],b[i][j]);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j,k)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB085-threadprivate-orig-no.c | #pragma omp parallel for reduction(+:sum1) | 100 | }
#pragma omp critical
{
sum= sum+sum0;
}
}
/* reference calculation */
<LOOP-START>for (i=0;i<len;i++)
{
sum1=sum1+i;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:sum1)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB007-indirectaccess3-orig-yes.c | #pragma omp parallel for | 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<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB011-minusminus-orig-yes.c | #pragma omp parallel for | 100 |
{
int i;
int len=100;
int numNodes=len, numNodes2=0;
int x[100];
// initialize x[]
<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<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB011-minusminus-orig-yes.c | #pragma omp parallel for reduction(-:numNodes2) | 100 | llel for
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 reduction(-:numNodes2)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB025-simdtruedep-var-yes.c | #pragma omp parallel for | 100 | argv[])
{
int i;
int len=100;
if (argc>1)
len = atoi(argv[1]);
int a[len], b[len];
<LOOP-START>for (i=0;i<len;i++)
{
a[i]=i;
b[i]=i+1;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB052-indirectaccesssharebase-orig-no.c | #pragma omp parallel for | 100 | xecution. \n");
return 1;
}
double * xa1 = base;
double * xa2 = base + 12;
int i;
<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/reference_cpu_threading/dataracebench/DRB052-indirectaccesssharebase-orig-no.c | #pragma omp parallel for | 100 | 12;
int i;
#pragma omp parallel for
for (i =521; i<= 2025; ++i)
{
base[i]=0.0;
}
<LOOP-START>for (i =0; i< N; ++i) // this level of loop has no loop carried dependence
{
int idx = indexSet[i];
xa1[idx]+= 1.0;
xa2[idx]+= 3.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB068-restrictpointer2-orig-no.c | #pragma omp parallel for | 100 | e <stdio.h>
void init(int n, int * restrict a, int * restrict b, int * restrict c)
{
int i;
<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 <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB068-restrictpointer2-orig-no.c | #pragma omp parallel for | 100 | * i;
}
}
void foo(int n, int * restrict a, int * restrict b, int * restrict c)
{
int i;
<LOOP-START>for (i = 0; i < n; i++)
a[i] = b[i] + c[i];
}
void print(int n, int * restrict a, int * restrict b, int * restrict c)
{
int i;
for (i = 0; i < n; i++) {
printf("%d %d %d\n", a[i], b[i], c[i]);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB057-jacobiinitialize-orig-no.c | #pragma omp parallel for private(i,j,xx,yy) | 100 | x, 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/reference_cpu_threading/dataracebench/DRB057-jacobiinitialize-orig-no.c | #pragma omp parallel for private(j,xx,yy) | 100 | al condition 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/reference_cpu_threading/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for | 100 | ])
{
int i, j;
int len = 20;
if (argc>1)
len = atoi(argv[1]);
double a[len][len];
<LOOP-START>for (i=0; i< len; i++)
#pragma omp parallel for
for (j=0; j<len; j++)
a[i][j] = 0.5;
for (i = 0; i < len - 1; i += 1) {
#pragma omp parallel for
for (j = 0; j < len ; j += 1) {
a[i][j] += a[i + 1][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for | 100 | en = atoi(argv[1]);
double a[len][len];
#pragma omp parallel for
for (i=0; i< len; i++)
<LOOP-START>for (j=0; j<len; j++)
a[i][j] = 0.5;
for (i = 0; i < len - 1; i += 1) {
#pragma omp parallel for
for (j = 0; j < len ; j += 1) {
a[i][j] += a[i + 1][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for | 100 | allel for
for (j=0; j<len; j++)
a[i][j] = 0.5;
for (i = 0; i < len - 1; i += 1) {
<LOOP-START>for (j = 0; j < len ; j += 1) {
a[i][j] += a[i + 1][j];
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/utilities/polybench.c | #pragma omp parallel for reduction(+:tmp) | 100 | zeof(double);
double* flush = (double*) calloc (cs, sizeof(double));
int i;
double tmp = 0.0;
<LOOP-START>for (i = 0; i < cs; i++)
tmp += flush[i];
assert (tmp <= 10.0);
free (flush);
}
#ifdef POLYBENCH_LINUX_FIFO_SCHEDULER
void polybench_linux_fifo_scheduler()
{
/* Use FIFO scheduler to limit OS interference. Program must be run
as root, and this works only for Linux kernels. */
struct sched_param schedParam;
schedParam.sched_priority = sched_get_priority_max (SCHED_FIFO);
sched_setscheduler (0, SCHED_FIFO, &schedParam);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:tmp)<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/utilities/template-for-new-benchmark.c | #pragma omp parallel for | 100 | initialization. */
static
void init_array(int n, DATA_TYPE POLYBENCH_2D(C,N,N,n,n))
{
int i, j;
<LOOP-START>for (i = 0; i < n; i++)
#pragma omp parallel for
for (j = 0; j < n; j++)
C[i][j] = 42;
}
/* DCE code. Must scan the entire live-out data.
Can be used also to check the correctness of the output. */
static
void print_array(int n, DATA_TYPE POLYBENCH_2D(C,N,N,n,n))
{
int i, j;
#pragma omp parallel for
for (i = 0; i < n; i++)
#pragma omp parallel for
for (j = 0; j < n; j++) {
fprintf (stderr, DATA_PRINTF_MODIFIER, C[i][j]);
if (i % 20 == 0) fprintf (stderr, "\n");
}
fprintf (stderr, "\n");
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/utilities/template-for-new-benchmark.c | #pragma omp parallel for | 100 | YPE POLYBENCH_2D(C,N,N,n,n))
{
int i, j;
#pragma omp parallel for
for (i = 0; i < n; i++)
<LOOP-START>for (j = 0; j < n; j++)
C[i][j] = 42;
}
/* DCE code. Must scan the entire live-out data.
Can be used also to check the correctness of the output. */
static
void print_array(int n, DATA_TYPE POLYBENCH_2D(C,N,N,n,n))
{
int i, j;
#pragma omp parallel for
for (i = 0; i < n; i++)
#pragma omp parallel for
for (j = 0; j < n; j++) {
fprintf (stderr, DATA_PRINTF_MODIFIER, C[i][j]);
if (i % 20 == 0) fprintf (stderr, "\n");
}
fprintf (stderr, "\n");
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/utilities/template-for-new-benchmark.c | #pragma omp parallel for | 100 | f the output. */
static
void print_array(int n, DATA_TYPE POLYBENCH_2D(C,N,N,n,n))
{
int i, j;
<LOOP-START>for (i = 0; i < n; i++)
#pragma omp parallel for
for (j = 0; j < n; j++) {
fprintf (stderr, DATA_PRINTF_MODIFIER, C[i][j]);
if (i % 20 == 0) fprintf (stderr, "\n");
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/utilities/template-for-new-benchmark.c | #pragma omp parallel for | 100 | PE POLYBENCH_2D(C,N,N,n,n))
{
int i, j;
#pragma omp parallel for
for (i = 0; i < n; i++)
<LOOP-START>for (j = 0; j < n; j++) {
fprintf (stderr, DATA_PRINTF_MODIFIER, C[i][j]);
if (i % 20 == 0) fprintf (stderr, "\n");
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/utilities/template-for-new-benchmark.c | #pragma omp parallel for | 100 | d return. */
static
void kernel_template(int n, DATA_TYPE POLYBENCH_2D(C,N,N,n,n))
{
int i, j;
<LOOP-START>for (i = 0; i < _PB_N; i++)
#pragma omp parallel for
for (j = 0; j < _PB_N; j++)
C[i][j] += 42;
}
int main(int argc, char** argv)
{
/* Retrieve problem size. */
int n = N;
/* Variable declaration/allocation. */
POLYBENCH_2D_ARRAY_DECL(C,DATA_TYPE,N,N,n,n);
/* Initialize array(s). */
init_array (n, POLYBENCH_ARRAY(C));
/* Start timer. */
polybench_start_instruments;
/* Run kernel. */
kernel_template (n, POLYBENCH_ARRAY(C));
/* Stop and print timer. */
polybench_stop_instruments;
polybench_print_instruments;
/* Prevent dead-code elimination. All live-out data must be printed
by the function call in argument. */
polybench_prevent_dce(print_array(n, POLYBENCH_ARRAY(C)));
/* Be clean. */
POLYBENCH_FREE_ARRAY(C);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/dataracebench/utilities/template-for-new-benchmark.c | #pragma omp parallel for | 100 | OLYBENCH_2D(C,N,N,n,n))
{
int i, j;
#pragma omp parallel for
for (i = 0; i < _PB_N; i++)
<LOOP-START>for (j = 0; j < _PB_N; j++)
C[i][j] += 42;
}
int main(int argc, char** argv)
{
/* Retrieve problem size. */
int n = N;
/* Variable declaration/allocation. */
POLYBENCH_2D_ARRAY_DECL(C,DATA_TYPE,N,N,n,n);
/* Initialize array(s). */
init_array (n, POLYBENCH_ARRAY(C));
/* Start timer. */
polybench_start_instruments;
/* Run kernel. */
kernel_template (n, POLYBENCH_ARRAY(C));
/* Stop and print timer. */
polybench_stop_instruments;
polybench_print_instruments;
/* Prevent dead-code elimination. All live-out data must be printed
by the function call in argument. */
polybench_prevent_dce(print_array(n, POLYBENCH_ARRAY(C)));
/* Be clean. */
POLYBENCH_FREE_ARRAY(C);
return 0;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/b+tree/kernel/kernel_cpu_2.c | #pragma omp parallel for private(i ,thid ) | 100 | ==================150
// private thread IDs
int thid;
int bid;
// process number of querries
<LOOP-START>for(bid = 0; bid < count; bid++){
// process levels of the tree
for(i = 0; i < maxheight; i++){
// process all leaves at each level
for(thid = 0; thid < threadsPerBlock; thid++){
if((knodes[currKnode[bid]].keys[thid] <= start[bid]) && (knodes[currKnode[bid]].keys[thid+1] > start[bid])){
// this conditional statement is inserted to avoid crush due to but in original code
// "offset[bid]" calculated below that later addresses part of knodes goes outside of its bounds cause segmentation fault
// more specifically, values saved into knodes->indices in the main function are out of bounds of knodes that they address
if(knodes[currKnode[bid]].indices[thid] < knodes_elem){
offset[bid] = knodes[currKnode[bid]].indices[thid];
}
}
if((knodes[lastKnode[bid]].keys[thid] <= end[bid]) && (knodes[lastKnode[bid]].keys[thid+1] > end[bid])){
// this conditional statement is inserted to avoid crush due to but in original code
// "offset_2[bid]" calculated below that later addresses part of knodes goes outside of its bounds cause segmentation fault
// more specifically, values saved into knodes->indices in the main function are out of bounds of knodes that they address
if(knodes[lastKnode[bid]].indices[thid] < knodes_elem){
offset_2[bid] = knodes[lastKnode[bid]].indices[thid];
}
}
}
// set for next tree level
currKnode[bid] = offset[bid];
lastKnode[bid] = offset_2[bid];
}
// process leaves
for(thid = 0; thid < threadsPerBlock; thid++){
// Find the index of the starting record
if(knodes[currKnode[bid]].keys[thid] == start[bid]){
recstart[bid] = knodes[currKnode[bid]].indices[thid];
}
}
// process leaves
for(thid = 0; thid < threadsPerBlock; thid++){
// Find the index of the ending record
if(knodes[lastKnode[bid]].keys[thid] == end[bid]){
reclength[bid] = knodes[lastKnode[bid]].indices[thid] - recstart[bid]+1;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,thid ) <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/b+tree/kernel/kernel_cpu.c | #pragma omp parallel for private(i ,thid ) | 100 | ==========150
// private thread IDs
int thid;
int bid;
int i;
// process number of querries
<LOOP-START>for(bid = 0; bid < count; bid++){
// process levels of the tree
for(i = 0; i < maxheight; i++){
// process all leaves at each level
for(thid = 0; thid < threadsPerBlock; thid++){
// if value is between the two keys
if((knodes[currKnode[bid]].keys[thid]) <= keys[bid] && (knodes[currKnode[bid]].keys[thid+1] > keys[bid])){
// this conditional statement is inserted to avoid crush due to but in original code
// "offset[bid]" calculated below that addresses knodes[] in the next iteration goes outside of its bounds cause segmentation fault
// more specifically, values saved into knodes->indices in the main function are out of bounds of knodes that they address
if(knodes[offset[bid]].indices[thid] < knodes_elem){
offset[bid] = knodes[offset[bid]].indices[thid];
}
}
}
// set for next tree level
currKnode[bid] = offset[bid];
}
//At this point, we have a candidate leaf node which may contain
//the target record. Check each key to hopefully find the record
// process all leaves at each level
for(thid = 0; thid < threadsPerBlock; thid++){
if(knodes[currKnode[bid]].keys[thid] == keys[bid]){
ans[bid].value = records[knodes[currKnode[bid]].indices[thid]].value;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ,thid ) <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/hotspot3D/3D.c | #pragma omp parallel for reduction(+:err) | 100 | iter);
}
float accuracy(float *arr1, float *arr2, int len)
{
float err = 0.0;
int i;
<LOOP-START>for(i = 0; i < len; i++)
{
err += (arr1[i]-arr2[i]) * (arr1[i]-arr2[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:err) <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/hotspot3D/3D.c | #pragma omp parallel for | 100 | rintf("%d threads running\n", omp_get_num_threads());
do {
int z;
<LOOP-START>for (z = 0; z < nz; z++) {
int y;
for (y = 0; y < ny; y++) {
int x;
for (x = 0; x < nx; x++) {
int c, w, e, n, s, b, t;
c = x + y * nx + z * nx * ny;
w = (x == 0) ? c : c - 1;
e = (x == nx-1) ? c : c + 1;
n = (y == 0) ? c : c - nx;
s = (y == ny-1) ? c : c + nx;
b = (z == 0) ? c : c - nx * ny;
t = (z == nz-1) ? c : c + nx * ny;
tOut_t[c] = cc * tIn_t[c] + cw * tIn_t[w] + ce * tIn_t[e]
+ cs * tIn_t[s] + cn * tIn_t[n] + cb * tIn_t[b] + ct * tIn_t[t]+(dt/Cap) * pIn[c] + ct*amb_temp;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for | 100 | // updated row coordinates
private[i].d_T = public.d_endoT; // templates
}
<LOOP-START>for(i=public.endoPoints; i<public.allPoints; i++){
private[i].point_no = i-public.endoPoints;
private[i].in_pointer = private[i].point_no * public.in_mod_elem;
private[i].d_Row = public.d_epiRow;
private[i].d_Col = public.d_epiCol;
private[i].d_tRowLoc = public.d_tEpiRowLoc;
private[i].d_tColLoc = public.d_tEpiColLoc;
private[i].d_T = public.d_epiT;
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for | 100 | lic.conv_cols; // number of elements
public.conv_mem = sizeof(fp) * public.conv_elem;
<LOOP-START>for(i=0; i<public.allPoints; i++){
private[i].d_conv = (fp *)malloc(public.conv_mem);
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for | 100 | ublic.in2_pad_rows * public.in2_pad_cols;
public.in2_pad_mem = sizeof(fp) * public.in2_pad_elem;
<LOOP-START>for(i=0; i<public.allPoints; i++){
private[i].d_in2_pad = (fp *)malloc(public.in2_pad_mem);
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for | 100 | elem = public.tMask_rows * public.tMask_cols;
public.tMask_mem = sizeof(fp) * public.tMask_elem;
<LOOP-START>for(i=0; i<public.allPoints; i++){
private[i].d_tMask = (fp *)malloc(public.tMask_mem);
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for | 100 | if((public.mask_cols-1) % 2 > 0.5){
public.mask_conv_joffset = public.mask_conv_joffset + 1;
}
<LOOP-START>for(i=0; i<public.allPoints; i++){
private[i].d_mask_conv = (fp *)malloc(public.mask_conv_mem);
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for | 100 | ====================================================
omp_set_num_threads(omp_num_threads);
<LOOP-START>for(i=0; i<public.allPoints; i++){
kernel( public,
private[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for | 100 | =================================================================================================
<LOOP-START>for(i=0; i<public.allPoints; i++){
free(private[i].in_partial_sum);
free(private[i].in_sqr_partial_sum);
free(private[i].par_max_val);
free(private[i].par_max_coo);
free(private[i].d_in2);
free(private[i].d_in2_sqr);
free(private[i].d_in_mod);
free(private[i].d_in_sqr);
free(private[i].d_conv);
free(private[i].d_in2_pad);
free(private[i].d_in2_sub);
free(private[i].d_in2_sub2_sqr);
free(private[i].d_tMask);
free(private[i].d_mask_conv);
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | or u
c-------------------------------------------------------------------*/
int i, j, k, m;
<LOOP-START>for (i = 1; i < grid_points[0]-1; i++) {
#pragma omp parallel for
for (j = 1; j < grid_points[1]-1; j++) {
#pragma omp parallel for
for (k = 1; k < grid_points[2]-1; k++) {
#pragma omp parallel for
for (m = 0; m < 5; m++) {
u[i][j][k][m] = u[i][j][k][m] + rhs[i][j][k][m];
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | */
int i, j, k, m;
#pragma omp parallel for
for (i = 1; i < grid_points[0]-1; i++) {
<LOOP-START>for (j = 1; j < grid_points[1]-1; j++) {
#pragma omp parallel for
for (k = 1; k < grid_points[2]-1; k++) {
#pragma omp parallel for
for (m = 0; m < 5; m++) {
u[i][j][k][m] = u[i][j][k][m] + rhs[i][j][k][m];
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/reference_cpu_threading/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | ints[0]-1; i++) {
#pragma omp parallel for
for (j = 1; j < grid_points[1]-1; j++) {
<LOOP-START>for (k = 1; k < grid_points[2]-1; k++) {
#pragma omp parallel for
for (m = 0; m < 5; m++) {
u[i][j][k][m] = u[i][j][k][m] + rhs[i][j][k][m];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.