/usr/include/fflas-ffpack/fflas/fflas_ftrsv.inl is in fflas-ffpack-common 1.6.0-1.
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 | /* -*- mode: C++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
/* fflas/fflas_ftrsv.inl
* Copyright (C) 2005 Clement Pernet
*
* Written by Clement Pernet <Clement.Pernet@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_ftrsv_INL
#define __FFLASFFPACK_ftrsv_INL
namespace FFLAS {
//---------------------------------------------------------------------
// ftrsv: TRiangular System solve with vector
// Computes X <- op(A^-1).X
// size of X is m
//---------------------------------------------------------------------
template<class Field>
inline void
ftrsv (const Field& F, const FFLAS_UPLO Uplo,
const FFLAS_TRANSPOSE TransA, const FFLAS_DIAG Diag,
const size_t N,const typename Field::Element * A, size_t lda,
typename Field::Element * X, int incX)
{
typename Field::Element * Xi,* Xj, * Ximax;
const typename Field::Element * Ai, * Aj;
if ( Uplo == FflasLower ){
if ( TransA == FflasTrans){
Ai = A+(N-1)*(lda+1); // bottom right entry of A
Ximax = Xi = X+(N-1)*incX;
for( ; Xi>=X; Ai-=lda+1,Xi-=incX ){
F.negin( *Xi );
for ( Xj = Xi+incX, Aj=Ai+lda; Xj<=Ximax;
Xj+=incX, Aj+=lda){
F.axpyin( *Xi, *Xj, *Aj );
}
if ( Diag==FflasNonUnit ){
F.divin(*Xi,*Ai);
}
F.negin( *Xi );
}
} // FflasTrans
else{
Ai = A;
Xi = X;
for( ; Xi<X+incX*N; Ai+=lda+1,Xi+=incX ){
F.negin( *Xi );
for ( Xj = Xi-incX, Aj=Ai-1; Xj>=X;
Xj-=incX, Aj--){
F.axpyin( *Xi, *Xj, *Aj );
}
if ( Diag==FflasNonUnit )
F.divin(*Xi,*Ai);
F.negin( *Xi );
}
}
} // FflasLower
else{
if ( TransA == FflasTrans){
Ai = A;
Xi = X;
for( ; Xi<X+N*incX; Ai+=lda+1,Xi+=incX ){
F.negin( *Xi );
for ( Xj = Xi-incX, Aj=Ai-lda; Xj>=X;
Xj-=incX, Aj-=lda){
F.axpyin( *Xi, *Xj, *Aj );
}
if ( Diag==FflasNonUnit )
F.divin(*Xi,*Ai);
F.negin( *Xi );
}
} // FflasTrans
else{
Ai = A+(lda+1)*(N-1);
Ximax = Xi = X+incX*(N-1);
for( ; Xi>=X; Ai-=lda+1,Xi-=incX ){
F.negin( *Xi );
for ( Xj = Xi+incX, Aj=Ai+1; Xj<=Ximax;
Xj+=incX, Aj++){
F.axpyin( *Xi, *Xj, *Aj );
}
if ( Diag==FflasNonUnit )
F.divin(*Xi,*Ai);
F.negin( *Xi );
}
}
}
}
}
#endif // __FFLASFFPACK_ftrsv_INL
|