filename stringlengths 19 182 | omp_pragma_line stringlengths 24 416 | context_chars int64 100 100 | text stringlengths 152 177k |
|---|---|---|---|
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_for_06.c | #pragma omp parallel for firstprivate(a, b) lastprivate(a, b) | 100 | e <stdio.h>
int a;
int b;
int main(int argc, char *argv[])
{
int i;
a = -3;
b = -4;
<LOOP-START>for (i = 0; i < 100; i++)
{
if (a < 0) if (a != -3) abort();
if (b < 0) if (b != -4) abort();
a = i;
b = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivat... |
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_vla_04.c | #pragma omp parallel for shared(v) | 100 | [j]: %d\n", v[i][j]);
assert(v[i][j] == 0);
v[i][j]++;
}
}
<LOOP-START>for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
// printf("2. v[i][j]: %d\n", v[i][j]);
assert(v[i][j] == 0);
v[i][j]++;
}
}<LOOP... |
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_vla_04.c | #pragma omp parallel for firstprivate(v) | 100 | [j]: %d\n", v[i][j]);
assert(v[i][j] == 0);
v[i][j]++;
}
}
<LOOP-START>for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
// printf("3. v[i][j]: %d\n", v[i][j]);
assert(v[i][j] == 1);
v[i][j]++;
}
}<LOOP... |
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_collapse_01.c | #pragma omp parallel for collapse(2) | 100 |
int main(int argc, char* argv[])
{
int v[N][N];
int i, j;
{
init(v);
<LOOP-START>for(i = 0; i < N; ++i)
for(j = 0; j < N; ++j)
v[i][j] += 1;
check(v);
}
{
init(v);
#pragma omp parallel
{
#pragma omp for colla... |
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_parallel_for_03.c | #pragma omp parallel for reduction(+:s) | 100 | ude <stdio.h>
#define NUM_ELEMS 100
int main(int argc, char *argv[])
{
int i;
int s = 0;
<LOOP-START>for (i = 0; i < NUM_ELEMS; i++)
{
s = s + i;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:s)<OMP-END> |
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_new_udr_06.c | #pragma omp parallel for reduction(mymin:x) | 100 | for ( i = 0; i < N ; i++ ) a[i] = i;
#ifdef NANOX
#pragma omp for reduction(mymin:x)
#else
<LOOP-START>for ( i = 0; i < N ; i++ )
{
x = a[i] < x ? a[i] : x;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(mymin:x)<OMP-END> |
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_parallel_for_02.c | #pragma omp parallel for private(x) | 100 | lude <stdio.h>
#define NUM_ELEMS 1000
int main(int argc, char *argv[])
{
int c[NUM_ELEMS], x;
<LOOP-START>for (int i = 0; i < NUM_ELEMS; i++)
{
x = i;
c[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(x)<OMP-END> |
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_task_03.c | #pragma omp parallel for | 100 | dlib.h>
#define NUM_ELEMS 100
int main(int argc, char* argv[])
{
int i;
int c[NUM_ELEMS];
<LOOP-START>for (i = 0; i < NUM_ELEMS; i++)
{
int *p = &(c[i]);
#pragma omp task firstprivate(p, i)
{
*p = i;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_new_udr_08.c | #pragma omp parallel for reduction(complex_add:x) reduction(complex_mul:y) | 100 | )
#define N 100
my_complex_t vector[N];
int foo(my_complex_t x, my_complex_t y)
{
int i;
<LOOP-START>for ( i = 0; i < N ; i++ )
{
x = complex_add(x,vector[i]);
y = complex_mul(y,vector[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(complex_add:x) reduction(complex_mul... |
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_for_16.c | #pragma omp parallel for default(none) | 100 | nt argc, char* argv[])
{
int i;
#pragma omp for default(none)
for(i=0;i<8;i++)
{
}
<LOOP-START>for(i=0;i<8;i++)
{
}<LOOP-END> <OMP-START>#pragma omp parallel for default(none)<OMP-END> |
bsc-pm/mcxx/tests/07_phases_omp.dg/common/c/success_parallel_for_01.c | #pragma omp parallel for | 100 |
#define NUM_ELEMS 1000
int main(int argc, char *argv[])
{
int i = -1;
int c[NUM_ELEMS];
<LOOP-START>for (i = 0; i < NUM_ELEMS; i++)
{
c[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
bsc-pm/mcxx/tests/07_phases_ompss.dg/cxx/success_task_13.cpp | #pragma omp parallel for reduction(+:result) | 100 | 6_imcxx=yes
</testinfo>
*/
template < typename T>
int foo(T* x, T* y, int n)
{
int result = 0;
<LOOP-START>for (int i = 0; i < n; ++i)
{
result += x[i] + y[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:result)<OMP-END> |
bsc-pm/mcxx/tests/07_phases_ompss.dg/cxx/success_parallel_for_slicer_01.cpp | #pragma omp parallel for reduction(+:s) | 100 | nclude <stdio.h>
#include <assert.h>
int main(int argc, char *argv[])
{
int i;
int s = 0;
<LOOP-START>for (i = 0; i < 100; i++)
{
s += i;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:s)<OMP-END> |
bsc-pm/mcxx/tests/07_phases_ompss.dg/cxx/success_for_01.cpp | #pragma omp parallel for | 100 | fo>
*/
#include <assert.h>
template <typename T>
void f(T* t, T lower, T length, T val)
{
T i;
<LOOP-START>for (i = lower; i < (lower + length); i++)
{
t[i] = val + i;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
bsc-pm/mcxx/tests/07_phases_ompss.dg/c/success_for_slicer_03.c | #pragma omp parallel for lastprivate(a, b) | 100 | <stdio.h>
int a;
int main(int argc, char *argv[])
{
int b;
int i;
a = 3;
b = 4;
<LOOP-START>for (i = 0; i < 10; i++)
{
a = i;
b = i + 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for lastprivate(a, b)<OMP-END> |
bsc-pm/mcxx/tests/07_phases_ompss.dg/c/success_for_slicer_04.c | #pragma omp parallel for firstprivate(a, b) lastprivate(a, b) | 100 | e <stdio.h>
int a;
int b;
int main(int argc, char *argv[])
{
int i;
a = -3;
b = -4;
<LOOP-START>for (i = 0; i < 100; i++)
{
if (a < 0) if (a != -3) abort();
if (b < 0) if (b != -4) abort();
a = i;
b = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivat... |
bsc-pm/mcxx/tests/07_phases_ompss.dg/c/success_for_slicer_05.c | #pragma omp parallel for firstprivate(a, b) lastprivate(a, b) | 100 | char *argv[])
{
int b[10];
int i;
a[1] = 3;
a[2] = 2;
b[4] = 4;
b[5] = 5;
<LOOP-START>for (i = 0; i < 10; i++)
{
a[1] = a[2];
b[4] = b[5];
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(a, b) lastprivate(a, b)<OMP-END> |
bsc-pm/mcxx/tests/07_phases_ompss.dg/c/success_array_reductions_01.c | #pragma omp parallel for firstprivate(a) reduction(+:[array_size]result) | 100 | y_size], int *result)
{
int i;
for (i = 0; i < array_size; i++)
{
result[i] = 0;
}
<LOOP-START>for (i = 0; i < NUM_ITEMS; i++)
{
int j;
for (j = 0; j < array_size; j++)
{
result[j] += a[i][j];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for firstprivate(a) reduction(+:[arr... |
bsc-pm/mcxx/tests/07_phases_ompss.dg/c/success_parallel_for_slicer_01.c | #pragma omp parallel for reduction(+:s) | 100 | nclude <stdio.h>
#include <assert.h>
int main(int argc, char *argv[])
{
int i;
int s = 0;
<LOOP-START>for (i = 0; i < 100; i++)
{
s += i;
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:s)<OMP-END> |
bsc-pm/mcxx/tests/02_typecalc_cxx.dg/success_650.cpp | #pragma omp parallel for | 100 | rator=config/mercurium
test_CXXFLAGS="-fopenmp"
</testinfo>
*/
#include <cstdio>
void foo(int N)
{
<LOOP-START>for (int i = 0; i < N; i++)
{
printf("%d\n", i);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
bsc-pm/mcxx/tests/02_typecalc_cxx.dg/success_650.cpp | #pragma omp parallel for | 100 | id, but also checks that we convert 'int i(0)' into
// 'int i = 0' in this case.
void foo2(int N)
{
<LOOP-START>for (int i(0); i < N; i++)
{
printf("%d\n", i);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
ParRes/Kernels/C1z/nstream-ua-target.c | #pragma omp parallel for simd schedule(static) | 100 | loc(bytes, host);
double * restrict C = omp_target_alloc(bytes, host);
double scalar = 3.0;
<LOOP-START>for (size_t i=0; i<length; i++) {
A[i] = 0.0;
B[i] = 2.0;
C[i] = 2.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd schedule(static)<OMP-END> |
ParRes/Kernels/C1z/nstream-ua-target.c | #pragma omp parallel for reduction(+:asum) | 100 | 0; i<=iterations; i++) {
ar += br + scalar * cr;
}
ar *= length;
double asum = 0.0;
<LOOP-START>for (size_t i=0; i<length; i++) {
asum += fabs(A[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:asum)<OMP-END> |
ParRes/Kernels/C1z/nstream-target.c | #pragma omp parallel for simd | 100 | strict B = prk_malloc(bytes);
double * restrict C = prk_malloc(bytes);
double scalar = 3.0;
<LOOP-START>for (size_t i=0; i<length; i++) {
A[i] = 0.0;
B[i] = 2.0;
C[i] = 2.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
ParRes/Kernels/C1z/nstream-target.c | #pragma omp parallel for reduction(+:asum) | 100 | 0; i<=iterations; i++) {
ar += br + scalar * cr;
}
ar *= length;
double asum = 0.0;
<LOOP-START>for (size_t i=0; i<length; i++) {
asum += fabs(A[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:asum)<OMP-END> |
ParRes/Kernels/C1z/nstream-memcpy-target.c | #pragma omp parallel for simd schedule(static) | 100 | c(bytes, host);
double * restrict h_C = omp_target_alloc(bytes, host);
double scalar = 3.0;
<LOOP-START>for (size_t i=0; i<length; i++) {
h_A[i] = 0.0;
h_B[i] = 2.0;
h_C[i] = 2.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd schedule(static)<OMP-END> |
ParRes/Kernels/C1z/nstream-memcpy-target.c | #pragma omp parallel for reduction(+:asum) | 100 | 0; i<=iterations; i++) {
ar += br + scalar * cr;
}
ar *= length;
double asum = 0.0;
<LOOP-START>for (size_t i=0; i<length; i++) {
asum += fabs(h_A[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:asum)<OMP-END> |
ParRes/Kernels/OPENMP/PIC/pic.c | #pragma omp parallel for private(i, p, fx, fy, ax, ay) | 100 | {
pic_time = wtime();
}
/* Calculate forces on particles and update positions */
<LOOP-START>for (i=0; i<n; i++) {
p = particles;
fx = 0.0;
fy = 0.0;
computeTotalForce(p[i], L, Qgrid, &fx, &fy);
ax = fx * MASS_INV;
ay = fy * MASS_INV;
/* Update particle posi... |
ParRes/Kernels/OPENMP/Transpose/transpose.c | #pragma omp parallel for reduction(+:abserr) | 100 | bserr=0.0;
size_t i, j;
double addit = ((double)(iterations+1) * (double) (iterations))/2.0;
<LOOP-START>for (j=0;j<order;j++) {
for (i=0;i<order; i++) {
abserr += ABS(B(i,j) - ((i*order + j)*(iterations+1L)+addit));
}
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:abserr)<OMP-END> |
ParRes/Kernels/OPENMP/DGEMM/dgemm.c | #pragma omp parallel for private(i,j) | 100 | exit(EXIT_FAILURE);
}
ref_checksum = (0.25*forder*forder*forder*(forder-1.0)*(forder-1.0));
<LOOP-START>for(j = 0; j < order; j++) for(i = 0; i < order; i++) {
A_arr(i,j) = B_arr(i,j) = (double) j;
C_arr(i,j) = 0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i,j) <OMP-END> |
ParRes/Kernels/OPENMP/Stencil/stencil.c | #pragma omp parallel for private(i) | 100 | /* intialize the input and output arrays */
#if PARALLELFOR
<LOOP-START>#else
#pragma omp for
for (j=0; j<n; j++) for (i=0; i<n; i++)
IN(i,j) = COEFX*i+COEFY*j;
#if PARALLELFOR
#pragma omp parallel for private(i)
#else
#pragma omp for
for (j=RADIUS; j<n-RADIUS; j+... |
ParRes/Kernels/OPENMP/Stencil/stencil.c | #pragma omp parallel for private(i) | 100 | r
#endif
for (j=0; j<n; j++) for (i=0; i<n; i++)
IN(i,j) = COEFX*i+COEFY*j;
#if PARALLELFOR
<LOOP-START>#else
#pragma omp for
for (j=RADIUS; j<n-RADIUS; j++) for (i=RADIUS; i<n-RADIUS; i++)
OUT(i,j) = (DTYPE)0.0;
for (iter = 0; iter<=iterations; iter++){
/* start timer after a warmup iteration ... |
ParRes/Kernels/OPENMP/Stencil/stencil.c | #pragma omp parallel for private(i, ii, jj) | 100 | pragma omp master
#endif
{
stencil_time = wtime();
}
}
#if PARALLELFOR
<LOOP-START>#else
#pragma omp for
for (j=RADIUS; j<n-RADIUS; j++) {
for (i=RADIUS; i<n-RADIUS; i++) {
#if STAR
#if LOOPGEN
#include "loop_body_star.incl"
#else
... |
ParRes/Kernels/OPENMP/Stencil/stencil.c | #pragma omp parallel for private(i) | 100 | /* add constant to solution to force refresh of neighbor data, if any */
#if PARALLELFOR
<LOOP-START>#else
#pragma omp for
for (j=0; j<n; j++) for (i=0; i<n; i++) IN(i,j)+= 1.0;
} /* end of iterations */
#if !PARALLELFOR
#pragma omp barrier... |
ParRes/Kernels/OPENMP/Stencil/stencil.c | #pragma omp parallel for reduction(+:norm), private (i) | 100 | /* compute L1 norm in parallel */
#if PARALLELFOR
<LOOP-START>#else
#pragma omp for reduction(+:norm)
for (j=RADIUS; j<n-RADIUS; j++) for (i=RADIUS; i<n-RADIUS; i++) {
norm += (DTYPE)ABS(OUT(i,j));
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:n... |
ParRes/Kernels/Cxx11/sgemm-cblas.cc | #pragma omp parallel for schedule(dynamic) num_threads(nt) | 100 |
const int n = order;
const float alpha = 1.0;
const float beta = 1.0;
#ifdef _OPENMP
<LOOP-START>for (int b=0; b<batches; ++b) {
cblas_sgemm(CblasRowMajor, CblasNoTrans, CblasNoTrans,
n, n, n, alpha, A[b].data(), n, B[b].data(), n, beta, C[b].data(), n);
}<LOOP-END> <OMP-S... |
ParRes/Kernels/Cxx11/dgemm-cblas.cc | #pragma omp parallel for schedule(dynamic) num_threads(nt) | 100 | const int n = order;
const double alpha = 1.0;
const double beta = 1.0;
#ifdef _OPENMP
<LOOP-START>for (int b=0; b<batches; ++b) {
cblas_dgemm(CblasRowMajor, CblasNoTrans, CblasNoTrans,
n, n, n, alpha, A[b].data(), n, B[b].data(), n, beta, C[b].data(), n);
}<LOOP-END> <OMP-S... |
ParRes/Kernels/Cxx11/dgemm-mpi-cblas.cc | #pragma omp parallel for schedule(dynamic) num_threads(nt) | 100 | const int n = order;
const double alpha = 1.0;
const double beta = 1.0;
#ifdef _OPENMP
<LOOP-START>for (int b=0; b<batches; ++b) {
cblas_dgemm(CblasRowMajor, CblasNoTrans, CblasNoTrans,
n, n, n, alpha, A[b].data(), n, B[b].data(), n, beta, C[b].data(), n);
}<LOOP-END> <OMP-S... |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (i,it,jt) collapse(2) | 100 | */
istart = 0;
if (tiling) {
#if COLLAPSE
<LOOP-START>#else
#pragma omp parallel for private (i,it,jt)
for (j=0; j<Block_order; j+=Tile_order)
for (i=0; i<order; i+=Tile_order)
for (jt=j; jt<MIN(Block_order,j+Tile_order);jt++)
... |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (i,it,jt) | 100 |
if (tiling) {
#if COLLAPSE
#pragma omp parallel for private (i,it,jt) collapse(2)
#else
<LOOP-START>for (j=0; j<Block_order; j+=Tile_order)
for (i=0; i<order; i+=Tile_order)
for (jt=j; jt<MIN(Block_order,j+Tile_order);jt++)
for (it=i; it<MIN(order,i+Tile_order); it++) {
... |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (i) | 100 | jt) = (double) (order*(jt+colstart) + it);
B(it,jt) = 0.0;
}
}
else {
<LOOP-START>for (j=0;j<Block_order;j++)
for (i=0;i<order; i++) {
A(i,j) = (double) (order*(j+colstart) + i);
B(i,j) = 0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (j) | 100 | */
istart = colstart;
if (!tiling) {
<LOOP-START>for (i=0; i<Block_order; i++)
for (j=0; j<Block_order; j++) {
B(j,i) += A(i,j);
A(i,j) += 1.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (j,it,jt) collapse(2) | 100 | j++) {
B(j,i) += A(i,j);
A(i,j) += 1.0;
}
}
else {
#if COLLAPSE
<LOOP-START>#else
#pragma omp parallel for private (j,it,jt)
for (i=0; i<Block_order; i+=Tile_order)
for (j=0; j<Block_order; j+=Tile_order)
for (it=i; it<MIN(Block_order,i+Tile_order); i... |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (j,it,jt) | 100 | }
else {
#if COLLAPSE
#pragma omp parallel for private (j,it,jt) collapse(2)
#else
<LOOP-START>for (i=0; i<Block_order; i+=Tile_order)
for (j=0; j<Block_order; j+=Tile_order)
for (it=i; it<MIN(Block_order,i+Tile_order); it++)
for (jt=j; jt<MIN(Block_order,j+Tile_order);j... |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (j) | 100 | COMM_WORLD, &recv_req);
#endif
istart = send_to*Block_order;
if (!tiling) {
<LOOP-START>for (i=0; i<Block_order; i++)
for (j=0; j<Block_order; j++){
Work_out(j,i) = A(i,j);
A(i,j) += 1.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (j)<OMP-END> |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (j,it,jt) collapse(2) | 100 | Work_out(j,i) = A(i,j);
A(i,j) += 1.0;
}
}
else {
#if COLLAPSE
<LOOP-START>#else
#pragma omp parallel for private (j,it,jt)
for (i=0; i<Block_order; i+=Tile_order)
for (j=0; j<Block_order; j+=Tile_order)
for (it=i; it<MIN(Block_order,i+Tile_ord... |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (j,it,jt) | 100 | else {
#if COLLAPSE
#pragma omp parallel for private (j,it,jt) collapse(2)
#else
<LOOP-START>for (i=0; i<Block_order; i+=Tile_order)
for (j=0; j<Block_order; j+=Tile_order)
for (it=i; it<MIN(Block_order,i+Tile_order); it++)
for (jt=j; jt<MIN(Block_order,j+Tile_orde... |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (i) | 100 | cv_from*Block_order;
/* scatter received block to transposed matrix; no need to tile */
<LOOP-START>for (j=0; j<Block_order; j++)
for (i=0; i<Block_order; i++)
B(i,j) += Work_in(i,j);
} /* end of phase loop */
} /* end of iterations */
local_trans_time = wtime() - local_trans_t... |
ParRes/Kernels/MPIOPENMP/Transpose/transpose.c | #pragma omp parallel for private (i) | 100 | bserr = 0.0;
istart = 0;
double addit = ((double)(iterations+1) * (double) (iterations))/2.0;
<LOOP-START>for (j=0;j<Block_order;j++) for (i=0;i<order; i++) {
abserr += ABS(B(i,j) - (double)((order*i + j+colstart)*(iterations+1)+addit));
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
ParRes/Kernels/MPIOPENMP/Nstream/nstream.c | #pragma omp parallel for simd | 100 | fset = %ld\n", offset);
printf("Number of iterations = %d\n", iterations);
}
<LOOP-START>for (j=0; j<length; j++) {
a[j] = 0.0;
b[j] = 2.0;
c[j] = 2.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd<OMP-END> |
ParRes/Kernels/MPIOPENMP/Nstream/nstream.c | #pragma omp parallel for simd | 100 | if (iter == 1) {
MPI_Barrier(MPI_COMM_WORLD);
local_nstream_time = wtime();
}
<LOOP-START>for (j=0; j<length; j++) a[j] += b[j]+scalar*c[j];
} /* end iterations */
/*********************************************************************
** Analyze and output results.
*********************... |
ParRes/Kernels/MPIOPENMP/Nstream/nstream.c | #pragma omp parallel for simd reduction(+:asum) | 100 | 0; iter<=iterations; iter++) aj += bj+scalar*cj;
aj = aj * (double) (length);
asum = 0.0;
<LOOP-START>for (j=0; j<length; j++) asum += a[j];
#if VERBOSE
printf ("Results Comparison: \n");
printf (" Expected checksum: %f\n",aj);
printf (" Observed checksum: %f\n",asum);
if (ABS(aj-as... |
ParRes/Kernels/MPIOPENMP/Stencil/stencil.c | #pragma omp parallel for private (i) | 100 | ) (n-2*RADIUS);
/* intialize the input and output arrays */
<LOOP-START>for (j=jstart; j<=jend; j++) for (i=istart; i<=iend; i++) {
IN(i,j) = COEFX*i+COEFY*j;
OUT(i,j) = (DTYPE)0.0;
}<LOOP-END> <OMP-START>#pragma omp parallel for private (i)<OMP-END> |
ParRes/Kernels/MPIOPENMP/Stencil/stencil.c | #pragma omp parallel for private (i, j, ii, jj) | 100 | +) {
IN(i,j) = left_buf_in[kk++];
}
}
/* Apply the stencil operator */
<LOOP-START>for (j=MAX(jstart,RADIUS); j<=MIN(n-RADIUS-1,jend); j++) {
for (i=MAX(istart,RADIUS); i<=MIN(n-RADIUS-1,iend); i++) {
#if LOOPGEN
#include "loop_body_star.incl"
#else
... |
ParRes/Kernels/MPIOPENMP/Stencil/stencil.c | #pragma omp parallel for private (i) | 100 | i=1; ii<=RADIUS; ii++) OUT(i,j) += WEIGHT(ii,0)*IN(i+ii,j);
#endif
}
}
<LOOP-START>/* add constant to solution to force refresh of neighbor data, if any */
for (j=jstart; j<=jend; j++) for (i=istart; i<=iend; i++) IN(i,j)+= 1.0;
}
local_stencil_time = wtime() - local_stencil_time;... |
ParRes/Kernels/MPIOPENMP/Stencil/stencil.c | #pragma omp parallel for reduction(+:local_norm) private (i) | 100 | e L1 norm in parallel */
local_norm = (DTYPE) 0.0;
<LOOP-START>for (j=MAX(jstart,RADIUS); j<=MIN(n-RADIUS-1,jend); j++) {
for (i=MAX(istart,RADIUS); i<=MIN(n-RADIUS-1,iend); i++) {
local_norm += (DTYPE)ABS(OUT(i,j));
}
}<LOOP-END> <OMP-START>#pragma omp p... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/Bisection.cpp | #pragma omp parallel for | 100 |
//omp_set_num_threads(nthreads);
//omp_set_dynamic(0);
//int threads = omp_get_max_threads();
<LOOP-START>for (int i = 0; i < nthreads; i++) {
//std::cout << "threads" << omp_get_num_threads() << std::endl;
int f = i * (n / nthreads);
int l = (i + 1)*(n / nthreads) - 1;
compute_group_bisect(diagonal, offd... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/JacobiAsync.cpp | #pragma omp parallel for shared(distr_status, top, bot, S, U, processPointer) private(row,col) | 100 | j = 0; j < n - 1; j++)
{
distr_status.clear();
toProcess.clear();
processPointer = 0;
<LOOP-START>//#pragma omp parallel for shared(top,bot) private(row,col)
for (int i = 0; i < S.size1() / 2; i++)
{
//cout << "pair" << endl << top << endl << bot << endl;
std::string num_thread_str = "[" + s... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/JacobiAsync.cpp | #pragma omp parallel for shared(top,bot) private(row,col) | 100 | lel for shared(distr_status, top, bot, S, U, processPointer) private(row,col) //num_threads(2)
//<LOOP-START>for (int i = 0; i < S.size1() / 2; i++)
{
//cout << "pair" << endl << top << endl << bot << endl;
std::string num_thread_str = "[" + std::to_string(omp_get_thread_num()) + "]";
row = std::max(t... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/parallel_jacobi.h | #pragma omp parallel for default(none) shared(mat, n, si, co, pe, isodd) | 100 |
//root.start();
while (not_converged) {
for (int set = 0; set<n; ++set) {
#ifdef omptest
<LOOP-START>for (int k = 0; k<m; ++k) {
int p, q;
pe.get(k, p, q);
if (isodd && (p == n || q == n)) continue;
symmetric_schur_new(mat, p, q, co[k], si[k]);
premultiply(mat, p, q, co[k], si[k]);
... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/parallel_jacobi.h | #pragma omp parallel for default(none) shared(mat, n, si, co, pe, isodd) | 100 | schur_new(mat, p, q, co[k], si[k]);
premultiply(mat, p, q, co[k], si[k]);
}
#ifdef omptest
<LOOP-START>for (int k = 0; k<m; ++k) {
int p, q;
pe.get(k, p, q);
if (isodd && (p == n || q == n)) continue;
postmultiply(mat, p, q, co[k], si[k]);
}<LOOP-END> <OMP-START>#pragma omp parallel fo... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/JacobiIteration1.cpp | #pragma omp parallel for shared(S) | 100 | ads();
bool iterating = true;
while (iterating)
{
debugMatrixForm(S);
ssteqr_debug(S);
//<LOOP-START>for (int pp = 0; pp < n - 2; pp += 2) {
int p = pp;
int q = p + 1;
////printf("In thread %d p = %d q = %d\n", omp_get_thread_num(), p, q);
//std::cout << "S(p, q)" << S(p, q) << " | " << "S(q, p)"... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/JacobiIteration1.cpp | #pragma omp parallel for shared(S) | 100 | ;
//std::cout << p << " p|q " << q << std::endl;
//std::cout << "====" << std::endl;
}
//<LOOP-START>for (int pp = 1; pp < n - 1; pp += 2) {
int p = pp;
int q = p + 1;
/*std::cout << "S(p, q)" << S(p, q) << " | " << "S(q, p)" << S(q, p) << std::endl;
debugMatrixForm(S);
std::cout << p <<" p|q ... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/JacobiEigenCode/parallel_jacobi.h | #pragma omp parallel for default(none) shared(mat, n, si, co, pe, isodd) | 100 |
//root.start();
while (not_converged) {
for (int set = 0; set<n; ++set) {
#ifdef omptest
<LOOP-START>for (int k = 0; k<m; ++k) {
int p, q;
pe.get(k, p, q);
if (isodd && (p == n || q == n)) continue;
symmetric_schur_new(mat, p, q, co[k], si[k]);
premultiply(mat, p, q, co[k], si[k]);
... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/JacobiEigenCode/parallel_jacobi.h | #pragma omp parallel for default(none) shared(mat, n, si, co, pe, isodd) | 100 | schur_new(mat, p, q, co[k], si[k]);
premultiply(mat, p, q, co[k], si[k]);
}
#ifdef omptest
<LOOP-START>for (int k = 0; k<m; ++k) {
int p, q;
pe.get(k, p, q);
if (isodd && (p == n || q == n)) continue;
postmultiply(mat, p, q, co[k], si[k]);
}<LOOP-END> <OMP-START>#pragma omp parallel fo... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/JacobiEigenCode/JacobiIteration1.cpp | #pragma omp parallel for shared(S) | 100 | ads();
bool iterating = true;
while (iterating)
{
debugMatrixForm(S);
ssteqr_debug(S);
//<LOOP-START>for (int pp = 0; pp < n - 2; pp += 2) {
int p = pp;
int q = p + 1;
////printf("In thread %d p = %d q = %d\n", omp_get_thread_num(), p, q);
//std::cout << "S(p, q)" << S(p, q) << " | " << "S(q, p)"... |
NikiforovAll/JacobiEigenvalueAlgorithm/JacobiEigenvalueAlgorithm/JacobiEigenCode/JacobiIteration1.cpp | #pragma omp parallel for shared(S) | 100 | ;
//std::cout << p << " p|q " << q << std::endl;
//std::cout << "====" << std::endl;
}
//<LOOP-START>for (int pp = 1; pp < n - 1; pp += 2) {
int p = pp;
int q = p + 1;
/*std::cout << "S(p, q)" << S(p, q) << " | " << "S(q, p)" << S(q, p) << std::endl;
debugMatrixForm(S);
std::cout << p <<" p|q ... |
rshrc/parallel-processing/openmp/parallel_loops.c | #pragma omp parallel for | 100 | main(int argc, char *argv[])
{
int arr[50000], count0 = 0, count1 = 0, count2 = 0, count3 = 0;
<LOOP-START>for (int i = 0; i < 50000; i++)
{
int thread_being_used = omp_get_thread_num();
arr[i] = 5 * i;
printf("Using Thread : %d\n", thread_being_used);
if (thread_being_used == 0... |
AyushBhandariNITK/Parallel_Graph_Coloring_Using_Openmp/coloring.cpp | #pragma omp parallel for shared(allIsColored) reduction(+:num_colored) | 100 | nd;
}
bool GraphColoring::allColored() const {
bool allIsColored = true;
uint num_colored = 0;
<LOOP-START>for (int i = 0; i < num_vertices; i++) {
if (colors[i] == UNKNOWN) {
allIsColored = false;
}
num_colored++;
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(allIsColored) reduction(+... |
AyushBhandariNITK/Parallel_Graph_Coloring_Using_Openmp/coloring.cpp | #pragma omp parallel for reduction(+:false_colored) | 100 | red++;
}
return allIsColored;
}
bool GraphColoring::accuracy() const {
int false_colored = 0;
<LOOP-START>for (int v_i = 0; v_i < num_vertices; v_i++) {
for (int neighbor_ind = row_ptr[v_i]; neighbor_ind < row_ptr[v_i + 1]; neighbor_ind++) {
const int neighbor = col_ind[neighbor_ind];
if (colors[neighbor... |
AyushBhandariNITK/Parallel_Graph_Coloring_Using_Openmp/coloring.cpp | #pragma omp parallel for | 100 | s
// ========================================================
void GraphColoring::assignColors() {
<LOOP-START>for (uint vertex_ind = 0; vertex_ind < unvisited_vertices_tail; vertex_ind++) {
const uint vertex = unvisited_vertices[vertex_ind];
colors[vertex] = getNextColor(vertex);
}<LOOP-END> <OMP-START>#p... |
AyushBhandariNITK/Parallel_Graph_Coloring_Using_Openmp/coloring.cpp | #pragma omp parallel for schedule(guided) | 100 | ts() {
// Traverse edges of the graph, for edges (u, v) where C[u] = C[v] reset color of min(u, v)
<LOOP-START>for (unsigned int vertex_ind = 0; vertex_ind < unvisited_vertices_tail; vertex_ind++) {
const uint vertex = unvisited_vertices[vertex_ind];
for (unsigned int neighbor_ind = row_ptr[vertex]; neighbor_ind... |
AyushBhandariNITK/Parallel_Graph_Coloring_Using_Openmp/coloring.cpp | #pragma omp parallel for collapse(1) | 100 | e color of the one having the color on the other
// version 0.01 - linear search for such vertices
<LOOP-START>for (unsigned int vertex_ind = 0; vertex_ind < unvisited_vertices_tail; vertex_ind++) {
const uint vertex = unvisited_vertices[vertex_ind];
const uint vertex_color = colors[vertex];
for (uint neig... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/mcrat.c | #pragma omp parallel for num_threads(num_thread) private(angle_count) | 100 | =(int) (theta_jmin); angle_count< (int) (theta_jmax+1) ;angle_count=angle_count+delta_theta )
<LOOP-START>for (angle_count=0; angle_count< num_angles ;angle_count++ )
{
printf("%d\t%lf\n", omp_get_thread_num(), delta_theta );
double inj_radius;
int frm2, frm0;
char mc_... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/mclib.c | #pragma omp parallel for num_threads(nt) | 100 | rng = (gsl_rng **) malloc((num_thread ) * sizeof(gsl_rng *));
rng[0]=rand;
//<LOOP-START>for(i=1;i<num_thread;i++)
{
rng[i] = gsl_rng_alloc (rng_t);
gsl_rng_set(rng[i],gsl_rng_get(rand));
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(nt)<OMP-E... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/mclib.c | #pragma omp parallel for num_threads(num_thread) firstprivate( ph_x, ph_y, ph_z, ph_phi, dist_min, dist, j, min_index, n_dens_lab_tmp,n_vx_tmp, n_vy_tmp, n_vz_tmp, n_temp_tmp, fl_v_x, fl_v_y, fl_v_z, fl_v_norm, ph_v_norm, n_cosangle, mfp, beta, rnd_tracker) private(i) shared(min_mfp ) | 100 | mes the min (max) photon radius
//or just parallelize this part here
min_mfp=1e12;
<LOOP-START>for (i=0;i<num_ph; i++)
{
//printf("%e,%e\n", ((ph+i)->r0), ((ph+i)->r1));
if (dim_switch_3d==0)
{
ph_x=pow(pow(((ph+i)->r0),2.0)+pow(((ph+i)->r1),2.0), 0.5); //convert bac... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/PARALLELIZE/mclib.c | #pragma omp parallel for num_threads(nt) | 100 | )); //minus 1 because master thread already has rand initalized
rng[0]=rand;
//<LOOP-START>for(i=1;i<num_threads;i++)
{
rng[i] = gsl_rng_alloc (rng_t);
gsl_rng_set(rng[i],gsl_rng_get(rand));
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(nt)<OMP-... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/PARALLELIZE/mclib.c | #pragma omp parallel for firstprivate( ph_x, ph_y, ph_phi, dist_min, dist, j, min_index, n_dens_lab_tmp,n_vx_tmp, n_vy_tmp, n_temp_tmp, fl_v_x, fl_v_y, fl_v_z, fl_v_norm, ph_v_norm, n_cosangle, mfp, beta, rnd_tracker) private(i) shared(min_mfp ) | 100 | n (max) photon radius
//or just parallelize this part here
min_mfp=1e12;
<LOOP-START>for (i=0;i<num_ph; i++)
{
//printf("%e,%e\n", ((ph+i)->r0), ((ph+i)->r1));
ph_x=pow(pow(((ph+i)->r0),2.0)+pow(((ph+i)->r1),2.0), 0.5); //convert back to FLASH x coordinate
ph_y=((p... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/HYBRID_PARALLEL/mclib_3d.c | #pragma omp parallel for num_threads(num_thread) firstprivate(ph_r, ph_theta) reduction(min:temp_r_min) reduction(max:temp_r_max) reduction(min:temp_theta_min) reduction(max:temp_theta_max) | 100 | eta_min=DBL_MAX;
int i=0, num_thread=omp_get_num_threads();
double ph_r=0, ph_theta=0;
<LOOP-START>for (i=0;i<ph_num;i++)
{
if ((ph+i)->weight != 0)
{
ph_r=pow(pow( ((ph+i)->r0), 2.0) + pow(((ph+i)->r1),2.0 ) + pow(((ph+i)->r2) , 2.0),0.5);
ph_theta=acos(((ph+i)-... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/HYBRID_PARALLEL/mclib.c | #pragma omp parallel for num_threads(nt) | 100 | rng = (gsl_rng **) malloc((num_thread ) * sizeof(gsl_rng *));
rng[0]=rand;
//<LOOP-START>for(i=1;i<num_thread;i++)
{
rng[i] = gsl_rng_alloc (rng_t);
gsl_rng_set(rng[i],gsl_rng_get(rand));
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(nt)<OMP-E... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/HYBRID_PARALLEL/mclib.c | #pragma omp parallel for num_threads(num_thread) firstprivate( is_in_block, ph_block_index, ph_r, ph_x, ph_y, ph_z, ph_phi, min_index, n_dens_lab_tmp,n_vx_tmp, n_vy_tmp, n_vz_tmp, n_temp_tmp, fl_v_x, fl_v_y, fl_v_z, fl_v_norm, ph_v_norm, n_cosangle, mfp, beta, rnd_tracker) private(i) shared(min_mfp ) | 100 | parallelize this part here
all_time_steps=malloc(num_ph*sizeof(double));
min_mfp=1e12;
<LOOP-START>for (i=0;i<num_ph; i++)
{
//printf("%d, %e,%e\n", i, ((ph+i)->r0), ((ph+i)->r1));
if (find_nearest_block_switch==0)
{
ph_block_index=(ph+i)->nearest_block_index; //if s... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/HYBRID_PARALLEL/mclib.c | #pragma omp parallel for num_threads(nt) | 100 | rng = (gsl_rng **) malloc((num_thread ) * sizeof(gsl_rng *));
rng[0]=rand;
//<LOOP-START>for(i=1;i<num_thread;i++)
{
rng[i] = gsl_rng_alloc (rng_t);
gsl_rng_set(rng[i],gsl_rng_get(rand));
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(nt)<OMP-E... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/HYBRID_PARALLEL/mclib.c | #pragma omp parallel for num_threads(num_thread) firstprivate( r, theta,dv, v, all_adjacent_block_indexes, j, left_block_index, right_block_index, top_block_index, bottom_block_index, is_in_block, ph_block_index, ph_x, ph_y, ph_z, ph_phi, min_index, n_dens_lab_tmp,n_vx_tmp, n_vy_tmp, n_vz_tmp, n_temp_tmp, fl_v_x, fl_v_... | 100 | mes the min (max) photon radius
//or just parallelize this part here
min_mfp=1e12;
<LOOP-START>for (i=0;i<num_ph; i++)
{
//printf("%d, %e,%e\n", i, ((ph+i)->r0), ((ph+i)->r1));
if (find_nearest_block_switch==0)
{
ph_block_index=(ph+i)->nearest_block_index; //if s... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/HYBRID_PARALLEL/mclib.c | #pragma omp parallel for num_threads(num_thread) firstprivate(old_position, new_position, divide_p0) | 100 | thread=omp_get_num_threads();
double old_position=0, new_position=0, divide_p0=0;
<LOOP-START>for (i=0;i<num_ph;i++)
{
old_position= pow( pow(ph->r0,2)+pow(ph->r1,2)+pow(ph->r2,2), 0.5 );
divide_p0=1.0/((ph+i)->p0);
((ph+i)->r0)+=((ph+... |
lazzati-astro/MCRaT/OLDER_MCRaT_VERSIONS/HYBRID_PARALLEL/mclib.c | #pragma omp parallel for num_threads(num_thread) firstprivate( filename_k, file_no_thread_num, cmd,mcdata_type,num_files, increment ) private(i,j,k) | 100 | 000]="", cmd[2000]="", mcdata_type[200]="";
//printf("Merging files in %s\n", dir);
//<LOOP-START>// i < last frame because calculation before this function gives last_frame as the first frame of the next process set of frames to merge files for
for (i=start_frame;i<last_frame;i=i+increment)
{
... |
lazzati-astro/MCRaT/Src/mc_cyclosynch.c | #pragma omp parallel for num_threads(num_thread) reduction(+:block_cnt) | 100 | fprintf(fPtr, "rmin %e rmax %e, theta min/max: %e %e\n", rmin, rmax, theta_min, theta_max);
<LOOP-START>for(i=0;i<hydro_data->num_elements;i++)
{
//look at all boxes in width delta r=c/fps and within angles we are interested in NEED TO IMPLEMENT
#if DIMENSIONS == THREE
... |
lazzati-astro/MCRaT/Src/mc_cyclosynch.c | #pragma omp parallel for num_threads(num_thread) reduction(+:null_ph_count) | 100 | IER INDEXES AND HOW MANY, dont subtract this from ph_tot @ the end, WILL NEED FOR PRINT PHOTONS
<LOOP-START>for (i=0;i<*num_ph;i++)
{
if (((*ph_orig)[i].weight == 0)) //if photons are null COMPTONIZED_PHOTON photons and not absorbed UNABSORBED_CS_PHOTON photons
{
null_ph_count+=1;
... |
lazzati-astro/MCRaT/Src/mc_cyclosynch.c | #pragma omp parallel for num_threads(num_thread) firstprivate(b_field, el_dens, nu_c) reduction(+:abs_ph_count) | 100 | h=0;//set thsi equal to 0, to recount in this function and get prepared for the next frame
<LOOP-START>for (i=0;i<*num_ph;i++)
{
if (((*ph_orig)[i].weight != 0) && ((*ph_orig)[i].nearest_block_index != -1))
{
// if the photon isnt a null photon already, see if it should be absor... |
lazzati-astro/MCRaT/Src/mcrat_io.c | #pragma omp parallel for num_threads(num_thread) reduction(+:weight_net_num_ph) | 100 | BOVE
count=0;//used to keep track of weight values since it may not be the same as num_ph
//<LOOP-START>for (i=0;i<num_ph;i++)
{
if ((ph+i)->weight != 0)
{
p0[count]= ((ph+i)->p0);
p1[count]= ((ph+i)->p1);
p2[count]= ((ph+i)->p2);
p3[count]= ((... |
lazzati-astro/MCRaT/Src/mcrat_io.c | #pragma omp parallel for num_threads(num_thread) firstprivate( filename_k, file_no_thread_num, cmd,mcdata_type,num_files, increment ) private(i,j,k) | 100 | dset_weight, dset_weight_frame, dset_ph_type;
//printf("Merging files in %s\n", dir);
//<LOOP-START>// i < last frame because calculation before this function gives last_frame as the first frame of the next process set of frames to merge files for
#if COMV_SWITCH == ON && STOKES_SWITCH == ON
{
... |
lazzati-astro/MCRaT/Src/mclib.c | #pragma omp parallel for num_threads(nt) | 100 | xs0;
rng = (gsl_rng **) malloc((num_thread ) * sizeof(gsl_rng *));
rng[0]=rand;
//<LOOP-START>for(i=1;i<num_thread;i++)
{
rng[i] = gsl_rng_alloc (rng_t);
gsl_rng_set(rng[i],gsl_rng_get(rand));
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(nt)<OMP-END> |
lazzati-astro/MCRaT/Src/mclib.c | #pragma omp parallel for num_threads(num_thread) firstprivate( is_in_block, ph_block_index, ph_x, ph_y, ph_z, ph_phi, ph_r, min_index, n_dens_lab_tmp,n_vx_tmp, n_vy_tmp, n_vz_tmp, n_temp_tmp, fl_v_x, fl_v_y, fl_v_z, fl_v_norm, ph_v_norm, n_cosangle, mfp, beta, rnd_tracker, ph_p_comv, el_p, ph_p, fluid_beta) private(i) ... | 100 | mes the min (max) photon radius
//or just parallelize this part here
min_mfp=1e12;
<LOOP-START>for (i=0;i<num_ph; i++)
{
//fprintf(fPtr, "%d, %d,%e\n", i, ((ph+i)->nearest_block_index), ((ph+i)->weight));
//fflush(fPtr);
if (find_nearest_block_switch==0)
{
... |
lazzati-astro/MCRaT/Src/mclib.c | #pragma omp parallel for num_threads(nt) | 100 | rng = (gsl_rng **) malloc((num_thread ) * sizeof(gsl_rng *));
rng[0]=rand;
//<LOOP-START>for(i=1;i<num_thread;i++)
{
rng[i] = gsl_rng_alloc (rng_t);
gsl_rng_set(rng[i],gsl_rng_get(rand));
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(nt)<OMP-E... |
lazzati-astro/MCRaT/Src/mclib.c | #pragma omp parallel for num_threads(num_thread) firstprivate( r, theta,dv, v, all_adjacent_block_indexes, j, left_block_index, right_block_index, top_block_index, bottom_block_index, is_in_block, ph_block_index, ph_x, ph_y, ph_z, ph_phi, min_index, n_dens_lab_tmp,n_vx_tmp, n_vy_tmp, n_vz_tmp, n_temp_tmp, fl_v_x, fl_v_... | 100 | mes the min (max) photon radius
//or just parallelize this part here
min_mfp=1e12;
<LOOP-START>for (i=0;i<num_ph; i++)
{
//printf("%d, %e,%e\n", i, ((ph+i)->r0), ((ph+i)->r1));
if (find_nearest_block_switch==0)
{
ph_block_index=(ph+i)->nearest_block_index; //if s... |
lazzati-astro/MCRaT/Src/mclib.c | #pragma omp parallel for num_threads(num_thread) firstprivate(old_position, new_position, divide_p0) | 100 | get_num_threads();
#endif
double old_position=0, new_position=0, divide_p0=0;
<LOOP-START>for (i=0;i<num_ph;i++)
{
if (((ph+i)->type != CS_POOL_PHOTON) && ((ph+i)->weight != 0))
{
old_position= sqrt(((ph+i)->r0)*((ph+i)->r0)+((ph+i)->r1)*((ph+i)->r1)+((ph+i)->r2)*((... |
lazzati-astro/MCRaT/Src/mclib.c | #pragma omp parallel for reduction(+:e_sum) reduction(+:w_sum) | 100 | _OPENMP)
int num_thread=omp_get_num_threads();
#endif
double e_sum=0, w_sum=0;
<LOOP-START>for (i=0;i<num_ph;i++)
{
#if CYCLOSYNCHROTRON_SWITCH == ON
if (((ph+i)->weight != 0)) //dont want account for null or absorbed UNABSORBED_CS_PHOTON photons
{
e... |
lazzati-astro/MCRaT/Src/mclib.c | #pragma omp parallel for num_threads(num_thread) reduction(min:temp_min) reduction(max:temp_max) reduction(+:sum) reduction(+:avg_r_sum) reduction(+:count) | 100 | um_synch=0, avg_r_sum_comp=0, avg_r_sum_inject=0;
//printf("Num threads: %d", num_thread);
<LOOP-START>for (i=0;i<ph_num;i++)
{
#if CYCLOSYNCHROTRON_SWITCH == ON
if (((ph+i)->weight != 0)) //dont want account for null or absorbed UNABSORBED_CS_PHOTON photons
{
s... |
lazzati-astro/MCRaT/Src/mclib.c | #pragma omp parallel for num_threads(num_thread) firstprivate(ph_r, ph_theta) reduction(min:temp_r_min) reduction(max:temp_r_max) reduction(min:temp_theta_min) reduction(max:temp_theta_max) | 100 | d(_OPENMP)
int num_thread=omp_get_num_threads();
#endif
double ph_r=0, ph_theta=0;
<LOOP-START>for (i=0;i<ph_num;i++)
{
if ((ph+i)->weight != 0)
{
ph_r=sqrt(((ph+i)->r0)*((ph+i)->r0) + ((ph+i)->r1)*((ph+i)->r1) + ((ph+i)->r2)*((ph+i)->r2));
ph_theta=acos(((ph... |
LLNL/dataracebench/micro-benchmarks-fortran/utilities/fpolybench.c | #pragma omp parallel for | 100 | double* flush = (double*) calloc (cs, sizeof(double));
int i;
double tmp = 0.0;
#ifdef _OPENMP
<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/dataracebench/micro-benchmarks/DRB043-adi-parallel-no.c | #pragma omp parallel for private(c2) | 100 | 0],double B[500 + 0][500 + 0])
{
//int i;
//int j;
{
int c1;
int c2;
if (n >= 1) {
<LOOP-START>for (c1 = 0; c1 <= n + -1; c1++) {
for (c2 = 0; c2 <= n + -1; c2++) {
X[c1][c2] = (((double )c1) * (c2 + 1) + 1) / n;
A[c1][c2] = (((double )c1) * (c2 + 2) + 2) / n;
B[c1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.