cpp stringlengths 74 8.89k | fortran stringlengths 112 13.8k |
|---|---|
#include <omp.h>\n#include <stdio.h>\n\nint main()\n{\n int numThreads=0 ; \n#pragma omp parallel\n {\n if ( omp_get_thread_num()==0 ) {\n numThreads = omp_get_num_threads();\n }\n }\n printf ("numThreads=%d\n", numThreads);\n return 0;\n}\n | program DRB051_getthreadnum_orig_no\n use omp_lib\n implicit none\n\n integer :: numThreads\n\n !$omp parallel\n if (omp_get_thread_num() == 0) then\n numThreads = omp_get_num_threads()\n end if\n !$omp end parallel\n\n print 100, numThreads\n 100 format ('numThreads =',i3)\nend progra... |
#include <stdio.h>\n#include <assert.h>\n\nint sum0=0, sum1=0;\n#pragma omp threadprivate(sum0)\n\nvoid foo (int i)\n{\n sum0=sum0+i;\n}\n\nint main()\n{\n int len=1000;\n int i, sum=0;\n#pragma omp parallel copyin(sum0)\n {\n#pragma omp for\n for (i=0;i<len;i++)\n {\n foo (i);\n } \n#pragma omp cr... | program DRB085_threadprivate_orig_no\n use omp_lib\n use DRB085\n implicit none\n\n integer :: len\n integer (kind=8) :: i, sum\n len = 1000\n sum = 0\n\n !$omp parallel copyin(sum0)\n !$omp do\n do i = 1, len\n call foo(i)\n end do\n !$omp end do\n ... |
#include <assert.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#define N 180\nint indexSet[N] = {\n521, 523, 525, 533, 529, 531, // 521+12=533\n547, 549, 551, 553, 555, 557,\n573, 575, 577, 579, 581, 583,\n599, 601, 603, 605, 607, 609,\n625, 627, 629, 631, 633, 635,\n\n651, 653, 655, 657, 659, 661,\n859, 861, 863, 865... | program DRB007_indirectaccess3_orig_yes\n use omp_lib\n use DRB007\n implicit none\n\n integer :: i, idx1, idx2\n integer, parameter :: dp = kind(1.0d0)\n real(dp), dimension(:), pointer :: xa1=>NULL(), xa2=>NULL()\n real(dp), dimension(2025), target :: base\n\n allocate (xa1(2025))\n allocat... |
#include <stdio.h>\n#define N 100\n#define M 100 \n#define K 100\ndouble a[N][M],b[M][K],c[N][K];\n \nint mmm() \n{ \n int i,j,k;\n#pragma omp parallel for private(j,k)\n for (i = 0; i < N; i++) \n for (k = 0; k < K; k++) \n for (j = 0; j < M; j++)\n c[i][j]= c[i][j]+a[i][k]*b[k]... | program DRB060_matrixmultiply_orig_no\n use omp_lib\n implicit none\n\n integer :: N,M,K, len, i, j, l\n real, dimension(:,:), allocatable :: a, b, c\n\n len = 100\n N=len\n M=len\n K=len\n\n allocate (a(N,M))\n allocate (b(M,K))\n allocate (c(K,N))\n\n !$omp parallel do private(j, l... |
#include <stdio.h> \nint main()\n{\n int i=0;\n#pragma omp parallel sections\n {\n#pragma omp section\n i = 1; \n#pragma omp section\n i = 2; \n }\n printf("i=%d\n",i);\n return 0;\n} \n | program DRB023_sections1_orig_yes\n use omp_lib\n implicit none\n\n integer :: i\n i = 0\n\n !$omp parallel sections\n !$omp section\n i=1\n !$omp section\n i=2\n !$omp end parallel sections\n\n print 100, i\n 100 format ("i=",i3)\n\nend program |
#include <stdio.h>\n \nfloat x=0.0;\nint y=0;\n#pragma omp threadprivate(x,y)\n\nint main (int argc, char * argv[])\n{\n#pragma omp parallel\n {\n#pragma omp single copyprivate(x,y)\n {\n x=1.0;\n y=1;\n }\n }\n printf ("x=%f y=%d\n", x, y);\n return 0;\n}\n | program DRB102_copyprivate_orig_no\n use omp_lib\n use DRB102\n implicit none\n\n !$omp parallel\n !$omp single\n x=1.0\n y=1\n !$omp end single copyprivate(x,y)\n !$omp end parallel\n\n print 100, x, y\n 100 format ('x =',F3.1,2x,'y =',i3)\n\nend program |
#include <stdio.h>\n#include <omp.h>\n#include <stdlib.h>\n#define N 100\n\nint main(){\n\n int var[N];\n\n for(int i=0; i<N; i++){\n var[i]=0;\n }\n\n #pragma omp target map(tofrom:var[0:N]) device(0)\n #pragma omp parallel for ordered\n for (int i=1; i<N; i++){\n #pragma omp ordered\n {\n ... | program DRB155_missingordered_orig_gpu_no\n use omp_lib\n implicit none\n\n integer :: var(100)\n integer :: i\n\n do i = 1, 100\n var(i) = 1\n end do\n\n !$omp target map(tofrom:var) device(0)\n !$omp parallel do ordered\n do i = 2, 100\n !$omp ordered\n var(i) = var(i-1... |
#include <stdio.h>\n/*\n * loop missing the linear clause\n * Data race pairs (race on j allows wrong indexing of c): \n j@70:7:R vs. j@71:5:W\n j@71:5:W vs. j@71:5:W \n c[j]@70:5:W vs. c[j]@70:5:W\n*/\nint main()\n{\n int len=100;\n double a[len], b[len], c[len];\n int i,j=0;\n\n for (i=0;i<len;i++)... | program DRB111_linearmissing_orig_yes\n use omp_lib\n implicit none\n\n integer len, i, j\n integer, parameter :: dp = kind(1.0d0)\n real(dp), dimension(:), allocatable :: a,b,c\n\n len = 100\n i = 0\n j = 0\n\n allocate (a(len))\n allocate (b(len))\n allocate (c(len))\n\n do i = 1, ... |
#include <stdio.h>\n#define N 100\n\ndouble a[N][N],v[N],v_out[N];\nint mv()\n{ \n int i,j;\n#pragma omp parallel for private (i,j)\n for (i = 0; i < N; i++)\n { \n float sum = 0.0;\n for (j = 0; j < N; j++)\n { \n sum += a[i][j]*v[j];\n } \n v_out[i] = sum;\n } \n re... | program DRB061_matrixvector1_orig_no\n use omp_lib\n implicit none\n call foo\ncontains\n subroutine foo()\n integer :: i, j, N\n real :: sum\n real, dimension(:,:), allocatable :: a\n real, dimension(:), allocatable :: v, v_out\n\n N = 100\n allocate (a(N,N))\n ... |
#include <stdio.h>\n#include <omp.h>\n#define N 100\n\nint main(){\n int var = 0;\n\n #pragma omp target map(tofrom:var) device(0)\n #pragma omp teams num_teams(1)\n #pragma omp distribute parallel for\n for (int i=0; i<N; i++){\n var++;\n }\n\n printf("%d\n ",var);\n return 0;\n}\n | program DRB153_missinglock2_orig_gpu_yes\n use omp_lib\n implicit none\n\n integer :: var, i\n var = 0\n\n !$omp target map(tofrom:var) device(0)\n !$omp teams num_teams(1)\n !$omp distribute parallel do\n do i = 1, 100\n var = var + 1\n end do\n !$omp end distri... |
#include <stdlib.h>\n#include <stdio.h>\nint main(int argc, char* argv[])\n{\n int i;\n\n int a[2000];\n\n for (i=0; i<2000; i++)\n a[i]=i; \n\n#pragma omp parallel for\n for (i=0;i<1000;i++)\n a[2*i+1]=a[i]+1;\n\n printf("a[1001]=%d\n", a[1001]); \n return 0;\n}\n\n | program DRB033_truedeplinear_orig_yes\n use omp_lib\n implicit none\n\n integer :: i, len\n integer, dimension(:), allocatable :: a\n\n len = 2000\n allocate (a(len))\n\n do i = 1, len\n a(i) = i\n end do\n\n !$omp parallel do\n do i = 1, 1000\n a(2*i) = a(i) + 1\n end do\... |
#include <stdio.h>\n#define N 20\n#define C 8\n\nint main(){\n int var[C];\n\n for(int i=0; i<C; i++){\n var[i] = 0;\n }\n\n #pragma omp target map(tofrom:var) device(0)\n #pragma omp teams num_teams(1) thread_limit(1048) \n #pragma omp distribute parallel for reduction(+:var)\n for (int i=0; i<N; i++){\n ... | program DRB162_nolocksimd_orig_gpu_no\n use omp_lib\n implicit none\n\n integer :: var(8)\n integer :: i,j\n\n do i = 1, 8\n var(i) = 0\n end do\n\n !$omp target map(tofrom:var) device(0)\n !$omp teams num_teams(1) thread_limit(1048)\n !$omp distribute parallel do reduction(+:var)\n ... |
#include <omp.h>\n#include <stdio.h>\n\nint main()\n{\n int k;\n\n#pragma omp parallel\n {\n#pragma omp master\n {\n k = omp_get_num_threads();\n printf ("Number of Threads requested = %i\n",k);\n }\n }\n return 0;\n}\n | program DRB103_master_orig_no\n use omp_lib\n implicit none\n\n integer k\n\n !$omp parallel\n !$omp master\n k = omp_get_num_threads()\n print 100, k\n 100 format ('Number of threads requested =',3i8)\n !$omp end master\n !$omp end parallel\n\nend program |
#include <stdio.h>\n#include <omp.h>\n\nvoid foo(){\n int x = 0, y = 2;\n\n #pragma omp task depend(inout: x) shared(x)\n x++; // 1st child task\n\n #pragma omp task depend(in: x) depend(inout: y) shared(x, y)\n y = y-x; ... | program DRB167_taskdep5_orig_no_omp50\n use omp_lib\n implicit none\n\n !$omp parallel\n !$omp single\n call foo()\n !$omp end single\n !$omp end parallel\ncontains\n subroutine foo()\n implicit none\n integer :: x, y\n x = 0\n y = 2\n\n !$omp task depend(inout... |
#include<stdio.h>\n#include<stdlib.h>\n\nint* counter; \n//#pragma omp threadprivate(counter)\n\nint main()\n{ \n counter = (int*) malloc(sizeof(int));\n if (counter== NULL)\n {\n fprintf(stderr, "malloc() fails\n");\n exit(1);\n }\n *counter = 0; \n #pragma omp parallel \n {\n (*counter)++; \n }\n pri... | program DRB088_dynamic_storage_orig_yes\n use omp_lib\n implicit none\n integer, pointer :: counter\n\n allocate(counter)\n\n counter = 0\n\n !$omp parallel\n counter = counter+1\n !$omp end parallel\n\n print*,counter\n\n deallocate(counter)\n\nend program |
#include <stdio.h>\n#define min(x, y) (((x) < (y)) ? (x) : (y))\n\n/*\nuse of omp target + teams + distribute + parallel for\n*/\nint main(int argc, char* argv[])\n{\n int i, i2;\n int len = 2560;\n double sum =0.0, sum2=0.0;\n double a[len], b[len];\n /*Initialize with some values*/\n for (i=0; i<len; i++)\n {\... | program DRB097_target_teams_distribute_orig_no\n use omp_lib\n use ISO_C_Binding\n implicit none\n integer, parameter :: dp = kind(1.0d0)\n integer, parameter :: double_kind = c_double\n integer (kind=8) :: i, i2, len, l_limit, tmp\n real(dp) :: sum, sum2\n real(dp), dimension(:), allocatable ::... |
#include<stdio.h>\n#include<assert.h>\n/* argument pass-by-value */\nvoid f1(int q)\n{\n q += 1;\n}\n\nint main()\n{\n int i=0;\n #pragma omp parallel \n {\n f1(i);\n }\n assert (i==0);\n printf ("i=%d\n",i);\n return 0;\n}\n\n | program DRB080_func_arg_orig_yes\n use omp_lib\n use global\n implicit none\n\n integer :: i\n i = 0\n\n !$omp parallel\n call f1(i)\n !$omp end parallel\n\n if (i /= 0) then\n print 100, i\n 100 format ('i =',i3)\n end if\nend program |
#include <assert.h> \nint main()\n{\n int i=0;\n#pragma omp parallel\n#pragma omp single\n {\n#pragma omp task depend (out:i)\n i = 1; \n#pragma omp task depend (in:i)\n i = 2; \n }\n\n assert (i==2);\n return 0;\n} \n | program DRB072_taskdep1_orig_no\n use omp_lib\n implicit none\n\n integer :: i\n i = 0\n\n !$omp parallel\n !$omp single\n !$omp task depend (out:i)\n i = 1\n !$omp end task\n !$omp task depend (in:i)\n i = 2\n !$omp end task\n ... |
#include <stdio.h>\n#if (_OPENMP<201511)\n#error "An OpenMP 4.5 compiler is needed to compile this test."\n#endif\n#include <stdio.h>\nint a[100][100];\nint main()\n{\n int i, j;\n#pragma omp parallel for ordered(2)\n for (i = 0; i < 100; i++)\n for (j = 0; j < 100; j++)\n {\n a[i][j] = a[i][j] + 1;\n#prag... | program DRB094_doall2_ordered_orig_no\n use omp_lib\n use DRB094\n implicit none\n\n integer :: len, i, j\n len = 100\n\n allocate (a(len,len))\n\n !$omp parallel do ordered(2)\n do i = 1, len\n do j = 1, len\n a(i,j) = a(i,j)+1\n !$omp ordered depend(sink:i-1,j) dep... |
#include <stdlib.h> \n#include <stdio.h>\nint main(int argc, char* argv[]) \n{\n int i;\n int len=100;\n\n int numNodes=len, numNodes2=0; \n int x[100]; \n\n // initialize x[]\n for (i=0; i< len; i++)\n {\n if (i%2==0)\n x[i]=5;\n else\n x[i]= -5;\n }\n\n#pragma omp parallel for\n for (i=numN... | program DRB011_minusminus_orig_yes\n use omp_lib\n implicit none\n\n integer :: i, len, numNodes, numNodes2\n integer :: x(100)\n len = 100\n numNodes=len\n numNodes2=0\n\n do i = 1, len\n if (MOD(i,2) == 0) then\n x(i) = 5\n else\n x(i) = -5\n end if\n... |
#include <stdlib.h>\nint main (int argc, char* argv[])\n{\n int len=1000;\n int i; \n\n if (argc>1)\n len = atoi(argv[1]);\n int a[len];\n a[0] = 2;\n\n#pragma omp parallel for\n for (i=0;i<len;i++)\n a[i]=a[i]+a[0];\n\n return 0;\n}\n | program DRB040_truedepsingleelement_var_yes\n use omp_lib\n implicit none\n\n integer :: len, i, argCount, allocStatus, rdErr, ix\n character(len=80), dimension(:), allocatable :: args\n integer, dimension(:), allocatable :: a\n\n len = 1000\n\n argCount = command_argument_count()\n if (argCount... |
#include <stdio.h>\nvoid foo(int * a, int n, int g)\n{\n int i;\n#pragma omp parallel for firstprivate (g)\n for (i=0;i<n;i++)\n {\n a[i] = a[i]+g;\n }\n}\n\nint a[100];\nint main()\n{\n foo(a, 100, 7);\n return 0;\n} \n | program DRB048_firstprivate_orig_no\n use omp_lib\n use DRB048\n implicit none\n\n allocate (a(100))\n call foo(a, 100, 7)\n print*,a(50)\nend program |
#include <stdio.h>\n#include <omp.h>\n#define N 100\n#define C 64\n\nint main(){\n\n int var[C];\n\n for(int i=0; i<C; i++){\n var[i]=0;\n }\n\n #pragma omp target map(tofrom:var[0:C]) device(0)\n #pragma omp teams distribute parallel for\n for (int i=0; i<N; i++){\n #pragma omp simd\n for(int i=0; i<C; ... | program DRB163_simdmissinglock1_orig_gpu_no\n use omp_lib\n use DRB163\n implicit none\n\n do i = 1, 16\n var(i) = 0\n end do\n\n !$omp target map(tofrom:var) device(0)\n !$omp teams distribute parallel do\n do i = 1, 20\n !$omp simd\n do j = 1, 16\n var(j) = var(... |
#include <stdlib.h>\n#include <stdio.h>\ndouble b[1000][1000];\n\nint main(int argc, char* argv[]) \n{\n int i,j;\n int n=1000, m=1000;\n for (i=0;i<n;i++)\n#pragma omp parallel for\n for (j=1;j<m;j++)\n b[i][j]=b[i][j-1];\n\n printf("b[500][500]=%f\n", b[500][500]);\n return 0;\n}\n\n | program DRB037_truedepseconddimension_orig_yes\n use omp_lib\n implicit none\n\n integer i, j, n, m, len\n real, dimension(:,:), allocatable :: b\n\n len = 1000\n n = len\n m = len\n\n allocate (b(len,len))\n\n do i = 1, n\n !$omp parallel do\n do j = 2, m\n b(i,j) = ... |
#include <stdio.h>\nvoid foo()\n{\n int q=0; \n q += 1;\n}\n\nint main()\n{ \n #pragma omp parallel \n {\n foo();\n }\n return 0; \n}\n\n | program DRB083_declared_in_func_orig_no\n use omp_lib\n use DRB083\n implicit none\n\n !$omp parallel\n call foo()\n !$omp end parallel\nend program |
#include <stdio.h>\nint main()\n{\n int i,j;\n int n=100, m=100;\n double b[n][m];\n\n for(i=0;i<n; i++) \n for(j=0;j<n; j++) \n b[i][j]=(double)(i*j);\n\n for (i=1;i<n;i++)\n#pragma omp parallel for\n for (j=1;j<m;j++)\n b[i][j]=b[i-1][j-1];\n return 0;\n}\n | program DRB054_inneronly2_orig_no\n use omp_lib\n implicit none\n\n integer i,j,n,m\n real, dimension(:,:), allocatable :: b\n\n n = 100\n m = 100\n\n allocate (b(n,m))\n\n do i = 1, n\n do j = 1, m\n b(i,j) = i*j\n end do\n end do\n\n do i = 2, n\n !$omp pa... |
#include <stdlib.h>\nvoid setup(int N)\n{\n double * m_pdv_sum = (double* ) malloc (sizeof (double) * N );\n double * m_nvol = (double* ) malloc (sizeof (double) * N );\n\n#pragma omp parallel for schedule(static)\n for (int i=0; i < N; ++i ) \n { \n m_pdv_sum[ i ] = 0.0;\n m_nvol[ i ] = i*2.5;\n }\n\n fr... | program DRB066_pointernoaliasing_orig_no\n use omp_lib\n use DRB066\n implicit none\n\n integer :: N\n N = 1000\n\n call setup(N)\n\nend program |
#include <stdio.h>\nint main(int argc, char* argv[])\n{ \n int i;\n int len = 1000;\n\n int a[1000];\n\n for (i=0; i<len; i++)\n a[i]= i; \n\n#pragma omp parallel for\n for (i=0;i< len -1 ;i++)\n a[i]=a[i+1]+1;\n\n printf ("a[500]=%d\n", a[500] );\n return 0;\n} \n | program DRB001_antidep1_orig_yes\nuse omp_lib\n implicit none\n integer :: i, len\n integer :: a(1000)\n\n len = 1000\n\n do i = 1, len\n a(i) = i\n end do\n\n !$omp parallel do\n do i = 1, len-1\n a(i) = a(i+1) + 1\n end do\n !$omp end parallel do\n\n print 100, a(500)\n ... |
#include <stdio.h>\n#include <math.h>\n\n#define MSIZE 200\nint n=MSIZE, m=MSIZE;\ndouble alpha = 0.0543;\ndouble u[MSIZE][MSIZE], f[MSIZE][MSIZE], uold[MSIZE][MSIZE];\ndouble dx, dy;\n\nvoid\ninitialize ()\n{\n int i, j, xx, yy;\n\n dx = 2.0 / (n - 1);\n dy = 2.0 / (m - 1);\n\n /* Initialize initial condition and ... | module DRB057\nuse omp_lib\nimplicit none\n\ninteger :: MSIZE\ninteger :: n,m,mits\ninteger, parameter :: dp = kind(1.0d0)\nreal(dp), dimension(:,:), pointer :: u,f,uold\nreal(dp) :: dx,dy,tol,relax,alpha\n\ncontains\nsubroutine initialize()\ninteger :: i,j,xx,yy\n\nMSIZE = 200\nmits = 1000\nrelax = 1.0\nalpha = 0.0543... |
#include <stdio.h>\n#include <assert.h>\n#include <unistd.h>\n\nint main()\n{\n int result = 0;\n#pragma omp parallel\n {\n#pragma omp single\n {\n#pragma omp taskgroup\n {\n#pragma omp task\n {\n sleep(3);\n result = 1; \n }\n }\n#pragma omp task\n {\n result ... | program DRB107_taskgroup_orig_no\n use omp_lib\n implicit none\n\n integer result\n result = 0\n\n !$omp parallel\n !$omp single\n !$omp taskgroup\n !$omp task\n call sleep(3)\n result = 1\n !$omp end task\n !$omp end taskgroup\n !$omp t... |
#include <omp.h>\n#include <stdio.h>\n\nint main(){\n int section_count = 0;\n omp_set_dynamic(0);\n \n omp_set_num_threads(1);\n\n #pragma omp parallel\n #pragma omp sections firstprivate( section_count )\n {\n #pragma omp section\n {\n section_count++;\n printf("%d\n",section_count);\n }\n ... | program DRB126_firstprivatesections_orig_no\n use omp_lib\n implicit none\n\n integer :: section_count\n\n section_count = 0\n\n call omp_set_dynamic(.FALSE.)\n call omp_set_num_threads(1)\n\n !$omp parallel\n !$omp sections firstprivate( section_count )\n !$omp section\n section_c... |
#include<stdio.h>\n#include<stdlib.h>\n\nint* counter; \n\nvoid foo()\n{\n (*counter)++; \n}\n\nint main()\n{ \n counter = (int*) malloc(sizeof(int));\n if (counter== NULL)\n {\n fprintf(stderr, "malloc() fails\n");\n exit(1);\n }\n *counter = 0; \n #pragma omp parallel \n {\n foo();\n }\n printf("%... | program DRB088_dynamic_storage_orig_yes\n use omp_lib\n use DRB088\n implicit none\n\n allocate(counter)\n\n counter = 0\n\n !$omp parallel\n call foo()\n !$omp end parallel\n\n print*,counter\n\n deallocate(counter)\n\nend program |
#include <omp.h>\n#include <stdio.h>\n\n\nint main(){\n int x = 2;\n\n #pragma omp task mergeable\n {\n x++;\n }\n #pragma omp taskwait\n\n printf("%d\n",x);\n return 0;\n}\n | program DRB129_mergeable_taskwait_orig_yes\n use omp_lib\n implicit none\n\n integer :: x\n x = 2\n\n !$omp task mergeable\n x = x+1\n !$omp end task\n\n print 100, x\n 100 format ('x =',3i8)\nend program |
#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n\n int a[4];\n int psum[2];\n int sum;\n\n #pragma omp parallel num_threads(2)\n {\n #pragma omp for schedule(dynamic, 1)\n for (int i=0; i < 4; ++i){\n a[i] = i;\n int s;\n s = (- 3 - 3) / - 3;\n }\n\n #pragma omp single\n {\n ... | program DRB117_taskwait_waitonlychild_orig_yes\n use omp_lib\n implicit none\n\n integer, dimension(:), allocatable :: a, psum\n integer :: sum, i\n\n allocate(a(4))\n allocate(psum(4))\n\n !$omp parallel num_threads(2)\n !$omp do schedule(dynamic, 1)\n do i = 1, 4\n a(i) =... |
#include<stdio.h>\n\nint main(int argc, char* argv[])\n{\n int i;\n int len=100;\n int a[len], b[len];\n\n for (i=0;i<len;i++)\n { a[i]=i; b[i]=i;} \n/* static storage for a local variable */\n#pragma omp parallel \n {\n static int tmp;\n#pragma omp for\n for (i=0;i<len;i++)\n {\n tmp = a[i]+i;\n ... | program DRB090_static_local_orig_yes\n use omp_lib\n implicit none\n\n integer :: i, len\n integer, dimension(:), allocatable :: a, b\n integer, save :: tmp\n integer :: tmp2\n\n len = 100\n allocate (a(len))\n allocate (b(len))\n\n do i = 1, len\n a(i) = i\n b(i) = i\n en... |
#include <stdio.h>\n\nint main()\n{\n int count=0;\n\n#pragma omp parallel shared(count) \n {\n#pragma omp single\n count += 1;\n }\n\n printf ("count= %d\n", count);\n return 0;\n}\n | program DRB077_single_orig_no\n use omp_lib\n implicit none\n\n integer :: count\n count = 0\n\n !$omp parallel shared(count)\n !$omp single\n count = count + 1\n !$omp end single\n !$omp end parallel\n\n print 100, count\n 100 format ('count =',i3)\nend program |
#include <omp.h>\n#include <stdio.h>\n#include <stdlib.h>\n\ntypedef struct {\n int a, b;\n omp_nest_lock_t lck;\n} pair;\n\nvoid incr_a(pair *p){\n p->a += 1;\n}\n\nvoid incr_b(pair *p){\n p->b += 1;\n}\n\n\nint main(int argc, char* argv[])\n{\n pair p[1];\n p->a = 0;\n p->b = 0;\n omp_init_nest_lock(&p->lck);... | program DRB118_nestlock_orig_no\n use omp_lib\n use DRB118\n implicit none\n\n integer :: a, b\n\n type(pair) :: p\n p%a = 0\n p%b = 0\n call omp_init_nest_lock(p%lck);\n\n !$omp parallel sections\n !$omp section\n call omp_set_nest_lock(p%lck)\n call incr_b(p, a)\n ca... |
#include <omp.h>\n#include <stdio.h>\n\nint main(int argc, char* argv[])\n{\n int var = 0, i, res;\n int sum1 = 0;\n int sum2 = 0;\n\n res = omp_get_max_threads();\n\n #pragma omp parallel reduction(+: var)\n {\n #pragma omp for schedule(static) reduction(+: sum1)\n for (i=0; i<5; i++)\n sum1+=i;\n #p... | program DRB121_reduction_orig_no\n use omp_lib\n implicit none\n\n integer :: var, i, sum1, sum2\n\n var = 0\n sum1 = 0\n sum2 = 0\n\n !$omp parallel reduction(+: var)\n !$omp do schedule(static) reduction(+: sum1)\n do i = 1, 5\n sum1 = sum1+i\n end do\n !$om... |
#include <stdio.h>\n/*\nuse of omp target + map + array sections derived from pointers\n*/\nvoid foo (double* a, double* b, int N)\n{\n int i; \n#pragma omp target map(to:a[0:N]) map(from:b[0:N])\n#pragma omp parallel for\n for (i=0;i< N ;i++)\n b[i]=a[i]*(double)i;\n}\n\nint main(int argc, char* argv[])\n{\n int... | program DRB099_targetparallelfor2_orig_no\n use omp_lib\n use DRB099\n implicit none\n\n integer :: i, len\n integer, parameter :: dp = kind(1.0d0)\n real(dp), dimension(:), allocatable :: a,b\n real :: x\n\n len = 1000\n\n allocate(a(len))\n allocate(b(len))\n\n do i = 1, len\n a(... |
#include <omp.h>\n#include <stdio.h>\n#include <stdlib.h>\n\ntypedef struct {\n int a, b;\n omp_nest_lock_t lck;\n} pair;\n\nvoid incr_a(pair *p){\n p->a += 1;\n}\nvoid incr_b(pair *p){\n omp_set_nest_lock(&p->lck);\n p->b += 1;\n omp_unset_nest_lock(&p->lck);\n}\n\n\nint main(int argc, char* argv[])\n{\n pair... | program DRB118_nestlock_orig_no\n use omp_lib\n use DRB118\n implicit none\n\n integer :: a, b\n\n type(pair) :: p\n p%a = 0\n p%b = 0\n call omp_init_nest_lock(p%lck);\n\n !$omp parallel sections\n !$omp section\n call omp_set_nest_lock(p%lck)\n call incr_b(p, a)\n ca... |
#include <stdlib.h>\nint main(int argc, char* argv[])\n{\n int i;\n int len=2000;\n\n if (argc>1)\n len = atoi(argv[1]);\n int a[len];\n\n for (i=0; i<len; i++)\n a[i]=i; \n\n#pragma omp parallel for\n for (i=0;i<len/2;i++)\n a[2*i+1]=a[i]+1;\n\n return 0;\n}\n\n | program DRB034_truedeplinear_var_yes\n use omp_lib\n implicit none\n\n integer :: i, len, uLen, argCount, allocStatus, rdErr, ix\n character(len=80), dimension(:), allocatable :: args\n integer, dimension(:), allocatable :: a\n\n len = 2000\n\n argCount = command_argument_count()\n if (argCount ... |
#include <stdio.h>\n#include <assert.h>\n\nint sum0=0, sum1=0;\n#pragma omp threadprivate(sum0)\n\nint main()\n{\n int len=1000;\n int i, sum=0;\n#pragma omp parallel copyin(sum0)\n {\n#pragma omp for\n for (i=0;i<len;i++)\n {\n sum0=sum0+i;\n } \n#pragma omp critical\n {\n sum= sum+sum0;\n ... | program DRB091_threadprivate2_orig_no\n use omp_lib\n use DRB091\n implicit none\n\n integer :: len, i, sum\n len = 1000\n sum = 0\n\n !$omp parallel copyin(sum0)\n !$omp do\n do i = 1, len\n sum0 = sum0+i\n end do\n !$omp end do\n !$omp critical\n ... |
#include <stdio.h>\n/* This is a program based on a test contributed by Yizi Gu@Rice Univ.\n * Classic Fibonacci calculation using task but missing taskwait. \n * Data races pairs: i@61:5:W vs. i@65:14:R\n * j@63:5:W vs. j@65:16:R\n * */\nunsigned int input = 10;\nint fib(unsigned int n)\n{\n if (n<2... | module DRB106\n implicit none\n integer (kind=4) input\n\ncontains\n recursive function fib(n) result(r)\n use omp_lib\n implicit none\n integer (kind=4) :: n, i, j, r\n\n if (n<2) then\n r = n\n else\n !$omp task shared(i)\n i = fib(n-1)\n ... |
#include <stdio.h>\n#define N 1000\ndouble a[N][N],v[N],v_out[N];\n\nvoid mv()\n{ \n int i,j;\n for (i = 0; i < N; i++)\n { \n float sum = 0.0;\n#pragma omp parallel for reduction(+:sum)\n for (j = 0; j < N; j++)\n { \n sum += a[i][j]*v[j];\n } \n v_out[i] = sum;\n } \... | program DRB062_matrixvector2_orig_no\n use omp_lib\n implicit none\n\n call foo\ncontains\n subroutine foo()\n integer :: i, j, N\n real :: sum\n real, dimension(:,:), allocatable :: a\n real, dimension(:), allocatable :: v, v_out\n\n N = 1000\n allocate (a(N,N))\n ... |
#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char* argv[])\n{\n int len=100; \n\n if (argc>1)\n len = atoi(argv[1]);\n\n int a[len];\n int i,x=10;\n\n#pragma omp parallel for \n for (i=0;i<len;i++)\n {\n a[i] = x;\n x=i;\n }\n printf("x=%d, a[0]=%d\n",x,a[0]); \n return 0;\n} \n\n | program DRB017_outputdep_var_yes\n use omp_lib\n implicit none\n\n integer len, i, x, argCount, allocStatus, rdErr, ix\n character(len=80), dimension(:), allocatable :: args\n integer, dimension (:), allocatable :: a\n\n len = 100\n x = 10\n\n argCount = command_argument_count()\n if (argCoun... |
#include <omp.h>\n#include <stdio.h>\nint main()\n{\n int numThreads=0 ; \n#pragma omp parallel\n {\n if ( omp_get_thread_num()==0 ) {\n numThreads = omp_get_num_threads();\n }\n else\n {\n printf("numThreads=%d\n", numThreads);\n }\n }\n return 0;\n}\n | program DRB075_getthreadnum_orig_yes\n use omp_lib\n implicit none\n\n integer :: numThreads\n numThreads = 0\n\n !$omp parallel\n if ( omp_get_thread_num()==0 ) then\n numThreads = omp_get_num_threads();\n else\n print*,'numThreads =',numThreads\n end if\n !$omp endparallel\nen... |
void error_norm(double rms[]){\nint i, j, k, m, d;\ndouble xi, eta, zeta, u_exact[5], add;\nfor(m=0; m<5; m++){rms[m]=0.0;}\nfor(k=0; k<=grid_points[2]-1; k++){\nzeta=(double)k*dnzm1;\nfor(j=0; j<=grid_points[1]-1; j++){\neta=(double)j*dnym1;\nfor(i=0; i<=grid_points[0]-1; i++){\nxi=(double)i*dnxm1;\nexact_solution(xi,... | subroutine error_norm(rms)\n\n\n\nuse sp_data\nimplicit none\n\ninteger i, j, k, m, d\ndouble precision xi, eta, zeta, u_exact(5), rms(5), add\n\ndo m = 1, 5\nrms(m) = 0.0d0\nenddo\n\ndo k = 0, grid_points(3)-1\ndo j = 0, grid_points(2)-1\nzeta = dble(k) * dnzm1\neta = dble(j) * dnym1\ndo i = 0, grid_points(1)-1\... |
void set_constants(){\nce[0][0]=2.0;\nce[1][0]=0.0;\nce[2][0]=0.0;\nce[3][0]=4.0;\nce[4][0]=5.0;\nce[5][0]=3.0;\nce[6][0]=0.5;\nce[7][0]=0.02;\nce[8][0]=0.01;\nce[9][0]=0.03;\nce[10][0]=0.5;\nce[11][0]=0.4;\nce[12][0]=0.3;\n\nce[0][1]=1.0;\nce[1][1]=0.0;\nce[2][1]=0.0;\nce[3][1]=0.0;\nce[4][1]=1.0;\nce[5][1]=2.0;\nce[6... | subroutine set_constants\n\n\nuse bt_data\nimplicit none\n\nce(1,1) = 2.0d0\nce(1,2) = 0.0d0\nce(1,3) = 0.0d0\nce(1,4) = 4.0d0\nce(1,5) = 5.0d0\nce(1,6) = 3.0d0\nce(1,7) = 0.5d0\nce(1,8) = 0.02d0\nce(1,9) = 0.01d0\nce(1,10) = 0.03d0\nce(1,11) = 0.5d0\nce(1,12) = 0.4d0\nce(1,13) = 0.3d0\n\nce(2,1) = 1.0d0\nce... |
void rhs_norm(double rms[]){\nint i, j, k, d, m;\ndouble add;\nfor(m=0;m<5;m++){rms[m]=0.0;}\nfor(k=1; k<=nz2; k++){\nfor(j=1; j<=ny2; j++){\nfor(i=1; i<=nx2; i++){\nfor(m=0; m<5; m++){\nadd=rhs[k][j][i][m];\nrms[m]=rms[m]+add*add;\n}\n}\n}\n}\nfor(m=0; m<5; m++){\nfor(d=0; d<3; d++){\nrms[m]=rms[m]/(double)(grid_point... | subroutine compute_rhs\n\n\nuse sp_data\nimplicit none\n\ninteger i, j, k, m\ndouble precision aux, rho_inv, uijk, up1, um1, vijk, vp1, vm1, &\n& wijk, wp1, wm1\n\n\nif (timeron) call timer_start(t_rhs)\n\ndo k = 0, grid_points(3)-1\ndo j = 0, grid_points(2)-1\ndo i = 0, grid_points(1)-1\nrho... |
void set_constants(){\nce[0][0]=2.0;\nce[1][0]=0.0;\nce[2][0]=0.0;\nce[3][0]=4.0;\nce[4][0]=5.0;\nce[5][0]=3.0;\nce[6][0]=0.5;\nce[7][0]=0.02;\nce[8][0]=0.01;\nce[9][0]=0.03;\nce[10][0]=0.5;\nce[11][0]=0.4;\nce[12][0]=0.3;\n\nce[0][1]=1.0;\nce[1][1]=0.0;\nce[2][1]=0.0;\nce[3][1]=0.0;\nce[4][1]=1.0;\nce[5][1]=2.0;\nce[6... | subroutine set_constants\n\n\nuse sp_data\nimplicit none\n\nce(1,1) = 2.0d0\nce(1,2) = 0.0d0\nce(1,3) = 0.0d0\nce(1,4) = 4.0d0\nce(1,5) = 5.0d0\nce(1,6) = 3.0d0\nce(1,7) = 0.5d0\nce(1,8) = 0.02d0\nce(1,9) = 0.01d0\nce(1,10) = 0.03d0\nce(1,11) = 0.5d0\nce(1,12) = 0.4d0\nce(1,13) = 0.3d0\n\nce(2,1) = 1.0d0\nce... |
static void makea(int n,\nint nz,\ndouble a[],\nint colidx[],\nint rowstr[],\nint firstrow,\nint lastrow,\nint firstcol,\nint lastcol,\nint arow[],\nint acol[][NONZER+1],\ndouble aelt[][NONZER+1],\nint iv[]){\nint iouter, ivelt, nzv, nn1;\nint ivc[NONZER+1];\ndouble vc[NONZER+1];\n\n\nnn1 = 1;\ndo{\nnn1 = 2 * nn1;\n}wh... | subroutine makea( n, nz, a, colidx, rowstr, &\n& firstrow, lastrow, firstcol, lastcol, &\n& arow, acol, aelt, v, iv )\n\nuse tinfo\nuse cg_data, only : nonzer, rcond, shift\n\nimplicit none\n\ninteger n\ninteger(kz) nz, rowstr(n+1)\ninteger firstrow, l... |
void initialize(){\nint i, j, k, m, ix, iy, iz;\ndouble xi, eta, zeta, Pface[2][3][5], Pxi, Peta, Pzeta, temp[5];\n\nfor(k=0; k<=grid_points[2]-1; k++){\nfor(j=0; j<=grid_points[1]-1; j++){\nfor(i=0; i<=grid_points[0]-1; i++){\nu[k][j][i][0]=1.0;\nu[k][j][i][1]=0.0;\nu[k][j][i][2]=0.0;\nu[k][j][i][3]=0.0;\nu[k][j][i][4... | subroutine initialize\n\n\n\nuse sp_data\nimplicit none\n\ninteger i, j, k, m, ix, iy, iz\ndouble precision xi, eta, zeta, Pface(5,3,2), Pxi, Peta, &\n& Pzeta, temp(5)\n\n\ndo k = 0, grid_points(3)-1\ndo j = 0, grid_points(2)-1\ndo i = 0, grid_points(1)-1\nu(1,i,j,k) = 1.0\nu(2,i,j,k) = 0.0\nu(3,i,... |
void read_input(){\n\nFILE* fp; int avoid_warning;\nif((fp=fopen("inputlu.data","r"))!=NULL){\nprintf("Reading from input file inputlu.data\n");\nwhile(fgetc(fp)!='\n');\nwhile(fgetc(fp)!='\n');\navoid_warning=fscanf(fp,"%d%d",&ipr,&inorm);\nwhile(fgetc(fp)!='\n');\nwhile(fgetc(fp)!='\n');\nwhile(fgetc(fp)!='\n');\navo... | subroutine read_input\n\n\nuse lu_data\nimplicit none\n\ninteger fstatus\n\n\n\nwrite(*, 1000)\n\nopen (unit=3,file='inputlu.data',status='old', &\n& access='sequential',form='formatted', iostat=fstatus)\nif (fstatus .eq. 0) then\n\nwrite(*, *) 'Reading from input file inputlu.data'\n\nread (3,*)\nread (3,*)\... |
void ninvr(){\nint i, j, k;\ndouble r1, r2, r3, r4, r5, t1, t2;\nint thread_id = omp_get_thread_num();\n\nif(timeron && thread_id==0){timer_start(T_NINVR);}\n#pragma omp for\nfor(k=1; k<=nz2; k++){\nfor(j=1; j<=ny2; j++){\nfor(i=1; i<=nx2; i++){\nr1=rhs[k][j][i][0];\nr2=rhs[k][j][i][1];\nr3=rhs[k][j][i][2];\nr4=rhs[k][... | subroutine ninvr\n\n\n\nuse sp_data\nimplicit none\n\ninteger i, j, k\ndouble precision r1, r2, r3, r4, r5, t1, t2\n\nif (timeron) call timer_start(t_ninvr)\ndo k = 1, nz2\ndo j = 1, ny2\ndo i = 1, nx2\n\nr1 = rhs(1,i,j,k)\nr2 = rhs(2,i,j,k)\nr3 = rhs(3,i,j,k)\nr4 = rhs(4,i,j,k)\nr5 = rhs(5,i,j,k)\n\nt1 = bt * r3\nt2... |
void l2norm(int nx0,\nint ny0,\nint nz0,\nint ist,\nint iend,\nint jst,\nint jend,\ndouble v[][ISIZ2/2*2+1][ISIZ1/2*2+1][5],\ndouble sum[]){\n\nint i, j, k, m;\ndouble sum0=0.0, sum1=0.0, sum2=0.0, sum3=0.0, sum4=0.0;\n\n#pragma omp single\nfor (m = 0; m < 5; m++) {\nsum[m] = 0.0;\n}\n\n#pragma omp for nowait\nfor(k=1;... | subroutine l2norm ( ldx, ldy, ldz, &\n& nx0, ny0, nz0, &\n& ist, iend, &\n& jst, jend, &\n& v, sum )\n\n\nimplicit none\n\ninteger ldx, ldy, ldz\ninteger nx0, ny0, nz0\ninteger ist, iend\ninteger jst, jend\ndouble precision v(5,ldx/2*2+1,l... |
void verify(int no_time_steps, char* class_npb, boolean* verified){\ndouble xcrref[5], xceref[5], xcrdif[5], xcedif[5];\ndouble epsilon, xce[5], xcr[5], dtref=0.0;\nint m;\n\nepsilon=1.0e-08;\n\nerror_norm(xce);\ncompute_rhs();\nrhs_norm(xcr);\nfor(m=0; m<5; m++){\nxcr[m]=xcr[m]/dt;\n}\n*class_npb='U';\n*verified=TRUE;... | subroutine verify(no_time_steps, class, verified)\n\n\n\nuse, intrinsic :: ieee_arithmetic, only : ieee_is_nan\n\nuse bt_data\n\nimplicit none\n\ndouble precision xcrref(5),xceref(5),xcrdif(5),xcedif(5), &\n& epsilon, xce(5), xcr(5), dtref\ninteger m, no_time_steps\ncharacter class\nlogical verified... |
void x_solve(){\nint i, j, k, i1, i2, m;\ndouble ru1, fac1, fac2;\nint thread_id = omp_get_thread_num();\n\nif(timeron && thread_id==0){timer_start(T_XSOLVE);}\n\n#pragma omp for\nfor(k=1; k<=nz2; k++){\ndouble cv[PROBLEM_SIZE], rhon[PROBLEM_SIZE];\ndouble lhs[IMAXP+1][IMAXP+1][5];\ndouble lhsp[IMAXP+1][IMAXP+1][5];\nd... | subroutine x_solve\n\n\n\nuse sp_data\nuse work_lhs\n\nimplicit none\n\ninteger i, j, k, i1, i2, m\ndouble precision ru1, fac1, fac2\n\n\n\nif (timeron) call timer_start(t_xsolve)\ndo k = 1, nz2\ndo j = 1, ny2\n\ncall lhsinit(nx2+1, lhs, lhsp, lhsm)\n\n\ndo i = 0, grid_points(1)-1\nru1 = c3c4*rho_i(i,j,k)\ncv(i) = ... |
static void evolve(void* pointer_u0,\nvoid* pointer_u1,\nvoid* pointer_twiddle,\nint d1,\nint d2,\nint d3){\ndcomplex (*u0)[NY][NX] = (dcomplex(*)[NY][NX])pointer_u0;\ndcomplex (*u1)[NY][NX] = (dcomplex(*)[NY][NX])pointer_u1;\ndouble (*twiddle)[NY][NX] = (double(*)[NY][NX])pointer_twiddle;\n\nint i, j, k;\n#pragma omp ... | subroutine evolve(u0, u1, twiddle, d1, d2, d3)\n\n\n\nuse ft_data\nimplicit none\n\ninteger d1, d2, d3\ndouble complex u0(d1+1,d2,d3)\ndouble complex u1(d1+1,d2,d3)\ndouble precision twiddle(d1+1,d2,d3)\ninteger i, j, k\n\ndo k = 1, d3\ndo j = 1, d2\ndo i = 1, d1\nu0(i,j,k) = u0(i,j,k) * twiddle(i,j,k)\nu1(i,j,k) =... |
void domain(){\n\nnx=nx0;\nny=ny0;\nnz=nz0;\n\nif((nx<4)||(ny<4)||(nz<4)){\nprintf(" SUBDOMAIN SIZE IS TOO SMALL -\n"\n" ADJUST PROBLEM SIZE OR NUMBER OF PROCESSORS\n"\n" SO THAT NX, NY AND NZ ARE GREATER THAN OR EQUAL\n"\n" TO 4 THEY ARE CURRENTLY%3d%3d%3d\n",nx,ny,nz);\nexit(EXIT_FAILURE);\n}\nif((nx>... | subroutine domain\n\n\nuse lu_data\nimplicit none\n\n\n\nnx = nx0\nny = ny0\nnz = nz0\n\nif ( ( nx .lt. 4 ) .or. &\n& ( ny .lt. 4 ) .or. &\n& ( nz .lt. 4 ) ) then\nwrite (*,2001) nx, ny, nz\n2001 format (5x,'SUBDOMAIN SIZE IS TOO SMALL - ', &\n& /5x,'ADJUST PROBLEM SIZE OR NUMBER OF PROCESSORS', &... |
void tzetar(){\nint i, j, k;\ndouble t1, t2, t3, ac, xvel, yvel, zvel, r1, r2, r3, r4, r5, btuz, ac2u, uzik1;\nint thread_id = omp_get_thread_num();\n\nif(timeron && thread_id==0){timer_start(T_TZETAR);}\n#pragma omp for\nfor(k=1; k<=nz2; k++){\nfor(j=1; j<=ny2; j++){\nfor(i=1; i<=nx2; i++){\nxvel=us[k][j][i];\nyvel=vs... | subroutine tzetar\n\n\n\nuse sp_data\nimplicit none\n\ninteger i, j, k\ndouble precision t1, t2, t3, ac, xvel, yvel, zvel, r1, r2, r3, &\n& r4, r5, btuz, ac2u, uzik1\n\n\nif (timeron) call timer_start(t_tzetar)\ndo k = 1, nz2\ndo j = 1, ny2\ndo i = 1, nx2\n\nxvel = us(i,j,k)\nyvel = vs(i,j... |
static void rep_nrm(void* pointer_u, int n1, int n2, int n3, char* title, int kk){\ndouble rnm2, rnmu;\nnorm2u3(pointer_u,n1,n2,n3,&rnm2,&rnmu,nx[kk],ny[kk],nz[kk]);\n#pragma omp master\nprintf(" Level%2d in %8s: norms =%21.14e%21.14e\n", kk, title, rnm2, rnmu);\n} | subroutine rep_nrm(u,n1,n2,n3,title,kk)\n\n\n\nuse mg_data\nimplicit none\n\ninteger n1, n2, n3, kk\ndouble precision u(n1,n2,n3)\ncharacter*8 title\n\ndouble precision rnm2, rnmu\n\n\ncall norm2u3(u,n1,n2,n3,rnm2,rnmu,nx(kk),ny(kk),nz(kk))\nwrite(*,7)kk,title,rnm2,rnmu\n7 format(' Level',i2,' in ',a8,': norms =',D2... |
void exact_rhs(){\ndouble dtemp[5], xi, eta, zeta, dtpp;\nint m, i, j, k, ip1, im1, jp1, jm1, km1, kp1;\n\nfor(k=0; k<=grid_points[2]-1; k++){\nfor(j=0; j<=grid_points[1]-1; j++){\nfor(i=0; i<=grid_points[0]-1; i++){\nfor(m=0; m<5; m++){\nforcing[k][j][i][m]=0.0;\n}\n}\n}\n}\n\nfor(k=1; k<=grid_points[2]-2; k++){\nzeta... | subroutine exact_rhs\n\n\n\nuse bt_data\nimplicit none\n\ndouble precision dtemp(5), xi, eta, zeta, dtpp\ninteger m, i, j, k, ip1, im1, jp1, jm1, km1, kp1\n\ndo k= 0, grid_points(3)-1\ndo j = 0, grid_points(2)-1\ndo i = 0, grid_points(1)-1\ndo m = 1, 5\nforcing(m,i,j,k) = 0.0d0\nenddo\nenddo\nenddo\nenddo\n\ndo k = 1, ... |
void pinvr(){\nint i, j, k;\ndouble r1, r2, r3, r4, r5, t1, t2;\nint thread_id = omp_get_thread_num();\n\nif(timeron && thread_id==0){timer_start(T_PINVR);}\n#pragma omp for\nfor(k=1; k<=nz2; k++){\nfor(j=1; j<=ny2; j++){\nfor(i=1; i<=nx2; i++){\nr1=rhs[k][j][i][0];\nr2=rhs[k][j][i][1];\nr3=rhs[k][j][i][2];\nr4=rhs[k][... | subroutine pinvr\n\n\n\nuse sp_data\nimplicit none\n\ninteger i, j, k\ndouble precision r1, r2, r3, r4, r5, t1, t2\n\nif (timeron) call timer_start(t_pinvr)\ndo k = 1, nz2\ndo j = 1, ny2\ndo i = 1, nx2\n\nr1 = rhs(1,i,j,k)\nr2 = rhs(2,i,j,k)\nr3 = rhs(3,i,j,k)\nr4 = rhs(4,i,j,k)\nr5 = rhs(5,i,j,k)\n\nt1 = bt * r1... |
static void cffts1(int is,\nint d1,\nint d2,\nint d3,\nvoid* pointer_x,\nvoid* pointer_xout,\ndcomplex y1[][FFTBLOCKPAD],\ndcomplex y2[][FFTBLOCKPAD]){\ndcomplex (*x)[NY][NX] = (dcomplex(*)[NY][NX])pointer_x;\ndcomplex (*xout)[NY][NX] = (dcomplex(*)[NY][NX])pointer_xout;\n\nint logd1;\nint i, j, k, jj;\n\nlogd1 = ilog2... | subroutine cffts1(is, d1, d2, d3, x, xout, y1, y2)\n\n\nuse ft_data\nimplicit none\n\ninteger is, d1, d2, d3, logd1\ndouble complex x(d1+1,d2,d3)\ndouble complex xout(d1+1,d2,d3)\ndouble complex y1(fftblockpad, d1), y2(fftblockpad, d1)\ninteger i, j, k, jj, jn\n\nlogd1 = ilog2(d1)\n\nif (timers_enabled) call timer_star... |
void error(){\n\nint i, j, k, m;\ndouble tmp;\ndouble u000ijk[5];\nfor(m=0;m<5;m++){errnm[m]=0.0;}\nfor(k=1; k<nz-1; k++){\nfor(j=jst; j<jend; j++){\nfor(i=ist; i<iend; i++){\nexact(i, j, k, u000ijk);\nfor(m=0; m<5; m++){\ntmp=(u000ijk[m]-u[k][j][i][m]);\nerrnm[m]=errnm[m]+tmp*tmp;\n}\n}\n}\n}\nfor(m=0; m<5; m++){\nerr... | subroutine error\n\n\n\nuse lu_data\nimplicit none\n\ninteger i, j, k, m\ndouble precision tmp\ndouble precision u000ijk(5)\n\n\ndo m = 1, 5\nerrnm(m) = 0.0d+00\nend do\n\ndo k = 2, nz-1\ndo j = jst, jend\ndo i = ist, iend\ncall exact( i, j, k, u000ijk )\ndo m = 1, 5\ntmp = ( u000ijk(m) - u(m,i,j,k) )\nerrnm(m) = err... |
static void cffts3(int is,\nint d1,\nint d2,\nint d3,\nvoid* pointer_x,\nvoid* pointer_xout,\ndcomplex y1[][FFTBLOCKPAD],\ndcomplex y2[][FFTBLOCKPAD]){\ndcomplex (*x)[NY][NX] = (dcomplex(*)[NY][NX])pointer_x;\ndcomplex (*xout)[NY][NX] = (dcomplex(*)[NY][NX])pointer_xout;\n\nint logd3;\nint i, j, k, ii;\n\nlogd3 = ilog2... | subroutine cffts3(is, d1, d2, d3, x, xout, y1, y2)\n\n\nuse ft_data\nimplicit none\n\ninteger is, d1, d2, d3, logd3\ndouble complex x(d1+1,d2,d3)\ndouble complex xout(d1+1,d2,d3)\ndouble complex y1(fftblockpad, d3), y2(fftblockpad, d3)\ninteger i, j, k, ii, in\n\nlogd3 = ilog2(d3)\n\nif (timers_enabled) call timer_star... |
void setcoeff(){\n\ndxi=1.0/(nx0-1);\ndeta=1.0/(ny0-1);\ndzeta=1.0/(nz0-1);\ntx1=1.0/(dxi*dxi);\ntx2=1.0/(2.0*dxi);\ntx3=1.0/dxi;\nty1=1.0/(deta*deta);\nty2=1.0/(2.0*deta);\nty3=1.0/deta;\ntz1=1.0/(dzeta*dzeta);\ntz2=1.0/(2.0*dzeta);\ntz3=1.0/dzeta;\n\ndx1=0.75;\ndx2=dx1;\ndx3=dx1;\ndx4=dx1;\ndx5=dx1;\ndy1=0.75;\ndy2=d... | subroutine setcoeff\n\n\nuse lu_data\nimplicit none\n\n\n\ndxi = 1.0d+00 / ( nx0 - 1 )\ndeta = 1.0d+00 / ( ny0 - 1 )\ndzeta = 1.0d+00 / ( nz0 - 1 )\n\ntx1 = 1.0d+00 / ( dxi * dxi )\ntx2 = 1.0d+00 / ( 2.0d+00 * dxi )\ntx3 = 1.0d+00 / dxi\n\nty1 = 1.0d+00 / ( deta * deta )\nty2 = 1.0d+00 / ( 2.0d+00 * deta )\nty3 = 1.0d+... |
void y_solve(){\nint i, j, k, m, n, jsize;\nint thread_id = omp_get_thread_num();\n\nif(timeron && thread_id==0){timer_start(T_YSOLVE);}\n\njsize=grid_points[1]-1;\n\n#pragma omp for\nfor(k=1; k<=grid_points[2]-2; k++){\ndouble fjac[PROBLEM_SIZE+1][5][5];\ndouble njac[PROBLEM_SIZE+1][5][5];\ndouble lhs[PROBLEM_SIZE+1][... | subroutine y_solve\n\n\n\nuse bt_data\nuse work_lhs\n\nimplicit none\n\ninteger i, j, k, m, n, jsize\ndouble precision tmp1, tmp2, tmp3\n\n\nif (timeron) call timer_start(t_ysolve)\n\n\n\njsize = grid_points(2)-1\n\ndo k = 1, grid_points(3)-2\ndo i = 1, grid_points(1)-2\ndo j = 0, jsize\n\ntmp1 = rho_i(i,j,k)\ntmp2 = t... |
void initialize(){\nint i, j, k, m, ix, iy, iz;\ndouble xi, eta, zeta, Pface[2][3][5], Pxi, Peta, Pzeta, temp[5];\n\n#pragma omp for\nfor(k=0; k<=grid_points[2]-1; k++){\nfor(j=0; j<=grid_points[1]-1; j++){\nfor(i=0; i<=grid_points[0]-1; i++){\nfor(m=0; m<5; m++){\nu[k][j][i][m]=1.0;\n}\n}\n}\n}\n\n#pragma omp for\nfor... | subroutine initialize\n\n\n\nuse bt_data\nimplicit none\n\ninteger i, j, k, m, ix, iy, iz\ndouble precision xi, eta, zeta, Pface(5,3,2), Pxi, Peta, &\n& Pzeta, temp(5)\n\n\ndo k = 0, grid_points(3)-1\ndo j = 0, grid_points(2)-1\ndo i = 0, grid_points(1)-1\ndo m = 1, 5\nu(m,i,j,k) = 1.0\nend do\nend do\nend do\n... |
static void conj_grad(int colidx[],\nint rowstr[],\ndouble x[],\ndouble z[],\ndouble a[],\ndouble p[],\ndouble q[],\ndouble r[],\ndouble* rnorm){\nint j, k;\nint cgit, cgitmax;\ndouble alpha, beta, suml;\nstatic double d, sum, rho, rho0;\n\ncgitmax = 25;\n#pragma omp single nowait\n{\n\nrho = 0.0;\nsum = 0.0;\n}\n\n#pr... | subroutine conj_grad ( rnorm )\n\n\nuse cg_data\nimplicit none\n\ninteger j\ninteger cgit, cgitmax\ninteger(kz) k\n\ndouble precision d, sum, rho, rho0, alpha, beta, rnorm, suml\n\ndata cgitmax / 25 /\n\n\nrho = 0.0d0\nsum = 0.0d0\n\n\ndo j=1,naa+1\nq(j) = 0.0d0\nz(j) = 0.0d0\nr(j) = x(j)\np(j) = r(j)\nenddo... |
static void sparse(double a[],\nint colidx[],\nint rowstr[],\nint n,\nint nz,\nint nozer,\nint arow[],\nint acol[][NONZER+1],\ndouble aelt[][NONZER+1],\nint firstrow,\nint lastrow,\nint nzloc[],\ndouble rcond,\ndouble shift){\nint nrows;\n\n\nint i, j, j1, j2, nza, k, kk, nzrow, jcol;\ndouble size, scale, ratio, va;\nb... | subroutine sparse( a, colidx, rowstr, n, nz, nonzer, arow, acol, &\n& aelt, firstrow, lastrow, &\n& v, iv, nzloc, rcond, shift )\n\nuse tinfo\n\nimplicit none\n\ninteger colidx(*), iv(*)\ninteger firstrow, lastrow\ninteger n, nonzer, arow(... |
void rhs_norm(double rms[5]){\nint i, j, k, d, m;\ndouble add;\nfor(m=0; m<5; m++){\nrms[m]=0.0;\n}\nfor(k=1; k<=grid_points[2]-2; k++){\nfor(j=1; j<=grid_points[1]-2; j++){\nfor(i=1; i<=grid_points[0]-2; i++){\nfor(m=0; m<5; m++) {\nadd=rhs[k][j][i][m];\nrms[m]=rms[m]+add*add;\n}\n}\n}\n}\nfor(m=0; m<5; m++){\nfor(d=0... | subroutine compute_rhs\n\n\nuse bt_data\nimplicit none\n\ninteger i, j, k, m\ndouble precision rho_inv, uijk, up1, um1, vijk, vp1, vm1, &\n& wijk, wp1, wm1\n\n\nif (timeron) call timer_start(t_rhs)\n\n\ndo k = 0, grid_points(3)-1\ndo j = 0, grid_points(2)-1\ndo i = 0, grid_points(1)-1\nrho_inv = 1.0d0/u(1,i,j,k)\n... |
void exact_solution(double xi, double eta, double zeta, double dtemp[5]){\nint m;\nfor(m=0; m<5; m++){\ndtemp[m]=ce[0][m]+\nxi*(ce[1][m]+\nxi*(ce[4][m]+\nxi*(ce[7][m]+\nxi*ce[10][m])))+\neta*(ce[2][m]+\neta*(ce[5][m]+\neta*(ce[8][m]+\neta*ce[11][m])))+\nzeta*(ce[3][m]+\nzeta*(ce[6][m]+\nzeta*(ce[9][m]+\nzeta*ce[12][m])... | subroutine exact_solution(xi,eta,zeta,dtemp)\n\n\n\nuse bt_data\nimplicit none\n\ndouble precision xi, eta, zeta, dtemp(5)\ninteger m\n\ndo m = 1, 5\ndtemp(m) = ce(m,1) + &\n& xi*(ce(m,2) + xi*(ce(m,5) + xi*(ce(m,8) + xi*ce(m,11)))) + &\n& eta*(ce(m,3) + eta*(ce(m,6) + eta*(ce(m,9) + eta*ce(m,12))))+ &\n& ... |
void jacu(int k){\n\nint i, j;\ndouble r43;\ndouble c1345;\ndouble c34;\ndouble tmp1, tmp2, tmp3;\nr43=(4.0/3.0);\nc1345=C1*C3*C4*C5;\nc34=C3*C4;\n\n#pragma omp for nowait schedule(static)\nfor (j=jend-1; j>=jst; j--) {\nfor (i=iend-1; i>=ist; i--) {\n\ntmp1=rho_i[k][j][i];\ntmp2=tmp1*tmp1;\ntmp3=tmp1*tmp2;\nd[j][i][0]... | subroutine jacu(j, k)\n\n\n\nuse lu_data\nimplicit none\n\ninteger j, k\n\ninteger i\ndouble precision r43\ndouble precision c1345\ndouble precision c34\ndouble precision tmp1, tmp2, tmp3\n\n\n\nr43 = ( 4.0d+00 / 3.0d+00 )\nc1345 = c1 * c3 * c4 * c5\nc34 = c3 * c4\n\ndo i = iend, ist, -1\n\ntmp1 = rho_i(i,j,k)\ntmp... |
void exact(int i, int j, int k, double u000ijk[]){\n\nint m;\ndouble xi, eta, zeta;\nxi=((double)i)/(nx0-1);\neta=((double)j)/(ny0-1);\nzeta=((double)k)/(nz-1);\nfor(m=0; m<5; m++){\nu000ijk[m]=ce[0][m]+\n(ce[1][m]+\n(ce[4][m]+\n(ce[7][m]+\nce[10][m]*xi)*xi)*xi)*xi+\n(ce[2][m]+\n(ce[5][m]+\n(ce[8][m]+\nce[11][m]*eta)*e... | subroutine exact( i, j, k, u000ijk )\n\n\n\nuse lu_data\nimplicit none\n\ninteger i, j, k\ndouble precision u000ijk(*)\n\ninteger m\ndouble precision xi, eta, zeta\n\nxi = ( dble ( i - 1 ) ) / ( nx0 - 1 )\neta = ( dble ( j - 1 ) ) / ( ny0 - 1 )\nzeta = ( dble ( k - 1 ) ) / ( nz - 1 )\n\n\ndo m = 1, 5\nu000ijk(m) = c... |
void z_solve(){\nint i, j, k, m, n, ksize;\nint thread_id = omp_get_thread_num();\n\nif(timeron && thread_id==0){timer_start(T_ZSOLVE);}\n\nksize = grid_points[2]-1;\n\n#pragma omp for\nfor(j=1; j<=grid_points[1]-2; j++){\ndouble fjac[PROBLEM_SIZE+1][5][5];\ndouble njac[PROBLEM_SIZE+1][5][5];\ndouble lhs[PROBLEM_SIZE+1... | subroutine z_solve\n\n\n\nuse bt_data\nuse work_lhs\n\nimplicit none\n\ninteger i, j, k, m, n, ksize\ndouble precision tmp1, tmp2, tmp3\n\n\nif (timeron) call timer_start(t_zsolve)\n\n\n\nksize = grid_points(3)-1\n\ndo j = 1, grid_points(2)-2\ndo i = 1, grid_points(1)-2\ndo k = 0, ksize\n\ntmp1 = 1.0d+00 / u(1,i,j,k)\n... |
static void cfftz(int is,\nint m,\nint n,\ndcomplex x[][FFTBLOCKPAD],\ndcomplex y[][FFTBLOCKPAD]){\nint i,j,l,mx;\n\n\nmx = (int)(u[0].real);\nif((is != 1 && is != -1) || m < 1 || m > mx){\nprintf("CFFTZ: Either U has not been initialized, or else\n"\n"one of the input parameters is invalid%5d%5d%5d\n", is, m, mx);\nex... | subroutine cfftz (is, m, n, x, y)\n\n\n\nuse ft_data\nimplicit none\n\ninteger is,m,n,i,j,l,mx\ndouble complex x, y\n\ndimension x(fftblockpad,n), y(fftblockpad,n)\n\nmx = u(1)\nif ((is .ne. 1 .and. is .ne. -1) .or. m .lt. 1 .or. m .gt. mx) &\n& then\nwrite (*, 1) is, m, mx\n1 format ('CFFTZ: Either U has not... |
void verify(double xcr[],\ndouble xce[],\ndouble xci,\nchar* class_npb,\nboolean* verified){\ndouble xcrref[5], xceref[5], xciref;\ndouble xcrdif[5], xcedif[5], xcidif;\ndouble epsilon, dtref=0.0;\nint m;\n\nepsilon=1.0e-08;\n*class_npb='U';\n*verified=TRUE;\nfor(m=0; m<5; m++){\nxcrref[m]=1.0;\nxceref[m]=1.0;\n}\nxcir... | subroutine verify(xcr, xce, xci, class, verified)\n\n\n\nuse, intrinsic :: ieee_arithmetic, only : ieee_is_nan\n\nuse lu_data\n\nimplicit none\n\ndouble precision xcr(5), xce(5), xci\ndouble precision xcrref(5),xceref(5),xciref, &\n& xcrdif(5),xcedif(5),xcidif, &\n& epsilon, dtref\... |
static void ipow46(double a,\nint exponent,\ndouble* result){\ndouble q, r;\nint n, n2;\n\n\n*result = 1;\nif(exponent==0){return;}\nq = a;\nr = 1;\nn = exponent;\n\nwhile(n > 1){\nn2 = n/2;\nif(n2*2==n){\nrandlc(&q, q);\nn = n2;\n}else{\nrandlc(&r, q);\nn = n-1;\n}\n}\nrandlc(&r, q);\n*result = r;\n}\n\nstatic void pr... | subroutine ipow46(a, exponent, result)\n\n\n\nimplicit none\ndouble precision a, result, dummy, q, r\ninteger exponent, n, n2\nexternal randlc\ndouble precision randlc\nresult = 1\nif (exponent .eq. 0) return\nq = a\nr = 1\nn = exponent\n\n\ndo while (n .gt. 1)\nn2 = n/2\nif (n2 * 2 .eq. n) then\ndummy = randlc(q, q)\n... |
void jacld(int k){\n\nint i, j;\ndouble r43;\ndouble c1345;\ndouble c34;\ndouble tmp1, tmp2, tmp3;\nr43=(4.0/3.0);\nc1345=C1*C3*C4*C5;\nc34=C3*C4;\n\n#pragma omp for nowait schedule(static)\nfor(j=jst; j<jend; j++){\nfor(i=ist; i<iend; i++){\n\ntmp1=rho_i[k][j][i];\ntmp2=tmp1*tmp1;\ntmp3=tmp1*tmp2;\nd[j][i][0][0]=1.0+d... | subroutine jacld(j, k)\n\n\n\n\nuse lu_data\nimplicit none\n\ninteger j, k\n\ninteger i\ndouble precision r43\ndouble precision c1345\ndouble precision c34\ndouble precision tmp1, tmp2, tmp3\n\n\n\nr43 = ( 4.0d+00 / 3.0d+00 )\nc1345 = c1 * c3 * c4 * c5\nc34 = c3 * c4\n\ndo i = ist, iend\n\ntmp1 = rho_i(i,j,k)\ntmp2... |
void adi(){\ncompute_rhs();\ntxinvr();\nx_solve();\ny_solve();\nz_solve();\nadd();\n} | subroutine adi\n\n\ncall compute_rhs\n\ncall txinvr\n\ncall x_solve\n\ncall y_solve\n\ncall z_solve\n\ncall add\n\nreturn\nend |
static void sprnvc(int n, int nz, int nn1, double v[], int iv[]){\nint nzv, ii, i;\ndouble vecelt, vecloc;\n\nnzv = 0;\n\nwhile(nzv < nz){\nvecelt = randlc(&tran, amult);\n\n\nvecloc = randlc(&tran, amult);\ni = icnvrt(vecloc, nn1) + 1;\nif(i>n){continue;}\n\n\nboolean was_gen = FALSE;\nfor(ii = 0; ii < nzv; ii++){\nif... | subroutine sprnvc( n, nz, nn1, v, iv )\n\nuse cg_data, only : amult, tran\n\nimplicit none\n\ndouble precision v(*)\ninteger n, nz, nn1, iv(*)\n\n\n\ninteger nzv, ii, i, icnvrt\n\nexternal randlc, icnvrt\ndouble precision randlc, vecelt, vecloc\n\n\nnzv = 0\n\n100 conti... |
void ssor(int niter){\n\nint i, j, k, m, n;\nint istep;\ndouble tmp, tv[ISIZ2*(ISIZ1/2*2+1)*5];\ndouble delunm[5];\n\ntmp=1.0/(omega*(2.0-omega));\n\n\n#pragma omp parallel for private(i,j,n,m)\nfor(j=0; j<ISIZ2; j++){\nfor(i=0; i<ISIZ1; i++){\nfor(n=0; n<5; n++){\nfor(m=0; m<5; m++){\na[j][i][n][m]=0.0;\nb[j][i][n][m]... | subroutine ssor(niter)\n\n\n\nuse lu_data\nimplicit none\n\ninteger niter\n\ninteger i, j, k, m, n\ninteger istep\ndouble precision tmp, tmp2\ndouble precision delunm(5)\n\nexternal timer_read\ndouble precision timer_read\n\n\ntmp = 1.0d+00 / ( omega * ( 2.0d+00 - omega ) )\n\ndo i = 1, t_last\ncall timer_clear(i)\ne... |
static void comm3(void* pointer_u, int n1, int n2, int n3, int kk){\n#ifdef __clang__\nusing custom_cast = double (*)[n2][n1];\ncustom_cast u = reinterpret_cast<custom_cast>(pointer_u);\n#else\ndouble (*u)[n2][n1] = (double (*)[n2][n1])pointer_u;\n#endif\n\nint i1, i2, i3;\nif(timeron){\n#pragma omp master\ntimer_start... | subroutine comm3(u,n1,n2,n3,kk)\n\n\n\nuse mg_data\nimplicit none\n\ninteger n1, n2, n3, kk\ndouble precision u(n1,n2,n3)\ninteger i1, i2, i3\n\nif (timeron) call timer_start(T_comm3)\ndo i3=2,n3-1\ndo i2=2,n2-1\nu( 1,i2,i3) = u(n1-1,i2,i3)\nu(n1,i2,i3) = u( 2,i2,i3)\nenddo\n\ndo i1=1,n1\nu(i1, 1,i3) = u(i1,n2-1,i... |
void exact_solution(double xi, double eta, double zeta, double dtemp[]){\nint m;\nfor(m=0; m<5; m++){\ndtemp[m]=ce[0][m]+xi*\n(ce[1][m]+xi*\n(ce[4][m]+xi*\n(ce[7][m]+xi*\nce[10][m])))+eta*\n(ce[2][m]+eta*\n(ce[5][m]+eta*\n(ce[8][m]+eta*\nce[11][m])))+zeta*\n(ce[3][m]+zeta*\n(ce[6][m]+zeta*\n(ce[9][m]+zeta*\nce[12][m]))... | subroutine exact_solution(xi,eta,zeta,dtemp)\n\n\n\nuse sp_data\nimplicit none\n\ndouble precision xi, eta, zeta\ndouble precision dtemp(5)\ninteger m\n\ndo m = 1, 5\ndtemp(m) = ce(m,1) + &\n& xi*(ce(m,2) + xi*(ce(m,5) + xi*(ce(m,8) + xi*ce(m,11)))) + &\n& eta*(ce(m,3) + eta*(ce(m,6) + eta*(ce(m,9) + eta*ce... |
static void compute_initial_conditions(void* pointer_u0,\nint d1,\nint d2,\nint d3){\ndcomplex (*u0)[NY][NX] = (dcomplex(*)[NY][NX])pointer_u0;\n\nint k, j;\ndouble x0, start, an, starts[NZ];\nstart = SEED;\n\n\nipow46(A, 0, &an);\nrandlc(&start, an);\nipow46(A, 2*NX*NY, &an);\n\nstarts[0] = start;\nfor(int k=1; k<dims... | subroutine compute_initial_conditions(u0, d1, d2, d3)\n\n\n\nuse ft_data\nimplicit none\n\ninteger d1, d2, d3\ndouble complex u0(d1+1, d2, d3)\ninteger k, j\ndouble precision x0, start, an, dummy, starts(nz)\n\n\nstart = seed\ncall ipow46(a, 0, an)\ndummy = randlc(start, an)\ncall ipow46(a, 2*nx*ny, an)\n\nstarts(1) = ... |
void setiv(){\n\nint i, j, k, m;\ndouble xi, eta, zeta;\ndouble pxi, peta, pzeta;\ndouble ue_1jk[5], ue_nx0jk[5], ue_i1k[5];\ndouble ue_iny0k[5], ue_ij1[5], ue_ijnz[5];\n\n#pragma omp for\nfor(k=1; k<nz-1; k++){\nzeta=((double)k)/(nz-1);\nfor(j=1; j<ny-1; j++){\neta=((double)j)/(ny0-1);\nfor(i=1; i<nx-1; i++){\nxi=((do... | subroutine setiv\n\n\n\nuse lu_data\nimplicit none\n\ninteger i, j, k, m\ndouble precision xi, eta, zeta\ndouble precision pxi, peta, pzeta\ndouble precision ue_1jk(5),ue_nx0jk(5),ue_i1k(5), &\n& ue_iny0k(5),ue_ij1(5),ue_ijnz(5)\n\n\ndo k = 2, nz - 1\ndo j = 2, ny - 1\nzeta = ( dble (k-1) ) / (nz-1)\neta = (... |
void verify(int no_time_steps, char* class_npb, boolean* verified){\ndouble xcrref[5], xceref[5], xcrdif[5], xcedif[5], epsilon, xce[5], xcr[5], dtref;\nint m;\n\nepsilon=1.0e-08;\n\nerror_norm(xce);\ncompute_rhs();\nrhs_norm(xcr);\nfor(m=0;m<5;m++){xcr[m]=xcr[m]/dt;}\n*class_npb='U';\n*verified=TRUE;\nfor(m=0;m<5;m++)... | subroutine verify(no_time_steps, class, verified)\n\n\n\nuse, intrinsic :: ieee_arithmetic, only : ieee_is_nan\n\nuse sp_data\n\nimplicit none\n\ndouble precision xcrref(5),xceref(5),xcrdif(5),xcedif(5), &\n& epsilon, xce(5), xcr(5), dtref\ninteger m, no_time_steps\ncharacter class\nlogical verified\... |
void add(){\nint i, j, k, m;\nint thread_id = omp_get_thread_num();\n\nif(timeron && thread_id==0){timer_start(T_ADD);}\n#pragma omp for\nfor(k=1; k<=grid_points[2]-2; k++){\nfor(j=1; j<=grid_points[1]-2; j++){\nfor(i=1; i<=grid_points[0]-2; i++){\nfor(m=0; m<5; m++){\nu[k][j][i][m]=u[k][j][i][m]+rhs[k][j][i][m];\n}\n}... | subroutine add\n\n\n\nuse bt_data\nimplicit none\n\ninteger i, j, k, m\n\nif (timeron) call timer_start(t_add)\ndo k = 1, grid_points(3)-2\ndo j = 1, grid_points(2)-2\ndo i = 1, grid_points(1)-2\ndo m = 1, 5\nu(m,i,j,k) = u(m,i,j,k) + rhs(m,i,j,k)\nenddo\nenddo\nenddo\nenddo\nif (timeron) call timer_sto... |
void z_solve(){\nint i, j, k, k1, k2, m;\ndouble ru1, fac1, fac2;\nint thread_id = omp_get_thread_num();\n\nif(timeron && thread_id==0){timer_start(T_ZSOLVE);}\n#pragma omp for\nfor(j=1; j<=ny2; j++){\ndouble cv[PROBLEM_SIZE], rhos[PROBLEM_SIZE];\ndouble lhs[IMAXP+1][IMAXP+1][5];\ndouble lhsp[IMAXP+1][IMAXP+1][5];\ndou... | subroutine z_solve\n\n\n\nuse sp_data\nuse work_lhs\n\nimplicit none\n\ninteger i, j, k, k1, k2, m\ndouble precision ru1, fac1, fac2\n\n\n\n\nif (timeron) call timer_start(t_zsolve)\ndo j = 1, ny2\ndo i = 1, nx2\n\ncall lhsinit(nz2+1, lhs, lhsp, lhsm)\n\n\n\ndo k = 0, nz2 + 1\nru1 = c3c4*rho_i(i,j,k)\ncv(k) = ws(... |
void erhs(){\n\nint i, j, k, m;\ndouble xi, eta, zeta;\ndouble q;\ndouble u21, u31, u41;\ndouble tmp;\ndouble u21i, u31i, u41i, u51i;\ndouble u21j, u31j, u41j, u51j;\ndouble u21k, u31k, u41k, u51k;\ndouble u21im1, u31im1, u41im1, u51im1;\ndouble u21jm1, u31jm1, u41jm1, u51jm1;\ndouble u21km1, u31km1, u41km1, u51km1;\nd... | subroutine erhs\n\n\n\nuse lu_data\nimplicit none\n\ninteger i, j, k, m\ndouble precision xi, eta, zeta\ndouble precision q\ndouble precision u21, u31, u41\ndouble precision tmp\ndouble precision u21i, u31i, u41i, u51i\ndouble precision u21j, u31j, u41j, u51j\ndouble precision u21k, u31k, u41k, u51k\ndouble prec... |
void txinvr(){\nint i, j, k;\ndouble t1, t2, t3, ac, ru1, uu, vv, ww, r1, r2, r3, r4, r5, ac2inv;\nint thread_id = omp_get_thread_num();\n\nif(timeron && thread_id==0){timer_start(T_TXINVR);}\n#pragma omp for\nfor(k=1; k<=nz2; k++){\nfor(j=1; j<=ny2; j++){\nfor(i=1; i<=nx2; i++){\nru1=rho_i[k][j][i];\nuu=us[k][j][i];\n... | subroutine txinvr\n\n\n\nuse sp_data\nimplicit none\n\ninteger i, j, k\ndouble precision t1, t2, t3, ac, ru1, uu, vv, ww, r1, r2, r3, &\n& r4, r5, ac2inv\n\n\nif (timeron) call timer_start(t_txinvr)\ndo k = 1, nz2\ndo j = 1, ny2\ndo i = 1, nx2\n\nru1 = rho_i(i,j,k)\nuu = us(i,j,k)\nvv = vs(i... |
void blts(int nx,\nint ny,\nint nz,\nint k,\ndouble omega,\ndouble v[][ISIZ2/2*2+1][ISIZ1/2*2+1][5],\ndouble ldz[][ISIZ1/2*2+1][5][5],\ndouble ldy[][ISIZ1/2*2+1][5][5],\ndouble ldx[][ISIZ1/2*2+1][5][5],\ndouble d[][ISIZ1/2*2+1][5][5],\nint ist,\nint iend,\nint jst,\nint jend,\nint nx0,\nint ny0){\n\nint i, j, m;\ndoubl... | subroutine blts ( ldmx, ldmy, ldmz, &\n& nx, ny, nz, &\n& omega, &\n& v, &\n& ldz, ldy, ldx, d, &\n& ist, iend, j, k )\n\n\n\nimplicit none\n\ninteger ldmx, ldmy, ldmz\ninteger nx, ny, nz\ndouble precision omega\ndouble precision... |
static void cffts2(int is,\nint d1,\nint d2,\nint d3,\nvoid* pointer_x,\nvoid* pointer_xout,\ndcomplex y1[][FFTBLOCKPAD],\ndcomplex y2[][FFTBLOCKPAD]){\ndcomplex (*x)[NY][NX] = (dcomplex(*)[NY][NX])pointer_x;\ndcomplex (*xout)[NY][NX] = (dcomplex(*)[NY][NX])pointer_xout;\n\nint logd2;\nint i, j, k, ii;\n\nlogd2 = ilog2... | subroutine cffts2(is, d1, d2, d3, x, xout, y1, y2)\n\n\nuse ft_data\nimplicit none\n\ninteger is, d1, d2, d3, logd2\ndouble complex x(d1+1,d2,d3)\ndouble complex xout(d1+1,d2,d3)\ndouble complex y1(fftblockpad, d2), y2(fftblockpad, d2)\ninteger i, j, k, ii, in\n\nlogd2 = ilog2(d2)\n\nif (timers_enabled) call timer_star... |
void setbv(){\n\nint i, j, k, m;\ndouble temp1[5], temp2[5];\n\n#pragma omp for\nfor(j=0; j<ny; j++){\nfor(i=0; i<nx; i++){\nexact(i, j, 0, temp1);\nexact(i, j, nz-1, temp2);\nfor(m=0; m<5; m++){\nu[0][j][i][m]=temp1[m];\nu[nz-1][j][i][m]=temp2[m];\n}\n}\n}\n\n#pragma omp for\nfor(k=0; k<nz; k++){\nfor(i=0; i<nx; i++){... | subroutine setbv\n\n\n\nuse lu_data\nimplicit none\n\ninteger i, j, k, m\ndouble precision temp1(5), temp2(5)\n\ndo j = 1, ny\ndo i = 1, nx\ncall exact( i, j, 1, temp1 )\ncall exact( i, j, nz, temp2 )\ndo m = 1, 5\nu( m, i, j, 1 ) = temp1(m)\nu( m, i, j, nz ) = temp2(m)\nend do\nend do\nend do\n\ndo k = 1, nz\ndo i = 1... |
void adi(){\ncompute_rhs();\nx_solve();\ny_solve();\nz_solve();\nadd();\n} | subroutine adi\n\n\ncall compute_rhs\n\ncall x_solve\n\ncall y_solve\n\ncall z_solve\n\ncall add\n\nreturn\nend |
void exact_rhs(){\ndouble dtemp[5], xi, eta, zeta, dtpp;\nint m, i, j, k, ip1, im1, jp1, jm1, km1, kp1;\n\nfor(k=0; k<=grid_points[2]-1; k++){\nfor(j=0; j<= grid_points[1]-1; j++){\nfor(i=0; i<=grid_points[0]-1; i++){\nfor(m=0; m<5; m++){\nforcing[k][j][i][m]=0.0;\n}\n}\n}\n}\n\nfor(k=1; k<=grid_points[2]-2; k++){\nzet... | subroutine exact_rhs\n\n\n\nuse sp_data\nimplicit none\n\ndouble precision dtemp(5), xi, eta, zeta, dtpp\ninteger m, i, j, k, ip1, im1, jp1, &\n& jm1, km1, kp1\n\ndo k= 0, grid_points(3)-1\ndo j = 0, grid_points(2)-1\ndo i = 0, grid_points(1)-1\ndo m = 1, 5\nforcing(m,i,j,k) = 0.0d0\n... |
static void vecset(int n, double v[], int iv[], int* nzv, int i, double val){\nint k;\nboolean set;\n\nset = FALSE;\nfor(k = 0; k < *nzv; k++){\nif(iv[k] == i){\nv[k] = val;\nset = TRUE;\n}\n}\nif(set == FALSE){\nv[*nzv] = val;\niv[*nzv] = i;\n*nzv = *nzv + 1;\n}\n} | subroutine vecset(n, v, iv, nzv, i, val)\n\nimplicit none\n\ninteger n, iv(*), nzv, i, k\ndouble precision v(*), val\n\n\nlogical set\n\nset = .false.\ndo k = 1, nzv\nif (iv(k) .eq. i) then\nv(k) = val\nset = .true.\nendif\nenddo\nif (.not. set) then\nnzv = nzv + 1\nv(nzv) = val\niv(nzv) = ... |
void error_norm(double rms[5]){\nint i, j, k, m, d;\ndouble xi, eta, zeta, u_exact[5], add;\nfor(m=0;m<5;m++){rms[m]=0.0;}\nfor(k=0; k<=grid_points[2]-1; k++){\nzeta=(double)(k)*dnzm1;\nfor(j=0; j<=grid_points[1]-1; j++){\neta=(double)(j)*dnym1;\nfor(i=0; i<=grid_points[0]-1; i++){\nxi=(double)(i)*dnxm1;\nexact_solutio... | subroutine error_norm(rms)\n\n\n\nuse bt_data\nimplicit none\n\ninteger i, j, k, m, d\ndouble precision xi, eta, zeta, u_exact(5), rms(5), add\n\ndo m = 1, 5\nrms(m) = 0.0d0\nenddo\n\ndo k = 0, grid_points(3)-1\ndo j = 0, grid_points(2)-1\nzeta = dble(k) * dnzm1\neta = dble(j) * dnym1\ndo i = 0, grid_points(1)-1\nxi = ... |
static void bubble(double ten[][MM], int j1[][MM], int j2[][MM], int j3[][MM], int m, int ind){\ndouble temp;\nint i, j_temp;\n\nif(ind == 1){\nfor(i = 0; i < m-1; i++){\nif(ten[ind][i] > ten[ind][i+1]){\ntemp = ten[ind][i+1];\nten[ind][i+1] = ten[ind][i];\nten[ind][i] = temp;\n\nj_temp = j1[ind][i+1];\nj1[ind][i+1] = ... | subroutine bubble( ten, j1, j2, j3, m, ind )\n\n\nimplicit none\n\n\ninteger m, ind, j1( m, 0:1 ), j2( m, 0:1 ), j3( m, 0:1 )\ndouble precision ten( m, 0:1 )\ndouble precision temp\ninteger i, j_temp\n\nif( ind .eq. 1 )then\n\ndo i=1,m-1\nif( ten(i,ind) .gt. ten(i+1,ind) )then\n\ntemp = ten( i+1, ind )\nten( i+1, ind ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.