fdu-core 0.3.0

//! The observation and commit contract shared by every producer and consumer.
//!
//! The walker, revalidator, and watch layer produce [`Observation`] batches. The index
//! arbitrates their preconditions, removes no-ops, and creates a [`Commit`] only after
//! every effective fact, reducer, and state change is known. The journal retains those
//! commits as the only source of change truth.
//!
//! Three properties are load-bearing, and the rest of the crate depends on them:
//!
//! - **Observations carry truth, not hints.** A producer stats before it emits. Filesystem
//!   events on most platforms carry no metadata, so a raw event is never a delta.
//! - **Conditional observations cannot overwrite newer state.** Revalidation attaches
//!   state plus generation and revision guards from the start of its check. If another
//!   producer commits a conflicting change first, arbitration rejects the delayed
//!   observation.
//! - **Commits contain changes, not attempts.** No-ops and stale observations do not
//!   advance the public clock or consume journal space.

use std::path::{Path, PathBuf};

use crate::stored_state::EntryScope;

/// A monotonic logical clock, in the spirit of Watchman's clockspec but process-local.
///
/// Every [`Commit`] is stamped, so a consumer can ask "what changed since C?"
/// rather than having to hold a live subscription.
#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Debug, Default, Hash)]
pub struct Clock(pub u64);

impl Clock {
    /// The clock before anything has been applied.
    pub const ZERO: Clock = Clock(0);

    /// The next clock value, or `None` when the process-local clock is exhausted.
    #[inline]
    #[must_use]
    pub const fn checked_next(self) -> Option<Clock> {
        match self.0.checked_add(1) {
            Some(value) => Some(Clock(value)),
            None => None,
        }
    }
}

/// What kind of filesystem entry a record describes.
///
/// The numeric values reach the snapshot format, so they are pinned: never renumber a
/// variant, only append.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
#[repr(u8)]
pub enum EntryKind {
    /// Regular file.
    File = 0,
    /// Directory.
    Dir = 1,
    /// Symbolic link retained without following it.
    Symlink = 2,
    /// Other filesystem object such as a socket or device.
    Other = 3,
}

impl EntryKind {
    /// Recover a kind from its pinned on-disk value.
    pub const fn from_u8(raw: u8) -> Option<Self> {
        match raw {
            0 => Some(Self::File),
            1 => Some(Self::Dir),
            2 => Some(Self::Symlink),
            3 => Some(Self::Other),
            _ => None,
        }
    }

    #[inline]
    /// Whether this kind is a directory.
    pub const fn is_dir(self) -> bool {
        matches!(self, Self::Dir)
    }
}

/// The stat fields an entry contributes to roll-ups, plus the ones that identify it.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Default, Hash)]
pub struct Attrs {
    /// Apparent size in bytes.
    pub size: u64,
    /// Allocated size in bytes (block count x 512 on Unix). Falls back to `size` on
    /// platforms that do not report block counts.
    pub allocated: u64,
    /// Modification time, nanoseconds since the Unix epoch.
    pub mtime_ns: i64,
    /// Inode change time, nanoseconds since the Unix epoch. Zero where unavailable.
    pub ctime_ns: i64,
    /// Inode number. Zero where unavailable.
    pub inode: u64,
    /// Device number. Zero where unavailable.
    pub dev: u64,
}

impl Attrs {
    /// The change-detection fingerprint for these attributes.
    #[inline]
    pub const fn fingerprint(&self) -> Fingerprint {
        Fingerprint {
            size: self.size,
            mtime_ns: self.mtime_ns,
            ctime_ns: self.ctime_ns,
            inode: self.inode,
            dev: self.dev,
        }
    }
}

/// The fingerprint used to decide whether an entry really changed.
///
/// Size and mtime alone are not enough. mtime is user-settable, and some applications
/// roll it back after modifying a file; ctime is kernel-controlled and cannot be set
/// directly. Borg keys on ctime/size/inode and restic requires both mtime and ctime to
/// match, and this engine follows them: an index that keys purely on mtime is trusting a
/// value userspace can forge.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Default, Hash)]
pub struct Fingerprint {
    /// Apparent file size.
    pub size: u64,
    /// Modification time in nanoseconds since the Unix epoch.
    pub mtime_ns: i64,
    /// Inode-change time in nanoseconds since the Unix epoch.
    pub ctime_ns: i64,
    /// Platform inode or file identity component.
    pub inode: u64,
    /// Platform device or volume identity component.
    pub dev: u64,
}

/// Semantic inputs that decide which entries and derived values belong in an index.
///
/// Operational settings such as producer batch size are intentionally absent. A
/// snapshot may be reused only when this value matches exactly.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub struct ScanScope {
    /// Maximum retained relative depth, or unlimited when absent.
    pub max_depth: Option<usize>,
    /// Whether directory symlinks are followed.
    pub follow_symlinks: bool,
    /// Whether traversal stays on the root filesystem.
    pub one_filesystem: bool,
    /// Identity of leading-dot component admission and its exact-name allowlist.
    pub hidden_fingerprint: u64,
    /// Whether filesystem objects outside files, directories, and symlinks are excluded.
    pub exclude_special: bool,
    /// Ignored population retained by this scan.
    pub population: crate::query::IgnoredEntries,
    /// Identity of the compiled ignore policy.
    pub ignore_rules_fingerprint: u64,
    /// Identity of the compiled type-classification policy.
    pub type_rules_fingerprint: u64,
    /// Identity of the enabled reducer set.
    pub reducers_fingerprint: u64,
}

/// Answer-semantics identity derived from validated classification and reducer rules.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub struct SemanticIdentity {
    /// Identity of the compiled ignore policy.
    pub ignore_rules_fingerprint: u64,
    /// Identity of the compiled type-classification policy.
    pub type_rules_fingerprint: u64,
    /// Identity of the enabled reducer set.
    pub reducers_fingerprint: u64,
}

/// Opaque identity of one opened-root lifetime.
///
/// This process-local value prevents a cursor or expected version from one open from
/// being accepted by another whose sequence happens to match. It is not a credential
/// and is never persisted.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub struct SessionId(pub(crate) u64);

impl SessionId {
    /// Return the process-local opaque value for a language or wire adapter.
    ///
    /// This value is an identity, not a credential. Consumers should preserve it exactly
    /// and must not infer ordering or lifetime from it.
    pub const fn opaque(self) -> u64 {
        self.0
    }

    /// Recover an opaque session identity previously returned by [`Self::opaque`].
    ///
    /// Zero is reserved and never identifies a live opened root.
    pub const fn from_opaque(value: u64) -> Option<Self> {
        if value == 0 { None } else { Some(Self(value)) }
    }
}

/// Identity and exact sequence of one committed opened-root state.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub struct EngineVersion {
    /// Live owner that minted this version.
    pub session: SessionId,
    /// Exact committed index sequence observed by the read.
    pub sequence: Clock,
    /// Filesystem-fact identity bound when the root was opened.
    pub scope: EntryScope,
    /// Classification and reducer identity bound when the root was opened.
    pub semantics: SemanticIdentity,
}

impl ScanScope {
    /// Whether an index of this scope observed `.gitignore` control state.
    ///
    /// False when the scan ran with [`ScanConfig::read_controls`](crate::ScanConfig) off:
    /// no control file was read and no entry was classified. Such an index cannot say
    /// whether an entry is ignored, so
    /// [`Index::is_ignored`](crate::Index::is_ignored),
    /// [`Index::controls`](crate::Index::controls), and the partition accessors
    /// ([`Index::partition_total`](crate::Index::partition_total) and its per-directory
    /// forms) refuse with [`Error::ControlStateNotObserved`] rather than answer "not
    /// ignored" for everything, and a shared
    /// [`ChildSnapshot`](crate::ChildSnapshot) carries no ignore bit or partitions.
    ///
    /// The ignore-rules fingerprint is derived from the scope's
    /// [`ControlTierIdentity`](crate::ControlTierIdentity), which reserves zero for a tier
    /// that observed nothing; a caller holding the identity asks it directly.
    pub const fn observes_controls(self) -> bool {
        self.ignore_rules_fingerprint != 0
    }

    /// The part of this validated scope that determines retained filesystem facts.
    pub const fn entry_scope(self) -> EntryScope {
        EntryScope {
            max_depth: self.max_depth,
            follow_symlinks: self.follow_symlinks,
            one_filesystem: self.one_filesystem,
            hidden_fingerprint: self.hidden_fingerprint,
            exclude_special: self.exclude_special,
            population: self.population,
            control_fingerprint: if matches!(self.population, crate::query::IgnoredEntries::Include)
            {
                0
            } else {
                self.ignore_rules_fingerprint
            },
        }
    }

    /// The part of this validated scope that determines classifications and roll-ups.
    pub const fn semantic_identity(self) -> SemanticIdentity {
        SemanticIdentity {
            ignore_rules_fingerprint: self.ignore_rules_fingerprint,
            type_rules_fingerprint: self.type_rules_fingerprint,
            reducers_fingerprint: self.reducers_fingerprint,
        }
    }
}

/// Where a value came from, so a consumer can trade speed for certainty knowingly.
///
/// Ordered weakest-last: comparing two sources yields the one to trust less, which is
/// what a roll-up needs when combining a subtree.
#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Debug, Hash, Default)]
pub enum Source {
    /// Observed from the filesystem by this process.
    #[default]
    Scanned,
    /// Loaded from a snapshot and re-verified by a fresh stat this session.
    Revalidated,
    /// Loaded from a snapshot; a change journal reported nothing touching this subtree
    /// since the cursor, and nothing has re-checked it.
    ///
    /// Named for what actually happened — a journal *scoped* the work — rather than for
    /// what a reader might wish it meant. Nothing here was confirmed against the
    /// filesystem: a scoped revalidation stats the paths the journal names and does not
    /// stat the rest, so this value rests on the journal having been complete.
    ///
    /// It is deliberately weaker than [`Self::Revalidated`] because that assumption is
    /// known to fail. macOS `FSEvents` will report `HistoryDone` after silently dropping
    /// history, with no degradation flag, which means a journal answer can be wrong
    /// without announcing it. Journal-assisted revalidation therefore bounds exposure
    /// with a maximum age and a periodic full sweep; those are risk controls, not
    /// proofs, and they do not make any individual answer here verified.
    JournalScoped,
    /// Loaded from a snapshot and not re-checked since.
    Cached,
}

/// Whether a value covers everything beneath its path.
///
/// This is the **structural coverage** axis, and only that. How far to *trust* what is
/// covered is [`Source`], and the two are deliberately independent: a cached value
/// covers the whole subtree but may be out of date, while a half-built one covers less
/// than the subtree but every byte in it was just observed.
///
/// An enum rather than a boolean because coverage will gain more ways to be incomplete
/// — truncated by a cap, cancelled, failed — and ordered worst-last so roll-ups combine
/// by taking the maximum. Those variants are not here yet; see the progressive-results
/// plan for the lifecycle they belong to.
#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Debug, Hash, Default)]
#[non_exhaustive]
pub enum Status {
    /// The value accounts for everything beneath this path that is in scope.
    #[default]
    Complete,
    /// The value does not account for everything beneath this path.
    ///
    /// **Not a promise of monotonicity.** A value being built by an additive walk only
    /// grows, but one left incomplete by reconciliation errors can move either way once
    /// the missing part is read. Monotonicity is a property of the *producer* that is
    /// running, not of this status, and a consumer that needs it must know a walk is in
    /// progress rather than infer it from here.
    Partial,
}

/// Everything a consumer needs to decide how far to trust one value.
///
/// A *view* type, built on demand rather than stored: the index keeps one [`Source`]
/// byte per entry and its observation timestamps once, because on a tree of millions
/// of entries the timestamps are shared by nearly all of them and a per-entry struct
/// would cost more memory than the information is worth.
///
/// The three facts are independent on purpose, because they answer different
/// questions. [`Status`] asks how much of the subtree the number covers;
/// [`Source`] asks how far to trust what it covers; `observed_at_ns` asks when.
/// A [`Status::Complete`] but [`Source::Cached`] value is a point estimate that may
/// move either way and reads as "about 3.2 GB, as of two minutes ago", while a
/// [`Status::Partial`] value is missing part of its subtree and reads as "3.2 GB so
/// far". Collapsing them would make a shrinking number look like a defect.
///
/// Note that "3.2 GB so far" is only a *lower bound that grows* while an additive walk
/// is running. See [`Status::Partial`]: the status records coverage, not direction.
#[derive(Clone, Copy, PartialEq, Eq, Debug)]
pub struct Provenance {
    /// Where the value came from.
    pub source: Source,
    /// When the underlying filesystem observation was made, in nanoseconds since the
    /// Unix epoch. For [`Source::Cached`] this is when the snapshot captured it — the
    /// "as of" a consumer displays. Zero when unknown.
    pub observed_at_ns: i64,
    /// How settled the value is.
    pub status: Status,
}

impl Source {
    /// Whether a value from this source was checked against the filesystem during
    /// this session.
    pub const fn is_verified(self) -> bool {
        matches!(self, Self::Scanned | Self::Revalidated)
    }
}

impl Provenance {
    /// Freshly observed by this process, complete.
    pub const fn scanned(observed_at_ns: i64) -> Self {
        Self { source: Source::Scanned, observed_at_ns, status: Status::Complete }
    }

    /// Combine with another value's provenance, taking the less trustworthy of each
    /// fact.
    ///
    /// This is what makes a directory only as trustworthy as its least trustworthy
    /// descendant: the weakest source, the oldest observation, and the worst status.
    ///
    /// Every fact fails closed, including time: an unknown `observed_at_ns` is
    /// absorbing rather than skipped, so a subtree with one contributor of unknown age
    /// reports an unknown age instead of a precise time it cannot prove.
    ///
    /// There is deliberately **no identity element**. Because unknown is absorbing, it
    /// cannot double as the seed of a fold, and a caller aggregating a possibly-empty
    /// set must represent emptiness separately (`Option<Provenance>`) rather than
    /// seeding with a zero timestamp — otherwise every roll-up would come out unknown.
    #[must_use]
    pub fn combine(self, other: Self) -> Self {
        Self {
            source: self.source.max(other.source),
            observed_at_ns: match (self.observed_at_ns, other.observed_at_ns) {
                // Unknown is contagious, not skipped. Zero means "we cannot say when",
                // and the honest combination of a known time with an unknown one is
                // still unknown: a parent that drops the unknown contributor would
                // advertise a precise "as of" it cannot prove for the whole subtree.
                // Unknown is not the identity for "oldest observation" — it is the
                // absorbing element.
                (0, _) | (_, 0) => 0,
                (mine, other) => mine.min(other),
            },
            status: self.status.max(other.status),
        }
    }

    /// Whether this value was checked against the filesystem during this session.
    pub const fn is_verified(self) -> bool {
        self.source.is_verified()
    }
}

/// Trust state for an index or queried subtree.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub enum Freshness {
    /// Every path in scope has been reconciled successfully.
    Fresh,
    /// A reconciliation pass is currently checking this scope.
    Reconciling,
    /// A producer reported lost precision and reconciliation has not completed.
    Stale,
    /// Reconciliation encountered errors, so some state is unknown.
    Partial,
}

/// Current activity of one opened root.
///
/// Phase is deliberately independent of coverage and freshness. A stopped root may
/// still serve a useful partial image, and a watching root may temporarily be stale.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub enum LifecyclePhase {
    /// A cold walk is adding verified entries.
    Discovering,
    /// Explicit or gap-closing verification is in progress.
    Reconciling,
    /// The current retained image is available without a live observer.
    Ready,
    /// Native or polling observation is active.
    Watching,
    /// The owner will perform no more expanding work.
    Stopped,
    /// A terminal provider failure ended useful work.
    Failed,
}

/// Why an opened root cannot claim complete structural coverage.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub enum CoverageReason {
    /// Initial discovery has not yet finished.
    Building,
    /// A configured resource budget refused additional admissible work.
    Budget,
    /// The owner was cancelled before the operation completed.
    Cancelled,
    /// Part of the configured scope could not be read.
    Inaccessible,
    /// A terminal provider failure prevented completion.
    Failed,
}

/// Structural coverage of one opened root.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub enum Coverage {
    /// Every directory in scope has a complete child listing.
    Complete,
    /// Some in-scope absence remains unknowable for the stated reason.
    Partial(CoverageReason),
}

/// Maximum issue details retained by one index image.
pub const MAX_RETAINED_ISSUES: usize = 64;
/// Maximum UTF-8 bytes retained in one rendered issue message.
pub const MAX_ISSUE_MESSAGE_BYTES: usize = 512;
/// Maximum native encoded bytes retained for one issue path.
pub const MAX_ISSUE_PATH_BYTES: usize = 4_096;

/// Stable category for one non-fatal condition or terminal provider failure.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub enum IssueKind {
    /// The operating system refused access to a path.
    Permission,
    /// A path disappeared during verification.
    Disappeared,
    /// Filesystem metadata could not be interpreted.
    InvalidMetadata,
    /// A configured discovery resource bound refused work.
    ResourceBudget,
    /// The filesystem observer lost precision and required verified recovery.
    ObservationGap,
    /// The provider failed for another reason.
    ProviderFailure,
}

/// Bounded diagnostic evidence retained with an index state.
#[derive(Clone, PartialEq, Eq, Debug, Hash)]
pub struct Issue {
    /// Machine-readable category.
    pub kind: IssueKind,
    /// Affected path when it fits the detail bound. Issues an opened root retains or
    /// returns name it relative to the root, the form its reads use; a message may still
    /// name the absolute path the operating system refused.
    pub path: Option<PathBuf>,
    /// Human-readable detail, truncated at a UTF-8 boundary when necessary.
    pub message: String,
    /// Operating-system error number when one was supplied.
    pub os_error: Option<i32>,
}

impl Issue {
    /// Convert one engine error without retaining unbounded rendered detail.
    pub fn from_error(error: &Error) -> Self {
        match error {
            Error::Io { path, source } => Self::from_io(path, source),
            other => Self {
                kind: IssueKind::ProviderFailure,
                path: None,
                message: bounded_issue_message(other.to_string()),
                os_error: None,
            },
        }
    }

    pub(crate) fn from_io(path: &Path, source: &std::io::Error) -> Self {
        Self {
            kind: match source.kind() {
                std::io::ErrorKind::PermissionDenied => IssueKind::Permission,
                std::io::ErrorKind::NotFound => IssueKind::Disappeared,
                std::io::ErrorKind::InvalidData | std::io::ErrorKind::InvalidInput => {
                    IssueKind::InvalidMetadata
                }
                _ => IssueKind::ProviderFailure,
            },
            path: bounded_issue_path(path),
            message: bounded_issue_message(format!("I/O error at {}: {source}", path.display())),
            os_error: source.raw_os_error(),
        }
    }

    /// Convert one error met while reading an opened root, naming its path relative to it.
    ///
    /// Scan errors carry the absolute path the operating system refused, and the message
    /// keeps it for whoever has to fix the permission. The `path` field is the root-relative
    /// form every other opened-root issue uses, so two issues about one directory agree and
    /// a consumer can match an issue to the path it reads.
    pub(crate) fn from_error_under(root: &Path, error: &Error) -> Self {
        let mut issue = Self::from_error(error);
        if let Error::Io { path, .. } = error {
            issue.relativize(root, path);
        }
        issue
    }

    /// [`Self::from_io`] for a path under an opened root, naming it relative to the root.
    pub(crate) fn from_io_under(root: &Path, path: &Path, source: &std::io::Error) -> Self {
        let mut issue = Self::from_io(path, source);
        issue.relativize(root, path);
        issue
    }

    fn relativize(&mut self, root: &Path, path: &Path) {
        if let Ok(relative) = path.strip_prefix(root) {
            self.path = bounded_issue_path(relative);
        }
    }

    /// Describe the first file refused by an opened-root resource budget.
    pub(crate) fn resource_budget(max_files: u64) -> Self {
        Self {
            kind: IssueKind::ResourceBudget,
            path: None,
            message: format!(
                "verified work refused an admissible file after retaining {max_files}"
            ),
            os_error: None,
        }
    }

    /// Describe observer loss without confusing it with consumer journal loss.
    pub(crate) fn observation_gap(path: &Path, reason: InvalidateReason) -> Self {
        Self {
            kind: IssueKind::ObservationGap,
            path: bounded_issue_path(path),
            message: bounded_issue_message(format!(
                "filesystem observation lost precision at {}: {reason:?}",
                path.display()
            )),
            os_error: None,
        }
    }

    /// Describe an operational provider failure when no structured OS error is available.
    pub(crate) fn provider_failure(path: Option<&Path>, message: String) -> Self {
        Self {
            kind: IssueKind::ProviderFailure,
            path: path.and_then(bounded_issue_path),
            message: bounded_issue_message(message),
            os_error: None,
        }
    }
}

fn bounded_issue_path(path: &Path) -> Option<PathBuf> {
    (path.as_os_str().as_encoded_bytes().len() <= MAX_ISSUE_PATH_BYTES).then(|| path.to_path_buf())
}

fn bounded_issue_message(mut message: String) -> String {
    if message.len() <= MAX_ISSUE_MESSAGE_BYTES {
        return message;
    }
    let mut end = MAX_ISSUE_MESSAGE_BYTES;
    while !message.is_char_boundary(end) {
        end -= 1;
    }
    message.truncate(end);
    message
}

/// Counts for the bounded issue details captured with a state.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Default, Hash)]
pub struct IssueSummary {
    /// Details retained and available to a coherent read.
    pub retained: u64,
    /// Additional details omitted after the bound was reached.
    pub omitted: u64,
}

/// Committed, bounded discovery counters.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Default, Hash)]
pub struct DiscoveryProgress {
    /// Regular files retained by cold discovery.
    pub files_retained: u64,
    /// Directories whose complete in-scope child listing was committed: by discovery, or
    /// by a later complete reconciliation that listed one the index did not yet hold as
    /// complete, such as a directory created afterwards or one discovery could not read.
    /// Each is one [`StateTransition::DirectoryComplete`].
    pub directories_complete: u64,
}

/// Coherent public state captured at an index commit boundary.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub struct IndexState {
    /// Current activity of the opened root.
    pub phase: LifecyclePhase,
    /// Whether the retained tree covers all configured scope.
    pub coverage: Coverage,
    /// How current the retained facts are believed to be.
    pub freshness: Freshness,
    /// Weakest source represented by this first implementation.
    pub source: Source,
    /// Stable counters advanced only by committed discovery and reconciliation work.
    pub progress: DiscoveryProgress,
    /// Bounded diagnostic evidence counts at this version.
    pub issues: IssueSummary,
}

/// Maximum native projections accepted by one coherent read.
pub const MAX_READ_PROJECTIONS: usize = 16;
/// Maximum rows returned by one page projection.
pub const MAX_PAGE_ROWS: usize = 4_096;
/// Maximum deterministic work allowance accepted by one page projection.
pub const MAX_PAGE_WORK: u64 = 1_000_000;
/// Maximum report sections and reported omissions accepted in one opened read.
pub const MAX_REPORT_VIEWS: usize = 16;
/// Default cap for a selection count not backed by an exact maintained aggregate.
pub const DEFAULT_COUNT_CAP: u64 = 10_000;
/// Maximum caller-selected cap for an on-demand aggregate.
pub const MAX_COUNT_CAP: u64 = 1_000_000;
/// Maximum retained payload for one handle-local continuation record.
///
/// Together with the 128-record table bound, this caps retained continuation payload at
/// eight MiB per opened root, excluding fixed map nodes and allocator bookkeeping.
pub const MAX_CONTINUATION_RECORD_BYTES: usize = 64 * 1_024;

/// Opaque identifier for resumable work retained by one opened root.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub struct ContinuationId {
    pub(crate) session: SessionId,
    pub(crate) ordinal: u64,
}

impl ContinuationId {
    /// Return the opaque parts a language or wire adapter must round-trip.
    pub const fn opaque_parts(self) -> (u64, u64) {
        (self.session.opaque(), self.ordinal)
    }

    /// Recover an opaque continuation previously returned by [`Self::opaque_parts`].
    ///
    /// Both zero values are reserved and never identify live continuation state.
    pub const fn from_opaque_parts(session: u64, ordinal: u64) -> Option<Self> {
        match SessionId::from_opaque(session) {
            Some(session) if ordinal != 0 => Some(Self { session, ordinal }),
            _ => None,
        }
    }
}

/// Output and work bounds for one resumable page.
#[derive(Clone, Copy, PartialEq, Eq, Debug)]
pub struct PageRequest {
    /// Maximum variable rows to return, excluding the projection's fixed envelope.
    pub limit: usize,
    /// Maximum retained-index rows to inspect.
    pub max_work: u64,
}

/// A retained entry's canonical POSIX-relative name, in the form ordered pages use.
///
/// **This is not the filename.** It is a derived name, and it differs from the native one
/// whenever a component holds bytes that are not valid UTF-8, or holds a literal `%`.
/// Never open, stat, or compare a filesystem path against one of these:
/// [`EntryValue::path`] is the identity, and this is the wire form the ordered
/// projections are keyed and ordered by. The newtype exists so that mistake is a compile
/// error rather than a convention, because a bare `String` here reads exactly like a path
/// and every test tree an author thinks to write is pure UTF-8, so the substitution passes
/// locally and fails on a real disk.
///
/// Every entry has one. A native path is not obliged to be UTF-8 — Unix filenames are
/// arbitrary non-NUL bytes, Windows filenames may hold unpaired surrogates — so the two
/// kinds of byte that cannot be carried are percent-escaped: those that do not decode,
/// and `%` itself. Escaping `%` is what makes the mapping injective. A file named
/// `caf%FF.txt` is valid UTF-8 and a file named `caf<0xFF>.txt` is not; escaping only the
/// undecodable byte would give both the same wire name, which is the aliasing bug of
/// lossy conversion in better clothes.
///
/// Nothing else is touched. This produces a JSON string, not a URL, so spaces, `#`, `?`
/// and every non-ASCII scalar pass through: `café/naïve.txt` is unchanged.
///
/// Totality is why ordered pages and native roll-ups answer over one population, why a
/// directory whose name has a stray byte still lists its children, and why a complete
/// directory that does not hold a name can answer `absent` rather than `unknown`. The
/// partial version that preceded it needed an omission count, bounded escaped examples,
/// and a second completeness flag on [`TreePage`] to describe what it could not name; all
/// three are gone.
///
/// Distinct from the unrelated structural question of whether a path is relative and
/// never ascends. A path can satisfy either condition and fail the other.
#[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct PortablePath(String);

impl PortablePath {
    /// Wrap an already-canonical portable string.
    pub(crate) fn new(path: String) -> Self {
        Self(path)
    }

    /// The canonical POSIX-relative form, for transport and ordering only.
    pub fn as_str(&self) -> &str {
        &self.0
    }

    /// Consume the wrapper, yielding the canonical POSIX-relative form.
    pub fn into_string(self) -> String {
        self.0
    }

    /// Heap payload retained when a continuation record owns this path.
    ///
    /// Named to match `Selection::retained_heap_bytes` and
    /// `EntrySelection::retained_heap_bytes`, because all three feed one cap and a
    /// component that accounts for itself differently is how a bound silently stops
    /// holding.
    pub(crate) fn retained_heap_bytes(&self) -> usize {
        self.0.capacity()
    }
}

impl std::borrow::Borrow<str> for PortablePath {
    fn borrow(&self) -> &str {
        &self.0
    }
}

impl std::fmt::Display for PortablePath {
    fn fmt(&self, formatter: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        formatter.write_str(&self.0)
    }
}

// Transparent on purpose. These values appear in session goldens, where the reader is
// checking which path a page returned; a wrapper name repeated on every row would be
// noise in the one place the value has to stay legible.
impl std::fmt::Debug for PortablePath {
    fn fmt(&self, formatter: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        std::fmt::Debug::fmt(&self.0, formatter)
    }
}

/// One immutable retained entry returned by an opened-root read.
#[derive(Clone, PartialEq, Eq, Debug)]
pub struct EntryValue {
    /// Native path relative to the opened root.
    pub path: PathBuf,
    /// Canonical POSIX-relative form. Every entry has one. See [`PortablePath`].
    pub portable_path: PortablePath,
    /// Retained filesystem kind.
    pub kind: EntryKind,
    /// Retained filesystem attributes.
    pub attrs: Attrs,
    /// Effective fixed-control classification.
    pub ignored: bool,
    /// Name- and registry-derived identity for a regular file.
    ///
    /// Projected at read time so detached indexes and the standalone CLI retain no
    /// duplicate strings or interactive-only classification payload.
    pub classification: Option<crate::classify::NameClassification>,
    /// Both constant-size maintained aggregate partitions for a directory.
    pub rollup: Option<crate::index::PartitionRollUpSummary>,
    /// Whether a directory's complete in-scope child set is known.
    pub children_complete: Option<bool>,
}

/// Three-valued knowledge for a path lookup.
#[derive(Clone, PartialEq, Eq, Debug)]
pub enum Knowledge<T> {
    /// The requested value is retained.
    Present(T),
    /// Complete relevant coverage proves the path is absent.
    Absent,
    /// Current coverage cannot prove presence or absence.
    Unknown {
        /// Why the relevant scope is incomplete.
        reason: CoverageReason,
    },
}

/// One fdu-native projection requested under a coherent read boundary.
#[derive(Clone, Debug)]
pub enum ReadProjection {
    /// Look up one relative path with three-valued, portable-safe absence.
    Lookup {
        /// Native path relative to the opened root.
        path: PathBuf,
    },
    /// Return both maintained aggregate partitions for one directory.
    RollUp {
        /// Directory relative to the opened root.
        path: PathBuf,
    },
    /// Return one page of portable descendants, level by level to `depth`.
    Tree {
        /// Directory relative to the opened root.
        path: PathBuf,
        /// How many levels below `path` the page descends.
        ///
        /// `Limit(1)` is this directory's own children. Rows arrive in breadth-first
        /// level order, so a page cut short by `page` withholds depth rather than
        /// breadth: the caller can always tell how wide each level it received was.
        depth: crate::query::Bound,
        /// Whether entries in the fixed ignored partition are traversed.
        ///
        /// `false` prunes the excluded directory's whole subtree, contributing neither
        /// it nor any descendant, rather than filtering its row and descending anyway.
        include_ignored: bool,
        /// Page output and work bounds.
        page: PageRequest,
    },
    /// Return one portable-path-ordered page under an fdu-native selection.
    Flat {
        /// Additive portable-entry selection composing the existing query predicates.
        selection: crate::query::EntrySelection,
        /// Compact or full retained row shape.
        shape: RowShape,
        /// Page output and work bounds.
        page: PageRequest,
    },
    /// Count portable entries under one selection, exactly or to an explicit cap.
    Aggregate {
        /// Additive portable-entry selection composing the existing query predicates.
        selection: crate::query::EntrySelection,
        /// Maximum matches counted before returning a lower bound.
        count_cap: u64,
        /// Maximum portable index rows inspected.
        max_work: u64,
    },
    /// Evaluate the existing pure fdu query/report machinery at this read boundary.
    Report(ReportRequest),
    /// Resume a tree or flat page from handle-local retained traversal state.
    Continue {
        /// Opaque continuation returned by a prior page.
        continuation: ContinuationId,
        /// Bounds for this page; query identity remains in the handle.
        page: PageRequest,
    },
    /// Return fixed-size owner, scope, and retained-issue diagnostics.
    Diagnostics,
}

/// Fixed-size diagnostics captured with a coherent read.
#[derive(Clone, PartialEq, Eq, Debug)]
pub struct ReadDiagnostics {
    /// Absolute filesystem root owned by this handle.
    pub root: PathBuf,
    /// Validated filesystem and semantic scope.
    pub scope: ScanScope,
    /// Live retained entries, including the root.
    pub entries: u64,
    /// Bounded typed issue details at this version.
    pub issues: Vec<Issue>,
    /// Which `.gitignore` files apply and which were refused, at this version. An opened
    /// root always observes control state.
    pub controls: crate::control::ControlObservation,
}

/// One structural page of a directory's descendants, to the requested depth.
#[derive(Clone, PartialEq, Eq, Debug)]
pub struct TreePage {
    /// Directory whose descendants are listed.
    pub directory: EntryValue,
    /// Portable rows in breadth-first level order; each parent's children are
    /// directories-first in canonical byte order.
    pub rows: Vec<EntryValue>,
    /// Opaque continuation when another page exists at this version.
    pub next: Option<ContinuationId>,
    /// Whether this directory's complete in-scope child set is known.
    pub complete: bool,
}

/// Retained fields copied into portable page rows.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Default, Hash)]
pub enum RowShape {
    /// Path, kind, attributes, and classification without directory roll-ups.
    #[default]
    Compact,
    /// Compact fields plus maintained directory roll-ups and completeness.
    Full,
}

/// One portable flat-entry page.
#[derive(Clone, PartialEq, Eq, Debug)]
pub struct FlatPage {
    /// Rows in complete canonical POSIX-relative UTF-8 byte order.
    pub rows: Vec<EntryValue>,
    /// Opaque continuation when another matching row exists at this version.
    pub next: Option<ContinuationId>,
}

/// Product count whose exactness is explicit.
#[derive(Clone, Copy, PartialEq, Eq, Debug)]
pub enum CountResult {
    /// Every matching row was counted.
    Exact(u64),
    /// Additional matches exist beyond this proven lower bound.
    AtLeast(u64),
}

/// The read half of a request at an opened root, plus one read's work bound.
///
/// The basis is the opened root's own and is never supplied here: a caller names what each
/// read asks -- the query and the instant it is asked at -- and [`crate::query::Request`]
/// composes the two for validation.
#[derive(Clone, Debug)]
pub struct ReportRequest {
    /// Existing selection and view vocabulary shared by one-shot surfaces.
    pub query: crate::query::Query,
    /// The instant this read resolves against, which is also the report's `generated_at`.
    ///
    /// Caller-supplied, keeping the projection deterministic.
    pub now: std::time::SystemTime,
    /// Maximum retained-index and maintained-index rows read by the report.
    pub max_work: u64,
}

/// Projection whose deterministic work allowance was exhausted.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub enum LimitedProjection {
    /// Structural tree page.
    Tree,
    /// Portable flat page.
    Flat,
    /// Existing query/report projection.
    Report,
    /// Selection count outside the maintained aggregate set.
    Aggregate,
}

/// Typed bounded-query result; no partial calculation is presented as exact.
#[derive(Clone, Copy, PartialEq, Eq, Debug)]
pub struct QueryLimit {
    /// Projection that exhausted its allowance.
    pub projection: LimitedProjection,
    /// Work allowance supplied by the caller.
    pub max_work: u64,
    /// Rows examined before stopping.
    pub rows_visited: u64,
}

/// Input to one coherent opened-root read.
#[derive(Clone, Debug, Default)]
pub struct ReadRequest {
    /// Projections to return, in this exact order.
    pub projections: Vec<ReadProjection>,
    /// Exact version required by a caller assembling a multi-read result.
    pub expected: Option<EngineVersion>,
}

/// Why one projection of a read refused, while every other projection still answered.
///
/// A read fails as a whole only when no projection in it can be trusted: the request's
/// shape is invalid, the root is closed, or the version it pinned is not the one the index
/// holds. A refusal is narrower. It depends on what one projection found at that version,
/// so the lookup of a path beside a tree page that refused the same path still answers,
/// and a caller never has to prove a path is a directory before it may batch the question.
#[derive(Clone, PartialEq, Eq, Debug)]
pub enum ProjectionRefusal {
    /// A tree page or roll-up named a retained path that is not a directory.
    ///
    /// A lookup of the same path answers `Present`, so neither three-valued answer fits:
    /// `Absent` claims coverage proves the path missing, and `Unknown` claims coverage
    /// cannot tell, which for a retained path never resolves. It depends on index state:
    /// the same projection answers while the path is a directory and refuses once it has
    /// become a file, so a path taken from an earlier page can start refusing between
    /// reads.
    NotADirectory {
        /// The normalized path the projection named.
        path: PathBuf,
    },
    /// A page stopped with rows left, and the record that would resume it exceeds
    /// [`MAX_CONTINUATION_RECORD_BYTES`].
    ///
    /// The page is refused rather than returned without a way to continue, which would
    /// present a truncated page as a finished one. Only very long paths or a very large
    /// selection reach it. A refused continued page keeps its continuation, so the caller
    /// may retry it with a different page bound.
    ContinuationRecordLimit {
        /// Structural payload bytes the record would retain.
        attempted: usize,
        /// Maximum structural payload retained by one record.
        limit: usize,
    },
    /// A `Continue` named a continuation this root issued but no longer retains.
    ///
    /// An earlier page consumed it, or the root's bound on retained continuations evicted
    /// it to make room for newer pages. Both depend on what other pages did, not on the
    /// request, so a token that worked a moment ago costs only its own projection. Start
    /// the page again from its first request. A token from another opened root, or one
    /// this root never issued, still fails the whole read with
    /// [`Error::ContinuationUnavailable`].
    ContinuationUnavailable,
}

/// One projection result, in the same position as its request.
#[derive(Clone, Debug)]
pub enum ProjectionResult {
    /// Three-valued retained-entry lookup.
    Lookup(Knowledge<EntryValue>),
    /// Three-valued directory roll-up lookup.
    RollUp(Knowledge<crate::index::PartitionRollUpSummary>),
    /// Three-valued structural tree page.
    Tree(Knowledge<TreePage>),
    /// Portable flat entry page.
    Flat(FlatPage),
    /// Exact maintained or explicitly capped portable selection count.
    Aggregate(CountResult),
    /// Existing fdu query report.
    Report(crate::query::Report),
    /// Fixed-size provider and lifecycle diagnostics.
    Diagnostics(ReadDiagnostics),
    /// A bounded projection stopped without returning a misleading partial answer.
    Limit(QueryLimit),
    /// This projection refused; the rest of the read answered.
    Refused(ProjectionRefusal),
}

/// One coherent opened-root response.
#[derive(Clone, Debug)]
pub struct ReadResponse {
    /// Exact live-session version observed by every returned field.
    pub version: EngineVersion,
    /// State captured at the same commit boundary as every projection.
    pub state: IndexState,
    /// Projection results in request order.
    pub results: Vec<ProjectionResult>,
    /// Deterministic work charged while assembling the response.
    pub work: Work,
    /// Cursor from which a consumer can later resume exact changes.
    pub change_cursor: EngineVersion,
}

/// Input to one blocking opened-root journal poll.
#[derive(Clone, Copy, PartialEq, Eq, Debug)]
pub struct ChangeRequest {
    /// Exact live version after which commits are requested.
    pub after: EngineVersion,
    /// Maximum time to wait when the journal has not advanced.
    pub timeout: std::time::Duration,
}

/// Journal outcome at one coherent terminal version and state.
#[derive(Clone, PartialEq, Eq, Debug)]
pub enum ChangeOutcome {
    /// Every retained exact commit after the requested version, oldest first.
    Changes {
        /// Exact engine commits; consumers invalidate and coherently reread projections.
        commits: Vec<Commit>,
        /// Bounded union of the commits' answer invalidations.
        impact: Impact,
    },
    /// No newer commit arrived before the timeout.
    Idle,
    /// The requested version predates retained history and the consumer must reread.
    Reset {
        /// Complete invalidation guidance; lost paths are never presented as enumerable.
        impact: Impact,
    },
}

/// Result of one opened-root journal poll.
#[derive(Clone, PartialEq, Eq, Debug)]
pub struct ChangePoll {
    /// Cursor to use for the next poll; unchanged for [`ChangeOutcome::Idle`].
    pub cursor: EngineVersion,
    /// Exact terminal version captured with the outcome and state.
    pub version: EngineVersion,
    /// Complete public state at `version`.
    pub state: IndexState,
    /// Changes, timeout, or consumer-history recovery.
    pub outcome: ChangeOutcome,
    /// Deterministic journal work performed while assembling the result.
    pub work: Work,
}

/// Why one requested refresh path was not verified.
///
/// Rejections are values rather than dropped inputs so a hint producer can distinguish
/// "verified and unchanged" from "not examined" without parsing an error message.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
#[non_exhaustive]
pub enum RefreshRejection {
    /// The path was absolute or traversed above the opened root.
    OutsideRoot,
    /// The path is deeper than the opened root's semantic depth boundary.
    BeyondDepth,
    /// A fixed admission rule excludes the path from retained truth.
    NotAdmitted,
    /// A symlink or filesystem boundary makes the requested ancestry unsafe to walk.
    UnsafeAncestry,
    /// Verifying the path could expand a resource-stopped retained set.
    ResourceBudget,
}

impl RefreshRejection {
    /// Stable label for wire adapters.
    pub const fn as_str(self) -> &'static str {
        match self {
            Self::OutsideRoot => "outside_root",
            Self::BeyondDepth => "beyond_depth",
            Self::NotAdmitted => "not_admitted",
            Self::UnsafeAncestry => "unsafe_ancestry",
            Self::ResourceBudget => "resource_budget",
        }
    }
}

/// One refresh path that the engine declined, with its typed reason.
#[derive(Clone, PartialEq, Eq, Debug, Hash)]
pub struct RejectedRefreshPath {
    /// Path exactly as supplied by the caller.
    pub path: PathBuf,
    /// Rule that prevented verification.
    pub reason: RefreshRejection,
}

/// Result of one bounded, multi-path refresh.
///
/// Every commit created by this operation lies in the half-open journal interval
/// `(after, version]`. Concurrent producers may also commit within that interval, so
/// `impact` covers the complete interval rather than trying to identify a producer.
#[derive(Clone, PartialEq, Eq, Debug)]
pub struct RefreshResult {
    /// Coherent engine version immediately before refresh state was announced.
    pub after: EngineVersion,
    /// Coherent terminal engine version after every accepted scope was closed.
    pub version: EngineVersion,
    /// Complete public state at `version`.
    pub state: IndexState,
    /// Unique canonical paths accepted for verification, in stable path order.
    pub accepted: Vec<PathBuf>,
    /// Rejected request entries in caller order.
    pub rejected: Vec<RejectedRefreshPath>,
    /// Bounded union of every invalidation in `(after, version]`, or `all_dirty` when
    /// the journal floor advanced before the receipt was assembled.
    pub impact: Impact,
    /// Deterministic filesystem and commit work performed by this refresh.
    pub work: Work,
    /// Bounded operational issues encountered while verification continued.
    pub issues: Vec<Issue>,
    /// Additional issues omitted after the public detail bound.
    pub omitted_issues: u64,
}

impl Default for IndexState {
    fn default() -> Self {
        Self {
            phase: LifecyclePhase::Ready,
            coverage: Coverage::Complete,
            freshness: Freshness::Fresh,
            source: Source::Scanned,
            progress: DiscoveryProgress::default(),
            issues: IssueSummary::default(),
        }
    }
}

impl Freshness {
    pub(crate) const fn rank(self) -> u8 {
        match self {
            Self::Fresh => 0,
            Self::Reconciling => 1,
            Self::Stale => 2,
            Self::Partial => 3,
        }
    }
}

/// Why a producer had to escalate to [`Op::InvalidateSubtree`] instead of describing a
/// change precisely.
///
/// Each variant corresponds to a real, documented platform limitation rather than a
/// defensive catch-all, and the scan layer resolves every one of them the same way.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub enum InvalidateReason {
    /// The kernel dropped events: inotify `Q_OVERFLOW`, `FSEvents` `MustScanSubDirs`, or a
    /// Windows `ReadDirectoryChangesW` buffer overrun. All three surface through notify
    /// as `Flag::Rescan`, and swallowing that flag silently corrupts any index built on
    /// events.
    WatchOverflow,
    /// A rename left entries no event describes. Renames arrive one side at a time
    /// (`FSEvents` reports each path with no mechanism to associate old and new), and
    /// each side is verified as its own path, so this is raised only where a side's own
    /// path does not settle it: a directory that arrived by rename is relisted, because
    /// no backend reports a moved tree's contents; a renamed name its parent does not
    /// list exactly (a case-only rename on an insensitive filesystem) reconciles the
    /// parent; and a rename of the root itself, or from a backend that may never name
    /// the new side (kqueue), reconciles the whole root.
    UnpairedRename,
    /// A directory was created and its watch registered a moment later; anything created
    /// inside that window produced no event at all.
    WatchSetupRace,
    /// A periodic reconciliation sweep, for backends that cannot signal drops at all
    /// (kqueue).
    PeriodicSweep,
    /// Stat verification failed without proving the path is gone. The known entry must
    /// remain until reconciliation can retry and report the underlying I/O error.
    VerificationFailed,
    /// A verified child arrived below ancestry the index has not verified. The child is
    /// withheld while reconciliation starts from the nearest known directory.
    UnknownAncestry,
    /// Repeated concurrent commits prevented a watch sample from reaching a stable
    /// arbitration boundary. The root is reconciled instead of doing filesystem I/O
    /// under the index lock or allowing an old sample to win.
    WatchContention,
    /// A control edit may admit or remove entries under a narrowed ignored population,
    /// including entries absent from the current index. Revisit its parent directory.
    ControlPopulationChanged,
    /// Requested by the caller.
    Requested,
}

/// A single change to one path.
#[derive(Clone, PartialEq, Eq, Debug)]
pub enum Op {
    /// The entry appeared or changed. Always carries a fresh stat, never a bare event.
    Upsert {
        /// Path relative to the index root.
        path: PathBuf,
        /// Newly observed entry kind.
        kind: EntryKind,
        /// Newly observed metadata.
        attrs: Attrs,
    },
    /// The entry is gone. Implies removal of every descendant.
    Remove {
        /// Path relative to the index root.
        path: PathBuf,
    },
    /// Exact bytes read from a verified `.gitignore` control file.
    ///
    /// This is separate from the file entry upsert so admission may retain the signal
    /// without creating a visible row. Producers normally emit both while control files
    /// are visible and only this operation when later admission excludes the row.
    ControlUpsert {
        /// Control-file path relative to the index root.
        path: PathBuf,
        /// Complete source bytes, bounded by the receiving control table.
        source: Vec<u8>,
    },
    /// A previously observed `.gitignore` control file is absent.
    ControlRemove {
        /// Control-file path relative to the index root.
        path: PathBuf,
    },
    /// The producer could not describe the change precisely; the consumer must re-scan
    /// this subtree. The scan layer turns this back into precise ops, so escalation is
    /// closed-loop rather than a dead end.
    InvalidateSubtree {
        /// Relative root of the scope that must be reconciled.
        path: PathBuf,
        /// Why the producer could not report precise changes.
        reason: InvalidateReason,
    },
}

impl Op {
    /// The path this op applies to.
    pub fn path(&self) -> &Path {
        match self {
            Self::Upsert { path, .. }
            | Self::Remove { path }
            | Self::ControlUpsert { path, .. }
            | Self::ControlRemove { path }
            | Self::InvalidateSubtree { path, .. } => path,
        }
    }
}

/// The complete indexed state of one path at an observation boundary.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub enum PathState {
    /// The path was not indexed.
    Absent,
    /// The path was indexed with these observed fields.
    Present {
        /// Indexed entry kind.
        kind: EntryKind,
        /// Indexed metadata.
        attrs: Attrs,
    },
}

/// Generation- and revision-safe identity for one indexed entry.
///
/// The fields are intentionally opaque. Producers obtain identities through
/// [`crate::Index::expectation`] rather than manufacturing handles that could
/// accidentally alias a recycled arena slot or bypass ABA detection.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub(crate) struct EntryIdentity {
    slot: u32,
    generation: u64,
    revision: u64,
    children_revision: u64,
    directory: bool,
}

impl EntryIdentity {
    pub(crate) const fn new(
        slot: u32,
        generation: u64,
        revision: u64,
        children_revision: u64,
        directory: bool,
    ) -> Self {
        Self { slot, generation, revision, children_revision, directory }
    }

    pub(crate) const fn same_target(self, other: Self, require_structure: bool) -> bool {
        self.slot == other.slot
            && self.generation == other.generation
            && self.revision == other.revision
            && (!require_structure || self.children_revision == other.children_revision)
    }

    pub(crate) const fn same_absence_guard(self, other: Self) -> bool {
        self.slot == other.slot
            && self.generation == other.generation
            && self.children_revision == other.children_revision
            && (other.directory || self.revision == other.revision)
    }
}

/// State and entry revisions captured at one observation boundary.
///
/// Present paths carry a generation-safe target identity and direct revision so a
/// change-away-and-back cannot masquerade as the original state. Absent paths carry the
/// nearest existing ancestor's structural revision, closing create/remove and parent
/// replacement races without making unrelated subtrees conflict.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub struct PathExpectation {
    /// Visible state captured at the observation boundary.
    pub state: PathState,
    entry: Option<EntryIdentity>,
    absence_guard: Option<EntryIdentity>,
}

impl PathExpectation {
    pub(crate) const fn new(
        state: PathState,
        entry: Option<EntryIdentity>,
        absence_guard: Option<EntryIdentity>,
    ) -> Self {
        Self { state, entry, absence_guard }
    }

    pub(crate) const fn entry(self) -> Option<EntryIdentity> {
        self.entry
    }

    pub(crate) const fn absence_guard(self) -> Option<EntryIdentity> {
        self.absence_guard
    }
}

/// The condition under which an observation may be committed.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
pub enum Expectation {
    /// Commit according to arrival order. Used by freshly verified watch observations
    /// and cold-scan bootstrap data.
    Any,
    /// Commit only if the target state and relevant structural revisions still match the
    /// producer baseline.
    State(PathExpectation),
}

/// One observed operation together with its arbitration precondition.
#[derive(Clone, PartialEq, Eq, Debug)]
pub struct ObservationOp {
    /// Proposed path mutation.
    pub op: Op,
    /// Arbitration precondition for that mutation.
    pub expectation: Expectation,
}

impl ObservationOp {
    /// An operation whose fresh verification makes arrival order authoritative.
    pub const fn unconditional(op: Op) -> Self {
        Self { op, expectation: Expectation::Any }
    }

    /// An operation valid only while `expected` still matches the index.
    pub const fn if_state(op: Op, expected: PathExpectation) -> Self {
        Self { op, expectation: Expectation::State(expected) }
    }
}

/// A producer batch awaiting arbitration by the index.
///
/// Batching is not just an efficiency detail: producers coalesce per path within a batch
/// and stat once per batch rather than once per event.
#[derive(Clone, PartialEq, Eq, Debug, Default)]
pub struct Observation {
    /// Ordered operations in this producer batch.
    pub ops: Vec<ObservationOp>,
}

impl Observation {
    /// Build an unconditional batch from freshly verified operations.
    pub fn new(ops: Vec<Op>) -> Self {
        Self { ops: ops.into_iter().map(ObservationOp::unconditional).collect() }
    }

    /// Build a batch whose operations already carry explicit expectations.
    pub const fn from_ops(ops: Vec<ObservationOp>) -> Self {
        Self { ops }
    }

    #[inline]
    /// Whether the batch contains no operations.
    pub fn is_empty(&self) -> bool {
        self.ops.is_empty()
    }

    #[inline]
    /// Number of operations in the batch.
    pub fn len(&self) -> usize {
        self.ops.len()
    }
}

/// One exact fact mutation performed by the index.
///
/// These are deliberately more specific than [`Op`]. An observation says what a
/// producer requested; an effective change says what the index actually did. One
/// upsert may, for example, replace a subtree and insert a differently typed entry.
#[derive(Clone, PartialEq, Eq, Debug)]
pub enum EffectiveChange {
    /// A previously absent entry was inserted.
    Inserted {
        /// Relative path of the inserted entry.
        path: PathBuf,
        /// Filesystem kind retained for the entry.
        kind: EntryKind,
        /// Metadata retained for the entry.
        attrs: Attrs,
    },
    /// An existing entry retained its kind and changed metadata.
    Updated {
        /// Relative path of the updated entry.
        path: PathBuf,
        /// Filesystem kind retained for the entry.
        kind: EntryKind,
        /// Metadata before the commit.
        previous: Attrs,
        /// Metadata after the commit.
        current: Attrs,
    },
    /// One entry was removed. Removing a subtree records one change per entry.
    Removed {
        /// Relative path of the removed entry.
        path: PathBuf,
        /// Filesystem kind the entry had before removal.
        kind: EntryKind,
        /// Metadata the entry had before removal.
        attrs: Attrs,
    },
    /// Exact control source identity changed.
    ControlUpdated {
        /// Relative `.gitignore` path.
        path: PathBuf,
        /// Previous source identity, or absence.
        previous: Option<crate::control::ControlIdentity>,
        /// Current source identity, or absence.
        current: Option<crate::control::ControlIdentity>,
    },
    /// A control file was refused, or its refusal lifted, so ignore classification's
    /// coverage changed.
    ///
    /// A refusal replacing a retained source arrives with the [`Self::ControlUpdated`]
    /// that drops the source; a refusal of a file no rule came from arrives alone.
    ControlRefusalUpdated {
        /// Relative `.gitignore` path.
        path: PathBuf,
        /// Why the file was refused before the commit, or absence.
        previous: Option<crate::control::ControlRefusalReason>,
        /// Why the file is refused after the commit, or absence.
        current: Option<crate::control::ControlRefusalReason>,
    },
    /// One retained entry moved between the fixed ignored and unignored partitions.
    Reclassified {
        /// Relative retained-entry path.
        path: PathBuf,
        /// Effective ignore classification before the commit.
        previous_ignored: bool,
        /// Effective ignore classification after the commit.
        current_ignored: bool,
    },
    /// A producer reported uncertainty that requires verified reconciliation.
    Invalidated {
        /// Relative root of the invalidated subtree.
        path: PathBuf,
        /// Why precise facts were unavailable.
        reason: InvalidateReason,
    },
}

impl EffectiveChange {
    /// Relative path affected by this change.
    pub fn path(&self) -> &Path {
        match self {
            Self::Inserted { path, .. }
            | Self::Updated { path, .. }
            | Self::Removed { path, .. }
            | Self::ControlUpdated { path, .. }
            | Self::ControlRefusalUpdated { path, .. }
            | Self::Reclassified { path, .. }
            | Self::Invalidated { path, .. } => path,
        }
    }
}

/// A stable fdu-native answer domain that one commit may have made stale.
#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Debug, Hash)]
pub enum ImpactDomain {
    /// Entry presence, kind, parentage, or child membership.
    Topology,
    /// Filesystem metadata on retained entries.
    Metadata,
    /// Type or ignore classification.
    Classification,
    /// Maintained directory and whole-tree aggregates.
    Aggregates,
    /// Derived content records or aggregates.
    Content,
    /// Trust, coverage, or lifecycle state.
    State,
}

/// Maximum number of individual dirty paths retained in one commit.
///
/// When a commit touches more, [`Impact::all_dirty`] is set and the partial list is
/// discarded. A truncated list would look complete and allow a stale answer to survive.
pub const MAX_DIRTY_PATHS: usize = 256;

/// Bounded invalidation guidance derived from exact effective changes.
#[derive(Clone, PartialEq, Eq, Debug, Default)]
pub struct Impact {
    /// Answer domains that may have changed, in stable enum order without duplicates.
    pub domains: Vec<ImpactDomain>,
    /// Exact affected paths and ancestors, unless [`Self::all_dirty`] is set.
    pub dirty_paths: Vec<PathBuf>,
    /// Whether the affected path set exceeded the engine's retained-path limit.
    pub all_dirty: bool,
}

/// One observable transition that did not change a retained filesystem entry.
#[derive(Clone, PartialEq, Eq, Debug)]
pub enum StateTransition {
    /// The trust state visible for a subtree changed.
    Freshness {
        /// Relative root of the affected subtree.
        path: PathBuf,
        /// State before the commit.
        previous: Freshness,
        /// State after the commit.
        current: Freshness,
    },
    /// A completed reconciliation verified every retained path beneath this root.
    Verified {
        /// Relative root covered by the reconciliation.
        path: PathBuf,
    },
    /// One directory's complete in-scope child listing became known.
    DirectoryComplete {
        /// Relative directory whose child set is now authoritative.
        path: PathBuf,
    },
    /// Previously known child-listing completeness was withdrawn after failed verification.
    DirectoryIncomplete {
        /// Relative directory whose child set is no longer authoritative.
        path: PathBuf,
    },
    /// The coherent opened-root state changed.
    IndexState {
        /// State before this commit.
        previous: IndexState,
        /// State after this commit.
        current: IndexState,
    },
}

impl StateTransition {
    /// Relative path affected by this transition.
    pub fn path(&self) -> &Path {
        match self {
            Self::Freshness { path, .. }
            | Self::Verified { path }
            | Self::DirectoryComplete { path }
            | Self::DirectoryIncomplete { path } => path,
            Self::IndexState { .. } => Path::new(""),
        }
    }
}

/// Bounded work performed while committing producer input or serving engine reads.
#[derive(Clone, Copy, PartialEq, Eq, Debug, Default)]
pub struct Work {
    /// Producer operations considered.
    pub observations: u64,
    /// Accepted operations whose complete observed state already matched.
    pub unchanged: u64,
    /// Conditional observations rejected at the commit boundary.
    pub stale: u64,
    /// File observations refused at the commit boundary by a resource budget.
    pub resource_refused: u64,
    /// Retained index rows examined by a read projection.
    pub rows_visited: u64,
    /// Rows copied into read projection results.
    pub rows_returned: u64,
    /// Lookups against commit-maintained projection indexes.
    pub maintained_index_work: u64,
    /// Retained journal commits examined by a change poll.
    pub commits_visited: u64,
    /// Exact journal commits copied into a change result.
    pub commits_returned: u64,
    /// Filesystem directories successfully enumerated by verified work.
    pub directories_read: u64,
    /// Filesystem entries whose metadata was examined by verified work.
    pub entries_visited: u64,
    /// Regular files whose metadata was examined by verified work.
    pub files_visited: u64,
    /// Apparent bytes represented by regular files examined by verified work.
    pub bytes_visited: u64,
}

/// Bytes [`Commit::retained_cost`] charges for a commit's own frame in the journal.
const RETAINED_COMMIT_BYTES: usize = 256;
/// Bytes [`Commit::retained_cost`] charges for each retained change, transition, or dirty
/// path, before the bytes of the path it names.
const RETAINED_ITEM_BYTES: usize = 128;
/// Smallest journal budget, in bytes, an opened root accepts.
///
/// The floor refuses a count passed where bytes are expected. Until the budget was stated
/// in bytes it counted retained items, and its default was this same number, so a caller
/// still thinking in counts passes at most that: every smaller count is refused, and the
/// old default itself, read as bytes, is a working budget.
///
/// It also guarantees history worth polling, as [`Commit::retained_cost`] charges it. The
/// cheapest commit a tree produces, one change to a one-byte name at the root, costs the
/// frame, three items (the change, the root it dirties, and its own path), and two path
/// bytes: 642 bytes. The floor holds about a hundred of those, or one commit of some two
/// hundred changes to short names in one directory. A budget that held only a few would
/// answer [`ChangeOutcome::Reset`] to a consumer barely behind, for a cause it cannot see.
pub const MIN_JOURNAL_CAPACITY_BYTES: usize = 64 * 1024;

/// One atomic, exact index transition.
///
/// Detached indexes use the process-local [`Clock`] as their version sequence. The
/// opened-root layer later binds that sequence to its own lifetime identity without
/// putting live-session identity into clonable detached state.
#[derive(Clone, PartialEq, Eq, Debug)]
pub struct Commit {
    /// Logical commit clock minted for the complete transition.
    pub clock: Clock,
    /// Exact retained fact mutations in application order.
    pub changes: Vec<EffectiveChange>,
    /// Bounded answer invalidation derived from `changes` and `state`.
    pub impact: Impact,
    /// Observable non-entry transitions committed at the same boundary.
    pub state: Vec<StateTransition>,
    /// Work performed to reach this commit.
    pub work: Work,
}

impl Commit {
    /// Whether this value carries no effective fact or state transition.
    pub fn is_empty(&self) -> bool {
        self.changes.is_empty() && self.state.is_empty()
    }

    /// Approximate bytes this commit retains in the bounded journal.
    ///
    /// The estimate is a fixed allowance for the commit's own frame plus, for every
    /// change, transition, and dirty path, a fixed allowance for the item and the bytes of
    /// the path it names. Paths are the part that varies, so charging their bytes makes
    /// [`crate::DEFAULT_JOURNAL_CAPACITY_BYTES`] mean what it says whatever the tree's paths
    /// look like; a charge per item would let long paths hold many times the budget, and
    /// every change poll clones what the journal holds. The allowances are fixed rather
    /// than measured with `size_of` so the budget means the same on every target: the
    /// retained types differ in size by platform, and a recorded journal work count would
    /// otherwise differ with them.
    pub fn retained_cost(&self) -> usize {
        let paths = self
            .changes
            .iter()
            .map(|change| change.path().as_os_str().len())
            .chain(self.state.iter().map(|transition| transition.path().as_os_str().len()))
            .chain(self.impact.dirty_paths.iter().map(|path| path.as_os_str().len()))
            .sum::<usize>();
        let items = self.changes.len() + self.state.len() + self.impact.dirty_paths.len();
        RETAINED_COMMIT_BYTES + items * RETAINED_ITEM_BYTES + paths
    }
}

/// Errors the engine can report.
#[derive(Debug, thiserror::Error)]
pub enum Error {
    /// A filesystem operation failed at a specific path.
    #[error("I/O error at {path}: {source}")]
    Io {
        /// Path whose operation failed.
        path: PathBuf,
        #[source]
        /// Underlying operating-system error.
        source: std::io::Error,
    },

    /// An observation or subtree path was not relative to the index root.
    #[error("path escapes the index root: {0}")]
    PathEscapesRoot(PathBuf),

    /// A live upsert named a child below ancestry the index has not verified.
    #[error("upsert {path:?} has unknown ancestry; reconcile from {reconcile_from:?}")]
    UnknownAncestry {
        /// Child whose parent chain is not known.
        path: PathBuf,
        /// Nearest known directory from which a producer can reconcile safely.
        reconcile_from: PathBuf,
    },

    /// A control observation did not name the fixed control filename.
    #[error("invalid control-file path: {0:?}")]
    InvalidControlPath(PathBuf),

    /// Snapshot persistence failed after a usable snapshot had been selected.
    #[error("snapshot is not usable: {0}")]
    Snapshot(String),

    /// A scan or watch setting has no supported safe semantics.
    ///
    /// Raised only where no request was built: a bound root, a raw scan, a watch
    /// configuration, a scanner batch. A scope axis a request names is refused by
    /// [`Request::validate`](crate::query::Request::validate) as
    /// [`RequestError::ScopeUnsupported`](crate::query::RequestError::ScopeUnsupported)
    /// before any stored state is read, so a surface renders it in its own words and
    /// classifies it as the refused request it is. Both print the same sentence, because
    /// both ask [`ScopeAxis::reason`](crate::query::ScopeAxis::reason) for it.
    #[error("unsupported scan configuration: {0}")]
    UnsupportedScanConfig(&'static str),

    /// An index or report built without observing `.gitignore` control state was asked
    /// about it, was asked to select entries by it, or was handed control input.
    ///
    /// Such a scan read no control file and classified no entry, so answering "not
    /// ignored" for every entry, handing back an empty control table, or selecting every
    /// entry or none by ignored state would state a fact nobody observed. Nor does an index
    /// accept a `ControlUpsert` or `ControlRemove` ([`Op`]): its scope says no rule was
    /// read, and a table installed anyway would contradict it, in the index and in every
    /// snapshot saved from it. Scanning with [`ScanConfig::read_controls`](crate::ScanConfig)
    /// on, as it is by default, makes the answers exact.
    #[error(
        "this scan did not observe .gitignore control state, so it neither says nor selects \
         what is ignored and accepts no control input; scan with read_controls to observe it"
    )]
    ControlStateNotObserved,

    /// An index's control table enforces other limits than the ones its scan scope was
    /// taken under.
    ///
    /// The scope's ignore-rules identity names the limits that decide which `.gitignore`
    /// rules apply, so a table refusing under other limits would contradict it, in the index
    /// and in every snapshot saved from it. [`Index::new_with_scope`](crate::Index) applies
    /// the default limits whatever its scope claims;
    /// [`Index::new_with_config`](crate::Index::new_with_config) builds a table and a scope
    /// from one configuration, so they agree.
    #[error(
        "this index's .gitignore limits ({limits}) are not the ones its scan scope was taken \
         under; build it with Index::new_with_config from the ScanConfig that made its scope"
    )]
    ControlLimitsOutsideScope {
        /// The limits the index's control table enforces.
        limits: crate::control::ControlLimits,
    },

    /// An opened root's journal budget is below [`MIN_JOURNAL_CAPACITY_BYTES`].
    #[error(
        "journal_capacity_bytes is {requested} bytes, below the {minimum}-byte minimum; it is \
         a size in bytes, not a count, so set it to at least {minimum} bytes, or leave it \
         unset for the default"
    )]
    JournalCapacityTooSmall {
        /// The budget requested, in bytes.
        requested: usize,
        /// [`MIN_JOURNAL_CAPACITY_BYTES`].
        minimum: usize,
    },

    /// Requested scan semantics differ from the index's immutable scope.
    #[error("scan scope mismatch: index has {indexed:?}, requested {requested:?}")]
    ScanScopeMismatch {
        /// Scope represented by the index.
        indexed: ScanScope,
        /// Scope requested by the operation.
        requested: ScanScope,
    },

    /// A requested relative subtree lies beyond the configured scan boundary.
    #[error("subtree {path:?} lies outside scan scope {scope:?}")]
    SubtreeOutsideScanScope {
        /// Rejected relative path.
        path: PathBuf,
        /// Scope that excludes the path.
        scope: ScanScope,
    },

    /// A writer panicked while owning the shared index lock.
    #[error("index lock was poisoned by a panicking writer")]
    IndexLockPoisoned,

    /// No further logical commit clock can be represented.
    #[error("the process-local index clock is exhausted")]
    ClockExhausted,

    /// A tree, or a batch, would leave a whole-tree total no `u64` can hold.
    ///
    /// Roll-ups are `u64` counts and byte totals, and every route that counts a tree
    /// refuses one whose total leaves that range, with this error, rather than wrapping
    /// or panicking. A filesystem can produce one: tmpfs, XFS, and btrfs let a sparse file
    /// claim up to 8 EiB apparent without allocating anything, so three such files sum
    /// past `u64::MAX`.
    ///
    /// - A one-shot report, whether it folds a summary or builds a full or folded index,
    ///   fails at the first file the root's total cannot hold, and reports nothing.
    /// - A batch committed to an index ([`Index::apply`](crate::Index::apply), and every
    ///   scan, refresh, reconciliation, and watch commit) is applied in order, so the index
    ///   must be representable after each of its operations: a batch that removes before
    ///   it adds is accepted where the reverse order is not. The batch is refused before
    ///   any of it is applied, and the index, its clock, and its journal are as they were.
    #[error(
        "counting {path:?} would carry the tree's {counter} total past what a u64 can hold, \
         so nothing that includes it was applied or reported"
    )]
    UnrepresentableTotal {
        /// The entry, or the batch operation, at which the total would leave the
        /// representable range.
        path: PathBuf,
        /// Which total: `files`, `directories`, `bytes`, or `allocated bytes`.
        counter: &'static str,
    },

    /// No further live-session identity can be represented in this process.
    #[error("the process-local opened-index identity space is exhausted")]
    OpenedIdentityExhausted,

    /// An operation was attempted after shared shutdown began.
    #[error("the opened index is closed")]
    OpenedIndexClosed,

    /// An expanding operation was attempted after a resource stop.
    #[error("the opened index is stopped and cannot expand its retained set")]
    OpenedIndexStopped,

    /// A priority request exceeded the public per-call bound.
    #[error("priority request contains {attempted} paths; limit is {limit}")]
    PriorityPathLimit {
        /// Paths supplied by the caller.
        attempted: usize,
        /// Maximum paths accepted by one request.
        limit: usize,
    },

    /// A refresh request exceeded the public per-call input bound.
    #[error("refresh request contains {attempted} paths; limit is {limit}")]
    RefreshPathLimit {
        /// Paths supplied by the caller.
        attempted: usize,
        /// Maximum paths accepted by one request.
        limit: usize,
    },

    /// A coherent read requested more projections than one bounded call accepts.
    #[error("read request contains {attempted} projections; limit is {limit}")]
    ReadProjectionLimit {
        /// Projections supplied by the caller.
        attempted: usize,
        /// Maximum projections accepted by one request.
        limit: usize,
    },

    /// A pinned coherent read named a foreign or no-longer-current version.
    #[error("requested opened-index version {requested:?} is unavailable; current is {current:?}")]
    VersionUnavailable {
        /// Version required by the caller.
        requested: Box<EngineVersion>,
        /// Only version the live image can currently answer.
        current: Box<EngineVersion>,
    },

    /// A page output bound was zero or exceeded the public maximum.
    #[error("page row limit {attempted} is outside 1..={limit}")]
    PageRowLimit {
        /// Rejected row limit.
        attempted: usize,
        /// Maximum accepted row limit.
        limit: usize,
    },

    /// A page work bound was zero or exceeded the public maximum.
    #[error("page work limit {attempted} is outside 1..={limit}")]
    PageWorkLimit {
        /// Rejected work limit.
        attempted: u64,
        /// Maximum accepted work limit.
        limit: u64,
    },

    /// A tree page asked for zero levels.
    ///
    /// Distinct from the page bounds above, which are about how much of a level fits.
    /// Zero levels is not a small page, it is a request with no rows to return, and
    /// reporting it as a row-limit failure sends a caller to inspect the wrong argument.
    #[error("tree page depth must be at least one level")]
    TreeDepthZero,

    /// A flat page attempted to use presentation axes whose ordering is not resumable.
    #[error(
        "flat opened-index pages use fixed portable path order; selection cannot set depth, limit, sort, or reverse"
    )]
    UnsupportedFlatSelection,

    /// An aggregate cap was zero or exceeded the public maximum.
    #[error("aggregate count cap {attempted} is outside 1..={limit}")]
    CountCapLimit {
        /// Rejected count cap.
        attempted: u64,
        /// Maximum accepted count cap.
        limit: u64,
    },

    /// A request no holder of its own basis could answer, or that this holder cannot.
    ///
    /// The refusal is a value, rendered here in the library's field names; a surface that
    /// built the request renders the same value in its own words through
    /// [`RequestError::message`](crate::query::RequestError::message), which is why every
    /// door refuses one request with one rule.
    #[error(transparent)]
    InvalidRequest(crate::query::RequestError),

    /// A report request exceeded the bounded section vocabulary for one read.
    #[error("report request contains {attempted} views or omissions; limit is {limit}")]
    ReportViewLimit {
        /// Views and omitted-view records supplied by the caller.
        attempted: usize,
        /// Maximum accepted combined records.
        limit: usize,
    },

    /// A continuation belongs to another opened root, or names an ordinal this root never
    /// issued.
    ///
    /// Either is a malformed request, so the whole read fails. A token this root issued and
    /// no longer retains -- consumed or evicted -- refuses only its own projection with
    /// [`ProjectionRefusal::ContinuationUnavailable`].
    #[error(
        "the page continuation was not issued by this opened index; continue from a token a \
         page of this root returned"
    )]
    ContinuationUnavailable,

    /// No further handle-local continuation identifier can be represented.
    #[error("the opened index continuation identity space is exhausted")]
    ContinuationIdentityExhausted,

    /// A continuation was pinned to an older committed image.
    #[error("the page continuation version {requested:?} is stale; current is {current:?}")]
    ContinuationStale {
        /// Version captured by the continuation.
        requested: Box<EngineVersion>,
        /// Current live version.
        current: Box<EngineVersion>,
    },

    /// A change cursor belongs to another handle, has incompatible identities, or is in
    /// the future.
    #[error("change cursor {requested:?} is unavailable; current is {current:?}")]
    ChangeCursorUnavailable {
        /// Cursor supplied by the consumer.
        requested: Box<EngineVersion>,
        /// Current live version against which it was validated.
        current: Box<EngineVersion>,
    },

    /// A panic poisoned opened-root journal wait coordination.
    #[error("opened-index journal wait state was poisoned by a panic")]
    OpenedJournalPoisoned,

    /// A producer tried to complete a path that was not a retained directory.
    #[error("directory completion named an unknown or non-directory path: {0:?}")]
    InvalidDirectoryCompletion(PathBuf),

    /// A panic poisoned the opened index's lifecycle coordination state.
    #[error("opened-index lifecycle state was poisoned by a panic")]
    OpenedLifecyclePoisoned,

    /// An owned opened-index worker panicked.
    ///
    /// Joined shutdown reports it, and so does a change poll that would otherwise wait for
    /// commits the root can no longer make.
    #[error("opened-index worker {worker} panicked")]
    OpenedWorkerPanicked {
        /// Stable role of the failed worker.
        worker: &'static str,
    },

    /// An owned opened-index worker returned a terminal error during joined shutdown.
    #[error("opened-index worker {worker} failed: {source}")]
    OpenedWorkerFailed {
        /// Stable role of the failed worker.
        worker: &'static str,
        /// Original typed engine error, shared so repeated close returns the same cause.
        #[source]
        source: std::sync::Arc<Error>,
    },

    /// An operating-system thread could not be created for an opened-index worker.
    #[error("could not start opened-index worker {worker}: {source}")]
    OpenedWorkerSpawn {
        /// Stable role of the worker that could not start.
        worker: &'static str,
        #[source]
        /// Underlying operating-system error.
        source: std::io::Error,
    },

    /// The watch worker ended permanently without panicking.
    #[error("watch worker stopped before another observation was available")]
    WatchStopped,

    /// The watch worker panicked; its bounded channel is no longer live.
    #[error("watch worker panicked and stopped")]
    WatchWorkerPanicked,

    /// A scripted watch backend's event file could not be used.
    #[cfg(all(feature = "watch", test))]
    #[error("invalid watch script: {0}")]
    WatchScript(String),

    /// Capture began, but verification could not establish a complete live baseline.
    #[error("filesystem observation handoff could not establish a complete verified baseline")]
    ObservationHandoffIncomplete,

    #[cfg(test)]
    /// A test-only reducer preflight rejected a prepared transition.
    #[error("prepared commit rejected by {0}")]
    CommitRejected(&'static str),

    /// An argument value did not match its documented grammar.
    ///
    /// Carries a suggestion rather than only a rejection, because these values are typed
    /// by humans and agents at a prompt: the whole point of a closed grammar is that a
    /// near miss can say what the near-hit spelling would be.
    #[error("invalid {kind} {value:?}: {hint}")]
    InvalidValue {
        /// Which grammar was expected, for the message: `time` or `size`.
        kind: &'static str,
        /// The rejected input, as written.
        value: String,
        /// What to write instead.
        hint: String,
    },

    /// A watcher was paired with an index rooted at a different directory.
    #[error("watch root {watched:?} does not match index root {indexed:?}")]
    WatchRootMismatch {
        /// Canonical root owned by the watcher.
        watched: PathBuf,
        /// Canonical root owned by the index.
        indexed: PathBuf,
    },
}

impl Error {
    pub(crate) fn io(path: impl Into<PathBuf>, source: std::io::Error) -> Self {
        Self::Io { path: path.into(), source }
    }
}

/// Result alias for engine operations.
pub type Result<T> = std::result::Result<T, Error>;

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn clock_advances_monotonically() {
        let c = Clock::ZERO;
        assert_eq!(c.checked_next(), Some(Clock(1)));
        assert!(c.checked_next().is_some_and(|next| next > c));
        assert_eq!(Clock(u64::MAX).checked_next(), None);
    }

    #[test]
    fn entry_kind_roundtrips_through_its_pinned_value() {
        for kind in [EntryKind::File, EntryKind::Dir, EntryKind::Symlink, EntryKind::Other] {
            assert_eq!(EntryKind::from_u8(kind as u8), Some(kind));
        }
        assert_eq!(EntryKind::from_u8(99), None);
    }

    #[test]
    fn fingerprint_ignores_allocated_size_but_tracks_ctime() {
        let base = Attrs { size: 10, allocated: 4096, mtime_ns: 5, ctime_ns: 7, inode: 42, dev: 1 };
        // Allocation changes alone are not a content change.
        let repacked = Attrs { allocated: 8192, ..base };
        assert_eq!(base.fingerprint(), repacked.fingerprint());

        // A ctime bump is, even when mtime was rolled back to look unchanged.
        let touched = Attrs { ctime_ns: 9, ..base };
        assert_ne!(base.fingerprint(), touched.fingerprint());
    }

    #[test]
    fn scan_scope_separates_admission_from_answer_semantics() {
        let base = ScanScope::default();
        let changed_admission = ScanScope { exclude_special: !base.exclude_special, ..base };
        let changed_semantics =
            ScanScope { reducers_fingerprint: base.reducers_fingerprint.wrapping_add(1), ..base };

        assert_ne!(base.entry_scope(), changed_admission.entry_scope());
        assert_eq!(base.semantic_identity(), changed_admission.semantic_identity());
        assert_eq!(base.entry_scope(), changed_semantics.entry_scope());
        assert_ne!(base.semantic_identity(), changed_semantics.semantic_identity());
    }
}

#[cfg(test)]
mod provenance_tests {
    use super::*;

    #[test]
    fn sources_order_from_most_to_least_trustworthy() {
        assert!(Source::Scanned < Source::Revalidated);
        assert!(Source::Revalidated < Source::JournalScoped);
        assert!(Source::JournalScoped < Source::Cached);
    }

    #[test]
    fn combining_takes_the_least_trustworthy_of_each_fact() {
        let verified =
            Provenance { source: Source::Scanned, observed_at_ns: 900, status: Status::Complete };
        let stale =
            Provenance { source: Source::Cached, observed_at_ns: 100, status: Status::Partial };
        let combined = verified.combine(stale);
        assert_eq!(combined.source, Source::Cached, "weakest source wins");
        assert_eq!(combined.observed_at_ns, 100, "oldest observation wins");
        assert_eq!(combined.status, Status::Partial, "worst status wins");
        assert_eq!(combined, stale.combine(verified), "combination is commutative");
    }

    #[test]
    fn an_unknown_timestamp_makes_the_combination_unknown() {
        // Fail closed. Zero means "we cannot say when", so a subtree containing one
        // contributor of unknown age has an unknown age too. Returning the known
        // timestamp instead would let a directory advertise a precise "as of" that is
        // wrong for part of what it summarises — the silent lie the provenance model
        // exists to prevent.
        let known = Provenance::scanned(500);
        let unknown = Provenance { observed_at_ns: 0, ..Provenance::scanned(0) };
        assert_eq!(known.combine(unknown).observed_at_ns, 0);
        assert_eq!(unknown.combine(known).observed_at_ns, 0);
        assert_eq!(known.combine(unknown), unknown.combine(known), "combination stays commutative");
    }

    #[test]
    fn only_this_session_counts_as_verified() {
        assert!(Provenance::scanned(1).is_verified());
        assert!(Provenance { source: Source::Revalidated, ..Provenance::scanned(1) }.is_verified());
        // The journal can omit history without saying so, so its word is not a check.
        assert!(
            !Provenance { source: Source::JournalScoped, ..Provenance::scanned(1) }.is_verified()
        );
        assert!(!Provenance { source: Source::Cached, ..Provenance::scanned(1) }.is_verified());
    }
}