This file is indexed.

/usr/include/fflas-ffpack/fflas/fflas_sparse/csr_hyb/csr_hyb_pspmv.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
/* -*- 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_CSR_HYB_pspmv_INL
#define __FFLASFFPACK_fflas_sparse_CSR_HYB_pspmv_INL

#ifdef __FFLASFFPACK_USE_TBB
#include "tbb/parallel_for.h"
#include "tbb/blocked_range.h"
#endif

namespace FFLAS {
namespace sparse_details_impl {
template <class Field>
inline void pfspmv(const Field &F, const Sparse<Field, SparseMatrix_t::CSR_HYB> &A, typename Field::ConstElement_ptr x_,
                   typename Field::Element_ptr y_, FieldCategories::GenericTag) {
    assume_aligned(st, A.st, (size_t)Alignment::CACHE_LINE);
    assume_aligned(dat, A.dat, (size_t)Alignment::CACHE_LINE);
    assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
    assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
    assume_aligned(y, y_, (size_t)Alignment::DEFAULT);
#ifdef __FFLASFFPACK_USE_TBB
    int step = __FFLASFFPACK_CACHE_LINE_SIZE / sizeof(typename Field::Element);
    tbb::parallel_for(tbb::blocked_range<index_t>(0, A.m, step),
                      [&F, &A, x, y, dat, st, col](const tbb::blocked_range<index_t> &r) {
        for (index_t i = r.begin(), end = r.end(); i < end; ++i) {
            index_t start = st[4 * i], stop = st[4 * i + 1];
            for (uint64_t j = start; j < stop; ++j) {
                F.subin(y[i], x[col[j]]);
            }
            start = st[4 * i + 1], stop = st[4 * i + 2];
            for (uint64_t j = start; j < stop; ++j) {
                F.addin(y[i], x[col[j]]);
            }
            start = st[4 * i + 2], stop = st[4 * (i + 1)];
            index_t startDat = st[4 * i + 3];
            for (uint64_t j = start, k = 0; j < stop; ++j, ++k) {
                F.axpyin(y[i], dat[startDat + k], x[col[j]]);
            }
        }
    });
#else
#pragma omp parallel for
    for (uint64_t i = 0; i < A.m; ++i) {
        index_t start = st[4 * i], stop = st[4 * i + 1];
        for (uint64_t j = start; j < stop; ++j) {
            F.subin(y[i], x[col[j]]);
        }
        start = st[4 * i + 1], stop = st[4 * i + 2];
        for (uint64_t j = start; j < stop; ++j) {
            F.addin(y[i], x[col[j]]);
        }
        start = st[4 * i + 2], stop = st[4 * (i + 1)];
        index_t startDat = st[4 * i + 3];
        for (uint64_t j = start, k = 0; j < stop; ++j, ++k) {
            F.axpyin(y[i], dat[startDat + k], x[col[j]]);
        }
    }
#endif
}

template <class Field>
inline void pfspmv(const Field &F, const Sparse<Field, SparseMatrix_t::CSR_HYB> &A, typename Field::ConstElement_ptr x_,
                   typename Field::Element_ptr y_, FieldCategories::UnparametricTag) {
    assume_aligned(st, A.st, (size_t)Alignment::CACHE_LINE);
    assume_aligned(dat, A.dat, (size_t)Alignment::CACHE_LINE);
    assume_aligned(col, A.col, (size_t)Alignment::CACHE_LINE);
    assume_aligned(x, x_, (size_t)Alignment::DEFAULT);
    assume_aligned(y, y_, (size_t)Alignment::DEFAULT);
#ifdef __FFLASFFPACK_USE_TBB
    int step = __FFLASFFPACK_CACHE_LINE_SIZE / sizeof(typename Field::Element);
    tbb::parallel_for(tbb::blocked_range<index_t>(0, A.m, step),
                      [&F, &A, x, y, col, dat, st](const tbb::blocked_range<index_t> &r) {
        for (index_t i = r.begin(), end = r.end(); i < end; ++i) {
            index_t start = st[4 * i], stop = st[4 * i + 1];
            index_t diff = stop - start;
            typename Field::Element y1 = 0, y2 = 0, y3 = 0, y4 = 0;
            uint64_t j = 0;
            for (; j < ROUND_DOWN(diff, 4); j += 4) {
                y1 += x[col[start + j]];
                y2 += x[col[start + j + 1]];
                y3 += x[col[start + j + 2]];
                y4 += x[col[start + j + 3]];
            }
            for (; j < diff; ++j) {
                y1 += x[col[start + j]];
            }
            y[i] -= y1 + y2 + y3 + y4;
            y1 = 0;
            y2 = 0;
            y3 = 0;
            y4 = 0;
            start = st[4 * i + 1], stop = st[4 * i + 2];
            diff = stop - start;
            j = 0;
            for (; j < ROUND_DOWN(diff, 4); j += 4) {
                y1 += x[col[start + j]];
                y2 += x[col[start + j + 1]];
                y3 += x[col[start + j + 2]];
                y4 += x[col[start + j + 3]];
            }
            for (; j < diff; ++j) {
                y1 += x[col[start + j]];
            }
            y[i] += y1 + y2 + y3 + y4;
            y1 = 0;
            y2 = 0;
            y3 = 0;
            y4 = 0;
            start = st[4 * i + 2], stop = st[4 * (i + 1)];
            diff = stop - start;
            index_t startDat = st[4 * i + 3];
            j = 0;
            for (; j < ROUND_DOWN(diff, 4); j += 4) {
                y1 += dat[startDat + j] * x[col[start + j]];
                y2 += dat[startDat + j + 1] * x[col[start + j + 1]];
                y3 += dat[startDat + j + 2] * x[col[start + j + 2]];
                y4 += dat[startDat + j + 3] * x[col[start + j + 3]];
            }
            for (; j < diff; ++j) {
                y1 += dat[startDat + j] * x[col[start + j]];
            }
            y[i] += y1 + y2 + y3 + y4;
        }
    });
#else
#pragma omp parallel for
    for (uint64_t i = 0; i < A.m; ++i) {
        index_t start = st[4 * i], stop = st[4 * i + 1];
        index_t diff = stop - start;
        typename Field::Element y1 = 0, y2 = 0, y3 = 0, y4 = 0;
        uint64_t j = 0;
        for (; j < ROUND_DOWN(diff, 4); j += 4) {
            y1 += x[col[start + j]];
            y2 += x[col[start + j + 1]];
            y3 += x[col[start + j + 2]];
            y4 += x[col[start + j + 3]];
        }
        for (; j < diff; ++j) {
            y1 += x[col[start + j]];
        }
        y[i] -= y1 + y2 + y3 + y4;
        y1 = 0;
        y2 = 0;
        y3 = 0;
        y4 = 0;
        start = st[4 * i + 1], stop = st[4 * i + 2];
        diff = stop - start;
        j = 0;
        for (; j < ROUND_DOWN(diff, 4); j += 4) {
            y1 += x[col[start + j]];
            y2 += x[col[start + j + 1]];
            y3 += x[col[start + j + 2]];
            y4 += x[col[start + j + 3]];
        }
        for (; j < diff; ++j) {
            y1 += x[col[start + j]];
        }
        y[i] += y1 + y2 + y3 + y4;
        y1 = 0;
        y2 = 0;
        y3 = 0;
        y4 = 0;
        start = st[4 * i + 2], stop = st[4 * (i + 1)];
        diff = stop - start;
        index_t startDat = st[4 * i + 3];
        j = 0;
        for (; j < ROUND_DOWN(diff, 4); j += 4) {
            y1 += dat[startDat + j] * x[col[start + j]];
            y2 += dat[startDat + j + 1] * x[col[start + j + 1]];
            y3 += dat[startDat + j + 2] * x[col[start + j + 2]];
            y4 += dat[startDat + j + 3] * x[col[start + j + 3]];
        }
        for (; j < diff; ++j) {
            y1 += dat[startDat + j] * x[col[start + j]];
        }
        y[i] += y1 + y2 + y3 + y4;
    }
#endif
}

template <class Field>
inline void pfspmv(const Field &F, const Sparse<Field, SparseMatrix_t::CSR_HYB> &A, typename Field::ConstElement_ptr x_,
                   typename Field::Element_ptr y_, const int64_t kmax) {
    // TODO
}

} // CSR_HYB_details

} // FFLAS

#endif //  __FFLASFFPACK_fflas_CSR_HYB_pspmv_INL