rt/snapraid
1
0
Fork 0
mirror of https://github.com/amadvance/snapraid.git synced 2026-10-26 19:01:57 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions
snapraid/cov/raid/intz.c.gcov.html
Andrea Mazzoleni a53ac4a175 Auto update
2026-03-15 18:52:43 +01:00

195 lines
15 KiB
HTML
Raw Blame History

<!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/intz.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> - intz.c<span style="font-size: 80%;"> (source / <a href="intz.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">58</td>
<td class="headerCovTableEntry">58</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">2</td>
<td class="headerCovTableEntry">2</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;gf.h&quot;</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> : * GENz (triple parity with powers of 2^-1) 32bit C implementation</a>
<a name="20"><span class="lineNum"> 20 </span> : */</a>
<a name="21"><span class="lineNum"> 21 </span><span class="lineCov"> 21 : void raid_genz_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"> 21 : 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> : uint8_t *q;</a>
<a name="26"><span class="lineNum"> 26 </span> : uint8_t *r;</a>
<a name="27"><span class="lineNum"> 27 </span> : int d, l;</a>
<a name="28"><span class="lineNum"> 28 </span> : size_t i;</a>
<a name="29"><span class="lineNum"> 29 </span> : </a>
<a name="30"><span class="lineNum"> 30 </span> : uint32_t d0, r0, q0, p0;</a>
<a name="31"><span class="lineNum"> 31 </span> : uint32_t d1, r1, q1, p1;</a>
<a name="32"><span class="lineNum"> 32 </span> : </a>
<a name="33"><span class="lineNum"> 33 </span><span class="lineCov"> 21 : l = nd - 1;</span></a>
<a name="34"><span class="lineNum"> 34 </span><span class="lineCov"> 21 : p = v[nd];</span></a>
<a name="35"><span class="lineNum"> 35 </span><span class="lineCov"> 21 : q = v[nd + 1];</span></a>
<a name="36"><span class="lineNum"> 36 </span><span class="lineCov"> 21 : r = v[nd + 2];</span></a>
<a name="37"><span class="lineNum"> 37 </span> : </a>
<a name="38"><span class="lineNum"> 38 </span><span class="lineCov"> 655413 : for (i = 0; i &lt; size; i += 8) {</span></a>
<a name="39"><span class="lineNum"> 39 </span><span class="lineCov"> 655392 : r0 = q0 = p0 = v_32(v[l][i]);</span></a>
<a name="40"><span class="lineNum"> 40 </span><span class="lineCov"> 655392 : r1 = q1 = p1 = v_32(v[l][i + 4]);</span></a>
<a name="41"><span class="lineNum"> 41 </span><span class="lineCov"> 5243904 : for (d = l - 1; d &gt;= 0; --d) {</span></a>
<a name="42"><span class="lineNum"> 42 </span><span class="lineCov"> 4588512 : d0 = v_32(v[d][i]);</span></a>
<a name="43"><span class="lineNum"> 43 </span><span class="lineCov"> 4588512 : d1 = v_32(v[d][i + 4]);</span></a>
<a name="44"><span class="lineNum"> 44 </span> : </a>
<a name="45"><span class="lineNum"> 45 </span><span class="lineCov"> 4588512 : p0 ^= d0;</span></a>
<a name="46"><span class="lineNum"> 46 </span><span class="lineCov"> 4588512 : p1 ^= d1;</span></a>
<a name="47"><span class="lineNum"> 47 </span> : </a>
<a name="48"><span class="lineNum"> 48 </span><span class="lineCov"> 4588512 : q0 = x2_32(q0);</span></a>
<a name="49"><span class="lineNum"> 49 </span><span class="lineCov"> 4588512 : q1 = x2_32(q1);</span></a>
<a name="50"><span class="lineNum"> 50 </span> : </a>
<a name="51"><span class="lineNum"> 51 </span><span class="lineCov"> 4588512 : q0 ^= d0;</span></a>
<a name="52"><span class="lineNum"> 52 </span><span class="lineCov"> 4588512 : q1 ^= d1;</span></a>
<a name="53"><span class="lineNum"> 53 </span> : </a>
<a name="54"><span class="lineNum"> 54 </span><span class="lineCov"> 4588512 : r0 = d2_32(r0);</span></a>
<a name="55"><span class="lineNum"> 55 </span><span class="lineCov"> 4588512 : r1 = d2_32(r1);</span></a>
<a name="56"><span class="lineNum"> 56 </span> : </a>
<a name="57"><span class="lineNum"> 57 </span><span class="lineCov"> 4588512 : r0 ^= d0;</span></a>
<a name="58"><span class="lineNum"> 58 </span><span class="lineCov"> 4588512 : r1 ^= d1;</span></a>
<a name="59"><span class="lineNum"> 59 </span> : }</a>
<a name="60"><span class="lineNum"> 60 </span><span class="lineCov"> 655392 : v_32(p[i]) = p0;</span></a>
<a name="61"><span class="lineNum"> 61 </span><span class="lineCov"> 655392 : v_32(p[i + 4]) = p1;</span></a>
<a name="62"><span class="lineNum"> 62 </span><span class="lineCov"> 655392 : v_32(q[i]) = q0;</span></a>
<a name="63"><span class="lineNum"> 63 </span><span class="lineCov"> 655392 : v_32(q[i + 4]) = q1;</span></a>
<a name="64"><span class="lineNum"> 64 </span><span class="lineCov"> 655392 : v_32(r[i]) = r0;</span></a>
<a name="65"><span class="lineNum"> 65 </span><span class="lineCov"> 655392 : v_32(r[i + 4]) = r1;</span></a>
<a name="66"><span class="lineNum"> 66 </span> : }</a>
<a name="67"><span class="lineNum"> 67 </span><span class="lineCov"> 21 : }</span></a>
<a name="68"><span class="lineNum"> 68 </span> : </a>
<a name="69"><span class="lineNum"> 69 </span> : /*</a>
<a name="70"><span class="lineNum"> 70 </span> : * GENz (triple parity with powers of 2^-1) 64bit C implementation</a>
<a name="71"><span class="lineNum"> 71 </span> : */</a>
<a name="72"><span class="lineNum"> 72 </span><span class="lineCov"> 38 : void raid_genz_int64(int nd, size_t size, void **vv)</span></a>
<a name="73"><span class="lineNum"> 73 </span> : {</a>
<a name="74"><span class="lineNum"> 74 </span><span class="lineCov"> 38 : uint8_t **v = (uint8_t**)vv;</span></a>
<a name="75"><span class="lineNum"> 75 </span> : uint8_t *p;</a>
<a name="76"><span class="lineNum"> 76 </span> : uint8_t *q;</a>
<a name="77"><span class="lineNum"> 77 </span> : uint8_t *r;</a>
<a name="78"><span class="lineNum"> 78 </span> : int d, l;</a>
<a name="79"><span class="lineNum"> 79 </span> : size_t i;</a>
<a name="80"><span class="lineNum"> 80 </span> : </a>
<a name="81"><span class="lineNum"> 81 </span> : uint64_t d0, r0, q0, p0;</a>
<a name="82"><span class="lineNum"> 82 </span> : uint64_t d1, r1, q1, p1;</a>
<a name="83"><span class="lineNum"> 83 </span> : </a>
<a name="84"><span class="lineNum"> 84 </span><span class="lineCov"> 38 : l = nd - 1;</span></a>
<a name="85"><span class="lineNum"> 85 </span><span class="lineCov"> 38 : p = v[nd];</span></a>
<a name="86"><span class="lineNum"> 86 </span><span class="lineCov"> 38 : q = v[nd + 1];</span></a>
<a name="87"><span class="lineNum"> 87 </span><span class="lineCov"> 38 : r = v[nd + 2];</span></a>
<a name="88"><span class="lineNum"> 88 </span> : </a>
<a name="89"><span class="lineNum"> 89 </span><span class="lineCov"> 606262 : for (i = 0; i &lt; size; i += 16) {</span></a>
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 606224 : r0 = q0 = p0 = v_64(v[l][i]);</span></a>
<a name="91"><span class="lineNum"> 91 </span><span class="lineCov"> 606224 : r1 = q1 = p1 = v_64(v[l][i + 8]);</span></a>
<a name="92"><span class="lineNum"> 92 </span><span class="lineCov"> 4850176 : for (d = l - 1; d &gt;= 0; --d) {</span></a>
<a name="93"><span class="lineNum"> 93 </span><span class="lineCov"> 4243952 : d0 = v_64(v[d][i]);</span></a>
<a name="94"><span class="lineNum"> 94 </span><span class="lineCov"> 4243952 : d1 = v_64(v[d][i + 8]);</span></a>
<a name="95"><span class="lineNum"> 95 </span> : </a>
<a name="96"><span class="lineNum"> 96 </span><span class="lineCov"> 4243952 : p0 ^= d0;</span></a>
<a name="97"><span class="lineNum"> 97 </span><span class="lineCov"> 4243952 : p1 ^= d1;</span></a>
<a name="98"><span class="lineNum"> 98 </span> : </a>
<a name="99"><span class="lineNum"> 99 </span><span class="lineCov"> 4243952 : q0 = x2_64(q0);</span></a>
<a name="100"><span class="lineNum"> 100 </span><span class="lineCov"> 4243952 : q1 = x2_64(q1);</span></a>
<a name="101"><span class="lineNum"> 101 </span> : </a>
<a name="102"><span class="lineNum"> 102 </span><span class="lineCov"> 4243952 : q0 ^= d0;</span></a>
<a name="103"><span class="lineNum"> 103 </span><span class="lineCov"> 4243952 : q1 ^= d1;</span></a>
<a name="104"><span class="lineNum"> 104 </span> : </a>
<a name="105"><span class="lineNum"> 105 </span><span class="lineCov"> 4243952 : r0 = d2_64(r0);</span></a>
<a name="106"><span class="lineNum"> 106 </span><span class="lineCov"> 4243952 : r1 = d2_64(r1);</span></a>
<a name="107"><span class="lineNum"> 107 </span> : </a>
<a name="108"><span class="lineNum"> 108 </span><span class="lineCov"> 4243952 : r0 ^= d0;</span></a>
<a name="109"><span class="lineNum"> 109 </span><span class="lineCov"> 4243952 : r1 ^= d1;</span></a>
<a name="110"><span class="lineNum"> 110 </span> : }</a>
<a name="111"><span class="lineNum"> 111 </span><span class="lineCov"> 606224 : v_64(p[i]) = p0;</span></a>
<a name="112"><span class="lineNum"> 112 </span><span class="lineCov"> 606224 : v_64(p[i + 8]) = p1;</span></a>
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 606224 : v_64(q[i]) = q0;</span></a>
<a name="114"><span class="lineNum"> 114 </span><span class="lineCov"> 606224 : v_64(q[i + 8]) = q1;</span></a>
<a name="115"><span class="lineNum"> 115 </span><span class="lineCov"> 606224 : v_64(r[i]) = r0;</span></a>
<a name="116"><span class="lineNum"> 116 </span><span class="lineCov"> 606224 : v_64(r[i + 8]) = r1;</span></a>
<a name="117"><span class="lineNum"> 117 </span> : }</a>
<a name="118"><span class="lineNum"> 118 </span><span class="lineCov"> 38 : }</span></a>
<a name="119"><span class="lineNum"> 119 </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>
Reference in a new issue View git blame Copy permalink