mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
632 lines
62 KiB
HTML
632 lines
62 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
|
|
<html lang="en">
|
|
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
|
<title>LCOV - lcov.info - raid/int.c</title>
|
|
<link rel="stylesheet" type="text/css" href="../gcov.css">
|
|
</head>
|
|
|
|
<body>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="title">LCOV - code coverage report</td></tr>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
|
|
<tr>
|
|
<td width="100%">
|
|
<table cellpadding=1 border=0 width="100%">
|
|
<tr>
|
|
<td width="10%" class="headerItem">Current view:</td>
|
|
<td width="35%" class="headerValue"><a href="../index.html">top level</a> - <a href="index.html">raid</a> - int.c<span style="font-size: 80%;"> (source / <a href="int.c.func-sort-c.html">functions</a>)</span></td>
|
|
<td width="5%"></td>
|
|
<td width="15%"></td>
|
|
<td width="10%" class="headerCovTableHead">Hit</td>
|
|
<td width="10%" class="headerCovTableHead">Total</td>
|
|
<td width="15%" class="headerCovTableHead">Coverage</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test:</td>
|
|
<td class="headerValue">lcov.info</td>
|
|
<td></td>
|
|
<td class="headerItem">Lines:</td>
|
|
<td class="headerCovTableEntry">241</td>
|
|
<td class="headerCovTableEntry">241</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Date:</td>
|
|
<td class="headerValue">2026-03-15 15:58:19</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntry">11</td>
|
|
<td class="headerCovTableEntry">11</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<a name="1"><span class="lineNum"> 1 </span> : /*</a>
|
|
<a name="2"><span class="lineNum"> 2 </span> : * Copyright (C) 2013 Andrea Mazzoleni</a>
|
|
<a name="3"><span class="lineNum"> 3 </span> : *</a>
|
|
<a name="4"><span class="lineNum"> 4 </span> : * This program is free software: you can redistribute it and/or modify</a>
|
|
<a name="5"><span class="lineNum"> 5 </span> : * it under the terms of the GNU General Public License as published by</a>
|
|
<a name="6"><span class="lineNum"> 6 </span> : * the Free Software Foundation, either version 2 of the License, or</a>
|
|
<a name="7"><span class="lineNum"> 7 </span> : * (at your option) any later version.</a>
|
|
<a name="8"><span class="lineNum"> 8 </span> : *</a>
|
|
<a name="9"><span class="lineNum"> 9 </span> : * This program is distributed in the hope that it will be useful,</a>
|
|
<a name="10"><span class="lineNum"> 10 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of</a>
|
|
<a name="11"><span class="lineNum"> 11 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</a>
|
|
<a name="12"><span class="lineNum"> 12 </span> : * GNU General Public License for more details.</a>
|
|
<a name="13"><span class="lineNum"> 13 </span> : */</a>
|
|
<a name="14"><span class="lineNum"> 14 </span> : </a>
|
|
<a name="15"><span class="lineNum"> 15 </span> : #include "internal.h"</a>
|
|
<a name="16"><span class="lineNum"> 16 </span> : #include "gf.h"</a>
|
|
<a name="17"><span class="lineNum"> 17 </span> : </a>
|
|
<a name="18"><span class="lineNum"> 18 </span> : /*</a>
|
|
<a name="19"><span class="lineNum"> 19 </span> : * GEN1 (RAID5 with xor) 32bit C implementation</a>
|
|
<a name="20"><span class="lineNum"> 20 </span> : */</a>
|
|
<a name="21"><span class="lineNum"> 21 </span><span class="lineCov"> 67 : void raid_gen1_int32(int nd, size_t size, void **vv)</span></a>
|
|
<a name="22"><span class="lineNum"> 22 </span> : {</a>
|
|
<a name="23"><span class="lineNum"> 23 </span><span class="lineCov"> 67 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="24"><span class="lineNum"> 24 </span> : uint8_t *p;</a>
|
|
<a name="25"><span class="lineNum"> 25 </span> : int d, l;</a>
|
|
<a name="26"><span class="lineNum"> 26 </span> : size_t i;</a>
|
|
<a name="27"><span class="lineNum"> 27 </span> : </a>
|
|
<a name="28"><span class="lineNum"> 28 </span> : uint32_t p0;</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : uint32_t p1;</a>
|
|
<a name="30"><span class="lineNum"> 30 </span> : </a>
|
|
<a name="31"><span class="lineNum"> 31 </span><span class="lineCov"> 67 : l = nd - 1;</span></a>
|
|
<a name="32"><span class="lineNum"> 32 </span><span class="lineCov"> 67 : p = v[nd];</span></a>
|
|
<a name="33"><span class="lineNum"> 33 </span> : </a>
|
|
<a name="34"><span class="lineNum"> 34 </span><span class="lineCov"> 2097315 : for (i = 0; i < size; i += 8) {</span></a>
|
|
<a name="35"><span class="lineNum"> 35 </span><span class="lineCov"> 2097248 : p0 = v_32(v[l][i]);</span></a>
|
|
<a name="36"><span class="lineNum"> 36 </span><span class="lineCov"> 2097248 : p1 = v_32(v[l][i + 4]);</span></a>
|
|
<a name="37"><span class="lineNum"> 37 </span><span class="lineCov"> 16779296 : for (d = l - 1; d >= 0; --d) {</span></a>
|
|
<a name="38"><span class="lineNum"> 38 </span><span class="lineCov"> 14682048 : p0 ^= v_32(v[d][i]);</span></a>
|
|
<a name="39"><span class="lineNum"> 39 </span><span class="lineCov"> 14682048 : p1 ^= v_32(v[d][i + 4]);</span></a>
|
|
<a name="40"><span class="lineNum"> 40 </span> : }</a>
|
|
<a name="41"><span class="lineNum"> 41 </span><span class="lineCov"> 2097248 : v_32(p[i]) = p0;</span></a>
|
|
<a name="42"><span class="lineNum"> 42 </span><span class="lineCov"> 2097248 : v_32(p[i + 4]) = p1;</span></a>
|
|
<a name="43"><span class="lineNum"> 43 </span> : }</a>
|
|
<a name="44"><span class="lineNum"> 44 </span><span class="lineCov"> 67 : }</span></a>
|
|
<a name="45"><span class="lineNum"> 45 </span> : </a>
|
|
<a name="46"><span class="lineNum"> 46 </span> : /*</a>
|
|
<a name="47"><span class="lineNum"> 47 </span> : * GEN1 (RAID5 with xor) 64bit C implementation</a>
|
|
<a name="48"><span class="lineNum"> 48 </span> : */</a>
|
|
<a name="49"><span class="lineNum"> 49 </span><span class="lineCov"> 114 : void raid_gen1_int64(int nd, size_t size, void **vv)</span></a>
|
|
<a name="50"><span class="lineNum"> 50 </span> : {</a>
|
|
<a name="51"><span class="lineNum"> 51 </span><span class="lineCov"> 114 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="52"><span class="lineNum"> 52 </span> : uint8_t *p;</a>
|
|
<a name="53"><span class="lineNum"> 53 </span> : int d, l;</a>
|
|
<a name="54"><span class="lineNum"> 54 </span> : size_t i;</a>
|
|
<a name="55"><span class="lineNum"> 55 </span> : </a>
|
|
<a name="56"><span class="lineNum"> 56 </span> : uint64_t p0;</a>
|
|
<a name="57"><span class="lineNum"> 57 </span> : uint64_t p1;</a>
|
|
<a name="58"><span class="lineNum"> 58 </span> : </a>
|
|
<a name="59"><span class="lineNum"> 59 </span><span class="lineCov"> 114 : l = nd - 1;</span></a>
|
|
<a name="60"><span class="lineNum"> 60 </span><span class="lineCov"> 114 : p = v[nd];</span></a>
|
|
<a name="61"><span class="lineNum"> 61 </span> : </a>
|
|
<a name="62"><span class="lineNum"> 62 </span><span class="lineCov"> 1818786 : for (i = 0; i < size; i += 16) {</span></a>
|
|
<a name="63"><span class="lineNum"> 63 </span><span class="lineCov"> 1818672 : p0 = v_64(v[l][i]);</span></a>
|
|
<a name="64"><span class="lineNum"> 64 </span><span class="lineCov"> 1818672 : p1 = v_64(v[l][i + 8]);</span></a>
|
|
<a name="65"><span class="lineNum"> 65 </span><span class="lineCov"> 14550032 : for (d = l - 1; d >= 0; --d) {</span></a>
|
|
<a name="66"><span class="lineNum"> 66 </span><span class="lineCov"> 12731360 : p0 ^= v_64(v[d][i]);</span></a>
|
|
<a name="67"><span class="lineNum"> 67 </span><span class="lineCov"> 12731360 : p1 ^= v_64(v[d][i + 8]);</span></a>
|
|
<a name="68"><span class="lineNum"> 68 </span> : }</a>
|
|
<a name="69"><span class="lineNum"> 69 </span><span class="lineCov"> 1818672 : v_64(p[i]) = p0;</span></a>
|
|
<a name="70"><span class="lineNum"> 70 </span><span class="lineCov"> 1818672 : v_64(p[i + 8]) = p1;</span></a>
|
|
<a name="71"><span class="lineNum"> 71 </span> : }</a>
|
|
<a name="72"><span class="lineNum"> 72 </span><span class="lineCov"> 114 : }</span></a>
|
|
<a name="73"><span class="lineNum"> 73 </span> : </a>
|
|
<a name="74"><span class="lineNum"> 74 </span> : /*</a>
|
|
<a name="75"><span class="lineNum"> 75 </span> : * GEN2 (RAID6 with powers of 2) 32bit C implementation</a>
|
|
<a name="76"><span class="lineNum"> 76 </span> : */</a>
|
|
<a name="77"><span class="lineNum"> 77 </span><span class="lineCov"> 35 : void raid_gen2_int32(int nd, size_t size, void **vv)</span></a>
|
|
<a name="78"><span class="lineNum"> 78 </span> : {</a>
|
|
<a name="79"><span class="lineNum"> 79 </span><span class="lineCov"> 35 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="80"><span class="lineNum"> 80 </span> : uint8_t *p;</a>
|
|
<a name="81"><span class="lineNum"> 81 </span> : uint8_t *q;</a>
|
|
<a name="82"><span class="lineNum"> 82 </span> : int d, l;</a>
|
|
<a name="83"><span class="lineNum"> 83 </span> : size_t i;</a>
|
|
<a name="84"><span class="lineNum"> 84 </span> : </a>
|
|
<a name="85"><span class="lineNum"> 85 </span> : uint32_t d0, q0, p0;</a>
|
|
<a name="86"><span class="lineNum"> 86 </span> : uint32_t d1, q1, p1;</a>
|
|
<a name="87"><span class="lineNum"> 87 </span> : </a>
|
|
<a name="88"><span class="lineNum"> 88 </span><span class="lineCov"> 35 : l = nd - 1;</span></a>
|
|
<a name="89"><span class="lineNum"> 89 </span><span class="lineCov"> 35 : p = v[nd];</span></a>
|
|
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 35 : q = v[nd + 1];</span></a>
|
|
<a name="91"><span class="lineNum"> 91 </span> : </a>
|
|
<a name="92"><span class="lineNum"> 92 </span><span class="lineCov"> 1048707 : for (i = 0; i < size; i += 8) {</span></a>
|
|
<a name="93"><span class="lineNum"> 93 </span><span class="lineCov"> 1048672 : q0 = p0 = v_32(v[l][i]);</span></a>
|
|
<a name="94"><span class="lineNum"> 94 </span><span class="lineCov"> 1048672 : q1 = p1 = v_32(v[l][i + 4]);</span></a>
|
|
<a name="95"><span class="lineNum"> 95 </span><span class="lineCov"> 8390688 : for (d = l - 1; d >= 0; --d) {</span></a>
|
|
<a name="96"><span class="lineNum"> 96 </span><span class="lineCov"> 7342016 : d0 = v_32(v[d][i]);</span></a>
|
|
<a name="97"><span class="lineNum"> 97 </span><span class="lineCov"> 7342016 : d1 = v_32(v[d][i + 4]);</span></a>
|
|
<a name="98"><span class="lineNum"> 98 </span> : </a>
|
|
<a name="99"><span class="lineNum"> 99 </span><span class="lineCov"> 7342016 : p0 ^= d0;</span></a>
|
|
<a name="100"><span class="lineNum"> 100 </span><span class="lineCov"> 7342016 : p1 ^= d1;</span></a>
|
|
<a name="101"><span class="lineNum"> 101 </span> : </a>
|
|
<a name="102"><span class="lineNum"> 102 </span><span class="lineCov"> 7342016 : q0 = x2_32(q0);</span></a>
|
|
<a name="103"><span class="lineNum"> 103 </span><span class="lineCov"> 7342016 : q1 = x2_32(q1);</span></a>
|
|
<a name="104"><span class="lineNum"> 104 </span> : </a>
|
|
<a name="105"><span class="lineNum"> 105 </span><span class="lineCov"> 7342016 : q0 ^= d0;</span></a>
|
|
<a name="106"><span class="lineNum"> 106 </span><span class="lineCov"> 7342016 : q1 ^= d1;</span></a>
|
|
<a name="107"><span class="lineNum"> 107 </span> : }</a>
|
|
<a name="108"><span class="lineNum"> 108 </span><span class="lineCov"> 1048672 : v_32(p[i]) = p0;</span></a>
|
|
<a name="109"><span class="lineNum"> 109 </span><span class="lineCov"> 1048672 : v_32(p[i + 4]) = p1;</span></a>
|
|
<a name="110"><span class="lineNum"> 110 </span><span class="lineCov"> 1048672 : v_32(q[i]) = q0;</span></a>
|
|
<a name="111"><span class="lineNum"> 111 </span><span class="lineCov"> 1048672 : v_32(q[i + 4]) = q1;</span></a>
|
|
<a name="112"><span class="lineNum"> 112 </span> : }</a>
|
|
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 35 : }</span></a>
|
|
<a name="114"><span class="lineNum"> 114 </span> : </a>
|
|
<a name="115"><span class="lineNum"> 115 </span> : /*</a>
|
|
<a name="116"><span class="lineNum"> 116 </span> : * GEN2 (RAID6 with powers of 2) 64bit C implementation</a>
|
|
<a name="117"><span class="lineNum"> 117 </span> : */</a>
|
|
<a name="118"><span class="lineNum"> 118 </span><span class="lineCov"> 61 : void raid_gen2_int64(int nd, size_t size, void **vv)</span></a>
|
|
<a name="119"><span class="lineNum"> 119 </span> : {</a>
|
|
<a name="120"><span class="lineNum"> 120 </span><span class="lineCov"> 61 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="121"><span class="lineNum"> 121 </span> : uint8_t *p;</a>
|
|
<a name="122"><span class="lineNum"> 122 </span> : uint8_t *q;</a>
|
|
<a name="123"><span class="lineNum"> 123 </span> : int d, l;</a>
|
|
<a name="124"><span class="lineNum"> 124 </span> : size_t i;</a>
|
|
<a name="125"><span class="lineNum"> 125 </span> : </a>
|
|
<a name="126"><span class="lineNum"> 126 </span> : uint64_t d0, q0, p0;</a>
|
|
<a name="127"><span class="lineNum"> 127 </span> : uint64_t d1, q1, p1;</a>
|
|
<a name="128"><span class="lineNum"> 128 </span> : </a>
|
|
<a name="129"><span class="lineNum"> 129 </span><span class="lineCov"> 61 : l = nd - 1;</span></a>
|
|
<a name="130"><span class="lineNum"> 130 </span><span class="lineCov"> 61 : p = v[nd];</span></a>
|
|
<a name="131"><span class="lineNum"> 131 </span><span class="lineCov"> 61 : q = v[nd + 1];</span></a>
|
|
<a name="132"><span class="lineNum"> 132 </span> : </a>
|
|
<a name="133"><span class="lineNum"> 133 </span><span class="lineCov"> 950381 : for (i = 0; i < size; i += 16) {</span></a>
|
|
<a name="134"><span class="lineNum"> 134 </span><span class="lineCov"> 950320 : q0 = p0 = v_64(v[l][i]);</span></a>
|
|
<a name="135"><span class="lineNum"> 135 </span><span class="lineCov"> 950320 : q1 = p1 = v_64(v[l][i + 8]);</span></a>
|
|
<a name="136"><span class="lineNum"> 136 </span><span class="lineCov"> 7603216 : for (d = l - 1; d >= 0; --d) {</span></a>
|
|
<a name="137"><span class="lineNum"> 137 </span><span class="lineCov"> 6652896 : d0 = v_64(v[d][i]);</span></a>
|
|
<a name="138"><span class="lineNum"> 138 </span><span class="lineCov"> 6652896 : d1 = v_64(v[d][i + 8]);</span></a>
|
|
<a name="139"><span class="lineNum"> 139 </span> : </a>
|
|
<a name="140"><span class="lineNum"> 140 </span><span class="lineCov"> 6652896 : p0 ^= d0;</span></a>
|
|
<a name="141"><span class="lineNum"> 141 </span><span class="lineCov"> 6652896 : p1 ^= d1;</span></a>
|
|
<a name="142"><span class="lineNum"> 142 </span> : </a>
|
|
<a name="143"><span class="lineNum"> 143 </span><span class="lineCov"> 6652896 : q0 = x2_64(q0);</span></a>
|
|
<a name="144"><span class="lineNum"> 144 </span><span class="lineCov"> 6652896 : q1 = x2_64(q1);</span></a>
|
|
<a name="145"><span class="lineNum"> 145 </span> : </a>
|
|
<a name="146"><span class="lineNum"> 146 </span><span class="lineCov"> 6652896 : q0 ^= d0;</span></a>
|
|
<a name="147"><span class="lineNum"> 147 </span><span class="lineCov"> 6652896 : q1 ^= d1;</span></a>
|
|
<a name="148"><span class="lineNum"> 148 </span> : }</a>
|
|
<a name="149"><span class="lineNum"> 149 </span><span class="lineCov"> 950320 : v_64(p[i]) = p0;</span></a>
|
|
<a name="150"><span class="lineNum"> 150 </span><span class="lineCov"> 950320 : v_64(p[i + 8]) = p1;</span></a>
|
|
<a name="151"><span class="lineNum"> 151 </span><span class="lineCov"> 950320 : v_64(q[i]) = q0;</span></a>
|
|
<a name="152"><span class="lineNum"> 152 </span><span class="lineCov"> 950320 : v_64(q[i + 8]) = q1;</span></a>
|
|
<a name="153"><span class="lineNum"> 153 </span> : }</a>
|
|
<a name="154"><span class="lineNum"> 154 </span><span class="lineCov"> 61 : }</span></a>
|
|
<a name="155"><span class="lineNum"> 155 </span> : </a>
|
|
<a name="156"><span class="lineNum"> 156 </span> : /*</a>
|
|
<a name="157"><span class="lineNum"> 157 </span> : * GEN3 (triple parity with Cauchy matrix) 8bit C implementation</a>
|
|
<a name="158"><span class="lineNum"> 158 </span> : *</a>
|
|
<a name="159"><span class="lineNum"> 159 </span> : * Note that instead of a generic multiplication table, likely resulting</a>
|
|
<a name="160"><span class="lineNum"> 160 </span> : * in multiple cache misses, a precomputed table could be used.</a>
|
|
<a name="161"><span class="lineNum"> 161 </span> : * But this is only a kind of reference function, and we are not really</a>
|
|
<a name="162"><span class="lineNum"> 162 </span> : * interested in speed.</a>
|
|
<a name="163"><span class="lineNum"> 163 </span> : */</a>
|
|
<a name="164"><span class="lineNum"> 164 </span><span class="lineCov"> 26 : void raid_gen3_int8(int nd, size_t size, void **vv)</span></a>
|
|
<a name="165"><span class="lineNum"> 165 </span> : {</a>
|
|
<a name="166"><span class="lineNum"> 166 </span><span class="lineCov"> 26 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="167"><span class="lineNum"> 167 </span> : uint8_t *p;</a>
|
|
<a name="168"><span class="lineNum"> 168 </span> : uint8_t *q;</a>
|
|
<a name="169"><span class="lineNum"> 169 </span> : uint8_t *r;</a>
|
|
<a name="170"><span class="lineNum"> 170 </span> : int d, l;</a>
|
|
<a name="171"><span class="lineNum"> 171 </span> : size_t i;</a>
|
|
<a name="172"><span class="lineNum"> 172 </span> : </a>
|
|
<a name="173"><span class="lineNum"> 173 </span> : uint8_t d0, r0, q0, p0;</a>
|
|
<a name="174"><span class="lineNum"> 174 </span> : </a>
|
|
<a name="175"><span class="lineNum"> 175 </span><span class="lineCov"> 26 : l = nd - 1;</span></a>
|
|
<a name="176"><span class="lineNum"> 176 </span><span class="lineCov"> 26 : p = v[nd];</span></a>
|
|
<a name="177"><span class="lineNum"> 177 </span><span class="lineCov"> 26 : q = v[nd + 1];</span></a>
|
|
<a name="178"><span class="lineNum"> 178 </span><span class="lineCov"> 26 : r = v[nd + 2];</span></a>
|
|
<a name="179"><span class="lineNum"> 179 </span> : </a>
|
|
<a name="180"><span class="lineNum"> 180 </span><span class="lineCov"> 6291994 : for (i = 0; i < size; i += 1) {</span></a>
|
|
<a name="181"><span class="lineNum"> 181 </span><span class="lineCov"> 6291968 : p0 = q0 = r0 = 0;</span></a>
|
|
<a name="182"><span class="lineNum"> 182 </span><span class="lineCov"> 50340096 : for (d = l; d > 0; --d) {</span></a>
|
|
<a name="183"><span class="lineNum"> 183 </span><span class="lineCov"> 44048128 : d0 = v_8(v[d][i]);</span></a>
|
|
<a name="184"><span class="lineNum"> 184 </span> : </a>
|
|
<a name="185"><span class="lineNum"> 185 </span><span class="lineCov"> 44048128 : p0 ^= d0;</span></a>
|
|
<a name="186"><span class="lineNum"> 186 </span><span class="lineCov"> 44048128 : q0 ^= gfmul[d0][gfgen[1][d]];</span></a>
|
|
<a name="187"><span class="lineNum"> 187 </span><span class="lineCov"> 44048128 : r0 ^= gfmul[d0][gfgen[2][d]];</span></a>
|
|
<a name="188"><span class="lineNum"> 188 </span> : }</a>
|
|
<a name="189"><span class="lineNum"> 189 </span> : </a>
|
|
<a name="190"><span class="lineNum"> 190 </span> : /* first disk with all coefficients at 1 */</a>
|
|
<a name="191"><span class="lineNum"> 191 </span><span class="lineCov"> 6291968 : d0 = v_8(v[0][i]);</span></a>
|
|
<a name="192"><span class="lineNum"> 192 </span> : </a>
|
|
<a name="193"><span class="lineNum"> 193 </span><span class="lineCov"> 6291968 : p0 ^= d0;</span></a>
|
|
<a name="194"><span class="lineNum"> 194 </span><span class="lineCov"> 6291968 : q0 ^= d0;</span></a>
|
|
<a name="195"><span class="lineNum"> 195 </span><span class="lineCov"> 6291968 : r0 ^= d0;</span></a>
|
|
<a name="196"><span class="lineNum"> 196 </span> : </a>
|
|
<a name="197"><span class="lineNum"> 197 </span><span class="lineCov"> 6291968 : v_8(p[i]) = p0;</span></a>
|
|
<a name="198"><span class="lineNum"> 198 </span><span class="lineCov"> 6291968 : v_8(q[i]) = q0;</span></a>
|
|
<a name="199"><span class="lineNum"> 199 </span><span class="lineCov"> 6291968 : v_8(r[i]) = r0;</span></a>
|
|
<a name="200"><span class="lineNum"> 200 </span> : }</a>
|
|
<a name="201"><span class="lineNum"> 201 </span><span class="lineCov"> 26 : }</span></a>
|
|
<a name="202"><span class="lineNum"> 202 </span> : </a>
|
|
<a name="203"><span class="lineNum"> 203 </span> : /*</a>
|
|
<a name="204"><span class="lineNum"> 204 </span> : * GEN4 (quad parity with Cauchy matrix) 8bit C implementation</a>
|
|
<a name="205"><span class="lineNum"> 205 </span> : *</a>
|
|
<a name="206"><span class="lineNum"> 206 </span> : * Note that instead of a generic multiplication table, likely resulting</a>
|
|
<a name="207"><span class="lineNum"> 207 </span> : * in multiple cache misses, a precomputed table could be used.</a>
|
|
<a name="208"><span class="lineNum"> 208 </span> : * But this is only a kind of reference function, and we are not really</a>
|
|
<a name="209"><span class="lineNum"> 209 </span> : * interested in speed.</a>
|
|
<a name="210"><span class="lineNum"> 210 </span> : */</a>
|
|
<a name="211"><span class="lineNum"> 211 </span><span class="lineCov"> 18 : void raid_gen4_int8(int nd, size_t size, void **vv)</span></a>
|
|
<a name="212"><span class="lineNum"> 212 </span> : {</a>
|
|
<a name="213"><span class="lineNum"> 213 </span><span class="lineCov"> 18 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="214"><span class="lineNum"> 214 </span> : uint8_t *p;</a>
|
|
<a name="215"><span class="lineNum"> 215 </span> : uint8_t *q;</a>
|
|
<a name="216"><span class="lineNum"> 216 </span> : uint8_t *r;</a>
|
|
<a name="217"><span class="lineNum"> 217 </span> : uint8_t *s;</a>
|
|
<a name="218"><span class="lineNum"> 218 </span> : int d, l;</a>
|
|
<a name="219"><span class="lineNum"> 219 </span> : size_t i;</a>
|
|
<a name="220"><span class="lineNum"> 220 </span> : </a>
|
|
<a name="221"><span class="lineNum"> 221 </span> : uint8_t d0, s0, r0, q0, p0;</a>
|
|
<a name="222"><span class="lineNum"> 222 </span> : </a>
|
|
<a name="223"><span class="lineNum"> 223 </span><span class="lineCov"> 18 : l = nd - 1;</span></a>
|
|
<a name="224"><span class="lineNum"> 224 </span><span class="lineCov"> 18 : p = v[nd];</span></a>
|
|
<a name="225"><span class="lineNum"> 225 </span><span class="lineCov"> 18 : q = v[nd + 1];</span></a>
|
|
<a name="226"><span class="lineNum"> 226 </span><span class="lineCov"> 18 : r = v[nd + 2];</span></a>
|
|
<a name="227"><span class="lineNum"> 227 </span><span class="lineCov"> 18 : s = v[nd + 3];</span></a>
|
|
<a name="228"><span class="lineNum"> 228 </span> : </a>
|
|
<a name="229"><span class="lineNum"> 229 </span><span class="lineCov"> 4194834 : for (i = 0; i < size; i += 1) {</span></a>
|
|
<a name="230"><span class="lineNum"> 230 </span><span class="lineCov"> 4194816 : p0 = q0 = r0 = s0 = 0;</span></a>
|
|
<a name="231"><span class="lineNum"> 231 </span><span class="lineCov"> 33562880 : for (d = l; d > 0; --d) {</span></a>
|
|
<a name="232"><span class="lineNum"> 232 </span><span class="lineCov"> 29368064 : d0 = v_8(v[d][i]);</span></a>
|
|
<a name="233"><span class="lineNum"> 233 </span> : </a>
|
|
<a name="234"><span class="lineNum"> 234 </span><span class="lineCov"> 29368064 : p0 ^= d0;</span></a>
|
|
<a name="235"><span class="lineNum"> 235 </span><span class="lineCov"> 29368064 : q0 ^= gfmul[d0][gfgen[1][d]];</span></a>
|
|
<a name="236"><span class="lineNum"> 236 </span><span class="lineCov"> 29368064 : r0 ^= gfmul[d0][gfgen[2][d]];</span></a>
|
|
<a name="237"><span class="lineNum"> 237 </span><span class="lineCov"> 29368064 : s0 ^= gfmul[d0][gfgen[3][d]];</span></a>
|
|
<a name="238"><span class="lineNum"> 238 </span> : }</a>
|
|
<a name="239"><span class="lineNum"> 239 </span> : </a>
|
|
<a name="240"><span class="lineNum"> 240 </span> : /* first disk with all coefficients at 1 */</a>
|
|
<a name="241"><span class="lineNum"> 241 </span><span class="lineCov"> 4194816 : d0 = v_8(v[0][i]);</span></a>
|
|
<a name="242"><span class="lineNum"> 242 </span> : </a>
|
|
<a name="243"><span class="lineNum"> 243 </span><span class="lineCov"> 4194816 : p0 ^= d0;</span></a>
|
|
<a name="244"><span class="lineNum"> 244 </span><span class="lineCov"> 4194816 : q0 ^= d0;</span></a>
|
|
<a name="245"><span class="lineNum"> 245 </span><span class="lineCov"> 4194816 : r0 ^= d0;</span></a>
|
|
<a name="246"><span class="lineNum"> 246 </span><span class="lineCov"> 4194816 : s0 ^= d0;</span></a>
|
|
<a name="247"><span class="lineNum"> 247 </span> : </a>
|
|
<a name="248"><span class="lineNum"> 248 </span><span class="lineCov"> 4194816 : v_8(p[i]) = p0;</span></a>
|
|
<a name="249"><span class="lineNum"> 249 </span><span class="lineCov"> 4194816 : v_8(q[i]) = q0;</span></a>
|
|
<a name="250"><span class="lineNum"> 250 </span><span class="lineCov"> 4194816 : v_8(r[i]) = r0;</span></a>
|
|
<a name="251"><span class="lineNum"> 251 </span><span class="lineCov"> 4194816 : v_8(s[i]) = s0;</span></a>
|
|
<a name="252"><span class="lineNum"> 252 </span> : }</a>
|
|
<a name="253"><span class="lineNum"> 253 </span><span class="lineCov"> 18 : }</span></a>
|
|
<a name="254"><span class="lineNum"> 254 </span> : </a>
|
|
<a name="255"><span class="lineNum"> 255 </span> : /*</a>
|
|
<a name="256"><span class="lineNum"> 256 </span> : * GEN5 (penta parity with Cauchy matrix) 8bit C implementation</a>
|
|
<a name="257"><span class="lineNum"> 257 </span> : *</a>
|
|
<a name="258"><span class="lineNum"> 258 </span> : * Note that instead of a generic multiplication table, likely resulting</a>
|
|
<a name="259"><span class="lineNum"> 259 </span> : * in multiple cache misses, a precomputed table could be used.</a>
|
|
<a name="260"><span class="lineNum"> 260 </span> : * But this is only a kind of reference function, and we are not really</a>
|
|
<a name="261"><span class="lineNum"> 261 </span> : * interested in speed.</a>
|
|
<a name="262"><span class="lineNum"> 262 </span> : */</a>
|
|
<a name="263"><span class="lineNum"> 263 </span><span class="lineCov"> 17 : void raid_gen5_int8(int nd, size_t size, void **vv)</span></a>
|
|
<a name="264"><span class="lineNum"> 264 </span> : {</a>
|
|
<a name="265"><span class="lineNum"> 265 </span><span class="lineCov"> 17 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="266"><span class="lineNum"> 266 </span> : uint8_t *p;</a>
|
|
<a name="267"><span class="lineNum"> 267 </span> : uint8_t *q;</a>
|
|
<a name="268"><span class="lineNum"> 268 </span> : uint8_t *r;</a>
|
|
<a name="269"><span class="lineNum"> 269 </span> : uint8_t *s;</a>
|
|
<a name="270"><span class="lineNum"> 270 </span> : uint8_t *t;</a>
|
|
<a name="271"><span class="lineNum"> 271 </span> : int d, l;</a>
|
|
<a name="272"><span class="lineNum"> 272 </span> : size_t i;</a>
|
|
<a name="273"><span class="lineNum"> 273 </span> : </a>
|
|
<a name="274"><span class="lineNum"> 274 </span> : uint8_t d0, t0, s0, r0, q0, p0;</a>
|
|
<a name="275"><span class="lineNum"> 275 </span> : </a>
|
|
<a name="276"><span class="lineNum"> 276 </span><span class="lineCov"> 17 : l = nd - 1;</span></a>
|
|
<a name="277"><span class="lineNum"> 277 </span><span class="lineCov"> 17 : p = v[nd];</span></a>
|
|
<a name="278"><span class="lineNum"> 278 </span><span class="lineCov"> 17 : q = v[nd + 1];</span></a>
|
|
<a name="279"><span class="lineNum"> 279 </span><span class="lineCov"> 17 : r = v[nd + 2];</span></a>
|
|
<a name="280"><span class="lineNum"> 280 </span><span class="lineCov"> 17 : s = v[nd + 3];</span></a>
|
|
<a name="281"><span class="lineNum"> 281 </span><span class="lineCov"> 17 : t = v[nd + 4];</span></a>
|
|
<a name="282"><span class="lineNum"> 282 </span> : </a>
|
|
<a name="283"><span class="lineNum"> 283 </span><span class="lineCov"> 3932689 : for (i = 0; i < size; i += 1) {</span></a>
|
|
<a name="284"><span class="lineNum"> 284 </span><span class="lineCov"> 3932672 : p0 = q0 = r0 = s0 = t0 = 0;</span></a>
|
|
<a name="285"><span class="lineNum"> 285 </span><span class="lineCov"> 31465728 : for (d = l; d > 0; --d) {</span></a>
|
|
<a name="286"><span class="lineNum"> 286 </span><span class="lineCov"> 27533056 : d0 = v_8(v[d][i]);</span></a>
|
|
<a name="287"><span class="lineNum"> 287 </span> : </a>
|
|
<a name="288"><span class="lineNum"> 288 </span><span class="lineCov"> 27533056 : p0 ^= d0;</span></a>
|
|
<a name="289"><span class="lineNum"> 289 </span><span class="lineCov"> 27533056 : q0 ^= gfmul[d0][gfgen[1][d]];</span></a>
|
|
<a name="290"><span class="lineNum"> 290 </span><span class="lineCov"> 27533056 : r0 ^= gfmul[d0][gfgen[2][d]];</span></a>
|
|
<a name="291"><span class="lineNum"> 291 </span><span class="lineCov"> 27533056 : s0 ^= gfmul[d0][gfgen[3][d]];</span></a>
|
|
<a name="292"><span class="lineNum"> 292 </span><span class="lineCov"> 27533056 : t0 ^= gfmul[d0][gfgen[4][d]];</span></a>
|
|
<a name="293"><span class="lineNum"> 293 </span> : }</a>
|
|
<a name="294"><span class="lineNum"> 294 </span> : </a>
|
|
<a name="295"><span class="lineNum"> 295 </span> : /* first disk with all coefficients at 1 */</a>
|
|
<a name="296"><span class="lineNum"> 296 </span><span class="lineCov"> 3932672 : d0 = v_8(v[0][i]);</span></a>
|
|
<a name="297"><span class="lineNum"> 297 </span> : </a>
|
|
<a name="298"><span class="lineNum"> 298 </span><span class="lineCov"> 3932672 : p0 ^= d0;</span></a>
|
|
<a name="299"><span class="lineNum"> 299 </span><span class="lineCov"> 3932672 : q0 ^= d0;</span></a>
|
|
<a name="300"><span class="lineNum"> 300 </span><span class="lineCov"> 3932672 : r0 ^= d0;</span></a>
|
|
<a name="301"><span class="lineNum"> 301 </span><span class="lineCov"> 3932672 : s0 ^= d0;</span></a>
|
|
<a name="302"><span class="lineNum"> 302 </span><span class="lineCov"> 3932672 : t0 ^= d0;</span></a>
|
|
<a name="303"><span class="lineNum"> 303 </span> : </a>
|
|
<a name="304"><span class="lineNum"> 304 </span><span class="lineCov"> 3932672 : v_8(p[i]) = p0;</span></a>
|
|
<a name="305"><span class="lineNum"> 305 </span><span class="lineCov"> 3932672 : v_8(q[i]) = q0;</span></a>
|
|
<a name="306"><span class="lineNum"> 306 </span><span class="lineCov"> 3932672 : v_8(r[i]) = r0;</span></a>
|
|
<a name="307"><span class="lineNum"> 307 </span><span class="lineCov"> 3932672 : v_8(s[i]) = s0;</span></a>
|
|
<a name="308"><span class="lineNum"> 308 </span><span class="lineCov"> 3932672 : v_8(t[i]) = t0;</span></a>
|
|
<a name="309"><span class="lineNum"> 309 </span> : }</a>
|
|
<a name="310"><span class="lineNum"> 310 </span><span class="lineCov"> 17 : }</span></a>
|
|
<a name="311"><span class="lineNum"> 311 </span> : </a>
|
|
<a name="312"><span class="lineNum"> 312 </span> : /*</a>
|
|
<a name="313"><span class="lineNum"> 313 </span> : * GEN6 (hexa parity with Cauchy matrix) 8bit C implementation</a>
|
|
<a name="314"><span class="lineNum"> 314 </span> : *</a>
|
|
<a name="315"><span class="lineNum"> 315 </span> : * Note that instead of a generic multiplication table, likely resulting</a>
|
|
<a name="316"><span class="lineNum"> 316 </span> : * in multiple cache misses, a precomputed table could be used.</a>
|
|
<a name="317"><span class="lineNum"> 317 </span> : * But this is only a kind of reference function, and we are not really</a>
|
|
<a name="318"><span class="lineNum"> 318 </span> : * interested in speed.</a>
|
|
<a name="319"><span class="lineNum"> 319 </span> : */</a>
|
|
<a name="320"><span class="lineNum"> 320 </span><span class="lineCov"> 16 : void raid_gen6_int8(int nd, size_t size, void **vv)</span></a>
|
|
<a name="321"><span class="lineNum"> 321 </span> : {</a>
|
|
<a name="322"><span class="lineNum"> 322 </span><span class="lineCov"> 16 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="323"><span class="lineNum"> 323 </span> : uint8_t *p;</a>
|
|
<a name="324"><span class="lineNum"> 324 </span> : uint8_t *q;</a>
|
|
<a name="325"><span class="lineNum"> 325 </span> : uint8_t *r;</a>
|
|
<a name="326"><span class="lineNum"> 326 </span> : uint8_t *s;</a>
|
|
<a name="327"><span class="lineNum"> 327 </span> : uint8_t *t;</a>
|
|
<a name="328"><span class="lineNum"> 328 </span> : uint8_t *u;</a>
|
|
<a name="329"><span class="lineNum"> 329 </span> : int d, l;</a>
|
|
<a name="330"><span class="lineNum"> 330 </span> : size_t i;</a>
|
|
<a name="331"><span class="lineNum"> 331 </span> : </a>
|
|
<a name="332"><span class="lineNum"> 332 </span> : uint8_t d0, u0, t0, s0, r0, q0, p0;</a>
|
|
<a name="333"><span class="lineNum"> 333 </span> : </a>
|
|
<a name="334"><span class="lineNum"> 334 </span><span class="lineCov"> 16 : l = nd - 1;</span></a>
|
|
<a name="335"><span class="lineNum"> 335 </span><span class="lineCov"> 16 : p = v[nd];</span></a>
|
|
<a name="336"><span class="lineNum"> 336 </span><span class="lineCov"> 16 : q = v[nd + 1];</span></a>
|
|
<a name="337"><span class="lineNum"> 337 </span><span class="lineCov"> 16 : r = v[nd + 2];</span></a>
|
|
<a name="338"><span class="lineNum"> 338 </span><span class="lineCov"> 16 : s = v[nd + 3];</span></a>
|
|
<a name="339"><span class="lineNum"> 339 </span><span class="lineCov"> 16 : t = v[nd + 4];</span></a>
|
|
<a name="340"><span class="lineNum"> 340 </span><span class="lineCov"> 16 : u = v[nd + 5];</span></a>
|
|
<a name="341"><span class="lineNum"> 341 </span> : </a>
|
|
<a name="342"><span class="lineNum"> 342 </span><span class="lineCov"> 3670544 : for (i = 0; i < size; i += 1) {</span></a>
|
|
<a name="343"><span class="lineNum"> 343 </span><span class="lineCov"> 3670528 : p0 = q0 = r0 = s0 = t0 = u0 = 0;</span></a>
|
|
<a name="344"><span class="lineNum"> 344 </span><span class="lineCov"> 29368576 : for (d = l; d > 0; --d) {</span></a>
|
|
<a name="345"><span class="lineNum"> 345 </span><span class="lineCov"> 25698048 : d0 = v_8(v[d][i]);</span></a>
|
|
<a name="346"><span class="lineNum"> 346 </span> : </a>
|
|
<a name="347"><span class="lineNum"> 347 </span><span class="lineCov"> 25698048 : p0 ^= d0;</span></a>
|
|
<a name="348"><span class="lineNum"> 348 </span><span class="lineCov"> 25698048 : q0 ^= gfmul[d0][gfgen[1][d]];</span></a>
|
|
<a name="349"><span class="lineNum"> 349 </span><span class="lineCov"> 25698048 : r0 ^= gfmul[d0][gfgen[2][d]];</span></a>
|
|
<a name="350"><span class="lineNum"> 350 </span><span class="lineCov"> 25698048 : s0 ^= gfmul[d0][gfgen[3][d]];</span></a>
|
|
<a name="351"><span class="lineNum"> 351 </span><span class="lineCov"> 25698048 : t0 ^= gfmul[d0][gfgen[4][d]];</span></a>
|
|
<a name="352"><span class="lineNum"> 352 </span><span class="lineCov"> 25698048 : u0 ^= gfmul[d0][gfgen[5][d]];</span></a>
|
|
<a name="353"><span class="lineNum"> 353 </span> : }</a>
|
|
<a name="354"><span class="lineNum"> 354 </span> : </a>
|
|
<a name="355"><span class="lineNum"> 355 </span> : /* first disk with all coefficients at 1 */</a>
|
|
<a name="356"><span class="lineNum"> 356 </span><span class="lineCov"> 3670528 : d0 = v_8(v[0][i]);</span></a>
|
|
<a name="357"><span class="lineNum"> 357 </span> : </a>
|
|
<a name="358"><span class="lineNum"> 358 </span><span class="lineCov"> 3670528 : p0 ^= d0;</span></a>
|
|
<a name="359"><span class="lineNum"> 359 </span><span class="lineCov"> 3670528 : q0 ^= d0;</span></a>
|
|
<a name="360"><span class="lineNum"> 360 </span><span class="lineCov"> 3670528 : r0 ^= d0;</span></a>
|
|
<a name="361"><span class="lineNum"> 361 </span><span class="lineCov"> 3670528 : s0 ^= d0;</span></a>
|
|
<a name="362"><span class="lineNum"> 362 </span><span class="lineCov"> 3670528 : t0 ^= d0;</span></a>
|
|
<a name="363"><span class="lineNum"> 363 </span><span class="lineCov"> 3670528 : u0 ^= d0;</span></a>
|
|
<a name="364"><span class="lineNum"> 364 </span> : </a>
|
|
<a name="365"><span class="lineNum"> 365 </span><span class="lineCov"> 3670528 : v_8(p[i]) = p0;</span></a>
|
|
<a name="366"><span class="lineNum"> 366 </span><span class="lineCov"> 3670528 : v_8(q[i]) = q0;</span></a>
|
|
<a name="367"><span class="lineNum"> 367 </span><span class="lineCov"> 3670528 : v_8(r[i]) = r0;</span></a>
|
|
<a name="368"><span class="lineNum"> 368 </span><span class="lineCov"> 3670528 : v_8(s[i]) = s0;</span></a>
|
|
<a name="369"><span class="lineNum"> 369 </span><span class="lineCov"> 3670528 : v_8(t[i]) = t0;</span></a>
|
|
<a name="370"><span class="lineNum"> 370 </span><span class="lineCov"> 3670528 : v_8(u[i]) = u0;</span></a>
|
|
<a name="371"><span class="lineNum"> 371 </span> : }</a>
|
|
<a name="372"><span class="lineNum"> 372 </span><span class="lineCov"> 16 : }</span></a>
|
|
<a name="373"><span class="lineNum"> 373 </span> : </a>
|
|
<a name="374"><span class="lineNum"> 374 </span> : /*</a>
|
|
<a name="375"><span class="lineNum"> 375 </span> : * Recover failure of one data block at index id[0] using parity at index</a>
|
|
<a name="376"><span class="lineNum"> 376 </span> : * ip[0] for any RAID level.</a>
|
|
<a name="377"><span class="lineNum"> 377 </span> : *</a>
|
|
<a name="378"><span class="lineNum"> 378 </span> : * Starting from the equation:</a>
|
|
<a name="379"><span class="lineNum"> 379 </span> : *</a>
|
|
<a name="380"><span class="lineNum"> 380 </span> : * Pd = A[ip[0],id[0]] * Dx</a>
|
|
<a name="381"><span class="lineNum"> 381 </span> : *</a>
|
|
<a name="382"><span class="lineNum"> 382 </span> : * and solving we get:</a>
|
|
<a name="383"><span class="lineNum"> 383 </span> : *</a>
|
|
<a name="384"><span class="lineNum"> 384 </span> : * Dx = A[ip[0],id[0]]^-1 * Pd</a>
|
|
<a name="385"><span class="lineNum"> 385 </span> : */</a>
|
|
<a name="386"><span class="lineNum"> 386 </span><span class="lineCov"> 140 : void raid_rec1_int8(int nr, int *id, int *ip, int nd, size_t size, void **vv)</span></a>
|
|
<a name="387"><span class="lineNum"> 387 </span> : {</a>
|
|
<a name="388"><span class="lineNum"> 388 </span><span class="lineCov"> 140 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="389"><span class="lineNum"> 389 </span> : uint8_t *p;</a>
|
|
<a name="390"><span class="lineNum"> 390 </span> : uint8_t *pa;</a>
|
|
<a name="391"><span class="lineNum"> 391 </span> : const uint8_t *T;</a>
|
|
<a name="392"><span class="lineNum"> 392 </span> : uint8_t G;</a>
|
|
<a name="393"><span class="lineNum"> 393 </span> : uint8_t V;</a>
|
|
<a name="394"><span class="lineNum"> 394 </span> : size_t i;</a>
|
|
<a name="395"><span class="lineNum"> 395 </span> : </a>
|
|
<a name="396"><span class="lineNum"> 396 </span> : (void)nr; /* unused, it's always 1 */</a>
|
|
<a name="397"><span class="lineNum"> 397 </span> : </a>
|
|
<a name="398"><span class="lineNum"> 398 </span> : /* if it's RAID5 uses the faster function */</a>
|
|
<a name="399"><span class="lineNum"> 399 </span><span class="lineCov"> 140 : if (ip[0] == 0) {</span></a>
|
|
<a name="400"><span class="lineNum"> 400 </span><span class="lineCov"> 24 : raid_rec1of1(id, nd, size, vv);</span></a>
|
|
<a name="401"><span class="lineNum"> 401 </span><span class="lineCov"> 24 : return;</span></a>
|
|
<a name="402"><span class="lineNum"> 402 </span> : }</a>
|
|
<a name="403"><span class="lineNum"> 403 </span> : </a>
|
|
<a name="404"><span class="lineNum"> 404 </span> : /* setup the coefficients matrix */</a>
|
|
<a name="405"><span class="lineNum"> 405 </span><span class="lineCov"> 116 : G = A(ip[0], id[0]);</span></a>
|
|
<a name="406"><span class="lineNum"> 406 </span> : </a>
|
|
<a name="407"><span class="lineNum"> 407 </span> : /* invert it to solve the system of linear equations */</a>
|
|
<a name="408"><span class="lineNum"> 408 </span><span class="lineCov"> 116 : V = inv(G);</span></a>
|
|
<a name="409"><span class="lineNum"> 409 </span> : </a>
|
|
<a name="410"><span class="lineNum"> 410 </span> : /* get multiplication tables */</a>
|
|
<a name="411"><span class="lineNum"> 411 </span><span class="lineCov"> 116 : T = table(V);</span></a>
|
|
<a name="412"><span class="lineNum"> 412 </span> : </a>
|
|
<a name="413"><span class="lineNum"> 413 </span> : /* compute delta parity */</a>
|
|
<a name="414"><span class="lineNum"> 414 </span><span class="lineCov"> 116 : raid_delta_gen(1, id, ip, nd, size, vv);</span></a>
|
|
<a name="415"><span class="lineNum"> 415 </span> : </a>
|
|
<a name="416"><span class="lineNum"> 416 </span><span class="lineCov"> 116 : p = v[nd + ip[0]];</span></a>
|
|
<a name="417"><span class="lineNum"> 417 </span><span class="lineCov"> 116 : pa = v[id[0]];</span></a>
|
|
<a name="418"><span class="lineNum"> 418 </span> : </a>
|
|
<a name="419"><span class="lineNum"> 419 </span><span class="lineCov"> 8410228 : for (i = 0; i < size; ++i) {</span></a>
|
|
<a name="420"><span class="lineNum"> 420 </span> : /* delta */</a>
|
|
<a name="421"><span class="lineNum"> 421 </span><span class="lineCov"> 8410112 : uint8_t Pd = p[i] ^ pa[i];</span></a>
|
|
<a name="422"><span class="lineNum"> 422 </span> : </a>
|
|
<a name="423"><span class="lineNum"> 423 </span> : /* reconstruct */</a>
|
|
<a name="424"><span class="lineNum"> 424 </span><span class="lineCov"> 8410112 : pa[i] = T[Pd];</span></a>
|
|
<a name="425"><span class="lineNum"> 425 </span> : }</a>
|
|
<a name="426"><span class="lineNum"> 426 </span> : }</a>
|
|
<a name="427"><span class="lineNum"> 427 </span> : </a>
|
|
<a name="428"><span class="lineNum"> 428 </span> : /*</a>
|
|
<a name="429"><span class="lineNum"> 429 </span> : * Recover failure of two data blocks at indexes id[0],id[1] using parity at</a>
|
|
<a name="430"><span class="lineNum"> 430 </span> : * indexes ip[0],ip[1] for any RAID level.</a>
|
|
<a name="431"><span class="lineNum"> 431 </span> : *</a>
|
|
<a name="432"><span class="lineNum"> 432 </span> : * Starting from the equations:</a>
|
|
<a name="433"><span class="lineNum"> 433 </span> : *</a>
|
|
<a name="434"><span class="lineNum"> 434 </span> : * Pd = A[ip[0],id[0]] * Dx + A[ip[0],id[1]] * Dy</a>
|
|
<a name="435"><span class="lineNum"> 435 </span> : * Qd = A[ip[1],id[0]] * Dx + A[ip[1],id[1]] * Dy</a>
|
|
<a name="436"><span class="lineNum"> 436 </span> : *</a>
|
|
<a name="437"><span class="lineNum"> 437 </span> : * we solve inverting the coefficients matrix.</a>
|
|
<a name="438"><span class="lineNum"> 438 </span> : */</a>
|
|
<a name="439"><span class="lineNum"> 439 </span><span class="lineCov"> 1220 : void raid_rec2_int8(int nr, int *id, int *ip, int nd, size_t size, void **vv)</span></a>
|
|
<a name="440"><span class="lineNum"> 440 </span><span class="lineCov"> 1220 : {</span></a>
|
|
<a name="441"><span class="lineNum"> 441 </span><span class="lineCov"> 1220 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="442"><span class="lineNum"> 442 </span> : uint8_t *p;</a>
|
|
<a name="443"><span class="lineNum"> 443 </span> : uint8_t *pa;</a>
|
|
<a name="444"><span class="lineNum"> 444 </span> : uint8_t *q;</a>
|
|
<a name="445"><span class="lineNum"> 445 </span> : uint8_t *qa;</a>
|
|
<a name="446"><span class="lineNum"> 446 </span><span class="lineCov"> 1220 : const int N = 2;</span></a>
|
|
<a name="447"><span class="lineNum"> 447 </span><span class="lineCov"> 1220 : const uint8_t *T[N][N];</span></a>
|
|
<a name="448"><span class="lineNum"> 448 </span><span class="lineCov"> 1220 : uint8_t G[N * N];</span></a>
|
|
<a name="449"><span class="lineNum"> 449 </span><span class="lineCov"> 1220 : uint8_t V[N * N];</span></a>
|
|
<a name="450"><span class="lineNum"> 450 </span> : size_t i;</a>
|
|
<a name="451"><span class="lineNum"> 451 </span> : int j, k;</a>
|
|
<a name="452"><span class="lineNum"> 452 </span> : </a>
|
|
<a name="453"><span class="lineNum"> 453 </span> : (void)nr; /* unused, it's always 2 */</a>
|
|
<a name="454"><span class="lineNum"> 454 </span> : </a>
|
|
<a name="455"><span class="lineNum"> 455 </span> : /* if it's RAID6 recovering with P and Q uses the faster function */</a>
|
|
<a name="456"><span class="lineNum"> 456 </span><span class="lineCov"> 1220 : if (ip[0] == 0 && ip[1] == 1) {</span></a>
|
|
<a name="457"><span class="lineNum"> 457 </span><span class="lineCov"> 132 : raid_rec2of2_int8(id, ip, nd, size, vv);</span></a>
|
|
<a name="458"><span class="lineNum"> 458 </span><span class="lineCov"> 132 : return;</span></a>
|
|
<a name="459"><span class="lineNum"> 459 </span> : }</a>
|
|
<a name="460"><span class="lineNum"> 460 </span> : </a>
|
|
<a name="461"><span class="lineNum"> 461 </span> : /* setup the coefficients matrix */</a>
|
|
<a name="462"><span class="lineNum"> 462 </span><span class="lineCov"> 3264 : for (j = 0; j < N; ++j)</span></a>
|
|
<a name="463"><span class="lineNum"> 463 </span><span class="lineCov"> 6528 : for (k = 0; k < N; ++k)</span></a>
|
|
<a name="464"><span class="lineNum"> 464 </span><span class="lineCov"> 8704 : G[j * N + k] = A(ip[j], id[k]);</span></a>
|
|
<a name="465"><span class="lineNum"> 465 </span> : </a>
|
|
<a name="466"><span class="lineNum"> 466 </span> : /* invert it to solve the system of linear equations */</a>
|
|
<a name="467"><span class="lineNum"> 467 </span><span class="lineCov"> 1088 : raid_invert(G, V, N);</span></a>
|
|
<a name="468"><span class="lineNum"> 468 </span> : </a>
|
|
<a name="469"><span class="lineNum"> 469 </span> : /* get multiplication tables */</a>
|
|
<a name="470"><span class="lineNum"> 470 </span><span class="lineCov"> 3264 : for (j = 0; j < N; ++j)</span></a>
|
|
<a name="471"><span class="lineNum"> 471 </span><span class="lineCov"> 6528 : for (k = 0; k < N; ++k)</span></a>
|
|
<a name="472"><span class="lineNum"> 472 </span><span class="lineCov"> 8704 : T[j][k] = table(V[j * N + k]);</span></a>
|
|
<a name="473"><span class="lineNum"> 473 </span> : </a>
|
|
<a name="474"><span class="lineNum"> 474 </span> : /* compute delta parity */</a>
|
|
<a name="475"><span class="lineNum"> 475 </span><span class="lineCov"> 1088 : raid_delta_gen(2, id, ip, nd, size, vv);</span></a>
|
|
<a name="476"><span class="lineNum"> 476 </span> : </a>
|
|
<a name="477"><span class="lineNum"> 477 </span><span class="lineCov"> 1088 : p = v[nd + ip[0]];</span></a>
|
|
<a name="478"><span class="lineNum"> 478 </span><span class="lineCov"> 1088 : q = v[nd + ip[1]];</span></a>
|
|
<a name="479"><span class="lineNum"> 479 </span><span class="lineCov"> 1088 : pa = v[id[0]];</span></a>
|
|
<a name="480"><span class="lineNum"> 480 </span><span class="lineCov"> 1088 : qa = v[id[1]];</span></a>
|
|
<a name="481"><span class="lineNum"> 481 </span> : </a>
|
|
<a name="482"><span class="lineNum"> 482 </span><span class="lineCov"> 8660032 : for (i = 0; i < size; ++i) {</span></a>
|
|
<a name="483"><span class="lineNum"> 483 </span> : /* delta */</a>
|
|
<a name="484"><span class="lineNum"> 484 </span><span class="lineCov"> 8658944 : uint8_t Pd = p[i] ^ pa[i];</span></a>
|
|
<a name="485"><span class="lineNum"> 485 </span><span class="lineCov"> 8658944 : uint8_t Qd = q[i] ^ qa[i];</span></a>
|
|
<a name="486"><span class="lineNum"> 486 </span> : </a>
|
|
<a name="487"><span class="lineNum"> 487 </span> : /* reconstruct */</a>
|
|
<a name="488"><span class="lineNum"> 488 </span><span class="lineCov"> 8658944 : pa[i] = T[0][0][Pd] ^ T[0][1][Qd];</span></a>
|
|
<a name="489"><span class="lineNum"> 489 </span><span class="lineCov"> 8658944 : qa[i] = T[1][0][Pd] ^ T[1][1][Qd];</span></a>
|
|
<a name="490"><span class="lineNum"> 490 </span> : }</a>
|
|
<a name="491"><span class="lineNum"> 491 </span> : }</a>
|
|
<a name="492"><span class="lineNum"> 492 </span> : </a>
|
|
<a name="493"><span class="lineNum"> 493 </span> : /*</a>
|
|
<a name="494"><span class="lineNum"> 494 </span> : * Recover failure of N data blocks at indexes id[N] using parity at indexes</a>
|
|
<a name="495"><span class="lineNum"> 495 </span> : * ip[N] for any RAID level.</a>
|
|
<a name="496"><span class="lineNum"> 496 </span> : *</a>
|
|
<a name="497"><span class="lineNum"> 497 </span> : * Starting from the N equations, with 0<=i<N :</a>
|
|
<a name="498"><span class="lineNum"> 498 </span> : *</a>
|
|
<a name="499"><span class="lineNum"> 499 </span> : * PD[i] = sum(A[ip[i],id[j]] * D[i]) 0<=j<N</a>
|
|
<a name="500"><span class="lineNum"> 500 </span> : *</a>
|
|
<a name="501"><span class="lineNum"> 501 </span> : * we solve inverting the coefficients matrix.</a>
|
|
<a name="502"><span class="lineNum"> 502 </span> : *</a>
|
|
<a name="503"><span class="lineNum"> 503 </span> : * Note that referring at previous equations you have:</a>
|
|
<a name="504"><span class="lineNum"> 504 </span> : * PD[0] = Pd, PD[1] = Qd, PD[2] = Rd, ...</a>
|
|
<a name="505"><span class="lineNum"> 505 </span> : * D[0] = Dx, D[1] = Dy, D[2] = Dz, ...</a>
|
|
<a name="506"><span class="lineNum"> 506 </span> : */</a>
|
|
<a name="507"><span class="lineNum"> 507 </span><span class="lineCov"> 17849 : void raid_recX_int8(int nr, int *id, int *ip, int nd, size_t size, void **vv)</span></a>
|
|
<a name="508"><span class="lineNum"> 508 </span> : {</a>
|
|
<a name="509"><span class="lineNum"> 509 </span><span class="lineCov"> 17849 : uint8_t **v = (uint8_t **)vv;</span></a>
|
|
<a name="510"><span class="lineNum"> 510 </span> : uint8_t *p[RAID_PARITY_MAX];</a>
|
|
<a name="511"><span class="lineNum"> 511 </span> : uint8_t *pa[RAID_PARITY_MAX];</a>
|
|
<a name="512"><span class="lineNum"> 512 </span> : const uint8_t *T[RAID_PARITY_MAX][RAID_PARITY_MAX];</a>
|
|
<a name="513"><span class="lineNum"> 513 </span> : uint8_t G[RAID_PARITY_MAX * RAID_PARITY_MAX];</a>
|
|
<a name="514"><span class="lineNum"> 514 </span> : uint8_t V[RAID_PARITY_MAX * RAID_PARITY_MAX];</a>
|
|
<a name="515"><span class="lineNum"> 515 </span> : size_t i;</a>
|
|
<a name="516"><span class="lineNum"> 516 </span> : int j, k;</a>
|
|
<a name="517"><span class="lineNum"> 517 </span> : </a>
|
|
<a name="518"><span class="lineNum"> 518 </span> : /* setup the coefficients matrix */</a>
|
|
<a name="519"><span class="lineNum"> 519 </span><span class="lineCov"> 91289 : for (j = 0; j < nr; ++j)</span></a>
|
|
<a name="520"><span class="lineNum"> 520 </span><span class="lineCov"> 388636 : for (k = 0; k < nr; ++k)</span></a>
|
|
<a name="521"><span class="lineNum"> 521 </span><span class="lineCov"> 630392 : G[j * nr + k] = A(ip[j], id[k]);</span></a>
|
|
<a name="522"><span class="lineNum"> 522 </span> : </a>
|
|
<a name="523"><span class="lineNum"> 523 </span> : /* invert it to solve the system of linear equations */</a>
|
|
<a name="524"><span class="lineNum"> 524 </span><span class="lineCov"> 17849 : raid_invert(G, V, nr);</span></a>
|
|
<a name="525"><span class="lineNum"> 525 </span> : </a>
|
|
<a name="526"><span class="lineNum"> 526 </span> : /* get multiplication tables */</a>
|
|
<a name="527"><span class="lineNum"> 527 </span><span class="lineCov"> 91289 : for (j = 0; j < nr; ++j)</span></a>
|
|
<a name="528"><span class="lineNum"> 528 </span><span class="lineCov"> 388636 : for (k = 0; k < nr; ++k)</span></a>
|
|
<a name="529"><span class="lineNum"> 529 </span><span class="lineCov"> 630392 : T[j][k] = table(V[j * nr + k]);</span></a>
|
|
<a name="530"><span class="lineNum"> 530 </span> : </a>
|
|
<a name="531"><span class="lineNum"> 531 </span> : /* compute delta parity */</a>
|
|
<a name="532"><span class="lineNum"> 532 </span><span class="lineCov"> 17849 : raid_delta_gen(nr, id, ip, nd, size, vv);</span></a>
|
|
<a name="533"><span class="lineNum"> 533 </span> : </a>
|
|
<a name="534"><span class="lineNum"> 534 </span><span class="lineCov"> 91289 : for (j = 0; j < nr; ++j) {</span></a>
|
|
<a name="535"><span class="lineNum"> 535 </span><span class="lineCov"> 73440 : p[j] = v[nd + ip[j]];</span></a>
|
|
<a name="536"><span class="lineNum"> 536 </span><span class="lineCov"> 73440 : pa[j] = v[id[j]];</span></a>
|
|
<a name="537"><span class="lineNum"> 537 </span> : }</a>
|
|
<a name="538"><span class="lineNum"> 538 </span> : </a>
|
|
<a name="539"><span class="lineNum"> 539 </span><span class="lineCov"> 38108857 : for (i = 0; i < size; ++i) {</span></a>
|
|
<a name="540"><span class="lineNum"> 540 </span> : uint8_t PD[RAID_PARITY_MAX];</a>
|
|
<a name="541"><span class="lineNum"> 541 </span> : </a>
|
|
<a name="542"><span class="lineNum"> 542 </span> : /* delta */</a>
|
|
<a name="543"><span class="lineNum"> 543 </span><span class="lineCov"> 207739136 : for (j = 0; j < nr; ++j)</span></a>
|
|
<a name="544"><span class="lineNum"> 544 </span><span class="lineCov"> 169648128 : PD[j] = p[j][i] ^ pa[j][i];</span></a>
|
|
<a name="545"><span class="lineNum"> 545 </span> : </a>
|
|
<a name="546"><span class="lineNum"> 546 </span> : /* reconstruct */</a>
|
|
<a name="547"><span class="lineNum"> 547 </span><span class="lineCov"> 207739136 : for (j = 0; j < nr; ++j) {</span></a>
|
|
<a name="548"><span class="lineNum"> 548 </span><span class="lineCov"> 169648128 : uint8_t b = 0;</span></a>
|
|
<a name="549"><span class="lineNum"> 549 </span> : </a>
|
|
<a name="550"><span class="lineNum"> 550 </span><span class="lineCov"> 971054080 : for (k = 0; k < nr; ++k)</span></a>
|
|
<a name="551"><span class="lineNum"> 551 </span><span class="lineCov"> 801405952 : b ^= T[j][k][PD[k]];</span></a>
|
|
<a name="552"><span class="lineNum"> 552 </span><span class="lineCov"> 169648128 : pa[j][i] = b;</span></a>
|
|
<a name="553"><span class="lineNum"> 553 </span> : }</a>
|
|
<a name="554"><span class="lineNum"> 554 </span> : }</a>
|
|
<a name="555"><span class="lineNum"> 555 </span><span class="lineCov"> 17849 : }</span></a>
|
|
<a name="556"><span class="lineNum"> 556 </span> : </a>
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="https://github.com/linux-test-project/lcov" target="_parent">LCOV version 1.0</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|