/usr/include/fflas-ffpack/fflas/fflas_pftrsm.inl is in fflas-ffpack-common 2.2.2-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 | /* -*- mode: C++; tab-width: 4; indent-tabs-mode: t; c-basic-offset: 4 -*- */
// vim:sts=4:sw=4:ts=4:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
/* fflas/fflas_pftrsm.inl
* Copyright (C) 2013 Ziad Sultan
*
* Written by Ziad Sultan < Ziad.Sultan@imag.fr >
* Time-stamp: <18 Dec 15 16:09:24 Jean-Guillaume.Dumas@imag.fr>
*
* ========LICENCE========
* This file is part of the library FFLAS-FFPACK.
*
* FFLAS-FFPACK is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*.
*/
#ifndef __FFLASFFPACK_fflas_pftrsm_INL
#define __FFLASFFPACK_fflas_pftrsm_INL
#define PTRSM_HYBRID_THRESHOLD 256
#include "fflas-ffpack/paladin/parallel.h"
namespace FFLAS {
template<class Field, class Cut, class Param>
inline typename Field::Element_ptr
ftrsm( const Field& F,
const FFLAS::FFLAS_SIDE Side,
const FFLAS::FFLAS_UPLO UpLo,
const FFLAS::FFLAS_TRANSPOSE TA,
const FFLAS::FFLAS_DIAG Diag,
const size_t m,
const size_t n,
const typename Field::Element alpha,
#ifdef __FFLAS__TRSM_READONLY
typename Field::ConstElement_ptr
#else
typename Field::Element_ptr
#endif
A, const size_t lda,
typename Field::Element_ptr B, const size_t ldb,
TRSMHelper <StructureHelper::Iterative, ParSeqHelper::Parallel<Cut,Param> > & H)
// const FFLAS::CuttingStrategy method,
// const size_t numThreads)
{
typedef TRSMHelper<StructureHelper::Recursive,ParSeqHelper::Sequential> seqRecHelper;
SYNCH_GROUP(
seqRecHelper SeqH(H);
if(Side == FflasRight){
FORBLOCK1D(iter, m, H.parseq,
TASK(MODE(READ(A[0]) CONSTREFERENCE(F, A, B, SeqH,H) READWRITE(B[iter.begin()*ldb])), ftrsm( F, Side, UpLo, TA, Diag, iter.end()-iter.begin(), n, alpha, A, lda, B + iter.begin()*ldb, ldb, SeqH));
);
} else {
FORBLOCK1D(iter, n, H.parseq,
// seqRecHelper SeqH(H);
TASK(MODE(READ(A[0]) CONSTREFERENCE(F, A, B, SeqH,H) READWRITE(B[iter.begin()])), ftrsm(F, Side, UpLo, TA, Diag, m, iter.end()-iter.begin(), alpha, A , lda, B + iter.begin(), ldb, SeqH));
);
}
);
return B;
}
template<class Field, class Cut, class Param>
inline typename Field::Element_ptr
ftrsm( const Field& F,
const FFLAS::FFLAS_SIDE Side,
const FFLAS::FFLAS_UPLO UpLo,
const FFLAS::FFLAS_TRANSPOSE TA,
const FFLAS::FFLAS_DIAG Diag,
const size_t m,
const size_t n,
const typename Field::Element alpha,
#ifdef __FFLAS__TRSM_READONLY
typename Field::ConstElement_ptr
#else
typename Field::Element_ptr
#endif
A, const size_t lda,
typename Field::Element_ptr B, const size_t ldb,
TRSMHelper <StructureHelper::Hybrid, ParSeqHelper::Parallel<Cut, Param> > & H)
// const FFLAS::CuttingStrategy method,
// const size_t numThreads)
{
if(Side == FflasRight){
size_t nt = H.parseq.numthreads();
size_t nt_it,nt_rec;
if (m/PTRSM_HYBRID_THRESHOLD < nt){
nt_it = (int)ceil(double(m)/PTRSM_HYBRID_THRESHOLD);
nt_rec = (int)ceil(double(nt)/double(nt_it));
} else { nt_it = nt; nt_rec = 1;}
// ForStrategy1D<size_t> iter(m, ParSeqHelper::Parallel((size_t)nt_it,H.parseq.method));
// for (iter.begin(); ! iter.end(); ++iter) {
// SYNCH_GROUP(H.parseq.numthreads(),
SYNCH_GROUP(
ParSeqHelper::Parallel<Cut,Param> psh(nt_rec);
TRSMHelper<StructureHelper::Recursive, ParSeqHelper::Parallel<Cut,Param> > SeqH (psh);
H.parseq.set_numthreads(nt_it);
FORBLOCK1D(iter, m, H.parseq,
// std::cerr<<"trsm_rec nt = "<<nt_rec<<std::endl;
TASK(MODE(READ(A) CONSTREFERENCE(F, A, B, SeqH) READWRITE(B[iter.begin()*ldb])),
ftrsm( F, Side, UpLo, TA, Diag, iter.end()-iter.begin(), n, alpha, A, lda, B + iter.begin()*ldb, ldb, SeqH));
);
);
} else {
size_t nt = H.parseq.numthreads();
size_t nt_it=nt;
size_t nt_rec=1;
if (nt_it*PTRSM_HYBRID_THRESHOLD >= n){
nt_it>>=1;
nt_rec<<=1;
while(nt_it*PTRSM_HYBRID_THRESHOLD >= n){
nt_it>>=1;
nt_rec<<=1;
}
nt_it<<=1;
nt_rec>>=1;
}
// if ((int)n/PTRSM_HYBRID_THRESHOLD < nt){
// nt_it = std::min(nt,(int)ceil(double(n)/PTRSM_HYBRID_THRESHOLD));
// nt_rec = ceil(double(nt)/nt_it);
// } else { nt_it = nt; nt_rec = 1;}
// ForStrategy1D<size_t> iter(n, ParSeqHelper::Parallel((size_t)nt_it,H.parseq.method));
// for (iter.begin(); ! iter.end(); ++iter) {
// std::cerr<<"trsm_rec nt_it = "<<nt_it<<std::endl;
// std::cerr<<"trsm_rec nt_rec = "<<nt_rec<<std::endl;
SYNCH_GROUP(
ParSeqHelper::Parallel<Cut,Param> psh(nt_rec);
TRSMHelper<StructureHelper::Recursive, ParSeqHelper::Parallel<Cut,Param> > SeqH (psh);
H.parseq.set_numthreads(nt_it);
FORBLOCK1D(iter, n, H.parseq,
TASK(MODE(READ(A) CONSTREFERENCE(F, A, B, SeqH) READWRITE(B[iter.begin()])), ftrsm( F, Side, UpLo, TA, Diag, m, iter.end()-iter.begin(), alpha, A , lda, B + iter.begin(), ldb, SeqH));
);
);
}
return B;
}
} // FFLAS
#endif // __FFLASFFPACK_fflas_pftrsm_INL
|