Lines Matching refs:Index
18 template<typename Scalar, typename Index, int Pack1, int Pack2, int StorageOrder>
22 void pack(Scalar* blockA, const const_blas_data_mapper<Scalar,Index,StorageOrder>& lhs, Index cols, Index i, Index& count)
25 for(Index k=0; k<i; k++)
26 for(Index w=0; w<BlockRows; w++)
29 Index h = 0;
30 for(Index k=i; k<i+BlockRows; k++)
32 for(Index w=0; w<h; w++)
37 for(Index w=h+1; w<BlockRows; w++)
42 for(Index k=i+BlockRows; k<cols; k++)
43 for(Index w=0; w<BlockRows; w++)
46 void operator()(Scalar* blockA, const Scalar* _lhs, Index lhsStride, Index cols, Index rows)
48 const_blas_data_mapper<Scalar,Index,StorageOrder> lhs(_lhs,lhsStride);
49 Index count = 0;
50 Index peeled_mc = (rows/Pack1)*Pack1;
51 for(Index i=0; i<peeled_mc; i+=Pack1)
63 for(Index i=peeled_mc; i<rows; i++)
65 for(Index k=0; k<i; k++)
70 for(Index k=i+1; k<cols; k++)
76 template<typename Scalar, typename Index, int nr, int StorageOrder>
80 void operator()(Scalar* blockB, const Scalar* _rhs, Index rhsStride, Index rows, Index cols, Index k2)
82 Index end_k = k2 + rows;
83 Index count = 0;
84 const_blas_data_mapper<Scalar,Index,StorageOrder> rhs(_rhs,rhsStride);
85 Index packet_cols = (cols/nr)*nr;
88 for(Index j2=0; j2<k2; j2+=nr)
90 for(Index k=k2; k<end_k; k++)
104 for(Index j2=k2; j2<(std::min)(k2+rows,packet_cols); j2+=nr)
108 for(Index k=k2; k<j2; k++)
120 Index h = 0;
121 for(Index k=j2; k<j2+nr; k++)
124 for (Index w=0 ; w<h; ++w)
130 for (Index w=h+1 ; w<nr; ++w)
136 for(Index k=j2+nr; k<end_k; k++)
150 for(Index j2=k2+rows; j2<packet_cols; j2+=nr)
152 for(Index k=k2; k<end_k; k++)
166 for(Index j2=packet_cols; j2<cols; ++j2)
169 Index half = (std::min)(end_k,j2);
170 for(Index k=k2; k<half; k++)
185 for(Index k=half+1; k<k2+rows; k++)
197 template <typename Scalar, typename Index,
203 template <typename Scalar, typename Index,
206 struct product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,LhsSelfAdjoint,ConjugateLhs, RhsStorageOrder,RhsSelfAdjoint,ConjugateRhs,RowMajor>
210 Index rows, Index cols,
211 const Scalar* lhs, Index lhsStride,
212 const Scalar* rhs, Index rhsStride,
213 Scalar* res, Index resStride,
216 product_selfadjoint_matrix<Scalar, Index,
226 template <typename Scalar, typename Index,
229 struct product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,true,ConjugateLhs, RhsStorageOrder,false,ConjugateRhs,ColMajor>
233 Index rows, Index cols,
234 const Scalar* _lhs, Index lhsStride,
235 const Scalar* _rhs, Index rhsStride,
236 Scalar* res, Index resStride,
240 template <typename Scalar, typename Index,
243 EIGEN_DONT_INLINE void product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,true,ConjugateLhs, RhsStorageOrder,false,ConjugateRhs,ColMajor>::run(
244 Index rows, Index cols,
245 const Scalar* _lhs, Index lhsStride,
246 const Scalar* _rhs, Index rhsStride,
247 Scalar* res, Index resStride,
250 Index size = rows;
252 const_blas_data_mapper<Scalar, Index, LhsStorageOrder> lhs(_lhs,lhsStride);
253 const_blas_data_mapper<Scalar, Index, RhsStorageOrder> rhs(_rhs,rhsStride);
257 Index kc = size; // cache block size along the K direction
258 Index mc = rows; // cache block size along the M direction
259 Index nc = cols; // cache block size along the N direction
270 gebp_kernel<Scalar, Scalar, Index, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
271 symm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs;
272 gemm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder> pack_rhs;
273 gemm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder==RowMajor?ColMajor:RowMajor, true> pack_lhs_transposed;
275 for(Index k2=0; k2<size; k2+=kc)
277 const Index actual_kc = (std::min)(k2+kc,size)-k2;
288 for(Index i2=0; i2<k2; i2+=mc)
290 const Index actual_mc = (std::min)(i2+mc,k2)-i2;
298 const Index actual_mc = (std::min)(k2+kc,size)-k2;
305 for(Index i2=k2+kc; i2<size; i2+=mc)
307 const Index actual_mc = (std::min)(i2+mc,size)-i2;
308 gemm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder,false>()
317 template <typename Scalar, typename Index,
320 struct product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,false,ConjugateLhs, RhsStorageOrder,true,ConjugateRhs,ColMajor>
324 Index rows, Index cols,
325 const Scalar* _lhs, Index lhsStride,
326 const Scalar* _rhs, Index rhsStride,
327 Scalar* res, Index resStride,
331 template <typename Scalar, typename Index,
334 EIGEN_DONT_INLINE void product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,false,ConjugateLhs, RhsStorageOrder,true,ConjugateRhs,ColMajor>::run(
335 Index rows, Index cols,
336 const Scalar* _lhs, Index lhsStride,
337 const Scalar* _rhs, Index rhsStride,
338 Scalar* res, Index resStride,
341 Index size = cols;
343 const_blas_data_mapper<Scalar, Index, LhsStorageOrder> lhs(_lhs,lhsStride);
347 Index kc = size; // cache block size along the K direction
348 Index mc = rows; // cache block size along the M direction
349 Index nc = cols; // cache block size along the N direction
357 gebp_kernel<Scalar, Scalar, Index, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
358 gemm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs;
359 symm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder> pack_rhs;
361 for(Index k2=0; k2<size; k2+=kc)
363 const Index actual_kc = (std::min)(k2+kc,size)-k2;
368 for(Index i2=0; i2<rows; i2+=mc)
370 const Index actual_mc = (std::min)(i2+mc,rows)-i2;
416 internal::product_selfadjoint_matrix<Scalar, Index,
