/usr/include/m4ri/ple_russian.h is in libm4ri-dev 20140914-2.
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 | /**
* \file ple_russian.h
* \brief PLE and PLUQ factorization using Gray codes.
*
* \author Martin Albrecht <martinralbrecht@googlemail.com>
*
* \example testsuite/test_ple.c
*/
#ifndef M4RI_PLE_RUSSIAN
#define M4RI_PLE_RUSSIAN
/*******************************************************************
*
* M4RI: Linear Algebra over GF(2)
*
* Copyright (C) 2008-2011 Martin Albrecht <M.R.Albrecht@rhul.ac.uk>
*
* Distributed under the terms of the GNU General Public License (GPL)
* 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 <m4ri/mzd.h>
#include <m4ri/mzp.h>
/**
* \brief PLE Elimination Tables
*/
typedef struct {
mzd_t *T; /*!< the actual table with 2^k entries */
rci_t *M; /*!< lookup for multiplication */
rci_t *E; /*!< lookup for elimination */
word *B; /*!< cache of first 64 entries in each row */
} ple_table_t;
/**
* Create new table with 2^k rows and ncols.
*
* \param k log2 of the number of rows (0 < k <= 8).
* \param ncols Number of columns.
*/
ple_table_t *ple_table_init(int k, rci_t ncols);
/**
* \brief Delete table T
*
* \param T PLE table.
*/
void ple_table_free(ple_table_t *T);
/**
* \brief PLE matrix decomposition of A using Gray codes.
*
* Returns (P,L,E,Q) satisfying PLE = A where P is a permutation
* matrix of dimension m x m, L is m x r unit lower triangular and S
* is an r x n matrix which is upper triangular except that its
* columns are permuted, that is E = UQ for U r x n upper triangular
* and Q is a n x n permutation matrix. The matrix L and E are stored
* in place over A.
*
* \param A Matrix.
* \param P Preallocated row permutation.
* \param Q Preallocated column permutation.
* \param k Size of Gray code tables.
*
* \return Rank of A.
*/
rci_t _mzd_ple_russian(mzd_t *A, mzp_t *P, mzp_t *Q, int k);
/**
* \brief PLUQ matrix decomposition of A using Gray codes.
*
* Returns (P,L,U,Q) satisfying PLUQ = A where P and Q are two
* permutation matrices, of dimension respectively m x m and n x n, L
* is m x r unit lower triangular and U is r x n upper triangular.
*
* \param A Matrix.
* \param P Preallocated row permutation.
* \param Q Preallocated column permutation.
* \param k Size of Gray code tables.
*
* \return Rank of A.
*/
rci_t _mzd_pluq_russian(mzd_t *A, mzp_t *P, mzp_t *Q, int k);
/**
* \brief PLE matrix decomposition of a submatrix for up to k columns
* starting at (r,c).
*
* Updates P and Q and modifies A in place. The buffer done afterwards
* holds how far a particular row was already eliminated.
*
* \param A Matrix.
* \param start_row Row Offset.
* \param stop_row Up to which row the matrix should be processed (exclusive).
* \param start_col Column Offset.
* \param k Size of Gray code tables.
* \param P Preallocated row permutation.
* \param Q Preallocated column permutation.
* \param pivots which column holds the i-th pivot
* \param done Preallocated temporary buffer.
* \param done_row Stores the last row which is already reduced processed after function execution.
* \param splitblock First block which is not considered by this function.
*
* \retval knar rank of the considered submatrix
*/
int _mzd_ple_submatrix(mzd_t *A,
rci_t const start_row, rci_t const stop_row,
rci_t const start_col, int const k,
mzp_t *P, mzp_t *Q, rci_t *pivots, rci_t *done, rci_t *done_row,
wi_t const splitblock);
/**
* \brief Extract the k x A::ncols echelon form submatrix of A starting at row r and column c.
*
* \param E Storage for k x A::ncols matrix.
* \param A Source matrix.
* \param r Row index.
* \param c Column index.
* \param k Rank of E.
* \param k Map from i to column of i-th pivot.
* \param offsets Encodes which columns contain pivots
*/
mzd_t *_mzd_ple_to_e(mzd_t *E, mzd_t const *A, rci_t r, rci_t c, int k, rci_t *offsets);
/**
* \brief add rows T[0],T[1] to M between startrow and stoprow, starting at startcol.
*
* \param M Matrix
* \param startrow Start processing in this row
* \param stoprow Stop processing in this row
* \param startcol Start processing in this column
* \param k Number of bits to read in each table
* \param T PLE Table with 2^k[i] rows
*/
void _mzd_process_rows_ple_2(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int const *k, const ple_table_t **T);
/**
* \brief add rows T[0],T[1],T[2] to M between startrow and stoprow, starting at startcol.
*
* \param M Matrix
* \param startrow Start processing in this row
* \param stoprow Stop processing in this row
* \param startcol Start processing in this column
* \param k Number of bits to read in each table
* \param T PLE Table with 2^k[i] rows
*/
void _mzd_process_rows_ple_3(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int const *k, const ple_table_t **T);
/**
* \brief add rows T[0],T[1],T[2],T[3] to M between startrow and stoprow, starting at startcol.
*
* \param M Matrix
* \param startrow Start processing in this row
* \param stoprow Stop processing in this row
* \param startcol Start processing in this column
* \param k Number of bits to read in each table
* \param T PLE Table with 2^k[i] rows
*/
void _mzd_process_rows_ple_4(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int const *k, const ple_table_t **T);
/**
* \brief add rows T[0],T[1],T[2],T[3],T[4] to M between startrow and stoprow, starting at startcol.
*
* \param M Matrix
* \param startrow Start processing in this row
* \param stoprow Stop processing in this row
* \param startcol Start processing in this column
* \param k Number of bits to read in each table
* \param T PLE Table with 2^k[i] rows
*/
void _mzd_process_rows_ple_5(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int const *k, const ple_table_t **T);
/**
* \brief add rows T[0],T[1],T[2],T[3],T[4],T[5] to M between startrow and stoprow, starting at startcol.
*
* \param M Matrix
* \param startrow Start processing in this row
* \param stoprow Stop processing in this row
* \param startcol Start processing in this column
* \param k Number of bits to read in each table
* \param T PLE Table with 2^k[i] rows
*/
void _mzd_process_rows_ple_6(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int const *k, const ple_table_t **T);
#endif // M4RI_PLE_RUSSIAN
|