mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
Auto update
This commit is contained in:
parent
40e0867371
commit
e2cb069c72
6 changed files with 953 additions and 0 deletions
100
cov/cmdline/locate.c.func-sort-c.html
Normal file
100
cov/cmdline/locate.c.func-sort-c.html
Normal file
|
|
@ -0,0 +1,100 @@
|
|||
<!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/locate.c - functions</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> - locate.c<span style="font-size: 80%;"> (<a href="locate.c.gcov.html">source</a> / functions)</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">119</td>
|
||||
<td class="headerCovTableEntry">126</td>
|
||||
<td class="headerCovTableEntryHi">94.4 %</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="headerItem">Date:</td>
|
||||
<td class="headerValue">2026-02-28 16:42:47</td>
|
||||
<td></td>
|
||||
<td class="headerItem">Functions:</td>
|
||||
<td class="headerCovTableEntry">7</td>
|
||||
<td class="headerCovTableEntry">7</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>
|
||||
|
||||
<center>
|
||||
<table width="60%" cellpadding=1 cellspacing=1 border=0>
|
||||
<tr><td><br></td></tr>
|
||||
<tr>
|
||||
<td width="80%" class="tableHead">Function Name <span class="tableHeadSort"><a href="locate.c.func.html"><img src="../updown.png" width=10 height=14 alt="Sort by function name" title="Sort by function name" border=0></a></span></td>
|
||||
<td width="20%" class="tableHead">Hit count <span class="tableHeadSort"><img src="../glass.png" width=10 height=14 alt="Sort by hit count" title="Sort by hit count" border=0></span></td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#197">state_locate_mark_tail_blocks_for_resync</a></td>
|
||||
<td class="coverFnHi">2</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#135">state_locate</a></td>
|
||||
<td class="coverFnHi">5</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#120">state_locate_info</a></td>
|
||||
<td class="coverFnHi">5</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#69">add_size_to_sum</a></td>
|
||||
<td class="coverFnHi">11267</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#59">dump_entry</a></td>
|
||||
<td class="coverFnHi">11267</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#41">parity_entry_compare</a></td>
|
||||
<td class="coverFnHi">61484</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#77">collect_parity_block_file</a></td>
|
||||
<td class="coverFnHi">78921</td>
|
||||
</tr>
|
||||
</table>
|
||||
<br>
|
||||
</center>
|
||||
<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>
|
||||
100
cov/cmdline/locate.c.func.html
Normal file
100
cov/cmdline/locate.c.func.html
Normal file
|
|
@ -0,0 +1,100 @@
|
|||
<!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/locate.c - functions</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> - locate.c<span style="font-size: 80%;"> (<a href="locate.c.gcov.html">source</a> / functions)</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">119</td>
|
||||
<td class="headerCovTableEntry">126</td>
|
||||
<td class="headerCovTableEntryHi">94.4 %</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="headerItem">Date:</td>
|
||||
<td class="headerValue">2026-02-28 16:42:47</td>
|
||||
<td></td>
|
||||
<td class="headerItem">Functions:</td>
|
||||
<td class="headerCovTableEntry">7</td>
|
||||
<td class="headerCovTableEntry">7</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>
|
||||
|
||||
<center>
|
||||
<table width="60%" cellpadding=1 cellspacing=1 border=0>
|
||||
<tr><td><br></td></tr>
|
||||
<tr>
|
||||
<td width="80%" class="tableHead">Function Name <span class="tableHeadSort"><img src="../glass.png" width=10 height=14 alt="Sort by function name" title="Sort by function name" border=0></span></td>
|
||||
<td width="20%" class="tableHead">Hit count <span class="tableHeadSort"><a href="locate.c.func-sort-c.html"><img src="../updown.png" width=10 height=14 alt="Sort by hit count" title="Sort by hit count" border=0></a></span></td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#69">add_size_to_sum</a></td>
|
||||
<td class="coverFnHi">11267</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#77">collect_parity_block_file</a></td>
|
||||
<td class="coverFnHi">78921</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#59">dump_entry</a></td>
|
||||
<td class="coverFnHi">11267</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#41">parity_entry_compare</a></td>
|
||||
<td class="coverFnHi">61484</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#135">state_locate</a></td>
|
||||
<td class="coverFnHi">5</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#120">state_locate_info</a></td>
|
||||
<td class="coverFnHi">5</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="locate.c.gcov.html#197">state_locate_mark_tail_blocks_for_resync</a></td>
|
||||
<td class="coverFnHi">2</td>
|
||||
</tr>
|
||||
</table>
|
||||
<br>
|
||||
</center>
|
||||
<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>
|
||||
344
cov/cmdline/locate.c.gcov.html
Normal file
344
cov/cmdline/locate.c.gcov.html
Normal file
|
|
@ -0,0 +1,344 @@
|
|||
<!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/locate.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> - locate.c<span style="font-size: 80%;"> (source / <a href="locate.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">119</td>
|
||||
<td class="headerCovTableEntry">126</td>
|
||||
<td class="headerCovTableEntryHi">94.4 %</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="headerItem">Date:</td>
|
||||
<td class="headerValue">2026-02-28 16:42:47</td>
|
||||
<td></td>
|
||||
<td class="headerItem">Functions:</td>
|
||||
<td class="headerCovTableEntry">7</td>
|
||||
<td class="headerCovTableEntry">7</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) 2026 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> : #include "portable.h"</a>
|
||||
<a name="19"><span class="lineNum"> 19 </span> : </a>
|
||||
<a name="20"><span class="lineNum"> 20 </span> : #include "elem.h"</a>
|
||||
<a name="21"><span class="lineNum"> 21 </span> : #include "parity.h"</a>
|
||||
<a name="22"><span class="lineNum"> 22 </span> : #include "state.h"</a>
|
||||
<a name="23"><span class="lineNum"> 23 </span> : #include "stream.h"</a>
|
||||
<a name="24"><span class="lineNum"> 24 </span> : #include "locate.h"</a>
|
||||
<a name="25"><span class="lineNum"> 25 </span> : </a>
|
||||
<a name="26"><span class="lineNum"> 26 </span> : struct snapraid_parity_entry {</a>
|
||||
<a name="27"><span class="lineNum"> 27 </span> : uint32_t block_size;</a>
|
||||
<a name="28"><span class="lineNum"> 28 </span> : block_off_t low; /**< Lower position in the parity */</a>
|
||||
<a name="29"><span class="lineNum"> 29 </span> : block_off_t high; /**< Higher position in the parity */</a>
|
||||
<a name="30"><span class="lineNum"> 30 </span> : block_off_t fragments; /**< Number of fragments in the parity */</a>
|
||||
<a name="31"><span class="lineNum"> 31 </span> : struct snapraid_file* file;</a>
|
||||
<a name="32"><span class="lineNum"> 32 </span> : struct snapraid_disk* disk;</a>
|
||||
<a name="33"><span class="lineNum"> 33 </span> : tommy_node node;</a>
|
||||
<a name="34"><span class="lineNum"> 34 </span> : };</a>
|
||||
<a name="35"><span class="lineNum"> 35 </span> : </a>
|
||||
<a name="36"><span class="lineNum"> 36 </span> : struct snapraid_locate_info {</a>
|
||||
<a name="37"><span class="lineNum"> 37 </span> : block_off_t block_max; /**< Number of blocks in the parity */</a>
|
||||
<a name="38"><span class="lineNum"> 38 </span> : data_off_t parity_size; /**< Size in bytes of the parity */</a>
|
||||
<a name="39"><span class="lineNum"> 39 </span> : block_off_t tail_block; /**< Number of blocks of the tail of the parity */</a>
|
||||
<a name="40"><span class="lineNum"> 40 </span> : block_off_t low_to_free_tail_block; /**< First block that has to be freed */</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><span class="lineCov"> 61484 : static int parity_entry_compare(const void* void_a, const void* void_b)</span></a>
|
||||
<a name="44"><span class="lineNum"> 44 </span> : {</a>
|
||||
<a name="45"><span class="lineNum"> 45 </span><span class="lineCov"> 61484 : const struct snapraid_parity_entry* entry_a = void_a;</span></a>
|
||||
<a name="46"><span class="lineNum"> 46 </span><span class="lineCov"> 61484 : const struct snapraid_parity_entry* entry_b = void_b;</span></a>
|
||||
<a name="47"><span class="lineNum"> 47 </span> : </a>
|
||||
<a name="48"><span class="lineNum"> 48 </span><span class="lineCov"> 61484 : if (entry_a->high < entry_b->high)</span></a>
|
||||
<a name="49"><span class="lineNum"> 49 </span><span class="lineCov"> 36483 : return -1;</span></a>
|
||||
<a name="50"><span class="lineNum"> 50 </span><span class="lineCov"> 25001 : if (entry_a->high > entry_b->high)</span></a>
|
||||
<a name="51"><span class="lineNum"> 51 </span><span class="lineCov"> 15466 : return 1;</span></a>
|
||||
<a name="52"><span class="lineNum"> 52 </span> : </a>
|
||||
<a name="53"><span class="lineNum"> 53 </span><span class="lineCov"> 9535 : if (entry_a->low < entry_b->low)</span></a>
|
||||
<a name="54"><span class="lineNum"> 54 </span><span class="lineCov"> 3691 : return -1;</span></a>
|
||||
<a name="55"><span class="lineNum"> 55 </span><span class="lineCov"> 5844 : if (entry_a->low > entry_b->low)</span></a>
|
||||
<a name="56"><span class="lineNum"> 56 </span><span class="lineCov"> 3170 : return 1;</span></a>
|
||||
<a name="57"><span class="lineNum"> 57 </span> : </a>
|
||||
<a name="58"><span class="lineNum"> 58 </span><span class="lineCov"> 2674 : return strcmp(entry_a->file->sub, entry_b->file->sub);</span></a>
|
||||
<a name="59"><span class="lineNum"> 59 </span> : }</a>
|
||||
<a name="60"><span class="lineNum"> 60 </span> : </a>
|
||||
<a name="61"><span class="lineNum"> 61 </span><span class="lineCov"> 11267 : static void dump_entry(void* void_entry)</span></a>
|
||||
<a name="62"><span class="lineNum"> 62 </span> : {</a>
|
||||
<a name="63"><span class="lineNum"> 63 </span> : char esc_buffer[ESC_MAX];</a>
|
||||
<a name="64"><span class="lineNum"> 64 </span><span class="lineCov"> 11267 : struct snapraid_parity_entry* entry = void_entry;</span></a>
|
||||
<a name="65"><span class="lineNum"> 65 </span><span class="lineCov"> 11267 : printf("%12" PRIu64 " ", entry->low * (uint64_t)entry->block_size);</span></a>
|
||||
<a name="66"><span class="lineNum"> 66 </span><span class="lineCov"> 11267 : printf("%12" PRIu64 " ", (entry->high - entry->low + 1) * (uint64_t)entry->block_size);</span></a>
|
||||
<a name="67"><span class="lineNum"> 67 </span><span class="lineCov"> 11267 : printf("%8u ", entry->fragments);</span></a>
|
||||
<a name="68"><span class="lineNum"> 68 </span><span class="lineCov"> 11267 : printf("%s\n", fmt_term(entry->disk, entry->file->sub, esc_buffer));</span></a>
|
||||
<a name="69"><span class="lineNum"> 69 </span><span class="lineCov"> 11267 : }</span></a>
|
||||
<a name="70"><span class="lineNum"> 70 </span> : </a>
|
||||
<a name="71"><span class="lineNum"> 71 </span><span class="lineCov"> 11267 : static void add_size_to_sum(void* arg, void* void_entry)</span></a>
|
||||
<a name="72"><span class="lineNum"> 72 </span> : {</a>
|
||||
<a name="73"><span class="lineNum"> 73 </span><span class="lineCov"> 11267 : struct snapraid_parity_entry* entry = void_entry;</span></a>
|
||||
<a name="74"><span class="lineNum"> 74 </span><span class="lineCov"> 11267 : data_off_t* size_sum = arg;</span></a>
|
||||
<a name="75"><span class="lineNum"> 75 </span> : </a>
|
||||
<a name="76"><span class="lineNum"> 76 </span><span class="lineCov"> 11267 : *size_sum += entry->file->size;</span></a>
|
||||
<a name="77"><span class="lineNum"> 77 </span><span class="lineCov"> 11267 : }</span></a>
|
||||
<a name="78"><span class="lineNum"> 78 </span> : </a>
|
||||
<a name="79"><span class="lineNum"> 79 </span><span class="lineCov"> 78921 : static void collect_parity_block_file(uint32_t block_size, struct snapraid_disk* disk, struct snapraid_file* file, tommy_list* file_list, block_off_t low_to_free_tail_block)</span></a>
|
||||
<a name="80"><span class="lineNum"> 80 </span> : {</a>
|
||||
<a name="81"><span class="lineNum"> 81 </span><span class="lineCov"> 78921 : block_off_t parity_low = 0; /* lower block */</span></a>
|
||||
<a name="82"><span class="lineNum"> 82 </span><span class="lineCov"> 78921 : block_off_t parity_high = 0; /* higher block */</span></a>
|
||||
<a name="83"><span class="lineNum"> 83 </span><span class="lineCov"> 78921 : block_off_t parity_fragments = 0; /* number of fragments */</span></a>
|
||||
<a name="84"><span class="lineNum"> 84 </span> : </a>
|
||||
<a name="85"><span class="lineNum"> 85 </span><span class="lineCov"> 276775 : for (block_off_t i = 0; i < file->blockmax; ++i) {</span></a>
|
||||
<a name="86"><span class="lineNum"> 86 </span><span class="lineCov"> 197854 : block_off_t parity_pos = fs_file2par_find(disk, file, i);</span></a>
|
||||
<a name="87"><span class="lineNum"> 87 </span> : </a>
|
||||
<a name="88"><span class="lineNum"> 88 </span> : /* check if a valid position is found */</a>
|
||||
<a name="89"><span class="lineNum"> 89 </span><span class="lineCov"> 197854 : if (parity_pos == POS_NULL) {</span></a>
|
||||
<a name="90"><span class="lineNum"> 90 </span> : /* block not yet allocated */</a>
|
||||
<a name="91"><span class="lineNum"> 91 </span><span class="lineNoCov"> 0 : continue;</span></a>
|
||||
<a name="92"><span class="lineNum"> 92 </span> : }</a>
|
||||
<a name="93"><span class="lineNum"> 93 </span> : </a>
|
||||
<a name="94"><span class="lineNum"> 94 </span><span class="lineCov"> 197854 : if (parity_fragments == 0) {</span></a>
|
||||
<a name="95"><span class="lineNum"> 95 </span><span class="lineCov"> 78802 : parity_low = parity_pos;</span></a>
|
||||
<a name="96"><span class="lineNum"> 96 </span><span class="lineCov"> 78802 : parity_high = parity_pos;</span></a>
|
||||
<a name="97"><span class="lineNum"> 97 </span><span class="lineCov"> 78802 : parity_fragments = 1;</span></a>
|
||||
<a name="98"><span class="lineNum"> 98 </span> : } else {</a>
|
||||
<a name="99"><span class="lineNum"> 99 </span><span class="lineCov"> 119052 : if (parity_pos != parity_high + 1)</span></a>
|
||||
<a name="100"><span class="lineNum"> 100 </span><span class="lineCov"> 241 : ++parity_fragments;</span></a>
|
||||
<a name="101"><span class="lineNum"> 101 </span><span class="lineCov"> 119052 : parity_high = parity_pos;</span></a>
|
||||
<a name="102"><span class="lineNum"> 102 </span> : }</a>
|
||||
<a name="103"><span class="lineNum"> 103 </span> : }</a>
|
||||
<a name="104"><span class="lineNum"> 104 </span> : </a>
|
||||
<a name="105"><span class="lineNum"> 105 </span><span class="lineCov"> 78921 : if (parity_fragments == 0)</span></a>
|
||||
<a name="106"><span class="lineNum"> 106 </span><span class="lineCov"> 119 : return; /* not allocated */</span></a>
|
||||
<a name="107"><span class="lineNum"> 107 </span> : </a>
|
||||
<a name="108"><span class="lineNum"> 108 </span><span class="lineCov"> 78802 : if (low_to_free_tail_block > 0 && parity_high < low_to_free_tail_block)</span></a>
|
||||
<a name="109"><span class="lineNum"> 109 </span><span class="lineCov"> 56277 : return; /* entry not in the range to free */</span></a>
|
||||
<a name="110"><span class="lineNum"> 110 </span> : </a>
|
||||
<a name="111"><span class="lineNum"> 111 </span> : /* found a relevant block so add the corresponding file */</a>
|
||||
<a name="112"><span class="lineNum"> 112 </span><span class="lineCov"> 22525 : struct snapraid_parity_entry* entry = malloc_nofail(sizeof(struct snapraid_parity_entry));</span></a>
|
||||
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 22525 : entry->block_size = block_size;</span></a>
|
||||
<a name="114"><span class="lineNum"> 114 </span><span class="lineCov"> 22525 : entry->file = file;</span></a>
|
||||
<a name="115"><span class="lineNum"> 115 </span><span class="lineCov"> 22525 : entry->disk = disk;</span></a>
|
||||
<a name="116"><span class="lineNum"> 116 </span><span class="lineCov"> 22525 : entry->low = parity_low;</span></a>
|
||||
<a name="117"><span class="lineNum"> 117 </span><span class="lineCov"> 22525 : entry->high = parity_high;</span></a>
|
||||
<a name="118"><span class="lineNum"> 118 </span><span class="lineCov"> 22525 : entry->fragments = parity_fragments;</span></a>
|
||||
<a name="119"><span class="lineNum"> 119 </span><span class="lineCov"> 22525 : tommy_list_insert_tail(file_list, &entry->node, entry);</span></a>
|
||||
<a name="120"><span class="lineNum"> 120 </span> : }</a>
|
||||
<a name="121"><span class="lineNum"> 121 </span> : </a>
|
||||
<a name="122"><span class="lineNum"> 122 </span><span class="lineCov"> 5 : void state_locate_info(struct snapraid_state* state, uint64_t parity_tail, struct snapraid_locate_info* info)</span></a>
|
||||
<a name="123"><span class="lineNum"> 123 </span> : {</a>
|
||||
<a name="124"><span class="lineNum"> 124 </span><span class="lineCov"> 5 : uint32_t block_size = state->block_size;</span></a>
|
||||
<a name="125"><span class="lineNum"> 125 </span> : </a>
|
||||
<a name="126"><span class="lineNum"> 126 </span><span class="lineCov"> 5 : info->block_max = parity_allocated_size(state);</span></a>
|
||||
<a name="127"><span class="lineNum"> 127 </span><span class="lineCov"> 5 : info->parity_size = info->block_max * (uint64_t)block_size;</span></a>
|
||||
<a name="128"><span class="lineNum"> 128 </span> : </a>
|
||||
<a name="129"><span class="lineNum"> 129 </span><span class="lineCov"> 5 : info->tail_block = (parity_tail + block_size - 1) / block_size;</span></a>
|
||||
<a name="130"><span class="lineNum"> 130 </span> : </a>
|
||||
<a name="131"><span class="lineNum"> 131 </span><span class="lineCov"> 5 : if (info->tail_block > info->block_max)</span></a>
|
||||
<a name="132"><span class="lineNum"> 132 </span><span class="lineNoCov"> 0 : info->low_to_free_tail_block = 0;</span></a>
|
||||
<a name="133"><span class="lineNum"> 133 </span> : else</a>
|
||||
<a name="134"><span class="lineNum"> 134 </span><span class="lineCov"> 5 : info->low_to_free_tail_block = info->block_max - info->tail_block;</span></a>
|
||||
<a name="135"><span class="lineNum"> 135 </span><span class="lineCov"> 5 : }</span></a>
|
||||
<a name="136"><span class="lineNum"> 136 </span> : </a>
|
||||
<a name="137"><span class="lineNum"> 137 </span><span class="lineCov"> 5 : void state_locate(struct snapraid_state* state, uint64_t parity_tail)</span></a>
|
||||
<a name="138"><span class="lineNum"> 138 </span> : {</a>
|
||||
<a name="139"><span class="lineNum"> 139 </span> : char buf[64];</a>
|
||||
<a name="140"><span class="lineNum"> 140 </span><span class="lineCov"> 5 : uint32_t block_size = state->block_size;</span></a>
|
||||
<a name="141"><span class="lineNum"> 141 </span> : block_off_t low_to_free_tail_block;</a>
|
||||
<a name="142"><span class="lineNum"> 142 </span> : </a>
|
||||
<a name="143"><span class="lineNum"> 143 </span><span class="lineCov"> 5 : printf("SnapRAID locate report:\n");</span></a>
|
||||
<a name="144"><span class="lineNum"> 144 </span><span class="lineCov"> 5 : printf("\n");</span></a>
|
||||
<a name="145"><span class="lineNum"> 145 </span> : </a>
|
||||
<a name="146"><span class="lineNum"> 146 </span><span class="lineCov"> 5 : if (parity_tail == 0) {</span></a>
|
||||
<a name="147"><span class="lineNum"> 147 </span><span class="lineCov"> 1 : printf("Locate all files\n\n");</span></a>
|
||||
<a name="148"><span class="lineNum"> 148 </span><span class="lineCov"> 1 : low_to_free_tail_block = 0;</span></a>
|
||||
<a name="149"><span class="lineNum"> 149 </span> : } else {</a>
|
||||
<a name="150"><span class="lineNum"> 150 </span><span class="lineCov"> 4 : printf("Locate files within the tail of %sB of the parity\n\n", fmt_size(parity_tail, buf, sizeof(buf)));</span></a>
|
||||
<a name="151"><span class="lineNum"> 151 </span> : </a>
|
||||
<a name="152"><span class="lineNum"> 152 </span> : struct snapraid_locate_info info;</a>
|
||||
<a name="153"><span class="lineNum"> 153 </span><span class="lineCov"> 4 : state_locate_info(state, parity_tail, &info);</span></a>
|
||||
<a name="154"><span class="lineNum"> 154 </span> : </a>
|
||||
<a name="155"><span class="lineNum"> 155 </span><span class="lineCov"> 4 : printf("Current parity size is %sB\n", fmt_size(info.parity_size, buf, sizeof(buf)));</span></a>
|
||||
<a name="156"><span class="lineNum"> 156 </span><span class="lineCov"> 4 : if (info.tail_block > info.block_max) {</span></a>
|
||||
<a name="157"><span class="lineNum"> 157 </span><span class="lineNoCov"> 0 : printf("Specified tail greater than the parity size! Operate on the full parity\n");</span></a>
|
||||
<a name="158"><span class="lineNum"> 158 </span> : }</a>
|
||||
<a name="159"><span class="lineNum"> 159 </span> : </a>
|
||||
<a name="160"><span class="lineNum"> 160 </span><span class="lineCov"> 4 : low_to_free_tail_block = info.low_to_free_tail_block;</span></a>
|
||||
<a name="161"><span class="lineNum"> 161 </span> : }</a>
|
||||
<a name="162"><span class="lineNum"> 162 </span> : </a>
|
||||
<a name="163"><span class="lineNum"> 163 </span><span class="lineCov"> 5 : msg_progress("Collecting files with offset greater or equal to %" PRIu64 "\n", low_to_free_tail_block * (uint64_t)block_size);</span></a>
|
||||
<a name="164"><span class="lineNum"> 164 </span> : </a>
|
||||
<a name="165"><span class="lineNum"> 165 </span> : tommy_list files;</a>
|
||||
<a name="166"><span class="lineNum"> 166 </span><span class="lineCov"> 5 : tommy_list_init(&files);</span></a>
|
||||
<a name="167"><span class="lineNum"> 167 </span><span class="lineCov"> 35 : for (tommy_node* i = tommy_list_head(&state->disklist); i != 0; i = i->next) {</span></a>
|
||||
<a name="168"><span class="lineNum"> 168 </span><span class="lineCov"> 30 : struct snapraid_disk* disk = i->data;</span></a>
|
||||
<a name="169"><span class="lineNum"> 169 </span><span class="lineCov"> 56402 : for (tommy_node* j = tommy_list_head(&disk->filelist); j != 0; j = j->next) {</span></a>
|
||||
<a name="170"><span class="lineNum"> 170 </span><span class="lineCov"> 56372 : struct snapraid_file* file = j->data;</span></a>
|
||||
<a name="171"><span class="lineNum"> 171 </span><span class="lineCov"> 56372 : collect_parity_block_file(block_size, disk, file, &files, low_to_free_tail_block);</span></a>
|
||||
<a name="172"><span class="lineNum"> 172 </span> : }</a>
|
||||
<a name="173"><span class="lineNum"> 173 </span> : }</a>
|
||||
<a name="174"><span class="lineNum"> 174 </span> : </a>
|
||||
<a name="175"><span class="lineNum"> 175 </span><span class="lineCov"> 5 : printf("\n");</span></a>
|
||||
<a name="176"><span class="lineNum"> 176 </span> : </a>
|
||||
<a name="177"><span class="lineNum"> 177 </span><span class="lineCov"> 5 : if (tommy_list_count(&files) == 0) {</span></a>
|
||||
<a name="178"><span class="lineNum"> 178 </span><span class="lineNoCov"> 0 : printf("No files located in the specified parity tail.\n");</span></a>
|
||||
<a name="179"><span class="lineNum"> 179 </span> : } else {</a>
|
||||
<a name="180"><span class="lineNum"> 180 </span><span class="lineCov"> 5 : tommy_list_sort(&files, parity_entry_compare);</span></a>
|
||||
<a name="181"><span class="lineNum"> 181 </span> : </a>
|
||||
<a name="182"><span class="lineNum"> 182 </span><span class="lineCov"> 5 : data_off_t total_size_located = 0;</span></a>
|
||||
<a name="183"><span class="lineNum"> 183 </span> : </a>
|
||||
<a name="184"><span class="lineNum"> 184 </span><span class="lineCov"> 5 : tommy_list_foreach_arg(&files, add_size_to_sum, &total_size_located);</span></a>
|
||||
<a name="185"><span class="lineNum"> 185 </span> : </a>
|
||||
<a name="186"><span class="lineNum"> 186 </span><span class="lineCov"> 5 : printf("Located data in this range: %sB\n", fmt_size(total_size_located, buf, sizeof(buf)));</span></a>
|
||||
<a name="187"><span class="lineNum"> 187 </span> : </a>
|
||||
<a name="188"><span class="lineNum"> 188 </span><span class="lineCov"> 5 : printf("\n");</span></a>
|
||||
<a name="189"><span class="lineNum"> 189 </span> : </a>
|
||||
<a name="190"><span class="lineNum"> 190 </span> : /* |<##################################################################72>|####80>| */</a>
|
||||
<a name="191"><span class="lineNum"> 191 </span><span class="lineCov"> 5 : printf(" Offset Span Frags\n");</span></a>
|
||||
<a name="192"><span class="lineNum"> 192 </span> : </a>
|
||||
<a name="193"><span class="lineNum"> 193 </span><span class="lineCov"> 5 : tommy_list_foreach(&files, dump_entry);</span></a>
|
||||
<a name="194"><span class="lineNum"> 194 </span> : }</a>
|
||||
<a name="195"><span class="lineNum"> 195 </span> : </a>
|
||||
<a name="196"><span class="lineNum"> 196 </span><span class="lineCov"> 5 : tommy_list_foreach(&files, free);</span></a>
|
||||
<a name="197"><span class="lineNum"> 197 </span><span class="lineCov"> 5 : }</span></a>
|
||||
<a name="198"><span class="lineNum"> 198 </span> : </a>
|
||||
<a name="199"><span class="lineNum"> 199 </span><span class="lineCov"> 2 : void state_locate_mark_tail_blocks_for_resync(struct snapraid_state* state, uint64_t parity_tail)</span></a>
|
||||
<a name="200"><span class="lineNum"> 200 </span> : {</a>
|
||||
<a name="201"><span class="lineNum"> 201 </span> : char buf[64];</a>
|
||||
<a name="202"><span class="lineNum"> 202 </span><span class="lineCov"> 2 : uint32_t block_size = state->block_size;</span></a>
|
||||
<a name="203"><span class="lineNum"> 203 </span> : block_off_t low_to_free_tail_block;</a>
|
||||
<a name="204"><span class="lineNum"> 204 </span> : </a>
|
||||
<a name="205"><span class="lineNum"> 205 </span><span class="lineCov"> 2 : if (parity_tail == 0) {</span></a>
|
||||
<a name="206"><span class="lineNum"> 206 </span><span class="lineCov"> 1 : printf("Forcing reallocation of all files\n\n");</span></a>
|
||||
<a name="207"><span class="lineNum"> 207 </span><span class="lineCov"> 1 : low_to_free_tail_block = 0;</span></a>
|
||||
<a name="208"><span class="lineNum"> 208 </span> : } else {</a>
|
||||
<a name="209"><span class="lineNum"> 209 </span><span class="lineCov"> 1 : msg_progress("Forcing reallocation of all files within the tail of %sB of the parity\n\n", fmt_size(parity_tail, buf, sizeof(buf)));</span></a>
|
||||
<a name="210"><span class="lineNum"> 210 </span> : </a>
|
||||
<a name="211"><span class="lineNum"> 211 </span> : struct snapraid_locate_info info;</a>
|
||||
<a name="212"><span class="lineNum"> 212 </span><span class="lineCov"> 1 : state_locate_info(state, parity_tail, &info);</span></a>
|
||||
<a name="213"><span class="lineNum"> 213 </span> : </a>
|
||||
<a name="214"><span class="lineNum"> 214 </span><span class="lineCov"> 1 : printf("Current parity size is %sB\n", fmt_size(info.parity_size, buf, sizeof(buf)));</span></a>
|
||||
<a name="215"><span class="lineNum"> 215 </span><span class="lineCov"> 1 : if (info.tail_block > info.block_max) {</span></a>
|
||||
<a name="216"><span class="lineNum"> 216 </span><span class="lineNoCov"> 0 : printf("Specified tail greater than the parity size! Operate on the full parity\n");</span></a>
|
||||
<a name="217"><span class="lineNum"> 217 </span> : }</a>
|
||||
<a name="218"><span class="lineNum"> 218 </span> : </a>
|
||||
<a name="219"><span class="lineNum"> 219 </span><span class="lineCov"> 1 : low_to_free_tail_block = info.low_to_free_tail_block;</span></a>
|
||||
<a name="220"><span class="lineNum"> 220 </span> : }</a>
|
||||
<a name="221"><span class="lineNum"> 221 </span> : </a>
|
||||
<a name="222"><span class="lineNum"> 222 </span><span class="lineCov"> 2 : msg_progress("Collecting files with offset greater or equal to %" PRIu64 "\n", low_to_free_tail_block * (uint64_t)block_size);</span></a>
|
||||
<a name="223"><span class="lineNum"> 223 </span> : </a>
|
||||
<a name="224"><span class="lineNum"> 224 </span> : tommy_list files;</a>
|
||||
<a name="225"><span class="lineNum"> 225 </span><span class="lineCov"> 2 : tommy_list_init(&files);</span></a>
|
||||
<a name="226"><span class="lineNum"> 226 </span><span class="lineCov"> 14 : for (tommy_node* i = tommy_list_head(&state->disklist); i != 0; i = i->next) {</span></a>
|
||||
<a name="227"><span class="lineNum"> 227 </span><span class="lineCov"> 12 : struct snapraid_disk* disk = i->data;</span></a>
|
||||
<a name="228"><span class="lineNum"> 228 </span><span class="lineCov"> 22561 : for (tommy_node* j = tommy_list_head(&disk->filelist); j != 0; j = j->next) {</span></a>
|
||||
<a name="229"><span class="lineNum"> 229 </span><span class="lineCov"> 22549 : struct snapraid_file* file = j->data;</span></a>
|
||||
<a name="230"><span class="lineNum"> 230 </span><span class="lineCov"> 22549 : collect_parity_block_file(block_size, disk, file, &files, low_to_free_tail_block);</span></a>
|
||||
<a name="231"><span class="lineNum"> 231 </span> : }</a>
|
||||
<a name="232"><span class="lineNum"> 232 </span> : }</a>
|
||||
<a name="233"><span class="lineNum"> 233 </span> : </a>
|
||||
<a name="234"><span class="lineNum"> 234 </span><span class="lineCov"> 2 : printf("\n");</span></a>
|
||||
<a name="235"><span class="lineNum"> 235 </span> : </a>
|
||||
<a name="236"><span class="lineNum"> 236 </span><span class="lineCov"> 2 : if (tommy_list_count(&files) == 0) {</span></a>
|
||||
<a name="237"><span class="lineNum"> 237 </span><span class="lineNoCov"> 0 : printf("No files located in the specified parity tail.\n");</span></a>
|
||||
<a name="238"><span class="lineNum"> 238 </span> : } else {</a>
|
||||
<a name="239"><span class="lineNum"> 239 </span> : /* process all the files partiall or fully overlapping the free zone */</a>
|
||||
<a name="240"><span class="lineNum"> 240 </span><span class="lineCov"> 11260 : for (tommy_node* j = tommy_list_head(&files); j != 0; j = j->next) {</span></a>
|
||||
<a name="241"><span class="lineNum"> 241 </span><span class="lineCov"> 11258 : struct snapraid_parity_entry* entry = j->data;</span></a>
|
||||
<a name="242"><span class="lineNum"> 242 </span><span class="lineCov"> 11258 : struct snapraid_file* file = entry->file;</span></a>
|
||||
<a name="243"><span class="lineNum"> 243 </span><span class="lineCov"> 11258 : struct snapraid_disk* disk = entry->disk;</span></a>
|
||||
<a name="244"><span class="lineNum"> 244 </span> : </a>
|
||||
<a name="245"><span class="lineNum"> 245 </span> : /* reallocate the full file, not only the part of in the free zone */</a>
|
||||
<a name="246"><span class="lineNum"> 246 </span> : /* this is required because the files blocks have to be in order in */</a>
|
||||
<a name="247"><span class="lineNum"> 247 </span> : /* in the parity file. */</a>
|
||||
<a name="248"><span class="lineNum"> 248 </span> : /* not reallocating the file head will prevent the reallocation of the file tail */</a>
|
||||
<a name="249"><span class="lineNum"> 249 </span><span class="lineCov"> 40108 : for (block_off_t f = 0; f < file->blockmax; ++f) {</span></a>
|
||||
<a name="250"><span class="lineNum"> 250 </span><span class="lineCov"> 28850 : block_off_t parity_pos = fs_file2par_find(disk, file, f);</span></a>
|
||||
<a name="251"><span class="lineNum"> 251 </span> : </a>
|
||||
<a name="252"><span class="lineNum"> 252 </span><span class="lineCov"> 28850 : if (parity_pos == POS_NULL) {</span></a>
|
||||
<a name="253"><span class="lineNum"> 253 </span> : /* block not yet allocated */</a>
|
||||
<a name="254"><span class="lineNum"> 254 </span><span class="lineNoCov"> 0 : continue;</span></a>
|
||||
<a name="255"><span class="lineNum"> 255 </span> : }</a>
|
||||
<a name="256"><span class="lineNum"> 256 </span> : </a>
|
||||
<a name="257"><span class="lineNum"> 257 </span><span class="lineCov"> 28850 : struct snapraid_block* block = fs_file2block_get(file, f);</span></a>
|
||||
<a name="258"><span class="lineNum"> 258 </span><span class="lineCov"> 28850 : if (block_state_get(block) == BLOCK_STATE_BLK) {</span></a>
|
||||
<a name="259"><span class="lineNum"> 259 </span> : /* convert from BLK to REP */</a>
|
||||
<a name="260"><span class="lineNum"> 260 </span><span class="lineCov"> 28850 : block_state_set(block, BLOCK_STATE_REP);</span></a>
|
||||
<a name="261"><span class="lineNum"> 261 </span> : }</a>
|
||||
<a name="262"><span class="lineNum"> 262 </span> : }</a>
|
||||
<a name="263"><span class="lineNum"> 263 </span> : }</a>
|
||||
<a name="264"><span class="lineNum"> 264 </span> : }</a>
|
||||
<a name="265"><span class="lineNum"> 265 </span> : </a>
|
||||
<a name="266"><span class="lineNum"> 266 </span><span class="lineCov"> 2 : tommy_list_foreach(&files, free);</span></a>
|
||||
<a name="267"><span class="lineNum"> 267 </span><span class="lineCov"> 2 : }</span></a>
|
||||
<a name="268"><span class="lineNum"> 268 </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>
|
||||
76
cov/cmdline/museair.c.func-sort-c.html
Normal file
76
cov/cmdline/museair.c.func-sort-c.html
Normal file
|
|
@ -0,0 +1,76 @@
|
|||
<!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/museair.c - functions</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> - museair.c<span style="font-size: 80%;"> (<a href="museair.c.gcov.html">source</a> / functions)</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">78</td>
|
||||
<td class="headerCovTableEntry">78</td>
|
||||
<td class="headerCovTableEntryHi">100.0 %</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="headerItem">Date:</td>
|
||||
<td class="headerValue">2026-02-28 16:42:47</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>
|
||||
|
||||
<center>
|
||||
<table width="60%" cellpadding=1 cellspacing=1 border=0>
|
||||
<tr><td><br></td></tr>
|
||||
<tr>
|
||||
<td width="80%" class="tableHead">Function Name <span class="tableHeadSort"><a href="museair.c.func.html"><img src="../updown.png" width=10 height=14 alt="Sort by function name" title="Sort by function name" border=0></a></span></td>
|
||||
<td width="20%" class="tableHead">Hit count <span class="tableHeadSort"><img src="../glass.png" width=10 height=14 alt="Sort by hit count" title="Sort by hit count" border=0></span></td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="museair.c.gcov.html#58">MuseAirLoong</a></td>
|
||||
<td class="coverFnHi">361</td>
|
||||
</tr>
|
||||
</table>
|
||||
<br>
|
||||
</center>
|
||||
<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>
|
||||
76
cov/cmdline/museair.c.func.html
Normal file
76
cov/cmdline/museair.c.func.html
Normal file
|
|
@ -0,0 +1,76 @@
|
|||
<!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/museair.c - functions</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> - museair.c<span style="font-size: 80%;"> (<a href="museair.c.gcov.html">source</a> / functions)</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">78</td>
|
||||
<td class="headerCovTableEntry">78</td>
|
||||
<td class="headerCovTableEntryHi">100.0 %</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="headerItem">Date:</td>
|
||||
<td class="headerValue">2026-02-28 16:42:47</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>
|
||||
|
||||
<center>
|
||||
<table width="60%" cellpadding=1 cellspacing=1 border=0>
|
||||
<tr><td><br></td></tr>
|
||||
<tr>
|
||||
<td width="80%" class="tableHead">Function Name <span class="tableHeadSort"><img src="../glass.png" width=10 height=14 alt="Sort by function name" title="Sort by function name" border=0></span></td>
|
||||
<td width="20%" class="tableHead">Hit count <span class="tableHeadSort"><a href="museair.c.func-sort-c.html"><img src="../updown.png" width=10 height=14 alt="Sort by hit count" title="Sort by hit count" border=0></a></span></td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="coverFn"><a href="museair.c.gcov.html#58">MuseAirLoong</a></td>
|
||||
<td class="coverFnHi">361</td>
|
||||
</tr>
|
||||
</table>
|
||||
<br>
|
||||
</center>
|
||||
<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>
|
||||
257
cov/cmdline/museair.c.gcov.html
Normal file
257
cov/cmdline/museair.c.gcov.html
Normal file
|
|
@ -0,0 +1,257 @@
|
|||
<!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/museair.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> - museair.c<span style="font-size: 80%;"> (source / <a href="museair.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">78</td>
|
||||
<td class="headerCovTableEntry">78</td>
|
||||
<td class="headerCovTableEntryHi">100.0 %</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="headerItem">Date:</td>
|
||||
<td class="headerValue">2026-02-28 16:42:47</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) 2026 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 MuseAir 0.4-rc4 in the "Bfast" configuration</a>
|
||||
<a name="20"><span class="lineNum"> 20 </span> : *</a>
|
||||
<a name="21"><span class="lineNum"> 21 </span> : * This version extends the original MuseAirLoong 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/eternal-io/museair</a>
|
||||
<a name="27"><span class="lineNum"> 27 </span> : */</a>
|
||||
<a name="28"><span class="lineNum"> 28 </span> : </a>
|
||||
<a name="29"><span class="lineNum"> 29 </span> : /*</a>
|
||||
<a name="30"><span class="lineNum"> 30 </span> : * MuseAir hash algorithm itself and its reference implementation (this file)</a>
|
||||
<a name="31"><span class="lineNum"> 31 </span> : * by K--Aethiax are released into the public domain under the CC0 1.0 license.</a>
|
||||
<a name="32"><span class="lineNum"> 32 </span> : * To view a copy of this license, visit: https://creativecommons.org/publicdomain/zero/1.0/</a>
|
||||
<a name="33"><span class="lineNum"> 33 </span> : */</a>
|
||||
<a name="34"><span class="lineNum"> 34 </span> : </a>
|
||||
<a name="35"><span class="lineNum"> 35 </span> : #define MUSEAIR_ALGORITHM_VERSION "0.4-rc4"</a>
|
||||
<a name="36"><span class="lineNum"> 36 </span> : </a>
|
||||
<a name="37"><span class="lineNum"> 37 </span> : #define u64x(N) (N * 8)</a>
|
||||
<a name="38"><span class="lineNum"> 38 </span> : </a>
|
||||
<a name="39"><span class="lineNum"> 39 </span> : /* AiryAi(0) fractional part calculated by Y-Cruncher */</a>
|
||||
<a name="40"><span class="lineNum"> 40 </span> : static const uint64_t MUSEAIR_CONSTANT[7] = {</a>
|
||||
<a name="41"><span class="lineNum"> 41 </span> : 0x5ae31e589c56e17aULL,</a>
|
||||
<a name="42"><span class="lineNum"> 42 </span> : 0x96d7bb04e64f6da9ULL,</a>
|
||||
<a name="43"><span class="lineNum"> 43 </span> : 0x7ab1006b26f9eb64ULL,</a>
|
||||
<a name="44"><span class="lineNum"> 44 </span> : 0x21233394220b8457ULL,</a>
|
||||
<a name="45"><span class="lineNum"> 45 </span> : 0x047cb9557c9f3b43ULL,</a>
|
||||
<a name="46"><span class="lineNum"> 46 </span> : 0xd24f2590c0bcee28ULL,</a>
|
||||
<a name="47"><span class="lineNum"> 47 </span> : 0x33ea8f71bb6016d8ULL</a>
|
||||
<a name="48"><span class="lineNum"> 48 </span> : };</a>
|
||||
<a name="49"><span class="lineNum"> 49 </span> : </a>
|
||||
<a name="50"><span class="lineNum"> 50 </span> : #define mult64_128(l, h, a, b) \</a>
|
||||
<a name="51"><span class="lineNum"> 51 </span> : do { \</a>
|
||||
<a name="52"><span class="lineNum"> 52 </span> : l = a; \</a>
|
||||
<a name="53"><span class="lineNum"> 53 </span> : h = b; \</a>
|
||||
<a name="54"><span class="lineNum"> 54 </span> : util_mum(&l, &h); \</a>
|
||||
<a name="55"><span class="lineNum"> 55 </span> : } while (0)</a>
|
||||
<a name="56"><span class="lineNum"> 56 </span> : </a>
|
||||
<a name="57"><span class="lineNum"> 57 </span> : #define likely(a) tommy_likely(a)</a>
|
||||
<a name="58"><span class="lineNum"> 58 </span> : #define unlikely(a) tommy_unlikely(a)</a>
|
||||
<a name="59"><span class="lineNum"> 59 </span> : </a>
|
||||
<a name="60"><span class="lineNum"> 60 </span><span class="lineCov"> 361 : static void MuseAirLoong(const void* bytes, size_t len, const uint8_t* seed, uint8_t* out)</span></a>
|
||||
<a name="61"><span class="lineNum"> 61 </span> : {</a>
|
||||
<a name="62"><span class="lineNum"> 62 </span><span class="lineCov"> 361 : const uint8_t* p = bytes;</span></a>
|
||||
<a name="63"><span class="lineNum"> 63 </span><span class="lineCov"> 361 : size_t q = len;</span></a>
|
||||
<a name="64"><span class="lineNum"> 64 </span> : </a>
|
||||
<a name="65"><span class="lineNum"> 65 </span> : /* EXTENSION: This algo doesn't support shorter lengths */</a>
|
||||
<a name="66"><span class="lineNum"> 66 </span><span class="lineCov"> 361 : assert(len >= 32);</span></a>
|
||||
<a name="67"><span class="lineNum"> 67 </span> : </a>
|
||||
<a name="68"><span class="lineNum"> 68 </span> : uint64_t i, j, k;</a>
|
||||
<a name="69"><span class="lineNum"> 69 </span> : </a>
|
||||
<a name="70"><span class="lineNum"> 70 </span><span class="lineCov"> 361 : uint64_t lo0, lo1, lo2, lo3, lo4, lo5 = MUSEAIR_CONSTANT[6];</span></a>
|
||||
<a name="71"><span class="lineNum"> 71 </span> : uint64_t hi0, hi1, hi2, hi3, hi4, hi5;</a>
|
||||
<a name="72"><span class="lineNum"> 72 </span> : </a>
|
||||
<a name="73"><span class="lineNum"> 73 </span> : /*</a>
|
||||
<a name="74"><span class="lineNum"> 74 </span> : * EXTENSION: Initialize primary state with 128-bit seed (seed0 and seed1)</a>
|
||||
<a name="75"><span class="lineNum"> 75 </span> : * Ensures both halves influence the hash.</a>
|
||||
<a name="76"><span class="lineNum"> 76 </span> : *</a>
|
||||
<a name="77"><span class="lineNum"> 77 </span> : * Original code was:</a>
|
||||
<a name="78"><span class="lineNum"> 78 </span> : * uint64_t state[6] = {MUSEAIR_CONSTANT[0] + seed, MUSEAIR_CONSTANT[1] - seed, MUSEAIR_CONSTANT[2] ^ seed,</a>
|
||||
<a name="79"><span class="lineNum"> 79 </span> : * MUSEAIR_CONSTANT[3] + seed, MUSEAIR_CONSTANT[4] - seed, MUSEAIR_CONSTANT[5] ^ seed};</a>
|
||||
<a name="80"><span class="lineNum"> 80 </span> : */</a>
|
||||
<a name="81"><span class="lineNum"> 81 </span><span class="lineCov"> 361 : uint64_t seed0 = util_read64(seed);</span></a>
|
||||
<a name="82"><span class="lineNum"> 82 </span><span class="lineCov"> 361 : uint64_t seed1 = util_read64(seed + 8);</span></a>
|
||||
<a name="83"><span class="lineNum"> 83 </span><span class="lineCov"> 361 : uint64_t state[6] = { MUSEAIR_CONSTANT[0] + seed0, MUSEAIR_CONSTANT[1] - seed1, MUSEAIR_CONSTANT[2] ^ seed0,</span></a>
|
||||
<a name="84"><span class="lineNum"> 84 </span><span class="lineCov"> 361 : MUSEAIR_CONSTANT[3] + seed1, MUSEAIR_CONSTANT[4] - seed0, MUSEAIR_CONSTANT[5] ^ seed1 };</span></a>
|
||||
<a name="85"><span class="lineNum"> 85 </span> : </a>
|
||||
<a name="86"><span class="lineNum"> 86 </span><span class="lineCov"> 361 : if (unlikely(q > u64x(12))) {</span></a>
|
||||
<a name="87"><span class="lineNum"> 87 </span> : do {</a>
|
||||
<a name="88"><span class="lineNum"> 88 </span><span class="lineCov"> 371504 : state[0] ^= util_read64(p + u64x(0));</span></a>
|
||||
<a name="89"><span class="lineNum"> 89 </span><span class="lineCov"> 371504 : state[1] ^= util_read64(p + u64x(1));</span></a>
|
||||
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 371504 : mult64_128(lo0, hi0, state[0], state[1]);</span></a>
|
||||
<a name="91"><span class="lineNum"> 91 </span><span class="lineCov"> 371504 : state[0] = lo5 ^ hi0;</span></a>
|
||||
<a name="92"><span class="lineNum"> 92 </span> : </a>
|
||||
<a name="93"><span class="lineNum"> 93 </span><span class="lineCov"> 371504 : state[1] ^= util_read64(p + u64x(2));</span></a>
|
||||
<a name="94"><span class="lineNum"> 94 </span><span class="lineCov"> 371504 : state[2] ^= util_read64(p + u64x(3));</span></a>
|
||||
<a name="95"><span class="lineNum"> 95 </span><span class="lineCov"> 371504 : mult64_128(lo1, hi1, state[1], state[2]);</span></a>
|
||||
<a name="96"><span class="lineNum"> 96 </span><span class="lineCov"> 371504 : state[1] = lo0 ^ hi1;</span></a>
|
||||
<a name="97"><span class="lineNum"> 97 </span> : </a>
|
||||
<a name="98"><span class="lineNum"> 98 </span><span class="lineCov"> 371504 : state[2] ^= util_read64(p + u64x(4));</span></a>
|
||||
<a name="99"><span class="lineNum"> 99 </span><span class="lineCov"> 371504 : state[3] ^= util_read64(p + u64x(5));</span></a>
|
||||
<a name="100"><span class="lineNum"> 100 </span><span class="lineCov"> 371504 : mult64_128(lo2, hi2, state[2], state[3]);</span></a>
|
||||
<a name="101"><span class="lineNum"> 101 </span><span class="lineCov"> 371504 : state[2] = lo1 ^ hi2;</span></a>
|
||||
<a name="102"><span class="lineNum"> 102 </span> : </a>
|
||||
<a name="103"><span class="lineNum"> 103 </span><span class="lineCov"> 371504 : state[3] ^= util_read64(p + u64x(6));</span></a>
|
||||
<a name="104"><span class="lineNum"> 104 </span><span class="lineCov"> 371504 : state[4] ^= util_read64(p + u64x(7));</span></a>
|
||||
<a name="105"><span class="lineNum"> 105 </span><span class="lineCov"> 371504 : mult64_128(lo3, hi3, state[3], state[4]);</span></a>
|
||||
<a name="106"><span class="lineNum"> 106 </span><span class="lineCov"> 371504 : state[3] = lo2 ^ hi3;</span></a>
|
||||
<a name="107"><span class="lineNum"> 107 </span> : </a>
|
||||
<a name="108"><span class="lineNum"> 108 </span><span class="lineCov"> 371504 : state[4] ^= util_read64(p + u64x(8));</span></a>
|
||||
<a name="109"><span class="lineNum"> 109 </span><span class="lineCov"> 371504 : state[5] ^= util_read64(p + u64x(9));</span></a>
|
||||
<a name="110"><span class="lineNum"> 110 </span><span class="lineCov"> 371504 : mult64_128(lo4, hi4, state[4], state[5]);</span></a>
|
||||
<a name="111"><span class="lineNum"> 111 </span><span class="lineCov"> 371504 : state[4] = lo3 ^ hi4;</span></a>
|
||||
<a name="112"><span class="lineNum"> 112 </span> : </a>
|
||||
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 371504 : state[5] ^= util_read64(p + u64x(10));</span></a>
|
||||
<a name="114"><span class="lineNum"> 114 </span><span class="lineCov"> 371504 : state[0] ^= util_read64(p + u64x(11));</span></a>
|
||||
<a name="115"><span class="lineNum"> 115 </span><span class="lineCov"> 371504 : mult64_128(lo5, hi5, state[5], state[0]);</span></a>
|
||||
<a name="116"><span class="lineNum"> 116 </span><span class="lineCov"> 371504 : state[5] = lo4 ^ hi5;</span></a>
|
||||
<a name="117"><span class="lineNum"> 117 </span> : </a>
|
||||
<a name="118"><span class="lineNum"> 118 </span><span class="lineCov"> 371504 : p += u64x(12);</span></a>
|
||||
<a name="119"><span class="lineNum"> 119 </span><span class="lineCov"> 371504 : q -= u64x(12);</span></a>
|
||||
<a name="120"><span class="lineNum"> 120 </span> : </a>
|
||||
<a name="121"><span class="lineNum"> 121 </span><span class="lineCov"> 371504 : } while (likely(q > u64x(12)));</span></a>
|
||||
<a name="122"><span class="lineNum"> 122 </span> : </a>
|
||||
<a name="123"><span class="lineNum"> 123 </span><span class="lineCov"> 296 : state[0] ^= lo5;</span></a>
|
||||
<a name="124"><span class="lineNum"> 124 </span> : }</a>
|
||||
<a name="125"><span class="lineNum"> 125 </span> : </a>
|
||||
<a name="126"><span class="lineNum"> 126 </span><span class="lineCov"> 361 : lo0 = 0, lo1 = 0, lo2 = 0, lo3 = 0, lo4 = 0, lo5 = 0;</span></a>
|
||||
<a name="127"><span class="lineNum"> 127 </span><span class="lineCov"> 361 : hi0 = 0, hi1 = 0, hi2 = 0, hi3 = 0, hi4 = 0, hi5 = 0;</span></a>
|
||||
<a name="128"><span class="lineNum"> 128 </span> : </a>
|
||||
<a name="129"><span class="lineNum"> 129 </span><span class="lineCov"> 361 : if (likely(q > u64x(4))) {</span></a>
|
||||
<a name="130"><span class="lineNum"> 130 </span><span class="lineCov"> 296 : state[0] ^= util_read64(p + u64x(0));</span></a>
|
||||
<a name="131"><span class="lineNum"> 131 </span><span class="lineCov"> 296 : state[1] ^= util_read64(p + u64x(1));</span></a>
|
||||
<a name="132"><span class="lineNum"> 132 </span><span class="lineCov"> 296 : mult64_128(lo0, hi0, state[0], state[1]);</span></a>
|
||||
<a name="133"><span class="lineNum"> 133 </span> : </a>
|
||||
<a name="134"><span class="lineNum"> 134 </span><span class="lineCov"> 296 : if (likely(q > u64x(6))) {</span></a>
|
||||
<a name="135"><span class="lineNum"> 135 </span><span class="lineCov"> 248 : state[1] ^= util_read64(p + u64x(2));</span></a>
|
||||
<a name="136"><span class="lineNum"> 136 </span><span class="lineCov"> 248 : state[2] ^= util_read64(p + u64x(3));</span></a>
|
||||
<a name="137"><span class="lineNum"> 137 </span><span class="lineCov"> 248 : mult64_128(lo1, hi1, state[1], state[2]);</span></a>
|
||||
<a name="138"><span class="lineNum"> 138 </span> : </a>
|
||||
<a name="139"><span class="lineNum"> 139 </span><span class="lineCov"> 248 : if (likely(q > u64x(8))) {</span></a>
|
||||
<a name="140"><span class="lineNum"> 140 </span><span class="lineCov"> 64 : state[2] ^= util_read64(p + u64x(4));</span></a>
|
||||
<a name="141"><span class="lineNum"> 141 </span><span class="lineCov"> 64 : state[3] ^= util_read64(p + u64x(5));</span></a>
|
||||
<a name="142"><span class="lineNum"> 142 </span><span class="lineCov"> 64 : mult64_128(lo2, hi2, state[2], state[3]);</span></a>
|
||||
<a name="143"><span class="lineNum"> 143 </span> : </a>
|
||||
<a name="144"><span class="lineNum"> 144 </span><span class="lineCov"> 64 : if (likely(q > u64x(10))) {</span></a>
|
||||
<a name="145"><span class="lineNum"> 145 </span><span class="lineCov"> 32 : state[3] ^= util_read64(p + u64x(6));</span></a>
|
||||
<a name="146"><span class="lineNum"> 146 </span><span class="lineCov"> 32 : state[4] ^= util_read64(p + u64x(7));</span></a>
|
||||
<a name="147"><span class="lineNum"> 147 </span><span class="lineCov"> 32 : mult64_128(lo3, hi3, state[3], state[4]);</span></a>
|
||||
<a name="148"><span class="lineNum"> 148 </span> : }</a>
|
||||
<a name="149"><span class="lineNum"> 149 </span> : }</a>
|
||||
<a name="150"><span class="lineNum"> 150 </span> : }</a>
|
||||
<a name="151"><span class="lineNum"> 151 </span> : }</a>
|
||||
<a name="152"><span class="lineNum"> 152 </span> : </a>
|
||||
<a name="153"><span class="lineNum"> 153 </span><span class="lineCov"> 361 : state[4] ^= util_read64(p + q - u64x(4));</span></a>
|
||||
<a name="154"><span class="lineNum"> 154 </span><span class="lineCov"> 361 : state[5] ^= util_read64(p + q - u64x(3));</span></a>
|
||||
<a name="155"><span class="lineNum"> 155 </span><span class="lineCov"> 361 : mult64_128(lo4, hi4, state[4], state[5]);</span></a>
|
||||
<a name="156"><span class="lineNum"> 156 </span> : </a>
|
||||
<a name="157"><span class="lineNum"> 157 </span><span class="lineCov"> 361 : state[5] ^= util_read64(p + q - u64x(2));</span></a>
|
||||
<a name="158"><span class="lineNum"> 158 </span><span class="lineCov"> 361 : state[0] ^= util_read64(p + q - u64x(1));</span></a>
|
||||
<a name="159"><span class="lineNum"> 159 </span><span class="lineCov"> 361 : mult64_128(lo5, hi5, state[5], state[0]);</span></a>
|
||||
<a name="160"><span class="lineNum"> 160 </span> : </a>
|
||||
<a name="161"><span class="lineNum"> 161 </span><span class="lineCov"> 361 : i = state[0] - state[1];</span></a>
|
||||
<a name="162"><span class="lineNum"> 162 </span><span class="lineCov"> 361 : j = state[2] - state[3];</span></a>
|
||||
<a name="163"><span class="lineNum"> 163 </span><span class="lineCov"> 361 : k = state[4] - state[5];</span></a>
|
||||
<a name="164"><span class="lineNum"> 164 </span> : </a>
|
||||
<a name="165"><span class="lineNum"> 165 </span><span class="lineCov"> 361 : int rot = len & 63;</span></a>
|
||||
<a name="166"><span class="lineNum"> 166 </span><span class="lineCov"> 361 : i = util_rotl64(i, rot);</span></a>
|
||||
<a name="167"><span class="lineNum"> 167 </span><span class="lineCov"> 361 : j = util_rotr64(j, rot);</span></a>
|
||||
<a name="168"><span class="lineNum"> 168 </span><span class="lineCov"> 361 : k ^= len;</span></a>
|
||||
<a name="169"><span class="lineNum"> 169 </span> : </a>
|
||||
<a name="170"><span class="lineNum"> 170 </span><span class="lineCov"> 361 : i += lo3 ^ hi3 ^ lo4 ^ hi4;</span></a>
|
||||
<a name="171"><span class="lineNum"> 171 </span><span class="lineCov"> 361 : j += lo5 ^ hi5 ^ lo0 ^ hi0;</span></a>
|
||||
<a name="172"><span class="lineNum"> 172 </span><span class="lineCov"> 361 : k += lo1 ^ hi1 ^ lo2 ^ hi2;</span></a>
|
||||
<a name="173"><span class="lineNum"> 173 </span> : </a>
|
||||
<a name="174"><span class="lineNum"> 174 </span><span class="lineCov"> 361 : mult64_128(lo0, hi0, i, j);</span></a>
|
||||
<a name="175"><span class="lineNum"> 175 </span><span class="lineCov"> 361 : mult64_128(lo1, hi1, j, k);</span></a>
|
||||
<a name="176"><span class="lineNum"> 176 </span><span class="lineCov"> 361 : mult64_128(lo2, hi2, k, i);</span></a>
|
||||
<a name="177"><span class="lineNum"> 177 </span> : </a>
|
||||
<a name="178"><span class="lineNum"> 178 </span><span class="lineCov"> 361 : util_write64(out, lo0 ^ lo1 ^ hi2);</span></a>
|
||||
<a name="179"><span class="lineNum"> 179 </span><span class="lineCov"> 361 : util_write64(out + 8, hi0 ^ hi1 ^ lo2);</span></a>
|
||||
<a name="180"><span class="lineNum"> 180 </span><span class="lineCov"> 361 : }</span></a>
|
||||
<a name="181"><span class="lineNum"> 181 </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>
|
||||
Loading…
Add table
Add a link
Reference in a new issue