/usr/include/fflas-ffpack/fflas/fflas_fger.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 | /* -*- 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_fger.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_fger_INL
#define __FFLASFFPACK_fger_INL
namespace FFLAS {
template<class Field>
inline void
fger (const Field& F, const size_t M, const size_t N,
const typename Field::Element alpha,
const typename Field::Element * x, const size_t incx,
const typename Field::Element * y, const size_t incy,
typename Field::Element * A, const size_t lda)
{
typename Field::Element tmp;
const typename Field::Element* xi=x, *yj=y;
typename Field::Element* Ai=A;
if ( M < N ){
if ( F.areEqual( alpha, F.one ) )
for ( ; Ai < A+M*lda; Ai+=lda, xi+=incx ){
yj = y;
for (size_t j = 0; j < N; ++j, yj+=incy )
F.axpyin( *(Ai+j), *xi, *yj );
}
else if ( F.areEqual( alpha, F.mOne ) )
for ( ; Ai < A+M*lda; Ai+=lda, xi+=incx ){
F.neg( tmp, *xi );
yj = y;
for (size_t j = 0; j < N; ++j, yj+=incy )
F.axpyin( *(Ai+j), tmp, *yj );
}
else
for ( ; Ai < A+M*lda; Ai+=lda, xi+=incx ){
F.mul( tmp, alpha, *xi );
yj = y;
for (size_t j = 0; j < N; ++j, yj+=incy )
F.axpyin( *(Ai+j), tmp, *yj );
}
} else {
if ( F.areEqual( alpha, F.one ) ){
for ( ; Ai < A+N; ++Ai, yj+=incy ){
xi = x;
for (size_t i = 0; i < M; ++i, xi+=incx )
F.axpyin( *(Ai+i*lda), *xi, *yj );
}
}
else if ( F.areEqual( alpha, F.mOne ) )
for ( ; Ai < A+N; ++Ai, yj+=incy ){
F.neg( tmp, *yj );
xi = x;
for (size_t i = 0; i < M; ++i, xi+=incx )
F.axpyin( *(Ai+i*lda), *xi, tmp );
}
else
for ( ; Ai < A+N; ++Ai, yj+=incy ){
F.mul( tmp, alpha, *yj );
xi = x;
for (size_t i = 0; i < M; ++i, xi+=incx )
F.axpyin( *(Ai+i*lda), *xi, tmp );
}
}
}
template<>
inline void
fger( const DoubleDomain& , const size_t M, const size_t N,
const DoubleDomain::Element alpha,
const DoubleDomain::Element * x, const size_t incx,
const DoubleDomain::Element * y, const size_t incy,
DoubleDomain::Element * A, const size_t lda)
{
cblas_dger( CblasRowMajor, (int)M, (int)N, alpha, x, (int)incx, y, (int)incy, A, (int)lda );
}
} // FFLAS
#endif // __FFLASFFPACK_fger_INL
|