This file is indexed.

/usr/include/fflas-ffpack/fflas/fflas_sparse/coo/coo_spmv.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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
/* -*- 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   Barowien Vialla <barowien.vialla@lirmm.fr>
 *
 *
 * ========LICENCE========
 * This file is part of the library FFLAS-FFPACK.
 *
 * FFLAS-FFPACK is free software: you can redirowribute 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 dirowributed 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 rowreet, Fifth Floor, Borowon, MA  02110-1301 USA
 * ========LICENCE========
 *.
 */

#ifndef __FFLASFFPACK_fflas_sparse_coo_spmv_INL
#define __FFLASFFPACK_fflas_sparse_coo_spmv_INL

namespace FFLAS {
namespace sparse_details_impl {
template <class Field>
inline void fspmv(const Field &F, const Sparse<Field, SparseMatrix_t::COO> &A, typename Field::ConstElement_ptr x_,
                  typename Field::Element_ptr y_, FieldCategories::GenericTag) {
    assume_aligned(dat, A.dat, (size_t)Alignment::CACHE_LINE);
    assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
    assume_aligned(row, A.row, (size_t)Alignment::CACHE_LINE);
    assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
    assume_aligned(y, y_, (size_t)Alignment::DEFAULT);
    index_t j = 0;
    for (; j < ROUND_DOWN(A.nnz, 4); j += 4) {
        F.axpyin(y[row[j]], dat[j], x[col[j]]);
        F.axpyin(y[row[j + 1]], dat[j + 1], x[col[j + 1]]);
        F.axpyin(y[row[j + 2]], dat[j + 2], x[col[j + 2]]);
        F.axpyin(y[row[j + 3]], dat[j + 3], x[col[j + 3]]);
    }
    for (; j < A.nnz; ++j) {
        F.axpyin(y[row[j]], dat[j], x[col[j]]);
    }
}

template <class Field>
inline void fspmv(const Field &F, const Sparse<Field, SparseMatrix_t::COO> &A, typename Field::ConstElement_ptr x_,
                  typename Field::Element_ptr y_, FieldCategories::UnparametricTag) {
    assume_aligned(dat, A.dat, (size_t)Alignment::CACHE_LINE);
    assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
    assume_aligned(row, A.row, (size_t)Alignment::CACHE_LINE);
    assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
    assume_aligned(y, y_, (size_t)Alignment::DEFAULT);
    index_t j = 0;
    for (; j < ROUND_DOWN(A.nnz, 4); j += 4) {
        y[row[j]] += dat[j] * x[col[j]];
        y[row[j + 1]] += dat[j + 1] * x[col[j + 1]];
        y[row[j + 2]] += dat[j + 2] * x[col[j + 2]];
        y[row[j + 3]] += dat[j + 3] * x[col[j + 3]];
    }
    for (; j < A.nnz; ++j) {
        y[row[j]] += dat[j] * x[col[j]];
    }
}

#ifdef __FFLASFFPACK_HAVE_MKL
inline void fspmv_mkl(const Givaro::DoubleDomain &F, const Sparse<Givaro::DoubleDomain, SparseMatrix_t::COO> &A,
		Givaro::DoubleDomain::ConstElement_ptr x_,
		Givaro::DoubleDomain::Element_ptr y_, FieldCategories::UnparametricTag) {
	// assume_aligned(dat, A.dat, (size_t)Alignment::CACHE_LINE);
	// assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
	// assume_aligned(row, A.row, (size_t)Alignment::CACHE_LINE);
	// assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
	// assume_aligned(y, y_, (size_t)Alignment::DEFAULT);

	MKL_INT A_nnz = A.nnz ;
	mkl_dcoomv(MKL_CONFIG::trans, &A.m , &A.n, &MKL_CONFIG::dalpha, MKL_CONFIG::metaChar,
		   A.dat, A.row, A.col, &A_nnz, x_,  &MKL_CONFIG::dbeta, y_ );

	// void mkl_dcoomv (char *transa, MKL_INT *m, MKL_INT *k, double *alpha, char *matdescra, double *val, MKL_INT *rowind, MKL_INT *colind, MKL_INT *nnz, double *x, double *beta, double *y);

}

inline void fspmv_mkl(const Givaro::FloatDomain &F, const Sparse<Givaro::FloatDomain, SparseMatrix_t::COO> &A,
		Givaro::FloatDomain::ConstElement_ptr x_,
		Givaro::FloatDomain::Element_ptr y_, FieldCategories::UnparametricTag) {
	// assume_aligned(dat, A.dat, (size_t)Alignment::CACHE_LINE);
	// assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
	// assume_aligned(row, A.row, (size_t)Alignment::CACHE_LINE);
	// assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
	// assume_aligned(y, y_, (size_t)Alignment::DEFAULT);

	MKL_INT A_nnz = A.nnz ;
	mkl_scoomv(MKL_CONFIG::trans, &A.m , &A.n, &MKL_CONFIG::salpha, MKL_CONFIG::metaChar,
		   A.dat, A.row, A.col, &A_nnz, x_,  &MKL_CONFIG::sbeta, y_ );

	// void mkl_scoomv (char *transa, MKL_INT *m, MKL_INT *k, float *alpha, char *matdescra, float *val, MKL_INT *rowind, MKL_INT *colind, MKL_INT *nnz, float *x, float *beta, float *y);

}
#endif // __FFLASFFPACK_HAVE_MKL



template <class Field>
inline void fspmv(const Field &F, const Sparse<Field, SparseMatrix_t::COO> &A, typename Field::ConstElement_ptr x_,
                  typename Field::Element_ptr y_, const uint64_t kmax) {
    assume_aligned(dat, A.dat, (size_t)Alignment::CACHE_LINE);
    assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
    assume_aligned(row, A.row, (size_t)Alignment::CACHE_LINE);
    assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
    assume_aligned(y, y_, (size_t)Alignment::DEFAULT);
    size_t w = 0;
    index_t larow_i = 0;
    typename Field::Element e;
    F.init(e, y[larow_i]);
    size_t accu = 0;

    while (w < A.nnz) {
        if (row[w] == larow_i) { // same line
            if (accu < (size_t)kmax) {
                e += dat[w] * x[col[w]];
                accu += 1;
            } else {
                F.axpyin(e, dat[w], x[col[w]]);
                accu = 0;
            }
        } else { // new line
            F.init(y[larow_i], e);
            larow_i = row[w];
            F.init(e, y[larow_i]);
            e += dat[w] * x[col[w]];
            accu = 1;
        }
        ++w;
    }
    F.init(y[larow_i], e);
}

template <class Field>
inline void fspmv_one(const Field &F, const Sparse<Field, SparseMatrix_t::COO_ZO> &A,
                      typename Field::ConstElement_ptr x_, typename Field::Element_ptr y_,
                      FieldCategories::GenericTag) {
    assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
    assume_aligned(row, A.row, (size_t)Alignment::CACHE_LINE);
    assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
    assume_aligned(y, y_, (size_t)Alignment::DEFAULT);
    index_t j = 0;
    for (; j < ROUND_DOWN(A.nnz, 4); j += 4) {
        F.addin(y[row[j]], x[col[j]]);
        F.addin(y[row[j + 1]], x[col[j + 1]]);
        F.addin(y[row[j + 2]], x[col[j + 2]]);
        F.addin(y[row[j + 3]], x[col[j + 3]]);
    }
    for (; j < A.nnz; ++j) {
        F.addin(y[row[j]], x[col[j]]);
    }
}

template <class Field>
inline void fspmv_mone(const Field &F, const Sparse<Field, SparseMatrix_t::COO_ZO> &A,
                       typename Field::ConstElement_ptr x_, typename Field::Element_ptr y_,
                       FieldCategories::GenericTag) {
    assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
    assume_aligned(row, A.row, (size_t)Alignment::CACHE_LINE);
    assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
    assume_aligned(y, y_, (size_t)Alignment::DEFAULT);
    index_t j = 0;
    for (; j < ROUND_DOWN(A.nnz, 4); j += 4) {
        F.subin(y[row[j]], x[col[j]]);
        F.subin(y[row[j + 1]], x[col[j + 1]]);
        F.subin(y[row[j + 2]], x[col[j + 2]]);
        F.subin(y[row[j + 3]], x[col[j + 3]]);
    }
    for (; j < A.nnz; ++j) {
        F.subin(y[row[j]], x[col[j]]);
    }
}

template <class Field>
inline void fspmv_one(const Field &F, const Sparse<Field, SparseMatrix_t::COO_ZO> &A,
                      typename Field::ConstElement_ptr x_, typename Field::Element_ptr y_,
                      FieldCategories::UnparametricTag) {
    assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
    assume_aligned(row, A.row, (size_t)Alignment::CACHE_LINE);
    assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
    assume_aligned(y, y_, (size_t)Alignment::DEFAULT);
    index_t j = 0;
    for (; j < ROUND_DOWN(A.nnz, 4); j += 4) {
        y[row[j]] += x[col[j]];
        y[row[j + 1]] += x[col[j + 1]];
        y[row[j + 2]] += x[col[j + 2]];
        y[row[j + 3]] += x[col[j + 3]];
    }
    for (; j < A.nnz; ++j) {
        y[row[j]] += x[col[j]];
    }
}

template <class Field>
inline void fspmv_mone(const Field &F, const Sparse<Field, SparseMatrix_t::COO_ZO> &A,
                       typename Field::ConstElement_ptr x_, typename Field::Element_ptr y_,
                       FieldCategories::UnparametricTag) {
    assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
    assume_aligned(row, A.row, (size_t)Alignment::CACHE_LINE);
    assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
    assume_aligned(y, y_, (size_t)Alignment::DEFAULT);
    index_t j = 0;
    for (; j < ROUND_DOWN(A.nnz, 4); j += 4) {
        y[row[j]] -= x[col[j]];
        y[row[j + 1]] -= x[col[j + 1]];
        y[row[j + 2]] -= x[col[j + 2]];
        y[row[j + 3]] -= x[col[j + 3]];
    }
    for (; j < A.nnz; ++j) {
        y[row[j]] -= x[col[j]];
    }
}

} // coo_details

} // FFLAS

#endif //  __FFLASFFPACK_fflas_coo_spmv_INL