00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025 #ifndef EIGEN_TRIANGULAR_SOLVER_MATRIX_H
00026 #define EIGEN_TRIANGULAR_SOLVER_MATRIX_H
00027
00028 namespace Eigen {
00029
00030 namespace internal {
00031
00032
00033 template <typename Scalar, typename Index, int Side, int Mode, bool Conjugate, int TriStorageOrder>
00034 struct triangular_solve_matrix<Scalar,Index,Side,Mode,Conjugate,TriStorageOrder,RowMajor>
00035 {
00036 static EIGEN_DONT_INLINE void run(
00037 Index size, Index cols,
00038 const Scalar* tri, Index triStride,
00039 Scalar* _other, Index otherStride)
00040 {
00041 triangular_solve_matrix<
00042 Scalar, Index, Side==OnTheLeft?OnTheRight:OnTheLeft,
00043 (Mode&UnitDiag) | ((Mode&Upper) ? Lower : Upper),
00044 NumTraits<Scalar>::IsComplex && Conjugate,
00045 TriStorageOrder==RowMajor ? ColMajor : RowMajor, ColMajor>
00046 ::run(size, cols, tri, triStride, _other, otherStride);
00047 }
00048 };
00049
00050
00051
00052 template <typename Scalar, typename Index, int Mode, bool Conjugate, int TriStorageOrder>
00053 struct triangular_solve_matrix<Scalar,Index,OnTheLeft,Mode,Conjugate,TriStorageOrder,ColMajor>
00054 {
00055 static EIGEN_DONT_INLINE void run(
00056 Index size, Index otherSize,
00057 const Scalar* _tri, Index triStride,
00058 Scalar* _other, Index otherStride)
00059 {
00060 Index cols = otherSize;
00061 const_blas_data_mapper<Scalar, Index, TriStorageOrder> tri(_tri,triStride);
00062 blas_data_mapper<Scalar, Index, ColMajor> other(_other,otherStride);
00063
00064 typedef gebp_traits<Scalar,Scalar> Traits;
00065 enum {
00066 SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
00067 IsLower = (Mode&Lower) == Lower
00068 };
00069
00070 Index kc = size;
00071 Index mc = size;
00072 Index nc = cols;
00073 computeProductBlockingSizes<Scalar,Scalar,4>(kc, mc, nc);
00074
00075 std::size_t sizeW = kc*Traits::WorkSpaceFactor;
00076 std::size_t sizeB = sizeW + kc*cols;
00077 ei_declare_aligned_stack_constructed_variable(Scalar, blockA, kc*mc, 0);
00078 ei_declare_aligned_stack_constructed_variable(Scalar, allocatedBlockB, sizeB, 0);
00079 Scalar* blockB = allocatedBlockB + sizeW;
00080 Scalar* blockW = allocatedBlockB;
00081
00082 conj_if<Conjugate> conj;
00083 gebp_kernel<Scalar, Scalar, Index, Traits::mr, Traits::nr, Conjugate, false> gebp_kernel;
00084 gemm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, TriStorageOrder> pack_lhs;
00085 gemm_pack_rhs<Scalar, Index, Traits::nr, ColMajor, false, true> pack_rhs;
00086
00087
00088
00089 std::ptrdiff_t l1, l2;
00090 manage_caching_sizes(GetAction, &l1, &l2);
00091 Index subcols = cols>0 ? l2/(4 * sizeof(Scalar) * otherStride) : 0;
00092 subcols = std::max<Index>((subcols/Traits::nr)*Traits::nr, Traits::nr);
00093
00094 for(Index k2=IsLower ? 0 : size;
00095 IsLower ? k2<size : k2>0;
00096 IsLower ? k2+=kc : k2-=kc)
00097 {
00098 const Index actual_kc = (std::min)(IsLower ? size-k2 : k2, kc);
00099
00100
00101
00102
00103
00104
00105
00106
00107
00108
00109
00110
00111
00112
00113 for(Index j2=0; j2<cols; j2+=subcols)
00114 {
00115 Index actual_cols = (std::min)(cols-j2,subcols);
00116
00117 for (Index k1=0; k1<actual_kc; k1+=SmallPanelWidth)
00118 {
00119 Index actualPanelWidth = std::min<Index>(actual_kc-k1, SmallPanelWidth);
00120
00121 for (Index k=0; k<actualPanelWidth; ++k)
00122 {
00123
00124 Index i = IsLower ? k2+k1+k : k2-k1-k-1;
00125 Index s = IsLower ? k2+k1 : i+1;
00126 Index rs = actualPanelWidth - k - 1;
00127
00128 Scalar a = (Mode & UnitDiag) ? Scalar(1) : Scalar(1)/conj(tri(i,i));
00129 for (Index j=j2; j<j2+actual_cols; ++j)
00130 {
00131 if (TriStorageOrder==RowMajor)
00132 {
00133 Scalar b(0);
00134 const Scalar* l = &tri(i,s);
00135 Scalar* r = &other(s,j);
00136 for (Index i3=0; i3<k; ++i3)
00137 b += conj(l[i3]) * r[i3];
00138
00139 other(i,j) = (other(i,j) - b)*a;
00140 }
00141 else
00142 {
00143 Index s = IsLower ? i+1 : i-rs;
00144 Scalar b = (other(i,j) *= a);
00145 Scalar* r = &other(s,j);
00146 const Scalar* l = &tri(s,i);
00147 for (Index i3=0;i3<rs;++i3)
00148 r[i3] -= b * conj(l[i3]);
00149 }
00150 }
00151 }
00152
00153 Index lengthTarget = actual_kc-k1-actualPanelWidth;
00154 Index startBlock = IsLower ? k2+k1 : k2-k1-actualPanelWidth;
00155 Index blockBOffset = IsLower ? k1 : lengthTarget;
00156
00157
00158 pack_rhs(blockB+actual_kc*j2, &other(startBlock,j2), otherStride, actualPanelWidth, actual_cols, actual_kc, blockBOffset);
00159
00160
00161 if (lengthTarget>0)
00162 {
00163 Index startTarget = IsLower ? k2+k1+actualPanelWidth : k2-actual_kc;
00164
00165 pack_lhs(blockA, &tri(startTarget,startBlock), triStride, actualPanelWidth, lengthTarget);
00166
00167 gebp_kernel(&other(startTarget,j2), otherStride, blockA, blockB+actual_kc*j2, lengthTarget, actualPanelWidth, actual_cols, Scalar(-1),
00168 actualPanelWidth, actual_kc, 0, blockBOffset, blockW);
00169 }
00170 }
00171 }
00172
00173
00174 {
00175 Index start = IsLower ? k2+kc : 0;
00176 Index end = IsLower ? size : k2-kc;
00177 for(Index i2=start; i2<end; i2+=mc)
00178 {
00179 const Index actual_mc = (std::min)(mc,end-i2);
00180 if (actual_mc>0)
00181 {
00182 pack_lhs(blockA, &tri(i2, IsLower ? k2 : k2-kc), triStride, actual_kc, actual_mc);
00183
00184 gebp_kernel(_other+i2, otherStride, blockA, blockB, actual_mc, actual_kc, cols, Scalar(-1));
00185 }
00186 }
00187 }
00188 }
00189 }
00190 };
00191
00192
00193
00194 template <typename Scalar, typename Index, int Mode, bool Conjugate, int TriStorageOrder>
00195 struct triangular_solve_matrix<Scalar,Index,OnTheRight,Mode,Conjugate,TriStorageOrder,ColMajor>
00196 {
00197 static EIGEN_DONT_INLINE void run(
00198 Index size, Index otherSize,
00199 const Scalar* _tri, Index triStride,
00200 Scalar* _other, Index otherStride)
00201 {
00202 Index rows = otherSize;
00203 const_blas_data_mapper<Scalar, Index, TriStorageOrder> rhs(_tri,triStride);
00204 blas_data_mapper<Scalar, Index, ColMajor> lhs(_other,otherStride);
00205
00206 typedef gebp_traits<Scalar,Scalar> Traits;
00207 enum {
00208 RhsStorageOrder = TriStorageOrder,
00209 SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
00210 IsLower = (Mode&Lower) == Lower
00211 };
00212
00213
00214
00215
00216 Index kc = size;
00217 Index mc = size;
00218 Index nc = rows;
00219 computeProductBlockingSizes<Scalar,Scalar,4>(kc, mc, nc);
00220
00221 std::size_t sizeW = kc*Traits::WorkSpaceFactor;
00222 std::size_t sizeB = sizeW + kc*size;
00223 ei_declare_aligned_stack_constructed_variable(Scalar, blockA, kc*mc, 0);
00224 ei_declare_aligned_stack_constructed_variable(Scalar, allocatedBlockB, sizeB, 0);
00225 Scalar* blockB = allocatedBlockB + sizeW;
00226
00227 conj_if<Conjugate> conj;
00228 gebp_kernel<Scalar,Scalar, Index, Traits::mr, Traits::nr, false, Conjugate> gebp_kernel;
00229 gemm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder> pack_rhs;
00230 gemm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder,false,true> pack_rhs_panel;
00231 gemm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, ColMajor, false, true> pack_lhs_panel;
00232
00233 for(Index k2=IsLower ? size : 0;
00234 IsLower ? k2>0 : k2<size;
00235 IsLower ? k2-=kc : k2+=kc)
00236 {
00237 const Index actual_kc = (std::min)(IsLower ? k2 : size-k2, kc);
00238 Index actual_k2 = IsLower ? k2-actual_kc : k2 ;
00239
00240 Index startPanel = IsLower ? 0 : k2+actual_kc;
00241 Index rs = IsLower ? actual_k2 : size - actual_k2 - actual_kc;
00242 Scalar* geb = blockB+actual_kc*actual_kc;
00243
00244 if (rs>0) pack_rhs(geb, &rhs(actual_k2,startPanel), triStride, actual_kc, rs);
00245
00246
00247
00248 {
00249 for (Index j2=0; j2<actual_kc; j2+=SmallPanelWidth)
00250 {
00251 Index actualPanelWidth = std::min<Index>(actual_kc-j2, SmallPanelWidth);
00252 Index actual_j2 = actual_k2 + j2;
00253 Index panelOffset = IsLower ? j2+actualPanelWidth : 0;
00254 Index panelLength = IsLower ? actual_kc-j2-actualPanelWidth : j2;
00255
00256 if (panelLength>0)
00257 pack_rhs_panel(blockB+j2*actual_kc,
00258 &rhs(actual_k2+panelOffset, actual_j2), triStride,
00259 panelLength, actualPanelWidth,
00260 actual_kc, panelOffset);
00261 }
00262 }
00263
00264 for(Index i2=0; i2<rows; i2+=mc)
00265 {
00266 const Index actual_mc = (std::min)(mc,rows-i2);
00267
00268
00269 {
00270
00271 for (Index j2 = IsLower
00272 ? (actual_kc - ((actual_kc%SmallPanelWidth) ? Index(actual_kc%SmallPanelWidth)
00273 : Index(SmallPanelWidth)))
00274 : 0;
00275 IsLower ? j2>=0 : j2<actual_kc;
00276 IsLower ? j2-=SmallPanelWidth : j2+=SmallPanelWidth)
00277 {
00278 Index actualPanelWidth = std::min<Index>(actual_kc-j2, SmallPanelWidth);
00279 Index absolute_j2 = actual_k2 + j2;
00280 Index panelOffset = IsLower ? j2+actualPanelWidth : 0;
00281 Index panelLength = IsLower ? actual_kc - j2 - actualPanelWidth : j2;
00282
00283
00284 if(panelLength>0)
00285 {
00286 gebp_kernel(&lhs(i2,absolute_j2), otherStride,
00287 blockA, blockB+j2*actual_kc,
00288 actual_mc, panelLength, actualPanelWidth,
00289 Scalar(-1),
00290 actual_kc, actual_kc,
00291 panelOffset, panelOffset,
00292 allocatedBlockB);
00293 }
00294
00295
00296 for (Index k=0; k<actualPanelWidth; ++k)
00297 {
00298 Index j = IsLower ? absolute_j2+actualPanelWidth-k-1 : absolute_j2+k;
00299
00300 Scalar* r = &lhs(i2,j);
00301 for (Index k3=0; k3<k; ++k3)
00302 {
00303 Scalar b = conj(rhs(IsLower ? j+1+k3 : absolute_j2+k3,j));
00304 Scalar* a = &lhs(i2,IsLower ? j+1+k3 : absolute_j2+k3);
00305 for (Index i=0; i<actual_mc; ++i)
00306 r[i] -= a[i] * b;
00307 }
00308 Scalar b = (Mode & UnitDiag) ? Scalar(1) : Scalar(1)/conj(rhs(j,j));
00309 for (Index i=0; i<actual_mc; ++i)
00310 r[i] *= b;
00311 }
00312
00313
00314 pack_lhs_panel(blockA, _other+absolute_j2*otherStride+i2, otherStride,
00315 actualPanelWidth, actual_mc,
00316 actual_kc, j2);
00317 }
00318 }
00319
00320 if (rs>0)
00321 gebp_kernel(_other+i2+startPanel*otherStride, otherStride, blockA, geb,
00322 actual_mc, actual_kc, rs, Scalar(-1),
00323 -1, -1, 0, 0, allocatedBlockB);
00324 }
00325 }
00326 }
00327 };
00328
00329 }
00330
00331 }
00332
00333 #endif // EIGEN_TRIANGULAR_SOLVER_MATRIX_H