sva_engine/cache/

codec.rs

// Concern: one stored node value, tagged with the store's format, and one staged run, as bytes and back | Non-concern: where the bytes live or when | IO: (Stored or Buffer) <-> bytes, a bad one None

use sva_formula::Codomain;
use sva_samples::{
    Buffer, Cost, Detail, Dropped, Extent, Grid, Label, PSYCHOACOUSTIC_V1, Rule, Source,
};

use sva_formula::Hash;

use super::Stored;
use super::stored::{Header, Laid, Samples};

/// Bumped by, and only by, a change to a stored value's bytes or to the key it is stored under.
pub const STORE_FORMAT: u32 = 28;

/// Every entry opens with its format, so one another format wrote is never read as a value,
/// even where a wipe left it.
fn entry_tag() -> Vec<u8> {
    [&b"SVAh"[..], &STORE_FORMAT.to_le_bytes()].concat()
}

const STAGED_RUN: &[u8; 4] = b"SVAc";

/// Samples per chunk of a run: what one checksum covers, and the least a read loads. Samples
/// stay f64, as the render computes them: a stored value is read by others, and f32 would
/// change the bits of every value that reads it.
pub(crate) const CHUNK: usize = 4096;

/// A header's length, then the header, then each run's samples chunk by chunk, every plane of
/// a chunk together, so a stretch of a run is one read.
pub(crate) fn entry(head: &Header, runs: &[Buffer]) -> Vec<u8> {
    let mut laid = Vec::new();
    let mut body = Vec::new();
    for run in runs {
        let mut sums = Vec::new();
        let at = body.len() as u64;
        for from in (0..run.len()).step_by(CHUNK) {
            let to = (from + CHUNK).min(run.len());
            let chunk = body.len();
            for plane in &run.planes {
                for sample in &plane[from..to] {
                    word(&mut body, sample.to_bits());
                }
            }
            sums.push(checksum(&body[chunk..]));
        }
        laid.push(Laid {
            rate: run.rate,
            start: run.start,
            width: run.width,
            len: run.len(),
            at,
            sums,
        });
    }
    let head = sealed(header(head, &laid));
    let mut out = Vec::with_capacity(8 + head.len() + body.len());
    word(&mut out, head.len() as u64);
    out.extend_from_slice(&head);
    out.extend_from_slice(&body);
    out
}

fn header(head: &Header, laid: &[Laid]) -> Vec<u8> {
    let stored = head.stored();
    let mut out = entry_tag();
    word(&mut out, stored.key.0);
    word(&mut out, stored.key.1);
    word(&mut out, stored.identity.0);
    word(&mut out, stored.identity.1);
    labelled(&mut out, &stored.label);
    out.push(stored.width);
    out.push(match stored.codomain {
        Codomain::Real => 0,
        Codomain::Complex => 1,
    });
    maybe(&mut out, stored.rate.map(u64::from));
    word(&mut out, u64::from(stored.grid.rate));
    out.extend_from_slice(&stored.grid.a.to_le_bytes());
    out.extend_from_slice(&stored.grid.d.to_le_bytes());
    word(&mut out, stored.support.start as u64);
    word(&mut out, stored.support.end as u64);
    out.extend_from_slice(&stored.priced.to_le_bytes());
    word(&mut out, stored.moved.to_bits());
    out.push(u8::from(stored.readable));
    out.push(u8::from(stored.sampled));
    word(&mut out, stored.cuts.len() as u64);
    for (cut, at) in &stored.cuts {
        word(&mut out, cut.0);
        word(&mut out, cut.1);
        word(&mut out, *at as u64);
    }
    match head.samples() {
        &Samples::Of { key, by } => {
            out.push(1);
            word(&mut out, key.0);
            word(&mut out, key.1);
            word(&mut out, by as u64);
        }
        _ => out.push(0),
    }
    word(&mut out, laid.len() as u64);
    for run in laid {
        word(&mut out, u64::from(run.rate));
        word(&mut out, run.start as u64);
        word(&mut out, run.width as u64);
        word(&mut out, run.len as u64);
        for sum in &run.sums {
            word(&mut out, *sum);
        }
    }
    out
}

/// How many of an entry's first bytes its header takes, off its first eight.
pub(crate) fn head_len(first: &[u8]) -> Option<usize> {
    let len = u64::from_le_bytes(first.get(..8)?.try_into().ok()?);
    8usize.checked_add(usize::try_from(len).ok()?)
}

/// The meta an entry's header states, its samples laid in `file`, and the entry's length; a
/// truncated, corrupt or foreign header is `None`, never a partial value.
pub(crate) fn read_head(bytes: &[u8], file: Hash) -> Option<(Header, u64)> {
    let span = head_len(bytes)?;
    let mut r = Reader(opened(bytes.get(8..span)?, &entry_tag())?);
    let key = Hash(r.word()?, r.word()?);
    let identity = Hash(r.word()?, r.word()?);
    let label = r.label()?;
    let width = r.byte()?;
    let codomain = match r.byte()? {
        0 => Codomain::Real,
        1 => Codomain::Complex,
        _ => return None,
    };
    let rate = match r.maybe()? {
        Some(rate) => Some(u32::try_from(rate).ok()?),
        None => None,
    };
    let grid = Grid {
        rate: u32::try_from(r.word()?).ok()?,
        a: r.wide()? as i128,
        d: r.wide()? as i128,
    };
    let (start, end) = (r.word()? as i64, r.word()? as i64);
    let support = (start <= end).then(|| Extent::new(start, end))?;
    let priced = r.wide()?;
    let moved = f64::from_bits(r.word()?);
    let readable = r.flag()?;
    let sampled = r.flag()?;
    let mut cuts = Vec::new();
    for _ in 0..r.word()?.min(r.0.len() as u64) {
        cuts.push((Hash(r.word()?, r.word()?), r.word()? as i64));
    }
    let of = match r.byte()? {
        0 => None,
        1 => Some(Samples::Of {
            key: Hash(r.word()?, r.word()?),
            by: r.word()? as i64,
        }),
        _ => return None,
    };
    let count = r.word()? as usize;
    let mut runs = Vec::new();
    let mut at = span as u64;
    for _ in 0..count.min(r.0.len()) {
        let rate = u32::try_from(r.word()?).ok()?;
        let start = r.word()? as i64;
        let (width, len) = (r.word()? as usize, r.word()? as usize);
        let sums = (0..len.div_ceil(CHUNK).min(r.0.len()))
            .map(|_| r.word())
            .collect::<Option<Vec<u64>>>()?;
        if sums.len() != len.div_ceil(CHUNK) {
            return None;
        }
        runs.push(Laid {
            rate,
            start,
            width,
            len,
            at,
            sums,
        });
        at = at.checked_add((width.checked_mul(len)?.checked_mul(8)?) as u64)?;
    }
    let samples = match (of, runs.is_empty()) {
        (Some(of), true) => of,
        (Some(_), false) => return None,
        (None, true) => Samples::None,
        (None, false) => Samples::Entry {
            file,
            runs,
            shift: 0,
        },
    };
    let stored = Stored {
        key,
        identity,
        label,
        width,
        codomain,
        rate,
        grid,
        support,
        priced,
        moved,
        readable,
        sampled,
        cuts,
        held: Vec::new(),
    };
    let whole = runs_whole(count, &samples) && r.0.is_empty();
    whole.then(|| (Header::new(stored, samples), at))
}

fn runs_whole(count: usize, samples: &Samples) -> bool {
    match samples {
        Samples::Entry { runs, .. } => runs.len() == count,
        _ => count == 0,
    }
}

/// Where in its file a run's chunks `from..to` lie, and how many bytes.
pub(crate) fn span_of(run: &Laid, from: usize, to: usize) -> (u64, u64) {
    let bytes = |chunks: usize| ((chunks * CHUNK).min(run.len) * run.width * 8) as u64;
    (run.at + bytes(from), bytes(to) - bytes(from))
}

/// A run's chunks `from..to` off the bytes `span_of` names; `None` where a checksum fails.
pub(crate) fn read_chunks(bytes: &[u8], run: &Laid, from: usize, to: usize) -> Option<Buffer> {
    let first = from * CHUNK;
    let len = (to * CHUNK).min(run.len).checked_sub(first)?;
    if bytes.len() != len * run.width * 8 {
        return None;
    }
    let mut planes = vec![Vec::with_capacity(len); run.width];
    let mut at = 0;
    for (k, sum) in run.sums[from..to].iter().enumerate() {
        let n = (CHUNK).min(run.len - first - k * CHUNK);
        let chunk = &bytes[at..at + n * run.width * 8];
        if checksum(chunk) != *sum {
            return None;
        }
        for (c, plane) in planes.iter_mut().enumerate() {
            let own = &chunk[c * n * 8..(c + 1) * n * 8];
            plane.extend(
                own.chunks_exact(8).map(|b| {
                    f64::from_bits(u64::from_le_bytes(b.try_into().expect("eight bytes")))
                }),
            );
        }
        at += chunk.len();
    }
    let mut out = Buffer::of_planes(run.rate, planes);
    out.start = run.start + first as i64;
    Some(out)
}

/// Every run an entry under `key` lays out; `None` where any is corrupt.
pub(crate) fn read_runs(bytes: &[u8], key: Hash) -> Option<Vec<Buffer>> {
    let (head, _) = read_head(bytes, key)?;
    let Samples::Entry { runs, .. } = head.samples() else {
        return Some(Vec::new());
    };
    let read = |run: &Laid| {
        let n = run.len.div_ceil(CHUNK);
        let (at, len) = span_of(run, 0, n);
        let span = bytes.get(at as usize..(at + len) as usize)?;
        read_chunks(span, run, 0, n)
    };
    runs.iter().map(read).collect()
}

pub(crate) fn chunk(samples: &Buffer) -> Vec<u8> {
    let mut out = STAGED_RUN.to_vec();
    segments(&mut out, std::slice::from_ref(samples));
    sealed(out)
}

pub(crate) fn read_chunk(bytes: &[u8]) -> Option<Buffer> {
    let mut r = Reader(opened(bytes, STAGED_RUN)?);
    let mut parts = r.segments()?;
    (r.0.is_empty() && parts.len() == 1).then(|| parts.remove(0))
}

fn sealed(mut out: Vec<u8>) -> Vec<u8> {
    let sum = checksum(&out);
    word(&mut out, sum);
    out
}

/// The body past `magic`, where the checksum holds.
fn opened<'b>(bytes: &'b [u8], magic: &[u8]) -> Option<&'b [u8]> {
    let body = bytes.len().checked_sub(8)?;
    let (body, sum) = bytes.split_at(body);
    (checksum(body).to_le_bytes() == sum && body.starts_with(magic)).then(|| &body[magic.len()..])
}

fn segments(out: &mut Vec<u8>, parts: &[Buffer]) {
    word(out, parts.len() as u64);
    for part in parts {
        word(out, u64::from(part.rate));
        word(out, part.start as u64);
        word(out, part.width as u64);
        word(out, part.len() as u64);
        for plane in &part.planes {
            for sample in plane {
                word(out, sample.to_bits());
            }
        }
    }
}

fn checksum(bytes: &[u8]) -> u64 {
    bytes.iter().fold(0xcbf2_9ce4_8422_2325, |h, b| {
        (h ^ u64::from(*b)).wrapping_mul(0x0100_0000_01b3)
    })
}

fn word(out: &mut Vec<u8>, w: u64) {
    out.extend_from_slice(&w.to_le_bytes());
}

fn float(out: &mut Vec<u8>, v: Option<f64>) {
    maybe(out, v.map(f64::to_bits));
}

fn maybe(out: &mut Vec<u8>, w: Option<u64>) {
    match w {
        None => out.push(0),
        Some(w) => {
            out.push(1);
            word(out, w);
        }
    }
}

fn text(out: &mut Vec<u8>, s: &str) {
    word(out, s.len() as u64);
    out.extend_from_slice(s.as_bytes());
}

fn labelled(out: &mut Vec<u8>, label: &Label) {
    out.push(match label.source {
        Source::Exact => 0,
        Source::Measured => 1,
    });
    text(out, label.profile);
    word(out, u64::from(label.rate));
    detailed(out, &label.detail);
    match label.cost {
        None => out.push(0),
        Some(Cost { flops, budget }) => {
            out.push(1);
            out.extend_from_slice(&flops.to_le_bytes());
            out.extend_from_slice(&budget.to_le_bytes());
        }
    }
    float(out, label.moved);
    match &label.pruned {
        None => out.push(0),
        Some(pruned) => {
            out.push(1);
            word(out, pruned.db.to_bits());
            word(out, pruned.cuts.len() as u64);
            for (node, at) in &pruned.cuts {
                text(out, node);
                word(out, *at as u64);
            }
        }
    }
}

fn detailed(out: &mut Vec<u8>, detail: &Detail) {
    let rule = |out: &mut Vec<u8>, rule: &Rule| text(out, rule.as_str());
    match detail {
        Detail::Lines {
            rule: r,
            placed,
            summed,
            dropped,
            dropped_more,
            terms,
            tail_db,
        } => {
            out.push(0);
            rule(out, r);
            word(out, *placed as u64);
            word(out, *summed as u64);
            word(out, dropped.len() as u64);
            for d in dropped {
                word(out, d.hz.to_bits());
                word(out, d.db.to_bits());
            }
            word(out, *dropped_more as u64);
            maybe(out, terms.map(|t| t as u64));
            float(out, *tail_db);
        }
        Detail::Continuous { rule: r } => {
            out.push(1);
            rule(out, r);
        }
        Detail::Cropped { rule: r, tail_db } => {
            out.push(2);
            rule(out, r);
            float(out, *tail_db);
        }
        Detail::Point {
            rule: r,
            alias_db,
            tail_db,
        } => {
            out.push(3);
            rule(out, r);
            float(out, *alias_db);
            float(out, *tail_db);
        }
        Detail::Spectrum { rule: r, wrap_db } => {
            out.push(4);
            rule(out, r);
            word(out, wrap_db.to_bits());
        }
        Detail::Roundtrip { rule: r, edited } => {
            out.push(5);
            rule(out, r);
            out.push(u8::from(*edited));
        }
        Detail::Reading { rule: r } => {
            out.push(6);
            rule(out, r);
        }
        Detail::Added { parts } => {
            out.push(7);
            word(out, parts.len() as u64);
            for part in parts {
                detailed(out, part);
            }
        }
    }
}

struct Reader<'b>(&'b [u8]);

impl Reader<'_> {
    fn take(&mut self, n: usize) -> Option<&[u8]> {
        if self.0.len() < n {
            return None;
        }
        let (head, rest) = self.0.split_at(n);
        self.0 = rest;
        Some(head)
    }

    fn byte(&mut self) -> Option<u8> {
        self.take(1).map(|b| b[0])
    }

    fn flag(&mut self) -> Option<bool> {
        match self.byte()? {
            0 => Some(false),
            1 => Some(true),
            _ => None,
        }
    }

    fn word(&mut self) -> Option<u64> {
        Some(u64::from_le_bytes(self.take(8)?.try_into().ok()?))
    }

    fn segments(&mut self) -> Option<Vec<Buffer>> {
        let count = self.word()? as usize;
        let mut parts = Vec::new();
        for _ in 0..count.min(self.0.len()) {
            let rate = u32::try_from(self.word()?).ok()?;
            let start = self.word()? as i64;
            let (width, len) = (self.word()? as usize, self.word()? as usize);
            if width.saturating_mul(len).saturating_mul(8) > self.0.len() {
                return None;
            }
            let planes = (0..width)
                .map(|_| (0..len).map(|_| self.word().map(f64::from_bits)).collect())
                .collect::<Option<Vec<Vec<f64>>>>()?;
            let mut part = Buffer::of_planes(rate, planes);
            part.start = start;
            parts.push(part);
        }
        (parts.len() == count).then_some(parts)
    }

    fn wide(&mut self) -> Option<u128> {
        Some(u128::from_le_bytes(self.take(16)?.try_into().ok()?))
    }

    fn maybe(&mut self) -> Option<Option<u64>> {
        match self.byte()? {
            0 => Some(None),
            1 => Some(Some(self.word()?)),
            _ => None,
        }
    }

    fn float(&mut self) -> Option<Option<f64>> {
        Some(self.maybe()?.map(f64::from_bits))
    }

    fn text(&mut self) -> Option<&str> {
        let len = self.word()? as usize;
        std::str::from_utf8(self.take(len)?).ok()
    }

    fn rule(&mut self) -> Option<Rule> {
        Rule::named(self.text()?)
    }

    fn label(&mut self) -> Option<Label> {
        let source = match self.byte()? {
            0 => Source::Exact,
            1 => Source::Measured,
            _ => return None,
        };
        let profile = match self.text()? {
            name if name == PSYCHOACOUSTIC_V1.name => PSYCHOACOUSTIC_V1.name,
            _ => return None,
        };
        let rate = u32::try_from(self.word()?).ok()?;
        let detail = self.detail()?;
        let cost = match self.byte()? {
            0 => None,
            1 => Some(Cost {
                flops: self.wide()?,
                budget: self.wide()?,
            }),
            _ => return None,
        };
        let moved = self.float()?;
        let pruned = match self.byte()? {
            0 => None,
            1 => {
                let db = f64::from_bits(self.word()?);
                let count = usize::try_from(self.word()?).ok()?;
                let cuts = (0..count)
                    .map(|_| Some((self.text()?.to_string(), self.word()? as i64)))
                    .collect::<Option<Vec<_>>>()?;
                Some(sva_samples::Pruned { db, cuts })
            }
            _ => return None,
        };
        Some(Label {
            source,
            profile,
            rate,
            detail,
            cost,
            moved,
            pruned,
        })
    }

    fn detail(&mut self) -> Option<Detail> {
        Some(match self.byte()? {
            0 => {
                let rule = self.rule()?;
                let (placed, summed) = (self.word()? as usize, self.word()? as usize);
                let count = self.word()? as usize;
                let dropped = (0..count.min(self.0.len()))
                    .map(|_| {
                        Some(Dropped {
                            hz: f64::from_bits(self.word()?),
                            db: f64::from_bits(self.word()?),
                        })
                    })
                    .collect::<Option<Vec<_>>>()?;
                if dropped.len() != count {
                    return None;
                }
                Detail::Lines {
                    rule,
                    placed,
                    summed,
                    dropped,
                    dropped_more: self.word()? as usize,
                    terms: self.maybe()?.map(|t| t as usize),
                    tail_db: self.float()?,
                }
            }
            1 => Detail::Continuous { rule: self.rule()? },
            2 => Detail::Cropped {
                rule: self.rule()?,
                tail_db: self.float()?,
            },
            3 => Detail::Point {
                rule: self.rule()?,
                alias_db: self.float()?,
                tail_db: self.float()?,
            },
            4 => Detail::Spectrum {
                rule: self.rule()?,
                wrap_db: f64::from_bits(self.word()?),
            },
            5 => Detail::Roundtrip {
                rule: self.rule()?,
                edited: match self.byte()? {
                    0 => false,
                    1 => true,
                    _ => return None,
                },
            },
            6 => Detail::Reading { rule: self.rule()? },
            7 => {
                let count = self.word()? as usize;
                let parts = (0..count.min(self.0.len()))
                    .map(|_| self.detail())
                    .collect::<Option<Vec<_>>>()?;
                if parts.len() != count {
                    return None;
                }
                Detail::Added { parts }
            }
            _ => return None,
        })
    }
}