This file is indexed.

/usr/include/fflas-ffpack/fflas/fflas_sparse/coo/coo_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
/* -*- 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_coo_utils_INL
#define __FFLASFFPACK_fflas_sparse_coo_utils_INL

namespace FFLAS {

template <class Field> inline void sparse_delete(const Sparse<Field, SparseMatrix_t::COO> &A) {
    fflas_delete(A.dat);
    fflas_delete(A.col);
    fflas_delete(A.row);
}

template <class Field> inline void sparse_delete(const Sparse<Field, SparseMatrix_t::COO_ZO> &A) {
    fflas_delete(A.col);
    fflas_delete(A.row);
}

template <class Field, class IndexT>
inline void sparse_init(const Field &F, Sparse<Field, SparseMatrix_t::COO> &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;
    A.nElements = nnz;
    std::vector<uint64_t> rows(rowdim, 0);
    for (uint64_t i = 0; i < A.nnz; ++i)
        rows[row[i]]++;
    A.maxrow = *(std::max_element(rows.begin(), rows.end()));
    if (A.kmax > A.maxrow)
        A.delayed = true;
    A.col = fflas_new<index_t>(nnz, Alignment::CACHE_LINE);
    A.row = fflas_new<index_t>(nnz, Alignment::CACHE_LINE);
    A.dat = fflas_new(F, nnz, 1, Alignment::CACHE_LINE);

    for (uint64_t i = 0; i < nnz; ++i) {
        A.col[i] = (index_t)col[i];
        A.row[i] = (index_t)row[i];
        A.dat[i] = dat[i];
    }
}

template <class Field, class IndexT>
inline void sparse_init(const Field &F, Sparse<Field, SparseMatrix_t::COO_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;
    A.nElements = 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()));
    if (A.kmax > A.maxrow)
        A.delayed = true;

    A.col = fflas_new<index_t>(nnz, Alignment::CACHE_LINE);
    A.row = fflas_new<index_t>(nnz, Alignment::CACHE_LINE);

    for (uint64_t i = 0; i < nnz; ++i) {
        A.col[i] = (index_t)col[i];
        A.row[i] = (index_t)row[i];
    }
}
}

#endif // __FFLASFFPACK_fflas_sparse_coo_spmv_INL