mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
1535 lines
144 KiB
HTML
1535 lines
144 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.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">597</td>
|
|
<td class="headerCovTableEntry">632</td>
|
|
<td class="headerCovTableEntryHi">94.5 %</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Date:</td>
|
|
<td class="headerValue">2016-11-21</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntry">67</td>
|
|
<td class="headerCovTableEntry">69</td>
|
|
<td class="headerCovTableEntryHi">97.1 %</td>
|
|
</tr>
|
|
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<a name="1"><span class="lineNum"> 1 </span> : /*</a>
|
|
<span class="lineNum"> 2 </span> : * Copyright (C) 2011 Andrea Mazzoleni
|
|
<span class="lineNum"> 3 </span> : *
|
|
<span class="lineNum"> 4 </span> : * This program is free software: you can redistribute it and/or modify
|
|
<span class="lineNum"> 5 </span> : * it under the terms of the GNU General Public License as published by
|
|
<span class="lineNum"> 6 </span> : * the Free Software Foundation, either version 3 of the License, or
|
|
<span class="lineNum"> 7 </span> : * (at your option) any later version.
|
|
<span class="lineNum"> 8 </span> : *
|
|
<span class="lineNum"> 9 </span> : * This program is distributed in the hope that it will be useful,
|
|
<span class="lineNum"> 10 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
<span class="lineNum"> 11 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
<span class="lineNum"> 12 </span> : * GNU General Public License for more details.
|
|
<span class="lineNum"> 13 </span> : *
|
|
<span class="lineNum"> 14 </span> : * You should have received a copy of the GNU General Public License
|
|
<span class="lineNum"> 15 </span> : * along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
<span class="lineNum"> 16 </span> : */
|
|
<span class="lineNum"> 17 </span> :
|
|
<span class="lineNum"> 18 </span> : #include "portable.h"
|
|
<span class="lineNum"> 19 </span> :
|
|
<span class="lineNum"> 20 </span> : #include "elem.h"
|
|
<span class="lineNum"> 21 </span> : #include "support.h"
|
|
<span class="lineNum"> 22 </span> : #include "util.h"
|
|
<span class="lineNum"> 23 </span> :
|
|
<span class="lineNum"> 24 </span> : /****************************************************************************/
|
|
<span class="lineNum"> 25 </span> : /* snapraid */
|
|
<span class="lineNum"> 26 </span> :
|
|
<a name="27"><span class="lineNum"> 27 </span> : int BLOCK_HASH_SIZE = HASH_MAX;</a>
|
|
<span class="lineNum"> 28 </span> :
|
|
<span class="lineNum"> 29 </span><span class="lineCov"> 1532 : struct snapraid_content* content_alloc(const char* path, uint64_t dev)</span>
|
|
<span class="lineNum"> 30 </span> : {
|
|
<span class="lineNum"> 31 </span> : struct snapraid_content* content;
|
|
<span class="lineNum"> 32 </span> :
|
|
<span class="lineNum"> 33 </span><span class="lineCov"> 1532 : content = malloc_nofail(sizeof(struct snapraid_content));</span>
|
|
<span class="lineNum"> 34 </span><span class="lineCov"> 1532 : pathimport(content->content, sizeof(content->content), path);</span>
|
|
<span class="lineNum"> 35 </span><span class="lineCov"> 1532 : content->device = dev;</span>
|
|
<span class="lineNum"> 36 </span> :
|
|
<span class="lineNum"> 37 </span><span class="lineCov"> 1532 : return content;</span>
|
|
<a name="38"><span class="lineNum"> 38 </span> : }</a>
|
|
<span class="lineNum"> 39 </span> :
|
|
<span class="lineNum"> 40 </span><span class="lineCov"> 1393 : void content_free(struct snapraid_content* content)</span>
|
|
<span class="lineNum"> 41 </span> : {
|
|
<span class="lineNum"> 42 </span><span class="lineCov"> 1393 : free(content);</span>
|
|
<a name="43"><span class="lineNum"> 43 </span><span class="lineCov"> 1393 : }</span></a>
|
|
<span class="lineNum"> 44 </span> :
|
|
<span class="lineNum"> 45 </span><span class="lineCov"> 536 : struct snapraid_filter* filter_alloc_file(int direction, const char* pattern)</span>
|
|
<span class="lineNum"> 46 </span> : {
|
|
<span class="lineNum"> 47 </span> : struct snapraid_filter* filter;
|
|
<span class="lineNum"> 48 </span> : char* i;
|
|
<span class="lineNum"> 49 </span> : char* first;
|
|
<span class="lineNum"> 50 </span> : char* last;
|
|
<span class="lineNum"> 51 </span> : int token_is_valid;
|
|
<span class="lineNum"> 52 </span> : int token_is_filled;
|
|
<span class="lineNum"> 53 </span> :
|
|
<span class="lineNum"> 54 </span><span class="lineCov"> 536 : filter = malloc_nofail(sizeof(struct snapraid_filter));</span>
|
|
<span class="lineNum"> 55 </span><span class="lineCov"> 536 : pathimport(filter->pattern, sizeof(filter->pattern), pattern);</span>
|
|
<span class="lineNum"> 56 </span><span class="lineCov"> 536 : filter->direction = direction;</span>
|
|
<span class="lineNum"> 57 </span> :
|
|
<span class="lineNum"> 58 </span> : /* find first and last slash */
|
|
<span class="lineNum"> 59 </span><span class="lineCov"> 536 : first = 0;</span>
|
|
<span class="lineNum"> 60 </span><span class="lineCov"> 536 : last = 0;</span>
|
|
<span class="lineNum"> 61 </span> : /* reject invalid tokens, like "<empty>", ".", ".." and more dots */
|
|
<span class="lineNum"> 62 </span><span class="lineCov"> 536 : token_is_valid = 0;</span>
|
|
<span class="lineNum"> 63 </span><span class="lineCov"> 536 : token_is_filled = 0;</span>
|
|
<span class="lineNum"> 64 </span><span class="lineCov"> 6647 : for (i = filter->pattern; *i; ++i) {</span>
|
|
<span class="lineNum"> 65 </span><span class="lineCov"> 6112 : if (*i == '/') {</span>
|
|
<span class="lineNum"> 66 </span> : /* reject invalid tokens, but accept an empty one as first */
|
|
<span class="lineNum"> 67 </span><span class="lineCov"> 5 : if (!token_is_valid && (first != 0 || token_is_filled)) {</span>
|
|
<span class="lineNum"> 68 </span><span class="lineCov"> 1 : free(filter);</span>
|
|
<span class="lineNum"> 69 </span><span class="lineCov"> 1 : return 0;</span>
|
|
<span class="lineNum"> 70 </span> : }
|
|
<span class="lineNum"> 71 </span><span class="lineCov"> 4 : token_is_valid = 0;</span>
|
|
<span class="lineNum"> 72 </span><span class="lineCov"> 4 : token_is_filled = 0;</span>
|
|
<span class="lineNum"> 73 </span> :
|
|
<span class="lineNum"> 74 </span> : /* update slash position */
|
|
<span class="lineNum"> 75 </span><span class="lineCov"> 4 : if (!first)</span>
|
|
<span class="lineNum"> 76 </span><span class="lineCov"> 3 : first = i;</span>
|
|
<span class="lineNum"> 77 </span><span class="lineCov"> 4 : last = i;</span>
|
|
<span class="lineNum"> 78 </span><span class="lineCov"> 6107 : } else if (*i != '.') {</span>
|
|
<span class="lineNum"> 79 </span><span class="lineCov"> 5575 : token_is_valid = 1;</span>
|
|
<span class="lineNum"> 80 </span><span class="lineCov"> 5575 : token_is_filled = 1;</span>
|
|
<span class="lineNum"> 81 </span> : } else {
|
|
<span class="lineNum"> 82 </span><span class="lineCov"> 532 : token_is_filled = 1;</span>
|
|
<span class="lineNum"> 83 </span> : }
|
|
<span class="lineNum"> 84 </span> : }
|
|
<span class="lineNum"> 85 </span> :
|
|
<span class="lineNum"> 86 </span> : /* reject invalid tokens, but accept an empty one as last, but not if it's the only one */
|
|
<span class="lineNum"> 87 </span><span class="lineCov"> 535 : if (!token_is_valid && (first == 0 || token_is_filled)) {</span>
|
|
<span class="lineNum"> 88 </span><span class="lineCov"> 1 : free(filter);</span>
|
|
<span class="lineNum"> 89 </span><span class="lineCov"> 1 : return 0;</span>
|
|
<span class="lineNum"> 90 </span> : }
|
|
<span class="lineNum"> 91 </span> :
|
|
<span class="lineNum"> 92 </span> : /* it's a file filter */
|
|
<span class="lineNum"> 93 </span><span class="lineCov"> 534 : filter->is_disk = 0;</span>
|
|
<span class="lineNum"> 94 </span> :
|
|
<span class="lineNum"> 95 </span><span class="lineCov"> 534 : if (first == 0) {</span>
|
|
<span class="lineNum"> 96 </span> : /* no slash */
|
|
<span class="lineNum"> 97 </span><span class="lineCov"> 531 : filter->is_path = 0;</span>
|
|
<span class="lineNum"> 98 </span><span class="lineCov"> 531 : filter->is_dir = 0;</span>
|
|
<span class="lineNum"> 99 </span><span class="lineCov"> 3 : } else if (first == last && last[1] == 0) {</span>
|
|
<span class="lineNum"> 100 </span> : /* one slash at the end */
|
|
<span class="lineNum"> 101 </span><span class="lineCov"> 1 : filter->is_path = 0;</span>
|
|
<span class="lineNum"> 102 </span><span class="lineCov"> 1 : filter->is_dir = 1;</span>
|
|
<span class="lineNum"> 103 </span><span class="lineCov"> 1 : last[0] = 0;</span>
|
|
<span class="lineNum"> 104 </span> : } else {
|
|
<span class="lineNum"> 105 </span> : /* at least a slash not at the end */
|
|
<span class="lineNum"> 106 </span><span class="lineCov"> 2 : filter->is_path = 1;</span>
|
|
<span class="lineNum"> 107 </span><span class="lineCov"> 2 : if (last[1] == 0) {</span>
|
|
<span class="lineNum"> 108 </span><span class="lineNoCov"> 0 : filter->is_dir = 1;</span>
|
|
<span class="lineNum"> 109 </span><span class="lineNoCov"> 0 : last[0] = 0;</span>
|
|
<span class="lineNum"> 110 </span> : } else {
|
|
<span class="lineNum"> 111 </span><span class="lineCov"> 2 : filter->is_dir = 0;</span>
|
|
<span class="lineNum"> 112 </span> : }
|
|
<span class="lineNum"> 113 </span> :
|
|
<span class="lineNum"> 114 </span> : /* a slash must be the first char, as we don't support PATH/FILE and PATH/DIR/ */
|
|
<span class="lineNum"> 115 </span><span class="lineCov"> 2 : if (filter->pattern[0] != '/') {</span>
|
|
<span class="lineNum"> 116 </span><span class="lineCov"> 1 : free(filter);</span>
|
|
<span class="lineNum"> 117 </span><span class="lineCov"> 1 : return 0;</span>
|
|
<span class="lineNum"> 118 </span> : }
|
|
<span class="lineNum"> 119 </span> : }
|
|
<span class="lineNum"> 120 </span> :
|
|
<span class="lineNum"> 121 </span><span class="lineCov"> 533 : return filter;</span>
|
|
<a name="122"><span class="lineNum"> 122 </span> : }</a>
|
|
<span class="lineNum"> 123 </span> :
|
|
<span class="lineNum"> 124 </span><span class="lineCov"> 10 : struct snapraid_filter* filter_alloc_disk(int direction, const char* pattern)</span>
|
|
<span class="lineNum"> 125 </span> : {
|
|
<span class="lineNum"> 126 </span> : struct snapraid_filter* filter;
|
|
<span class="lineNum"> 127 </span> :
|
|
<span class="lineNum"> 128 </span><span class="lineCov"> 10 : filter = malloc_nofail(sizeof(struct snapraid_filter));</span>
|
|
<span class="lineNum"> 129 </span><span class="lineCov"> 10 : pathimport(filter->pattern, sizeof(filter->pattern), pattern);</span>
|
|
<span class="lineNum"> 130 </span><span class="lineCov"> 10 : filter->direction = direction;</span>
|
|
<span class="lineNum"> 131 </span> :
|
|
<span class="lineNum"> 132 </span> : /* it's a disk filter */
|
|
<span class="lineNum"> 133 </span><span class="lineCov"> 10 : filter->is_disk = 1;</span>
|
|
<span class="lineNum"> 134 </span><span class="lineCov"> 10 : filter->is_path = 0;</span>
|
|
<span class="lineNum"> 135 </span><span class="lineCov"> 10 : filter->is_dir = 0;</span>
|
|
<span class="lineNum"> 136 </span> :
|
|
<span class="lineNum"> 137 </span> : /* no slash allowed in disk names */
|
|
<span class="lineNum"> 138 </span><span class="lineCov"> 10 : if (strchr(filter->pattern, '/') != 0) {</span>
|
|
<span class="lineNum"> 139 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 140 </span> : free(filter);
|
|
<span class="lineNum"> 141 </span> : return 0;
|
|
<span class="lineNum"> 142 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 143 </span> : }
|
|
<span class="lineNum"> 144 </span> :
|
|
<span class="lineNum"> 145 </span><span class="lineCov"> 10 : return filter;</span>
|
|
<a name="146"><span class="lineNum"> 146 </span> : }</a>
|
|
<span class="lineNum"> 147 </span> :
|
|
<span class="lineNum"> 148 </span><span class="lineCov"> 499 : void filter_free(struct snapraid_filter* filter)</span>
|
|
<span class="lineNum"> 149 </span> : {
|
|
<span class="lineNum"> 150 </span><span class="lineCov"> 499 : free(filter);</span>
|
|
<a name="151"><span class="lineNum"> 151 </span><span class="lineCov"> 499 : }</span></a>
|
|
<span class="lineNum"> 152 </span> :
|
|
<span class="lineNum"> 153 </span><span class="lineCov"> 125233 : const char* filter_type(struct snapraid_filter* filter, char* out, size_t out_size)</span>
|
|
<span class="lineNum"> 154 </span> : {
|
|
<span class="lineNum"> 155 </span> : const char* direction;
|
|
<span class="lineNum"> 156 </span> :
|
|
<span class="lineNum"> 157 </span><span class="lineCov"> 125233 : if (filter->direction < 0)</span>
|
|
<span class="lineNum"> 158 </span><span class="lineCov"> 124968 : direction = "exclude";</span>
|
|
<span class="lineNum"> 159 </span> : else
|
|
<span class="lineNum"> 160 </span><span class="lineCov"> 265 : direction = "include";</span>
|
|
<span class="lineNum"> 161 </span> :
|
|
<span class="lineNum"> 162 </span><span class="lineCov"> 125233 : if (filter->is_disk)</span>
|
|
<span class="lineNum"> 163 </span><span class="lineNoCov"> 0 : pathprint(out, out_size, "%s %s:", direction, filter->pattern);</span>
|
|
<span class="lineNum"> 164 </span><span class="lineCov"> 125233 : else if (filter->is_dir)</span>
|
|
<span class="lineNum"> 165 </span><span class="lineNoCov"> 0 : pathprint(out, out_size, "%s %s/", direction, filter->pattern);</span>
|
|
<span class="lineNum"> 166 </span> : else
|
|
<span class="lineNum"> 167 </span><span class="lineCov"> 125233 : pathprint(out, out_size, "%s %s", direction, filter->pattern);</span>
|
|
<span class="lineNum"> 168 </span> :
|
|
<span class="lineNum"> 169 </span><span class="lineCov"> 125233 : return out;</span>
|
|
<a name="170"><span class="lineNum"> 170 </span> : }</a>
|
|
<span class="lineNum"> 171 </span> :
|
|
<span class="lineNum"> 172 </span><span class="lineCov"> 12457044 : static int filter_apply(struct snapraid_filter* filter, struct snapraid_filter** reason, const char* path, const char* name, int is_dir)</span>
|
|
<span class="lineNum"> 173 </span> : {
|
|
<span class="lineNum"> 174 </span><span class="lineCov"> 12457044 : int ret = 0;</span>
|
|
<span class="lineNum"> 175 </span> :
|
|
<span class="lineNum"> 176 </span> : /* match dirs with dirs and files with files */
|
|
<span class="lineNum"> 177 </span><span class="lineCov"> 12457044 : if (filter->is_dir && !is_dir)</span>
|
|
<span class="lineNum"> 178 </span><span class="lineCov"> 2949 : return 0;</span>
|
|
<span class="lineNum"> 179 </span><span class="lineCov"> 12454095 : if (!filter->is_dir && is_dir)</span>
|
|
<span class="lineNum"> 180 </span><span class="lineCov"> 6223584 : return 0;</span>
|
|
<span class="lineNum"> 181 </span> :
|
|
<span class="lineNum"> 182 </span><span class="lineCov"> 6230511 : if (filter->is_path) {</span>
|
|
<span class="lineNum"> 183 </span> : /* skip initial slash, as always missing from the path */
|
|
<span class="lineNum"> 184 </span><span class="lineCov"> 2949 : if (fnmatch(filter->pattern + 1, path, FNM_PATHNAME | FNM_CASEINSENSITIVE_FOR_WIN) == 0)</span>
|
|
<span class="lineNum"> 185 </span><span class="lineNoCov"> 0 : ret = filter->direction;</span>
|
|
<span class="lineNum"> 186 </span> : } else {
|
|
<span class="lineNum"> 187 </span><span class="lineCov"> 6227562 : if (fnmatch(filter->pattern, name, FNM_CASEINSENSITIVE_FOR_WIN) == 0)</span>
|
|
<span class="lineNum"> 188 </span><span class="lineCov"> 127693 : ret = filter->direction;</span>
|
|
<span class="lineNum"> 189 </span> : }
|
|
<span class="lineNum"> 190 </span> :
|
|
<span class="lineNum"> 191 </span><span class="lineCov"> 6230511 : if (reason != 0 && ret < 0)</span>
|
|
<span class="lineNum"> 192 </span><span class="lineCov"> 124703 : *reason = filter;</span>
|
|
<span class="lineNum"> 193 </span> :
|
|
<span class="lineNum"> 194 </span><span class="lineCov"> 6230511 : return ret;</span>
|
|
<a name="195"><span class="lineNum"> 195 </span> : }</a>
|
|
<span class="lineNum"> 196 </span> :
|
|
<span class="lineNum"> 197 </span><span class="lineCov"> 6236629 : static int filter_recurse(struct snapraid_filter* filter, struct snapraid_filter** reason, const char* const_path, int is_dir)</span>
|
|
<span class="lineNum"> 198 </span> : {
|
|
<span class="lineNum"> 199 </span> : char path[PATH_MAX];
|
|
<span class="lineNum"> 200 </span> : char* name;
|
|
<span class="lineNum"> 201 </span> : unsigned i;
|
|
<span class="lineNum"> 202 </span> :
|
|
<span class="lineNum"> 203 </span><span class="lineCov"> 6236629 : pathcpy(path, sizeof(path), const_path);</span>
|
|
<span class="lineNum"> 204 </span> :
|
|
<span class="lineNum"> 205 </span> : /* filter for all the directories */
|
|
<span class="lineNum"> 206 </span><span class="lineCov"> 6236629 : name = path;</span>
|
|
<span class="lineNum"> 207 </span><span class="lineCov"> 89821180 : for (i = 0; path[i] != 0; ++i) {</span>
|
|
<span class="lineNum"> 208 </span><span class="lineCov"> 83587541 : if (path[i] == '/') {</span>
|
|
<span class="lineNum"> 209 </span> : /* set a terminator */
|
|
<span class="lineNum"> 210 </span><span class="lineCov"> 6223405 : path[i] = 0;</span>
|
|
<span class="lineNum"> 211 </span> :
|
|
<span class="lineNum"> 212 </span> : /* filter the directory */
|
|
<span class="lineNum"> 213 </span><span class="lineCov"> 6223405 : if (filter_apply(filter, reason, path, name, 1) != 0)</span>
|
|
<span class="lineNum"> 214 </span><span class="lineCov"> 2990 : return filter->direction;</span>
|
|
<span class="lineNum"> 215 </span> :
|
|
<span class="lineNum"> 216 </span> : /* restore the slash */
|
|
<span class="lineNum"> 217 </span><span class="lineCov"> 6220415 : path[i] = '/';</span>
|
|
<span class="lineNum"> 218 </span> :
|
|
<span class="lineNum"> 219 </span> : /* next name */
|
|
<span class="lineNum"> 220 </span><span class="lineCov"> 6220415 : name = path + i + 1;</span>
|
|
<span class="lineNum"> 221 </span> : }
|
|
<span class="lineNum"> 222 </span> : }
|
|
<span class="lineNum"> 223 </span> :
|
|
<span class="lineNum"> 224 </span> : /* filter the final file */
|
|
<span class="lineNum"> 225 </span><span class="lineCov"> 6233639 : if (filter_apply(filter, reason, path, name, is_dir) != 0)</span>
|
|
<span class="lineNum"> 226 </span><span class="lineCov"> 124703 : return filter->direction;</span>
|
|
<span class="lineNum"> 227 </span> :
|
|
<span class="lineNum"> 228 </span><span class="lineCov"> 6108936 : return 0;</span>
|
|
<a name="229"><span class="lineNum"> 229 </span> : }</a>
|
|
<span class="lineNum"> 230 </span> :
|
|
<span class="lineNum"> 231 </span><span class="lineCov"> 3332859 : 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>
|
|
<span class="lineNum"> 232 </span> : {
|
|
<span class="lineNum"> 233 </span> : tommy_node* i;
|
|
<span class="lineNum"> 234 </span> :
|
|
<span class="lineNum"> 235 </span><span class="lineCov"> 3332859 : int direction = 1; /* by default include all */</span>
|
|
<span class="lineNum"> 236 </span> :
|
|
<span class="lineNum"> 237 </span> : /* for each filter */
|
|
<span class="lineNum"> 238 </span><span class="lineCov"> 9543103 : for (i = tommy_list_head(filterlist); i != 0; i = i->next) {</span>
|
|
<span class="lineNum"> 239 </span> : int ret;
|
|
<span class="lineNum"> 240 </span><span class="lineCov"> 6346617 : struct snapraid_filter* filter = i->data;</span>
|
|
<span class="lineNum"> 241 </span> :
|
|
<span class="lineNum"> 242 </span><span class="lineCov"> 6346617 : if (filter->is_disk) {</span>
|
|
<span class="lineNum"> 243 </span><span class="lineCov"> 109988 : if (fnmatch(filter->pattern, disk, FNM_CASEINSENSITIVE_FOR_WIN) == 0)</span>
|
|
<span class="lineNum"> 244 </span><span class="lineCov"> 8680 : ret = filter->direction;</span>
|
|
<span class="lineNum"> 245 </span> : else
|
|
<span class="lineNum"> 246 </span><span class="lineCov"> 101308 : ret = 0;</span>
|
|
<span class="lineNum"> 247 </span><span class="lineCov"> 109988 : if (reason != 0 && ret < 0)</span>
|
|
<span class="lineNum"> 248 </span><span class="lineNoCov"> 0 : *reason = filter;</span>
|
|
<span class="lineNum"> 249 </span> : } else {
|
|
<span class="lineNum"> 250 </span><span class="lineCov"> 6236629 : ret = filter_recurse(filter, reason, sub, is_dir);</span>
|
|
<span class="lineNum"> 251 </span> : }
|
|
<span class="lineNum"> 252 </span> :
|
|
<span class="lineNum"> 253 </span><span class="lineCov"> 6346617 : if (ret > 0) {</span>
|
|
<span class="lineNum"> 254 </span> : /* include the file */
|
|
<span class="lineNum"> 255 </span><span class="lineCov"> 11670 : return 0;</span>
|
|
<span class="lineNum"> 256 </span><span class="lineCov"> 6334947 : } else if (ret < 0) {</span>
|
|
<span class="lineNum"> 257 </span> : /* exclude the file */
|
|
<span class="lineNum"> 258 </span><span class="lineCov"> 124703 : return -1;</span>
|
|
<span class="lineNum"> 259 </span> : } else {
|
|
<span class="lineNum"> 260 </span> : /* default is opposite of the last filter */
|
|
<span class="lineNum"> 261 </span><span class="lineCov"> 6210244 : direction = -filter->direction;</span>
|
|
<span class="lineNum"> 262 </span><span class="lineCov"> 6210244 : if (reason != 0 && direction < 0)</span>
|
|
<span class="lineNum"> 263 </span><span class="lineCov"> 3110901 : *reason = filter;</span>
|
|
<span class="lineNum"> 264 </span> : /* continue with the next one */
|
|
<span class="lineNum"> 265 </span> : }
|
|
<span class="lineNum"> 266 </span> : }
|
|
<span class="lineNum"> 267 </span> :
|
|
<span class="lineNum"> 268 </span> : /* directories are always included by default, otherwise we cannot apply rules */
|
|
<span class="lineNum"> 269 </span> : /* to the contained files */
|
|
<span class="lineNum"> 270 </span><span class="lineCov"> 3196486 : if (is_def_include)</span>
|
|
<span class="lineNum"> 271 </span><span class="lineCov"> 3052 : return 0;</span>
|
|
<span class="lineNum"> 272 </span> :
|
|
<span class="lineNum"> 273 </span> : /* files are excluded/included depending of the last rule processed */
|
|
<span class="lineNum"> 274 </span><span class="lineCov"> 3193434 : if (direction < 0)</span>
|
|
<span class="lineNum"> 275 </span><span class="lineCov"> 57608 : return -1;</span>
|
|
<span class="lineNum"> 276 </span> :
|
|
<span class="lineNum"> 277 </span><span class="lineCov"> 3135826 : return 0;</span>
|
|
<a name="278"><span class="lineNum"> 278 </span> : }</a>
|
|
<span class="lineNum"> 279 </span> :
|
|
<span class="lineNum"> 280 </span><span class="lineCov"> 3329762 : int filter_path(tommy_list* filterlist, struct snapraid_filter** reason, const char* disk, const char* sub)</span>
|
|
<span class="lineNum"> 281 </span> : {
|
|
<span class="lineNum"> 282 </span><span class="lineCov"> 3329762 : return filter_element(filterlist, reason, disk, sub, 0, 0);</span>
|
|
<a name="283"><span class="lineNum"> 283 </span> : }</a>
|
|
<span class="lineNum"> 284 </span> :
|
|
<span class="lineNum"> 285 </span><span class="lineCov"> 3052 : int filter_subdir(tommy_list* filterlist, struct snapraid_filter** reason, const char* disk, const char* sub)</span>
|
|
<span class="lineNum"> 286 </span> : {
|
|
<span class="lineNum"> 287 </span><span class="lineCov"> 3052 : return filter_element(filterlist, reason, disk, sub, 1, 1);</span>
|
|
<a name="288"><span class="lineNum"> 288 </span> : }</a>
|
|
<span class="lineNum"> 289 </span> :
|
|
<span class="lineNum"> 290 </span><span class="lineCov"> 45 : int filter_emptydir(tommy_list* filterlist, struct snapraid_filter** reason, const char* disk, const char* sub)</span>
|
|
<span class="lineNum"> 291 </span> : {
|
|
<span class="lineNum"> 292 </span><span class="lineCov"> 45 : return filter_element(filterlist, reason, disk, sub, 1, 0);</span>
|
|
<a name="293"><span class="lineNum"> 293 </span> : }</a>
|
|
<span class="lineNum"> 294 </span> :
|
|
<span class="lineNum"> 295 </span><span class="lineCov"> 80691 : int filter_existence(int filter_missing, const char* dir, const char* sub)</span>
|
|
<span class="lineNum"> 296 </span> : {
|
|
<span class="lineNum"> 297 </span> : char path[PATH_MAX];
|
|
<span class="lineNum"> 298 </span> : struct stat st;
|
|
<span class="lineNum"> 299 </span> :
|
|
<span class="lineNum"> 300 </span><span class="lineCov"> 80691 : if (!filter_missing)</span>
|
|
<span class="lineNum"> 301 </span><span class="lineCov"> 34975 : return 0;</span>
|
|
<span class="lineNum"> 302 </span> :
|
|
<span class="lineNum"> 303 </span> : /* we directly check if in the disk the file is present or not */
|
|
<span class="lineNum"> 304 </span><span class="lineCov"> 45716 : pathprint(path, sizeof(path), "%s%s", dir, sub);</span>
|
|
<span class="lineNum"> 305 </span> :
|
|
<span class="lineNum"> 306 </span><span class="lineCov"> 45716 : if (lstat(path, &st) != 0) {</span>
|
|
<span class="lineNum"> 307 </span> : /* if the file doesn't exist, we don't filter it out */
|
|
<span class="lineNum"> 308 </span><span class="lineCov"> 4819 : if (errno == ENOENT)</span>
|
|
<span class="lineNum"> 309 </span><span class="lineCov"> 4819 : return 0;</span>
|
|
<span class="lineNum"> 310 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 311 </span> : log_fatal("Error in stat file '%s'. %s.\n", path, strerror(errno));
|
|
<span class="lineNum"> 312 </span> : exit(EXIT_FAILURE);
|
|
<span class="lineNum"> 313 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 314 </span> : }
|
|
<span class="lineNum"> 315 </span> :
|
|
<span class="lineNum"> 316 </span> : /* the file is present, so we filter it out */
|
|
<span class="lineNum"> 317 </span><span class="lineCov"> 40897 : return 1;</span>
|
|
<a name="318"><span class="lineNum"> 318 </span> : }</a>
|
|
<span class="lineNum"> 319 </span> :
|
|
<span class="lineNum"> 320 </span><span class="lineCov"> 38646 : int filter_correctness(int filter_error, tommy_arrayblkof* infoarr, struct snapraid_disk* disk, struct snapraid_file* file)</span>
|
|
<span class="lineNum"> 321 </span> : {
|
|
<span class="lineNum"> 322 </span> : unsigned i;
|
|
<span class="lineNum"> 323 </span> :
|
|
<span class="lineNum"> 324 </span><span class="lineCov"> 38646 : if (!filter_error)</span>
|
|
<span class="lineNum"> 325 </span><span class="lineCov"> 16098 : return 0;</span>
|
|
<span class="lineNum"> 326 </span> :
|
|
<span class="lineNum"> 327 </span> : /* check each block of the file */
|
|
<span class="lineNum"> 328 </span><span class="lineCov"> 60692 : for (i = 0; i < file->blockmax; ++i) {</span>
|
|
<span class="lineNum"> 329 </span><span class="lineCov"> 46446 : block_off_t parity_pos = fs_file2par_get(disk, file, i);</span>
|
|
<span class="lineNum"> 330 </span><span class="lineCov"> 46446 : snapraid_info info = info_get(infoarr, parity_pos);</span>
|
|
<span class="lineNum"> 331 </span> :
|
|
<span class="lineNum"> 332 </span> : /* if the file has a bad block, don't exclude it */
|
|
<span class="lineNum"> 333 </span><span class="lineCov"> 46446 : if (info_get_bad(info))</span>
|
|
<span class="lineNum"> 334 </span><span class="lineCov"> 8302 : return 0;</span>
|
|
<span class="lineNum"> 335 </span> : }
|
|
<span class="lineNum"> 336 </span> :
|
|
<span class="lineNum"> 337 </span> : /* the file is correct, so we filter it out */
|
|
<span class="lineNum"> 338 </span><span class="lineCov"> 14246 : return 1;</span>
|
|
<a name="339"><span class="lineNum"> 339 </span> : }</a>
|
|
<span class="lineNum"> 340 </span> :
|
|
<span class="lineNum"> 341 </span><span class="lineCov"> 3173372 : int filter_content(tommy_list* contentlist, const char* path)</span>
|
|
<span class="lineNum"> 342 </span> : {
|
|
<span class="lineNum"> 343 </span> : tommy_node* i;
|
|
<span class="lineNum"> 344 </span> :
|
|
<span class="lineNum"> 345 </span><span class="lineCov"> 40913052 : for (i = tommy_list_head(contentlist); i != 0; i = i->next) {</span>
|
|
<span class="lineNum"> 346 </span><span class="lineCov"> 17283154 : struct snapraid_content* content = i->data;</span>
|
|
<span class="lineNum"> 347 </span> : char tmp[PATH_MAX];
|
|
<span class="lineNum"> 348 </span> :
|
|
<span class="lineNum"> 349 </span><span class="lineCov"> 17283154 : if (pathcmp(content->content, path) == 0)</span>
|
|
<span class="lineNum"> 350 </span><span class="lineNoCov"> 0 : return -1;</span>
|
|
<span class="lineNum"> 351 </span> :
|
|
<span class="lineNum"> 352 </span> : /* exclude also the ".tmp" copy used to save it */
|
|
<span class="lineNum"> 353 </span><span class="lineCov"> 17283154 : pathprint(tmp, sizeof(tmp), "%s.tmp", content->content);</span>
|
|
<span class="lineNum"> 354 </span><span class="lineCov"> 17283154 : if (pathcmp(tmp, path) == 0)</span>
|
|
<span class="lineNum"> 355 </span><span class="lineNoCov"> 0 : return -1;</span>
|
|
<span class="lineNum"> 356 </span> :
|
|
<span class="lineNum"> 357 </span> : /* exclude also the ".lock" file */
|
|
<span class="lineNum"> 358 </span><span class="lineCov"> 17283154 : pathprint(tmp, sizeof(tmp), "%s.lock", content->content);</span>
|
|
<span class="lineNum"> 359 </span><span class="lineCov"> 17283154 : if (pathcmp(tmp, path) == 0)</span>
|
|
<span class="lineNum"> 360 </span><span class="lineNoCov"> 0 : return -1;</span>
|
|
<span class="lineNum"> 361 </span> : }
|
|
<span class="lineNum"> 362 </span> :
|
|
<span class="lineNum"> 363 </span><span class="lineCov"> 3173372 : return 0;</span>
|
|
<a name="364"><span class="lineNum"> 364 </span> : }</a>
|
|
<span class="lineNum"> 365 </span> :
|
|
<span class="lineNum"> 366 </span><span class="lineCov"> 3690991 : 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>
|
|
<span class="lineNum"> 367 </span> : {
|
|
<span class="lineNum"> 368 </span> : struct snapraid_file* file;
|
|
<span class="lineNum"> 369 </span> : block_off_t i;
|
|
<span class="lineNum"> 370 </span> :
|
|
<span class="lineNum"> 371 </span><span class="lineCov"> 3690991 : file = malloc_nofail(sizeof(struct snapraid_file));</span>
|
|
<span class="lineNum"> 372 </span><span class="lineCov"> 3690991 : file->sub = strdup_nofail(sub);</span>
|
|
<span class="lineNum"> 373 </span><span class="lineCov"> 3690991 : file->size = size;</span>
|
|
<span class="lineNum"> 374 </span><span class="lineCov"> 3690991 : file->blockmax = (size + block_size - 1) / block_size;</span>
|
|
<span class="lineNum"> 375 </span><span class="lineCov"> 3690991 : file->mtime_sec = mtime_sec;</span>
|
|
<span class="lineNum"> 376 </span><span class="lineCov"> 3690991 : file->mtime_nsec = mtime_nsec;</span>
|
|
<span class="lineNum"> 377 </span><span class="lineCov"> 3690991 : file->inode = inode;</span>
|
|
<span class="lineNum"> 378 </span><span class="lineCov"> 3690991 : file->physical = physical;</span>
|
|
<span class="lineNum"> 379 </span><span class="lineCov"> 3690991 : file->flag = 0;</span>
|
|
<span class="lineNum"> 380 </span><span class="lineCov"> 3690991 : file->blockvec = malloc_nofail(file->blockmax * block_sizeof());</span>
|
|
<span class="lineNum"> 381 </span> :
|
|
<span class="lineNum"> 382 </span><span class="lineCov"> 12810201 : for (i = 0; i < file->blockmax; ++i) {</span>
|
|
<span class="lineNum"> 383 </span><span class="lineCov"> 9119210 : struct snapraid_block* block = file_block(file, i);</span>
|
|
<span class="lineNum"> 384 </span><span class="lineCov"> 9119210 : block_state_set(block, BLOCK_STATE_CHG);</span>
|
|
<span class="lineNum"> 385 </span><span class="lineCov"> 9119210 : hash_invalid_set(block->hash);</span>
|
|
<span class="lineNum"> 386 </span> : }
|
|
<span class="lineNum"> 387 </span> :
|
|
<span class="lineNum"> 388 </span><span class="lineCov"> 3690991 : return file;</span>
|
|
<a name="389"><span class="lineNum"> 389 </span> : }</a>
|
|
<span class="lineNum"> 390 </span> :
|
|
<span class="lineNum"> 391 </span><span class="lineCov"> 22687 : struct snapraid_file* file_dup(struct snapraid_file* copy)</span>
|
|
<span class="lineNum"> 392 </span> : {
|
|
<span class="lineNum"> 393 </span> : struct snapraid_file* file;
|
|
<span class="lineNum"> 394 </span> : block_off_t i;
|
|
<span class="lineNum"> 395 </span> :
|
|
<span class="lineNum"> 396 </span><span class="lineCov"> 22687 : file = malloc_nofail(sizeof(struct snapraid_file));</span>
|
|
<span class="lineNum"> 397 </span><span class="lineCov"> 22687 : file->sub = strdup_nofail(copy->sub);</span>
|
|
<span class="lineNum"> 398 </span><span class="lineCov"> 22687 : file->size = copy->size;</span>
|
|
<span class="lineNum"> 399 </span><span class="lineCov"> 22687 : file->blockmax = copy->blockmax;</span>
|
|
<span class="lineNum"> 400 </span><span class="lineCov"> 22687 : file->mtime_sec = copy->mtime_sec;</span>
|
|
<span class="lineNum"> 401 </span><span class="lineCov"> 22687 : file->mtime_nsec = copy->mtime_nsec;</span>
|
|
<span class="lineNum"> 402 </span><span class="lineCov"> 22687 : file->inode = copy->inode;</span>
|
|
<span class="lineNum"> 403 </span><span class="lineCov"> 22687 : file->physical = copy->physical;</span>
|
|
<span class="lineNum"> 404 </span><span class="lineCov"> 22687 : file->flag = copy->flag;</span>
|
|
<span class="lineNum"> 405 </span><span class="lineCov"> 22687 : file->blockvec = malloc_nofail(file->blockmax * block_sizeof());</span>
|
|
<span class="lineNum"> 406 </span> :
|
|
<span class="lineNum"> 407 </span><span class="lineCov"> 78655 : for (i = 0; i < file->blockmax; ++i) {</span>
|
|
<span class="lineNum"> 408 </span><span class="lineCov"> 55968 : struct snapraid_block* block = file_block(file, i);</span>
|
|
<span class="lineNum"> 409 </span><span class="lineCov"> 55968 : struct snapraid_block* copy_block = file_block(copy, i);</span>
|
|
<span class="lineNum"> 410 </span><span class="lineCov"> 55968 : block->state = copy_block->state;</span>
|
|
<span class="lineNum"> 411 </span><span class="lineCov"> 55968 : memcpy(block->hash, copy_block->hash, BLOCK_HASH_SIZE);</span>
|
|
<span class="lineNum"> 412 </span> : }
|
|
<span class="lineNum"> 413 </span> :
|
|
<span class="lineNum"> 414 </span><span class="lineCov"> 22687 : return file;</span>
|
|
<a name="415"><span class="lineNum"> 415 </span> : }</a>
|
|
<span class="lineNum"> 416 </span> :
|
|
<span class="lineNum"> 417 </span><span class="lineCov"> 3543815 : void file_free(struct snapraid_file* file)</span>
|
|
<span class="lineNum"> 418 </span> : {
|
|
<span class="lineNum"> 419 </span><span class="lineCov"> 3543815 : free(file->sub);</span>
|
|
<span class="lineNum"> 420 </span><span class="lineCov"> 3543815 : file->sub = 0;</span>
|
|
<span class="lineNum"> 421 </span><span class="lineCov"> 3543815 : free(file->blockvec);</span>
|
|
<span class="lineNum"> 422 </span><span class="lineCov"> 3543815 : file->blockvec = 0;</span>
|
|
<span class="lineNum"> 423 </span><span class="lineCov"> 3543815 : free(file);</span>
|
|
<a name="424"><span class="lineNum"> 424 </span><span class="lineCov"> 3543815 : }</span></a>
|
|
<span class="lineNum"> 425 </span> :
|
|
<span class="lineNum"> 426 </span><span class="lineCov"> 155 : void file_rename(struct snapraid_file* file, const char* sub)</span>
|
|
<span class="lineNum"> 427 </span> : {
|
|
<span class="lineNum"> 428 </span><span class="lineCov"> 155 : free(file->sub);</span>
|
|
<span class="lineNum"> 429 </span><span class="lineCov"> 155 : file->sub = strdup_nofail(sub);</span>
|
|
<a name="430"><span class="lineNum"> 430 </span><span class="lineCov"> 155 : }</span></a>
|
|
<span class="lineNum"> 431 </span> :
|
|
<span class="lineNum"> 432 </span><span class="lineCov"> 23636 : void file_copy(struct snapraid_file* src_file, struct snapraid_file* dst_file)</span>
|
|
<span class="lineNum"> 433 </span> : {
|
|
<span class="lineNum"> 434 </span> : block_off_t i;
|
|
<span class="lineNum"> 435 </span> :
|
|
<span class="lineNum"> 436 </span><span class="lineCov"> 23636 : if (src_file->size != dst_file->size) {</span>
|
|
<span class="lineNum"> 437 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 438 </span> : log_fatal("Internal inconsistency in copy file with different size\n");
|
|
<span class="lineNum"> 439 </span> : os_abort();
|
|
<span class="lineNum"> 440 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 441 </span> : }
|
|
<span class="lineNum"> 442 </span> :
|
|
<span class="lineNum"> 443 </span><span class="lineCov"> 23636 : if (src_file->mtime_sec != dst_file->mtime_sec) {</span>
|
|
<span class="lineNum"> 444 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 445 </span> : log_fatal("Internal inconsistency in copy file with different mtime_sec\n");
|
|
<span class="lineNum"> 446 </span> : os_abort();
|
|
<span class="lineNum"> 447 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 448 </span> : }
|
|
<span class="lineNum"> 449 </span> :
|
|
<span class="lineNum"> 450 </span><span class="lineCov"> 23636 : if (src_file->mtime_nsec != dst_file->mtime_nsec) {</span>
|
|
<span class="lineNum"> 451 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 452 </span> : log_fatal("Internal inconsistency in copy file with different mtime_nsec\n");
|
|
<span class="lineNum"> 453 </span> : os_abort();
|
|
<span class="lineNum"> 454 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 455 </span> : }
|
|
<span class="lineNum"> 456 </span> :
|
|
<span class="lineNum"> 457 </span><span class="lineCov"> 81879 : for (i = 0; i < dst_file->blockmax; ++i) {</span>
|
|
<span class="lineNum"> 458 </span> : /* set a block with hash computed but without parity */
|
|
<span class="lineNum"> 459 </span><span class="lineCov"> 58243 : block_state_set(file_block(dst_file, i), BLOCK_STATE_REP);</span>
|
|
<span class="lineNum"> 460 </span> :
|
|
<span class="lineNum"> 461 </span> : /* copy the hash */
|
|
<span class="lineNum"> 462 </span><span class="lineCov"> 58243 : memcpy(file_block(dst_file, i)->hash, file_block(src_file, i)->hash, BLOCK_HASH_SIZE);</span>
|
|
<span class="lineNum"> 463 </span> : }
|
|
<span class="lineNum"> 464 </span> :
|
|
<span class="lineNum"> 465 </span><span class="lineCov"> 23636 : file_flag_set(dst_file, FILE_IS_COPY);</span>
|
|
<a name="466"><span class="lineNum"> 466 </span><span class="lineCov"> 23636 : }</span></a>
|
|
<span class="lineNum"> 467 </span> :
|
|
<span class="lineNum"> 468 </span><span class="lineCov"> 47954 : const char* file_name(const struct snapraid_file* file)</span>
|
|
<span class="lineNum"> 469 </span> : {
|
|
<span class="lineNum"> 470 </span><span class="lineCov"> 47954 : const char* r = strrchr(file->sub, '/');</span>
|
|
<span class="lineNum"> 471 </span> :
|
|
<span class="lineNum"> 472 </span><span class="lineCov"> 47954 : if (!r)</span>
|
|
<span class="lineNum"> 473 </span><span class="lineCov"> 78 : r = file->sub;</span>
|
|
<span class="lineNum"> 474 </span> : else
|
|
<span class="lineNum"> 475 </span><span class="lineCov"> 47876 : ++r;</span>
|
|
<span class="lineNum"> 476 </span><span class="lineCov"> 47954 : return r;</span>
|
|
<a name="477"><span class="lineNum"> 477 </span> : }</a>
|
|
<span class="lineNum"> 478 </span> :
|
|
<span class="lineNum"> 479 </span><span class="lineCov"> 6823038 : unsigned file_block_size(struct snapraid_file* file, block_off_t file_pos, unsigned block_size)</span>
|
|
<span class="lineNum"> 480 </span> : {
|
|
<span class="lineNum"> 481 </span> : /* if it's the last block */
|
|
<span class="lineNum"> 482 </span><span class="lineCov"> 6823038 : if (file_pos + 1 == file->blockmax) {</span>
|
|
<span class="lineNum"> 483 </span> : unsigned block_remainder;
|
|
<span class="lineNum"> 484 </span><span class="lineCov"> 2775121 : if (file->size == 0)</span>
|
|
<span class="lineNum"> 485 </span><span class="lineNoCov"> 0 : return 0;</span>
|
|
<span class="lineNum"> 486 </span><span class="lineCov"> 2775121 : block_remainder = file->size % block_size;</span>
|
|
<span class="lineNum"> 487 </span><span class="lineCov"> 2775121 : if (block_remainder == 0)</span>
|
|
<span class="lineNum"> 488 </span><span class="lineCov"> 3044 : block_remainder = block_size;</span>
|
|
<span class="lineNum"> 489 </span><span class="lineCov"> 2775121 : return block_remainder;</span>
|
|
<span class="lineNum"> 490 </span> : }
|
|
<span class="lineNum"> 491 </span> :
|
|
<span class="lineNum"> 492 </span><span class="lineCov"> 4047917 : return block_size;</span>
|
|
<a name="493"><span class="lineNum"> 493 </span> : }</a>
|
|
<span class="lineNum"> 494 </span> :
|
|
<span class="lineNum"> 495 </span><span class="lineCov"> 5329167 : int file_block_is_last(struct snapraid_file* file, block_off_t file_pos)</span>
|
|
<span class="lineNum"> 496 </span> : {
|
|
<span class="lineNum"> 497 </span><span class="lineCov"> 5329167 : if (file_pos == 0 && file->blockmax == 0)</span>
|
|
<span class="lineNum"> 498 </span><span class="lineNoCov"> 0 : return 1;</span>
|
|
<span class="lineNum"> 499 </span> :
|
|
<span class="lineNum"> 500 </span><span class="lineCov"> 5329167 : if (file_pos >= file->blockmax) {</span>
|
|
<span class="lineNum"> 501 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 502 </span> : log_fatal("Internal inconsistency in file block position\n");
|
|
<span class="lineNum"> 503 </span> : os_abort();
|
|
<span class="lineNum"> 504 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 505 </span> : }
|
|
<span class="lineNum"> 506 </span> :
|
|
<span class="lineNum"> 507 </span><span class="lineCov"> 5329167 : return file_pos == file->blockmax - 1;</span>
|
|
<a name="508"><span class="lineNum"> 508 </span> : }</a>
|
|
<span class="lineNum"> 509 </span> :
|
|
<span class="lineNum"> 510 </span><span class="lineCov"> 975235 : int file_inode_compare_to_arg(const void* void_arg, const void* void_data)</span>
|
|
<span class="lineNum"> 511 </span> : {
|
|
<span class="lineNum"> 512 </span><span class="lineCov"> 975235 : const uint64_t* arg = void_arg;</span>
|
|
<span class="lineNum"> 513 </span><span class="lineCov"> 975235 : const struct snapraid_file* file = void_data;</span>
|
|
<span class="lineNum"> 514 </span> :
|
|
<span class="lineNum"> 515 </span><span class="lineCov"> 975235 : if (*arg < file->inode)</span>
|
|
<span class="lineNum"> 516 </span><span class="lineNoCov"> 0 : return -1;</span>
|
|
<span class="lineNum"> 517 </span><span class="lineCov"> 975235 : if (*arg > file->inode)</span>
|
|
<span class="lineNum"> 518 </span><span class="lineNoCov"> 0 : return 1;</span>
|
|
<span class="lineNum"> 519 </span><span class="lineCov"> 975235 : return 0;</span>
|
|
<a name="520"><span class="lineNum"> 520 </span> : }</a>
|
|
<span class="lineNum"> 521 </span> :
|
|
<span class="lineNum"> 522 </span><span class="lineNoCov"> 0 : int file_inode_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 523 </span> : {
|
|
<span class="lineNum"> 524 </span><span class="lineNoCov"> 0 : const struct snapraid_file* file_a = void_a;</span>
|
|
<span class="lineNum"> 525 </span><span class="lineNoCov"> 0 : const struct snapraid_file* file_b = void_b;</span>
|
|
<span class="lineNum"> 526 </span> :
|
|
<span class="lineNum"> 527 </span><span class="lineNoCov"> 0 : if (file_a->inode < file_b->inode)</span>
|
|
<span class="lineNum"> 528 </span><span class="lineNoCov"> 0 : return -1;</span>
|
|
<span class="lineNum"> 529 </span><span class="lineNoCov"> 0 : if (file_a->inode > file_b->inode)</span>
|
|
<span class="lineNum"> 530 </span><span class="lineNoCov"> 0 : return 1;</span>
|
|
<span class="lineNum"> 531 </span><span class="lineNoCov"> 0 : return 0;</span>
|
|
<a name="532"><span class="lineNum"> 532 </span> : }</a>
|
|
<span class="lineNum"> 533 </span> :
|
|
<span class="lineNum"> 534 </span><span class="lineCov"> 189475 : int file_path_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 535 </span> : {
|
|
<span class="lineNum"> 536 </span><span class="lineCov"> 189475 : const struct snapraid_file* file_a = void_a;</span>
|
|
<span class="lineNum"> 537 </span><span class="lineCov"> 189475 : const struct snapraid_file* file_b = void_b;</span>
|
|
<span class="lineNum"> 538 </span> :
|
|
<span class="lineNum"> 539 </span><span class="lineCov"> 189475 : return strcmp(file_a->sub, file_b->sub);</span>
|
|
<a name="540"><span class="lineNum"> 540 </span> : }</a>
|
|
<span class="lineNum"> 541 </span> :
|
|
<span class="lineNum"> 542 </span><span class="lineCov"> 44212 : int file_physical_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 543 </span> : {
|
|
<span class="lineNum"> 544 </span><span class="lineCov"> 44212 : const struct snapraid_file* file_a = void_a;</span>
|
|
<span class="lineNum"> 545 </span><span class="lineCov"> 44212 : const struct snapraid_file* file_b = void_b;</span>
|
|
<span class="lineNum"> 546 </span> :
|
|
<span class="lineNum"> 547 </span><span class="lineCov"> 44212 : if (file_a->physical < file_b->physical)</span>
|
|
<span class="lineNum"> 548 </span><span class="lineCov"> 31866 : return -1;</span>
|
|
<span class="lineNum"> 549 </span><span class="lineCov"> 12346 : if (file_a->physical > file_b->physical)</span>
|
|
<span class="lineNum"> 550 </span><span class="lineCov"> 12344 : return 1;</span>
|
|
<span class="lineNum"> 551 </span><span class="lineCov"> 2 : return 0;</span>
|
|
<a name="552"><span class="lineNum"> 552 </span> : }</a>
|
|
<span class="lineNum"> 553 </span> :
|
|
<span class="lineNum"> 554 </span><span class="lineCov"> 97871 : int file_path_compare_to_arg(const void* void_arg, const void* void_data)</span>
|
|
<span class="lineNum"> 555 </span> : {
|
|
<span class="lineNum"> 556 </span><span class="lineCov"> 97871 : const char* arg = void_arg;</span>
|
|
<span class="lineNum"> 557 </span><span class="lineCov"> 97871 : const struct snapraid_file* file = void_data;</span>
|
|
<span class="lineNum"> 558 </span> :
|
|
<span class="lineNum"> 559 </span><span class="lineCov"> 97871 : return strcmp(arg, file->sub);</span>
|
|
<a name="560"><span class="lineNum"> 560 </span> : }</a>
|
|
<span class="lineNum"> 561 </span> :
|
|
<span class="lineNum"> 562 </span><span class="lineCov"> 23977 : int file_name_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 563 </span> : {
|
|
<span class="lineNum"> 564 </span><span class="lineCov"> 23977 : const struct snapraid_file* file_a = void_a;</span>
|
|
<span class="lineNum"> 565 </span><span class="lineCov"> 23977 : const struct snapraid_file* file_b = void_b;</span>
|
|
<span class="lineNum"> 566 </span><span class="lineCov"> 23977 : const char* name_a = file_name(file_a);</span>
|
|
<span class="lineNum"> 567 </span><span class="lineCov"> 23977 : const char* name_b = file_name(file_b);</span>
|
|
<span class="lineNum"> 568 </span> :
|
|
<span class="lineNum"> 569 </span><span class="lineCov"> 23977 : return strcmp(name_a, name_b);</span>
|
|
<a name="570"><span class="lineNum"> 570 </span> : }</a>
|
|
<span class="lineNum"> 571 </span> :
|
|
<span class="lineNum"> 572 </span><span class="lineCov"> 23670 : int file_stamp_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 573 </span> : {
|
|
<span class="lineNum"> 574 </span><span class="lineCov"> 23670 : const struct snapraid_file* file_a = void_a;</span>
|
|
<span class="lineNum"> 575 </span><span class="lineCov"> 23670 : const struct snapraid_file* file_b = void_b;</span>
|
|
<span class="lineNum"> 576 </span> :
|
|
<span class="lineNum"> 577 </span><span class="lineCov"> 23670 : if (file_a->size < file_b->size)</span>
|
|
<span class="lineNum"> 578 </span><span class="lineNoCov"> 0 : return -1;</span>
|
|
<span class="lineNum"> 579 </span><span class="lineCov"> 23670 : if (file_a->size > file_b->size)</span>
|
|
<span class="lineNum"> 580 </span><span class="lineNoCov"> 0 : return 1;</span>
|
|
<span class="lineNum"> 581 </span> :
|
|
<span class="lineNum"> 582 </span><span class="lineCov"> 23670 : if (file_a->mtime_sec < file_b->mtime_sec)</span>
|
|
<span class="lineNum"> 583 </span><span class="lineNoCov"> 0 : return -1;</span>
|
|
<span class="lineNum"> 584 </span><span class="lineCov"> 23670 : if (file_a->mtime_sec > file_b->mtime_sec)</span>
|
|
<span class="lineNum"> 585 </span><span class="lineNoCov"> 0 : return 1;</span>
|
|
<span class="lineNum"> 586 </span> :
|
|
<span class="lineNum"> 587 </span><span class="lineCov"> 23670 : if (file_a->mtime_nsec < file_b->mtime_nsec)</span>
|
|
<span class="lineNum"> 588 </span><span class="lineNoCov"> 0 : return -1;</span>
|
|
<span class="lineNum"> 589 </span><span class="lineCov"> 23670 : if (file_a->mtime_nsec > file_b->mtime_nsec)</span>
|
|
<span class="lineNum"> 590 </span><span class="lineNoCov"> 0 : return 1;</span>
|
|
<span class="lineNum"> 591 </span> :
|
|
<span class="lineNum"> 592 </span><span class="lineCov"> 23670 : return 0;</span>
|
|
<a name="593"><span class="lineNum"> 593 </span> : }</a>
|
|
<span class="lineNum"> 594 </span> :
|
|
<span class="lineNum"> 595 </span><span class="lineCov"> 23977 : int file_namestamp_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 596 </span> : {
|
|
<span class="lineNum"> 597 </span> : int ret;
|
|
<span class="lineNum"> 598 </span> :
|
|
<span class="lineNum"> 599 </span><span class="lineCov"> 23977 : ret = file_name_compare(void_a, void_b);</span>
|
|
<span class="lineNum"> 600 </span><span class="lineCov"> 23977 : if (ret != 0)</span>
|
|
<span class="lineNum"> 601 </span><span class="lineCov"> 307 : return ret;</span>
|
|
<span class="lineNum"> 602 </span> :
|
|
<span class="lineNum"> 603 </span><span class="lineCov"> 23670 : return file_stamp_compare(void_a, void_b);</span>
|
|
<a name="604"><span class="lineNum"> 604 </span> : }</a>
|
|
<span class="lineNum"> 605 </span> :
|
|
<span class="lineNum"> 606 </span><span class="lineNoCov"> 0 : int file_pathstamp_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 607 </span> : {
|
|
<span class="lineNum"> 608 </span> : int ret;
|
|
<span class="lineNum"> 609 </span> :
|
|
<span class="lineNum"> 610 </span><span class="lineNoCov"> 0 : ret = file_path_compare(void_a, void_b);</span>
|
|
<span class="lineNum"> 611 </span><span class="lineNoCov"> 0 : if (ret != 0)</span>
|
|
<span class="lineNum"> 612 </span><span class="lineNoCov"> 0 : return ret;</span>
|
|
<span class="lineNum"> 613 </span> :
|
|
<span class="lineNum"> 614 </span><span class="lineNoCov"> 0 : return file_stamp_compare(void_a, void_b);</span>
|
|
<a name="615"><span class="lineNum"> 615 </span> : }</a>
|
|
<span class="lineNum"> 616 </span> :
|
|
<span class="lineNum"> 617 </span><span class="lineCov"> 3735289 : struct snapraid_extent* extent_alloc(block_off_t parity_pos, struct snapraid_file* file, block_off_t file_pos, block_off_t count)</span>
|
|
<span class="lineNum"> 618 </span> : {
|
|
<span class="lineNum"> 619 </span> : struct snapraid_extent* extent;
|
|
<span class="lineNum"> 620 </span> :
|
|
<span class="lineNum"> 621 </span><span class="lineCov"> 3735289 : if (count == 0) {</span>
|
|
<span class="lineNum"> 622 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 623 </span> : log_fatal("Internal inconsistency when allocating empty extent for file '%s' at position '%u/%u'\n", file->sub, file_pos, file->blockmax);
|
|
<span class="lineNum"> 624 </span> : os_abort();
|
|
<span class="lineNum"> 625 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 626 </span> : }
|
|
<span class="lineNum"> 627 </span><span class="lineCov"> 3735289 : if (file_pos + count > file->blockmax) {</span>
|
|
<span class="lineNum"> 628 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 629 </span> : log_fatal("Internal inconsistency when allocating overflowing extent for file '%s' at position '%u:%u/%u'\n", file->sub, file_pos, count, file->blockmax);
|
|
<span class="lineNum"> 630 </span> : os_abort();
|
|
<span class="lineNum"> 631 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 632 </span> : }
|
|
<span class="lineNum"> 633 </span> :
|
|
<span class="lineNum"> 634 </span><span class="lineCov"> 3735289 : extent = malloc_nofail(sizeof(struct snapraid_extent));</span>
|
|
<span class="lineNum"> 635 </span><span class="lineCov"> 3735289 : extent->parity_pos = parity_pos;</span>
|
|
<span class="lineNum"> 636 </span><span class="lineCov"> 3735289 : extent->file = file;</span>
|
|
<span class="lineNum"> 637 </span><span class="lineCov"> 3735289 : extent->file_pos = file_pos;</span>
|
|
<span class="lineNum"> 638 </span><span class="lineCov"> 3735289 : extent->count = count;</span>
|
|
<span class="lineNum"> 639 </span> :
|
|
<span class="lineNum"> 640 </span><span class="lineCov"> 3735289 : return extent;</span>
|
|
<a name="641"><span class="lineNum"> 641 </span> : }</a>
|
|
<span class="lineNum"> 642 </span> :
|
|
<span class="lineNum"> 643 </span><span class="lineCov"> 3564865 : void extent_free(struct snapraid_extent* extent)</span>
|
|
<span class="lineNum"> 644 </span> : {
|
|
<span class="lineNum"> 645 </span><span class="lineCov"> 3564865 : free(extent);</span>
|
|
<a name="646"><span class="lineNum"> 646 </span><span class="lineCov"> 3564865 : }</span></a>
|
|
<span class="lineNum"> 647 </span> :
|
|
<span class="lineNum"> 648 </span><span class="lineCov"> 44509325 : int extent_parity_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 649 </span> : {
|
|
<span class="lineNum"> 650 </span><span class="lineCov"> 44509325 : const struct snapraid_extent* arg_a = void_a;</span>
|
|
<span class="lineNum"> 651 </span><span class="lineCov"> 44509325 : const struct snapraid_extent* arg_b = void_b;</span>
|
|
<span class="lineNum"> 652 </span> :
|
|
<span class="lineNum"> 653 </span><span class="lineCov"> 44509325 : if (arg_a->parity_pos < arg_b->parity_pos)</span>
|
|
<span class="lineNum"> 654 </span><span class="lineCov"> 960426 : return -1;</span>
|
|
<span class="lineNum"> 655 </span><span class="lineCov"> 43548899 : if (arg_a->parity_pos > arg_b->parity_pos)</span>
|
|
<span class="lineNum"> 656 </span><span class="lineCov"> 43509241 : return 1;</span>
|
|
<span class="lineNum"> 657 </span> :
|
|
<span class="lineNum"> 658 </span><span class="lineCov"> 39658 : return 0;</span>
|
|
<a name="659"><span class="lineNum"> 659 </span> : }</a>
|
|
<span class="lineNum"> 660 </span> :
|
|
<span class="lineNum"> 661 </span><span class="lineCov"> 45005658 : int extent_file_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 662 </span> : {
|
|
<span class="lineNum"> 663 </span><span class="lineCov"> 45005658 : const struct snapraid_extent* arg_a = void_a;</span>
|
|
<span class="lineNum"> 664 </span><span class="lineCov"> 45005658 : const struct snapraid_extent* arg_b = void_b;</span>
|
|
<span class="lineNum"> 665 </span> :
|
|
<span class="lineNum"> 666 </span><span class="lineCov"> 45005658 : if (arg_a->file < arg_b->file)</span>
|
|
<span class="lineNum"> 667 </span><span class="lineCov"> 875311 : return -1;</span>
|
|
<span class="lineNum"> 668 </span><span class="lineCov"> 44130347 : if (arg_a->file > arg_b->file)</span>
|
|
<span class="lineNum"> 669 </span><span class="lineCov"> 44059546 : return 1;</span>
|
|
<span class="lineNum"> 670 </span> :
|
|
<span class="lineNum"> 671 </span><span class="lineCov"> 70801 : if (arg_a->file_pos < arg_b->file_pos)</span>
|
|
<span class="lineNum"> 672 </span><span class="lineCov"> 208 : return -1;</span>
|
|
<span class="lineNum"> 673 </span><span class="lineCov"> 70593 : if (arg_a->file_pos > arg_b->file_pos)</span>
|
|
<span class="lineNum"> 674 </span><span class="lineCov"> 30935 : return 1;</span>
|
|
<span class="lineNum"> 675 </span> :
|
|
<span class="lineNum"> 676 </span><span class="lineCov"> 39658 : return 0;</span>
|
|
<a name="677"><span class="lineNum"> 677 </span> : }</a>
|
|
<span class="lineNum"> 678 </span> :
|
|
<span class="lineNum"> 679 </span><span class="lineCov"> 119522 : struct snapraid_link* link_alloc(const char* sub, const char* linkto, unsigned link_flag)</span>
|
|
<span class="lineNum"> 680 </span> : {
|
|
<span class="lineNum"> 681 </span> : struct snapraid_link* slink;
|
|
<span class="lineNum"> 682 </span> :
|
|
<span class="lineNum"> 683 </span><span class="lineCov"> 119522 : slink = malloc_nofail(sizeof(struct snapraid_link));</span>
|
|
<span class="lineNum"> 684 </span><span class="lineCov"> 119522 : slink->sub = strdup_nofail(sub);</span>
|
|
<span class="lineNum"> 685 </span><span class="lineCov"> 119522 : slink->linkto = strdup_nofail(linkto);</span>
|
|
<span class="lineNum"> 686 </span><span class="lineCov"> 119522 : slink->flag = link_flag;</span>
|
|
<span class="lineNum"> 687 </span> :
|
|
<span class="lineNum"> 688 </span><span class="lineCov"> 119522 : return slink;</span>
|
|
<a name="689"><span class="lineNum"> 689 </span> : }</a>
|
|
<span class="lineNum"> 690 </span> :
|
|
<span class="lineNum"> 691 </span><span class="lineCov"> 113724 : void link_free(struct snapraid_link* slink)</span>
|
|
<span class="lineNum"> 692 </span> : {
|
|
<span class="lineNum"> 693 </span><span class="lineCov"> 113724 : free(slink->sub);</span>
|
|
<span class="lineNum"> 694 </span><span class="lineCov"> 113724 : free(slink->linkto);</span>
|
|
<span class="lineNum"> 695 </span><span class="lineCov"> 113724 : free(slink);</span>
|
|
<a name="696"><span class="lineNum"> 696 </span><span class="lineCov"> 113724 : }</span></a>
|
|
<span class="lineNum"> 697 </span> :
|
|
<span class="lineNum"> 698 </span><span class="lineCov"> 33727 : int link_name_compare_to_arg(const void* void_arg, const void* void_data)</span>
|
|
<span class="lineNum"> 699 </span> : {
|
|
<span class="lineNum"> 700 </span><span class="lineCov"> 33727 : const char* arg = void_arg;</span>
|
|
<span class="lineNum"> 701 </span><span class="lineCov"> 33727 : const struct snapraid_link* slink = void_data;</span>
|
|
<span class="lineNum"> 702 </span> :
|
|
<span class="lineNum"> 703 </span><span class="lineCov"> 33727 : return strcmp(arg, slink->sub);</span>
|
|
<a name="704"><span class="lineNum"> 704 </span> : }</a>
|
|
<span class="lineNum"> 705 </span> :
|
|
<span class="lineNum"> 706 </span><span class="lineCov"> 3337 : int link_alpha_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 707 </span> : {
|
|
<span class="lineNum"> 708 </span><span class="lineCov"> 3337 : const struct snapraid_link* slink_a = void_a;</span>
|
|
<span class="lineNum"> 709 </span><span class="lineCov"> 3337 : const struct snapraid_link* slink_b = void_b;</span>
|
|
<span class="lineNum"> 710 </span> :
|
|
<span class="lineNum"> 711 </span><span class="lineCov"> 3337 : return strcmp(slink_a->sub, slink_b->sub);</span>
|
|
<a name="712"><span class="lineNum"> 712 </span> : }</a>
|
|
<span class="lineNum"> 713 </span> :
|
|
<span class="lineNum"> 714 </span><span class="lineCov"> 800 : struct snapraid_dir* dir_alloc(const char* sub)</span>
|
|
<span class="lineNum"> 715 </span> : {
|
|
<span class="lineNum"> 716 </span> : struct snapraid_dir* dir;
|
|
<span class="lineNum"> 717 </span> :
|
|
<span class="lineNum"> 718 </span><span class="lineCov"> 800 : dir = malloc_nofail(sizeof(struct snapraid_dir));</span>
|
|
<span class="lineNum"> 719 </span><span class="lineCov"> 800 : dir->sub = strdup_nofail(sub);</span>
|
|
<span class="lineNum"> 720 </span><span class="lineCov"> 800 : dir->flag = 0;</span>
|
|
<span class="lineNum"> 721 </span> :
|
|
<span class="lineNum"> 722 </span><span class="lineCov"> 800 : return dir;</span>
|
|
<a name="723"><span class="lineNum"> 723 </span> : }</a>
|
|
<span class="lineNum"> 724 </span> :
|
|
<span class="lineNum"> 725 </span><span class="lineCov"> 752 : void dir_free(struct snapraid_dir* dir)</span>
|
|
<span class="lineNum"> 726 </span> : {
|
|
<span class="lineNum"> 727 </span><span class="lineCov"> 752 : free(dir->sub);</span>
|
|
<span class="lineNum"> 728 </span><span class="lineCov"> 752 : free(dir);</span>
|
|
<a name="729"><span class="lineNum"> 729 </span><span class="lineCov"> 752 : }</span></a>
|
|
<span class="lineNum"> 730 </span> :
|
|
<span class="lineNum"> 731 </span><span class="lineCov"> 249 : int dir_name_compare(const void* void_arg, const void* void_data)</span>
|
|
<span class="lineNum"> 732 </span> : {
|
|
<span class="lineNum"> 733 </span><span class="lineCov"> 249 : const char* arg = void_arg;</span>
|
|
<span class="lineNum"> 734 </span><span class="lineCov"> 249 : const struct snapraid_dir* dir = void_data;</span>
|
|
<span class="lineNum"> 735 </span> :
|
|
<span class="lineNum"> 736 </span><span class="lineCov"> 249 : return strcmp(arg, dir->sub);</span>
|
|
<a name="737"><span class="lineNum"> 737 </span> : }</a>
|
|
<span class="lineNum"> 738 </span> :
|
|
<span class="lineNum"> 739 </span><span class="lineCov"> 1591 : struct snapraid_disk* disk_alloc(const char* name, const char* dir, uint64_t dev, const char* uuid, int skip)</span>
|
|
<span class="lineNum"> 740 </span> : {
|
|
<span class="lineNum"> 741 </span> : struct snapraid_disk* disk;
|
|
<span class="lineNum"> 742 </span> :
|
|
<span class="lineNum"> 743 </span><span class="lineCov"> 1591 : disk = malloc_nofail(sizeof(struct snapraid_disk));</span>
|
|
<span class="lineNum"> 744 </span><span class="lineCov"> 1591 : pathcpy(disk->name, sizeof(disk->name), name);</span>
|
|
<span class="lineNum"> 745 </span><span class="lineCov"> 1591 : pathimport(disk->dir, sizeof(disk->dir), dir);</span>
|
|
<span class="lineNum"> 746 </span><span class="lineCov"> 1591 : pathcpy(disk->uuid, sizeof(disk->uuid), uuid);</span>
|
|
<span class="lineNum"> 747 </span> :
|
|
<span class="lineNum"> 748 </span> : /* ensure that the dir terminate with "/" if it isn't empty */
|
|
<span class="lineNum"> 749 </span><span class="lineCov"> 1591 : pathslash(disk->dir, sizeof(disk->dir));</span>
|
|
<span class="lineNum"> 750 </span> :
|
|
<span class="lineNum"> 751 </span> : #if HAVE_PTHREAD
|
|
<span class="lineNum"> 752 </span><span class="lineCov"> 1591 : thread_mutex_init(&disk->fs_mutex, 0);</span>
|
|
<span class="lineNum"> 753 </span> : #endif
|
|
<span class="lineNum"> 754 </span> :
|
|
<span class="lineNum"> 755 </span><span class="lineCov"> 1591 : disk->smartctl[0] = 0;</span>
|
|
<span class="lineNum"> 756 </span><span class="lineCov"> 1591 : disk->device = dev;</span>
|
|
<span class="lineNum"> 757 </span><span class="lineCov"> 1591 : disk->tick = 0;</span>
|
|
<span class="lineNum"> 758 </span><span class="lineCov"> 1591 : disk->cached = 0;</span>
|
|
<span class="lineNum"> 759 </span><span class="lineCov"> 1591 : disk->total_blocks = 0;</span>
|
|
<span class="lineNum"> 760 </span><span class="lineCov"> 1591 : disk->free_blocks = 0;</span>
|
|
<span class="lineNum"> 761 </span><span class="lineCov"> 1591 : disk->first_free_block = 0;</span>
|
|
<span class="lineNum"> 762 </span><span class="lineCov"> 1591 : disk->has_volatile_inodes = 0;</span>
|
|
<span class="lineNum"> 763 </span><span class="lineCov"> 1591 : disk->has_unreliable_physical = 0;</span>
|
|
<span class="lineNum"> 764 </span><span class="lineCov"> 1591 : disk->has_different_uuid = 0;</span>
|
|
<span class="lineNum"> 765 </span><span class="lineCov"> 1591 : disk->has_unsupported_uuid = *uuid == 0; /* empty UUID means unsupported */</span>
|
|
<span class="lineNum"> 766 </span><span class="lineCov"> 1591 : disk->had_empty_uuid = 0;</span>
|
|
<span class="lineNum"> 767 </span><span class="lineCov"> 1591 : disk->mapping_idx = -1;</span>
|
|
<span class="lineNum"> 768 </span><span class="lineCov"> 1591 : disk->skip_access = skip;</span>
|
|
<span class="lineNum"> 769 </span><span class="lineCov"> 1591 : tommy_list_init(&disk->filelist);</span>
|
|
<span class="lineNum"> 770 </span><span class="lineCov"> 1591 : tommy_list_init(&disk->deletedlist);</span>
|
|
<span class="lineNum"> 771 </span><span class="lineCov"> 1591 : tommy_hashdyn_init(&disk->inodeset);</span>
|
|
<span class="lineNum"> 772 </span><span class="lineCov"> 1591 : tommy_hashdyn_init(&disk->pathset);</span>
|
|
<span class="lineNum"> 773 </span><span class="lineCov"> 1591 : tommy_hashdyn_init(&disk->stampset);</span>
|
|
<span class="lineNum"> 774 </span><span class="lineCov"> 1591 : tommy_list_init(&disk->linklist);</span>
|
|
<span class="lineNum"> 775 </span><span class="lineCov"> 1591 : tommy_hashdyn_init(&disk->linkset);</span>
|
|
<span class="lineNum"> 776 </span><span class="lineCov"> 1591 : tommy_list_init(&disk->dirlist);</span>
|
|
<span class="lineNum"> 777 </span><span class="lineCov"> 1591 : tommy_hashdyn_init(&disk->dirset);</span>
|
|
<span class="lineNum"> 778 </span><span class="lineCov"> 1591 : tommy_tree_init(&disk->fs_parity, extent_parity_compare);</span>
|
|
<span class="lineNum"> 779 </span><span class="lineCov"> 1591 : tommy_tree_init(&disk->fs_file, extent_file_compare);</span>
|
|
<span class="lineNum"> 780 </span><span class="lineCov"> 1591 : disk->fs_last = 0;</span>
|
|
<span class="lineNum"> 781 </span> :
|
|
<span class="lineNum"> 782 </span><span class="lineCov"> 1591 : return disk;</span>
|
|
<a name="783"><span class="lineNum"> 783 </span> : }</a>
|
|
<span class="lineNum"> 784 </span> :
|
|
<span class="lineNum"> 785 </span><span class="lineCov"> 1459 : void disk_free(struct snapraid_disk* disk)</span>
|
|
<span class="lineNum"> 786 </span> : {
|
|
<span class="lineNum"> 787 </span><span class="lineCov"> 1459 : tommy_list_foreach(&disk->filelist, (tommy_foreach_func*)file_free);</span>
|
|
<span class="lineNum"> 788 </span><span class="lineCov"> 1459 : tommy_list_foreach(&disk->deletedlist, (tommy_foreach_func*)file_free);</span>
|
|
<span class="lineNum"> 789 </span><span class="lineCov"> 1459 : tommy_tree_foreach(&disk->fs_file, (tommy_foreach_func*)extent_free);</span>
|
|
<span class="lineNum"> 790 </span><span class="lineCov"> 1459 : tommy_hashdyn_done(&disk->inodeset);</span>
|
|
<span class="lineNum"> 791 </span><span class="lineCov"> 1459 : tommy_hashdyn_done(&disk->pathset);</span>
|
|
<span class="lineNum"> 792 </span><span class="lineCov"> 1459 : tommy_hashdyn_done(&disk->stampset);</span>
|
|
<span class="lineNum"> 793 </span><span class="lineCov"> 1459 : tommy_list_foreach(&disk->linklist, (tommy_foreach_func*)link_free);</span>
|
|
<span class="lineNum"> 794 </span><span class="lineCov"> 1459 : tommy_hashdyn_done(&disk->linkset);</span>
|
|
<span class="lineNum"> 795 </span><span class="lineCov"> 1459 : tommy_list_foreach(&disk->dirlist, (tommy_foreach_func*)dir_free);</span>
|
|
<span class="lineNum"> 796 </span><span class="lineCov"> 1459 : tommy_hashdyn_done(&disk->dirset);</span>
|
|
<span class="lineNum"> 797 </span> :
|
|
<span class="lineNum"> 798 </span> : #if HAVE_PTHREAD
|
|
<span class="lineNum"> 799 </span><span class="lineCov"> 1459 : thread_mutex_destroy(&disk->fs_mutex);</span>
|
|
<span class="lineNum"> 800 </span> : #endif
|
|
<span class="lineNum"> 801 </span> :
|
|
<span class="lineNum"> 802 </span><span class="lineCov"> 1459 : free(disk);</span>
|
|
<a name="803"><span class="lineNum"> 803 </span><span class="lineCov"> 1459 : }</span></a>
|
|
<span class="lineNum"> 804 </span> :
|
|
<span class="lineNum"> 805 </span><span class="lineCov"> 53195526 : static inline void fs_lock(struct snapraid_disk* disk)</span>
|
|
<span class="lineNum"> 806 </span> : {
|
|
<span class="lineNum"> 807 </span> : #if HAVE_PTHREAD
|
|
<span class="lineNum"> 808 </span><span class="lineCov"> 53195526 : thread_mutex_lock(&disk->fs_mutex);</span>
|
|
<span class="lineNum"> 809 </span> : #else
|
|
<span class="lineNum"> 810 </span> : (void)disk;
|
|
<span class="lineNum"> 811 </span> : #endif
|
|
<a name="812"><span class="lineNum"> 812 </span><span class="lineCov"> 53196097 : }</span></a>
|
|
<span class="lineNum"> 813 </span> :
|
|
<span class="lineNum"> 814 </span><span class="lineCov"> 53195112 : static inline void fs_unlock(struct snapraid_disk* disk)</span>
|
|
<span class="lineNum"> 815 </span> : {
|
|
<span class="lineNum"> 816 </span> : #if HAVE_PTHREAD
|
|
<span class="lineNum"> 817 </span><span class="lineCov"> 53195112 : thread_mutex_unlock(&disk->fs_mutex);</span>
|
|
<span class="lineNum"> 818 </span> : #else
|
|
<span class="lineNum"> 819 </span> : (void)disk;
|
|
<span class="lineNum"> 820 </span> : #endif
|
|
<span class="lineNum"> 821 </span><span class="lineCov"> 53196272 : }</span>
|
|
<span class="lineNum"> 822 </span> :
|
|
<span class="lineNum"> 823 </span> : struct extent_disk_empty {
|
|
<span class="lineNum"> 824 </span> : block_off_t blockmax;
|
|
<span class="lineNum"> 825 </span> : };
|
|
<span class="lineNum"> 826 </span> :
|
|
<span class="lineNum"> 827 </span> : /**
|
|
<a name="828"><span class="lineNum"> 828 </span> : * Compare the extent if inside the specified blockmax.</a>
|
|
<span class="lineNum"> 829 </span> : */
|
|
<span class="lineNum"> 830 </span><span class="lineCov"> 12 : static int extent_disk_empty_compare_unlock(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 831 </span> : {
|
|
<span class="lineNum"> 832 </span><span class="lineCov"> 12 : const struct extent_disk_empty* arg_a = void_a;</span>
|
|
<span class="lineNum"> 833 </span><span class="lineCov"> 12 : const struct snapraid_extent* arg_b = void_b;</span>
|
|
<span class="lineNum"> 834 </span> :
|
|
<span class="lineNum"> 835 </span> : /* if the block is inside the specified blockmax, it's found */
|
|
<span class="lineNum"> 836 </span><span class="lineCov"> 12 : if (arg_a->blockmax > arg_b->parity_pos)</span>
|
|
<span class="lineNum"> 837 </span><span class="lineCov"> 7 : return 0;</span>
|
|
<span class="lineNum"> 838 </span> :
|
|
<span class="lineNum"> 839 </span> : /* otherwise search for a smaller one */
|
|
<span class="lineNum"> 840 </span><span class="lineCov"> 5 : return -1;</span>
|
|
<a name="841"><span class="lineNum"> 841 </span> : }</a>
|
|
<span class="lineNum"> 842 </span> :
|
|
<span class="lineNum"> 843 </span><span class="lineCov"> 906 : int fs_is_empty(struct snapraid_disk* disk, block_off_t blockmax)</span>
|
|
<span class="lineNum"> 844 </span> : {
|
|
<span class="lineNum"> 845 </span><span class="lineCov"> 906 : struct extent_disk_empty arg = { blockmax };</span>
|
|
<span class="lineNum"> 846 </span> :
|
|
<span class="lineNum"> 847 </span> : /* if there is an element, it's not empty */
|
|
<span class="lineNum"> 848 </span> : /* even if links and dirs have no block allocation */
|
|
<span class="lineNum"> 849 </span><span class="lineCov"> 906 : if (!tommy_list_empty(&disk->filelist))</span>
|
|
<span class="lineNum"> 850 </span><span class="lineCov"> 807 : return 0;</span>
|
|
<span class="lineNum"> 851 </span><span class="lineCov"> 99 : if (!tommy_list_empty(&disk->linklist))</span>
|
|
<span class="lineNum"> 852 </span><span class="lineNoCov"> 0 : return 0;</span>
|
|
<span class="lineNum"> 853 </span><span class="lineCov"> 99 : if (!tommy_list_empty(&disk->dirlist))</span>
|
|
<span class="lineNum"> 854 </span><span class="lineNoCov"> 0 : return 0;</span>
|
|
<span class="lineNum"> 855 </span> :
|
|
<span class="lineNum"> 856 </span><span class="lineCov"> 99 : fs_lock(disk);</span>
|
|
<span class="lineNum"> 857 </span> :
|
|
<span class="lineNum"> 858 </span> : /* search for any extent inside blockmax */
|
|
<span class="lineNum"> 859 </span><span class="lineCov"> 99 : if (tommy_tree_search_compare(&disk->fs_parity, extent_disk_empty_compare_unlock, &arg) != 0) {</span>
|
|
<span class="lineNum"> 860 </span><span class="lineCov"> 7 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 861 </span><span class="lineCov"> 7 : return 0;</span>
|
|
<span class="lineNum"> 862 </span> : }
|
|
<span class="lineNum"> 863 </span> :
|
|
<span class="lineNum"> 864 </span> : /* finally, it's empty */
|
|
<span class="lineNum"> 865 </span><span class="lineCov"> 92 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 866 </span><span class="lineCov"> 92 : return 1;</span>
|
|
<span class="lineNum"> 867 </span> : }
|
|
<span class="lineNum"> 868 </span> :
|
|
<span class="lineNum"> 869 </span> : struct extent_disk_size {
|
|
<span class="lineNum"> 870 </span> : block_off_t size;
|
|
<span class="lineNum"> 871 </span> : };
|
|
<span class="lineNum"> 872 </span> :
|
|
<span class="lineNum"> 873 </span> : /**
|
|
<span class="lineNum"> 874 </span> : * Compare the extent by highest parity position.
|
|
<span class="lineNum"> 875 </span> : *
|
|
<a name="876"><span class="lineNum"> 876 </span> : * The maximum parity position is stored as size.</a>
|
|
<span class="lineNum"> 877 </span> : */
|
|
<span class="lineNum"> 878 </span><span class="lineCov"> 50514 : static int extent_disk_size_compare_unlock(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 879 </span> : {
|
|
<span class="lineNum"> 880 </span><span class="lineCov"> 50514 : struct extent_disk_size* arg_a = (void*)void_a;</span>
|
|
<span class="lineNum"> 881 </span><span class="lineCov"> 50514 : const struct snapraid_extent* arg_b = void_b;</span>
|
|
<span class="lineNum"> 882 </span> :
|
|
<span class="lineNum"> 883 </span> : /* get the maximum size */
|
|
<span class="lineNum"> 884 </span><span class="lineCov"> 50514 : if (arg_a->size < arg_b->parity_pos + arg_b->count)</span>
|
|
<span class="lineNum"> 885 </span><span class="lineCov"> 50514 : arg_a->size = arg_b->parity_pos + arg_b->count;</span>
|
|
<span class="lineNum"> 886 </span> :
|
|
<span class="lineNum"> 887 </span> : /* search always for a bigger one */
|
|
<span class="lineNum"> 888 </span><span class="lineCov"> 50514 : return 1;</span>
|
|
<a name="889"><span class="lineNum"> 889 </span> : }</a>
|
|
<span class="lineNum"> 890 </span> :
|
|
<span class="lineNum"> 891 </span><span class="lineCov"> 4363 : block_off_t fs_size(struct snapraid_disk* disk)</span>
|
|
<span class="lineNum"> 892 </span> : {
|
|
<span class="lineNum"> 893 </span><span class="lineCov"> 4363 : struct extent_disk_size arg = { 0 };</span>
|
|
<span class="lineNum"> 894 </span> :
|
|
<span class="lineNum"> 895 </span><span class="lineCov"> 4363 : fs_lock(disk);</span>
|
|
<span class="lineNum"> 896 </span> :
|
|
<span class="lineNum"> 897 </span><span class="lineCov"> 4363 : tommy_tree_search_compare(&disk->fs_parity, extent_disk_size_compare_unlock, &arg);</span>
|
|
<span class="lineNum"> 898 </span> :
|
|
<span class="lineNum"> 899 </span><span class="lineCov"> 4363 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 900 </span> :
|
|
<span class="lineNum"> 901 </span><span class="lineCov"> 4363 : return arg.size;</span>
|
|
<span class="lineNum"> 902 </span> : }
|
|
<span class="lineNum"> 903 </span> :
|
|
<span class="lineNum"> 904 </span> : struct extent_check {
|
|
<span class="lineNum"> 905 </span> : const struct snapraid_extent* prev;
|
|
<span class="lineNum"> 906 </span> : int result;
|
|
<a name="907"><span class="lineNum"> 907 </span> : };</a>
|
|
<span class="lineNum"> 908 </span> :
|
|
<span class="lineNum"> 909 </span><span class="lineCov"> 6584473 : static void extent_parity_check_foreach_unlock(void* void_arg, void* void_obj)</span>
|
|
<span class="lineNum"> 910 </span> : {
|
|
<span class="lineNum"> 911 </span><span class="lineCov"> 6584473 : struct extent_check* arg = void_arg;</span>
|
|
<span class="lineNum"> 912 </span><span class="lineCov"> 6584473 : const struct snapraid_extent* obj = void_obj;</span>
|
|
<span class="lineNum"> 913 </span><span class="lineCov"> 6584473 : const struct snapraid_extent* prev = arg->prev;</span>
|
|
<span class="lineNum"> 914 </span> :
|
|
<span class="lineNum"> 915 </span> : /* set the next previous block */
|
|
<span class="lineNum"> 916 </span><span class="lineCov"> 6584473 : arg->prev = obj;</span>
|
|
<span class="lineNum"> 917 </span> :
|
|
<span class="lineNum"> 918 </span> : /* stop reporting if too many errors */
|
|
<span class="lineNum"> 919 </span><span class="lineCov"> 6584473 : if (arg->result > 100) {</span>
|
|
<span class="lineNum"> 920 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 921 </span> : return;
|
|
<span class="lineNum"> 922 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 923 </span> : }
|
|
<span class="lineNum"> 924 </span> :
|
|
<span class="lineNum"> 925 </span><span class="lineCov"> 6584473 : if (obj->count == 0) {</span>
|
|
<span class="lineNum"> 926 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 927 </span> : log_fatal("Internal inconsistency in parity count zero for file '%s' at '%u'\n",
|
|
<span class="lineNum"> 928 </span> : obj->file->sub, obj->parity_pos);
|
|
<span class="lineNum"> 929 </span> : ++arg->result;
|
|
<span class="lineNum"> 930 </span> : return;
|
|
<span class="lineNum"> 931 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 932 </span> : }
|
|
<span class="lineNum"> 933 </span> :
|
|
<span class="lineNum"> 934 </span> : /* check only if there is a previous block */
|
|
<span class="lineNum"> 935 </span><span class="lineCov"> 6584473 : if (!prev)</span>
|
|
<span class="lineNum"> 936 </span><span class="lineCov"> 2723 : return;</span>
|
|
<span class="lineNum"> 937 </span> :
|
|
<span class="lineNum"> 938 </span> : /* check the order */
|
|
<span class="lineNum"> 939 </span><span class="lineCov"> 6581750 : if (prev->parity_pos >= obj->parity_pos) {</span>
|
|
<span class="lineNum"> 940 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 941 </span> : log_fatal("Internal inconsistency in parity order for files '%s' at '%u:%u' and '%s' at '%u:%u'\n",
|
|
<span class="lineNum"> 942 </span> : prev->file->sub, prev->parity_pos, prev->count, obj->file->sub, obj->parity_pos, obj->count);
|
|
<span class="lineNum"> 943 </span> : ++arg->result;
|
|
<span class="lineNum"> 944 </span> : return;
|
|
<span class="lineNum"> 945 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 946 </span> : }
|
|
<span class="lineNum"> 947 </span> :
|
|
<span class="lineNum"> 948 </span> : /* check that the extents don't overlap */
|
|
<span class="lineNum"> 949 </span><span class="lineCov"> 6581750 : if (prev->parity_pos + prev->count > obj->parity_pos) {</span>
|
|
<span class="lineNum"> 950 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 951 </span> : log_fatal("Internal inconsistency for parity overlap for files '%s' at '%u:%u' and '%s' at '%u:%u'\n",
|
|
<span class="lineNum"> 952 </span> : prev->file->sub, prev->parity_pos, prev->count, obj->file->sub, obj->parity_pos, obj->count);
|
|
<span class="lineNum"> 953 </span> : ++arg->result;
|
|
<span class="lineNum"> 954 </span> : return;
|
|
<span class="lineNum"> 955 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 956 </span> : }
|
|
<a name="957"><span class="lineNum"> 957 </span> : }</a>
|
|
<span class="lineNum"> 958 </span> :
|
|
<span class="lineNum"> 959 </span><span class="lineCov"> 6584473 : static void extent_file_check_foreach_unlock(void* void_arg, void* void_obj)</span>
|
|
<span class="lineNum"> 960 </span> : {
|
|
<span class="lineNum"> 961 </span><span class="lineCov"> 6584473 : struct extent_check* arg = void_arg;</span>
|
|
<span class="lineNum"> 962 </span><span class="lineCov"> 6584473 : const struct snapraid_extent* obj = void_obj;</span>
|
|
<span class="lineNum"> 963 </span><span class="lineCov"> 6584473 : const struct snapraid_extent* prev = arg->prev;</span>
|
|
<span class="lineNum"> 964 </span> :
|
|
<span class="lineNum"> 965 </span> : /* set the next previous block */
|
|
<span class="lineNum"> 966 </span><span class="lineCov"> 6584473 : arg->prev = obj;</span>
|
|
<span class="lineNum"> 967 </span> :
|
|
<span class="lineNum"> 968 </span> : /* stop reporting if too many errors */
|
|
<span class="lineNum"> 969 </span><span class="lineCov"> 6584473 : if (arg->result > 100) {</span>
|
|
<span class="lineNum"> 970 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 971 </span> : return;
|
|
<span class="lineNum"> 972 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 973 </span> : }
|
|
<span class="lineNum"> 974 </span> :
|
|
<span class="lineNum"> 975 </span><span class="lineCov"> 6584473 : if (obj->count == 0) {</span>
|
|
<span class="lineNum"> 976 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 977 </span> : log_fatal("Internal inconsistency in file count zero for file '%s' at '%u'\n",
|
|
<span class="lineNum"> 978 </span> : obj->file->sub, obj->file_pos);
|
|
<span class="lineNum"> 979 </span> : ++arg->result;
|
|
<span class="lineNum"> 980 </span> : return;
|
|
<span class="lineNum"> 981 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 982 </span> : }
|
|
<span class="lineNum"> 983 </span> :
|
|
<span class="lineNum"> 984 </span> : /* note that for deleted files, some extents may be missing */
|
|
<span class="lineNum"> 985 </span> :
|
|
<span class="lineNum"> 986 </span> : /* if the files are different */
|
|
<span class="lineNum"> 987 </span><span class="lineCov"> 6584473 : if (!prev || prev->file != obj->file) {</span>
|
|
<span class="lineNum"> 988 </span><span class="lineCov"> 6538269 : if (prev != 0) {</span>
|
|
<span class="lineNum"> 989 </span><span class="lineCov"> 6535546 : if (file_flag_has(prev->file, FILE_IS_DELETED)) {</span>
|
|
<span class="lineNum"> 990 </span> : /* check that the extent doesn't overflow the file */
|
|
<span class="lineNum"> 991 </span><span class="lineCov"> 59759 : if (prev->file_pos + prev->count > prev->file->blockmax) {</span>
|
|
<span class="lineNum"> 992 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 993 </span> : log_fatal("Internal inconsistency in delete end for file '%s' at '%u:%u' overflowing size '%u'\n",
|
|
<span class="lineNum"> 994 </span> : prev->file->sub, prev->file_pos, prev->count, prev->file->blockmax);
|
|
<span class="lineNum"> 995 </span> : ++arg->result;
|
|
<span class="lineNum"> 996 </span> : return;
|
|
<span class="lineNum"> 997 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 998 </span> : }
|
|
<span class="lineNum"> 999 </span> : } else {
|
|
<span class="lineNum"> 1000 </span> : /* check that the extent ends the file */
|
|
<span class="lineNum"> 1001 </span><span class="lineCov"> 6475787 : if (prev->file_pos + prev->count != prev->file->blockmax) {</span>
|
|
<span class="lineNum"> 1002 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1003 </span> : log_fatal("Internal inconsistency in file end for file '%s' at '%u:%u' instead of size '%u'\n",
|
|
<span class="lineNum"> 1004 </span> : prev->file->sub, prev->file_pos, prev->count, prev->file->blockmax);
|
|
<span class="lineNum"> 1005 </span> : ++arg->result;
|
|
<span class="lineNum"> 1006 </span> : return;
|
|
<span class="lineNum"> 1007 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1008 </span> : }
|
|
<span class="lineNum"> 1009 </span> : }
|
|
<span class="lineNum"> 1010 </span> : }
|
|
<span class="lineNum"> 1011 </span> :
|
|
<span class="lineNum"> 1012 </span><span class="lineCov"> 13076538 : if (file_flag_has(obj->file, FILE_IS_DELETED)) {</span>
|
|
<span class="lineNum"> 1013 </span> : /* check that the extent doesn't overflow the file */
|
|
<span class="lineNum"> 1014 </span><span class="lineCov"> 59842 : if (obj->file_pos + obj->count > obj->file->blockmax) {</span>
|
|
<span class="lineNum"> 1015 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1016 </span> : log_fatal("Internal inconsistency in delete start for file '%s' at '%u:%u' overflowing size '%u'\n",
|
|
<span class="lineNum"> 1017 </span> : obj->file->sub, obj->file_pos, obj->count, obj->file->blockmax);
|
|
<span class="lineNum"> 1018 </span> : ++arg->result;
|
|
<span class="lineNum"> 1019 </span> : return;
|
|
<span class="lineNum"> 1020 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1021 </span> : }
|
|
<span class="lineNum"> 1022 </span> : } else {
|
|
<span class="lineNum"> 1023 </span> : /* check that the extent starts the file */
|
|
<span class="lineNum"> 1024 </span><span class="lineCov"> 6478427 : if (obj->file_pos != 0) {</span>
|
|
<span class="lineNum"> 1025 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1026 </span> : log_fatal("Internal inconsistency in file start for file '%s' at '%u:%u'\n",
|
|
<span class="lineNum"> 1027 </span> : obj->file->sub, obj->file_pos, obj->count);
|
|
<span class="lineNum"> 1028 </span> : ++arg->result;
|
|
<span class="lineNum"> 1029 </span> : return;
|
|
<span class="lineNum"> 1030 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1031 </span> : }
|
|
<span class="lineNum"> 1032 </span> : }
|
|
<span class="lineNum"> 1033 </span> : } else {
|
|
<span class="lineNum"> 1034 </span> : /* check the order */
|
|
<span class="lineNum"> 1035 </span><span class="lineCov"> 46204 : if (prev->file_pos >= obj->file_pos) {</span>
|
|
<span class="lineNum"> 1036 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1037 </span> : log_fatal("Internal inconsistency in file order for file '%s' at '%u:%u' and at '%u:%u'\n",
|
|
<span class="lineNum"> 1038 </span> : prev->file->sub, prev->file_pos, prev->count, obj->file_pos, obj->count);
|
|
<span class="lineNum"> 1039 </span> : ++arg->result;
|
|
<span class="lineNum"> 1040 </span> : return;
|
|
<span class="lineNum"> 1041 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1042 </span> : }
|
|
<span class="lineNum"> 1043 </span> :
|
|
<span class="lineNum"> 1044 </span><span class="lineCov"> 46204 : if (file_flag_has(obj->file, FILE_IS_DELETED)) {</span>
|
|
<span class="lineNum"> 1045 </span> : /* check that the extents don't overlap */
|
|
<span class="lineNum"> 1046 </span><span class="lineCov"> 27 : if (prev->file_pos + prev->count > obj->file_pos) {</span>
|
|
<span class="lineNum"> 1047 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1048 </span> : log_fatal("Internal inconsistency in delete sequence for file '%s' at '%u:%u' and at '%u:%u'\n",
|
|
<span class="lineNum"> 1049 </span> : prev->file->sub, prev->file_pos, prev->count, obj->file_pos, obj->count);
|
|
<span class="lineNum"> 1050 </span> : ++arg->result;
|
|
<span class="lineNum"> 1051 </span> : return;
|
|
<span class="lineNum"> 1052 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1053 </span> : }
|
|
<span class="lineNum"> 1054 </span> : } else {
|
|
<span class="lineNum"> 1055 </span> : /* check that the extents are sequential */
|
|
<span class="lineNum"> 1056 </span><span class="lineCov"> 46177 : if (prev->file_pos + prev->count != obj->file_pos) {</span>
|
|
<span class="lineNum"> 1057 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1058 </span> : log_fatal("Internal inconsistency in file sequence for file '%s' at '%u:%u' and at '%u:%u'\n",
|
|
<span class="lineNum"> 1059 </span> : prev->file->sub, prev->file_pos, prev->count, obj->file_pos, obj->count);
|
|
<span class="lineNum"> 1060 </span> : ++arg->result;
|
|
<span class="lineNum"> 1061 </span> : return;
|
|
<span class="lineNum"> 1062 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1063 </span> : }
|
|
<span class="lineNum"> 1064 </span> : }
|
|
<span class="lineNum"> 1065 </span> : }
|
|
<a name="1066"><span class="lineNum"> 1066 </span> : }</a>
|
|
<span class="lineNum"> 1067 </span> :
|
|
<span class="lineNum"> 1068 </span><span class="lineCov"> 2988 : int fs_check(struct snapraid_disk* disk)</span>
|
|
<span class="lineNum"> 1069 </span> : {
|
|
<span class="lineNum"> 1070 </span> : struct extent_check arg;
|
|
<span class="lineNum"> 1071 </span> :
|
|
<span class="lineNum"> 1072 </span> : /* error count starts from 0 */
|
|
<span class="lineNum"> 1073 </span><span class="lineCov"> 2988 : arg.result = 0;</span>
|
|
<span class="lineNum"> 1074 </span> :
|
|
<span class="lineNum"> 1075 </span><span class="lineCov"> 2988 : fs_lock(disk);</span>
|
|
<span class="lineNum"> 1076 </span> :
|
|
<span class="lineNum"> 1077 </span> : /* check parity sequence */
|
|
<span class="lineNum"> 1078 </span><span class="lineCov"> 2988 : arg.prev = 0;</span>
|
|
<span class="lineNum"> 1079 </span><span class="lineCov"> 2988 : tommy_tree_foreach_arg(&disk->fs_parity, extent_parity_check_foreach_unlock, &arg);</span>
|
|
<span class="lineNum"> 1080 </span> :
|
|
<span class="lineNum"> 1081 </span> : /* check file sequence */
|
|
<span class="lineNum"> 1082 </span><span class="lineCov"> 2988 : arg.prev = 0;</span>
|
|
<span class="lineNum"> 1083 </span><span class="lineCov"> 2988 : tommy_tree_foreach_arg(&disk->fs_file, extent_file_check_foreach_unlock, &arg);</span>
|
|
<span class="lineNum"> 1084 </span> :
|
|
<span class="lineNum"> 1085 </span><span class="lineCov"> 2988 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 1086 </span> :
|
|
<span class="lineNum"> 1087 </span><span class="lineCov"> 2988 : if (arg.result != 0)</span>
|
|
<span class="lineNum"> 1088 </span><span class="lineNoCov"> 0 : return -1;</span>
|
|
<span class="lineNum"> 1089 </span> :
|
|
<span class="lineNum"> 1090 </span><span class="lineCov"> 2988 : return 0;</span>
|
|
<span class="lineNum"> 1091 </span> : }
|
|
<span class="lineNum"> 1092 </span> :
|
|
<span class="lineNum"> 1093 </span> : struct extent_parity_inside {
|
|
<span class="lineNum"> 1094 </span> : block_off_t parity_pos;
|
|
<span class="lineNum"> 1095 </span> : };
|
|
<span class="lineNum"> 1096 </span> :
|
|
<span class="lineNum"> 1097 </span> : /**
|
|
<a name="1098"><span class="lineNum"> 1098 </span> : * Compare the extent if containing the specified parity position.</a>
|
|
<span class="lineNum"> 1099 </span> : */
|
|
<span class="lineNum"> 1100 </span><span class="lineCov"> 114575009 : static int extent_parity_inside_compare_unlock(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 1101 </span> : {
|
|
<span class="lineNum"> 1102 </span><span class="lineCov"> 114575009 : const struct extent_parity_inside* arg_a = void_a;</span>
|
|
<span class="lineNum"> 1103 </span><span class="lineCov"> 114575009 : const struct snapraid_extent* arg_b = void_b;</span>
|
|
<span class="lineNum"> 1104 </span> :
|
|
<span class="lineNum"> 1105 </span><span class="lineCov"> 114575009 : if (arg_a->parity_pos < arg_b->parity_pos)</span>
|
|
<span class="lineNum"> 1106 </span><span class="lineCov"> 40547890 : return -1;</span>
|
|
<span class="lineNum"> 1107 </span><span class="lineCov"> 74027119 : if (arg_a->parity_pos >= arg_b->parity_pos + arg_b->count)</span>
|
|
<span class="lineNum"> 1108 </span><span class="lineCov"> 65245847 : return 1;</span>
|
|
<span class="lineNum"> 1109 </span> :
|
|
<span class="lineNum"> 1110 </span><span class="lineCov"> 8781272 : return 0;</span>
|
|
<span class="lineNum"> 1111 </span> : }
|
|
<span class="lineNum"> 1112 </span> :
|
|
<span class="lineNum"> 1113 </span> : /**
|
|
<span class="lineNum"> 1114 </span> : * Search the extent at the specified parity position.
|
|
<span class="lineNum"> 1115 </span> : * The search is optimized for sequential accesses.
|
|
<a name="1116"><span class="lineNum"> 1116 </span> : * \return If not found return 0</a>
|
|
<span class="lineNum"> 1117 </span> : */
|
|
<span class="lineNum"> 1118 </span><span class="lineCov"> 39143508 : static struct snapraid_extent* fs_par2extent_get_unlock(struct snapraid_disk* disk, struct snapraid_extent** fs_last, block_off_t parity_pos)</span>
|
|
<span class="lineNum"> 1119 </span> : {
|
|
<span class="lineNum"> 1120 </span> : struct snapraid_extent* extent;
|
|
<span class="lineNum"> 1121 </span> :
|
|
<span class="lineNum"> 1122 </span> : /* check if the last accessed extent matches */
|
|
<span class="lineNum"> 1123 </span><span class="lineCov"> 39143508 : if (*fs_last</span>
|
|
<span class="lineNum"> 1124 </span><span class="lineCov"> 39125091 : && parity_pos >= (*fs_last)->parity_pos</span>
|
|
<span class="lineNum"> 1125 </span><span class="lineCov"> 38408678 : && parity_pos < (*fs_last)->parity_pos + (*fs_last)->count</span>
|
|
<span class="lineNum"> 1126 </span> : ) {
|
|
<span class="lineNum"> 1127 </span><span class="lineCov"> 28777623 : extent = *fs_last;</span>
|
|
<span class="lineNum"> 1128 </span> : } else {
|
|
<span class="lineNum"> 1129 </span><span class="lineCov"> 10365885 : struct extent_parity_inside arg = { parity_pos };</span>
|
|
<span class="lineNum"> 1130 </span><span class="lineCov"> 10365885 : extent = tommy_tree_search_compare(&disk->fs_parity, extent_parity_inside_compare_unlock, &arg);</span>
|
|
<span class="lineNum"> 1131 </span> : }
|
|
<span class="lineNum"> 1132 </span> :
|
|
<span class="lineNum"> 1133 </span><span class="lineCov"> 39143433 : if (!extent)</span>
|
|
<span class="lineNum"> 1134 </span><span class="lineCov"> 1584679 : return 0;</span>
|
|
<span class="lineNum"> 1135 </span> :
|
|
<span class="lineNum"> 1136 </span> : /* store the last accessed extent */
|
|
<span class="lineNum"> 1137 </span><span class="lineCov"> 37558754 : *fs_last = extent;</span>
|
|
<span class="lineNum"> 1138 </span> :
|
|
<span class="lineNum"> 1139 </span><span class="lineCov"> 37558754 : return extent;</span>
|
|
<span class="lineNum"> 1140 </span> : }
|
|
<span class="lineNum"> 1141 </span> :
|
|
<span class="lineNum"> 1142 </span> : struct extent_file_inside {
|
|
<span class="lineNum"> 1143 </span> : struct snapraid_file* file;
|
|
<span class="lineNum"> 1144 </span> : block_off_t file_pos;
|
|
<span class="lineNum"> 1145 </span> : };
|
|
<span class="lineNum"> 1146 </span> :
|
|
<span class="lineNum"> 1147 </span> : /**
|
|
<a name="1148"><span class="lineNum"> 1148 </span> : * Compare the extent if containing the specified file position.</a>
|
|
<span class="lineNum"> 1149 </span> : */
|
|
<span class="lineNum"> 1150 </span><span class="lineCov"> 21310995 : static int extent_file_inside_compare_unlock(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 1151 </span> : {
|
|
<span class="lineNum"> 1152 </span><span class="lineCov"> 21310995 : const struct extent_file_inside* arg_a = void_a;</span>
|
|
<span class="lineNum"> 1153 </span><span class="lineCov"> 21310995 : const struct snapraid_extent* arg_b = void_b;</span>
|
|
<span class="lineNum"> 1154 </span> :
|
|
<span class="lineNum"> 1155 </span><span class="lineCov"> 21310995 : if (arg_a->file < arg_b->file)</span>
|
|
<span class="lineNum"> 1156 </span><span class="lineCov"> 8885792 : return -1;</span>
|
|
<span class="lineNum"> 1157 </span><span class="lineCov"> 12425203 : if (arg_a->file > arg_b->file)</span>
|
|
<span class="lineNum"> 1158 </span><span class="lineCov"> 10405515 : return 1;</span>
|
|
<span class="lineNum"> 1159 </span> :
|
|
<span class="lineNum"> 1160 </span><span class="lineCov"> 2019688 : if (arg_a->file_pos < arg_b->file_pos)</span>
|
|
<span class="lineNum"> 1161 </span><span class="lineCov"> 8333 : return -1;</span>
|
|
<span class="lineNum"> 1162 </span><span class="lineCov"> 2011355 : if (arg_a->file_pos >= arg_b->file_pos + arg_b->count)</span>
|
|
<span class="lineNum"> 1163 </span><span class="lineCov"> 7947 : return 1;</span>
|
|
<span class="lineNum"> 1164 </span> :
|
|
<span class="lineNum"> 1165 </span><span class="lineCov"> 2003408 : return 0;</span>
|
|
<span class="lineNum"> 1166 </span> : }
|
|
<span class="lineNum"> 1167 </span> :
|
|
<span class="lineNum"> 1168 </span> : /**
|
|
<span class="lineNum"> 1169 </span> : * Search the extent at the specified file position.
|
|
<span class="lineNum"> 1170 </span> : * The search is optimized for sequential accesses.
|
|
<a name="1171"><span class="lineNum"> 1171 </span> : * \return If not found return 0</a>
|
|
<span class="lineNum"> 1172 </span> : */
|
|
<span class="lineNum"> 1173 </span><span class="lineCov"> 10336255 : 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>
|
|
<span class="lineNum"> 1174 </span> : {
|
|
<span class="lineNum"> 1175 </span> : struct snapraid_extent* extent;
|
|
<span class="lineNum"> 1176 </span> :
|
|
<span class="lineNum"> 1177 </span> : /* check if the last accessed extent matches */
|
|
<span class="lineNum"> 1178 </span><span class="lineCov"> 10336255 : if (*fs_last</span>
|
|
<span class="lineNum"> 1179 </span><span class="lineCov"> 10312569 : && file == (*fs_last)->file</span>
|
|
<span class="lineNum"> 1180 </span><span class="lineCov"> 8347073 : && file_pos >= (*fs_last)->file_pos</span>
|
|
<span class="lineNum"> 1181 </span><span class="lineCov"> 8347073 : && file_pos < (*fs_last)->file_pos + (*fs_last)->count</span>
|
|
<span class="lineNum"> 1182 </span> : ) {
|
|
<span class="lineNum"> 1183 </span><span class="lineCov"> 8332839 : extent = *fs_last;</span>
|
|
<span class="lineNum"> 1184 </span> : } else {
|
|
<span class="lineNum"> 1185 </span><span class="lineCov"> 2003416 : struct extent_file_inside arg = { file, file_pos };</span>
|
|
<span class="lineNum"> 1186 </span><span class="lineCov"> 2003416 : extent = tommy_tree_search_compare(&disk->fs_file, extent_file_inside_compare_unlock, &arg);</span>
|
|
<span class="lineNum"> 1187 </span> : }
|
|
<span class="lineNum"> 1188 </span> :
|
|
<span class="lineNum"> 1189 </span><span class="lineCov"> 10336255 : if (!extent)</span>
|
|
<span class="lineNum"> 1190 </span><span class="lineCov"> 8 : return 0;</span>
|
|
<span class="lineNum"> 1191 </span> :
|
|
<span class="lineNum"> 1192 </span> : /* store the last accessed extent */
|
|
<span class="lineNum"> 1193 </span><span class="lineCov"> 10336247 : *fs_last = extent;</span>
|
|
<span class="lineNum"> 1194 </span> :
|
|
<span class="lineNum"> 1195 </span><span class="lineCov"> 10336247 : return extent;</span>
|
|
<a name="1196"><span class="lineNum"> 1196 </span> : }</a>
|
|
<span class="lineNum"> 1197 </span> :
|
|
<span class="lineNum"> 1198 </span><span class="lineCov"> 39036978 : struct snapraid_file* fs_par2file_find(struct snapraid_disk* disk, block_off_t parity_pos, block_off_t* file_pos)</span>
|
|
<span class="lineNum"> 1199 </span> : {
|
|
<span class="lineNum"> 1200 </span> : struct snapraid_extent* extent;
|
|
<span class="lineNum"> 1201 </span> : struct snapraid_file* file;
|
|
<span class="lineNum"> 1202 </span> :
|
|
<span class="lineNum"> 1203 </span><span class="lineCov"> 39036978 : fs_lock(disk);</span>
|
|
<span class="lineNum"> 1204 </span> :
|
|
<span class="lineNum"> 1205 </span><span class="lineCov"> 39037785 : extent = fs_par2extent_get_unlock(disk, &disk->fs_last, parity_pos);</span>
|
|
<span class="lineNum"> 1206 </span> :
|
|
<span class="lineNum"> 1207 </span><span class="lineCov"> 39036721 : if (!extent) {</span>
|
|
<span class="lineNum"> 1208 </span><span class="lineCov"> 1584680 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 1209 </span><span class="lineCov"> 1584723 : return 0;</span>
|
|
<span class="lineNum"> 1210 </span> : }
|
|
<span class="lineNum"> 1211 </span> :
|
|
<span class="lineNum"> 1212 </span><span class="lineCov"> 37452041 : if (file_pos)</span>
|
|
<span class="lineNum"> 1213 </span><span class="lineCov"> 37107540 : *file_pos = extent->file_pos + (parity_pos - extent->parity_pos);</span>
|
|
<span class="lineNum"> 1214 </span> :
|
|
<span class="lineNum"> 1215 </span><span class="lineCov"> 37452041 : file = extent->file;</span>
|
|
<span class="lineNum"> 1216 </span> :
|
|
<span class="lineNum"> 1217 </span><span class="lineCov"> 37452041 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 1218 </span><span class="lineCov"> 37453073 : return file;</span>
|
|
<a name="1219"><span class="lineNum"> 1219 </span> : }</a>
|
|
<span class="lineNum"> 1220 </span> :
|
|
<span class="lineNum"> 1221 </span><span class="lineCov"> 4869703 : block_off_t fs_file2par_find(struct snapraid_disk* disk, struct snapraid_file* file, block_off_t file_pos)</span>
|
|
<span class="lineNum"> 1222 </span> : {
|
|
<span class="lineNum"> 1223 </span> : struct snapraid_extent* extent;
|
|
<span class="lineNum"> 1224 </span> : block_off_t ret;
|
|
<span class="lineNum"> 1225 </span> :
|
|
<span class="lineNum"> 1226 </span><span class="lineCov"> 4869703 : fs_lock(disk);</span>
|
|
<span class="lineNum"> 1227 </span> :
|
|
<span class="lineNum"> 1228 </span><span class="lineCov"> 4869703 : extent = fs_file2extent_get_unlock(disk, &disk->fs_last, file, file_pos);</span>
|
|
<span class="lineNum"> 1229 </span><span class="lineCov"> 4869703 : if (!extent) {</span>
|
|
<span class="lineNum"> 1230 </span><span class="lineCov"> 8 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 1231 </span><span class="lineCov"> 8 : return POS_NULL;</span>
|
|
<span class="lineNum"> 1232 </span> : }
|
|
<span class="lineNum"> 1233 </span> :
|
|
<span class="lineNum"> 1234 </span><span class="lineCov"> 4869695 : ret = extent->parity_pos + (file_pos - extent->file_pos);</span>
|
|
<span class="lineNum"> 1235 </span> :
|
|
<span class="lineNum"> 1236 </span><span class="lineCov"> 4869695 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 1237 </span><span class="lineCov"> 4869695 : return ret;</span>
|
|
<a name="1238"><span class="lineNum"> 1238 </span> : }</a>
|
|
<span class="lineNum"> 1239 </span> :
|
|
<span class="lineNum"> 1240 </span><span class="lineCov"> 9175178 : void fs_allocate(struct snapraid_disk* disk, block_off_t parity_pos, struct snapraid_file* file, block_off_t file_pos)</span>
|
|
<span class="lineNum"> 1241 </span> : {
|
|
<span class="lineNum"> 1242 </span> : struct snapraid_extent* extent;
|
|
<span class="lineNum"> 1243 </span> : struct snapraid_extent* parity_extent;
|
|
<span class="lineNum"> 1244 </span> : struct snapraid_extent* file_extent;
|
|
<span class="lineNum"> 1245 </span> :
|
|
<span class="lineNum"> 1246 </span><span class="lineCov"> 9175178 : fs_lock(disk);</span>
|
|
<span class="lineNum"> 1247 </span> :
|
|
<span class="lineNum"> 1248 </span><span class="lineCov"> 9175178 : if (file_pos > 0) {</span>
|
|
<span class="lineNum"> 1249 </span> : /* search an existing extent for the previous file_pos */
|
|
<span class="lineNum"> 1250 </span><span class="lineCov"> 5466552 : extent = fs_file2extent_get_unlock(disk, &disk->fs_last, file, file_pos - 1);</span>
|
|
<span class="lineNum"> 1251 </span> :
|
|
<span class="lineNum"> 1252 </span><span class="lineCov"> 5466552 : if (extent != 0 && parity_pos == extent->parity_pos + extent->count) {</span>
|
|
<span class="lineNum"> 1253 </span> : /* ensure that we are extending the extent at the end */
|
|
<span class="lineNum"> 1254 </span><span class="lineCov"> 5439890 : if (file_pos != extent->file_pos + extent->count) {</span>
|
|
<span class="lineNum"> 1255 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1256 </span> : log_fatal("Internal inconsistency when allocating file '%s' at position '%u/%u' in the middle of extent '%u:%u' in disk '%s'\n", file->sub, file_pos, file->blockmax, extent->file_pos, extent->count, disk->name);
|
|
<span class="lineNum"> 1257 </span> : os_abort();
|
|
<span class="lineNum"> 1258 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1259 </span> : }
|
|
<span class="lineNum"> 1260 </span> :
|
|
<span class="lineNum"> 1261 </span> : /* extend the existing extent */
|
|
<span class="lineNum"> 1262 </span><span class="lineCov"> 5439890 : ++extent->count;</span>
|
|
<span class="lineNum"> 1263 </span> :
|
|
<span class="lineNum"> 1264 </span><span class="lineCov"> 5439890 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 1265 </span><span class="lineCov"> 14615068 : return;</span>
|
|
<span class="lineNum"> 1266 </span> : }
|
|
<span class="lineNum"> 1267 </span> : }
|
|
<span class="lineNum"> 1268 </span> :
|
|
<span class="lineNum"> 1269 </span> : /* a extent doesn't exist, and we have to create a new one */
|
|
<span class="lineNum"> 1270 </span><span class="lineCov"> 3735288 : extent = extent_alloc(parity_pos, file, file_pos, 1);</span>
|
|
<span class="lineNum"> 1271 </span> :
|
|
<span class="lineNum"> 1272 </span> : /* insert the extent in the trees */
|
|
<span class="lineNum"> 1273 </span><span class="lineCov"> 3735288 : parity_extent = tommy_tree_insert(&disk->fs_parity, &extent->parity_node, extent);</span>
|
|
<span class="lineNum"> 1274 </span><span class="lineCov"> 3735288 : file_extent = tommy_tree_insert(&disk->fs_file, &extent->file_node, extent);</span>
|
|
<span class="lineNum"> 1275 </span> :
|
|
<span class="lineNum"> 1276 </span><span class="lineCov"> 3735288 : if (parity_extent != extent || file_extent != extent) {</span>
|
|
<span class="lineNum"> 1277 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1278 </span> : log_fatal("Internal inconsistency when allocating file '%s' at position '%u/%u' for existing extent '%u:%u' in disk '%s'\n", file->sub, file_pos, file->blockmax, extent->file_pos, extent->count, disk->name);
|
|
<span class="lineNum"> 1279 </span> : os_abort();
|
|
<span class="lineNum"> 1280 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1281 </span> : }
|
|
<span class="lineNum"> 1282 </span> :
|
|
<span class="lineNum"> 1283 </span> : /* store the last accessed extent */
|
|
<span class="lineNum"> 1284 </span><span class="lineCov"> 3735288 : disk->fs_last = extent;</span>
|
|
<span class="lineNum"> 1285 </span> :
|
|
<span class="lineNum"> 1286 </span><span class="lineCov"> 3735288 : fs_unlock(disk);</span>
|
|
<a name="1287"><span class="lineNum"> 1287 </span> : }</a>
|
|
<span class="lineNum"> 1288 </span> :
|
|
<span class="lineNum"> 1289 </span><span class="lineCov"> 106232 : void fs_deallocate(struct snapraid_disk* disk, block_off_t parity_pos)</span>
|
|
<span class="lineNum"> 1290 </span> : {
|
|
<span class="lineNum"> 1291 </span> : struct snapraid_extent* extent;
|
|
<span class="lineNum"> 1292 </span> : struct snapraid_extent* second_extent;
|
|
<span class="lineNum"> 1293 </span> : struct snapraid_extent* parity_extent;
|
|
<span class="lineNum"> 1294 </span> : struct snapraid_extent* file_extent;
|
|
<span class="lineNum"> 1295 </span> : block_off_t first_count, second_count;
|
|
<span class="lineNum"> 1296 </span> :
|
|
<span class="lineNum"> 1297 </span><span class="lineCov"> 106232 : fs_lock(disk);</span>
|
|
<span class="lineNum"> 1298 </span> :
|
|
<span class="lineNum"> 1299 </span><span class="lineCov"> 106232 : extent = fs_par2extent_get_unlock(disk, &disk->fs_last, parity_pos);</span>
|
|
<span class="lineNum"> 1300 </span><span class="lineCov"> 106232 : if (!extent) {</span>
|
|
<span class="lineNum"> 1301 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1302 </span> : log_fatal("Internal inconsistency when deallocating parity position '%u' for not existing extent in disk '%s'\n", parity_pos, disk->name);
|
|
<span class="lineNum"> 1303 </span> : os_abort();
|
|
<span class="lineNum"> 1304 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1305 </span> : }
|
|
<span class="lineNum"> 1306 </span> :
|
|
<span class="lineNum"> 1307 </span> : /* if it's the only block of the extent, delete it */
|
|
<span class="lineNum"> 1308 </span><span class="lineCov"> 106232 : if (extent->count == 1) {</span>
|
|
<span class="lineNum"> 1309 </span> : /* remove from the trees */
|
|
<span class="lineNum"> 1310 </span><span class="lineCov"> 39658 : tommy_tree_remove(&disk->fs_parity, extent);</span>
|
|
<span class="lineNum"> 1311 </span><span class="lineCov"> 39658 : tommy_tree_remove(&disk->fs_file, extent);</span>
|
|
<span class="lineNum"> 1312 </span> :
|
|
<span class="lineNum"> 1313 </span> : /* deallocate */
|
|
<span class="lineNum"> 1314 </span><span class="lineCov"> 39658 : extent_free(extent);</span>
|
|
<span class="lineNum"> 1315 </span> :
|
|
<span class="lineNum"> 1316 </span> : /* clear the last accessed extent */
|
|
<span class="lineNum"> 1317 </span><span class="lineCov"> 39658 : disk->fs_last = 0;</span>
|
|
<span class="lineNum"> 1318 </span> :
|
|
<span class="lineNum"> 1319 </span><span class="lineCov"> 39658 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 1320 </span><span class="lineCov"> 39658 : return;</span>
|
|
<span class="lineNum"> 1321 </span> : }
|
|
<span class="lineNum"> 1322 </span> :
|
|
<span class="lineNum"> 1323 </span> : /* if it's at the start of the extent, shrink the extent */
|
|
<span class="lineNum"> 1324 </span><span class="lineCov"> 66574 : if (parity_pos == extent->parity_pos) {</span>
|
|
<span class="lineNum"> 1325 </span><span class="lineCov"> 66572 : ++extent->parity_pos;</span>
|
|
<span class="lineNum"> 1326 </span><span class="lineCov"> 66572 : ++extent->file_pos;</span>
|
|
<span class="lineNum"> 1327 </span><span class="lineCov"> 66572 : --extent->count;</span>
|
|
<span class="lineNum"> 1328 </span> :
|
|
<span class="lineNum"> 1329 </span><span class="lineCov"> 66572 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 1330 </span><span class="lineCov"> 66572 : return;</span>
|
|
<span class="lineNum"> 1331 </span> : }
|
|
<span class="lineNum"> 1332 </span> :
|
|
<span class="lineNum"> 1333 </span> : /* if it's at the end of the extent, shrink the extent */
|
|
<span class="lineNum"> 1334 </span><span class="lineCov"> 2 : if (parity_pos == extent->parity_pos + extent->count - 1) {</span>
|
|
<span class="lineNum"> 1335 </span><span class="lineCov"> 1 : --extent->count;</span>
|
|
<span class="lineNum"> 1336 </span> :
|
|
<span class="lineNum"> 1337 </span><span class="lineCov"> 1 : fs_unlock(disk);</span>
|
|
<span class="lineNum"> 1338 </span><span class="lineCov"> 1 : return;</span>
|
|
<span class="lineNum"> 1339 </span> : }
|
|
<span class="lineNum"> 1340 </span> :
|
|
<span class="lineNum"> 1341 </span> : /* otherwise it's in the middle */
|
|
<span class="lineNum"> 1342 </span><span class="lineCov"> 1 : first_count = parity_pos - extent->parity_pos;</span>
|
|
<span class="lineNum"> 1343 </span><span class="lineCov"> 1 : second_count = extent->count - first_count - 1;</span>
|
|
<span class="lineNum"> 1344 </span> :
|
|
<span class="lineNum"> 1345 </span> : /* adjust the first extent */
|
|
<span class="lineNum"> 1346 </span><span class="lineCov"> 1 : extent->count = first_count;</span>
|
|
<span class="lineNum"> 1347 </span> :
|
|
<span class="lineNum"> 1348 </span> : /* allocate the second extent */
|
|
<span class="lineNum"> 1349 </span><span class="lineCov"> 1 : second_extent = extent_alloc(extent->parity_pos + first_count + 1, extent->file, extent->file_pos + first_count + 1, second_count);</span>
|
|
<span class="lineNum"> 1350 </span> :
|
|
<span class="lineNum"> 1351 </span> : /* insert the extent in the trees */
|
|
<span class="lineNum"> 1352 </span><span class="lineCov"> 1 : parity_extent = tommy_tree_insert(&disk->fs_parity, &second_extent->parity_node, second_extent);</span>
|
|
<span class="lineNum"> 1353 </span><span class="lineCov"> 1 : file_extent = tommy_tree_insert(&disk->fs_file, &second_extent->file_node, second_extent);</span>
|
|
<span class="lineNum"> 1354 </span> :
|
|
<span class="lineNum"> 1355 </span><span class="lineCov"> 1 : if (parity_extent != second_extent || file_extent != second_extent) {</span>
|
|
<span class="lineNum"> 1356 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1357 </span> : log_fatal("Internal inconsistency when deallocating parity position '%u' for splitting extent '%u:%u' in disk '%s'\n", parity_pos, second_extent->file_pos, second_extent->count, disk->name);
|
|
<span class="lineNum"> 1358 </span> : os_abort();
|
|
<span class="lineNum"> 1359 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1360 </span> : }
|
|
<span class="lineNum"> 1361 </span> :
|
|
<span class="lineNum"> 1362 </span> : /* store the last accessed extent */
|
|
<span class="lineNum"> 1363 </span><span class="lineCov"> 1 : disk->fs_last = second_extent;</span>
|
|
<span class="lineNum"> 1364 </span> :
|
|
<span class="lineNum"> 1365 </span><span class="lineCov"> 1 : fs_unlock(disk);</span>
|
|
<a name="1366"><span class="lineNum"> 1366 </span> : }</a>
|
|
<span class="lineNum"> 1367 </span> :
|
|
<span class="lineNum"> 1368 </span><span class="lineCov"> 44945354 : struct snapraid_block* fs_file2block_get(struct snapraid_file* file, block_off_t file_pos)</span>
|
|
<span class="lineNum"> 1369 </span> : {
|
|
<span class="lineNum"> 1370 </span><span class="lineCov"> 44945354 : if (file_pos >= file->blockmax) {</span>
|
|
<span class="lineNum"> 1371 </span> : /* LCOV_EXCL_START */
|
|
<span class="lineNum"> 1372 </span> : log_fatal("Internal inconsistency when dereferencing file '%s' at position '%u/%u'\n", file->sub, file_pos, file->blockmax);
|
|
<span class="lineNum"> 1373 </span> : os_abort();
|
|
<span class="lineNum"> 1374 </span> : /* LCOV_EXCL_STOP */
|
|
<span class="lineNum"> 1375 </span> : }
|
|
<span class="lineNum"> 1376 </span> :
|
|
<span class="lineNum"> 1377 </span><span class="lineCov"> 44945354 : return file_block(file, file_pos);</span>
|
|
<a name="1378"><span class="lineNum"> 1378 </span> : }</a>
|
|
<span class="lineNum"> 1379 </span> :
|
|
<span class="lineNum"> 1380 </span><span class="lineCov"> 27313631 : struct snapraid_block* fs_par2block_find(struct snapraid_disk* disk, block_off_t parity_pos)</span>
|
|
<span class="lineNum"> 1381 </span> : {
|
|
<span class="lineNum"> 1382 </span> : struct snapraid_file* file;
|
|
<span class="lineNum"> 1383 </span> : block_off_t file_pos;
|
|
<span class="lineNum"> 1384 </span> :
|
|
<span class="lineNum"> 1385 </span><span class="lineCov"> 27313631 : file = fs_par2file_find(disk, parity_pos, &file_pos);</span>
|
|
<span class="lineNum"> 1386 </span><span class="lineCov"> 27313916 : if (file == 0)</span>
|
|
<span class="lineNum"> 1387 </span><span class="lineCov"> 1584719 : return BLOCK_NULL;</span>
|
|
<span class="lineNum"> 1388 </span> :
|
|
<span class="lineNum"> 1389 </span><span class="lineCov"> 25729197 : return fs_file2block_get(file, file_pos);</span>
|
|
<a name="1390"><span class="lineNum"> 1390 </span> : }</a>
|
|
<span class="lineNum"> 1391 </span> :
|
|
<span class="lineNum"> 1392 </span><span class="lineCov"> 1561 : struct snapraid_map* map_alloc(const char* name, unsigned position, block_off_t total_blocks, block_off_t free_blocks, const char* uuid)</span>
|
|
<span class="lineNum"> 1393 </span> : {
|
|
<span class="lineNum"> 1394 </span> : struct snapraid_map* map;
|
|
<span class="lineNum"> 1395 </span> :
|
|
<span class="lineNum"> 1396 </span><span class="lineCov"> 1561 : map = malloc_nofail(sizeof(struct snapraid_map));</span>
|
|
<span class="lineNum"> 1397 </span><span class="lineCov"> 1561 : pathcpy(map->name, sizeof(map->name), name);</span>
|
|
<span class="lineNum"> 1398 </span><span class="lineCov"> 1561 : map->position = position;</span>
|
|
<span class="lineNum"> 1399 </span><span class="lineCov"> 1561 : map->total_blocks = total_blocks;</span>
|
|
<span class="lineNum"> 1400 </span><span class="lineCov"> 1561 : map->free_blocks = free_blocks;</span>
|
|
<span class="lineNum"> 1401 </span><span class="lineCov"> 1561 : pathcpy(map->uuid, sizeof(map->uuid), uuid);</span>
|
|
<span class="lineNum"> 1402 </span> :
|
|
<span class="lineNum"> 1403 </span><span class="lineCov"> 1561 : return map;</span>
|
|
<a name="1404"><span class="lineNum"> 1404 </span> : }</a>
|
|
<span class="lineNum"> 1405 </span> :
|
|
<span class="lineNum"> 1406 </span><span class="lineCov"> 1435 : void map_free(struct snapraid_map* map)</span>
|
|
<span class="lineNum"> 1407 </span> : {
|
|
<span class="lineNum"> 1408 </span><span class="lineCov"> 1435 : free(map);</span>
|
|
<a name="1409"><span class="lineNum"> 1409 </span><span class="lineCov"> 1435 : }</span></a>
|
|
<span class="lineNum"> 1410 </span> :
|
|
<span class="lineNum"> 1411 </span><span class="lineCov"> 691801 : int time_compare(const void* void_a, const void* void_b)</span>
|
|
<span class="lineNum"> 1412 </span> : {
|
|
<span class="lineNum"> 1413 </span><span class="lineCov"> 691801 : const time_t* time_a = void_a;</span>
|
|
<span class="lineNum"> 1414 </span><span class="lineCov"> 691801 : const time_t* time_b = void_b;</span>
|
|
<span class="lineNum"> 1415 </span> :
|
|
<span class="lineNum"> 1416 </span><span class="lineCov"> 691801 : if (*time_a < *time_b)</span>
|
|
<span class="lineNum"> 1417 </span><span class="lineCov"> 18310 : return -1;</span>
|
|
<span class="lineNum"> 1418 </span><span class="lineCov"> 673491 : if (*time_a > *time_b)</span>
|
|
<span class="lineNum"> 1419 </span><span class="lineCov"> 129297 : return 1;</span>
|
|
<span class="lineNum"> 1420 </span><span class="lineCov"> 544194 : return 0;</span>
|
|
<span class="lineNum"> 1421 </span> : }
|
|
<span class="lineNum"> 1422 </span> :
|
|
<span class="lineNum"> 1423 </span> : /****************************************************************************/
|
|
<span class="lineNum"> 1424 </span> : /* format */
|
|
<span class="lineNum"> 1425 </span> :
|
|
<span class="lineNum"> 1426 </span> : int FMT_MODE = FMT_FILE;
|
|
<span class="lineNum"> 1427 </span> :
|
|
<span class="lineNum"> 1428 </span> : /**
|
|
<a name="1429"><span class="lineNum"> 1429 </span> : * Format a file path for poll reference</a>
|
|
<span class="lineNum"> 1430 </span> : */
|
|
<span class="lineNum"> 1431 </span><span class="lineCov"> 6 : const char* fmt_poll(const struct snapraid_disk* disk, const char* str, char* buffer)</span>
|
|
<span class="lineNum"> 1432 </span> : {
|
|
<span class="lineNum"> 1433 </span> : (void)disk;
|
|
<span class="lineNum"> 1434 </span><span class="lineCov"> 6 : return esc_shell(str, buffer);</span>
|
|
<span class="lineNum"> 1435 </span> : }
|
|
<span class="lineNum"> 1436 </span> :
|
|
<span class="lineNum"> 1437 </span> : /**
|
|
<a name="1438"><span class="lineNum"> 1438 </span> : * Format a path name for terminal reference</a>
|
|
<span class="lineNum"> 1439 </span> : */
|
|
<span class="lineNum"> 1440 </span><span class="lineCov"> 355906 : const char* fmt_term(const struct snapraid_disk* disk, const char* str, char* buffer)</span>
|
|
<span class="lineNum"> 1441 </span> : {
|
|
<span class="lineNum"> 1442 </span> : const char* out[3];
|
|
<span class="lineNum"> 1443 </span> :
|
|
<span class="lineNum"> 1444 </span><span class="lineCov"> 355906 : switch (FMT_MODE) {</span>
|
|
<span class="lineNum"> 1445 </span> : case FMT_FILE :
|
|
<span class="lineNum"> 1446 </span> : default :
|
|
<span class="lineNum"> 1447 </span><span class="lineCov"> 331846 : return esc_shell(str, buffer);</span>
|
|
<span class="lineNum"> 1448 </span> : case FMT_DISK :
|
|
<span class="lineNum"> 1449 </span><span class="lineCov"> 12030 : out[0] = disk->name;</span>
|
|
<span class="lineNum"> 1450 </span><span class="lineCov"> 12030 : out[1] = ":";</span>
|
|
<span class="lineNum"> 1451 </span><span class="lineCov"> 12030 : out[2] = str;</span>
|
|
<span class="lineNum"> 1452 </span><span class="lineCov"> 12030 : return esc_shell_multi(out, 3, buffer);</span>
|
|
<span class="lineNum"> 1453 </span> : case FMT_PATH :
|
|
<span class="lineNum"> 1454 </span><span class="lineCov"> 12030 : out[0] = disk->dir;</span>
|
|
<span class="lineNum"> 1455 </span><span class="lineCov"> 12030 : out[1] = str;</span>
|
|
<span class="lineNum"> 1456 </span><span class="lineCov"> 12030 : return esc_shell_multi(out, 2, buffer);</span>
|
|
<span class="lineNum"> 1457 </span> : }
|
|
<span class="lineNum"> 1458 </span> : }
|
|
<span class="lineNum"> 1459 </span> :
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LCOV version 1.10</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|