mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
195 lines
14 KiB
HTML
195 lines
14 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/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.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">2016-11-21</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>
|
|
<span class="lineNum"> 2 </span> : * Copyright (C) 2013 Andrea Mazzoleni
|
|
<span class="lineNum"> 3 </span> : *
|
|
<span class="lineNum"> 4 </span> : * This program is free software: you can redistribute it and/or modify
|
|
<span class="lineNum"> 5 </span> : * it under the terms of the GNU General Public License as published by
|
|
<span class="lineNum"> 6 </span> : * the Free Software Foundation, either version 2 of the License, or
|
|
<span class="lineNum"> 7 </span> : * (at your option) any later version.
|
|
<span class="lineNum"> 8 </span> : *
|
|
<span class="lineNum"> 9 </span> : * This program is distributed in the hope that it will be useful,
|
|
<span class="lineNum"> 10 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
<span class="lineNum"> 11 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
<span class="lineNum"> 12 </span> : * GNU General Public License for more details.
|
|
<span class="lineNum"> 13 </span> : */
|
|
<span class="lineNum"> 14 </span> :
|
|
<span class="lineNum"> 15 </span> : #include "internal.h"
|
|
<span class="lineNum"> 16 </span> : #include "gf.h"
|
|
<span class="lineNum"> 17 </span> :
|
|
<span class="lineNum"> 18 </span> : /*
|
|
<a name="19"><span class="lineNum"> 19 </span> : * GENz (triple parity with powers of 2^-1) 32bit C implementation</a>
|
|
<span class="lineNum"> 20 </span> : */
|
|
<span class="lineNum"> 21 </span><span class="lineCov"> 29 : void raid_genz_int32(int nd, size_t size, void **vv)</span>
|
|
<span class="lineNum"> 22 </span> : {
|
|
<span class="lineNum"> 23 </span><span class="lineCov"> 29 : uint8_t **v = (uint8_t**)vv;</span>
|
|
<span class="lineNum"> 24 </span> : uint8_t *p;
|
|
<span class="lineNum"> 25 </span> : uint8_t *q;
|
|
<span class="lineNum"> 26 </span> : uint8_t *r;
|
|
<span class="lineNum"> 27 </span> : int d, l;
|
|
<span class="lineNum"> 28 </span> : size_t i;
|
|
<span class="lineNum"> 29 </span> :
|
|
<span class="lineNum"> 30 </span> : uint32_t d0, r0, q0, p0;
|
|
<span class="lineNum"> 31 </span> : uint32_t d1, r1, q1, p1;
|
|
<span class="lineNum"> 32 </span> :
|
|
<span class="lineNum"> 33 </span><span class="lineCov"> 29 : l = nd - 1;</span>
|
|
<span class="lineNum"> 34 </span><span class="lineCov"> 29 : p = v[nd];</span>
|
|
<span class="lineNum"> 35 </span><span class="lineCov"> 29 : q = v[nd + 1];</span>
|
|
<span class="lineNum"> 36 </span><span class="lineCov"> 29 : r = v[nd + 2];</span>
|
|
<span class="lineNum"> 37 </span> :
|
|
<span class="lineNum"> 38 </span><span class="lineCov"> 917565 : for (i = 0; i < size; i += 8) {</span>
|
|
<span class="lineNum"> 39 </span><span class="lineCov"> 917536 : r0 = q0 = p0 = v_32(v[l][i]);</span>
|
|
<span class="lineNum"> 40 </span><span class="lineCov"> 917536 : r1 = q1 = p1 = v_32(v[l][i + 4]);</span>
|
|
<span class="lineNum"> 41 </span><span class="lineCov"> 7341056 : for (d = l - 1; d >= 0; --d) {</span>
|
|
<span class="lineNum"> 42 </span><span class="lineCov"> 6423520 : d0 = v_32(v[d][i]);</span>
|
|
<span class="lineNum"> 43 </span><span class="lineCov"> 6423520 : d1 = v_32(v[d][i + 4]);</span>
|
|
<span class="lineNum"> 44 </span> :
|
|
<span class="lineNum"> 45 </span><span class="lineCov"> 6423520 : p0 ^= d0;</span>
|
|
<span class="lineNum"> 46 </span><span class="lineCov"> 6423520 : p1 ^= d1;</span>
|
|
<span class="lineNum"> 47 </span> :
|
|
<span class="lineNum"> 48 </span><span class="lineCov"> 6423520 : q0 = x2_32(q0);</span>
|
|
<span class="lineNum"> 49 </span><span class="lineCov"> 6423520 : q1 = x2_32(q1);</span>
|
|
<span class="lineNum"> 50 </span> :
|
|
<span class="lineNum"> 51 </span><span class="lineCov"> 6423520 : q0 ^= d0;</span>
|
|
<span class="lineNum"> 52 </span><span class="lineCov"> 6423520 : q1 ^= d1;</span>
|
|
<span class="lineNum"> 53 </span> :
|
|
<span class="lineNum"> 54 </span><span class="lineCov"> 6423520 : r0 = d2_32(r0);</span>
|
|
<span class="lineNum"> 55 </span><span class="lineCov"> 6423520 : r1 = d2_32(r1);</span>
|
|
<span class="lineNum"> 56 </span> :
|
|
<span class="lineNum"> 57 </span><span class="lineCov"> 6423520 : r0 ^= d0;</span>
|
|
<span class="lineNum"> 58 </span><span class="lineCov"> 6423520 : r1 ^= d1;</span>
|
|
<span class="lineNum"> 59 </span> : }
|
|
<span class="lineNum"> 60 </span><span class="lineCov"> 917536 : v_32(p[i]) = p0;</span>
|
|
<span class="lineNum"> 61 </span><span class="lineCov"> 917536 : v_32(p[i + 4]) = p1;</span>
|
|
<span class="lineNum"> 62 </span><span class="lineCov"> 917536 : v_32(q[i]) = q0;</span>
|
|
<span class="lineNum"> 63 </span><span class="lineCov"> 917536 : v_32(q[i + 4]) = q1;</span>
|
|
<span class="lineNum"> 64 </span><span class="lineCov"> 917536 : v_32(r[i]) = r0;</span>
|
|
<span class="lineNum"> 65 </span><span class="lineCov"> 917536 : v_32(r[i + 4]) = r1;</span>
|
|
<span class="lineNum"> 66 </span> : }
|
|
<span class="lineNum"> 67 </span><span class="lineCov"> 29 : }</span>
|
|
<span class="lineNum"> 68 </span> :
|
|
<span class="lineNum"> 69 </span> : /*
|
|
<a name="70"><span class="lineNum"> 70 </span> : * GENz (triple parity with powers of 2^-1) 64bit C implementation</a>
|
|
<span class="lineNum"> 71 </span> : */
|
|
<span class="lineNum"> 72 </span><span class="lineCov"> 29 : void raid_genz_int64(int nd, size_t size, void **vv)</span>
|
|
<span class="lineNum"> 73 </span> : {
|
|
<span class="lineNum"> 74 </span><span class="lineCov"> 29 : uint8_t **v = (uint8_t**)vv;</span>
|
|
<span class="lineNum"> 75 </span> : uint8_t *p;
|
|
<span class="lineNum"> 76 </span> : uint8_t *q;
|
|
<span class="lineNum"> 77 </span> : uint8_t *r;
|
|
<span class="lineNum"> 78 </span> : int d, l;
|
|
<span class="lineNum"> 79 </span> : size_t i;
|
|
<span class="lineNum"> 80 </span> :
|
|
<span class="lineNum"> 81 </span> : uint64_t d0, r0, q0, p0;
|
|
<span class="lineNum"> 82 </span> : uint64_t d1, r1, q1, p1;
|
|
<span class="lineNum"> 83 </span> :
|
|
<span class="lineNum"> 84 </span><span class="lineCov"> 29 : l = nd - 1;</span>
|
|
<span class="lineNum"> 85 </span><span class="lineCov"> 29 : p = v[nd];</span>
|
|
<span class="lineNum"> 86 </span><span class="lineCov"> 29 : q = v[nd + 1];</span>
|
|
<span class="lineNum"> 87 </span><span class="lineCov"> 29 : r = v[nd + 2];</span>
|
|
<span class="lineNum"> 88 </span> :
|
|
<span class="lineNum"> 89 </span><span class="lineCov"> 458797 : for (i = 0; i < size; i += 16) {</span>
|
|
<span class="lineNum"> 90 </span><span class="lineCov"> 458768 : r0 = q0 = p0 = v_64(v[l][i]);</span>
|
|
<span class="lineNum"> 91 </span><span class="lineCov"> 458768 : r1 = q1 = p1 = v_64(v[l][i + 8]);</span>
|
|
<span class="lineNum"> 92 </span><span class="lineCov"> 3670528 : for (d = l - 1; d >= 0; --d) {</span>
|
|
<span class="lineNum"> 93 </span><span class="lineCov"> 3211760 : d0 = v_64(v[d][i]);</span>
|
|
<span class="lineNum"> 94 </span><span class="lineCov"> 3211760 : d1 = v_64(v[d][i + 8]);</span>
|
|
<span class="lineNum"> 95 </span> :
|
|
<span class="lineNum"> 96 </span><span class="lineCov"> 3211760 : p0 ^= d0;</span>
|
|
<span class="lineNum"> 97 </span><span class="lineCov"> 3211760 : p1 ^= d1;</span>
|
|
<span class="lineNum"> 98 </span> :
|
|
<span class="lineNum"> 99 </span><span class="lineCov"> 3211760 : q0 = x2_64(q0);</span>
|
|
<span class="lineNum"> 100 </span><span class="lineCov"> 3211760 : q1 = x2_64(q1);</span>
|
|
<span class="lineNum"> 101 </span> :
|
|
<span class="lineNum"> 102 </span><span class="lineCov"> 3211760 : q0 ^= d0;</span>
|
|
<span class="lineNum"> 103 </span><span class="lineCov"> 3211760 : q1 ^= d1;</span>
|
|
<span class="lineNum"> 104 </span> :
|
|
<span class="lineNum"> 105 </span><span class="lineCov"> 3211760 : r0 = d2_64(r0);</span>
|
|
<span class="lineNum"> 106 </span><span class="lineCov"> 3211760 : r1 = d2_64(r1);</span>
|
|
<span class="lineNum"> 107 </span> :
|
|
<span class="lineNum"> 108 </span><span class="lineCov"> 3211760 : r0 ^= d0;</span>
|
|
<span class="lineNum"> 109 </span><span class="lineCov"> 3211760 : r1 ^= d1;</span>
|
|
<span class="lineNum"> 110 </span> : }
|
|
<span class="lineNum"> 111 </span><span class="lineCov"> 458768 : v_64(p[i]) = p0;</span>
|
|
<span class="lineNum"> 112 </span><span class="lineCov"> 458768 : v_64(p[i + 8]) = p1;</span>
|
|
<span class="lineNum"> 113 </span><span class="lineCov"> 458768 : v_64(q[i]) = q0;</span>
|
|
<span class="lineNum"> 114 </span><span class="lineCov"> 458768 : v_64(q[i + 8]) = q1;</span>
|
|
<span class="lineNum"> 115 </span><span class="lineCov"> 458768 : v_64(r[i]) = r0;</span>
|
|
<span class="lineNum"> 116 </span><span class="lineCov"> 458768 : v_64(r[i + 8]) = r1;</span>
|
|
<span class="lineNum"> 117 </span> : }
|
|
<span class="lineNum"> 118 </span><span class="lineCov"> 29 : }</span>
|
|
<span class="lineNum"> 119 </span> :
|
|
</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="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LCOV version 1.10</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|