snapraid/cov/cmdline/selftest.c.gcov.html
Andrea Mazzoleni d5ed938f1f Auto update
2025-10-28 12:01:21 +01:00

721 lines
77 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/selftest.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> - selftest.c<span style="font-size: 80%;"> (source / <a href="selftest.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">136</td>
<td class="headerCovTableEntry">137</td>
<td class="headerCovTableEntryHi">99.3 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2025-10-28 11:59:11</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">8</td>
<td class="headerCovTableEntry">8</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) 2011 Andrea Mazzoleni</a>
<a name="3"><span class="lineNum"> 3 </span> : *</a>
<a name="4"><span class="lineNum"> 4 </span> : * This program is free software: you can redistribute it and/or modify</a>
<a name="5"><span class="lineNum"> 5 </span> : * it under the terms of the GNU General Public License as published by</a>
<a name="6"><span class="lineNum"> 6 </span> : * the Free Software Foundation, either version 3 of the License, or</a>
<a name="7"><span class="lineNum"> 7 </span> : * (at your option) any later version.</a>
<a name="8"><span class="lineNum"> 8 </span> : *</a>
<a name="9"><span class="lineNum"> 9 </span> : * This program is distributed in the hope that it will be useful,</a>
<a name="10"><span class="lineNum"> 10 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of</a>
<a name="11"><span class="lineNum"> 11 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</a>
<a name="12"><span class="lineNum"> 12 </span> : * GNU General Public License for more details.</a>
<a name="13"><span class="lineNum"> 13 </span> : *</a>
<a name="14"><span class="lineNum"> 14 </span> : * You should have received a copy of the GNU General Public License</a>
<a name="15"><span class="lineNum"> 15 </span> : * along with this program. If not, see &lt;http://www.gnu.org/licenses/&gt;.</a>
<a name="16"><span class="lineNum"> 16 </span> : */</a>
<a name="17"><span class="lineNum"> 17 </span> : </a>
<a name="18"><span class="lineNum"> 18 </span> : #include &quot;portable.h&quot;</a>
<a name="19"><span class="lineNum"> 19 </span> : </a>
<a name="20"><span class="lineNum"> 20 </span> : #include &quot;snapraid.h&quot;</a>
<a name="21"><span class="lineNum"> 21 </span> : #include &quot;util.h&quot;</a>
<a name="22"><span class="lineNum"> 22 </span> : #include &quot;raid/raid.h&quot;</a>
<a name="23"><span class="lineNum"> 23 </span> : #include &quot;raid/cpu.h&quot;</a>
<a name="24"><span class="lineNum"> 24 </span> : #include &quot;raid/combo.h&quot;</a>
<a name="25"><span class="lineNum"> 25 </span> : #include &quot;raid/internal.h&quot;</a>
<a name="26"><span class="lineNum"> 26 </span> : #include &quot;raid/test.h&quot;</a>
<a name="27"><span class="lineNum"> 27 </span> : #include &quot;elem.h&quot;</a>
<a name="28"><span class="lineNum"> 28 </span> : #include &quot;state.h&quot;</a>
<a name="29"><span class="lineNum"> 29 </span> : #include &quot;support.h&quot;</a>
<a name="30"><span class="lineNum"> 30 </span> : #include &quot;tommyds/tommyhash.h&quot;</a>
<a name="31"><span class="lineNum"> 31 </span> : #include &quot;tommyds/tommyarray.h&quot;</a>
<a name="32"><span class="lineNum"> 32 </span> : #include &quot;tommyds/tommyarrayblkof.h&quot;</a>
<a name="33"><span class="lineNum"> 33 </span> : #include &quot;tommyds/tommyhashdyn.h&quot;</a>
<a name="34"><span class="lineNum"> 34 </span> : </a>
<a name="35"><span class="lineNum"> 35 </span> : struct hash32_test_vector {</a>
<a name="36"><span class="lineNum"> 36 </span> : const char* data;</a>
<a name="37"><span class="lineNum"> 37 </span> : int len;</a>
<a name="38"><span class="lineNum"> 38 </span> : uint32_t digest;</a>
<a name="39"><span class="lineNum"> 39 </span> : uint32_t seed;</a>
<a name="40"><span class="lineNum"> 40 </span> : };</a>
<a name="41"><span class="lineNum"> 41 </span> : </a>
<a name="42"><span class="lineNum"> 42 </span> : struct strhash32_test_vector {</a>
<a name="43"><span class="lineNum"> 43 </span> : char* data;</a>
<a name="44"><span class="lineNum"> 44 </span> : uint32_t digest;</a>
<a name="45"><span class="lineNum"> 45 </span> : uint32_t seed;</a>
<a name="46"><span class="lineNum"> 46 </span> : };</a>
<a name="47"><span class="lineNum"> 47 </span> : </a>
<a name="48"><span class="lineNum"> 48 </span> : struct hash64_test_vector {</a>
<a name="49"><span class="lineNum"> 49 </span> : const char* data;</a>
<a name="50"><span class="lineNum"> 50 </span> : int len;</a>
<a name="51"><span class="lineNum"> 51 </span> : uint64_t digest;</a>
<a name="52"><span class="lineNum"> 52 </span> : uint64_t seed;</a>
<a name="53"><span class="lineNum"> 53 </span> : };</a>
<a name="54"><span class="lineNum"> 54 </span> : </a>
<a name="55"><span class="lineNum"> 55 </span> : struct hash_test_vector {</a>
<a name="56"><span class="lineNum"> 56 </span> : const char* data;</a>
<a name="57"><span class="lineNum"> 57 </span> : int len;</a>
<a name="58"><span class="lineNum"> 58 </span> : unsigned char digest[HASH_MAX];</a>
<a name="59"><span class="lineNum"> 59 </span> : unsigned char seed[HASH_MAX];</a>
<a name="60"><span class="lineNum"> 60 </span> : };</a>
<a name="61"><span class="lineNum"> 61 </span> : </a>
<a name="62"><span class="lineNum"> 62 </span> : /**</a>
<a name="63"><span class="lineNum"> 63 </span> : * Test vectors for tommy_hash32</a>
<a name="64"><span class="lineNum"> 64 </span> : */</a>
<a name="65"><span class="lineNum"> 65 </span> : static struct hash32_test_vector TEST_HASH32[] = {</a>
<a name="66"><span class="lineNum"> 66 </span> : { &quot;&quot;, 0, 0x8614384c, 0xa766795d },</a>
<a name="67"><span class="lineNum"> 67 </span> : { &quot;a&quot;, 1, 0x12c16c36, 0xa766795d },</a>
<a name="68"><span class="lineNum"> 68 </span> : { &quot;abc&quot;, 3, 0xc58e8af5, 0xa766795d },</a>
<a name="69"><span class="lineNum"> 69 </span> : { &quot;message digest&quot;, 14, 0x006b32f1, 0xa766795d },</a>
<a name="70"><span class="lineNum"> 70 </span> : { &quot;abcdefghijklmnopqrstuvwxyz&quot;, 26, 0x7e6fcfe0, 0xa766795d },</a>
<a name="71"><span class="lineNum"> 71 </span> : { &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;, 62, 0x8604adf8, 0xa766795d },</a>
<a name="72"><span class="lineNum"> 72 </span> : { &quot;The quick brown fox jumps over the lazy dog&quot;, 43, 0xdeba3d3a, 0xa766795d },</a>
<a name="73"><span class="lineNum"> 73 </span> : { &quot;\x00&quot;, 1, 0x4a7d1c33, 0xa766795d },</a>
<a name="74"><span class="lineNum"> 74 </span> : { &quot;\x16\x27&quot;, 2, 0x8b50899b, 0xa766795d },</a>
<a name="75"><span class="lineNum"> 75 </span> : { &quot;\xe2\x56\xb4&quot;, 3, 0x60406493, 0xa766795d },</a>
<a name="76"><span class="lineNum"> 76 </span> : { &quot;\xc9\x4d\x9c\xda&quot;, 4, 0xa049144a, 0xa766795d },</a>
<a name="77"><span class="lineNum"> 77 </span> : { &quot;\x79\xf1\x29\x69\x5d&quot;, 5, 0x4da2c2f1, 0xa766795d },</a>
<a name="78"><span class="lineNum"> 78 </span> : { &quot;\x00\x7e\xdf\x1e\x31\x1c&quot;, 6, 0x59de30cf, 0xa766795d },</a>
<a name="79"><span class="lineNum"> 79 </span> : { &quot;\x2a\x4c\xe1\xff\x9e\x6f\x53&quot;, 7, 0x219e149c, 0xa766795d },</a>
<a name="80"><span class="lineNum"> 80 </span> : { &quot;\xba\x02\xab\x18\x30\xc5\x0e\x8a&quot;, 8, 0x25067520, 0xa766795d },</a>
<a name="81"><span class="lineNum"> 81 </span> : { &quot;\xec\x4e\x7a\x72\x1e\x71\x2a\xc9\x33&quot;, 9, 0xa1f368d8, 0xa766795d },</a>
<a name="82"><span class="lineNum"> 82 </span> : { &quot;\xfd\xe2\x9c\x0f\x72\xb7\x08\xea\xd0\x78&quot;, 10, 0x805fc63d, 0xa766795d },</a>
<a name="83"><span class="lineNum"> 83 </span> : { &quot;\x65\xc4\x8a\xb8\x80\x86\x9a\x79\x00\xb7\xae&quot;, 11, 0x7f75dd0f, 0xa766795d },</a>
<a name="84"><span class="lineNum"> 84 </span> : { &quot;\x77\xe9\xd7\x80\x0e\x3f\x5c\x43\xc8\xc2\x46\x39&quot;, 12, 0xb9154382, 0xa766795d },</a>
<a name="85"><span class="lineNum"> 85 </span> : { 0, 0, 0, 0 }</a>
<a name="86"><span class="lineNum"> 86 </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> : * Test vectors for tommy_strhash32</a>
<a name="90"><span class="lineNum"> 90 </span> : */</a>
<a name="91"><span class="lineNum"> 91 </span> : struct strhash32_test_vector TEST_STRHASH32[] = {</a>
<a name="92"><span class="lineNum"> 92 </span> : { &quot;&quot;, 0x0af1416d, 0xa766795d },</a>
<a name="93"><span class="lineNum"> 93 </span> : { &quot;a&quot;, 0x68fa0f3f, 0xa766795d },</a>
<a name="94"><span class="lineNum"> 94 </span> : { &quot;abc&quot;, 0xfc68ffc5, 0xa766795d },</a>
<a name="95"><span class="lineNum"> 95 </span> : { &quot;message digest&quot;, 0x08477b63, 0xa766795d },</a>
<a name="96"><span class="lineNum"> 96 </span> : { &quot;abcdefghijklmnopqrstuvwxyz&quot;, 0x5b9c25e5, 0xa766795d },</a>
<a name="97"><span class="lineNum"> 97 </span> : { &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;, 0x1e530ce7, 0xa766795d },</a>
<a name="98"><span class="lineNum"> 98 </span> : { &quot;The quick brown fox jumps over the lazy dog&quot;, 0xaf93eefe, 0xa766795d },</a>
<a name="99"><span class="lineNum"> 99 </span> : { &quot;\xff&quot;, 0xfc88801b, 0xa766795d },</a>
<a name="100"><span class="lineNum"> 100 </span> : { &quot;\x16\x27&quot;, 0xcd7216db, 0xa766795d },</a>
<a name="101"><span class="lineNum"> 101 </span> : { &quot;\xe2\x56\xb4&quot;, 0x05f98d02, 0xa766795d },</a>
<a name="102"><span class="lineNum"> 102 </span> : { &quot;\xc9\x4d\x9c\xda&quot;, 0xf65206f8, 0xa766795d },</a>
<a name="103"><span class="lineNum"> 103 </span> : { &quot;\x79\xf1\x29\x69\x5d&quot;, 0x72bd6bda, 0xa766795d },</a>
<a name="104"><span class="lineNum"> 104 </span> : { &quot;\xff\x7e\xdf\x1e\x31\x1c&quot;, 0x57dfb9b4, 0xa766795d },</a>
<a name="105"><span class="lineNum"> 105 </span> : { &quot;\x2a\x4c\xe1\xff\x9e\x6f\x53&quot;, 0x499ff634, 0xa766795d },</a>
<a name="106"><span class="lineNum"> 106 </span> : { &quot;\xba\x02\xab\x18\x30\xc5\x0e\x8a&quot;, 0xe896b7ce, 0xa766795d },</a>
<a name="107"><span class="lineNum"> 107 </span> : { &quot;\xec\x4e\x7a\x72\x1e\x71\x2a\xc9\x33&quot;, 0xfe3939f0, 0xa766795d },</a>
<a name="108"><span class="lineNum"> 108 </span> : { &quot;\xfd\xe2\x9c\x0f\x72\xb7\x08\xea\xd0\x78&quot;, 0x4351d482, 0xa766795d },</a>
<a name="109"><span class="lineNum"> 109 </span> : { &quot;\x65\xc4\x8a\xb8\x80\x86\x9a\x79\xff\xb7\xae&quot;, 0x88e92135, 0xa766795d },</a>
<a name="110"><span class="lineNum"> 110 </span> : { &quot;\x77\xe9\xd7\x80\x0e\x3f\x5c\x43\xc8\xc2\x46\x39&quot;, 0x01109c16, 0xa766795d },</a>
<a name="111"><span class="lineNum"> 111 </span> : { &quot;\x87\xd8\x61\x61\x4c\x89\x17\x4e\xa1\xa4\xef\x13\xa9&quot;, 0xbcb050dc, 0xa766795d },</a>
<a name="112"><span class="lineNum"> 112 </span> : { &quot;\xfe\xa6\x5b\xc2\xda\xe8\x95\xd4\x64\xab\x4c\x39\x58\x29&quot;, 0xbe5e1fd5, 0xa766795d },</a>
<a name="113"><span class="lineNum"> 113 </span> : { &quot;\x94\x49\xc0\x78\xa0\x80\xda\xc7\x71\x4e\x17\x37\xa9\x7c\x40&quot;, 0x70d8c97f, 0xa766795d },</a>
<a name="114"><span class="lineNum"> 114 </span> : { &quot;\x53\x7e\x36\xb4\x2e\xc9\xb9\xcc\x18\x3e\x9a\x5f\xfc\xb7\xb0\x61&quot;, 0x957440a9, 0xa766795d },</a>
<a name="115"><span class="lineNum"> 115 </span> : { 0, 0, 0 }</a>
<a name="116"><span class="lineNum"> 116 </span> : };</a>
<a name="117"><span class="lineNum"> 117 </span> : </a>
<a name="118"><span class="lineNum"> 118 </span> : /**</a>
<a name="119"><span class="lineNum"> 119 </span> : * Test vectors for tommy_hash64</a>
<a name="120"><span class="lineNum"> 120 </span> : */</a>
<a name="121"><span class="lineNum"> 121 </span> : static struct hash64_test_vector TEST_HASH64[] = {</a>
<a name="122"><span class="lineNum"> 122 </span> : { &quot;&quot;, 0, 0x8614384cb5165fbfULL, 0x2f022773a766795dULL },</a>
<a name="123"><span class="lineNum"> 123 </span> : { &quot;a&quot;, 1, 0x1a2e0298a8e94a3dULL, 0x2f022773a766795dULL },</a>
<a name="124"><span class="lineNum"> 124 </span> : { &quot;abc&quot;, 3, 0x7555796b7a7d21ebULL, 0x2f022773a766795dULL },</a>
<a name="125"><span class="lineNum"> 125 </span> : { &quot;message digest&quot;, 14, 0x9411a57d04b92fb4ULL, 0x2f022773a766795dULL },</a>
<a name="126"><span class="lineNum"> 126 </span> : { &quot;abcdefghijklmnopqrstuvwxyz&quot;, 26, 0x3ca3f8d2b4e69832ULL, 0x2f022773a766795dULL },</a>
<a name="127"><span class="lineNum"> 127 </span> : { &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;, 62, 0x6dae542ba0015a4dULL, 0x2f022773a766795dULL },</a>
<a name="128"><span class="lineNum"> 128 </span> : { &quot;The quick brown fox jumps over the lazy dog&quot;, 43, 0xe06d8cbb3d2ea1a6ULL, 0x2f022773a766795dULL },</a>
<a name="129"><span class="lineNum"> 129 </span> : { &quot;\x00&quot;, 1, 0x201e664fb5f2c021ULL, 0x2f022773a766795dULL },</a>
<a name="130"><span class="lineNum"> 130 </span> : { &quot;\x16\x27&quot;, 2, 0xef42fa8032c4b775ULL, 0x2f022773a766795dULL },</a>
<a name="131"><span class="lineNum"> 131 </span> : { &quot;\xe2\x56\xb4&quot;, 3, 0x6e6c498a6688466cULL, 0x2f022773a766795dULL },</a>
<a name="132"><span class="lineNum"> 132 </span> : { &quot;\xc9\x4d\x9c\xda&quot;, 4, 0x5195005419905423ULL, 0x2f022773a766795dULL },</a>
<a name="133"><span class="lineNum"> 133 </span> : { &quot;\x79\xf1\x29\x69\x5d&quot;, 5, 0x221235b48afee7c1ULL, 0x2f022773a766795dULL },</a>
<a name="134"><span class="lineNum"> 134 </span> : { &quot;\x00\x7e\xdf\x1e\x31\x1c&quot;, 6, 0x1b1f18b9266f095bULL, 0x2f022773a766795dULL },</a>
<a name="135"><span class="lineNum"> 135 </span> : { &quot;\x2a\x4c\xe1\xff\x9e\x6f\x53&quot;, 7, 0x2cbafa8e741d49caULL, 0x2f022773a766795dULL },</a>
<a name="136"><span class="lineNum"> 136 </span> : { &quot;\xba\x02\xab\x18\x30\xc5\x0e\x8a&quot;, 8, 0x4677f04c06e0758dULL, 0x2f022773a766795dULL },</a>
<a name="137"><span class="lineNum"> 137 </span> : { &quot;\xec\x4e\x7a\x72\x1e\x71\x2a\xc9\x33&quot;, 9, 0x5afe09e8214e2163ULL, 0x2f022773a766795dULL },</a>
<a name="138"><span class="lineNum"> 138 </span> : { &quot;\xfd\xe2\x9c\x0f\x72\xb7\x08\xea\xd0\x78&quot;, 10, 0x115b6276d209fab6ULL, 0x2f022773a766795dULL },</a>
<a name="139"><span class="lineNum"> 139 </span> : { &quot;\x65\xc4\x8a\xb8\x80\x86\x9a\x79\x00\xb7\xae&quot;, 11, 0xd0636d2f01cf3a3eULL, 0x2f022773a766795dULL },</a>
<a name="140"><span class="lineNum"> 140 </span> : { &quot;\x77\xe9\xd7\x80\x0e\x3f\x5c\x43\xc8\xc2\x46\x39&quot;, 12, 0x6d259f5fef74f93eULL, 0x2f022773a766795dULL },</a>
<a name="141"><span class="lineNum"> 141 </span> : { 0, 0, 0, 0 }</a>
<a name="142"><span class="lineNum"> 142 </span> : };</a>
<a name="143"><span class="lineNum"> 143 </span> : </a>
<a name="144"><span class="lineNum"> 144 </span> : /**</a>
<a name="145"><span class="lineNum"> 145 </span> : * Test vectors for MurmorHash3_x86_128</a>
<a name="146"><span class="lineNum"> 146 </span> : */</a>
<a name="147"><span class="lineNum"> 147 </span> : static struct hash_test_vector TEST_MURMUR3[] = {</a>
<a name="148"><span class="lineNum"> 148 </span> : #include &quot;murmur3test.c&quot;</a>
<a name="149"><span class="lineNum"> 149 </span> : { 0, 0, { 0 }, { 0 } }</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> : * Test vectors for SpookyHash_128</a>
<a name="154"><span class="lineNum"> 154 </span> : */</a>
<a name="155"><span class="lineNum"> 155 </span> : static struct hash_test_vector TEST_SPOOKY2[] = {</a>
<a name="156"><span class="lineNum"> 156 </span> : #include &quot;spooky2test.c&quot;</a>
<a name="157"><span class="lineNum"> 157 </span> : { 0, 0, { 0 }, { 0 } }</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> : /**</a>
<a name="161"><span class="lineNum"> 161 </span> : * Test vectors for MetroHash_128_1</a>
<a name="162"><span class="lineNum"> 162 </span> : */</a>
<a name="163"><span class="lineNum"> 163 </span> : static struct hash_test_vector TEST_METRO[] = {</a>
<a name="164"><span class="lineNum"> 164 </span> : #include &quot;metrotest.c&quot;</a>
<a name="165"><span class="lineNum"> 165 </span> : { 0, 0, { 0 }, { 0 } }</a>
<a name="166"><span class="lineNum"> 166 </span> : };</a>
<a name="167"><span class="lineNum"> 167 </span> : </a>
<a name="168"><span class="lineNum"> 168 </span> : #define HASH_TEST_MAX 512 /* tests are never longer than 512 bytes */</a>
<a name="169"><span class="lineNum"> 169 </span> : </a>
<a name="170"><span class="lineNum"> 170 </span><span class="lineCov"> 1 : static void test_hash(void)</span></a>
<a name="171"><span class="lineNum"> 171 </span> : {</a>
<a name="172"><span class="lineNum"> 172 </span> : unsigned i;</a>
<a name="173"><span class="lineNum"> 173 </span> : unsigned char* seed_aligned;</a>
<a name="174"><span class="lineNum"> 174 </span> : void* seed_alloc;</a>
<a name="175"><span class="lineNum"> 175 </span> : unsigned char* buffer_aligned;</a>
<a name="176"><span class="lineNum"> 176 </span> : void* buffer_alloc;</a>
<a name="177"><span class="lineNum"> 177 </span> : </a>
<a name="178"><span class="lineNum"> 178 </span><span class="lineCov"> 1 : seed_aligned = malloc_nofail_align(HASH_MAX, &amp;seed_alloc);</span></a>
<a name="179"><span class="lineNum"> 179 </span><span class="lineCov"> 1 : buffer_aligned = malloc_nofail_align(HASH_TEST_MAX, &amp;buffer_alloc);</span></a>
<a name="180"><span class="lineNum"> 180 </span> : </a>
<a name="181"><span class="lineNum"> 181 </span><span class="lineCov"> 20 : for (i = 0; TEST_HASH32[i].data; ++i) {</span></a>
<a name="182"><span class="lineNum"> 182 </span> : uint32_t digest;</a>
<a name="183"><span class="lineNum"> 183 </span><span class="lineCov"> 19 : memcpy(buffer_aligned, TEST_HASH32[i].data, TEST_HASH32[i].len);</span></a>
<a name="184"><span class="lineNum"> 184 </span><span class="lineCov"> 19 : digest = tommy_hash_u32(TEST_HASH32[i].seed, buffer_aligned, TEST_HASH32[i].len);</span></a>
<a name="185"><span class="lineNum"> 185 </span><span class="lineCov"> 19 : if (digest != TEST_HASH32[i].digest) {</span></a>
<a name="186"><span class="lineNum"> 186 </span> : /* LCOV_EXCL_START */</a>
<a name="187"><span class="lineNum"> 187 </span> : log_fatal(&quot;Failed hash32 test\n&quot;);</a>
<a name="188"><span class="lineNum"> 188 </span> : exit(EXIT_FAILURE);</a>
<a name="189"><span class="lineNum"> 189 </span> : /* LCOV_EXCL_STOP */</a>
<a name="190"><span class="lineNum"> 190 </span> : }</a>
<a name="191"><span class="lineNum"> 191 </span> : }</a>
<a name="192"><span class="lineNum"> 192 </span> : </a>
<a name="193"><span class="lineNum"> 193 </span><span class="lineCov"> 24 : for (i = 0; TEST_STRHASH32[i].data; ++i) {</span></a>
<a name="194"><span class="lineNum"> 194 </span> : uint32_t digest;</a>
<a name="195"><span class="lineNum"> 195 </span><span class="lineCov"> 23 : memcpy(buffer_aligned, TEST_STRHASH32[i].data, strlen(TEST_STRHASH32[i].data) + 1);</span></a>
<a name="196"><span class="lineNum"> 196 </span><span class="lineCov"> 23 : digest = tommy_strhash_u32(TEST_STRHASH32[i].seed, buffer_aligned);</span></a>
<a name="197"><span class="lineNum"> 197 </span><span class="lineCov"> 23 : if (digest != TEST_STRHASH32[i].digest) {</span></a>
<a name="198"><span class="lineNum"> 198 </span> : /* LCOV_EXCL_START */</a>
<a name="199"><span class="lineNum"> 199 </span> : log_fatal(&quot;Failed strhash32 test\n&quot;);</a>
<a name="200"><span class="lineNum"> 200 </span> : exit(EXIT_FAILURE);</a>
<a name="201"><span class="lineNum"> 201 </span> : /* LCOV_EXCL_STOP */</a>
<a name="202"><span class="lineNum"> 202 </span> : }</a>
<a name="203"><span class="lineNum"> 203 </span> : }</a>
<a name="204"><span class="lineNum"> 204 </span> : </a>
<a name="205"><span class="lineNum"> 205 </span><span class="lineCov"> 20 : for (i = 0; TEST_HASH64[i].data; ++i) {</span></a>
<a name="206"><span class="lineNum"> 206 </span> : uint64_t digest;</a>
<a name="207"><span class="lineNum"> 207 </span><span class="lineCov"> 19 : memcpy(buffer_aligned, TEST_HASH64[i].data, TEST_HASH64[i].len);</span></a>
<a name="208"><span class="lineNum"> 208 </span><span class="lineCov"> 19 : digest = tommy_hash_u64(TEST_HASH64[i].seed, buffer_aligned, TEST_HASH64[i].len);</span></a>
<a name="209"><span class="lineNum"> 209 </span><span class="lineCov"> 19 : if (digest != TEST_HASH64[i].digest) {</span></a>
<a name="210"><span class="lineNum"> 210 </span> : /* LCOV_EXCL_START */</a>
<a name="211"><span class="lineNum"> 211 </span> : log_fatal(&quot;Failed hash64 test\n&quot;);</a>
<a name="212"><span class="lineNum"> 212 </span> : exit(EXIT_FAILURE);</a>
<a name="213"><span class="lineNum"> 213 </span> : /* LCOV_EXCL_STOP */</a>
<a name="214"><span class="lineNum"> 214 </span> : }</a>
<a name="215"><span class="lineNum"> 215 </span> : }</a>
<a name="216"><span class="lineNum"> 216 </span> : </a>
<a name="217"><span class="lineNum"> 217 </span> : </a>
<a name="218"><span class="lineNum"> 218 </span><span class="lineCov"> 264 : for (i = 0; TEST_MURMUR3[i].data; ++i) {</span></a>
<a name="219"><span class="lineNum"> 219 </span> : unsigned char digest[HASH_MAX];</a>
<a name="220"><span class="lineNum"> 220 </span><span class="lineCov"> 263 : memcpy(buffer_aligned, TEST_MURMUR3[i].data, TEST_MURMUR3[i].len);</span></a>
<a name="221"><span class="lineNum"> 221 </span><span class="lineCov"> 263 : memcpy(seed_aligned, TEST_MURMUR3[i].seed, HASH_MAX);</span></a>
<a name="222"><span class="lineNum"> 222 </span><span class="lineCov"> 263 : memhash(HASH_MURMUR3, seed_aligned, digest, buffer_aligned, TEST_MURMUR3[i].len);</span></a>
<a name="223"><span class="lineNum"> 223 </span><span class="lineCov"> 263 : if (memcmp(digest, TEST_MURMUR3[i].digest, HASH_MAX) != 0) {</span></a>
<a name="224"><span class="lineNum"> 224 </span> : /* LCOV_EXCL_START */</a>
<a name="225"><span class="lineNum"> 225 </span> : log_fatal(&quot;Failed Murmur3 test\n&quot;);</a>
<a name="226"><span class="lineNum"> 226 </span> : exit(EXIT_FAILURE);</a>
<a name="227"><span class="lineNum"> 227 </span> : /* LCOV_EXCL_STOP */</a>
<a name="228"><span class="lineNum"> 228 </span> : }</a>
<a name="229"><span class="lineNum"> 229 </span> : }</a>
<a name="230"><span class="lineNum"> 230 </span> : </a>
<a name="231"><span class="lineNum"> 231 </span><span class="lineCov"> 264 : for (i = 0; TEST_SPOOKY2[i].data; ++i) {</span></a>
<a name="232"><span class="lineNum"> 232 </span> : unsigned char digest[HASH_MAX];</a>
<a name="233"><span class="lineNum"> 233 </span><span class="lineCov"> 263 : memcpy(buffer_aligned, TEST_SPOOKY2[i].data, TEST_SPOOKY2[i].len);</span></a>
<a name="234"><span class="lineNum"> 234 </span><span class="lineCov"> 263 : memcpy(seed_aligned, TEST_SPOOKY2[i].seed, HASH_MAX);</span></a>
<a name="235"><span class="lineNum"> 235 </span><span class="lineCov"> 263 : memhash(HASH_SPOOKY2, seed_aligned, digest, buffer_aligned, TEST_SPOOKY2[i].len);</span></a>
<a name="236"><span class="lineNum"> 236 </span><span class="lineCov"> 263 : if (memcmp(digest, TEST_SPOOKY2[i].digest, HASH_MAX) != 0) {</span></a>
<a name="237"><span class="lineNum"> 237 </span> : /* LCOV_EXCL_START */</a>
<a name="238"><span class="lineNum"> 238 </span> : log_fatal(&quot;Failed Spooky2 test\n&quot;);</a>
<a name="239"><span class="lineNum"> 239 </span> : exit(EXIT_FAILURE);</a>
<a name="240"><span class="lineNum"> 240 </span> : /* LCOV_EXCL_STOP */</a>
<a name="241"><span class="lineNum"> 241 </span> : }</a>
<a name="242"><span class="lineNum"> 242 </span> : }</a>
<a name="243"><span class="lineNum"> 243 </span> : </a>
<a name="244"><span class="lineNum"> 244 </span><span class="lineCov"> 266 : for (i = 0; TEST_METRO[i].data; ++i) {</span></a>
<a name="245"><span class="lineNum"> 245 </span> : unsigned char digest[HASH_MAX];</a>
<a name="246"><span class="lineNum"> 246 </span><span class="lineCov"> 265 : memcpy(buffer_aligned, TEST_METRO[i].data, TEST_METRO[i].len);</span></a>
<a name="247"><span class="lineNum"> 247 </span><span class="lineCov"> 265 : memcpy(seed_aligned, TEST_METRO[i].seed, HASH_MAX);</span></a>
<a name="248"><span class="lineNum"> 248 </span><span class="lineCov"> 265 : memhash(HASH_METRO, seed_aligned, digest, buffer_aligned, TEST_METRO[i].len);</span></a>
<a name="249"><span class="lineNum"> 249 </span><span class="lineCov"> 265 : if (memcmp(digest, TEST_METRO[i].digest, HASH_MAX) != 0) {</span></a>
<a name="250"><span class="lineNum"> 250 </span> : /* LCOV_EXCL_START */</a>
<a name="251"><span class="lineNum"> 251 </span> : log_fatal(&quot;Failed Metro test\n&quot;);</a>
<a name="252"><span class="lineNum"> 252 </span> : exit(EXIT_FAILURE);</a>
<a name="253"><span class="lineNum"> 253 </span> : /* LCOV_EXCL_STOP */</a>
<a name="254"><span class="lineNum"> 254 </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"> 1 : free(buffer_alloc);</span></a>
<a name="258"><span class="lineNum"> 258 </span><span class="lineCov"> 1 : free(seed_alloc);</span></a>
<a name="259"><span class="lineNum"> 259 </span><span class="lineCov"> 1 : }</span></a>
<a name="260"><span class="lineNum"> 260 </span> : </a>
<a name="261"><span class="lineNum"> 261 </span> : struct crc_test_vector {</a>
<a name="262"><span class="lineNum"> 262 </span> : const char* data;</a>
<a name="263"><span class="lineNum"> 263 </span> : int len;</a>
<a name="264"><span class="lineNum"> 264 </span> : uint32_t digest;</a>
<a name="265"><span class="lineNum"> 265 </span> : };</a>
<a name="266"><span class="lineNum"> 266 </span> : </a>
<a name="267"><span class="lineNum"> 267 </span> : /**</a>
<a name="268"><span class="lineNum"> 268 </span> : * Test vectors for CRC32C (Castagnoli)</a>
<a name="269"><span class="lineNum"> 269 </span> : */</a>
<a name="270"><span class="lineNum"> 270 </span> : static struct crc_test_vector TEST_CRC32C[] = {</a>
<a name="271"><span class="lineNum"> 271 </span> : { &quot;&quot;, 0, 0 },</a>
<a name="272"><span class="lineNum"> 272 </span> : { &quot;\x61&quot;, 1, 0xc1d04330 },</a>
<a name="273"><span class="lineNum"> 273 </span> : { &quot;\x66\x6f\x6f&quot;, 3, 0xcfc4ae1d },</a>
<a name="274"><span class="lineNum"> 274 </span> : { &quot;\x68\x65\x6c\x6c\x6f\x20\x77\x6f\x72\x6c\x64&quot;, 11, 0xc99465aa },</a>
<a name="275"><span class="lineNum"> 275 </span> : { &quot;\x68\x65\x6c\x6c\x6f\x20&quot;, 6, 0x7e627e58 },</a>
<a name="276"><span class="lineNum"> 276 </span> : { &quot;\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00&quot;, 32, 0x8a9136aa },</a>
<a name="277"><span class="lineNum"> 277 </span> : { &quot;\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff&quot;, 32, 0x62a8ab43 },</a>
<a name="278"><span class="lineNum"> 278 </span> : { &quot;\x1f\x1e\x1d\x1c\x1b\x1a\x19\x18\x17\x16\x15\x14\x13\x12\x11\x10\x0f\x0e\x0d\x0c\x0b\x0a\x09\x08\x07\x06\x05\x04\x03\x02\x01\x00&quot;, 32, 0x113fdb5c },</a>
<a name="279"><span class="lineNum"> 279 </span> : { &quot;\x01\xc0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x14\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x14\x00\x00\x00\x18\x28\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00&quot;, 48, 0xd9963a56 },</a>
<a name="280"><span class="lineNum"> 280 </span> : { &quot;\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f\x10\x11\x12\x13\x14\x15\x16\x17\x18\x19\x1a\x1b\x1c\x1d\x1e\x1f&quot;, 32, 0x46dd794e },</a>
<a name="281"><span class="lineNum"> 281 </span> : { &quot;\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f\x10\x11\x12\x13\x14\x15\x16\x17\x18\x19\x1a\x1b\x1c\x1d\x1e\x1f\x20\x21\x22\x23\x24\x25\x26\x27\x28&quot;, 40, 0x0e2c157f },</a>
<a name="282"><span class="lineNum"> 282 </span> : { &quot;\x29\x2a\x2b\x2c\x2d\x2e\x2f\x30\x31\x32\x33\x34\x35\x36\x37\x38\x39\x3a\x3b\x3c\x3d\x3e\x3f\x40\x41\x42\x43\x44\x45\x46\x47\x48\x49\x4a\x4b\x4c\x4d\x4e\x4f\x50&quot;, 40, 0xe980ebf6 },</a>
<a name="283"><span class="lineNum"> 283 </span> : { &quot;\x51\x52\x53\x54\x55\x56\x57\x58\x59\x5a\x5b\x5c\x5d\x5e\x5f\x60\x61\x62\x63\x64\x65\x66\x67\x68\x69\x6a\x6b\x6c\x6d\x6e\x6f\x70\x71\x72\x73\x74\x75\x76\x77\x78&quot;, 40, 0xde74bded },</a>
<a name="284"><span class="lineNum"> 284 </span> : { &quot;\x79\x7a\x7b\x7c\x7d\x7e\x7f\x80\x81\x82\x83\x84\x85\x86\x87\x88\x89\x8a\x8b\x8c\x8d\x8e\x8f\x90\x91\x92\x93\x94\x95\x96\x97\x98\x99\x9a\x9b\x9c\x9d\x9e\x9f\xa0&quot;, 40, 0xd579c862 },</a>
<a name="285"><span class="lineNum"> 285 </span> : { &quot;\xa1\xa2\xa3\xa4\xa5\xa6\xa7\xa8\xa9\xaa\xab\xac\xad\xae\xaf\xb0\xb1\xb2\xb3\xb4\xb5\xb6\xb7\xb8\xb9\xba\xbb\xbc\xbd\xbe\xbf\xc0\xc1\xc2\xc3\xc4\xc5\xc6\xc7\xc8&quot;, 40, 0xba979ad0 },</a>
<a name="286"><span class="lineNum"> 286 </span> : { &quot;\xc9\xca\xcb\xcc\xcd\xce\xcf\xd0\xd1\xd2\xd3\xd4\xd5\xd6\xd7\xd8\xd9\xda\xdb\xdc\xdd\xde\xdf\xe0\xe1\xe2\xe3\xe4\xe5\xe6\xe7\xe8\xe9\xea\xeb\xec\xed\xee\xef\xf0&quot;, 40, 0x2b29d913 },</a>
<a name="287"><span class="lineNum"> 287 </span> : { &quot;\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f\x10\x11\x12\x13\x14\x15\x16\x17\x18\x19\x1a\x1b\x1c\x1d\x1e\x1f\x20\x21\x22\x23\x24\x25\x26\x27\x28\x29\x2a\x2b\x2c\x2d\x2e\x2f\x30\x31\x32\x33\x34\x35\x36\x37\x38\x39\x3a\x3b\x3c\x3d\x3e\x3f\x40\x41\x42\x43\x44\x45\x46\x47\x48\x49\x4a\x4b\x4c\x4d\x4e\x4f\x50\x51\x52\x53\x54\x55\x56\x57\x58\x59\x5a\x5b\x5c\x5d\x5e\x5f\x60\x61\x62\x63\x64\x65\x66\x67\x68\x69\x6a\x6b\x6c\x6d\x6e\x6f\x70\x71\x72\x73\x74\x75\x76\x77\x78\x79\x7a\x7b\x7c\x7d\x7e\x7f\x80\x81\x82\x83\x84\x85\x86\x87\x88\x89\x8a\x8b\x8c\x8d\x8e\x8f\x90\x91\x92\x93\x94\x95\x96\x97\x98\x99\x9a\x9b\x9c\x9d\x9e\x9f\xa0\xa1\xa2\xa3\xa4\xa5\xa6\xa7\xa8\xa9\xaa\xab\xac\xad\xae\xaf\xb0\xb1\xb2\xb3\xb4\xb5\xb6\xb7\xb8\xb9\xba\xbb\xbc\xbd\xbe\xbf\xc0\xc1\xc2\xc3\xc4\xc5\xc6\xc7\xc8\xc9\xca\xcb\xcc\xcd\xce\xcf\xd0\xd1\xd2\xd3\xd4\xd5\xd6\xd7\xd8\xd9\xda\xdb\xdc\xdd\xde\xdf\xe0\xe1\xe2\xe3\xe4\xe5\xe6\xe7\xe8\xe9\xea\xeb\xec\xed\xee\xef\xf0&quot;, 240, 0x24c5d375 },</a>
<a name="288"><span class="lineNum"> 288 </span> : { 0, 0, 0 }</a>
<a name="289"><span class="lineNum"> 289 </span> : };</a>
<a name="290"><span class="lineNum"> 290 </span> : </a>
<a name="291"><span class="lineNum"> 291 </span><span class="lineCov"> 1 : static void test_crc32c(void)</span></a>
<a name="292"><span class="lineNum"> 292 </span> : {</a>
<a name="293"><span class="lineNum"> 293 </span> : unsigned i;</a>
<a name="294"><span class="lineNum"> 294 </span> : </a>
<a name="295"><span class="lineNum"> 295 </span><span class="lineCov"> 18 : for (i = 0; TEST_CRC32C[i].data; ++i) {</span></a>
<a name="296"><span class="lineNum"> 296 </span> : uint32_t digest;</a>
<a name="297"><span class="lineNum"> 297 </span> : uint32_t digest_gen;</a>
<a name="298"><span class="lineNum"> 298 </span> : </a>
<a name="299"><span class="lineNum"> 299 </span><span class="lineCov"> 17 : digest = crc32c(0, (const unsigned char*)TEST_CRC32C[i].data, TEST_CRC32C[i].len);</span></a>
<a name="300"><span class="lineNum"> 300 </span><span class="lineCov"> 17 : digest_gen = crc32c_gen(0, (const unsigned char*)TEST_CRC32C[i].data, TEST_CRC32C[i].len);</span></a>
<a name="301"><span class="lineNum"> 301 </span> : </a>
<a name="302"><span class="lineNum"> 302 </span><span class="lineCov"> 17 : if (digest != TEST_CRC32C[i].digest || digest_gen != TEST_CRC32C[i].digest) {</span></a>
<a name="303"><span class="lineNum"> 303 </span> : /* LCOV_EXCL_START */</a>
<a name="304"><span class="lineNum"> 304 </span> : log_fatal(&quot;Failed CRC32C test\n&quot;);</a>
<a name="305"><span class="lineNum"> 305 </span> : exit(EXIT_FAILURE);</a>
<a name="306"><span class="lineNum"> 306 </span> : /* LCOV_EXCL_STOP */</a>
<a name="307"><span class="lineNum"> 307 </span> : }</a>
<a name="308"><span class="lineNum"> 308 </span> : }</a>
<a name="309"><span class="lineNum"> 309 </span><span class="lineCov"> 1 : }</span></a>
<a name="310"><span class="lineNum"> 310 </span> : </a>
<a name="311"><span class="lineNum"> 311 </span> : /**</a>
<a name="312"><span class="lineNum"> 312 </span> : * Size of tommy data structures.</a>
<a name="313"><span class="lineNum"> 313 </span> : */</a>
<a name="314"><span class="lineNum"> 314 </span> : #define TOMMY_SIZE 256</a>
<a name="315"><span class="lineNum"> 315 </span> : </a>
<a name="316"><span class="lineNum"> 316 </span><span class="lineCov"> 384 : static int tommy_test_search(const void* arg, const void* obj)</span></a>
<a name="317"><span class="lineNum"> 317 </span> : {</a>
<a name="318"><span class="lineNum"> 318 </span><span class="lineCov"> 384 : return arg != obj;</span></a>
<a name="319"><span class="lineNum"> 319 </span> : }</a>
<a name="320"><span class="lineNum"> 320 </span> : </a>
<a name="321"><span class="lineNum"> 321 </span><span class="lineCov"> 4324 : static int tommy_test_compare(const void* void_arg_a, const void* void_arg_b)</span></a>
<a name="322"><span class="lineNum"> 322 </span> : {</a>
<a name="323"><span class="lineNum"> 323 </span><span class="lineCov"> 4324 : if (void_arg_a &lt; void_arg_b)</span></a>
<a name="324"><span class="lineNum"> 324 </span><span class="lineCov"> 2007 : return -1;</span></a>
<a name="325"><span class="lineNum"> 325 </span><span class="lineCov"> 2317 : if (void_arg_a &gt; void_arg_b)</span></a>
<a name="326"><span class="lineNum"> 326 </span><span class="lineCov"> 2058 : return 1;</span></a>
<a name="327"><span class="lineNum"> 327 </span><span class="lineCov"> 259 : return 0;</span></a>
<a name="328"><span class="lineNum"> 328 </span> : }</a>
<a name="329"><span class="lineNum"> 329 </span> : </a>
<a name="330"><span class="lineNum"> 330 </span> : static unsigned tommy_test_foreach_count;</a>
<a name="331"><span class="lineNum"> 331 </span> : </a>
<a name="332"><span class="lineNum"> 332 </span><span class="lineCov"> 512 : static void tommy_test_foreach(void* obj)</span></a>
<a name="333"><span class="lineNum"> 333 </span> : {</a>
<a name="334"><span class="lineNum"> 334 </span> : (void)obj;</a>
<a name="335"><span class="lineNum"> 335 </span> : </a>
<a name="336"><span class="lineNum"> 336 </span><span class="lineCov"> 512 : ++tommy_test_foreach_count;</span></a>
<a name="337"><span class="lineNum"> 337 </span><span class="lineCov"> 512 : }</span></a>
<a name="338"><span class="lineNum"> 338 </span> : </a>
<a name="339"><span class="lineNum"> 339 </span><span class="lineCov"> 512 : static void tommy_test_foreach_arg(void* void_arg, void* obj)</span></a>
<a name="340"><span class="lineNum"> 340 </span> : {</a>
<a name="341"><span class="lineNum"> 341 </span><span class="lineCov"> 512 : unsigned* arg = void_arg;</span></a>
<a name="342"><span class="lineNum"> 342 </span> : </a>
<a name="343"><span class="lineNum"> 343 </span> : (void)obj;</a>
<a name="344"><span class="lineNum"> 344 </span> : </a>
<a name="345"><span class="lineNum"> 345 </span><span class="lineCov"> 512 : ++*arg;</span></a>
<a name="346"><span class="lineNum"> 346 </span><span class="lineCov"> 512 : }</span></a>
<a name="347"><span class="lineNum"> 347 </span> : </a>
<a name="348"><span class="lineNum"> 348 </span><span class="lineCov"> 1 : static void test_tommy(void)</span></a>
<a name="349"><span class="lineNum"> 349 </span> : {</a>
<a name="350"><span class="lineNum"> 350 </span> : tommy_array array;</a>
<a name="351"><span class="lineNum"> 351 </span> : tommy_arrayblkof arrayblkof;</a>
<a name="352"><span class="lineNum"> 352 </span> : tommy_list list;</a>
<a name="353"><span class="lineNum"> 353 </span> : tommy_hashdyn hashdyn;</a>
<a name="354"><span class="lineNum"> 354 </span> : tommy_tree tree;</a>
<a name="355"><span class="lineNum"> 355 </span> : tommy_node node[TOMMY_SIZE + 1];</a>
<a name="356"><span class="lineNum"> 356 </span> : unsigned i;</a>
<a name="357"><span class="lineNum"> 357 </span> : </a>
<a name="358"><span class="lineNum"> 358 </span><span class="lineCov"> 1 : tommy_array_init(&amp;array);</span></a>
<a name="359"><span class="lineNum"> 359 </span><span class="lineCov"> 1 : tommy_arrayblkof_init(&amp;arrayblkof, sizeof(unsigned));</span></a>
<a name="360"><span class="lineNum"> 360 </span> : </a>
<a name="361"><span class="lineNum"> 361 </span><span class="lineCov"> 257 : for (i = 0; i &lt; TOMMY_SIZE; ++i) {</span></a>
<a name="362"><span class="lineNum"> 362 </span><span class="lineCov"> 256 : tommy_array_insert(&amp;array, &amp;node[i]);</span></a>
<a name="363"><span class="lineNum"> 363 </span><span class="lineCov"> 256 : tommy_arrayblkof_grow(&amp;arrayblkof, i + 1);</span></a>
<a name="364"><span class="lineNum"> 364 </span><span class="lineCov"> 256 : *(unsigned*)tommy_arrayblkof_ref(&amp;arrayblkof, i) = i;</span></a>
<a name="365"><span class="lineNum"> 365 </span> : }</a>
<a name="366"><span class="lineNum"> 366 </span> : </a>
<a name="367"><span class="lineNum"> 367 </span><span class="lineCov"> 1 : tommy_array_grow(&amp;array, TOMMY_SIZE);</span></a>
<a name="368"><span class="lineNum"> 368 </span><span class="lineCov"> 1 : tommy_arrayblkof_grow(&amp;arrayblkof, TOMMY_SIZE);</span></a>
<a name="369"><span class="lineNum"> 369 </span> : </a>
<a name="370"><span class="lineNum"> 370 </span><span class="lineCov"> 1 : if (tommy_array_memory_usage(&amp;array) &lt; TOMMY_SIZE * sizeof(void*)) {</span></a>
<a name="371"><span class="lineNum"> 371 </span> : /* LCOV_EXCL_START */</a>
<a name="372"><span class="lineNum"> 372 </span> : goto bail;</a>
<a name="373"><span class="lineNum"> 373 </span> : /* LCOV_EXCL_STOP */</a>
<a name="374"><span class="lineNum"> 374 </span> : }</a>
<a name="375"><span class="lineNum"> 375 </span><span class="lineCov"> 1 : if (tommy_arrayblkof_memory_usage(&amp;arrayblkof) &lt; TOMMY_SIZE * sizeof(unsigned)) {</span></a>
<a name="376"><span class="lineNum"> 376 </span> : /* LCOV_EXCL_START */</a>
<a name="377"><span class="lineNum"> 377 </span> : goto bail;</a>
<a name="378"><span class="lineNum"> 378 </span> : /* LCOV_EXCL_STOP */</a>
<a name="379"><span class="lineNum"> 379 </span> : }</a>
<a name="380"><span class="lineNum"> 380 </span> : </a>
<a name="381"><span class="lineNum"> 381 </span><span class="lineCov"> 257 : for (i = 0; i &lt; TOMMY_SIZE; ++i) {</span></a>
<a name="382"><span class="lineNum"> 382 </span><span class="lineCov"> 256 : if (tommy_array_get(&amp;array, i) != &amp;node[i]) {</span></a>
<a name="383"><span class="lineNum"> 383 </span> : /* LCOV_EXCL_START */</a>
<a name="384"><span class="lineNum"> 384 </span> : goto bail;</a>
<a name="385"><span class="lineNum"> 385 </span> : /* LCOV_EXCL_STOP */</a>
<a name="386"><span class="lineNum"> 386 </span> : }</a>
<a name="387"><span class="lineNum"> 387 </span><span class="lineCov"> 256 : if (*(unsigned*)tommy_arrayblkof_ref(&amp;arrayblkof, i) != i) {</span></a>
<a name="388"><span class="lineNum"> 388 </span> : /* LCOV_EXCL_START */</a>
<a name="389"><span class="lineNum"> 389 </span> : goto bail;</a>
<a name="390"><span class="lineNum"> 390 </span> : /* LCOV_EXCL_STOP */</a>
<a name="391"><span class="lineNum"> 391 </span> : }</a>
<a name="392"><span class="lineNum"> 392 </span> : }</a>
<a name="393"><span class="lineNum"> 393 </span> : </a>
<a name="394"><span class="lineNum"> 394 </span><span class="lineCov"> 1 : tommy_arrayblkof_done(&amp;arrayblkof);</span></a>
<a name="395"><span class="lineNum"> 395 </span><span class="lineCov"> 1 : tommy_array_done(&amp;array);</span></a>
<a name="396"><span class="lineNum"> 396 </span> : </a>
<a name="397"><span class="lineNum"> 397 </span><span class="lineCov"> 1 : tommy_list_init(&amp;list);</span></a>
<a name="398"><span class="lineNum"> 398 </span> : </a>
<a name="399"><span class="lineNum"> 399 </span><span class="lineCov"> 1 : if (!tommy_list_empty(&amp;list)) {</span></a>
<a name="400"><span class="lineNum"> 400 </span> : /* LCOV_EXCL_START */</a>
<a name="401"><span class="lineNum"> 401 </span> : goto bail;</a>
<a name="402"><span class="lineNum"> 402 </span> : /* LCOV_EXCL_STOP */</a>
<a name="403"><span class="lineNum"> 403 </span> : }</a>
<a name="404"><span class="lineNum"> 404 </span> : </a>
<a name="405"><span class="lineNum"> 405 </span><span class="lineCov"> 1 : if (tommy_list_tail(&amp;list)) {</span></a>
<a name="406"><span class="lineNum"> 406 </span> : /* LCOV_EXCL_START */</a>
<a name="407"><span class="lineNum"> 407 </span> : goto bail;</a>
<a name="408"><span class="lineNum"> 408 </span> : /* LCOV_EXCL_STOP */</a>
<a name="409"><span class="lineNum"> 409 </span> : }</a>
<a name="410"><span class="lineNum"> 410 </span> : </a>
<a name="411"><span class="lineNum"> 411 </span><span class="lineCov"> 1 : if (tommy_list_head(&amp;list)) {</span></a>
<a name="412"><span class="lineNum"> 412 </span> : /* LCOV_EXCL_START */</a>
<a name="413"><span class="lineNum"> 413 </span> : goto bail;</a>
<a name="414"><span class="lineNum"> 414 </span> : /* LCOV_EXCL_STOP */</a>
<a name="415"><span class="lineNum"> 415 </span> : }</a>
<a name="416"><span class="lineNum"> 416 </span> : </a>
<a name="417"><span class="lineNum"> 417 </span><span class="lineCov"> 1 : tommy_list_insert_tail(&amp;list, &amp;node[0], &amp;node[0]);</span></a>
<a name="418"><span class="lineNum"> 418 </span> : </a>
<a name="419"><span class="lineNum"> 419 </span><span class="lineCov"> 1 : if (tommy_list_tail(&amp;list) != tommy_list_head(&amp;list)) {</span></a>
<a name="420"><span class="lineNum"> 420 </span> : /* LCOV_EXCL_START */</a>
<a name="421"><span class="lineNum"> 421 </span> : goto bail;</a>
<a name="422"><span class="lineNum"> 422 </span> : /* LCOV_EXCL_STOP */</a>
<a name="423"><span class="lineNum"> 423 </span> : }</a>
<a name="424"><span class="lineNum"> 424 </span> : </a>
<a name="425"><span class="lineNum"> 425 </span><span class="lineCov"> 1 : tommy_hashdyn_init(&amp;hashdyn);</span></a>
<a name="426"><span class="lineNum"> 426 </span> : </a>
<a name="427"><span class="lineNum"> 427 </span><span class="lineCov"> 257 : for (i = 0; i &lt; TOMMY_SIZE; ++i)</span></a>
<a name="428"><span class="lineNum"> 428 </span><span class="lineCov"> 256 : tommy_hashdyn_insert(&amp;hashdyn, &amp;node[i], &amp;node[i], i % 64);</span></a>
<a name="429"><span class="lineNum"> 429 </span> : </a>
<a name="430"><span class="lineNum"> 430 </span><span class="lineCov"> 1 : if (tommy_hashdyn_count(&amp;hashdyn) != TOMMY_SIZE) {</span></a>
<a name="431"><span class="lineNum"> 431 </span> : /* LCOV_EXCL_START */</a>
<a name="432"><span class="lineNum"> 432 </span> : goto bail;</a>
<a name="433"><span class="lineNum"> 433 </span> : /* LCOV_EXCL_STOP */</a>
<a name="434"><span class="lineNum"> 434 </span> : }</a>
<a name="435"><span class="lineNum"> 435 </span> : </a>
<a name="436"><span class="lineNum"> 436 </span><span class="lineCov"> 1 : if (tommy_hashdyn_memory_usage(&amp;hashdyn) &lt; TOMMY_SIZE * sizeof(tommy_node)) {</span></a>
<a name="437"><span class="lineNum"> 437 </span> : /* LCOV_EXCL_START */</a>
<a name="438"><span class="lineNum"> 438 </span> : goto bail;</a>
<a name="439"><span class="lineNum"> 439 </span> : /* LCOV_EXCL_STOP */</a>
<a name="440"><span class="lineNum"> 440 </span> : }</a>
<a name="441"><span class="lineNum"> 441 </span> : </a>
<a name="442"><span class="lineNum"> 442 </span><span class="lineCov"> 1 : tommy_test_foreach_count = 0;</span></a>
<a name="443"><span class="lineNum"> 443 </span><span class="lineCov"> 1 : tommy_hashdyn_foreach(&amp;hashdyn, tommy_test_foreach);</span></a>
<a name="444"><span class="lineNum"> 444 </span><span class="lineCov"> 1 : if (tommy_test_foreach_count != TOMMY_SIZE) {</span></a>
<a name="445"><span class="lineNum"> 445 </span> : /* LCOV_EXCL_START */</a>
<a name="446"><span class="lineNum"> 446 </span> : goto bail;</a>
<a name="447"><span class="lineNum"> 447 </span> : /* LCOV_EXCL_STOP */</a>
<a name="448"><span class="lineNum"> 448 </span> : }</a>
<a name="449"><span class="lineNum"> 449 </span> : </a>
<a name="450"><span class="lineNum"> 450 </span><span class="lineCov"> 1 : tommy_test_foreach_count = 0;</span></a>
<a name="451"><span class="lineNum"> 451 </span><span class="lineCov"> 1 : tommy_hashdyn_foreach_arg(&amp;hashdyn, tommy_test_foreach_arg, &amp;tommy_test_foreach_count);</span></a>
<a name="452"><span class="lineNum"> 452 </span><span class="lineCov"> 1 : if (tommy_test_foreach_count != TOMMY_SIZE) {</span></a>
<a name="453"><span class="lineNum"> 453 </span> : /* LCOV_EXCL_START */</a>
<a name="454"><span class="lineNum"> 454 </span> : goto bail;</a>
<a name="455"><span class="lineNum"> 455 </span> : /* LCOV_EXCL_STOP */</a>
<a name="456"><span class="lineNum"> 456 </span> : }</a>
<a name="457"><span class="lineNum"> 457 </span> : </a>
<a name="458"><span class="lineNum"> 458 </span><span class="lineCov"> 129 : for (i = 0; i &lt; TOMMY_SIZE / 2; ++i)</span></a>
<a name="459"><span class="lineNum"> 459 </span><span class="lineCov"> 128 : tommy_hashdyn_remove_existing(&amp;hashdyn, &amp;node[i]);</span></a>
<a name="460"><span class="lineNum"> 460 </span> : </a>
<a name="461"><span class="lineNum"> 461 </span><span class="lineCov"> 129 : for (i = 0; i &lt; TOMMY_SIZE / 2; ++i) {</span></a>
<a name="462"><span class="lineNum"> 462 </span><span class="lineCov"> 128 : if (tommy_hashdyn_remove(&amp;hashdyn, tommy_test_search, &amp;node[i], i % 64) != 0) {</span></a>
<a name="463"><span class="lineNum"> 463 </span> : /* LCOV_EXCL_START */</a>
<a name="464"><span class="lineNum"> 464 </span> : goto bail;</a>
<a name="465"><span class="lineNum"> 465 </span> : /* LCOV_EXCL_STOP */</a>
<a name="466"><span class="lineNum"> 466 </span> : }</a>
<a name="467"><span class="lineNum"> 467 </span> : }</a>
<a name="468"><span class="lineNum"> 468 </span><span class="lineCov"> 129 : for (i = TOMMY_SIZE / 2; i &lt; TOMMY_SIZE; ++i) {</span></a>
<a name="469"><span class="lineNum"> 469 </span><span class="lineCov"> 128 : if (tommy_hashdyn_remove(&amp;hashdyn, tommy_test_search, &amp;node[i], i % 64) == 0) {</span></a>
<a name="470"><span class="lineNum"> 470 </span> : /* LCOV_EXCL_START */</a>
<a name="471"><span class="lineNum"> 471 </span> : goto bail;</a>
<a name="472"><span class="lineNum"> 472 </span> : /* LCOV_EXCL_STOP */</a>
<a name="473"><span class="lineNum"> 473 </span> : }</a>
<a name="474"><span class="lineNum"> 474 </span> : }</a>
<a name="475"><span class="lineNum"> 475 </span> : </a>
<a name="476"><span class="lineNum"> 476 </span><span class="lineCov"> 1 : if (tommy_hashdyn_count(&amp;hashdyn) != 0) {</span></a>
<a name="477"><span class="lineNum"> 477 </span> : /* LCOV_EXCL_START */</a>
<a name="478"><span class="lineNum"> 478 </span> : goto bail;</a>
<a name="479"><span class="lineNum"> 479 </span> : /* LCOV_EXCL_STOP */</a>
<a name="480"><span class="lineNum"> 480 </span> : }</a>
<a name="481"><span class="lineNum"> 481 </span> : </a>
<a name="482"><span class="lineNum"> 482 </span><span class="lineCov"> 1 : tommy_hashdyn_done(&amp;hashdyn);</span></a>
<a name="483"><span class="lineNum"> 483 </span> : </a>
<a name="484"><span class="lineNum"> 484 </span><span class="lineCov"> 1 : tommy_tree_init(&amp;tree, tommy_test_compare);</span></a>
<a name="485"><span class="lineNum"> 485 </span> : </a>
<a name="486"><span class="lineNum"> 486 </span><span class="lineCov"> 257 : for (i = 0; i &lt; TOMMY_SIZE; ++i)</span></a>
<a name="487"><span class="lineNum"> 487 </span><span class="lineCov"> 256 : tommy_tree_insert(&amp;tree, &amp;node[i], (void*)(uintptr_t)(i + 1));</span></a>
<a name="488"><span class="lineNum"> 488 </span> : </a>
<a name="489"><span class="lineNum"> 489 </span> : /* try to insert a duplicate, count should not change */</a>
<a name="490"><span class="lineNum"> 490 </span><span class="lineCov"> 1 : tommy_tree_insert(&amp;tree, &amp;node[TOMMY_SIZE], (void*)(uintptr_t)1);</span></a>
<a name="491"><span class="lineNum"> 491 </span> : </a>
<a name="492"><span class="lineNum"> 492 </span><span class="lineCov"> 1 : if (tommy_tree_count(&amp;tree) != TOMMY_SIZE) {</span></a>
<a name="493"><span class="lineNum"> 493 </span> : /* LCOV_EXCL_START */</a>
<a name="494"><span class="lineNum"> 494 </span> : goto bail;</a>
<a name="495"><span class="lineNum"> 495 </span> : /* LCOV_EXCL_STOP */</a>
<a name="496"><span class="lineNum"> 496 </span> : }</a>
<a name="497"><span class="lineNum"> 497 </span><span class="lineCov"> 1 : if (tommy_tree_memory_usage(&amp;tree) &lt; TOMMY_SIZE * sizeof(tommy_node)) {</span></a>
<a name="498"><span class="lineNum"> 498 </span> : /* LCOV_EXCL_START */</a>
<a name="499"><span class="lineNum"> 499 </span> : goto bail;</a>
<a name="500"><span class="lineNum"> 500 </span> : /* LCOV_EXCL_STOP */</a>
<a name="501"><span class="lineNum"> 501 </span> : }</a>
<a name="502"><span class="lineNum"> 502 </span><span class="lineCov"> 1 : if (tommy_tree_search(&amp;tree, (void*)1) != (void*)1) {</span></a>
<a name="503"><span class="lineNum"> 503 </span> : /* LCOV_EXCL_START */</a>
<a name="504"><span class="lineNum"> 504 </span> : goto bail;</a>
<a name="505"><span class="lineNum"> 505 </span> : /* LCOV_EXCL_STOP */</a>
<a name="506"><span class="lineNum"> 506 </span> : }</a>
<a name="507"><span class="lineNum"> 507 </span><span class="lineCov"> 1 : if (tommy_tree_search(&amp;tree, (void*)-1) != 0) {</span></a>
<a name="508"><span class="lineNum"> 508 </span> : /* LCOV_EXCL_START */</a>
<a name="509"><span class="lineNum"> 509 </span> : goto bail;</a>
<a name="510"><span class="lineNum"> 510 </span> : /* LCOV_EXCL_STOP */</a>
<a name="511"><span class="lineNum"> 511 </span> : }</a>
<a name="512"><span class="lineNum"> 512 </span><span class="lineCov"> 1 : if (tommy_tree_search_compare(&amp;tree, tommy_test_compare, (void*)1) != (void*)1) {</span></a>
<a name="513"><span class="lineNum"> 513 </span> : /* LCOV_EXCL_START */</a>
<a name="514"><span class="lineNum"> 514 </span> : goto bail;</a>
<a name="515"><span class="lineNum"> 515 </span> : /* LCOV_EXCL_STOP */</a>
<a name="516"><span class="lineNum"> 516 </span> : }</a>
<a name="517"><span class="lineNum"> 517 </span><span class="lineCov"> 1 : if (tommy_tree_search_compare(&amp;tree, tommy_test_compare, (void*)-1) != 0) {</span></a>
<a name="518"><span class="lineNum"> 518 </span> : /* LCOV_EXCL_START */</a>
<a name="519"><span class="lineNum"> 519 </span> : goto bail;</a>
<a name="520"><span class="lineNum"> 520 </span> : /* LCOV_EXCL_STOP */</a>
<a name="521"><span class="lineNum"> 521 </span> : }</a>
<a name="522"><span class="lineNum"> 522 </span> : </a>
<a name="523"><span class="lineNum"> 523 </span><span class="lineCov"> 1 : tommy_test_foreach_count = 0;</span></a>
<a name="524"><span class="lineNum"> 524 </span><span class="lineCov"> 1 : tommy_tree_foreach(&amp;tree, tommy_test_foreach);</span></a>
<a name="525"><span class="lineNum"> 525 </span><span class="lineCov"> 1 : if (tommy_test_foreach_count != TOMMY_SIZE) {</span></a>
<a name="526"><span class="lineNum"> 526 </span> : /* LCOV_EXCL_START */</a>
<a name="527"><span class="lineNum"> 527 </span> : goto bail;</a>
<a name="528"><span class="lineNum"> 528 </span> : /* LCOV_EXCL_STOP */</a>
<a name="529"><span class="lineNum"> 529 </span> : }</a>
<a name="530"><span class="lineNum"> 530 </span> : </a>
<a name="531"><span class="lineNum"> 531 </span><span class="lineCov"> 1 : tommy_test_foreach_count = 0;</span></a>
<a name="532"><span class="lineNum"> 532 </span><span class="lineCov"> 1 : tommy_tree_foreach_arg(&amp;tree, tommy_test_foreach_arg, &amp;tommy_test_foreach_count);</span></a>
<a name="533"><span class="lineNum"> 533 </span><span class="lineCov"> 1 : if (tommy_test_foreach_count != TOMMY_SIZE) {</span></a>
<a name="534"><span class="lineNum"> 534 </span> : /* LCOV_EXCL_START */</a>
<a name="535"><span class="lineNum"> 535 </span> : goto bail;</a>
<a name="536"><span class="lineNum"> 536 </span> : /* LCOV_EXCL_STOP */</a>
<a name="537"><span class="lineNum"> 537 </span> : }</a>
<a name="538"><span class="lineNum"> 538 </span> : </a>
<a name="539"><span class="lineNum"> 539 </span><span class="lineCov"> 129 : for (i = 0; i &lt; TOMMY_SIZE / 2; ++i)</span></a>
<a name="540"><span class="lineNum"> 540 </span><span class="lineCov"> 128 : tommy_tree_remove_existing(&amp;tree, &amp;node[i]);</span></a>
<a name="541"><span class="lineNum"> 541 </span> : </a>
<a name="542"><span class="lineNum"> 542 </span><span class="lineCov"> 129 : for (i = 0; i &lt; TOMMY_SIZE / 2; ++i) {</span></a>
<a name="543"><span class="lineNum"> 543 </span><span class="lineCov"> 128 : if (tommy_tree_remove(&amp;tree, (void*)(uintptr_t)(i + 1)) != 0) {</span></a>
<a name="544"><span class="lineNum"> 544 </span> : /* LCOV_EXCL_START */</a>
<a name="545"><span class="lineNum"> 545 </span> : goto bail;</a>
<a name="546"><span class="lineNum"> 546 </span> : /* LCOV_EXCL_STOP */</a>
<a name="547"><span class="lineNum"> 547 </span> : }</a>
<a name="548"><span class="lineNum"> 548 </span> : }</a>
<a name="549"><span class="lineNum"> 549 </span> : </a>
<a name="550"><span class="lineNum"> 550 </span><span class="lineCov"> 129 : for (i = TOMMY_SIZE / 2; i &lt; TOMMY_SIZE; ++i) {</span></a>
<a name="551"><span class="lineNum"> 551 </span><span class="lineCov"> 128 : if (tommy_tree_remove(&amp;tree, (void*)(uintptr_t)(i + 1)) == 0) {</span></a>
<a name="552"><span class="lineNum"> 552 </span> : /* LCOV_EXCL_START */</a>
<a name="553"><span class="lineNum"> 553 </span> : goto bail;</a>
<a name="554"><span class="lineNum"> 554 </span> : /* LCOV_EXCL_STOP */</a>
<a name="555"><span class="lineNum"> 555 </span> : }</a>
<a name="556"><span class="lineNum"> 556 </span> : }</a>
<a name="557"><span class="lineNum"> 557 </span> : </a>
<a name="558"><span class="lineNum"> 558 </span><span class="lineCov"> 1 : if (tommy_tree_count(&amp;tree) != 0) {</span></a>
<a name="559"><span class="lineNum"> 559 </span> : /* LCOV_EXCL_START */</a>
<a name="560"><span class="lineNum"> 560 </span> : goto bail;</a>
<a name="561"><span class="lineNum"> 561 </span> : /* LCOV_EXCL_STOP */</a>
<a name="562"><span class="lineNum"> 562 </span> : }</a>
<a name="563"><span class="lineNum"> 563 </span> : </a>
<a name="564"><span class="lineNum"> 564 </span><span class="lineCov"> 1 : return;</span></a>
<a name="565"><span class="lineNum"> 565 </span><span class="lineNoCov"> 0 : bail:</span></a>
<a name="566"><span class="lineNum"> 566 </span> : /* LCOV_EXCL_START */</a>
<a name="567"><span class="lineNum"> 567 </span> : log_fatal(&quot;Failed tommy test\n&quot;);</a>
<a name="568"><span class="lineNum"> 568 </span> : exit(EXIT_FAILURE);</a>
<a name="569"><span class="lineNum"> 569 </span> : /* LCOV_EXCL_STOP */</a>
<a name="570"><span class="lineNum"> 570 </span> : }</a>
<a name="571"><span class="lineNum"> 571 </span> : </a>
<a name="572"><span class="lineNum"> 572 </span><span class="lineCov"> 1 : void selftest(void)</span></a>
<a name="573"><span class="lineNum"> 573 </span> : {</a>
<a name="574"><span class="lineNum"> 574 </span><span class="lineCov"> 1 : log_tag(&quot;selftest:\n&quot;);</span></a>
<a name="575"><span class="lineNum"> 575 </span><span class="lineCov"> 1 : log_flush();</span></a>
<a name="576"><span class="lineNum"> 576 </span> : </a>
<a name="577"><span class="lineNum"> 577 </span><span class="lineCov"> 1 : msg_progress(&quot;Self test...\n&quot;);</span></a>
<a name="578"><span class="lineNum"> 578 </span> : </a>
<a name="579"><span class="lineNum"> 579 </span> : /* large file check */</a>
<a name="580"><span class="lineNum"> 580 </span> : if (sizeof(off_t) &lt; sizeof(uint64_t)) {</a>
<a name="581"><span class="lineNum"> 581 </span> : /* LCOV_EXCL_START */</a>
<a name="582"><span class="lineNum"> 582 </span> : log_fatal(&quot;Missing support for large files\n&quot;);</a>
<a name="583"><span class="lineNum"> 583 </span> : exit(EXIT_FAILURE);</a>
<a name="584"><span class="lineNum"> 584 </span> : /* LCOV_EXCL_STOP */</a>
<a name="585"><span class="lineNum"> 585 </span> : }</a>
<a name="586"><span class="lineNum"> 586 </span> : </a>
<a name="587"><span class="lineNum"> 587 </span><span class="lineCov"> 1 : test_hash();</span></a>
<a name="588"><span class="lineNum"> 588 </span><span class="lineCov"> 1 : test_crc32c();</span></a>
<a name="589"><span class="lineNum"> 589 </span><span class="lineCov"> 1 : test_tommy();</span></a>
<a name="590"><span class="lineNum"> 590 </span><span class="lineCov"> 1 : if (raid_selftest() != 0) {</span></a>
<a name="591"><span class="lineNum"> 591 </span> : /* LCOV_EXCL_START */</a>
<a name="592"><span class="lineNum"> 592 </span> : log_fatal(&quot;Failed SELF test\n&quot;);</a>
<a name="593"><span class="lineNum"> 593 </span> : exit(EXIT_FAILURE);</a>
<a name="594"><span class="lineNum"> 594 </span> : /* LCOV_EXCL_STOP */</a>
<a name="595"><span class="lineNum"> 595 </span> : }</a>
<a name="596"><span class="lineNum"> 596 </span><span class="lineCov"> 1 : if (raid_test_sort() != 0) {</span></a>
<a name="597"><span class="lineNum"> 597 </span> : /* LCOV_EXCL_START */</a>
<a name="598"><span class="lineNum"> 598 </span> : log_fatal(&quot;Failed SORT test\n&quot;);</a>
<a name="599"><span class="lineNum"> 599 </span> : exit(EXIT_FAILURE);</a>
<a name="600"><span class="lineNum"> 600 </span> : /* LCOV_EXCL_STOP */</a>
<a name="601"><span class="lineNum"> 601 </span> : }</a>
<a name="602"><span class="lineNum"> 602 </span><span class="lineCov"> 1 : if (raid_test_insert() != 0) {</span></a>
<a name="603"><span class="lineNum"> 603 </span> : /* LCOV_EXCL_START */</a>
<a name="604"><span class="lineNum"> 604 </span> : log_fatal(&quot;Failed INSERT test\n&quot;);</a>
<a name="605"><span class="lineNum"> 605 </span> : exit(EXIT_FAILURE);</a>
<a name="606"><span class="lineNum"> 606 </span> : /* LCOV_EXCL_STOP */</a>
<a name="607"><span class="lineNum"> 607 </span> : }</a>
<a name="608"><span class="lineNum"> 608 </span><span class="lineCov"> 1 : if (raid_test_combo() != 0) {</span></a>
<a name="609"><span class="lineNum"> 609 </span> : /* LCOV_EXCL_START */</a>
<a name="610"><span class="lineNum"> 610 </span> : log_fatal(&quot;Failed COMBO test\n&quot;);</a>
<a name="611"><span class="lineNum"> 611 </span> : exit(EXIT_FAILURE);</a>
<a name="612"><span class="lineNum"> 612 </span> : /* LCOV_EXCL_STOP */</a>
<a name="613"><span class="lineNum"> 613 </span> : }</a>
<a name="614"><span class="lineNum"> 614 </span><span class="lineCov"> 1 : if (raid_test_par(RAID_MODE_VANDERMONDE, 32, 256) != 0) {</span></a>
<a name="615"><span class="lineNum"> 615 </span> : /* LCOV_EXCL_START */</a>
<a name="616"><span class="lineNum"> 616 </span> : log_fatal(&quot;Failed GEN Vandermonde test\n&quot;);</a>
<a name="617"><span class="lineNum"> 617 </span> : exit(EXIT_FAILURE);</a>
<a name="618"><span class="lineNum"> 618 </span> : /* LCOV_EXCL_STOP */</a>
<a name="619"><span class="lineNum"> 619 </span> : }</a>
<a name="620"><span class="lineNum"> 620 </span><span class="lineCov"> 1 : if (raid_test_rec(RAID_MODE_VANDERMONDE, 12, 256) != 0) {</span></a>
<a name="621"><span class="lineNum"> 621 </span> : /* LCOV_EXCL_START */</a>
<a name="622"><span class="lineNum"> 622 </span> : log_fatal(&quot;Failed REC Vandermonde test\n&quot;);</a>
<a name="623"><span class="lineNum"> 623 </span> : exit(EXIT_FAILURE);</a>
<a name="624"><span class="lineNum"> 624 </span> : /* LCOV_EXCL_STOP */</a>
<a name="625"><span class="lineNum"> 625 </span> : }</a>
<a name="626"><span class="lineNum"> 626 </span><span class="lineCov"> 1 : if (raid_test_par(RAID_MODE_CAUCHY, 32, 256) != 0) {</span></a>
<a name="627"><span class="lineNum"> 627 </span> : /* LCOV_EXCL_START */</a>
<a name="628"><span class="lineNum"> 628 </span> : log_fatal(&quot;Failed GEN Cauchy test\n&quot;);</a>
<a name="629"><span class="lineNum"> 629 </span> : exit(EXIT_FAILURE);</a>
<a name="630"><span class="lineNum"> 630 </span> : /* LCOV_EXCL_STOP */</a>
<a name="631"><span class="lineNum"> 631 </span> : }</a>
<a name="632"><span class="lineNum"> 632 </span><span class="lineCov"> 1 : if (raid_test_rec(RAID_MODE_CAUCHY, 12, 256) != 0) {</span></a>
<a name="633"><span class="lineNum"> 633 </span> : /* LCOV_EXCL_START */</a>
<a name="634"><span class="lineNum"> 634 </span> : log_fatal(&quot;Failed REC Cauchy test\n&quot;);</a>
<a name="635"><span class="lineNum"> 635 </span> : exit(EXIT_FAILURE);</a>
<a name="636"><span class="lineNum"> 636 </span> : /* LCOV_EXCL_STOP */</a>
<a name="637"><span class="lineNum"> 637 </span> : }</a>
<a name="638"><span class="lineNum"> 638 </span><span class="lineCov"> 1 : if (raid_test_par(RAID_MODE_CAUCHY, 1, 256) != 0) {</span></a>
<a name="639"><span class="lineNum"> 639 </span> : /* LCOV_EXCL_START */</a>
<a name="640"><span class="lineNum"> 640 </span> : log_fatal(&quot;Failed GEN Cauchy test single data disk\n&quot;);</a>
<a name="641"><span class="lineNum"> 641 </span> : exit(EXIT_FAILURE);</a>
<a name="642"><span class="lineNum"> 642 </span> : /* LCOV_EXCL_STOP */</a>
<a name="643"><span class="lineNum"> 643 </span> : }</a>
<a name="644"><span class="lineNum"> 644 </span><span class="lineCov"> 1 : }</span></a>
<a name="645"><span class="lineNum"> 645 </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>