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

528 lines
51 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/test.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> - test.c<span style="font-size: 80%;"> (source / <a href="test.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">153</td>
<td class="headerCovTableEntry">155</td>
<td class="headerCovTableEntryHi">98.7 %</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">7</td>
<td class="headerCovTableEntry">7</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 &quot;internal.h&quot;</a>
<a name="16"><span class="lineNum"> 16 </span> : #include &quot;cpu.h&quot;</a>
<a name="17"><span class="lineNum"> 17 </span> : #include &quot;combo.h&quot;</a>
<a name="18"><span class="lineNum"> 18 </span> : #include &quot;memory.h&quot;</a>
<a name="19"><span class="lineNum"> 19 </span> : </a>
<a name="20"><span class="lineNum"> 20 </span> : /**</a>
<a name="21"><span class="lineNum"> 21 </span> : * Binomial coefficient of n over r.</a>
<a name="22"><span class="lineNum"> 22 </span> : */</a>
<a name="23"><span class="lineNum"> 23 </span><span class="lineCov"> 120 : static int ibc(int n, int r)</span></a>
<a name="24"><span class="lineNum"> 24 </span> : {</a>
<a name="25"><span class="lineNum"> 25 </span><span class="lineCov"> 120 : if (r == 0 || n == r)</span></a>
<a name="26"><span class="lineNum"> 26 </span><span class="lineCov"> 63 : return 1;</span></a>
<a name="27"><span class="lineNum"> 27 </span> : else</a>
<a name="28"><span class="lineNum"> 28 </span><span class="lineCov"> 57 : return ibc(n - 1, r - 1) + ibc(n - 1, r);</span></a>
<a name="29"><span class="lineNum"> 29 </span> : }</a>
<a name="30"><span class="lineNum"> 30 </span> : </a>
<a name="31"><span class="lineNum"> 31 </span> : /**</a>
<a name="32"><span class="lineNum"> 32 </span> : * Power n ^ r;</a>
<a name="33"><span class="lineNum"> 33 </span> : */</a>
<a name="34"><span class="lineNum"> 34 </span><span class="lineCov"> 6 : static int ipow(int n, int r)</span></a>
<a name="35"><span class="lineNum"> 35 </span> : {</a>
<a name="36"><span class="lineNum"> 36 </span><span class="lineCov"> 6 : int v = 1;</span></a>
<a name="37"><span class="lineNum"> 37 </span> : </a>
<a name="38"><span class="lineNum"> 38 </span><span class="lineCov"> 27 : while (r) {</span></a>
<a name="39"><span class="lineNum"> 39 </span><span class="lineCov"> 21 : v *= n;</span></a>
<a name="40"><span class="lineNum"> 40 </span><span class="lineCov"> 21 : --r;</span></a>
<a name="41"><span class="lineNum"> 41 </span> : }</a>
<a name="42"><span class="lineNum"> 42 </span><span class="lineCov"> 6 : return v;</span></a>
<a name="43"><span class="lineNum"> 43 </span> : }</a>
<a name="44"><span class="lineNum"> 44 </span> : </a>
<a name="45"><span class="lineNum"> 45 </span><span class="lineCov"> 1 : int raid_test_combo(void)</span></a>
<a name="46"><span class="lineNum"> 46 </span> : {</a>
<a name="47"><span class="lineNum"> 47 </span> : int r;</a>
<a name="48"><span class="lineNum"> 48 </span> : int count;</a>
<a name="49"><span class="lineNum"> 49 </span> : int p[RAID_PARITY_MAX];</a>
<a name="50"><span class="lineNum"> 50 </span> : </a>
<a name="51"><span class="lineNum"> 51 </span><span class="lineCov"> 7 : for (r = 1; r &lt;= RAID_PARITY_MAX; ++r) {</span></a>
<a name="52"><span class="lineNum"> 52 </span> : /* count combination (r of RAID_PARITY_MAX) elements */</a>
<a name="53"><span class="lineNum"> 53 </span><span class="lineCov"> 6 : count = 0;</span></a>
<a name="54"><span class="lineNum"> 54 </span> : combination_first(r, RAID_PARITY_MAX, p);</a>
<a name="55"><span class="lineNum"> 55 </span> : </a>
<a name="56"><span class="lineNum"> 56 </span> : do {</a>
<a name="57"><span class="lineNum"> 57 </span><span class="lineCov"> 63 : ++count;</span></a>
<a name="58"><span class="lineNum"> 58 </span><span class="lineCov"> 63 : } while (combination_next(r, RAID_PARITY_MAX, p));</span></a>
<a name="59"><span class="lineNum"> 59 </span> : </a>
<a name="60"><span class="lineNum"> 60 </span><span class="lineCov"> 6 : if (count != ibc(RAID_PARITY_MAX, r)) {</span></a>
<a name="61"><span class="lineNum"> 61 </span> : /* LCOV_EXCL_START */</a>
<a name="62"><span class="lineNum"> 62 </span> : return -1;</a>
<a name="63"><span class="lineNum"> 63 </span> : /* LCOV_EXCL_STOP */</a>
<a name="64"><span class="lineNum"> 64 </span> : }</a>
<a name="65"><span class="lineNum"> 65 </span> : }</a>
<a name="66"><span class="lineNum"> 66 </span> : </a>
<a name="67"><span class="lineNum"> 67 </span><span class="lineCov"> 7 : for (r = 1; r &lt;= RAID_PARITY_MAX; ++r) {</span></a>
<a name="68"><span class="lineNum"> 68 </span> : /* count permutation (r of RAID_PARITY_MAX) elements */</a>
<a name="69"><span class="lineNum"> 69 </span><span class="lineCov"> 6 : count = 0;</span></a>
<a name="70"><span class="lineNum"> 70 </span> : permutation_first(r, RAID_PARITY_MAX, p);</a>
<a name="71"><span class="lineNum"> 71 </span> : </a>
<a name="72"><span class="lineNum"> 72 </span> : do {</a>
<a name="73"><span class="lineNum"> 73 </span><span class="lineCov"> 55986 : ++count;</span></a>
<a name="74"><span class="lineNum"> 74 </span><span class="lineCov"> 55986 : } while (permutation_next(r, RAID_PARITY_MAX, p));</span></a>
<a name="75"><span class="lineNum"> 75 </span> : </a>
<a name="76"><span class="lineNum"> 76 </span><span class="lineCov"> 6 : if (count != ipow(RAID_PARITY_MAX, r)) {</span></a>
<a name="77"><span class="lineNum"> 77 </span> : /* LCOV_EXCL_START */</a>
<a name="78"><span class="lineNum"> 78 </span> : return -1;</a>
<a name="79"><span class="lineNum"> 79 </span> : /* LCOV_EXCL_STOP */</a>
<a name="80"><span class="lineNum"> 80 </span> : }</a>
<a name="81"><span class="lineNum"> 81 </span> : }</a>
<a name="82"><span class="lineNum"> 82 </span> : </a>
<a name="83"><span class="lineNum"> 83 </span><span class="lineCov"> 1 : return 0;</span></a>
<a name="84"><span class="lineNum"> 84 </span> : }</a>
<a name="85"><span class="lineNum"> 85 </span> : </a>
<a name="86"><span class="lineNum"> 86 </span><span class="lineCov"> 1 : int raid_test_insert(void)</span></a>
<a name="87"><span class="lineNum"> 87 </span> : {</a>
<a name="88"><span class="lineNum"> 88 </span> : int p[RAID_PARITY_MAX];</a>
<a name="89"><span class="lineNum"> 89 </span> : int r;</a>
<a name="90"><span class="lineNum"> 90 </span> : </a>
<a name="91"><span class="lineNum"> 91 </span><span class="lineCov"> 7 : for (r = 1; r &lt;= RAID_PARITY_MAX; ++r) {</span></a>
<a name="92"><span class="lineNum"> 92 </span> : permutation_first(r, RAID_PARITY_MAX, p);</a>
<a name="93"><span class="lineNum"> 93 </span> : do {</a>
<a name="94"><span class="lineNum"> 94 </span> : int i[RAID_PARITY_MAX];</a>
<a name="95"><span class="lineNum"> 95 </span> : int j;</a>
<a name="96"><span class="lineNum"> 96 </span> : </a>
<a name="97"><span class="lineNum"> 97 </span> : /* insert in order */</a>
<a name="98"><span class="lineNum"> 98 </span><span class="lineCov"> 380712 : for (j = 0; j &lt; r; ++j)</span></a>
<a name="99"><span class="lineNum"> 99 </span><span class="lineCov"> 324726 : raid_insert(j, i, p[j]);</span></a>
<a name="100"><span class="lineNum"> 100 </span> : </a>
<a name="101"><span class="lineNum"> 101 </span> : /* check order */</a>
<a name="102"><span class="lineNum"> 102 </span><span class="lineCov"> 324726 : for (j = 1; j &lt; r; ++j) {</span></a>
<a name="103"><span class="lineNum"> 103 </span><span class="lineCov"> 268740 : if (i[j - 1] &gt; i[j]) {</span></a>
<a name="104"><span class="lineNum"> 104 </span> : /* LCOV_EXCL_START */</a>
<a name="105"><span class="lineNum"> 105 </span> : return -1;</a>
<a name="106"><span class="lineNum"> 106 </span> : /* LCOV_EXCL_STOP */</a>
<a name="107"><span class="lineNum"> 107 </span> : }</a>
<a name="108"><span class="lineNum"> 108 </span> : }</a>
<a name="109"><span class="lineNum"> 109 </span><span class="lineCov"> 55986 : } while (permutation_next(r, RAID_PARITY_MAX, p));</span></a>
<a name="110"><span class="lineNum"> 110 </span> : }</a>
<a name="111"><span class="lineNum"> 111 </span> : </a>
<a name="112"><span class="lineNum"> 112 </span><span class="lineCov"> 1 : return 0;</span></a>
<a name="113"><span class="lineNum"> 113 </span> : }</a>
<a name="114"><span class="lineNum"> 114 </span> : </a>
<a name="115"><span class="lineNum"> 115 </span><span class="lineCov"> 1 : int raid_test_sort(void)</span></a>
<a name="116"><span class="lineNum"> 116 </span> : {</a>
<a name="117"><span class="lineNum"> 117 </span> : int p[RAID_PARITY_MAX];</a>
<a name="118"><span class="lineNum"> 118 </span> : int r;</a>
<a name="119"><span class="lineNum"> 119 </span> : </a>
<a name="120"><span class="lineNum"> 120 </span><span class="lineCov"> 7 : for (r = 1; r &lt;= RAID_PARITY_MAX; ++r) {</span></a>
<a name="121"><span class="lineNum"> 121 </span> : permutation_first(r, RAID_PARITY_MAX, p);</a>
<a name="122"><span class="lineNum"> 122 </span> : do {</a>
<a name="123"><span class="lineNum"> 123 </span> : int i[RAID_PARITY_MAX];</a>
<a name="124"><span class="lineNum"> 124 </span> : int j;</a>
<a name="125"><span class="lineNum"> 125 </span> : </a>
<a name="126"><span class="lineNum"> 126 </span> : /* make a copy */</a>
<a name="127"><span class="lineNum"> 127 </span><span class="lineCov"> 380712 : for (j = 0; j &lt; r; ++j)</span></a>
<a name="128"><span class="lineNum"> 128 </span><span class="lineCov"> 324726 : i[j] = p[j];</span></a>
<a name="129"><span class="lineNum"> 129 </span> : </a>
<a name="130"><span class="lineNum"> 130 </span><span class="lineCov"> 55986 : raid_sort(r, i);</span></a>
<a name="131"><span class="lineNum"> 131 </span> : </a>
<a name="132"><span class="lineNum"> 132 </span> : /* check order */</a>
<a name="133"><span class="lineNum"> 133 </span><span class="lineCov"> 324726 : for (j = 1; j &lt; r; ++j) {</span></a>
<a name="134"><span class="lineNum"> 134 </span><span class="lineCov"> 268740 : if (i[j - 1] &gt; i[j]) {</span></a>
<a name="135"><span class="lineNum"> 135 </span> : /* LCOV_EXCL_START */</a>
<a name="136"><span class="lineNum"> 136 </span> : return -1;</a>
<a name="137"><span class="lineNum"> 137 </span> : /* LCOV_EXCL_STOP */</a>
<a name="138"><span class="lineNum"> 138 </span> : }</a>
<a name="139"><span class="lineNum"> 139 </span> : }</a>
<a name="140"><span class="lineNum"> 140 </span><span class="lineCov"> 55986 : } while (permutation_next(r, RAID_PARITY_MAX, p));</span></a>
<a name="141"><span class="lineNum"> 141 </span> : }</a>
<a name="142"><span class="lineNum"> 142 </span> : </a>
<a name="143"><span class="lineNum"> 143 </span><span class="lineCov"> 1 : return 0;</span></a>
<a name="144"><span class="lineNum"> 144 </span> : }</a>
<a name="145"><span class="lineNum"> 145 </span> : </a>
<a name="146"><span class="lineNum"> 146 </span><span class="lineCov"> 2 : int raid_test_rec(int mode, int nd, size_t size)</span></a>
<a name="147"><span class="lineNum"> 147 </span> : {</a>
<a name="148"><span class="lineNum"> 148 </span> : void (*f[RAID_PARITY_MAX][4])(</a>
<a name="149"><span class="lineNum"> 149 </span> : int nr, int *id, int *ip, int nd, size_t size, void **vbuf);</a>
<a name="150"><span class="lineNum"> 150 </span> : void *v_alloc;</a>
<a name="151"><span class="lineNum"> 151 </span> : void **v;</a>
<a name="152"><span class="lineNum"> 152 </span> : void **data;</a>
<a name="153"><span class="lineNum"> 153 </span> : void **parity;</a>
<a name="154"><span class="lineNum"> 154 </span> : void **test;</a>
<a name="155"><span class="lineNum"> 155 </span> : void *data_save[RAID_PARITY_MAX];</a>
<a name="156"><span class="lineNum"> 156 </span> : void *parity_save[RAID_PARITY_MAX];</a>
<a name="157"><span class="lineNum"> 157 </span> : void *waste;</a>
<a name="158"><span class="lineNum"> 158 </span> : int nv;</a>
<a name="159"><span class="lineNum"> 159 </span> : int id[RAID_PARITY_MAX];</a>
<a name="160"><span class="lineNum"> 160 </span> : int ip[RAID_PARITY_MAX];</a>
<a name="161"><span class="lineNum"> 161 </span> : int i;</a>
<a name="162"><span class="lineNum"> 162 </span> : int j;</a>
<a name="163"><span class="lineNum"> 163 </span> : int nr;</a>
<a name="164"><span class="lineNum"> 164 </span> : int nf[RAID_PARITY_MAX];</a>
<a name="165"><span class="lineNum"> 165 </span> : int np;</a>
<a name="166"><span class="lineNum"> 166 </span> : </a>
<a name="167"><span class="lineNum"> 167 </span><span class="lineCov"> 2 : raid_mode(mode);</span></a>
<a name="168"><span class="lineNum"> 168 </span><span class="lineCov"> 2 : if (mode == RAID_MODE_CAUCHY)</span></a>
<a name="169"><span class="lineNum"> 169 </span><span class="lineCov"> 1 : np = RAID_PARITY_MAX;</span></a>
<a name="170"><span class="lineNum"> 170 </span> : else</a>
<a name="171"><span class="lineNum"> 171 </span><span class="lineCov"> 1 : np = 3;</span></a>
<a name="172"><span class="lineNum"> 172 </span> : </a>
<a name="173"><span class="lineNum"> 173 </span><span class="lineCov"> 2 : nv = nd + np * 2 + 2;</span></a>
<a name="174"><span class="lineNum"> 174 </span> : </a>
<a name="175"><span class="lineNum"> 175 </span><span class="lineCov"> 2 : v = raid_malloc_vector(nd, nv, size, &amp;v_alloc);</span></a>
<a name="176"><span class="lineNum"> 176 </span><span class="lineCov"> 2 : if (!v) {</span></a>
<a name="177"><span class="lineNum"> 177 </span> : /* LCOV_EXCL_START */</a>
<a name="178"><span class="lineNum"> 178 </span> : return -1;</a>
<a name="179"><span class="lineNum"> 179 </span> : /* LCOV_EXCL_STOP */</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><span class="lineCov"> 2 : data = v;</span></a>
<a name="183"><span class="lineNum"> 183 </span><span class="lineCov"> 2 : parity = v + nd;</span></a>
<a name="184"><span class="lineNum"> 184 </span><span class="lineCov"> 2 : test = v + nd + np;</span></a>
<a name="185"><span class="lineNum"> 185 </span> : </a>
<a name="186"><span class="lineNum"> 186 </span><span class="lineCov"> 11 : for (i = 0; i &lt; np; ++i)</span></a>
<a name="187"><span class="lineNum"> 187 </span><span class="lineCov"> 9 : parity_save[i] = parity[i];</span></a>
<a name="188"><span class="lineNum"> 188 </span> : </a>
<a name="189"><span class="lineNum"> 189 </span><span class="lineCov"> 2 : memset(v[nv - 2], 0, size);</span></a>
<a name="190"><span class="lineNum"> 190 </span><span class="lineCov"> 2 : raid_zero(v[nv - 2]);</span></a>
<a name="191"><span class="lineNum"> 191 </span> : </a>
<a name="192"><span class="lineNum"> 192 </span><span class="lineCov"> 2 : waste = v[nv - 1];</span></a>
<a name="193"><span class="lineNum"> 193 </span> : </a>
<a name="194"><span class="lineNum"> 194 </span> : /* fill with pseudo-random data with the arbitrary seed &quot;1&quot; */</a>
<a name="195"><span class="lineNum"> 195 </span><span class="lineCov"> 2 : raid_mrand_vector(1, nd, size, v);</span></a>
<a name="196"><span class="lineNum"> 196 </span> : </a>
<a name="197"><span class="lineNum"> 197 </span> : /* setup recov functions */</a>
<a name="198"><span class="lineNum"> 198 </span><span class="lineCov"> 11 : for (i = 0; i &lt; np; ++i) {</span></a>
<a name="199"><span class="lineNum"> 199 </span><span class="lineCov"> 9 : nf[i] = 0;</span></a>
<a name="200"><span class="lineNum"> 200 </span><span class="lineCov"> 9 : if (i == 0) {</span></a>
<a name="201"><span class="lineNum"> 201 </span><span class="lineCov"> 2 : f[i][nf[i]++] = raid_rec1_int8;</span></a>
<a name="202"><span class="lineNum"> 202 </span> : #ifdef CONFIG_X86</a>
<a name="203"><span class="lineNum"> 203 </span> : #ifdef CONFIG_SSSE3</a>
<a name="204"><span class="lineNum"> 204 </span><span class="lineCov"> 2 : if (raid_cpu_has_ssse3())</span></a>
<a name="205"><span class="lineNum"> 205 </span><span class="lineCov"> 2 : f[i][nf[i]++] = raid_rec1_ssse3;</span></a>
<a name="206"><span class="lineNum"> 206 </span> : #endif</a>
<a name="207"><span class="lineNum"> 207 </span> : #ifdef CONFIG_AVX2</a>
<a name="208"><span class="lineNum"> 208 </span><span class="lineCov"> 2 : if (raid_cpu_has_avx2())</span></a>
<a name="209"><span class="lineNum"> 209 </span><span class="lineCov"> 2 : f[i][nf[i]++] = raid_rec1_avx2;</span></a>
<a name="210"><span class="lineNum"> 210 </span> : #endif</a>
<a name="211"><span class="lineNum"> 211 </span> : #endif</a>
<a name="212"><span class="lineNum"> 212 </span><span class="lineCov"> 7 : } else if (i == 1) {</span></a>
<a name="213"><span class="lineNum"> 213 </span><span class="lineCov"> 2 : f[i][nf[i]++] = raid_rec2_int8;</span></a>
<a name="214"><span class="lineNum"> 214 </span> : #ifdef CONFIG_X86</a>
<a name="215"><span class="lineNum"> 215 </span> : #ifdef CONFIG_SSSE3</a>
<a name="216"><span class="lineNum"> 216 </span><span class="lineCov"> 2 : if (raid_cpu_has_ssse3())</span></a>
<a name="217"><span class="lineNum"> 217 </span><span class="lineCov"> 2 : f[i][nf[i]++] = raid_rec2_ssse3;</span></a>
<a name="218"><span class="lineNum"> 218 </span> : #endif</a>
<a name="219"><span class="lineNum"> 219 </span> : #ifdef CONFIG_AVX2</a>
<a name="220"><span class="lineNum"> 220 </span><span class="lineCov"> 2 : if (raid_cpu_has_avx2())</span></a>
<a name="221"><span class="lineNum"> 221 </span><span class="lineCov"> 2 : f[i][nf[i]++] = raid_rec2_avx2;</span></a>
<a name="222"><span class="lineNum"> 222 </span> : #endif</a>
<a name="223"><span class="lineNum"> 223 </span> : #endif</a>
<a name="224"><span class="lineNum"> 224 </span> : } else {</a>
<a name="225"><span class="lineNum"> 225 </span><span class="lineCov"> 5 : f[i][nf[i]++] = raid_recX_int8;</span></a>
<a name="226"><span class="lineNum"> 226 </span> : #ifdef CONFIG_X86</a>
<a name="227"><span class="lineNum"> 227 </span> : #ifdef CONFIG_SSSE3</a>
<a name="228"><span class="lineNum"> 228 </span><span class="lineCov"> 5 : if (raid_cpu_has_ssse3())</span></a>
<a name="229"><span class="lineNum"> 229 </span><span class="lineCov"> 5 : f[i][nf[i]++] = raid_recX_ssse3;</span></a>
<a name="230"><span class="lineNum"> 230 </span> : #endif</a>
<a name="231"><span class="lineNum"> 231 </span> : #ifdef CONFIG_AVX2</a>
<a name="232"><span class="lineNum"> 232 </span><span class="lineCov"> 5 : if (raid_cpu_has_avx2())</span></a>
<a name="233"><span class="lineNum"> 233 </span><span class="lineCov"> 5 : f[i][nf[i]++] = raid_recX_avx2;</span></a>
<a name="234"><span class="lineNum"> 234 </span> : #endif</a>
<a name="235"><span class="lineNum"> 235 </span> : #endif</a>
<a name="236"><span class="lineNum"> 236 </span> : }</a>
<a name="237"><span class="lineNum"> 237 </span> : }</a>
<a name="238"><span class="lineNum"> 238 </span> : </a>
<a name="239"><span class="lineNum"> 239 </span> : /* compute the parity */</a>
<a name="240"><span class="lineNum"> 240 </span><span class="lineCov"> 2 : raid_gen_ref(nd, np, size, v);</span></a>
<a name="241"><span class="lineNum"> 241 </span> : </a>
<a name="242"><span class="lineNum"> 242 </span> : /* set all the parity to the waste v */</a>
<a name="243"><span class="lineNum"> 243 </span><span class="lineCov"> 11 : for (i = 0; i &lt; np; ++i)</span></a>
<a name="244"><span class="lineNum"> 244 </span><span class="lineCov"> 9 : parity[i] = waste;</span></a>
<a name="245"><span class="lineNum"> 245 </span> : </a>
<a name="246"><span class="lineNum"> 246 </span> : /* all parity levels */</a>
<a name="247"><span class="lineNum"> 247 </span><span class="lineCov"> 11 : for (nr = 1; nr &lt;= np; ++nr) {</span></a>
<a name="248"><span class="lineNum"> 248 </span> : /* all combinations (nr of nd) disks */</a>
<a name="249"><span class="lineNum"> 249 </span> : combination_first(nr, nd, id);</a>
<a name="250"><span class="lineNum"> 250 </span> : do {</a>
<a name="251"><span class="lineNum"> 251 </span> : /* all combinations (nr of np) parities */</a>
<a name="252"><span class="lineNum"> 252 </span> : combination_first(nr, np, ip);</a>
<a name="253"><span class="lineNum"> 253 </span> : do {</a>
<a name="254"><span class="lineNum"> 254 </span> : /* for each recover function */</a>
<a name="255"><span class="lineNum"> 255 </span><span class="lineCov"> 76068 : for (j = 0; j &lt; nf[nr - 1]; ++j) {</span></a>
<a name="256"><span class="lineNum"> 256 </span> : /* set */</a>
<a name="257"><span class="lineNum"> 257 </span><span class="lineCov"> 283095 : for (i = 0; i &lt; nr; ++i) {</span></a>
<a name="258"><span class="lineNum"> 258 </span> : /* remove the missing data */</a>
<a name="259"><span class="lineNum"> 259 </span><span class="lineCov"> 226044 : data_save[i] = data[id[i]];</span></a>
<a name="260"><span class="lineNum"> 260 </span><span class="lineCov"> 226044 : data[id[i]] = test[i];</span></a>
<a name="261"><span class="lineNum"> 261 </span> : /* set the parity to use */</a>
<a name="262"><span class="lineNum"> 262 </span><span class="lineCov"> 226044 : parity[ip[i]] = parity_save[ip[i]];</span></a>
<a name="263"><span class="lineNum"> 263 </span> : }</a>
<a name="264"><span class="lineNum"> 264 </span> : </a>
<a name="265"><span class="lineNum"> 265 </span> : /* recover */</a>
<a name="266"><span class="lineNum"> 266 </span><span class="lineCov"> 57051 : f[nr - 1][j](nr, id, ip, nd, size, v);</span></a>
<a name="267"><span class="lineNum"> 267 </span> : </a>
<a name="268"><span class="lineNum"> 268 </span> : /* check */</a>
<a name="269"><span class="lineNum"> 269 </span><span class="lineCov"> 283095 : for (i = 0; i &lt; nr; ++i) {</span></a>
<a name="270"><span class="lineNum"> 270 </span><span class="lineCov"> 226044 : if (memcmp(test[i], data_save[i], size) != 0) {</span></a>
<a name="271"><span class="lineNum"> 271 </span> : /* LCOV_EXCL_START */</a>
<a name="272"><span class="lineNum"> 272 </span> : goto bail;</a>
<a name="273"><span class="lineNum"> 273 </span> : /* LCOV_EXCL_STOP */</a>
<a name="274"><span class="lineNum"> 274 </span> : }</a>
<a name="275"><span class="lineNum"> 275 </span> : }</a>
<a name="276"><span class="lineNum"> 276 </span> : </a>
<a name="277"><span class="lineNum"> 277 </span> : /* restore */</a>
<a name="278"><span class="lineNum"> 278 </span><span class="lineCov"> 283095 : for (i = 0; i &lt; nr; ++i) {</span></a>
<a name="279"><span class="lineNum"> 279 </span> : /* restore the data */</a>
<a name="280"><span class="lineNum"> 280 </span><span class="lineCov"> 226044 : data[id[i]] = data_save[i];</span></a>
<a name="281"><span class="lineNum"> 281 </span> : /* restore the parity */</a>
<a name="282"><span class="lineNum"> 282 </span><span class="lineCov"> 226044 : parity[ip[i]] = waste;</span></a>
<a name="283"><span class="lineNum"> 283 </span> : }</a>
<a name="284"><span class="lineNum"> 284 </span> : }</a>
<a name="285"><span class="lineNum"> 285 </span><span class="lineCov"> 19017 : } while (combination_next(nr, np, ip));</span></a>
<a name="286"><span class="lineNum"> 286 </span><span class="lineCov"> 2807 : } while (combination_next(nr, nd, id));</span></a>
<a name="287"><span class="lineNum"> 287 </span> : }</a>
<a name="288"><span class="lineNum"> 288 </span> : </a>
<a name="289"><span class="lineNum"> 289 </span><span class="lineCov"> 2 : free(v_alloc);</span></a>
<a name="290"><span class="lineNum"> 290 </span><span class="lineCov"> 2 : free(v);</span></a>
<a name="291"><span class="lineNum"> 291 </span><span class="lineCov"> 2 : return 0;</span></a>
<a name="292"><span class="lineNum"> 292 </span> : </a>
<a name="293"><span class="lineNum"> 293 </span><span class="lineNoCov"> 0 : bail:</span></a>
<a name="294"><span class="lineNum"> 294 </span> : /* LCOV_EXCL_START */</a>
<a name="295"><span class="lineNum"> 295 </span> : free(v_alloc);</a>
<a name="296"><span class="lineNum"> 296 </span> : free(v);</a>
<a name="297"><span class="lineNum"> 297 </span> : return -1;</a>
<a name="298"><span class="lineNum"> 298 </span> : /* LCOV_EXCL_STOP */</a>
<a name="299"><span class="lineNum"> 299 </span> : }</a>
<a name="300"><span class="lineNum"> 300 </span> : </a>
<a name="301"><span class="lineNum"> 301 </span><span class="lineCov"> 3 : int raid_test_par(int mode, int nd, size_t size)</span></a>
<a name="302"><span class="lineNum"> 302 </span> : {</a>
<a name="303"><span class="lineNum"> 303 </span> : void (*f[64])(int nd, size_t size, void **vbuf);</a>
<a name="304"><span class="lineNum"> 304 </span> : void *v_alloc;</a>
<a name="305"><span class="lineNum"> 305 </span> : void **v;</a>
<a name="306"><span class="lineNum"> 306 </span> : int nv;</a>
<a name="307"><span class="lineNum"> 307 </span> : int i, j;</a>
<a name="308"><span class="lineNum"> 308 </span> : int nf;</a>
<a name="309"><span class="lineNum"> 309 </span> : int np;</a>
<a name="310"><span class="lineNum"> 310 </span> : </a>
<a name="311"><span class="lineNum"> 311 </span><span class="lineCov"> 3 : raid_mode(mode);</span></a>
<a name="312"><span class="lineNum"> 312 </span><span class="lineCov"> 3 : if (mode == RAID_MODE_CAUCHY)</span></a>
<a name="313"><span class="lineNum"> 313 </span><span class="lineCov"> 2 : np = RAID_PARITY_MAX;</span></a>
<a name="314"><span class="lineNum"> 314 </span> : else</a>
<a name="315"><span class="lineNum"> 315 </span><span class="lineCov"> 1 : np = 3;</span></a>
<a name="316"><span class="lineNum"> 316 </span> : </a>
<a name="317"><span class="lineNum"> 317 </span><span class="lineCov"> 3 : nv = nd + np * 2;</span></a>
<a name="318"><span class="lineNum"> 318 </span> : </a>
<a name="319"><span class="lineNum"> 319 </span><span class="lineCov"> 3 : v = raid_malloc_vector(nd, nv, size, &amp;v_alloc);</span></a>
<a name="320"><span class="lineNum"> 320 </span><span class="lineCov"> 3 : if (!v) {</span></a>
<a name="321"><span class="lineNum"> 321 </span> : /* LCOV_EXCL_START */</a>
<a name="322"><span class="lineNum"> 322 </span> : return -1;</a>
<a name="323"><span class="lineNum"> 323 </span> : /* LCOV_EXCL_STOP */</a>
<a name="324"><span class="lineNum"> 324 </span> : }</a>
<a name="325"><span class="lineNum"> 325 </span> : </a>
<a name="326"><span class="lineNum"> 326 </span> : /* check memory */</a>
<a name="327"><span class="lineNum"> 327 </span><span class="lineCov"> 3 : if (raid_mtest_vector(nv, size, v) != 0) {</span></a>
<a name="328"><span class="lineNum"> 328 </span> : /* LCOV_EXCL_START */</a>
<a name="329"><span class="lineNum"> 329 </span> : goto bail;</a>
<a name="330"><span class="lineNum"> 330 </span> : /* LCOV_EXCL_STOP */</a>
<a name="331"><span class="lineNum"> 331 </span> : }</a>
<a name="332"><span class="lineNum"> 332 </span> : </a>
<a name="333"><span class="lineNum"> 333 </span> : /* fill with pseudo-random data with the arbitrary seed &quot;2&quot; */</a>
<a name="334"><span class="lineNum"> 334 </span><span class="lineCov"> 3 : raid_mrand_vector(2, nv, size, v);</span></a>
<a name="335"><span class="lineNum"> 335 </span> : </a>
<a name="336"><span class="lineNum"> 336 </span> : /* compute the parity */</a>
<a name="337"><span class="lineNum"> 337 </span><span class="lineCov"> 3 : raid_gen_ref(nd, np, size, v);</span></a>
<a name="338"><span class="lineNum"> 338 </span> : </a>
<a name="339"><span class="lineNum"> 339 </span> : /* copy in back buffers */</a>
<a name="340"><span class="lineNum"> 340 </span><span class="lineCov"> 18 : for (i = 0; i &lt; np; ++i)</span></a>
<a name="341"><span class="lineNum"> 341 </span><span class="lineCov"> 15 : memcpy(v[nd + np + i], v[nd + i], size);</span></a>
<a name="342"><span class="lineNum"> 342 </span> : </a>
<a name="343"><span class="lineNum"> 343 </span> : /* load all the available functions */</a>
<a name="344"><span class="lineNum"> 344 </span><span class="lineCov"> 3 : nf = 0;</span></a>
<a name="345"><span class="lineNum"> 345 </span> : </a>
<a name="346"><span class="lineNum"> 346 </span><span class="lineCov"> 3 : f[nf++] = raid_gen1_int32;</span></a>
<a name="347"><span class="lineNum"> 347 </span><span class="lineCov"> 3 : f[nf++] = raid_gen1_int64;</span></a>
<a name="348"><span class="lineNum"> 348 </span><span class="lineCov"> 3 : f[nf++] = raid_gen2_int32;</span></a>
<a name="349"><span class="lineNum"> 349 </span><span class="lineCov"> 3 : f[nf++] = raid_gen2_int64;</span></a>
<a name="350"><span class="lineNum"> 350 </span> : </a>
<a name="351"><span class="lineNum"> 351 </span> : #ifdef CONFIG_X86</a>
<a name="352"><span class="lineNum"> 352 </span> : #ifdef CONFIG_SSE2</a>
<a name="353"><span class="lineNum"> 353 </span><span class="lineCov"> 3 : if (raid_cpu_has_sse2()) {</span></a>
<a name="354"><span class="lineNum"> 354 </span><span class="lineCov"> 3 : f[nf++] = raid_gen1_sse2;</span></a>
<a name="355"><span class="lineNum"> 355 </span><span class="lineCov"> 3 : f[nf++] = raid_gen2_sse2;</span></a>
<a name="356"><span class="lineNum"> 356 </span> : #ifdef CONFIG_X86_64</a>
<a name="357"><span class="lineNum"> 357 </span><span class="lineCov"> 3 : f[nf++] = raid_gen2_sse2ext;</span></a>
<a name="358"><span class="lineNum"> 358 </span> : #endif</a>
<a name="359"><span class="lineNum"> 359 </span> : }</a>
<a name="360"><span class="lineNum"> 360 </span> : #endif</a>
<a name="361"><span class="lineNum"> 361 </span> : </a>
<a name="362"><span class="lineNum"> 362 </span> : #ifdef CONFIG_AVX2</a>
<a name="363"><span class="lineNum"> 363 </span><span class="lineCov"> 3 : if (raid_cpu_has_avx2()) {</span></a>
<a name="364"><span class="lineNum"> 364 </span><span class="lineCov"> 3 : f[nf++] = raid_gen1_avx2;</span></a>
<a name="365"><span class="lineNum"> 365 </span><span class="lineCov"> 3 : f[nf++] = raid_gen2_avx2;</span></a>
<a name="366"><span class="lineNum"> 366 </span> : }</a>
<a name="367"><span class="lineNum"> 367 </span> : #endif</a>
<a name="368"><span class="lineNum"> 368 </span> : #endif /* CONFIG_X86 */</a>
<a name="369"><span class="lineNum"> 369 </span> : </a>
<a name="370"><span class="lineNum"> 370 </span><span class="lineCov"> 3 : if (mode == RAID_MODE_CAUCHY) {</span></a>
<a name="371"><span class="lineNum"> 371 </span><span class="lineCov"> 2 : f[nf++] = raid_gen3_int8;</span></a>
<a name="372"><span class="lineNum"> 372 </span><span class="lineCov"> 2 : f[nf++] = raid_gen4_int8;</span></a>
<a name="373"><span class="lineNum"> 373 </span><span class="lineCov"> 2 : f[nf++] = raid_gen5_int8;</span></a>
<a name="374"><span class="lineNum"> 374 </span><span class="lineCov"> 2 : f[nf++] = raid_gen6_int8;</span></a>
<a name="375"><span class="lineNum"> 375 </span> : </a>
<a name="376"><span class="lineNum"> 376 </span> : #ifdef CONFIG_X86</a>
<a name="377"><span class="lineNum"> 377 </span> : #ifdef CONFIG_SSSE3</a>
<a name="378"><span class="lineNum"> 378 </span><span class="lineCov"> 2 : if (raid_cpu_has_ssse3()) {</span></a>
<a name="379"><span class="lineNum"> 379 </span><span class="lineCov"> 2 : f[nf++] = raid_gen3_ssse3;</span></a>
<a name="380"><span class="lineNum"> 380 </span><span class="lineCov"> 2 : f[nf++] = raid_gen4_ssse3;</span></a>
<a name="381"><span class="lineNum"> 381 </span><span class="lineCov"> 2 : f[nf++] = raid_gen5_ssse3;</span></a>
<a name="382"><span class="lineNum"> 382 </span><span class="lineCov"> 2 : f[nf++] = raid_gen6_ssse3;</span></a>
<a name="383"><span class="lineNum"> 383 </span> : #ifdef CONFIG_X86_64</a>
<a name="384"><span class="lineNum"> 384 </span><span class="lineCov"> 2 : f[nf++] = raid_gen3_ssse3ext;</span></a>
<a name="385"><span class="lineNum"> 385 </span><span class="lineCov"> 2 : f[nf++] = raid_gen4_ssse3ext;</span></a>
<a name="386"><span class="lineNum"> 386 </span><span class="lineCov"> 2 : f[nf++] = raid_gen5_ssse3ext;</span></a>
<a name="387"><span class="lineNum"> 387 </span><span class="lineCov"> 2 : f[nf++] = raid_gen6_ssse3ext;</span></a>
<a name="388"><span class="lineNum"> 388 </span> : #endif</a>
<a name="389"><span class="lineNum"> 389 </span> : }</a>
<a name="390"><span class="lineNum"> 390 </span> : #endif</a>
<a name="391"><span class="lineNum"> 391 </span> : </a>
<a name="392"><span class="lineNum"> 392 </span> : #ifdef CONFIG_AVX2</a>
<a name="393"><span class="lineNum"> 393 </span> : #ifdef CONFIG_X86_64</a>
<a name="394"><span class="lineNum"> 394 </span><span class="lineCov"> 2 : if (raid_cpu_has_avx2()) {</span></a>
<a name="395"><span class="lineNum"> 395 </span><span class="lineCov"> 2 : f[nf++] = raid_gen3_avx2ext;</span></a>
<a name="396"><span class="lineNum"> 396 </span><span class="lineCov"> 2 : f[nf++] = raid_gen4_avx2ext;</span></a>
<a name="397"><span class="lineNum"> 397 </span><span class="lineCov"> 2 : f[nf++] = raid_gen5_avx2ext;</span></a>
<a name="398"><span class="lineNum"> 398 </span><span class="lineCov"> 2 : f[nf++] = raid_gen6_avx2ext;</span></a>
<a name="399"><span class="lineNum"> 399 </span> : }</a>
<a name="400"><span class="lineNum"> 400 </span> : #endif</a>
<a name="401"><span class="lineNum"> 401 </span> : #endif</a>
<a name="402"><span class="lineNum"> 402 </span> : #endif /* CONFIG_X86 */</a>
<a name="403"><span class="lineNum"> 403 </span> : } else {</a>
<a name="404"><span class="lineNum"> 404 </span><span class="lineCov"> 1 : f[nf++] = raid_genz_int32;</span></a>
<a name="405"><span class="lineNum"> 405 </span><span class="lineCov"> 1 : f[nf++] = raid_genz_int64;</span></a>
<a name="406"><span class="lineNum"> 406 </span> : </a>
<a name="407"><span class="lineNum"> 407 </span> : #ifdef CONFIG_X86</a>
<a name="408"><span class="lineNum"> 408 </span> : #ifdef CONFIG_SSE2</a>
<a name="409"><span class="lineNum"> 409 </span><span class="lineCov"> 1 : if (raid_cpu_has_sse2()) {</span></a>
<a name="410"><span class="lineNum"> 410 </span><span class="lineCov"> 1 : f[nf++] = raid_genz_sse2;</span></a>
<a name="411"><span class="lineNum"> 411 </span> : #ifdef CONFIG_X86_64</a>
<a name="412"><span class="lineNum"> 412 </span><span class="lineCov"> 1 : f[nf++] = raid_genz_sse2ext;</span></a>
<a name="413"><span class="lineNum"> 413 </span> : #endif</a>
<a name="414"><span class="lineNum"> 414 </span> : }</a>
<a name="415"><span class="lineNum"> 415 </span> : #endif</a>
<a name="416"><span class="lineNum"> 416 </span> : </a>
<a name="417"><span class="lineNum"> 417 </span> : #ifdef CONFIG_AVX2</a>
<a name="418"><span class="lineNum"> 418 </span> : #ifdef CONFIG_X86_64</a>
<a name="419"><span class="lineNum"> 419 </span><span class="lineCov"> 1 : if (raid_cpu_has_avx2())</span></a>
<a name="420"><span class="lineNum"> 420 </span><span class="lineCov"> 1 : f[nf++] = raid_genz_avx2ext;</span></a>
<a name="421"><span class="lineNum"> 421 </span> : #endif</a>
<a name="422"><span class="lineNum"> 422 </span> : #endif</a>
<a name="423"><span class="lineNum"> 423 </span> : #endif /* CONFIG_X86 */</a>
<a name="424"><span class="lineNum"> 424 </span> : }</a>
<a name="425"><span class="lineNum"> 425 </span> : </a>
<a name="426"><span class="lineNum"> 426 </span> : /* check all the functions */</a>
<a name="427"><span class="lineNum"> 427 </span><span class="lineCov"> 67 : for (j = 0; j &lt; nf; ++j) {</span></a>
<a name="428"><span class="lineNum"> 428 </span> : /* compute parity */</a>
<a name="429"><span class="lineNum"> 429 </span><span class="lineCov"> 64 : f[j](nd, size, v);</span></a>
<a name="430"><span class="lineNum"> 430 </span> : </a>
<a name="431"><span class="lineNum"> 431 </span> : /* check it */</a>
<a name="432"><span class="lineNum"> 432 </span><span class="lineCov"> 406 : for (i = 0; i &lt; np; ++i) {</span></a>
<a name="433"><span class="lineNum"> 433 </span><span class="lineCov"> 342 : if (memcmp(v[nd + np + i], v[nd + i], size) != 0) {</span></a>
<a name="434"><span class="lineNum"> 434 </span> : /* LCOV_EXCL_START */</a>
<a name="435"><span class="lineNum"> 435 </span> : goto bail;</a>
<a name="436"><span class="lineNum"> 436 </span> : /* LCOV_EXCL_STOP */</a>
<a name="437"><span class="lineNum"> 437 </span> : }</a>
<a name="438"><span class="lineNum"> 438 </span> : }</a>
<a name="439"><span class="lineNum"> 439 </span> : }</a>
<a name="440"><span class="lineNum"> 440 </span> : </a>
<a name="441"><span class="lineNum"> 441 </span><span class="lineCov"> 3 : free(v_alloc);</span></a>
<a name="442"><span class="lineNum"> 442 </span><span class="lineCov"> 3 : free(v);</span></a>
<a name="443"><span class="lineNum"> 443 </span><span class="lineCov"> 3 : return 0;</span></a>
<a name="444"><span class="lineNum"> 444 </span> : </a>
<a name="445"><span class="lineNum"> 445 </span><span class="lineNoCov"> 0 : bail:</span></a>
<a name="446"><span class="lineNum"> 446 </span> : /* LCOV_EXCL_START */</a>
<a name="447"><span class="lineNum"> 447 </span> : free(v_alloc);</a>
<a name="448"><span class="lineNum"> 448 </span> : free(v);</a>
<a name="449"><span class="lineNum"> 449 </span> : return -1;</a>
<a name="450"><span class="lineNum"> 450 </span> : /* LCOV_EXCL_STOP */</a>
<a name="451"><span class="lineNum"> 451 </span> : }</a>
<a name="452"><span class="lineNum"> 452 </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>