blotter-cli 1.1.0

use crate::cli::DoctorArgs;
use crate::error::{AppError, AppResult, unsupported_log_version_message};
use crate::output::{self, Meta};
use crate::store;
use crate::{LogEvent, compute_dogear_id, compute_id, compute_promotion_id, normalized};
use jiff::Timestamp;
use serde::{Deserialize, Serialize};
use std::collections::{HashMap, HashSet};
use std::fs::{self, File, OpenOptions};
use std::path::{Path, PathBuf};
use std::process::{Command, Stdio};

const EMPTY_WARNING: &str = "no blotter file yet; healthy empty state";
const EMPTY_FIX: &str = "Pass an existing --file PATH or omit --file to inspect discovered state.";
// Byte mirror of `redact::EVIDENCE_DELIMITERS` for raw leak scans.
// A slash is a path parent, not a delimiter.
const EVIDENCE_DELIMITERS: &[u8] = b",;)]}&#\"'";
// Byte mirror of `redact::HOME_PREFIXES`.
const HOME_PREFIXES: [&[u8]; 4] = [b"/Users/", b"/home/", b"-Users-", b"-home-"];

struct LeakScan<'a> {
    home: Option<Vec<u8>>,
    dash_home: Option<Vec<u8>>,
    deny: &'a [String],
}

#[derive(Debug, Serialize, Deserialize)]
pub struct DoctorData {
    pub healthy: bool,
    pub findings: Vec<Finding>,
    pub checked_lines: usize,
    #[serde(default, skip_serializing_if = "Option::is_none")]
    pub fix: Option<FixData>,
}

#[derive(Debug, Serialize, Deserialize)]
pub struct Finding {
    pub line: usize,
    pub kind: String,
    pub message: String,
    #[serde(default)]
    pub fixable: bool,
}

#[derive(Debug, Serialize, Deserialize)]
pub struct FixData {
    pub changed: bool,
    pub applied: Vec<AppliedFix>,
    #[serde(skip_serializing_if = "Option::is_none")]
    pub backup: Option<String>,
    #[serde(skip_serializing_if = "Option::is_none")]
    pub quarantine: Option<String>,
    #[serde(skip_serializing_if = "Option::is_none")]
    pub restore_hint: Option<String>,
    pub dry_run: bool,
}

#[derive(Debug, Serialize, Deserialize)]
pub struct AppliedFix {
    pub line: usize,
    pub kind: String,
    pub action: String,
}

pub fn run(
    args: DoctorArgs,
    file: Option<PathBuf>,
    pretty: bool,
    now: Timestamp,
) -> AppResult<i32> {
    if args.dry_run && !args.fix {
        return Err(AppError::invalid_argument(
            "--dry-run requires --fix for doctor",
            "Run `blotter doctor --fix --dry-run` to preview repairs.",
        ));
    }
    if args.leaks && args.fix {
        return Err(AppError::invalid_argument(
            "--leaks conflicts with --fix for doctor",
            "Run `blotter doctor --leaks` without --fix; the gate is read-only.",
        ));
    }
    if !args.deny.is_empty() && !args.leaks {
        return Err(AppError::invalid_argument(
            "--deny requires --leaks for doctor",
            "Run `blotter doctor --leaks --deny LITERAL` to scan a literal deny pattern.",
        ));
    }
    if args.deny.iter().any(|pattern| pattern.is_empty()) {
        return Err(AppError::invalid_argument(
            "--deny requires a non-empty literal",
            "Run `blotter doctor --leaks --deny LITERAL` with a non-empty literal.",
        ));
    }
    let leak_scan = args.leaks.then(|| {
        let home = current_home_path();
        // Byte mirror of `redact::rewrite_home_paths`: the root home's dash
        // spelling is a bare `-`, not an encoding, and is never matched.
        let dash_home = home
            .as_ref()
            .filter(|home| home.as_slice() != b"/")
            .map(|home| {
                home.iter()
                    .map(|byte| if *byte == b'/' { b'-' } else { *byte })
                    .collect()
            });
        LeakScan {
            home,
            dash_home,
            deny: &args.deny,
        }
    });
    let resolved = store::discover(file)?;
    let mut warnings = resolved.warnings.clone();
    let (mut data, file_existed) = match (args.fix, args.dry_run) {
        (false, _) => diagnose_shared(&resolved, &mut warnings, leak_scan.as_ref())?,
        (true, true) => {
            let (mut data, file_existed) =
                diagnose_shared(&resolved, &mut warnings, leak_scan.as_ref())?;
            data.fix = Some(FixData {
                changed: false,
                applied: planned_fixes(&data.findings),
                backup: None,
                quarantine: None,
                restore_hint: None,
                dry_run: true,
            });
            (data, file_existed)
        }
        (true, false) => diagnose_and_fix(&resolved, &mut warnings, now)?,
    };
    add_gitignored_finding(&mut data, &resolved, file_existed);
    let exit = i32::from(!data.healthy);
    let mut meta = Meta::new();
    meta.file = Some(resolved.path.to_string_lossy().into_owned());
    meta.warnings = warnings;
    output::write_success(data, pretty, meta)
        .map_err(|error| AppError::from_io(error, Path::new("stdout")))?;
    Ok(exit)
}

fn diagnose_shared(
    resolved: &store::ResolvedFile,
    warnings: &mut Vec<String>,
    leak_scan: Option<&LeakScan<'_>>,
) -> AppResult<(DoctorData, bool)> {
    store::read_or_empty(
        &resolved.path,
        resolved.explicit,
        warnings,
        EMPTY_WARNING,
        EMPTY_FIX,
        empty_data,
        |log| {
            let bytes = store::read_bytes(log, &resolved.path)?;
            Ok(inspect(&bytes, leak_scan))
        },
    )
}

fn diagnose_and_fix(
    resolved: &store::ResolvedFile,
    warnings: &mut Vec<String>,
    now: Timestamp,
) -> AppResult<(DoctorData, bool)> {
    match store::with_exclusive(&resolved.path, false, |log| {
        apply_fixes(log, &resolved.path, now)
    }) {
        Ok(data) => Ok((data, true)),
        Err(error) if error.code == "not_found" && error.exit_code == 66 && !resolved.explicit => {
            warnings.push(EMPTY_WARNING.into());
            let mut data = empty_data();
            data.fix = Some(FixData {
                changed: false,
                applied: Vec::new(),
                backup: None,
                quarantine: None,
                restore_hint: None,
                dry_run: false,
            });
            Ok((data, false))
        }
        Err(error) if error.code == "not_found" && error.exit_code == 66 => {
            Err(AppError::not_found(
                format!("blotter file not found: {}", resolved.path.display()),
                EMPTY_FIX,
            ))
        }
        Err(error) => Err(error),
    }
}

fn apply_fixes(log: &mut File, path: &Path, now: Timestamp) -> AppResult<DoctorData> {
    let original = store::read_bytes(log, path)?;
    let before = inspect(&original, None);
    let applied = planned_fixes(&before.findings);
    if applied.is_empty() {
        return Ok(with_fix(
            before,
            FixData {
                changed: false,
                applied,
                backup: None,
                quarantine: None,
                restore_hint: None,
                dry_run: false,
            },
        ));
    }

    let permissions = log
        .metadata()
        .map_err(|error| AppError::from_io(error, path))?
        .permissions();
    // A symlinked log is locked and read through the link; the swap must land
    // on the target, not replace the link with a regular file.
    let path = &store::resolve_symlinked_log(path)?;
    let backup_path = store::suffixed_path(path, &format!(".bak-{}", store::backup_timestamp(now)));
    if backup_path.exists() {
        return Err(AppError::stale_backup(&backup_path));
    }
    let backup = store::write_new_file(&backup_path, &original, &permissions)?;
    let quarantine_path = store::suffixed_path(path, ".quarantine.jsonl");
    // `append_file` extends an existing quarantine sidecar, so its rollback
    // restores the prior length instead of deleting an earlier repair's lines.
    let quarantine_len = fs::metadata(&quarantine_path)
        .ok()
        .map(|metadata| metadata.len());
    let quarantined = quarantined_bytes(&original, &applied);
    let quarantine = match store::append_file(&quarantine_path, &quarantined, &permissions) {
        Ok(quarantine) => quarantine,
        Err(error) => {
            // A failed append into a pre-existing sidecar leaves partial
            // bytes behind; truncate back alongside removing the backup.
            undo_created_outputs(&[
                (backup.as_path(), None),
                (quarantine_path.as_path(), quarantine_len),
            ]);
            return Err(error);
        }
    };
    let repaired = repaired_bytes(&original, &applied);
    if let Err(error) = store::replace_log(
        path,
        &repaired,
        &permissions,
        &format!(".tmp-fix-{}", std::process::id()),
    ) {
        undo_created_outputs(&[
            (backup.as_path(), None),
            (quarantine.as_path(), quarantine_len),
        ]);
        return Err(error);
    }
    // The swap renames a new inode over the path, so the held lock no longer
    // covers the file there; diagnose the bytes just written, never a reread —
    // and derive that diagnosis from the pre-fix findings rather than parsing
    // those bytes a second time.
    Ok(with_fix(
        post_fix_data(&before, &applied),
        FixData {
            changed: true,
            applied,
            backup: Some(backup.to_string_lossy().into_owned()),
            quarantine: Some(quarantine.to_string_lossy().into_owned()),
            restore_hint: Some(store::restore_hint(&backup, path)),
            dry_run: false,
        },
    ))
}

/// Mirror of `archive::remove_created_outputs` for an aborted repair: a
/// sidecar this run created is removed, and one it only extended is truncated
/// back. Without it a failed repair leaves a backup that claims a repair which
/// never happened, and the retry then fails on that leftover.
fn undo_created_outputs(outputs: &[(&Path, Option<u64>)]) {
    for (path, previous_len) in outputs {
        match previous_len {
            None => {
                let _ = fs::remove_file(path);
            }
            Some(len) => {
                let _ = OpenOptions::new()
                    .write(true)
                    .open(path)
                    .and_then(|file| file.set_len(*len));
            }
        }
    }
}

/// What `inspect` would report on the repaired bytes, derived from the pre-fix
/// report instead of decoding the whole log again.
///
/// `repaired_bytes` only drops whole quarantined lines, so the surviving
/// findings are exactly the ones no fix removed, each renumbered by the lines
/// dropped ahead of it. Nothing that survives depended on a dropped line: only a
/// scan error is fixable, a scan error is the only finding its line can carry,
/// and a line that failed to parse contributes no record, no duplicate payload,
/// no resolve target and no base resolve. Dropping a line also cannot tear the tail or orphan
/// the leading empty segment, because each dropped line takes its own newline.
fn post_fix_data(before: &DoctorData, applied: &[AppliedFix]) -> DoctorData {
    let mut removed: Vec<usize> = applied
        .iter()
        .filter(|fix| fix.action == "quarantined")
        .map(|fix| fix.line)
        .collect();
    removed.sort_unstable();
    let findings: Vec<Finding> = before
        .findings
        .iter()
        .filter(|finding| removed.binary_search(&finding.line).is_err())
        .map(|finding| Finding {
            line: finding.line - removed.partition_point(|line| *line < finding.line),
            kind: finding.kind.clone(),
            message: finding.message.clone(),
            fixable: finding.fixable,
        })
        .collect();
    DoctorData {
        healthy: findings.is_empty(),
        findings,
        checked_lines: before.checked_lines - removed.len(),
        fix: None,
    }
}

fn with_fix(mut data: DoctorData, fix: FixData) -> DoctorData {
    data.fix = Some(fix);
    data
}

fn repaired_bytes(bytes: &[u8], applied: &[AppliedFix]) -> Vec<u8> {
    let remove_lines: HashSet<_> = applied
        .iter()
        .filter(|fix| fix.action == "quarantined")
        .map(|fix| fix.line)
        .collect();
    let mut repaired = Vec::new();
    for (index, raw) in bytes.split_inclusive(|byte| *byte == b'\n').enumerate() {
        if !remove_lines.contains(&(index + 1)) {
            repaired.extend_from_slice(raw);
        }
    }
    repaired
}

fn quarantined_bytes(bytes: &[u8], applied: &[AppliedFix]) -> Vec<u8> {
    let remove_lines: HashSet<_> = applied
        .iter()
        .filter(|fix| fix.action == "quarantined")
        .map(|fix| fix.line)
        .collect();
    let mut quarantined = Vec::new();
    for (index, raw) in bytes.split_inclusive(|byte| *byte == b'\n').enumerate() {
        if remove_lines.contains(&(index + 1)) {
            quarantined.extend_from_slice(raw);
            if !raw.ends_with(b"\n") {
                quarantined.push(b'\n');
            }
        }
    }
    quarantined
}

fn planned_fixes(findings: &[Finding]) -> Vec<AppliedFix> {
    findings
        .iter()
        .filter(|finding| finding.fixable)
        .map(|finding| AppliedFix {
            line: finding.line,
            kind: finding.kind.clone(),
            action: "quarantined".into(),
        })
        .collect()
}

fn add_gitignored_finding(
    data: &mut DoctorData,
    resolved: &store::ResolvedFile,
    file_existed: bool,
) {
    if file_existed
        && let Some(repo) = resolved.repo.as_ref()
        && resolved.path.starts_with(repo)
        && Command::new("git")
            .arg("-C")
            .arg(repo)
            .args(["check-ignore", "-q", "--"])
            .arg(&resolved.path)
            .stdout(Stdio::null())
            .stderr(Stdio::null())
            .status()
            .is_ok_and(|status| status.success())
    {
        data.findings.push(finding(
            0,
            "gitignored",
            "blotter file is gitignored; blotter will not appear in diffs",
        ));
        data.healthy = false;
    }
}

fn empty_data() -> DoctorData {
    DoctorData {
        healthy: true,
        findings: Vec::new(),
        checked_lines: 0,
        fix: None,
    }
}

fn finding(line: usize, kind: impl Into<String>, message: impl Into<String>) -> Finding {
    let kind = kind.into();
    Finding {
        line,
        fixable: matches!(kind.as_str(), "torn_line" | "malformed" | "conflict_marker"),
        kind,
        message: message.into(),
    }
}

fn inspect(bytes: &[u8], leak_scan: Option<&LeakScan<'_>>) -> DoctorData {
    let mut findings = Vec::new();
    let mut leak_findings = Vec::new();
    let mut records = HashMap::<String, Vec<u8>>::new();
    let mut record_kinds = HashMap::<String, &'static str>::new();
    let mut resolves = Vec::<(usize, LogEvent)>::new();
    // The promotion `sources[]` rules (5) and (6) join against, plus the lines
    // `dangling_source` reports on. Both need the completed `record_kinds`, so
    // they are decided after the scan.
    let mut promotion_sources = store::PromotionSources::new();
    let mut promotion_lines = Vec::<(usize, String, Vec<String>)>::new();
    let mut checked_lines = 0;
    // The version probe outranks every record-model classification for this file
    // (r48/r50): malformed, torn, unknown-kind, duplicate, orphan and
    // invalid-resolution findings are all replaced by one `unsupported_version`
    // finding. The walk still happens, so `checked_lines` stays honest and the
    // `--leaks` byte scan still runs — refusing a leak audit is a privacy
    // regression the version boundary does not justify.
    let unsupported = store::probe_version(bytes);
    for scanned in store::scan(bytes) {
        checked_lines += 1;
        let line = scanned.line;
        if let Some(leak_scan) = leak_scan {
            add_leak_findings(&mut leak_findings, line, scanned.raw, leak_scan);
        }
        if unsupported.is_some() {
            continue;
        }
        match scanned.event {
            Err(store::ScanIssue::Torn) => findings.push(finding(
                line,
                "torn_line",
                "final physical line is not newline-terminated",
            )),
            Err(store::ScanIssue::Malformed(message)) => {
                if scanned.raw.starts_with(b"<<<<<<< ") || scanned.raw.starts_with(b">>>>>>> ") {
                    findings.push(finding(
                        line,
                        "conflict_marker",
                        "complete git conflict-marker line found",
                    ));
                } else {
                    findings.push(finding(line, "malformed", message));
                }
            }
            Err(store::ScanIssue::Unknown(kind)) => findings.push(finding(
                line,
                "unknown_kind",
                kind.map_or_else(
                    || "event has no string kind field".into(),
                    |kind| format!("unknown event kind '{kind}'"),
                ),
            )),
            Ok(event) => match event {
                LogEvent::Cut {
                    id,
                    ts,
                    agent,
                    text,
                    tags,
                    impact,
                    ..
                } => {
                    if id
                        .get(..3)
                        .is_some_and(|prefix| prefix.eq_ignore_ascii_case("bl_"))
                    {
                        let expected = compute_id(&ts, &agent, &text, impact, &tags);
                        if id != expected {
                            findings.push(finding(
                                line,
                                "id_conflict",
                                format!("cut ID {id} does not recompute to {expected}"),
                            ));
                        }
                    }
                    if let Some(first) = records.get(&id) {
                        let (kind, message) = if first == scanned.raw {
                            (
                                "duplicate_cut",
                                format!("byte-identical duplicate cut {id}"),
                            )
                        } else {
                            (
                                "id_conflict",
                                format!(
                                    "cut {id} has a different payload than its first occurrence"
                                ),
                            )
                        };
                        findings.push(finding(line, kind, message));
                    } else {
                        records.insert(id.clone(), scanned.raw.to_vec());
                    }
                    // The fold keeps the first record for an ID, so the kind a
                    // later resolve is judged against is the first one too.
                    record_kinds.entry(id).or_insert("cut");
                }
                LogEvent::Dogear {
                    id,
                    ts,
                    agent,
                    text,
                    tags,
                    ..
                } => {
                    if id
                        .get(..3)
                        .is_some_and(|prefix| prefix.eq_ignore_ascii_case("bl_"))
                    {
                        let mut tags = tags;
                        tags.sort();
                        let expected = compute_dogear_id(&ts, &agent, &text, &tags);
                        if id != expected {
                            findings.push(finding(
                                line,
                                "id_conflict",
                                format!("dogear ID {id} does not recompute to {expected}"),
                            ));
                        }
                    }
                    if let Some(first) = records.get(&id) {
                        let (kind, message) = if first == scanned.raw {
                            (
                                "duplicate_dogear",
                                format!("byte-identical duplicate dogear {id}"),
                            )
                        } else {
                            (
                                "id_conflict",
                                format!(
                                    "dogear {id} has a different payload than its first occurrence"
                                ),
                            )
                        };
                        findings.push(finding(line, kind, message));
                    } else {
                        records.insert(id.clone(), scanned.raw.to_vec());
                    }
                    // The fold keeps the first record for an ID, so the kind a
                    // later resolve is judged against is the first one too.
                    record_kinds.entry(id).or_insert("dogear");
                }
                LogEvent::Promotion {
                    id,
                    ts,
                    agent,
                    sources,
                    artifact,
                    ..
                } => {
                    let sources = normalized(&sources);
                    if id
                        .get(..3)
                        .is_some_and(|prefix| prefix.eq_ignore_ascii_case("bl_"))
                    {
                        let expected = compute_promotion_id(
                            &ts,
                            &agent,
                            &sources,
                            artifact.kind.as_str(),
                            &artifact.r#ref,
                        );
                        if id != expected {
                            findings.push(finding(
                                line,
                                "id_conflict",
                                format!("promotion ID {id} does not recompute to {expected}"),
                            ));
                        }
                    }
                    if let Some(first) = records.get(&id) {
                        let (kind, message) = if first == scanned.raw {
                            (
                                "duplicate_promotion",
                                format!("byte-identical duplicate promotion {id}"),
                            )
                        } else {
                            (
                                "id_conflict",
                                format!(
                                    "promotion {id} has a different payload than its first occurrence"
                                ),
                            )
                        };
                        findings.push(finding(line, kind, message));
                    } else {
                        records.insert(id.clone(), scanned.raw.to_vec());
                        promotion_sources.insert(id.clone(), sources.clone());
                        promotion_lines.push((line, id.clone(), sources));
                    }
                    record_kinds.entry(id).or_insert("promotion");
                }
                LogEvent::Resolve { .. } => resolves.push((line, event)),
                LogEvent::Unknown => unreachable!("scanner classifies unknown events"),
            },
        }
    }
    // Every source must resolve, in the folded log, to a cut (r48). Non-fixable:
    // only a human knows whether the cut was wrongly archived or the promotion
    // wrongly written.
    for (line, id, sources) in promotion_lines {
        for source in sources {
            let message = match record_kinds.get(&source) {
                Some(&"cut") => continue,
                Some(kind) => {
                    format!("promotion {id} names source {source}, which is a {kind}, not a cut")
                }
                None => format!("promotion {id} names source {source}, which is in no record"),
            };
            findings.push(finding(line, "dangling_source", message));
        }
    }
    // Validity is decided after the join, and an invalid event is discarded
    // before winners are chosen (r50), so the base-resolve set an orphan amend is
    // judged against holds valid base resolves only.
    let mut base_resolve_ids = HashSet::new();
    let mut checked_resolves = Vec::new();
    for (line, event) in resolves {
        let LogEvent::Resolve { id, amend, .. } = &event else {
            unreachable!("only resolve events are collected here")
        };
        // An orphan joins to no record and is therefore never invalid.
        let broken = record_kinds
            .get(id)
            .map(|kind| store::broken_resolution_rules(&event, kind, &promotion_sources))
            .unwrap_or_default();
        if broken.is_empty() && !*amend {
            base_resolve_ids.insert(id.clone());
        }
        checked_resolves.push((line, id.clone(), *amend, broken));
    }
    for (line, id, amend, broken) in checked_resolves {
        if !broken.is_empty() {
            findings.push(finding(
                line,
                "invalid_resolution",
                format!("invalid resolution for {id}: {}", broken.join("; ")),
            ));
            continue;
        }
        let message = if !record_kinds.contains_key(&id) {
            Some(format!("resolve references unknown record {id}"))
        } else if amend && !base_resolve_ids.contains(&id) {
            Some(format!(
                "amend references record {id} without a base resolve"
            ))
        } else {
            None
        };
        if let Some(message) = message {
            findings.push(finding(line, "orphan_resolve", message));
        }
    }
    if let Some(probe) = unsupported {
        findings = vec![finding(
            probe.line,
            "unsupported_version",
            unsupported_log_version_message(probe.line, probe.found_version.as_ref()),
        )];
    }
    findings.extend(leak_findings);
    DoctorData {
        healthy: findings.is_empty(),
        findings,
        checked_lines,
        fix: None,
    }
}

fn current_home_path() -> Option<Vec<u8>> {
    let cwd = std::env::current_dir().ok()?;
    store::home_dir(&cwd)
        .filter(|home| home.is_absolute())
        .and_then(|home| home.to_str().map(|home| home.as_bytes().to_vec()))
}

// Byte mirror of `redact::home_path_delimiter`: the shared evidence delimiters
// plus the colon that separates entries in Unix path lists such as PATH. Both
// classes must stay in sync with `redact.rs`, where the colon is deliberately
// kept out of `evidence_delimiter` so secret-value and URL parsing are
// unchanged. `commands::add::SECRET_MARKER` joins them: `generic_home_path_end`
// below accepts that marker's bytes behind a generic prefix (r41), so the
// scanner now mirrors the secret pass as well as the home pass.
fn home_path_delimiter(byte: u8) -> bool {
    byte.is_ascii_whitespace() || EVIDENCE_DELIMITERS.contains(&byte) || byte == b':'
}

fn path_prefix_boundary(bytes: &[u8], end: usize, separator: u8) -> bool {
    bytes
        .get(end)
        .is_none_or(|byte| *byte == b'/' || *byte == separator || home_path_delimiter(*byte))
}

// The end boundary of an exact current-home match on the decoded layer: the
// byte mirror of `redact::exact_home_boundary` (r42). The raw layer keeps
// `path_prefix_boundary` — it makes no new acceptance claims and its rule set
// is exactly what shipped before r43.
fn exact_home_boundary(bytes: &[u8], end: usize, separator: u8, dash_home: Option<&[u8]>) -> bool {
    let Some(byte) = bytes.get(end).copied() else {
        return true;
    };
    if byte == b'/' || byte == b'~' || home_path_delimiter(byte) {
        return true;
    }
    if byte != b'-' {
        return false;
    }
    let rest = &bytes[end..];
    separator == b'-'
        || dash_home.is_some_and(|dash| rest.starts_with(dash))
        || rest.starts_with(b"-Users-")
        || rest.starts_with(b"-home-")
}

// The decoded-layer marker enumeration, complete after r39, r41 and r42: the
// bare marker, or a leading `~` immediately followed by another `~`, by a `-`,
// or by the secret marker, whatever follows after. Every other component is
// bytes the redactor never wrote, so `~abc` and `~<reda` stay leaks.
fn is_redaction_marker_component(component: &[u8]) -> bool {
    component.strip_prefix(b"~").is_some_and(|tail| {
        tail.is_empty()
            || tail.starts_with(b"~")
            || tail.starts_with(b"-")
            || tail.starts_with(crate::commands::add::SECRET_MARKER.as_bytes())
    })
}

// The raw layer's acceptance, frozen at what shipped before r43: r39's bare
// marker and r41's `~~`/`~<redacted>` compositions, with no r42 member.
fn is_raw_marker_component(component: &[u8]) -> bool {
    component.strip_prefix(b"~").is_some_and(|tail| {
        tail.is_empty()
            || tail.starts_with(b"~")
            || tail.starts_with(crate::commands::add::SECRET_MARKER.as_bytes())
    })
}

fn generic_home_path_end(
    bytes: &[u8],
    start: usize,
    marker_accepted: fn(&[u8]) -> bool,
) -> Option<usize> {
    let prefix = HOME_PREFIXES
        .into_iter()
        .find(|prefix| bytes[start..].starts_with(prefix))?;
    let separator = prefix[0];
    // Generic aliases only start a token. Unlike exact $HOME matching, a
    // preceding slash makes the slash form a nested path such as
    // /mnt/home/shared; a dash-encoded slug normally does follow a slash.
    if start != 0
        && !bytes
            .get(start - 1)
            .is_some_and(|byte| home_path_delimiter(*byte) || (separator == b'-' && *byte == b'/'))
    {
        return None;
    }
    let component_start = start + prefix.len();
    let mut component_end = component_start;
    while let Some(byte) = bytes.get(component_end) {
        if *byte == b'/' || *byte == separator || home_path_delimiter(*byte) {
            break;
        }
        component_end += 1;
    }
    // A `~` is blotter's own redaction marker, not a username: the redactor
    // emits it behind a generic prefix whose own component was empty. It does
    // not always stand alone — r38's resume-after-match lets two home forms
    // abut as `~~`, and the secret pass (r25) runs afterwards over a token
    // class holding no `~`, so it can swallow the separator behind one and
    // leave `~<redacted>`. The accepted set differs by layer, so the caller
    // passes it: r42's `~-` member is sound only on the decoded text.
    if marker_accepted(&bytes[component_start..component_end]) {
        return None;
    }
    (component_end > component_start && path_prefix_boundary(bytes, component_end, separator))
        .then_some(component_end)
}

fn contains_home_path(
    bytes: &[u8],
    home: Option<&[u8]>,
    dash_home: Option<&[u8]>,
    decoded: bool,
) -> bool {
    let marker_accepted: fn(&[u8]) -> bool = if decoded {
        is_redaction_marker_component
    } else {
        is_raw_marker_component
    };
    let boundary = |end: usize, separator: u8| {
        if decoded {
            exact_home_boundary(bytes, end, separator, dash_home)
        } else {
            path_prefix_boundary(bytes, end, separator)
        }
    };
    let mut start = 0;
    while start < bytes.len() {
        let home_end = home
            .filter(|home| bytes[start..].starts_with(home))
            .map(|home| start + home.len())
            .filter(|end| boundary(*end, b'/'));
        // Exact current home in dash-encoded form; mirrors the redaction-side
        // precedence so dashed usernames and non-generic homes are caught, and
        // like the slash form it carries no start boundary (r40).
        let dash_home_end = dash_home
            .filter(|dash| bytes[start..].starts_with(dash))
            .map(|dash| start + dash.len())
            .filter(|end| boundary(*end, b'-'));
        if home_end.is_some()
            || dash_home_end.is_some()
            || generic_home_path_end(bytes, start, marker_accepted).is_some()
        {
            return true;
        }
        start += 1;
    }
    false
}

// Every string a parsed line holds — object keys and values alike, at every
// depth. The typed `LogEvent` drops unknown fields and r24 has unknown stored
// values pass through opaquely, so scanning the typed record would silently
// stop covering a field a future release adds.
fn decoded_contains_home_path(value: &serde_json::Value, leak_scan: &LeakScan<'_>) -> bool {
    let scan = |text: &str| {
        contains_home_path(
            text.as_bytes(),
            leak_scan.home.as_deref(),
            leak_scan.dash_home.as_deref(),
            true,
        )
    };
    match value {
        serde_json::Value::String(text) => scan(text),
        serde_json::Value::Array(items) => items
            .iter()
            .any(|item| decoded_contains_home_path(item, leak_scan)),
        serde_json::Value::Object(fields) => fields
            .iter()
            .any(|(key, field)| scan(key) || decoded_contains_home_path(field, leak_scan)),
        _ => false,
    }
}

fn add_leak_findings(
    findings: &mut Vec<Finding>,
    line: usize,
    raw: &[u8],
    leak_scan: &LeakScan<'_>,
) {
    // A line that parses is scanned as decoded text — the same bytes the
    // redactor wrote and `list` renders, so the mirror means the same thing on
    // both sides (r43). A line that does not parse keeps the raw scan, rules
    // frozen: r22 has the gate cover malformed lines, and a false flag there
    // fails safe. The split is on parse success, not record validity.
    let leaked = match serde_json::from_slice::<serde_json::Value>(raw) {
        Ok(value) => decoded_contains_home_path(&value, leak_scan),
        Err(_) => contains_home_path(
            raw,
            leak_scan.home.as_deref(),
            leak_scan.dash_home.as_deref(),
            false,
        ),
    };
    if leaked {
        findings.push(finding(
            line,
            "leak",
            format!("line {line} contains home path"),
        ));
    }
    for pattern in leak_scan.deny {
        let matches = raw
            .windows(pattern.len())
            .any(|candidate| candidate == pattern.as_bytes());
        if matches {
            findings.push(finding(
                line,
                "leak",
                format!("line {line} contains deny pattern {pattern:?}"),
            ));
        }
    }
}

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

    fn cut(id: &str) -> String {
        format!(
            r#"{{"v":2,"kind":"cut","id":"{id}","ts":"2026-01-15T00:00:00.000Z","agent":"t","text":"x","tags":[],"impact":"low","cwd":"."}}"#
        )
    }

    fn resolve(id: &str) -> String {
        format!(
            r#"{{"v":2,"kind":"resolve","id":"{id}","ts":"2026-01-15T00:00:01.000Z","agent":"t","note":null,"disposition":"fixed","disposition_ts":"2026-01-15T00:00:01.000Z"}}"#
        )
    }

    /// The derived post-fix report must equal a full reinspection of the
    /// repaired bytes on every shape, including the ones where line numbers
    /// shift, the log keeps a leading empty segment, or the repair empties it.
    #[test]
    fn derived_post_fix_report_matches_a_full_reinspection() {
        let cases: Vec<Vec<u8>> = vec![
            b"".to_vec(),
            b"\n".to_vec(),
            b"not-json\n".to_vec(),
            b"not-json".to_vec(),
            format!("\n{}\nnot-json\n", cut("bl_aaaaaaaaaaaaaaaaaaaa")).into_bytes(),
            format!("not-json\n{}\n{}\n", cut("bl_a"), cut("bl_a")).into_bytes(),
            format!("{}\nnot-json\n{}\n", cut("bl_a"), cut("bl_a")).into_bytes(),
            format!("{}\n{}\nnot-json", cut("bl_a"), resolve("bl_b")).into_bytes(),
            format!(
                "<<<<<<< HEAD\n{}\n>>>>>>> other\n{}\n",
                cut("bl_a"),
                resolve("bl_zzz")
            )
            .into_bytes(),
            br#"{"v":2,"kind":"nope"}"#.to_vec(),
            format!("{{\"v\":2,\"kind\":\"nope\"}}\nnot-json\n{}\n", cut("bl_a")).into_bytes(),
            b"not-json\nnot-json\nnot-json\n".to_vec(),
            format!("{}\n{}\n", cut("bl_a"), resolve("bl_a")).into_bytes(),
        ];
        for bytes in cases {
            let before = inspect(&bytes, None);
            let applied = planned_fixes(&before.findings);
            let repaired = repaired_bytes(&bytes, &applied);
            let expected = serde_json::to_value(inspect(&repaired, None)).unwrap();
            let derived = serde_json::to_value(post_fix_data(&before, &applied)).unwrap();
            assert_eq!(
                derived,
                expected,
                "derived report drifted for {:?}",
                String::from_utf8_lossy(&bytes)
            );
        }
    }
}