mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
204 lines
18 KiB
HTML
204 lines
18 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/metro.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> - metro.c<span style="font-size: 80%;"> (source / <a href="metro.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">45</td>
|
|
<td class="headerCovTableEntry">45</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) 2019 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 <http://www.gnu.org/licenses/>.</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 MetroHash128::Hash</a>
|
|
<a name="20"><span class="lineNum"> 20 </span> : *</a>
|
|
<a name="21"><span class="lineNum"> 21 </span> : * This version extends the original MetroHash128::Hash to accept a full 128-bit seed.</a>
|
|
<a name="22"><span class="lineNum"> 22 </span> : *</a>
|
|
<a name="23"><span class="lineNum"> 23 </span> : * Note: The original algorithm's behavior can be perfectly replicated by</a>
|
|
<a name="24"><span class="lineNum"> 24 </span> : * setting the low and high part of the seed to the same 64-bit value.</a>
|
|
<a name="25"><span class="lineNum"> 25 </span> : *</a>
|
|
<a name="26"><span class="lineNum"> 26 </span> : * https://github.com/jandrewrogers/MetroHash/blob/master/src/metrohash128.cpp</a>
|
|
<a name="27"><span class="lineNum"> 27 </span> : *</a>
|
|
<a name="28"><span class="lineNum"> 28 </span> : * Copyright 2015-2018 J. Andrew Rogers</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : *</a>
|
|
<a name="30"><span class="lineNum"> 30 </span> : * Licensed under the Apache License, Version 2.0 (the "License");</a>
|
|
<a name="31"><span class="lineNum"> 31 </span> : * you may not use this file except in compliance with the License.</a>
|
|
<a name="32"><span class="lineNum"> 32 </span> : * You may obtain a copy of the License at</a>
|
|
<a name="33"><span class="lineNum"> 33 </span> : *</a>
|
|
<a name="34"><span class="lineNum"> 34 </span> : * http://www.apache.org/licenses/LICENSE-2.0</a>
|
|
<a name="35"><span class="lineNum"> 35 </span> : *</a>
|
|
<a name="36"><span class="lineNum"> 36 </span> : * Unless required by applicable law or agreed to in writing, software</a>
|
|
<a name="37"><span class="lineNum"> 37 </span> : * distributed under the License is distributed on an "AS IS" BASIS,</a>
|
|
<a name="38"><span class="lineNum"> 38 </span> : * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</a>
|
|
<a name="39"><span class="lineNum"> 39 </span> : * See the License for the specific language governing permissions and</a>
|
|
<a name="40"><span class="lineNum"> 40 </span> : * limitations under the License.</a>
|
|
<a name="41"><span class="lineNum"> 41 </span> : */</a>
|
|
<a name="42"><span class="lineNum"> 42 </span> : </a>
|
|
<a name="43"><span class="lineNum"> 43 </span> : static const uint64_t k0 = 0xC83A91E1;</a>
|
|
<a name="44"><span class="lineNum"> 44 </span> : static const uint64_t k1 = 0x8648DBDB;</a>
|
|
<a name="45"><span class="lineNum"> 45 </span> : static const uint64_t k2 = 0x7BDEC03B;</a>
|
|
<a name="46"><span class="lineNum"> 46 </span> : static const uint64_t k3 = 0x2F5870A5;</a>
|
|
<a name="47"><span class="lineNum"> 47 </span> : </a>
|
|
<a name="48"><span class="lineNum"> 48 </span><span class="lineCov"> 369 : void MetroHash128(const void* data, size_t size, const uint8_t* seed, uint8_t* digest)</span></a>
|
|
<a name="49"><span class="lineNum"> 49 </span> : {</a>
|
|
<a name="50"><span class="lineNum"> 50 </span><span class="lineCov"> 369 : const uint8_t* ptr = data;</span></a>
|
|
<a name="51"><span class="lineNum"> 51 </span> : uint64_t v[4];</a>
|
|
<a name="52"><span class="lineNum"> 52 </span> : </a>
|
|
<a name="53"><span class="lineNum"> 53 </span> : /*</a>
|
|
<a name="54"><span class="lineNum"> 54 </span> : * EXTENSION: Initialize primary state with 128-bit seed (seedL and seedH)</a>
|
|
<a name="55"><span class="lineNum"> 55 </span> : * Ensures both halves influence the hash even for short messages (< 32 bytes)</a>
|
|
<a name="56"><span class="lineNum"> 56 </span> : *</a>
|
|
<a name="57"><span class="lineNum"> 57 </span> : * Original code was:</a>
|
|
<a name="58"><span class="lineNum"> 58 </span> : * v[0] = (static_cast<uint64_t>(seed) - k0) * k3;</a>
|
|
<a name="59"><span class="lineNum"> 59 </span> : * v[1] = (static_cast<uint64_t>(seed) + k1) * k2;</a>
|
|
<a name="60"><span class="lineNum"> 60 </span> : */</a>
|
|
<a name="61"><span class="lineNum"> 61 </span><span class="lineCov"> 369 : v[0] = (util_read64(seed) - k0) * k3;</span></a>
|
|
<a name="62"><span class="lineNum"> 62 </span><span class="lineCov"> 369 : v[1] = (util_read64(seed + 8) + k1) * k2;</span></a>
|
|
<a name="63"><span class="lineNum"> 63 </span> : </a>
|
|
<a name="64"><span class="lineNum"> 64 </span><span class="lineCov"> 369 : if (size >= 32) {</span></a>
|
|
<a name="65"><span class="lineNum"> 65 </span> : /*</a>
|
|
<a name="66"><span class="lineNum"> 66 </span> : * EXTENSION: Initialize secondary state using both halves of the 128-bit seed</a>
|
|
<a name="67"><span class="lineNum"> 67 </span> : *</a>
|
|
<a name="68"><span class="lineNum"> 68 </span> : * Original code was:</a>
|
|
<a name="69"><span class="lineNum"> 69 </span> : * v[2] = (static_cast<uint64_t>(seed) + k0) * k2;</a>
|
|
<a name="70"><span class="lineNum"> 70 </span> : * v[3] = (static_cast<uint64_t>(seed) - k1) * k3;</a>
|
|
<a name="71"><span class="lineNum"> 71 </span> : */</a>
|
|
<a name="72"><span class="lineNum"> 72 </span><span class="lineCov"> 333 : v[2] = (util_read64(seed) + k0) * k2;</span></a>
|
|
<a name="73"><span class="lineNum"> 73 </span><span class="lineCov"> 333 : v[3] = (util_read64(seed + 8) - k1) * k3;</span></a>
|
|
<a name="74"><span class="lineNum"> 74 </span> : </a>
|
|
<a name="75"><span class="lineNum"> 75 </span> : do {</a>
|
|
<a name="76"><span class="lineNum"> 76 </span><span class="lineCov"> 852876 : v[0] += util_read64(ptr) * k0; ptr += 8; v[0] = util_rotr64(v[0], 29) + v[2];</span></a>
|
|
<a name="77"><span class="lineNum"> 77 </span><span class="lineCov"> 852876 : v[1] += util_read64(ptr) * k1; ptr += 8; v[1] = util_rotr64(v[1], 29) + v[3];</span></a>
|
|
<a name="78"><span class="lineNum"> 78 </span><span class="lineCov"> 852876 : v[2] += util_read64(ptr) * k2; ptr += 8; v[2] = util_rotr64(v[2], 29) + v[0];</span></a>
|
|
<a name="79"><span class="lineNum"> 79 </span><span class="lineCov"> 852876 : v[3] += util_read64(ptr) * k3; ptr += 8; v[3] = util_rotr64(v[3], 29) + v[1];</span></a>
|
|
<a name="80"><span class="lineNum"> 80 </span><span class="lineCov"> 852876 : size -= 32;</span></a>
|
|
<a name="81"><span class="lineNum"> 81 </span><span class="lineCov"> 852876 : } while (size >= 32);</span></a>
|
|
<a name="82"><span class="lineNum"> 82 </span> : </a>
|
|
<a name="83"><span class="lineNum"> 83 </span><span class="lineCov"> 333 : v[2] ^= util_rotr64(((v[0] + v[3]) * k0) + v[1], 21) * k1;</span></a>
|
|
<a name="84"><span class="lineNum"> 84 </span><span class="lineCov"> 333 : v[3] ^= util_rotr64(((v[1] + v[2]) * k1) + v[0], 21) * k0;</span></a>
|
|
<a name="85"><span class="lineNum"> 85 </span><span class="lineCov"> 333 : v[0] ^= util_rotr64(((v[0] + v[2]) * k0) + v[3], 21) * k1;</span></a>
|
|
<a name="86"><span class="lineNum"> 86 </span><span class="lineCov"> 333 : v[1] ^= util_rotr64(((v[1] + v[3]) * k1) + v[2], 21) * k0;</span></a>
|
|
<a name="87"><span class="lineNum"> 87 </span> : }</a>
|
|
<a name="88"><span class="lineNum"> 88 </span> : </a>
|
|
<a name="89"><span class="lineNum"> 89 </span><span class="lineCov"> 369 : if (size >= 16) {</span></a>
|
|
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 132 : v[0] += util_read64(ptr) * k2; ptr += 8; v[0] = util_rotr64(v[0], 33) * k3;</span></a>
|
|
<a name="91"><span class="lineNum"> 91 </span><span class="lineCov"> 132 : v[1] += util_read64(ptr) * k2; ptr += 8; v[1] = util_rotr64(v[1], 33) * k3;</span></a>
|
|
<a name="92"><span class="lineNum"> 92 </span><span class="lineCov"> 132 : v[0] ^= util_rotr64((v[0] * k2) + v[1], 45) * k1;</span></a>
|
|
<a name="93"><span class="lineNum"> 93 </span><span class="lineCov"> 132 : v[1] ^= util_rotr64((v[1] * k3) + v[0], 45) * k0;</span></a>
|
|
<a name="94"><span class="lineNum"> 94 </span><span class="lineCov"> 132 : size -= 16;</span></a>
|
|
<a name="95"><span class="lineNum"> 95 </span> : }</a>
|
|
<a name="96"><span class="lineNum"> 96 </span> : </a>
|
|
<a name="97"><span class="lineNum"> 97 </span><span class="lineCov"> 369 : if (size >= 8) {</span></a>
|
|
<a name="98"><span class="lineNum"> 98 </span><span class="lineCov"> 134 : v[0] += util_read64(ptr) * k2; ptr += 8; v[0] = util_rotr64(v[0], 33) * k3;</span></a>
|
|
<a name="99"><span class="lineNum"> 99 </span><span class="lineCov"> 134 : v[0] ^= util_rotr64((v[0] * k2) + v[1], 27) * k1;</span></a>
|
|
<a name="100"><span class="lineNum"> 100 </span><span class="lineCov"> 134 : size -= 8;</span></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><span class="lineCov"> 369 : if (size >= 4) {</span></a>
|
|
<a name="104"><span class="lineNum"> 104 </span><span class="lineCov"> 132 : v[1] += util_read32(ptr) * k2; ptr += 4; v[1] = util_rotr64(v[1], 33) * k3;</span></a>
|
|
<a name="105"><span class="lineNum"> 105 </span><span class="lineCov"> 132 : v[1] ^= util_rotr64((v[1] * k3) + v[0], 46) * k0;</span></a>
|
|
<a name="106"><span class="lineNum"> 106 </span><span class="lineCov"> 132 : size -= 4;</span></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"> 369 : if (size >= 2) {</span></a>
|
|
<a name="110"><span class="lineNum"> 110 </span><span class="lineCov"> 135 : v[0] += util_read16(ptr) * k2; ptr += 2; v[0] = util_rotr64(v[0], 33) * k3;</span></a>
|
|
<a name="111"><span class="lineNum"> 111 </span><span class="lineCov"> 135 : v[0] ^= util_rotr64((v[0] * k2) + v[1], 22) * k1;</span></a>
|
|
<a name="112"><span class="lineNum"> 112 </span><span class="lineCov"> 135 : size -= 2;</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"> 369 : if (size >= 1) {</span></a>
|
|
<a name="116"><span class="lineNum"> 116 </span><span class="lineCov"> 133 : v[1] += util_read8(ptr) * k2; v[1] = util_rotr64(v[1], 33) * k3;</span></a>
|
|
<a name="117"><span class="lineNum"> 117 </span><span class="lineCov"> 133 : v[1] ^= util_rotr64((v[1] * k3) + v[0], 58) * k0;</span></a>
|
|
<a name="118"><span class="lineNum"> 118 </span> : }</a>
|
|
<a name="119"><span class="lineNum"> 119 </span> : </a>
|
|
<a name="120"><span class="lineNum"> 120 </span><span class="lineCov"> 369 : v[0] += util_rotr64((v[0] * k0) + v[1], 13);</span></a>
|
|
<a name="121"><span class="lineNum"> 121 </span><span class="lineCov"> 369 : v[1] += util_rotr64((v[1] * k1) + v[0], 37);</span></a>
|
|
<a name="122"><span class="lineNum"> 122 </span><span class="lineCov"> 369 : v[0] += util_rotr64((v[0] * k2) + v[1], 13);</span></a>
|
|
<a name="123"><span class="lineNum"> 123 </span><span class="lineCov"> 369 : v[1] += util_rotr64((v[1] * k3) + v[0], 37);</span></a>
|
|
<a name="124"><span class="lineNum"> 124 </span> : </a>
|
|
<a name="125"><span class="lineNum"> 125 </span><span class="lineCov"> 369 : util_write64(digest, v[0]);</span></a>
|
|
<a name="126"><span class="lineNum"> 126 </span><span class="lineCov"> 369 : util_write64(digest + 8, v[1]);</span></a>
|
|
<a name="127"><span class="lineNum"> 127 </span><span class="lineCov"> 369 : }</span></a>
|
|
<a name="128"><span class="lineNum"> 128 </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>
|