/dports/misc/tvm/incubator-tvm-0.6.1/tutorials/language/ |
H A D | reduction.py | 60 B = tvm.compute((n,), lambda i: tvm.sum(A[i, k], axis=k), name="B") variable 78 ko, ki = s[B].split(B.op.reduce_axis[0], factor=16) variable 101 ko, ki = s[B].split(B.op.reduce_axis[0], factor=16) variable 179 B = tvm.compute((n,), lambda i: product(A[i, k], axis=k), name='B') variable
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/tutorials/language/ |
H A D | reduction.py | 62 B = te.compute((n,), lambda i: te.sum(A[i, k], axis=k), name="B") variable 80 ko, ki = s[B].split(B.op.reduce_axis[0], factor=16) variable 103 ko, ki = s[B].split(B.op.reduce_axis[0], factor=16) variable 180 B = te.compute((n,), lambda i: product(A[i, k], axis=k), name="B") variable
|
/dports/misc/py-tvm/incubator-tvm-0.6.1/tutorials/language/ |
H A D | reduction.py | 60 B = tvm.compute((n,), lambda i: tvm.sum(A[i, k], axis=k), name="B") variable 78 ko, ki = s[B].split(B.op.reduce_axis[0], factor=16) variable 101 ko, ki = s[B].split(B.op.reduce_axis[0], factor=16) variable 179 B = tvm.compute((n,), lambda i: product(A[i, k], axis=k), name='B') variable
|
/dports/security/john/john-1.9.0-jumbo-1/src/ |
H A D | opencl_sha2.h | 97 #define ROUND_A(a,b,c,d,e,f,g,h,ki,wi) \ argument 103 #define ROUND_Z(a,b,c,d,e,f,g,h,ki) \ argument 109 #define ROUND_B(a,b,c,d,e,f,g,h,ki,wi,wj,wk,wl,wm) \ argument 156 #define SHA256(A,B,C,D,E,F,G,H,W) \ argument 224 #define SHA256_ZEROS(A,B,C,D,E,F,G,H,W) \ argument 468 #define ROUND512_Z(a, b, c, d, e, f, g, h, ki) \ argument 477 #define SHA512(A, B, C, D, E, F, G, H, W) \ argument 561 #define SHA512_ZEROS(A, B, C, D, E, F, G, H, W) \ argument 650 ulong A, B, C, D, E, F, G, H, t; in sha512_single_s() local 677 MAYBE_VECTOR_ULONG A, B, C, D, E, F, G, H, t; in sha512_single() local [all …]
|
H A D | opencl_sha2_common.h | 133 #define ROUND_A(A, B, C, D, E, F, G, H, ki, wi)\ argument 137 #define ROUND_B(A, B, C, D, E, F, G, H, ki, wi, wj, wk, wl, wm)\ argument
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/tutorials/optimize/ |
H A D | opt_gemm.py | 103 B = te.placeholder((K, N), name="B") variable 138 ko, ki = s[C].split(k, factor=4) variable 172 ko, ki = s[C].split(k, factor=4) variable 206 ko, ki = s[C].split(k, factor=4) variable 259 ko, ki = s[C].split(k, factor=4) variable 305 ko, ki = s[CC].split(k, factor=4) variable 345 ko, ki = s[CC].split(k, factor=4) variable
|
/dports/misc/tvm/incubator-tvm-0.6.1/tutorials/optimize/ |
H A D | opt_gemm.py | 99 B = tvm.placeholder((K, N), name='B') variable 137 ko, ki = s[C].split(k, factor=4) variable 171 ko, ki = s[C].split(k, factor=4) variable 205 ko, ki = s[C].split(k, factor=4) variable 257 ko, ki = s[C].split(k, factor=4) variable 303 ko, ki = s[CC].split(k, factor=4) variable 343 ko, ki = s[CC].split(k, factor=4) variable
|
/dports/misc/py-tvm/incubator-tvm-0.6.1/tutorials/optimize/ |
H A D | opt_gemm.py | 99 B = tvm.placeholder((K, N), name='B') variable 137 ko, ki = s[C].split(k, factor=4) variable 171 ko, ki = s[C].split(k, factor=4) variable 205 ko, ki = s[C].split(k, factor=4) variable 257 ko, ki = s[C].split(k, factor=4) variable 303 ko, ki = s[CC].split(k, factor=4) variable 343 ko, ki = s[CC].split(k, factor=4) variable
|
/dports/science/lammps/lammps-stable_29Sep2021/lib/atc/ |
H A D | SparseMatrix.h | 153 virtual void MultAB(const Matrix<T>& B, DenseMatrix<T>& C) const in MultAB() 190 INDEX j, k, ki; in transMat() local 209 INDEX k, ki, kj; in transMat() local
|
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/atc/ |
H A D | SparseMatrix.h | 153 virtual void MultAB(const Matrix<T>& B, DenseMatrix<T>& C) const in MultAB() 190 INDEX j, k, ki; in transMat() local 209 INDEX k, ki, kj; in transMat() local
|
/dports/misc/tvm/incubator-tvm-0.6.1/vta/tutorials/ |
H A D | matrix_multiply.py | 172 B = tvm.placeholder((m, n, env.BLOCK_OUT, env.BLOCK_IN), name="B", dtype=env.wgt_dtype) variable 203 ki = tvm.reduce_axis((0, env.BLOCK_IN), name="ki") variable
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/vta/tutorials/ |
H A D | matrix_multiply.py | 173 B = te.placeholder((m, n, env.BLOCK_OUT, env.BLOCK_IN), name="B", dtype=env.wgt_dtype) variable 204 ki = te.reduce_axis((0, env.BLOCK_IN), name="ki") variable
|
/dports/misc/py-tvm/incubator-tvm-0.6.1/vta/tutorials/ |
H A D | matrix_multiply.py | 172 B = tvm.placeholder((m, n, env.BLOCK_OUT, env.BLOCK_IN), name="B", dtype=env.wgt_dtype) variable 203 ki = tvm.reduce_axis((0, env.BLOCK_IN), name="ki") variable
|
/dports/cad/gmsh/gmsh-4.9.2-source/Solver/ |
H A D | eigenSolver.cpp | 21 std::string B, bool hermitian) in eigenSolver() 35 linearSystemPETSc<double> *B, bool hermitian) in eigenSolver() 45 Mat B = _sysB ? _sysB->getMatrix() : PETSC_NULL; in solve() local 161 PetscScalar kr, ki; in solve() local
|
/dports/lang/halide/Halide-release_2019_08_27-2654-g664dc4993/test/performance/ |
H A D | matrix_multiplication.cpp | 8 void simple_version(float *A, float *B, float *C, int width, int stride) { in simple_version() 37 RVar ki; in main() local
|
/dports/math/sisl/SISL-SISL-4.6.0-44-g9114631/src/ |
H A D | s1500.c | 141 int ki,kj,kl; /* Running variables in loop */ local 155 double B[3]; /* Normalized elliptic axisB */ local
|
/dports/math/freefem++/FreeFem-sources-4.6/plugin/mpi/ |
H A D | SLEPc-code.hpp | 29 void assign(K* pt, PetscScalar& kr, PetscScalar& ki) { in assign() 33 void assign(K* pt, PetscScalar& kr, PetscScalar& ki) { in assign() 76 Expression B; member in SLEPc::eigensolver::E_eigensolver 225 PetscScalar kr, ki; in operator ()() local
|
/dports/math/freefem++/FreeFem-sources-4.6/plugin/seq/ |
H A D | fflapack.cpp | 285 long lapack_dggev(KNM< double > *const &A, KNM< double > *const &B, KN< Complex > *const &vpa, in lapack_dggev() 328 int ki = k + n; in lapack_dggev() local 467 long lapack_dsygvd(KNM< double > *const &A, KNM< double > *const &B, KN< double > *const &vp, in lapack_dsygvd() 730 long lapack_dgelsy(KNM< double > *const &A, KN< double > *const &B) { in lapack_dgelsy() 757 long lapack_dgelsy(KNM< double > *const &A, KNM< double > *const &B) { in lapack_dgelsy() 1005 KNM< R > B(*b); in Solve() local 1044 KNM< R > *mult_ab(KNM< R > *a, const KNM_< R > &A, const KNM_< R > &B, R alpha = R(1.), in mult_ab() 1112 KNM< R > *mult(KNM< R > *a, const KNM_< R > &A, const KNM_< R > &B) { // C=A*B in mult() argument 1198 int ki = mi < 0 ? -mi - 2 : -1; in ff_SchurComplement() local 1226 int ki = mi < 0 ? -mi - 2 : -1; in ff_SchurComplement() local [all …]
|
H A D | lapack.cpp | 285 long lapack_dggev(KNM< double > *const &A, KNM< double > *const &B, KN< Complex > *const &vpa, in lapack_dggev() 328 int ki = k + n; in lapack_dggev() local 467 long lapack_dsygvd(KNM< double > *const &A, KNM< double > *const &B, KN< double > *const &vp, in lapack_dsygvd() 730 long lapack_dgelsy(KNM< double > *const &A, KN< double > *const &B) { in lapack_dgelsy() 757 long lapack_dgelsy(KNM< double > *const &A, KNM< double > *const &B) { in lapack_dgelsy() 1005 KNM< R > B(*b); in Solve() local 1044 KNM< R > *mult_ab(KNM< R > *a, const KNM_< R > &A, const KNM_< R > &B, R alpha = R(1.), in mult_ab() 1112 KNM< R > *mult(KNM< R > *a, const KNM_< R > &A, const KNM_< R > &B) { // C=A*B in mult() argument 1198 int ki = mi < 0 ? -mi - 2 : -1; in ff_SchurComplement() local 1226 int ki = mi < 0 ? -mi - 2 : -1; in ff_SchurComplement() local [all …]
|
/dports/math/dune-grid-glue/dune-grid-glue-17bd9898df80a52e2c316fc053119d190c149a2e/dune/grid-glue/merging/ |
H A D | computeintersection.cc | 29 for (unsigned int ki = 0; ki < subElementsX[i].size(); ++ki) // define the X subelement in computeIntersection() local 42 for (unsigned int ki = 0; ki < sSX.size(); ++ki) { // iterate over all faces in computeIntersection() local 216 std::vector<int> B = id ; in newFace3D() local
|
/dports/editors/fte/fte/src/ |
H A D | con_os2.cpp | 186 KBDKEYINFO ki; in ReadKbdEvent() local 346 KBDINFO ki; in ReadMouseEvent() local 369 TDrawBuffer B; in ConClear() local 684 static KBDINFO ki; in ConSuspend() local 706 static KBDINFO ki; in ConContinue() local 750 KBDINFO ki; in ConGetEvent() local
|
/dports/graphics/argyllcms/Argyll_V1.9.2/profile/ |
H A D | profcheck.c | 595 int ti, ci, mi, yi, ki; in main() local 971 #define HEAP_COMPARE(A,B) (A.de > B.de) in main() argument 1013 #define HEAP_COMPARE(A,B) (A->de < B->de) in main() argument 1266 #define HEAP_COMPARE(A,B) (A->dv < B->dv) in main() argument 1271 #define HEAP_COMPARE(A,B) (A->dp < B->dp) in main() argument
|
/dports/science/elmerfem/elmerfem-release-9.0/fem/src/modules/ |
H A D | EliminatePeriodic.F90 | 527 TYPE(Matrix_t), POINTER :: A, B local 603 SUBROUTINE CRS_MatrixMatrixMultiply( C, A, B, MVal ) argument 607 TYPE(Matrix_t), POINTER :: A, B, C local 613 INTEGER :: ki, NCols local
|
/dports/math/PDL/PDL-2.019/Basic/MatrixOps/ |
H A D | eigen.c | 51 void PrintEigen(int n, double **A, double **B, double eps, FILE *outfile) { in PrintEigen() 134 void Permutation(int n, double **P, double **A, double **B, int colon, in Permutation() 140 int im, j, ki, u, v, i, k, ii; in Permutation() local 236 void Swap(int n, double **A, double **B, double epsx) { in Swap()
|
/dports/games/retroarch/RetroArch-1.9.7/gfx/video_filters/ |
H A D | 2xbr.c | 402 #define df(Z, A, B)\ argument 405 #define eq(Z, A, B)\ argument 408 float df8(uint32_t A, uint32_t B, in df8() 431 int eq8(uint32_t A, uint32_t B, in eq8() 562 uint32_t ex, e, i, ke, ki, ex2, ex3, px; in twoxbr_generic_xrgb8888() local 621 uint16_t ex, e, i, ke, ki, ex2, ex3, px; in twoxbr_generic_rgb565() local
|