snapraid/cov/cmdline/elem.h.gcov.html
2015-12-28 16:31:46 +01:00

1084 lines
87 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.h</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.h<span style="font-size: 80%;"> (source / <a href="elem.h.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">114</td>
<td class="headerCovTableEntry">119</td>
<td class="headerCovTableEntryHi">95.8 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2015-05-12</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">37</td>
<td class="headerCovTableEntry">38</td>
<td class="headerCovTableEntryHi">97.4 %</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 &lt;http://www.gnu.org/licenses/&gt;.
<span class="lineNum"> 16 </span> : */
<span class="lineNum"> 17 </span> :
<span class="lineNum"> 18 </span> : #ifndef __ELEM_H
<span class="lineNum"> 19 </span> : #define __ELEM_H
<span class="lineNum"> 20 </span> :
<span class="lineNum"> 21 </span> : #include &quot;util.h&quot;
<span class="lineNum"> 22 </span> : #include &quot;support.h&quot;
<span class="lineNum"> 23 </span> : #include &quot;tommyds/tommylist.h&quot;
<span class="lineNum"> 24 </span> : #include &quot;tommyds/tommyhash.h&quot;
<span class="lineNum"> 25 </span> : #include &quot;tommyds/tommyhashdyn.h&quot;
<span class="lineNum"> 26 </span> : #include &quot;tommyds/tommyarray.h&quot;
<span class="lineNum"> 27 </span> : #include &quot;tommyds/tommyarrayblk.h&quot;
<span class="lineNum"> 28 </span> : #include &quot;tommyds/tommyarrayblkof.h&quot;
<span class="lineNum"> 29 </span> :
<span class="lineNum"> 30 </span> : /****************************************************************************/
<span class="lineNum"> 31 </span> : /* snapraid */
<span class="lineNum"> 32 </span> :
<span class="lineNum"> 33 </span> : /**
<span class="lineNum"> 34 </span> : * Invalid position.
<span class="lineNum"> 35 </span> : */
<span class="lineNum"> 36 </span> : #define POS_INVALID ((block_off_t)-1)
<span class="lineNum"> 37 </span> :
<span class="lineNum"> 38 </span> : /**
<span class="lineNum"> 39 </span> : * Basic block position type.
<span class="lineNum"> 40 </span> : * With 32 bits and 128k blocks you can address 256 TB.
<span class="lineNum"> 41 </span> : */
<span class="lineNum"> 42 </span> : typedef uint32_t block_off_t;
<span class="lineNum"> 43 </span> :
<span class="lineNum"> 44 </span> : /**
<span class="lineNum"> 45 </span> : * Basic data position type.
<span class="lineNum"> 46 </span> : * It's signed as file size and offset are usually signed.
<span class="lineNum"> 47 </span> : */
<span class="lineNum"> 48 </span> : typedef int64_t data_off_t;
<span class="lineNum"> 49 </span> :
<span class="lineNum"> 50 </span> : /**
<span class="lineNum"> 51 </span> : * Content file specification.
<span class="lineNum"> 52 </span> : */
<span class="lineNum"> 53 </span> : struct snapraid_content {
<span class="lineNum"> 54 </span> : char content[PATH_MAX]; /**&lt; Path of the content file. */
<span class="lineNum"> 55 </span> : uint64_t device; /**&lt; Device identifier. */
<span class="lineNum"> 56 </span> : tommy_node node; /**&lt; Next node in the list. */
<span class="lineNum"> 57 </span> : };
<span class="lineNum"> 58 </span> :
<span class="lineNum"> 59 </span> : /**
<span class="lineNum"> 60 </span> : * Filter for paths.
<span class="lineNum"> 61 </span> : */
<span class="lineNum"> 62 </span> : struct snapraid_filter {
<span class="lineNum"> 63 </span> : char pattern[PATH_MAX]; /**&lt; Filter pattern. */
<span class="lineNum"> 64 </span> : int is_disk; /**&lt; If the pattern is a disk one. */
<span class="lineNum"> 65 </span> : int is_path; /**&lt; If the pattern is only for the complete path. */
<span class="lineNum"> 66 </span> : int is_dir; /**&lt; If the pattern is only for dir. */
<span class="lineNum"> 67 </span> : int direction; /**&lt; If it's an inclusion (=1) or an exclusion (=-1). */
<span class="lineNum"> 68 </span> : tommy_node node; /**&lt; Next node in the list. */
<span class="lineNum"> 69 </span> : };
<span class="lineNum"> 70 </span> :
<span class="lineNum"> 71 </span> : /**
<span class="lineNum"> 72 </span> : * The block has both the hash and the parity computed.
<span class="lineNum"> 73 </span> : * This is the normal state of a saved block.
<span class="lineNum"> 74 </span> : *
<span class="lineNum"> 75 </span> : * The block hash field IS set.
<span class="lineNum"> 76 </span> : * The parity for this disk is updated.
<span class="lineNum"> 77 </span> : */
<span class="lineNum"> 78 </span> : #define BLOCK_STATE_BLK 1
<span class="lineNum"> 79 </span> :
<span class="lineNum"> 80 </span> : /**
<span class="lineNum"> 81 </span> : * The block is new and not yet hashed.
<span class="lineNum"> 82 </span> : * This happens when a new block overwrite a just removed block, or an empty space.
<span class="lineNum"> 83 </span> : *
<span class="lineNum"> 84 </span> : * The block hash field MAY be set and it represents the hash of the OLD data.
<span class="lineNum"> 85 </span> : * The hash may be also INVALID or ZERO.
<span class="lineNum"> 86 </span> : *
<span class="lineNum"> 87 </span> : * If the OLD block was empty, the hash is set to the special ZERO value.
<span class="lineNum"> 88 </span> : * If the OLD block was lost, the hash is set to the special INVALID value.
<span class="lineNum"> 89 </span> : *
<span class="lineNum"> 90 </span> : * The parity for this disk is not updated, but it contains the old data referenced by the hash.
<span class="lineNum"> 91 </span> : *
<span class="lineNum"> 92 </span> : * If the state is read from an incomplete sync, we don't really know if the hash is referring at the
<span class="lineNum"> 93 </span> : * data used to compute the parity, because the sync process was interrupted at an unknown point,
<span class="lineNum"> 94 </span> : * and the parity may or may not be updated.
<span class="lineNum"> 95 </span> : *
<span class="lineNum"> 96 </span> : * For this reson we clear all such hashes when reading the state from an incomplete sync before
<span class="lineNum"> 97 </span> : * starting a new sync, because sync is affected by such hashes, as sync updates the parity, only
<span class="lineNum"> 98 </span> : * if the new data read for CHG blocks has a mismatching hash.
<span class="lineNum"> 99 </span> : * Clearing is done setting the ::clear_past_hash flag before reading the state.
<span class="lineNum"> 100 </span> : * No clearing is done in other commands, as check and fix are instead able to work with unsynced
<span class="lineNum"> 101 </span> : * hashes, and scrub ignores CHG/DELETED blocks.
<span class="lineNum"> 102 </span> : */
<span class="lineNum"> 103 </span> : #define BLOCK_STATE_CHG 2
<span class="lineNum"> 104 </span> :
<span class="lineNum"> 105 </span> : /**
<span class="lineNum"> 106 </span> : * The block is new and hashed.
<span class="lineNum"> 107 </span> : * This happens when a new block overwrite a just removed block, or an empty space.
<span class="lineNum"> 108 </span> : *
<span class="lineNum"> 109 </span> : * Note that when the file copy heuristic is enabled, the REP blocks may be set
<span class="lineNum"> 110 </span> : * using this euristic, meaning that the hash may be wrong.
<span class="lineNum"> 111 </span> : *
<span class="lineNum"> 112 </span> : * For this reason, when the ::force_nocopy flag is enabled in sync, we convert all the REP blocks
<span class="lineNum"> 113 </span> : * to CHG, invalidating the stored hash.
<span class="lineNum"> 114 </span> : * Clearing is done setting the ::clear_past_hash flag before reading the state.
<span class="lineNum"> 115 </span> : * No cleaering is done in other commands, as they don't stop the process like in sync
<span class="lineNum"> 116 </span> : * when there is a false silent error.
<span class="lineNum"> 117 </span> : *
<span class="lineNum"> 118 </span> : * The block hash field IS set, and it represents the hash of the new data.
<span class="lineNum"> 119 </span> : * The parity for this disk is not updated.
<span class="lineNum"> 120 </span> : */
<span class="lineNum"> 121 </span> : #define BLOCK_STATE_REP 3
<span class="lineNum"> 122 </span> :
<span class="lineNum"> 123 </span> : /**
<span class="lineNum"> 124 </span> : * This block is a deleted one.
<span class="lineNum"> 125 </span> : * This happens when a file is deleted.
<span class="lineNum"> 126 </span> : *
<span class="lineNum"> 127 </span> : * The block hash field IS set, and it represents the hash of the previous data,
<span class="lineNum"> 128 </span> : * but only if it's different by all 0.
<span class="lineNum"> 129 </span> : * The parity for this disk is not updated, but it contains the old data referenced by the hash.
<span class="lineNum"> 130 </span> : *
<span class="lineNum"> 131 </span> : * If the state is read from an incomplete sync, we don't really know if the hash is referring at the
<span class="lineNum"> 132 </span> : * data used to compute the parity, because the sync process was interrupted at an unknown point,
<span class="lineNum"> 133 </span> : * and the parity may or may not be updated.
<span class="lineNum"> 134 </span> : *
<span class="lineNum"> 135 </span> : * A now the sync process is not affected by DELETED hash, so clearing won't be really needed,
<span class="lineNum"> 136 </span> : * but considering that we have to do it for CHG blocks, we do it also for DELETED ones,
<span class="lineNum"> 137 </span> : * clearing all the past hashes.
<span class="lineNum"> 138 </span> : * Clearing is done setting the ::clear_past_hash flag before reading the state.
<span class="lineNum"> 139 </span> : * No clearing is done in other commands, as check and fix are instead able to work with unsynced
<span class="lineNum"> 140 </span> : * hashes, and scrub ignores CHG/DELETED blocks.
<span class="lineNum"> 141 </span> : */
<span class="lineNum"> 142 </span> : #define BLOCK_STATE_DELETED 4
<span class="lineNum"> 143 </span> :
<span class="lineNum"> 144 </span> : /**
<span class="lineNum"> 145 </span> : * Mask used to store the previous states of the block.
<span class="lineNum"> 146 </span> : * Used to mix them inside the file pointer.
<span class="lineNum"> 147 </span> : */
<span class="lineNum"> 148 </span> : #define BLOCK_STATE_MASK 7
<span class="lineNum"> 149 </span> :
<span class="lineNum"> 150 </span> : /**
<span class="lineNum"> 151 </span> : * This block is an empty one.
<span class="lineNum"> 152 </span> : * Note that this state cannot be stored inside the block,
<span class="lineNum"> 153 </span> : * and it's represented by the block ::BLOCK_EMPTY.
<span class="lineNum"> 154 </span> : */
<span class="lineNum"> 155 </span> : #define BLOCK_STATE_EMPTY 8
<span class="lineNum"> 156 </span> :
<span class="lineNum"> 157 </span> : /**
<span class="lineNum"> 158 </span> : * Block of a file.
<span class="lineNum"> 159 </span> : */
<span class="lineNum"> 160 </span> : struct snapraid_block {
<span class="lineNum"> 161 </span> : uintptr_t file_mixed; /**&lt; Back pointer to the file owning this block, mixed with some flags. */
<span class="lineNum"> 162 </span> : block_off_t parity_pos; /**&lt; Position of the block in the parity. */
<span class="lineNum"> 163 </span> : unsigned char hash[HASH_SIZE]; /**&lt; Hash of the block. */
<span class="lineNum"> 164 </span> : };
<span class="lineNum"> 165 </span> :
<span class="lineNum"> 166 </span> : /**
<span class="lineNum"> 167 </span> : * Block pointer used to mark unused blocks.
<span class="lineNum"> 168 </span> : */
<span class="lineNum"> 169 </span> : #define BLOCK_EMPTY 0
<span class="lineNum"> 170 </span> :
<span class="lineNum"> 171 </span> : /**
<span class="lineNum"> 172 </span> : * If a file is present in the disk.
<span class="lineNum"> 173 </span> : * It's used only in scan to detect present and missing files.
<span class="lineNum"> 174 </span> : */
<span class="lineNum"> 175 </span> : #define FILE_IS_PRESENT 0x01
<span class="lineNum"> 176 </span> :
<span class="lineNum"> 177 </span> : /**
<span class="lineNum"> 178 </span> : * If it's an excluded file from the processing.
<span class="lineNum"> 179 </span> : * It's used in both check and fix to mark files to exclude from the processing.
<span class="lineNum"> 180 </span> : */
<span class="lineNum"> 181 </span> : #define FILE_IS_EXCLUDED 0x02
<span class="lineNum"> 182 </span> :
<span class="lineNum"> 183 </span> : /**
<span class="lineNum"> 184 </span> : * If a fix was attempted but it failed.
<span class="lineNum"> 185 </span> : * It's used only in fix to mark that some data is unrecoverable.
<span class="lineNum"> 186 </span> : */
<span class="lineNum"> 187 </span> : #define FILE_IS_DAMAGED 0x04
<span class="lineNum"> 188 </span> :
<span class="lineNum"> 189 </span> : /**
<span class="lineNum"> 190 </span> : * If a fix was done.
<span class="lineNum"> 191 </span> : * It's used only in fix to mark that some data was recovered.
<span class="lineNum"> 192 </span> : */
<span class="lineNum"> 193 </span> : #define FILE_IS_FIXED 0x08
<span class="lineNum"> 194 </span> :
<span class="lineNum"> 195 </span> : /**
<span class="lineNum"> 196 </span> : * If the file was originally missing, and it was created in the fix process.
<span class="lineNum"> 197 </span> : * It's used only in fix to mark files recovered from scratch,
<span class="lineNum"> 198 </span> : * meaning that they don't have any previous content.
<span class="lineNum"> 199 </span> : * This is important because it means that deleting them, you are not going
<span class="lineNum"> 200 </span> : * to lose something that cannot be recovered.
<span class="lineNum"> 201 </span> : * Note that excluded files won't ever get this flag.
<span class="lineNum"> 202 </span> : */
<span class="lineNum"> 203 </span> : #define FILE_IS_CREATED 0x10
<span class="lineNum"> 204 </span> :
<span class="lineNum"> 205 </span> : /**
<span class="lineNum"> 206 </span> : * If the file has completed its processing, meaning that it won't be opened anymore.
<span class="lineNum"> 207 </span> : * It's used only in fix to mark when we finish processing one file.
<span class="lineNum"> 208 </span> : * Note that excluded files won't ever get this flag.
<span class="lineNum"> 209 </span> : */
<span class="lineNum"> 210 </span> : #define FILE_IS_FINISHED 0x20
<span class="lineNum"> 211 </span> :
<span class="lineNum"> 212 </span> : /**
<span class="lineNum"> 213 </span> : * If the file hash was obtained from a file copy
<span class="lineNum"> 214 </span> : * identified by the same name, size and stamp.
<span class="lineNum"> 215 </span> : */
<span class="lineNum"> 216 </span> : #define FILE_IS_COPY 0x40
<span class="lineNum"> 217 </span> :
<span class="lineNum"> 218 </span> : /**
<span class="lineNum"> 219 </span> : * If the file was opened.
<span class="lineNum"> 220 </span> : * It's used in fix to detect if it's the first time a file is opened.
<span class="lineNum"> 221 </span> : */
<span class="lineNum"> 222 </span> : #define FILE_IS_OPENED 0x80
<span class="lineNum"> 223 </span> :
<span class="lineNum"> 224 </span> : /**
<span class="lineNum"> 225 </span> : * If the file is modified from the latest sync.
<span class="lineNum"> 226 </span> : * It's used in fix to store if the state of the file before being modified.
<span class="lineNum"> 227 </span> : */
<span class="lineNum"> 228 </span> : #define FILE_IS_UNSYNCED 0x100
<span class="lineNum"> 229 </span> :
<span class="lineNum"> 230 </span> : /**
<span class="lineNum"> 231 </span> : * If the file is without inode.
<span class="lineNum"> 232 </span> : * It could happen in filesystem where inodes are not persistent,
<span class="lineNum"> 233 </span> : * or when restoring a full disk with &quot;fix&quot;.
<span class="lineNum"> 234 </span> : * In such cases we have to clear any stored duplicate inode.
<span class="lineNum"> 235 </span> : * After the scan process completes, no file should have this flag set.
<span class="lineNum"> 236 </span> : */
<span class="lineNum"> 237 </span> : #define FILE_IS_WITHOUT_INODE 0x200
<span class="lineNum"> 238 </span> :
<span class="lineNum"> 239 </span> : #define FILE_IS_HARDLINK 0x1000 /**&lt; If it's an hardlink. */
<span class="lineNum"> 240 </span> : #define FILE_IS_SYMLINK 0x2000 /**&lt; If it's a file symlink. */
<span class="lineNum"> 241 </span> : #define FILE_IS_SYMDIR 0x4000 /**&lt; If it's a dir symlink for Windows. Not yet supported. */
<span class="lineNum"> 242 </span> : #define FILE_IS_JUNCTION 0x8000 /**&lt; If it's a junction for Windows. Not yet supported. */
<span class="lineNum"> 243 </span> : #define FILE_IS_LINK_MASK 0xF000 /**&lt; Mask for link type. */
<span class="lineNum"> 244 </span> :
<span class="lineNum"> 245 </span> : /**
<span class="lineNum"> 246 </span> : * File.
<span class="lineNum"> 247 </span> : */
<span class="lineNum"> 248 </span> : struct snapraid_file {
<span class="lineNum"> 249 </span> : int64_t mtime_sec; /**&lt; Modification time. */
<span class="lineNum"> 250 </span> : uint64_t inode; /**&lt; Inode. */
<span class="lineNum"> 251 </span> : uint64_t physical; /**&lt; Physical offset of the file. */
<span class="lineNum"> 252 </span> : data_off_t size; /**&lt; Size of the file. */
<span class="lineNum"> 253 </span> : struct snapraid_block* blockvec; /**&lt; All the blocks of the file. */
<span class="lineNum"> 254 </span> : int mtime_nsec; /**&lt; Modification time nanoseconds. In the range 0 &lt;= x &lt; 1,000,000,000, or STAT_NSEC_INVALID if not present. */
<span class="lineNum"> 255 </span> : block_off_t blockmax; /**&lt; Number of blocks. */
<span class="lineNum"> 256 </span> : unsigned flag; /**&lt; FILE_IS_* flags. */
<span class="lineNum"> 257 </span> : char* sub; /**&lt; Sub path of the file. Without the disk dir. The disk is implicit. */
<span class="lineNum"> 258 </span> :
<span class="lineNum"> 259 </span> : /* nodes for data structures */
<span class="lineNum"> 260 </span> : tommy_node nodelist;
<span class="lineNum"> 261 </span> : tommy_hashdyn_node nodeset;
<span class="lineNum"> 262 </span> : tommy_hashdyn_node pathset;
<span class="lineNum"> 263 </span> : tommy_hashdyn_node stampset;
<span class="lineNum"> 264 </span> : };
<span class="lineNum"> 265 </span> :
<span class="lineNum"> 266 </span> : /**
<span class="lineNum"> 267 </span> : * Symbolic Link.
<span class="lineNum"> 268 </span> : */
<span class="lineNum"> 269 </span> : struct snapraid_link {
<span class="lineNum"> 270 </span> : unsigned flag; /**&lt; FILE_IS_* flags. */
<span class="lineNum"> 271 </span> : char* sub; /**&lt; Sub path of the file. Without the disk dir. The disk is implicit. */
<span class="lineNum"> 272 </span> : char* linkto; /**&lt; Link to. */
<span class="lineNum"> 273 </span> :
<span class="lineNum"> 274 </span> : /* nodes for data structures */
<span class="lineNum"> 275 </span> : tommy_node nodelist;
<span class="lineNum"> 276 </span> : tommy_hashdyn_node nodeset;
<span class="lineNum"> 277 </span> : };
<span class="lineNum"> 278 </span> :
<span class="lineNum"> 279 </span> : /**
<span class="lineNum"> 280 </span> : * Dir.
<span class="lineNum"> 281 </span> : */
<span class="lineNum"> 282 </span> : struct snapraid_dir {
<span class="lineNum"> 283 </span> : unsigned flag; /**&lt; FILE_IS_* flags. */
<span class="lineNum"> 284 </span> : char* sub; /**&lt; Sub path of the file. Without the disk dir. The disk is implicit. */
<span class="lineNum"> 285 </span> :
<span class="lineNum"> 286 </span> : /* nodes for data structures */
<span class="lineNum"> 287 </span> : tommy_node nodelist;
<span class="lineNum"> 288 </span> : tommy_hashdyn_node nodeset;
<span class="lineNum"> 289 </span> : };
<span class="lineNum"> 290 </span> :
<span class="lineNum"> 291 </span> : /**
<span class="lineNum"> 292 </span> : * Deleted entry.
<span class="lineNum"> 293 </span> : */
<span class="lineNum"> 294 </span> : struct snapraid_deleted {
<span class="lineNum"> 295 </span> : /**
<span class="lineNum"> 296 </span> : * Deleted block.
<span class="lineNum"> 297 </span> : * This block is always in state BLOCK_STATE_DELETED,
<span class="lineNum"> 298 </span> : * and it's used to keep the old hash during a sync.
<span class="lineNum"> 299 </span> : */
<span class="lineNum"> 300 </span> : struct snapraid_block block;
<span class="lineNum"> 301 </span> :
<span class="lineNum"> 302 </span> : /* nodes for data structures */
<span class="lineNum"> 303 </span> : tommy_node node;
<span class="lineNum"> 304 </span> : };
<span class="lineNum"> 305 </span> :
<span class="lineNum"> 306 </span> : /**
<span class="lineNum"> 307 </span> : * Disk.
<span class="lineNum"> 308 </span> : */
<span class="lineNum"> 309 </span> : struct snapraid_disk {
<span class="lineNum"> 310 </span> : char name[PATH_MAX]; /**&lt; Name of the disk. */
<span class="lineNum"> 311 </span> : char dir[PATH_MAX]; /**&lt; Mount point of the disk. It always terminates with /. */
<span class="lineNum"> 312 </span> : char smartctl[PATH_MAX]; /**&lt; Custom command for smartctl. Empty means auto. */
<span class="lineNum"> 313 </span> : uint64_t device; /**&lt; Device identifier. */
<span class="lineNum"> 314 </span> :
<span class="lineNum"> 315 </span> : uint64_t tick; /**&lt; Usage time of the disk. */
<span class="lineNum"> 316 </span> :
<span class="lineNum"> 317 </span> : block_off_t total_blocks; /**&lt; Number of total blocks. */
<span class="lineNum"> 318 </span> : block_off_t free_blocks; /**&lt; Number of free blocks at the last sync. */
<span class="lineNum"> 319 </span> :
<span class="lineNum"> 320 </span> : /**
<span class="lineNum"> 321 </span> : * First free searching block.
<span class="lineNum"> 322 </span> : * Note that it doesn't necessarely point at the first free block,
<span class="lineNum"> 323 </span> : * but it just tell you that no free block is present before this position.
<span class="lineNum"> 324 </span> : */
<span class="lineNum"> 325 </span> : block_off_t first_free_block;
<span class="lineNum"> 326 </span> :
<span class="lineNum"> 327 </span> : int has_volatile_inodes; /**&lt; If the underline filesystem has not persistent inodes. */
<span class="lineNum"> 328 </span> : int has_unreliable_physical; /**&lt; If the physical offset of files has duplicates. */
<span class="lineNum"> 329 </span> : int has_different_uuid; /**&lt; If the disk has a different UUID, meaning that it is not the same filesystem. */
<span class="lineNum"> 330 </span> : int has_unsupported_uuid; /**&lt; If the disk doesn't report UUID, meaning it's not supported. */
<span class="lineNum"> 331 </span> : int had_empty_uuid; /**&lt; If the disk had an empty UUID, meaning that it's a new disk. */
<span class="lineNum"> 332 </span> : int mapping_idx; /**&lt; Index in the mapping vector. Used only as buffer when writing the content file. */
<span class="lineNum"> 333 </span> :
<span class="lineNum"> 334 </span> : /**&lt;
<span class="lineNum"> 335 </span> : * Block array of the disk.
<span class="lineNum"> 336 </span> : *
<span class="lineNum"> 337 </span> : * Each element points to a snapraid_block structure, or it's BLOCK_EMPTY.
<span class="lineNum"> 338 </span> : */
<span class="lineNum"> 339 </span> : tommy_arrayblk blockarr;
<span class="lineNum"> 340 </span> :
<span class="lineNum"> 341 </span> : /**
<span class="lineNum"> 342 </span> : * List of all the snapraid_file for the disk.
<span class="lineNum"> 343 </span> : */
<span class="lineNum"> 344 </span> : tommy_list filelist;
<span class="lineNum"> 345 </span> :
<span class="lineNum"> 346 </span> : /**
<span class="lineNum"> 347 </span> : * List of all the snapraid_deleted blocks for the disk.
<span class="lineNum"> 348 </span> : *
<span class="lineNum"> 349 </span> : * These files are kept allocated, because the blocks are still referenced in
<span class="lineNum"> 350 </span> : * the ::blockarr.
<span class="lineNum"> 351 </span> : */
<span class="lineNum"> 352 </span> : tommy_list deletedlist;
<span class="lineNum"> 353 </span> :
<span class="lineNum"> 354 </span> : tommy_hashdyn inodeset; /**&lt; Hashtable by inode of all the files. */
<span class="lineNum"> 355 </span> : tommy_hashdyn pathset; /**&lt; Hashtable by path of all the files. */
<span class="lineNum"> 356 </span> : tommy_hashdyn stampset; /**&lt; Hashtable by stamp (size and time) of all the files. */
<span class="lineNum"> 357 </span> : tommy_list linklist; /**&lt; List of all the links. */
<span class="lineNum"> 358 </span> : tommy_hashdyn linkset; /**&lt; Hashtable by name of all the links. */
<span class="lineNum"> 359 </span> : tommy_list dirlist; /**&lt; List of all the dirs. */
<span class="lineNum"> 360 </span> : tommy_hashdyn dirset; /**&lt; Hashtable by name of all the dirs. */
<span class="lineNum"> 361 </span> :
<span class="lineNum"> 362 </span> : /* nodes for data structures */
<span class="lineNum"> 363 </span> : tommy_node node;
<span class="lineNum"> 364 </span> : };
<span class="lineNum"> 365 </span> :
<span class="lineNum"> 366 </span> : /**
<span class="lineNum"> 367 </span> : * Max UUID length.
<span class="lineNum"> 368 </span> : */
<span class="lineNum"> 369 </span> : #define UUID_MAX 128
<span class="lineNum"> 370 </span> :
<span class="lineNum"> 371 </span> : /**
<span class="lineNum"> 372 </span> : * Disk mapping.
<span class="lineNum"> 373 </span> : */
<span class="lineNum"> 374 </span> : struct snapraid_map {
<span class="lineNum"> 375 </span> : char name[PATH_MAX]; /**&lt; Name of the disk. */
<span class="lineNum"> 376 </span> : char uuid[UUID_MAX]; /**&lt; UUID of the disk. Empty if unknown. */
<span class="lineNum"> 377 </span> : block_off_t total_blocks; /**&lt; Number of total blocks. */
<span class="lineNum"> 378 </span> : block_off_t free_blocks; /**&lt; Number of free blocks at last 'sync'. */
<span class="lineNum"> 379 </span> : unsigned position; /**&lt; Position of the disk in the parity. */
<span class="lineNum"> 380 </span> :
<span class="lineNum"> 381 </span> : /* nodes for data structures */
<span class="lineNum"> 382 </span> : tommy_node node;
<span class="lineNum"> 383 </span> : };
<span class="lineNum"> 384 </span> :
<span class="lineNum"> 385 </span> : /**
<span class="lineNum"> 386 </span> : * Parity.
<span class="lineNum"> 387 </span> : */
<span class="lineNum"> 388 </span> : struct snapraid_parity {
<span class="lineNum"> 389 </span> : char path[PATH_MAX]; /**&lt; Path of the parity file. */
<span class="lineNum"> 390 </span> : char uuid[UUID_MAX]; /**&lt; UUID of the disk. Empty if unknown. */
<span class="lineNum"> 391 </span> : char smartctl[PATH_MAX]; /**&lt; Custom command for smartctl. Empty means auto. */
<span class="lineNum"> 392 </span> : uint64_t device; /**&lt; Device identifier of the parity. */
<span class="lineNum"> 393 </span> : block_off_t total_blocks; /**&lt; Number of total blocks. */
<span class="lineNum"> 394 </span> : block_off_t free_blocks; /**&lt; Number of free blocks at the last sync. */
<span class="lineNum"> 395 </span> :
<span class="lineNum"> 396 </span> : /**
<span class="lineNum"> 397 </span> : * Cumulative time used for parity disks.
<span class="lineNum"> 398 </span> : */
<span class="lineNum"> 399 </span> : uint64_t tick;
<span class="lineNum"> 400 </span> : };
<span class="lineNum"> 401 </span> :
<span class="lineNum"> 402 </span> : /**
<span class="lineNum"> 403 </span> : * Info.
<span class="lineNum"> 404 </span> : */
<span class="lineNum"> 405 </span> : typedef uint32_t snapraid_info;
<span class="lineNum"> 406 </span> :
<span class="lineNum"> 407 </span> : /**
<span class="lineNum"> 408 </span> : * Allocates a content.
<span class="lineNum"> 409 </span> : */
<span class="lineNum"> 410 </span> : struct snapraid_content* content_alloc(const char* path, uint64_t dev);
<span class="lineNum"> 411 </span> :
<span class="lineNum"> 412 </span> : /**
<span class="lineNum"> 413 </span> : * Deallocates a content.
<span class="lineNum"> 414 </span> : */
<span class="lineNum"> 415 </span> : void content_free(struct snapraid_content* content);
<span class="lineNum"> 416 </span> :
<span class="lineNum"> 417 </span> : /**
<span class="lineNum"> 418 </span> : * Allocates a filter pattern for files and directories.
<span class="lineNum"> 419 </span> : */
<span class="lineNum"> 420 </span> : struct snapraid_filter* filter_alloc_file(int is_include, const char* pattern);
<span class="lineNum"> 421 </span> :
<span class="lineNum"> 422 </span> : /**
<span class="lineNum"> 423 </span> : * Allocates a filter pattern for disks.
<span class="lineNum"> 424 </span> : */
<span class="lineNum"> 425 </span> : struct snapraid_filter* filter_alloc_disk(int is_include, const char* pattern);
<span class="lineNum"> 426 </span> :
<span class="lineNum"> 427 </span> : /**
<span class="lineNum"> 428 </span> : * Deallocates an exclusion.
<span class="lineNum"> 429 </span> : */
<span class="lineNum"> 430 </span> : void filter_free(struct snapraid_filter* filter);
<span class="lineNum"> 431 </span> :
<span class="lineNum"> 432 </span> : /**
<span class="lineNum"> 433 </span> : * Filter type description.
<span class="lineNum"> 434 </span> : */
<span class="lineNum"> 435 </span> : const char* filter_type(struct snapraid_filter* filter, char* out, size_t out_size);
<span class="lineNum"> 436 </span> :
<span class="lineNum"> 437 </span> : /**
<span class="lineNum"> 438 </span> : * Filter hidden files.
<a name="439"><span class="lineNum"> 439 </span> : * Return !=0 if it matches and it should be excluded.</a>
<span class="lineNum"> 440 </span> : */
<span class="lineNum"> 441 </span><span class="lineCov"> 3039576 : static inline int filter_hidden(int enable, struct dirent* dd)</span>
<span class="lineNum"> 442 </span> : {
<span class="lineNum"> 443 </span><span class="lineCov"> 3039576 : if (enable &amp;&amp; dirent_hidden(dd)) {</span>
<span class="lineNum"> 444 </span><span class="lineNoCov"> 0 : return 1; /* filter out */</span>
<span class="lineNum"> 445 </span> : }
<span class="lineNum"> 446 </span> :
<span class="lineNum"> 447 </span><span class="lineCov"> 3039576 : return 0;</span>
<span class="lineNum"> 448 </span> : }
<span class="lineNum"> 449 </span> :
<span class="lineNum"> 450 </span> : /**
<span class="lineNum"> 451 </span> : * Filters a path using a list of filters.
<span class="lineNum"> 452 </span> : * For each element of the path all the filters are applied, until the first one that matches.
<span class="lineNum"> 453 </span> : * Return !=0 if it should be excluded.
<span class="lineNum"> 454 </span> : */
<span class="lineNum"> 455 </span> : int filter_path(tommy_list* filterlist, struct snapraid_filter** reason, const char* disk, const char* sub);
<span class="lineNum"> 456 </span> :
<span class="lineNum"> 457 </span> : /**
<span class="lineNum"> 458 </span> : * Filter a file/link/dir if missing.
<span class="lineNum"> 459 </span> : * This call imply a disk check for the file presence.
<span class="lineNum"> 460 </span> : * Return !=0 if the file is present and it should be excluded.
<span class="lineNum"> 461 </span> : */
<span class="lineNum"> 462 </span> : int filter_existence(int filter_missing, const char* dir, const char* sub);
<span class="lineNum"> 463 </span> :
<span class="lineNum"> 464 </span> : /**
<span class="lineNum"> 465 </span> : * Filter a file if bad.
<span class="lineNum"> 466 </span> : * Return !=0 if the file is correct and it should be excluded.
<span class="lineNum"> 467 </span> : */
<span class="lineNum"> 468 </span> : int filter_correctness(int filter_error, tommy_arrayblkof* infoarr, struct snapraid_file* file);
<span class="lineNum"> 469 </span> :
<span class="lineNum"> 470 </span> : /**
<span class="lineNum"> 471 </span> : * Filters a dir using a list of filters.
<span class="lineNum"> 472 </span> : * For each element of the path all the filters are applied, until the first one that matches.
<span class="lineNum"> 473 </span> : * Return !=0 if should be excluded.
<span class="lineNum"> 474 </span> : */
<span class="lineNum"> 475 </span> : int filter_dir(tommy_list* filterlist, struct snapraid_filter** reason, const char* disk, const char* sub);
<span class="lineNum"> 476 </span> :
<span class="lineNum"> 477 </span> : /**
<span class="lineNum"> 478 </span> : * Filters a path if it's a content file.
<span class="lineNum"> 479 </span> : * Return !=0 if should be excluded.
<span class="lineNum"> 480 </span> : */
<span class="lineNum"> 481 </span> : int filter_content(tommy_list* contentlist, const char* path);
<span class="lineNum"> 482 </span> :
<span class="lineNum"> 483 </span> : /**
<a name="484"><span class="lineNum"> 484 </span> : * Gets the file containing the block.</a>
<span class="lineNum"> 485 </span> : */
<span class="lineNum"> 486 </span><span class="lineCov"> 56105963 : static inline struct snapraid_file* block_file_get(struct snapraid_block* block)</span>
<span class="lineNum"> 487 </span> : {
<span class="lineNum"> 488 </span><span class="lineCov"> 56105963 : return (struct snapraid_file*)(block-&gt;file_mixed &amp; ~(uintptr_t)BLOCK_STATE_MASK);</span>
<span class="lineNum"> 489 </span> : }
<span class="lineNum"> 490 </span> :
<span class="lineNum"> 491 </span> : /**
<a name="492"><span class="lineNum"> 492 </span> : * Sets the file containing the block.</a>
<span class="lineNum"> 493 </span> : */
<span class="lineNum"> 494 </span><span class="lineCov"> 8800887 : static inline void block_file_set(struct snapraid_block* block, struct snapraid_file* file)</span>
<span class="lineNum"> 495 </span> : {
<span class="lineNum"> 496 </span><span class="lineCov"> 8800887 : uintptr_t ptr = (uintptr_t)file;</span>
<span class="lineNum"> 497 </span> :
<span class="lineNum"> 498 </span> : /* ensure that the pointer doesn't use the flag space */
<span class="lineNum"> 499 </span><span class="lineCov"> 8800887 : if ((ptr &amp; (uintptr_t)BLOCK_STATE_MASK) != 0) {</span>
<span class="lineNum"> 500 </span> : /* LCOV_EXCL_START */
<span class="lineNum"> 501 </span> : log_fatal(&quot;Internal error for pointer not aligned\n&quot;);
<span class="lineNum"> 502 </span> : exit(EXIT_FAILURE);
<span class="lineNum"> 503 </span> : /* LCOV_EXCL_STOP */
<span class="lineNum"> 504 </span> : }
<span class="lineNum"> 505 </span> :
<span class="lineNum"> 506 </span><span class="lineCov"> 8800887 : block-&gt;file_mixed = (block-&gt;file_mixed &amp; ~(uintptr_t)BLOCK_STATE_MASK) | ptr;</span>
<span class="lineNum"> 507 </span><span class="lineCov"> 8800887 : }</span>
<span class="lineNum"> 508 </span> :
<span class="lineNum"> 509 </span> : /**
<span class="lineNum"> 510 </span> : * Get the state of the block.
<span class="lineNum"> 511 </span> : *
<span class="lineNum"> 512 </span> : * For this function, it's allowed to pass a NULL block
<a name="513"><span class="lineNum"> 513 </span> : * pointer than results in the BLOCK_STATE_EMPTY state.</a>
<span class="lineNum"> 514 </span> : */
<span class="lineNum"> 515 </span><span class="lineCov"> 50453929 : static inline unsigned block_state_get(const struct snapraid_block* block)</span>
<span class="lineNum"> 516 </span> : {
<span class="lineNum"> 517 </span><span class="lineCov"> 50453929 : if (block == BLOCK_EMPTY)</span>
<span class="lineNum"> 518 </span><span class="lineCov"> 1581967 : return BLOCK_STATE_EMPTY;</span>
<span class="lineNum"> 519 </span> :
<span class="lineNum"> 520 </span><span class="lineCov"> 48871962 : return block-&gt;file_mixed &amp; BLOCK_STATE_MASK;</span>
<a name="521"><span class="lineNum"> 521 </span> : }</a>
<span class="lineNum"> 522 </span> :
<span class="lineNum"> 523 </span><span class="lineCov"> 18101538 : static inline void block_state_set(struct snapraid_block* block, unsigned state)</span>
<span class="lineNum"> 524 </span> : {
<span class="lineNum"> 525 </span> : /* ensure that the state can be stored inside the file pointer */
<span class="lineNum"> 526 </span><span class="lineCov"> 18101538 : if ((state &amp; BLOCK_STATE_MASK) != state) {</span>
<span class="lineNum"> 527 </span> : /* LCOV_EXCL_START */
<span class="lineNum"> 528 </span> : log_fatal(&quot;Internal error when setting the block state %u\n&quot;, state);
<span class="lineNum"> 529 </span> : exit(EXIT_FAILURE);
<span class="lineNum"> 530 </span> : /* LCOV_EXCL_STOP */
<span class="lineNum"> 531 </span> : }
<span class="lineNum"> 532 </span> :
<span class="lineNum"> 533 </span><span class="lineCov"> 18101538 : block-&gt;file_mixed &amp;= ~(uintptr_t)BLOCK_STATE_MASK;</span>
<span class="lineNum"> 534 </span><span class="lineCov"> 18101538 : block-&gt;file_mixed |= state &amp; BLOCK_STATE_MASK;</span>
<span class="lineNum"> 535 </span><span class="lineCov"> 18101538 : }</span>
<span class="lineNum"> 536 </span> :
<span class="lineNum"> 537 </span> : /**
<span class="lineNum"> 538 </span> : * Checks if the specified block has an updated hash.
<span class="lineNum"> 539 </span> : *
<a name="540"><span class="lineNum"> 540 </span> : * Note that EMPTY / CHG / DELETED return 0.</a>
<span class="lineNum"> 541 </span> : */
<span class="lineNum"> 542 </span><span class="lineCov"> 2328539 : static inline int block_has_updated_hash(const struct snapraid_block* block)</span>
<span class="lineNum"> 543 </span> : {
<span class="lineNum"> 544 </span><span class="lineCov"> 2328539 : unsigned state = block_state_get(block);</span>
<span class="lineNum"> 545 </span> :
<span class="lineNum"> 546 </span><span class="lineCov"> 2328539 : return state == BLOCK_STATE_BLK || state == BLOCK_STATE_REP;</span>
<span class="lineNum"> 547 </span> : }
<span class="lineNum"> 548 </span> :
<span class="lineNum"> 549 </span> : /**
<span class="lineNum"> 550 </span> : * Checks if the specified block has a past hash,
<span class="lineNum"> 551 </span> : * i.e. the hash of the data that it's now overwritten or lost.
<span class="lineNum"> 552 </span> : *
<a name="553"><span class="lineNum"> 553 </span> : * Note that EMPTY / BLK / REP return 0.</a>
<span class="lineNum"> 554 </span> : */
<span class="lineNum"> 555 </span><span class="lineCov"> 2245365 : static inline int block_has_past_hash(const struct snapraid_block* block)</span>
<span class="lineNum"> 556 </span> : {
<span class="lineNum"> 557 </span><span class="lineCov"> 2245365 : unsigned state = block_state_get(block);</span>
<span class="lineNum"> 558 </span> :
<span class="lineNum"> 559 </span><span class="lineCov"> 2245365 : return state == BLOCK_STATE_CHG || state == BLOCK_STATE_DELETED;</span>
<span class="lineNum"> 560 </span> : }
<span class="lineNum"> 561 </span> :
<span class="lineNum"> 562 </span> : /**
<span class="lineNum"> 563 </span> : * Checks if the specified hash is invalid.
<span class="lineNum"> 564 </span> : *
<a name="565"><span class="lineNum"> 565 </span> : * An invalid hash is represented with all bytes at 0x00.</a>
<span class="lineNum"> 566 </span> : */
<span class="lineNum"> 567 </span><span class="lineCov"> 768754 : static inline int hash_is_invalid(const unsigned char* hash)</span>
<span class="lineNum"> 568 </span> : {
<span class="lineNum"> 569 </span> : unsigned i;
<span class="lineNum"> 570 </span> :
<span class="lineNum"> 571 </span><span class="lineCov"> 1257417 : for (i = 0; i &lt; HASH_SIZE; ++i)</span>
<span class="lineNum"> 572 </span><span class="lineCov"> 1227038 : if (hash[i] != 0x00)</span>
<span class="lineNum"> 573 </span><span class="lineCov"> 738375 : return 0;</span>
<span class="lineNum"> 574 </span> :
<span class="lineNum"> 575 </span><span class="lineCov"> 30379 : return 1;</span>
<span class="lineNum"> 576 </span> : }
<span class="lineNum"> 577 </span> :
<span class="lineNum"> 578 </span> : /**
<span class="lineNum"> 579 </span> : * Checks if the specified hash represent the zero block.
<span class="lineNum"> 580 </span> : *
<a name="581"><span class="lineNum"> 581 </span> : * A zero hash is represented with all bytes at 0xFF.</a>
<span class="lineNum"> 582 </span> : */
<span class="lineNum"> 583 </span><span class="lineCov"> 782918 : static inline int hash_is_zero(const unsigned char* hash)</span>
<span class="lineNum"> 584 </span> : {
<span class="lineNum"> 585 </span> : unsigned i;
<span class="lineNum"> 586 </span> :
<span class="lineNum"> 587 </span><span class="lineCov"> 1828180 : for (i = 0; i &lt; HASH_SIZE; ++i)</span>
<span class="lineNum"> 588 </span><span class="lineCov"> 1763006 : if (hash[i] != 0xFF)</span>
<span class="lineNum"> 589 </span><span class="lineCov"> 717744 : return 0;</span>
<span class="lineNum"> 590 </span> :
<span class="lineNum"> 591 </span><span class="lineCov"> 65174 : return 1;</span>
<span class="lineNum"> 592 </span> : }
<span class="lineNum"> 593 </span> :
<span class="lineNum"> 594 </span> : /**
<a name="595"><span class="lineNum"> 595 </span> : * Checks if the specified hash is a real hash.</a>
<span class="lineNum"> 596 </span> : */
<span class="lineNum"> 597 </span><span class="lineCov"> 63414 : static inline int hash_is_real(const unsigned char* hash)</span>
<span class="lineNum"> 598 </span> : {
<span class="lineNum"> 599 </span><span class="lineCov"> 63414 : return !hash_is_zero(hash) &amp;&amp; !hash_is_invalid(hash);</span>
<span class="lineNum"> 600 </span> : }
<span class="lineNum"> 601 </span> :
<span class="lineNum"> 602 </span> : /**
<a name="603"><span class="lineNum"> 603 </span> : * Set the hash to the special INVALID value.</a>
<span class="lineNum"> 604 </span> : */
<span class="lineNum"> 605 </span><span class="lineCov"> 8915482 : static inline void hash_invalid_set(unsigned char* hash)</span>
<span class="lineNum"> 606 </span> : {
<span class="lineNum"> 607 </span><span class="lineCov"> 8915482 : memset(hash, 0x00, HASH_SIZE);</span>
<span class="lineNum"> 608 </span><span class="lineCov"> 8915482 : }</span>
<span class="lineNum"> 609 </span> :
<span class="lineNum"> 610 </span> : /**
<a name="611"><span class="lineNum"> 611 </span> : * Set the hash to the special ZERO value.</a>
<span class="lineNum"> 612 </span> : */
<span class="lineNum"> 613 </span><span class="lineCov"> 153240 : static inline void hash_zero_set(unsigned char* hash)</span>
<span class="lineNum"> 614 </span> : {
<span class="lineNum"> 615 </span><span class="lineCov"> 153240 : memset(hash, 0xFF, HASH_SIZE);</span>
<span class="lineNum"> 616 </span><span class="lineCov"> 153240 : }</span>
<span class="lineNum"> 617 </span> :
<span class="lineNum"> 618 </span> : /**
<span class="lineNum"> 619 </span> : * Checks if the specified block is part of a file.
<span class="lineNum"> 620 </span> : *
<a name="621"><span class="lineNum"> 621 </span> : * Note that EMPTY / DELETED return 0.</a>
<span class="lineNum"> 622 </span> : */
<span class="lineNum"> 623 </span><span class="lineCov"> 15044184 : static inline int block_has_file(const struct snapraid_block* block)</span>
<span class="lineNum"> 624 </span> : {
<span class="lineNum"> 625 </span><span class="lineCov"> 15044184 : unsigned state = block_state_get(block);</span>
<span class="lineNum"> 626 </span> :
<span class="lineNum"> 627 </span><span class="lineCov"> 15044184 : return state == BLOCK_STATE_BLK</span>
<span class="lineNum"> 628 </span><span class="lineCov"> 15044184 : || state == BLOCK_STATE_CHG || state == BLOCK_STATE_REP;</span>
<span class="lineNum"> 629 </span> : }
<span class="lineNum"> 630 </span> :
<span class="lineNum"> 631 </span> : /**
<span class="lineNum"> 632 </span> : * Checks if the block has an invalid parity than needs to be updated.
<span class="lineNum"> 633 </span> : *
<a name="634"><span class="lineNum"> 634 </span> : * Note that EMPTY / BLK return 0.</a>
<span class="lineNum"> 635 </span> : */
<span class="lineNum"> 636 </span><span class="lineCov"> 11328231 : static inline int block_has_invalid_parity(const struct snapraid_block* block)</span>
<span class="lineNum"> 637 </span> : {
<span class="lineNum"> 638 </span><span class="lineCov"> 11328231 : unsigned state = block_state_get(block);</span>
<span class="lineNum"> 639 </span> :
<span class="lineNum"> 640 </span><span class="lineCov"> 11328231 : return state == BLOCK_STATE_DELETED</span>
<span class="lineNum"> 641 </span><span class="lineCov"> 11328231 : || state == BLOCK_STATE_CHG || state == BLOCK_STATE_REP;</span>
<span class="lineNum"> 642 </span> : }
<span class="lineNum"> 643 </span> :
<span class="lineNum"> 644 </span> : /**
<span class="lineNum"> 645 </span> : * Checks if the block is part of a file with valid parity.
<span class="lineNum"> 646 </span> : *
<a name="647"><span class="lineNum"> 647 </span> : * Note that anything different than BLK return 0.</a>
<span class="lineNum"> 648 </span> : */
<span class="lineNum"> 649 </span><span class="lineCov"> 220849 : static inline int block_has_file_and_valid_parity(const struct snapraid_block* block)</span>
<span class="lineNum"> 650 </span> : {
<span class="lineNum"> 651 </span><span class="lineCov"> 220849 : unsigned state = block_state_get(block);</span>
<span class="lineNum"> 652 </span> :
<span class="lineNum"> 653 </span><span class="lineCov"> 220849 : return state == BLOCK_STATE_BLK;</span>
<span class="lineNum"> 654 </span> : }
<span class="lineNum"> 655 </span> :
<span class="lineNum"> 656 </span> : /**
<span class="lineNum"> 657 </span> : * Gets the relative position of a block inside the file.
<span class="lineNum"> 658 </span> : */
<span class="lineNum"> 659 </span> : block_off_t block_file_pos(struct snapraid_block* block);
<span class="lineNum"> 660 </span> :
<span class="lineNum"> 661 </span> : /**
<span class="lineNum"> 662 </span> : * Checks if the block is the last in the file.
<span class="lineNum"> 663 </span> : */
<span class="lineNum"> 664 </span> : int block_is_last(struct snapraid_block* block);
<span class="lineNum"> 665 </span> :
<span class="lineNum"> 666 </span> : /**
<span class="lineNum"> 667 </span> : * Gets the size in bytes of the block.
<span class="lineNum"> 668 </span> : * If it's the last block of a file it could be less than block_size.
<span class="lineNum"> 669 </span> : */
<span class="lineNum"> 670 </span> : unsigned block_file_size(struct snapraid_block* block, unsigned block_size);
<span class="lineNum"> 671 </span> :
<span class="lineNum"> 672 </span> : /**
<span class="lineNum"> 673 </span> : * Allocates a deleted block.
<span class="lineNum"> 674 </span> : */
<span class="lineNum"> 675 </span> : struct snapraid_deleted* deleted_alloc(void);
<span class="lineNum"> 676 </span> :
<span class="lineNum"> 677 </span> : /**
<span class="lineNum"> 678 </span> : * Allocates a deleted block from a real one.
<span class="lineNum"> 679 </span> : */
<span class="lineNum"> 680 </span> : struct snapraid_deleted* deleted_dup(struct snapraid_block* block);
<span class="lineNum"> 681 </span> :
<span class="lineNum"> 682 </span> : /**
<span class="lineNum"> 683 </span> : * Frees a deleted block.
<span class="lineNum"> 684 </span> : */
<a name="685"><span class="lineNum"> 685 </span> : void deleted_free(struct snapraid_deleted* deleted);</a>
<span class="lineNum"> 686 </span> :
<span class="lineNum"> 687 </span><span class="lineCov"> 20906140 : static inline int file_flag_has(const struct snapraid_file* file, unsigned mask)</span>
<span class="lineNum"> 688 </span> : {
<span class="lineNum"> 689 </span><span class="lineCov"> 20906140 : return (file-&gt;flag &amp; mask) == mask;</span>
<a name="690"><span class="lineNum"> 690 </span> : }</a>
<span class="lineNum"> 691 </span> :
<span class="lineNum"> 692 </span><span class="lineCov"> 4890738 : static inline void file_flag_set(struct snapraid_file* file, unsigned mask)</span>
<span class="lineNum"> 693 </span> : {
<span class="lineNum"> 694 </span><span class="lineCov"> 4890738 : file-&gt;flag |= mask;</span>
<a name="695"><span class="lineNum"> 695 </span><span class="lineCov"> 4890738 : }</span></a>
<span class="lineNum"> 696 </span> :
<span class="lineNum"> 697 </span><span class="lineCov"> 9855 : static inline void file_flag_clear(struct snapraid_file* file, unsigned mask)</span>
<span class="lineNum"> 698 </span> : {
<span class="lineNum"> 699 </span><span class="lineCov"> 9855 : file-&gt;flag &amp;= ~mask;</span>
<span class="lineNum"> 700 </span><span class="lineCov"> 9855 : }</span>
<span class="lineNum"> 701 </span> :
<span class="lineNum"> 702 </span> : /**
<span class="lineNum"> 703 </span> : * Allocates a file.
<span class="lineNum"> 704 </span> : */
<span class="lineNum"> 705 </span> : 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 class="lineNum"> 706 </span> :
<span class="lineNum"> 707 </span> : /**
<span class="lineNum"> 708 </span> : * Deallocates a file.
<span class="lineNum"> 709 </span> : */
<span class="lineNum"> 710 </span> : void file_free(struct snapraid_file* file);
<span class="lineNum"> 711 </span> :
<span class="lineNum"> 712 </span> : /**
<span class="lineNum"> 713 </span> : * Rename a file.
<span class="lineNum"> 714 </span> : */
<span class="lineNum"> 715 </span> : void file_rename(struct snapraid_file* file, const char* sub);
<span class="lineNum"> 716 </span> :
<span class="lineNum"> 717 </span> : /**
<span class="lineNum"> 718 </span> : * Copy a file.
<span class="lineNum"> 719 </span> : */
<span class="lineNum"> 720 </span> : void file_copy(struct snapraid_file* src_file, struct snapraid_file* dest_file);
<span class="lineNum"> 721 </span> :
<span class="lineNum"> 722 </span> : /**
<span class="lineNum"> 723 </span> : * Returns the name of the file, without the dir.
<span class="lineNum"> 724 </span> : */
<span class="lineNum"> 725 </span> : const char* file_name(const struct snapraid_file* file);
<span class="lineNum"> 726 </span> :
<span class="lineNum"> 727 </span> : /**
<span class="lineNum"> 728 </span> : * Compares a file with an inode.
<span class="lineNum"> 729 </span> : */
<span class="lineNum"> 730 </span> : int file_inode_compare_to_arg(const void* void_arg, const void* void_data);
<span class="lineNum"> 731 </span> :
<span class="lineNum"> 732 </span> : /**
<span class="lineNum"> 733 </span> : * Compares files by inode.
<span class="lineNum"> 734 </span> : */
<span class="lineNum"> 735 </span> : int file_inode_compare(const void* void_a, const void* void_b);
<span class="lineNum"> 736 </span> :
<span class="lineNum"> 737 </span> : /**
<span class="lineNum"> 738 </span> : * Compares files by path.
<span class="lineNum"> 739 </span> : */
<span class="lineNum"> 740 </span> : int file_path_compare(const void* void_a, const void* void_b);
<span class="lineNum"> 741 </span> :
<span class="lineNum"> 742 </span> : /**
<span class="lineNum"> 743 </span> : * Compares files by physical address.
<span class="lineNum"> 744 </span> : */
<span class="lineNum"> 745 </span> : int file_physical_compare(const void* void_a, const void* void_b);
<span class="lineNum"> 746 </span> :
<span class="lineNum"> 747 </span> : /**
<a name="748"><span class="lineNum"> 748 </span> : * Computes the hash of a file inode.</a>
<span class="lineNum"> 749 </span> : */
<span class="lineNum"> 750 </span><span class="lineCov"> 4779013 : static inline tommy_uint32_t file_inode_hash(uint64_t inode)</span>
<span class="lineNum"> 751 </span> : {
<span class="lineNum"> 752 </span><span class="lineCov"> 4779013 : return (tommy_uint32_t)tommy_inthash_u64(inode);</span>
<span class="lineNum"> 753 </span> : }
<span class="lineNum"> 754 </span> :
<span class="lineNum"> 755 </span> : /**
<span class="lineNum"> 756 </span> : * Compares a file with a path.
<span class="lineNum"> 757 </span> : */
<span class="lineNum"> 758 </span> : int file_path_compare_to_arg(const void* void_arg, const void* void_data);
<span class="lineNum"> 759 </span> :
<span class="lineNum"> 760 </span> : /**
<span class="lineNum"> 761 </span> : * Compare a file with another file for name, stamp, and both.
<span class="lineNum"> 762 </span> : */
<span class="lineNum"> 763 </span> : int file_name_compare(const void* void_a, const void* void_b);
<span class="lineNum"> 764 </span> : int file_stamp_compare(const void* void_a, const void* void_b);
<span class="lineNum"> 765 </span> : int file_namestamp_compare(const void* void_a, const void* void_b);
<span class="lineNum"> 766 </span> : int file_pathstamp_compare(const void* void_a, const void* void_b);
<span class="lineNum"> 767 </span> :
<span class="lineNum"> 768 </span> : /**
<a name="769"><span class="lineNum"> 769 </span> : * Computes the hash of a file path.</a>
<span class="lineNum"> 770 </span> : */
<span class="lineNum"> 771 </span><span class="lineCov"> 3752114 : static inline tommy_uint32_t file_path_hash(const char* sub)</span>
<span class="lineNum"> 772 </span> : {
<span class="lineNum"> 773 </span><span class="lineCov"> 3752114 : return tommy_hash_u32(0, sub, strlen(sub));</span>
<span class="lineNum"> 774 </span> : }
<span class="lineNum"> 775 </span> :
<span class="lineNum"> 776 </span> : /**
<a name="777"><span class="lineNum"> 777 </span> : * Computes the hash of a file stamp.</a>
<span class="lineNum"> 778 </span> : */
<span class="lineNum"> 779 </span><span class="lineCov"> 6126211 : static inline tommy_uint32_t file_stamp_hash(data_off_t size, int64_t mtime_sec, int mtime_nsec)</span>
<span class="lineNum"> 780 </span> : {
<span class="lineNum"> 781 </span><span class="lineCov"> 6126211 : return tommy_inthash_u32((tommy_uint32_t)size ^ tommy_inthash_u32(mtime_sec ^ tommy_inthash_u32(mtime_nsec)));</span>
<a name="782"><span class="lineNum"> 782 </span> : }</a>
<span class="lineNum"> 783 </span> :
<span class="lineNum"> 784 </span><span class="lineCov"> 201121 : static inline int link_flag_has(const struct snapraid_link* link, unsigned mask)</span>
<span class="lineNum"> 785 </span> : {
<span class="lineNum"> 786 </span><span class="lineCov"> 201121 : return (link-&gt;flag &amp; mask) == mask;</span>
<a name="787"><span class="lineNum"> 787 </span> : }</a>
<span class="lineNum"> 788 </span> :
<span class="lineNum"> 789 </span><span class="lineCov"> 34707 : static inline void link_flag_set(struct snapraid_link* link, unsigned mask)</span>
<span class="lineNum"> 790 </span> : {
<span class="lineNum"> 791 </span><span class="lineCov"> 34707 : link-&gt;flag |= mask;</span>
<span class="lineNum"> 792 </span><span class="lineCov"> 34707 : }</span>
<span class="lineNum"> 793 </span> :
<span class="lineNum"> 794 </span> : static inline void link_flag_clear(struct snapraid_link* link, unsigned mask)
<span class="lineNum"> 795 </span> : {
<span class="lineNum"> 796 </span> : link-&gt;flag &amp;= ~mask;
<a name="797"><span class="lineNum"> 797 </span> : }</a>
<span class="lineNum"> 798 </span> :
<span class="lineNum"> 799 </span><span class="lineNoCov"> 0 : static inline void link_flag_let(struct snapraid_link* link, unsigned flag, unsigned mask)</span>
<span class="lineNum"> 800 </span> : {
<span class="lineNum"> 801 </span><span class="lineNoCov"> 0 : link-&gt;flag &amp;= ~mask;</span>
<span class="lineNum"> 802 </span><span class="lineNoCov"> 0 : link-&gt;flag |= flag &amp; mask;</span>
<a name="803"><span class="lineNum"> 803 </span><span class="lineNoCov"> 0 : }</span></a>
<span class="lineNum"> 804 </span> :
<span class="lineNum"> 805 </span><span class="lineCov"> 85930 : static inline unsigned link_flag_get(struct snapraid_link* link, unsigned mask)</span>
<span class="lineNum"> 806 </span> : {
<span class="lineNum"> 807 </span><span class="lineCov"> 85930 : return link-&gt;flag &amp; mask;</span>
<span class="lineNum"> 808 </span> : }
<span class="lineNum"> 809 </span> :
<span class="lineNum"> 810 </span> : /**
<span class="lineNum"> 811 </span> : * Allocates a link.
<span class="lineNum"> 812 </span> : */
<span class="lineNum"> 813 </span> : struct snapraid_link* link_alloc(const char* name, const char* link, unsigned link_flag);
<span class="lineNum"> 814 </span> :
<span class="lineNum"> 815 </span> : /**
<span class="lineNum"> 816 </span> : * Deallocates a link.
<span class="lineNum"> 817 </span> : */
<span class="lineNum"> 818 </span> : void link_free(struct snapraid_link* link);
<span class="lineNum"> 819 </span> :
<span class="lineNum"> 820 </span> : /**
<span class="lineNum"> 821 </span> : * Compare a link with a name.
<span class="lineNum"> 822 </span> : */
<span class="lineNum"> 823 </span> : int link_name_compare_to_arg(const void* void_arg, const void* void_data);
<span class="lineNum"> 824 </span> :
<span class="lineNum"> 825 </span> : /**
<span class="lineNum"> 826 </span> : * Compares links by path.
<span class="lineNum"> 827 </span> : */
<span class="lineNum"> 828 </span> : int link_alpha_compare(const void* void_a, const void* void_b);
<span class="lineNum"> 829 </span> :
<span class="lineNum"> 830 </span> : /**
<a name="831"><span class="lineNum"> 831 </span> : * Computes the hash of a link name.</a>
<span class="lineNum"> 832 </span> : */
<span class="lineNum"> 833 </span><span class="lineCov"> 147610 : static inline tommy_uint32_t link_name_hash(const char* name)</span>
<span class="lineNum"> 834 </span> : {
<span class="lineNum"> 835 </span><span class="lineCov"> 147610 : return tommy_hash_u32(0, name, strlen(name));</span>
<a name="836"><span class="lineNum"> 836 </span> : }</a>
<span class="lineNum"> 837 </span> :
<span class="lineNum"> 838 </span><span class="lineCov"> 860 : static inline int dir_flag_has(const struct snapraid_dir* dir, unsigned mask)</span>
<span class="lineNum"> 839 </span> : {
<span class="lineNum"> 840 </span><span class="lineCov"> 860 : return (dir-&gt;flag &amp; mask) == mask;</span>
<a name="841"><span class="lineNum"> 841 </span> : }</a>
<span class="lineNum"> 842 </span> :
<span class="lineNum"> 843 </span><span class="lineCov"> 227 : static inline void dir_flag_set(struct snapraid_dir* dir, unsigned mask)</span>
<span class="lineNum"> 844 </span> : {
<span class="lineNum"> 845 </span><span class="lineCov"> 227 : dir-&gt;flag |= mask;</span>
<span class="lineNum"> 846 </span><span class="lineCov"> 227 : }</span>
<span class="lineNum"> 847 </span> :
<span class="lineNum"> 848 </span> : static inline void dir_flag_clear(struct snapraid_dir* dir, unsigned mask)
<span class="lineNum"> 849 </span> : {
<span class="lineNum"> 850 </span> : dir-&gt;flag &amp;= ~mask;
<span class="lineNum"> 851 </span> : }
<span class="lineNum"> 852 </span> :
<span class="lineNum"> 853 </span> : /**
<span class="lineNum"> 854 </span> : * Allocates a dir.
<span class="lineNum"> 855 </span> : */
<span class="lineNum"> 856 </span> : struct snapraid_dir* dir_alloc(const char* name);
<span class="lineNum"> 857 </span> :
<span class="lineNum"> 858 </span> : /**
<span class="lineNum"> 859 </span> : * Deallocates a dir.
<span class="lineNum"> 860 </span> : */
<span class="lineNum"> 861 </span> : void dir_free(struct snapraid_dir* dir);
<span class="lineNum"> 862 </span> :
<span class="lineNum"> 863 </span> : /**
<span class="lineNum"> 864 </span> : * Compare a dir with a name.
<span class="lineNum"> 865 </span> : */
<span class="lineNum"> 866 </span> : int dir_name_compare(const void* void_arg, const void* void_data);
<span class="lineNum"> 867 </span> :
<span class="lineNum"> 868 </span> : /**
<a name="869"><span class="lineNum"> 869 </span> : * Computes the hash of a dir name.</a>
<span class="lineNum"> 870 </span> : */
<span class="lineNum"> 871 </span><span class="lineCov"> 979 : static inline tommy_uint32_t dir_name_hash(const char* name)</span>
<span class="lineNum"> 872 </span> : {
<span class="lineNum"> 873 </span><span class="lineCov"> 979 : return tommy_hash_u32(0, name, strlen(name));</span>
<span class="lineNum"> 874 </span> : }
<span class="lineNum"> 875 </span> :
<span class="lineNum"> 876 </span> : /**
<span class="lineNum"> 877 </span> : * Allocates a disk.
<span class="lineNum"> 878 </span> : */
<span class="lineNum"> 879 </span> : struct snapraid_disk* disk_alloc(const char* name, const char* dir, uint64_t dev);
<span class="lineNum"> 880 </span> :
<span class="lineNum"> 881 </span> : /**
<span class="lineNum"> 882 </span> : * Deallocates a disk.
<span class="lineNum"> 883 </span> : */
<span class="lineNum"> 884 </span> : void disk_free(struct snapraid_disk* disk);
<span class="lineNum"> 885 </span> :
<span class="lineNum"> 886 </span> : /**
<span class="lineNum"> 887 </span> : * Gets a specific block of a disk.
<a name="888"><span class="lineNum"> 888 </span> : * Returns 0 if the block is over the end of the disk or not used.</a>
<span class="lineNum"> 889 </span> : */
<span class="lineNum"> 890 </span><span class="lineCov"> 39470278 : static inline struct snapraid_block* disk_block_get(struct snapraid_disk* disk, block_off_t pos)</span>
<span class="lineNum"> 891 </span> : {
<span class="lineNum"> 892 </span><span class="lineCov"> 39470278 : if (pos &lt; tommy_arrayblk_size(&amp;disk-&gt;blockarr))</span>
<span class="lineNum"> 893 </span><span class="lineCov"> 37903017 : return tommy_arrayblk_get(&amp;disk-&gt;blockarr, pos);</span>
<span class="lineNum"> 894 </span> : else
<span class="lineNum"> 895 </span><span class="lineCov"> 1567261 : return BLOCK_EMPTY;</span>
<span class="lineNum"> 896 </span> : }
<span class="lineNum"> 897 </span> :
<span class="lineNum"> 898 </span> : /**
<span class="lineNum"> 899 </span> : * Check if a disk is totally empty and can be discarded from the content file.
<span class="lineNum"> 900 </span> : * A disk is empty if it doesn't contain any file, symlink, hardlink or dir
<span class="lineNum"> 901 </span> : * and without any DELETED block.
<span class="lineNum"> 902 </span> : * The blockmax is used to limit the search of DELETED block up to blockmax.
<span class="lineNum"> 903 </span> : */
<span class="lineNum"> 904 </span> : int disk_is_empty(struct snapraid_disk* disk, block_off_t blockmax);
<span class="lineNum"> 905 </span> :
<span class="lineNum"> 906 </span> : /**
<span class="lineNum"> 907 </span> : * Allocates a disk mapping.
<span class="lineNum"> 908 </span> : * Uses uuid=&quot;&quot; if not available.
<span class="lineNum"> 909 </span> : */
<span class="lineNum"> 910 </span> : struct snapraid_map* map_alloc(const char* name, unsigned position, block_off_t total_blocks, block_off_t free_blocks, const char* uuid);
<span class="lineNum"> 911 </span> :
<span class="lineNum"> 912 </span> : /**
<span class="lineNum"> 913 </span> : * Deallocates a disk mapping.
<span class="lineNum"> 914 </span> : */
<span class="lineNum"> 915 </span> : void map_free(struct snapraid_map* map);
<span class="lineNum"> 916 </span> :
<span class="lineNum"> 917 </span> : /**
<a name="918"><span class="lineNum"> 918 </span> : * Makes an info.</a>
<span class="lineNum"> 919 </span> : */
<span class="lineNum"> 920 </span><span class="lineCov"> 417083 : static inline snapraid_info info_make(time_t last_access, int error, int rehash)</span>
<span class="lineNum"> 921 </span> : {
<span class="lineNum"> 922 </span> : /* clear the lowest bits as reserved for other information */
<span class="lineNum"> 923 </span><span class="lineCov"> 417083 : snapraid_info info = last_access &amp; ~0x3;</span>
<span class="lineNum"> 924 </span> :
<span class="lineNum"> 925 </span><span class="lineCov"> 417083 : if (error != 0)</span>
<span class="lineNum"> 926 </span><span class="lineCov"> 5965 : info |= 0x1;</span>
<span class="lineNum"> 927 </span><span class="lineCov"> 417083 : if (rehash != 0)</span>
<span class="lineNum"> 928 </span><span class="lineCov"> 127352 : info |= 0x2;</span>
<span class="lineNum"> 929 </span><span class="lineCov"> 417083 : return info;</span>
<span class="lineNum"> 930 </span> : }
<span class="lineNum"> 931 </span> :
<span class="lineNum"> 932 </span> : /**
<span class="lineNum"> 933 </span> : * Extracts the time information.
<a name="934"><span class="lineNum"> 934 </span> : * This is the last time when the block was know to be correct.</a>
<span class="lineNum"> 935 </span> : */
<span class="lineNum"> 936 </span><span class="lineCov"> 2510452 : static inline time_t info_get_time(snapraid_info info)</span>
<span class="lineNum"> 937 </span> : {
<span class="lineNum"> 938 </span><span class="lineCov"> 2510452 : return info &amp; ~0x3;</span>
<span class="lineNum"> 939 </span> : }
<span class="lineNum"> 940 </span> :
<span class="lineNum"> 941 </span> : /**
<span class="lineNum"> 942 </span> : * Extracts the error information.
<a name="943"><span class="lineNum"> 943 </span> : * Reports if the block address had some problem.</a>
<span class="lineNum"> 944 </span> : */
<span class="lineNum"> 945 </span><span class="lineCov"> 529647 : static inline int info_get_bad(snapraid_info info)</span>
<span class="lineNum"> 946 </span> : {
<span class="lineNum"> 947 </span><span class="lineCov"> 529647 : return (info &amp; 0x1) != 0;</span>
<span class="lineNum"> 948 </span> : }
<span class="lineNum"> 949 </span> :
<span class="lineNum"> 950 </span> : /**
<span class="lineNum"> 951 </span> : * Extracts the rehash information.
<a name="952"><span class="lineNum"> 952 </span> : * Reports if the block address is using the old hash and needs to be rehashed.</a>
<span class="lineNum"> 953 </span> : */
<span class="lineNum"> 954 </span><span class="lineCov"> 2133210 : static inline int info_get_rehash(snapraid_info info)</span>
<span class="lineNum"> 955 </span> : {
<span class="lineNum"> 956 </span><span class="lineCov"> 2133210 : return (info &amp; 0x2) != 0;</span>
<span class="lineNum"> 957 </span> : }
<span class="lineNum"> 958 </span> :
<span class="lineNum"> 959 </span> : /**
<a name="960"><span class="lineNum"> 960 </span> : * Marks the block address as with error.</a>
<span class="lineNum"> 961 </span> : */
<span class="lineNum"> 962 </span><span class="lineCov"> 1803 : static inline snapraid_info info_set_bad(snapraid_info info)</span>
<span class="lineNum"> 963 </span> : {
<span class="lineNum"> 964 </span><span class="lineCov"> 1803 : return info | 0x1;</span>
<span class="lineNum"> 965 </span> : }
<span class="lineNum"> 966 </span> :
<span class="lineNum"> 967 </span> : /**
<a name="968"><span class="lineNum"> 968 </span> : * Marks the block address as with rehash.</a>
<span class="lineNum"> 969 </span> : */
<span class="lineNum"> 970 </span><span class="lineCov"> 9199 : static inline snapraid_info info_set_rehash(snapraid_info info)</span>
<span class="lineNum"> 971 </span> : {
<span class="lineNum"> 972 </span><span class="lineCov"> 9199 : return info | 0x2;</span>
<span class="lineNum"> 973 </span> : }
<span class="lineNum"> 974 </span> :
<span class="lineNum"> 975 </span> : /**
<span class="lineNum"> 976 </span> : * Sets the info at the specified position.
<a name="977"><span class="lineNum"> 977 </span> : * The position is allocated if not yet done.</a>
<span class="lineNum"> 978 </span> : */
<span class="lineNum"> 979 </span><span class="lineCov"> 1599143 : static inline void info_set(tommy_arrayblkof* array, unsigned pos, snapraid_info info)</span>
<span class="lineNum"> 980 </span> : {
<span class="lineNum"> 981 </span><span class="lineCov"> 1599143 : tommy_arrayblkof_grow(array, pos + 1);</span>
<span class="lineNum"> 982 </span> :
<span class="lineNum"> 983 </span><span class="lineCov"> 1599143 : memcpy(tommy_arrayblkof_ref(array, pos), &amp;info, sizeof(snapraid_info));</span>
<span class="lineNum"> 984 </span><span class="lineCov"> 1599143 : }</span>
<span class="lineNum"> 985 </span> :
<span class="lineNum"> 986 </span> : /**
<span class="lineNum"> 987 </span> : * Gets the info at the specified position.
<a name="988"><span class="lineNum"> 988 </span> : * For not allocated position, 0 is returned.</a>
<span class="lineNum"> 989 </span> : */
<span class="lineNum"> 990 </span><span class="lineCov"> 5183926 : static inline snapraid_info info_get(tommy_arrayblkof* array, unsigned pos)</span>
<span class="lineNum"> 991 </span> : {
<span class="lineNum"> 992 </span> : snapraid_info info;
<span class="lineNum"> 993 </span> :
<span class="lineNum"> 994 </span><span class="lineCov"> 5183926 : if (pos &gt;= tommy_arrayblkof_size(array))</span>
<span class="lineNum"> 995 </span><span class="lineCov"> 308546 : return 0;</span>
<span class="lineNum"> 996 </span> :
<span class="lineNum"> 997 </span><span class="lineCov"> 4875380 : memcpy(&amp;info, tommy_arrayblkof_ref(array, pos), sizeof(snapraid_info));</span>
<span class="lineNum"> 998 </span> :
<span class="lineNum"> 999 </span><span class="lineCov"> 4875380 : return info;</span>
<span class="lineNum"> 1000 </span> : }
<span class="lineNum"> 1001 </span> :
<span class="lineNum"> 1002 </span> : /**
<span class="lineNum"> 1003 </span> : * Compares info by time.
<span class="lineNum"> 1004 </span> : */
<span class="lineNum"> 1005 </span> : int info_time_compare(const void* void_a, const void* void_b);
<span class="lineNum"> 1006 </span> :
<span class="lineNum"> 1007 </span> : #endif
<span class="lineNum"> 1008 </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>