From e4b81d74b420fa0cb81a628eaf7a8b573492ef15 Mon Sep 17 00:00:00 2001 From: Andrea Mazzoleni Date: Wed, 29 Oct 2025 00:21:03 +0100 Subject: [PATCH] Update manual --- snapraid.1 | 12 ------------ snapraid.d | 4 ---- snapraid.txt | 36 ++++++++++++++++-------------------- 3 files changed, 16 insertions(+), 36 deletions(-) diff --git a/snapraid.1 b/snapraid.1 index 83d226b5..1d183d57 100644 --- a/snapraid.1 +++ b/snapraid.1 @@ -1109,34 +1109,22 @@ such as K, M, or G (e.g., \-\-bw\-limit 1G). .TP .B \-A, \-\-stats Enables an extended status view that shows additional information. -.PP -.RS 4 The screen displays two graphs: -.RE -.PP -.RS 4 The first graph shows the number of buffered stripes for each disk, along with the file path of the file currently being accessed on that disk. Typically, the slowest disk will have no buffer available, which determines the maximum achievable bandwidth. -.RE -.PP -.RS 4 The second graph shows the percentage of time spent waiting over the past 100 seconds. The slowest disk is expected to cause most of the wait time, while other disks should have little or no wait time because they can use their buffered stripes. This graph also shows the time spent waiting for hash calculations and RAID computations. -.RE -.PP -.RS 4 All computations run in parallel with disk operations. Therefore, as long as there is measurable wait time for at least one disk, it indicates that the CPU is fast enough to keep up with the workload. -.RE .TP .B \-Z, \-\-force\-zero Forces the insecure operation of syncing a file with zero diff --git a/snapraid.d b/snapraid.d index d3d91454..6f28b80a 100644 --- a/snapraid.d +++ b/snapraid.d @@ -831,22 +831,18 @@ Options -A, --stats Enables an extended status view that shows additional information. - The screen displays two graphs: - The first graph shows the number of buffered stripes for each disk, along with the file path of the file currently being accessed on that disk. Typically, the slowest disk will have no buffer available, which determines the maximum achievable bandwidth. - The second graph shows the percentage of time spent waiting over the past 100 seconds. The slowest disk is expected to cause most of the wait time, while other disks should have little or no wait time because they can use their buffered stripes. This graph also shows the time spent waiting for hash calculations and RAID computations. - All computations run in parallel with disk operations. Therefore, as long as there is measurable wait time for at least one disk, it indicates that the CPU is fast enough to diff --git a/snapraid.txt b/snapraid.txt index 5a4560e3..ebf5a51b 100644 --- a/snapraid.txt +++ b/snapraid.txt @@ -890,26 +890,22 @@ SnapRAID provides the following options: -A, --stats Enables an extended status view that shows additional information. - - The screen displays two graphs: - - The first graph shows the number of buffered stripes for each - disk, along with the file path of the file currently being - accessed on that disk. Typically, the slowest disk will have - no buffer available, which determines the maximum achievable - bandwidth. - - The second graph shows the percentage of time spent waiting - over the past 100 seconds. The slowest disk is expected to - cause most of the wait time, while other disks should have - little or no wait time because they can use their buffered stripes. - This graph also shows the time spent waiting for hash - calculations and RAID computations. - - All computations run in parallel with disk operations. - Therefore, as long as there is measurable wait time for at - least one disk, it indicates that the CPU is fast enough to - keep up with the workload. + The screen displays two graphs: + The first graph shows the number of buffered stripes for each + disk, along with the file path of the file currently being + accessed on that disk. Typically, the slowest disk will have + no buffer available, which determines the maximum achievable + bandwidth. + The second graph shows the percentage of time spent waiting + over the past 100 seconds. The slowest disk is expected to + cause most of the wait time, while other disks should have + little or no wait time because they can use their buffered stripes. + This graph also shows the time spent waiting for hash + calculations and RAID computations. + All computations run in parallel with disk operations. + Therefore, as long as there is measurable wait time for at + least one disk, it indicates that the CPU is fast enough to + keep up with the workload. -Z, --force-zero Forces the insecure operation of syncing a file with zero