filename stringlengths 19 182 | omp_pragma_line stringlengths 24 416 | context_chars int64 100 100 | text stringlengths 152 177k |
|---|---|---|---|
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for private(i ,j ) | 100 | e <stdlib.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 private(j )
for (j=0; j<len; j++)
a[i][j] = (i * len + j + 0.5);
for (i = 0; i < len - 1; i += 1) {
#pragma omp parallel for
for (j ... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for private(j ) | 100 | 20;
double a[20][20];
#pragma omp parallel for private(i ,j )
for (i=0; i< len; i++)
<LOOP-START>for (j=0; j<len; j++)
a[i][j] = (i * len + 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... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB003-antidep2-orig-yes.c | #pragma omp parallel for | 100 | r (j=0; j<len; j++)
a[i][j] = (i * len + 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/baseline/dataracebench/DRB005-indirectaccess1-orig-yes.c | #pragma omp parallel for private(i ) | 100 | * xa1 = base;
double * xa2 = xa1 + 2014;
int i;
// initialize segments touched by indexSet
<LOOP-START>for (i =521; i<= 2025; ++i)
{
base[i]=0.5*i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB005-indirectaccess1-orig-yes.c | #pragma omp parallel for private(i ) | 100 | ]=0.5*i;
}
// default static even scheduling may not trigger data race, using static,1 instead.
<LOOP-START>for (i =0; i< N; ++i)
{
int idx = indexSet[i];
xa1[idx]+= 1.0 + i;
xa2[idx]+= 3.0 + i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(i ,j ,k ) | 100 | ine M 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 private(j ,k )
for (k = 0; k < K; k++)
#pragma omp parallel for private(j )
for (j = 0; j < M; j++) {
c[i][j] = i * j;
... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(j ,k ) | 100 |
int i,j,k;
#pragma omp parallel for private(i ,j ,k )
for (i = 0; i < N; i++)
<LOOP-START>for (k = 0; k < K; k++)
#pragma omp parallel for private(j )
for (j = 0; j < M; j++) {
c[i][j] = i * j;
a[i][k] = i * j;
b[k][j] = i * j;
}<LOOP-END> <OMP-START>#pr... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(j ) | 100 | i = 0; i < N; i++)
#pragma omp parallel for private(j ,k )
for (k = 0; k < K; k++)
<LOOP-START>for (j = 0; j < M; j++) {
c[i][j] = i * j;
a[i][k] = i * j;
b[k][j] = i * j;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(i ,j ,k ) | 100 | b[k][j] = i * j;
}
return 0;
}
int mmm()
{
int i,j,k;
<LOOP-START>for (i = 0; i < N; i++)
#pragma omp parallel for private(j ,k )
for (k = 0; k < K; k++)
#pragma omp parallel for private(j )
for (j = 0; j < M; j++)
c[i][j]= c[i][j]+a[i][k]*b[... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(j ,k ) | 100 |
int i,j,k;
#pragma omp parallel for private(i ,j ,k )
for (i = 0; i < N; i++)
<LOOP-START>for (k = 0; k < K; k++)
#pragma omp parallel for private(j )
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 ... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB060-matrixmultiply-orig-no.c | #pragma omp parallel for private(j ) | 100 | i = 0; i < N; i++)
#pragma omp parallel for private(j ,k )
for (k = 0; k < K; k++)
<LOOP-START>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 (k = 0; k < K; k++)
for (j = 0; j < M; j++... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB085-threadprivate-orig-no.c | #pragma omp parallel for private(i ) reduction(+:sum0) | 100 | sum0=0, sum1=0;
void foo (int i)
{
sum0=sum0+i;
}
int main()
{
int len=1000;
int i, sum=0;
<LOOP-START>for (i=0;i<len;i++)
{
foo (i);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) reduction(+:sum0) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB085-threadprivate-orig-no.c | #pragma omp parallel for private(i ) reduction(+:sum1) | 100 | 0)
for (i=0;i<len;i++)
{
foo (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/DRB007-indirectaccess3-orig-yes.c | #pragma omp parallel for private(i ) | 100 | e * xa1 = base;
double * xa2 = xa1 + 12;
int i;
// initialize segments touched by indexSet
<LOOP-START>for (i =521; i<= 2025; ++i)
{
base[i]=0.5*i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB011-minusminus-orig-yes.c | #pragma omp parallel for private(i ) | 100 | {
int i;
int len=100;
int numNodes=len, numNodes2=10;
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 private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB011-minusminus-orig-yes.c | #pragma omp parallel for private(i ) reduction(-:numNodes2) | 100 | ate(i )
for (i=0; i< len; i++)
{
if (i%2==0)
x[i]=5;
else
x[i]= -5;
}
<LOOP-START>for (i=numNodes-1 ; i>-1 ; --i) {
if (x[i]<=0) {
numNodes2--;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) reduction(-:numNodes2) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB025-simdtruedep-var-yes.c | #pragma omp parallel for private(i ) | 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 private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB052-indirectaccesssharebase-orig-no.c | #pragma omp parallel for private(i ) | 100 | execution. \n");
return 1;
}
double * xa1 = base;
double * xa2 = base + 1;
int i;
<LOOP-START>for (i =521; i<= 2025; ++i)
{
base[i]=0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB052-indirectaccesssharebase-orig-no.c | #pragma omp parallel for private(i ) | 100 | ;
#pragma omp parallel for private(i )
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]+= 4.0;
xa2[idx]+= 4.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) ... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB068-restrictpointer2-orig-no.c | #pragma omp parallel for private(i ) | 100 | de <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 private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB068-restrictpointer2-orig-no.c | #pragma omp parallel for private(i ) | 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])... |
LLNL/AutoParBench/benchmarks/baseline/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)... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB057-jacobiinitialize-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 * ... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for private(i ,j ) | 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 private(j )
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... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for private(j ) | 100 | ]);
double a[len][len];
#pragma omp parallel for private(i ,j )
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... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/DRB004-antidep2-var-yes.c | #pragma omp parallel for | 100 | vate(j )
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/baseline/dataracebench/DRB104-nowait-barrier-orig-no.c | #pragma omp parallel for private(i ) | 100 | e <stdio.h>
#include <assert.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 for private(i )
for(i = 0; i < len; i++)
a[i] = b + a[i]*5;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/utilities/polybench.c | #pragma omp parallel for reduction(+:tmp) | 100 | flush = (double*) calloc (cs, sizeof(double));
int i;
double tmp = 0.0;
#ifdef _OPENMP
#endif
<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 inte... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/utilities/template-for-new-benchmark.c | #pragma omp parallel for firstprivate(j ,C ,i ) | 100 | nitialization. */
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 firstprivate(j ,C ,i )
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 t... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/utilities/template-for-new-benchmark.c | #pragma omp parallel for firstprivate(j ,C ,i ) | 100 | n))
{
int i, j;
#pragma omp parallel for firstprivate(j ,C ,i )
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 POLYBEN... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/utilities/template-for-new-benchmark.c | #pragma omp parallel for firstprivate(j ,C ,i ) | 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 firstprivate(j ,C ,i )
for (j = 0; j < _PB_N; j++)
C[i][j] += 42;
}
int main(int argc, char** argv)
{
/* Retrieve problem size. */
in... |
LLNL/AutoParBench/benchmarks/baseline/dataracebench/utilities/template-for-new-benchmark.c | #pragma omp parallel for firstprivate(j ,C ,i ) | 100 | {
int i, j;
#pragma omp parallel for firstprivate(j ,C ,i )
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_T... |
LLNL/AutoParBench/benchmarks/baseline/rodinia_3.1/openmp/hotspot3D/3D.c | #pragma omp parallel for firstprivate(len ,arr2 ,arr1 ,i ) 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 firstprivate(len ,arr2 ,arr1 ,i ) reduction(+:err) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/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... |
LLNL/AutoParBench/benchmarks/baseline/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for firstprivate(i ) | 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;
priv... |
LLNL/AutoParBench/benchmarks/baseline/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for firstprivate(i ) | 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 firstprivate(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for firstprivate(i ) | 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 firstprivate(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for firstprivate(i ) | 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 firstprivate(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for firstprivate(i ) | 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 firstprivate(i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/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/baseline/rodinia_3.1/openmp/heartwall/main.c | #pragma omp parallel for firstprivate(i ) | 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(p... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(j ,k ,m ,i ) | 100 | or u
c-------------------------------------------------------------------*/
int i, j, k, m;
<LOOP-START>for (i = 1; i < grid_points[0]-1; i++) {
#pragma omp parallel for private(j ,k ,m ,i )
for (j = 1; j < grid_points[1]-1; j++) {
#pragma omp parallel for private(j ,k ,m ,i )
for (k = 1; ... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(j ,k ,m ,i ) | 100 |
#pragma omp parallel for private(j ,k ,m ,i )
for (i = 1; i < grid_points[0]-1; i++) {
<LOOP-START>for (j = 1; j < grid_points[1]-1; j++) {
#pragma omp parallel for private(j ,k ,m ,i )
for (k = 1; k < grid_points[2]-1; k++) {
#pragma omp parallel for private(j ,k ,m ,i )
for (m = 0; m < 5;... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(j ,k ,m ,i ) | 100 | #pragma omp parallel for private(j ,k ,m ,i )
for (j = 1; j < grid_points[1]-1; j++) {
<LOOP-START>for (k = 1; k < grid_points[2]-1; k++) {
#pragma omp parallel for private(j ,k ,m ,i )
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 ... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(j ,k ,m ,i ) | 100 | #pragma omp parallel for private(j ,k ,m ,i )
for (k = 1; k < grid_points[2]-1; k++) {
<LOOP-START>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 private(j ,k ,m ,i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(m ) | 100 | -------------------------------*/
int i, j, k, m, d;
double xi, eta, zeta, u_exact[5], add;
<LOOP-START>for (m = 0; m < 5; m++) {
rms[m] = 0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(m ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(add ,m) firstprivate(k ,j ,i ) | 100 | 0; k < grid_points[2]; k++) {
zeta = (double)k * dnzm1;
exact_solution(xi, eta, zeta, u_exact);
<LOOP-START>for (m = 0; m < 5; m++) {
add = u[i][j][k][m] - u_exact[m];
rms[m] = rms[m] + add*add;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(add ,m) firstprivate(k ,j ,i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(d ,m ) | 100 | ; m++) {
add = u[i][j][k][m] - u_exact[m];
rms[m] = rms[m] + add*add;
}
}
}
}
<LOOP-START>for (m = 0; m < 5; m++) {
#pragma omp parallel for firstprivate(m )
for (d = 0; d <= 2; d++) {
rms[m] = rms[m] / (double)(grid_points[d]-2);
}
rms[m] = sqrt(rms[m]);
}<LOOP-END> <OMP-... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(m ) | 100 | d;
}
}
}
}
#pragma omp parallel for private(d ,m )
for (m = 0; m < 5; m++) {
<LOOP-START>for (d = 0; d <= 2; d++) {
rms[m] = rms[m] / (double)(grid_points[d]-2);
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(m ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(m ) | 100 | ----------------------------------------------------------*/
int i, j, k, d, m;
double add;
<LOOP-START>for (m = 0; m < 5; m++) {
rms[m] = 0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(m ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(add, m) firstprivate(k ,j ,i ) | 100 | i++) {
for (j = 1; j < grid_points[1]-1; j++) {
for (k = 1; k < grid_points[2]-1; k++) {
<LOOP-START>for (m = 0; m < 5; m++) {
add = rhs[i][j][k][m];
rms[m] = rms[m] + add*add;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(add, m) firstprivate(k ,j ,i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(d ,m ) | 100 | = 0; m < 5; m++) {
add = rhs[i][j][k][m];
rms[m] = rms[m] + add*add;
}
}
}
}
<LOOP-START>for (m = 0; m < 5; m++) {
#pragma omp parallel for firstprivate(m )
for (d = 0; d <= 2; d++) {
rms[m] = rms[m] / (double)(grid_points[d]-2);
}
rms[m] = sqrt(rms[m]);
}<LOOP-END> <OMP-... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(m ) | 100 | d;
}
}
}
}
#pragma omp parallel for private(d ,m )
for (m = 0; m < 5; m++) {
<LOOP-START>for (d = 0; d <= 2; d++) {
rms[m] = rms[m] / (double)(grid_points[d]-2);
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(m ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(j ,k ,m ,i ) | 100 |
c-------------------------------------------------------------------*/
<LOOP-START>for (i = 0; i < grid_points[0]; i++) {
#pragma omp parallel for private(j, k, m) firstprivate(i )
for (j = 0; j < grid_points[1]; j++) {
#pragma omp parallel for private(k, m) firstprivate(j ,i... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(j, k, m) firstprivate(i ) | 100 | --*/
#pragma omp parallel for private(j ,k ,m ,i )
for (i = 0; i < grid_points[0]; i++) {
<LOOP-START>for (j = 0; j < grid_points[1]; j++) {
#pragma omp parallel for private(k, m) firstprivate(j ,i )
for (k = 0; k < grid_points[2]; k++) {
#pragma omp parallel for private(j, k, i) firstprivate(m ... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(k, m) firstprivate(j ,i ) | 100 | mp parallel for private(j, k, m) firstprivate(i )
for (j = 0; j < grid_points[1]; j++) {
<LOOP-START>for (k = 0; k < grid_points[2]; k++) {
#pragma omp parallel for private(j, k, i) firstprivate(m )
for (m = 0; m < 5; m++) {
forcing[i][j][k][m] = 0.0;
}
}<LOOP-END> <OMP-START>#pragma omp paralle... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(j, k, i) firstprivate(m ) | 100 | a omp parallel for private(k, m) firstprivate(j ,i )
for (k = 0; k < grid_points[2]; k++) {
<LOOP-START>for (m = 0; m < 5; m++) {
forcing[i][j][k][m] = 0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j, k, i) firstprivate(m ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(m, i, k, j) | 100 | nces
c-------------------------------------------------------------------*/
<LOOP-START>for (j = 1; j < grid_points[1]-1; j++) {
eta = (double)j * dnym1;
for (k = 1; k < grid_points[2]-1; k++) {
zeta = (double)k * dnzm1;
for (i = 0; i < grid_points[0]; i++) {
xi = (dou... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(i ,k ,j ) private(m) | 100 | i = 0; i < grid_points[0]; i++) {
xi = (double)i * dnxm1;
exact_solution(xi, eta, zeta, dtemp);
<LOOP-START>for (m = 0; m < 5; m++) {
ue[i][m] = dtemp[m];
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(i ,k ,j ) private(m)<OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(dtpp ,i ,k ,j ) private(m) | 100 | ,k ,j ) private(m)
for (m = 0; m < 5; m++) {
ue[i][m] = dtemp[m];
}
dtpp = 1.0 / dtemp[0];
<LOOP-START>for (m = 1; m <= 4; m++) {
buf[i][m] = dtpp * dtemp[m];
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(dtpp ,i ,k ,j ) private(m)<OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(i) firstprivate(dx1tx1 ,tx2 ,dx2tx1 ,xxcon1 ,c2 ,dx3tx1 ,xxcon2 ,dx4tx1 ,dx5tx1 ,xxcon5 ,xxcon4 ,xxcon3 ,c1 ,k ,j ) | 100 | (buf[i][1]*ue[i][1] + buf[i][2]*ue[i][2] +
buf[i][3]*ue[i][3]);
}
<LOOP-START>for (i = 1; i < grid_points[0]-1; i++) {
im1 = i-1;
ip1 = i+1;
forcing[i][j][k][0] = forcing[i][j][k][0] -
tx2*(ue[ip1][1]-ue[im1][1])+
dx1tx1*(ue[ip1][0]-2.0*ue[i][0]+ue[im1][0]);
forcing[i][j][k... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(m) firstprivate(dssp ,k ,j ) | 100 |
c-------------------------------------------------------------------*/
<LOOP-START>for (m = 0; m < 5; m++) {
i = 1;
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp *
(5.0*ue[i][m] - 4.0*ue[i+1][m] +ue[i+2][m]);
i = 2;
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp *
(-4.0*ue[i-... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(m) firstprivate(dssp ,k ,j ) | 100 | - dssp *
(-4.0*ue[i-1][m] + 6.0*ue[i][m] -
4.0*ue[i+1][m] + ue[i+2][m]);
}
<LOOP-START>for (m = 0; m < 5; m++) {
#pragma omp parallel for private(i) firstprivate(dssp ,m ,k ,j )
for (i = 1*3; i <= grid_points[0]-3*1-1; i++) {
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp*
(ue[i-2]... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(i) firstprivate(dssp ,m ,k ,j ) | 100 | #pragma omp parallel for private(m) firstprivate(dssp ,k ,j )
for (m = 0; m < 5; m++) {
<LOOP-START>for (i = 1*3; i <= grid_points[0]-3*1-1; i++) {
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp*
(ue[i-2][m] - 4.0*ue[i-1][m] +
6.0*ue[i][m] - 4.0*ue[i+1][m] + ue[i+2][m]);
}<LOOP-END> <OMP-ST... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(m, i) firstprivate(dssp ,k ,j ) | 100 | (ue[i-2][m] - 4.0*ue[i-1][m] +
6.0*ue[i][m] - 4.0*ue[i+1][m] + ue[i+2][m]);
}
}
<LOOP-START>for (m = 0; m < 5; m++) {
i = grid_points[0]-3;
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp *
(ue[i-2][m] - 4.0*ue[i-1][m] +
6.0*ue[i][m] - 4.0*ue[i+1][m]);
i = grid_points[0]-2;
forcing[i][j]... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(m, j, k, i) | 100 | x differences
c-------------------------------------------------------------------*/
<LOOP-START>for (i = 1; i < grid_points[0]-1; i++) {
xi = (double)i * dnxm1;
for (k = 1; k < grid_points[2]-1; k++) {
zeta = (double)k * dnzm1;
for (j = 0; j < grid_points[1]; j++) {
eta = (dou... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(i, k, j) firstprivate(m) | 100 | = 0; j < grid_points[1]; j++) {
eta = (double)j * dnym1;
exact_solution(xi, eta, zeta, dtemp);
<LOOP-START>for (m = 0; m < 5; m++) {
ue[j][m] = dtemp[m];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i, k, j) firstprivate(m) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(m) firstprivate(dtpp ,j ,k ,i ) | 100 | )
for (m = 0; m < 5; m++) {
ue[j][m] = dtemp[m];
}
dtpp = 1.0/dtemp[0];
<LOOP-START>for (m = 1; m <= 4; m++) {
buf[j][m] = dtpp * dtemp[m];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(m) firstprivate(dtpp ,j ,k ,i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(j) firstprivate(dy1ty1 ,ty2 ,dy2ty1 ,yycon2 ,dy3ty1 ,yycon1 ,c2 ,dy4ty1 ,dy5ty1 ,yycon5 ,yycon4 ,yycon3 ,c1 ,k ,i ) | 100 | ];
q[j] = 0.5*(buf[j][1]*ue[j][1] + buf[j][2]*ue[j][2] +
buf[j][3]*ue[j][3]);
}
<LOOP-START>for (j = 1; j < grid_points[1]-1; j++) {
jm1 = j-1;
jp1 = j+1;
forcing[i][j][k][0] = forcing[i][j][k][0] -
ty2*( ue[jp1][2]-ue[jm1][2] )+
dy1ty1*(ue[jp1][0]-2.0*ue[j][0]+ue[jm1][0]... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for private(m) firstprivate(dssp ,k ,i ) | 100 |
c-------------------------------------------------------------------*/
<LOOP-START>for (m = 0; m < 5; m++) {
j = 1;
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp *
(5.0*ue[j][m] - 4.0*ue[j+1][m] +ue[j+2][m]);
j = 2;
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp *
(-4.0*ue[j-... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(dssp ,m ,k ,i ) | 100 | dssp *
(-4.0*ue[j-1][m] + 6.0*ue[j][m] -
4.0*ue[j+1][m] + ue[j+2][m]);
}
<LOOP-START>for (m = 0; m < 5; m++) {
#pragma omp parallel for firstprivate(j ,dssp ,m ,k ,i )
for (j = 1*3; j <= grid_points[1]-3*1-1; j++) {
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp*
(ue[j-2][m] - 4.... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(j ,dssp ,m ,k ,i ) | 100 | }
#pragma omp parallel for firstprivate(dssp ,m ,k ,i )
for (m = 0; m < 5; m++) {
<LOOP-START>for (j = 1*3; j <= grid_points[1]-3*1-1; j++) {
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp*
(ue[j-2][m] - 4.0*ue[j-1][m] +
6.0*ue[j][m] - 4.0*ue[j+1][m] + ue[j+2][m]);
}<LOOP-END> <OMP-ST... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(dssp ,j ,m ,k ,i ) | 100 | (ue[j-2][m] - 4.0*ue[j-1][m] +
6.0*ue[j][m] - 4.0*ue[j+1][m] + ue[j+2][m]);
}
}
<LOOP-START>for (m = 0; m < 5; m++) {
j = grid_points[1]-3;
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp *
(ue[j-2][m] - 4.0*ue[j-1][m] +
6.0*ue[j][m] - 4.0*ue[j+1][m]);
j = grid_points[1]-2;
forcing[i][j]... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | nces
c-------------------------------------------------------------------*/
<LOOP-START>for (i = 1; i < grid_points[0]-1; i++) {
xi = (double)i * dnxm1;
for (j = 1; j < grid_points[1]-1; j++) {
eta = (double)j * dnym1;
for (k = 0; k < grid_points[2]; k++) {
zeta = (dou... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(m ,k ,j ,i ) | 100 | = 0; k < grid_points[2]; k++) {
zeta = (double)k * dnzm1;
exact_solution(xi, eta, zeta, dtemp);
<LOOP-START>for (m = 0; m < 5; m++) {
ue[k][m] = dtemp[m];
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(m ,k ,j ,i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(dtpp ,m ,k ,j ,i ) | 100 | rivate(m ,k ,j ,i )
for (m = 0; m < 5; m++) {
ue[k][m] = dtemp[m];
}
dtpp = 1.0/dtemp[0];
<LOOP-START>for (m = 1; m <= 4; m++) {
buf[k][m] = dtpp * dtemp[m];
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(dtpp ,m ,k ,j ,i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(dz1tz1 ,tz2 ,dz2tz1 ,zzcon2 ,dz3tz1 ,dz4tz1 ,zzcon1 ,c2 ,dz5tz1 ,zzcon5 ,zzcon4 ,zzcon3 ,c1 ,k ,j ,i ) | 100 | ];
q[k] = 0.5*(buf[k][1]*ue[k][1] + buf[k][2]*ue[k][2] +
buf[k][3]*ue[k][3]);
}
<LOOP-START>for (k = 1; k < grid_points[2]-1; k++) {
km1 = k-1;
kp1 = k+1;
forcing[i][j][k][0] = forcing[i][j][k][0] -
tz2*( ue[kp1][3]-ue[km1][3] )+
dz1tz1*(ue[kp1][0]-2.0*ue[k][0]+ue[km1][0]... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(dssp ,m ,j ,i ) | 100 |
c-------------------------------------------------------------------*/
<LOOP-START>for (m = 0; m < 5; m++) {
k = 1;
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp *
(5.0*ue[k][m] - 4.0*ue[k+1][m] +ue[k+2][m]);
k = 2;
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp *
(-4.0*ue[k-... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(dssp ,m ,j ,i ) | 100 | dssp *
(-4.0*ue[k-1][m] + 6.0*ue[k][m] -
4.0*ue[k+1][m] + ue[k+2][m]);
}
<LOOP-START>for (m = 0; m < 5; m++) {
#pragma omp parallel for firstprivate(k ,dssp ,m ,j ,i )
for (k = 1*3; k <= grid_points[2]-3*1-1; k++) {
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp*
(ue[k-2][m] - 4.... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(k ,dssp ,m ,j ,i ) | 100 | }
#pragma omp parallel for firstprivate(dssp ,m ,j ,i )
for (m = 0; m < 5; m++) {
<LOOP-START>for (k = 1*3; k <= grid_points[2]-3*1-1; k++) {
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp*
(ue[k-2][m] - 4.0*ue[k-1][m] +
6.0*ue[k][m] - 4.0*ue[k+1][m] + ue[k+2][m]);
}<LOOP-END> <OMP-ST... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(dssp ,k ,m ,j ,i ) | 100 | (ue[k-2][m] - 4.0*ue[k-1][m] +
6.0*ue[k][m] - 4.0*ue[k+1][m] + ue[k+2][m]);
}
}
<LOOP-START>for (m = 0; m < 5; m++) {
k = grid_points[2]-3;
forcing[i][j][k][m] = forcing[i][j][k][m] - dssp *
(ue[k-2][m] - 4.0*ue[k-1][m] +
6.0*ue[k][m] - 4.0*ue[k+1][m]);
k = grid_points[2]-2;
forcing[i][j]... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | of the forcing function,
c-------------------------------------------------------------------*/
<LOOP-START>for (i = 1; i < grid_points[0]-1; i++) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
for (j = 1; j < grid_points[1]-1; j++) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
fo... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(j ,k ,m ,i ) | 100 | ----------------------*/
#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 firstprivate(j ,k ,m ,i )
for (k = 1; k < grid_points[2]-1; k++) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
for (m =... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(j ,k ,m ,i ) | 100 | agma omp parallel for firstprivate(j ,k ,m ,i )
for (j = 1; j < grid_points[1]-1; j++) {
<LOOP-START>for (k = 1; k < grid_points[2]-1; k++) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
for (m = 0; m < 5; m++) {
forcing[i][j][k][m] = -1.0 * forcing[i][j][k][m];
}
}<LOOP-END> <OMP-START>#p... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(j ,k ,m ,i ) | 100 | #pragma omp parallel for firstprivate(j ,k ,m ,i )
for (k = 1; k < grid_points[2]-1; k++) {
<LOOP-START>for (m = 0; m < 5; m++) {
forcing[i][j][k][m] = -1.0 * forcing[i][j][k][m];
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(j ,k ,m ,i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(zeta ,eta ,xi ,dtemp ,m ) | 100 | xi, eta, zeta
c-------------------------------------------------------------------*/
int m;
<LOOP-START>for (m = 0; m < 5; m++) {
dtemp[m] = ce[m][0] +
xi*(ce[m][1] + xi*(ce[m][4] + xi*(ce[m][7]
+ xi*ce[m][10]))) +
eta*(ce[m][2] + eta*(ce[m][5] + eta*(ce[m][8]
+ eta*ce[m][11])))+
... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | ing the whole thing here.
c-------------------------------------------------------------------*/
<LOOP-START>for (i = 0; i < IMAX; i++) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
for (j = 0; j < IMAX; j++) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
for (k = 0; k < IMAX; k++)... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(j ,k ,m ,i ) | 100 | ----------------------------------*/
#pragma omp parallel for
for (i = 0; i < IMAX; i++) {
<LOOP-START>for (j = 0; j < IMAX; j++) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
for (k = 0; k < IMAX; k++) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
for (m = 0; m < 5; m++) {
u[i... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(j ,k ,m ,i ) | 100 | +) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
for (j = 0; j < IMAX; j++) {
<LOOP-START>for (k = 0; k < IMAX; k++) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
for (m = 0; m < 5; m++) {
u[i][j][k][m] = 1.0;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(j ,k ... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(j ,k ,m ,i ) | 100 | ++) {
#pragma omp parallel for firstprivate(j ,k ,m ,i )
for (k = 0; k < IMAX; k++) {
<LOOP-START>for (m = 0; m < 5; m++) {
u[i][j][k][m] = 1.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(j ,k ,m ,i ) <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 |
for (k = 0; k < grid_points[2]; k++) {
zeta = (double)k * dnzm1;
<LOOP-START>for (ix = 0; ix < 2; ix++) {
exact_solution((double)ix, eta, zeta,
&(Pface[ix][0][0]));
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | iz++) {
exact_solution(xi, eta, (double)iz,
&Pface[iz][2][0]);
}
<LOOP-START>for (m = 0; m < 5; m++) {
Pxi = xi * Pface[1][0][m] +
(1.0-xi) * Pface[0][0][m];
Peta = eta * Pface[1][1][m] +
(1.0-eta) * Pface[0][1][m];
Pzeta = zeta * Pface[1][2][m] +
(... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | _points[2]; k++) {
zeta = (double)k * dnzm1;
exact_solution(xi, eta, zeta, temp);
<LOOP-START>for (m = 0; m < 5; m++) {
u[i][j][k][m] = temp[m];
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | _points[2]; k++) {
zeta = (double)k * dnzm1;
exact_solution(xi, eta, zeta, temp);
<LOOP-START>for (m = 0; m < 5; m++) {
u[i][j][k][m] = temp[m];
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | _points[2]; k++) {
zeta = (double)k * dnzm1;
exact_solution(xi, eta, zeta, temp);
<LOOP-START>for (m = 0; m < 5; m++) {
u[i][j][k][m] = temp[m];
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | _points[2]; k++) {
zeta = (double)k * dnzm1;
exact_solution(xi, eta, zeta, temp);
<LOOP-START>for (m = 0; m < 5; m++) {
u[i][j][k][m] = temp[m];
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for | 100 | eft hand side for starters
c-------------------------------------------------------------------*/
<LOOP-START>for (i = 0; i < grid_points[0]; i++) {
#pragma omp parallel for firstprivate(j ,k ,m ,n ,i )
for (j = 0; j < grid_points[1]; j++) {
#pragma omp parallel for firstprivate(j ,k ,m ,n ,i )
... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(j ,k ,m ,n ,i ) | 100 | ------------------------*/
#pragma omp parallel for
for (i = 0; i < grid_points[0]; i++) {
<LOOP-START>for (j = 0; j < grid_points[1]; j++) {
#pragma omp parallel for firstprivate(j ,k ,m ,n ,i )
for (k = 0; k < grid_points[2]; k++) {
#pragma omp parallel for firstprivate(j ,k ,m ,n ,i )
for (m... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(j ,k ,m ,n ,i ) | 100 | gma omp parallel for firstprivate(j ,k ,m ,n ,i )
for (j = 0; j < grid_points[1]; j++) {
<LOOP-START>for (k = 0; k < grid_points[2]; k++) {
#pragma omp parallel for firstprivate(j ,k ,m ,n ,i )
for (m = 0; m < 5; m++) {
#pragma omp parallel for firstprivate(j ,k ,m ,n ,i )
for (n = 0; n < 5; n++) {... |
LLNL/AutoParBench/benchmarks/baseline/NPB3.0-omp-c/BT/bt.c | #pragma omp parallel for firstprivate(j ,k ,m ,n ,i ) | 100 | pragma omp parallel for firstprivate(j ,k ,m ,n ,i )
for (k = 0; k < grid_points[2]; k++) {
<LOOP-START>for (m = 0; m < 5; m++) {
#pragma omp parallel for firstprivate(j ,k ,m ,n ,i )
for (n = 0; n < 5; n++) {
lhs[i][j][k][0][m][n] = 0.0;
lhs[i][j][k][1][m][n] = 0.0;
lhs[i][j][k][2][m][n] ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.