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);... | 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(*,*)' '\... |
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... | 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,... |
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... | 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!$pr... |
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 = ... | 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... |
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; ... | 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(n... |
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... | 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,... |
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!$pr... |
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)... | 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, ... |
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++... | 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 ... |
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_TY... | 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... |
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,C... | 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... |
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... | 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, d... |
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) ... | 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... |
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] ... | 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,... |
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;\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... |
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!$pragm... |
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 ... | 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... |
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][... | 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\n... |
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... | 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\... |
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\ne... |
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... | 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_T... |
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 ... |
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 ... | 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)/DB... |
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++)\... | 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) ... |
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 s... |
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)\nen... |
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... | 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(... |
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 = ... |
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) ... | 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... |
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++)\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 = ... |
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... | 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,... |
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] = ... | 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)\nen... |
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(... | 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) ... |
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] ... | 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) * ... |
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]... | 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... |
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)... | 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) = ((DBL... |
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 (... | 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.... |
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... | 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, _P... |
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\ne... |
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++)\nC... | 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 d... |
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,... | 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 ... |
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... | 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!$pr... |
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;\nf... | 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... |
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];... | 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 +... |
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}\nf... | 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\... |
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 POL... | 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, di... |
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]... | 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, ... |
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... | 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... |
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... |
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 % ... | 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... |
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;\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... |
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] + ... | 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(... |
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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.