Struct RetryPolicy 

pub struct RetryPolicy {
    pub max_attempts: u32,
    pub initial_backoff: Duration,
    pub max_backoff: Duration,
}

Bounded attempts with exponential backoff.

There is exactly one of these in the product. Sources, the post-scan access-target pass, and cloud adapters all use RetryPolicy::DEFAULT rather than each inventing a loop, so the worst-case added latency of a transient failure is a single reviewable number.

Fields

max_attempts: u32

Total attempts, INCLUDING the first. 1 disables retry entirely.

initial_backoff: Duration

Delay before the second attempt. Doubles per attempt.

max_backoff: Duration

Ceiling for the doubling, so a raised bound cannot become a stall.

Implementations

impl RetryPolicy

pub const DEFAULT: Self

The policy. Three attempts, 5 ms then 10 ms of backoff.

Worst case a permanently-failing transient classification costs 15 ms and two extra syscalls per operation. That is deliberately too small to paper over a real defect: a walk over a tree where every file races would spend visible wall time and report a retry count per file, which is the signal we want rather than a silently-absorbed cost.

pub fn backoff_for(&self, next_attempt: u32) -> Duration

Backoff before the attempt numbered next_attempt (2 for the first retry), saturating at Self::max_backoff.

Trait Implementations

impl Clone for RetryPolicy

fn clone(&self) -> RetryPolicy

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for RetryPolicy

impl Debug for RetryPolicy

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for RetryPolicy

fn default() -> Self

Returns the “default value” for a type.

impl Eq for RetryPolicy

impl PartialEq for RetryPolicy

fn eq(&self, other: &RetryPolicy) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for RetryPolicy