This file is indexed.

/usr/include/m4rie/echelonform.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
/**
 * \file echelonform.h
 *
 * \brief Echelon forms.
 *
 * \author Martin Albrecht <martinralbrecht@googlemail.com>
 */

#ifndef M4RIE_ECHELONFORM_H
#define M4RIE_ECHELONFORM_H

/******************************************************************************
*
*            M4RIE: Linear Algebra over GF(2^e)
*
*    Copyright (C) 2010,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>
#include <m4rie/conversion.h>

/**
 * \brief Compute row echelon forms using PLE decomposition.
 *
 * Compute the (reduced) row echelon form of the matrix A.  If full=0,
 * then return the reduced row echelon. This function reduces echelon
 * forms to PLE (or PLUQ) decomposition.
 *
 * \param A Matrix
 * \param full REF or RREF.
 *
 * \ingroup Echelon
 */

rci_t mzd_slice_echelonize_ple(mzd_slice_t *A, int full);

/**
 * \brief Compute row echelon forms using PLE decomposition.
 *
 * Compute the (reduced) row echelon form of the matrix A.  If full=0,
 * then return the reduced REF. This function reduces echelon forms to
 * PLE (or PLUQ) decomposition.
 *
 * \param A Matrix
 * \param full REF or RREF.
 *
 * \ingroup Echelon
 *
 * \note This function converts A to bitslice representation and
 * back. Hence, it uses more memory than using
 * mzed_echelonize_newton_john() or mzd_slice_echelonize_ple()
 */

static inline rci_t mzed_echelonize_ple(mzed_t *A, int full) {
  mzd_slice_t *a = mzed_slice(NULL, A);
  rci_t r = mzd_slice_echelonize_ple(a, full);
  mzed_cling(A, a);
  mzd_slice_free(a);
  return r;
}

/**
 * \brief Compute row echelon forms.
 *
 * Compute the (reduced) row echelon form of the matrix A.  If full=0,
 * then return the reduced REF.
 *
 * \param A Matrix
 * \param full REF or RREF.
 *
 * \ingroup Echelon
 */

#define mzd_slice_echelonize mzd_slice_echelonize_ple

/**
 * \brief Compute row echelon forms.
 *
 * Compute the (reduced) row echelon form of the matrix A.  If full=0,
 * then return the reduced row echelon form.
 *
 * \param A Matrix
 * \param full REF or RREF.
 *
 * \ingroup Echelon
 */

rci_t mzed_echelonize(mzed_t *A, int full);

#endif //M4RIE_ECHELONFORM_H