mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 19:01:57 -04:00
559 lines
66 KiB
HTML
559 lines
66 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-sort-c.html">functions</a>)</span></td>
|
|
<td width="5%"></td>
|
|
<td width="15%"></td>
|
|
<td width="10%" class="headerCovTableHead">Hit</td>
|
|
<td width="10%" class="headerCovTableHead">Total</td>
|
|
<td width="15%" class="headerCovTableHead">Coverage</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test:</td>
|
|
<td class="headerValue">lcov.info</td>
|
|
<td></td>
|
|
<td class="headerItem">Lines:</td>
|
|
<td class="headerCovTableEntry">256</td>
|
|
<td class="headerCovTableEntry">266</td>
|
|
<td class="headerCovTableEntryHi">96.2 %</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Date:</td>
|
|
<td class="headerValue">2026-03-15 15:58:19</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntry">2</td>
|
|
<td class="headerCovTableEntry">2</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
</tr>
|
|
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<a name="1"><span class="lineNum"> 1 </span> : /*</a>
|
|
<a name="2"><span class="lineNum"> 2 </span> : * Copyright (C) 2013 Andrea Mazzoleni</a>
|
|
<a name="3"><span class="lineNum"> 3 </span> : *</a>
|
|
<a name="4"><span class="lineNum"> 4 </span> : * This program is free software: you can redistribute it and/or modify</a>
|
|
<a name="5"><span class="lineNum"> 5 </span> : * it under the terms of the GNU General Public License as published by</a>
|
|
<a name="6"><span class="lineNum"> 6 </span> : * the Free Software Foundation, either version 3 of the License, or</a>
|
|
<a name="7"><span class="lineNum"> 7 </span> : * (at your option) any later version.</a>
|
|
<a name="8"><span class="lineNum"> 8 </span> : *</a>
|
|
<a name="9"><span class="lineNum"> 9 </span> : * This program is distributed in the hope that it will be useful,</a>
|
|
<a name="10"><span class="lineNum"> 10 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of</a>
|
|
<a name="11"><span class="lineNum"> 11 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</a>
|
|
<a name="12"><span class="lineNum"> 12 </span> : * GNU General Public License for more details.</a>
|
|
<a name="13"><span class="lineNum"> 13 </span> : *</a>
|
|
<a name="14"><span class="lineNum"> 14 </span> : * You should have received a copy of the GNU General Public License</a>
|
|
<a name="15"><span class="lineNum"> 15 </span> : * along with this program. If not, see <http://www.gnu.org/licenses/>.</a>
|
|
<a name="16"><span class="lineNum"> 16 </span> : */</a>
|
|
<a name="17"><span class="lineNum"> 17 </span> : </a>
|
|
<a name="18"><span class="lineNum"> 18 </span> : #include "portable.h"</a>
|
|
<a name="19"><span class="lineNum"> 19 </span> : </a>
|
|
<a name="20"><span class="lineNum"> 20 </span> : #include "support.h"</a>
|
|
<a name="21"><span class="lineNum"> 21 </span> : #include "elem.h"</a>
|
|
<a name="22"><span class="lineNum"> 22 </span> : #include "state.h"</a>
|
|
<a name="23"><span class="lineNum"> 23 </span> : #include "parity.h"</a>
|
|
<a name="24"><span class="lineNum"> 24 </span> : #include "handle.h"</a>
|
|
<a name="25"><span class="lineNum"> 25 </span> : #include "raid/raid.h"</a>
|
|
<a name="26"><span class="lineNum"> 26 </span> : </a>
|
|
<a name="27"><span class="lineNum"> 27 </span> : /****************************************************************************/</a>
|
|
<a name="28"><span class="lineNum"> 28 </span> : /* status */</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : </a>
|
|
<a name="30"><span class="lineNum"> 30 </span><span class="lineCov"> 27 : unsigned day_ago(time_t ref, time_t now)</span></a>
|
|
<a name="31"><span class="lineNum"> 31 </span> : {</a>
|
|
<a name="32"><span class="lineNum"> 32 </span> : /* in case some dates is in the future */</a>
|
|
<a name="33"><span class="lineNum"> 33 </span><span class="lineCov"> 27 : if (now < ref)</span></a>
|
|
<a name="34"><span class="lineNum"> 34 </span><span class="lineNoCov"> 0 : return 0;</span></a>
|
|
<a name="35"><span class="lineNum"> 35 </span> : </a>
|
|
<a name="36"><span class="lineNum"> 36 </span><span class="lineCov"> 27 : return (now - ref) / (24 * 3600);</span></a>
|
|
<a name="37"><span class="lineNum"> 37 </span> : }</a>
|
|
<a name="38"><span class="lineNum"> 38 </span> : </a>
|
|
<a name="39"><span class="lineNum"> 39 </span> : #define GRAPH_COLUMN 70</a>
|
|
<a name="40"><span class="lineNum"> 40 </span> : #define GRAPH_ROW 15</a>
|
|
<a name="41"><span class="lineNum"> 41 </span> : </a>
|
|
<a name="42"><span class="lineNum"> 42 </span> : /**</a>
|
|
<a name="43"><span class="lineNum"> 43 </span> : * Bit used to mark unscrubbed time info.</a>
|
|
<a name="44"><span class="lineNum"> 44 </span> : */</a>
|
|
<a name="45"><span class="lineNum"> 45 </span> : #define TIME_NEW 1</a>
|
|
<a name="46"><span class="lineNum"> 46 </span> : </a>
|
|
<a name="47"><span class="lineNum"> 47 </span><span class="lineCov"> 15 : int state_status(struct snapraid_state* state)</span></a>
|
|
<a name="48"><span class="lineNum"> 48 </span> : {</a>
|
|
<a name="49"><span class="lineNum"> 49 </span> : block_off_t blockmax;</a>
|
|
<a name="50"><span class="lineNum"> 50 </span> : block_off_t i;</a>
|
|
<a name="51"><span class="lineNum"> 51 </span> : time_t now;</a>
|
|
<a name="52"><span class="lineNum"> 52 </span> : block_off_t count;</a>
|
|
<a name="53"><span class="lineNum"> 53 </span> : unsigned l;</a>
|
|
<a name="54"><span class="lineNum"> 54 </span> : unsigned dayoldest, daymedian, daynewest;</a>
|
|
<a name="55"><span class="lineNum"> 55 </span> : unsigned bar_scrubbed[GRAPH_COLUMN];</a>
|
|
<a name="56"><span class="lineNum"> 56 </span> : unsigned bar_new[GRAPH_COLUMN];</a>
|
|
<a name="57"><span class="lineNum"> 57 </span> : unsigned barmax;</a>
|
|
<a name="58"><span class="lineNum"> 58 </span> : time_t oldest, newest, median;</a>
|
|
<a name="59"><span class="lineNum"> 59 </span> : unsigned x, y;</a>
|
|
<a name="60"><span class="lineNum"> 60 </span> : tommy_node* node_disk;</a>
|
|
<a name="61"><span class="lineNum"> 61 </span> : unsigned file_count;</a>
|
|
<a name="62"><span class="lineNum"> 62 </span> : unsigned file_fragmented;</a>
|
|
<a name="63"><span class="lineNum"> 63 </span> : unsigned extra_fragment;</a>
|
|
<a name="64"><span class="lineNum"> 64 </span> : unsigned file_zerosubsecond;</a>
|
|
<a name="65"><span class="lineNum"> 65 </span> : uint64_t file_size;</a>
|
|
<a name="66"><span class="lineNum"> 66 </span> : uint64_t file_block_count;</a>
|
|
<a name="67"><span class="lineNum"> 67 </span> : uint64_t file_block_free;</a>
|
|
<a name="68"><span class="lineNum"> 68 </span> : block_off_t parity_block_free;</a>
|
|
<a name="69"><span class="lineNum"> 69 </span> : uint64_t all_wasted;</a>
|
|
<a name="70"><span class="lineNum"> 70 </span> : int free_not_zero;</a>
|
|
<a name="71"><span class="lineNum"> 71 </span> : </a>
|
|
<a name="72"><span class="lineNum"> 72 </span> : /* get the present time */</a>
|
|
<a name="73"><span class="lineNum"> 73 </span><span class="lineCov"> 15 : now = time(0);</span></a>
|
|
<a name="74"><span class="lineNum"> 74 </span> : </a>
|
|
<a name="75"><span class="lineNum"> 75 </span> : /* keep track if at least a free info is available */</a>
|
|
<a name="76"><span class="lineNum"> 76 </span><span class="lineCov"> 15 : free_not_zero = 0;</span></a>
|
|
<a name="77"><span class="lineNum"> 77 </span> : </a>
|
|
<a name="78"><span class="lineNum"> 78 </span><span class="lineCov"> 15 : blockmax = parity_allocated_size(state);</span></a>
|
|
<a name="79"><span class="lineNum"> 79 </span> : </a>
|
|
<a name="80"><span class="lineNum"> 80 </span><span class="lineCov"> 15 : log_tag("summary:block_size:%u\n", state->block_size);</span></a>
|
|
<a name="81"><span class="lineNum"> 81 </span><span class="lineCov"> 15 : log_tag("summary:parity_block_count:%u\n", blockmax);</span></a>
|
|
<a name="82"><span class="lineNum"> 82 </span> : </a>
|
|
<a name="83"><span class="lineNum"> 83 </span> : /* get the minimum parity free space */</a>
|
|
<a name="84"><span class="lineNum"> 84 </span><span class="lineCov"> 15 : parity_block_free = state->parity[0].free_blocks;</span></a>
|
|
<a name="85"><span class="lineNum"> 85 </span><span class="lineCov"> 105 : for (l = 0; l < state->level; ++l) {</span></a>
|
|
<a name="86"><span class="lineNum"> 86 </span><span class="lineCov"> 90 : log_tag("summary:parity_block_total:%s:%u\n", lev_config_name(l), state->parity[l].total_blocks);</span></a>
|
|
<a name="87"><span class="lineNum"> 87 </span><span class="lineCov"> 90 : log_tag("summary:parity_block_free:%s:%u\n", lev_config_name(l), state->parity[l].free_blocks);</span></a>
|
|
<a name="88"><span class="lineNum"> 88 </span><span class="lineCov"> 90 : if (state->parity[l].free_blocks < parity_block_free)</span></a>
|
|
<a name="89"><span class="lineNum"> 89 </span><span class="lineCov"> 1 : parity_block_free = state->parity[l].free_blocks;</span></a>
|
|
<a name="90"><span class="lineNum"> 90 </span><span class="lineCov"> 90 : if (state->parity[l].free_blocks != 0)</span></a>
|
|
<a name="91"><span class="lineNum"> 91 </span><span class="lineCov"> 79 : free_not_zero = 1;</span></a>
|
|
<a name="92"><span class="lineNum"> 92 </span> : }</a>
|
|
<a name="93"><span class="lineNum"> 93 </span><span class="lineCov"> 15 : log_tag("summary:parity_block_free_min:%u\n", parity_block_free);</span></a>
|
|
<a name="94"><span class="lineNum"> 94 </span> : </a>
|
|
<a name="95"><span class="lineNum"> 95 </span><span class="lineCov"> 15 : printf("SnapRAID status report:\n");</span></a>
|
|
<a name="96"><span class="lineNum"> 96 </span><span class="lineCov"> 15 : printf("\n");</span></a>
|
|
<a name="97"><span class="lineNum"> 97 </span><span class="lineCov"> 15 : printf(" Files Fragmented Excess Wasted Used Free Use Name\n");</span></a>
|
|
<a name="98"><span class="lineNum"> 98 </span><span class="lineCov"> 15 : printf(" Files Fragments GB GB GB\n");</span></a>
|
|
<a name="99"><span class="lineNum"> 99 </span> : </a>
|
|
<a name="100"><span class="lineNum"> 100 </span> : /* count fragments */</a>
|
|
<a name="101"><span class="lineNum"> 101 </span><span class="lineCov"> 15 : file_count = 0;</span></a>
|
|
<a name="102"><span class="lineNum"> 102 </span><span class="lineCov"> 15 : file_size = 0;</span></a>
|
|
<a name="103"><span class="lineNum"> 103 </span><span class="lineCov"> 15 : file_block_count = 0;</span></a>
|
|
<a name="104"><span class="lineNum"> 104 </span><span class="lineCov"> 15 : file_block_free = 0;</span></a>
|
|
<a name="105"><span class="lineNum"> 105 </span><span class="lineCov"> 15 : file_fragmented = 0;</span></a>
|
|
<a name="106"><span class="lineNum"> 106 </span><span class="lineCov"> 15 : extra_fragment = 0;</span></a>
|
|
<a name="107"><span class="lineNum"> 107 </span><span class="lineCov"> 15 : file_zerosubsecond = 0;</span></a>
|
|
<a name="108"><span class="lineNum"> 108 </span><span class="lineCov"> 15 : all_wasted = 0;</span></a>
|
|
<a name="109"><span class="lineNum"> 109 </span><span class="lineCov"> 105 : for (node_disk = state->disklist; node_disk != 0; node_disk = node_disk->next) {</span></a>
|
|
<a name="110"><span class="lineNum"> 110 </span><span class="lineCov"> 90 : struct snapraid_disk* disk = node_disk->data;</span></a>
|
|
<a name="111"><span class="lineNum"> 111 </span> : tommy_node* node;</a>
|
|
<a name="112"><span class="lineNum"> 112 </span> : block_off_t j;</a>
|
|
<a name="113"><span class="lineNum"> 113 </span><span class="lineCov"> 90 : unsigned disk_file_count = 0;</span></a>
|
|
<a name="114"><span class="lineNum"> 114 </span><span class="lineCov"> 90 : unsigned disk_file_fragmented = 0;</span></a>
|
|
<a name="115"><span class="lineNum"> 115 </span><span class="lineCov"> 90 : unsigned disk_extra_fragment = 0;</span></a>
|
|
<a name="116"><span class="lineNum"> 116 </span><span class="lineCov"> 90 : unsigned disk_file_zerosubsecond = 0;</span></a>
|
|
<a name="117"><span class="lineNum"> 117 </span><span class="lineCov"> 90 : block_off_t disk_block_count = 0;</span></a>
|
|
<a name="118"><span class="lineNum"> 118 </span><span class="lineCov"> 90 : uint64_t disk_file_size = 0;</span></a>
|
|
<a name="119"><span class="lineNum"> 119 </span><span class="lineCov"> 90 : block_off_t disk_block_latest_used = 0;</span></a>
|
|
<a name="120"><span class="lineNum"> 120 </span> : block_off_t disk_block_max_by_space;</a>
|
|
<a name="121"><span class="lineNum"> 121 </span> : block_off_t disk_block_max_by_parity;</a>
|
|
<a name="122"><span class="lineNum"> 122 </span> : block_off_t disk_block_max;</a>
|
|
<a name="123"><span class="lineNum"> 123 </span> : uint64_t disk_used_bytes;</a>
|
|
<a name="124"><span class="lineNum"> 124 </span> : uint64_t disk_free_bytes;</a>
|
|
<a name="125"><span class="lineNum"> 125 </span> : int64_t wasted;</a>
|
|
<a name="126"><span class="lineNum"> 126 </span> : </a>
|
|
<a name="127"><span class="lineNum"> 127 </span> : /* for each file in the disk */</a>
|
|
<a name="128"><span class="lineNum"> 128 </span><span class="lineCov"> 90 : node = disk->filelist;</span></a>
|
|
<a name="129"><span class="lineNum"> 129 </span><span class="lineCov"> 95576 : while (node) {</span></a>
|
|
<a name="130"><span class="lineNum"> 130 </span> : struct snapraid_file* file;</a>
|
|
<a name="131"><span class="lineNum"> 131 </span> : </a>
|
|
<a name="132"><span class="lineNum"> 132 </span><span class="lineCov"> 95486 : file = node->data;</span></a>
|
|
<a name="133"><span class="lineNum"> 133 </span><span class="lineCov"> 95486 : node = node->next; /* next node */</span></a>
|
|
<a name="134"><span class="lineNum"> 134 </span> : </a>
|
|
<a name="135"><span class="lineNum"> 135 </span><span class="lineCov"> 95486 : if (file->mtime_nsec == STAT_NSEC_INVALID</span></a>
|
|
<a name="136"><span class="lineNum"> 136 </span><span class="lineCov"> 95486 : || file->mtime_nsec == 0</span></a>
|
|
<a name="137"><span class="lineNum"> 137 </span> : ) {</a>
|
|
<a name="138"><span class="lineNum"> 138 </span><span class="lineNoCov"> 0 : ++file_zerosubsecond;</span></a>
|
|
<a name="139"><span class="lineNum"> 139 </span><span class="lineNoCov"> 0 : ++disk_file_zerosubsecond;</span></a>
|
|
<a name="140"><span class="lineNum"> 140 </span><span class="lineNoCov"> 0 : if (disk_file_zerosubsecond < 50)</span></a>
|
|
<a name="141"><span class="lineNum"> 141 </span><span class="lineNoCov"> 0 : log_tag("zerosubsecond:%s:%s: \n", disk->name, file->sub);</span></a>
|
|
<a name="142"><span class="lineNum"> 142 </span><span class="lineNoCov"> 0 : if (disk_file_zerosubsecond == 50)</span></a>
|
|
<a name="143"><span class="lineNum"> 143 </span><span class="lineNoCov"> 0 : log_tag("zerosubsecond:%s:%s: (more follow)\n", disk->name, file->sub);</span></a>
|
|
<a name="144"><span class="lineNum"> 144 </span> : }</a>
|
|
<a name="145"><span class="lineNum"> 145 </span> : </a>
|
|
<a name="146"><span class="lineNum"> 146 </span> : /* check fragmentation */</a>
|
|
<a name="147"><span class="lineNum"> 147 </span><span class="lineCov"> 95486 : if (file->blockmax != 0) {</span></a>
|
|
<a name="148"><span class="lineNum"> 148 </span> : block_off_t prev_pos;</a>
|
|
<a name="149"><span class="lineNum"> 149 </span> : block_off_t last_pos;</a>
|
|
<a name="150"><span class="lineNum"> 150 </span> : int fragmented;</a>
|
|
<a name="151"><span class="lineNum"> 151 </span> : </a>
|
|
<a name="152"><span class="lineNum"> 152 </span><span class="lineCov"> 95348 : fragmented = 0;</span></a>
|
|
<a name="153"><span class="lineNum"> 153 </span><span class="lineCov"> 95348 : prev_pos = fs_file2par_get(disk, file, 0);</span></a>
|
|
<a name="154"><span class="lineNum"> 154 </span><span class="lineCov"> 235648 : for (j = 1; j < file->blockmax; ++j) {</span></a>
|
|
<a name="155"><span class="lineNum"> 155 </span><span class="lineCov"> 140300 : block_off_t parity_pos = fs_file2par_get(disk, file, j);</span></a>
|
|
<a name="156"><span class="lineNum"> 156 </span><span class="lineCov"> 140300 : if (prev_pos + 1 != parity_pos) {</span></a>
|
|
<a name="157"><span class="lineNum"> 157 </span><span class="lineCov"> 713 : fragmented = 1;</span></a>
|
|
<a name="158"><span class="lineNum"> 158 </span><span class="lineCov"> 713 : ++extra_fragment;</span></a>
|
|
<a name="159"><span class="lineNum"> 159 </span><span class="lineCov"> 713 : ++disk_extra_fragment;</span></a>
|
|
<a name="160"><span class="lineNum"> 160 </span> : }</a>
|
|
<a name="161"><span class="lineNum"> 161 </span><span class="lineCov"> 140300 : prev_pos = parity_pos;</span></a>
|
|
<a name="162"><span class="lineNum"> 162 </span> : }</a>
|
|
<a name="163"><span class="lineNum"> 163 </span> : </a>
|
|
<a name="164"><span class="lineNum"> 164 </span> : /* keep track of latest block used */</a>
|
|
<a name="165"><span class="lineNum"> 165 </span><span class="lineCov"> 95348 : last_pos = fs_file2par_get(disk, file, file->blockmax - 1);</span></a>
|
|
<a name="166"><span class="lineNum"> 166 </span><span class="lineCov"> 95348 : if (last_pos > disk_block_latest_used) {</span></a>
|
|
<a name="167"><span class="lineNum"> 167 </span><span class="lineCov"> 92458 : disk_block_latest_used = last_pos;</span></a>
|
|
<a name="168"><span class="lineNum"> 168 </span> : }</a>
|
|
<a name="169"><span class="lineNum"> 169 </span> : </a>
|
|
<a name="170"><span class="lineNum"> 170 </span><span class="lineCov"> 95348 : if (fragmented) {</span></a>
|
|
<a name="171"><span class="lineNum"> 171 </span><span class="lineCov"> 593 : ++file_fragmented;</span></a>
|
|
<a name="172"><span class="lineNum"> 172 </span><span class="lineCov"> 593 : ++disk_file_fragmented;</span></a>
|
|
<a name="173"><span class="lineNum"> 173 </span> : }</a>
|
|
<a name="174"><span class="lineNum"> 174 </span> : </a>
|
|
<a name="175"><span class="lineNum"> 175 </span><span class="lineCov"> 95348 : disk_block_count += file->blockmax;</span></a>
|
|
<a name="176"><span class="lineNum"> 176 </span> : }</a>
|
|
<a name="177"><span class="lineNum"> 177 </span> : </a>
|
|
<a name="178"><span class="lineNum"> 178 </span> : /* count files */</a>
|
|
<a name="179"><span class="lineNum"> 179 </span><span class="lineCov"> 95486 : ++file_count;</span></a>
|
|
<a name="180"><span class="lineNum"> 180 </span><span class="lineCov"> 95486 : ++disk_file_count;</span></a>
|
|
<a name="181"><span class="lineNum"> 181 </span><span class="lineCov"> 95486 : file_size += file->size;</span></a>
|
|
<a name="182"><span class="lineNum"> 182 </span><span class="lineCov"> 95486 : file_block_count += file->blockmax;</span></a>
|
|
<a name="183"><span class="lineNum"> 183 </span><span class="lineCov"> 95486 : disk_file_size += file->size;</span></a>
|
|
<a name="184"><span class="lineNum"> 184 </span> : }</a>
|
|
<a name="185"><span class="lineNum"> 185 </span> : </a>
|
|
<a name="186"><span class="lineNum"> 186 </span><span class="lineCov"> 90 : if (disk->free_blocks != 0)</span></a>
|
|
<a name="187"><span class="lineNum"> 187 </span><span class="lineCov"> 53 : free_not_zero = 1;</span></a>
|
|
<a name="188"><span class="lineNum"> 188 </span> : </a>
|
|
<a name="189"><span class="lineNum"> 189 </span> : /* get the free block info */</a>
|
|
<a name="190"><span class="lineNum"> 190 </span><span class="lineCov"> 90 : disk_block_max_by_space = disk_block_count + disk->free_blocks;</span></a>
|
|
<a name="191"><span class="lineNum"> 191 </span><span class="lineCov"> 90 : disk_block_max_by_parity = blockmax + parity_block_free;</span></a>
|
|
<a name="192"><span class="lineNum"> 192 </span> : </a>
|
|
<a name="193"><span class="lineNum"> 193 </span> : /* the maximum usable space in a disk is limited by the smallest */</a>
|
|
<a name="194"><span class="lineNum"> 194 </span> : /* of the disk size and the parity size */</a>
|
|
<a name="195"><span class="lineNum"> 195 </span> : /* the wasted space is the space that we have to leave */</a>
|
|
<a name="196"><span class="lineNum"> 196 </span> : /* free on the data disk, when the parity is filled up */</a>
|
|
<a name="197"><span class="lineNum"> 197 </span><span class="lineCov"> 90 : if (disk_block_max_by_space < disk_block_max_by_parity) {</span></a>
|
|
<a name="198"><span class="lineNum"> 198 </span><span class="lineCov"> 78 : disk_block_max = disk_block_max_by_space;</span></a>
|
|
<a name="199"><span class="lineNum"> 199 </span> : } else {</a>
|
|
<a name="200"><span class="lineNum"> 200 </span><span class="lineCov"> 12 : disk_block_max = disk_block_max_by_parity;</span></a>
|
|
<a name="201"><span class="lineNum"> 201 </span> : }</a>
|
|
<a name="202"><span class="lineNum"> 202 </span> : </a>
|
|
<a name="203"><span class="lineNum"> 203 </span> : /* wasted space is the difference of the two maximum size */</a>
|
|
<a name="204"><span class="lineNum"> 204 </span> : /* if negative, it's extra space available in parity */</a>
|
|
<a name="205"><span class="lineNum"> 205 </span><span class="lineCov"> 90 : wasted = (int64_t)disk_block_max_by_space - (int64_t)disk_block_max_by_parity;</span></a>
|
|
<a name="206"><span class="lineNum"> 206 </span><span class="lineCov"> 90 : wasted *= state->block_size;</span></a>
|
|
<a name="207"><span class="lineNum"> 207 </span> : </a>
|
|
<a name="208"><span class="lineNum"> 208 </span><span class="lineCov"> 90 : if (wasted > 0)</span></a>
|
|
<a name="209"><span class="lineNum"> 209 </span><span class="lineCov"> 6 : all_wasted += wasted;</span></a>
|
|
<a name="210"><span class="lineNum"> 210 </span><span class="lineCov"> 90 : file_block_free += disk_block_max - disk_block_count;</span></a>
|
|
<a name="211"><span class="lineNum"> 211 </span> : </a>
|
|
<a name="212"><span class="lineNum"> 212 </span><span class="lineCov"> 90 : printf("%8u", disk_file_count);</span></a>
|
|
<a name="213"><span class="lineNum"> 213 </span><span class="lineCov"> 90 : printf("%8u", disk_file_fragmented);</span></a>
|
|
<a name="214"><span class="lineNum"> 214 </span><span class="lineCov"> 90 : printf("%8u", disk_extra_fragment);</span></a>
|
|
<a name="215"><span class="lineNum"> 215 </span><span class="lineCov"> 90 : if (wasted < -100LL * GIGA) {</span></a>
|
|
<a name="216"><span class="lineNum"> 216 </span><span class="lineCov"> 78 : printf(" -");</span></a>
|
|
<a name="217"><span class="lineNum"> 217 </span> : } else {</a>
|
|
<a name="218"><span class="lineNum"> 218 </span><span class="lineCov"> 12 : printf("%8.1f", (double)wasted / GIGA);</span></a>
|
|
<a name="219"><span class="lineNum"> 219 </span> : }</a>
|
|
<a name="220"><span class="lineNum"> 220 </span><span class="lineCov"> 90 : printf("%8" PRIu64, disk_file_size / GIGA);</span></a>
|
|
<a name="221"><span class="lineNum"> 221 </span> : </a>
|
|
<a name="222"><span class="lineNum"> 222 </span><span class="lineCov"> 90 : if (disk_block_max == 0 && disk_block_count == 0) {</span></a>
|
|
<a name="223"><span class="lineNum"> 223 </span> : /* if the disk is empty and we don't have the free space info */</a>
|
|
<a name="224"><span class="lineNum"> 224 </span><span class="lineCov"> 37 : printf(" -");</span></a>
|
|
<a name="225"><span class="lineNum"> 225 </span><span class="lineCov"> 37 : printf(" - ");</span></a>
|
|
<a name="226"><span class="lineNum"> 226 </span> : } else {</a>
|
|
<a name="227"><span class="lineNum"> 227 </span><span class="lineCov"> 53 : printf("%8" PRIu64, (disk_block_max - disk_block_count) * (uint64_t)state->block_size / GIGA);</span></a>
|
|
<a name="228"><span class="lineNum"> 228 </span><span class="lineCov"> 53 : printf(" %3u%%", muldiv(disk_block_count, 100, disk_block_max));</span></a>
|
|
<a name="229"><span class="lineNum"> 229 </span> : }</a>
|
|
<a name="230"><span class="lineNum"> 230 </span><span class="lineCov"> 90 : printf(" %s\n", disk->name);</span></a>
|
|
<a name="231"><span class="lineNum"> 231 </span> : </a>
|
|
<a name="232"><span class="lineNum"> 232 </span><span class="lineCov"> 90 : log_tag("summary:disk_file_count:%s:%u\n", disk->name, disk_file_count);</span></a>
|
|
<a name="233"><span class="lineNum"> 233 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_count:%s:%u\n", disk->name, disk_block_count);</span></a>
|
|
<a name="234"><span class="lineNum"> 234 </span><span class="lineCov"> 90 : log_tag("summary:disk_fragmented_file_count:%s:%u\n", disk->name, disk_file_fragmented);</span></a>
|
|
<a name="235"><span class="lineNum"> 235 </span><span class="lineCov"> 90 : log_tag("summary:disk_excess_fragment_count:%s:%u\n", disk->name, disk_extra_fragment);</span></a>
|
|
<a name="236"><span class="lineNum"> 236 </span><span class="lineCov"> 90 : log_tag("summary:disk_zerosubsecond_file_count:%s:%u\n", disk->name, disk_file_zerosubsecond);</span></a>
|
|
<a name="237"><span class="lineNum"> 237 </span><span class="lineCov"> 90 : log_tag("summary:disk_file_size:%s:%" PRIu64 "\n", disk->name, disk_file_size);</span></a>
|
|
<a name="238"><span class="lineNum"> 238 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_allocated:%s:%u\n", disk->name, disk_block_latest_used + 1);</span></a>
|
|
<a name="239"><span class="lineNum"> 239 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_total:%s:%u\n", disk->name, disk->total_blocks);</span></a>
|
|
<a name="240"><span class="lineNum"> 240 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_free:%s:%u\n", disk->name, disk->free_blocks);</span></a>
|
|
<a name="241"><span class="lineNum"> 241 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_max_by_space:%s:%u\n", disk->name, disk_block_max_by_space);</span></a>
|
|
<a name="242"><span class="lineNum"> 242 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_max_by_parity:%s:%u\n", disk->name, disk_block_max_by_parity);</span></a>
|
|
<a name="243"><span class="lineNum"> 243 </span><span class="lineCov"> 90 : log_tag("summary:disk_block_max:%s:%u\n", disk->name, disk_block_max);</span></a>
|
|
<a name="244"><span class="lineNum"> 244 </span><span class="lineCov"> 90 : log_tag("summary:disk_space_wasted:%s:%" PRId64 "\n", disk->name, wasted);</span></a>
|
|
<a name="245"><span class="lineNum"> 245 </span> : </a>
|
|
<a name="246"><span class="lineNum"> 246 </span><span class="lineCov"> 90 : disk_used_bytes = disk_block_count * (uint64_t)state->block_size;</span></a>
|
|
<a name="247"><span class="lineNum"> 247 </span><span class="lineCov"> 90 : disk_free_bytes = (disk_block_max - disk_block_count) * (uint64_t)state->block_size;</span></a>
|
|
<a name="248"><span class="lineNum"> 248 </span><span class="lineCov"> 90 : log_tag("summary:disk_used:%s:%" PRIu64 "\n", disk->name, disk_used_bytes);</span></a>
|
|
<a name="249"><span class="lineNum"> 249 </span><span class="lineCov"> 90 : log_tag("summary:disk_free:%s:%" PRIu64 "\n", disk->name, disk_free_bytes);</span></a>
|
|
<a name="250"><span class="lineNum"> 250 </span><span class="lineCov"> 90 : log_tag("summary:disk_use_percent:%s:%u\n", disk->name, muldiv(disk_block_count, 100, disk_block_max));</span></a>
|
|
<a name="251"><span class="lineNum"> 251 </span> : }</a>
|
|
<a name="252"><span class="lineNum"> 252 </span> : </a>
|
|
<a name="253"><span class="lineNum"> 253 </span> : /* totals */</a>
|
|
<a name="254"><span class="lineNum"> 254 </span><span class="lineCov"> 15 : printf(" --------------------------------------------------------------------------\n");</span></a>
|
|
<a name="255"><span class="lineNum"> 255 </span><span class="lineCov"> 15 : printf("%8u", file_count);</span></a>
|
|
<a name="256"><span class="lineNum"> 256 </span><span class="lineCov"> 15 : printf("%8u", file_fragmented);</span></a>
|
|
<a name="257"><span class="lineNum"> 257 </span><span class="lineCov"> 15 : printf("%8u", extra_fragment);</span></a>
|
|
<a name="258"><span class="lineNum"> 258 </span><span class="lineCov"> 15 : printf("%8.1f", (double)all_wasted / GIGA);</span></a>
|
|
<a name="259"><span class="lineNum"> 259 </span><span class="lineCov"> 15 : printf("%8" PRIu64, file_size / GIGA);</span></a>
|
|
<a name="260"><span class="lineNum"> 260 </span><span class="lineCov"> 15 : printf("%8" PRIu64, file_block_free * state->block_size / GIGA);</span></a>
|
|
<a name="261"><span class="lineNum"> 261 </span><span class="lineCov"> 15 : printf(" %3u%%", muldiv(file_block_count, 100, file_block_count + file_block_free));</span></a>
|
|
<a name="262"><span class="lineNum"> 262 </span><span class="lineCov"> 15 : printf("\n");</span></a>
|
|
<a name="263"><span class="lineNum"> 263 </span> : </a>
|
|
<a name="264"><span class="lineNum"> 264 </span> : /* warn about invalid data free info */</a>
|
|
<a name="265"><span class="lineNum"> 265 </span><span class="lineCov"> 15 : if (!free_not_zero)</span></a>
|
|
<a name="266"><span class="lineNum"> 266 </span><span class="lineCov"> 1 : printf("\nWARNING! Free space info will be valid after the first sync.\n");</span></a>
|
|
<a name="267"><span class="lineNum"> 267 </span> : </a>
|
|
<a name="268"><span class="lineNum"> 268 </span><span class="lineCov"> 15 : log_tag("summary:file_count:%u\n", file_count);</span></a>
|
|
<a name="269"><span class="lineNum"> 269 </span><span class="lineCov"> 15 : log_tag("summary:file_block_count:%" PRIu64 "\n", file_block_count);</span></a>
|
|
<a name="270"><span class="lineNum"> 270 </span><span class="lineCov"> 15 : log_tag("summary:fragmented_file_count:%u\n", file_fragmented);</span></a>
|
|
<a name="271"><span class="lineNum"> 271 </span><span class="lineCov"> 15 : log_tag("summary:excess_fragment_count:%u\n", extra_fragment);</span></a>
|
|
<a name="272"><span class="lineNum"> 272 </span><span class="lineCov"> 15 : log_tag("summary:zerosubsecond_file_count:%u\n", file_zerosubsecond);</span></a>
|
|
<a name="273"><span class="lineNum"> 273 </span><span class="lineCov"> 15 : log_tag("summary:file_size:%" PRIu64 "\n", file_size);</span></a>
|
|
<a name="274"><span class="lineNum"> 274 </span><span class="lineCov"> 15 : log_tag("summary:parity_size:%" PRIu64 "\n", blockmax * (uint64_t)state->block_size);</span></a>
|
|
<a name="275"><span class="lineNum"> 275 </span><span class="lineCov"> 15 : log_tag("summary:parity_size_max:%" PRIu64 "\n", (blockmax + parity_block_free) * (uint64_t)state->block_size);</span></a>
|
|
<a name="276"><span class="lineNum"> 276 </span><span class="lineCov"> 15 : log_tag("summary:hash:%s\n", hash_config_name(state->hash));</span></a>
|
|
<a name="277"><span class="lineNum"> 277 </span><span class="lineCov"> 15 : log_tag("summary:prev_hash:%s\n", hash_config_name(state->prevhash));</span></a>
|
|
<a name="278"><span class="lineNum"> 278 </span><span class="lineCov"> 15 : log_tag("summary:best_hash:%s\n", hash_config_name(state->besthash));</span></a>
|
|
<a name="279"><span class="lineNum"> 279 </span><span class="lineCov"> 15 : log_tag("summary:total_wasted:%" PRIu64 "\n", all_wasted);</span></a>
|
|
<a name="280"><span class="lineNum"> 280 </span><span class="lineCov"> 15 : log_tag("summary:total_used:%" PRIu64 "\n", file_size);</span></a>
|
|
<a name="281"><span class="lineNum"> 281 </span><span class="lineCov"> 15 : log_tag("summary:total_free:%" PRIu64 "\n", file_block_free * state->block_size);</span></a>
|
|
<a name="282"><span class="lineNum"> 282 </span><span class="lineCov"> 15 : log_tag("summary:total_use_percent:%u\n", muldiv(file_block_count, 100, file_block_count + file_block_free));</span></a>
|
|
<a name="283"><span class="lineNum"> 283 </span><span class="lineCov"> 15 : log_flush();</span></a>
|
|
<a name="284"><span class="lineNum"> 284 </span> : </a>
|
|
<a name="285"><span class="lineNum"> 285 </span><span class="lineCov"> 15 : oldest = 0;</span></a>
|
|
<a name="286"><span class="lineNum"> 286 </span><span class="lineCov"> 15 : median = 0;</span></a>
|
|
<a name="287"><span class="lineNum"> 287 </span><span class="lineCov"> 15 : newest = 0;</span></a>
|
|
<a name="288"><span class="lineNum"> 288 </span><span class="lineCov"> 15 : count = 0;</span></a>
|
|
<a name="289"><span class="lineNum"> 289 </span><span class="lineCov"> 34 : for (tommy_node* j = tommy_list_head(&state->bucketlist); j != 0; j = j->next) {</span></a>
|
|
<a name="290"><span class="lineNum"> 290 </span><span class="lineCov"> 19 : struct snapraid_bucket* bucket = j->data;</span></a>
|
|
<a name="291"><span class="lineNum"> 291 </span><span class="lineCov"> 19 : block_off_t bucket_count = bucket->count_scrubbed + bucket->count_justsynced;</span></a>
|
|
<a name="292"><span class="lineNum"> 292 </span> : </a>
|
|
<a name="293"><span class="lineNum"> 293 </span><span class="lineCov"> 19 : if (count == 0)</span></a>
|
|
<a name="294"><span class="lineNum"> 294 </span><span class="lineCov"> 9 : oldest = bucket->time_at;</span></a>
|
|
<a name="295"><span class="lineNum"> 295 </span><span class="lineCov"> 19 : if (count < state->bucketcount / 2)</span></a>
|
|
<a name="296"><span class="lineNum"> 296 </span><span class="lineCov"> 14 : median = bucket->time_at;</span></a>
|
|
<a name="297"><span class="lineNum"> 297 </span><span class="lineCov"> 19 : newest = bucket->time_at;</span></a>
|
|
<a name="298"><span class="lineNum"> 298 </span> : </a>
|
|
<a name="299"><span class="lineNum"> 299 </span><span class="lineCov"> 19 : count += bucket_count;</span></a>
|
|
<a name="300"><span class="lineNum"> 300 </span> : }</a>
|
|
<a name="301"><span class="lineNum"> 301 </span> : </a>
|
|
<a name="302"><span class="lineNum"> 302 </span><span class="lineCov"> 15 : if (!count) {</span></a>
|
|
<a name="303"><span class="lineNum"> 303 </span><span class="lineCov"> 6 : log_fatal(EUSER, "The array is empty.\n");</span></a>
|
|
<a name="304"><span class="lineNum"> 304 </span><span class="lineCov"> 6 : return 0;</span></a>
|
|
<a name="305"><span class="lineNum"> 305 </span> : }</a>
|
|
<a name="306"><span class="lineNum"> 306 </span> : </a>
|
|
<a name="307"><span class="lineNum"> 307 </span><span class="lineCov"> 9 : dayoldest = day_ago(oldest, now);</span></a>
|
|
<a name="308"><span class="lineNum"> 308 </span><span class="lineCov"> 9 : daymedian = day_ago(median, now);</span></a>
|
|
<a name="309"><span class="lineNum"> 309 </span><span class="lineCov"> 9 : daynewest = day_ago(newest, now);</span></a>
|
|
<a name="310"><span class="lineNum"> 310 </span> : </a>
|
|
<a name="311"><span class="lineNum"> 311 </span><span class="lineCov"> 9 : log_tag("summary:scrub_oldest_days:%u\n", dayoldest);</span></a>
|
|
<a name="312"><span class="lineNum"> 312 </span><span class="lineCov"> 9 : log_tag("summary:scrub_median_days:%u\n", daymedian);</span></a>
|
|
<a name="313"><span class="lineNum"> 313 </span><span class="lineCov"> 9 : log_tag("summary:scrub_newest_days:%u\n", daynewest);</span></a>
|
|
<a name="314"><span class="lineNum"> 314 </span> : </a>
|
|
<a name="315"><span class="lineNum"> 315 </span> : /* compute graph limits */</a>
|
|
<a name="316"><span class="lineNum"> 316 </span><span class="lineCov"> 9 : barmax = 0;</span></a>
|
|
<a name="317"><span class="lineNum"> 317 </span><span class="lineCov"> 9 : memset(bar_scrubbed, 0, sizeof(bar_scrubbed));</span></a>
|
|
<a name="318"><span class="lineNum"> 318 </span><span class="lineCov"> 9 : memset(bar_new, 0, sizeof(bar_new));</span></a>
|
|
<a name="319"><span class="lineNum"> 319 </span><span class="lineCov"> 28 : for (tommy_node* j = tommy_list_head(&state->bucketlist); j != 0; j = j->next) {</span></a>
|
|
<a name="320"><span class="lineNum"> 320 </span><span class="lineCov"> 19 : struct snapraid_bucket* bucket = j->data;</span></a>
|
|
<a name="321"><span class="lineNum"> 321 </span> : </a>
|
|
<a name="322"><span class="lineNum"> 322 </span><span class="lineCov"> 19 : unsigned column = muldiv(bucket->time_at - oldest, GRAPH_COLUMN, newest - oldest + 1);</span></a>
|
|
<a name="323"><span class="lineNum"> 323 </span> : </a>
|
|
<a name="324"><span class="lineNum"> 324 </span><span class="lineCov"> 19 : bar_scrubbed[column] += bucket->count_scrubbed;</span></a>
|
|
<a name="325"><span class="lineNum"> 325 </span><span class="lineCov"> 19 : bar_new[column] += bucket->count_justsynced;</span></a>
|
|
<a name="326"><span class="lineNum"> 326 </span> : </a>
|
|
<a name="327"><span class="lineNum"> 327 </span><span class="lineCov"> 19 : if (bar_scrubbed[column] + bar_new[column] > barmax)</span></a>
|
|
<a name="328"><span class="lineNum"> 328 </span><span class="lineCov"> 12 : barmax = bar_scrubbed[column] + bar_new[column];</span></a>
|
|
<a name="329"><span class="lineNum"> 329 </span> : }</a>
|
|
<a name="330"><span class="lineNum"> 330 </span> : </a>
|
|
<a name="331"><span class="lineNum"> 331 </span> : /* output scrub history as structured data */</a>
|
|
<a name="332"><span class="lineNum"> 332 </span><span class="lineCov"> 9 : log_tag("scrub_graph_range:%u:%u\n", GRAPH_COLUMN, barmax);</span></a>
|
|
<a name="333"><span class="lineNum"> 333 </span><span class="lineCov"> 639 : for (i = 0; i < GRAPH_COLUMN; ++i) {</span></a>
|
|
<a name="334"><span class="lineNum"> 334 </span><span class="lineCov"> 630 : unsigned days_ago = dayoldest - (dayoldest - daynewest) * i / (GRAPH_COLUMN - 1);</span></a>
|
|
<a name="335"><span class="lineNum"> 335 </span><span class="lineCov"> 630 : log_tag("scrub_graph_bar:%u:%u:%u:%u\n", i, days_ago, bar_scrubbed[i], bar_new[i]);</span></a>
|
|
<a name="336"><span class="lineNum"> 336 </span> : }</a>
|
|
<a name="337"><span class="lineNum"> 337 </span> : </a>
|
|
<a name="338"><span class="lineNum"> 338 </span><span class="lineCov"> 9 : printf("\n\n");</span></a>
|
|
<a name="339"><span class="lineNum"> 339 </span> : </a>
|
|
<a name="340"><span class="lineNum"> 340 </span> : /* print the graph */</a>
|
|
<a name="341"><span class="lineNum"> 341 </span><span class="lineCov"> 144 : for (y = 0; y < GRAPH_ROW; ++y) {</span></a>
|
|
<a name="342"><span class="lineNum"> 342 </span><span class="lineCov"> 135 : if (y == 0)</span></a>
|
|
<a name="343"><span class="lineNum"> 343 </span><span class="lineCov"> 9 : printf("%3u%%|", barmax * 100 / count);</span></a>
|
|
<a name="344"><span class="lineNum"> 344 </span><span class="lineCov"> 126 : else if (y == GRAPH_ROW - 1)</span></a>
|
|
<a name="345"><span class="lineNum"> 345 </span><span class="lineCov"> 9 : printf(" 0%%|");</span></a>
|
|
<a name="346"><span class="lineNum"> 346 </span><span class="lineCov"> 117 : else if (y == GRAPH_ROW / 2)</span></a>
|
|
<a name="347"><span class="lineNum"> 347 </span><span class="lineCov"> 9 : printf("%3u%%|", barmax * 50 / count);</span></a>
|
|
<a name="348"><span class="lineNum"> 348 </span> : else</a>
|
|
<a name="349"><span class="lineNum"> 349 </span><span class="lineCov"> 108 : printf(" |");</span></a>
|
|
<a name="350"><span class="lineNum"> 350 </span><span class="lineCov"> 9585 : for (x = 0; x < GRAPH_COLUMN; ++x) {</span></a>
|
|
<a name="351"><span class="lineNum"> 351 </span><span class="lineCov"> 9450 : unsigned pivot_upper = barmax * (GRAPH_ROW - y) / GRAPH_ROW;</span></a>
|
|
<a name="352"><span class="lineNum"> 352 </span><span class="lineCov"> 9450 : unsigned pivot_lower = barmax * (GRAPH_ROW - 1 - y) / GRAPH_ROW;</span></a>
|
|
<a name="353"><span class="lineNum"> 353 </span><span class="lineCov"> 9450 : unsigned both = bar_scrubbed[x] + bar_new[x];</span></a>
|
|
<a name="354"><span class="lineNum"> 354 </span><span class="lineCov"> 9450 : unsigned scrubbed = bar_scrubbed[x];</span></a>
|
|
<a name="355"><span class="lineNum"> 355 </span> : </a>
|
|
<a name="356"><span class="lineNum"> 356 </span><span class="lineCov"> 9450 : if (both > pivot_upper) {</span></a>
|
|
<a name="357"><span class="lineNum"> 357 </span><span class="lineCov"> 156 : if (scrubbed > pivot_lower)</span></a>
|
|
<a name="358"><span class="lineNum"> 358 </span><span class="lineCov"> 60 : printf("*");</span></a>
|
|
<a name="359"><span class="lineNum"> 359 </span> : else</a>
|
|
<a name="360"><span class="lineNum"> 360 </span><span class="lineCov"> 96 : printf("o");</span></a>
|
|
<a name="361"><span class="lineNum"> 361 </span><span class="lineCov"> 9294 : } else if (both > pivot_lower) {</span></a>
|
|
<a name="362"><span class="lineNum"> 362 </span><span class="lineCov"> 19 : if (scrubbed == both)</span></a>
|
|
<a name="363"><span class="lineNum"> 363 </span><span class="lineCov"> 6 : printf("*");</span></a>
|
|
<a name="364"><span class="lineNum"> 364 </span> : else</a>
|
|
<a name="365"><span class="lineNum"> 365 </span><span class="lineCov"> 13 : printf("o");</span></a>
|
|
<a name="366"><span class="lineNum"> 366 </span> : } else {</a>
|
|
<a name="367"><span class="lineNum"> 367 </span><span class="lineCov"> 9275 : if (y == GRAPH_ROW - 1)</span></a>
|
|
<a name="368"><span class="lineNum"> 368 </span><span class="lineCov"> 611 : printf("_");</span></a>
|
|
<a name="369"><span class="lineNum"> 369 </span> : else</a>
|
|
<a name="370"><span class="lineNum"> 370 </span><span class="lineCov"> 8664 : printf(" ");</span></a>
|
|
<a name="371"><span class="lineNum"> 371 </span> : }</a>
|
|
<a name="372"><span class="lineNum"> 372 </span> : }</a>
|
|
<a name="373"><span class="lineNum"> 373 </span><span class="lineCov"> 135 : printf("\n");</span></a>
|
|
<a name="374"><span class="lineNum"> 374 </span> : }</a>
|
|
<a name="375"><span class="lineNum"> 375 </span><span class="lineCov"> 9 : printf(" %3u days ago of the last scrub/sync %3u\n", dayoldest, daynewest);</span></a>
|
|
<a name="376"><span class="lineNum"> 376 </span> : </a>
|
|
<a name="377"><span class="lineNum"> 377 </span><span class="lineCov"> 9 : printf("\n");</span></a>
|
|
<a name="378"><span class="lineNum"> 378 </span> : </a>
|
|
<a name="379"><span class="lineNum"> 379 </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></a>
|
|
<a name="380"><span class="lineNum"> 380 </span> : </a>
|
|
<a name="381"><span class="lineNum"> 381 </span><span class="lineCov"> 9 : printf("\n");</span></a>
|
|
<a name="382"><span class="lineNum"> 382 </span> : </a>
|
|
<a name="383"><span class="lineNum"> 383 </span><span class="lineCov"> 9 : if (newest > now) {</span></a>
|
|
<a name="384"><span class="lineNum"> 384 </span><span class="lineNoCov"> 0 : printf("WARNING! You have scrub dates in the future! The next sync/scrub will truncate them!\n");</span></a>
|
|
<a name="385"><span class="lineNum"> 385 </span> : }</a>
|
|
<a name="386"><span class="lineNum"> 386 </span> : </a>
|
|
<a name="387"><span class="lineNum"> 387 </span><span class="lineCov"> 9 : if (state->unsynced_blocks) {</span></a>
|
|
<a name="388"><span class="lineNum"> 388 </span><span class="lineCov"> 1 : printf("WARNING! The array is NOT fully synced.\n");</span></a>
|
|
<a name="389"><span class="lineNum"> 389 </span><span class="lineCov"> 1 : printf("You have a sync in progress at %u%%.\n", muldiv(blockmax - state->unsynced_blocks, 100, blockmax));</span></a>
|
|
<a name="390"><span class="lineNum"> 390 </span> : } else {</a>
|
|
<a name="391"><span class="lineNum"> 391 </span><span class="lineCov"> 8 : printf("No sync is in progress.\n");</span></a>
|
|
<a name="392"><span class="lineNum"> 392 </span> : }</a>
|
|
<a name="393"><span class="lineNum"> 393 </span> : </a>
|
|
<a name="394"><span class="lineNum"> 394 </span><span class="lineCov"> 9 : if (state->unscrubbed_blocks) {</span></a>
|
|
<a name="395"><span class="lineNum"> 395 </span><span class="lineCov"> 7 : printf("%u%% of the array is not scrubbed.\n", muldiv_upper(state->unscrubbed_blocks, 100, blockmax));</span></a>
|
|
<a name="396"><span class="lineNum"> 396 </span> : } else {</a>
|
|
<a name="397"><span class="lineNum"> 397 </span><span class="lineCov"> 2 : printf("The full array was scrubbed at least one time.\n");</span></a>
|
|
<a name="398"><span class="lineNum"> 398 </span> : }</a>
|
|
<a name="399"><span class="lineNum"> 399 </span> : </a>
|
|
<a name="400"><span class="lineNum"> 400 </span><span class="lineCov"> 9 : if (file_zerosubsecond) {</span></a>
|
|
<a name="401"><span class="lineNum"> 401 </span><span class="lineNoCov"> 0 : printf("You have %u files with a zero sub-second timestamp.\n", file_zerosubsecond);</span></a>
|
|
<a name="402"><span class="lineNum"> 402 </span><span class="lineNoCov"> 0 : printf("Run 'snapraid touch' to set their sub-second timestamps to a non-zero value.\n");</span></a>
|
|
<a name="403"><span class="lineNum"> 403 </span> : } else {</a>
|
|
<a name="404"><span class="lineNum"> 404 </span><span class="lineCov"> 9 : printf("No file has a zero sub-second timestamp.\n");</span></a>
|
|
<a name="405"><span class="lineNum"> 405 </span> : }</a>
|
|
<a name="406"><span class="lineNum"> 406 </span> : </a>
|
|
<a name="407"><span class="lineNum"> 407 </span><span class="lineCov"> 9 : if (state->rehash_blocks) {</span></a>
|
|
<a name="408"><span class="lineNum"> 408 </span><span class="lineCov"> 1 : printf("You have a rehash in progress at %u%%.\n", muldiv(count - state->rehash_blocks, 100, count));</span></a>
|
|
<a name="409"><span class="lineNum"> 409 </span> : } else {</a>
|
|
<a name="410"><span class="lineNum"> 410 </span><span class="lineCov"> 8 : if (state->besthash != state->hash) {</span></a>
|
|
<a name="411"><span class="lineNum"> 411 </span><span class="lineCov"> 7 : printf("No rehash is in progress, but for optimal performance one is recommended.\n");</span></a>
|
|
<a name="412"><span class="lineNum"> 412 </span> : } else {</a>
|
|
<a name="413"><span class="lineNum"> 413 </span><span class="lineCov"> 1 : printf("No rehash is in progress or needed.\n");</span></a>
|
|
<a name="414"><span class="lineNum"> 414 </span> : }</a>
|
|
<a name="415"><span class="lineNum"> 415 </span> : }</a>
|
|
<a name="416"><span class="lineNum"> 416 </span> : </a>
|
|
<a name="417"><span class="lineNum"> 417 </span><span class="lineCov"> 9 : if (state->bad_blocks) {</span></a>
|
|
<a name="418"><span class="lineNum"> 418 </span><span class="lineCov"> 2 : printf("DANGER! In the array there are %u errors!\n\n", state->bad_blocks);</span></a>
|
|
<a name="419"><span class="lineNum"> 419 </span> : </a>
|
|
<a name="420"><span class="lineNum"> 420 </span> : block_off_t bad_range;</a>
|
|
<a name="421"><span class="lineNum"> 421 </span> : block_off_t bad_count;</a>
|
|
<a name="422"><span class="lineNum"> 422 </span> : block_off_t range_start;</a>
|
|
<a name="423"><span class="lineNum"> 423 </span> : block_off_t range_count;</a>
|
|
<a name="424"><span class="lineNum"> 424 </span> : </a>
|
|
<a name="425"><span class="lineNum"> 425 </span><span class="lineCov"> 2 : printf("They are at blocks:");</span></a>
|
|
<a name="426"><span class="lineNum"> 426 </span> : </a>
|
|
<a name="427"><span class="lineNum"> 427 </span> : /* print some of the errors */</a>
|
|
<a name="428"><span class="lineNum"> 428 </span><span class="lineCov"> 2 : bad_range = 0;</span></a>
|
|
<a name="429"><span class="lineNum"> 429 </span><span class="lineCov"> 2 : bad_count = 0;</span></a>
|
|
<a name="430"><span class="lineNum"> 430 </span><span class="lineCov"> 2 : range_start = 0;</span></a>
|
|
<a name="431"><span class="lineNum"> 431 </span><span class="lineCov"> 2 : range_count = 0;</span></a>
|
|
<a name="432"><span class="lineNum"> 432 </span><span class="lineCov"> 873 : for (i = 0; i <= blockmax; ++i) { /* one extra iteration to print the final range */</span></a>
|
|
<a name="433"><span class="lineNum"> 433 </span><span class="lineCov"> 873 : snapraid_info info = 0;</span></a>
|
|
<a name="434"><span class="lineNum"> 434 </span><span class="lineCov"> 873 : int is_bad = 0;</span></a>
|
|
<a name="435"><span class="lineNum"> 435 </span> : </a>
|
|
<a name="436"><span class="lineNum"> 436 </span><span class="lineCov"> 873 : if (i < blockmax) {</span></a>
|
|
<a name="437"><span class="lineNum"> 437 </span><span class="lineCov"> 873 : info = info_get(&state->infoarr, i);</span></a>
|
|
<a name="438"><span class="lineNum"> 438 </span><span class="lineCov"> 873 : if (info != 0) /* unused blocks are never bad */</span></a>
|
|
<a name="439"><span class="lineNum"> 439 </span><span class="lineCov"> 873 : is_bad = info_get_bad(info);</span></a>
|
|
<a name="440"><span class="lineNum"> 440 </span> : }</a>
|
|
<a name="441"><span class="lineNum"> 441 </span><span class="lineCov"> 873 : if (is_bad) {</span></a>
|
|
<a name="442"><span class="lineNum"> 442 </span> : /* create or extend the range */</a>
|
|
<a name="443"><span class="lineNum"> 443 </span><span class="lineCov"> 254 : if (!range_count)</span></a>
|
|
<a name="444"><span class="lineNum"> 444 </span><span class="lineCov"> 202 : range_start = i;</span></a>
|
|
<a name="445"><span class="lineNum"> 445 </span><span class="lineCov"> 254 : ++range_count;</span></a>
|
|
<a name="446"><span class="lineNum"> 446 </span> : } else {</a>
|
|
<a name="447"><span class="lineNum"> 447 </span> : /* break the range */</a>
|
|
<a name="448"><span class="lineNum"> 448 </span><span class="lineCov"> 619 : if (range_count) {</span></a>
|
|
<a name="449"><span class="lineNum"> 449 </span><span class="lineCov"> 202 : if (range_count == 1) {</span></a>
|
|
<a name="450"><span class="lineNum"> 450 </span><span class="lineCov"> 160 : printf(" %u", range_start);</span></a>
|
|
<a name="451"><span class="lineNum"> 451 </span> : } else {</a>
|
|
<a name="452"><span class="lineNum"> 452 </span><span class="lineCov"> 42 : printf(" %u-%u", range_start, range_start + range_count - 1);</span></a>
|
|
<a name="453"><span class="lineNum"> 453 </span> : }</a>
|
|
<a name="454"><span class="lineNum"> 454 </span><span class="lineCov"> 202 : bad_count += range_count;</span></a>
|
|
<a name="455"><span class="lineNum"> 455 </span><span class="lineCov"> 202 : ++bad_range;</span></a>
|
|
<a name="456"><span class="lineNum"> 456 </span><span class="lineCov"> 202 : range_count = 0;</span></a>
|
|
<a name="457"><span class="lineNum"> 457 </span> : }</a>
|
|
<a name="458"><span class="lineNum"> 458 </span> : }</a>
|
|
<a name="459"><span class="lineNum"> 459 </span> : </a>
|
|
<a name="460"><span class="lineNum"> 460 </span><span class="lineCov"> 873 : if (bad_range > 100) {</span></a>
|
|
<a name="461"><span class="lineNum"> 461 </span><span class="lineCov"> 2 : printf(" and %u more...", state->bad_blocks - bad_count);</span></a>
|
|
<a name="462"><span class="lineNum"> 462 </span><span class="lineCov"> 2 : break;</span></a>
|
|
<a name="463"><span class="lineNum"> 463 </span> : }</a>
|
|
<a name="464"><span class="lineNum"> 464 </span> : }</a>
|
|
<a name="465"><span class="lineNum"> 465 </span> : </a>
|
|
<a name="466"><span class="lineNum"> 466 </span><span class="lineCov"> 2 : printf("\n");</span></a>
|
|
<a name="467"><span class="lineNum"> 467 </span> : </a>
|
|
<a name="468"><span class="lineNum"> 468 </span><span class="lineCov"> 2 : printf("To fix them use the command 'snapraid -e fix'.\n");</span></a>
|
|
<a name="469"><span class="lineNum"> 469 </span><span class="lineCov"> 2 : printf("The errors will disappear from the 'status' at the next 'scrub' command.\n");</span></a>
|
|
<a name="470"><span class="lineNum"> 470 </span> : } else {</a>
|
|
<a name="471"><span class="lineNum"> 471 </span><span class="lineCov"> 7 : printf("No error detected.\n");</span></a>
|
|
<a name="472"><span class="lineNum"> 472 </span> : }</a>
|
|
<a name="473"><span class="lineNum"> 473 </span> : </a>
|
|
<a name="474"><span class="lineNum"> 474 </span><span class="lineCov"> 9 : if (state->bad_blocks)</span></a>
|
|
<a name="475"><span class="lineNum"> 475 </span><span class="lineCov"> 2 : log_tag("summary:exit:bad\n");</span></a>
|
|
<a name="476"><span class="lineNum"> 476 </span><span class="lineCov"> 7 : else if (state->unsynced_blocks != 0)</span></a>
|
|
<a name="477"><span class="lineNum"> 477 </span><span class="lineCov"> 1 : log_tag("summary:exit:unsynced\n");</span></a>
|
|
<a name="478"><span class="lineNum"> 478 </span> : else</a>
|
|
<a name="479"><span class="lineNum"> 479 </span><span class="lineCov"> 6 : log_tag("summary:exit:ok\n");</span></a>
|
|
<a name="480"><span class="lineNum"> 480 </span> : </a>
|
|
<a name="481"><span class="lineNum"> 481 </span><span class="lineCov"> 9 : return 0;</span></a>
|
|
<a name="482"><span class="lineNum"> 482 </span> : }</a>
|
|
<a name="483"><span class="lineNum"> 483 </span> : </a>
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="https://github.com/linux-test-project/lcov" target="_parent">LCOV version 1.0</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|