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/cmdline/spooky2.c.gcov.html
Andrea Mazzoleni a53ac4a175 Auto update
2026-03-15 18:52:43 +01:00

238 lines
21 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 - cmdline/spooky2.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">cmdline</a> - spooky2.c<span style="font-size: 80%;"> (source / <a href="spooky2.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">20</td>
<td class="headerCovTableEntry">20</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">1</td>
<td class="headerCovTableEntry">1</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 3 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> : * You should have received a copy of the GNU General Public License</a>
<a name="15"><span class="lineNum"> 15 </span> : * along with this program. If not, see &lt;http://www.gnu.org/licenses/&gt;.</a>
<a name="16"><span class="lineNum"> 16 </span> : */</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> : * Derivative work from SpookyV2.cpp/h</a>
<a name="20"><span class="lineNum"> 20 </span> : *</a>
<a name="21"><span class="lineNum"> 21 </span> : * WARNING!!!! Note that this implementation doesn't use the short hash optimization</a>
<a name="22"><span class="lineNum"> 22 </span> : * resulting in different hashes for any length shorter than 192 bytes</a>
<a name="23"><span class="lineNum"> 23 </span> : *</a>
<a name="24"><span class="lineNum"> 24 </span> : * SpookyHash</a>
<a name="25"><span class="lineNum"> 25 </span> : * http://burtleburtle.net/bob/hash/spooky.html</a>
<a name="26"><span class="lineNum"> 26 </span> : *</a>
<a name="27"><span class="lineNum"> 27 </span> : * Exact source used as reference:</a>
<a name="28"><span class="lineNum"> 28 </span> : * http://burtleburtle.net/bob/c/SpookyV2.h</a>
<a name="29"><span class="lineNum"> 29 </span> : * http://burtleburtle.net/bob/c/SpookyV2.cpp</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> : // Spooky Hash</a>
<a name="33"><span class="lineNum"> 33 </span> : // A 128-bit noncryptographic hash, for checksums and table lookup</a>
<a name="34"><span class="lineNum"> 34 </span> : // By Bob Jenkins. Public domain.</a>
<a name="35"><span class="lineNum"> 35 </span> : // Oct 31 2010: published framework, disclaimer ShortHash isn't right</a>
<a name="36"><span class="lineNum"> 36 </span> : // Nov 7 2010: disabled ShortHash</a>
<a name="37"><span class="lineNum"> 37 </span> : // Oct 31 2011: replace End, ShortMix, ShortEnd, enable ShortHash again</a>
<a name="38"><span class="lineNum"> 38 </span> : // April 10 2012: buffer overflow on platforms without unaligned reads</a>
<a name="39"><span class="lineNum"> 39 </span> : // July 12 2012: was passing out variables in final to in/out in short</a>
<a name="40"><span class="lineNum"> 40 </span> : // July 30 2012: I reintroduced the buffer overflow</a>
<a name="41"><span class="lineNum"> 41 </span> : // August 5 2012: SpookyV2: d = should be d += in short hash, and remove extra mix from long hash</a>
<a name="42"><span class="lineNum"> 42 </span> : //</a>
<a name="43"><span class="lineNum"> 43 </span> : // Up to 3 bytes/cycle for long messages. Reasonably fast for short messages.</a>
<a name="44"><span class="lineNum"> 44 </span> : // All 1 or 2 bit deltas achieve avalanche within 1% bias per output bit.</a>
<a name="45"><span class="lineNum"> 45 </span> : //</a>
<a name="46"><span class="lineNum"> 46 </span> : // This was developed for and tested on 64-bit x86-compatible processors.</a>
<a name="47"><span class="lineNum"> 47 </span> : // It assumes the processor is little-endian. There is a macro</a>
<a name="48"><span class="lineNum"> 48 </span> : // controlling whether unaligned reads are allowed (by default they are).</a>
<a name="49"><span class="lineNum"> 49 </span> : // This should be an equally good hash on big-endian machines, but it will</a>
<a name="50"><span class="lineNum"> 50 </span> : // compute different results on them than on little-endian machines.</a>
<a name="51"><span class="lineNum"> 51 </span> : //</a>
<a name="52"><span class="lineNum"> 52 </span> : // Google's CityHash has similar specs to SpookyHash, and CityHash is faster</a>
<a name="53"><span class="lineNum"> 53 </span> : // on new Intel boxes. MD4 and MD5 also have similar specs, but they are orders</a>
<a name="54"><span class="lineNum"> 54 </span> : // of magnitude slower. CRCs are two or more times slower, but unlike</a>
<a name="55"><span class="lineNum"> 55 </span> : // SpookyHash, they have nice math for combining the CRCs of pieces to form</a>
<a name="56"><span class="lineNum"> 56 </span> : // the CRCs of wholes. There are also cryptographic hashes, but those are even</a>
<a name="57"><span class="lineNum"> 57 </span> : // slower than MD5.</a>
<a name="58"><span class="lineNum"> 58 </span> : //</a>
<a name="59"><span class="lineNum"> 59 </span> : </a>
<a name="60"><span class="lineNum"> 60 </span> : #define Mix(data, s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11) \</a>
<a name="61"><span class="lineNum"> 61 </span> : s0 += data[0]; s2 ^= s10; s11 ^= s0; s0 = util_rotl64(s0, 11); s11 += s1; \</a>
<a name="62"><span class="lineNum"> 62 </span> : s1 += data[1]; s3 ^= s11; s0 ^= s1; s1 = util_rotl64(s1, 32); s0 += s2; \</a>
<a name="63"><span class="lineNum"> 63 </span> : s2 += data[2]; s4 ^= s0; s1 ^= s2; s2 = util_rotl64(s2, 43); s1 += s3; \</a>
<a name="64"><span class="lineNum"> 64 </span> : s3 += data[3]; s5 ^= s1; s2 ^= s3; s3 = util_rotl64(s3, 31); s2 += s4; \</a>
<a name="65"><span class="lineNum"> 65 </span> : s4 += data[4]; s6 ^= s2; s3 ^= s4; s4 = util_rotl64(s4, 17); s3 += s5; \</a>
<a name="66"><span class="lineNum"> 66 </span> : s5 += data[5]; s7 ^= s3; s4 ^= s5; s5 = util_rotl64(s5, 28); s4 += s6; \</a>
<a name="67"><span class="lineNum"> 67 </span> : s6 += data[6]; s8 ^= s4; s5 ^= s6; s6 = util_rotl64(s6, 39); s5 += s7; \</a>
<a name="68"><span class="lineNum"> 68 </span> : s7 += data[7]; s9 ^= s5; s6 ^= s7; s7 = util_rotl64(s7, 57); s6 += s8; \</a>
<a name="69"><span class="lineNum"> 69 </span> : s8 += data[8]; s10 ^= s6; s7 ^= s8; s8 = util_rotl64(s8, 55); s7 += s9; \</a>
<a name="70"><span class="lineNum"> 70 </span> : s9 += data[9]; s11 ^= s7; s8 ^= s9; s9 = util_rotl64(s9, 54); s8 += s10; \</a>
<a name="71"><span class="lineNum"> 71 </span> : s10 += data[10]; s0 ^= s8; s9 ^= s10; s10 = util_rotl64(s10, 22); s9 += s11; \</a>
<a name="72"><span class="lineNum"> 72 </span> : s11 += data[11]; s1 ^= s9; s10 ^= s11; s11 = util_rotl64(s11, 46); s10 += s0;</a>
<a name="73"><span class="lineNum"> 73 </span> : </a>
<a name="74"><span class="lineNum"> 74 </span> : #define EndPartial(h0, h1, h2, h3, h4, h5, h6, h7, h8, h9, h10, h11) \</a>
<a name="75"><span class="lineNum"> 75 </span> : h11 += h1; h2 ^= h11; h1 = util_rotl64(h1, 44); \</a>
<a name="76"><span class="lineNum"> 76 </span> : h0 += h2; h3 ^= h0; h2 = util_rotl64(h2, 15); \</a>
<a name="77"><span class="lineNum"> 77 </span> : h1 += h3; h4 ^= h1; h3 = util_rotl64(h3, 34); \</a>
<a name="78"><span class="lineNum"> 78 </span> : h2 += h4; h5 ^= h2; h4 = util_rotl64(h4, 21); \</a>
<a name="79"><span class="lineNum"> 79 </span> : h3 += h5; h6 ^= h3; h5 = util_rotl64(h5, 38); \</a>
<a name="80"><span class="lineNum"> 80 </span> : h4 += h6; h7 ^= h4; h6 = util_rotl64(h6, 33); \</a>
<a name="81"><span class="lineNum"> 81 </span> : h5 += h7; h8 ^= h5; h7 = util_rotl64(h7, 10); \</a>
<a name="82"><span class="lineNum"> 82 </span> : h6 += h8; h9 ^= h6; h8 = util_rotl64(h8, 13); \</a>
<a name="83"><span class="lineNum"> 83 </span> : h7 += h9; h10 ^= h7; h9 = util_rotl64(h9, 38); \</a>
<a name="84"><span class="lineNum"> 84 </span> : h8 += h10; h11 ^= h8; h10 = util_rotl64(h10, 53); \</a>
<a name="85"><span class="lineNum"> 85 </span> : h9 += h11; h0 ^= h9; h11 = util_rotl64(h11, 42); \</a>
<a name="86"><span class="lineNum"> 86 </span> : h10 += h0; h1 ^= h10; h0 = util_rotl64(h0, 54);</a>
<a name="87"><span class="lineNum"> 87 </span> : </a>
<a name="88"><span class="lineNum"> 88 </span> : #define End(data, h0, h1, h2, h3, h4, h5, h6, h7, h8, h9, h10, h11) \</a>
<a name="89"><span class="lineNum"> 89 </span> : h0 += data[0]; h1 += data[1]; h2 += data[2]; h3 += data[3]; \</a>
<a name="90"><span class="lineNum"> 90 </span> : h4 += data[4]; h5 += data[5]; h6 += data[6]; h7 += data[7]; \</a>
<a name="91"><span class="lineNum"> 91 </span> : h8 += data[8]; h9 += data[9]; h10 += data[10]; h11 += data[11]; \</a>
<a name="92"><span class="lineNum"> 92 </span> : EndPartial(h0, h1, h2, h3, h4, h5, h6, h7, h8, h9, h10, h11); \</a>
<a name="93"><span class="lineNum"> 93 </span> : EndPartial(h0, h1, h2, h3, h4, h5, h6, h7, h8, h9, h10, h11); \</a>
<a name="94"><span class="lineNum"> 94 </span> : EndPartial(h0, h1, h2, h3, h4, h5, h6, h7, h8, h9, h10, h11);</a>
<a name="95"><span class="lineNum"> 95 </span> : </a>
<a name="96"><span class="lineNum"> 96 </span> : // number of uint64_t's in internal state</a>
<a name="97"><span class="lineNum"> 97 </span> : #define sc_numVars 12</a>
<a name="98"><span class="lineNum"> 98 </span> : </a>
<a name="99"><span class="lineNum"> 99 </span> : // size of the internal state</a>
<a name="100"><span class="lineNum"> 100 </span> : #define sc_blockSize (sc_numVars * 8)</a>
<a name="101"><span class="lineNum"> 101 </span> : </a>
<a name="102"><span class="lineNum"> 102 </span> : //</a>
<a name="103"><span class="lineNum"> 103 </span> : // sc_const: a constant which:</a>
<a name="104"><span class="lineNum"> 104 </span> : // * is not zero</a>
<a name="105"><span class="lineNum"> 105 </span> : // * is odd</a>
<a name="106"><span class="lineNum"> 106 </span> : // * is a not-very-regular mix of 1's and 0's</a>
<a name="107"><span class="lineNum"> 107 </span> : // * does not need any other special mathematical properties</a>
<a name="108"><span class="lineNum"> 108 </span> : //</a>
<a name="109"><span class="lineNum"> 109 </span> : #define sc_const 0xdeadbeefdeadbeefLL</a>
<a name="110"><span class="lineNum"> 110 </span> : </a>
<a name="111"><span class="lineNum"> 111 </span><span class="lineCov"> 3883794 : void SpookyHash128(const void* data, size_t size, const uint8_t* seed, uint8_t* digest)</span></a>
<a name="112"><span class="lineNum"> 112 </span> : {</a>
<a name="113"><span class="lineNum"> 113 </span> : uint64_t h0, h1, h2, h3, h4, h5, h6, h7, h8, h9, h10, h11;</a>
<a name="114"><span class="lineNum"> 114 </span> : uint64_t buf[sc_numVars];</a>
<a name="115"><span class="lineNum"> 115 </span> : size_t nblocks;</a>
<a name="116"><span class="lineNum"> 116 </span> : const uint64_t* blocks;</a>
<a name="117"><span class="lineNum"> 117 </span> : const uint64_t* end;</a>
<a name="118"><span class="lineNum"> 118 </span> : size_t size_remainder;</a>
<a name="119"><span class="lineNum"> 119 </span> : #if WORDS_BIGENDIAN</a>
<a name="120"><span class="lineNum"> 120 </span> : unsigned i;</a>
<a name="121"><span class="lineNum"> 121 </span> : #endif</a>
<a name="122"><span class="lineNum"> 122 </span> : </a>
<a name="123"><span class="lineNum"> 123 </span><span class="lineCov"> 3883794 : h9 = util_read64(seed + 0);</span></a>
<a name="124"><span class="lineNum"> 124 </span><span class="lineCov"> 3883794 : h10 = util_read64(seed + 8);</span></a>
<a name="125"><span class="lineNum"> 125 </span> : </a>
<a name="126"><span class="lineNum"> 126 </span><span class="lineCov"> 3883794 : h0 = h3 = h6 = h9;</span></a>
<a name="127"><span class="lineNum"> 127 </span><span class="lineCov"> 3883794 : h1 = h4 = h7 = h10;</span></a>
<a name="128"><span class="lineNum"> 128 </span><span class="lineCov"> 3883794 : h2 = h5 = h8 = h11 = sc_const;</span></a>
<a name="129"><span class="lineNum"> 129 </span> : </a>
<a name="130"><span class="lineNum"> 130 </span><span class="lineCov"> 3883794 : nblocks = size / sc_blockSize;</span></a>
<a name="131"><span class="lineNum"> 131 </span><span class="lineCov"> 3883794 : blocks = data;</span></a>
<a name="132"><span class="lineNum"> 132 </span><span class="lineCov"> 3883794 : end = blocks + nblocks * sc_numVars;</span></a>
<a name="133"><span class="lineNum"> 133 </span> : </a>
<a name="134"><span class="lineNum"> 134 </span> : /* body */</a>
<a name="135"><span class="lineNum"> 135 </span><span class="lineCov"> 34702125 : while (blocks &lt; end) {</span></a>
<a name="136"><span class="lineNum"> 136 </span> : #if WORDS_BIGENDIAN</a>
<a name="137"><span class="lineNum"> 137 </span> : for (i = 0; i &lt; sc_numVars; ++i)</a>
<a name="138"><span class="lineNum"> 138 </span> : buf[i] = util_swap64(blocks[i]);</a>
<a name="139"><span class="lineNum"> 139 </span> : Mix(buf, h0, h1, h2, h3, h4, h5, h6, h7, h8, h9, h10, h11);</a>
<a name="140"><span class="lineNum"> 140 </span> : #else</a>
<a name="141"><span class="lineNum"> 141 </span><span class="lineCov"> 30818331 : Mix(blocks, h0, h1, h2, h3, h4, h5, h6, h7, h8, h9, h10, h11);</span></a>
<a name="142"><span class="lineNum"> 142 </span> : #endif</a>
<a name="143"><span class="lineNum"> 143 </span><span class="lineCov"> 30818331 : blocks += sc_numVars;</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> : /* tail */</a>
<a name="147"><span class="lineNum"> 147 </span><span class="lineCov"> 3883794 : size_remainder = (size - ((const uint8_t*)end - (const uint8_t*)data));</span></a>
<a name="148"><span class="lineNum"> 148 </span><span class="lineCov"> 3883794 : memcpy(buf, end, size_remainder);</span></a>
<a name="149"><span class="lineNum"> 149 </span><span class="lineCov"> 3883794 : memset(((uint8_t*)buf) + size_remainder, 0, sc_blockSize - size_remainder);</span></a>
<a name="150"><span class="lineNum"> 150 </span><span class="lineCov"> 3883794 : ((uint8_t*)buf)[sc_blockSize - 1] = size_remainder;</span></a>
<a name="151"><span class="lineNum"> 151 </span> : </a>
<a name="152"><span class="lineNum"> 152 </span> : /* finalization */</a>
<a name="153"><span class="lineNum"> 153 </span> : #if WORDS_BIGENDIAN</a>
<a name="154"><span class="lineNum"> 154 </span> : for (i = 0; i &lt; sc_numVars; ++i)</a>
<a name="155"><span class="lineNum"> 155 </span> : buf[i] = util_swap64(buf[i]);</a>
<a name="156"><span class="lineNum"> 156 </span> : #endif</a>
<a name="157"><span class="lineNum"> 157 </span><span class="lineCov"> 3883794 : End(buf, h0, h1, h2, h3, h4, h5, h6, h7, h8, h9, h10, h11);</span></a>
<a name="158"><span class="lineNum"> 158 </span> : </a>
<a name="159"><span class="lineNum"> 159 </span><span class="lineCov"> 3883794 : util_write64(digest + 0, h0);</span></a>
<a name="160"><span class="lineNum"> 160 </span><span class="lineCov"> 3883794 : util_write64(digest + 8, h1);</span></a>
<a name="161"><span class="lineNum"> 161 </span><span class="lineCov"> 3883794 : }</span></a>
<a name="162"><span class="lineNum"> 162 </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