pub struct DiskBusyRule { /* private fields */ }Expand description
A block device busy for a sustained period (§11.2).
§Why this rule reads the radar instead of counting history
History retains device throughput, not the busy share (§8.5) — a busy
percentage per device per sample would grow every retained sample with the
machine’s device count. The sustained-ness of device busy is therefore
established by the hysteresis the PressureEngine
already applies to the disk signal, and this rule reports it with the evidence
the engine kept. The consequence is an ordering requirement, documented on the
engine: pressure must be derived before the rules run. Until it is, the signal
is warming up and this rule stays silent — which is the correct answer, not a
missed detection.
The finding says the device is busy. §11.3 forbids concluding anything about the health of the hardware from it: a device at 100% busy is usually a device doing its job.
Implementations§
Source§impl DiskBusyRule
impl DiskBusyRule
Sourcepub const fn new(thresholds: Thresholds) -> Self
pub const fn new(thresholds: Thresholds) -> Self
Builds the rule from sanitized thresholds.
Trait Implementations§
Source§impl Clone for DiskBusyRule
impl Clone for DiskBusyRule
Source§fn clone(&self) -> DiskBusyRule
fn clone(&self) -> DiskBusyRule
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read more