2011-07-18 12:37:24 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2011 STRATO. All rights reserved.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public
|
|
|
|
* License v2 as published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public
|
|
|
|
* License along with this program; if not, write to the
|
|
|
|
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
|
* Boston, MA 021110-1307, USA.
|
|
|
|
*/
|
|
|
|
|
2012-09-20 21:26:28 +00:00
|
|
|
#include "kerncompat.h"
|
2015-08-31 16:15:27 +00:00
|
|
|
#include "androidcompat.h"
|
2012-09-20 21:26:28 +00:00
|
|
|
|
2011-07-18 12:37:24 +00:00
|
|
|
#include <sys/ioctl.h>
|
|
|
|
#include <sys/wait.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/un.h>
|
2012-05-16 16:51:28 +00:00
|
|
|
#include <sys/syscall.h>
|
2011-07-18 12:37:24 +00:00
|
|
|
#include <poll.h>
|
|
|
|
#include <sys/file.h>
|
|
|
|
#include <uuid/uuid.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <pthread.h>
|
|
|
|
#include <ctype.h>
|
|
|
|
#include <signal.h>
|
|
|
|
#include <stdarg.h>
|
2015-07-29 18:37:37 +00:00
|
|
|
#include <limits.h>
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
#include "ctree.h"
|
|
|
|
#include "ioctl.h"
|
2019-06-19 23:46:21 +00:00
|
|
|
#include "common/utils.h"
|
2011-07-18 12:37:24 +00:00
|
|
|
#include "volumes.h"
|
|
|
|
#include "disk-io.h"
|
|
|
|
|
2019-06-19 23:46:21 +00:00
|
|
|
#include "cmds/commands.h"
|
2019-06-19 23:46:21 +00:00
|
|
|
#include "common/help.h"
|
2012-02-03 19:00:17 +00:00
|
|
|
|
2012-02-08 15:45:54 +00:00
|
|
|
static const char * const scrub_cmd_group_usage[] = {
|
|
|
|
"btrfs scrub <command> [options] <path>|<device>",
|
|
|
|
NULL
|
|
|
|
};
|
2012-02-03 19:00:17 +00:00
|
|
|
|
2011-07-18 12:37:24 +00:00
|
|
|
#define SCRUB_DATA_FILE "/var/lib/btrfs/scrub.status"
|
|
|
|
#define SCRUB_PROGRESS_SOCKET_PATH "/var/lib/btrfs/scrub.progress"
|
|
|
|
#define SCRUB_FILE_VERSION_PREFIX "scrub status"
|
|
|
|
#define SCRUB_FILE_VERSION "1"
|
|
|
|
|
|
|
|
struct scrub_stats {
|
|
|
|
time_t t_start;
|
|
|
|
time_t t_resumed;
|
|
|
|
u64 duration;
|
|
|
|
u64 finished;
|
|
|
|
u64 canceled;
|
2014-10-02 17:15:38 +00:00
|
|
|
int in_progress;
|
2011-07-18 12:37:24 +00:00
|
|
|
};
|
|
|
|
|
2012-05-16 16:51:28 +00:00
|
|
|
/* TBD: replace with #include "linux/ioprio.h" in some years */
|
|
|
|
#if !defined (IOPRIO_H)
|
|
|
|
#define IOPRIO_WHO_PROCESS 1
|
|
|
|
#define IOPRIO_CLASS_SHIFT 13
|
|
|
|
#define IOPRIO_PRIO_VALUE(class, data) \
|
|
|
|
(((class) << IOPRIO_CLASS_SHIFT) | (data))
|
|
|
|
#define IOPRIO_CLASS_IDLE 3
|
|
|
|
#endif
|
|
|
|
|
2011-07-18 12:37:24 +00:00
|
|
|
struct scrub_progress {
|
|
|
|
struct btrfs_ioctl_scrub_args scrub_args;
|
|
|
|
int fd;
|
|
|
|
int ret;
|
|
|
|
int skip;
|
|
|
|
struct scrub_stats stats;
|
|
|
|
struct scrub_file_record *resumed;
|
|
|
|
int ioctl_errno;
|
|
|
|
pthread_mutex_t progress_mutex;
|
2012-05-16 16:51:28 +00:00
|
|
|
int ioprio_class;
|
|
|
|
int ioprio_classdata;
|
2011-07-18 12:37:24 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
struct scrub_file_record {
|
|
|
|
u8 fsid[BTRFS_FSID_SIZE];
|
|
|
|
u64 devid;
|
|
|
|
struct scrub_stats stats;
|
|
|
|
struct btrfs_scrub_progress p;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct scrub_progress_cycle {
|
|
|
|
int fdmnt;
|
|
|
|
int prg_fd;
|
|
|
|
int do_record;
|
|
|
|
struct btrfs_ioctl_fs_info_args *fi;
|
|
|
|
struct scrub_progress *progress;
|
|
|
|
struct scrub_progress *shared_progress;
|
|
|
|
pthread_mutex_t *write_mutex;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct scrub_fs_stat {
|
|
|
|
struct btrfs_scrub_progress p;
|
|
|
|
struct scrub_stats s;
|
|
|
|
int i;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void print_scrub_full(struct btrfs_scrub_progress *sp)
|
|
|
|
{
|
|
|
|
printf("\tdata_extents_scrubbed: %lld\n", sp->data_extents_scrubbed);
|
|
|
|
printf("\ttree_extents_scrubbed: %lld\n", sp->tree_extents_scrubbed);
|
|
|
|
printf("\tdata_bytes_scrubbed: %lld\n", sp->data_bytes_scrubbed);
|
|
|
|
printf("\ttree_bytes_scrubbed: %lld\n", sp->tree_bytes_scrubbed);
|
|
|
|
printf("\tread_errors: %lld\n", sp->read_errors);
|
|
|
|
printf("\tcsum_errors: %lld\n", sp->csum_errors);
|
|
|
|
printf("\tverify_errors: %lld\n", sp->verify_errors);
|
|
|
|
printf("\tno_csum: %lld\n", sp->no_csum);
|
|
|
|
printf("\tcsum_discards: %lld\n", sp->csum_discards);
|
|
|
|
printf("\tsuper_errors: %lld\n", sp->super_errors);
|
|
|
|
printf("\tmalloc_errors: %lld\n", sp->malloc_errors);
|
|
|
|
printf("\tuncorrectable_errors: %lld\n", sp->uncorrectable_errors);
|
|
|
|
printf("\tunverified_errors: %lld\n", sp->unverified_errors);
|
|
|
|
printf("\tcorrected_errors: %lld\n", sp->corrected_errors);
|
|
|
|
printf("\tlast_physical: %lld\n", sp->last_physical);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define PRINT_SCRUB_ERROR(test, desc) do { \
|
|
|
|
if (test) \
|
|
|
|
printf(" %s=%llu", desc, test); \
|
|
|
|
} while (0)
|
|
|
|
|
2019-06-04 19:36:34 +00:00
|
|
|
static void print_scrub_summary(struct btrfs_scrub_progress *p, struct scrub_stats *s, u64 bytes_total)
|
2011-07-18 12:37:24 +00:00
|
|
|
{
|
|
|
|
u64 err_cnt;
|
|
|
|
u64 err_cnt2;
|
2019-06-04 19:36:34 +00:00
|
|
|
u64 bytes_scrubbed;
|
|
|
|
u64 bytes_per_sec = 0;
|
|
|
|
u64 sec_left = 0;
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
time_t sec_eta;
|
2019-06-04 19:36:34 +00:00
|
|
|
|
|
|
|
bytes_scrubbed = p->data_bytes_scrubbed + p->tree_bytes_scrubbed;
|
|
|
|
if (s->duration > 0)
|
|
|
|
bytes_per_sec = bytes_scrubbed / s->duration;
|
|
|
|
if (bytes_per_sec > 0)
|
|
|
|
sec_left = (bytes_total - bytes_scrubbed) / bytes_per_sec;
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
err_cnt = p->read_errors +
|
|
|
|
p->csum_errors +
|
|
|
|
p->verify_errors +
|
|
|
|
p->super_errors;
|
|
|
|
|
|
|
|
err_cnt2 = p->corrected_errors + p->uncorrectable_errors;
|
|
|
|
|
|
|
|
if (p->malloc_errors)
|
|
|
|
printf("*** WARNING: memory allocation failed while scrubbing. "
|
|
|
|
"results may be inaccurate\n");
|
2013-07-09 20:24:43 +00:00
|
|
|
|
2019-06-04 19:36:34 +00:00
|
|
|
if (s->in_progress) {
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
char t[4096];
|
|
|
|
struct tm tm;
|
|
|
|
|
2019-07-07 17:58:56 +00:00
|
|
|
sec_eta = time(NULL);
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
sec_eta += sec_left;
|
|
|
|
localtime_r(&sec_eta, &tm);
|
|
|
|
t[sizeof(t) - 1] = '\0';
|
|
|
|
strftime(t, sizeof(t), "%c", &tm);
|
|
|
|
|
|
|
|
printf("Time left: %llu:%02llu:%02llu\n",
|
2019-06-04 19:36:34 +00:00
|
|
|
sec_left / 3600, (sec_left / 60) % 60, sec_left % 60);
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
printf("ETA: %s\n", t);
|
|
|
|
printf("Total to scrub: %s\n", pretty_size(bytes_total));
|
|
|
|
printf("Bytes scrubbed: %s\n", pretty_size(bytes_scrubbed));
|
|
|
|
printf("Rate: %s/s\n", pretty_size(bytes_per_sec));
|
2019-06-04 19:36:34 +00:00
|
|
|
} else {
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
printf("Total to scrub: %s\n", pretty_size(bytes_total));
|
|
|
|
printf("Rate: %s/s\n", pretty_size(bytes_per_sec));
|
2019-06-04 19:36:34 +00:00
|
|
|
}
|
|
|
|
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
printf("Error summary: ");
|
2011-07-18 12:37:24 +00:00
|
|
|
if (err_cnt || err_cnt2) {
|
|
|
|
PRINT_SCRUB_ERROR(p->read_errors, "read");
|
|
|
|
PRINT_SCRUB_ERROR(p->super_errors, "super");
|
|
|
|
PRINT_SCRUB_ERROR(p->verify_errors, "verify");
|
|
|
|
PRINT_SCRUB_ERROR(p->csum_errors, "csum");
|
|
|
|
printf("\n");
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
printf(" Corrected: %llu\n", p->corrected_errors);
|
|
|
|
printf(" Uncorrectable: %llu\n", p->uncorrectable_errors);
|
|
|
|
printf(" Unverified: %llu\n", p->unverified_errors);
|
2019-06-04 19:36:34 +00:00
|
|
|
} else {
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
printf(" no errors found\n");
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#define _SCRUB_FS_STAT(p, name, fs_stat) do { \
|
|
|
|
fs_stat->p.name += p->name; \
|
|
|
|
} while (0)
|
|
|
|
|
2019-06-18 08:08:25 +00:00
|
|
|
#define _SCRUB_FS_STAT_COPY(p, name, fs_stat) do { \
|
|
|
|
fs_stat->p.name = p->name; \
|
|
|
|
} while (0)
|
|
|
|
|
2011-07-18 12:37:24 +00:00
|
|
|
#define _SCRUB_FS_STAT_MIN(ss, name, fs_stat) \
|
|
|
|
do { \
|
|
|
|
if (fs_stat->s.name > ss->name) { \
|
|
|
|
fs_stat->s.name = ss->name; \
|
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
#define _SCRUB_FS_STAT_ZMIN(ss, name, fs_stat) \
|
|
|
|
do { \
|
|
|
|
if (!fs_stat->s.name || fs_stat->s.name > ss->name) { \
|
|
|
|
fs_stat->s.name = ss->name; \
|
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
#define _SCRUB_FS_STAT_ZMAX(ss, name, fs_stat) \
|
|
|
|
do { \
|
|
|
|
if (!(fs_stat)->s.name || (fs_stat)->s.name < (ss)->name) { \
|
|
|
|
(fs_stat)->s.name = (ss)->name; \
|
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
static void add_to_fs_stat(struct btrfs_scrub_progress *p,
|
|
|
|
struct scrub_stats *ss,
|
|
|
|
struct scrub_fs_stat *fs_stat)
|
|
|
|
{
|
|
|
|
_SCRUB_FS_STAT(p, data_extents_scrubbed, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, tree_extents_scrubbed, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, data_bytes_scrubbed, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, tree_bytes_scrubbed, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, read_errors, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, csum_errors, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, verify_errors, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, no_csum, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, csum_discards, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, super_errors, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, malloc_errors, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, uncorrectable_errors, fs_stat);
|
|
|
|
_SCRUB_FS_STAT(p, corrected_errors, fs_stat);
|
2019-06-18 08:08:25 +00:00
|
|
|
_SCRUB_FS_STAT_COPY(p, last_physical, fs_stat);
|
2011-07-18 12:37:24 +00:00
|
|
|
_SCRUB_FS_STAT_ZMIN(ss, t_start, fs_stat);
|
|
|
|
_SCRUB_FS_STAT_ZMIN(ss, t_resumed, fs_stat);
|
|
|
|
_SCRUB_FS_STAT_ZMAX(ss, duration, fs_stat);
|
|
|
|
_SCRUB_FS_STAT_ZMAX(ss, canceled, fs_stat);
|
|
|
|
_SCRUB_FS_STAT_MIN(ss, finished, fs_stat);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void init_fs_stat(struct scrub_fs_stat *fs_stat)
|
|
|
|
{
|
|
|
|
memset(fs_stat, 0, sizeof(*fs_stat));
|
|
|
|
fs_stat->s.finished = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void _print_scrub_ss(struct scrub_stats *ss)
|
|
|
|
{
|
|
|
|
char t[4096];
|
|
|
|
struct tm tm;
|
2015-06-04 14:49:00 +00:00
|
|
|
time_t seconds;
|
|
|
|
unsigned hours;
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
if (!ss || !ss->t_start) {
|
|
|
|
printf("\tno stats available\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (ss->t_resumed) {
|
|
|
|
localtime_r(&ss->t_resumed, &tm);
|
|
|
|
strftime(t, sizeof(t), "%c", &tm);
|
|
|
|
t[sizeof(t) - 1] = '\0';
|
2019-07-07 18:00:38 +00:00
|
|
|
printf("Scrub resumed: %s\n", t);
|
2011-07-18 12:37:24 +00:00
|
|
|
} else {
|
|
|
|
localtime_r(&ss->t_start, &tm);
|
|
|
|
strftime(t, sizeof(t), "%c", &tm);
|
|
|
|
t[sizeof(t) - 1] = '\0';
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
printf("Scrub started: %s\n", t);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
2015-06-04 14:49:00 +00:00
|
|
|
|
|
|
|
seconds = ss->duration;
|
|
|
|
hours = ss->duration / (60 * 60);
|
|
|
|
gmtime_r(&seconds, &tm);
|
|
|
|
strftime(t, sizeof(t), "%M:%S", &tm);
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
printf("Status: %s\n",
|
|
|
|
(ss->in_progress ? "running" :
|
|
|
|
(ss->canceled ? "aborted" :
|
|
|
|
(ss->finished ? "finished" : "interrupted"))));
|
|
|
|
printf("Duration: %u:%s\n", hours, t);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void print_scrub_dev(struct btrfs_ioctl_dev_info_args *di,
|
|
|
|
struct btrfs_scrub_progress *p, int raw,
|
|
|
|
const char *append, struct scrub_stats *ss)
|
|
|
|
{
|
|
|
|
printf("scrub device %s (id %llu) %s\n", di->path, di->devid,
|
|
|
|
append ? append : "");
|
|
|
|
|
|
|
|
_print_scrub_ss(ss);
|
|
|
|
|
|
|
|
if (p) {
|
|
|
|
if (raw)
|
|
|
|
print_scrub_full(p);
|
|
|
|
else
|
2019-06-04 19:36:34 +00:00
|
|
|
print_scrub_summary(p, ss, di->bytes_used);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-06-04 19:36:34 +00:00
|
|
|
static void print_fs_stat(struct scrub_fs_stat *fs_stat, int raw, u64 bytes_total)
|
2011-07-18 12:37:24 +00:00
|
|
|
{
|
|
|
|
_print_scrub_ss(&fs_stat->s);
|
|
|
|
|
|
|
|
if (raw)
|
|
|
|
print_scrub_full(&fs_stat->p);
|
|
|
|
else
|
2019-06-04 19:36:34 +00:00
|
|
|
print_scrub_summary(&fs_stat->p, &fs_stat->s, bytes_total);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void free_history(struct scrub_file_record **last_scrubs)
|
|
|
|
{
|
|
|
|
struct scrub_file_record **l = last_scrubs;
|
2013-12-04 09:24:36 +00:00
|
|
|
if (!l || IS_ERR(l))
|
2011-07-18 12:37:24 +00:00
|
|
|
return;
|
|
|
|
while (*l)
|
|
|
|
free(*l++);
|
|
|
|
free(last_scrubs);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* cancels a running scrub and makes the master process record the current
|
|
|
|
* progress status before exiting.
|
|
|
|
*/
|
|
|
|
static int cancel_fd = -1;
|
|
|
|
static void scrub_sigint_record_progress(int signal)
|
|
|
|
{
|
2013-03-04 22:35:42 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = ioctl(cancel_fd, BTRFS_IOC_SCRUB_CANCEL, NULL);
|
|
|
|
if (ret < 0)
|
|
|
|
perror("Scrub cancel failed");
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_handle_sigint_parent(void)
|
|
|
|
{
|
|
|
|
struct sigaction sa = {
|
|
|
|
.sa_handler = SIG_IGN,
|
|
|
|
.sa_flags = SA_RESTART,
|
|
|
|
};
|
|
|
|
|
|
|
|
return sigaction(SIGINT, &sa, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_handle_sigint_child(int fd)
|
|
|
|
{
|
|
|
|
struct sigaction sa = {
|
|
|
|
.sa_handler = fd == -1 ? SIG_DFL : scrub_sigint_record_progress,
|
|
|
|
};
|
|
|
|
|
|
|
|
cancel_fd = fd;
|
|
|
|
return sigaction(SIGINT, &sa, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_datafile(const char *fn_base, const char *fn_local,
|
|
|
|
const char *fn_tmp, char *datafile, int size)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
int end = size - 2;
|
|
|
|
|
|
|
|
datafile[end + 1] = '\0';
|
|
|
|
strncpy(datafile, fn_base, end);
|
|
|
|
ret = strlen(datafile);
|
|
|
|
|
|
|
|
if (ret + 1 > end)
|
|
|
|
return -EOVERFLOW;
|
|
|
|
|
|
|
|
datafile[ret] = '.';
|
|
|
|
strncpy(datafile + ret + 1, fn_local, end - ret - 1);
|
|
|
|
ret = strlen(datafile);
|
|
|
|
|
|
|
|
if (ret + 1 > end)
|
|
|
|
return -EOVERFLOW;
|
|
|
|
|
|
|
|
if (fn_tmp) {
|
|
|
|
datafile[ret] = '_';
|
|
|
|
strncpy(datafile + ret + 1, fn_tmp, end - ret - 1);
|
|
|
|
ret = strlen(datafile);
|
|
|
|
|
|
|
|
if (ret > end)
|
|
|
|
return -EOVERFLOW;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_open_file(const char *datafile, int m)
|
|
|
|
{
|
|
|
|
int fd;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
fd = open(datafile, m, 0600);
|
|
|
|
if (fd < 0)
|
|
|
|
return -errno;
|
|
|
|
|
|
|
|
ret = flock(fd, LOCK_EX|LOCK_NB);
|
|
|
|
if (ret) {
|
|
|
|
ret = errno;
|
|
|
|
close(fd);
|
|
|
|
return -ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
return fd;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_open_file_r(const char *fn_base, const char *fn_local)
|
|
|
|
{
|
|
|
|
int ret;
|
2015-06-12 11:18:44 +00:00
|
|
|
char datafile[PATH_MAX];
|
2011-07-18 12:37:24 +00:00
|
|
|
ret = scrub_datafile(fn_base, fn_local, NULL,
|
|
|
|
datafile, sizeof(datafile));
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
return scrub_open_file(datafile, O_RDONLY);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_open_file_w(const char *fn_base, const char *fn_local,
|
|
|
|
const char *tmp)
|
|
|
|
{
|
|
|
|
int ret;
|
2015-06-12 11:18:44 +00:00
|
|
|
char datafile[PATH_MAX];
|
2011-07-18 12:37:24 +00:00
|
|
|
ret = scrub_datafile(fn_base, fn_local, tmp,
|
|
|
|
datafile, sizeof(datafile));
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
return scrub_open_file(datafile, O_WRONLY|O_CREAT);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_rename_file(const char *fn_base, const char *fn_local,
|
|
|
|
const char *tmp)
|
|
|
|
{
|
|
|
|
int ret;
|
2015-06-12 11:18:44 +00:00
|
|
|
char datafile_old[PATH_MAX];
|
|
|
|
char datafile_new[PATH_MAX];
|
2011-07-18 12:37:24 +00:00
|
|
|
ret = scrub_datafile(fn_base, fn_local, tmp,
|
|
|
|
datafile_old, sizeof(datafile_old));
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
ret = scrub_datafile(fn_base, fn_local, NULL,
|
|
|
|
datafile_new, sizeof(datafile_new));
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
ret = rename(datafile_old, datafile_new);
|
|
|
|
return ret ? -errno : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define _SCRUB_KVREAD(ret, i, name, avail, l, dest) if (ret == 0) { \
|
|
|
|
ret = scrub_kvread(i, sizeof(#name), avail, l, #name, dest.name); \
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* returns 0 if the key did not match (nothing was read)
|
|
|
|
* 1 if the key did match (success)
|
2016-05-11 23:50:36 +00:00
|
|
|
* -1 if the key did match and an error occurred
|
2011-07-18 12:37:24 +00:00
|
|
|
*/
|
|
|
|
static int scrub_kvread(int *i, int len, int avail, const char *buf,
|
|
|
|
const char *key, u64 *dest)
|
|
|
|
{
|
|
|
|
int j;
|
|
|
|
|
|
|
|
if (*i + len + 1 < avail && strncmp(&buf[*i], key, len - 1) == 0) {
|
|
|
|
*i += len - 1;
|
|
|
|
if (buf[*i] != ':')
|
|
|
|
return -1;
|
|
|
|
*i += 1;
|
|
|
|
for (j = 0; isdigit(buf[*i + j]) && *i + j < avail; ++j)
|
|
|
|
;
|
|
|
|
if (*i + j >= avail)
|
|
|
|
return -1;
|
|
|
|
*dest = atoll(&buf[*i]);
|
|
|
|
*i += j;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define _SCRUB_INVALID do { \
|
|
|
|
if (report_errors) \
|
2015-09-28 13:58:14 +00:00
|
|
|
warning("invalid data on line %d pos " \
|
|
|
|
"%d state %d (near \"%.*s\") at %s:%d", \
|
2011-07-18 12:37:24 +00:00
|
|
|
lineno, i, state, 20 > avail ? avail : 20, \
|
|
|
|
l + i, __FILE__, __LINE__); \
|
|
|
|
goto skip; \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
static struct scrub_file_record **scrub_read_file(int fd, int report_errors)
|
|
|
|
{
|
|
|
|
int avail = 0;
|
|
|
|
int old_avail = 0;
|
2017-01-24 03:03:05 +00:00
|
|
|
char l[SZ_16K];
|
2011-07-18 12:37:24 +00:00
|
|
|
int state = 0;
|
|
|
|
int curr = -1;
|
|
|
|
int i = 0;
|
|
|
|
int j;
|
|
|
|
int ret;
|
|
|
|
int eof = 0;
|
|
|
|
int lineno = 0;
|
|
|
|
u64 version;
|
|
|
|
char empty_uuid[BTRFS_FSID_SIZE] = {0};
|
|
|
|
struct scrub_file_record **p = NULL;
|
|
|
|
|
|
|
|
again:
|
|
|
|
old_avail = avail - i;
|
2016-08-26 10:53:31 +00:00
|
|
|
if (old_avail < 0) {
|
|
|
|
error("scrub record file corrupted near byte %d", i);
|
|
|
|
return ERR_PTR(-EINVAL);
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
if (old_avail)
|
|
|
|
memmove(l, l + i, old_avail);
|
|
|
|
avail = read(fd, l + old_avail, sizeof(l) - old_avail);
|
|
|
|
if (avail == 0)
|
|
|
|
eof = 1;
|
|
|
|
if (avail == 0 && old_avail == 0) {
|
|
|
|
if (curr >= 0 &&
|
|
|
|
memcmp(p[curr]->fsid, empty_uuid, BTRFS_FSID_SIZE) == 0) {
|
|
|
|
p[curr] = NULL;
|
|
|
|
} else if (curr == -1) {
|
|
|
|
p = ERR_PTR(-ENODATA);
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
2015-08-21 08:51:52 +00:00
|
|
|
if (avail == -1) {
|
|
|
|
free_history(p);
|
2011-07-18 12:37:24 +00:00
|
|
|
return ERR_PTR(-errno);
|
2015-08-21 08:51:52 +00:00
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
avail += old_avail;
|
|
|
|
|
|
|
|
i = 0;
|
|
|
|
while (i < avail) {
|
2015-08-21 08:51:52 +00:00
|
|
|
void *tmp;
|
|
|
|
|
2011-07-18 12:37:24 +00:00
|
|
|
switch (state) {
|
|
|
|
case 0: /* start of file */
|
|
|
|
ret = scrub_kvread(&i,
|
|
|
|
sizeof(SCRUB_FILE_VERSION_PREFIX), avail, l,
|
|
|
|
SCRUB_FILE_VERSION_PREFIX, &version);
|
|
|
|
if (ret != 1)
|
|
|
|
_SCRUB_INVALID;
|
|
|
|
if (version != atoll(SCRUB_FILE_VERSION))
|
|
|
|
return ERR_PTR(-ENOTSUP);
|
|
|
|
state = 6;
|
|
|
|
continue;
|
|
|
|
case 1: /* start of line, alloc */
|
|
|
|
/*
|
|
|
|
* this state makes sure we have a complete line in
|
|
|
|
* further processing, so we don't need wrap-tracking
|
|
|
|
* everywhere.
|
|
|
|
*/
|
|
|
|
if (!eof && !memchr(l + i, '\n', avail - i))
|
|
|
|
goto again;
|
|
|
|
++lineno;
|
|
|
|
if (curr > -1 && memcmp(p[curr]->fsid, empty_uuid,
|
|
|
|
BTRFS_FSID_SIZE) == 0) {
|
|
|
|
state = 2;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
++curr;
|
2015-08-21 08:51:52 +00:00
|
|
|
tmp = p;
|
2011-07-18 12:37:24 +00:00
|
|
|
p = realloc(p, (curr + 2) * sizeof(*p));
|
2015-08-21 08:51:52 +00:00
|
|
|
if (!p) {
|
|
|
|
free_history(tmp);
|
2011-07-18 12:37:24 +00:00
|
|
|
return ERR_PTR(-errno);
|
2015-08-21 08:51:52 +00:00
|
|
|
}
|
|
|
|
p[curr] = malloc(sizeof(**p));
|
|
|
|
if (!p[curr]) {
|
|
|
|
free_history(p);
|
|
|
|
return ERR_PTR(-errno);
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
memset(p[curr], 0, sizeof(**p));
|
|
|
|
p[curr + 1] = NULL;
|
|
|
|
++state;
|
|
|
|
/* fall through */
|
|
|
|
case 2: /* start of line, skip space */
|
|
|
|
while (isspace(l[i]) && i < avail) {
|
|
|
|
if (l[i] == '\n')
|
|
|
|
++lineno;
|
|
|
|
++i;
|
|
|
|
}
|
|
|
|
if (i >= avail ||
|
|
|
|
(!eof && !memchr(l + i, '\n', avail - i)))
|
|
|
|
goto again;
|
|
|
|
++state;
|
|
|
|
/* fall through */
|
|
|
|
case 3: /* read fsid */
|
|
|
|
if (i == avail)
|
|
|
|
continue;
|
|
|
|
for (j = 0; l[i + j] != ':' && i + j < avail; ++j)
|
|
|
|
;
|
|
|
|
if (i + j + 1 >= avail)
|
|
|
|
_SCRUB_INVALID;
|
2014-07-17 02:40:38 +00:00
|
|
|
if (j != BTRFS_UUID_UNPARSED_SIZE - 1)
|
2011-07-18 12:37:24 +00:00
|
|
|
_SCRUB_INVALID;
|
|
|
|
l[i + j] = '\0';
|
|
|
|
ret = uuid_parse(l + i, p[curr]->fsid);
|
|
|
|
if (ret)
|
|
|
|
_SCRUB_INVALID;
|
|
|
|
i += j + 1;
|
|
|
|
++state;
|
|
|
|
/* fall through */
|
|
|
|
case 4: /* read dev id */
|
|
|
|
for (j = 0; isdigit(l[i + j]) && i+j < avail; ++j)
|
|
|
|
;
|
|
|
|
if (j == 0 || i + j + 1 >= avail)
|
|
|
|
_SCRUB_INVALID;
|
|
|
|
p[curr]->devid = atoll(&l[i]);
|
|
|
|
i += j + 1;
|
|
|
|
++state;
|
|
|
|
/* fall through */
|
|
|
|
case 5: /* read key/value pair */
|
|
|
|
ret = 0;
|
|
|
|
_SCRUB_KVREAD(ret, &i, data_extents_scrubbed, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, tree_extents_scrubbed, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, data_bytes_scrubbed, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, tree_bytes_scrubbed, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, read_errors, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, csum_errors, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, verify_errors, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, no_csum, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, csum_discards, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, super_errors, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, malloc_errors, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, uncorrectable_errors, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, corrected_errors, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, last_physical, avail, l,
|
|
|
|
&p[curr]->p);
|
|
|
|
_SCRUB_KVREAD(ret, &i, finished, avail, l,
|
|
|
|
&p[curr]->stats);
|
|
|
|
_SCRUB_KVREAD(ret, &i, t_start, avail, l,
|
|
|
|
(u64 *)&p[curr]->stats);
|
|
|
|
_SCRUB_KVREAD(ret, &i, t_resumed, avail, l,
|
|
|
|
(u64 *)&p[curr]->stats);
|
|
|
|
_SCRUB_KVREAD(ret, &i, duration, avail, l,
|
|
|
|
(u64 *)&p[curr]->stats);
|
|
|
|
_SCRUB_KVREAD(ret, &i, canceled, avail, l,
|
|
|
|
&p[curr]->stats);
|
|
|
|
if (ret != 1)
|
|
|
|
_SCRUB_INVALID;
|
|
|
|
++state;
|
|
|
|
/* fall through */
|
|
|
|
case 6: /* after number */
|
|
|
|
if (l[i] == '|')
|
|
|
|
state = 5;
|
|
|
|
else if (l[i] == '\n')
|
|
|
|
state = 1;
|
|
|
|
else
|
|
|
|
_SCRUB_INVALID;
|
|
|
|
++i;
|
|
|
|
continue;
|
|
|
|
case 99: /* skip rest of line */
|
|
|
|
skip:
|
|
|
|
state = 99;
|
|
|
|
do {
|
|
|
|
++i;
|
|
|
|
if (l[i - 1] == '\n') {
|
|
|
|
state = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} while (i < avail);
|
|
|
|
continue;
|
|
|
|
}
|
2016-08-26 10:53:31 +00:00
|
|
|
error("internal error: unknown parser state %d near byte %d",
|
|
|
|
state, i);
|
|
|
|
return ERR_PTR(-EINVAL);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_write_buf(int fd, const void *data, int len)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
ret = write(fd, data, len);
|
|
|
|
return ret - len;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_writev(int fd, char *buf, int max, const char *fmt, ...)
|
|
|
|
__attribute__ ((format (printf, 4, 5)));
|
|
|
|
static int scrub_writev(int fd, char *buf, int max, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
va_list args;
|
|
|
|
|
|
|
|
va_start(args, fmt);
|
|
|
|
ret = vsnprintf(buf, max, fmt, args);
|
|
|
|
va_end(args);
|
|
|
|
if (ret >= max)
|
|
|
|
return ret - max;
|
|
|
|
return scrub_write_buf(fd, buf, ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define _SCRUB_SUM(dest, data, name) dest->scrub_args.progress.name = \
|
|
|
|
data->resumed->p.name + data->scrub_args.progress.name
|
2019-06-18 08:08:25 +00:00
|
|
|
#define _SCRUB_COPY(dest, data, name) dest->scrub_args.progress.name = \
|
|
|
|
data->scrub_args.progress.name
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
static struct scrub_progress *scrub_resumed_stats(struct scrub_progress *data,
|
|
|
|
struct scrub_progress *dest)
|
|
|
|
{
|
|
|
|
if (!data->resumed || data->skip)
|
|
|
|
return data;
|
|
|
|
|
|
|
|
_SCRUB_SUM(dest, data, data_extents_scrubbed);
|
|
|
|
_SCRUB_SUM(dest, data, tree_extents_scrubbed);
|
|
|
|
_SCRUB_SUM(dest, data, data_bytes_scrubbed);
|
|
|
|
_SCRUB_SUM(dest, data, tree_bytes_scrubbed);
|
|
|
|
_SCRUB_SUM(dest, data, read_errors);
|
|
|
|
_SCRUB_SUM(dest, data, csum_errors);
|
|
|
|
_SCRUB_SUM(dest, data, verify_errors);
|
|
|
|
_SCRUB_SUM(dest, data, no_csum);
|
|
|
|
_SCRUB_SUM(dest, data, csum_discards);
|
|
|
|
_SCRUB_SUM(dest, data, super_errors);
|
|
|
|
_SCRUB_SUM(dest, data, malloc_errors);
|
|
|
|
_SCRUB_SUM(dest, data, uncorrectable_errors);
|
|
|
|
_SCRUB_SUM(dest, data, corrected_errors);
|
2019-06-18 08:08:25 +00:00
|
|
|
_SCRUB_COPY(dest, data, last_physical);
|
2011-07-18 12:37:24 +00:00
|
|
|
dest->stats.canceled = data->stats.canceled;
|
|
|
|
dest->stats.finished = data->stats.finished;
|
|
|
|
dest->stats.t_resumed = data->stats.t_start;
|
|
|
|
dest->stats.t_start = data->resumed->stats.t_start;
|
|
|
|
dest->stats.duration = data->resumed->stats.duration +
|
|
|
|
data->stats.duration;
|
|
|
|
dest->scrub_args.devid = data->scrub_args.devid;
|
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define _SCRUB_KVWRITE(fd, buf, name, use) \
|
|
|
|
scrub_kvwrite(fd, buf, sizeof(buf), #name, \
|
|
|
|
use->scrub_args.progress.name)
|
|
|
|
|
|
|
|
#define _SCRUB_KVWRITE_STATS(fd, buf, name, use) \
|
|
|
|
scrub_kvwrite(fd, buf, sizeof(buf), #name, \
|
|
|
|
use->stats.name)
|
|
|
|
|
|
|
|
static int scrub_kvwrite(int fd, char *buf, int max, const char *key, u64 val)
|
|
|
|
{
|
|
|
|
return scrub_writev(fd, buf, max, "|%s:%lld", key, val);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_write_file(int fd, const char *fsid,
|
|
|
|
struct scrub_progress *data, int n)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
int i;
|
|
|
|
char buf[1024];
|
|
|
|
struct scrub_progress local;
|
|
|
|
struct scrub_progress *use;
|
|
|
|
|
|
|
|
if (n < 1)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
/* each -1 is to subtract one \0 byte, the + 2 is for ':' and '\n' */
|
|
|
|
ret = scrub_write_buf(fd, SCRUB_FILE_VERSION_PREFIX ":"
|
|
|
|
SCRUB_FILE_VERSION "\n",
|
|
|
|
(sizeof(SCRUB_FILE_VERSION_PREFIX) - 1) +
|
|
|
|
(sizeof(SCRUB_FILE_VERSION) - 1) + 2);
|
|
|
|
if (ret)
|
|
|
|
return -EOVERFLOW;
|
|
|
|
|
|
|
|
for (i = 0; i < n; ++i) {
|
|
|
|
use = scrub_resumed_stats(&data[i], &local);
|
|
|
|
if (scrub_write_buf(fd, fsid, strlen(fsid)) ||
|
|
|
|
scrub_write_buf(fd, ":", 1) ||
|
|
|
|
scrub_writev(fd, buf, sizeof(buf), "%lld",
|
|
|
|
use->scrub_args.devid) ||
|
|
|
|
scrub_write_buf(fd, buf, ret) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, data_extents_scrubbed, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, tree_extents_scrubbed, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, data_bytes_scrubbed, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, tree_bytes_scrubbed, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, read_errors, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, csum_errors, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, verify_errors, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, no_csum, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, csum_discards, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, super_errors, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, malloc_errors, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, uncorrectable_errors, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, corrected_errors, use) ||
|
|
|
|
_SCRUB_KVWRITE(fd, buf, last_physical, use) ||
|
|
|
|
_SCRUB_KVWRITE_STATS(fd, buf, t_start, use) ||
|
|
|
|
_SCRUB_KVWRITE_STATS(fd, buf, t_resumed, use) ||
|
|
|
|
_SCRUB_KVWRITE_STATS(fd, buf, duration, use) ||
|
|
|
|
_SCRUB_KVWRITE_STATS(fd, buf, canceled, use) ||
|
|
|
|
_SCRUB_KVWRITE_STATS(fd, buf, finished, use) ||
|
|
|
|
scrub_write_buf(fd, "\n", 1)) {
|
|
|
|
return -EOVERFLOW;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int scrub_write_progress(pthread_mutex_t *m, const char *fsid,
|
|
|
|
struct scrub_progress *data, int n)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
int err;
|
2013-01-23 22:41:03 +00:00
|
|
|
int fd = -1;
|
2011-07-18 12:37:24 +00:00
|
|
|
int old;
|
|
|
|
|
2014-03-25 14:47:07 +00:00
|
|
|
ret = pthread_setcancelstate(PTHREAD_CANCEL_DISABLE, &old);
|
2011-07-18 12:37:24 +00:00
|
|
|
if (ret) {
|
2013-03-04 22:49:40 +00:00
|
|
|
err = -ret;
|
2014-03-25 14:47:07 +00:00
|
|
|
goto out3;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
2014-03-25 14:47:07 +00:00
|
|
|
ret = pthread_mutex_lock(m);
|
2011-07-18 12:37:24 +00:00
|
|
|
if (ret) {
|
|
|
|
err = -ret;
|
2014-03-25 14:47:07 +00:00
|
|
|
goto out2;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
fd = scrub_open_file_w(SCRUB_DATA_FILE, fsid, "tmp");
|
|
|
|
if (fd < 0) {
|
|
|
|
err = fd;
|
2014-03-25 14:47:07 +00:00
|
|
|
goto out1;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
err = scrub_write_file(fd, fsid, data, n);
|
|
|
|
if (err)
|
2014-03-25 14:47:07 +00:00
|
|
|
goto out1;
|
2011-07-18 12:37:24 +00:00
|
|
|
err = scrub_rename_file(SCRUB_DATA_FILE, fsid, "tmp");
|
|
|
|
if (err)
|
2014-03-25 14:47:07 +00:00
|
|
|
goto out1;
|
2011-07-18 12:37:24 +00:00
|
|
|
|
2014-03-25 14:47:07 +00:00
|
|
|
out1:
|
2013-01-23 22:41:03 +00:00
|
|
|
if (fd >= 0) {
|
2011-07-18 12:37:24 +00:00
|
|
|
ret = close(fd);
|
|
|
|
if (ret)
|
|
|
|
err = -errno;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = pthread_mutex_unlock(m);
|
|
|
|
if (ret && !err)
|
|
|
|
err = -ret;
|
|
|
|
|
2014-03-25 14:47:07 +00:00
|
|
|
out2:
|
2011-07-18 12:37:24 +00:00
|
|
|
ret = pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, &old);
|
|
|
|
if (ret && !err)
|
|
|
|
err = -ret;
|
|
|
|
|
2014-03-25 14:47:07 +00:00
|
|
|
out3:
|
2011-07-18 12:37:24 +00:00
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *scrub_one_dev(void *ctx)
|
|
|
|
{
|
|
|
|
struct scrub_progress *sp = ctx;
|
|
|
|
int ret;
|
|
|
|
struct timeval tv;
|
|
|
|
|
|
|
|
sp->stats.canceled = 0;
|
|
|
|
sp->stats.duration = 0;
|
|
|
|
sp->stats.finished = 0;
|
|
|
|
|
2012-05-16 16:51:28 +00:00
|
|
|
ret = syscall(SYS_ioprio_set, IOPRIO_WHO_PROCESS, 0,
|
|
|
|
IOPRIO_PRIO_VALUE(sp->ioprio_class,
|
|
|
|
sp->ioprio_classdata));
|
|
|
|
if (ret)
|
2018-01-07 21:54:21 +00:00
|
|
|
warning("setting ioprio failed: %m (ignored)");
|
2012-05-16 16:51:28 +00:00
|
|
|
|
2011-07-18 12:37:24 +00:00
|
|
|
ret = ioctl(sp->fd, BTRFS_IOC_SCRUB, &sp->scrub_args);
|
|
|
|
gettimeofday(&tv, NULL);
|
|
|
|
sp->ret = ret;
|
|
|
|
sp->stats.duration = tv.tv_sec - sp->stats.t_start;
|
|
|
|
sp->stats.canceled = !!ret;
|
|
|
|
sp->ioctl_errno = errno;
|
|
|
|
ret = pthread_mutex_lock(&sp->progress_mutex);
|
|
|
|
if (ret)
|
|
|
|
return ERR_PTR(-ret);
|
|
|
|
sp->stats.finished = 1;
|
|
|
|
ret = pthread_mutex_unlock(&sp->progress_mutex);
|
|
|
|
if (ret)
|
|
|
|
return ERR_PTR(-ret);
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *progress_one_dev(void *ctx)
|
|
|
|
{
|
|
|
|
struct scrub_progress *sp = ctx;
|
|
|
|
|
|
|
|
sp->ret = ioctl(sp->fd, BTRFS_IOC_SCRUB_PROGRESS, &sp->scrub_args);
|
|
|
|
sp->ioctl_errno = errno;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2013-03-04 22:45:37 +00:00
|
|
|
/* nb: returns a negative errno via ERR_PTR */
|
2011-07-18 12:37:24 +00:00
|
|
|
static void *scrub_progress_cycle(void *ctx)
|
|
|
|
{
|
2014-05-28 21:01:39 +00:00
|
|
|
int ret = 0;
|
2013-03-04 22:45:37 +00:00
|
|
|
int perr = 0; /* positive / pthread error returns */
|
2011-07-18 12:37:24 +00:00
|
|
|
int old;
|
|
|
|
int i;
|
2013-11-04 07:17:41 +00:00
|
|
|
char fsid[BTRFS_UUID_UNPARSED_SIZE];
|
2011-07-18 12:37:24 +00:00
|
|
|
struct scrub_progress *sp;
|
|
|
|
struct scrub_progress *sp_last;
|
|
|
|
struct scrub_progress *sp_shared;
|
|
|
|
struct timeval tv;
|
|
|
|
struct scrub_progress_cycle *spc = ctx;
|
|
|
|
int ndev = spc->fi->num_devices;
|
|
|
|
int this = 1;
|
|
|
|
int last = 0;
|
|
|
|
int peer_fd = -1;
|
|
|
|
struct pollfd accept_poll_fd = {
|
|
|
|
.fd = spc->prg_fd,
|
|
|
|
.events = POLLIN,
|
|
|
|
.revents = 0,
|
|
|
|
};
|
|
|
|
struct pollfd write_poll_fd = {
|
|
|
|
.events = POLLOUT,
|
|
|
|
.revents = 0,
|
|
|
|
};
|
|
|
|
struct sockaddr_un peer;
|
|
|
|
socklen_t peer_size = sizeof(peer);
|
|
|
|
|
2013-03-04 22:45:37 +00:00
|
|
|
perr = pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, &old);
|
|
|
|
if (perr)
|
|
|
|
goto out;
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
uuid_unparse(spc->fi->fsid, fsid);
|
|
|
|
|
|
|
|
for (i = 0; i < ndev; ++i) {
|
|
|
|
sp = &spc->progress[i];
|
|
|
|
sp_last = &spc->progress[i + ndev];
|
|
|
|
sp_shared = &spc->shared_progress[i];
|
|
|
|
sp->scrub_args.devid = sp_last->scrub_args.devid =
|
|
|
|
sp_shared->scrub_args.devid;
|
|
|
|
sp->fd = sp_last->fd = spc->fdmnt;
|
|
|
|
sp->stats.t_start = sp_last->stats.t_start =
|
|
|
|
sp_shared->stats.t_start;
|
|
|
|
sp->resumed = sp_last->resumed = sp_shared->resumed;
|
|
|
|
sp->skip = sp_last->skip = sp_shared->skip;
|
|
|
|
sp->stats.finished = sp_last->stats.finished =
|
|
|
|
sp_shared->stats.finished;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
ret = poll(&accept_poll_fd, 1, 5 * 1000);
|
2013-03-04 22:45:37 +00:00
|
|
|
if (ret == -1) {
|
|
|
|
ret = -errno;
|
|
|
|
goto out;
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
if (ret)
|
|
|
|
peer_fd = accept(spc->prg_fd, (struct sockaddr *)&peer,
|
|
|
|
&peer_size);
|
|
|
|
gettimeofday(&tv, NULL);
|
|
|
|
this = (this + 1)%2;
|
|
|
|
last = (last + 1)%2;
|
|
|
|
for (i = 0; i < ndev; ++i) {
|
|
|
|
sp = &spc->progress[this * ndev + i];
|
|
|
|
sp_last = &spc->progress[last * ndev + i];
|
|
|
|
sp_shared = &spc->shared_progress[i];
|
|
|
|
if (sp->stats.finished)
|
|
|
|
continue;
|
|
|
|
progress_one_dev(sp);
|
|
|
|
sp->stats.duration = tv.tv_sec - sp->stats.t_start;
|
|
|
|
if (!sp->ret)
|
|
|
|
continue;
|
|
|
|
if (sp->ioctl_errno != ENOTCONN &&
|
2013-03-04 22:45:37 +00:00
|
|
|
sp->ioctl_errno != ENODEV) {
|
|
|
|
ret = -sp->ioctl_errno;
|
|
|
|
goto out;
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
/*
|
|
|
|
* scrub finished or device removed, check the
|
|
|
|
* finished flag. if unset, just use the last
|
|
|
|
* result we got for the current write and go
|
|
|
|
* on. flag should be set on next cycle, then.
|
|
|
|
*/
|
2014-03-25 14:47:07 +00:00
|
|
|
perr = pthread_setcancelstate(
|
|
|
|
PTHREAD_CANCEL_DISABLE, &old);
|
|
|
|
if (perr)
|
|
|
|
goto out;
|
2013-03-04 22:45:37 +00:00
|
|
|
perr = pthread_mutex_lock(&sp_shared->progress_mutex);
|
|
|
|
if (perr)
|
|
|
|
goto out;
|
2011-07-18 12:37:24 +00:00
|
|
|
if (!sp_shared->stats.finished) {
|
2013-03-04 22:45:37 +00:00
|
|
|
perr = pthread_mutex_unlock(
|
2011-07-18 12:37:24 +00:00
|
|
|
&sp_shared->progress_mutex);
|
2013-03-04 22:45:37 +00:00
|
|
|
if (perr)
|
|
|
|
goto out;
|
2014-03-25 14:47:07 +00:00
|
|
|
perr = pthread_setcancelstate(
|
|
|
|
PTHREAD_CANCEL_ENABLE, &old);
|
|
|
|
if (perr)
|
|
|
|
goto out;
|
2011-07-18 12:37:24 +00:00
|
|
|
memcpy(sp, sp_last, sizeof(*sp));
|
|
|
|
continue;
|
|
|
|
}
|
2013-03-04 22:45:37 +00:00
|
|
|
perr = pthread_mutex_unlock(&sp_shared->progress_mutex);
|
2014-03-25 14:47:07 +00:00
|
|
|
if (perr)
|
|
|
|
goto out;
|
|
|
|
perr = pthread_setcancelstate(
|
|
|
|
PTHREAD_CANCEL_ENABLE, &old);
|
2013-03-04 22:45:37 +00:00
|
|
|
if (perr)
|
|
|
|
goto out;
|
2011-07-18 12:37:24 +00:00
|
|
|
memcpy(sp, sp_shared, sizeof(*sp));
|
|
|
|
memcpy(sp_last, sp_shared, sizeof(*sp));
|
|
|
|
}
|
|
|
|
if (peer_fd != -1) {
|
|
|
|
write_poll_fd.fd = peer_fd;
|
|
|
|
ret = poll(&write_poll_fd, 1, 0);
|
2013-03-04 22:45:37 +00:00
|
|
|
if (ret == -1) {
|
|
|
|
ret = -errno;
|
|
|
|
goto out;
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
if (ret) {
|
|
|
|
ret = scrub_write_file(
|
|
|
|
peer_fd, fsid,
|
|
|
|
&spc->progress[this * ndev], ndev);
|
|
|
|
if (ret)
|
2013-03-04 22:45:37 +00:00
|
|
|
goto out;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
close(peer_fd);
|
|
|
|
peer_fd = -1;
|
|
|
|
}
|
|
|
|
if (!spc->do_record)
|
|
|
|
continue;
|
|
|
|
ret = scrub_write_progress(spc->write_mutex, fsid,
|
|
|
|
&spc->progress[this * ndev], ndev);
|
|
|
|
if (ret)
|
2013-03-04 22:45:37 +00:00
|
|
|
goto out;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
2013-03-04 22:45:37 +00:00
|
|
|
out:
|
|
|
|
if (peer_fd != -1)
|
|
|
|
close(peer_fd);
|
|
|
|
if (perr)
|
|
|
|
ret = -perr;
|
|
|
|
return ERR_PTR(ret);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct scrub_file_record *last_dev_scrub(
|
|
|
|
struct scrub_file_record *const *const past_scrubs, u64 devid)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (!past_scrubs || IS_ERR(past_scrubs))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
for (i = 0; past_scrubs[i]; ++i)
|
|
|
|
if (past_scrubs[i]->devid == devid)
|
|
|
|
return past_scrubs[i];
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2013-08-09 20:20:47 +00:00
|
|
|
static int mkdir_p(char *path)
|
2011-07-18 12:37:24 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
for (i = 1; i < strlen(path); ++i) {
|
|
|
|
if (path[i] != '/')
|
|
|
|
continue;
|
|
|
|
path[i] = '\0';
|
|
|
|
ret = mkdir(path, 0777);
|
|
|
|
if (ret && errno != EEXIST)
|
2013-09-04 15:22:37 +00:00
|
|
|
return -errno;
|
2011-07-18 12:37:24 +00:00
|
|
|
path[i] = '/';
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-05-15 13:54:49 +00:00
|
|
|
static int is_scrub_running_on_fs(struct btrfs_ioctl_fs_info_args *fi_args,
|
|
|
|
struct btrfs_ioctl_dev_info_args *di_args,
|
|
|
|
struct scrub_file_record **past_scrubs)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (!fi_args || !di_args || !past_scrubs)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
for (i = 0; i < fi_args->num_devices; i++) {
|
|
|
|
struct scrub_file_record *sfr =
|
|
|
|
last_dev_scrub(past_scrubs, di_args[i].devid);
|
|
|
|
|
|
|
|
if (!sfr)
|
|
|
|
continue;
|
|
|
|
if (!(sfr->stats.finished || sfr->stats.canceled))
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-10-02 17:15:38 +00:00
|
|
|
static int is_scrub_running_in_kernel(int fd,
|
|
|
|
struct btrfs_ioctl_dev_info_args *di_args, u64 max_devices)
|
|
|
|
{
|
|
|
|
struct scrub_progress sp;
|
|
|
|
int i;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
for (i = 0; i < max_devices; i++) {
|
|
|
|
memset(&sp, 0, sizeof(sp));
|
|
|
|
sp.scrub_args.devid = di_args[i].devid;
|
|
|
|
ret = ioctl(fd, BTRFS_IOC_SCRUB_PROGRESS, &sp.scrub_args);
|
|
|
|
if (!ret)
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2015-01-19 17:47:20 +00:00
|
|
|
return 0;
|
2014-10-02 17:15:38 +00:00
|
|
|
}
|
|
|
|
|
2018-03-07 02:54:38 +00:00
|
|
|
static int scrub_start(const struct cmd_struct *cmd, int argc, char **argv,
|
|
|
|
bool resume)
|
2011-07-18 12:37:24 +00:00
|
|
|
{
|
|
|
|
int fdmnt;
|
|
|
|
int prg_fd = -1;
|
|
|
|
int fdres = -1;
|
|
|
|
int ret;
|
|
|
|
pid_t pid;
|
|
|
|
int c;
|
|
|
|
int i;
|
|
|
|
int err = 0;
|
|
|
|
int e_uncorrectable = 0;
|
|
|
|
int e_correctable = 0;
|
|
|
|
int print_raw = 0;
|
|
|
|
char *path;
|
|
|
|
int do_background = 1;
|
|
|
|
int do_wait = 0;
|
|
|
|
int do_print = 0;
|
2020-06-11 17:41:22 +00:00
|
|
|
int do_quiet = !bconf.verbose; /*Read the global quiet option if set*/
|
2011-07-18 12:37:24 +00:00
|
|
|
int do_record = 1;
|
|
|
|
int readonly = 0;
|
|
|
|
int do_stats_per_dev = 0;
|
2012-05-16 16:51:28 +00:00
|
|
|
int ioprio_class = IOPRIO_CLASS_IDLE;
|
|
|
|
int ioprio_classdata = 0;
|
2011-07-18 12:37:24 +00:00
|
|
|
int n_start = 0;
|
|
|
|
int n_skip = 0;
|
|
|
|
int n_resume = 0;
|
|
|
|
struct btrfs_ioctl_fs_info_args fi_args;
|
|
|
|
struct btrfs_ioctl_dev_info_args *di_args = NULL;
|
|
|
|
struct scrub_progress *sp = NULL;
|
|
|
|
struct scrub_fs_stat fs_stat;
|
|
|
|
struct timeval tv;
|
|
|
|
struct sockaddr_un addr = {
|
|
|
|
.sun_family = AF_UNIX,
|
|
|
|
};
|
|
|
|
pthread_t *t_devs = NULL;
|
|
|
|
pthread_t t_prog;
|
|
|
|
struct scrub_file_record **past_scrubs = NULL;
|
|
|
|
struct scrub_file_record *last_scrub = NULL;
|
|
|
|
char *datafile = strdup(SCRUB_DATA_FILE);
|
2013-11-04 07:17:41 +00:00
|
|
|
char fsid[BTRFS_UUID_UNPARSED_SIZE];
|
2015-06-12 11:18:44 +00:00
|
|
|
char sock_path[PATH_MAX] = "";
|
2011-07-18 12:37:24 +00:00
|
|
|
struct scrub_progress_cycle spc;
|
|
|
|
pthread_mutex_t spc_write_mutex = PTHREAD_MUTEX_INITIALIZER;
|
|
|
|
void *terr;
|
|
|
|
u64 devid;
|
2013-07-15 11:36:50 +00:00
|
|
|
DIR *dirstream = NULL;
|
2013-12-02 06:42:25 +00:00
|
|
|
int force = 0;
|
2013-12-12 07:34:16 +00:00
|
|
|
int nothing_to_resume = 0;
|
2011-07-18 12:37:24 +00:00
|
|
|
|
2013-12-02 06:42:25 +00:00
|
|
|
while ((c = getopt(argc, argv, "BdqrRc:n:f")) != -1) {
|
2011-07-18 12:37:24 +00:00
|
|
|
switch (c) {
|
|
|
|
case 'B':
|
|
|
|
do_background = 0;
|
|
|
|
do_wait = 1;
|
|
|
|
do_print = 1;
|
|
|
|
break;
|
|
|
|
case 'd':
|
|
|
|
do_stats_per_dev = 1;
|
|
|
|
break;
|
|
|
|
case 'q':
|
2020-06-11 17:41:22 +00:00
|
|
|
bconf_be_quiet();
|
|
|
|
do_quiet = !bconf.verbose;
|
2011-07-18 12:37:24 +00:00
|
|
|
break;
|
|
|
|
case 'r':
|
|
|
|
readonly = 1;
|
|
|
|
break;
|
|
|
|
case 'R':
|
|
|
|
print_raw = 1;
|
|
|
|
break;
|
2012-05-16 16:51:28 +00:00
|
|
|
case 'c':
|
|
|
|
ioprio_class = (int)strtol(optarg, NULL, 10);
|
|
|
|
break;
|
|
|
|
case 'n':
|
|
|
|
ioprio_classdata = (int)strtol(optarg, NULL, 10);
|
|
|
|
break;
|
2013-12-02 06:42:25 +00:00
|
|
|
case 'f':
|
|
|
|
force = 1;
|
|
|
|
break;
|
2011-07-18 12:37:24 +00:00
|
|
|
default:
|
2018-03-07 02:54:38 +00:00
|
|
|
usage_unknown_option(cmd, argv);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* try to catch most error cases before forking */
|
|
|
|
|
2019-03-04 13:49:15 +00:00
|
|
|
if (check_argc_exact(argc - optind, 1))
|
|
|
|
return 1;
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
spc.progress = NULL;
|
|
|
|
if (do_quiet && do_print)
|
|
|
|
do_print = 0;
|
|
|
|
|
|
|
|
if (mkdir_p(datafile)) {
|
2015-09-28 13:58:14 +00:00
|
|
|
warning_on(!do_quiet,
|
2018-01-07 21:54:21 +00:00
|
|
|
"cannot create scrub data file, mkdir %s failed: %m. Status recording disabled",
|
|
|
|
datafile);
|
2011-07-18 12:37:24 +00:00
|
|
|
do_record = 0;
|
|
|
|
}
|
|
|
|
free(datafile);
|
|
|
|
|
|
|
|
path = argv[optind];
|
|
|
|
|
2015-10-12 13:23:02 +00:00
|
|
|
fdmnt = open_path_or_dev_mnt(path, &dirstream, !do_quiet);
|
|
|
|
if (fdmnt < 0)
|
2013-09-04 15:22:37 +00:00
|
|
|
return 1;
|
2011-07-18 12:37:24 +00:00
|
|
|
|
2013-03-12 04:17:40 +00:00
|
|
|
ret = get_fs_info(path, &fi_args, &di_args);
|
2011-07-18 12:37:24 +00:00
|
|
|
if (ret) {
|
2018-10-25 12:10:54 +00:00
|
|
|
errno = -ret;
|
2015-09-28 13:58:14 +00:00
|
|
|
error_on(!do_quiet,
|
2018-10-25 12:10:54 +00:00
|
|
|
"getting dev info for scrub failed: %m");
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (!fi_args.num_devices) {
|
2015-09-28 13:58:14 +00:00
|
|
|
error_on(!do_quiet, "no devices found");
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
uuid_unparse(fi_args.fsid, fsid);
|
|
|
|
fdres = scrub_open_file_r(SCRUB_DATA_FILE, fsid);
|
|
|
|
if (fdres < 0 && fdres != -ENOENT) {
|
2018-10-25 12:10:54 +00:00
|
|
|
errno = -fdres;
|
|
|
|
warning_on(!do_quiet, "failed to open status file: %m");
|
2011-07-18 12:37:24 +00:00
|
|
|
} else if (fdres >= 0) {
|
|
|
|
past_scrubs = scrub_read_file(fdres, !do_quiet);
|
2018-10-25 12:10:54 +00:00
|
|
|
if (IS_ERR(past_scrubs)) {
|
|
|
|
errno = -PTR_ERR(past_scrubs);
|
|
|
|
warning_on(!do_quiet, "failed to read status file: %m");
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
close(fdres);
|
|
|
|
}
|
|
|
|
|
2014-10-02 17:15:38 +00:00
|
|
|
/*
|
|
|
|
* Check for stale information in the status file, ie. if it's
|
|
|
|
* canceled=0, finished=0 but no scrub is running.
|
|
|
|
*/
|
|
|
|
if (!is_scrub_running_in_kernel(fdmnt, di_args, fi_args.num_devices))
|
|
|
|
force = 1;
|
|
|
|
|
2013-05-15 13:54:49 +00:00
|
|
|
/*
|
|
|
|
* check whether any involved device is already busy running a
|
|
|
|
* scrub. This would cause damaged status messages and the state
|
|
|
|
* "aborted" without the explanation that a scrub was already
|
|
|
|
* running. Therefore check it first, prevent it and give some
|
|
|
|
* feedback to the user if scrub is already running.
|
|
|
|
* Note that if scrub is started with a block device as the
|
|
|
|
* parameter, only that particular block device is checked. It
|
|
|
|
* is a normal mode of operation to start scrub on multiple
|
|
|
|
* single devices, there is no reason to prevent this.
|
|
|
|
*/
|
2013-12-02 06:42:25 +00:00
|
|
|
if (!force && is_scrub_running_on_fs(&fi_args, di_args, past_scrubs)) {
|
2015-09-28 13:58:14 +00:00
|
|
|
error_on(!do_quiet,
|
|
|
|
"Scrub is already running.\n"
|
|
|
|
"To cancel use 'btrfs scrub cancel %s'.\n"
|
|
|
|
"To see the status use 'btrfs scrub status [-d] %s'",
|
|
|
|
path, path);
|
2013-05-15 13:54:49 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2011-07-18 12:37:24 +00:00
|
|
|
t_devs = malloc(fi_args.num_devices * sizeof(*t_devs));
|
|
|
|
sp = calloc(fi_args.num_devices, sizeof(*sp));
|
|
|
|
spc.progress = calloc(fi_args.num_devices * 2, sizeof(*spc.progress));
|
|
|
|
|
|
|
|
if (!t_devs || !sp || !spc.progress) {
|
2018-01-07 21:54:21 +00:00
|
|
|
error_on(!do_quiet, "scrub failed: %m");
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < fi_args.num_devices; ++i) {
|
|
|
|
devid = di_args[i].devid;
|
|
|
|
ret = pthread_mutex_init(&sp[i].progress_mutex, NULL);
|
|
|
|
if (ret) {
|
2018-10-25 12:10:54 +00:00
|
|
|
errno = ret;
|
|
|
|
error_on(!do_quiet, "pthread_mutex_init failed: %m");
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
last_scrub = last_dev_scrub(past_scrubs, devid);
|
|
|
|
sp[i].scrub_args.devid = devid;
|
|
|
|
sp[i].fd = fdmnt;
|
|
|
|
if (resume && last_scrub && (last_scrub->stats.canceled ||
|
|
|
|
!last_scrub->stats.finished)) {
|
|
|
|
++n_resume;
|
|
|
|
sp[i].scrub_args.start = last_scrub->p.last_physical;
|
|
|
|
sp[i].resumed = last_scrub;
|
|
|
|
} else if (resume) {
|
|
|
|
++n_skip;
|
|
|
|
sp[i].skip = 1;
|
|
|
|
sp[i].resumed = last_scrub;
|
|
|
|
continue;
|
|
|
|
} else {
|
|
|
|
++n_start;
|
|
|
|
sp[i].scrub_args.start = 0ll;
|
|
|
|
sp[i].resumed = NULL;
|
|
|
|
}
|
|
|
|
sp[i].skip = 0;
|
|
|
|
sp[i].scrub_args.end = (u64)-1ll;
|
|
|
|
sp[i].scrub_args.flags = readonly ? BTRFS_SCRUB_READONLY : 0;
|
2012-05-16 16:51:28 +00:00
|
|
|
sp[i].ioprio_class = ioprio_class;
|
|
|
|
sp[i].ioprio_classdata = ioprio_classdata;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!n_start && !n_resume) {
|
2020-06-11 17:41:22 +00:00
|
|
|
pr_verbose(MUST_LOG,
|
|
|
|
"scrub: nothing to resume for %s, fsid %s\n",
|
|
|
|
path, fsid);
|
2013-12-12 07:34:16 +00:00
|
|
|
nothing_to_resume = 1;
|
|
|
|
goto out;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ret = prg_fd = socket(AF_UNIX, SOCK_STREAM, 0);
|
|
|
|
while (ret != -1) {
|
|
|
|
ret = scrub_datafile(SCRUB_PROGRESS_SOCKET_PATH, fsid, NULL,
|
|
|
|
sock_path, sizeof(sock_path));
|
|
|
|
/* ignore EOVERFLOW, try using a shorter path for the socket */
|
|
|
|
addr.sun_path[sizeof(addr.sun_path) - 1] = '\0';
|
|
|
|
strncpy(addr.sun_path, sock_path, sizeof(addr.sun_path) - 1);
|
|
|
|
ret = bind(prg_fd, (struct sockaddr *)&addr, sizeof(addr));
|
|
|
|
if (ret != -1 || errno != EADDRINUSE)
|
|
|
|
break;
|
|
|
|
/*
|
|
|
|
* bind failed with EADDRINUSE. so let's see if anyone answers
|
|
|
|
* when we make a call to the socket ...
|
|
|
|
*/
|
|
|
|
ret = connect(prg_fd, (struct sockaddr *)&addr, sizeof(addr));
|
|
|
|
if (!ret || errno != ECONNREFUSED) {
|
|
|
|
/* ... yes, so scrub must be running. error out */
|
2015-09-28 13:58:14 +00:00
|
|
|
error("scrub already running");
|
2011-07-18 12:37:24 +00:00
|
|
|
close(prg_fd);
|
2013-01-25 00:18:49 +00:00
|
|
|
prg_fd = -1;
|
2011-07-18 12:37:24 +00:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* ... no, this means someone left us alone with an unused
|
|
|
|
* socket in the file system. remove it and try again.
|
|
|
|
*/
|
|
|
|
ret = unlink(sock_path);
|
|
|
|
}
|
|
|
|
if (ret != -1)
|
|
|
|
ret = listen(prg_fd, 100);
|
|
|
|
if (ret == -1) {
|
2015-09-28 13:58:14 +00:00
|
|
|
warning_on(!do_quiet,
|
2018-01-07 21:54:21 +00:00
|
|
|
"failed to open the progress status socket at %s: %m. Progress cannot be queried",
|
2015-09-28 13:58:14 +00:00
|
|
|
sock_path[0] ? sock_path :
|
2018-01-07 21:54:21 +00:00
|
|
|
SCRUB_PROGRESS_SOCKET_PATH);
|
2011-07-18 12:37:24 +00:00
|
|
|
if (prg_fd != -1) {
|
|
|
|
close(prg_fd);
|
|
|
|
prg_fd = -1;
|
|
|
|
if (sock_path[0])
|
|
|
|
unlink(sock_path);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (do_record) {
|
|
|
|
/* write all-zero progress file for a start */
|
|
|
|
ret = scrub_write_progress(&spc_write_mutex, fsid, sp,
|
|
|
|
fi_args.num_devices);
|
|
|
|
if (ret) {
|
2018-10-25 12:10:54 +00:00
|
|
|
errno = -ret;
|
2015-09-28 13:58:14 +00:00
|
|
|
warning_on(!do_quiet,
|
2018-10-25 12:10:54 +00:00
|
|
|
"failed to write the progress status file: %m. Status recording disabled");
|
2011-07-18 12:37:24 +00:00
|
|
|
do_record = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (do_background) {
|
|
|
|
pid = fork();
|
|
|
|
if (pid == -1) {
|
2018-01-07 21:54:21 +00:00
|
|
|
error_on(!do_quiet, "cannot scrub, fork failed: %m");
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pid) {
|
|
|
|
int stat;
|
|
|
|
scrub_handle_sigint_parent();
|
2020-06-11 17:41:22 +00:00
|
|
|
pr_verbose(MUST_LOG,
|
|
|
|
"scrub %s on %s, fsid %s (pid=%d)\n",
|
|
|
|
n_start ? "started" : "resumed",
|
|
|
|
path, fsid, pid);
|
2011-07-18 12:37:24 +00:00
|
|
|
if (!do_wait) {
|
|
|
|
err = 0;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
ret = wait(&stat);
|
|
|
|
if (ret != pid) {
|
2018-01-07 21:54:21 +00:00
|
|
|
error_on(!do_quiet, "wait failed (ret=%d): %m",
|
|
|
|
ret);
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (!WIFEXITED(stat) || WEXITSTATUS(stat)) {
|
2015-09-28 13:58:14 +00:00
|
|
|
error_on(!do_quiet, "scrub process failed");
|
2011-07-18 12:37:24 +00:00
|
|
|
err = WIFEXITED(stat) ? WEXITSTATUS(stat) : -1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
err = 0;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
scrub_handle_sigint_child(fdmnt);
|
|
|
|
|
|
|
|
for (i = 0; i < fi_args.num_devices; ++i) {
|
|
|
|
if (sp[i].skip) {
|
|
|
|
sp[i].scrub_args.progress = sp[i].resumed->p;
|
|
|
|
sp[i].stats = sp[i].resumed->stats;
|
|
|
|
sp[i].ret = 0;
|
|
|
|
sp[i].stats.finished = 1;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
devid = di_args[i].devid;
|
|
|
|
gettimeofday(&tv, NULL);
|
|
|
|
sp[i].stats.t_start = tv.tv_sec;
|
2014-03-24 09:04:47 +00:00
|
|
|
ret = pthread_create(&t_devs[i], NULL,
|
2011-07-18 12:37:24 +00:00
|
|
|
scrub_one_dev, &sp[i]);
|
|
|
|
if (ret) {
|
2018-10-25 12:10:54 +00:00
|
|
|
if (do_print) {
|
|
|
|
errno = ret;
|
|
|
|
error(
|
|
|
|
"creating scrub_one_dev[%llu] thread failed: %m",
|
|
|
|
devid);
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
spc.fdmnt = fdmnt;
|
|
|
|
spc.prg_fd = prg_fd;
|
|
|
|
spc.do_record = do_record;
|
|
|
|
spc.write_mutex = &spc_write_mutex;
|
|
|
|
spc.shared_progress = sp;
|
|
|
|
spc.fi = &fi_args;
|
2014-03-24 09:04:47 +00:00
|
|
|
ret = pthread_create(&t_prog, NULL, scrub_progress_cycle, &spc);
|
2011-07-18 12:37:24 +00:00
|
|
|
if (ret) {
|
2018-10-25 12:10:54 +00:00
|
|
|
if (do_print) {
|
|
|
|
errno = ret;
|
|
|
|
error("creating progress thread failed: %m");
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
err = 0;
|
|
|
|
for (i = 0; i < fi_args.num_devices; ++i) {
|
|
|
|
if (sp[i].skip)
|
|
|
|
continue;
|
|
|
|
devid = di_args[i].devid;
|
|
|
|
ret = pthread_join(t_devs[i], NULL);
|
|
|
|
if (ret) {
|
2018-10-25 12:10:54 +00:00
|
|
|
if (do_print) {
|
|
|
|
errno = ret;
|
|
|
|
error(
|
|
|
|
"pthread_join failed for scrub_one_dev[%llu]: %m",
|
|
|
|
devid);
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
++err;
|
|
|
|
continue;
|
|
|
|
}
|
2015-08-06 03:05:54 +00:00
|
|
|
if (sp[i].ret) {
|
|
|
|
switch (sp[i].ioctl_errno) {
|
|
|
|
case ENODEV:
|
|
|
|
if (do_print)
|
2015-09-28 13:58:14 +00:00
|
|
|
warning("device %lld not present",
|
|
|
|
devid);
|
2015-08-06 03:05:54 +00:00
|
|
|
continue;
|
|
|
|
case ECANCELED:
|
|
|
|
++err;
|
|
|
|
break;
|
|
|
|
default:
|
2018-10-25 12:10:54 +00:00
|
|
|
if (do_print) {
|
|
|
|
errno = sp[i].ioctl_errno;
|
|
|
|
error(
|
|
|
|
"scrubbing %s failed for device id %lld: ret=%d, errno=%d (%m)",
|
|
|
|
path, devid, sp[i].ret,
|
|
|
|
sp[i].ioctl_errno);
|
|
|
|
}
|
2015-08-06 03:05:54 +00:00
|
|
|
++err;
|
|
|
|
continue;
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
if (sp[i].scrub_args.progress.uncorrectable_errors > 0)
|
|
|
|
e_uncorrectable++;
|
|
|
|
if (sp[i].scrub_args.progress.corrected_errors > 0
|
|
|
|
|| sp[i].scrub_args.progress.unverified_errors > 0)
|
|
|
|
e_correctable++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (do_print) {
|
|
|
|
const char *append = "done";
|
2019-06-04 19:36:34 +00:00
|
|
|
u64 total_bytes_used = 0;
|
|
|
|
|
2011-07-18 12:37:24 +00:00
|
|
|
if (!do_stats_per_dev)
|
|
|
|
init_fs_stat(&fs_stat);
|
|
|
|
for (i = 0; i < fi_args.num_devices; ++i) {
|
|
|
|
if (do_stats_per_dev) {
|
|
|
|
print_scrub_dev(&di_args[i],
|
|
|
|
&sp[i].scrub_args.progress,
|
|
|
|
print_raw,
|
|
|
|
sp[i].ret ? "canceled" : "done",
|
|
|
|
&sp[i].stats);
|
|
|
|
} else {
|
|
|
|
if (sp[i].ret)
|
|
|
|
append = "canceled";
|
|
|
|
add_to_fs_stat(&sp[i].scrub_args.progress,
|
|
|
|
&sp[i].stats, &fs_stat);
|
|
|
|
}
|
2019-06-04 19:36:34 +00:00
|
|
|
total_bytes_used += di_args[i].bytes_used;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
if (!do_stats_per_dev) {
|
|
|
|
printf("scrub %s for %s\n", append, fsid);
|
2019-06-04 19:36:34 +00:00
|
|
|
print_fs_stat(&fs_stat, print_raw, total_bytes_used);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = pthread_cancel(t_prog);
|
|
|
|
if (!ret)
|
|
|
|
ret = pthread_join(t_prog, &terr);
|
2013-03-04 22:45:37 +00:00
|
|
|
|
|
|
|
/* check for errors from the handling of the progress thread */
|
2011-07-18 12:37:24 +00:00
|
|
|
if (do_print && ret) {
|
2018-10-25 12:10:54 +00:00
|
|
|
errno = ret;
|
|
|
|
error("progress thread handling failed: %m");
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
2013-03-04 22:45:37 +00:00
|
|
|
/* check for errors returned from the progress thread itself */
|
2018-10-25 12:10:54 +00:00
|
|
|
if (do_print && terr && terr != PTHREAD_CANCELED) {
|
|
|
|
errno = -PTR_ERR(terr);
|
|
|
|
error("recording progress failed: %m");
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
if (do_record) {
|
|
|
|
ret = scrub_write_progress(&spc_write_mutex, fsid, sp,
|
|
|
|
fi_args.num_devices);
|
2018-10-25 12:10:54 +00:00
|
|
|
if (ret && do_print) {
|
|
|
|
errno = -ret;
|
|
|
|
error("failed to record the result: %m");
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
scrub_handle_sigint_child(-1);
|
|
|
|
|
|
|
|
out:
|
|
|
|
free_history(past_scrubs);
|
|
|
|
free(di_args);
|
|
|
|
free(t_devs);
|
|
|
|
free(sp);
|
|
|
|
free(spc.progress);
|
|
|
|
if (prg_fd > -1) {
|
|
|
|
close(prg_fd);
|
|
|
|
if (sock_path[0])
|
|
|
|
unlink(sock_path);
|
|
|
|
}
|
2013-07-15 11:36:50 +00:00
|
|
|
close_file_or_dir(fdmnt, dirstream);
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
if (err)
|
|
|
|
return 1;
|
2014-07-17 02:40:36 +00:00
|
|
|
if (nothing_to_resume)
|
|
|
|
return 2;
|
|
|
|
if (e_uncorrectable) {
|
2015-09-28 13:58:14 +00:00
|
|
|
error_on(!do_quiet, "there are uncorrectable errors");
|
2013-09-04 15:22:37 +00:00
|
|
|
return 3;
|
2014-07-17 02:40:36 +00:00
|
|
|
}
|
|
|
|
if (e_correctable)
|
2015-09-28 13:58:14 +00:00
|
|
|
warning_on(!do_quiet,
|
|
|
|
"errors detected during scrubbing, corrected");
|
2014-07-17 02:40:36 +00:00
|
|
|
|
2011-07-18 12:37:24 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-02-03 19:00:17 +00:00
|
|
|
static const char * const cmd_scrub_start_usage[] = {
|
2013-12-02 06:42:25 +00:00
|
|
|
"btrfs scrub start [-BdqrRf] [-c ioprio_class -n ioprio_classdata] <path>|<device>",
|
2014-07-30 07:32:05 +00:00
|
|
|
"Start a new scrub. If a scrub is already running, the new one fails.",
|
2012-02-03 19:00:17 +00:00
|
|
|
"",
|
|
|
|
"-B do not background",
|
|
|
|
"-d stats per device (-B only)",
|
|
|
|
"-q be quiet",
|
|
|
|
"-r read only mode",
|
2014-08-11 02:49:35 +00:00
|
|
|
"-R raw print mode, print full data instead of summary",
|
2012-05-16 16:51:28 +00:00
|
|
|
"-c set ioprio class (see ionice(1) manpage)",
|
|
|
|
"-n set ioprio classdata (see ionice(1) manpage)",
|
2014-08-11 02:49:35 +00:00
|
|
|
"-f force starting new scrub even if a scrub is already running",
|
2013-12-02 06:42:25 +00:00
|
|
|
" this is useful when scrub stats record file is damaged",
|
2020-06-26 20:20:56 +00:00
|
|
|
"-q deprecated, alias for global -q option",
|
2020-06-11 17:41:22 +00:00
|
|
|
HELPINFO_INSERT_GLOBALS,
|
|
|
|
HELPINFO_INSERT_QUIET,
|
2012-02-03 19:00:17 +00:00
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
2018-03-07 02:24:46 +00:00
|
|
|
static int cmd_scrub_start(const struct cmd_struct *cmd, int argc, char **argv)
|
2011-07-18 12:37:24 +00:00
|
|
|
{
|
2018-03-07 02:54:38 +00:00
|
|
|
return scrub_start(cmd, argc, argv, false);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
2018-03-07 02:07:03 +00:00
|
|
|
static DEFINE_SIMPLE_COMMAND(scrub_start, "start");
|
2011-07-18 12:37:24 +00:00
|
|
|
|
2012-02-03 19:00:17 +00:00
|
|
|
static const char * const cmd_scrub_cancel_usage[] = {
|
|
|
|
"btrfs scrub cancel <path>|<device>",
|
|
|
|
"Cancel a running scrub",
|
2020-06-11 17:41:23 +00:00
|
|
|
HELPINFO_INSERT_GLOBALS,
|
|
|
|
HELPINFO_INSERT_QUIET,
|
2012-02-03 19:00:17 +00:00
|
|
|
NULL
|
|
|
|
};
|
2011-07-18 12:37:24 +00:00
|
|
|
|
2018-03-07 02:24:46 +00:00
|
|
|
static int cmd_scrub_cancel(const struct cmd_struct *cmd, int argc, char **argv)
|
2011-07-18 12:37:24 +00:00
|
|
|
{
|
2012-02-03 19:00:17 +00:00
|
|
|
char *path;
|
2011-07-18 12:37:24 +00:00
|
|
|
int ret;
|
2013-03-11 23:13:00 +00:00
|
|
|
int fdmnt = -1;
|
2013-07-15 11:36:50 +00:00
|
|
|
DIR *dirstream = NULL;
|
2011-07-18 12:37:24 +00:00
|
|
|
|
2018-03-07 02:42:01 +00:00
|
|
|
clean_args_no_options(cmd, argc, argv);
|
2016-03-01 15:02:08 +00:00
|
|
|
|
|
|
|
if (check_argc_exact(argc - optind, 1))
|
2019-03-04 13:49:15 +00:00
|
|
|
return 1;
|
2012-02-03 19:00:17 +00:00
|
|
|
|
2016-03-01 15:02:08 +00:00
|
|
|
path = argv[optind];
|
2012-02-03 19:00:17 +00:00
|
|
|
|
2015-10-12 13:23:02 +00:00
|
|
|
fdmnt = open_path_or_dev_mnt(path, &dirstream, 1);
|
2011-07-18 12:37:24 +00:00
|
|
|
if (fdmnt < 0) {
|
2013-03-11 23:13:00 +00:00
|
|
|
ret = 1;
|
|
|
|
goto out;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ret = ioctl(fdmnt, BTRFS_IOC_SCRUB_CANCEL, NULL);
|
2013-01-25 00:18:50 +00:00
|
|
|
|
2013-03-11 23:13:00 +00:00
|
|
|
if (ret < 0) {
|
2015-09-28 13:58:14 +00:00
|
|
|
error("scrub cancel failed on %s: %s", path,
|
2013-03-11 23:13:00 +00:00
|
|
|
errno == ENOTCONN ? "not running" : strerror(errno));
|
2013-09-04 15:22:37 +00:00
|
|
|
if (errno == ENOTCONN)
|
|
|
|
ret = 2;
|
|
|
|
else
|
|
|
|
ret = 1;
|
2013-03-11 23:13:00 +00:00
|
|
|
goto out;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
2013-03-11 23:13:00 +00:00
|
|
|
ret = 0;
|
2020-06-11 17:41:23 +00:00
|
|
|
pr_verbose(MUST_LOG, "scrub cancelled\n");
|
2011-07-18 12:37:24 +00:00
|
|
|
|
2013-03-11 23:13:00 +00:00
|
|
|
out:
|
2013-07-15 11:36:50 +00:00
|
|
|
close_file_or_dir(fdmnt, dirstream);
|
2013-03-11 23:13:00 +00:00
|
|
|
return ret;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
2018-03-07 02:07:03 +00:00
|
|
|
static DEFINE_SIMPLE_COMMAND(scrub_cancel, "cancel");
|
2011-07-18 12:37:24 +00:00
|
|
|
|
2012-02-03 19:00:17 +00:00
|
|
|
static const char * const cmd_scrub_resume_usage[] = {
|
2013-07-23 02:43:21 +00:00
|
|
|
"btrfs scrub resume [-BdqrR] [-c ioprio_class -n ioprio_classdata] <path>|<device>",
|
2012-02-03 19:00:17 +00:00
|
|
|
"Resume previously canceled or interrupted scrub",
|
|
|
|
"",
|
|
|
|
"-B do not background",
|
|
|
|
"-d stats per device (-B only)",
|
|
|
|
"-r read only mode",
|
2014-08-11 02:49:35 +00:00
|
|
|
"-R raw print mode, print full data instead of summary",
|
2012-05-16 16:51:28 +00:00
|
|
|
"-c set ioprio class (see ionice(1) manpage)",
|
|
|
|
"-n set ioprio classdata (see ionice(1) manpage)",
|
2020-06-26 20:20:56 +00:00
|
|
|
"-q deprecated, alias for global -q option",
|
2020-06-11 17:41:22 +00:00
|
|
|
HELPINFO_INSERT_GLOBALS,
|
|
|
|
HELPINFO_INSERT_QUIET,
|
2012-02-03 19:00:17 +00:00
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
2018-03-07 02:24:46 +00:00
|
|
|
static int cmd_scrub_resume(const struct cmd_struct *cmd, int argc, char **argv)
|
2011-07-18 12:37:24 +00:00
|
|
|
{
|
2018-03-07 02:54:38 +00:00
|
|
|
return scrub_start(cmd, argc, argv, true);
|
2012-02-03 19:00:17 +00:00
|
|
|
}
|
2018-03-07 02:07:03 +00:00
|
|
|
static DEFINE_SIMPLE_COMMAND(scrub_resume, "resume");
|
2012-02-03 19:00:17 +00:00
|
|
|
|
|
|
|
static const char * const cmd_scrub_status_usage[] = {
|
|
|
|
"btrfs scrub status [-dR] <path>|<device>",
|
|
|
|
"Show status of running or finished scrub",
|
|
|
|
"",
|
|
|
|
"-d stats per device",
|
|
|
|
"-R print raw stats",
|
|
|
|
NULL
|
|
|
|
};
|
2011-07-18 12:37:24 +00:00
|
|
|
|
2018-03-07 02:24:46 +00:00
|
|
|
static int cmd_scrub_status(const struct cmd_struct *cmd, int argc, char **argv)
|
2012-02-03 19:00:17 +00:00
|
|
|
{
|
2011-07-18 12:37:24 +00:00
|
|
|
char *path;
|
|
|
|
struct btrfs_ioctl_fs_info_args fi_args;
|
|
|
|
struct btrfs_ioctl_dev_info_args *di_args = NULL;
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
struct btrfs_ioctl_space_args *si_args = NULL;
|
2011-07-18 12:37:24 +00:00
|
|
|
struct scrub_file_record **past_scrubs = NULL;
|
|
|
|
struct scrub_file_record *last_scrub;
|
|
|
|
struct scrub_fs_stat fs_stat;
|
|
|
|
struct sockaddr_un addr = {
|
|
|
|
.sun_family = AF_UNIX,
|
|
|
|
};
|
2014-10-02 17:15:38 +00:00
|
|
|
int in_progress;
|
2011-07-18 12:37:24 +00:00
|
|
|
int ret;
|
|
|
|
int i;
|
2012-05-15 10:05:44 +00:00
|
|
|
int fdmnt;
|
2011-07-18 12:37:24 +00:00
|
|
|
int print_raw = 0;
|
|
|
|
int do_stats_per_dev = 0;
|
2012-11-30 10:08:39 +00:00
|
|
|
int c;
|
2013-11-04 07:17:41 +00:00
|
|
|
char fsid[BTRFS_UUID_UNPARSED_SIZE];
|
2011-07-18 12:37:24 +00:00
|
|
|
int fdres = -1;
|
|
|
|
int err = 0;
|
2013-07-15 11:36:50 +00:00
|
|
|
DIR *dirstream = NULL;
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
while ((c = getopt(argc, argv, "dR")) != -1) {
|
|
|
|
switch (c) {
|
|
|
|
case 'd':
|
|
|
|
do_stats_per_dev = 1;
|
|
|
|
break;
|
|
|
|
case 'R':
|
|
|
|
print_raw = 1;
|
|
|
|
break;
|
|
|
|
default:
|
2018-03-07 02:54:38 +00:00
|
|
|
usage_unknown_option(cmd, argv);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-02-03 19:00:17 +00:00
|
|
|
if (check_argc_exact(argc - optind, 1))
|
2019-03-04 13:49:15 +00:00
|
|
|
return 1;
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
path = argv[optind];
|
|
|
|
|
2015-10-12 13:23:02 +00:00
|
|
|
fdmnt = open_path_or_dev_mnt(path, &dirstream, 1);
|
|
|
|
if (fdmnt < 0)
|
2013-09-04 15:22:37 +00:00
|
|
|
return 1;
|
2012-05-15 10:05:44 +00:00
|
|
|
|
2013-03-12 04:17:40 +00:00
|
|
|
ret = get_fs_info(path, &fi_args, &di_args);
|
2011-07-18 12:37:24 +00:00
|
|
|
if (ret) {
|
2018-10-25 12:10:54 +00:00
|
|
|
errno = -ret;
|
|
|
|
error("getting dev info for scrub failed: %m");
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (!fi_args.num_devices) {
|
2015-09-28 13:58:14 +00:00
|
|
|
error("no devices found");
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
ret = get_df(fdmnt, &si_args);
|
|
|
|
if (ret) {
|
|
|
|
errno = -ret;
|
|
|
|
error("cannot get space info: %m");
|
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
uuid_unparse(fi_args.fsid, fsid);
|
|
|
|
|
|
|
|
fdres = socket(AF_UNIX, SOCK_STREAM, 0);
|
|
|
|
if (fdres == -1) {
|
2018-01-07 21:54:21 +00:00
|
|
|
error("failed to create socket to receive progress information: %m");
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
scrub_datafile(SCRUB_PROGRESS_SOCKET_PATH, fsid,
|
|
|
|
NULL, addr.sun_path, sizeof(addr.sun_path));
|
|
|
|
/* ignore EOVERFLOW, just use shorter name and hope for the best */
|
|
|
|
addr.sun_path[sizeof(addr.sun_path) - 1] = '\0';
|
|
|
|
ret = connect(fdres, (struct sockaddr *)&addr, sizeof(addr));
|
|
|
|
if (ret == -1) {
|
2013-01-23 22:36:03 +00:00
|
|
|
close(fdres);
|
2011-07-18 12:37:24 +00:00
|
|
|
fdres = scrub_open_file_r(SCRUB_DATA_FILE, fsid);
|
|
|
|
if (fdres < 0 && fdres != -ENOENT) {
|
2018-10-25 12:10:54 +00:00
|
|
|
errno = -fdres;
|
|
|
|
warning("failed to open status file: %m");
|
2011-07-18 12:37:24 +00:00
|
|
|
err = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (fdres >= 0) {
|
|
|
|
past_scrubs = scrub_read_file(fdres, 1);
|
2018-10-25 12:10:54 +00:00
|
|
|
if (IS_ERR(past_scrubs)) {
|
|
|
|
errno = -PTR_ERR(past_scrubs);
|
|
|
|
warning("failed to read status: %m");
|
|
|
|
}
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
2014-10-02 17:15:38 +00:00
|
|
|
in_progress = is_scrub_running_in_kernel(fdmnt, di_args, fi_args.num_devices);
|
2011-07-18 12:37:24 +00:00
|
|
|
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
printf("UUID: %s\n", fsid);
|
2011-07-18 12:37:24 +00:00
|
|
|
|
|
|
|
if (do_stats_per_dev) {
|
|
|
|
for (i = 0; i < fi_args.num_devices; ++i) {
|
|
|
|
last_scrub = last_dev_scrub(past_scrubs,
|
|
|
|
di_args[i].devid);
|
|
|
|
if (!last_scrub) {
|
|
|
|
print_scrub_dev(&di_args[i], NULL, print_raw,
|
|
|
|
NULL, NULL);
|
|
|
|
continue;
|
|
|
|
}
|
2014-10-02 17:15:38 +00:00
|
|
|
last_scrub->stats.in_progress = in_progress;
|
2011-07-18 12:37:24 +00:00
|
|
|
print_scrub_dev(&di_args[i], &last_scrub->p, print_raw,
|
|
|
|
last_scrub->stats.finished ?
|
|
|
|
"history" : "status",
|
|
|
|
&last_scrub->stats);
|
|
|
|
}
|
|
|
|
} else {
|
2019-06-04 19:36:34 +00:00
|
|
|
u64 total_bytes_used = 0;
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
struct btrfs_ioctl_space_info *sp = si_args->spaces;
|
2019-06-04 19:36:34 +00:00
|
|
|
|
2011-07-18 12:37:24 +00:00
|
|
|
init_fs_stat(&fs_stat);
|
2014-10-02 17:15:38 +00:00
|
|
|
fs_stat.s.in_progress = in_progress;
|
2011-07-18 12:37:24 +00:00
|
|
|
for (i = 0; i < fi_args.num_devices; ++i) {
|
|
|
|
last_scrub = last_dev_scrub(past_scrubs,
|
|
|
|
di_args[i].devid);
|
|
|
|
if (!last_scrub)
|
|
|
|
continue;
|
|
|
|
add_to_fs_stat(&last_scrub->p, &last_scrub->stats,
|
|
|
|
&fs_stat);
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
}
|
|
|
|
for (i = 0; i < si_args->total_spaces; i++, sp++) {
|
|
|
|
const int index = btrfs_bg_flags_to_raid_index(sp->flags);
|
|
|
|
const int factor = btrfs_raid_array[index].ncopies;
|
|
|
|
|
|
|
|
/* This is still slightly off for RAID56 */
|
|
|
|
total_bytes_used += sp->used_bytes * factor;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
2019-06-04 19:36:34 +00:00
|
|
|
print_fs_stat(&fs_stat, print_raw, total_bytes_used);
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
|
|
|
free_history(past_scrubs);
|
|
|
|
free(di_args);
|
btrfs-progs: scrub: improve output of status
Prievous patch added throughput and time left calculatios, but with more
information it becomes less clear. Switch to the output format used in
several other commands that prints header, followed by colon, whitespace
and the value. Grouped values are indented by 2 spaces.
This patch uses the space info that is more accurate than the total
size. The used space is what scrub will check, however the multiplicity
is not yet taken into account, so this works only for the 'single'
profile.
Sample output:
UUID: bf8720e0-606b-4065-8320-b48df2e8e669
Scrub started: Fri Jun 14 12:00:00 2019
Status: running
Duration: 0:14:11
Time left: 0:04:04
ETA: Fri Jun 14 12:18:15 2019
Total to scrub: 182.55GiB
Bytes scrubbed: 141.80GiB
Rate: 170.63MiB/s
Error summary: csum=7
Corrected: 0
Uncorrectable: 7
Unverified: 0
For the reference, this is 'fi df':
Data, single: total=261.00GiB, used=179.91GiB
System, single: total=32.00MiB, used=48.00KiB
Metadata, single: total=5.00GiB, used=2.64GiB
GlobalReserve, single: total=375.23MiB, used=0.00B
Several repeated runs of scrub showed that the time estimate is very
close to the final time (within tens of seconds).
Signed-off-by: David Sterba <dsterba@suse.com>
2019-06-14 18:09:31 +00:00
|
|
|
free(si_args);
|
2011-07-18 12:37:24 +00:00
|
|
|
if (fdres > -1)
|
|
|
|
close(fdres);
|
2013-07-15 11:36:50 +00:00
|
|
|
close_file_or_dir(fdmnt, dirstream);
|
2011-07-18 12:37:24 +00:00
|
|
|
|
2013-09-04 15:22:37 +00:00
|
|
|
return !!err;
|
2011-07-18 12:37:24 +00:00
|
|
|
}
|
2018-03-07 02:07:03 +00:00
|
|
|
static DEFINE_SIMPLE_COMMAND(scrub_status, "status");
|
2012-02-03 19:00:17 +00:00
|
|
|
|
2015-06-09 12:22:05 +00:00
|
|
|
static const char scrub_cmd_group_info[] =
|
|
|
|
"verify checksums of data and metadata";
|
|
|
|
|
2018-03-07 02:07:03 +00:00
|
|
|
static const struct cmd_group scrub_cmd_group = {
|
2015-06-09 12:22:05 +00:00
|
|
|
scrub_cmd_group_usage, scrub_cmd_group_info, {
|
2018-03-07 02:07:03 +00:00
|
|
|
&cmd_struct_scrub_start,
|
|
|
|
&cmd_struct_scrub_cancel,
|
|
|
|
&cmd_struct_scrub_resume,
|
|
|
|
&cmd_struct_scrub_status,
|
|
|
|
NULL
|
2012-02-03 19:00:17 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2018-03-07 02:07:03 +00:00
|
|
|
DEFINE_GROUP_COMMAND_TOKEN(scrub);
|