HomeSort by relevance Sort by last modified time
    Searched refs:actual_b (Results 1 - 3 of 3) sorted by null

  /external/eigen/Eigen/src/SparseLU/
SparseLU_gemm_kernel.h 60 Index actual_b = std::min<Index>(BM, m-ib); // actual number of rows local
61 Index actual_b_end1 = (actual_b/SM)*SM; // actual number of rows suitable for peeling
62 Index actual_b_end2 = (actual_b/PacketSize)*PacketSize; // actual number of rows suitable for vectorization
151 for(Index i=actual_b_end2; i<actual_b; ++i)
237 for(Index i=actual_b_end2; i<actual_b; ++i)
261 if(rd==1) MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b);
263 else if(rd==2) MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b)
264 + B[1+d_end+j*ldb] * ConstMapVector(A+(d_end+1)*lda+ib, actual_b);
    [all...]
  /external/eigen/blas/
level2_impl.h 66 const Scalar* actual_b = get_compact_vector(b,actual_n,*incb); local
78 func[code](actual_m, actual_n, a, *lda, actual_b, 1, actual_c, 1, alpha);
80 if(actual_b!=b) delete[] actual_b;
133 Scalar* actual_b = get_compact_vector(b,*n,*incb);
136 func[code](*n, a, *lda, actual_b);
138 if(actual_b!=b) delete[] copy_back(actual_b,b,*n,*incb);
195 Scalar* actual_b = get_compact_vector(b,*n,*incb);
203 func[code](*n, *n, a, *lda, actual_b, 1, res.data(), 1, Scalar(1))
    [all...]
  /external/eigen/Eigen/src/Core/products/
GeneralMatrixMatrixTriangular.h 158 const RhsScalar* actual_b = blockB+j*depth; local
161 gebp_kernel(res.getSubMapper(0, j), blockA, actual_b, j, depth, actualBlockSize, alpha,
169 gebp_kernel(ResMapper(buffer.data(), BlockSize), blockA+depth*i, actual_b, actualBlockSize, depth, actualBlockSize, alpha, local
184 gebp_kernel(res.getSubMapper(i, j), blockA+depth*i, actual_b, size-i,

Completed in 209 milliseconds