10 #ifndef EIGEN_TRIANGULAR_MATRIX_MATRIX_H
11 #define EIGEN_TRIANGULAR_MATRIX_MATRIX_H
44 template <
typename Scalar,
typename Index,
45 int Mode,
bool LhsIsTriangular,
46 int LhsStorageOrder,
bool ConjugateLhs,
47 int RhsStorageOrder,
bool ConjugateRhs,
48 int ResStorageOrder,
int Version = Specialized>
49 struct product_triangular_matrix_matrix;
51 template <
typename Scalar,
typename Index,
52 int Mode,
bool LhsIsTriangular,
53 int LhsStorageOrder,
bool ConjugateLhs,
54 int RhsStorageOrder,
bool ConjugateRhs,
int Version>
55 struct product_triangular_matrix_matrix<Scalar,Index,Mode,LhsIsTriangular,
56 LhsStorageOrder,ConjugateLhs,
57 RhsStorageOrder,ConjugateRhs,
RowMajor,Version>
59 static EIGEN_STRONG_INLINE
void run(
60 Index rows, Index cols, Index depth,
61 const Scalar* lhs, Index lhsStride,
62 const Scalar* rhs, Index rhsStride,
63 Scalar* res, Index resStride,
64 Scalar alpha, level3_blocking<Scalar,Scalar>& blocking)
66 product_triangular_matrix_matrix<Scalar, Index,
71 LhsStorageOrder==RowMajor ?
ColMajor : RowMajor,
74 ::run(cols, rows, depth, rhs, rhsStride, lhs, lhsStride, res, resStride, alpha, blocking);
79 template <
typename Scalar,
typename Index,
int Mode,
80 int LhsStorageOrder,
bool ConjugateLhs,
81 int RhsStorageOrder,
bool ConjugateRhs,
int Version>
82 struct product_triangular_matrix_matrix<Scalar,Index,Mode,true,
83 LhsStorageOrder,ConjugateLhs,
84 RhsStorageOrder,ConjugateRhs,
ColMajor,Version>
87 typedef gebp_traits<Scalar,Scalar> Traits;
89 SmallPanelWidth = 2 * EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
94 static EIGEN_DONT_INLINE
void run(
95 Index _rows, Index _cols, Index _depth,
96 const Scalar* _lhs, Index lhsStride,
97 const Scalar* _rhs, Index rhsStride,
98 Scalar* res, Index resStride,
99 Scalar alpha, level3_blocking<Scalar,Scalar>& blocking)
102 Index diagSize = (std::min)(_rows,_depth);
103 Index rows = IsLower ? _rows : diagSize;
104 Index depth = IsLower ? diagSize : _depth;
107 const_blas_data_mapper<Scalar, Index, LhsStorageOrder> lhs(_lhs,lhsStride);
108 const_blas_data_mapper<Scalar, Index, RhsStorageOrder> rhs(_rhs,rhsStride);
110 Index kc = blocking.kc();
111 Index mc = (std::min)(rows,blocking.mc());
113 std::size_t sizeA = kc*mc;
114 std::size_t sizeB = kc*cols;
115 std::size_t sizeW = kc*Traits::WorkSpaceFactor;
117 ei_declare_aligned_stack_constructed_variable(Scalar, blockA, sizeA, blocking.blockA());
118 ei_declare_aligned_stack_constructed_variable(Scalar, blockB, sizeB, blocking.blockB());
119 ei_declare_aligned_stack_constructed_variable(Scalar, blockW, sizeW, blocking.blockW());
121 Matrix<Scalar,SmallPanelWidth,SmallPanelWidth,LhsStorageOrder> triangularBuffer;
122 triangularBuffer.setZero();
124 triangularBuffer.diagonal().setZero();
126 triangularBuffer.diagonal().setOnes();
128 gebp_kernel<Scalar, Scalar, Index, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
129 gemm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs;
130 gemm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder> pack_rhs;
132 for(Index k2=IsLower ? depth : 0;
133 IsLower ? k2>0 : k2<depth;
134 IsLower ? k2-=kc : k2+=kc)
136 Index actual_kc = (std::min)(IsLower ? k2 : depth-k2, kc);
137 Index actual_k2 = IsLower ? k2-actual_kc : k2;
140 if((!IsLower)&&(k2<rows)&&(k2+actual_kc>rows))
143 k2 = k2+actual_kc-kc;
146 pack_rhs(blockB, &rhs(actual_k2,0), rhsStride, actual_kc, cols);
154 if(IsLower || actual_k2<rows)
157 for (Index k1=0; k1<actual_kc; k1+=SmallPanelWidth)
159 Index actualPanelWidth = std::min<Index>(actual_kc-k1, SmallPanelWidth);
160 Index lengthTarget = IsLower ? actual_kc-k1-actualPanelWidth : k1;
161 Index startBlock = actual_k2+k1;
162 Index blockBOffset = k1;
167 for (Index k=0;k<actualPanelWidth;++k)
170 triangularBuffer.coeffRef(k,k) = lhs(startBlock+k,startBlock+k);
171 for (Index i=IsLower ? k+1 : 0; IsLower ? i<actualPanelWidth : i<k; ++i)
172 triangularBuffer.coeffRef(i,k) = lhs(startBlock+i,startBlock+k);
174 pack_lhs(blockA, triangularBuffer.data(), triangularBuffer.outerStride(), actualPanelWidth, actualPanelWidth);
176 gebp_kernel(res+startBlock, resStride, blockA, blockB, actualPanelWidth, actualPanelWidth, cols, alpha,
177 actualPanelWidth, actual_kc, 0, blockBOffset, blockW);
182 Index startTarget = IsLower ? actual_k2+k1+actualPanelWidth : actual_k2;
184 pack_lhs(blockA, &lhs(startTarget,startBlock), lhsStride, actualPanelWidth, lengthTarget);
186 gebp_kernel(res+startTarget, resStride, blockA, blockB, lengthTarget, actualPanelWidth, cols, alpha,
187 actualPanelWidth, actual_kc, 0, blockBOffset, blockW);
193 Index start = IsLower ? k2 : 0;
194 Index end = IsLower ? rows : (std::min)(actual_k2,rows);
195 for(Index i2=start; i2<end; i2+=mc)
197 const Index actual_mc = (std::min)(i2+mc,end)-i2;
198 gemm_pack_lhs<Scalar, Index, Traits::mr,Traits::LhsProgress, LhsStorageOrder,false>()
199 (blockA, &lhs(i2, actual_k2), lhsStride, actual_kc, actual_mc);
201 gebp_kernel(res+i2, resStride, blockA, blockB, actual_mc, actual_kc, cols, alpha, -1, -1, 0, 0, blockW);
209 template <
typename Scalar,
typename Index,
int Mode,
210 int LhsStorageOrder,
bool ConjugateLhs,
211 int RhsStorageOrder,
bool ConjugateRhs,
int Version>
212 struct product_triangular_matrix_matrix<Scalar,Index,Mode,false,
213 LhsStorageOrder,ConjugateLhs,
214 RhsStorageOrder,ConjugateRhs,
ColMajor,Version>
216 typedef gebp_traits<Scalar,Scalar> Traits;
218 SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
220 SetDiag = (Mode&(ZeroDiag|
UnitDiag)) ? 0 : 1
223 static EIGEN_DONT_INLINE
void run(
224 Index _rows, Index _cols, Index _depth,
225 const Scalar* _lhs, Index lhsStride,
226 const Scalar* _rhs, Index rhsStride,
227 Scalar* res, Index resStride,
228 Scalar alpha, level3_blocking<Scalar,Scalar>& blocking)
231 Index diagSize = (std::min)(_cols,_depth);
233 Index depth = IsLower ? _depth : diagSize;
234 Index cols = IsLower ? diagSize : _cols;
236 const_blas_data_mapper<Scalar, Index, LhsStorageOrder> lhs(_lhs,lhsStride);
237 const_blas_data_mapper<Scalar, Index, RhsStorageOrder> rhs(_rhs,rhsStride);
239 Index kc = blocking.kc();
240 Index mc = (std::min)(rows,blocking.mc());
242 std::size_t sizeA = kc*mc;
243 std::size_t sizeB = kc*cols;
244 std::size_t sizeW = kc*Traits::WorkSpaceFactor;
246 ei_declare_aligned_stack_constructed_variable(Scalar, blockA, sizeA, blocking.blockA());
247 ei_declare_aligned_stack_constructed_variable(Scalar, blockB, sizeB, blocking.blockB());
248 ei_declare_aligned_stack_constructed_variable(Scalar, blockW, sizeW, blocking.blockW());
250 Matrix<Scalar,SmallPanelWidth,SmallPanelWidth,RhsStorageOrder> triangularBuffer;
251 triangularBuffer.setZero();
252 if((Mode&ZeroDiag)==ZeroDiag)
253 triangularBuffer.diagonal().setZero();
255 triangularBuffer.diagonal().setOnes();
257 gebp_kernel<Scalar, Scalar, Index, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
258 gemm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs;
259 gemm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder> pack_rhs;
260 gemm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder,false,true> pack_rhs_panel;
262 for(Index k2=IsLower ? 0 : depth;
263 IsLower ? k2<depth : k2>0;
264 IsLower ? k2+=kc : k2-=kc)
266 Index actual_kc = (std::min)(IsLower ? depth-k2 : k2, kc);
267 Index actual_k2 = IsLower ? k2 : k2-actual_kc;
270 if(IsLower && (k2<cols) && (actual_k2+actual_kc>cols))
273 k2 = actual_k2 + actual_kc - kc;
277 Index rs = IsLower ? (std::min)(cols,actual_k2) : cols - k2;
279 Index ts = (IsLower && actual_k2>=cols) ? 0 : actual_kc;
281 Scalar* geb = blockB+ts*ts;
283 pack_rhs(geb, &rhs(actual_k2,IsLower ? 0 : k2), rhsStride, actual_kc, rs);
288 for (Index j2=0; j2<actual_kc; j2+=SmallPanelWidth)
290 Index actualPanelWidth = std::min<Index>(actual_kc-j2, SmallPanelWidth);
291 Index actual_j2 = actual_k2 + j2;
292 Index panelOffset = IsLower ? j2+actualPanelWidth : 0;
293 Index panelLength = IsLower ? actual_kc-j2-actualPanelWidth : j2;
295 pack_rhs_panel(blockB+j2*actual_kc,
296 &rhs(actual_k2+panelOffset, actual_j2), rhsStride,
297 panelLength, actualPanelWidth,
298 actual_kc, panelOffset);
301 for (Index j=0;j<actualPanelWidth;++j)
304 triangularBuffer.coeffRef(j,j) = rhs(actual_j2+j,actual_j2+j);
305 for (Index k=IsLower ? j+1 : 0; IsLower ? k<actualPanelWidth : k<j; ++k)
306 triangularBuffer.coeffRef(k,j) = rhs(actual_j2+k,actual_j2+j);
309 pack_rhs_panel(blockB+j2*actual_kc,
310 triangularBuffer.data(), triangularBuffer.outerStride(),
311 actualPanelWidth, actualPanelWidth,
316 for (Index i2=0; i2<rows; i2+=mc)
318 const Index actual_mc = (std::min)(mc,rows-i2);
319 pack_lhs(blockA, &lhs(i2, actual_k2), lhsStride, actual_kc, actual_mc);
324 for (Index j2=0; j2<actual_kc; j2+=SmallPanelWidth)
326 Index actualPanelWidth = std::min<Index>(actual_kc-j2, SmallPanelWidth);
327 Index panelLength = IsLower ? actual_kc-j2 : j2+actualPanelWidth;
328 Index blockOffset = IsLower ? j2 : 0;
330 gebp_kernel(res+i2+(actual_k2+j2)*resStride, resStride,
331 blockA, blockB+j2*actual_kc,
332 actual_mc, panelLength, actualPanelWidth,
334 actual_kc, actual_kc,
335 blockOffset, blockOffset,
339 gebp_kernel(res+i2+(IsLower ? 0 : k2)*resStride, resStride,
340 blockA, geb, actual_mc, actual_kc, rs,
342 -1, -1, 0, 0, blockW);
352 template<
int Mode,
bool LhsIsTriangular,
typename Lhs,
typename Rhs>
353 struct traits<TriangularProduct<Mode,LhsIsTriangular,Lhs,false,Rhs,false> >
354 : traits<ProductBase<TriangularProduct<Mode,LhsIsTriangular,Lhs,false,Rhs,false>, Lhs, Rhs> >
359 template<
int Mode,
bool LhsIsTriangular,
typename Lhs,
typename Rhs>
360 struct TriangularProduct<Mode,LhsIsTriangular,Lhs,false,Rhs,false>
361 :
public ProductBase<TriangularProduct<Mode,LhsIsTriangular,Lhs,false,Rhs,false>, Lhs, Rhs >
363 EIGEN_PRODUCT_PUBLIC_INTERFACE(TriangularProduct)
365 TriangularProduct(const Lhs& lhs, const Rhs& rhs) : Base(lhs,rhs) {}
367 template<
typename Dest>
void scaleAndAddTo(Dest& dst, Scalar alpha)
const
369 typename internal::add_const_on_value_type<ActualLhsType>::type lhs = LhsBlasTraits::extract(m_lhs);
370 typename internal::add_const_on_value_type<ActualRhsType>::type rhs = RhsBlasTraits::extract(m_rhs);
372 Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(m_lhs)
373 * RhsBlasTraits::extractScalarFactor(m_rhs);
376 Lhs::MaxRowsAtCompileTime, Rhs::MaxColsAtCompileTime, Lhs::MaxColsAtCompileTime,4> BlockingType;
379 Index stripedRows = ((!LhsIsTriangular) || (IsLower)) ? lhs.rows() : (std::min)(lhs.rows(),lhs.cols());
380 Index stripedCols = ((LhsIsTriangular) || (!IsLower)) ? rhs.cols() : (std::min)(rhs.cols(),rhs.rows());
381 Index stripedDepth = LhsIsTriangular ? ((!IsLower) ? lhs.cols() : (std::min)(lhs.cols(),lhs.rows()))
382 : ((IsLower) ? rhs.rows() : (std::min)(rhs.rows(),rhs.cols()));
384 BlockingType blocking(stripedRows, stripedCols, stripedDepth);
386 internal::product_triangular_matrix_matrix<Scalar, Index,
387 Mode, LhsIsTriangular,
388 (internal::traits<_ActualLhsType>::Flags&
RowMajorBit) ?
RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate,
392 stripedRows, stripedCols, stripedDepth,
393 &lhs.coeffRef(0,0), lhs.outerStride(),
394 &rhs.coeffRef(0,0), rhs.outerStride(),
395 &dst.coeffRef(0,0), dst.outerStride(),
396 actualAlpha, blocking
403 #endif // EIGEN_TRIANGULAR_MATRIX_MATRIX_H