mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
607 lines
61 KiB
HTML
607 lines
61 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/status.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> - status.c<span style="font-size: 80%;"> (source / <a href="status.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">270</td>
|
|
<td class="headerCovTableEntry">283</td>
|
|
<td class="headerCovTableEntryHi">95.4 %</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">3</td>
|
|
<td class="headerCovTableEntry">3</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<a name="1"><span class="lineNum"> 1 </span> : /*</a>
|
|
<span class="lineNum"> 2 </span> : * Copyright (C) 2013 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 "support.h"
|
|
<span class="lineNum"> 21 </span> : #include "elem.h"
|
|
<span class="lineNum"> 22 </span> : #include "state.h"
|
|
<span class="lineNum"> 23 </span> : #include "parity.h"
|
|
<span class="lineNum"> 24 </span> : #include "handle.h"
|
|
<span class="lineNum"> 25 </span> : #include "raid/raid.h"
|
|
<span class="lineNum"> 26 </span> :
|
|
<span class="lineNum"> 27 </span> : /****************************************************************************/
|
|
<a name="28"><span class="lineNum"> 28 </span> : /* status */</a>
|
|
<span class="lineNum"> 29 </span> :
|
|
<span class="lineNum"> 30 </span><span class="lineCov"> 27 : unsigned day_ago(time_t ref, time_t now)</span>
|
|
<span class="lineNum"> 31 </span> : {
|
|
<span class="lineNum"> 32 </span><span class="lineCov"> 27 : return (now - ref) / (24 * 3600);</span>
|
|
<span class="lineNum"> 33 </span> : }
|
|
<span class="lineNum"> 34 </span> :
|
|
<span class="lineNum"> 35 </span> : #define GRAPH_COLUMN 70
|
|
<a name="36"><span class="lineNum"> 36 </span> : #define GRAPH_ROW 15</a>
|
|
<span class="lineNum"> 37 </span> :
|
|
<span class="lineNum"> 38 </span><span class="lineCov"> 68 : static unsigned perc(uint64_t part, uint64_t total)</span>
|
|
<span class="lineNum"> 39 </span> : {
|
|
<span class="lineNum"> 40 </span><span class="lineCov"> 68 : if (!total)</span>
|
|
<span class="lineNum"> 41 </span><span class="lineCov"> 6 : return 0;</span>
|
|
<span class="lineNum"> 42 </span> :
|
|
<span class="lineNum"> 43 </span><span class="lineCov"> 62 : return (unsigned)(part * 100 / total);</span>
|
|
<span class="lineNum"> 44 </span> : }
|
|
<span class="lineNum"> 45 </span> :
|
|
<span class="lineNum"> 46 </span> : /**
|
|
<span class="lineNum"> 47 </span> : * Bit used to mark unscrubbed time info.
|
|
<span class="lineNum"> 48 </span> : */
|
|
<a name="49"><span class="lineNum"> 49 </span> : #define TIME_NEW 1</a>
|
|
<span class="lineNum"> 50 </span> :
|
|
<span class="lineNum"> 51 </span><span class="lineCov"> 15 : int state_status(struct snapraid_state* state)</span>
|
|
<span class="lineNum"> 52 </span> : {
|
|
<span class="lineNum"> 53 </span> : block_off_t blockmax;
|
|
<span class="lineNum"> 54 </span> : block_off_t i;
|
|
<span class="lineNum"> 55 </span> : time_t* timemap;
|
|
<span class="lineNum"> 56 </span> : time_t now;
|
|
<span class="lineNum"> 57 </span> : block_off_t bad;
|
|
<span class="lineNum"> 58 </span> : block_off_t bad_first;
|
|
<span class="lineNum"> 59 </span> : block_off_t bad_last;
|
|
<span class="lineNum"> 60 </span> : block_off_t rehash;
|
|
<span class="lineNum"> 61 </span> : block_off_t count;
|
|
<span class="lineNum"> 62 </span> : unsigned l;
|
|
<span class="lineNum"> 63 </span> : unsigned dayoldest, daymedian, daynewest;
|
|
<span class="lineNum"> 64 </span> : unsigned bar_scrubbed[GRAPH_COLUMN];
|
|
<span class="lineNum"> 65 </span> : unsigned bar_new[GRAPH_COLUMN];
|
|
<span class="lineNum"> 66 </span> : unsigned barpos;
|
|
<span class="lineNum"> 67 </span> : unsigned barmax;
|
|
<span class="lineNum"> 68 </span> : time_t oldest, newest, median;
|
|
<span class="lineNum"> 69 </span> : unsigned x, y;
|
|
<span class="lineNum"> 70 </span> : tommy_node* node_disk;
|
|
<span class="lineNum"> 71 </span> : unsigned file_count;
|
|
<span class="lineNum"> 72 </span> : unsigned file_fragmented;
|
|
<span class="lineNum"> 73 </span> : unsigned extra_fragment;
|
|
<span class="lineNum"> 74 </span> : unsigned file_zerosubsecond;
|
|
<span class="lineNum"> 75 </span> : uint64_t file_size;
|
|
<span class="lineNum"> 76 </span> : uint64_t file_block_count;
|
|
<span class="lineNum"> 77 </span> : uint64_t file_block_free;
|
|
<span class="lineNum"> 78 </span> : block_off_t parity_block_free;
|
|
<span class="lineNum"> 79 </span> : unsigned unsynced_blocks;
|
|
<span class="lineNum"> 80 </span> : unsigned unscrubbed_blocks;
|
|
<span class="lineNum"> 81 </span> : uint64_t all_wasted;
|
|
<span class="lineNum"> 82 </span> : int free_not_zero;
|
|
<span class="lineNum"> 83 </span> :
|
|
<span class="lineNum"> 84 </span> : /* get the present time */
|
|
<span class="lineNum"> 85 </span><span class="lineCov"> 15 : now = time(0);</span>
|
|
<span class="lineNum"> 86 </span> :
|
|
<span class="lineNum"> 87 </span> : /* keep track if at least a free info is available */
|
|
<span class="lineNum"> 88 </span><span class="lineCov"> 15 : free_not_zero = 0;</span>
|
|
<span class="lineNum"> 89 </span> :
|
|
<span class="lineNum"> 90 </span><span class="lineCov"> 15 : blockmax = parity_allocated_size(state);</span>
|
|
<span class="lineNum"> 91 </span> :
|
|
<span class="lineNum"> 92 </span><span class="lineCov"> 15 : log_tag("summary:block_size:%u\n", state->block_size);</span>
|
|
<span class="lineNum"> 93 </span><span class="lineCov"> 15 : log_tag("summary:parity_block_count:%u\n", blockmax);</span>
|
|
<span class="lineNum"> 94 </span> :
|
|
<span class="lineNum"> 95 </span> : /* get the minimum parity free space */
|
|
<span class="lineNum"> 96 </span><span class="lineCov"> 15 : parity_block_free = state->parity[0].free_blocks;</span>
|
|
<span class="lineNum"> 97 </span><span class="lineCov"> 105 : for (l = 0; l < state->level; ++l) {</span>
|
|
<span class="lineNum"> 98 </span><span class="lineCov"> 90 : log_tag("summary:parity_block_total:%s:%u\n", lev_config_name(l), state->parity[l].total_blocks);</span>
|
|
<span class="lineNum"> 99 </span><span class="lineCov"> 90 : log_tag("summary:parity_block_free:%s:%u\n", lev_config_name(l), state->parity[l].free_blocks);</span>
|
|
<span class="lineNum"> 100 </span><span class="lineCov"> 90 : if (state->parity[l].free_blocks < parity_block_free)</span>
|
|
<span class="lineNum"> 101 </span><span class="lineCov"> 1 : parity_block_free = state->parity[l].free_blocks;</span>
|
|
<span class="lineNum"> 102 </span><span class="lineCov"> 90 : if (state->parity[l].free_blocks != 0)</span>
|
|
<span class="lineNum"> 103 </span><span class="lineCov"> 79 : free_not_zero = 1;</span>
|
|
<span class="lineNum"> 104 </span> : }
|
|
<span class="lineNum"> 105 </span><span class="lineCov"> 15 : log_tag("summary:parity_block_free_min:%u\n", parity_block_free);</span>
|
|
<span class="lineNum"> 106 </span> :
|
|
<span class="lineNum"> 107 </span><span class="lineCov"> 15 : printf("SnapRAID status report:\n");</span>
|
|
<span class="lineNum"> 108 </span><span class="lineCov"> 15 : printf("\n");</span>
|
|
<span class="lineNum"> 109 </span><span class="lineCov"> 15 : printf(" Files Fragmented Excess Wasted Used Free Use Name\n");</span>
|
|
<span class="lineNum"> 110 </span><span class="lineCov"> 15 : printf(" Files Fragments GB GB GB\n");</span>
|
|
<span class="lineNum"> 111 </span> :
|
|
<span class="lineNum"> 112 </span> : /* count fragments */
|
|
<span class="lineNum"> 113 </span><span class="lineCov"> 15 : file_count = 0;</span>
|
|
<span class="lineNum"> 114 </span><span class="lineCov"> 15 : file_size = 0;</span>
|
|
<span class="lineNum"> 115 </span><span class="lineCov"> 15 : file_block_count = 0;</span>
|
|
<span class="lineNum"> 116 </span><span class="lineCov"> 15 : file_block_free = 0;</span>
|
|
<span class="lineNum"> 117 </span><span class="lineCov"> 15 : file_fragmented = 0;</span>
|
|
<span class="lineNum"> 118 </span><span class="lineCov"> 15 : extra_fragment = 0;</span>
|
|
<span class="lineNum"> 119 </span><span class="lineCov"> 15 : file_zerosubsecond = 0;</span>
|
|
<span class="lineNum"> 120 </span><span class="lineCov"> 15 : all_wasted = 0;</span>
|
|
<span class="lineNum"> 121 </span><span class="lineCov"> 105 : for (node_disk = state->disklist; node_disk != 0; node_disk = node_disk->next) {</span>
|
|
<span class="lineNum"> 122 </span><span class="lineCov"> 90 : struct snapraid_disk* disk = node_disk->data;</span>
|
|
<span class="lineNum"> 123 </span> : tommy_node* node;
|
|
<span class="lineNum"> 124 </span> : block_off_t j;
|
|
<span class="lineNum"> 125 </span><span class="lineCov"> 90 : unsigned disk_file_count = 0;</span>
|
|
<span class="lineNum"> 126 </span><span class="lineCov"> 90 : unsigned disk_file_fragmented = 0;</span>
|
|
<span class="lineNum"> 127 </span><span class="lineCov"> 90 : unsigned disk_extra_fragment = 0;</span>
|
|
<span class="lineNum"> 128 </span><span class="lineCov"> 90 : unsigned disk_file_zerosubsecond = 0;</span>
|
|
<span class="lineNum"> 129 </span><span class="lineCov"> 90 : block_off_t disk_block_count = 0;</span>
|
|
<span class="lineNum"> 130 </span><span class="lineCov"> 90 : uint64_t disk_file_size = 0;</span>
|
|
<span class="lineNum"> 131 </span><span class="lineCov"> 90 : block_off_t disk_block_latest_used = 0;</span>
|
|
<span class="lineNum"> 132 </span> : block_off_t disk_block_max_by_space;
|
|
<span class="lineNum"> 133 </span> : block_off_t disk_block_max_by_parity;
|
|
<span class="lineNum"> 134 </span> : block_off_t disk_block_max;
|
|
<span class="lineNum"> 135 </span> : int64_t wasted;
|
|
<span class="lineNum"> 136 </span> :
|
|
<span class="lineNum"> 137 </span> : /* for each file in the disk */
|
|
<span class="lineNum"> 138 </span><span class="lineCov"> 90 : node = disk->filelist;</span>
|
|
<span class="lineNum"> 139 </span><span class="lineCov"> 95714 : while (node) {</span>
|
|
<span class="lineNum"> 140 </span> : struct snapraid_file* file;
|
|
<span class="lineNum"> 141 </span> :
|
|
<span class="lineNum"> 142 </span><span class="lineCov"> 95534 : file = node->data;</span>
|
|
<span class="lineNum"> 143 </span><span class="lineCov"> 95534 : node = node->next; /* next node */</span>
|
|
<span class="lineNum"> 144 </span> :
|
|
<span class="lineNum"> 145 </span><span class="lineCov"> 95534 : if (file->mtime_nsec == STAT_NSEC_INVALID</span>
|
|
<span class="lineNum"> 146 </span><span class="lineCov"> 95534 : || file->mtime_nsec == 0</span>
|
|
<span class="lineNum"> 147 </span> : ) {
|
|
<span class="lineNum"> 148 </span><span class="lineNoCov"> 0 : ++file_zerosubsecond;</span>
|
|
<span class="lineNum"> 149 </span><span class="lineNoCov"> 0 : ++disk_file_zerosubsecond;</span>
|
|
<span class="lineNum"> 150 </span><span class="lineNoCov"> 0 : if (disk_file_zerosubsecond < 50)</span>
|
|
<span class="lineNum"> 151 </span><span class="lineNoCov"> 0 : log_tag("zerosubsecond:%s:%s: \n", disk->name, file->sub);</span>
|
|
<span class="lineNum"> 152 </span><span class="lineNoCov"> 0 : if (disk_file_zerosubsecond == 50)</span>
|
|
<span class="lineNum"> 153 </span><span class="lineNoCov"> 0 : log_tag("zerosubsecond:%s:%s: (more follow)\n", disk->name, file->sub);</span>
|
|
<span class="lineNum"> 154 </span> : }
|
|
<span class="lineNum"> 155 </span> :
|
|
<span class="lineNum"> 156 </span> : /* check fragmentation */
|
|
<span class="lineNum"> 157 </span><span class="lineCov"> 95534 : if (file->blockmax != 0) {</span>
|
|
<span class="lineNum"> 158 </span> : block_off_t prev_pos;
|
|
<span class="lineNum"> 159 </span> : block_off_t last_pos;
|
|
<span class="lineNum"> 160 </span> : int fragmented;
|
|
<span class="lineNum"> 161 </span> :
|
|
<span class="lineNum"> 162 </span><span class="lineCov"> 95396 : fragmented = 0;</span>
|
|
<span class="lineNum"> 163 </span><span class="lineCov"> 95396 : prev_pos = fs_file2par_get(disk, file, 0);</span>
|
|
<span class="lineNum"> 164 </span><span class="lineCov"> 235735 : for (j = 1; j < file->blockmax; ++j) {</span>
|
|
<span class="lineNum"> 165 </span><span class="lineCov"> 140339 : block_off_t parity_pos = fs_file2par_get(disk, file, j);</span>
|
|
<span class="lineNum"> 166 </span><span class="lineCov"> 140339 : if (prev_pos + 1 != parity_pos) {</span>
|
|
<span class="lineNum"> 167 </span><span class="lineCov"> 698 : fragmented = 1;</span>
|
|
<span class="lineNum"> 168 </span><span class="lineCov"> 698 : ++extra_fragment;</span>
|
|
<span class="lineNum"> 169 </span><span class="lineCov"> 698 : ++disk_extra_fragment;</span>
|
|
<span class="lineNum"> 170 </span> : }
|
|
<span class="lineNum"> 171 </span><span class="lineCov"> 140339 : prev_pos = parity_pos;</span>
|
|
<span class="lineNum"> 172 </span> : }
|
|
<span class="lineNum"> 173 </span> :
|
|
<span class="lineNum"> 174 </span> : /* keep track of latest block used */
|
|
<span class="lineNum"> 175 </span><span class="lineCov"> 95396 : last_pos = fs_file2par_get(disk, file, file->blockmax - 1);</span>
|
|
<span class="lineNum"> 176 </span><span class="lineCov"> 95396 : if (last_pos > disk_block_latest_used) {</span>
|
|
<span class="lineNum"> 177 </span><span class="lineCov"> 92537 : disk_block_latest_used = last_pos;</span>
|
|
<span class="lineNum"> 178 </span> : }
|
|
<span class="lineNum"> 179 </span> :
|
|
<span class="lineNum"> 180 </span><span class="lineCov"> 95396 : if (fragmented) {</span>
|
|
<span class="lineNum"> 181 </span><span class="lineCov"> 582 : ++file_fragmented;</span>
|
|
<span class="lineNum"> 182 </span><span class="lineCov"> 582 : ++disk_file_fragmented;</span>
|
|
<span class="lineNum"> 183 </span> : }
|
|
<span class="lineNum"> 184 </span> :
|
|
<span class="lineNum"> 185 </span><span class="lineCov"> 95396 : disk_block_count += file->blockmax;</span>
|
|
<span class="lineNum"> 186 </span> : }
|
|
<span class="lineNum"> 187 </span> :
|
|
<span class="lineNum"> 188 </span> : /* count files */
|
|
<span class="lineNum"> 189 </span><span class="lineCov"> 95534 : ++file_count;</span>
|
|
<span class="lineNum"> 190 </span><span class="lineCov"> 95534 : ++disk_file_count;</span>
|
|
<span class="lineNum"> 191 </span><span class="lineCov"> 95534 : file_size += file->size;</span>
|
|
<span class="lineNum"> 192 </span><span class="lineCov"> 95534 : file_block_count += file->blockmax;</span>
|
|
<span class="lineNum"> 193 </span><span class="lineCov"> 95534 : disk_file_size += file->size;</span>
|
|
<span class="lineNum"> 194 </span> : }
|
|
<span class="lineNum"> 195 </span> :
|
|
<span class="lineNum"> 196 </span><span class="lineCov"> 90 : if (disk->free_blocks != 0)</span>
|
|
<span class="lineNum"> 197 </span><span class="lineCov"> 53 : free_not_zero = 1;</span>
|
|
<span class="lineNum"> 198 </span> :
|
|
<span class="lineNum"> 199 </span> : /* get the free block info */
|
|
<span class="lineNum"> 200 </span><span class="lineCov"> 90 : disk_block_max_by_space = disk_block_count + disk->free_blocks;</span>
|
|
<span class="lineNum"> 201 </span><span class="lineCov"> 90 : disk_block_max_by_parity = blockmax + parity_block_free;</span>
|
|
<span class="lineNum"> 202 </span> :
|
|
<span class="lineNum"> 203 </span> : /* the maximum usable space in a disk is limited by the smallest */
|
|
<span class="lineNum"> 204 </span> : /* of the disk size and the parity size */
|
|
<span class="lineNum"> 205 </span> : /* the wasted space is the space that we have to leave */
|
|
<span class="lineNum"> 206 </span> : /* free on the data disk, when the parity is filled up */
|
|
<span class="lineNum"> 207 </span><span class="lineCov"> 90 : if (disk_block_max_by_space < disk_block_max_by_parity) {</span>
|
|
<span class="lineNum"> 208 </span><span class="lineCov"> 78 : disk_block_max = disk_block_max_by_space;</span>
|
|
<span class="lineNum"> 209 </span> : } else {
|
|
<span class="lineNum"> 210 </span><span class="lineCov"> 12 : disk_block_max = disk_block_max_by_parity;</span>
|
|
<span class="lineNum"> 211 </span> : }
|
|
<span class="lineNum"> 212 </span> :
|
|
<span class="lineNum"> 213 </span> : /* wasted space is the difference of the two maximum size */
|
|
<span class="lineNum"> 214 </span> : /* if negative, it's extra space available in parity */
|
|
<span class="lineNum"> 215 </span><span class="lineCov"> 90 : wasted = (int64_t)disk_block_max_by_space - (int64_t)disk_block_max_by_parity;</span>
|
|
<span class="lineNum"> 216 </span><span class="lineCov"> 90 : wasted *= state->block_size;</span>
|
|
<span class="lineNum"> 217 </span> :
|
|
<span class="lineNum"> 218 </span><span class="lineCov"> 90 : if (wasted > 0)</span>
|
|
<span class="lineNum"> 219 </span><span class="lineCov"> 6 : all_wasted += wasted;</span>
|
|
<span class="lineNum"> 220 </span><span class="lineCov"> 90 : file_block_free += disk_block_max - disk_block_count;</span>
|
|
<span class="lineNum"> 221 </span> :
|
|
<span class="lineNum"> 222 </span><span class="lineCov"> 90 : printf("%8u", disk_file_count);</span>
|
|
<span class="lineNum"> 223 </span><span class="lineCov"> 90 : printf("%8u", disk_file_fragmented);</span>
|
|
<span class="lineNum"> 224 </span><span class="lineCov"> 90 : printf("%8u", disk_extra_fragment);</span>
|
|
<span class="lineNum"> 225 </span><span class="lineCov"> 90 : if (wasted < -100LL * GIGA) {</span>
|
|
<span class="lineNum"> 226 </span><span class="lineCov"> 78 : printf(" -");</span>
|
|
<span class="lineNum"> 227 </span> : } else {
|
|
<span class="lineNum"> 228 </span><span class="lineCov"> 12 : printf("%8.1f", (double)wasted / GIGA);</span>
|
|
<span class="lineNum"> 229 </span> : }
|
|
<span class="lineNum"> 230 </span><span class="lineCov"> 90 : printf("%8" PRIu64, disk_file_size / GIGA);</span>
|
|
<span class="lineNum"> 231 </span> :
|
|
<span class="lineNum"> 232 </span><span class="lineCov"> 90 : if (disk_block_max == 0 && disk_block_count == 0) {</span>
|
|
<span class="lineNum"> 233 </span> : /* if the disk is empty and we don't have the free space info */
|
|
<span class="lineNum"> 234 </span><span class="lineCov"> 37 : printf(" -");</span>
|
|
<span class="lineNum"> 235 </span><span class="lineCov"> 37 : printf(" - ");</span>
|
|
<span class="lineNum"> 236 </span> : } else {
|
|
<span class="lineNum"> 237 </span><span class="lineCov"> 53 : printf("%8" PRIu64, (disk_block_max - disk_block_count) * (uint64_t)state->block_size / GIGA);</span>
|
|
<span class="lineNum"> 238 </span><span class="lineCov"> 53 : printf(" %3u%%", perc(disk_block_count, disk_block_max));</span>
|
|
<span class="lineNum"> 239 </span> : }
|
|
<span class="lineNum"> 240 </span><span class="lineCov"> 90 : printf(" %s\n", disk->name);</span>
|
|
<span class="lineNum"> 241 </span> :
|
|
<span class="lineNum"> 242 </span><span class="lineCov"> 90 : log_tag("summary:disk_file_count:%s:%u\n", disk->name, disk_file_count);</span>
|
|
<span class="lineNum"> 243 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_count:%s:%u\n", disk->name, disk_block_count);</span>
|
|
<span class="lineNum"> 244 </span><span class="lineCov"> 90 : log_tag("summary:disk_fragmented_file_count:%s:%u\n", disk->name, disk_file_fragmented);</span>
|
|
<span class="lineNum"> 245 </span><span class="lineCov"> 90 : log_tag("summary:disk_excess_fragment_count:%s:%u\n", disk->name, disk_extra_fragment);</span>
|
|
<span class="lineNum"> 246 </span><span class="lineCov"> 90 : log_tag("summary:disk_zerosubsecond_file_count:%s:%u\n", disk->name, disk_file_zerosubsecond);</span>
|
|
<span class="lineNum"> 247 </span><span class="lineCov"> 90 : log_tag("summary:disk_file_size:%s:%" PRIu64 "\n", disk->name, disk_file_size);</span>
|
|
<span class="lineNum"> 248 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_allocated:%s:%u\n", disk->name, disk_block_latest_used + 1);</span>
|
|
<span class="lineNum"> 249 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_total:%s:%u\n", disk->name, disk->total_blocks);</span>
|
|
<span class="lineNum"> 250 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_free:%s:%u\n", disk->name, disk->free_blocks);</span>
|
|
<span class="lineNum"> 251 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_max_by_space:%s:%u\n", disk->name, disk_block_max_by_space);</span>
|
|
<span class="lineNum"> 252 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_max_by_parity:%s:%u\n", disk->name, disk_block_max_by_parity);</span>
|
|
<span class="lineNum"> 253 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_max:%s:%u\n", disk->name, disk_block_max);</span>
|
|
<span class="lineNum"> 254 </span><span class="lineCov"> 90 : log_tag("summary:disk_space_wasted:%s:%" PRId64 "\n", disk->name, wasted);</span>
|
|
<span class="lineNum"> 255 </span> : }
|
|
<span class="lineNum"> 256 </span> :
|
|
<span class="lineNum"> 257 </span> : /* totals */
|
|
<span class="lineNum"> 258 </span><span class="lineCov"> 15 : printf(" --------------------------------------------------------------------------\n");</span>
|
|
<span class="lineNum"> 259 </span><span class="lineCov"> 15 : printf("%8u", file_count);</span>
|
|
<span class="lineNum"> 260 </span><span class="lineCov"> 15 : printf("%8u", file_fragmented);</span>
|
|
<span class="lineNum"> 261 </span><span class="lineCov"> 15 : printf("%8u", extra_fragment);</span>
|
|
<span class="lineNum"> 262 </span><span class="lineCov"> 15 : printf("%8.1f", (double)all_wasted / GIGA);</span>
|
|
<span class="lineNum"> 263 </span><span class="lineCov"> 15 : printf("%8" PRIu64, file_size / GIGA);</span>
|
|
<span class="lineNum"> 264 </span><span class="lineCov"> 15 : printf("%8" PRIu64, file_block_free * state->block_size / GIGA);</span>
|
|
<span class="lineNum"> 265 </span><span class="lineCov"> 15 : printf(" %3u%%", perc(file_block_count, file_block_count + file_block_free));</span>
|
|
<span class="lineNum"> 266 </span><span class="lineCov"> 15 : printf("\n");</span>
|
|
<span class="lineNum"> 267 </span> :
|
|
<span class="lineNum"> 268 </span> : /* warn about invalid data free info */
|
|
<span class="lineNum"> 269 </span><span class="lineCov"> 15 : if (!free_not_zero)</span>
|
|
<span class="lineNum"> 270 </span><span class="lineCov"> 1 : printf("\nWARNING! Free space info will be valid after the first sync.\n");</span>
|
|
<span class="lineNum"> 271 </span> :
|
|
<span class="lineNum"> 272 </span><span class="lineCov"> 15 : log_tag("summary:file_count:%u\n", file_count);</span>
|
|
<span class="lineNum"> 273 </span><span class="lineCov"> 15 : log_tag("summary:file_block_count:%" PRIu64 "\n", file_block_count);</span>
|
|
<span class="lineNum"> 274 </span><span class="lineCov"> 15 : log_tag("summary:fragmented_file_count:%u\n", file_fragmented);</span>
|
|
<span class="lineNum"> 275 </span><span class="lineCov"> 15 : log_tag("summary:excess_fragment_count:%u\n", extra_fragment);</span>
|
|
<span class="lineNum"> 276 </span><span class="lineCov"> 15 : log_tag("summary:zerosubsecond_file_count:%u\n", file_zerosubsecond);</span>
|
|
<span class="lineNum"> 277 </span><span class="lineCov"> 15 : log_tag("summary:file_size:%" PRIu64 "\n", file_size);</span>
|
|
<span class="lineNum"> 278 </span><span class="lineCov"> 15 : log_tag("summary:parity_size:%" PRIu64 "\n", blockmax * (uint64_t)state->block_size);</span>
|
|
<span class="lineNum"> 279 </span><span class="lineCov"> 15 : log_tag("summary:parity_size_max:%" PRIu64 "\n", (blockmax + parity_block_free) * (uint64_t)state->block_size);</span>
|
|
<span class="lineNum"> 280 </span><span class="lineCov"> 15 : log_tag("summary:hash:%s\n", hash_config_name(state->hash));</span>
|
|
<span class="lineNum"> 281 </span><span class="lineCov"> 15 : log_tag("summary:prev_hash:%s\n", hash_config_name(state->prevhash));</span>
|
|
<span class="lineNum"> 282 </span><span class="lineCov"> 15 : log_tag("summary:best_hash:%s\n", hash_config_name(state->besthash));</span>
|
|
<span class="lineNum"> 283 </span><span class="lineCov"> 15 : log_flush();</span>
|
|
<span class="lineNum"> 284 </span> :
|
|
<span class="lineNum"> 285 </span> : /* copy the info a temp vector, and count bad/rehash/unsynced blocks */
|
|
<span class="lineNum"> 286 </span><span class="lineCov"> 15 : timemap = malloc_nofail(blockmax * sizeof(time_t));</span>
|
|
<span class="lineNum"> 287 </span><span class="lineCov"> 15 : bad = 0;</span>
|
|
<span class="lineNum"> 288 </span><span class="lineCov"> 15 : bad_first = 0;</span>
|
|
<span class="lineNum"> 289 </span><span class="lineCov"> 15 : bad_last = 0;</span>
|
|
<span class="lineNum"> 290 </span><span class="lineCov"> 15 : count = 0;</span>
|
|
<span class="lineNum"> 291 </span><span class="lineCov"> 15 : rehash = 0;</span>
|
|
<span class="lineNum"> 292 </span><span class="lineCov"> 15 : unsynced_blocks = 0;</span>
|
|
<span class="lineNum"> 293 </span><span class="lineCov"> 15 : unscrubbed_blocks = 0;</span>
|
|
<span class="lineNum"> 294 </span><span class="lineCov"> 15 : log_tag("block_count:%u\n", blockmax);</span>
|
|
<span class="lineNum"> 295 </span><span class="lineCov"> 39823 : for (i = 0; i < blockmax; ++i) {</span>
|
|
<span class="lineNum"> 296 </span> : int one_invalid;
|
|
<span class="lineNum"> 297 </span> : int one_valid;
|
|
<span class="lineNum"> 298 </span> :
|
|
<span class="lineNum"> 299 </span><span class="lineCov"> 39808 : snapraid_info info = info_get(&state->infoarr, i);</span>
|
|
<span class="lineNum"> 300 </span> :
|
|
<span class="lineNum"> 301 </span> : /* for each disk */
|
|
<span class="lineNum"> 302 </span><span class="lineCov"> 39808 : one_invalid = 0;</span>
|
|
<span class="lineNum"> 303 </span><span class="lineCov"> 39808 : one_valid = 0;</span>
|
|
<span class="lineNum"> 304 </span><span class="lineCov"> 278656 : for (node_disk = state->disklist; node_disk != 0; node_disk = node_disk->next) {</span>
|
|
<span class="lineNum"> 305 </span><span class="lineCov"> 238848 : struct snapraid_disk* disk = node_disk->data;</span>
|
|
<span class="lineNum"> 306 </span><span class="lineCov"> 238848 : struct snapraid_block* block = fs_par2block_find(disk, i);</span>
|
|
<span class="lineNum"> 307 </span> :
|
|
<span class="lineNum"> 308 </span><span class="lineCov"> 238848 : if (block_has_file(block))</span>
|
|
<span class="lineNum"> 309 </span><span class="lineCov"> 235735 : one_valid = 1;</span>
|
|
<span class="lineNum"> 310 </span><span class="lineCov"> 238848 : if (block_has_invalid_parity(block))</span>
|
|
<span class="lineNum"> 311 </span><span class="lineCov"> 56 : one_invalid = 1;</span>
|
|
<span class="lineNum"> 312 </span> : }
|
|
<span class="lineNum"> 313 </span> :
|
|
<span class="lineNum"> 314 </span> : /* if both valid and invalid, we need to update */
|
|
<span class="lineNum"> 315 </span><span class="lineCov"> 39808 : if (one_invalid && one_valid) {</span>
|
|
<span class="lineNum"> 316 </span><span class="lineCov"> 40 : ++unsynced_blocks;</span>
|
|
<span class="lineNum"> 317 </span> : }
|
|
<span class="lineNum"> 318 </span> :
|
|
<span class="lineNum"> 319 </span> : /* skip unused blocks */
|
|
<span class="lineNum"> 320 </span><span class="lineCov"> 39808 : if (info != 0) {</span>
|
|
<span class="lineNum"> 321 </span> : time_t scrub_time;
|
|
<span class="lineNum"> 322 </span> :
|
|
<span class="lineNum"> 323 </span><span class="lineCov"> 39808 : if (info_get_bad(info)) {</span>
|
|
<span class="lineNum"> 324 </span><span class="lineCov"> 1772 : if (bad == 0)</span>
|
|
<span class="lineNum"> 325 </span><span class="lineCov"> 2 : bad_first = i;</span>
|
|
<span class="lineNum"> 326 </span><span class="lineCov"> 1772 : bad_last = i;</span>
|
|
<span class="lineNum"> 327 </span><span class="lineCov"> 1772 : ++bad;</span>
|
|
<span class="lineNum"> 328 </span> : }
|
|
<span class="lineNum"> 329 </span> :
|
|
<span class="lineNum"> 330 </span><span class="lineCov"> 39808 : if (info_get_rehash(info))</span>
|
|
<span class="lineNum"> 331 </span><span class="lineCov"> 4607 : ++rehash;</span>
|
|
<span class="lineNum"> 332 </span> :
|
|
<span class="lineNum"> 333 </span><span class="lineCov"> 39808 : scrub_time = info_get_time(info);</span>
|
|
<span class="lineNum"> 334 </span> :
|
|
<span class="lineNum"> 335 </span><span class="lineCov"> 39808 : if (info_get_justsynced(info)) {</span>
|
|
<span class="lineNum"> 336 </span><span class="lineCov"> 20516 : ++unscrubbed_blocks;</span>
|
|
<span class="lineNum"> 337 </span> :
|
|
<span class="lineNum"> 338 </span> : /* mark the time as not scrubbed */
|
|
<span class="lineNum"> 339 </span><span class="lineCov"> 20516 : scrub_time |= TIME_NEW;</span>
|
|
<span class="lineNum"> 340 </span> : }
|
|
<span class="lineNum"> 341 </span> :
|
|
<span class="lineNum"> 342 </span><span class="lineCov"> 39808 : timemap[count++] = scrub_time;</span>
|
|
<span class="lineNum"> 343 </span> : }
|
|
<span class="lineNum"> 344 </span> :
|
|
<span class="lineNum"> 345 </span><span class="lineCov"> 39808 : if (state->opt.gui) {</span>
|
|
<span class="lineNum"> 346 </span><span class="lineNoCov"> 0 : if (info != 0)</span>
|
|
<span class="lineNum"> 347 </span><span class="lineNoCov"> 0 : log_tag("block:%u:%" PRIu64 ":%s:%s:%s:%s\n", i, (uint64_t)info_get_time(info), one_valid ? "used" : "", one_invalid ? "unsynced" : "", info_get_bad(info) ? "bad" : "", info_get_rehash(info) ? "rehash" : "");</span>
|
|
<span class="lineNum"> 348 </span> : else
|
|
<span class="lineNum"> 349 </span><span class="lineNoCov"> 0 : log_tag("block_noinfo:%u:%s:%s\n", i, one_valid ? "used" : "", one_invalid ? "unsynced" : "");</span>
|
|
<span class="lineNum"> 350 </span> : }
|
|
<span class="lineNum"> 351 </span> : }
|
|
<span class="lineNum"> 352 </span> :
|
|
<span class="lineNum"> 353 </span><span class="lineCov"> 15 : log_tag("summary:has_unsynced:%u\n", unsynced_blocks);</span>
|
|
<span class="lineNum"> 354 </span><span class="lineCov"> 15 : log_tag("summary:has_unscrubbed:%u\n", unscrubbed_blocks);</span>
|
|
<span class="lineNum"> 355 </span><span class="lineCov"> 15 : log_tag("summary:has_rehash:%u\n", rehash);</span>
|
|
<span class="lineNum"> 356 </span><span class="lineCov"> 15 : log_tag("summary:has_bad:%u:%u:%u\n", bad, bad_first, bad_last);</span>
|
|
<span class="lineNum"> 357 </span><span class="lineCov"> 15 : log_flush();</span>
|
|
<span class="lineNum"> 358 </span> :
|
|
<span class="lineNum"> 359 </span><span class="lineCov"> 15 : if (!count) {</span>
|
|
<span class="lineNum"> 360 </span><span class="lineCov"> 6 : log_fatal("The array is empty.\n");</span>
|
|
<span class="lineNum"> 361 </span><span class="lineCov"> 6 : free(timemap);</span>
|
|
<span class="lineNum"> 362 </span><span class="lineCov"> 6 : return 0;</span>
|
|
<span class="lineNum"> 363 </span> : }
|
|
<span class="lineNum"> 364 </span> :
|
|
<span class="lineNum"> 365 </span> : /* sort the info to get the time info */
|
|
<span class="lineNum"> 366 </span><span class="lineCov"> 9 : qsort(timemap, count, sizeof(time_t), time_compare);</span>
|
|
<span class="lineNum"> 367 </span> :
|
|
<span class="lineNum"> 368 </span> : /* output the info map */
|
|
<span class="lineNum"> 369 </span><span class="lineCov"> 9 : i = 0;</span>
|
|
<span class="lineNum"> 370 </span><span class="lineCov"> 9 : log_tag("info_count:%u\n", count);</span>
|
|
<span class="lineNum"> 371 </span><span class="lineCov"> 40 : while (i < count) {</span>
|
|
<span class="lineNum"> 372 </span><span class="lineCov"> 22 : unsigned j = i + 1;</span>
|
|
<span class="lineNum"> 373 </span><span class="lineCov"> 39830 : while (j < count && timemap[i] == timemap[j])</span>
|
|
<span class="lineNum"> 374 </span><span class="lineCov"> 39786 : ++j;</span>
|
|
<span class="lineNum"> 375 </span><span class="lineCov"> 22 : if ((timemap[i] & TIME_NEW) == 0) {</span>
|
|
<span class="lineNum"> 376 </span><span class="lineCov"> 8 : log_tag("info_time:%" PRIu64 ":%u:scrubbed\n", (uint64_t)timemap[i], j - i);</span>
|
|
<span class="lineNum"> 377 </span> : } else {
|
|
<span class="lineNum"> 378 </span><span class="lineCov"> 14 : log_tag("info_time:%" PRIu64 ":%u:new\n", (uint64_t)(timemap[i] & ~TIME_NEW), j - i);</span>
|
|
<span class="lineNum"> 379 </span> : }
|
|
<span class="lineNum"> 380 </span><span class="lineCov"> 22 : i = j;</span>
|
|
<span class="lineNum"> 381 </span> : }
|
|
<span class="lineNum"> 382 </span> :
|
|
<span class="lineNum"> 383 </span><span class="lineCov"> 9 : oldest = timemap[0];</span>
|
|
<span class="lineNum"> 384 </span><span class="lineCov"> 9 : median = timemap[count / 2];</span>
|
|
<span class="lineNum"> 385 </span><span class="lineCov"> 9 : newest = timemap[count - 1];</span>
|
|
<span class="lineNum"> 386 </span><span class="lineCov"> 9 : dayoldest = day_ago(oldest, now);</span>
|
|
<span class="lineNum"> 387 </span><span class="lineCov"> 9 : daymedian = day_ago(median, now);</span>
|
|
<span class="lineNum"> 388 </span><span class="lineCov"> 9 : daynewest = day_ago(newest, now);</span>
|
|
<span class="lineNum"> 389 </span> :
|
|
<span class="lineNum"> 390 </span> : /* compute graph limits */
|
|
<span class="lineNum"> 391 </span><span class="lineCov"> 9 : barpos = 0;</span>
|
|
<span class="lineNum"> 392 </span><span class="lineCov"> 9 : barmax = 0;</span>
|
|
<span class="lineNum"> 393 </span><span class="lineCov"> 639 : for (i = 0; i < GRAPH_COLUMN; ++i) {</span>
|
|
<span class="lineNum"> 394 </span> : time_t limit;
|
|
<span class="lineNum"> 395 </span> : unsigned step_scrubbed, step_new;
|
|
<span class="lineNum"> 396 </span> :
|
|
<span class="lineNum"> 397 </span><span class="lineCov"> 630 : limit = oldest + (newest - oldest) * (i + 1) / GRAPH_COLUMN;</span>
|
|
<span class="lineNum"> 398 </span> :
|
|
<span class="lineNum"> 399 </span><span class="lineCov"> 630 : step_scrubbed = 0;</span>
|
|
<span class="lineNum"> 400 </span><span class="lineCov"> 630 : step_new = 0;</span>
|
|
<span class="lineNum"> 401 </span><span class="lineCov"> 41068 : while (barpos < count && timemap[barpos] <= limit) {</span>
|
|
<span class="lineNum"> 402 </span><span class="lineCov"> 39808 : if ((timemap[barpos] & TIME_NEW) != 0)</span>
|
|
<span class="lineNum"> 403 </span><span class="lineCov"> 20516 : ++step_new;</span>
|
|
<span class="lineNum"> 404 </span> : else
|
|
<span class="lineNum"> 405 </span><span class="lineCov"> 19292 : ++step_scrubbed;</span>
|
|
<span class="lineNum"> 406 </span><span class="lineCov"> 39808 : ++barpos;</span>
|
|
<span class="lineNum"> 407 </span> : }
|
|
<span class="lineNum"> 408 </span> :
|
|
<span class="lineNum"> 409 </span><span class="lineCov"> 630 : if (step_new + step_scrubbed > barmax)</span>
|
|
<span class="lineNum"> 410 </span><span class="lineCov"> 12 : barmax = step_new + step_scrubbed;</span>
|
|
<span class="lineNum"> 411 </span> :
|
|
<span class="lineNum"> 412 </span><span class="lineCov"> 630 : bar_scrubbed[i] = step_scrubbed;</span>
|
|
<span class="lineNum"> 413 </span><span class="lineCov"> 630 : bar_new[i] = step_new;</span>
|
|
<span class="lineNum"> 414 </span> : }
|
|
<span class="lineNum"> 415 </span> :
|
|
<span class="lineNum"> 416 </span><span class="lineCov"> 9 : printf("\n\n");</span>
|
|
<span class="lineNum"> 417 </span> :
|
|
<span class="lineNum"> 418 </span> : /* print the graph */
|
|
<span class="lineNum"> 419 </span><span class="lineCov"> 144 : for (y = 0; y < GRAPH_ROW; ++y) {</span>
|
|
<span class="lineNum"> 420 </span><span class="lineCov"> 135 : if (y == 0)</span>
|
|
<span class="lineNum"> 421 </span><span class="lineCov"> 9 : printf("%3u%%|", barmax * 100 / count);</span>
|
|
<span class="lineNum"> 422 </span><span class="lineCov"> 126 : else if (y == GRAPH_ROW - 1)</span>
|
|
<span class="lineNum"> 423 </span><span class="lineCov"> 9 : printf(" 0%%|");</span>
|
|
<span class="lineNum"> 424 </span><span class="lineCov"> 117 : else if (y == GRAPH_ROW / 2)</span>
|
|
<span class="lineNum"> 425 </span><span class="lineCov"> 9 : printf("%3u%%|", barmax * 50 / count);</span>
|
|
<span class="lineNum"> 426 </span> : else
|
|
<span class="lineNum"> 427 </span><span class="lineCov"> 108 : printf(" |");</span>
|
|
<span class="lineNum"> 428 </span><span class="lineCov"> 9585 : for (x = 0; x < GRAPH_COLUMN; ++x) {</span>
|
|
<span class="lineNum"> 429 </span><span class="lineCov"> 9450 : unsigned pivot_upper = barmax * (GRAPH_ROW - y) / GRAPH_ROW;</span>
|
|
<span class="lineNum"> 430 </span><span class="lineCov"> 9450 : unsigned pivot_lower = barmax * (GRAPH_ROW - 1 - y) / GRAPH_ROW;</span>
|
|
<span class="lineNum"> 431 </span><span class="lineCov"> 9450 : unsigned both = bar_scrubbed[x] + bar_new[x];</span>
|
|
<span class="lineNum"> 432 </span><span class="lineCov"> 9450 : unsigned scrubbed = bar_scrubbed[x];</span>
|
|
<span class="lineNum"> 433 </span> :
|
|
<span class="lineNum"> 434 </span><span class="lineCov"> 9450 : if (both > pivot_upper) {</span>
|
|
<span class="lineNum"> 435 </span><span class="lineCov"> 162 : if (scrubbed > pivot_lower)</span>
|
|
<span class="lineNum"> 436 </span><span class="lineCov"> 71 : printf("*");</span>
|
|
<span class="lineNum"> 437 </span> : else
|
|
<span class="lineNum"> 438 </span><span class="lineCov"> 91 : printf("o");</span>
|
|
<span class="lineNum"> 439 </span><span class="lineCov"> 9288 : } else if (both > pivot_lower) {</span>
|
|
<span class="lineNum"> 440 </span><span class="lineCov"> 21 : if (scrubbed == both)</span>
|
|
<span class="lineNum"> 441 </span><span class="lineCov"> 7 : printf("*");</span>
|
|
<span class="lineNum"> 442 </span> : else
|
|
<span class="lineNum"> 443 </span><span class="lineCov"> 14 : printf("o");</span>
|
|
<span class="lineNum"> 444 </span> : } else {
|
|
<span class="lineNum"> 445 </span><span class="lineCov"> 9267 : if (y == GRAPH_ROW - 1)</span>
|
|
<span class="lineNum"> 446 </span><span class="lineCov"> 609 : printf("_");</span>
|
|
<span class="lineNum"> 447 </span> : else
|
|
<span class="lineNum"> 448 </span><span class="lineCov"> 8658 : printf(" ");</span>
|
|
<span class="lineNum"> 449 </span> : }
|
|
<span class="lineNum"> 450 </span> : }
|
|
<span class="lineNum"> 451 </span><span class="lineCov"> 135 : printf("\n");</span>
|
|
<span class="lineNum"> 452 </span> : }
|
|
<span class="lineNum"> 453 </span><span class="lineCov"> 9 : printf(" %3u days ago of the last scrub/sync %3u\n", dayoldest, daynewest);</span>
|
|
<span class="lineNum"> 454 </span> :
|
|
<span class="lineNum"> 455 </span><span class="lineCov"> 9 : printf("\n");</span>
|
|
<span class="lineNum"> 456 </span> :
|
|
<span class="lineNum"> 457 </span><span class="lineCov"> 9 : printf("The oldest block was scrubbed %u days ago, the median %u, the newest %u.\n", dayoldest, daymedian, daynewest);</span>
|
|
<span class="lineNum"> 458 </span> :
|
|
<span class="lineNum"> 459 </span><span class="lineCov"> 9 : printf("\n");</span>
|
|
<span class="lineNum"> 460 </span> :
|
|
<span class="lineNum"> 461 </span><span class="lineCov"> 9 : if (unsynced_blocks) {</span>
|
|
<span class="lineNum"> 462 </span><span class="lineCov"> 1 : printf("WARNING! The array is NOT fully synced.\n");</span>
|
|
<span class="lineNum"> 463 </span><span class="lineCov"> 1 : printf("You have a sync in progress at %u%%.\n", (blockmax - unsynced_blocks) * 100 / blockmax);</span>
|
|
<span class="lineNum"> 464 </span> : } else {
|
|
<span class="lineNum"> 465 </span><span class="lineCov"> 8 : printf("No sync is in progress.\n");</span>
|
|
<span class="lineNum"> 466 </span> : }
|
|
<span class="lineNum"> 467 </span> :
|
|
<span class="lineNum"> 468 </span><span class="lineCov"> 9 : if (unscrubbed_blocks) {</span>
|
|
<span class="lineNum"> 469 </span><span class="lineCov"> 7 : printf("The %u%% of the array is not scrubbed.\n", (unscrubbed_blocks * 100 + blockmax - 1) / blockmax);</span>
|
|
<span class="lineNum"> 470 </span> : } else {
|
|
<span class="lineNum"> 471 </span><span class="lineCov"> 2 : printf("The full array was scrubbed at least one time.\n");</span>
|
|
<span class="lineNum"> 472 </span> : }
|
|
<span class="lineNum"> 473 </span> :
|
|
<span class="lineNum"> 474 </span><span class="lineCov"> 9 : if (file_zerosubsecond) {</span>
|
|
<span class="lineNum"> 475 </span><span class="lineNoCov"> 0 : printf("You have %u files with zero sub-second timestamp.\n", file_zerosubsecond);</span>
|
|
<span class="lineNum"> 476 </span><span class="lineNoCov"> 0 : printf("Run the 'touch' command to set it to a not zero value.\n");</span>
|
|
<span class="lineNum"> 477 </span> : } else {
|
|
<span class="lineNum"> 478 </span><span class="lineCov"> 9 : printf("No file has a zero sub-second timestamp.\n");</span>
|
|
<span class="lineNum"> 479 </span> : }
|
|
<span class="lineNum"> 480 </span> :
|
|
<span class="lineNum"> 481 </span><span class="lineCov"> 9 : if (rehash) {</span>
|
|
<span class="lineNum"> 482 </span><span class="lineCov"> 1 : printf("You have a rehash in progress at %u%%.\n", (count - rehash) * 100 / count);</span>
|
|
<span class="lineNum"> 483 </span> : } else {
|
|
<span class="lineNum"> 484 </span><span class="lineCov"> 8 : if (state->besthash != state->hash) {</span>
|
|
<span class="lineNum"> 485 </span><span class="lineNoCov"> 0 : printf("No rehash is in progress, but for optimal performance one is recommended.\n");</span>
|
|
<span class="lineNum"> 486 </span> : } else {
|
|
<span class="lineNum"> 487 </span><span class="lineCov"> 8 : printf("No rehash is in progress or needed.\n");</span>
|
|
<span class="lineNum"> 488 </span> : }
|
|
<span class="lineNum"> 489 </span> : }
|
|
<span class="lineNum"> 490 </span> :
|
|
<span class="lineNum"> 491 </span><span class="lineCov"> 9 : if (bad) {</span>
|
|
<span class="lineNum"> 492 </span> : block_off_t bad_print;
|
|
<span class="lineNum"> 493 </span> :
|
|
<span class="lineNum"> 494 </span><span class="lineCov"> 2 : printf("DANGER! In the array there are %u errors!\n\n", bad);</span>
|
|
<span class="lineNum"> 495 </span> :
|
|
<span class="lineNum"> 496 </span><span class="lineCov"> 2 : printf("They are from block %u to %u, specifically at blocks:", bad_first, bad_last);</span>
|
|
<span class="lineNum"> 497 </span> :
|
|
<span class="lineNum"> 498 </span> : /* print some of the errors */
|
|
<span class="lineNum"> 499 </span><span class="lineCov"> 2 : bad_print = 0;</span>
|
|
<span class="lineNum"> 500 </span><span class="lineCov"> 723 : for (i = 0; i < blockmax; ++i) {</span>
|
|
<span class="lineNum"> 501 </span><span class="lineCov"> 723 : snapraid_info info = info_get(&state->infoarr, i);</span>
|
|
<span class="lineNum"> 502 </span> :
|
|
<span class="lineNum"> 503 </span> : /* skip unused blocks */
|
|
<span class="lineNum"> 504 </span><span class="lineCov"> 723 : if (info == 0)</span>
|
|
<span class="lineNum"> 505 </span><span class="lineNoCov"> 0 : continue;</span>
|
|
<span class="lineNum"> 506 </span> :
|
|
<span class="lineNum"> 507 </span><span class="lineCov"> 723 : if (info_get_bad(info)) {</span>
|
|
<span class="lineNum"> 508 </span><span class="lineCov"> 202 : printf(" %u", i);</span>
|
|
<span class="lineNum"> 509 </span><span class="lineCov"> 202 : ++bad_print;</span>
|
|
<span class="lineNum"> 510 </span> : }
|
|
<span class="lineNum"> 511 </span> :
|
|
<span class="lineNum"> 512 </span><span class="lineCov"> 723 : if (bad_print > 100) {</span>
|
|
<span class="lineNum"> 513 </span><span class="lineCov"> 2 : printf(" and %u more...", bad - bad_print);</span>
|
|
<span class="lineNum"> 514 </span><span class="lineCov"> 2 : break;</span>
|
|
<span class="lineNum"> 515 </span> : }
|
|
<span class="lineNum"> 516 </span> : }
|
|
<span class="lineNum"> 517 </span> :
|
|
<span class="lineNum"> 518 </span><span class="lineCov"> 2 : printf("\n\n");</span>
|
|
<span class="lineNum"> 519 </span> :
|
|
<span class="lineNum"> 520 </span><span class="lineCov"> 2 : printf("To fix them use the command 'snapraid -e fix'.\n");</span>
|
|
<span class="lineNum"> 521 </span><span class="lineCov"> 2 : printf("The errors will disappear from the 'status' at the next 'scrub' command.\n");</span>
|
|
<span class="lineNum"> 522 </span> : } else {
|
|
<span class="lineNum"> 523 </span><span class="lineCov"> 7 : printf("No error detected.\n");</span>
|
|
<span class="lineNum"> 524 </span> : }
|
|
<span class="lineNum"> 525 </span> :
|
|
<span class="lineNum"> 526 </span> : /* free the temp vector */
|
|
<span class="lineNum"> 527 </span><span class="lineCov"> 9 : free(timemap);</span>
|
|
<span class="lineNum"> 528 </span> :
|
|
<span class="lineNum"> 529 </span><span class="lineCov"> 9 : return 0;</span>
|
|
<span class="lineNum"> 530 </span> : }
|
|
<span class="lineNum"> 531 </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>
|