This file is indexed.

/usr/include/m4rie/trsm.h is in libm4rie-dev 20140914-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
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
/**
 * \file trsm.h
 * \brief Triangular System Solving with Matrices (TRSM).
 *
 * \author Martin Albrecht <martinralbrecht@googlemail.com>
 */

#ifndef TRSM_H
#define TRSM_H

/******************************************************************************
*
*            M4RIE: Linear Algebra over GF(2^e)
*
*    Copyright (C) 2011 Martin Albrecht <martinralbrecht@googlemail.com>
*
*  Distributed under the terms of the GNU General Public License (GEL)
*  version 2 or higher.
*
*    This code 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
*    General Public License for more details.
*
*  The full text of the GPL is available at:
*
*                  http://www.gnu.org/licenses/
******************************************************************************/

#include <m4rie/mzed.h>
#include <m4rie/mzd_slice.h>

#define MZED_TRSM_CUTOFF 512 /**< Crossover dimension to TRSM base cases */

/**
 * \brief \f$B = U^{-1} \cdot B\f$
 *
 * \param U Upper-triangular matrix (other entries are ignored).
 * \param B Matrix.
 * \param cutoff Crossover dimension to base case.
 *
 * \ingroup Triangular
 */

void _mzed_trsm_upper_left(const mzed_t *U, mzed_t *B, const rci_t cutoff);

/**
 * \brief \f$B = U^{-1} \cdot B\f$
 *
 * \param U Upper-triangular matrix (other entries are ignored).
 * \param B Matrix.
 *
 * \ingroup Triangular
 */

void mzed_trsm_upper_left_naive(const mzed_t *U, mzed_t *B);

/**
 * \brief \f$B = U^{-1} \cdot B\f$
 *
 * \param U Upper-triangular matrix (other entries are ignored).
 * \param B Matrix.
 *
 * \ingroup Triangular
 */

static inline void mzed_trsm_upper_left(const mzed_t *U, mzed_t *B) {
  _mzed_trsm_upper_left(U, B, MZED_TRSM_CUTOFF);
}

/**
 * \brief \f$B = U^{-1} \cdot B\f$
 *
 * \param U Upper-triangular matrix (other entries are ignored).
 * \param B Matrix.
 * \param cutoff Crossover dimension to base case.
 *
 * \ingroup Triangular
 */

void _mzd_slice_trsm_upper_left(const mzd_slice_t *U, mzd_slice_t *B, const rci_t cutoff);

/**
 * \brief \f$B = U^{-1} \cdot B\f$
 *
 * \param U Upper-triangular matrix (other entries are ignored).
 * \param B Matrix.
 *
 * \ingroup Triangular
 */

void mzd_slice_trsm_upper_left_naive(const mzd_slice_t *U, mzd_slice_t *B);

/**
 * \brief \f$B = U^{-1} \cdot B\f$
 *
 * \param U Upper-triangular matrix (other entries are ignored).
 * \param B Matrix.
 *
 * \ingroup Triangular
 */

static inline void mzd_slice_trsm_upper_left(const mzd_slice_t *U, mzd_slice_t *B) {
  _mzd_slice_trsm_upper_left(U, B, MZED_TRSM_CUTOFF);
}

/**
 * \brief \f$B = L^{-1} \cdot B\f$
 *
 * \param L Lower-triangular matrix (other entries are ignored).
 * \param B Matrix.
 * \param cutoff Crossover dimension to base case.
 *
 * \ingroup Triangular
 */

void _mzed_trsm_lower_left(const mzed_t *L, mzed_t *B, const rci_t cutoff);

/**
 * \brief \f$B = L^{-1} \cdot B\f$
 *
 * \param L Lower-triangular matrix (other entries are ignored).
 * \param B Matrix.
 *
 * \ingroup Triangular
 */

void mzed_trsm_lower_left_naive(const mzed_t *L, mzed_t *B);

/**
 * \brief \f$B = L^{-1} \cdot B\f$
 *
 * \param L Lower-triangular matrix (other entries are ignored).
 * \param B Matrix.
 *
 * \ingroup Triangular
 */

static inline void mzed_trsm_lower_left(const mzed_t *L, mzed_t *B) {
  _mzed_trsm_lower_left(L, B, MZED_TRSM_CUTOFF);
}

/**
 * \brief \f$B = L^{-1} \cdot B\f$
 *
 * \param L Lower-triangular matrix (other entries are ignored).
 * \param B Matrix.
 * \param cutoff Crossover dimension to base case.
 *
 * \ingroup Triangular
 */

void _mzd_slice_trsm_lower_left(const mzd_slice_t *L, mzd_slice_t *B, const rci_t cutoff);

/**
 * \brief \f$B = L^{-1} \cdot B\f$
 *
 * \param L Lower-triangular matrix (other entries are ignored).
 * \param B Matrix.
 *
 * \ingroup Triangular
 */

void mzd_slice_trsm_lower_left_naive(const mzd_slice_t *L, mzd_slice_t *B);

/**
 * \brief \f$B = L^{-1} \cdot B\f$
 *
 * \param L Lower-triangular matrix (other entries are ignored).
 * \param B Matrix.
 *
 * \ingroup Triangular
 */

static inline void mzd_slice_trsm_lower_left(const mzd_slice_t *L, mzd_slice_t *B) {
  _mzd_slice_trsm_lower_left(L, B, MZED_TRSM_CUTOFF);
}




#endif //TRSM_H