snapraid/cov/cmdline/elem.c.gcov.html
Andrea Mazzoleni a53ac4a175 Auto update
2026-03-15 18:52:43 +01:00

1669 lines
186 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/elem.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> - elem.c<span style="font-size: 80%;"> (source / <a href="elem.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">667</td>
<td class="headerCovTableEntry">702</td>
<td class="headerCovTableEntryHi">95.0 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2026-03-15 15:58:19</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">72</td>
<td class="headerCovTableEntry">74</td>
<td class="headerCovTableEntryHi">97.3 %</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;elem.h&quot;</a>
<a name="21"><span class="lineNum"> 21 </span> : #include &quot;support.h&quot;</a>
<a name="22"><span class="lineNum"> 22 </span> : #include &quot;state.h&quot;</a>
<a name="23"><span class="lineNum"> 23 </span> : #include &quot;util.h&quot;</a>
<a name="24"><span class="lineNum"> 24 </span> : </a>
<a name="25"><span class="lineNum"> 25 </span> : /****************************************************************************/</a>
<a name="26"><span class="lineNum"> 26 </span> : /* snapraid */</a>
<a name="27"><span class="lineNum"> 27 </span> : </a>
<a name="28"><span class="lineNum"> 28 </span> : int BLOCK_HASH_SIZE = HASH_MAX;</a>
<a name="29"><span class="lineNum"> 29 </span> : </a>
<a name="30"><span class="lineNum"> 30 </span><span class="lineCov"> 1667 : struct snapraid_content* content_alloc(const char* path, uint64_t dev)</span></a>
<a name="31"><span class="lineNum"> 31 </span> : {</a>
<a name="32"><span class="lineNum"> 32 </span> : struct snapraid_content* content;</a>
<a name="33"><span class="lineNum"> 33 </span> : </a>
<a name="34"><span class="lineNum"> 34 </span><span class="lineCov"> 1667 : content = malloc_nofail(sizeof(struct snapraid_content));</span></a>
<a name="35"><span class="lineNum"> 35 </span><span class="lineCov"> 1667 : pathimport(content-&gt;content, sizeof(content-&gt;content), path);</span></a>
<a name="36"><span class="lineNum"> 36 </span><span class="lineCov"> 1667 : content-&gt;device = dev;</span></a>
<a name="37"><span class="lineNum"> 37 </span> : </a>
<a name="38"><span class="lineNum"> 38 </span><span class="lineCov"> 1667 : return content;</span></a>
<a name="39"><span class="lineNum"> 39 </span> : }</a>
<a name="40"><span class="lineNum"> 40 </span> : </a>
<a name="41"><span class="lineNum"> 41 </span><span class="lineCov"> 1612 : void content_free(struct snapraid_content* content)</span></a>
<a name="42"><span class="lineNum"> 42 </span> : {</a>
<a name="43"><span class="lineNum"> 43 </span><span class="lineCov"> 1612 : free(content);</span></a>
<a name="44"><span class="lineNum"> 44 </span><span class="lineCov"> 1612 : }</span></a>
<a name="45"><span class="lineNum"> 45 </span> : </a>
<a name="46"><span class="lineNum"> 46 </span><span class="lineCov"> 671 : struct snapraid_filter* filter_alloc_file(int direction, const char* root, const char* pattern)</span></a>
<a name="47"><span class="lineNum"> 47 </span> : {</a>
<a name="48"><span class="lineNum"> 48 </span> : struct snapraid_filter* filter;</a>
<a name="49"><span class="lineNum"> 49 </span> : char* i;</a>
<a name="50"><span class="lineNum"> 50 </span> : char* first;</a>
<a name="51"><span class="lineNum"> 51 </span> : char* last;</a>
<a name="52"><span class="lineNum"> 52 </span> : int token_is_valid;</a>
<a name="53"><span class="lineNum"> 53 </span> : int token_is_filled;</a>
<a name="54"><span class="lineNum"> 54 </span> : </a>
<a name="55"><span class="lineNum"> 55 </span><span class="lineCov"> 671 : filter = malloc_nofail(sizeof(struct snapraid_filter));</span></a>
<a name="56"><span class="lineNum"> 56 </span><span class="lineCov"> 671 : pathimport(filter-&gt;pattern, sizeof(filter-&gt;pattern), pattern);</span></a>
<a name="57"><span class="lineNum"> 57 </span><span class="lineCov"> 671 : pathimport(filter-&gt;root, sizeof(filter-&gt;root), root);</span></a>
<a name="58"><span class="lineNum"> 58 </span><span class="lineCov"> 671 : filter-&gt;direction = direction;</span></a>
<a name="59"><span class="lineNum"> 59 </span> : </a>
<a name="60"><span class="lineNum"> 60 </span> : /* find first and last slash */</a>
<a name="61"><span class="lineNum"> 61 </span><span class="lineCov"> 671 : first = 0;</span></a>
<a name="62"><span class="lineNum"> 62 </span><span class="lineCov"> 671 : last = 0;</span></a>
<a name="63"><span class="lineNum"> 63 </span> : </a>
<a name="64"><span class="lineNum"> 64 </span> : /* reject invalid tokens, like &quot;&lt;empty&gt;&quot;, &quot;.&quot;, &quot;..&quot; and more dots */</a>
<a name="65"><span class="lineNum"> 65 </span><span class="lineCov"> 671 : token_is_valid = 0;</span></a>
<a name="66"><span class="lineNum"> 66 </span><span class="lineCov"> 671 : token_is_filled = 0;</span></a>
<a name="67"><span class="lineNum"> 67 </span><span class="lineCov"> 7618 : for (i = filter-&gt;pattern; *i; ++i) {</span></a>
<a name="68"><span class="lineNum"> 68 </span><span class="lineCov"> 6948 : if (*i == '/') {</span></a>
<a name="69"><span class="lineNum"> 69 </span> : /* reject invalid tokens, but accept an empty one as first */</a>
<a name="70"><span class="lineNum"> 70 </span><span class="lineCov"> 90 : if (!token_is_valid &amp;&amp; (first != 0 || token_is_filled)) {</span></a>
<a name="71"><span class="lineNum"> 71 </span><span class="lineCov"> 1 : free(filter);</span></a>
<a name="72"><span class="lineNum"> 72 </span><span class="lineCov"> 1 : return 0;</span></a>
<a name="73"><span class="lineNum"> 73 </span> : }</a>
<a name="74"><span class="lineNum"> 74 </span><span class="lineCov"> 89 : token_is_valid = 0;</span></a>
<a name="75"><span class="lineNum"> 75 </span><span class="lineCov"> 89 : token_is_filled = 0;</span></a>
<a name="76"><span class="lineNum"> 76 </span> : </a>
<a name="77"><span class="lineNum"> 77 </span> : /* update slash position */</a>
<a name="78"><span class="lineNum"> 78 </span><span class="lineCov"> 89 : if (!first)</span></a>
<a name="79"><span class="lineNum"> 79 </span><span class="lineCov"> 51 : first = i;</span></a>
<a name="80"><span class="lineNum"> 80 </span><span class="lineCov"> 89 : last = i;</span></a>
<a name="81"><span class="lineNum"> 81 </span><span class="lineCov"> 6858 : } else if (*i != '.') {</span></a>
<a name="82"><span class="lineNum"> 82 </span><span class="lineCov"> 6274 : token_is_valid = 1;</span></a>
<a name="83"><span class="lineNum"> 83 </span><span class="lineCov"> 6274 : token_is_filled = 1;</span></a>
<a name="84"><span class="lineNum"> 84 </span> : } else {</a>
<a name="85"><span class="lineNum"> 85 </span><span class="lineCov"> 584 : token_is_filled = 1;</span></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> : /* reject invalid tokens, but accept an empty one as last, but not if it's the only one */</a>
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 670 : if (!token_is_valid &amp;&amp; (first == 0 || token_is_filled)) {</span></a>
<a name="91"><span class="lineNum"> 91 </span><span class="lineCov"> 1 : free(filter);</span></a>
<a name="92"><span class="lineNum"> 92 </span><span class="lineCov"> 1 : return 0;</span></a>
<a name="93"><span class="lineNum"> 93 </span> : }</a>
<a name="94"><span class="lineNum"> 94 </span> : </a>
<a name="95"><span class="lineNum"> 95 </span> : /* it's a file filter */</a>
<a name="96"><span class="lineNum"> 96 </span><span class="lineCov"> 669 : filter-&gt;is_disk = 0;</span></a>
<a name="97"><span class="lineNum"> 97 </span> : </a>
<a name="98"><span class="lineNum"> 98 </span><span class="lineCov"> 669 : if (first == 0) {</span></a>
<a name="99"><span class="lineNum"> 99 </span> : /* no slash */</a>
<a name="100"><span class="lineNum"> 100 </span><span class="lineCov"> 618 : filter-&gt;is_abs = 0;</span></a>
<a name="101"><span class="lineNum"> 101 </span><span class="lineCov"> 618 : filter-&gt;is_dir = 0;</span></a>
<a name="102"><span class="lineNum"> 102 </span> : } else {</a>
<a name="103"><span class="lineNum"> 103 </span><span class="lineCov"> 51 : if (first == filter-&gt;pattern) {</span></a>
<a name="104"><span class="lineNum"> 104 </span> : /* slash at the start */</a>
<a name="105"><span class="lineNum"> 105 </span><span class="lineCov"> 38 : filter-&gt;is_abs = 1;</span></a>
<a name="106"><span class="lineNum"> 106 </span> : } else {</a>
<a name="107"><span class="lineNum"> 107 </span> : /* no slash at the start */</a>
<a name="108"><span class="lineNum"> 108 </span><span class="lineCov"> 13 : filter-&gt;is_abs = 0;</span></a>
<a name="109"><span class="lineNum"> 109 </span> : }</a>
<a name="110"><span class="lineNum"> 110 </span><span class="lineCov"> 51 : if (last[1] == 0) {</span></a>
<a name="111"><span class="lineNum"> 111 </span> : /* slash at the end */</a>
<a name="112"><span class="lineNum"> 112 </span><span class="lineCov"> 50 : filter-&gt;is_dir = 1;</span></a>
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 50 : last[0] = 0; /* clear the slash */</span></a>
<a name="114"><span class="lineNum"> 114 </span> : } else {</a>
<a name="115"><span class="lineNum"> 115 </span> : /* no slash at the end */</a>
<a name="116"><span class="lineNum"> 116 </span><span class="lineCov"> 1 : filter-&gt;is_dir = 0;</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> : </a>
<a name="120"><span class="lineNum"> 120 </span><span class="lineCov"> 669 : return filter;</span></a>
<a name="121"><span class="lineNum"> 121 </span> : }</a>
<a name="122"><span class="lineNum"> 122 </span> : </a>
<a name="123"><span class="lineNum"> 123 </span><span class="lineCov"> 11 : struct snapraid_filter* filter_alloc_disk(int direction, const char* pattern)</span></a>
<a name="124"><span class="lineNum"> 124 </span> : {</a>
<a name="125"><span class="lineNum"> 125 </span> : struct snapraid_filter* filter;</a>
<a name="126"><span class="lineNum"> 126 </span> : </a>
<a name="127"><span class="lineNum"> 127 </span><span class="lineCov"> 11 : filter = malloc_nofail(sizeof(struct snapraid_filter));</span></a>
<a name="128"><span class="lineNum"> 128 </span><span class="lineCov"> 11 : pathimport(filter-&gt;pattern, sizeof(filter-&gt;pattern), pattern);</span></a>
<a name="129"><span class="lineNum"> 129 </span><span class="lineCov"> 11 : filter-&gt;direction = direction;</span></a>
<a name="130"><span class="lineNum"> 130 </span> : </a>
<a name="131"><span class="lineNum"> 131 </span> : /* it's a disk filter */</a>
<a name="132"><span class="lineNum"> 132 </span><span class="lineCov"> 11 : filter-&gt;is_disk = 1;</span></a>
<a name="133"><span class="lineNum"> 133 </span><span class="lineCov"> 11 : filter-&gt;is_abs = 0;</span></a>
<a name="134"><span class="lineNum"> 134 </span><span class="lineCov"> 11 : filter-&gt;is_dir = 0;</span></a>
<a name="135"><span class="lineNum"> 135 </span> : </a>
<a name="136"><span class="lineNum"> 136 </span> : /* no slash allowed in disk names */</a>
<a name="137"><span class="lineNum"> 137 </span><span class="lineCov"> 11 : if (strchr(filter-&gt;pattern, '/') != 0) {</span></a>
<a name="138"><span class="lineNum"> 138 </span> : /* LCOV_EXCL_START */</a>
<a name="139"><span class="lineNum"> 139 </span> : free(filter);</a>
<a name="140"><span class="lineNum"> 140 </span> : return 0;</a>
<a name="141"><span class="lineNum"> 141 </span> : /* LCOV_EXCL_STOP */</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><span class="lineCov"> 11 : return filter;</span></a>
<a name="145"><span class="lineNum"> 145 </span> : }</a>
<a name="146"><span class="lineNum"> 146 </span> : </a>
<a name="147"><span class="lineNum"> 147 </span><span class="lineCov"> 660 : void filter_free(void* filter)</span></a>
<a name="148"><span class="lineNum"> 148 </span> : {</a>
<a name="149"><span class="lineNum"> 149 </span><span class="lineCov"> 660 : free(filter);</span></a>
<a name="150"><span class="lineNum"> 150 </span><span class="lineCov"> 660 : }</span></a>
<a name="151"><span class="lineNum"> 151 </span> : </a>
<a name="152"><span class="lineNum"> 152 </span><span class="lineCov"> 124753 : const char* filter_type(struct snapraid_filter* filter, char* out, size_t out_size)</span></a>
<a name="153"><span class="lineNum"> 153 </span> : {</a>
<a name="154"><span class="lineNum"> 154 </span> : const char* direction;</a>
<a name="155"><span class="lineNum"> 155 </span> : </a>
<a name="156"><span class="lineNum"> 156 </span><span class="lineCov"> 124753 : if (filter-&gt;direction &lt; 0)</span></a>
<a name="157"><span class="lineNum"> 157 </span><span class="lineCov"> 124468 : direction = &quot;exclude&quot;;</span></a>
<a name="158"><span class="lineNum"> 158 </span> : else</a>
<a name="159"><span class="lineNum"> 159 </span><span class="lineCov"> 285 : direction = &quot;include&quot;;</span></a>
<a name="160"><span class="lineNum"> 160 </span> : </a>
<a name="161"><span class="lineNum"> 161 </span><span class="lineCov"> 124753 : if (filter-&gt;is_disk)</span></a>
<a name="162"><span class="lineNum"> 162 </span><span class="lineNoCov"> 0 : pathprint(out, out_size, &quot;%s %s:&quot;, direction, filter-&gt;pattern);</span></a>
<a name="163"><span class="lineNum"> 163 </span><span class="lineCov"> 124753 : else if (filter-&gt;is_dir)</span></a>
<a name="164"><span class="lineNum"> 164 </span><span class="lineCov"> 18 : pathprint(out, out_size, &quot;%s %s/&quot;, direction, filter-&gt;pattern);</span></a>
<a name="165"><span class="lineNum"> 165 </span> : else</a>
<a name="166"><span class="lineNum"> 166 </span><span class="lineCov"> 124735 : pathprint(out, out_size, &quot;%s %s&quot;, direction, filter-&gt;pattern);</span></a>
<a name="167"><span class="lineNum"> 167 </span> : </a>
<a name="168"><span class="lineNum"> 168 </span><span class="lineCov"> 124753 : return out;</span></a>
<a name="169"><span class="lineNum"> 169 </span> : }</a>
<a name="170"><span class="lineNum"> 170 </span> : </a>
<a name="171"><span class="lineNum"> 171 </span> : /**</a>
<a name="172"><span class="lineNum"> 172 </span> : * Apply a filter to the specified path</a>
<a name="173"><span class="lineNum"> 173 </span> : *</a>
<a name="174"><span class="lineNum"> 174 </span> : * @param filter The filter to apply.</a>
<a name="175"><span class="lineNum"> 175 </span> : * @param reason Assign to it the filter that caused rejection.</a>
<a name="176"><span class="lineNum"> 176 </span> : * @param path The path to filter.</a>
<a name="177"><span class="lineNum"> 177 </span> : * @param is_dir if the path refers to a directory, otherwise to a file.</a>
<a name="178"><span class="lineNum"> 178 </span> : * @return &lt; 0 if the path is excluded, &gt; 0 if the path is included, 0 if the filter doesn't apply.</a>
<a name="179"><span class="lineNum"> 179 </span> : */</a>
<a name="180"><span class="lineNum"> 180 </span><span class="lineCov"> 6802995 : static int filter_apply(struct snapraid_filter* filter, struct snapraid_filter** reason, const char* path, int is_dir)</span></a>
<a name="181"><span class="lineNum"> 181 </span> : {</a>
<a name="182"><span class="lineNum"> 182 </span><span class="lineCov"> 6802995 : if (filter-&gt;root[0] != 0) { /* if it's a local filter */</span></a>
<a name="183"><span class="lineNum"> 183 </span><span class="lineCov"> 127913 : if (!path_is_root_of(filter-&gt;root, path)) /* applies it only if it matches the root */</span></a>
<a name="184"><span class="lineNum"> 184 </span><span class="lineCov"> 68719 : return 0;</span></a>
<a name="185"><span class="lineNum"> 185 </span> : /* advance the path to compare to make it local */</a>
<a name="186"><span class="lineNum"> 186 </span><span class="lineCov"> 59194 : path += strlen(filter-&gt;root);</span></a>
<a name="187"><span class="lineNum"> 187 </span> : }</a>
<a name="188"><span class="lineNum"> 188 </span> : </a>
<a name="189"><span class="lineNum"> 189 </span> : /* match dirs with dirs and files with files */</a>
<a name="190"><span class="lineNum"> 190 </span><span class="lineCov"> 6734276 : if (filter-&gt;is_dir &amp;&amp; !is_dir)</span></a>
<a name="191"><span class="lineNum"> 191 </span><span class="lineCov"> 119172 : return 0;</span></a>
<a name="192"><span class="lineNum"> 192 </span><span class="lineCov"> 6615104 : if (!filter-&gt;is_dir &amp;&amp; is_dir)</span></a>
<a name="193"><span class="lineNum"> 193 </span><span class="lineCov"> 6510 : return 0;</span></a>
<a name="194"><span class="lineNum"> 194 </span> : </a>
<a name="195"><span class="lineNum"> 195 </span><span class="lineCov"> 6608594 : int ret = 0;</span></a>
<a name="196"><span class="lineNum"> 196 </span> : </a>
<a name="197"><span class="lineNum"> 197 </span><span class="lineCov"> 6608594 : if (filter-&gt;is_abs) {</span></a>
<a name="198"><span class="lineNum"> 198 </span> : /* skip initial slash, as always missing in the path */</a>
<a name="199"><span class="lineNum"> 199 </span><span class="lineCov"> 6035 : if (wnmatch(filter-&gt;pattern + 1, path) == 0)</span></a>
<a name="200"><span class="lineNum"> 200 </span><span class="lineNoCov"> 0 : ret = filter-&gt;direction;</span></a>
<a name="201"><span class="lineNum"> 201 </span> : } else {</a>
<a name="202"><span class="lineNum"> 202 </span> : /* the path is relative, first try to match from the root */</a>
<a name="203"><span class="lineNum"> 203 </span><span class="lineCov"> 6602559 : if (wnmatch(filter-&gt;pattern, path) == 0) {</span></a>
<a name="204"><span class="lineNum"> 204 </span><span class="lineCov"> 234 : ret = filter-&gt;direction;</span></a>
<a name="205"><span class="lineNum"> 205 </span> : } else {</a>
<a name="206"><span class="lineNum"> 206 </span> : /* then try to match after all the / presents */</a>
<a name="207"><span class="lineNum"> 207 </span><span class="lineCov"> 6602325 : char* slash = strchr(path, '/');</span></a>
<a name="208"><span class="lineNum"> 208 </span><span class="lineCov"> 13013557 : while (slash) {</span></a>
<a name="209"><span class="lineNum"> 209 </span><span class="lineCov"> 6535151 : if (wnmatch(filter-&gt;pattern, slash + 1) == 0) {</span></a>
<a name="210"><span class="lineNum"> 210 </span><span class="lineCov"> 123919 : ret = filter-&gt;direction;</span></a>
<a name="211"><span class="lineNum"> 211 </span><span class="lineCov"> 123919 : break;</span></a>
<a name="212"><span class="lineNum"> 212 </span> : }</a>
<a name="213"><span class="lineNum"> 213 </span> : </a>
<a name="214"><span class="lineNum"> 214 </span><span class="lineCov"> 6411232 : slash = strchr(slash + 1, '/');</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> : </a>
<a name="219"><span class="lineNum"> 219 </span><span class="lineCov"> 6608594 : if (reason != 0 &amp;&amp; ret &lt; 0)</span></a>
<a name="220"><span class="lineNum"> 220 </span><span class="lineCov"> 124153 : *reason = filter;</span></a>
<a name="221"><span class="lineNum"> 221 </span> : </a>
<a name="222"><span class="lineNum"> 222 </span><span class="lineCov"> 6608594 : return ret;</span></a>
<a name="223"><span class="lineNum"> 223 </span> : }</a>
<a name="224"><span class="lineNum"> 224 </span> : </a>
<a name="225"><span class="lineNum"> 225 </span> : /**</a>
<a name="226"><span class="lineNum"> 226 </span> : * Apply a list of filter to a specific disk/sub path</a>
<a name="227"><span class="lineNum"> 227 </span> : *</a>
<a name="228"><span class="lineNum"> 228 </span> : * @param filterlist The list of filter to apply</a>
<a name="229"><span class="lineNum"> 229 </span> : * @param reason Assign to it the filter that caused rejection.</a>
<a name="230"><span class="lineNum"> 230 </span> : * @param disk The disk that contain the path</a>
<a name="231"><span class="lineNum"> 231 </span> : * @param sub The path in the disk</a>
<a name="232"><span class="lineNum"> 232 </span> : * @param is_dir If the path refers to a directory, otherwise it's a file</a>
<a name="233"><span class="lineNum"> 233 </span> : * @param is_def_include If no filter apply, if by default force the inclusion. Used to include directory by default.</a>
<a name="234"><span class="lineNum"> 234 </span> : * @return &lt; 0 if the path is excluded, == 0 if the path is included.</a>
<a name="235"><span class="lineNum"> 235 </span> : */</a>
<a name="236"><span class="lineNum"> 236 </span> : </a>
<a name="237"><span class="lineNum"> 237 </span><span class="lineCov"> 4767601 : static int filter_element(tommy_list* filterlist, struct snapraid_filter** reason, const char* disk, const char* sub, int is_dir, int is_def_include)</span></a>
<a name="238"><span class="lineNum"> 238 </span> : {</a>
<a name="239"><span class="lineNum"> 239 </span> : tommy_node* i;</a>
<a name="240"><span class="lineNum"> 240 </span> : </a>
<a name="241"><span class="lineNum"> 241 </span> : /**</a>
<a name="242"><span class="lineNum"> 242 </span> : * The rule is that the latest filter defines the behaviour of paths</a>
<a name="243"><span class="lineNum"> 243 </span> : * that doesn't match any filter.</a>
<a name="244"><span class="lineNum"> 244 </span> : *</a>
<a name="245"><span class="lineNum"> 245 </span> : * If the latest filter is an 'exclusion' filter, the default is to include.</a>
<a name="246"><span class="lineNum"> 246 </span> : * If the latest filter is an 'inclusion' filter, the default is to exclude.</a>
<a name="247"><span class="lineNum"> 247 </span> : * If there are no filter, the default is to include.</a>
<a name="248"><span class="lineNum"> 248 </span> : */</a>
<a name="249"><span class="lineNum"> 249 </span><span class="lineCov"> 4767601 : int default_direction = 1;</span></a>
<a name="250"><span class="lineNum"> 250 </span> : </a>
<a name="251"><span class="lineNum"> 251 </span> : /* for each filter */</a>
<a name="252"><span class="lineNum"> 252 </span><span class="lineCov"> 11564912 : for (i = tommy_list_head(filterlist); i != 0; i = i-&gt;next) {</span></a>
<a name="253"><span class="lineNum"> 253 </span> : int ret;</a>
<a name="254"><span class="lineNum"> 254 </span><span class="lineCov"> 6930144 : struct snapraid_filter* filter = i-&gt;data;</span></a>
<a name="255"><span class="lineNum"> 255 </span> : </a>
<a name="256"><span class="lineNum"> 256 </span><span class="lineCov"> 6930144 : if (filter-&gt;is_disk) {</span></a>
<a name="257"><span class="lineNum"> 257 </span><span class="lineCov"> 127149 : if (wnmatch(filter-&gt;pattern, disk) == 0) {</span></a>
<a name="258"><span class="lineNum"> 258 </span><span class="lineCov"> 8680 : ret = filter-&gt;direction;</span></a>
<a name="259"><span class="lineNum"> 259 </span> : } else {</a>
<a name="260"><span class="lineNum"> 260 </span><span class="lineCov"> 118469 : ret = 0;</span></a>
<a name="261"><span class="lineNum"> 261 </span> : }</a>
<a name="262"><span class="lineNum"> 262 </span><span class="lineCov"> 127149 : if (reason != 0 &amp;&amp; ret &lt; 0)</span></a>
<a name="263"><span class="lineNum"> 263 </span><span class="lineNoCov"> 0 : *reason = filter;</span></a>
<a name="264"><span class="lineNum"> 264 </span> : } else {</a>
<a name="265"><span class="lineNum"> 265 </span><span class="lineCov"> 6802995 : ret = filter_apply(filter, reason, sub, is_dir);</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><span class="lineCov"> 6930144 : if (ret &gt; 0) {</span></a>
<a name="269"><span class="lineNum"> 269 </span> : /* include the file */</a>
<a name="270"><span class="lineNum"> 270 </span><span class="lineCov"> 8680 : return 0;</span></a>
<a name="271"><span class="lineNum"> 271 </span><span class="lineCov"> 6921464 : } else if (ret &lt; 0) {</span></a>
<a name="272"><span class="lineNum"> 272 </span> : /* exclude the file */</a>
<a name="273"><span class="lineNum"> 273 </span><span class="lineCov"> 124153 : return -1;</span></a>
<a name="274"><span class="lineNum"> 274 </span> : } else {</a>
<a name="275"><span class="lineNum"> 275 </span> : /* default is opposite of the last filter */</a>
<a name="276"><span class="lineNum"> 276 </span><span class="lineCov"> 6797311 : default_direction = -filter-&gt;direction;</span></a>
<a name="277"><span class="lineNum"> 277 </span><span class="lineCov"> 6797311 : if (reason != 0 &amp;&amp; default_direction &lt; 0)</span></a>
<a name="278"><span class="lineNum"> 278 </span><span class="lineCov"> 3271968 : *reason = filter;</span></a>
<a name="279"><span class="lineNum"> 279 </span> : /* continue with the next one */</a>
<a name="280"><span class="lineNum"> 280 </span> : }</a>
<a name="281"><span class="lineNum"> 281 </span> : }</a>
<a name="282"><span class="lineNum"> 282 </span> : </a>
<a name="283"><span class="lineNum"> 283 </span> : /* directories are always included by default, otherwise we cannot apply rules */</a>
<a name="284"><span class="lineNum"> 284 </span> : /* to the contained files */</a>
<a name="285"><span class="lineNum"> 285 </span><span class="lineCov"> 4634768 : if (is_def_include)</span></a>
<a name="286"><span class="lineNum"> 286 </span><span class="lineCov"> 4679 : return 0;</span></a>
<a name="287"><span class="lineNum"> 287 </span> : </a>
<a name="288"><span class="lineNum"> 288 </span> : /* files are excluded/included depending of the last rule processed */</a>
<a name="289"><span class="lineNum"> 289 </span><span class="lineCov"> 4630089 : if (default_direction &lt; 0)</span></a>
<a name="290"><span class="lineNum"> 290 </span><span class="lineCov"> 77759 : return -1;</span></a>
<a name="291"><span class="lineNum"> 291 </span> : </a>
<a name="292"><span class="lineNum"> 292 </span><span class="lineCov"> 4552330 : return 0;</span></a>
<a name="293"><span class="lineNum"> 293 </span> : }</a>
<a name="294"><span class="lineNum"> 294 </span> : </a>
<a name="295"><span class="lineNum"> 295 </span><span class="lineCov"> 4762873 : int filter_path(tommy_list* filterlist, struct snapraid_filter** reason, const char* disk, const char* sub)</span></a>
<a name="296"><span class="lineNum"> 296 </span> : {</a>
<a name="297"><span class="lineNum"> 297 </span><span class="lineCov"> 4762873 : return filter_element(filterlist, reason, disk, sub, 0, 0);</span></a>
<a name="298"><span class="lineNum"> 298 </span> : }</a>
<a name="299"><span class="lineNum"> 299 </span> : </a>
<a name="300"><span class="lineNum"> 300 </span><span class="lineCov"> 4679 : int filter_subdir(tommy_list* filterlist, struct snapraid_filter** reason, const char* disk, const char* sub)</span></a>
<a name="301"><span class="lineNum"> 301 </span> : {</a>
<a name="302"><span class="lineNum"> 302 </span><span class="lineCov"> 4679 : return filter_element(filterlist, reason, disk, sub, 1, 1);</span></a>
<a name="303"><span class="lineNum"> 303 </span> : }</a>
<a name="304"><span class="lineNum"> 304 </span> : </a>
<a name="305"><span class="lineNum"> 305 </span><span class="lineCov"> 49 : int filter_emptydir(tommy_list* filterlist, struct snapraid_filter** reason, const char* disk, const char* sub)</span></a>
<a name="306"><span class="lineNum"> 306 </span> : {</a>
<a name="307"><span class="lineNum"> 307 </span><span class="lineCov"> 49 : return filter_element(filterlist, reason, disk, sub, 1, 0);</span></a>
<a name="308"><span class="lineNum"> 308 </span> : }</a>
<a name="309"><span class="lineNum"> 309 </span> : </a>
<a name="310"><span class="lineNum"> 310 </span><span class="lineCov"> 77590 : int filter_existence(int filter_missing, const char* dir, const char* sub)</span></a>
<a name="311"><span class="lineNum"> 311 </span> : {</a>
<a name="312"><span class="lineNum"> 312 </span> : char path[PATH_MAX];</a>
<a name="313"><span class="lineNum"> 313 </span> : struct stat st;</a>
<a name="314"><span class="lineNum"> 314 </span> : </a>
<a name="315"><span class="lineNum"> 315 </span><span class="lineCov"> 77590 : if (!filter_missing)</span></a>
<a name="316"><span class="lineNum"> 316 </span><span class="lineCov"> 31984 : return 0;</span></a>
<a name="317"><span class="lineNum"> 317 </span> : </a>
<a name="318"><span class="lineNum"> 318 </span> : /* we directly check if in the disk the file is present or not */</a>
<a name="319"><span class="lineNum"> 319 </span><span class="lineCov"> 45606 : pathprint(path, sizeof(path), &quot;%s%s&quot;, dir, sub);</span></a>
<a name="320"><span class="lineNum"> 320 </span> : </a>
<a name="321"><span class="lineNum"> 321 </span><span class="lineCov"> 45606 : if (lstat(path, &amp;st) != 0) {</span></a>
<a name="322"><span class="lineNum"> 322 </span> : /* if the file doesn't exist, we don't filter it out */</a>
<a name="323"><span class="lineNum"> 323 </span><span class="lineCov"> 5018 : if (errno == ENOENT)</span></a>
<a name="324"><span class="lineNum"> 324 </span><span class="lineCov"> 5018 : return 0;</span></a>
<a name="325"><span class="lineNum"> 325 </span> : /* LCOV_EXCL_START */</a>
<a name="326"><span class="lineNum"> 326 </span> : log_fatal(errno, &quot;Error in stat file '%s'. %s.\n&quot;, path, strerror(errno));</a>
<a name="327"><span class="lineNum"> 327 </span> : exit(EXIT_FAILURE);</a>
<a name="328"><span class="lineNum"> 328 </span> : /* LCOV_EXCL_STOP */</a>
<a name="329"><span class="lineNum"> 329 </span> : }</a>
<a name="330"><span class="lineNum"> 330 </span> : </a>
<a name="331"><span class="lineNum"> 331 </span> : /* the file is present, so we filter it out */</a>
<a name="332"><span class="lineNum"> 332 </span><span class="lineCov"> 40588 : return 1;</span></a>
<a name="333"><span class="lineNum"> 333 </span> : }</a>
<a name="334"><span class="lineNum"> 334 </span> : </a>
<a name="335"><span class="lineNum"> 335 </span><span class="lineCov"> 35970 : int filter_correctness(int filter_error, tommy_arrayblkof* infoarr, struct snapraid_disk* disk, struct snapraid_file* file)</span></a>
<a name="336"><span class="lineNum"> 336 </span> : {</a>
<a name="337"><span class="lineNum"> 337 </span> : unsigned i;</a>
<a name="338"><span class="lineNum"> 338 </span> : </a>
<a name="339"><span class="lineNum"> 339 </span><span class="lineCov"> 35970 : if (!filter_error)</span></a>
<a name="340"><span class="lineNum"> 340 </span><span class="lineCov"> 13422 : return 0;</span></a>
<a name="341"><span class="lineNum"> 341 </span> : </a>
<a name="342"><span class="lineNum"> 342 </span> : /* check each block of the file */</a>
<a name="343"><span class="lineNum"> 343 </span><span class="lineCov"> 60656 : for (i = 0; i &lt; file-&gt;blockmax; ++i) {</span></a>
<a name="344"><span class="lineNum"> 344 </span><span class="lineCov"> 46389 : block_off_t parity_pos = fs_file2par_get(disk, file, i);</span></a>
<a name="345"><span class="lineNum"> 345 </span><span class="lineCov"> 46389 : snapraid_info info = info_get(infoarr, parity_pos);</span></a>
<a name="346"><span class="lineNum"> 346 </span> : </a>
<a name="347"><span class="lineNum"> 347 </span> : /* if the file has a bad block, don't exclude it */</a>
<a name="348"><span class="lineNum"> 348 </span><span class="lineCov"> 46389 : if (info_get_bad(info))</span></a>
<a name="349"><span class="lineNum"> 349 </span><span class="lineCov"> 8281 : return 0;</span></a>
<a name="350"><span class="lineNum"> 350 </span> : }</a>
<a name="351"><span class="lineNum"> 351 </span> : </a>
<a name="352"><span class="lineNum"> 352 </span> : /* the file is correct, so we filter it out */</a>
<a name="353"><span class="lineNum"> 353 </span><span class="lineCov"> 14267 : return 1;</span></a>
<a name="354"><span class="lineNum"> 354 </span> : }</a>
<a name="355"><span class="lineNum"> 355 </span> : </a>
<a name="356"><span class="lineNum"> 356 </span><span class="lineCov"> 3335517 : int filter_content(tommy_list* contentlist, const char* path)</span></a>
<a name="357"><span class="lineNum"> 357 </span> : {</a>
<a name="358"><span class="lineNum"> 358 </span> : tommy_node* i;</a>
<a name="359"><span class="lineNum"> 359 </span> : </a>
<a name="360"><span class="lineNum"> 360 </span><span class="lineCov"> 21542896 : for (i = tommy_list_head(contentlist); i != 0; i = i-&gt;next) {</span></a>
<a name="361"><span class="lineNum"> 361 </span><span class="lineCov"> 18207379 : struct snapraid_content* content = i-&gt;data;</span></a>
<a name="362"><span class="lineNum"> 362 </span> : char tmp[PATH_MAX];</a>
<a name="363"><span class="lineNum"> 363 </span> : </a>
<a name="364"><span class="lineNum"> 364 </span><span class="lineCov"> 18207379 : if (pathcmp(content-&gt;content, path) == 0)</span></a>
<a name="365"><span class="lineNum"> 365 </span><span class="lineNoCov"> 0 : return -1;</span></a>
<a name="366"><span class="lineNum"> 366 </span> : </a>
<a name="367"><span class="lineNum"> 367 </span> : /* exclude also the &quot;.tmp&quot; copy used to save it */</a>
<a name="368"><span class="lineNum"> 368 </span><span class="lineCov"> 18207379 : pathprint(tmp, sizeof(tmp), &quot;%s.tmp&quot;, content-&gt;content);</span></a>
<a name="369"><span class="lineNum"> 369 </span><span class="lineCov"> 18207379 : if (pathcmp(tmp, path) == 0)</span></a>
<a name="370"><span class="lineNum"> 370 </span><span class="lineNoCov"> 0 : return -1;</span></a>
<a name="371"><span class="lineNum"> 371 </span> : </a>
<a name="372"><span class="lineNum"> 372 </span> : /* exclude also the &quot;.lock&quot; file */</a>
<a name="373"><span class="lineNum"> 373 </span><span class="lineCov"> 18207379 : pathprint(tmp, sizeof(tmp), &quot;%s.lock&quot;, content-&gt;content);</span></a>
<a name="374"><span class="lineNum"> 374 </span><span class="lineCov"> 18207379 : if (pathcmp(tmp, path) == 0)</span></a>
<a name="375"><span class="lineNum"> 375 </span><span class="lineNoCov"> 0 : return -1;</span></a>
<a name="376"><span class="lineNum"> 376 </span> : }</a>
<a name="377"><span class="lineNum"> 377 </span> : </a>
<a name="378"><span class="lineNum"> 378 </span><span class="lineCov"> 3335517 : return 0;</span></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"> 3923858 : struct snapraid_file* file_alloc(unsigned block_size, const char* sub, data_off_t size, uint64_t mtime_sec, int mtime_nsec, uint64_t inode, uint64_t physical)</span></a>
<a name="382"><span class="lineNum"> 382 </span> : {</a>
<a name="383"><span class="lineNum"> 383 </span> : struct snapraid_file* file;</a>
<a name="384"><span class="lineNum"> 384 </span> : block_off_t i;</a>
<a name="385"><span class="lineNum"> 385 </span> : </a>
<a name="386"><span class="lineNum"> 386 </span><span class="lineCov"> 3923858 : file = malloc_nofail(sizeof(struct snapraid_file));</span></a>
<a name="387"><span class="lineNum"> 387 </span><span class="lineCov"> 3923858 : file-&gt;sub = strdup_nofail(sub);</span></a>
<a name="388"><span class="lineNum"> 388 </span><span class="lineCov"> 3923858 : file-&gt;size = size;</span></a>
<a name="389"><span class="lineNum"> 389 </span><span class="lineCov"> 3923858 : file-&gt;blockmax = (size + block_size - 1) / block_size;</span></a>
<a name="390"><span class="lineNum"> 390 </span><span class="lineCov"> 3923858 : file-&gt;mtime_sec = mtime_sec;</span></a>
<a name="391"><span class="lineNum"> 391 </span><span class="lineCov"> 3923858 : file-&gt;mtime_nsec = mtime_nsec;</span></a>
<a name="392"><span class="lineNum"> 392 </span><span class="lineCov"> 3923858 : file-&gt;inode = inode;</span></a>
<a name="393"><span class="lineNum"> 393 </span><span class="lineCov"> 3923858 : file-&gt;physical = physical;</span></a>
<a name="394"><span class="lineNum"> 394 </span><span class="lineCov"> 3923858 : file-&gt;flag = 0;</span></a>
<a name="395"><span class="lineNum"> 395 </span><span class="lineCov"> 3923858 : file-&gt;blockvec = malloc_nofail(file-&gt;blockmax * block_sizeof());</span></a>
<a name="396"><span class="lineNum"> 396 </span> : </a>
<a name="397"><span class="lineNum"> 397 </span><span class="lineCov"> 13629556 : for (i = 0; i &lt; file-&gt;blockmax; ++i) {</span></a>
<a name="398"><span class="lineNum"> 398 </span><span class="lineCov"> 9705698 : struct snapraid_block* block = file_block(file, i);</span></a>
<a name="399"><span class="lineNum"> 399 </span><span class="lineCov"> 9705698 : block_state_set(block, BLOCK_STATE_CHG);</span></a>
<a name="400"><span class="lineNum"> 400 </span><span class="lineCov"> 9705698 : hash_invalid_set(block-&gt;hash);</span></a>
<a name="401"><span class="lineNum"> 401 </span> : }</a>
<a name="402"><span class="lineNum"> 402 </span> : </a>
<a name="403"><span class="lineNum"> 403 </span><span class="lineCov"> 3923858 : return file;</span></a>
<a name="404"><span class="lineNum"> 404 </span> : }</a>
<a name="405"><span class="lineNum"> 405 </span> : </a>
<a name="406"><span class="lineNum"> 406 </span><span class="lineCov"> 22637 : struct snapraid_file* file_dup(struct snapraid_file* copy)</span></a>
<a name="407"><span class="lineNum"> 407 </span> : {</a>
<a name="408"><span class="lineNum"> 408 </span> : struct snapraid_file* file;</a>
<a name="409"><span class="lineNum"> 409 </span> : block_off_t i;</a>
<a name="410"><span class="lineNum"> 410 </span> : </a>
<a name="411"><span class="lineNum"> 411 </span><span class="lineCov"> 22637 : file = malloc_nofail(sizeof(struct snapraid_file));</span></a>
<a name="412"><span class="lineNum"> 412 </span><span class="lineCov"> 22637 : file-&gt;sub = strdup_nofail(copy-&gt;sub);</span></a>
<a name="413"><span class="lineNum"> 413 </span><span class="lineCov"> 22637 : file-&gt;size = copy-&gt;size;</span></a>
<a name="414"><span class="lineNum"> 414 </span><span class="lineCov"> 22637 : file-&gt;blockmax = copy-&gt;blockmax;</span></a>
<a name="415"><span class="lineNum"> 415 </span><span class="lineCov"> 22637 : file-&gt;mtime_sec = copy-&gt;mtime_sec;</span></a>
<a name="416"><span class="lineNum"> 416 </span><span class="lineCov"> 22637 : file-&gt;mtime_nsec = copy-&gt;mtime_nsec;</span></a>
<a name="417"><span class="lineNum"> 417 </span><span class="lineCov"> 22637 : file-&gt;inode = copy-&gt;inode;</span></a>
<a name="418"><span class="lineNum"> 418 </span><span class="lineCov"> 22637 : file-&gt;physical = copy-&gt;physical;</span></a>
<a name="419"><span class="lineNum"> 419 </span><span class="lineCov"> 22637 : file-&gt;flag = copy-&gt;flag;</span></a>
<a name="420"><span class="lineNum"> 420 </span><span class="lineCov"> 22637 : file-&gt;blockvec = malloc_nofail(file-&gt;blockmax * block_sizeof());</span></a>
<a name="421"><span class="lineNum"> 421 </span> : </a>
<a name="422"><span class="lineNum"> 422 </span><span class="lineCov"> 79556 : for (i = 0; i &lt; file-&gt;blockmax; ++i) {</span></a>
<a name="423"><span class="lineNum"> 423 </span><span class="lineCov"> 56919 : struct snapraid_block* block = file_block(file, i);</span></a>
<a name="424"><span class="lineNum"> 424 </span><span class="lineCov"> 56919 : struct snapraid_block* copy_block = file_block(copy, i);</span></a>
<a name="425"><span class="lineNum"> 425 </span><span class="lineCov"> 56919 : block-&gt;state = copy_block-&gt;state;</span></a>
<a name="426"><span class="lineNum"> 426 </span><span class="lineCov"> 56919 : memcpy(block-&gt;hash, copy_block-&gt;hash, BLOCK_HASH_SIZE);</span></a>
<a name="427"><span class="lineNum"> 427 </span> : }</a>
<a name="428"><span class="lineNum"> 428 </span> : </a>
<a name="429"><span class="lineNum"> 429 </span><span class="lineCov"> 22637 : return file;</span></a>
<a name="430"><span class="lineNum"> 430 </span> : }</a>
<a name="431"><span class="lineNum"> 431 </span> : </a>
<a name="432"><span class="lineNum"> 432 </span><span class="lineCov"> 3900498 : void file_free(struct snapraid_file* file)</span></a>
<a name="433"><span class="lineNum"> 433 </span> : {</a>
<a name="434"><span class="lineNum"> 434 </span><span class="lineCov"> 3900498 : free(file-&gt;sub);</span></a>
<a name="435"><span class="lineNum"> 435 </span><span class="lineCov"> 3900498 : file-&gt;sub = 0;</span></a>
<a name="436"><span class="lineNum"> 436 </span><span class="lineCov"> 3900498 : free(file-&gt;blockvec);</span></a>
<a name="437"><span class="lineNum"> 437 </span><span class="lineCov"> 3900498 : file-&gt;blockvec = 0;</span></a>
<a name="438"><span class="lineNum"> 438 </span><span class="lineCov"> 3900498 : free(file);</span></a>
<a name="439"><span class="lineNum"> 439 </span><span class="lineCov"> 3900498 : }</span></a>
<a name="440"><span class="lineNum"> 440 </span> : </a>
<a name="441"><span class="lineNum"> 441 </span><span class="lineCov"> 155 : void file_rename(struct snapraid_file* file, const char* sub)</span></a>
<a name="442"><span class="lineNum"> 442 </span> : {</a>
<a name="443"><span class="lineNum"> 443 </span><span class="lineCov"> 155 : free(file-&gt;sub);</span></a>
<a name="444"><span class="lineNum"> 444 </span><span class="lineCov"> 155 : file-&gt;sub = strdup_nofail(sub);</span></a>
<a name="445"><span class="lineNum"> 445 </span><span class="lineCov"> 155 : }</span></a>
<a name="446"><span class="lineNum"> 446 </span> : </a>
<a name="447"><span class="lineNum"> 447 </span><span class="lineCov"> 22989 : void file_copy(struct snapraid_file* src_file, struct snapraid_file* dst_file)</span></a>
<a name="448"><span class="lineNum"> 448 </span> : {</a>
<a name="449"><span class="lineNum"> 449 </span> : block_off_t i;</a>
<a name="450"><span class="lineNum"> 450 </span> : </a>
<a name="451"><span class="lineNum"> 451 </span><span class="lineCov"> 22989 : if (src_file-&gt;size != dst_file-&gt;size) {</span></a>
<a name="452"><span class="lineNum"> 452 </span> : /* LCOV_EXCL_START */</a>
<a name="453"><span class="lineNum"> 453 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Copy file with different size\n&quot;);</a>
<a name="454"><span class="lineNum"> 454 </span> : os_abort();</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"> 22989 : if (src_file-&gt;mtime_sec != dst_file-&gt;mtime_sec) {</span></a>
<a name="459"><span class="lineNum"> 459 </span> : /* LCOV_EXCL_START */</a>
<a name="460"><span class="lineNum"> 460 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Copy file with different mtime_sec\n&quot;);</a>
<a name="461"><span class="lineNum"> 461 </span> : os_abort();</a>
<a name="462"><span class="lineNum"> 462 </span> : /* LCOV_EXCL_STOP */</a>
<a name="463"><span class="lineNum"> 463 </span> : }</a>
<a name="464"><span class="lineNum"> 464 </span> : </a>
<a name="465"><span class="lineNum"> 465 </span><span class="lineCov"> 22989 : if (src_file-&gt;mtime_nsec != dst_file-&gt;mtime_nsec) {</span></a>
<a name="466"><span class="lineNum"> 466 </span> : /* LCOV_EXCL_START */</a>
<a name="467"><span class="lineNum"> 467 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Copy file with different mtime_nsec\n&quot;);</a>
<a name="468"><span class="lineNum"> 468 </span> : os_abort();</a>
<a name="469"><span class="lineNum"> 469 </span> : /* LCOV_EXCL_STOP */</a>
<a name="470"><span class="lineNum"> 470 </span> : }</a>
<a name="471"><span class="lineNum"> 471 </span> : </a>
<a name="472"><span class="lineNum"> 472 </span><span class="lineCov"> 79542 : for (i = 0; i &lt; dst_file-&gt;blockmax; ++i) {</span></a>
<a name="473"><span class="lineNum"> 473 </span> : /* set a block with hash computed but without parity */</a>
<a name="474"><span class="lineNum"> 474 </span><span class="lineCov"> 56553 : block_state_set(file_block(dst_file, i), BLOCK_STATE_REP);</span></a>
<a name="475"><span class="lineNum"> 475 </span> : </a>
<a name="476"><span class="lineNum"> 476 </span> : /* copy the hash */</a>
<a name="477"><span class="lineNum"> 477 </span><span class="lineCov"> 56553 : memcpy(file_block(dst_file, i)-&gt;hash, file_block(src_file, i)-&gt;hash, BLOCK_HASH_SIZE);</span></a>
<a name="478"><span class="lineNum"> 478 </span> : }</a>
<a name="479"><span class="lineNum"> 479 </span> : </a>
<a name="480"><span class="lineNum"> 480 </span><span class="lineCov"> 22989 : file_flag_set(dst_file, FILE_IS_COPY);</span></a>
<a name="481"><span class="lineNum"> 481 </span><span class="lineCov"> 22989 : }</span></a>
<a name="482"><span class="lineNum"> 482 </span> : </a>
<a name="483"><span class="lineNum"> 483 </span><span class="lineCov"> 46512 : const char* file_name(const struct snapraid_file* file)</span></a>
<a name="484"><span class="lineNum"> 484 </span> : {</a>
<a name="485"><span class="lineNum"> 485 </span><span class="lineCov"> 46512 : const char* r = strrchr(file-&gt;sub, '/');</span></a>
<a name="486"><span class="lineNum"> 486 </span> : </a>
<a name="487"><span class="lineNum"> 487 </span><span class="lineCov"> 46512 : if (!r)</span></a>
<a name="488"><span class="lineNum"> 488 </span><span class="lineCov"> 78 : r = file-&gt;sub;</span></a>
<a name="489"><span class="lineNum"> 489 </span> : else</a>
<a name="490"><span class="lineNum"> 490 </span><span class="lineCov"> 46434 : ++r;</span></a>
<a name="491"><span class="lineNum"> 491 </span><span class="lineCov"> 46512 : return r;</span></a>
<a name="492"><span class="lineNum"> 492 </span> : }</a>
<a name="493"><span class="lineNum"> 493 </span> : </a>
<a name="494"><span class="lineNum"> 494 </span><span class="lineCov"> 7090223 : unsigned file_block_size(struct snapraid_file* file, block_off_t file_pos, unsigned block_size)</span></a>
<a name="495"><span class="lineNum"> 495 </span> : {</a>
<a name="496"><span class="lineNum"> 496 </span> : /* if it's the last block */</a>
<a name="497"><span class="lineNum"> 497 </span><span class="lineCov"> 7090223 : if (file_pos + 1 == file-&gt;blockmax) {</span></a>
<a name="498"><span class="lineNum"> 498 </span> : unsigned block_remainder;</a>
<a name="499"><span class="lineNum"> 499 </span><span class="lineCov"> 2881901 : if (file-&gt;size == 0)</span></a>
<a name="500"><span class="lineNum"> 500 </span><span class="lineNoCov"> 0 : return 0;</span></a>
<a name="501"><span class="lineNum"> 501 </span><span class="lineCov"> 2881901 : block_remainder = file-&gt;size % block_size;</span></a>
<a name="502"><span class="lineNum"> 502 </span><span class="lineCov"> 2881901 : if (block_remainder == 0)</span></a>
<a name="503"><span class="lineNum"> 503 </span><span class="lineCov"> 3194 : block_remainder = block_size;</span></a>
<a name="504"><span class="lineNum"> 504 </span><span class="lineCov"> 2881901 : return block_remainder;</span></a>
<a name="505"><span class="lineNum"> 505 </span> : }</a>
<a name="506"><span class="lineNum"> 506 </span> : </a>
<a name="507"><span class="lineNum"> 507 </span><span class="lineCov"> 4208322 : return block_size;</span></a>
<a name="508"><span class="lineNum"> 508 </span> : }</a>
<a name="509"><span class="lineNum"> 509 </span> : </a>
<a name="510"><span class="lineNum"> 510 </span><span class="lineCov"> 5400944 : int file_block_is_last(struct snapraid_file* file, block_off_t file_pos)</span></a>
<a name="511"><span class="lineNum"> 511 </span> : {</a>
<a name="512"><span class="lineNum"> 512 </span><span class="lineCov"> 5400944 : if (file_pos == 0 &amp;&amp; file-&gt;blockmax == 0)</span></a>
<a name="513"><span class="lineNum"> 513 </span><span class="lineNoCov"> 0 : return 1;</span></a>
<a name="514"><span class="lineNum"> 514 </span> : </a>
<a name="515"><span class="lineNum"> 515 </span><span class="lineCov"> 5400944 : if (file_pos &gt;= file-&gt;blockmax) {</span></a>
<a name="516"><span class="lineNum"> 516 </span> : /* LCOV_EXCL_START */</a>
<a name="517"><span class="lineNum"> 517 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: File block position over the max\n&quot;);</a>
<a name="518"><span class="lineNum"> 518 </span> : os_abort();</a>
<a name="519"><span class="lineNum"> 519 </span> : /* LCOV_EXCL_STOP */</a>
<a name="520"><span class="lineNum"> 520 </span> : }</a>
<a name="521"><span class="lineNum"> 521 </span> : </a>
<a name="522"><span class="lineNum"> 522 </span><span class="lineCov"> 5400944 : return file_pos == file-&gt;blockmax - 1;</span></a>
<a name="523"><span class="lineNum"> 523 </span> : }</a>
<a name="524"><span class="lineNum"> 524 </span> : </a>
<a name="525"><span class="lineNum"> 525 </span><span class="lineCov"> 1097278 : int file_inode_compare_to_arg(const void* void_arg, const void* void_data)</span></a>
<a name="526"><span class="lineNum"> 526 </span> : {</a>
<a name="527"><span class="lineNum"> 527 </span><span class="lineCov"> 1097278 : const uint64_t* arg = void_arg;</span></a>
<a name="528"><span class="lineNum"> 528 </span><span class="lineCov"> 1097278 : const struct snapraid_file* file = void_data;</span></a>
<a name="529"><span class="lineNum"> 529 </span> : </a>
<a name="530"><span class="lineNum"> 530 </span><span class="lineCov"> 1097278 : if (*arg &lt; file-&gt;inode)</span></a>
<a name="531"><span class="lineNum"> 531 </span><span class="lineNoCov"> 0 : return -1;</span></a>
<a name="532"><span class="lineNum"> 532 </span><span class="lineCov"> 1097278 : if (*arg &gt; file-&gt;inode)</span></a>
<a name="533"><span class="lineNum"> 533 </span><span class="lineNoCov"> 0 : return 1;</span></a>
<a name="534"><span class="lineNum"> 534 </span><span class="lineCov"> 1097278 : return 0;</span></a>
<a name="535"><span class="lineNum"> 535 </span> : }</a>
<a name="536"><span class="lineNum"> 536 </span> : </a>
<a name="537"><span class="lineNum"> 537 </span><span class="lineNoCov"> 0 : int file_inode_compare(const void* void_a, const void* void_b)</span></a>
<a name="538"><span class="lineNum"> 538 </span> : {</a>
<a name="539"><span class="lineNum"> 539 </span><span class="lineNoCov"> 0 : const struct snapraid_file* file_a = void_a;</span></a>
<a name="540"><span class="lineNum"> 540 </span><span class="lineNoCov"> 0 : const struct snapraid_file* file_b = void_b;</span></a>
<a name="541"><span class="lineNum"> 541 </span> : </a>
<a name="542"><span class="lineNum"> 542 </span><span class="lineNoCov"> 0 : if (file_a-&gt;inode &lt; file_b-&gt;inode)</span></a>
<a name="543"><span class="lineNum"> 543 </span><span class="lineNoCov"> 0 : return -1;</span></a>
<a name="544"><span class="lineNum"> 544 </span><span class="lineNoCov"> 0 : if (file_a-&gt;inode &gt; file_b-&gt;inode)</span></a>
<a name="545"><span class="lineNum"> 545 </span><span class="lineNoCov"> 0 : return 1;</span></a>
<a name="546"><span class="lineNum"> 546 </span><span class="lineNoCov"> 0 : return 0;</span></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><span class="lineCov"> 186982 : int file_path_compare(const void* void_a, const void* void_b)</span></a>
<a name="550"><span class="lineNum"> 550 </span> : {</a>
<a name="551"><span class="lineNum"> 551 </span><span class="lineCov"> 186982 : const struct snapraid_file* file_a = void_a;</span></a>
<a name="552"><span class="lineNum"> 552 </span><span class="lineCov"> 186982 : const struct snapraid_file* file_b = void_b;</span></a>
<a name="553"><span class="lineNum"> 553 </span> : </a>
<a name="554"><span class="lineNum"> 554 </span><span class="lineCov"> 186982 : return strcmp(file_a-&gt;sub, file_b-&gt;sub);</span></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><span class="lineCov"> 50208 : int file_physical_compare(const void* void_a, const void* void_b)</span></a>
<a name="558"><span class="lineNum"> 558 </span> : {</a>
<a name="559"><span class="lineNum"> 559 </span><span class="lineCov"> 50208 : const struct snapraid_file* file_a = void_a;</span></a>
<a name="560"><span class="lineNum"> 560 </span><span class="lineCov"> 50208 : const struct snapraid_file* file_b = void_b;</span></a>
<a name="561"><span class="lineNum"> 561 </span> : </a>
<a name="562"><span class="lineNum"> 562 </span><span class="lineCov"> 50208 : if (file_a-&gt;physical &lt; file_b-&gt;physical)</span></a>
<a name="563"><span class="lineNum"> 563 </span><span class="lineCov"> 31390 : return -1;</span></a>
<a name="564"><span class="lineNum"> 564 </span><span class="lineCov"> 18818 : if (file_a-&gt;physical &gt; file_b-&gt;physical)</span></a>
<a name="565"><span class="lineNum"> 565 </span><span class="lineCov"> 18816 : return 1;</span></a>
<a name="566"><span class="lineNum"> 566 </span><span class="lineCov"> 2 : return 0;</span></a>
<a name="567"><span class="lineNum"> 567 </span> : }</a>
<a name="568"><span class="lineNum"> 568 </span> : </a>
<a name="569"><span class="lineNum"> 569 </span><span class="lineCov"> 109693 : int file_path_compare_to_arg(const void* void_arg, const void* void_data)</span></a>
<a name="570"><span class="lineNum"> 570 </span> : {</a>
<a name="571"><span class="lineNum"> 571 </span><span class="lineCov"> 109693 : const char* arg = void_arg;</span></a>
<a name="572"><span class="lineNum"> 572 </span><span class="lineCov"> 109693 : const struct snapraid_file* file = void_data;</span></a>
<a name="573"><span class="lineNum"> 573 </span> : </a>
<a name="574"><span class="lineNum"> 574 </span><span class="lineCov"> 109693 : return strcmp(arg, file-&gt;sub);</span></a>
<a name="575"><span class="lineNum"> 575 </span> : }</a>
<a name="576"><span class="lineNum"> 576 </span> : </a>
<a name="577"><span class="lineNum"> 577 </span><span class="lineCov"> 23256 : int file_name_compare(const void* void_a, const void* void_b)</span></a>
<a name="578"><span class="lineNum"> 578 </span> : {</a>
<a name="579"><span class="lineNum"> 579 </span><span class="lineCov"> 23256 : const struct snapraid_file* file_a = void_a;</span></a>
<a name="580"><span class="lineNum"> 580 </span><span class="lineCov"> 23256 : const struct snapraid_file* file_b = void_b;</span></a>
<a name="581"><span class="lineNum"> 581 </span><span class="lineCov"> 23256 : const char* name_a = file_name(file_a);</span></a>
<a name="582"><span class="lineNum"> 582 </span><span class="lineCov"> 23256 : const char* name_b = file_name(file_b);</span></a>
<a name="583"><span class="lineNum"> 583 </span> : </a>
<a name="584"><span class="lineNum"> 584 </span><span class="lineCov"> 23256 : return strcmp(name_a, name_b);</span></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"> 23020 : int file_stamp_compare(const void* void_a, const void* void_b)</span></a>
<a name="588"><span class="lineNum"> 588 </span> : {</a>
<a name="589"><span class="lineNum"> 589 </span><span class="lineCov"> 23020 : const struct snapraid_file* file_a = void_a;</span></a>
<a name="590"><span class="lineNum"> 590 </span><span class="lineCov"> 23020 : const struct snapraid_file* file_b = void_b;</span></a>
<a name="591"><span class="lineNum"> 591 </span> : </a>
<a name="592"><span class="lineNum"> 592 </span><span class="lineCov"> 23020 : if (file_a-&gt;size &lt; file_b-&gt;size)</span></a>
<a name="593"><span class="lineNum"> 593 </span><span class="lineNoCov"> 0 : return -1;</span></a>
<a name="594"><span class="lineNum"> 594 </span><span class="lineCov"> 23020 : if (file_a-&gt;size &gt; file_b-&gt;size)</span></a>
<a name="595"><span class="lineNum"> 595 </span><span class="lineNoCov"> 0 : return 1;</span></a>
<a name="596"><span class="lineNum"> 596 </span> : </a>
<a name="597"><span class="lineNum"> 597 </span><span class="lineCov"> 23020 : if (file_a-&gt;mtime_sec &lt; file_b-&gt;mtime_sec)</span></a>
<a name="598"><span class="lineNum"> 598 </span><span class="lineNoCov"> 0 : return -1;</span></a>
<a name="599"><span class="lineNum"> 599 </span><span class="lineCov"> 23020 : if (file_a-&gt;mtime_sec &gt; file_b-&gt;mtime_sec)</span></a>
<a name="600"><span class="lineNum"> 600 </span><span class="lineNoCov"> 0 : return 1;</span></a>
<a name="601"><span class="lineNum"> 601 </span> : </a>
<a name="602"><span class="lineNum"> 602 </span><span class="lineCov"> 23020 : if (file_a-&gt;mtime_nsec &lt; file_b-&gt;mtime_nsec)</span></a>
<a name="603"><span class="lineNum"> 603 </span><span class="lineNoCov"> 0 : return -1;</span></a>
<a name="604"><span class="lineNum"> 604 </span><span class="lineCov"> 23020 : if (file_a-&gt;mtime_nsec &gt; file_b-&gt;mtime_nsec)</span></a>
<a name="605"><span class="lineNum"> 605 </span><span class="lineNoCov"> 0 : return 1;</span></a>
<a name="606"><span class="lineNum"> 606 </span> : </a>
<a name="607"><span class="lineNum"> 607 </span><span class="lineCov"> 23020 : return 0;</span></a>
<a name="608"><span class="lineNum"> 608 </span> : }</a>
<a name="609"><span class="lineNum"> 609 </span> : </a>
<a name="610"><span class="lineNum"> 610 </span><span class="lineCov"> 23256 : int file_namestamp_compare(const void* void_a, const void* void_b)</span></a>
<a name="611"><span class="lineNum"> 611 </span> : {</a>
<a name="612"><span class="lineNum"> 612 </span> : int ret;</a>
<a name="613"><span class="lineNum"> 613 </span> : </a>
<a name="614"><span class="lineNum"> 614 </span><span class="lineCov"> 23256 : ret = file_name_compare(void_a, void_b);</span></a>
<a name="615"><span class="lineNum"> 615 </span><span class="lineCov"> 23256 : if (ret != 0)</span></a>
<a name="616"><span class="lineNum"> 616 </span><span class="lineCov"> 236 : return ret;</span></a>
<a name="617"><span class="lineNum"> 617 </span> : </a>
<a name="618"><span class="lineNum"> 618 </span><span class="lineCov"> 23020 : return file_stamp_compare(void_a, void_b);</span></a>
<a name="619"><span class="lineNum"> 619 </span> : }</a>
<a name="620"><span class="lineNum"> 620 </span> : </a>
<a name="621"><span class="lineNum"> 621 </span><span class="lineNoCov"> 0 : int file_pathstamp_compare(const void* void_a, const void* void_b)</span></a>
<a name="622"><span class="lineNum"> 622 </span> : {</a>
<a name="623"><span class="lineNum"> 623 </span> : int ret;</a>
<a name="624"><span class="lineNum"> 624 </span> : </a>
<a name="625"><span class="lineNum"> 625 </span><span class="lineNoCov"> 0 : ret = file_path_compare(void_a, void_b);</span></a>
<a name="626"><span class="lineNum"> 626 </span><span class="lineNoCov"> 0 : if (ret != 0)</span></a>
<a name="627"><span class="lineNum"> 627 </span><span class="lineNoCov"> 0 : return ret;</span></a>
<a name="628"><span class="lineNum"> 628 </span> : </a>
<a name="629"><span class="lineNum"> 629 </span><span class="lineNoCov"> 0 : return file_stamp_compare(void_a, void_b);</span></a>
<a name="630"><span class="lineNum"> 630 </span> : }</a>
<a name="631"><span class="lineNum"> 631 </span> : </a>
<a name="632"><span class="lineNum"> 632 </span><span class="lineCov"> 3969602 : struct snapraid_extent* extent_alloc(block_off_t parity_pos, struct snapraid_file* file, block_off_t file_pos, block_off_t count)</span></a>
<a name="633"><span class="lineNum"> 633 </span> : {</a>
<a name="634"><span class="lineNum"> 634 </span> : struct snapraid_extent* extent;</a>
<a name="635"><span class="lineNum"> 635 </span> : </a>
<a name="636"><span class="lineNum"> 636 </span><span class="lineCov"> 3969602 : if (count == 0) {</span></a>
<a name="637"><span class="lineNum"> 637 </span> : /* LCOV_EXCL_START */</a>
<a name="638"><span class="lineNum"> 638 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Allocating empty extent for file '%s' at position '%u/%u'\n&quot;, file-&gt;sub, file_pos, file-&gt;blockmax);</a>
<a name="639"><span class="lineNum"> 639 </span> : os_abort();</a>
<a name="640"><span class="lineNum"> 640 </span> : /* LCOV_EXCL_STOP */</a>
<a name="641"><span class="lineNum"> 641 </span> : }</a>
<a name="642"><span class="lineNum"> 642 </span><span class="lineCov"> 3969602 : if (file_pos + count &gt; file-&gt;blockmax) {</span></a>
<a name="643"><span class="lineNum"> 643 </span> : /* LCOV_EXCL_START */</a>
<a name="644"><span class="lineNum"> 644 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Allocating overflowing extent for file '%s' at position '%u:%u/%u'\n&quot;, file-&gt;sub, file_pos, count, file-&gt;blockmax);</a>
<a name="645"><span class="lineNum"> 645 </span> : os_abort();</a>
<a name="646"><span class="lineNum"> 646 </span> : /* LCOV_EXCL_STOP */</a>
<a name="647"><span class="lineNum"> 647 </span> : }</a>
<a name="648"><span class="lineNum"> 648 </span> : </a>
<a name="649"><span class="lineNum"> 649 </span><span class="lineCov"> 3969602 : extent = malloc_nofail(sizeof(struct snapraid_extent));</span></a>
<a name="650"><span class="lineNum"> 650 </span><span class="lineCov"> 3969602 : extent-&gt;parity_pos = parity_pos;</span></a>
<a name="651"><span class="lineNum"> 651 </span><span class="lineCov"> 3969602 : extent-&gt;file = file;</span></a>
<a name="652"><span class="lineNum"> 652 </span><span class="lineCov"> 3969602 : extent-&gt;file_pos = file_pos;</span></a>
<a name="653"><span class="lineNum"> 653 </span><span class="lineCov"> 3969602 : extent-&gt;count = count;</span></a>
<a name="654"><span class="lineNum"> 654 </span> : </a>
<a name="655"><span class="lineNum"> 655 </span><span class="lineCov"> 3969602 : return extent;</span></a>
<a name="656"><span class="lineNum"> 656 </span> : }</a>
<a name="657"><span class="lineNum"> 657 </span> : </a>
<a name="658"><span class="lineNum"> 658 </span><span class="lineCov"> 3923667 : void extent_free(struct snapraid_extent* extent)</span></a>
<a name="659"><span class="lineNum"> 659 </span> : {</a>
<a name="660"><span class="lineNum"> 660 </span><span class="lineCov"> 3923667 : free(extent);</span></a>
<a name="661"><span class="lineNum"> 661 </span><span class="lineCov"> 3923667 : }</span></a>
<a name="662"><span class="lineNum"> 662 </span> : </a>
<a name="663"><span class="lineNum"> 663 </span><span class="lineCov"> 47203078 : int extent_parity_compare(const void* void_a, const void* void_b)</span></a>
<a name="664"><span class="lineNum"> 664 </span> : {</a>
<a name="665"><span class="lineNum"> 665 </span><span class="lineCov"> 47203078 : const struct snapraid_extent* arg_a = void_a;</span></a>
<a name="666"><span class="lineNum"> 666 </span><span class="lineCov"> 47203078 : const struct snapraid_extent* arg_b = void_b;</span></a>
<a name="667"><span class="lineNum"> 667 </span> : </a>
<a name="668"><span class="lineNum"> 668 </span><span class="lineCov"> 47203078 : if (arg_a-&gt;parity_pos &lt; arg_b-&gt;parity_pos)</span></a>
<a name="669"><span class="lineNum"> 669 </span><span class="lineCov"> 965541 : return -1;</span></a>
<a name="670"><span class="lineNum"> 670 </span><span class="lineCov"> 46237537 : if (arg_a-&gt;parity_pos &gt; arg_b-&gt;parity_pos)</span></a>
<a name="671"><span class="lineNum"> 671 </span><span class="lineCov"> 46199345 : return 1;</span></a>
<a name="672"><span class="lineNum"> 672 </span> : </a>
<a name="673"><span class="lineNum"> 673 </span><span class="lineCov"> 38192 : return 0;</span></a>
<a name="674"><span class="lineNum"> 674 </span> : }</a>
<a name="675"><span class="lineNum"> 675 </span> : </a>
<a name="676"><span class="lineNum"> 676 </span><span class="lineCov"> 47536874 : int extent_file_compare(const void* void_a, const void* void_b)</span></a>
<a name="677"><span class="lineNum"> 677 </span> : {</a>
<a name="678"><span class="lineNum"> 678 </span><span class="lineCov"> 47536874 : const struct snapraid_extent* arg_a = void_a;</span></a>
<a name="679"><span class="lineNum"> 679 </span><span class="lineCov"> 47536874 : const struct snapraid_extent* arg_b = void_b;</span></a>
<a name="680"><span class="lineNum"> 680 </span> : </a>
<a name="681"><span class="lineNum"> 681 </span><span class="lineCov"> 47536874 : if (arg_a-&gt;file &lt; arg_b-&gt;file)</span></a>
<a name="682"><span class="lineNum"> 682 </span><span class="lineCov"> 1061226 : return -1;</span></a>
<a name="683"><span class="lineNum"> 683 </span><span class="lineCov"> 46475648 : if (arg_a-&gt;file &gt; arg_b-&gt;file)</span></a>
<a name="684"><span class="lineNum"> 684 </span><span class="lineCov"> 46404307 : return 1;</span></a>
<a name="685"><span class="lineNum"> 685 </span> : </a>
<a name="686"><span class="lineNum"> 686 </span><span class="lineCov"> 71341 : if (arg_a-&gt;file_pos &lt; arg_b-&gt;file_pos)</span></a>
<a name="687"><span class="lineNum"> 687 </span><span class="lineCov"> 194 : return -1;</span></a>
<a name="688"><span class="lineNum"> 688 </span><span class="lineCov"> 71147 : if (arg_a-&gt;file_pos &gt; arg_b-&gt;file_pos)</span></a>
<a name="689"><span class="lineNum"> 689 </span><span class="lineCov"> 32955 : return 1;</span></a>
<a name="690"><span class="lineNum"> 690 </span> : </a>
<a name="691"><span class="lineNum"> 691 </span><span class="lineCov"> 38192 : return 0;</span></a>
<a name="692"><span class="lineNum"> 692 </span> : }</a>
<a name="693"><span class="lineNum"> 693 </span> : </a>
<a name="694"><span class="lineNum"> 694 </span><span class="lineCov"> 126838 : struct snapraid_link* link_alloc(const char* sub, const char* linkto, unsigned link_flag)</span></a>
<a name="695"><span class="lineNum"> 695 </span> : {</a>
<a name="696"><span class="lineNum"> 696 </span> : struct snapraid_link* slink;</a>
<a name="697"><span class="lineNum"> 697 </span> : </a>
<a name="698"><span class="lineNum"> 698 </span><span class="lineCov"> 126838 : slink = malloc_nofail(sizeof(struct snapraid_link));</span></a>
<a name="699"><span class="lineNum"> 699 </span><span class="lineCov"> 126838 : slink-&gt;sub = strdup_nofail(sub);</span></a>
<a name="700"><span class="lineNum"> 700 </span><span class="lineCov"> 126838 : slink-&gt;linkto = strdup_nofail(linkto);</span></a>
<a name="701"><span class="lineNum"> 701 </span><span class="lineCov"> 126838 : slink-&gt;flag = link_flag;</span></a>
<a name="702"><span class="lineNum"> 702 </span> : </a>
<a name="703"><span class="lineNum"> 703 </span><span class="lineCov"> 126838 : return slink;</span></a>
<a name="704"><span class="lineNum"> 704 </span> : }</a>
<a name="705"><span class="lineNum"> 705 </span> : </a>
<a name="706"><span class="lineNum"> 706 </span><span class="lineCov"> 125242 : void link_free(struct snapraid_link* slink)</span></a>
<a name="707"><span class="lineNum"> 707 </span> : {</a>
<a name="708"><span class="lineNum"> 708 </span><span class="lineCov"> 125242 : free(slink-&gt;sub);</span></a>
<a name="709"><span class="lineNum"> 709 </span><span class="lineCov"> 125242 : free(slink-&gt;linkto);</span></a>
<a name="710"><span class="lineNum"> 710 </span><span class="lineCov"> 125242 : free(slink);</span></a>
<a name="711"><span class="lineNum"> 711 </span><span class="lineCov"> 125242 : }</span></a>
<a name="712"><span class="lineNum"> 712 </span> : </a>
<a name="713"><span class="lineNum"> 713 </span><span class="lineCov"> 37307 : int link_name_compare_to_arg(const void* void_arg, const void* void_data)</span></a>
<a name="714"><span class="lineNum"> 714 </span> : {</a>
<a name="715"><span class="lineNum"> 715 </span><span class="lineCov"> 37307 : const char* arg = void_arg;</span></a>
<a name="716"><span class="lineNum"> 716 </span><span class="lineCov"> 37307 : const struct snapraid_link* slink = void_data;</span></a>
<a name="717"><span class="lineNum"> 717 </span> : </a>
<a name="718"><span class="lineNum"> 718 </span><span class="lineCov"> 37307 : return strcmp(arg, slink-&gt;sub);</span></a>
<a name="719"><span class="lineNum"> 719 </span> : }</a>
<a name="720"><span class="lineNum"> 720 </span> : </a>
<a name="721"><span class="lineNum"> 721 </span><span class="lineCov"> 3337 : int link_alpha_compare(const void* void_a, const void* void_b)</span></a>
<a name="722"><span class="lineNum"> 722 </span> : {</a>
<a name="723"><span class="lineNum"> 723 </span><span class="lineCov"> 3337 : const struct snapraid_link* slink_a = void_a;</span></a>
<a name="724"><span class="lineNum"> 724 </span><span class="lineCov"> 3337 : const struct snapraid_link* slink_b = void_b;</span></a>
<a name="725"><span class="lineNum"> 725 </span> : </a>
<a name="726"><span class="lineNum"> 726 </span><span class="lineCov"> 3337 : return strcmp(slink_a-&gt;sub, slink_b-&gt;sub);</span></a>
<a name="727"><span class="lineNum"> 727 </span> : }</a>
<a name="728"><span class="lineNum"> 728 </span> : </a>
<a name="729"><span class="lineNum"> 729 </span><span class="lineCov"> 872 : struct snapraid_dir* dir_alloc(const char* sub)</span></a>
<a name="730"><span class="lineNum"> 730 </span> : {</a>
<a name="731"><span class="lineNum"> 731 </span> : struct snapraid_dir* dir;</a>
<a name="732"><span class="lineNum"> 732 </span> : </a>
<a name="733"><span class="lineNum"> 733 </span><span class="lineCov"> 872 : dir = malloc_nofail(sizeof(struct snapraid_dir));</span></a>
<a name="734"><span class="lineNum"> 734 </span><span class="lineCov"> 872 : dir-&gt;sub = strdup_nofail(sub);</span></a>
<a name="735"><span class="lineNum"> 735 </span><span class="lineCov"> 872 : dir-&gt;flag = 0;</span></a>
<a name="736"><span class="lineNum"> 736 </span> : </a>
<a name="737"><span class="lineNum"> 737 </span><span class="lineCov"> 872 : return dir;</span></a>
<a name="738"><span class="lineNum"> 738 </span> : }</a>
<a name="739"><span class="lineNum"> 739 </span> : </a>
<a name="740"><span class="lineNum"> 740 </span><span class="lineCov"> 864 : void dir_free(struct snapraid_dir* dir)</span></a>
<a name="741"><span class="lineNum"> 741 </span> : {</a>
<a name="742"><span class="lineNum"> 742 </span><span class="lineCov"> 864 : free(dir-&gt;sub);</span></a>
<a name="743"><span class="lineNum"> 743 </span><span class="lineCov"> 864 : free(dir);</span></a>
<a name="744"><span class="lineNum"> 744 </span><span class="lineCov"> 864 : }</span></a>
<a name="745"><span class="lineNum"> 745 </span> : </a>
<a name="746"><span class="lineNum"> 746 </span><span class="lineCov"> 285 : int dir_name_compare(const void* void_arg, const void* void_data)</span></a>
<a name="747"><span class="lineNum"> 747 </span> : {</a>
<a name="748"><span class="lineNum"> 748 </span><span class="lineCov"> 285 : const char* arg = void_arg;</span></a>
<a name="749"><span class="lineNum"> 749 </span><span class="lineCov"> 285 : const struct snapraid_dir* dir = void_data;</span></a>
<a name="750"><span class="lineNum"> 750 </span> : </a>
<a name="751"><span class="lineNum"> 751 </span><span class="lineCov"> 285 : return strcmp(arg, dir-&gt;sub);</span></a>
<a name="752"><span class="lineNum"> 752 </span> : }</a>
<a name="753"><span class="lineNum"> 753 </span> : </a>
<a name="754"><span class="lineNum"> 754 </span><span class="lineCov"> 1771 : struct snapraid_disk* disk_alloc(const char* name, const char* dir, uint64_t dev, const char* uuid, int skip_access)</span></a>
<a name="755"><span class="lineNum"> 755 </span> : {</a>
<a name="756"><span class="lineNum"> 756 </span> : struct snapraid_disk* disk;</a>
<a name="757"><span class="lineNum"> 757 </span> : unsigned i;</a>
<a name="758"><span class="lineNum"> 758 </span> : </a>
<a name="759"><span class="lineNum"> 759 </span><span class="lineCov"> 1771 : disk = malloc_nofail(sizeof(struct snapraid_disk));</span></a>
<a name="760"><span class="lineNum"> 760 </span><span class="lineCov"> 1771 : pathcpy(disk-&gt;name, sizeof(disk-&gt;name), name);</span></a>
<a name="761"><span class="lineNum"> 761 </span><span class="lineCov"> 1771 : pathimport(disk-&gt;dir, sizeof(disk-&gt;dir), dir);</span></a>
<a name="762"><span class="lineNum"> 762 </span><span class="lineCov"> 1771 : pathcpy(disk-&gt;uuid, sizeof(disk-&gt;uuid), uuid);</span></a>
<a name="763"><span class="lineNum"> 763 </span> : </a>
<a name="764"><span class="lineNum"> 764 </span> : /* ensure that the dir terminate with &quot;/&quot; if it isn't empty */</a>
<a name="765"><span class="lineNum"> 765 </span><span class="lineCov"> 1771 : pathslash(disk-&gt;dir, sizeof(disk-&gt;dir));</span></a>
<a name="766"><span class="lineNum"> 766 </span> : </a>
<a name="767"><span class="lineNum"> 767 </span> : #if HAVE_THREAD</a>
<a name="768"><span class="lineNum"> 768 </span><span class="lineCov"> 1771 : disk-&gt;single_thread = 0;</span></a>
<a name="769"><span class="lineNum"> 769 </span><span class="lineCov"> 1771 : thread_mutex_init(&amp;disk-&gt;fs_mutex);</span></a>
<a name="770"><span class="lineNum"> 770 </span> : #endif</a>
<a name="771"><span class="lineNum"> 771 </span> : </a>
<a name="772"><span class="lineNum"> 772 </span><span class="lineCov"> 1771 : disk-&gt;smartctl[0] = 0;</span></a>
<a name="773"><span class="lineNum"> 773 </span><span class="lineCov"> 8855 : for (i = 0; i &lt; SMART_IGNORE_MAX; ++i)</span></a>
<a name="774"><span class="lineNum"> 774 </span><span class="lineCov"> 7084 : disk-&gt;smartignore[i] = 0;</span></a>
<a name="775"><span class="lineNum"> 775 </span><span class="lineCov"> 1771 : disk-&gt;fstype[0] = 0;</span></a>
<a name="776"><span class="lineNum"> 776 </span><span class="lineCov"> 1771 : disk-&gt;fslabel[0] = 0;</span></a>
<a name="777"><span class="lineNum"> 777 </span><span class="lineCov"> 1771 : disk-&gt;device = dev;</span></a>
<a name="778"><span class="lineNum"> 778 </span><span class="lineCov"> 1771 : disk-&gt;tick = 0;</span></a>
<a name="779"><span class="lineNum"> 779 </span><span class="lineCov"> 1771 : disk-&gt;cached_blocks = 0;</span></a>
<a name="780"><span class="lineNum"> 780 </span><span class="lineCov"> 1771 : disk-&gt;progress_file = 0;</span></a>
<a name="781"><span class="lineNum"> 781 </span><span class="lineCov"> 1771 : disk-&gt;total_blocks = 0;</span></a>
<a name="782"><span class="lineNum"> 782 </span><span class="lineCov"> 1771 : disk-&gt;free_blocks = 0;</span></a>
<a name="783"><span class="lineNum"> 783 </span><span class="lineCov"> 1771 : disk-&gt;first_free_block = 0;</span></a>
<a name="784"><span class="lineNum"> 784 </span><span class="lineCov"> 1771 : disk-&gt;has_volatile_inodes = 0;</span></a>
<a name="785"><span class="lineNum"> 785 </span><span class="lineCov"> 1771 : disk-&gt;has_volatile_hardlinks = 0;</span></a>
<a name="786"><span class="lineNum"> 786 </span><span class="lineCov"> 1771 : disk-&gt;has_unreliable_physical = 0;</span></a>
<a name="787"><span class="lineNum"> 787 </span><span class="lineCov"> 1771 : disk-&gt;has_different_uuid = 0;</span></a>
<a name="788"><span class="lineNum"> 788 </span><span class="lineCov"> 1771 : disk-&gt;has_unsupported_uuid = *uuid == 0; /* empty UUID means unsupported */</span></a>
<a name="789"><span class="lineNum"> 789 </span><span class="lineCov"> 1771 : disk-&gt;had_empty_uuid = 0;</span></a>
<a name="790"><span class="lineNum"> 790 </span><span class="lineCov"> 1771 : disk-&gt;mapping_idx = -1;</span></a>
<a name="791"><span class="lineNum"> 791 </span><span class="lineCov"> 1771 : disk-&gt;skip_access = skip_access;</span></a>
<a name="792"><span class="lineNum"> 792 </span><span class="lineCov"> 1771 : tommy_list_init(&amp;disk-&gt;filelist);</span></a>
<a name="793"><span class="lineNum"> 793 </span><span class="lineCov"> 1771 : tommy_list_init(&amp;disk-&gt;deletedlist);</span></a>
<a name="794"><span class="lineNum"> 794 </span><span class="lineCov"> 1771 : tommy_hashdyn_init(&amp;disk-&gt;inodeset);</span></a>
<a name="795"><span class="lineNum"> 795 </span><span class="lineCov"> 1771 : tommy_hashdyn_init(&amp;disk-&gt;pathset);</span></a>
<a name="796"><span class="lineNum"> 796 </span><span class="lineCov"> 1771 : tommy_hashdyn_init(&amp;disk-&gt;stampset);</span></a>
<a name="797"><span class="lineNum"> 797 </span><span class="lineCov"> 1771 : tommy_list_init(&amp;disk-&gt;linklist);</span></a>
<a name="798"><span class="lineNum"> 798 </span><span class="lineCov"> 1771 : tommy_hashdyn_init(&amp;disk-&gt;linkset);</span></a>
<a name="799"><span class="lineNum"> 799 </span><span class="lineCov"> 1771 : tommy_list_init(&amp;disk-&gt;dirlist);</span></a>
<a name="800"><span class="lineNum"> 800 </span><span class="lineCov"> 1771 : tommy_hashdyn_init(&amp;disk-&gt;dirset);</span></a>
<a name="801"><span class="lineNum"> 801 </span><span class="lineCov"> 1771 : tommy_tree_init(&amp;disk-&gt;fs_parity, extent_parity_compare);</span></a>
<a name="802"><span class="lineNum"> 802 </span><span class="lineCov"> 1771 : tommy_tree_init(&amp;disk-&gt;fs_file, extent_file_compare);</span></a>
<a name="803"><span class="lineNum"> 803 </span><span class="lineCov"> 1771 : disk-&gt;fs_last = 0;</span></a>
<a name="804"><span class="lineNum"> 804 </span> : </a>
<a name="805"><span class="lineNum"> 805 </span><span class="lineCov"> 1771 : return disk;</span></a>
<a name="806"><span class="lineNum"> 806 </span> : }</a>
<a name="807"><span class="lineNum"> 807 </span> : </a>
<a name="808"><span class="lineNum"> 808 </span><span class="lineCov"> 1711 : void disk_free(struct snapraid_disk* disk)</span></a>
<a name="809"><span class="lineNum"> 809 </span> : {</a>
<a name="810"><span class="lineNum"> 810 </span><span class="lineCov"> 1711 : tommy_list_foreach(&amp;disk-&gt;filelist, (tommy_foreach_func*)file_free);</span></a>
<a name="811"><span class="lineNum"> 811 </span><span class="lineCov"> 1711 : tommy_list_foreach(&amp;disk-&gt;deletedlist, (tommy_foreach_func*)file_free);</span></a>
<a name="812"><span class="lineNum"> 812 </span><span class="lineCov"> 1711 : tommy_tree_foreach(&amp;disk-&gt;fs_file, (tommy_foreach_func*)extent_free);</span></a>
<a name="813"><span class="lineNum"> 813 </span><span class="lineCov"> 1711 : tommy_hashdyn_done(&amp;disk-&gt;inodeset);</span></a>
<a name="814"><span class="lineNum"> 814 </span><span class="lineCov"> 1711 : tommy_hashdyn_done(&amp;disk-&gt;pathset);</span></a>
<a name="815"><span class="lineNum"> 815 </span><span class="lineCov"> 1711 : tommy_hashdyn_done(&amp;disk-&gt;stampset);</span></a>
<a name="816"><span class="lineNum"> 816 </span><span class="lineCov"> 1711 : tommy_list_foreach(&amp;disk-&gt;linklist, (tommy_foreach_func*)link_free);</span></a>
<a name="817"><span class="lineNum"> 817 </span><span class="lineCov"> 1711 : tommy_hashdyn_done(&amp;disk-&gt;linkset);</span></a>
<a name="818"><span class="lineNum"> 818 </span><span class="lineCov"> 1711 : tommy_list_foreach(&amp;disk-&gt;dirlist, (tommy_foreach_func*)dir_free);</span></a>
<a name="819"><span class="lineNum"> 819 </span><span class="lineCov"> 1711 : tommy_hashdyn_done(&amp;disk-&gt;dirset);</span></a>
<a name="820"><span class="lineNum"> 820 </span> : </a>
<a name="821"><span class="lineNum"> 821 </span> : #if HAVE_THREAD</a>
<a name="822"><span class="lineNum"> 822 </span><span class="lineCov"> 1711 : thread_mutex_destroy(&amp;disk-&gt;fs_mutex);</span></a>
<a name="823"><span class="lineNum"> 823 </span> : #endif</a>
<a name="824"><span class="lineNum"> 824 </span> : </a>
<a name="825"><span class="lineNum"> 825 </span><span class="lineCov"> 1711 : free(disk);</span></a>
<a name="826"><span class="lineNum"> 826 </span><span class="lineCov"> 1711 : }</span></a>
<a name="827"><span class="lineNum"> 827 </span> : </a>
<a name="828"><span class="lineNum"> 828 </span><span class="lineCov"> 12 : struct snapraid_extra* extra_alloc(const char* name, const char* dir, uint64_t dev, const char* uuid)</span></a>
<a name="829"><span class="lineNum"> 829 </span> : {</a>
<a name="830"><span class="lineNum"> 830 </span> : struct snapraid_extra* extra;</a>
<a name="831"><span class="lineNum"> 831 </span> : unsigned i;</a>
<a name="832"><span class="lineNum"> 832 </span> : </a>
<a name="833"><span class="lineNum"> 833 </span><span class="lineCov"> 12 : extra = malloc_nofail(sizeof(struct snapraid_extra));</span></a>
<a name="834"><span class="lineNum"> 834 </span><span class="lineCov"> 12 : pathcpy(extra-&gt;name, sizeof(extra-&gt;name), name);</span></a>
<a name="835"><span class="lineNum"> 835 </span><span class="lineCov"> 12 : pathimport(extra-&gt;dir, sizeof(extra-&gt;dir), dir);</span></a>
<a name="836"><span class="lineNum"> 836 </span><span class="lineCov"> 12 : pathcpy(extra-&gt;uuid, sizeof(extra-&gt;uuid), uuid);</span></a>
<a name="837"><span class="lineNum"> 837 </span> : </a>
<a name="838"><span class="lineNum"> 838 </span> : /* ensure that the dir terminate with &quot;/&quot; if it isn't empty */</a>
<a name="839"><span class="lineNum"> 839 </span><span class="lineCov"> 12 : pathslash(extra-&gt;dir, sizeof(extra-&gt;dir));</span></a>
<a name="840"><span class="lineNum"> 840 </span> : </a>
<a name="841"><span class="lineNum"> 841 </span><span class="lineCov"> 12 : extra-&gt;smartctl[0] = 0;</span></a>
<a name="842"><span class="lineNum"> 842 </span><span class="lineCov"> 60 : for (i = 0; i &lt; SMART_IGNORE_MAX; ++i)</span></a>
<a name="843"><span class="lineNum"> 843 </span><span class="lineCov"> 48 : extra-&gt;smartignore[i] = 0;</span></a>
<a name="844"><span class="lineNum"> 844 </span><span class="lineCov"> 12 : extra-&gt;fstype[0] = 0;</span></a>
<a name="845"><span class="lineNum"> 845 </span><span class="lineCov"> 12 : extra-&gt;fslabel[0] = 0;</span></a>
<a name="846"><span class="lineNum"> 846 </span><span class="lineCov"> 12 : extra-&gt;device = dev;</span></a>
<a name="847"><span class="lineNum"> 847 </span> : </a>
<a name="848"><span class="lineNum"> 848 </span><span class="lineCov"> 12 : return extra;</span></a>
<a name="849"><span class="lineNum"> 849 </span> : }</a>
<a name="850"><span class="lineNum"> 850 </span> : </a>
<a name="851"><span class="lineNum"> 851 </span><span class="lineCov"> 12 : void extra_free(struct snapraid_extra* extra)</span></a>
<a name="852"><span class="lineNum"> 852 </span> : {</a>
<a name="853"><span class="lineNum"> 853 </span><span class="lineCov"> 12 : free(extra);</span></a>
<a name="854"><span class="lineNum"> 854 </span><span class="lineCov"> 12 : }</span></a>
<a name="855"><span class="lineNum"> 855 </span> : </a>
<a name="856"><span class="lineNum"> 856 </span> : </a>
<a name="857"><span class="lineNum"> 857 </span><span class="lineCov"> 66940333 : static inline void fs_lock(struct snapraid_disk* disk)</span></a>
<a name="858"><span class="lineNum"> 858 </span> : {</a>
<a name="859"><span class="lineNum"> 859 </span> : #if HAVE_THREAD</a>
<a name="860"><span class="lineNum"> 860 </span><span class="lineCov"> 66940333 : if (!disk-&gt;single_thread)</span></a>
<a name="861"><span class="lineNum"> 861 </span><span class="lineCov"> 45907523 : thread_mutex_lock(&amp;disk-&gt;fs_mutex);</span></a>
<a name="862"><span class="lineNum"> 862 </span> : #else</a>
<a name="863"><span class="lineNum"> 863 </span> : (void)disk;</a>
<a name="864"><span class="lineNum"> 864 </span> : #endif</a>
<a name="865"><span class="lineNum"> 865 </span><span class="lineCov"> 66940333 : }</span></a>
<a name="866"><span class="lineNum"> 866 </span> : </a>
<a name="867"><span class="lineNum"> 867 </span><span class="lineCov"> 66940333 : static inline void fs_unlock(struct snapraid_disk* disk)</span></a>
<a name="868"><span class="lineNum"> 868 </span> : {</a>
<a name="869"><span class="lineNum"> 869 </span> : #if HAVE_THREAD</a>
<a name="870"><span class="lineNum"> 870 </span><span class="lineCov"> 66940333 : if (!disk-&gt;single_thread)</span></a>
<a name="871"><span class="lineNum"> 871 </span><span class="lineCov"> 45907523 : thread_mutex_unlock(&amp;disk-&gt;fs_mutex);</span></a>
<a name="872"><span class="lineNum"> 872 </span> : #else</a>
<a name="873"><span class="lineNum"> 873 </span> : (void)disk;</a>
<a name="874"><span class="lineNum"> 874 </span> : #endif</a>
<a name="875"><span class="lineNum"> 875 </span><span class="lineCov"> 66940333 : }</span></a>
<a name="876"><span class="lineNum"> 876 </span> : </a>
<a name="877"><span class="lineNum"> 877 </span> : struct extent_disk_empty {</a>
<a name="878"><span class="lineNum"> 878 </span> : block_off_t blockmax;</a>
<a name="879"><span class="lineNum"> 879 </span> : };</a>
<a name="880"><span class="lineNum"> 880 </span> : </a>
<a name="881"><span class="lineNum"> 881 </span> : /**</a>
<a name="882"><span class="lineNum"> 882 </span> : * Compare the extent if inside the specified blockmax.</a>
<a name="883"><span class="lineNum"> 883 </span> : */</a>
<a name="884"><span class="lineNum"> 884 </span><span class="lineCov"> 12 : static int extent_disk_empty_compare_unlock(const void* void_a, const void* void_b)</span></a>
<a name="885"><span class="lineNum"> 885 </span> : {</a>
<a name="886"><span class="lineNum"> 886 </span><span class="lineCov"> 12 : const struct extent_disk_empty* arg_a = void_a;</span></a>
<a name="887"><span class="lineNum"> 887 </span><span class="lineCov"> 12 : const struct snapraid_extent* arg_b = void_b;</span></a>
<a name="888"><span class="lineNum"> 888 </span> : </a>
<a name="889"><span class="lineNum"> 889 </span> : /* if the block is inside the specified blockmax, it's found */</a>
<a name="890"><span class="lineNum"> 890 </span><span class="lineCov"> 12 : if (arg_a-&gt;blockmax &gt; arg_b-&gt;parity_pos)</span></a>
<a name="891"><span class="lineNum"> 891 </span><span class="lineCov"> 7 : return 0;</span></a>
<a name="892"><span class="lineNum"> 892 </span> : </a>
<a name="893"><span class="lineNum"> 893 </span> : /* otherwise search for a smaller one */</a>
<a name="894"><span class="lineNum"> 894 </span><span class="lineCov"> 5 : return -1;</span></a>
<a name="895"><span class="lineNum"> 895 </span> : }</a>
<a name="896"><span class="lineNum"> 896 </span> : </a>
<a name="897"><span class="lineNum"> 897 </span><span class="lineCov"> 966 : int fs_is_empty(struct snapraid_disk* disk, block_off_t blockmax)</span></a>
<a name="898"><span class="lineNum"> 898 </span> : {</a>
<a name="899"><span class="lineNum"> 899 </span><span class="lineCov"> 966 : struct extent_disk_empty arg = { blockmax };</span></a>
<a name="900"><span class="lineNum"> 900 </span> : </a>
<a name="901"><span class="lineNum"> 901 </span> : /* if there is an element, it's not empty */</a>
<a name="902"><span class="lineNum"> 902 </span> : /* even if links and dirs have no block allocation */</a>
<a name="903"><span class="lineNum"> 903 </span><span class="lineCov"> 966 : if (!tommy_list_empty(&amp;disk-&gt;filelist))</span></a>
<a name="904"><span class="lineNum"> 904 </span><span class="lineCov"> 867 : return 0;</span></a>
<a name="905"><span class="lineNum"> 905 </span><span class="lineCov"> 99 : if (!tommy_list_empty(&amp;disk-&gt;linklist))</span></a>
<a name="906"><span class="lineNum"> 906 </span><span class="lineNoCov"> 0 : return 0;</span></a>
<a name="907"><span class="lineNum"> 907 </span><span class="lineCov"> 99 : if (!tommy_list_empty(&amp;disk-&gt;dirlist))</span></a>
<a name="908"><span class="lineNum"> 908 </span><span class="lineNoCov"> 0 : return 0;</span></a>
<a name="909"><span class="lineNum"> 909 </span> : </a>
<a name="910"><span class="lineNum"> 910 </span><span class="lineCov"> 99 : fs_lock(disk);</span></a>
<a name="911"><span class="lineNum"> 911 </span> : </a>
<a name="912"><span class="lineNum"> 912 </span> : /* search for any extent inside blockmax */</a>
<a name="913"><span class="lineNum"> 913 </span><span class="lineCov"> 99 : if (tommy_tree_search_compare(&amp;disk-&gt;fs_parity, extent_disk_empty_compare_unlock, &amp;arg) != 0) {</span></a>
<a name="914"><span class="lineNum"> 914 </span><span class="lineCov"> 7 : fs_unlock(disk);</span></a>
<a name="915"><span class="lineNum"> 915 </span><span class="lineCov"> 7 : return 0;</span></a>
<a name="916"><span class="lineNum"> 916 </span> : }</a>
<a name="917"><span class="lineNum"> 917 </span> : </a>
<a name="918"><span class="lineNum"> 918 </span> : /* finally, it's empty */</a>
<a name="919"><span class="lineNum"> 919 </span><span class="lineCov"> 92 : fs_unlock(disk);</span></a>
<a name="920"><span class="lineNum"> 920 </span><span class="lineCov"> 92 : return 1;</span></a>
<a name="921"><span class="lineNum"> 921 </span> : }</a>
<a name="922"><span class="lineNum"> 922 </span> : </a>
<a name="923"><span class="lineNum"> 923 </span> : struct extent_disk_size {</a>
<a name="924"><span class="lineNum"> 924 </span> : block_off_t size;</a>
<a name="925"><span class="lineNum"> 925 </span> : };</a>
<a name="926"><span class="lineNum"> 926 </span> : </a>
<a name="927"><span class="lineNum"> 927 </span> : /**</a>
<a name="928"><span class="lineNum"> 928 </span> : * Compare the extent by highest parity position.</a>
<a name="929"><span class="lineNum"> 929 </span> : *</a>
<a name="930"><span class="lineNum"> 930 </span> : * The maximum parity position is stored as size.</a>
<a name="931"><span class="lineNum"> 931 </span> : */</a>
<a name="932"><span class="lineNum"> 932 </span><span class="lineCov"> 54897 : static int extent_disk_size_compare_unlock(const void* void_a, const void* void_b)</span></a>
<a name="933"><span class="lineNum"> 933 </span> : {</a>
<a name="934"><span class="lineNum"> 934 </span><span class="lineCov"> 54897 : struct extent_disk_size* arg_a = (void*)void_a;</span></a>
<a name="935"><span class="lineNum"> 935 </span><span class="lineCov"> 54897 : const struct snapraid_extent* arg_b = void_b;</span></a>
<a name="936"><span class="lineNum"> 936 </span> : </a>
<a name="937"><span class="lineNum"> 937 </span> : /* get the maximum size */</a>
<a name="938"><span class="lineNum"> 938 </span><span class="lineCov"> 54897 : if (arg_a-&gt;size &lt; arg_b-&gt;parity_pos + arg_b-&gt;count)</span></a>
<a name="939"><span class="lineNum"> 939 </span><span class="lineCov"> 54897 : arg_a-&gt;size = arg_b-&gt;parity_pos + arg_b-&gt;count;</span></a>
<a name="940"><span class="lineNum"> 940 </span> : </a>
<a name="941"><span class="lineNum"> 941 </span> : /* search always for a bigger one */</a>
<a name="942"><span class="lineNum"> 942 </span><span class="lineCov"> 54897 : return 1;</span></a>
<a name="943"><span class="lineNum"> 943 </span> : }</a>
<a name="944"><span class="lineNum"> 944 </span> : </a>
<a name="945"><span class="lineNum"> 945 </span><span class="lineCov"> 4693 : block_off_t fs_size(struct snapraid_disk* disk)</span></a>
<a name="946"><span class="lineNum"> 946 </span> : {</a>
<a name="947"><span class="lineNum"> 947 </span><span class="lineCov"> 4693 : struct extent_disk_size arg = { 0 };</span></a>
<a name="948"><span class="lineNum"> 948 </span> : </a>
<a name="949"><span class="lineNum"> 949 </span><span class="lineCov"> 4693 : fs_lock(disk);</span></a>
<a name="950"><span class="lineNum"> 950 </span> : </a>
<a name="951"><span class="lineNum"> 951 </span><span class="lineCov"> 4693 : tommy_tree_search_compare(&amp;disk-&gt;fs_parity, extent_disk_size_compare_unlock, &amp;arg);</span></a>
<a name="952"><span class="lineNum"> 952 </span> : </a>
<a name="953"><span class="lineNum"> 953 </span><span class="lineCov"> 4693 : fs_unlock(disk);</span></a>
<a name="954"><span class="lineNum"> 954 </span> : </a>
<a name="955"><span class="lineNum"> 955 </span><span class="lineCov"> 4693 : return arg.size;</span></a>
<a name="956"><span class="lineNum"> 956 </span> : }</a>
<a name="957"><span class="lineNum"> 957 </span> : </a>
<a name="958"><span class="lineNum"> 958 </span> : struct extent_check {</a>
<a name="959"><span class="lineNum"> 959 </span> : const struct snapraid_extent* prev;</a>
<a name="960"><span class="lineNum"> 960 </span> : int result;</a>
<a name="961"><span class="lineNum"> 961 </span> : };</a>
<a name="962"><span class="lineNum"> 962 </span> : </a>
<a name="963"><span class="lineNum"> 963 </span><span class="lineCov"> 7063233 : static void extent_parity_check_foreach_unlock(void* void_arg, void* void_obj)</span></a>
<a name="964"><span class="lineNum"> 964 </span> : {</a>
<a name="965"><span class="lineNum"> 965 </span><span class="lineCov"> 7063233 : struct extent_check* arg = void_arg;</span></a>
<a name="966"><span class="lineNum"> 966 </span><span class="lineCov"> 7063233 : const struct snapraid_extent* obj = void_obj;</span></a>
<a name="967"><span class="lineNum"> 967 </span><span class="lineCov"> 7063233 : const struct snapraid_extent* prev = arg-&gt;prev;</span></a>
<a name="968"><span class="lineNum"> 968 </span> : </a>
<a name="969"><span class="lineNum"> 969 </span> : /* set the next previous block */</a>
<a name="970"><span class="lineNum"> 970 </span><span class="lineCov"> 7063233 : arg-&gt;prev = obj;</span></a>
<a name="971"><span class="lineNum"> 971 </span> : </a>
<a name="972"><span class="lineNum"> 972 </span> : /* stop reporting if too many errors */</a>
<a name="973"><span class="lineNum"> 973 </span><span class="lineCov"> 7063233 : if (arg-&gt;result &gt; 100) {</span></a>
<a name="974"><span class="lineNum"> 974 </span> : /* LCOV_EXCL_START */</a>
<a name="975"><span class="lineNum"> 975 </span> : return;</a>
<a name="976"><span class="lineNum"> 976 </span> : /* LCOV_EXCL_STOP */</a>
<a name="977"><span class="lineNum"> 977 </span> : }</a>
<a name="978"><span class="lineNum"> 978 </span> : </a>
<a name="979"><span class="lineNum"> 979 </span><span class="lineCov"> 7063233 : if (obj-&gt;count == 0) {</span></a>
<a name="980"><span class="lineNum"> 980 </span> : /* LCOV_EXCL_START */</a>
<a name="981"><span class="lineNum"> 981 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Parity count zero for file '%s' at '%u'\n&quot;,</a>
<a name="982"><span class="lineNum"> 982 </span> : obj-&gt;file-&gt;sub, obj-&gt;parity_pos);</a>
<a name="983"><span class="lineNum"> 983 </span> : ++arg-&gt;result;</a>
<a name="984"><span class="lineNum"> 984 </span> : return;</a>
<a name="985"><span class="lineNum"> 985 </span> : /* LCOV_EXCL_STOP */</a>
<a name="986"><span class="lineNum"> 986 </span> : }</a>
<a name="987"><span class="lineNum"> 987 </span> : </a>
<a name="988"><span class="lineNum"> 988 </span> : /* check only if there is a previous block */</a>
<a name="989"><span class="lineNum"> 989 </span><span class="lineCov"> 7063233 : if (!prev)</span></a>
<a name="990"><span class="lineNum"> 990 </span><span class="lineCov"> 2951 : return;</span></a>
<a name="991"><span class="lineNum"> 991 </span> : </a>
<a name="992"><span class="lineNum"> 992 </span> : /* check the order */</a>
<a name="993"><span class="lineNum"> 993 </span><span class="lineCov"> 7060282 : if (prev-&gt;parity_pos &gt;= obj-&gt;parity_pos) {</span></a>
<a name="994"><span class="lineNum"> 994 </span> : /* LCOV_EXCL_START */</a>
<a name="995"><span class="lineNum"> 995 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Parity order for files '%s' at '%u:%u' and '%s' at '%u:%u'\n&quot;,</a>
<a name="996"><span class="lineNum"> 996 </span> : prev-&gt;file-&gt;sub, prev-&gt;parity_pos, prev-&gt;count, obj-&gt;file-&gt;sub, obj-&gt;parity_pos, obj-&gt;count);</a>
<a name="997"><span class="lineNum"> 997 </span> : ++arg-&gt;result;</a>
<a name="998"><span class="lineNum"> 998 </span> : return;</a>
<a name="999"><span class="lineNum"> 999 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1000"><span class="lineNum"> 1000 </span> : }</a>
<a name="1001"><span class="lineNum"> 1001 </span> : </a>
<a name="1002"><span class="lineNum"> 1002 </span> : /* check that the extents don't overlap */</a>
<a name="1003"><span class="lineNum"> 1003 </span><span class="lineCov"> 7060282 : if (prev-&gt;parity_pos + prev-&gt;count &gt; obj-&gt;parity_pos) {</span></a>
<a name="1004"><span class="lineNum"> 1004 </span> : /* LCOV_EXCL_START */</a>
<a name="1005"><span class="lineNum"> 1005 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Parity overlap for files '%s' at '%u:%u' and '%s' at '%u:%u'\n&quot;,</a>
<a name="1006"><span class="lineNum"> 1006 </span> : prev-&gt;file-&gt;sub, prev-&gt;parity_pos, prev-&gt;count, obj-&gt;file-&gt;sub, obj-&gt;parity_pos, obj-&gt;count);</a>
<a name="1007"><span class="lineNum"> 1007 </span> : ++arg-&gt;result;</a>
<a name="1008"><span class="lineNum"> 1008 </span> : return;</a>
<a name="1009"><span class="lineNum"> 1009 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1010"><span class="lineNum"> 1010 </span> : }</a>
<a name="1011"><span class="lineNum"> 1011 </span> : }</a>
<a name="1012"><span class="lineNum"> 1012 </span> : </a>
<a name="1013"><span class="lineNum"> 1013 </span><span class="lineCov"> 7063233 : static void extent_file_check_foreach_unlock(void* void_arg, void* void_obj)</span></a>
<a name="1014"><span class="lineNum"> 1014 </span> : {</a>
<a name="1015"><span class="lineNum"> 1015 </span><span class="lineCov"> 7063233 : struct extent_check* arg = void_arg;</span></a>
<a name="1016"><span class="lineNum"> 1016 </span><span class="lineCov"> 7063233 : const struct snapraid_extent* obj = void_obj;</span></a>
<a name="1017"><span class="lineNum"> 1017 </span><span class="lineCov"> 7063233 : const struct snapraid_extent* prev = arg-&gt;prev;</span></a>
<a name="1018"><span class="lineNum"> 1018 </span> : </a>
<a name="1019"><span class="lineNum"> 1019 </span> : /* set the next previous block */</a>
<a name="1020"><span class="lineNum"> 1020 </span><span class="lineCov"> 7063233 : arg-&gt;prev = obj;</span></a>
<a name="1021"><span class="lineNum"> 1021 </span> : </a>
<a name="1022"><span class="lineNum"> 1022 </span> : /* stop reporting if too many errors */</a>
<a name="1023"><span class="lineNum"> 1023 </span><span class="lineCov"> 7063233 : if (arg-&gt;result &gt; 100) {</span></a>
<a name="1024"><span class="lineNum"> 1024 </span> : /* LCOV_EXCL_START */</a>
<a name="1025"><span class="lineNum"> 1025 </span> : return;</a>
<a name="1026"><span class="lineNum"> 1026 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1027"><span class="lineNum"> 1027 </span> : }</a>
<a name="1028"><span class="lineNum"> 1028 </span> : </a>
<a name="1029"><span class="lineNum"> 1029 </span><span class="lineCov"> 7063233 : if (obj-&gt;count == 0) {</span></a>
<a name="1030"><span class="lineNum"> 1030 </span> : /* LCOV_EXCL_START */</a>
<a name="1031"><span class="lineNum"> 1031 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: File count zero for file '%s' at '%u'\n&quot;,</a>
<a name="1032"><span class="lineNum"> 1032 </span> : obj-&gt;file-&gt;sub, obj-&gt;file_pos);</a>
<a name="1033"><span class="lineNum"> 1033 </span> : ++arg-&gt;result;</a>
<a name="1034"><span class="lineNum"> 1034 </span> : return;</a>
<a name="1035"><span class="lineNum"> 1035 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1036"><span class="lineNum"> 1036 </span> : }</a>
<a name="1037"><span class="lineNum"> 1037 </span> : </a>
<a name="1038"><span class="lineNum"> 1038 </span> : /* note that for deleted files, some extents may be missing */</a>
<a name="1039"><span class="lineNum"> 1039 </span> : </a>
<a name="1040"><span class="lineNum"> 1040 </span> : /* if the files are different */</a>
<a name="1041"><span class="lineNum"> 1041 </span><span class="lineCov"> 7063233 : if (!prev || prev-&gt;file != obj-&gt;file) {</span></a>
<a name="1042"><span class="lineNum"> 1042 </span><span class="lineCov"> 7013948 : if (prev != 0) {</span></a>
<a name="1043"><span class="lineNum"> 1043 </span><span class="lineCov"> 7010997 : if (file_flag_has(prev-&gt;file, FILE_IS_DELETED)) {</span></a>
<a name="1044"><span class="lineNum"> 1044 </span> : /* check that the extent doesn't overflow the file */</a>
<a name="1045"><span class="lineNum"> 1045 </span><span class="lineCov"> 58267 : if (prev-&gt;file_pos + prev-&gt;count &gt; prev-&gt;file-&gt;blockmax) {</span></a>
<a name="1046"><span class="lineNum"> 1046 </span> : /* LCOV_EXCL_START */</a>
<a name="1047"><span class="lineNum"> 1047 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Delete end for file '%s' at '%u:%u' overflowing size '%u'\n&quot;,</a>
<a name="1048"><span class="lineNum"> 1048 </span> : prev-&gt;file-&gt;sub, prev-&gt;file_pos, prev-&gt;count, prev-&gt;file-&gt;blockmax);</a>
<a name="1049"><span class="lineNum"> 1049 </span> : ++arg-&gt;result;</a>
<a name="1050"><span class="lineNum"> 1050 </span> : return;</a>
<a name="1051"><span class="lineNum"> 1051 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1052"><span class="lineNum"> 1052 </span> : }</a>
<a name="1053"><span class="lineNum"> 1053 </span> : } else {</a>
<a name="1054"><span class="lineNum"> 1054 </span> : /* check that the extent ends the file */</a>
<a name="1055"><span class="lineNum"> 1055 </span><span class="lineCov"> 6952730 : if (prev-&gt;file_pos + prev-&gt;count != prev-&gt;file-&gt;blockmax) {</span></a>
<a name="1056"><span class="lineNum"> 1056 </span> : /* LCOV_EXCL_START */</a>
<a name="1057"><span class="lineNum"> 1057 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: File end for file '%s' at '%u:%u' instead of size '%u'\n&quot;,</a>
<a name="1058"><span class="lineNum"> 1058 </span> : prev-&gt;file-&gt;sub, prev-&gt;file_pos, prev-&gt;count, prev-&gt;file-&gt;blockmax);</a>
<a name="1059"><span class="lineNum"> 1059 </span> : ++arg-&gt;result;</a>
<a name="1060"><span class="lineNum"> 1060 </span> : return;</a>
<a name="1061"><span class="lineNum"> 1061 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1062"><span class="lineNum"> 1062 </span> : }</a>
<a name="1063"><span class="lineNum"> 1063 </span> : }</a>
<a name="1064"><span class="lineNum"> 1064 </span> : }</a>
<a name="1065"><span class="lineNum"> 1065 </span> : </a>
<a name="1066"><span class="lineNum"> 1066 </span><span class="lineCov"> 7013948 : if (file_flag_has(obj-&gt;file, FILE_IS_DELETED)) {</span></a>
<a name="1067"><span class="lineNum"> 1067 </span> : /* check that the extent doesn't overflow the file */</a>
<a name="1068"><span class="lineNum"> 1068 </span><span class="lineCov"> 58344 : if (obj-&gt;file_pos + obj-&gt;count &gt; obj-&gt;file-&gt;blockmax) {</span></a>
<a name="1069"><span class="lineNum"> 1069 </span> : /* LCOV_EXCL_START */</a>
<a name="1070"><span class="lineNum"> 1070 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Delete start for file '%s' at '%u:%u' overflowing size '%u'\n&quot;,</a>
<a name="1071"><span class="lineNum"> 1071 </span> : obj-&gt;file-&gt;sub, obj-&gt;file_pos, obj-&gt;count, obj-&gt;file-&gt;blockmax);</a>
<a name="1072"><span class="lineNum"> 1072 </span> : ++arg-&gt;result;</a>
<a name="1073"><span class="lineNum"> 1073 </span> : return;</a>
<a name="1074"><span class="lineNum"> 1074 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1075"><span class="lineNum"> 1075 </span> : }</a>
<a name="1076"><span class="lineNum"> 1076 </span> : } else {</a>
<a name="1077"><span class="lineNum"> 1077 </span> : /* check that the extent starts the file */</a>
<a name="1078"><span class="lineNum"> 1078 </span><span class="lineCov"> 6955604 : if (obj-&gt;file_pos != 0) {</span></a>
<a name="1079"><span class="lineNum"> 1079 </span> : /* LCOV_EXCL_START */</a>
<a name="1080"><span class="lineNum"> 1080 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: File start for file '%s' at '%u:%u'\n&quot;,</a>
<a name="1081"><span class="lineNum"> 1081 </span> : obj-&gt;file-&gt;sub, obj-&gt;file_pos, obj-&gt;count);</a>
<a name="1082"><span class="lineNum"> 1082 </span> : ++arg-&gt;result;</a>
<a name="1083"><span class="lineNum"> 1083 </span> : return;</a>
<a name="1084"><span class="lineNum"> 1084 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1085"><span class="lineNum"> 1085 </span> : }</a>
<a name="1086"><span class="lineNum"> 1086 </span> : }</a>
<a name="1087"><span class="lineNum"> 1087 </span> : } else {</a>
<a name="1088"><span class="lineNum"> 1088 </span> : /* check the order */</a>
<a name="1089"><span class="lineNum"> 1089 </span><span class="lineCov"> 49285 : if (prev-&gt;file_pos &gt;= obj-&gt;file_pos) {</span></a>
<a name="1090"><span class="lineNum"> 1090 </span> : /* LCOV_EXCL_START */</a>
<a name="1091"><span class="lineNum"> 1091 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: File order for file '%s' at '%u:%u' and at '%u:%u'\n&quot;,</a>
<a name="1092"><span class="lineNum"> 1092 </span> : prev-&gt;file-&gt;sub, prev-&gt;file_pos, prev-&gt;count, obj-&gt;file_pos, obj-&gt;count);</a>
<a name="1093"><span class="lineNum"> 1093 </span> : ++arg-&gt;result;</a>
<a name="1094"><span class="lineNum"> 1094 </span> : return;</a>
<a name="1095"><span class="lineNum"> 1095 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1096"><span class="lineNum"> 1096 </span> : }</a>
<a name="1097"><span class="lineNum"> 1097 </span> : </a>
<a name="1098"><span class="lineNum"> 1098 </span><span class="lineCov"> 49285 : if (file_flag_has(obj-&gt;file, FILE_IS_DELETED)) {</span></a>
<a name="1099"><span class="lineNum"> 1099 </span> : /* check that the extents don't overlap */</a>
<a name="1100"><span class="lineNum"> 1100 </span><span class="lineCov"> 27 : if (prev-&gt;file_pos + prev-&gt;count &gt; obj-&gt;file_pos) {</span></a>
<a name="1101"><span class="lineNum"> 1101 </span> : /* LCOV_EXCL_START */</a>
<a name="1102"><span class="lineNum"> 1102 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Delete sequence for file '%s' at '%u:%u' and at '%u:%u'\n&quot;,</a>
<a name="1103"><span class="lineNum"> 1103 </span> : prev-&gt;file-&gt;sub, prev-&gt;file_pos, prev-&gt;count, obj-&gt;file_pos, obj-&gt;count);</a>
<a name="1104"><span class="lineNum"> 1104 </span> : ++arg-&gt;result;</a>
<a name="1105"><span class="lineNum"> 1105 </span> : return;</a>
<a name="1106"><span class="lineNum"> 1106 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1107"><span class="lineNum"> 1107 </span> : }</a>
<a name="1108"><span class="lineNum"> 1108 </span> : } else {</a>
<a name="1109"><span class="lineNum"> 1109 </span> : /* check that the extents are sequential */</a>
<a name="1110"><span class="lineNum"> 1110 </span><span class="lineCov"> 49258 : if (prev-&gt;file_pos + prev-&gt;count != obj-&gt;file_pos) {</span></a>
<a name="1111"><span class="lineNum"> 1111 </span> : /* LCOV_EXCL_START */</a>
<a name="1112"><span class="lineNum"> 1112 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: File sequence for file '%s' at '%u:%u' and at '%u:%u'\n&quot;,</a>
<a name="1113"><span class="lineNum"> 1113 </span> : prev-&gt;file-&gt;sub, prev-&gt;file_pos, prev-&gt;count, obj-&gt;file_pos, obj-&gt;count);</a>
<a name="1114"><span class="lineNum"> 1114 </span> : ++arg-&gt;result;</a>
<a name="1115"><span class="lineNum"> 1115 </span> : return;</a>
<a name="1116"><span class="lineNum"> 1116 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1117"><span class="lineNum"> 1117 </span> : }</a>
<a name="1118"><span class="lineNum"> 1118 </span> : }</a>
<a name="1119"><span class="lineNum"> 1119 </span> : }</a>
<a name="1120"><span class="lineNum"> 1120 </span> : }</a>
<a name="1121"><span class="lineNum"> 1121 </span> : </a>
<a name="1122"><span class="lineNum"> 1122 </span><span class="lineCov"> 3216 : int fs_check(struct snapraid_disk* disk)</span></a>
<a name="1123"><span class="lineNum"> 1123 </span> : {</a>
<a name="1124"><span class="lineNum"> 1124 </span> : struct extent_check arg;</a>
<a name="1125"><span class="lineNum"> 1125 </span> : </a>
<a name="1126"><span class="lineNum"> 1126 </span> : /* error count starts from 0 */</a>
<a name="1127"><span class="lineNum"> 1127 </span><span class="lineCov"> 3216 : arg.result = 0;</span></a>
<a name="1128"><span class="lineNum"> 1128 </span> : </a>
<a name="1129"><span class="lineNum"> 1129 </span><span class="lineCov"> 3216 : fs_lock(disk);</span></a>
<a name="1130"><span class="lineNum"> 1130 </span> : </a>
<a name="1131"><span class="lineNum"> 1131 </span> : /* check parity sequence */</a>
<a name="1132"><span class="lineNum"> 1132 </span><span class="lineCov"> 3216 : arg.prev = 0;</span></a>
<a name="1133"><span class="lineNum"> 1133 </span><span class="lineCov"> 3216 : tommy_tree_foreach_arg(&amp;disk-&gt;fs_parity, extent_parity_check_foreach_unlock, &amp;arg);</span></a>
<a name="1134"><span class="lineNum"> 1134 </span> : </a>
<a name="1135"><span class="lineNum"> 1135 </span> : /* check file sequence */</a>
<a name="1136"><span class="lineNum"> 1136 </span><span class="lineCov"> 3216 : arg.prev = 0;</span></a>
<a name="1137"><span class="lineNum"> 1137 </span><span class="lineCov"> 3216 : tommy_tree_foreach_arg(&amp;disk-&gt;fs_file, extent_file_check_foreach_unlock, &amp;arg);</span></a>
<a name="1138"><span class="lineNum"> 1138 </span> : </a>
<a name="1139"><span class="lineNum"> 1139 </span><span class="lineCov"> 3216 : fs_unlock(disk);</span></a>
<a name="1140"><span class="lineNum"> 1140 </span> : </a>
<a name="1141"><span class="lineNum"> 1141 </span><span class="lineCov"> 3216 : if (arg.result != 0)</span></a>
<a name="1142"><span class="lineNum"> 1142 </span><span class="lineNoCov"> 0 : return -1;</span></a>
<a name="1143"><span class="lineNum"> 1143 </span> : </a>
<a name="1144"><span class="lineNum"> 1144 </span><span class="lineCov"> 3216 : return 0;</span></a>
<a name="1145"><span class="lineNum"> 1145 </span> : }</a>
<a name="1146"><span class="lineNum"> 1146 </span> : </a>
<a name="1147"><span class="lineNum"> 1147 </span> : struct extent_parity_inside {</a>
<a name="1148"><span class="lineNum"> 1148 </span> : block_off_t parity_pos;</a>
<a name="1149"><span class="lineNum"> 1149 </span> : };</a>
<a name="1150"><span class="lineNum"> 1150 </span> : </a>
<a name="1151"><span class="lineNum"> 1151 </span> : /**</a>
<a name="1152"><span class="lineNum"> 1152 </span> : * Compare the extent if containing the specified parity position.</a>
<a name="1153"><span class="lineNum"> 1153 </span> : */</a>
<a name="1154"><span class="lineNum"> 1154 </span><span class="lineCov"> 165823214 : static int extent_parity_inside_compare_unlock(const void* void_a, const void* void_b)</span></a>
<a name="1155"><span class="lineNum"> 1155 </span> : {</a>
<a name="1156"><span class="lineNum"> 1156 </span><span class="lineCov"> 165823214 : const struct extent_parity_inside* arg_a = void_a;</span></a>
<a name="1157"><span class="lineNum"> 1157 </span><span class="lineCov"> 165823214 : const struct snapraid_extent* arg_b = void_b;</span></a>
<a name="1158"><span class="lineNum"> 1158 </span> : </a>
<a name="1159"><span class="lineNum"> 1159 </span><span class="lineCov"> 165823214 : if (arg_a-&gt;parity_pos &lt; arg_b-&gt;parity_pos)</span></a>
<a name="1160"><span class="lineNum"> 1160 </span><span class="lineCov"> 59877991 : return -1;</span></a>
<a name="1161"><span class="lineNum"> 1161 </span><span class="lineCov"> 105945223 : if (arg_a-&gt;parity_pos &gt;= arg_b-&gt;parity_pos + arg_b-&gt;count)</span></a>
<a name="1162"><span class="lineNum"> 1162 </span><span class="lineCov"> 92969131 : return 1;</span></a>
<a name="1163"><span class="lineNum"> 1163 </span> : </a>
<a name="1164"><span class="lineNum"> 1164 </span><span class="lineCov"> 12976092 : return 0;</span></a>
<a name="1165"><span class="lineNum"> 1165 </span> : }</a>
<a name="1166"><span class="lineNum"> 1166 </span> : </a>
<a name="1167"><span class="lineNum"> 1167 </span> : /**</a>
<a name="1168"><span class="lineNum"> 1168 </span> : * Search the extent at the specified parity position.</a>
<a name="1169"><span class="lineNum"> 1169 </span> : * The search is optimized for sequential accesses.</a>
<a name="1170"><span class="lineNum"> 1170 </span> : * \return If not found return 0</a>
<a name="1171"><span class="lineNum"> 1171 </span> : */</a>
<a name="1172"><span class="lineNum"> 1172 </span><span class="lineCov"> 51736178 : static struct snapraid_extent* fs_par2extent_get_unlock(struct snapraid_disk* disk, struct snapraid_extent** fs_last, block_off_t parity_pos)</span></a>
<a name="1173"><span class="lineNum"> 1173 </span> : {</a>
<a name="1174"><span class="lineNum"> 1174 </span> : struct snapraid_extent* extent;</a>
<a name="1175"><span class="lineNum"> 1175 </span> : </a>
<a name="1176"><span class="lineNum"> 1176 </span> : /* check if the last accessed extent matches */</a>
<a name="1177"><span class="lineNum"> 1177 </span><span class="lineCov"> 51736178 : if (*fs_last</span></a>
<a name="1178"><span class="lineNum"> 1178 </span><span class="lineCov"> 51701294 : &amp;&amp; parity_pos &gt;= (*fs_last)-&gt;parity_pos</span></a>
<a name="1179"><span class="lineNum"> 1179 </span><span class="lineCov"> 51014685 : &amp;&amp; parity_pos &lt; (*fs_last)-&gt;parity_pos + (*fs_last)-&gt;count</span></a>
<a name="1180"><span class="lineNum"> 1180 </span> : ) {</a>
<a name="1181"><span class="lineNum"> 1181 </span><span class="lineCov"> 36630889 : extent = *fs_last;</span></a>
<a name="1182"><span class="lineNum"> 1182 </span> : } else {</a>
<a name="1183"><span class="lineNum"> 1183 </span><span class="lineCov"> 15105289 : struct extent_parity_inside arg = { parity_pos };</span></a>
<a name="1184"><span class="lineNum"> 1184 </span><span class="lineCov"> 15105289 : extent = tommy_tree_search_compare(&amp;disk-&gt;fs_parity, extent_parity_inside_compare_unlock, &amp;arg);</span></a>
<a name="1185"><span class="lineNum"> 1185 </span> : }</a>
<a name="1186"><span class="lineNum"> 1186 </span> : </a>
<a name="1187"><span class="lineNum"> 1187 </span><span class="lineCov"> 51736178 : if (!extent)</span></a>
<a name="1188"><span class="lineNum"> 1188 </span><span class="lineCov"> 2129197 : return 0;</span></a>
<a name="1189"><span class="lineNum"> 1189 </span> : </a>
<a name="1190"><span class="lineNum"> 1190 </span> : /* store the last accessed extent */</a>
<a name="1191"><span class="lineNum"> 1191 </span><span class="lineCov"> 49606981 : *fs_last = extent;</span></a>
<a name="1192"><span class="lineNum"> 1192 </span> : </a>
<a name="1193"><span class="lineNum"> 1193 </span><span class="lineCov"> 49606981 : return extent;</span></a>
<a name="1194"><span class="lineNum"> 1194 </span> : }</a>
<a name="1195"><span class="lineNum"> 1195 </span> : </a>
<a name="1196"><span class="lineNum"> 1196 </span> : struct extent_file_inside {</a>
<a name="1197"><span class="lineNum"> 1197 </span> : struct snapraid_file* file;</a>
<a name="1198"><span class="lineNum"> 1198 </span> : block_off_t file_pos;</a>
<a name="1199"><span class="lineNum"> 1199 </span> : };</a>
<a name="1200"><span class="lineNum"> 1200 </span> : </a>
<a name="1201"><span class="lineNum"> 1201 </span> : /**</a>
<a name="1202"><span class="lineNum"> 1202 </span> : * Compare the extent if containing the specified file position.</a>
<a name="1203"><span class="lineNum"> 1203 </span> : */</a>
<a name="1204"><span class="lineNum"> 1204 </span><span class="lineCov"> 23526371 : static int extent_file_inside_compare_unlock(const void* void_a, const void* void_b)</span></a>
<a name="1205"><span class="lineNum"> 1205 </span> : {</a>
<a name="1206"><span class="lineNum"> 1206 </span><span class="lineCov"> 23526371 : const struct extent_file_inside* arg_a = void_a;</span></a>
<a name="1207"><span class="lineNum"> 1207 </span><span class="lineCov"> 23526371 : const struct snapraid_extent* arg_b = void_b;</span></a>
<a name="1208"><span class="lineNum"> 1208 </span> : </a>
<a name="1209"><span class="lineNum"> 1209 </span><span class="lineCov"> 23526371 : if (arg_a-&gt;file &lt; arg_b-&gt;file)</span></a>
<a name="1210"><span class="lineNum"> 1210 </span><span class="lineCov"> 9893231 : return -1;</span></a>
<a name="1211"><span class="lineNum"> 1211 </span><span class="lineCov"> 13633140 : if (arg_a-&gt;file &gt; arg_b-&gt;file)</span></a>
<a name="1212"><span class="lineNum"> 1212 </span><span class="lineCov"> 11392783 : return 1;</span></a>
<a name="1213"><span class="lineNum"> 1213 </span> : </a>
<a name="1214"><span class="lineNum"> 1214 </span><span class="lineCov"> 2240357 : if (arg_a-&gt;file_pos &lt; arg_b-&gt;file_pos)</span></a>
<a name="1215"><span class="lineNum"> 1215 </span><span class="lineCov"> 8217 : return -1;</span></a>
<a name="1216"><span class="lineNum"> 1216 </span><span class="lineCov"> 2232140 : if (arg_a-&gt;file_pos &gt;= arg_b-&gt;file_pos + arg_b-&gt;count)</span></a>
<a name="1217"><span class="lineNum"> 1217 </span><span class="lineCov"> 9331 : return 1;</span></a>
<a name="1218"><span class="lineNum"> 1218 </span> : </a>
<a name="1219"><span class="lineNum"> 1219 </span><span class="lineCov"> 2222809 : return 0;</span></a>
<a name="1220"><span class="lineNum"> 1220 </span> : }</a>
<a name="1221"><span class="lineNum"> 1221 </span> : </a>
<a name="1222"><span class="lineNum"> 1222 </span> : /**</a>
<a name="1223"><span class="lineNum"> 1223 </span> : * Search the extent at the specified file position.</a>
<a name="1224"><span class="lineNum"> 1224 </span> : * The search is optimized for sequential accesses.</a>
<a name="1225"><span class="lineNum"> 1225 </span> : * \return If not found return 0</a>
<a name="1226"><span class="lineNum"> 1226 </span> : */</a>
<a name="1227"><span class="lineNum"> 1227 </span><span class="lineCov"> 11255059 : static struct snapraid_extent* fs_file2extent_get_unlock(struct snapraid_disk* disk, struct snapraid_extent** fs_last, struct snapraid_file* file, block_off_t file_pos)</span></a>
<a name="1228"><span class="lineNum"> 1228 </span> : {</a>
<a name="1229"><span class="lineNum"> 1229 </span> : struct snapraid_extent* extent;</a>
<a name="1230"><span class="lineNum"> 1230 </span> : </a>
<a name="1231"><span class="lineNum"> 1231 </span> : /* check if the last accessed extent matches */</a>
<a name="1232"><span class="lineNum"> 1232 </span><span class="lineCov"> 11255059 : if (*fs_last</span></a>
<a name="1233"><span class="lineNum"> 1233 </span><span class="lineCov"> 11232768 : &amp;&amp; file == (*fs_last)-&gt;file</span></a>
<a name="1234"><span class="lineNum"> 1234 </span><span class="lineCov"> 9047495 : &amp;&amp; file_pos &gt;= (*fs_last)-&gt;file_pos</span></a>
<a name="1235"><span class="lineNum"> 1235 </span><span class="lineCov"> 9047495 : &amp;&amp; file_pos &lt; (*fs_last)-&gt;file_pos + (*fs_last)-&gt;count</span></a>
<a name="1236"><span class="lineNum"> 1236 </span> : ) {</a>
<a name="1237"><span class="lineNum"> 1237 </span><span class="lineCov"> 9032242 : extent = *fs_last;</span></a>
<a name="1238"><span class="lineNum"> 1238 </span> : } else {</a>
<a name="1239"><span class="lineNum"> 1239 </span><span class="lineCov"> 2222817 : struct extent_file_inside arg = { file, file_pos };</span></a>
<a name="1240"><span class="lineNum"> 1240 </span><span class="lineCov"> 2222817 : extent = tommy_tree_search_compare(&amp;disk-&gt;fs_file, extent_file_inside_compare_unlock, &amp;arg);</span></a>
<a name="1241"><span class="lineNum"> 1241 </span> : }</a>
<a name="1242"><span class="lineNum"> 1242 </span> : </a>
<a name="1243"><span class="lineNum"> 1243 </span><span class="lineCov"> 11255059 : if (!extent)</span></a>
<a name="1244"><span class="lineNum"> 1244 </span><span class="lineCov"> 8 : return 0;</span></a>
<a name="1245"><span class="lineNum"> 1245 </span> : </a>
<a name="1246"><span class="lineNum"> 1246 </span> : /* store the last accessed extent */</a>
<a name="1247"><span class="lineNum"> 1247 </span><span class="lineCov"> 11255051 : *fs_last = extent;</span></a>
<a name="1248"><span class="lineNum"> 1248 </span> : </a>
<a name="1249"><span class="lineNum"> 1249 </span><span class="lineCov"> 11255051 : return extent;</span></a>
<a name="1250"><span class="lineNum"> 1250 </span> : }</a>
<a name="1251"><span class="lineNum"> 1251 </span> : </a>
<a name="1252"><span class="lineNum"> 1252 </span><span class="lineCov"> 51632348 : struct snapraid_file* fs_par2file_find(struct snapraid_disk* disk, block_off_t parity_pos, block_off_t* file_pos)</span></a>
<a name="1253"><span class="lineNum"> 1253 </span> : {</a>
<a name="1254"><span class="lineNum"> 1254 </span> : struct snapraid_extent* extent;</a>
<a name="1255"><span class="lineNum"> 1255 </span> : struct snapraid_file* file;</a>
<a name="1256"><span class="lineNum"> 1256 </span> : </a>
<a name="1257"><span class="lineNum"> 1257 </span><span class="lineCov"> 51632348 : fs_lock(disk);</span></a>
<a name="1258"><span class="lineNum"> 1258 </span> : </a>
<a name="1259"><span class="lineNum"> 1259 </span><span class="lineCov"> 51632348 : extent = fs_par2extent_get_unlock(disk, &amp;disk-&gt;fs_last, parity_pos);</span></a>
<a name="1260"><span class="lineNum"> 1260 </span> : </a>
<a name="1261"><span class="lineNum"> 1261 </span><span class="lineCov"> 51632348 : if (!extent) {</span></a>
<a name="1262"><span class="lineNum"> 1262 </span><span class="lineCov"> 2129197 : fs_unlock(disk);</span></a>
<a name="1263"><span class="lineNum"> 1263 </span><span class="lineCov"> 2129197 : return 0;</span></a>
<a name="1264"><span class="lineNum"> 1264 </span> : }</a>
<a name="1265"><span class="lineNum"> 1265 </span> : </a>
<a name="1266"><span class="lineNum"> 1266 </span><span class="lineCov"> 49503151 : if (file_pos)</span></a>
<a name="1267"><span class="lineNum"> 1267 </span><span class="lineCov"> 49293033 : *file_pos = extent-&gt;file_pos + (parity_pos - extent-&gt;parity_pos);</span></a>
<a name="1268"><span class="lineNum"> 1268 </span> : </a>
<a name="1269"><span class="lineNum"> 1269 </span><span class="lineCov"> 49503151 : file = extent-&gt;file;</span></a>
<a name="1270"><span class="lineNum"> 1270 </span> : </a>
<a name="1271"><span class="lineNum"> 1271 </span><span class="lineCov"> 49503151 : fs_unlock(disk);</span></a>
<a name="1272"><span class="lineNum"> 1272 </span><span class="lineCov"> 49503151 : return file;</span></a>
<a name="1273"><span class="lineNum"> 1273 </span> : }</a>
<a name="1274"><span class="lineNum"> 1274 </span> : </a>
<a name="1275"><span class="lineNum"> 1275 </span><span class="lineCov"> 5433531 : block_off_t fs_file2par_find(struct snapraid_disk* disk, struct snapraid_file* file, block_off_t file_pos)</span></a>
<a name="1276"><span class="lineNum"> 1276 </span> : {</a>
<a name="1277"><span class="lineNum"> 1277 </span> : struct snapraid_extent* extent;</a>
<a name="1278"><span class="lineNum"> 1278 </span> : block_off_t ret;</a>
<a name="1279"><span class="lineNum"> 1279 </span> : </a>
<a name="1280"><span class="lineNum"> 1280 </span><span class="lineCov"> 5433531 : fs_lock(disk);</span></a>
<a name="1281"><span class="lineNum"> 1281 </span> : </a>
<a name="1282"><span class="lineNum"> 1282 </span><span class="lineCov"> 5433531 : extent = fs_file2extent_get_unlock(disk, &amp;disk-&gt;fs_last, file, file_pos);</span></a>
<a name="1283"><span class="lineNum"> 1283 </span><span class="lineCov"> 5433531 : if (!extent) {</span></a>
<a name="1284"><span class="lineNum"> 1284 </span><span class="lineCov"> 8 : fs_unlock(disk);</span></a>
<a name="1285"><span class="lineNum"> 1285 </span><span class="lineCov"> 8 : return POS_NULL;</span></a>
<a name="1286"><span class="lineNum"> 1286 </span> : }</a>
<a name="1287"><span class="lineNum"> 1287 </span> : </a>
<a name="1288"><span class="lineNum"> 1288 </span><span class="lineCov"> 5433523 : ret = extent-&gt;parity_pos + (file_pos - extent-&gt;file_pos);</span></a>
<a name="1289"><span class="lineNum"> 1289 </span> : </a>
<a name="1290"><span class="lineNum"> 1290 </span><span class="lineCov"> 5433523 : fs_unlock(disk);</span></a>
<a name="1291"><span class="lineNum"> 1291 </span><span class="lineCov"> 5433523 : return ret;</span></a>
<a name="1292"><span class="lineNum"> 1292 </span> : }</a>
<a name="1293"><span class="lineNum"> 1293 </span> : </a>
<a name="1294"><span class="lineNum"> 1294 </span><span class="lineCov"> 9762616 : void fs_allocate(struct snapraid_disk* disk, block_off_t parity_pos, struct snapraid_file* file, block_off_t file_pos)</span></a>
<a name="1295"><span class="lineNum"> 1295 </span> : {</a>
<a name="1296"><span class="lineNum"> 1296 </span> : struct snapraid_extent* extent;</a>
<a name="1297"><span class="lineNum"> 1297 </span> : struct snapraid_extent* parity_extent;</a>
<a name="1298"><span class="lineNum"> 1298 </span> : struct snapraid_extent* file_extent;</a>
<a name="1299"><span class="lineNum"> 1299 </span> : </a>
<a name="1300"><span class="lineNum"> 1300 </span><span class="lineCov"> 9762616 : fs_lock(disk);</span></a>
<a name="1301"><span class="lineNum"> 1301 </span> : </a>
<a name="1302"><span class="lineNum"> 1302 </span><span class="lineCov"> 9762616 : if (file_pos &gt; 0) {</span></a>
<a name="1303"><span class="lineNum"> 1303 </span> : /* search an existing extent for the previous file_pos */</a>
<a name="1304"><span class="lineNum"> 1304 </span><span class="lineCov"> 5821528 : extent = fs_file2extent_get_unlock(disk, &amp;disk-&gt;fs_last, file, file_pos - 1);</span></a>
<a name="1305"><span class="lineNum"> 1305 </span> : </a>
<a name="1306"><span class="lineNum"> 1306 </span><span class="lineCov"> 5821528 : if (extent != 0 &amp;&amp; parity_pos == extent-&gt;parity_pos + extent-&gt;count) {</span></a>
<a name="1307"><span class="lineNum"> 1307 </span> : /* ensure that we are extending the extent at the end */</a>
<a name="1308"><span class="lineNum"> 1308 </span><span class="lineCov"> 5793016 : if (file_pos != extent-&gt;file_pos + extent-&gt;count) {</span></a>
<a name="1309"><span class="lineNum"> 1309 </span> : /* LCOV_EXCL_START */</a>
<a name="1310"><span class="lineNum"> 1310 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Allocating file '%s' at position '%u/%u' in the middle of extent '%u:%u' in disk '%s'\n&quot;, file-&gt;sub, file_pos, file-&gt;blockmax, extent-&gt;file_pos, extent-&gt;count, disk-&gt;name);</a>
<a name="1311"><span class="lineNum"> 1311 </span> : os_abort();</a>
<a name="1312"><span class="lineNum"> 1312 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1313"><span class="lineNum"> 1313 </span> : }</a>
<a name="1314"><span class="lineNum"> 1314 </span> : </a>
<a name="1315"><span class="lineNum"> 1315 </span> : /* extend the existing extent */</a>
<a name="1316"><span class="lineNum"> 1316 </span><span class="lineCov"> 5793016 : ++extent-&gt;count;</span></a>
<a name="1317"><span class="lineNum"> 1317 </span> : </a>
<a name="1318"><span class="lineNum"> 1318 </span><span class="lineCov"> 5793016 : fs_unlock(disk);</span></a>
<a name="1319"><span class="lineNum"> 1319 </span><span class="lineCov"> 5793016 : return;</span></a>
<a name="1320"><span class="lineNum"> 1320 </span> : }</a>
<a name="1321"><span class="lineNum"> 1321 </span> : }</a>
<a name="1322"><span class="lineNum"> 1322 </span> : </a>
<a name="1323"><span class="lineNum"> 1323 </span> : /* a extent doesn't exist, and we have to create a new one */</a>
<a name="1324"><span class="lineNum"> 1324 </span><span class="lineCov"> 3969600 : extent = extent_alloc(parity_pos, file, file_pos, 1);</span></a>
<a name="1325"><span class="lineNum"> 1325 </span> : </a>
<a name="1326"><span class="lineNum"> 1326 </span> : /* insert the extent in the trees */</a>
<a name="1327"><span class="lineNum"> 1327 </span><span class="lineCov"> 3969600 : parity_extent = tommy_tree_insert(&amp;disk-&gt;fs_parity, &amp;extent-&gt;parity_node, extent);</span></a>
<a name="1328"><span class="lineNum"> 1328 </span><span class="lineCov"> 3969600 : file_extent = tommy_tree_insert(&amp;disk-&gt;fs_file, &amp;extent-&gt;file_node, extent);</span></a>
<a name="1329"><span class="lineNum"> 1329 </span> : </a>
<a name="1330"><span class="lineNum"> 1330 </span><span class="lineCov"> 3969600 : if (parity_extent != extent || file_extent != extent) {</span></a>
<a name="1331"><span class="lineNum"> 1331 </span> : /* LCOV_EXCL_START */</a>
<a name="1332"><span class="lineNum"> 1332 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Allocating file '%s' at position '%u/%u' for existing extent '%u:%u' in disk '%s'\n&quot;, file-&gt;sub, file_pos, file-&gt;blockmax, extent-&gt;file_pos, extent-&gt;count, disk-&gt;name);</a>
<a name="1333"><span class="lineNum"> 1333 </span> : os_abort();</a>
<a name="1334"><span class="lineNum"> 1334 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1335"><span class="lineNum"> 1335 </span> : }</a>
<a name="1336"><span class="lineNum"> 1336 </span> : </a>
<a name="1337"><span class="lineNum"> 1337 </span> : /* store the last accessed extent */</a>
<a name="1338"><span class="lineNum"> 1338 </span><span class="lineCov"> 3969600 : disk-&gt;fs_last = extent;</span></a>
<a name="1339"><span class="lineNum"> 1339 </span> : </a>
<a name="1340"><span class="lineNum"> 1340 </span><span class="lineCov"> 3969600 : fs_unlock(disk);</span></a>
<a name="1341"><span class="lineNum"> 1341 </span> : }</a>
<a name="1342"><span class="lineNum"> 1342 </span> : </a>
<a name="1343"><span class="lineNum"> 1343 </span><span class="lineCov"> 103830 : void fs_deallocate(struct snapraid_disk* disk, block_off_t parity_pos)</span></a>
<a name="1344"><span class="lineNum"> 1344 </span> : {</a>
<a name="1345"><span class="lineNum"> 1345 </span> : struct snapraid_extent* extent;</a>
<a name="1346"><span class="lineNum"> 1346 </span> : struct snapraid_extent* second_extent;</a>
<a name="1347"><span class="lineNum"> 1347 </span> : struct snapraid_extent* parity_extent;</a>
<a name="1348"><span class="lineNum"> 1348 </span> : struct snapraid_extent* file_extent;</a>
<a name="1349"><span class="lineNum"> 1349 </span> : block_off_t first_count, second_count;</a>
<a name="1350"><span class="lineNum"> 1350 </span> : </a>
<a name="1351"><span class="lineNum"> 1351 </span><span class="lineCov"> 103830 : fs_lock(disk);</span></a>
<a name="1352"><span class="lineNum"> 1352 </span> : </a>
<a name="1353"><span class="lineNum"> 1353 </span><span class="lineCov"> 103830 : extent = fs_par2extent_get_unlock(disk, &amp;disk-&gt;fs_last, parity_pos);</span></a>
<a name="1354"><span class="lineNum"> 1354 </span><span class="lineCov"> 103830 : if (!extent) {</span></a>
<a name="1355"><span class="lineNum"> 1355 </span> : /* LCOV_EXCL_START */</a>
<a name="1356"><span class="lineNum"> 1356 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Deallocating parity position '%u' for not existing extent in disk '%s'\n&quot;, parity_pos, disk-&gt;name);</a>
<a name="1357"><span class="lineNum"> 1357 </span> : os_abort();</a>
<a name="1358"><span class="lineNum"> 1358 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1359"><span class="lineNum"> 1359 </span> : }</a>
<a name="1360"><span class="lineNum"> 1360 </span> : </a>
<a name="1361"><span class="lineNum"> 1361 </span> : /* if it's the only block of the extent, delete it */</a>
<a name="1362"><span class="lineNum"> 1362 </span><span class="lineCov"> 103830 : if (extent-&gt;count == 1) {</span></a>
<a name="1363"><span class="lineNum"> 1363 </span> : /* remove from the trees */</a>
<a name="1364"><span class="lineNum"> 1364 </span><span class="lineCov"> 38192 : tommy_tree_remove(&amp;disk-&gt;fs_parity, extent);</span></a>
<a name="1365"><span class="lineNum"> 1365 </span><span class="lineCov"> 38192 : tommy_tree_remove(&amp;disk-&gt;fs_file, extent);</span></a>
<a name="1366"><span class="lineNum"> 1366 </span> : </a>
<a name="1367"><span class="lineNum"> 1367 </span> : /* deallocate */</a>
<a name="1368"><span class="lineNum"> 1368 </span><span class="lineCov"> 38192 : extent_free(extent);</span></a>
<a name="1369"><span class="lineNum"> 1369 </span> : </a>
<a name="1370"><span class="lineNum"> 1370 </span> : /* clear the last accessed extent */</a>
<a name="1371"><span class="lineNum"> 1371 </span><span class="lineCov"> 38192 : disk-&gt;fs_last = 0;</span></a>
<a name="1372"><span class="lineNum"> 1372 </span> : </a>
<a name="1373"><span class="lineNum"> 1373 </span><span class="lineCov"> 38192 : fs_unlock(disk);</span></a>
<a name="1374"><span class="lineNum"> 1374 </span><span class="lineCov"> 38192 : return;</span></a>
<a name="1375"><span class="lineNum"> 1375 </span> : }</a>
<a name="1376"><span class="lineNum"> 1376 </span> : </a>
<a name="1377"><span class="lineNum"> 1377 </span> : /* if it's at the start of the extent, shrink the extent */</a>
<a name="1378"><span class="lineNum"> 1378 </span><span class="lineCov"> 65638 : if (parity_pos == extent-&gt;parity_pos) {</span></a>
<a name="1379"><span class="lineNum"> 1379 </span><span class="lineCov"> 65635 : ++extent-&gt;parity_pos;</span></a>
<a name="1380"><span class="lineNum"> 1380 </span><span class="lineCov"> 65635 : ++extent-&gt;file_pos;</span></a>
<a name="1381"><span class="lineNum"> 1381 </span><span class="lineCov"> 65635 : --extent-&gt;count;</span></a>
<a name="1382"><span class="lineNum"> 1382 </span> : </a>
<a name="1383"><span class="lineNum"> 1383 </span><span class="lineCov"> 65635 : fs_unlock(disk);</span></a>
<a name="1384"><span class="lineNum"> 1384 </span><span class="lineCov"> 65635 : return;</span></a>
<a name="1385"><span class="lineNum"> 1385 </span> : }</a>
<a name="1386"><span class="lineNum"> 1386 </span> : </a>
<a name="1387"><span class="lineNum"> 1387 </span> : /* if it's at the end of the extent, shrink the extent */</a>
<a name="1388"><span class="lineNum"> 1388 </span><span class="lineCov"> 3 : if (parity_pos == extent-&gt;parity_pos + extent-&gt;count - 1) {</span></a>
<a name="1389"><span class="lineNum"> 1389 </span><span class="lineCov"> 1 : --extent-&gt;count;</span></a>
<a name="1390"><span class="lineNum"> 1390 </span> : </a>
<a name="1391"><span class="lineNum"> 1391 </span><span class="lineCov"> 1 : fs_unlock(disk);</span></a>
<a name="1392"><span class="lineNum"> 1392 </span><span class="lineCov"> 1 : return;</span></a>
<a name="1393"><span class="lineNum"> 1393 </span> : }</a>
<a name="1394"><span class="lineNum"> 1394 </span> : </a>
<a name="1395"><span class="lineNum"> 1395 </span> : /* otherwise it's in the middle */</a>
<a name="1396"><span class="lineNum"> 1396 </span><span class="lineCov"> 2 : first_count = parity_pos - extent-&gt;parity_pos;</span></a>
<a name="1397"><span class="lineNum"> 1397 </span><span class="lineCov"> 2 : second_count = extent-&gt;count - first_count - 1;</span></a>
<a name="1398"><span class="lineNum"> 1398 </span> : </a>
<a name="1399"><span class="lineNum"> 1399 </span> : /* adjust the first extent */</a>
<a name="1400"><span class="lineNum"> 1400 </span><span class="lineCov"> 2 : extent-&gt;count = first_count;</span></a>
<a name="1401"><span class="lineNum"> 1401 </span> : </a>
<a name="1402"><span class="lineNum"> 1402 </span> : /* allocate the second extent */</a>
<a name="1403"><span class="lineNum"> 1403 </span><span class="lineCov"> 2 : second_extent = extent_alloc(extent-&gt;parity_pos + first_count + 1, extent-&gt;file, extent-&gt;file_pos + first_count + 1, second_count);</span></a>
<a name="1404"><span class="lineNum"> 1404 </span> : </a>
<a name="1405"><span class="lineNum"> 1405 </span> : /* insert the extent in the trees */</a>
<a name="1406"><span class="lineNum"> 1406 </span><span class="lineCov"> 2 : parity_extent = tommy_tree_insert(&amp;disk-&gt;fs_parity, &amp;second_extent-&gt;parity_node, second_extent);</span></a>
<a name="1407"><span class="lineNum"> 1407 </span><span class="lineCov"> 2 : file_extent = tommy_tree_insert(&amp;disk-&gt;fs_file, &amp;second_extent-&gt;file_node, second_extent);</span></a>
<a name="1408"><span class="lineNum"> 1408 </span> : </a>
<a name="1409"><span class="lineNum"> 1409 </span><span class="lineCov"> 2 : if (parity_extent != second_extent || file_extent != second_extent) {</span></a>
<a name="1410"><span class="lineNum"> 1410 </span> : /* LCOV_EXCL_START */</a>
<a name="1411"><span class="lineNum"> 1411 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Deallocating parity position '%u' for splitting extent '%u:%u' in disk '%s'\n&quot;, parity_pos, second_extent-&gt;file_pos, second_extent-&gt;count, disk-&gt;name);</a>
<a name="1412"><span class="lineNum"> 1412 </span> : os_abort();</a>
<a name="1413"><span class="lineNum"> 1413 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1414"><span class="lineNum"> 1414 </span> : }</a>
<a name="1415"><span class="lineNum"> 1415 </span> : </a>
<a name="1416"><span class="lineNum"> 1416 </span> : /* store the last accessed extent */</a>
<a name="1417"><span class="lineNum"> 1417 </span><span class="lineCov"> 2 : disk-&gt;fs_last = second_extent;</span></a>
<a name="1418"><span class="lineNum"> 1418 </span> : </a>
<a name="1419"><span class="lineNum"> 1419 </span><span class="lineCov"> 2 : fs_unlock(disk);</span></a>
<a name="1420"><span class="lineNum"> 1420 </span> : }</a>
<a name="1421"><span class="lineNum"> 1421 </span> : </a>
<a name="1422"><span class="lineNum"> 1422 </span><span class="lineCov"> 58245299 : struct snapraid_block* fs_file2block_get(struct snapraid_file* file, block_off_t file_pos)</span></a>
<a name="1423"><span class="lineNum"> 1423 </span> : {</a>
<a name="1424"><span class="lineNum"> 1424 </span><span class="lineCov"> 58245299 : if (file_pos &gt;= file-&gt;blockmax) {</span></a>
<a name="1425"><span class="lineNum"> 1425 </span> : /* LCOV_EXCL_START */</a>
<a name="1426"><span class="lineNum"> 1426 </span> : log_fatal(EINTERNAL, &quot;Internal inconsistency: Dereferencing file '%s' at position '%u/%u'\n&quot;, file-&gt;sub, file_pos, file-&gt;blockmax);</a>
<a name="1427"><span class="lineNum"> 1427 </span> : os_abort();</a>
<a name="1428"><span class="lineNum"> 1428 </span> : /* LCOV_EXCL_STOP */</a>
<a name="1429"><span class="lineNum"> 1429 </span> : }</a>
<a name="1430"><span class="lineNum"> 1430 </span> : </a>
<a name="1431"><span class="lineNum"> 1431 </span><span class="lineCov"> 58245299 : return file_block(file, file_pos);</span></a>
<a name="1432"><span class="lineNum"> 1432 </span> : }</a>
<a name="1433"><span class="lineNum"> 1433 </span> : </a>
<a name="1434"><span class="lineNum"> 1434 </span><span class="lineCov"> 39756942 : struct snapraid_block* fs_par2block_find(struct snapraid_disk* disk, block_off_t parity_pos)</span></a>
<a name="1435"><span class="lineNum"> 1435 </span> : {</a>
<a name="1436"><span class="lineNum"> 1436 </span> : struct snapraid_file* file;</a>
<a name="1437"><span class="lineNum"> 1437 </span> : block_off_t file_pos;</a>
<a name="1438"><span class="lineNum"> 1438 </span> : </a>
<a name="1439"><span class="lineNum"> 1439 </span><span class="lineCov"> 39756942 : file = fs_par2file_find(disk, parity_pos, &amp;file_pos);</span></a>
<a name="1440"><span class="lineNum"> 1440 </span><span class="lineCov"> 39756942 : if (file == 0)</span></a>
<a name="1441"><span class="lineNum"> 1441 </span><span class="lineCov"> 2129197 : return BLOCK_NULL;</span></a>
<a name="1442"><span class="lineNum"> 1442 </span> : </a>
<a name="1443"><span class="lineNum"> 1443 </span><span class="lineCov"> 37627745 : return fs_file2block_get(file, file_pos);</span></a>
<a name="1444"><span class="lineNum"> 1444 </span> : }</a>
<a name="1445"><span class="lineNum"> 1445 </span> : </a>
<a name="1446"><span class="lineNum"> 1446 </span><span class="lineCov"> 1675 : struct snapraid_map* map_alloc(const char* name, unsigned position, block_off_t total_blocks, block_off_t free_blocks, const char* uuid)</span></a>
<a name="1447"><span class="lineNum"> 1447 </span> : {</a>
<a name="1448"><span class="lineNum"> 1448 </span> : struct snapraid_map* map;</a>
<a name="1449"><span class="lineNum"> 1449 </span> : </a>
<a name="1450"><span class="lineNum"> 1450 </span><span class="lineCov"> 1675 : map = malloc_nofail(sizeof(struct snapraid_map));</span></a>
<a name="1451"><span class="lineNum"> 1451 </span><span class="lineCov"> 1675 : pathcpy(map-&gt;name, sizeof(map-&gt;name), name);</span></a>
<a name="1452"><span class="lineNum"> 1452 </span><span class="lineCov"> 1675 : map-&gt;position = position;</span></a>
<a name="1453"><span class="lineNum"> 1453 </span><span class="lineCov"> 1675 : map-&gt;total_blocks = total_blocks;</span></a>
<a name="1454"><span class="lineNum"> 1454 </span><span class="lineCov"> 1675 : map-&gt;free_blocks = free_blocks;</span></a>
<a name="1455"><span class="lineNum"> 1455 </span><span class="lineCov"> 1675 : pathcpy(map-&gt;uuid, sizeof(map-&gt;uuid), uuid);</span></a>
<a name="1456"><span class="lineNum"> 1456 </span> : </a>
<a name="1457"><span class="lineNum"> 1457 </span><span class="lineCov"> 1675 : return map;</span></a>
<a name="1458"><span class="lineNum"> 1458 </span> : }</a>
<a name="1459"><span class="lineNum"> 1459 </span> : </a>
<a name="1460"><span class="lineNum"> 1460 </span><span class="lineCov"> 1621 : void map_free(struct snapraid_map* map)</span></a>
<a name="1461"><span class="lineNum"> 1461 </span> : {</a>
<a name="1462"><span class="lineNum"> 1462 </span><span class="lineCov"> 1621 : free(map);</span></a>
<a name="1463"><span class="lineNum"> 1463 </span><span class="lineCov"> 1621 : }</span></a>
<a name="1464"><span class="lineNum"> 1464 </span> : </a>
<a name="1465"><span class="lineNum"> 1465 </span> : /****************************************************************************/</a>
<a name="1466"><span class="lineNum"> 1466 </span> : /* bucket */</a>
<a name="1467"><span class="lineNum"> 1467 </span> : </a>
<a name="1468"><span class="lineNum"> 1468 </span><span class="lineCov"> 802 : static int bucket_cmp(const void* void_a, const void* void_b)</span></a>
<a name="1469"><span class="lineNum"> 1469 </span> : {</a>
<a name="1470"><span class="lineNum"> 1470 </span><span class="lineCov"> 802 : const struct snapraid_bucket* a = void_a;</span></a>
<a name="1471"><span class="lineNum"> 1471 </span><span class="lineCov"> 802 : const struct snapraid_bucket* b = void_b;</span></a>
<a name="1472"><span class="lineNum"> 1472 </span><span class="lineCov"> 802 : if (a-&gt;time_at &lt; b-&gt;time_at)</span></a>
<a name="1473"><span class="lineNum"> 1473 </span><span class="lineCov"> 401 : return -1;</span></a>
<a name="1474"><span class="lineNum"> 1474 </span><span class="lineCov"> 401 : if (a-&gt;time_at &gt; b-&gt;time_at)</span></a>
<a name="1475"><span class="lineNum"> 1475 </span><span class="lineCov"> 401 : return 1;</span></a>
<a name="1476"><span class="lineNum"> 1476 </span><span class="lineNoCov"> 0 : return 0;</span></a>
<a name="1477"><span class="lineNum"> 1477 </span> : }</a>
<a name="1478"><span class="lineNum"> 1478 </span> : </a>
<a name="1479"><span class="lineNum"> 1479 </span><span class="lineCov"> 794 : void bucket_free(struct snapraid_bucket* bucket)</span></a>
<a name="1480"><span class="lineNum"> 1480 </span> : {</a>
<a name="1481"><span class="lineNum"> 1481 </span><span class="lineCov"> 794 : free(bucket);</span></a>
<a name="1482"><span class="lineNum"> 1482 </span><span class="lineCov"> 794 : }</span></a>
<a name="1483"><span class="lineNum"> 1483 </span> : </a>
<a name="1484"><span class="lineNum"> 1484 </span><span class="lineCov"> 56806 : void bucket_insert(tommy_hashdyn* bucket_hash, time_t time_at, block_off_t count, int justsynced)</span></a>
<a name="1485"><span class="lineNum"> 1485 </span> : {</a>
<a name="1486"><span class="lineNum"> 1486 </span><span class="lineCov"> 56806 : tommy_hash_t hash = tommy_inthash_u64(time_at);</span></a>
<a name="1487"><span class="lineNum"> 1487 </span><span class="lineCov"> 56806 : tommy_node* i = tommy_hashdyn_bucket(bucket_hash, hash);</span></a>
<a name="1488"><span class="lineNum"> 1488 </span><span class="lineCov"> 57851 : while (i) {</span></a>
<a name="1489"><span class="lineNum"> 1489 </span><span class="lineCov"> 57045 : struct snapraid_bucket* entry = i-&gt;data;</span></a>
<a name="1490"><span class="lineNum"> 1490 </span><span class="lineCov"> 57045 : if (entry-&gt;time_at == time_at) {</span></a>
<a name="1491"><span class="lineNum"> 1491 </span><span class="lineCov"> 56000 : if (justsynced)</span></a>
<a name="1492"><span class="lineNum"> 1492 </span><span class="lineCov"> 27995 : entry-&gt;count_justsynced += count;</span></a>
<a name="1493"><span class="lineNum"> 1493 </span> : else</a>
<a name="1494"><span class="lineNum"> 1494 </span><span class="lineCov"> 28005 : entry-&gt;count_scrubbed += count;</span></a>
<a name="1495"><span class="lineNum"> 1495 </span><span class="lineCov"> 56000 : return;</span></a>
<a name="1496"><span class="lineNum"> 1496 </span> : }</a>
<a name="1497"><span class="lineNum"> 1497 </span><span class="lineCov"> 1045 : i = i-&gt;next;</span></a>
<a name="1498"><span class="lineNum"> 1498 </span> : }</a>
<a name="1499"><span class="lineNum"> 1499 </span> : </a>
<a name="1500"><span class="lineNum"> 1500 </span><span class="lineCov"> 806 : struct snapraid_bucket* entry = malloc_nofail(sizeof(struct snapraid_bucket));</span></a>
<a name="1501"><span class="lineNum"> 1501 </span><span class="lineCov"> 806 : entry-&gt;time_at = time_at;</span></a>
<a name="1502"><span class="lineNum"> 1502 </span><span class="lineCov"> 806 : if (justsynced) {</span></a>
<a name="1503"><span class="lineNum"> 1503 </span><span class="lineCov"> 733 : entry-&gt;count_justsynced = count;</span></a>
<a name="1504"><span class="lineNum"> 1504 </span><span class="lineCov"> 733 : entry-&gt;count_scrubbed = 0;</span></a>
<a name="1505"><span class="lineNum"> 1505 </span> : } else {</a>
<a name="1506"><span class="lineNum"> 1506 </span><span class="lineCov"> 73 : entry-&gt;count_justsynced = 0;</span></a>
<a name="1507"><span class="lineNum"> 1507 </span><span class="lineCov"> 73 : entry-&gt;count_scrubbed = count;</span></a>
<a name="1508"><span class="lineNum"> 1508 </span> : }</a>
<a name="1509"><span class="lineNum"> 1509 </span> : </a>
<a name="1510"><span class="lineNum"> 1510 </span><span class="lineCov"> 806 : tommy_hashdyn_insert(bucket_hash, &amp;entry-&gt;node, entry, hash);</span></a>
<a name="1511"><span class="lineNum"> 1511 </span> : }</a>
<a name="1512"><span class="lineNum"> 1512 </span> : </a>
<a name="1513"><span class="lineNum"> 1513 </span><span class="lineCov"> 433 : void bucket_to_list(tommy_hashdyn* bucket_hash, tommy_list* bucket_list, block_off_t* bucketcount)</span></a>
<a name="1514"><span class="lineNum"> 1514 </span> : {</a>
<a name="1515"><span class="lineNum"> 1515 </span> : /* clear previous list */</a>
<a name="1516"><span class="lineNum"> 1516 </span><span class="lineCov"> 433 : tommy_list_foreach(bucket_list, (tommy_foreach_func*)bucket_free);</span></a>
<a name="1517"><span class="lineNum"> 1517 </span><span class="lineCov"> 433 : tommy_list_init(bucket_list);</span></a>
<a name="1518"><span class="lineNum"> 1518 </span> : </a>
<a name="1519"><span class="lineNum"> 1519 </span><span class="lineCov"> 433 : log_tag(&quot;list:bucket_begin\n&quot;);</span></a>
<a name="1520"><span class="lineNum"> 1520 </span> : </a>
<a name="1521"><span class="lineNum"> 1521 </span><span class="lineCov"> 433 : log_tag(&quot;bucket:count:%&quot; PRIu64 &quot;\n&quot;, (uint64_t)tommy_hashdyn_count(bucket_hash));</span></a>
<a name="1522"><span class="lineNum"> 1522 </span> : </a>
<a name="1523"><span class="lineNum"> 1523 </span><span class="lineCov"> 433 : tommy_hashdyn_to_list(bucket_hash, bucket_list);</span></a>
<a name="1524"><span class="lineNum"> 1524 </span> : </a>
<a name="1525"><span class="lineNum"> 1525 </span><span class="lineCov"> 433 : tommy_list_sort(bucket_list, bucket_cmp);</span></a>
<a name="1526"><span class="lineNum"> 1526 </span> : </a>
<a name="1527"><span class="lineNum"> 1527 </span><span class="lineCov"> 433 : block_off_t count = 0;</span></a>
<a name="1528"><span class="lineNum"> 1528 </span><span class="lineCov"> 1239 : for (tommy_node* i = tommy_list_head(bucket_list); i != 0; i = i-&gt;next) {</span></a>
<a name="1529"><span class="lineNum"> 1529 </span><span class="lineCov"> 806 : struct snapraid_bucket* entry = i-&gt;data;</span></a>
<a name="1530"><span class="lineNum"> 1530 </span><span class="lineCov"> 806 : count += entry-&gt;count_scrubbed + entry-&gt;count_justsynced;</span></a>
<a name="1531"><span class="lineNum"> 1531 </span><span class="lineCov"> 806 : log_tag(&quot;bucket:entry:%&quot; PRIu64 &quot;:%u:%u\n&quot;, (uint64_t)entry-&gt;time_at, entry-&gt;count_scrubbed, entry-&gt;count_justsynced);</span></a>
<a name="1532"><span class="lineNum"> 1532 </span> : }</a>
<a name="1533"><span class="lineNum"> 1533 </span> : </a>
<a name="1534"><span class="lineNum"> 1534 </span><span class="lineCov"> 433 : log_tag(&quot;bucket:block_count:%u\n&quot;, count);</span></a>
<a name="1535"><span class="lineNum"> 1535 </span> : </a>
<a name="1536"><span class="lineNum"> 1536 </span><span class="lineCov"> 433 : log_tag(&quot;list:bucket_end\n&quot;);</span></a>
<a name="1537"><span class="lineNum"> 1537 </span> : </a>
<a name="1538"><span class="lineNum"> 1538 </span><span class="lineCov"> 433 : *bucketcount = count;</span></a>
<a name="1539"><span class="lineNum"> 1539 </span><span class="lineCov"> 433 : }</span></a>
<a name="1540"><span class="lineNum"> 1540 </span> : </a>
<a name="1541"><span class="lineNum"> 1541 </span> : /****************************************************************************/</a>
<a name="1542"><span class="lineNum"> 1542 </span> : /* format */</a>
<a name="1543"><span class="lineNum"> 1543 </span> : </a>
<a name="1544"><span class="lineNum"> 1544 </span> : int FMT_MODE = FMT_FILE;</a>
<a name="1545"><span class="lineNum"> 1545 </span> : </a>
<a name="1546"><span class="lineNum"> 1546 </span> : /**</a>
<a name="1547"><span class="lineNum"> 1547 </span> : * Format a file path for poll reference</a>
<a name="1548"><span class="lineNum"> 1548 </span> : */</a>
<a name="1549"><span class="lineNum"> 1549 </span><span class="lineCov"> 6 : const char* fmt_poll(const struct snapraid_disk* disk, const char* str, char* buffer)</span></a>
<a name="1550"><span class="lineNum"> 1550 </span> : {</a>
<a name="1551"><span class="lineNum"> 1551 </span> : (void)disk;</a>
<a name="1552"><span class="lineNum"> 1552 </span><span class="lineCov"> 6 : return esc_shell(str, buffer);</span></a>
<a name="1553"><span class="lineNum"> 1553 </span> : }</a>
<a name="1554"><span class="lineNum"> 1554 </span> : </a>
<a name="1555"><span class="lineNum"> 1555 </span> : /**</a>
<a name="1556"><span class="lineNum"> 1556 </span> : * Format a path name for terminal reference</a>
<a name="1557"><span class="lineNum"> 1557 </span> : */</a>
<a name="1558"><span class="lineNum"> 1558 </span><span class="lineCov"> 381818 : const char* fmt_term(const struct snapraid_disk* disk, const char* str, char* buffer)</span></a>
<a name="1559"><span class="lineNum"> 1559 </span> : {</a>
<a name="1560"><span class="lineNum"> 1560 </span> : const char* out[3];</a>
<a name="1561"><span class="lineNum"> 1561 </span> : </a>
<a name="1562"><span class="lineNum"> 1562 </span><span class="lineCov"> 381818 : switch (FMT_MODE) {</span></a>
<a name="1563"><span class="lineNum"> 1563 </span><span class="lineCov"> 357753 : case FMT_FILE :</span></a>
<a name="1564"><span class="lineNum"> 1564 </span> : default :</a>
<a name="1565"><span class="lineNum"> 1565 </span><span class="lineCov"> 357753 : return esc_shell(str, buffer);</span></a>
<a name="1566"><span class="lineNum"> 1566 </span><span class="lineCov"> 12030 : case FMT_DISK :</span></a>
<a name="1567"><span class="lineNum"> 1567 </span><span class="lineCov"> 12030 : out[0] = disk-&gt;name;</span></a>
<a name="1568"><span class="lineNum"> 1568 </span><span class="lineCov"> 12030 : out[1] = &quot;:&quot;;</span></a>
<a name="1569"><span class="lineNum"> 1569 </span><span class="lineCov"> 12030 : out[2] = str;</span></a>
<a name="1570"><span class="lineNum"> 1570 </span><span class="lineCov"> 12030 : return esc_shell_multi(out, 3, buffer);</span></a>
<a name="1571"><span class="lineNum"> 1571 </span><span class="lineCov"> 12035 : case FMT_PATH :</span></a>
<a name="1572"><span class="lineNum"> 1572 </span><span class="lineCov"> 12035 : out[0] = disk-&gt;dir;</span></a>
<a name="1573"><span class="lineNum"> 1573 </span><span class="lineCov"> 12035 : out[1] = str;</span></a>
<a name="1574"><span class="lineNum"> 1574 </span><span class="lineCov"> 12035 : return esc_shell_multi(out, 2, buffer);</span></a>
<a name="1575"><span class="lineNum"> 1575 </span> : }</a>
<a name="1576"><span class="lineNum"> 1576 </span> : }</a>
<a name="1577"><span class="lineNum"> 1577 </span> : </a>
<a name="1578"><span class="lineNum"> 1578 </span><span class="lineCov"> 15 : const char* fmt_size(uint64_t size, char* buffer, size_t buffer_size)</span></a>
<a name="1579"><span class="lineNum"> 1579 </span> : {</a>
<a name="1580"><span class="lineNum"> 1580 </span><span class="lineCov"> 15 : if (size &gt;= 10UL * TERA)</span></a>
<a name="1581"><span class="lineNum"> 1581 </span><span class="lineNoCov"> 0 : snprintf(buffer, buffer_size, &quot;%&quot; PRIu64 &quot; T&quot;, size / TERA);</span></a>
<a name="1582"><span class="lineNum"> 1582 </span><span class="lineCov"> 15 : else if (size &gt;= 10UL * GIGA)</span></a>
<a name="1583"><span class="lineNum"> 1583 </span><span class="lineNoCov"> 0 : snprintf(buffer, buffer_size, &quot;%&quot; PRIu64 &quot; G&quot;, size / GIGA);</span></a>
<a name="1584"><span class="lineNum"> 1584 </span><span class="lineCov"> 15 : else if (size &gt;= 10UL * MEGA)</span></a>
<a name="1585"><span class="lineNum"> 1585 </span><span class="lineCov"> 1 : snprintf(buffer, buffer_size, &quot;%&quot; PRIu64 &quot; M&quot;, size / MEGA);</span></a>
<a name="1586"><span class="lineNum"> 1586 </span><span class="lineCov"> 14 : else if (size &gt;= 10UL * KILO)</span></a>
<a name="1587"><span class="lineNum"> 1587 </span><span class="lineCov"> 13 : snprintf(buffer, buffer_size, &quot;%&quot; PRIu64 &quot; k&quot;, size / KILO);</span></a>
<a name="1588"><span class="lineNum"> 1588 </span> : else</a>
<a name="1589"><span class="lineNum"> 1589 </span><span class="lineCov"> 1 : snprintf(buffer, buffer_size, &quot;%&quot; PRIu64 &quot; &quot;, size);</span></a>
<a name="1590"><span class="lineNum"> 1590 </span> : </a>
<a name="1591"><span class="lineNum"> 1591 </span><span class="lineCov"> 15 : return buffer;</span></a>
<a name="1592"><span class="lineNum"> 1592 </span> : }</a>
<a name="1593"><span class="lineNum"> 1593 </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>