/usr/include/fflas-ffpack/fflas/fflas_sparse/ell/ell_utils.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 | /* -*- 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
/*
* Copyright (C) 2014 the FFLAS-FFPACK group
*
* Written by Bastien Vialla <bastien.vialla@lirmm.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_sparse_ELL_utils_INL
#define __FFLASFFPACK_fflas_sparse_ELL_utils_INL
#include <vector>
namespace FFLAS {
template <class Field> inline void sparse_delete(const Sparse<Field, SparseMatrix_t::ELL> &A) {
fflas_delete(A.dat);
fflas_delete(A.col);
}
template <class Field> inline void sparse_delete(const Sparse<Field, SparseMatrix_t::ELL_ZO> &A) {
fflas_delete(A.col);
}
template <class Field, class IndexT>
inline void sparse_init(const Field &F, Sparse<Field, SparseMatrix_t::ELL> &A, const IndexT *row, const IndexT *col,
typename Field::ConstElement_ptr dat, uint64_t rowdim, uint64_t coldim, uint64_t nnz) {
A.kmax = Protected::DotProdBoundClassic(F, F.one);
A.m = rowdim;
A.n = coldim;
A.nnz = nnz;
// cout << A.m << " " << A.n << endl;
std::vector<uint64_t> rows(A.m, 0);
for (uint64_t i = 0; i < A.nnz; ++i)
rows[row[i]]++;
A.maxrow = *(std::max_element(rows.begin(), rows.end()));
// cout << "maxrow : " << A.maxrow << endl;
A.ld = A.maxrow;
if (A.kmax > A.maxrow)
A.delayed = true;
// cout << A.ld << " " << rowdim << " " << nnz << " " << A.ld*rowdim << endl;
A.nElements = A.m * A.ld;
A.col = fflas_new<index_t>(rowdim * A.ld, Alignment::CACHE_LINE);
A.dat = fflas_new(F, rowdim * A.ld, 1, Alignment::CACHE_LINE);
for (size_t i = 0; i < rowdim * A.ld; ++i) {
A.col[i] = 0;
F.assign(A.dat[i], F.zero);
}
size_t currow = row[0], it = 0;
for (size_t i = 0; i < nnz; ++i) {
if (row[i] != currow) {
it = 0;
currow = row[i];
}
A.col[row[i] * A.ld + it] = col[i];
A.dat[row[i] * A.ld + it] = dat[i];
++it;
}
}
template <class Field, class IndexT>
inline void sparse_init(const Field &F, Sparse<Field, SparseMatrix_t::ELL_ZO> &A, const IndexT *row, const IndexT *col,
typename Field::ConstElement_ptr dat, uint64_t rowdim, uint64_t coldim, uint64_t nnz) {
A.kmax = Protected::DotProdBoundClassic(F, F.one);
A.m = rowdim;
A.n = coldim;
A.nnz = nnz;
std::vector<uint64_t> rows(A.m, 0);
for (uint64_t i = 0; i < A.nnz; ++i)
rows[row[i]]++;
A.maxrow = *(std::max_element(rows.begin(), rows.end()));
A.ld = A.maxrow;
if (A.kmax > A.maxrow)
A.delayed = true;
A.nElements = A.m * A.ld;
A.col = fflas_new<index_t>(rowdim * A.ld, Alignment::CACHE_LINE);
for (size_t i = 0; i < rowdim * A.ld; ++i) {
A.col[i] = 0;
}
size_t currow = row[0], it = 0;
for (size_t i = 0; i < nnz; ++i) {
if (row[i] != currow) {
it = 0;
currow = row[i];
}
A.col[row[i] * A.ld + it] = col[i];
++it;
}
}
}
#endif
|