mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
256 lines
20 KiB
HTML
256 lines
20 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 - cmdline/murmur3.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> - murmur3.c<span style="font-size: 80%;"> (source / <a href="murmur3.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">70</td>
|
|
<td class="headerCovTableEntry">70</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) 2011 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 3 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> : * You should have received a copy of the GNU General Public License
|
|
<span class="lineNum"> 15 </span> : * along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
<span class="lineNum"> 16 </span> : */
|
|
<span class="lineNum"> 17 </span> :
|
|
<span class="lineNum"> 18 </span> : /*
|
|
<span class="lineNum"> 19 </span> : * Derivative work from MurmorHash3.cpp revision r136
|
|
<span class="lineNum"> 20 </span> : *
|
|
<span class="lineNum"> 21 </span> : * SMHasher & MurmurHash
|
|
<span class="lineNum"> 22 </span> : * http://code.google.com/p/smhasher/
|
|
<span class="lineNum"> 23 </span> : *
|
|
<span class="lineNum"> 24 </span> : * Exact source used as reference:
|
|
<span class="lineNum"> 25 </span> : * http://code.google.com/p/smhasher/source/browse/trunk/MurmurHash3.cpp?spec=svn136&r=136
|
|
<span class="lineNum"> 26 </span> : */
|
|
<span class="lineNum"> 27 </span> :
|
|
<span class="lineNum"> 28 </span> : // MurmurHash3 was written by Austin Appleby, and is placed in the public
|
|
<span class="lineNum"> 29 </span> : // domain. The author hereby disclaims copyright to this source code.
|
|
<a name="30"><span class="lineNum"> 30 </span> : </a>
|
|
<span class="lineNum"> 31 </span> : /* Finalization mix - force all bits of a hash block to avalanche */
|
|
<span class="lineNum"> 32 </span><span class="lineCov"> 8307408 : static inline uint32_t fmix32(uint32_t h)</span>
|
|
<span class="lineNum"> 33 </span> : {
|
|
<span class="lineNum"> 34 </span><span class="lineCov"> 8307408 : h ^= h >> 16;</span>
|
|
<span class="lineNum"> 35 </span><span class="lineCov"> 8307408 : h *= 0x85ebca6b;</span>
|
|
<span class="lineNum"> 36 </span><span class="lineCov"> 8307408 : h ^= h >> 13;</span>
|
|
<span class="lineNum"> 37 </span><span class="lineCov"> 8307408 : h *= 0xc2b2ae35;</span>
|
|
<span class="lineNum"> 38 </span><span class="lineCov"> 8307408 : h ^= h >> 16;</span>
|
|
<span class="lineNum"> 39 </span><span class="lineCov"> 8307408 : return h;</span>
|
|
<span class="lineNum"> 40 </span> : }
|
|
<span class="lineNum"> 41 </span> :
|
|
<span class="lineNum"> 42 </span> : /*
|
|
<span class="lineNum"> 43 </span> : * Warning!
|
|
<span class="lineNum"> 44 </span> : * Don't declare these variables static, otherwise the gcc optimizer
|
|
<span class="lineNum"> 45 </span> : * may generate very slow code for multiplication with these constants,
|
|
<span class="lineNum"> 46 </span> : * like:
|
|
<span class="lineNum"> 47 </span> :
|
|
<span class="lineNum"> 48 </span> : -> .cpp
|
|
<span class="lineNum"> 49 </span> : k1 *= c1;
|
|
<span class="lineNum"> 50 </span> : -> .asm
|
|
<span class="lineNum"> 51 </span> : 152: 8d 14 80 lea (%eax,%eax,4),%edx
|
|
<span class="lineNum"> 52 </span> : 155: 8d 14 90 lea (%eax,%edx,4),%edx
|
|
<span class="lineNum"> 53 </span> : 158: c1 e2 03 shl $0x3,%edx
|
|
<span class="lineNum"> 54 </span> : 15b: 29 c2 sub %eax,%edx
|
|
<span class="lineNum"> 55 </span> : 15d: 8d 14 d2 lea (%edx,%edx,8),%edx
|
|
<span class="lineNum"> 56 </span> : 160: 8d 14 90 lea (%eax,%edx,4),%edx
|
|
<span class="lineNum"> 57 </span> : 163: 8d 14 d0 lea (%eax,%edx,8),%edx
|
|
<span class="lineNum"> 58 </span> : 166: 8d 14 90 lea (%eax,%edx,4),%edx
|
|
<span class="lineNum"> 59 </span> : 169: 8d 14 50 lea (%eax,%edx,2),%edx
|
|
<span class="lineNum"> 60 </span> : 16c: 8d 14 90 lea (%eax,%edx,4),%edx
|
|
<span class="lineNum"> 61 </span> : 16f: 8d 14 92 lea (%edx,%edx,4),%edx
|
|
<span class="lineNum"> 62 </span> : 172: 8d 14 50 lea (%eax,%edx,2),%edx
|
|
<span class="lineNum"> 63 </span> : 175: 8d 04 d0 lea (%eax,%edx,8),%eax
|
|
<span class="lineNum"> 64 </span> : 178: 8d 14 c5 00 00 00 00 lea 0x0(,%eax,8),%edx
|
|
<span class="lineNum"> 65 </span> : 17f: 29 d0 sub %edx,%eax
|
|
<span class="lineNum"> 66 </span> :
|
|
<span class="lineNum"> 67 </span> : * resulting in speeds of 500 MB/s instead of 3000 MB/s.
|
|
<span class="lineNum"> 68 </span> : *
|
|
<span class="lineNum"> 69 </span> : * Verified with gcc 4.4.4 compiling with :
|
|
<span class="lineNum"> 70 </span> : *
|
|
<span class="lineNum"> 71 </span> : * g++ -g -c -O2 MurmurHash3.cpp -o MurmurHash3.o
|
|
<span class="lineNum"> 72 </span> : */
|
|
<span class="lineNum"> 73 </span> : uint32_t c1 = 0x239b961b;
|
|
<span class="lineNum"> 74 </span> : uint32_t c2 = 0xab0e9789;
|
|
<span class="lineNum"> 75 </span> : uint32_t c3 = 0x38b34ae5;
|
|
<a name="76"><span class="lineNum"> 76 </span> : uint32_t c4 = 0xa1e38b93;</a>
|
|
<span class="lineNum"> 77 </span> :
|
|
<span class="lineNum"> 78 </span><span class="lineCov"> 2076852 : void MurmurHash3_x86_128(const void* data, size_t size, const uint8_t* seed, void* digest)</span>
|
|
<span class="lineNum"> 79 </span> : {
|
|
<span class="lineNum"> 80 </span> : size_t nblocks;
|
|
<span class="lineNum"> 81 </span> : const uint32_t* blocks;
|
|
<span class="lineNum"> 82 </span> : const uint32_t* end;
|
|
<span class="lineNum"> 83 </span> : size_t size_remainder;
|
|
<span class="lineNum"> 84 </span> : uint32_t h1, h2, h3, h4;
|
|
<span class="lineNum"> 85 </span> :
|
|
<span class="lineNum"> 86 </span><span class="lineCov"> 2076852 : h1 = util_read32(seed + 0);</span>
|
|
<span class="lineNum"> 87 </span><span class="lineCov"> 2076852 : h2 = util_read32(seed + 4);</span>
|
|
<span class="lineNum"> 88 </span><span class="lineCov"> 2076852 : h3 = util_read32(seed + 8);</span>
|
|
<span class="lineNum"> 89 </span><span class="lineCov"> 2076852 : h4 = util_read32(seed + 12);</span>
|
|
<span class="lineNum"> 90 </span> :
|
|
<span class="lineNum"> 91 </span><span class="lineCov"> 2076852 : nblocks = size / 16;</span>
|
|
<span class="lineNum"> 92 </span><span class="lineCov"> 2076852 : blocks = data;</span>
|
|
<span class="lineNum"> 93 </span><span class="lineCov"> 2076852 : end = blocks + nblocks * 4;</span>
|
|
<span class="lineNum"> 94 </span> :
|
|
<span class="lineNum"> 95 </span> : /* body */
|
|
<span class="lineNum"> 96 </span><span class="lineCov"> 110684486 : while (blocks < end) {</span>
|
|
<span class="lineNum"> 97 </span><span class="lineCov"> 106530782 : uint32_t k1 = blocks[0];</span>
|
|
<span class="lineNum"> 98 </span><span class="lineCov"> 106530782 : uint32_t k2 = blocks[1];</span>
|
|
<span class="lineNum"> 99 </span><span class="lineCov"> 106530782 : uint32_t k3 = blocks[2];</span>
|
|
<span class="lineNum"> 100 </span><span class="lineCov"> 106530782 : uint32_t k4 = blocks[3];</span>
|
|
<span class="lineNum"> 101 </span> :
|
|
<span class="lineNum"> 102 </span> : #if WORDS_BIGENDIAN
|
|
<span class="lineNum"> 103 </span> : k1 = util_swap32(k1);
|
|
<span class="lineNum"> 104 </span> : k2 = util_swap32(k2);
|
|
<span class="lineNum"> 105 </span> : k3 = util_swap32(k3);
|
|
<span class="lineNum"> 106 </span> : k4 = util_swap32(k4);
|
|
<span class="lineNum"> 107 </span> : #endif
|
|
<span class="lineNum"> 108 </span> :
|
|
<span class="lineNum"> 109 </span><span class="lineCov"> 106530782 : k1 *= c1; k1 = util_rotl32(k1, 15); k1 *= c2; h1 ^= k1;</span>
|
|
<span class="lineNum"> 110 </span> :
|
|
<span class="lineNum"> 111 </span><span class="lineCov"> 106530782 : h1 = util_rotl32(h1, 19); h1 += h2; h1 = h1 * 5 + 0x561ccd1b;</span>
|
|
<span class="lineNum"> 112 </span> :
|
|
<span class="lineNum"> 113 </span><span class="lineCov"> 106530782 : k2 *= c2; k2 = util_rotl32(k2, 16); k2 *= c3; h2 ^= k2;</span>
|
|
<span class="lineNum"> 114 </span> :
|
|
<span class="lineNum"> 115 </span><span class="lineCov"> 106530782 : h2 = util_rotl32(h2, 17); h2 += h3; h2 = h2 * 5 + 0x0bcaa747;</span>
|
|
<span class="lineNum"> 116 </span> :
|
|
<span class="lineNum"> 117 </span><span class="lineCov"> 106530782 : k3 *= c3; k3 = util_rotl32(k3, 17); k3 *= c4; h3 ^= k3;</span>
|
|
<span class="lineNum"> 118 </span> :
|
|
<span class="lineNum"> 119 </span><span class="lineCov"> 106530782 : h3 = util_rotl32(h3, 15); h3 += h4; h3 = h3 * 5 + 0x96cd1c35;</span>
|
|
<span class="lineNum"> 120 </span> :
|
|
<span class="lineNum"> 121 </span><span class="lineCov"> 106530782 : k4 *= c4; k4 = util_rotl32(k4, 18); k4 *= c1; h4 ^= k4;</span>
|
|
<span class="lineNum"> 122 </span> :
|
|
<span class="lineNum"> 123 </span><span class="lineCov"> 106530782 : h4 = util_rotl32(h4, 13); h4 += h1; h4 = h4 * 5 + 0x32ac3b17;</span>
|
|
<span class="lineNum"> 124 </span> :
|
|
<span class="lineNum"> 125 </span><span class="lineCov"> 106530782 : blocks += 4;</span>
|
|
<span class="lineNum"> 126 </span> : }
|
|
<span class="lineNum"> 127 </span> :
|
|
<span class="lineNum"> 128 </span> : /* tail */
|
|
<span class="lineNum"> 129 </span><span class="lineCov"> 2076852 : size_remainder = size & 15;</span>
|
|
<span class="lineNum"> 130 </span><span class="lineCov"> 2076852 : if (size_remainder != 0) {</span>
|
|
<span class="lineNum"> 131 </span><span class="lineCov"> 779223 : const uint8_t* tail = (const uint8_t*)blocks;</span>
|
|
<span class="lineNum"> 132 </span> :
|
|
<span class="lineNum"> 133 </span><span class="lineCov"> 779223 : uint32_t k1 = 0;</span>
|
|
<span class="lineNum"> 134 </span><span class="lineCov"> 779223 : uint32_t k2 = 0;</span>
|
|
<span class="lineNum"> 135 </span><span class="lineCov"> 779223 : uint32_t k3 = 0;</span>
|
|
<span class="lineNum"> 136 </span><span class="lineCov"> 779223 : uint32_t k4 = 0;</span>
|
|
<span class="lineNum"> 137 </span> :
|
|
<span class="lineNum"> 138 </span><span class="lineCov"> 779223 : switch (size_remainder) {</span>
|
|
<span class="lineNum"> 139 </span><span class="lineCov"> 51253 : case 15 : k4 ^= (uint32_t)tail[14] << 16;</span>
|
|
<span class="lineNum"> 140 </span><span class="lineCov"> 103976 : case 14 : k4 ^= (uint32_t)tail[13] << 8;</span>
|
|
<span class="lineNum"> 141 </span><span class="lineCov"> 156183 : case 13 : k4 ^= (uint32_t)tail[12] << 0;</span>
|
|
<span class="lineNum"> 142 </span><span class="lineCov"> 156183 : k4 *= c4; k4 = util_rotl32(k4, 18); k4 *= c1; h4 ^= k4;</span>
|
|
<span class="lineNum"> 143 </span><span class="lineCov"> 208955 : case 12 : k3 ^= (uint32_t)tail[11] << 24;</span>
|
|
<span class="lineNum"> 144 </span><span class="lineCov"> 261477 : case 11 : k3 ^= (uint32_t)tail[10] << 16;</span>
|
|
<span class="lineNum"> 145 </span><span class="lineCov"> 313646 : case 10 : k3 ^= (uint32_t)tail[ 9] << 8;</span>
|
|
<span class="lineNum"> 146 </span><span class="lineCov"> 366950 : case 9 : k3 ^= (uint32_t)tail[ 8] << 0;</span>
|
|
<span class="lineNum"> 147 </span><span class="lineCov"> 366950 : k3 *= c3; k3 = util_rotl32(k3, 17); k3 *= c4; h3 ^= k3;</span>
|
|
<span class="lineNum"> 148 </span><span class="lineCov"> 420888 : case 8 : k2 ^= (uint32_t)tail[ 7] << 24;</span>
|
|
<span class="lineNum"> 149 </span><span class="lineCov"> 470405 : case 7 : k2 ^= (uint32_t)tail[ 6] << 16;</span>
|
|
<span class="lineNum"> 150 </span><span class="lineCov"> 523044 : case 6 : k2 ^= (uint32_t)tail[ 5] << 8;</span>
|
|
<span class="lineNum"> 151 </span><span class="lineCov"> 573538 : case 5 : k2 ^= (uint32_t)tail[ 4] << 0;</span>
|
|
<span class="lineNum"> 152 </span><span class="lineCov"> 573538 : k2 *= c2; k2 = util_rotl32(k2, 16); k2 *= c3; h2 ^= k2;</span>
|
|
<span class="lineNum"> 153 </span><span class="lineCov"> 625492 : case 4 : k1 ^= (uint32_t)tail[ 3] << 24;</span>
|
|
<span class="lineNum"> 154 </span><span class="lineCov"> 675841 : case 3 : k1 ^= (uint32_t)tail[ 2] << 16;</span>
|
|
<span class="lineNum"> 155 </span><span class="lineCov"> 726916 : case 2 : k1 ^= (uint32_t)tail[ 1] << 8;</span>
|
|
<span class="lineNum"> 156 </span><span class="lineCov"> 779223 : case 1 : k1 ^= (uint32_t)tail[ 0] << 0;</span>
|
|
<span class="lineNum"> 157 </span><span class="lineCov"> 779223 : k1 *= c1; k1 = util_rotl32(k1, 15); k1 *= c2; h1 ^= k1;</span>
|
|
<span class="lineNum"> 158 </span> : }
|
|
<span class="lineNum"> 159 </span> : }
|
|
<span class="lineNum"> 160 </span> :
|
|
<span class="lineNum"> 161 </span> : /* finalization */
|
|
<span class="lineNum"> 162 </span><span class="lineCov"> 2076852 : h1 ^= size; h2 ^= size; h3 ^= size; h4 ^= size;</span>
|
|
<span class="lineNum"> 163 </span> :
|
|
<span class="lineNum"> 164 </span><span class="lineCov"> 2076852 : h1 += h2; h1 += h3; h1 += h4;</span>
|
|
<span class="lineNum"> 165 </span><span class="lineCov"> 2076852 : h2 += h1; h3 += h1; h4 += h1;</span>
|
|
<span class="lineNum"> 166 </span> :
|
|
<span class="lineNum"> 167 </span><span class="lineCov"> 2076852 : h1 = fmix32(h1);</span>
|
|
<span class="lineNum"> 168 </span><span class="lineCov"> 2076852 : h2 = fmix32(h2);</span>
|
|
<span class="lineNum"> 169 </span><span class="lineCov"> 2076852 : h3 = fmix32(h3);</span>
|
|
<span class="lineNum"> 170 </span><span class="lineCov"> 2076852 : h4 = fmix32(h4);</span>
|
|
<span class="lineNum"> 171 </span> :
|
|
<span class="lineNum"> 172 </span><span class="lineCov"> 2076852 : h1 += h2; h1 += h3; h1 += h4;</span>
|
|
<span class="lineNum"> 173 </span><span class="lineCov"> 2076852 : h2 += h1; h3 += h1; h4 += h1;</span>
|
|
<span class="lineNum"> 174 </span> :
|
|
<span class="lineNum"> 175 </span><span class="lineCov"> 2076852 : util_write32(digest + 0, h1);</span>
|
|
<span class="lineNum"> 176 </span><span class="lineCov"> 2076852 : util_write32(digest + 4, h2);</span>
|
|
<span class="lineNum"> 177 </span><span class="lineCov"> 2076852 : util_write32(digest + 8, h3);</span>
|
|
<span class="lineNum"> 178 </span><span class="lineCov"> 2076852 : util_write32(digest + 12, h4);</span>
|
|
<span class="lineNum"> 179 </span><span class="lineCov"> 2076852 : }</span>
|
|
<span class="lineNum"> 180 </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>
|