snapraid/cov/raid/check.c.gcov.html
Andrea Mazzoleni a53ac4a175 Auto update
2026-03-15 18:52:43 +01:00

261 lines
23 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/check.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> - check.c<span style="font-size: 80%;"> (source / <a href="check.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">60</td>
<td class="headerCovTableEntry">60</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">3</td>
<td class="headerCovTableEntry">3</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) 2015 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 &quot;internal.h&quot;</a>
<a name="16"><span class="lineNum"> 16 </span> : #include &quot;combo.h&quot;</a>
<a name="17"><span class="lineNum"> 17 </span> : #include &quot;gf.h&quot;</a>
<a name="18"><span class="lineNum"> 18 </span> : </a>
<a name="19"><span class="lineNum"> 19 </span> : /**</a>
<a name="20"><span class="lineNum"> 20 </span> : * Validate the provided failed blocks.</a>
<a name="21"><span class="lineNum"> 21 </span> : *</a>
<a name="22"><span class="lineNum"> 22 </span> : * This function checks if the specified failed blocks satisfy the redundancy</a>
<a name="23"><span class="lineNum"> 23 </span> : * information using the data from the known valid parity blocks.</a>
<a name="24"><span class="lineNum"> 24 </span> : *</a>
<a name="25"><span class="lineNum"> 25 </span> : * It's similar at raid_check(), just with a different format for arguments.</a>
<a name="26"><span class="lineNum"> 26 </span> : *</a>
<a name="27"><span class="lineNum"> 27 </span> : * The number of failed blocks @nr must be strictly less than the number of</a>
<a name="28"><span class="lineNum"> 28 </span> : * parities @nv, because you need one more parity to validate the recovering.</a>
<a name="29"><span class="lineNum"> 29 </span> : *</a>
<a name="30"><span class="lineNum"> 30 </span> : * No data or parity blocks are modified.</a>
<a name="31"><span class="lineNum"> 31 </span> : *</a>
<a name="32"><span class="lineNum"> 32 </span> : * @nr Number of failed data blocks.</a>
<a name="33"><span class="lineNum"> 33 </span> : * @id[] Vector of @nr indexes of the failed data blocks.</a>
<a name="34"><span class="lineNum"> 34 </span> : * The indexes start from 0. They must be in order.</a>
<a name="35"><span class="lineNum"> 35 </span> : * @nv Number of valid parity blocks.</a>
<a name="36"><span class="lineNum"> 36 </span> : * @ip[] Vector of @nv indexes of the valid parity blocks.</a>
<a name="37"><span class="lineNum"> 37 </span> : * The indexes start from 0. They must be in order.</a>
<a name="38"><span class="lineNum"> 38 </span> : * @nd Number of data blocks.</a>
<a name="39"><span class="lineNum"> 39 </span> : * @size Size of the blocks pointed by @v. It must be a multiplier of 64.</a>
<a name="40"><span class="lineNum"> 40 </span> : * @v Vector of pointers to the blocks of data and parity.</a>
<a name="41"><span class="lineNum"> 41 </span> : * It has (@nd + @ip[@nv - 1] + 1) elements. The starting elements are the</a>
<a name="42"><span class="lineNum"> 42 </span> : * blocks for data, following with the parity blocks.</a>
<a name="43"><span class="lineNum"> 43 </span> : * Each block has @size bytes. </a>
<a name="44"><span class="lineNum"> 44 </span> : * @return 0 if the check is satisfied. -1 otherwise.</a>
<a name="45"><span class="lineNum"> 45 </span> : */</a>
<a name="46"><span class="lineNum"> 46 </span><span class="lineCov"> 11255 : static int raid_validate(int nr, int *id, int nv, int *ip, int nd, size_t size, void **vv)</span></a>
<a name="47"><span class="lineNum"> 47 </span> : {</a>
<a name="48"><span class="lineNum"> 48 </span><span class="lineCov"> 11255 : uint8_t **v = (uint8_t **)vv;</span></a>
<a name="49"><span class="lineNum"> 49 </span> : const uint8_t *T[RAID_PARITY_MAX][RAID_PARITY_MAX];</a>
<a name="50"><span class="lineNum"> 50 </span> : uint8_t G[RAID_PARITY_MAX * RAID_PARITY_MAX];</a>
<a name="51"><span class="lineNum"> 51 </span> : uint8_t V[RAID_PARITY_MAX * RAID_PARITY_MAX];</a>
<a name="52"><span class="lineNum"> 52 </span> : size_t i;</a>
<a name="53"><span class="lineNum"> 53 </span> : int j, k, l;</a>
<a name="54"><span class="lineNum"> 54 </span> : </a>
<a name="55"><span class="lineNum"> 55 </span><span class="lineCov"> 11255 : BUG_ON(nr &gt;= nv);</span></a>
<a name="56"><span class="lineNum"> 56 </span> : </a>
<a name="57"><span class="lineNum"> 57 </span> : /* setup the coefficients matrix */</a>
<a name="58"><span class="lineNum"> 58 </span><span class="lineCov"> 41316 : for (j = 0; j &lt; nr; ++j)</span></a>
<a name="59"><span class="lineNum"> 59 </span><span class="lineCov"> 119934 : for (k = 0; k &lt; nr; ++k)</span></a>
<a name="60"><span class="lineNum"> 60 </span><span class="lineCov"> 179746 : G[j * nr + k] = A(ip[j], id[k]);</span></a>
<a name="61"><span class="lineNum"> 61 </span> : </a>
<a name="62"><span class="lineNum"> 62 </span> : /* invert it to solve the system of linear equations */</a>
<a name="63"><span class="lineNum"> 63 </span><span class="lineCov"> 11255 : raid_invert(G, V, nr);</span></a>
<a name="64"><span class="lineNum"> 64 </span> : </a>
<a name="65"><span class="lineNum"> 65 </span> : /* get multiplication tables */</a>
<a name="66"><span class="lineNum"> 66 </span><span class="lineCov"> 41316 : for (j = 0; j &lt; nr; ++j)</span></a>
<a name="67"><span class="lineNum"> 67 </span><span class="lineCov"> 119934 : for (k = 0; k &lt; nr; ++k)</span></a>
<a name="68"><span class="lineNum"> 68 </span><span class="lineCov"> 179746 : T[j][k] = table(V[j * nr + k]);</span></a>
<a name="69"><span class="lineNum"> 69 </span> : </a>
<a name="70"><span class="lineNum"> 70 </span> : /* check all positions */</a>
<a name="71"><span class="lineNum"> 71 </span><span class="lineCov"> 35831 : for (i = 0; i &lt; size; ++i) {</span></a>
<a name="72"><span class="lineNum"> 72 </span> : uint8_t p[RAID_PARITY_MAX];</a>
<a name="73"><span class="lineNum"> 73 </span> : </a>
<a name="74"><span class="lineNum"> 74 </span> : /* get parity */</a>
<a name="75"><span class="lineNum"> 75 </span><span class="lineCov"> 151819 : for (j = 0; j &lt; nv; ++j)</span></a>
<a name="76"><span class="lineNum"> 76 </span><span class="lineCov"> 115994 : p[j] = v[nd + ip[j]][i];</span></a>
<a name="77"><span class="lineNum"> 77 </span> : </a>
<a name="78"><span class="lineNum"> 78 </span> : /* compute delta parity, skipping broken disks */</a>
<a name="79"><span class="lineNum"> 79 </span><span class="lineCov"> 609025 : for (j = 0, k = 0; j &lt; nd; ++j) {</span></a>
<a name="80"><span class="lineNum"> 80 </span> : uint8_t b;</a>
<a name="81"><span class="lineNum"> 81 </span> : </a>
<a name="82"><span class="lineNum"> 82 </span> : /* skip broken disks */</a>
<a name="83"><span class="lineNum"> 83 </span><span class="lineCov"> 573200 : if (k &lt; nr &amp;&amp; id[k] == j) {</span></a>
<a name="84"><span class="lineNum"> 84 </span><span class="lineCov"> 66916 : ++k;</span></a>
<a name="85"><span class="lineNum"> 85 </span><span class="lineCov"> 66916 : continue;</span></a>
<a name="86"><span class="lineNum"> 86 </span> : }</a>
<a name="87"><span class="lineNum"> 87 </span> : </a>
<a name="88"><span class="lineNum"> 88 </span><span class="lineCov"> 506284 : b = v[j][i];</span></a>
<a name="89"><span class="lineNum"> 89 </span><span class="lineCov"> 2094442 : for (l = 0; l &lt; nv; ++l)</span></a>
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 1588158 : p[l] ^= gfmul[b][gfgen[ip[l]][j]];</span></a>
<a name="91"><span class="lineNum"> 91 </span> : }</a>
<a name="92"><span class="lineNum"> 92 </span> : </a>
<a name="93"><span class="lineNum"> 93 </span> : /* reconstruct data */</a>
<a name="94"><span class="lineNum"> 94 </span><span class="lineCov"> 102741 : for (j = 0; j &lt; nr; ++j) {</span></a>
<a name="95"><span class="lineNum"> 95 </span><span class="lineCov"> 66916 : uint8_t b = 0;</span></a>
<a name="96"><span class="lineNum"> 96 </span><span class="lineCov"> 66916 : int idj = id[j];</span></a>
<a name="97"><span class="lineNum"> 97 </span> : </a>
<a name="98"><span class="lineNum"> 98 </span> : /* recompute the data */</a>
<a name="99"><span class="lineNum"> 99 </span><span class="lineCov"> 234594 : for (k = 0; k &lt; nr; ++k)</span></a>
<a name="100"><span class="lineNum"> 100 </span><span class="lineCov"> 167678 : b ^= T[j][k][p[k]];</span></a>
<a name="101"><span class="lineNum"> 101 </span> : </a>
<a name="102"><span class="lineNum"> 102 </span> : /* add the parity contribution of the reconstructed data */</a>
<a name="103"><span class="lineNum"> 103 </span><span class="lineCov"> 166984 : for (l = nr; l &lt; nv; ++l)</span></a>
<a name="104"><span class="lineNum"> 104 </span><span class="lineCov"> 100068 : p[l] ^= gfmul[b][gfgen[ip[l]][idj]];</span></a>
<a name="105"><span class="lineNum"> 105 </span> : }</a>
<a name="106"><span class="lineNum"> 106 </span> : </a>
<a name="107"><span class="lineNum"> 107 </span> : /* check that the final parity is 0 */</a>
<a name="108"><span class="lineNum"> 108 </span><span class="lineCov"> 60482 : for (l = nr; l &lt; nv; ++l)</span></a>
<a name="109"><span class="lineNum"> 109 </span><span class="lineCov"> 35906 : if (p[l] != 0)</span></a>
<a name="110"><span class="lineNum"> 110 </span><span class="lineCov"> 11249 : return -1;</span></a>
<a name="111"><span class="lineNum"> 111 </span> : }</a>
<a name="112"><span class="lineNum"> 112 </span> : </a>
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 6 : return 0;</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><span class="lineCov"> 11255 : int raid_check(int nr, int *ir, int nd, int np, size_t size, void **v)</span></a>
<a name="117"><span class="lineNum"> 117 </span> : {</a>
<a name="118"><span class="lineNum"> 118 </span> : /* valid parity index */</a>
<a name="119"><span class="lineNum"> 119 </span> : int ip[RAID_PARITY_MAX];</a>
<a name="120"><span class="lineNum"> 120 </span> : int vp;</a>
<a name="121"><span class="lineNum"> 121 </span> : int rd;</a>
<a name="122"><span class="lineNum"> 122 </span> : int i, j;</a>
<a name="123"><span class="lineNum"> 123 </span> : </a>
<a name="124"><span class="lineNum"> 124 </span> : /* enforce limit on size */</a>
<a name="125"><span class="lineNum"> 125 </span><span class="lineCov"> 11255 : BUG_ON(size % 64 != 0);</span></a>
<a name="126"><span class="lineNum"> 126 </span> : </a>
<a name="127"><span class="lineNum"> 127 </span> : /* enforce limit on number of failures */</a>
<a name="128"><span class="lineNum"> 128 </span><span class="lineCov"> 11255 : BUG_ON(nr &gt;= np); /* &gt;= because we check with extra parity */</span></a>
<a name="129"><span class="lineNum"> 129 </span><span class="lineCov"> 11255 : BUG_ON(np &gt; RAID_PARITY_MAX);</span></a>
<a name="130"><span class="lineNum"> 130 </span> : </a>
<a name="131"><span class="lineNum"> 131 </span> : /* enforce order in index vector */</a>
<a name="132"><span class="lineNum"> 132 </span><span class="lineCov"> 11255 : BUG_ON(nr &gt;= 2 &amp;&amp; ir[0] &gt;= ir[1]);</span></a>
<a name="133"><span class="lineNum"> 133 </span><span class="lineCov"> 11255 : BUG_ON(nr &gt;= 3 &amp;&amp; ir[1] &gt;= ir[2]);</span></a>
<a name="134"><span class="lineNum"> 134 </span><span class="lineCov"> 11255 : BUG_ON(nr &gt;= 4 &amp;&amp; ir[2] &gt;= ir[3]);</span></a>
<a name="135"><span class="lineNum"> 135 </span><span class="lineCov"> 11255 : BUG_ON(nr &gt;= 5 &amp;&amp; ir[3] &gt;= ir[4]);</span></a>
<a name="136"><span class="lineNum"> 136 </span><span class="lineCov"> 11255 : BUG_ON(nr &gt;= 6 &amp;&amp; ir[4] &gt;= ir[5]);</span></a>
<a name="137"><span class="lineNum"> 137 </span> : </a>
<a name="138"><span class="lineNum"> 138 </span> : /* enforce limit on index vector */</a>
<a name="139"><span class="lineNum"> 139 </span><span class="lineCov"> 11255 : BUG_ON(nr &gt; 0 &amp;&amp; ir[nr-1] &gt;= nd + np);</span></a>
<a name="140"><span class="lineNum"> 140 </span> : </a>
<a name="141"><span class="lineNum"> 141 </span> : /* count failed data disk */</a>
<a name="142"><span class="lineNum"> 142 </span><span class="lineCov"> 11255 : rd = 0;</span></a>
<a name="143"><span class="lineNum"> 143 </span><span class="lineCov"> 41316 : while (rd &lt; nr &amp;&amp; ir[rd] &lt; nd)</span></a>
<a name="144"><span class="lineNum"> 144 </span><span class="lineCov"> 30061 : ++rd;</span></a>
<a name="145"><span class="lineNum"> 145 </span> : </a>
<a name="146"><span class="lineNum"> 146 </span> : /* put valid parities into ip[] */</a>
<a name="147"><span class="lineNum"> 147 </span><span class="lineCov"> 11255 : vp = 0;</span></a>
<a name="148"><span class="lineNum"> 148 </span><span class="lineCov"> 76488 : for (i = rd, j = 0; j &lt; np; ++j) {</span></a>
<a name="149"><span class="lineNum"> 149 </span> : /* if parity is failed */</a>
<a name="150"><span class="lineNum"> 150 </span><span class="lineCov"> 65233 : if (i &lt; nr &amp;&amp; ir[i] == nd + j) {</span></a>
<a name="151"><span class="lineNum"> 151 </span> : /* skip broken parity */</a>
<a name="152"><span class="lineNum"> 152 </span><span class="lineCov"> 10664 : ++i;</span></a>
<a name="153"><span class="lineNum"> 153 </span> : } else {</a>
<a name="154"><span class="lineNum"> 154 </span> : /* store valid parity */</a>
<a name="155"><span class="lineNum"> 155 </span><span class="lineCov"> 54569 : ip[vp] = j;</span></a>
<a name="156"><span class="lineNum"> 156 </span><span class="lineCov"> 54569 : ++vp;</span></a>
<a name="157"><span class="lineNum"> 157 </span> : }</a>
<a name="158"><span class="lineNum"> 158 </span> : }</a>
<a name="159"><span class="lineNum"> 159 </span> : </a>
<a name="160"><span class="lineNum"> 160 </span><span class="lineCov"> 11255 : return raid_validate(rd, ir, vp, ip, nd, size, v);</span></a>
<a name="161"><span class="lineNum"> 161 </span> : }</a>
<a name="162"><span class="lineNum"> 162 </span> : </a>
<a name="163"><span class="lineNum"> 163 </span><span class="lineCov"> 7 : int raid_scan(int *ir, int nd, int np, size_t size, void **v)</span></a>
<a name="164"><span class="lineNum"> 164 </span> : {</a>
<a name="165"><span class="lineNum"> 165 </span> : int r;</a>
<a name="166"><span class="lineNum"> 166 </span> : </a>
<a name="167"><span class="lineNum"> 167 </span> : /* check the special case of no failure */</a>
<a name="168"><span class="lineNum"> 168 </span><span class="lineCov"> 7 : if (np != 0 &amp;&amp; raid_check(0, 0, nd, np, size, v) == 0)</span></a>
<a name="169"><span class="lineNum"> 169 </span><span class="lineCov"> 1 : return 0;</span></a>
<a name="170"><span class="lineNum"> 170 </span> : </a>
<a name="171"><span class="lineNum"> 171 </span> : /* for each number of possible failures */</a>
<a name="172"><span class="lineNum"> 172 </span><span class="lineCov"> 16 : for (r = 1; r &lt; np; ++r) {</span></a>
<a name="173"><span class="lineNum"> 173 </span> : /* try all combinations of r failures on n disks */</a>
<a name="174"><span class="lineNum"> 174 </span><span class="lineCov"> 15 : combination_first(r, nd + np, ir);</span></a>
<a name="175"><span class="lineNum"> 175 </span> : do {</a>
<a name="176"><span class="lineNum"> 176 </span> : /* verify if the combination is a valid one */</a>
<a name="177"><span class="lineNum"> 177 </span><span class="lineCov"> 11249 : if (raid_check(r, ir, nd, np, size, v) == 0)</span></a>
<a name="178"><span class="lineNum"> 178 </span><span class="lineCov"> 5 : return r;</span></a>
<a name="179"><span class="lineNum"> 179 </span><span class="lineCov"> 22488 : } while (combination_next(r, nd + np, ir));</span></a>
<a name="180"><span class="lineNum"> 180 </span> : }</a>
<a name="181"><span class="lineNum"> 181 </span> : </a>
<a name="182"><span class="lineNum"> 182 </span> : /* no solution found */</a>
<a name="183"><span class="lineNum"> 183 </span><span class="lineCov"> 1 : return -1;</span></a>
<a name="184"><span class="lineNum"> 184 </span> : }</a>
<a name="185"><span class="lineNum"> 185 </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>