cpp
stringlengths 74
8.89k
| fortran
stringlengths 112
13.8k
|
|---|---|
static void showall(void* pointer_z, int n1, int n2, int n3){\n#ifdef __clang__\nusing custom_cast = double (*)[n2][n1];\ncustom_cast z = reinterpret_cast<custom_cast>(pointer_z);\n#else\ndouble (*z)[n2][n1] = (double (*)[n2][n1])pointer_z;\n#endif\n\nint i1,i2,i3;\nint m1, m2, m3;\n\nm1 = min(n1,18);\nm2 = min(n2,14);\nm3 = min(n3,18);\n\nprintf("\n");\nfor(i3 = 0; i3 < m3; i3++){\nfor(i2 = 0; i2 < m2; i2++){\nfor(i1 = 0; i1 < m1; i1++){\nprintf("%6.3f", z[i3][i2][i1]);\n}\nprintf("\n");\n}\nprintf(" - - - - - - -\n");\n}\nprintf("\n");\n} | subroutine showall(z,n1,n2,n3)\n\n\nimplicit none\n\n\ninteger n1,n2,n3,i1,i2,i3\ndouble precision z(n1,n2,n3)\ninteger m1, m2, m3\n\nm1 = min(n1,18)\nm2 = min(n2,14)\nm3 = min(n3,18)\n\nwrite(*,*)' '\ndo i3=1,m3\ndo i1=1,m1\nwrite(*,6)(z(i1,i2,i3),i2=1,m2)\nenddo\nwrite(*,*)' - - - - - - - '\nenddo\nwrite(*,*)' '\n6 format(15f6.3)\n\nreturn\nend |
void init_array (int n,\nDATA_TYPE POLYBENCH_2D(X,N,N,n,n),\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n),\nDATA_TYPE POLYBENCH_2D(B,N,N,n,n))\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++)\n{\nX[i][j] = ((DATA_TYPE) i*(j+1) + 1) / n;\nA[i][j] = ((DATA_TYPE) i*(j+2) + 2) / n;\nB[i][j] = ((DATA_TYPE) i*(j+3) + 3) / n;\n}\n} | subroutine init_array(n, x, a, b)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n, n) :: x\nDATA_TYPE, dimension(n, n) :: b\ninteger :: n\ninteger :: i, j\n\ndo i = 1, n\ndo j = 1, n\nx(j, i) = (DBLE((i - 1) * (j)) + 1.0D0) / DBLE(n)\na(j, i) = (DBLE((i - 1) * (j + 1)) + 2.0D0) / DBLE(n)\nb(j, i) = (DBLE((i - 1) * (j + 2)) + 3.0D0) / DBLE(n)\nend do\nend do\nend subroutine |
void print_array(int ni, int nl,\nDATA_TYPE POLYBENCH_2D(D,NI,NL,ni,nl))\n{\nint i, j;\n\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nl; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, D[i][j]);\nif ((i * ni + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(d, ni, nl)\nimplicit none\n\nDATA_TYPE, dimension(nl, ni) :: d\ninteger :: nl, ni\ninteger :: i, j\ndo i = 1, ni\ndo j = 1, nl\nwrite(0, DATA_PRINTF_MODIFIER) d(j,i)\n\nif (mod(((i - 1) * ni) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\n\nend do\nend do\nwrite(0, *)\nend subroutine |
void kernel_durbin(int n,\nDATA_TYPE POLYBENCH_2D(y,N,N,n,n),\nDATA_TYPE POLYBENCH_2D(sum,N,N,n,n),\nDATA_TYPE POLYBENCH_1D(alpha,N,n),\nDATA_TYPE POLYBENCH_1D(beta,N,n),\nDATA_TYPE POLYBENCH_1D(r,N,n),\nDATA_TYPE POLYBENCH_1D(out,N,n))\n{\nint i, k;\n\n#pragma scop\ny[0][0] = r[0];\nbeta[0] = 1;\nalpha[0] = r[0];\nfor (k = 1; k < _PB_N; k++)\n{\nbeta[k] = beta[k-1] - alpha[k-1] * alpha[k-1] * beta[k-1];\nsum[0][k] = r[k];\nfor (i = 0; i <= k - 1; i++)\nsum[i+1][k] = sum[i][k] + r[k-i-1] * y[i][k-1];\nalpha[k] = -sum[k][k] * beta[k];\nfor (i = 0; i <= k-1; i++)\ny[i][k] = y[i][k-1] + alpha[k] * y[k-i-1][k-1];\ny[k][k] = alpha[k];\n}\nfor (i = 0; i < _PB_N; i++)\nout[i] = y[i][_PB_N-1];\n#pragma endscop\n\n} | subroutine kernel_durbin(n, y, sumArray, alpha, beta, r, &\noutArray)\nimplicit none\nDATA_TYPE, dimension(n, n) :: y\nDATA_TYPE, dimension(n, n) :: sumArray\nDATA_TYPE, dimension(n) :: beta\nDATA_TYPE, dimension(n) :: alpha\nDATA_TYPE, dimension(n) :: r\nDATA_TYPE, dimension(n) :: outArray\ninteger :: i, k, n\n\n!$pragma scop\ny(1, 1) = r(1)\nbeta(1) = 1\nalpha(1) = r(1)\ndo k = 2, _PB_N\nbeta(k) = beta(k - 1) - (alpha(k - 1) * alpha(k - 1) * &\nbeta(k -1))\nsumArray(k, 1) = r(k)\ndo i = 1, k - 1\nsumArray(k, i + 1) = sumArray(k, i) + &\n(r(k - i) * y(k - 1, i))\nend do\nalpha(k) = alpha(k) - (sumArray(k, k) * beta(k))\ndo i = 1, k - 1\ny(k, i) = y(k - 1, i) + (alpha(k) * y(k - 1, k - i))\nend do\ny(k, k) = alpha(k)\nend do\n\ndo i = 1, _PB_N\noutArray(i) = y(_PB_N, i)\nend do\n!$pragma endscop\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++) {\nfprintf(stderr, DATA_PRINTF_MODIFIER, A[i][j]);\nif ((i * n + j) % 20 == 0) fprintf(stderr, "\n");\n}\nfprintf(stderr, "\n");\n} | subroutine print_array(n, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\ninteger :: n\ninteger :: i,j\ndo i = 1, n\ndo j = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) a(j, i)\nif (mod((i - 1) * n + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void init_array(int ni, int nj,\nDATA_TYPE *alpha,\nDATA_TYPE *beta,\nDATA_TYPE POLYBENCH_2D(C,NI,NI,ni,ni),\nDATA_TYPE POLYBENCH_2D(A,NI,NJ,ni,nj))\n{\nint i, j;\n\n*alpha = 32412;\n*beta = 2123;\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nj; j++)\nA[i][j] = ((DATA_TYPE) i*j) / ni;\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < ni; j++)\nC[i][j] = ((DATA_TYPE) i*j) / ni;\n} | subroutine init_array(ni, nj, alpha, beta, c, a)\nimplicit none\n\nDATA_TYPE, dimension(ni, ni) :: a\nDATA_TYPE, dimension(nj, ni) :: c\nDATA_TYPE :: alpha , beta\ninteger :: nj, ni\ninteger :: i, j\n\nalpha = 32412\nbeta = 2123\n\ndo i = 1, ni\ndo j = 1, nj\na(j, i) = (DBLE(i - 1) * DBLE(j - 1)) / DBLE(ni)\nend do\ndo j = 1, ni\nc(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(ni)\nend do\nend do\nend subroutine |
void init_array(int ni, int nj,\nDATA_TYPE POLYBENCH_2D(A,NI,NJ,ni,nj),\nDATA_TYPE POLYBENCH_2D(R,NJ,NJ,nj,nj),\nDATA_TYPE POLYBENCH_2D(Q,NI,NJ,ni,nj))\n{\nint i, j;\n\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nj; j++) {\nA[i][j] = ((DATA_TYPE) i*j) / ni;\nQ[i][j] = ((DATA_TYPE) i*(j+1)) / nj;\n}\nfor (i = 0; i < nj; i++)\nfor (j = 0; j < nj; j++)\nR[i][j] = ((DATA_TYPE) i*(j+2)) / nj;\n} | subroutine init_array(ni, nj, a, r, q)\nimplicit none\n\nDATA_TYPE, dimension(nj, ni) :: a\nDATA_TYPE, dimension(nj, nj) :: r\nDATA_TYPE, dimension(nj, ni) :: q\ninteger :: ni, nj\ninteger :: i, j\n\ndo i = 1, ni\ndo j = 1, nj\na(j, i) = (DBLE(i - 1) * DBLE(j - 1)) / DBLE(ni)\nq(j, i) = (DBLE(i - 1) * DBLE(j)) / DBLE(nj)\nend do\nend do\n\ndo i = 1, ni\ndo j = 1, nj\nr(j, i) = (DBLE(i - 1) * DBLE(j + 1)) / DBLE(nj)\nend do\nend do\nend subroutine |
void init_array (int m,\nint n,\nDATA_TYPE *float_n,\nDATA_TYPE POLYBENCH_2D(data,M,N,m,n))\n{\nint i, j;\n\n*float_n = 1.2;\n\nfor (i = 0; i < m; i++)\nfor (j = 0; j < n; j++)\ndata[i][j] = ((DATA_TYPE) i*j) / M;\n}\n | subroutine init_array(m, n, float_n, dat)\nimplicit none\n\nDATA_TYPE, dimension(N, M) :: dat\nDATA_TYPE :: float_n\ninteger :: m, n\ninteger :: i, j\n\nfloat_n = 1.2D0\ndo i = 1, m\ndo j = 1, n\ndat(j, i) = (DBLE(i - 1) * DBLE(j - 1)) / DBLE(m)\nend do\nend do\nend subroutine |
void init_array (int m, int n,\nDATA_TYPE *float_n,\nDATA_TYPE POLYBENCH_2D(data,M,N,m,n))\n{\nint i, j;\n\n*float_n = 1.2;\n\nfor (i = 0; i < M; i++)\nfor (j = 0; j < N; j++)\ndata[i][j] = ((DATA_TYPE) i*j) / M;\n} | subroutine init_array(m, n, float_n, dat)\nimplicit none\n\nDATA_TYPE, dimension(n, m) :: dat\nDATA_TYPE :: float_n\ninteger :: m, n\ninteger :: i, j\n\nfloat_n = 1.2D0\ndo i = 1, m\ndo j = 1, n\ndat(j, i) = (DBLE((i - 1) * (j - 1))) / DBLE(m)\nend do\nend do\nend subroutine |
void print_array(int m,\nDATA_TYPE POLYBENCH_2D(symmat,M,M,m,m))\n\n{\nint i, j;\n\nfor (i = 0; i < m; i++)\nfor (j = 0; j < m; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, symmat[i][j]);\nif ((i * m + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(m, symmat)\nimplicit none\n\nDATA_TYPE, dimension(m, m) :: symmat\ninteger :: m\ninteger :: i, j\ndo i = 1, m\ndo j = 1, m\nwrite(0, DATA_PRINTF_MODIFIER) symmat(j, i)\nif (mod(((i - 1) * m) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void kernel_doitgen(int nr, int nq, int np,\nDATA_TYPE POLYBENCH_3D(A,NR,NQ,NP,nr,nq,np),\nDATA_TYPE POLYBENCH_2D(C4,NP,NP,np,np),\nDATA_TYPE POLYBENCH_3D(sum,NR,NQ,NP,nr,nq,np))\n{\nint r, q, p, s;\n\n#pragma scop\nfor (r = 0; r < _PB_NR; r++)\nfor (q = 0; q < _PB_NQ; q++) {\nfor (p = 0; p < _PB_NP; p++) {\nsum[r][q][p] = 0;\nfor (s = 0; s < _PB_NP; s++)\nsum[r][q][p] = sum[r][q][p] + A[r][q][s] * C4[s][p];\n}\nfor (p = 0; p < _PB_NR; p++)\nA[r][q][p] = sum[r][q][p];\n}\n#pragma endscop\n\n} | subroutine kernel_doitgen(nr, nq, np , &\na, cFour, sumA)\nimplicit none\n\nDATA_TYPE, dimension(np, nq, nr) :: a\nDATA_TYPE, dimension(np, nq, nr) :: sumA\nDATA_TYPE, dimension(np, np) :: cFour\ninteger :: nr, nq, np\ninteger :: r, s, p, q\n\n!$pragma scop\ndo r = 1, _PB_NR\ndo q = 1, _PB_NQ\ndo p = 1, _PB_NP\nsumA(p, q, r) = 0.0D0\ndo s = 1, _PB_NP\nsumA(p, q, r) = sumA(p, q, r) + (a(s, q, r) * &\ncFour(p, s))\nend do\nend do\ndo p = 1, _PB_NP\na(p, q, r) = sumA(p, q, r)\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void kernel_trisolv(int n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n),\nDATA_TYPE POLYBENCH_1D(x,N,n),\nDATA_TYPE POLYBENCH_1D(c,N,n))\n{\nint i, j;\n\n#pragma scop\nfor (i = 0; i < _PB_N; i++)\n{\nx[i] = c[i];\nfor (j = 0; j <= i - 1; j++)\nx[i] = x[i] - A[i][j] * x[j];\nx[i] = x[i] / A[i][i];\n}\n#pragma endscop\n\n} | subroutine kernel_trisolv(n , a, x, c)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n) :: c\nDATA_TYPE, dimension(n) :: x\ninteger :: n\ninteger :: i, j\n\n!$pragma scop\ndo i = 1, _PB_N\nx(i) = c(i)\ndo j = 1, i - 1\nx(i) = x(i) - (a(j, i) * x(j))\nend do\nx(i) = x(i) / a(i, i)\nend do\n!$pragma endscop\nend subroutine |
void init_array(int n,\nDATA_TYPE *alpha,\nDATA_TYPE *beta,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n),\nDATA_TYPE POLYBENCH_2D(B,N,N,n,n),\nDATA_TYPE POLYBENCH_1D(x,N,n))\n{\nint i, j;\n\n*alpha = 43532;\n*beta = 12313;\nfor (i = 0; i < n; i++)\n{\nx[i] = ((DATA_TYPE) i) / n;\nfor (j = 0; j < n; j++) {\nA[i][j] = ((DATA_TYPE) i*j) / n;\nB[i][j] = ((DATA_TYPE) i*j) / n;\n}\n}\n} | subroutine init_array(n, alpha, beta, a, b, x)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n, n) :: b\nDATA_TYPE, dimension(n) :: x\nDATA_TYPE :: alpha, beta\ninteger :: n\ninteger :: i, j\n\nalpha = 43532.0D0\nbeta = 12313.0D0\n\ndo i = 1, n\nx(i) = DBLE(i - 1) / DBLE(n)\ndo j = 1, n\na(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(n)\nb(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(n)\nend do\nend do\nend subroutine |
void print_array(int ni,\nDATA_TYPE POLYBENCH_2D(C,NI,NI,ni,ni))\n{\nint i, j;\n\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < ni; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, C[i][j]);\nif ((i * ni + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(ni, c)\nimplicit none\n\nDATA_TYPE, dimension(ni, ni) :: c\ninteger :: ni\ninteger :: i, j\ndo i = 1, ni\ndo j = 1, ni\nwrite(0, DATA_PRINTF_MODIFIER) c(j, i)\nif (mod(((i - 1) * ni) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void kernel_syrk(int ni, int nj,\nDATA_TYPE alpha,\nDATA_TYPE beta,\nDATA_TYPE POLYBENCH_2D(C,NI,NI,ni,ni),\nDATA_TYPE POLYBENCH_2D(A,NI,NJ,ni,nj))\n{\nint i, j, k;\n\n#pragma scop\n/* C := alpha*A*A' + beta*C */\nfor (i = 0; i < _PB_NI; i++)\nfor (j = 0; j < _PB_NI; j++)\nC[i][j] *= beta;\nfor (i = 0; i < _PB_NI; i++)\nfor (j = 0; j < _PB_NI; j++)\nfor (k = 0; k < _PB_NJ; k++)\nC[i][j] += alpha * A[i][k] * A[j][k];\n#pragma endscop\n\n} | subroutine kernel_syrk(ni, nj, alpha, beta, c, a)\nimplicit none\n\nDATA_TYPE, dimension(ni, ni) :: a\nDATA_TYPE, dimension(nj, ni) :: c\nDATA_TYPE :: alpha , beta\ninteger :: nj, ni\ninteger :: i, j, k\n\n!$pragma scop\ndo i = 1, _PB_NI\ndo j = 1, _PB_NI\nc(j, i) = c(j, i) * beta\nend do\nend do\ndo i = 1, _PB_NI\ndo j = 1, _PB_NI\ndo k = 1, _PB_NJ\nc(j, i) = c(j, i) + (alpha * a(k, i) * a(k, j))\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void init_array(int n,\nDATA_TYPE POLYBENCH_1D(x1,N,n),\nDATA_TYPE POLYBENCH_1D(x2,N,n),\nDATA_TYPE POLYBENCH_1D(y_1,N,n),\nDATA_TYPE POLYBENCH_1D(y_2,N,n),\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\n{\nx1[i] = ((DATA_TYPE) i) / n;\nx2[i] = ((DATA_TYPE) i + 1) / n;\ny_1[i] = ((DATA_TYPE) i + 3) / n;\ny_2[i] = ((DATA_TYPE) i + 4) / n;\nfor (j = 0; j < n; j++)\nA[i][j] = ((DATA_TYPE) i*j) / N;\n}\n} | subroutine init_array(n, x1, x2, y1, y2, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n) :: x1\nDATA_TYPE, dimension(n) :: y1\nDATA_TYPE, dimension(n) :: x2\nDATA_TYPE, dimension(n) :: y2\ninteger :: n\ninteger :: i, j\n\ndo i = 1, n\nx1(i) = DBLE(i - 1) / DBLE(n)\nx2(i) = (DBLE(i - 1) + 1.0D0) / DBLE(n)\ny1(i) = (DBLE(i - 1) + 3.0D0) / DBLE(n)\ny2(i) = (DBLE(i - 1) + 4.0D0) / DBLE(n)\ndo j = 1, n\na(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(n)\nend do\nend do\nend subroutine |
void kernel_fdtd_apml(int cz,\nint cxm,\nint cym,\nDATA_TYPE mui,\nDATA_TYPE ch,\nDATA_TYPE POLYBENCH_2D(Ax,CZ+1,CYM+1,cz+1,cym+1),\nDATA_TYPE POLYBENCH_2D(Ry,CZ+1,CYM+1,cz+1,cym+1),\nDATA_TYPE POLYBENCH_2D(clf,CYM+1,CXM+1,cym+1,cxm+1),\nDATA_TYPE POLYBENCH_2D(tmp,CYM+1,CXM+1,cym+1,cxm+1),\nDATA_TYPE POLYBENCH_3D(Bza,CZ+1,CYM+1,CXM+1,cz+1,cym+1,cxm+1),\nDATA_TYPE POLYBENCH_3D(Ex,CZ+1,CYM+1,CXM+1,cz+1,cym+1,cxm+1),\nDATA_TYPE POLYBENCH_3D(Ey,CZ+1,CYM+1,CXM+1,cz+1,cym+1,cxm+1),\nDATA_TYPE POLYBENCH_3D(Hz,CZ+1,CYM+1,CXM+1,cz+1,cym+1,cxm+1),\nDATA_TYPE POLYBENCH_1D(czm,CZ+1,cz+1),\nDATA_TYPE POLYBENCH_1D(czp,CZ+1,cz+1),\nDATA_TYPE POLYBENCH_1D(cxmh,CXM+1,cxm+1),\nDATA_TYPE POLYBENCH_1D(cxph,CXM+1,cxm+1),\nDATA_TYPE POLYBENCH_1D(cymh,CYM+1,cym+1),\nDATA_TYPE POLYBENCH_1D(cyph,CYM+1,cym+1))\n{\nint iz, iy, ix;\n\n#pragma scop\nfor (iz = 0; iz < _PB_CZ; iz++)\n{\nfor (iy = 0; iy < _PB_CYM; iy++)\n{\nfor (ix = 0; ix < _PB_CXM; ix++)\n{\nclf[iz][iy] = Ex[iz][iy][ix] - Ex[iz][iy+1][ix] + Ey[iz][iy][ix+1] - Ey[iz][iy][ix];\ntmp[iz][iy] = (cymh[iy] / cyph[iy]) * Bza[iz][iy][ix] - (ch / cyph[iy]) * clf[iz][iy];\nHz[iz][iy][ix] = (cxmh[ix] /cxph[ix]) * Hz[iz][iy][ix]\n+ (mui * czp[iz] / cxph[ix]) * tmp[iz][iy]\n- (mui * czm[iz] / cxph[ix]) * Bza[iz][iy][ix];\nBza[iz][iy][ix] = tmp[iz][iy];\n}\nclf[iz][iy] = Ex[iz][iy][_PB_CXM] - Ex[iz][iy+1][_PB_CXM] + Ry[iz][iy] - Ey[iz][iy][_PB_CXM];\ntmp[iz][iy] = (cymh[iy] / cyph[iy]) * Bza[iz][iy][_PB_CXM] - (ch / cyph[iy]) * clf[iz][iy];\nHz[iz][iy][_PB_CXM]=(cxmh[_PB_CXM] / cxph[_PB_CXM]) * Hz[iz][iy][_PB_CXM]\n+ (mui * czp[iz] / cxph[_PB_CXM]) * tmp[iz][iy]\n- (mui * czm[iz] / cxph[_PB_CXM]) * Bza[iz][iy][_PB_CXM];\nBza[iz][iy][_PB_CXM] = tmp[iz][iy];\nfor (ix = 0; ix < _PB_CXM; ix++)\n{\nclf[iz][iy] = Ex[iz][_PB_CYM][ix] - Ax[iz][ix] + Ey[iz][_PB_CYM][ix+1] - Ey[iz][_PB_CYM][ix];\ntmp[iz][iy] = (cymh[_PB_CYM] / cyph[iy]) * Bza[iz][iy][ix] - (ch / cyph[iy]) * clf[iz][iy];\nHz[iz][_PB_CYM][ix] = (cxmh[ix] / cxph[ix]) * Hz[iz][_PB_CYM][ix]\n+ (mui * czp[iz] / cxph[ix]) * tmp[iz][iy]\n- (mui * czm[iz] / cxph[ix]) * Bza[iz][_PB_CYM][ix];\nBza[iz][_PB_CYM][ix] = tmp[iz][iy];\n}\nclf[iz][iy] = Ex[iz][_PB_CYM][_PB_CXM] - Ax[iz][_PB_CXM] + Ry[iz][_PB_CYM] - Ey[iz][_PB_CYM][_PB_CXM];\ntmp[iz][iy] = (cymh[_PB_CYM] / cyph[_PB_CYM]) * Bza[iz][_PB_CYM][_PB_CXM] - (ch / cyph[_PB_CYM]) * clf[iz][iy];\nHz[iz][_PB_CYM][_PB_CXM] = (cxmh[_PB_CXM] / cxph[_PB_CXM]) * Hz[iz][_PB_CYM][_PB_CXM]\n+ (mui * czp[iz] / cxph[_PB_CXM]) * tmp[iz][iy]\n- (mui * czm[iz] / cxph[_PB_CXM]) * Bza[iz][_PB_CYM][_PB_CXM];\nBza[iz][_PB_CYM][_PB_CXM] = tmp[iz][iy];\n}\n}\n#pragma endscop\n\n} | subroutine kernel_fdtd_apml(cz, cxm, cym, mui, ch, &\nax, ry, clf, tmp, bza, ex, ey, &\nhz, czm, czp, cxmh, cxph, cymh, cyph)\nimplicit none\ninteger :: cz, cym, cxm\nDATA_TYPE, dimension(cxm + 1, cym + 1, cz + 1) :: ex\nDATA_TYPE, dimension(cxm + 1, cym + 1, cz + 1) :: ey\nDATA_TYPE, dimension(cxm + 1, cym + 1, cz + 1) :: hz\nDATA_TYPE, dimension(cym + 1, cz + 1) :: clf\nDATA_TYPE, dimension(cym + 1, cz + 1) :: ry\nDATA_TYPE, dimension(cym + 1, cz + 1) :: ax\nDATA_TYPE, dimension(cym + 1) :: cymh\nDATA_TYPE, dimension(cym + 1) :: cyph\nDATA_TYPE, dimension(cxm + 1) :: cxmh\nDATA_TYPE, dimension(cxm + 1) :: cxph\nDATA_TYPE, dimension(cz + 1) :: czm\nDATA_TYPE, dimension(cz + 1) :: czp\nDATA_TYPE, dimension(cxm + 1, cym + 1) :: tmp\nDATA_TYPE, dimension(cxm + 1, cym + 1, cz + 1) :: bza\nDATA_TYPE :: mui, ch\ninteger :: ix, iy, iz\n\n!$pragma scop\ndo iz = 1, _PB_CZ\ndo iy = 1, _PB_CYM\ndo ix = 1, _PB_CXM\nclf(iy, iz) = ex(ix, iy, iz) - ex(ix, iy + 1, iz) + &\ney(ix + 1, iy, iz) - ey(ix, iy, iz)\ntmp(iy, iz) = ((cymh(iy) / cyph(iy)) * bza(ix, iy, iz)) - &\n((ch / cyph(iy)) * clf(iy, iz))\nhz(ix, iy, iz) = ((cxmh(ix) / cxph(ix)) * hz(ix, iy, iz)) &\n+ ((mui * czp(iz) / cxph(ix)) * tmp(iy, iz)) &\n- ((mui * czm(iz) / cxph(ix)) * &\nbza(ix, iy, iz))\nbza(ix, iy, iz) = tmp(iy, iz)\nend do\nclf(iy, iz) = ex(_PB_CXM + 1, iy, iz) - &\nex(_PB_CXM + 1, iy + 1, iz) + &\nry(iy, iz) - ey(_PB_CXM + 1, iy, iz)\ntmp(iy, iz) = ((cymh(iy) / cyph(iy)) * &\nbza(_PB_CXM + 1, iy, iz)) - ((ch / cyph(iy)) &\n* clf(iy, iz))\nhz(_PB_CXM + 1, iy, iz) = ((cxmh(_PB_CXM + 1) / &\ncxph(_PB_CXM + 1)) * &\nhz(_PB_CXM + 1, iy, iz)) + &\n((mui * czp(iz) / &\ncxph(_PB_CXM + 1)) * &\ntmp(iy, iz)) - &\n((mui * czm(iz) / &\ncxph(_PB_CXM + 1)) * &\nbza(_PB_CXM + 1, iy, iz))\nbza(_PB_CXM + 1, iy, iz) = tmp(iy, iz)\n\ndo ix = 1, _PB_CXM\nclf(iy, iz) = ex(ix, _PB_CYM + 1, iz) - ax(ix, iz) + &\ney(ix + 1, _PB_CYM + 1, iz) - &\ney(ix, _PB_CYM + 1, iz)\ntmp(iy, iz) = ((cymh(_PB_CYM + 1) / cyph(iy)) * &\nbza(ix, iy, iz)) - ((ch / cyph(iy)) * &\nclf(iy, iz))\nhz(ix, _PB_CYM + 1, iz) = ((cxmh(ix) / cxph(ix)) * &\nhz(ix, _PB_CYM + 1, iz)) + &\n((mui * czp(iz) / cxph(ix)) * &\ntmp(iy, iz)) - &\n((mui * czm(iz) / cxph(ix)) * &\nbza(ix, _PB_CYM + 1, iz))\nbza(ix, _PB_CYM + 1, iz) = tmp(iy, iz)\nend do\nclf(iy, iz) = ex(_PB_CXM + 1, _PB_CYM + 1, iz) - &\nax(_PB_CXM + 1, iz) + ry(_PB_CYM + 1, iz) - &\ney(_PB_CXM + 1, _PB_CYM + 1, iz)\ntmp(iy, iz) = ((cymh(_PB_CYM + 1) / cyph(_PB_CYM + 1)) * &\nbza(_PB_CXM + 1, _PB_CYM + 1, iz)) - &\n((ch / cyph(_PB_CYM + 1)) * clf(iy, iz))\nhz(_PB_CXM + 1, _PB_CYM + 1, iz) = &\n((cxmh(_PB_CXM + 1) / cxph(_PB_CXM + 1)) * &\nhz(_PB_CXM + 1, _PB_CYM + 1, iz)) + &\n((mui * czp(iz) / cxph(_PB_CXM + 1)) * tmp(iy, iz)) - &\n((mui * czm(iz) / cxph(_PB_CXM + 1)) * &\nbza(_PB_CXM + 1, _PB_CYM + 1, iz))\nbza(_PB_CXM + 1, _PB_CYM + 1, iz) = tmp(iy, iz)\nend do\nend do\n\n!$pragma endscop\nend subroutine |
void print_array(int ni,\nDATA_TYPE POLYBENCH_2D(B,NI,NI,ni,ni))\n{\nint i, j;\n\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < ni; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, B[i][j]);\nif ((i * ni + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(n, b)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: b\ninteger :: n\ninteger :: i, j\ndo i = 1, n\ndo j = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) b(j, i)\nif (mod(((i - 1) * n) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void init_array (int n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++)\nA[i][j] = ((DATA_TYPE) i*(j+2) + 2) / n;\n} | subroutine init_array(n, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\ninteger :: n\ninteger :: i,j\ndo i = 1, n\ndo j = 1, n\na(j, i) = ((DBLE(i - 1) * DBLE(j + 1)) + 2.0D0) / n\nend do\nend do\nend subroutine |
void init_array(int n,\nDATA_TYPE POLYBENCH_1D(p,N,n),\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\n{\np[i] = 1.0 / n;\nfor (j = 0; j < n; j++)\nA[i][j] = 1.0 / n;\n}\n} | subroutine init_array(n, p, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n) :: p\ninteger :: n\ninteger :: i, j\ndo i = 1, n\np(i) = 1.0D0 / n\ndo j = 1, n\na(j, i) = 1.0D0 / n\nend do\nend do\nend subroutine |
void print_array(int ni, int nj,\nDATA_TYPE POLYBENCH_2D(C,NI,NJ,ni,nj))\n{\nint i, j;\n\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nj; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, C[i][j]);\nif ((i * ni + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(ni, nj, c)\nimplicit none\n\nDATA_TYPE, dimension(nj, ni) :: c\ninteger :: ni, nj\ninteger :: i, j\ndo i = 1, ni\ndo j = 1, nj\nwrite(0, DATA_PRINTF_MODIFIER) c(j, i)\nif (mod(((i - 1) * ni) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, A[i][j]);\nif ((i * n + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n}\n | subroutine print_array(n, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\ninteger :: n\ninteger :: i, j\ndo i = 1, n\ndo j = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) a(j, i)\nif (mod(((i - 1) * n) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void init_array (int n,\nDATA_TYPE *alpha,\nDATA_TYPE *beta,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n),\nDATA_TYPE POLYBENCH_1D(u1,N,n),\nDATA_TYPE POLYBENCH_1D(v1,N,n),\nDATA_TYPE POLYBENCH_1D(u2,N,n),\nDATA_TYPE POLYBENCH_1D(v2,N,n),\nDATA_TYPE POLYBENCH_1D(w,N,n),\nDATA_TYPE POLYBENCH_1D(x,N,n),\nDATA_TYPE POLYBENCH_1D(y,N,n),\nDATA_TYPE POLYBENCH_1D(z,N,n))\n{\nint i, j;\n\n*alpha = 43532;\n*beta = 12313;\n\nfor (i = 0; i < n; i++)\n{\nu1[i] = i;\nu2[i] = (i+1)/n/2.0;\nv1[i] = (i+1)/n/4.0;\nv2[i] = (i+1)/n/6.0;\ny[i] = (i+1)/n/8.0;\nz[i] = (i+1)/n/9.0;\nx[i] = 0.0;\nw[i] = 0.0;\nfor (j = 0; j < n; j++)\nA[i][j] = ((DATA_TYPE) i*j) / n;\n}\n} | subroutine init_array(n, alpha, beta, &\na, u1, u2, v1, v2, w, x, y, z)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n) :: u1\nDATA_TYPE, dimension(n) :: u2\nDATA_TYPE, dimension(n) :: v1\nDATA_TYPE, dimension(n) :: v2\nDATA_TYPE, dimension(n) :: w\nDATA_TYPE, dimension(n) :: x\nDATA_TYPE, dimension(n) :: y\nDATA_TYPE, dimension(n) :: z\nDATA_TYPE :: alpha, beta\ninteger :: n\ninteger :: i, j\nalpha = 43532.0D0\nbeta = 12313.0D0\n\ndo i = 1, n\nu1(i) = DBLE(i - 1)\nu2(i) = DBLE(i / n) / 2.0D0\nv1(i) = DBLE(i / n) / 4.0D0\nv2(i) = DBLE(i / n) / 6.0D0\ny(i) = DBLE(i / n) / 8.0D0\nz(i) = DBLE(i / n) / 9.0D0\nx(i) = 0.0D0\nw(i) = 0.0D0\ndo j = 1, n\na(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(n)\nend do\nend do\nend subroutine |
void print_array(int ni, int nj,\nDATA_TYPE POLYBENCH_2D(C,NI,NJ,ni,nj))\n{\nint i, j;\n\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nj; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, C[i][j]);\nif ((i * ni + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(ni, nj, c)\nimplicit none\n\nDATA_TYPE, dimension(nj, ni) :: c\ninteger :: ni, nj\ninteger :: i, j\ndo i = 1, ni\ndo j = 1, nj\nwrite(0, DATA_PRINTF_MODIFIER) c(j, i)\nif (mod(((i - 1) * ni) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void init_array(int ni, int nj,\nDATA_TYPE *alpha,\nDATA_TYPE *beta,\nDATA_TYPE POLYBENCH_2D(C,NI,NJ,ni,nj),\nDATA_TYPE POLYBENCH_2D(A,NJ,NJ,nj,nj),\nDATA_TYPE POLYBENCH_2D(B,NI,NJ,ni,nj))\n{\nint i, j;\n\n*alpha = 32412;\n*beta = 2123;\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nj; j++) {\nC[i][j] = ((DATA_TYPE) i*j) / ni;\nB[i][j] = ((DATA_TYPE) i*j) / ni;\n}\nfor (i = 0; i < nj; i++)\nfor (j = 0; j < nj; j++)\nA[i][j] = ((DATA_TYPE) i*j) / ni;\n} | subroutine init_array(ni, nj, alpha, beta, c, a, b)\nimplicit none\n\nDATA_TYPE, dimension(nj, nj) :: a\nDATA_TYPE, dimension(nj, ni) :: b\nDATA_TYPE, dimension(nj, ni) :: c\nDATA_TYPE :: alpha, beta\ninteger :: ni, nj\ninteger :: i, j\n\nalpha = 32412D0\nbeta = 2123D0\n\ndo i = 1, ni\ndo j = 1, nj\nc(j, i) = ((DBLE((i - 1) * (j - 1)))) / DBLE(ni)\nb(j, i) = ((DBLE((i - 1) * (j - 1)))) / DBLE(ni)\nend do\nend do\ndo i = 1, nj\ndo j = 1, nj\na(j, i) = (DBLE((i - 1) * (j - 1))) / DBLE(ni)\nend do\nend do\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_1D(x,N,n))\n\n{\nint i;\n\nfor (i = 0; i < n; i++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, x[i]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\n} | subroutine print_array(n, x)\nimplicit none\n\nDATA_TYPE, dimension(n) :: x\ninteger :: n\ninteger :: i\ndo i = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) x(i)\nif (mod((i - 1), 20) == 0) then\nwrite(0, *)\nend if\nend do\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_1D(y,N,n))\n\n{\nint i;\n\nfor (i = 0; i < n; i++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, y[i]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\n} | subroutine print_array(n, y)\nimplicit none\n\nDATA_TYPE, dimension(n) :: y\ninteger :: n\ninteger :: i\ndo i = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) y(i)\nif (mod(i - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend subroutine |
void kernel_gramschmidt(int ni, int nj,\nDATA_TYPE POLYBENCH_2D(A,NI,NJ,ni,nj),\nDATA_TYPE POLYBENCH_2D(R,NJ,NJ,nj,nj),\nDATA_TYPE POLYBENCH_2D(Q,NI,NJ,ni,nj))\n{\nint i, j, k;\n\nDATA_TYPE nrm;\n\n#pragma scop\nfor (k = 0; k < _PB_NJ; k++)\n{\nnrm = 0;\nfor (i = 0; i < _PB_NI; i++)\nnrm += A[i][k] * A[i][k];\nR[k][k] = sqrt(nrm);\nfor (i = 0; i < _PB_NI; i++)\nQ[i][k] = A[i][k] / R[k][k];\nfor (j = k + 1; j < _PB_NJ; j++)\n{\nR[k][j] = 0;\nfor (i = 0; i < _PB_NI; i++)\nR[k][j] += Q[i][k] * A[i][j];\nfor (i = 0; i < _PB_NI; i++)\nA[i][j] = A[i][j] - Q[i][k] * R[k][j];\n}\n}\n#pragma endscop\n\n} | subroutine kernel_gramschmidt(ni, nj, a, r, q)\nimplicit none\n\nDATA_TYPE, dimension(nj, ni) :: a\nDATA_TYPE, dimension(nj, nj) :: r\nDATA_TYPE, dimension(nj, ni) :: q\nDATA_TYPE :: nrm\ninteger :: ni, nj\ninteger :: i, j, k\n\n!$pragma scop\ndo k = 1, _PB_NJ\nnrm = 0.0D0\ndo i = 1, _PB_NI\nnrm = nrm + (a(k, i) * a(k, i))\nend do\nr(k, k) = sqrt(nrm)\ndo i = 1, _PB_NI\nq(k, i) = a(k, i) / r(k, k)\nend do\ndo j = k + 1, _PB_NJ\nr(j, k) = 0.0D0\ndo i = 1, _PB_NI\nr(j, k) = r(j, k) + (q(k, i) * a(j, i))\nend do\ndo i = 1, _PB_NI\na(j, i) = a(j, i) - (q(k, i) * r(j, k))\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_1D(w,N,n))\n{\nint i;\n\nfor (i = 0; i < n; i++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, w[i]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\n} | subroutine print_array(n, w)\nimplicit none\n\nDATA_TYPE, dimension(n) :: w\ninteger :: n\ninteger :: i, j\ndo i = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) w(i)\nif (mod(i - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nwrite(0, *)\nend subroutine |
void kernel_covariance(int m, int n,\nDATA_TYPE float_n,\nDATA_TYPE POLYBENCH_2D(data,M,N,m,n),\nDATA_TYPE POLYBENCH_2D(symmat,M,M,m,m),\nDATA_TYPE POLYBENCH_1D(mean,M,m))\n{\nint i, j, j1, j2;\n\n#pragma scop\n/* Determine mean of column vectors of input data matrix */\nfor (j = 0; j < _PB_M; j++)\n{\nmean[j] = 0.0;\nfor (i = 0; i < _PB_N; i++)\nmean[j] += data[i][j];\nmean[j] /= float_n;\n}\n\n/* Center the column vectors. */\nfor (i = 0; i < _PB_N; i++)\nfor (j = 0; j < _PB_M; j++)\ndata[i][j] -= mean[j];\n\n/* Calculate the m * m covariance matrix. */\nfor (j1 = 0; j1 < _PB_M; j1++)\nfor (j2 = j1; j2 < _PB_M; j2++)\n{\nsymmat[j1][j2] = 0.0;\nfor (i = 0; i < _PB_N; i++)\nsymmat[j1][j2] += data[i][j1] * data[i][j2];\nsymmat[j2][j1] = symmat[j1][j2];\n}\n#pragma endscop\n\n} | subroutine kernel_covariance(m, n, float_n, dat, symmat, mean)\nimplicit none\n\nDATA_TYPE, dimension(m, m) :: symmat\nDATA_TYPE, dimension(n, m) :: dat\nDATA_TYPE, dimension(m) :: mean\nDATA_TYPE :: float_n\ninteger :: m, n\ninteger :: i, j, j1, j2\n!$pragma scop\n! Determine mean of column vectors of input data matrix\ndo j = 1, _PB_M\nmean(j) = 0.0D0\ndo i = 1, _PB_N\nmean(j) = mean(j) + dat(j, i)\nend do\nmean(j) = mean(j) / float_n\nend do\n\n! Center the column vectors.\ndo i = 1, _PB_N\ndo j = 1, _PB_M\ndat(j, i) = dat(j, i) - mean(j)\nend do\nend do\n\n! Calculate the m * m covariance matrix.\ndo j1 = 1, _PB_M\ndo j2 = j1, _PB_M\nsymmat(j2, j1) = 0.0D0\ndo i = 1, _PB_N\nsymmat(j2, j1) = symmat(j2, j1) + (dat(j1, i) * dat(j2, i))\nend do\nsymmat(j1, j2) = symmat(j2, j1)\nend do\nend do\n!$pragma endscop\nend subroutine |
void kernel_floyd_warshall(int n,\nDATA_TYPE POLYBENCH_2D(path,N,N,n,n))\n{\nint i, j, k;\n\n#pragma scop\nfor (k = 0; k < _PB_N; k++)\n{\nfor(i = 0; i < _PB_N; i++)\nfor (j = 0; j < _PB_N; j++)\npath[i][j] = path[i][j] < path[i][k] + path[k][j] ?\npath[i][j] : path[i][k] + path[k][j];\n}\n#pragma endscop\n\n} | subroutine kernel_floyd_warshall(n, path)\nimplicit none\n\nDATA_TYPE, dimension(n,n) :: path\ninteger :: n\ninteger :: i, j, k\n\n!$pragma scop\ndo k=1, _PB_N\ndo i=1, _PB_N\ndo j=1, _PB_N\nif( path(j, i) .GE. path(k, i) + path(j, k) ) then\npath(j, i) = path(k, i) + path(j, k)\nend if\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void kernel_jacobi_1d_imper(int tsteps,\nint n,\nDATA_TYPE POLYBENCH_1D(A,N,n),\nDATA_TYPE POLYBENCH_1D(B,N,n))\n{\nint t, i, j;\n\n#pragma scop\nfor (t = 0; t < _PB_TSTEPS; t++)\n{\nfor (i = 1; i < _PB_N - 1; i++)\nB[i] = 0.33333 * (A[i-1] + A[i] + A[i + 1]);\nfor (j = 1; j < _PB_N - 1; j++)\nA[j] = B[j];\n}\n#pragma endscop\n\n} | subroutine kernel_jacobi1d(tsteps, n, a, b)\nimplicit none\n\nDATA_TYPE, dimension(n) :: a\nDATA_TYPE, dimension(n) :: b\ninteger :: n, tsteps\ninteger :: i, t, j\n!$pragma scop\ndo t = 1, _PB_TSTEPS\ndo i = 2, _PB_N - 1\nb(i) = 0.33333D0 * (a(i - 1) + a(i) + a(i + 1))\nend do\n\ndo j = 2, _PB_N -1\na(j) = b(j)\nend do\nend do\n!$pragma endscop\nend subroutine |
void print_array(DATA_TYPE out)\n{\nfprintf (stderr, DATA_PRINTF_MODIFIER, out);\nfprintf (stderr, "\n");\n} | subroutine print_array(output)\nimplicit none\n\nDATA_TYPE :: output\nwrite(0, DATA_PRINTF_MODIFIER) output\nwrite(0, *)\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_2D(path,N,N,n,n))\n\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, path[i][j]);\nif ((i * n + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(n, path)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: path\ninteger :: i, j, n\n\ndo i=1, n\ndo j=1, n\nwrite(0, DATA_PRINTF_MODIFIER) path(j,i)\n\nif (mod(((i - 1) * n) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void kernel_fdtd_2d(int tmax,\nint nx,\nint ny,\nDATA_TYPE POLYBENCH_2D(ex,NX,NY,nx,ny),\nDATA_TYPE POLYBENCH_2D(ey,NX,NY,nx,ny),\nDATA_TYPE POLYBENCH_2D(hz,NX,NY,nx,ny),\nDATA_TYPE POLYBENCH_1D(_fict_,TMAX,tmax))\n{\nint t, i, j;\n\n#pragma scop\n\nfor(t = 0; t < _PB_TMAX; t++)\n{\nfor (j = 0; j < _PB_NY; j++)\ney[0][j] = _fict_[t];\nfor (i = 1; i < _PB_NX; i++)\nfor (j = 0; j < _PB_NY; j++)\ney[i][j] = ey[i][j] - 0.5*(hz[i][j]-hz[i-1][j]);\nfor (i = 0; i < _PB_NX; i++)\nfor (j = 1; j < _PB_NY; j++)\nex[i][j] = ex[i][j] - 0.5*(hz[i][j]-hz[i][j-1]);\nfor (i = 0; i < _PB_NX - 1; i++)\nfor (j = 0; j < _PB_NY - 1; j++)\nhz[i][j] = hz[i][j] - 0.7* (ex[i][j+1] - ex[i][j] +\ney[i+1][j] - ey[i][j]);\n}\n\n#pragma endscop\n} | subroutine kernel_fdtd_2d(tmax, nx, ny, ex, ey, hz, fict)\nimplicit none\n\ninteger :: tmax, nx, ny\nDATA_TYPE, dimension(tmax) :: fict\nDATA_TYPE, dimension(ny, nx) :: ex\nDATA_TYPE, dimension(ny, nx) :: ey\nDATA_TYPE, dimension(ny, nx) :: hz\ninteger :: i, j, t\n\n!$pragma scop\ndo t = 1, _PB_TMAX\ndo j = 1, _PB_NY\ney(j, 1) = fict(t)\nend do\ndo i = 2, _PB_NX\ndo j = 1, _PB_NY\ney(j, i) = ey(j, i) - (0.5D0 * (hz(j, i) - hz(j, i - 1)))\nend do\nend do\ndo i = 1, _PB_NX\ndo j = 2, _PB_NY\nex(j, i) = ex(j, i) - (0.5D0 * (hz(j, i) - hz(j - 1, i)))\nend do\nend do\ndo i = 1, _PB_NX - 1\ndo j = 1, _PB_NY - 1\nhz(j, i) = hz(j, i) - (0.7D0 * (ex(j + 1, i) - ex(j, i) &\n+ ey(j, i + 1) - ey(j, i)))\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void init_array(int length,\nDATA_TYPE POLYBENCH_2D(c,LENGTH,LENGTH,length,length),\nDATA_TYPE POLYBENCH_2D(W,LENGTH,LENGTH,length,length))\n{\nint i, j;\nfor (i = 0; i < length; i++)\nfor (j = 0; j < length; j++) {\nc[i][j] = i*j % 2;\nW[i][j] = ((DATA_TYPE) i-j) / length;\n}\n}\n | subroutine init_array(length, c, w)\nimplicit none\n\nDATA_TYPE, dimension(length, length) :: w, c\ninteger :: i, j\ninteger length\n\ndo i = 1, length\ndo j = 1, length\nc(j, i) = mod((i-1)*(j-1), 2)\nw(j, i) = (DBLE((i - 1) - (j - 1))) / DBLE(length)\nend do\nend do\nend subroutine |
void kernel_syr2k(int ni, int nj,\nDATA_TYPE alpha,\nDATA_TYPE beta,\nDATA_TYPE POLYBENCH_2D(C,NI,NI,ni,ni),\nDATA_TYPE POLYBENCH_2D(A,NI,NJ,ni,nj),\nDATA_TYPE POLYBENCH_2D(B,NI,NJ,ni,nj))\n{\nint i, j, k;\n\n#pragma scop\n/* C := alpha*A*B' + alpha*B*A' + beta*C */\nfor (i = 0; i < _PB_NI; i++)\nfor (j = 0; j < _PB_NI; j++)\nC[i][j] *= beta;\nfor (i = 0; i < _PB_NI; i++)\nfor (j = 0; j < _PB_NI; j++)\nfor (k = 0; k < _PB_NJ; k++)\n{\nC[i][j] += alpha * A[i][k] * B[j][k];\nC[i][j] += alpha * B[i][k] * A[j][k];\n}\n#pragma endscop\n\n} | subroutine kernel_syr2k(ni, nj, alpha, beta, c, a, b)\nimplicit none\n\nDATA_TYPE, dimension(nj, ni) :: a\nDATA_TYPE, dimension(nj, ni) :: b\nDATA_TYPE, dimension(ni, ni) :: c\nDATA_TYPE :: alpha, beta\ninteger :: ni, nj\ninteger :: i, j, k\n\n!$pragma scop\ndo i = 1, _PB_NI\ndo j = 1, _PB_NI\nc(j, i) = c(j, i) * beta\nend do\nend do\ndo i = 1, _PB_NI\ndo j = 1, _PB_NI\ndo k = 1, _PB_NI\nc(j, i) = c(j, i) + (alpha * a(k, i) * b(k, j))\nc(j, i) = c(j, i) + (alpha * b(k, i) * a(k, j))\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void init_array (int nx, int ny,\nDATA_TYPE POLYBENCH_2D(A,NX,NY,nx,ny),\nDATA_TYPE POLYBENCH_1D(x,NY,ny))\n{\nint i, j;\n\nfor (i = 0; i < ny; i++)\nx[i] = i * M_PI;\nfor (i = 0; i < nx; i++)\nfor (j = 0; j < ny; j++)\nA[i][j] = ((DATA_TYPE) i*(j+1)) / nx;\n} | subroutine init_array(a, x, nx, ny)\nimplicit none\n\ndouble precision :: M_PI\nparameter(M_PI = 3.14159265358979323846D0)\nDATA_TYPE, dimension(ny, nx) :: a\nDATA_TYPE, dimension(ny) :: x\ninteger :: nx, ny\ninteger :: i, j\ndo i = 1, ny\nx(i) = DBLE(i - 1) * M_PI\ndo j = 1, ny\na(j, i) = (DBLE((i - 1) * (j))) / nx\nend do\nend do\nend subroutine |
void kernel_gemver(int n,\nDATA_TYPE alpha,\nDATA_TYPE beta,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n),\nDATA_TYPE POLYBENCH_1D(u1,N,n),\nDATA_TYPE POLYBENCH_1D(v1,N,n),\nDATA_TYPE POLYBENCH_1D(u2,N,n),\nDATA_TYPE POLYBENCH_1D(v2,N,n),\nDATA_TYPE POLYBENCH_1D(w,N,n),\nDATA_TYPE POLYBENCH_1D(x,N,n),\nDATA_TYPE POLYBENCH_1D(y,N,n),\nDATA_TYPE POLYBENCH_1D(z,N,n))\n{\nint i, j;\n\n#pragma scop\n\nfor (i = 0; i < _PB_N; i++)\nfor (j = 0; j < _PB_N; j++)\nA[i][j] = A[i][j] + u1[i] * v1[j] + u2[i] * v2[j];\n\nfor (i = 0; i < _PB_N; i++)\nfor (j = 0; j < _PB_N; j++)\nx[i] = x[i] + beta * A[j][i] * y[j];\n\nfor (i = 0; i < _PB_N; i++)\nx[i] = x[i] + z[i];\n\nfor (i = 0; i < _PB_N; i++)\nfor (j = 0; j < _PB_N; j++)\nw[i] = w[i] + alpha * A[i][j] * x[j];\n\n#pragma endscop\n} | subroutine kernel_gemver(n, alpha, beta, &\na, u1, v1, u2, v2, &\nw, x, y, z)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n) :: u1\nDATA_TYPE, dimension(n) :: u2\nDATA_TYPE, dimension(n) :: v1\nDATA_TYPE, dimension(n) :: v2\nDATA_TYPE, dimension(n) :: w\nDATA_TYPE, dimension(n) :: x\nDATA_TYPE, dimension(n) :: y\nDATA_TYPE, dimension(n) :: z\nDATA_TYPE :: alpha, beta\ninteger :: n\ninteger :: i, j\n\n!$pragma scop\ndo i = 1, _PB_N\ndo j = 1, _PB_N\na(j, i) = a(j, i) + (u1(i) * v1(j)) + (u2(i) * v2(j))\nend do\nend do\ndo i = 1, _PB_N\ndo j = 1, _PB_N\nx(i) = x(i) + (beta * a(i, j) * y(j))\nend do\nend do\ndo i = 1, _PB_N\nx(i) = x(i) + z(i)\nend do\ndo i = 1, _PB_N\ndo j = 1, _PB_N\nw(i) = w(i) + (alpha * a(j, i) * x(j))\nend do\nend do\n!$pragma endscop\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++) {\nfprintf(stderr, DATA_PRINTF_MODIFIER, A[i][j]);\nif ((i * n + j) % 20 == 0) fprintf(stderr, "\n");\n}\nfprintf(stderr, "\n");\n} | subroutine print_array(n, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\ninteger :: n\ninteger :: i, j\n\ndo i = 1, n\ndo j = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) a(j, i)\nif (mod((i - 1) * n + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void kernel_lu(int n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n{\nint i, j, k;\n\n#pragma scop\nfor (k = 0; k < _PB_N; k++)\n{\nfor (j = k + 1; j < _PB_N; j++)\nA[k][j] = A[k][j] / A[k][k];\nfor(i = k + 1; i < _PB_N; i++)\nfor (j = k + 1; j < _PB_N; j++)\nA[i][j] = A[i][j] - A[i][k] * A[k][j];\n}\n#pragma endscop\n\n} | subroutine kernel_lu(n, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\ninteger :: n\ninteger :: i, j, k\n\n!$pragma scop\ndo k = 1, _PB_N\ndo j = k + 1, _PB_N\na(j, k) = a(j, k) / a(k, k)\nend do\ndo i = k + 1, _PB_N\ndo j = k + 1, _PB_N\na(j, i) = a(j, i) - (a(k, i) * a(j, k))\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void init_array (int n,\nDATA_TYPE POLYBENCH_2D(y,N,N,n,n),\nDATA_TYPE POLYBENCH_2D(sum,N,N,n,n),\nDATA_TYPE POLYBENCH_1D(alpha,N,n),\nDATA_TYPE POLYBENCH_1D(beta,N,n),\nDATA_TYPE POLYBENCH_1D(r,N,n))\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\n{\nalpha[i] = i;\nbeta[i] = (i+1)/n/2.0;\nr[i] = (i+1)/n/4.0;\nfor (j = 0; j < n; j++) {\ny[i][j] = ((DATA_TYPE) i*j) / n;\nsum[i][j] = ((DATA_TYPE) i*j) / n;\n}\n}\n} | subroutine init_array(n, y, sumArray, alpha, beta, r)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: y\nDATA_TYPE, dimension(n, n) :: sumArray\nDATA_TYPE, dimension(n) :: beta\nDATA_TYPE, dimension(n) :: alpha\nDATA_TYPE, dimension(n) :: r\ninteger :: i, j\ninteger :: n\n\ndo i = 1, n\nalpha(i) = i\nbeta(i) = (i/n)/DBLE(2.0)\nr(i) = (i/n)/DBLE(4.0)\ndo j = 1, n\ny(j,i) = DBLE(i*j)/DBLE(n)\nsumArray(j,i) = DBLE(i*j)/DBLE(n)\nend do\nend do\nend subroutine |
void kernel_gemm(int ni, int nj, int nk,\nDATA_TYPE alpha,\nDATA_TYPE beta,\nDATA_TYPE POLYBENCH_2D(C,NI,NJ,ni,nj),\nDATA_TYPE POLYBENCH_2D(A,NI,NK,ni,nk),\nDATA_TYPE POLYBENCH_2D(B,NK,NJ,nk,nj))\n{\nint i, j, k;\n\n#pragma scop\n/* C := alpha*A*B + beta*C */\nfor (i = 0; i < _PB_NI; i++)\nfor (j = 0; j < _PB_NJ; j++)\n{\nC[i][j] *= beta;\nfor (k = 0; k < _PB_NK; ++k)\nC[i][j] += alpha * A[i][k] * B[k][j];\n}\n#pragma endscop\n\n} | subroutine kernel_gemm(ni, nj, nk, alpha, beta, c, a, b)\nimplicit none\n\nDATA_TYPE, dimension(nk, ni) :: a\nDATA_TYPE, dimension(nj, nk) :: b\nDATA_TYPE, dimension(nj, ni) :: c\nDATA_TYPE :: alpha, beta\ninteger :: ni, nj, nk\ninteger :: i, j, k\n\n!$pragma scop\ndo i = 1, _PB_NI\ndo j = 1, _PB_NJ\nc(j, i) = c(j, i) * beta\ndo k = 1, _PB_NK\nc(j, i) = c(j, i) + (alpha * a(k, i) * b(j, k))\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void print_array(int maxgrid,\nDATA_TYPE POLYBENCH_2D(path,MAXGRID,MAXGRID,maxgrid,maxgrid))\n{\nint i, j;\n\nfor (i = 0; i < maxgrid; i++)\nfor (j = 0; j < maxgrid; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, path[i][j]);\nif ((i * maxgrid + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(maxgrid, path)\nimplicit none\n\ninteger :: i, j, maxgrid\nDATA_TYPE, dimension (maxgrid, maxgrid) :: path\ndo i = 1, maxgrid\ndo j = 1, maxgrid\nwrite(0, DATA_PRINTF_MODIFIER) path(j, i)\nif (mod(((i - 1) * maxgrid) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void init_array(int ni,\nDATA_TYPE *alpha,\nDATA_TYPE POLYBENCH_2D(A,NI,NI,ni,ni),\nDATA_TYPE POLYBENCH_2D(B,NI,NI,ni,ni))\n{\nint i, j;\n\n*alpha = 32412;\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < ni; j++) {\nA[i][j] = ((DATA_TYPE) i*j) / ni;\nB[i][j] = ((DATA_TYPE) i*j) / ni;\n}\n} | subroutine init_array(n, alpha, a, b)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n, n) :: b\nDATA_TYPE :: alpha\ninteger :: n\ninteger :: i, j\n\nalpha = 32412D0\ndo i = 1, n\ndo j = 1, n\na(j, i) = (DBLE(i - 1) * DBLE(j - 1)) / DBLE(n)\nb(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(n)\nend do\nend do\nend subroutine |
void kernel_mvt(int n,\nDATA_TYPE POLYBENCH_1D(x1,N,n),\nDATA_TYPE POLYBENCH_1D(x2,N,n),\nDATA_TYPE POLYBENCH_1D(y_1,N,n),\nDATA_TYPE POLYBENCH_1D(y_2,N,n),\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n{\nint i, j;\n\n#pragma scop\nfor (i = 0; i < _PB_N; i++)\nfor (j = 0; j < _PB_N; j++)\nx1[i] = x1[i] + A[i][j] * y_1[j];\nfor (i = 0; i < _PB_N; i++)\nfor (j = 0; j < _PB_N; j++)\nx2[i] = x2[i] + A[j][i] * y_2[j];\n#pragma endscop\n\n} | subroutine kernel_mvt(n, x1, x2, y1, y2, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n) :: x1\nDATA_TYPE, dimension(n) :: y1\nDATA_TYPE, dimension(n) :: x2\nDATA_TYPE, dimension(n) :: y2\ninteger :: n\ninteger :: i, j\n\n!$pragma scop\ndo i = 1, _PB_N\ndo j = 1, _PB_N\nx1(i) = x1(i) + (a(j, i) * y1(j))\nend do\nend do\ndo i = 1, _PB_N\ndo j = 1, _PB_N\nx2(i) = x2(i) + (a(i, j) * y2(j))\nend do\nend do\n!$pragma endscop\nend subroutine |
void init_array (int nx, int ny,\nDATA_TYPE POLYBENCH_2D(A,NX,NY,nx,ny),\nDATA_TYPE POLYBENCH_1D(r,NX,nx),\nDATA_TYPE POLYBENCH_1D(p,NY,ny))\n{\nint i, j;\n\nfor (i = 0; i < ny; i++)\np[i] = i * M_PI;\nfor (i = 0; i < nx; i++) {\nr[i] = i * M_PI;\nfor (j = 0; j < ny; j++)\nA[i][j] = ((DATA_TYPE) i*(j+1))/nx;\n}\n} | subroutine init_array(nx, ny, a, r, p)\nimplicit none\n\ndouble precision :: M_PI\nparameter(M_PI = 3.14159265358979323846D0)\nDATA_TYPE, dimension(ny, nx) :: a\nDATA_TYPE, dimension(nx) :: r\nDATA_TYPE, dimension(ny) :: p\ninteger :: nx, ny\ninteger :: i, j\n\ndo i = 1, ny\np(i) = DBLE(i - 1) * M_PI\nend do\n\ndo i = 1, nx\nr(i) = DBLE(i - 1) * M_PI\ndo j = 1, ny\na(j, i) = (DBLE(i - 1) * DBLE(j)) / nx\nend do\nend do\nend subroutine |
void init_array(int ni, int nj,\nDATA_TYPE *alpha,\nDATA_TYPE *beta,\nDATA_TYPE POLYBENCH_2D(C,NI,NI,ni,ni),\nDATA_TYPE POLYBENCH_2D(A,NI,NJ,ni,nj),\nDATA_TYPE POLYBENCH_2D(B,NI,NJ,ni,nj))\n{\nint i, j;\n\n*alpha = 32412;\n*beta = 2123;\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nj; j++) {\nA[i][j] = ((DATA_TYPE) i*j) / ni;\nB[i][j] = ((DATA_TYPE) i*j) / ni;\n}\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < ni; j++)\nC[i][j] = ((DATA_TYPE) i*j) / ni;\n} | subroutine init_array(ni, nj, alpha, beta, c, a, b)\nimplicit none\n\nDATA_TYPE, dimension(nj, ni) :: a\nDATA_TYPE, dimension(nj, ni) :: b\nDATA_TYPE, dimension(ni, ni) :: c\nDATA_TYPE :: alpha, beta\ninteger :: ni, nj\ninteger :: i, j\n\nalpha = 32412.0D0\nbeta = 2123.0D0\n\ndo i = 1, ni\ndo j = 1, nj\na(j, i) = (DBLE(i - 1) * DBLE(j - 1)) / DBLE(ni)\nb(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(ni)\nend do\nend do\ndo i = 1, ni\ndo j = 1, ni\nc(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(ni)\nend do\nend do\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_1D(out,N,n))\n\n{\nint i;\n\nfor (i = 0; i < n; i++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, out[i]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\n} | subroutine print_array(n, outArray)\nimplicit none\n\nDATA_TYPE, dimension(n) :: outArray\ninteger :: n\ninteger :: i\ndo i = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) outArray(i)\nif (mod(i - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend subroutine |
void init_array(int ni, int nj, int nk, int nl,\nDATA_TYPE *alpha,\nDATA_TYPE *beta,\nDATA_TYPE POLYBENCH_2D(A,NI,NK,ni,nl),\nDATA_TYPE POLYBENCH_2D(B,NK,NJ,nk,nj),\nDATA_TYPE POLYBENCH_2D(C,NL,NJ,nl,nj),\nDATA_TYPE POLYBENCH_2D(D,NI,NL,ni,nl))\n{\nint i, j;\n\n*alpha = 32412;\n*beta = 2123;\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nk; j++)\nA[i][j] = ((DATA_TYPE) i*j) / ni;\nfor (i = 0; i < nk; i++)\nfor (j = 0; j < nj; j++)\nB[i][j] = ((DATA_TYPE) i*(j+1)) / nj;\nfor (i = 0; i < nl; i++)\nfor (j = 0; j < nj; j++)\nC[i][j] = ((DATA_TYPE) i*(j+3)) / nl;\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nl; j++)\nD[i][j] = ((DATA_TYPE) i*(j+2)) / nk;\n} | subroutine init_array(alpha, beta, a, b, c ,d, ni, nj, &\nnk, nl)\nimplicit none\n\nDATA_TYPE, dimension(nk, ni) :: a\nDATA_TYPE, dimension(nj, nk) :: b\nDATA_TYPE, dimension(nl, nj) :: c\nDATA_TYPE, dimension(nl, ni) :: d\nDATA_TYPE :: alpha, beta\ninteger :: ni, nj, nk, nl\ninteger :: i, j\n\nalpha = 32412;\nbeta = 2123;\n\ndo i = 1, ni\ndo j = 1, nk\na(j,i) = DBLE((i-1) * (j-1)) / ni\nend do\nend do\n\ndo i = 1, nk\ndo j = 1, nj\nb(j,i) = (DBLE((i-1) * (j)))/ nj\nend do\nend do\n\ndo i = 1, nl\ndo j = 1, nj\nc(j,i) = (DBLE(i-1) * (j+2))/ nl\nend do\nend do\n\ndo i = 1, ni\ndo j = 1, nl\nd(j,i) = (DBLE(i-1) * (j+1))/ nk\nend do\nend do\nend subroutine |
void kernel_dynprog(int tsteps, int length,\nDATA_TYPE POLYBENCH_2D(c,LENGTH,LENGTH,length,length),\nDATA_TYPE POLYBENCH_2D(W,LENGTH,LENGTH,length,length),\nDATA_TYPE POLYBENCH_3D(sum_c,LENGTH,LENGTH,LENGTH,length,length,length),\nDATA_TYPE *out)\n{\nint iter, i, j, k;\n\nDATA_TYPE out_l = 0;\n\n#pragma scop\nfor (iter = 0; iter < _PB_TSTEPS; iter++)\n{\nfor (i = 0; i <= _PB_LENGTH - 1; i++)\nfor (j = 0; j <= _PB_LENGTH - 1; j++)\nc[i][j] = 0;\n\nfor (i = 0; i <= _PB_LENGTH - 2; i++)\n{\nfor (j = i + 1; j <= _PB_LENGTH - 1; j++)\n{\nsum_c[i][j][i] = 0;\nfor (k = i + 1; k <= j-1; k++)\nsum_c[i][j][k] = sum_c[i][j][k - 1] + c[i][k] + c[k][j];\nc[i][j] = sum_c[i][j][j-1] + W[i][j];\n}\n}\nout_l += c[0][_PB_LENGTH - 1];\n}\n#pragma endscop\n\n*out = out_l;\n} | subroutine kernel_dynprog(tsteps , length, c, w, sumC, output)\nimplicit none\n\nDATA_TYPE, dimension(length, length) :: w, c\nDATA_TYPE, dimension(length, length, length) :: sumC\ninteger :: i, j, iter, k\ninteger :: length, tsteps\nDATA_TYPE :: output\n\n!$pragma scop\noutput = 0\n\ndo iter = 1, _PB_TSTEPS\ndo i = 1, _PB_LENGTH\ndo j = 1, _PB_LENGTH\nc(j, i) = 0\nend do\nend do\n\ndo i = 1, _PB_LENGTH - 1\ndo j = i + 1, _PB_LENGTH\nsumC(i, j, i) = 0\ndo k = i + 1, j - 1\nsumC(k, j, i) = sumC(k - 1, j, i) + c(k, i) + c(j, k)\nend do\nc(j, i) = sumC(j - 1, j, i) + w(j, i)\nend do\nend do\noutput = output + c(_PB_LENGTH, 1)\nend do\n!$pragma endscop\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_1D(x1,N,n),\nDATA_TYPE POLYBENCH_1D(x2,N,n))\n\n{\nint i;\n\nfor (i = 0; i < n; i++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, x1[i]);\nfprintf (stderr, DATA_PRINTF_MODIFIER, x2[i]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\n} | subroutine print_array(n, x1, x2)\nimplicit none\n\nDATA_TYPE, dimension(n) :: x1\nDATA_TYPE, dimension(n) :: x2\ninteger :: n\ninteger :: i\ndo i = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) x1(i)\nwrite(0, DATA_PRINTF_MODIFIER) x2(i)\nif (mod((i - 1), 20) == 0) then\nwrite(0, *)\nend if\nend do\nwrite(0, *)\nend subroutine |
void init_array (int n,\nDATA_TYPE POLYBENCH_2D(path,N,N,n,n))\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++)\npath[i][j] = ((DATA_TYPE) (i+1)*(j+1)) / n;\n} | subroutine init_array(n, path)\nimplicit none\n\nDATA_TYPE, dimension(n,n) :: path\ninteger :: i, j, n\n\ndo i=1, n\ndo j=1, n\npath(j, i) = (DBLE(i * j))/ DBLE(n)\nend do\nend do\nend subroutine |
void init_array(int maxgrid,\nDATA_TYPE POLYBENCH_2D(sum_tang,MAXGRID,MAXGRID,maxgrid,maxgrid),\nDATA_TYPE POLYBENCH_2D(mean,MAXGRID,MAXGRID,maxgrid,maxgrid),\nDATA_TYPE POLYBENCH_2D(path,MAXGRID,MAXGRID,maxgrid,maxgrid))\n{\nint i, j;\n\nfor (i = 0; i < maxgrid; i++)\nfor (j = 0; j < maxgrid; j++) {\nsum_tang[i][j] = (DATA_TYPE)((i+1)*(j+1));\nmean[i][j] = ((DATA_TYPE) i-j) / maxgrid;\npath[i][j] = ((DATA_TYPE) i*(j-1)) / maxgrid;\n}\n} | subroutine init_array(maxgrid, sumTang, mean, path)\nimplicit none\n\ninteger :: maxgrid\nDATA_TYPE, dimension (maxgrid, maxgrid) :: sumTang, mean, path\ninteger :: i, j\ndo i = 1, maxgrid\ndo j = 1, maxgrid\nsumTang(j, i) = i * j\nmean(j, i) = ( i - j ) / (maxgrid)\npath(j, i) = (( i - 1 ) * ( j - 2 )) / (maxgrid)\nend do\nend do\nend subroutine |
void kernel_3mm(int ni, int nj, int nk, int nl, int nm,\nDATA_TYPE POLYBENCH_2D(E,NI,NJ,ni,nj),\nDATA_TYPE POLYBENCH_2D(A,NI,NK,ni,nk),\nDATA_TYPE POLYBENCH_2D(B,NK,NJ,nk,nj),\nDATA_TYPE POLYBENCH_2D(F,NJ,NL,nj,nl),\nDATA_TYPE POLYBENCH_2D(C,NJ,NM,nj,nm),\nDATA_TYPE POLYBENCH_2D(D,NM,NL,nm,nl),\nDATA_TYPE POLYBENCH_2D(G,NI,NL,ni,nl))\n{\nint i, j, k;\n\n#pragma scop\n/* E := A*B */\nfor (i = 0; i < _PB_NI; i++)\nfor (j = 0; j < _PB_NJ; j++)\n{\nE[i][j] = 0;\nfor (k = 0; k < _PB_NK; ++k)\nE[i][j] += A[i][k] * B[k][j];\n}\n/* F := C*D */\nfor (i = 0; i < _PB_NJ; i++)\nfor (j = 0; j < _PB_NL; j++)\n{\nF[i][j] = 0;\nfor (k = 0; k < _PB_NM; ++k)\nF[i][j] += C[i][k] * D[k][j];\n}\n/* G := E*F */\nfor (i = 0; i < _PB_NI; i++)\nfor (j = 0; j < _PB_NL; j++)\n{\nG[i][j] = 0;\nfor (k = 0; k < _PB_NJ; ++k)\nG[i][j] += E[i][k] * F[k][j];\n}\n#pragma endscop\n\n} | subroutine kernel_3mm(ni, nj, nk, nl, nm, e, a, b, f, c, d, g)\nimplicit none\n\nDATA_TYPE, dimension(nk, ni) :: a\nDATA_TYPE, dimension(nj, nk) :: b\nDATA_TYPE, dimension(nm, nj) :: c\nDATA_TYPE, dimension(nl, nm) :: d\nDATA_TYPE, dimension(nj, ni) :: e\nDATA_TYPE, dimension(nl, nj) :: f\nDATA_TYPE, dimension(nl, ni) :: g\ninteger :: ni, nj, nk, nl, nm\ninteger :: i, j, k\n\n!$pragma scop\n! E := A*B\ndo i = 1, _PB_NI\ndo j = 1, _PB_NJ\ne(j,i) = 0.0\ndo k = 1, _PB_NK\ne(j,i) = e(j,i) + a(k,i) * b(j,k)\nend do\nend do\nend do\n\n! F := C*D\ndo i = 1, _PB_NJ\ndo j = 1, _PB_NL\nf(j,i) = 0.0\ndo k = 1, _PB_NM\nf(j,i) = f(j,i) + c(k,i) * d(j,k)\nend do\nend do\nend do\n\n! G := E*F\ndo i = 1, _PB_NI\ndo j = 1, _PB_NL\ng(j,i) = 0.0\ndo k = 1, _PB_NJ\ng(j,i) = g(j,i) + e(k,i) * f(j,k)\nend do\nend do\nend do\n!$pragma endscop\n\nend subroutine |
void kernel_adi(int tsteps,\nint n,\nDATA_TYPE POLYBENCH_2D(X,N,N,n,n),\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n),\nDATA_TYPE POLYBENCH_2D(B,N,N,n,n))\n{\nint t, i1, i2;\n\n#pragma scop\nfor (t = 0; t < _PB_TSTEPS; t++)\n{\nfor (i1 = 0; i1 < _PB_N; i1++)\nfor (i2 = 1; i2 < _PB_N; i2++)\n{\nX[i1][i2] = X[i1][i2] - X[i1][i2-1] * A[i1][i2] / B[i1][i2-1];\nB[i1][i2] = B[i1][i2] - A[i1][i2] * A[i1][i2] / B[i1][i2-1];\n}\n\nfor (i1 = 0; i1 < _PB_N; i1++)\nX[i1][_PB_N-1] = X[i1][_PB_N-1] / B[i1][_PB_N-1];\n\nfor (i1 = 0; i1 < _PB_N; i1++)\nfor (i2 = 0; i2 < _PB_N-2; i2++)\nX[i1][_PB_N-i2-2] = (X[i1][_PB_N-2-i2] - X[i1][_PB_N-2-i2-1] * A[i1][_PB_N-i2-3]) / B[i1][_PB_N-3-i2];\n\nfor (i1 = 1; i1 < _PB_N; i1++)\nfor (i2 = 0; i2 < _PB_N; i2++) {\nX[i1][i2] = X[i1][i2] - X[i1-1][i2] * A[i1][i2] / B[i1-1][i2];\nB[i1][i2] = B[i1][i2] - A[i1][i2] * A[i1][i2] / B[i1-1][i2];\n}\n\nfor (i2 = 0; i2 < _PB_N; i2++)\nX[_PB_N-1][i2] = X[_PB_N-1][i2] / B[_PB_N-1][i2];\n\nfor (i1 = 0; i1 < _PB_N-2; i1++)\nfor (i2 = 0; i2 < _PB_N; i2++)\nX[_PB_N-2-i1][i2] = (X[_PB_N-2-i1][i2] - X[_PB_N-i1-3][i2] * A[_PB_N-3-i1][i2]) / B[_PB_N-2-i1][i2];\n}\n#pragma endscop\n\n} | subroutine kernel_adi(tsteps, n, x, a, b)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n, n) :: x\nDATA_TYPE, dimension(n, n) :: b\ninteger :: n, tsteps\ninteger :: i1, i2, t\n\n!$pragma scop\ndo t = 1, _PB_TSTEPS\ndo i1 = 1, _PB_N\ndo i2 = 2, _PB_N\nx(i2, i1) = x(i2, i1) - ((x(i2 - 1, i1) * a(i2, i1)) / &\nb(i2 - 1, i1))\nb(i2, i1) = b(i2, i1) - ((a(i2, i1) * a(i2, i1)) / &\nb(i2 - 1, i1))\nend do\nend do\n\ndo i1 = 1, _PB_N\nx(_PB_N, i1) = x(_PB_N, i1) / b(_PB_N, i1)\nend do\n\ndo i1 = 1, _PB_N\ndo i2 = 1, _PB_N - 2\nx(_PB_N - i2, i1) = (x(_PB_N - i2, i1) - &\n(x(_PB_N - i2 - 1, i1) * &\na(_PB_N - i2 - 1, i1))) / &\nb(_PB_N - i2 - 1, i1)\nend do\nend do\n\ndo i1 = 2, _PB_N\ndo i2 = 1, _PB_N\nx(i2, i1) = x(i2, i1) - x(i2, i1 - 1) * a(i2, i1) / &\nb(i2, i1 - 1)\nb(i2, i1) = b(i2, i1) - a(i2, i1) * a(i2, i1) / &\nb(i2, i1 - 1)\n\nend do\nend do\n\ndo i2 = 1, _PB_N\nx(i2, _PB_N) = x(i2, _PB_N) / b(i2, _PB_N)\nend do\n\ndo i1 = 1, _PB_N - 2\ndo i2 = 1, _PB_N\nx(i2, _PB_N - i1) = (x(i2, _PB_N - i1) - &\nx(i2, _PB_N - i1 - 1) * &\na(i2, _PB_N - i1 - 1)) / &\nb(i2, _PB_N - i1)\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void init_array (int n,\nDATA_TYPE POLYBENCH_2D(A,N+1,N+1,n+1,n+1),\nDATA_TYPE POLYBENCH_1D(b,N+1,n+1),\nDATA_TYPE POLYBENCH_1D(x,N+1,n+1),\nDATA_TYPE POLYBENCH_1D(y,N+1,n+1))\n{\nint i, j;\n\nfor (i = 0; i <= n; i++)\n{\nx[i] = i + 1;\ny[i] = (i+1)/n/2.0 + 1;\nb[i] = (i+1)/n/2.0 + 42;\nfor (j = 0; j <= n; j++) {\nA[i][j] = ((DATA_TYPE) (i+1)*(j+1)) / n;\n}\n}\n} | subroutine init_array(n, a, b, x, y)\nimplicit none\n\nDATA_TYPE, dimension(n + 1, n + 1) :: a\nDATA_TYPE, dimension(n + 1) :: x\nDATA_TYPE, dimension(n + 1) :: b\nDATA_TYPE, dimension(n + 1) :: y\ninteger :: n\ninteger :: i, j\n\ndo i = 1, n + 1\nx(i) = DBLE(i)\ny(i) = (i/n/2.0D0) + 1.0D0\nb(i) = (i/n/2.0D0) + 42.0D0\ndo j = 1, n + 1\na(j, i) = (DBLE(i) * DBLE(j)) / DBLE(n)\nend do\nend do\nend subroutine |
void init_array(int ni, int nj, int nk,\nDATA_TYPE *alpha,\nDATA_TYPE *beta,\nDATA_TYPE POLYBENCH_2D(C,NI,NJ,ni,nj),\nDATA_TYPE POLYBENCH_2D(A,NI,NK,ni,nk),\nDATA_TYPE POLYBENCH_2D(B,NK,NJ,nk,nj))\n{\nint i, j;\n\n*alpha = 32412;\n*beta = 2123;\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nj; j++)\nC[i][j] = ((DATA_TYPE) i*j) / ni;\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nk; j++)\nA[i][j] = ((DATA_TYPE) i*j) / ni;\nfor (i = 0; i < nk; i++)\nfor (j = 0; j < nj; j++)\nB[i][j] = ((DATA_TYPE) i*j) / ni;\n} | subroutine init_array(ni, nj, nk, alpha, beta, c, a, b)\nimplicit none\n\nDATA_TYPE, dimension(nk, ni) :: a\nDATA_TYPE, dimension(nj, nk) :: b\nDATA_TYPE, dimension(nj, ni) :: c\nDATA_TYPE :: alpha, beta\ninteger :: ni, nj, nk\ninteger :: i, j\n\nalpha = 32412\nbeta = 2123\n\ndo i = 1, ni\ndo j = 1, nj\nc(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(ni)\nend do\nend do\ndo i = 1, ni\ndo j = 1, nk\na(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(ni)\nend do\nend do\ndo i = 1, nk\ndo j = 1, nj\nb(j, i) = ((DBLE(i - 1) * DBLE(j - 1))) / DBLE(ni)\nend do\nend do\nend subroutine |
void kernel_symm(int ni, int nj,\nDATA_TYPE alpha,\nDATA_TYPE beta,\nDATA_TYPE POLYBENCH_2D(C,NI,NJ,ni,nj),\nDATA_TYPE POLYBENCH_2D(A,NJ,NJ,nj,nj),\nDATA_TYPE POLYBENCH_2D(B,NI,NJ,ni,nj))\n{\nint i, j, k;\nDATA_TYPE acc;\n\n#pragma scop\n/* C := alpha*A*B + beta*C, A is symetric */\nfor (i = 0; i < _PB_NI; i++)\nfor (j = 0; j < _PB_NJ; j++)\n{\nacc = 0;\nfor (k = 0; k < j - 1; k++)\n{\nC[k][j] += alpha * A[k][i] * B[i][j];\nacc += B[k][j] * A[k][i];\n}\nC[i][j] = beta * C[i][j] + alpha * A[i][i] * B[i][j] + alpha * acc;\n}\n#pragma endscop\n\n} | subroutine kernel_symm(ni, nj, alpha, beta, c, a, b)\nimplicit none\n\nDATA_TYPE, dimension(nj, nj) :: a\nDATA_TYPE, dimension(nj, ni) :: b\nDATA_TYPE, dimension(nj, ni) :: c\nDATA_TYPE :: alpha, beta\nDATA_TYPE :: acc\ninteger :: ni, nj\ninteger :: i, j, k\n\n!$pragma scop\ndo i = 1, _PB_NI\ndo j = 1, _PB_NJ\nacc = 0.0D0\ndo k = 1, j - 2\nc(j, k) = c(j, k) + (alpha * a(i, k) * b(j, i))\nacc = acc + (b(j, k) * a(i, k))\nend do\nc(j, i) = (beta * c(j, i)) + (alpha * a(i, i) * b(j, i)) + &\n(alpha * acc)\nend do\nend do\n!$pragma endscop\nend subroutine |
void kernel_atax(int nx, int ny,\nDATA_TYPE POLYBENCH_2D(A,NX,NY,nx,ny),\nDATA_TYPE POLYBENCH_1D(x,NY,ny),\nDATA_TYPE POLYBENCH_1D(y,NY,ny),\nDATA_TYPE POLYBENCH_1D(tmp,NX,nx))\n{\nint i, j;\n\n#pragma scop\nfor (i = 0; i < _PB_NY; i++)\ny[i] = 0;\nfor (i = 0; i < _PB_NX; i++)\n{\ntmp[i] = 0;\nfor (j = 0; j < _PB_NY; j++)\ntmp[i] = tmp[i] + A[i][j] * x[j];\nfor (j = 0; j < _PB_NY; j++)\ny[j] = y[j] + A[i][j] * tmp[i];\n}\n#pragma endscop\n\n} | subroutine kernel_atax(nx, ny, a, x, y, tmp)\nimplicit none\n\nDATA_TYPE, dimension(ny, nx) :: a\nDATA_TYPE, dimension(ny) :: x\nDATA_TYPE, dimension(ny) :: y\nDATA_TYPE, dimension(nx) :: tmp\ninteger nx, ny, i, j\n\n!$pragma scop\ndo i = 1, _PB_NY\ny(i) = 0.0D0\nend do\n\ndo i = 1, _PB_NX\ntmp(i) = 0.0D0\ndo j = 1, _PB_NY\ntmp(i) = tmp(i) + (a(j, i) * x(j))\nend do\ndo j = 1, _PB_NY\ny(j) = y(j) + a(j, i) * tmp(i)\nend do\nend do\n!$pragma endscop\nend subroutine |
void init_array(int n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n),\nDATA_TYPE POLYBENCH_1D(x,N,n),\nDATA_TYPE POLYBENCH_1D(c,N,n))\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\n{\nc[i] = x[i] = ((DATA_TYPE) i) / n;\nfor (j = 0; j < n; j++)\nA[i][j] = ((DATA_TYPE) i*j) / n;\n}\n} | subroutine init_array(n, a, x, c)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n) :: c\nDATA_TYPE, dimension(n) :: x\ninteger :: n\ninteger :: i, j\ndo i = 1, n\nc(i) = DBLE(i - 1) / DBLE(n)\nx(i) = DBLE(i - 1) / DBLE(n)\ndo j = 1, n\na(j, i) = (DBLE(i - 1) * DBLE(j - 1)) / DBLE(n)\nend do\nend do\nend subroutine |
void print_array(int nx,\nDATA_TYPE POLYBENCH_1D(y,NX,nx))\n\n{\nint i;\n\nfor (i = 0; i < nx; i++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, y[i]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(y, ny)\nimplicit none\n\nDATA_TYPE, dimension(ny) :: y\ninteger :: ny\ninteger :: i\ndo i = 1, ny\nwrite(0, DATA_PRINTF_MODIFIER) y(i)\nif (mod(i - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nwrite(0, *)\nend subroutine |
void init_array(int nr, int nq, int np,\nDATA_TYPE POLYBENCH_3D(A,NR,NQ,NP,nr,nq,np),\nDATA_TYPE POLYBENCH_2D(C4,NP,NP,np,np))\n{\nint i, j, k;\n\nfor (i = 0; i < nr; i++)\nfor (j = 0; j < nq; j++)\nfor (k = 0; k < np; k++)\nA[i][j][k] = ((DATA_TYPE) i*j + k) / np;\nfor (i = 0; i < np; i++)\nfor (j = 0; j < np; j++)\nC4[i][j] = ((DATA_TYPE) i*j) / np;\n} | subroutine init_array(nr, nq, np, a, cFour)\nimplicit none\n\nDATA_TYPE, dimension(np, nq, nr) :: a\nDATA_TYPE, dimension(np, np) :: cFour\ninteger :: nr, nq, np\ninteger :: i, j, k\n\ndo i = 1, nr\ndo j = 1, nq\ndo k = 1, np\na(k, j, i) = ((DBLE(i - 1) * DBLE(j - 1)) + DBLE(k - 1)) / &\nDBLE(np)\nend do\nend do\nend do\ndo i = 1, np\ndo j = 1, np\ncFour(j, i) = (DBLE(i - 1) * DBLE(j - 1)) / np\nend do\nend do\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, A[i][j]);\nif ((i * N + j) % 20 == 0) fprintf (stderr, "\n");\n}\n} | subroutine print_array(n, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\ninteger :: n\ninteger :: i, j\ndo i = 1, n\ndo j = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) a(j, i)\nif (mod(((i - 1) * n) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nend subroutine |
void kernel_reg_detect(int niter, int maxgrid, int length,\nDATA_TYPE POLYBENCH_2D(sum_tang,MAXGRID,MAXGRID,maxgrid,maxgrid),\nDATA_TYPE POLYBENCH_2D(mean,MAXGRID,MAXGRID,maxgrid,maxgrid),\nDATA_TYPE POLYBENCH_2D(path,MAXGRID,MAXGRID,maxgrid,maxgrid),\nDATA_TYPE POLYBENCH_3D(diff,MAXGRID,MAXGRID,LENGTH,maxgrid,maxgrid,length),\nDATA_TYPE POLYBENCH_3D(sum_diff,MAXGRID,MAXGRID,LENGTH,maxgrid,maxgrid,length))\n{\nint t, i, j, cnt;\n\n#pragma scop\nfor (t = 0; t < _PB_NITER; t++)\n{\nfor (j = 0; j <= _PB_MAXGRID - 1; j++)\nfor (i = j; i <= _PB_MAXGRID - 1; i++)\nfor (cnt = 0; cnt <= _PB_LENGTH - 1; cnt++)\ndiff[j][i][cnt] = sum_tang[j][i];\n\nfor (j = 0; j <= _PB_MAXGRID - 1; j++)\n{\nfor (i = j; i <= _PB_MAXGRID - 1; i++)\n{\nsum_diff[j][i][0] = diff[j][i][0];\nfor (cnt = 1; cnt <= _PB_LENGTH - 1; cnt++)\nsum_diff[j][i][cnt] = sum_diff[j][i][cnt - 1] + diff[j][i][cnt];\nmean[j][i] = sum_diff[j][i][_PB_LENGTH - 1];\n}\n}\n\nfor (i = 0; i <= _PB_MAXGRID - 1; i++)\npath[0][i] = mean[0][i];\n\nfor (j = 1; j <= _PB_MAXGRID - 1; j++)\nfor (i = j; i <= _PB_MAXGRID - 1; i++)\npath[j][i] = path[j - 1][i - 1] + mean[j][i];\n}\n#pragma endscop\n\n} | subroutine kernel_reg_detect(niter, maxgrid, length, &\nsumTang, mean, path, diff, sumDiff)\nimplicit none\n\ninteger :: maxgrid, niter, length\nDATA_TYPE, dimension (maxgrid, maxgrid) :: sumTang, mean, path\nDATA_TYPE, dimension (length, maxgrid, maxgrid) :: sumDiff, diff\ninteger :: i, j, t, cnt\n\n!$pragma scop\ndo t = 1, _PB_NITER\ndo j = 1, _PB_MAXGRID\ndo i = j, _PB_MAXGRID\ndo cnt = 1, _PB_LENGTH\ndiff(cnt, i, j) = sumTang(i, j)\nend do\nend do\nend do\n\ndo j = 1, _PB_MAXGRID\ndo i = j, _PB_MAXGRID\nsumDiff(1, i, j) = diff(1, i, j)\ndo cnt = 2, _PB_LENGTH\nsumDiff(cnt, i, j) = sumDiff(cnt - 1, i, j) + &\ndiff(cnt, i, j)\nend do\nmean(i, j) = sumDiff(_PB_LENGTH, i, j)\nend do\nend do\n\ndo i = 1, _PB_MAXGRID\npath(i, 1) = mean(i, 1)\nend do\n\ndo j = 2, _PB_MAXGRID\ndo i = j, _PB_MAXGRID\npath(i, j) = path(i - 1, j - 1) + mean(i, j)\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void init_array (int n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n),\nDATA_TYPE POLYBENCH_2D(B,N,N,n,n))\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++)\n{\nA[i][j] = ((DATA_TYPE) i*(j+2) + 2) / n;\nB[i][j] = ((DATA_TYPE) i*(j+3) + 3) / n;\n}\n} | subroutine init_array(n, a, b)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n, n) :: b\ninteger :: n\ninteger :: i, j\n\ndo i = 1, n\ndo j = 1, n\na(j, i) = (DBLE(i - 1) * DBLE(j + 1) + 2.0D0) / n\nb(j, i) = (DBLE(i - 1) * DBLE(j + 2) + 3.0D0) / n\nend do\nend do\nend subroutine |
void kernel_correlation(int m, int n,\nDATA_TYPE float_n,\nDATA_TYPE POLYBENCH_2D(data,M,N,m,n),\nDATA_TYPE POLYBENCH_2D(symmat,M,M,m,m),\nDATA_TYPE POLYBENCH_1D(mean,M,m),\nDATA_TYPE POLYBENCH_1D(stddev,M,m))\n{\nint i, j, j1, j2;\n\nDATA_TYPE eps = 0.1f;\n\n#define sqrt_of_array_cell(x,j) sqrt(x[j])\n\n#pragma scop\n/* Determine mean of column vectors of input data matrix */\nfor (j = 0; j < _PB_M; j++)\n{\nmean[j] = 0.0;\nfor (i = 0; i < _PB_N; i++)\nmean[j] += data[i][j];\nmean[j] /= float_n;\n}\n\n/* Determine standard deviations of column vectors of data matrix. */\nfor (j = 0; j < _PB_M; j++)\n{\nstddev[j] = 0.0;\nfor (i = 0; i < _PB_N; i++)\nstddev[j] += (data[i][j] - mean[j]) * (data[i][j] - mean[j]);\nstddev[j] /= float_n;\nstddev[j] = sqrt_of_array_cell(stddev, j);\n/* The following in an inelegant but usual way to handle\nnear-zero std. dev. values, which below would cause a zero-\ndivide. */\nstddev[j] = stddev[j] <= eps ? 1.0 : stddev[j];\n}\n\n/* Center and reduce the column vectors. */\nfor (i = 0; i < _PB_N; i++)\nfor (j = 0; j < _PB_M; j++)\n{\ndata[i][j] -= mean[j];\ndata[i][j] /= sqrt(float_n) * stddev[j];\n}\n\n/* Calculate the m * m correlation matrix. */\nfor (j1 = 0; j1 < _PB_M-1; j1++)\n{\nsymmat[j1][j1] = 1.0;\nfor (j2 = j1+1; j2 < _PB_M; j2++)\n{\nsymmat[j1][j2] = 0.0;\nfor (i = 0; i < _PB_N; i++)\nsymmat[j1][j2] += (data[i][j1] * data[i][j2]);\nsymmat[j2][j1] = symmat[j1][j2];\n}\n}\nsymmat[_PB_M-1][_PB_M-1] = 1.0;\n#pragma endscop\n\n} | subroutine kernel_correlation(m, n, float_n, dat, symmat, &\nmean, stddev)\nimplicit none\n\nDATA_TYPE, dimension(n,m) :: dat\nDATA_TYPE, dimension(m,m) :: symmat\nDATA_TYPE, dimension(m) :: stddev\nDATA_TYPE, dimension(m) :: mean\nDATA_TYPE :: float_n, EPS\ninteger :: m, n\ninteger :: i, j, j1, j2\n\nEPS = 0.1D0\n!$pragma scop\n! Determine mean of column vectors of input data matrix\ndo j = 1, _PB_M\nmean(j) = 0.0D0\ndo i = 1, _PB_N\nmean(j) = mean(j) + dat(j, i)\nend do\nmean(j) = mean(j) / float_n\nend do\n\n! Determine standard deviations of column vectors of data matrix.\ndo j = 1, _PB_M\nstddev(j) = 0.0D0\ndo i = 1, _PB_N\nstddev(j) = stddev(j) + (dat(j, i) - mean(j)) * (dat(j, i) - &\nmean(j))\nend do\nstddev(j) = stddev(j) / float_n\nstddev(j) = sqrt(stddev(j))\nif (stddev(j) <= EPS) then\nstddev(j) = 1.0D0\nendif\nend do\n\n! Center and reduce the column vectors.\ndo i = 1, _PB_N\ndo j = 1, _PB_M\ndat(j, i) = dat(j, i) - mean(j)\ndat(j, i) = dat(j, i) / (sqrt(float_n) * stddev(j))\nend do\nend do\n\n! Calculate the m * m correlation matrix.\ndo j1 = 1, _PB_M - 1\nsymmat(j1, j1) = 1.0D0\ndo j2 = j1 + 1, _PB_M\nsymmat(j2, j1) = 0.0D0\ndo i = 1, _PB_N\nsymmat(j2, j1) = symmat(j2, j1) + (dat(j1, i) * dat(j2, i))\nend do\nsymmat(j1, j2) = symmat(j2, j1)\nend do\nend do\nsymmat(_PB_M, _PB_M) = 1.0D0\n!$pragma endscop\nend subroutine |
void print_array(int ni, int nl,\nDATA_TYPE POLYBENCH_2D(G,NI,NL,ni,nl))\n{\nint i, j;\n\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nl; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, G[i][j]);\nif ((i * ni + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(ni, nl, g)\nimplicit none\n\nDATA_TYPE, dimension(nl, ni) :: g\ninteger :: ni, nl\ninteger :: i, j\ndo i = 1, ni\ndo j = 1, nl\nwrite(0, DATA_PRINTF_MODIFIER) g(j,i)\nif (mod(((i - 1) * ni) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void kernel_gesummv(int n,\nDATA_TYPE alpha,\nDATA_TYPE beta,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n),\nDATA_TYPE POLYBENCH_2D(B,N,N,n,n),\nDATA_TYPE POLYBENCH_1D(tmp,N,n),\nDATA_TYPE POLYBENCH_1D(x,N,n),\nDATA_TYPE POLYBENCH_1D(y,N,n))\n{\nint i, j;\n\n#pragma scop\nfor (i = 0; i < _PB_N; i++)\n{\ntmp[i] = 0;\ny[i] = 0;\nfor (j = 0; j < _PB_N; j++)\n{\ntmp[i] = A[i][j] * x[j] + tmp[i];\ny[i] = B[i][j] * x[j] + y[i];\n}\ny[i] = alpha * tmp[i] + beta * y[i];\n}\n#pragma endscop\n\n} | subroutine kernel_gesummv(n, alpha, beta, &\na, b, tmp, x, y)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n, n) :: b\nDATA_TYPE, dimension(n) :: x, y, tmp\nDATA_TYPE :: alpha, beta\ninteger :: n\ninteger :: i, j\n\n!$pragma scop\ndo i = 1, _PB_N\ntmp(i) = 0.0D0\ny(i) = 0.0D0\ndo j = 1, _PB_N\ntmp(i) = (a(j, i) * x(j)) + tmp(i)\ny(i) = (b(j, i) * x(j)) + y(i)\nend do\ny(i) = (alpha * tmp(i)) + (beta * y(i))\nend do\n!$pragma endscop\nend subroutine |
void kernel_ludcmp(int n,\nDATA_TYPE POLYBENCH_2D(A,N+1,N+1,n+1,n+1),\nDATA_TYPE POLYBENCH_1D(b,N+1,n+1),\nDATA_TYPE POLYBENCH_1D(x,N+1,n+1),\nDATA_TYPE POLYBENCH_1D(y,N+1,n+1))\n{\nint i, j, k;\n\nDATA_TYPE w;\n\n#pragma scop\nb[0] = 1.0;\nfor (i = 0; i < _PB_N; i++)\n{\nfor (j = i+1; j <= _PB_N; j++)\n{\nw = A[j][i];\nfor (k = 0; k < i; k++)\nw = w- A[j][k] * A[k][i];\nA[j][i] = w / A[i][i];\n}\nfor (j = i+1; j <= _PB_N; j++)\n{\nw = A[i+1][j];\nfor (k = 0; k <= i; k++)\nw = w - A[i+1][k] * A[k][j];\nA[i+1][j] = w;\n}\n}\ny[0] = b[0];\nfor (i = 1; i <= _PB_N; i++)\n{\nw = b[i];\nfor (j = 0; j < i; j++)\nw = w - A[i][j] * y[j];\ny[i] = w;\n}\nx[_PB_N] = y[_PB_N] / A[_PB_N][_PB_N];\nfor (i = 0; i <= _PB_N - 1; i++)\n{\nw = y[_PB_N - 1 - (i)];\nfor (j = _PB_N - i; j <= _PB_N; j++)\nw = w - A[_PB_N - 1 - i][j] * x[j];\nx[_PB_N - 1 - i] = w / A[_PB_N - 1 - (i)][_PB_N - 1-(i)];\n}\n#pragma endscop\n\n} | subroutine kernel_ludcmp(n, a, b, x, y)\nimplicit none\n\nDATA_TYPE, dimension(n + 1, n + 1) :: a\nDATA_TYPE, dimension(n + 1) :: x\nDATA_TYPE, dimension(n + 1) :: b\nDATA_TYPE, dimension(n + 1) :: y\nDATA_TYPE :: w\ninteger :: n\ninteger :: i, j, k\n\n!$pragma scop\nb(1) = 1.0D0\ndo i = 1, _PB_N\ndo j = i + 1, _PB_N + 1\nw = a(i, j)\ndo k = 1, i - 1\nw = w - (a(k, j) * a(i, k))\nend do\na(i, j) = w / a(i, i)\nend do\ndo j = i + 1, _PB_N + 1\nw = a(j, i + 1)\ndo k = 1, i\nw = w - (a(k, i + 1) * a(j, k))\nend do\na(j, i + 1) = w\nend do\nend do\ny(1) = b(1)\ndo i = 2, _PB_N + 1\nw = b(i)\ndo j = 1, i - 1\nw = w - (a(j, i) * y(j))\nend do\ny(i) = w\nend do\nx(_PB_N + 1) = y(_PB_N + 1) / a(_PB_N + 1, _PB_N + 1)\ndo i = 1, _PB_N\nw = y(_PB_N + 1 - i)\ndo j = _PB_N + 2 - i, _PB_N + 1\nw = w - (a(j, _PB_N + 1 - i) * x(j))\nend do\nx(_PB_N + 1 - i) = w / a(_PB_N + 1 - i, _PB_N + 1 - i)\nend do\n!$pragma endscop\nend subroutine |
void print_array(int ni, int nj,\nDATA_TYPE POLYBENCH_2D(A,NI,NJ,ni,nj),\nDATA_TYPE POLYBENCH_2D(R,NJ,NJ,nj,nj),\nDATA_TYPE POLYBENCH_2D(Q,NI,NJ,ni,nj))\n{\nint i, j;\n\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nj; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, A[i][j]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\nfor (i = 0; i < nj; i++)\nfor (j = 0; j < nj; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, R[i][j]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nj; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, Q[i][j]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(ni, nj, a, r, q)\nimplicit none\n\nDATA_TYPE, dimension(nj, ni) :: a\nDATA_TYPE, dimension(nj, nj) :: r\nDATA_TYPE, dimension(nj, ni) :: q\ninteger :: ni, nj\ninteger :: i, j\ndo i = 1, ni\ndo j = 1, nj\nwrite(0, DATA_PRINTF_MODIFIER) a(j, i)\nif (mod((i - 1), 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\ndo i = 1, nj\ndo j = 1, nj\nwrite(0, DATA_PRINTF_MODIFIER) r(j, i)\nif (mod((i - 1), 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\ndo i = 1, ni\ndo j = 1, nj\nwrite(0, DATA_PRINTF_MODIFIER) q(j, i)\nif (mod((i - 1), 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void init_array (int cz,\nint cxm,\nint cym,\nDATA_TYPE *mui,\nDATA_TYPE *ch,\nDATA_TYPE POLYBENCH_2D(Ax,CZ+1,CYM+1,cz+1,cym+1),\nDATA_TYPE POLYBENCH_2D(Ry,CZ+1,CYM+1,cz+1,cym+1),\nDATA_TYPE POLYBENCH_3D(Ex,CZ+1,CYM+1,CXM+1,cz+1,cym+1,cxm+1),\nDATA_TYPE POLYBENCH_3D(Ey,CZ+1,CYM+1,CXM+1,cz+1,cym+1,cxm+1),\nDATA_TYPE POLYBENCH_3D(Hz,CZ+1,CYM+1,CXM+1,cz+1,cym+1,cxm+1),\nDATA_TYPE POLYBENCH_1D(czm,CZ+1,cz+1),\nDATA_TYPE POLYBENCH_1D(czp,CZ+1,cz+1),\nDATA_TYPE POLYBENCH_1D(cxmh,CXM+1,cxm+1),\nDATA_TYPE POLYBENCH_1D(cxph,CXM+1,cxm+1),\nDATA_TYPE POLYBENCH_1D(cymh,CYM+1,cym+1),\nDATA_TYPE POLYBENCH_1D(cyph,CYM+1,cym+1))\n{\nint i, j, k;\n*mui = 2341;\n*ch = 42;\nfor (i = 0; i <= cz; i++)\n{\nczm[i] = ((DATA_TYPE) i + 1) / cxm;\nczp[i] = ((DATA_TYPE) i + 2) / cxm;\n}\nfor (i = 0; i <= cxm; i++)\n{\ncxmh[i] = ((DATA_TYPE) i + 3) / cxm;\ncxph[i] = ((DATA_TYPE) i + 4) / cxm;\n}\nfor (i = 0; i <= cym; i++)\n{\ncymh[i] = ((DATA_TYPE) i + 5) / cxm;\ncyph[i] = ((DATA_TYPE) i + 6) / cxm;\n}\n\nfor (i = 0; i <= cz; i++)\nfor (j = 0; j <= cym; j++)\n{\nRy[i][j] = ((DATA_TYPE) i*(j+1) + 10) / cym;\nAx[i][j] = ((DATA_TYPE) i*(j+2) + 11) / cym;\nfor (k = 0; k <= cxm; k++)\n{\nEx[i][j][k] = ((DATA_TYPE) i*(j+3) + k + 1) / cxm;\nEy[i][j][k] = ((DATA_TYPE) i*(j+4) + k + 2) / cym;\nHz[i][j][k] = ((DATA_TYPE) i*(j+5) + k + 3) / cz;\n}\n}\n} | subroutine init_array(cz, cxm, cym, mui, ch, ax, ry, ex, ey, hz, &\nczm, czp, cxmh, cxph, cymh, cyph)\nimplicit none\n\ninteger :: cz, cym, cxm\nDATA_TYPE, dimension(cxm + 1, cym + 1, cz + 1) :: ex\nDATA_TYPE, dimension(cxm + 1, cym + 1, cz + 1) :: ey\nDATA_TYPE, dimension(cxm + 1, cym + 1, cz + 1) :: hz\nDATA_TYPE, dimension(cym + 1, cz + 1) :: ry\nDATA_TYPE, dimension(cym + 1, cz + 1) :: ax\nDATA_TYPE, dimension(cym + 1) :: cymh\nDATA_TYPE, dimension(cym + 1) :: cyph\nDATA_TYPE, dimension(cxm + 1) :: cxmh\nDATA_TYPE, dimension(cxm + 1) :: cxph\nDATA_TYPE, dimension(cz + 1) :: czm\nDATA_TYPE, dimension(cz + 1) :: czp\nDATA_TYPE :: mui, ch\ninteger :: i, j, k\n\nmui = 2341\nch = 42\ndo i = 1, cz + 1\nczm(i) = (DBLE(i - 1) + 1.0D0) / DBLE(cxm)\nczp(i) = (DBLE(i - 1) + 2.0D0) / DBLE(cxm)\nend do\ndo i = 1, cxm + 1\ncxmh(i) = (DBLE(i - 1) + 3.0D0) / DBLE(cxm)\ncxph(i) = (DBLE(i - 1) + 4.0D0) / DBLE(cxm)\nend do\ndo i = 1, cym + 1\ncymh(i) = (DBLE(i - 1) + 5.0D0) / DBLE(cxm)\ncyph(i) = (DBLE(i - 1) + 6.0D0) / DBLE(cxm)\nend do\ndo i = 1, cz + 1\ndo j = 1, cym + 1\nry(j, i) = ((DBLE(i - 1) * DBLE(j)) + 10.0D0) / &\nDBLE(cym)\nax(j, i) = ((DBLE(i - 1) * DBLE(j + 1)) + 11.0D0) / &\nDBLE(cym)\ndo k = 1, cxm + 1\nex(k, j, i) = ((DBLE(i - 1) * DBLE(j + 2)) + DBLE(k - 1) + &\n1.0D0) / DBLE(cxm)\ney(k, j, i) = ((DBLE(i - 1) * DBLE(j + 3)) + DBLE(k - 1) + &\n2.0D0) / DBLE(cym)\nhz(k, j, i) = ((DBLE(i - 1) * DBLE(j + 4)) + DBLE(k - 1) + &\n3.0D0) / DBLE(cz)\nend do\nend do\nend do\nend subroutine |
void kernel_cholesky(int n,\nDATA_TYPE POLYBENCH_1D(p,N,n),\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n{\nint i, j, k;\n\nDATA_TYPE x;\n\n#pragma scop\nfor (i = 0; i < _PB_N; ++i)\n{\nx = A[i][i];\nfor (j = 0; j <= i - 1; ++j)\nx = x - A[i][j] * A[i][j];\np[i] = 1.0 / sqrt(x);\nfor (j = i + 1; j < _PB_N; ++j)\n{\nx = A[i][j];\nfor (k = 0; k <= i - 1; ++k)\nx = x - A[j][k] * A[i][k];\nA[j][i] = x * p[i];\n}\n}\n#pragma endscop\n\n} | subroutine kernel_cholesky(n, p, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n) :: p\nDATA_TYPE :: x\ninteger :: n\ninteger :: i, j, k\n\n!$pragma scop\ndo i = 1, _PB_N\nx = a(i, i)\ndo j = 1, i - 1\nx = x - a(j, i) * a(j, i)\nend do\np(i) = 1.0D0 / sqrt(x)\ndo j = i + 1, _PB_N\nx = a(j, i)\ndo k = 1, i - 1\nx = x - (a(k, j) * a(k, i))\nend do\na(i, j) = x * p(i)\nend do\nend do\n!$pragma endscop\nend subroutine |
void print_array(int nx,\nint ny,\nDATA_TYPE POLYBENCH_2D(ex,NX,NY,nx,ny),\nDATA_TYPE POLYBENCH_2D(ey,NX,NY,nx,ny),\nDATA_TYPE POLYBENCH_2D(hz,NX,NY,nx,ny))\n{\nint i, j;\n\nfor (i = 0; i < nx; i++)\nfor (j = 0; j < ny; j++) {\nfprintf(stderr, DATA_PRINTF_MODIFIER, ex[i][j]);\nfprintf(stderr, DATA_PRINTF_MODIFIER, ey[i][j]);\nfprintf(stderr, DATA_PRINTF_MODIFIER, hz[i][j]);\nif ((i * nx + j) % 20 == 0) fprintf(stderr, "\n");\n}\nfprintf(stderr, "\n");\n} | subroutine print_array(nx, ny, ex, ey, hz)\nimplicit none\n\nDATA_TYPE, dimension(ny, nx) :: ex\nDATA_TYPE, dimension(ny, nx) :: ey\nDATA_TYPE, dimension(ny, nx) :: hz\ninteger :: nx, ny\ninteger :: i, j\ndo i = 1, nx\ndo j = 1, ny\nwrite(0, DATA_PRINTF_MODIFIER) ex(j, i)\nwrite(0, DATA_PRINTF_MODIFIER) ey(j, i)\nwrite(0, DATA_PRINTF_MODIFIER) hz(j, i)\nif (mod(((i - 1) * nx) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void print_array(int nr, int nq, int np,\nDATA_TYPE POLYBENCH_3D(A,NR,NQ,NP,nr,nq,np))\n{\nint i, j, k;\n\nfor (i = 0; i < nr; i++)\nfor (j = 0; j < nq; j++)\nfor (k = 0; k < np; k++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, A[i][j][k]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(a, nr, nq, np)\nimplicit none\n\nDATA_TYPE, dimension(np, nq, nr) :: a\ninteger :: nr, nq, np\ninteger :: i, j, k\ndo i = 1, nr\ndo j = 1, nq\ndo k = 1, np\nwrite(0, DATA_PRINTF_MODIFIER) a(k, j, i)\nif (mod((i - 1), 20) &\n== 0) then\nwrite(0, *)\nend if\nend do\nend do\nend do\nwrite(0, *)\nend subroutine |
void print_array(int nx, int ny,\nDATA_TYPE POLYBENCH_1D(s,NY,ny),\nDATA_TYPE POLYBENCH_1D(q,NX,nx))\n\n{\nint i;\n\nfor (i = 0; i < ny; i++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, s[i]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\nfor (i = 0; i < nx; i++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, q[i]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(nx, ny, s, q)\nimplicit none\n\nDATA_TYPE, dimension(ny) :: s\nDATA_TYPE, dimension(nx) :: q\ninteger :: nx,ny\ninteger :: i\ndo i = 1, ny\nwrite(0, DATA_PRINTF_MODIFIER) s(i)\nif (mod(i - 1, 80) == 0) then\nwrite(0, *)\nend if\nend do\n\ndo i = 1, nx\nwrite(0, DATA_PRINTF_MODIFIER) q(i)\nif (mod(i - 1, 80) == 0) then\nwrite(0, *)\nend if\nend do\nwrite(0, *)\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_2D(X,N,N,n,n))\n\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++) {\nfprintf(stderr, DATA_PRINTF_MODIFIER, X[i][j]);\nif ((i * N + j) % 20 == 0) fprintf(stderr, "\n");\n}\nfprintf(stderr, "\n");\n} | subroutine print_array(n, x)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: x\ninteger :: n\ninteger :: i, j\n\ndo i = 1, n\ndo j = 1, n\nwrite(0, DATA_PRINTF_MODIFIER) x(j, i)\nif (mod(((i - 1) * n) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void print_array(int ni,\nDATA_TYPE POLYBENCH_2D(C,NI,NI,ni,ni))\n{\nint i, j;\n\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < ni; j++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, C[i][j]);\nif ((i * ni + j) % 20 == 0) fprintf (stderr, "\n");\n}\nfprintf (stderr, "\n");\n} | subroutine print_array(ni, c)\nimplicit none\n\nDATA_TYPE, dimension(ni, ni) :: c\ninteger :: ni\ninteger :: i, j\ndo i = 1, ni\ndo j = 1, ni\nwrite(0, DATA_PRINTF_MODIFIER) c(j, i)\nif (mod(((i - 1) * ni) + j - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend do\nwrite(0, *)\nend subroutine |
void init_array(int ni, int nj, int nk, int nl, int nm,\nDATA_TYPE POLYBENCH_2D(A,NI,NK,ni,nk),\nDATA_TYPE POLYBENCH_2D(B,NK,NJ,nk,nj),\nDATA_TYPE POLYBENCH_2D(C,NJ,NM,nj,nm),\nDATA_TYPE POLYBENCH_2D(D,NM,NL,nm,nl))\n{\nint i, j;\n\nfor (i = 0; i < ni; i++)\nfor (j = 0; j < nk; j++)\nA[i][j] = ((DATA_TYPE) i*j) / ni;\nfor (i = 0; i < nk; i++)\nfor (j = 0; j < nj; j++)\nB[i][j] = ((DATA_TYPE) i*(j+1)) / nj;\nfor (i = 0; i < nj; i++)\nfor (j = 0; j < nm; j++)\nC[i][j] = ((DATA_TYPE) i*(j+3)) / nl;\nfor (i = 0; i < nm; i++)\nfor (j = 0; j < nl; j++)\nD[i][j] = ((DATA_TYPE) i*(j+2)) / nk;\n} | subroutine init_array(ni, nj, nk, nl, nm, a, b, c , d)\nimplicit none\n\nDATA_TYPE, dimension(nk, ni) :: a\nDATA_TYPE, dimension(nj, nk) :: b\nDATA_TYPE, dimension(nm, nj) :: c\nDATA_TYPE, dimension(nl, nm) :: d\ninteger :: ni, nj, nk, nl, nm\ninteger :: i, j\n\ndo i = 1, ni\ndo j = 1, nk\na(j,i) = DBLE(i-1) * DBLE(j-1) / ni\nend do\nend do\n\ndo i = 1, nk\ndo j = 1, nj\nb(j,i) = (DBLE(i-1) * DBLE(j))/ nj\nend do\nend do\n\ndo i = 1, nj\ndo j = 1, nm\nc(j,i) = (DBLE(i-1) * DBLE(j+2))/ nl\nend do\nend do\n\ndo i = 1, nm\ndo j = 1, nl\nd(j,i) = (DBLE(i-1) * DBLE(j+1))/ nk\nend do\nend do\nend subroutine |
void print_array(int n,\nDATA_TYPE POLYBENCH_1D(x,N+1,n+1))\n\n{\nint i;\n\nfor (i = 0; i <= n; i++) {\nfprintf (stderr, DATA_PRINTF_MODIFIER, x[i]);\nif (i % 20 == 0) fprintf (stderr, "\n");\n}\n} | subroutine print_array(n, x)\nimplicit none\n\nDATA_TYPE, dimension(n + 1) :: x\ninteger :: n\ninteger :: i\ndo i = 1, n + 1\nwrite(0, DATA_PRINTF_MODIFIER) x(i)\nif (mod(i - 1, 20) == 0) then\nwrite(0, *)\nend if\nend do\nend subroutine |
void kernel_jacobi_2d_imper(int tsteps,\nint n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n),\nDATA_TYPE POLYBENCH_2D(B,N,N,n,n))\n{\nint t, i, j;\n\n#pragma scop\nfor (t = 0; t < _PB_TSTEPS; t++)\n{\nfor (i = 1; i < _PB_N - 1; i++)\nfor (j = 1; j < _PB_N - 1; j++)\nB[i][j] = 0.2 * (A[i][j] + A[i][j-1] + A[i][1+j] + A[1+i][j] + A[i-1][j]);\nfor (i = 1; i < _PB_N-1; i++)\nfor (j = 1; j < _PB_N-1; j++)\nA[i][j] = B[i][j];\n}\n#pragma endscop\n\n} | subroutine kernel_jacobi_2d_imper(tsteps, n, a, b)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\nDATA_TYPE, dimension(n, n) :: b\ninteger :: n, tsteps\ninteger :: i, j, t\n\n!$pragma scop\ndo t = 1, _PB_TSTEPS\ndo i = 2, _PB_N - 1\ndo j = 2, _PB_N - 1\nb(j, i) = 0.2D0 * (a(j, i) + a(j - 1, i) + a(1 + j, i) + &\na(j, 1 + i) + a(j, i - 1))\nend do\nend do\ndo i = 2, _PB_N - 1\ndo j = 2, _PB_N - 1\na(j, i) = b(j, i)\nend do\nend do\nend do\n!$pragma endscop\nend subroutine |
void init_array (int n,\nDATA_TYPE POLYBENCH_2D(A,N,N,n,n))\n{\nint i, j;\n\nfor (i = 0; i < n; i++)\nfor (j = 0; j < n; j++)\nA[i][j] = ((DATA_TYPE) (i+1)*(j+1)) / n;\n} | subroutine init_array(n, a)\nimplicit none\n\nDATA_TYPE, dimension(n, n) :: a\ninteger :: n\ninteger :: i, j\n\ndo i = 1, n\ndo j = 1, n\na(j, i) = (DBLE(i) * DBLE(j)) / DBLE(n)\nend do\nend do\nend subroutine |