hopper-runtime 0.3.1

//! Schema-epoch in-place migration runtime.
//!
//! Schema epochs and in-place migration helpers use the header's
//! `schema_epoch: u32`, which
//! lets accounts self-identify the ABI version they were written in.
//! When a program later loads an account written at an older epoch,
//! the runtime consults a declared migration chain, applies each edge
//! in sequence atomically with a `schema_epoch` bump, and only then
//! hands the caller a typed `Ref<'_, T>` of the current shape.
//!
//! # Design rules
//!
//! * **In-place**. no allocation, no CPI. Migration rewrites the
//!   account body (within its existing byte range) and the 16-byte
//!   Hopper header.
//! * **Atomic per edge under transaction-abort semantics.** Each
//!   edge bumps the header's `schema_epoch` only after its body
//!   mutation fully succeeded, so a *completed* edge is always
//!   consistent. A migrator that errors after partially writing the
//!   body, however, leaves a hybrid body under the old epoch. The
//!   returned error **must** propagate to instruction failure (the
//!   Solana runtime then rolls every byte back). Callers must not
//!   swallow migration errors and continue using the account.
//! * **Idempotent**. re-running an already-applied edge is a no-op
//!   (the header epoch mismatch returns `MigrationMismatch`).
//! * **Deterministic**. edges are applied in strict
// ---------------------------------------------------------------------

use crate::account::AccountView;
use crate::address::Address;
use crate::error::ProgramError;
use crate::layout::{HopperHeader, LayoutContract};
use crate::zerocopy::AccountLayout;

/// The migration security gate: every migration entry point checks the
/// account is **writable** and **owned by the executing program** before
/// a user transform reads a byte.
///
/// Rationale (the crank-before-validators fix): the context macro runs
/// lazy-migration pre-steps in `bind()` BEFORE the per-field validators
/// so the validators see the upgraded account. That ordering is correct,
/// but it means the migration used to execute a user transform over an
/// account nobody had checked yet, a foreign-owned account whose bytes
/// happen to validate as an `Old` header would have its transform run
/// (and, if the caller swallowed the eventual bind error, its writes
/// kept). Baking the check into the runtime entry points protects every
/// caller, systems-mode included, not just the macro crank.
#[inline(always)]
fn check_migratable(account: &AccountView<'_>, program_id: &Address) -> Result<(), ProgramError> {
    if !account.is_writable() {
        return Err(ProgramError::InvalidAccountData);
    }
    if !account.owned_by(program_id) {
        return Err(ProgramError::IncorrectProgramId);
    }
    Ok(())
}

/// One step in a layout's migration chain.
///
/// An edge takes the raw account *body* (the bytes after the 16-byte
/// Hopper header), mutates them in place to match the new epoch's
/// shape, and returns `Ok(())` on success. The runtime then atomically
/// bumps the header's `schema_epoch` to `to_epoch` under the same
/// mutable borrow.
///
/// Migration functions must not call CPIs (no CreateAccount, no
/// Transfer) and must not resize the account (use `realloc` for that
/// separately). They may read and write arbitrary bytes within the
/// body, which is why the signature takes `&mut [u8]`. `ZeroCopy`
/// safety has deliberately been stepped out of because the user is
/// explicitly translating between two different byte layouts.
#[derive(Clone, Copy)]
pub struct MigrationEdge {
    /// Epoch the body is expected to be in before this edge runs.
    pub from_epoch: u32,
    /// Epoch the body will be in after this edge runs successfully.
    pub to_epoch: u32,
    /// In-place mutator. Called exactly once per upgrade sequence.
    pub migrator: fn(body: &mut [u8]) -> Result<(), ProgramError>,
}

impl MigrationEdge {
    /// Reject edges that would decrement or stay at the same epoch .
    /// migrations always move forward.
    pub const fn is_forward(&self) -> bool {
        self.to_epoch > self.from_epoch
    }
}

/// Layouts opt into in-place migration by providing a `MIGRATIONS`
/// constant. The default (empty slice) means "no migrations declared"
/// and any mismatch between header and `AccountLayout::SCHEMA_EPOCH`
/// is a hard failure.
///
/// The trait is sealed-by-convention: downstream crates should
/// express migrations via the `#[hopper::migrate(...)]` attribute
/// macro and the `hopper::layout_migrations!` composition helper,
/// never by hand-writing `impl LayoutMigration for T`.
pub trait LayoutMigration {
    /// Ordered migration chain. `MIGRATIONS[i].to_epoch ==
    /// MIGRATIONS[i + 1].from_epoch` must hold for every adjacent
    /// pair, and the whole chain must be strictly monotonic.
    const MIGRATIONS: &'static [MigrationEdge];
}

// No blanket impl. stable Rust doesn't allow specialization, so a
// blanket `impl<T: AccountLayout> LayoutMigration for T` would lock
// out user opt-ins. Types without migrations simply never implement
// `LayoutMigration` and are therefore ineligible for
// `apply_pending_migrations::<T>`. which is the correct behaviour:
// you opt in to in-place migration by declaring a chain.

/// Apply all pending migrations needed to bring the account at
/// `current_epoch` up to `AccountLayout::SCHEMA_EPOCH`.
///
/// Returns `Ok(applied_count)` if everything up-migrated cleanly.
/// Returns `Err(MigrationMismatch)` if the declared chain is
/// incomplete, non-monotonic, or doesn't start at `current_epoch`.
/// Returns `Err(MigrationRejected)` if a user migrator function
/// returned an error.
#[inline]
pub fn apply_pending_migrations<T>(
    account: &AccountView<'_>,
    program_id: &Address,
    current_epoch: u32,
) -> Result<u32, ProgramError>
where
    T: AccountLayout + LayoutContract + LayoutMigration,
{
    check_migratable(account, program_id)?;
    let target_epoch = <T as AccountLayout>::SCHEMA_EPOCH;
    if current_epoch == target_epoch {
        return Ok(0);
    }
    if current_epoch > target_epoch {
        // Account is from a FUTURE epoch. forward-compatibility is
        // out of scope for in-place migration. Caller must refuse
        // or route to a different program.
        return Err(ProgramError::InvalidAccountData);
    }

    let edges = <T as LayoutMigration>::MIGRATIONS;
    let mut applied = 0u32;
    let mut epoch = current_epoch;

    // Single mutable borrow across the whole chain. atomicity per
    // edge is maintained by rewriting the header's schema_epoch byte
    // range before the borrow is released.
    let mut data = account.try_borrow_mut_ungated()?;
    let header_len = core::mem::size_of::<HopperHeader>();
    if data.len() < header_len {
        return Err(ProgramError::AccountDataTooSmall);
    }

    while epoch < target_epoch {
        let edge = find_edge(edges, epoch)?;
        // A declared edge must not overshoot the layout's current
        // epoch: stamping the header past SCHEMA_EPOCH would mark the
        // account as from-the-future and make every subsequent typed
        // load refuse it, silent corruption from a misdeclared chain.
        // Refuse before touching a byte.
        if edge.to_epoch > target_epoch {
            return Err(ProgramError::InvalidAccountData);
        }
        let (header_bytes, body_bytes) = data.split_at_mut(header_len);
        // Step 1: mutate the body.
        (edge.migrator)(body_bytes)?;
        // Step 2: atomically bump the header's schema_epoch field.
        // Header layout is `#[repr(C, packed)]`: bytes 12..16 are
        // `schema_epoch: u32 LE` per `layout.rs`.
        let new_epoch_bytes = edge.to_epoch.to_le_bytes();
        header_bytes[12..16].copy_from_slice(&new_epoch_bytes);
        epoch = edge.to_epoch;
        applied += 1;
    }

    Ok(applied)
}

/// Typed, in-place, cross-VERSION layout migration: `Old` → `New`.
///
/// The epoch machinery above evolves an account *within* one layout
/// version through raw `&mut [u8]` edges. This is the other half of the
/// versioning story: the account's layout **version byte** changes
/// (`#[hopper::state(version = 1)]` → `version = 2`), the wire
/// fingerprint changes with the field set, and the transform is
/// **typed on both sides**, no hand-offsetting bytes:
///
/// ```ignore
/// hopper_runtime::migrate::migrate_layout::<VaultV1, VaultV2, _>(
///     account,
///     program_id,
///     |old, new| {
///         new.authority = old.authority;
///         // Widen the counter; every other V2 field keeps its
///         // deterministic all-zero default.
///         new.total = WireU64::new(old.total_u32.get() as u64);
///         Ok(())
///     },
/// )?;
/// ```
///
/// Contrast with anchor-next's `Migration` account shape, which
/// deserializes the old form and RESERIALIZES the new one through
/// borsh. Here both shapes are zero-copy overlays of the same buffer:
/// one stack copy of `Old` (so the transform can still read it after
/// the buffer is re-purposed), one `fill(0)` of the `New` span, no
/// (de)serialization, no heap.
///
/// # Sequence
///
/// 1. `Old::validate_header`, the full identity check (disc, version,
///    layout_id, epoch). An already-migrated account no longer matches
///    `Old` and is refused, which is the idempotence rule: migrate
///    exactly once, route repeat calls to the `New` load path.
/// 2. The `New` shape must FIT the existing allocation
///    (`required_len`); resizing is `realloc`'s job, done separately
///    BEFORE migrating when `New` is larger.
/// 3. `Old` is copied to the stack, the `New` span is zeroed (so every
///    field the transform does not set has the framework's canonical
///    all-zero default, stale `Old` bytes never leak through), and the
///    typed transform fills `New` from the copy.
/// 4. Only after the transform returns `Ok` is the header re-stamped,
///    `New`'s disc/version/layout_id/schema-epoch, with the header's
///    FLAGS bytes preserved (flags are account state, not layout
///    identity). A transform error therefore leaves the header on
///    `Old`, same transaction-abort atomicity contract as the epoch
///    edges above: the error must propagate to instruction failure so
///    the runtime rolls the partially-written body back.
///
/// # Guard rails (all refuse before touching a byte)
///
/// * `New::DISC == Old::DISC`, a migration must not repurpose the
///   account kind; both consts are known at monomorphization, so the
///   check folds away when it passes.
/// * `New::VERSION > Old::VERSION`, versions only move forward
///   (also const-folded).
/// * The account is **writable** and **owned by `program_id`**, the
///   crank runs at bind BEFORE the per-field validators (so validators
///   see the upgraded account), which means this function is the first
///   authority to look at the account. A user transform must never run
///   over another program's bytes, however plausibly they parse as
///   `Old`.
#[inline]
pub fn migrate_layout<Old, New, F>(
    account: &AccountView<'_>,
    program_id: &Address,
    transform: F,
) -> Result<(), ProgramError>
where
    Old: LayoutContract + crate::Pod,
    New: LayoutContract + crate::Pod,
    F: FnOnce(&Old, &mut New) -> Result<(), ProgramError>,
{
    // Const-foldable direction guards: same account kind, strictly
    // forward version. (Written as runtime `if`s so they work on every
    // toolchain; the comparisons are monomorphized constants and the
    // passing branch compiles to nothing.)
    if New::DISC != Old::DISC {
        return Err(ProgramError::InvalidAccountData);
    }
    if New::VERSION <= Old::VERSION {
        return Err(ProgramError::InvalidAccountData);
    }
    check_migratable(account, program_id)?;

    let mut data = account.try_borrow_mut_ungated()?;
    Old::validate_header(&data)?;
    if data.len() < New::required_len() {
        // In-place only: a larger New needs `realloc` FIRST. Refusing
        // here (before any write) keeps the account a valid Old.
        return Err(ProgramError::AccountDataTooSmall);
    }

    // Stack-copy the old shape so the transform can read it after the
    // buffer below is re-purposed as `New`.
    // SAFETY: `validate_header` proved the buffer holds a valid `Old`
    // at TYPE_OFFSET with at least `required_len()` bytes; `Old: Pod`
    // makes any bit pattern valid, and `read_unaligned` lifts the
    // bytes without an alignment requirement.
    let old: Old =
        unsafe { core::ptr::read_unaligned((*data).as_ptr().add(Old::TYPE_OFFSET) as *const Old) };

    // Deterministic defaults: zero the New span so unset fields carry
    // the framework's canonical empty value rather than stale bytes.
    let new_start = New::TYPE_OFFSET;
    let new_end = new_start + core::mem::size_of::<New>();
    data[new_start..new_end].fill(0);

    // SAFETY: the length check above proved `new_end <= data.len()`;
    // `New: Pod` accepts the all-zero pattern just written; Hopper
    // layout types are wire-aligned (align 1 by construction, same
    // contract `load_mut` relies on when it projects at TYPE_OFFSET).
    let new: &mut New = unsafe { &mut *(data.as_bytes_mut_ptr().add(new_start) as *mut New) };
    transform(&old, new)?;

    // Success: re-stamp the header as New, LAST, so an erroring
    // transform leaves the header on Old (see atomicity note above).
    // Flags are preserved: they describe the account, not the layout.
    let flags = crate::layout::read_flags(&data).unwrap_or(0);
    crate::layout::write_header_with_epoch(
        &mut data,
        New::DISC,
        New::VERSION,
        &New::LAYOUT_ID,
        New::SCHEMA_EPOCH,
    )?;
    data[2..4].copy_from_slice(&flags.to_le_bytes());
    Ok(())
}

/// [`migrate_layout`] that **resizes the account to fit the new shape**,
/// with a payer-funded rent top-up, the one migration capability the
/// in-place form defers to a separate `realloc`.
///
/// # Sequence
///
/// 1. The same const direction guards and the writable+owner gate.
/// 2. **Grow first** (when the allocation is smaller than
///    `New::required_len()`): compute the rent-exempt minimum for the
///    grown size from the LIVE rent sysvar, and when the account's
///    balance falls short, debit exactly the deficit from `payer`
///    (which must then be writable and a signer, a well-funded account
///    needs no payer at all). Growth is capped by Solana's
///    `MAX_PERMITTED_DATA_INCREASE` (10,240 bytes per instruction),
///    enforced by `resize`.
/// 3. The typed in-place migration ([`migrate_layout`]), which
///    re-verifies the `Old` identity under its own borrow.
/// 4. **Shrink last, opt-in** (`shrink_to_fit`, when the allocation
///    exceeds `New::required_len()` after migrating): resize down and
///    refund **exactly the freed rent-exemption delta** to `payer`,
///    doubly capped, never more than
///    `minimum_balance(old_len) - minimum_balance(new_len)`, and never
///    taking the account below its new minimum.
///
/// # The refund rule (why the cap is the point)
///
/// Quasar's `Migration<From, To>` normalizes the migrated account's
/// balance to the new rent minimum and pays the WHOLE difference to the
/// payer (`quasar account.rs:117-125`), run it on a PDA that holds user
/// deposits and the deposits leave with the payer. Hopper refunds only
/// the rent requirement the shrink actually freed; every other lamport
/// stays where it was.
///
/// # The shrink hazard (why it is opt-in)
///
/// `New::required_len()` covers the fixed shape. A layout with a dynamic
/// tail (`raw_tail`, `Seq<T>`, `TailStr`/`TailBytes`) stores live data
/// PAST that length, shrinking to fit would truncate it. Pass
/// `shrink_to_fit = false` (the context macro's default; `resize = fit`
/// opts in) unless the layout is tail-free.
#[inline]
pub fn migrate_layout_resizing<Old, New, F>(
    account: &AccountView<'_>,
    payer: &AccountView<'_>,
    program_id: &Address,
    shrink_to_fit: bool,
    transform: F,
) -> Result<(), ProgramError>
where
    Old: LayoutContract + crate::Pod,
    New: LayoutContract + crate::Pod,
    F: FnOnce(&Old, &mut New) -> Result<(), ProgramError>,
{
    if New::DISC != Old::DISC {
        return Err(ProgramError::InvalidAccountData);
    }
    if New::VERSION <= Old::VERSION {
        return Err(ProgramError::InvalidAccountData);
    }
    check_migratable(account, program_id)?;

    let new_required = New::required_len();

    // Grow BEFORE migrating: the Old body must stay intact for the
    // transform, and migrate_layout refuses a too-small New span.
    ensure_fits_with_rent(account, payer, program_id, new_required)?;

    migrate_layout::<Old, New, F>(account, program_id, transform)?;

    // Shrink AFTER migrating (never before the transform reads Old).
    if shrink_to_fit && account.data_len() > new_required {
        let min_old = crate::rent::minimum_balance_live(account.data_len())?;
        let min_new = crate::rent::minimum_balance_live(new_required)?;
        drop(account.try_borrow_mut_ungated()?);
        account.resize(new_required)?;
        // Refund exactly the freed rent delta; see the refund rule in
        // the doc above. Both caps matter: `delta` keeps deposits and
        // surplus with the account; `above_min` keeps an under-funded
        // account from being drained below its new minimum.
        let delta = min_old.saturating_sub(min_new);
        let above_min = account.lamports().saturating_sub(min_new);
        let refund = if delta < above_min { delta } else { above_min };
        if refund > 0 {
            if !payer.is_writable() {
                return Err(ProgramError::InvalidAccountData);
            }
            let account_after = account.lamports() - refund;
            let payer_after = payer
                .lamports()
                .checked_add(refund)
                .ok_or(ProgramError::ArithmeticOverflow)?;
            account.try_set_lamports(account_after)?;
            payer.try_set_lamports(payer_after)?;
        }
    }
    Ok(())
}

/// Grow `account` to at least `min_len` bytes, topping up the
/// rent-exempt minimum (from the LIVE rent sysvar) out of `payer` when
/// the account's balance falls short, the payer must then be writable
/// and a signer; a well-funded account needs no payer at all. A no-op
/// when the allocation already fits. Growth is capped by Solana's
/// `MAX_PERMITTED_DATA_INCREASE`, enforced by `resize`.
///
/// The building block behind [`migrate_layout_resizing`]'s grow phase
/// and [`migrate_chain!`](crate::migrate_chain)'s single up-front grow.
pub fn ensure_fits_with_rent(
    account: &AccountView<'_>,
    payer: &AccountView<'_>,
    program_id: &Address,
    min_len: usize,
) -> Result<(), ProgramError> {
    check_migratable(account, program_id)?;
    if account.data_len() >= min_len {
        return Ok(());
    }
    let rent_needed = crate::rent::minimum_balance_live(min_len)?;
    let deficit = rent_needed.saturating_sub(account.lamports());
    if deficit > 0 {
        if !payer.is_writable() {
            return Err(ProgramError::InvalidAccountData);
        }
        if !payer.is_signer() {
            return Err(ProgramError::MissingRequiredSignature);
        }
    }
    // Fail fast on outstanding data borrows before the length moves.
    drop(account.try_borrow_mut_ungated()?);
    account.resize(min_len)?;
    if deficit > 0 {
        let payer_after = payer
            .lamports()
            .checked_sub(deficit)
            .ok_or(ProgramError::InsufficientFunds)?;
        let account_after = account
            .lamports()
            .checked_add(deficit)
            .ok_or(ProgramError::ArithmeticOverflow)?;
        payer.try_set_lamports(payer_after)?;
        account.try_set_lamports(account_after)?;
    }
    Ok(())
}

/// Header identity check for an **epoch-migration candidate**: disc,
/// version, and layout id must match `T` exactly and the allocation
/// must fit `T`, while the stored schema epoch may LAG
/// `T::SCHEMA_EPOCH`, that lag is exactly what the epoch chain heals,
/// but may never exceed it (a from-the-future account is refused, never
/// "migrated"). Returns the stored EFFECTIVE epoch (a pre-epoch zero
/// header reads as epoch 1).
///
/// This is the shared acceptance predicate behind
/// `#[account(epoch_migrate)]`: the read-only `validate()` surface uses
/// it to accept a stale-epoch account that `bind()` can heal, and
/// bind's crank uses it to decide whether to run
/// [`apply_pending_migrations`], one function, two surfaces, so the
/// would-bind parity can never drift.
pub fn validate_header_for_epoch_migration<T: LayoutContract>(
    data: &[u8],
) -> Result<u32, ProgramError> {
    use crate::layout::{
        effective_schema_epoch, read_disc, read_layout_id, read_schema_epoch, read_version,
    };
    if data.len() < T::required_len() {
        return Err(ProgramError::AccountDataTooSmall);
    }
    if read_disc(data) != Some(T::DISC)
        || read_version(data) != Some(T::VERSION)
        || read_layout_id(data) != Some(&T::LAYOUT_ID)
    {
        return Err(ProgramError::InvalidAccountData);
    }
    let stored = read_schema_epoch(data).ok_or(ProgramError::InvalidAccountData)?;
    let effective = effective_schema_epoch(stored);
    if effective > T::SCHEMA_EPOCH {
        return Err(ProgramError::InvalidAccountData);
    }
    Ok(effective)
}

/// Typed multi-hop layout migration: probe-and-migrate each declared
/// hop in declaration order, so ONE call heals an account from ANY
/// declared starting version to the newest, the chain Quasar's
/// pairwise `Migration<From, To>` cannot express in one instruction.
///
/// ```ignore
/// // In place (every hop's target must already fit the allocation):
/// let hops = hopper::migrate_chain!(account, ctx.program_id(), {
///     VaultV1 => VaultV2: widen,
///     VaultV2 => VaultV3: add_flag,
/// });
///
/// // With ONE up-front grow to the largest hop target, rent topped up
/// // from `payer` (see `ensure_fits_with_rent`):
/// let hops = hopper::migrate_chain!(account, ctx.program_id(), payer = payer_view, {
///     VaultV1 => VaultV2: widen,
///     VaultV2 => VaultV3: add_flag,
/// });
/// ```
///
/// Each hop probes the header for a fully-valid `$old` identity and,
/// only then, runs [`migrate_layout`] (which re-verifies under its own
/// borrow and carries the owner+writable security gate). An account
/// already at a later hop's source version simply skips the earlier
/// hops; an account matching NO hop is left untouched and the chain
/// returns `0`, the caller's subsequent typed load rejects foreign
/// layouts exactly as before, so the chain is a healing pass, not a
/// validator. Evaluates to the number of hops applied (`u32`).
///
/// The expansion uses `?`, so the surrounding function must return
/// `Result<_, ProgramError>` (or a compatible error).
#[macro_export]
macro_rules! migrate_chain {
    ($account:expr, $program_id:expr, { $($old:ty => $new:ty : $f:expr),+ $(,)? }) => {{
        let __hopper_chain_view = $account;
        let __hopper_chain_pid = $program_id;
        let mut __hopper_chain_hops: u32 = 0;
        $(
            {
                let __hopper_chain_is_old = {
                    let __hopper_chain_data = __hopper_chain_view.try_borrow()?;
                    <$old as $crate::LayoutContract>::validate_header(
                        &__hopper_chain_data,
                    )
                    .is_ok()
                };
                if __hopper_chain_is_old {
                    $crate::migrate_layout::<$old, $new, _>(
                        __hopper_chain_view,
                        __hopper_chain_pid,
                        $f,
                    )?;
                    __hopper_chain_hops += 1;
                }
            }
        )+
        __hopper_chain_hops
    }};
    ($account:expr, $program_id:expr, payer = $payer:expr,
     { $($old:ty => $new:ty : $f:expr),+ $(,)? }) => {{
        let __hopper_chain_view = $account;
        let __hopper_chain_pid = $program_id;
        // ONE grow, sized to the LARGEST hop target (not merely the
        // final one: a middle hop may be the widest shape the chain
        // passes through).
        let mut __hopper_chain_max: usize = 0;
        $(
            {
                let __hopper_chain_len =
                    <$new as $crate::LayoutContract>::required_len();
                if __hopper_chain_len > __hopper_chain_max {
                    __hopper_chain_max = __hopper_chain_len;
                }
            }
        )+
        $crate::ensure_fits_with_rent(
            __hopper_chain_view,
            $payer,
            __hopper_chain_pid,
            __hopper_chain_max,
        )?;
        let mut __hopper_chain_hops: u32 = 0;
        $(
            {
                let __hopper_chain_is_old = {
                    let __hopper_chain_data = __hopper_chain_view.try_borrow()?;
                    <$old as $crate::LayoutContract>::validate_header(
                        &__hopper_chain_data,
                    )
                    .is_ok()
                };
                if __hopper_chain_is_old {
                    $crate::migrate_layout::<$old, $new, _>(
                        __hopper_chain_view,
                        __hopper_chain_pid,
                        $f,
                    )?;
                    __hopper_chain_hops += 1;
                }
            }
        )+
        __hopper_chain_hops
    }};
}

/// Locate the edge whose `from_epoch == epoch`. Returns an
/// `InvalidAccountData` error if the chain is discontinuous.
#[inline]
fn find_edge(edges: &[MigrationEdge], epoch: u32) -> Result<&MigrationEdge, ProgramError> {
    for edge in edges {
        if edge.from_epoch == epoch {
            if !edge.is_forward() {
                // A declared migration that doesn't advance the
                // epoch is malformed by construction.
                return Err(ProgramError::InvalidAccountData);
            }
            return Ok(edge);
        }
    }
    Err(ProgramError::InvalidAccountData)
}

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

    fn identity(_body: &mut [u8]) -> Result<(), ProgramError> {
        Ok(())
    }

    #[test]
    fn migration_edge_is_forward_detects_non_monotonic() {
        let forward = MigrationEdge {
            from_epoch: 1,
            to_epoch: 2,
            migrator: identity,
        };
        let backward = MigrationEdge {
            from_epoch: 3,
            to_epoch: 2,
            migrator: identity,
        };
        let same = MigrationEdge {
            from_epoch: 2,
            to_epoch: 2,
            migrator: identity,
        };
        assert!(forward.is_forward());
        assert!(!backward.is_forward());
        assert!(!same.is_forward());
    }

    #[test]
    fn find_edge_returns_matching_edge() {
        let edges = [
            MigrationEdge {
                from_epoch: 1,
                to_epoch: 2,
                migrator: identity,
            },
            MigrationEdge {
                from_epoch: 2,
                to_epoch: 3,
                migrator: identity,
            },
        ];
        let e1 = find_edge(&edges, 1).expect("edge exists");
        assert_eq!(e1.to_epoch, 2);
        let e2 = find_edge(&edges, 2).expect("edge exists");
        assert_eq!(e2.to_epoch, 3);
    }

    #[test]
    fn find_edge_errs_on_missing_epoch() {
        let edges = [MigrationEdge {
            from_epoch: 1,
            to_epoch: 2,
            migrator: identity,
        }];
        // No edge starts at epoch 5.
        assert!(find_edge(&edges, 5).is_err());
    }

    #[test]
    fn find_edge_rejects_non_forward_edge() {
        let edges = [MigrationEdge {
            from_epoch: 3,
            to_epoch: 2,
            migrator: identity,
        }];
        assert!(find_edge(&edges, 3).is_err());
    }

    mod overshoot {
        use super::*;
        use crate::layout::{HopperHeader, LayoutContract};
        use crate::zerocopy::AccountLayout;
        use hopper_native::{
            AccountView as NativeAccountView, Address as NativeAddress, RuntimeAccount,
            NOT_BORROWED,
        };

        #[repr(C)]
        #[derive(Clone, Copy)]
        struct EpochTwo {
            v: [u8; 8],
        }
        // SAFETY: repr(C), byte-array field, every bit pattern valid,
        // align 1, no padding.
        unsafe impl crate::Zeroable for EpochTwo {}
        // SAFETY: as above.
        unsafe impl crate::Pod for EpochTwo {}
        // SAFETY: test-local layout upholding the sealed overlay contract.
        unsafe impl crate::zerocopy::__sealed::HopperZeroCopySealed for EpochTwo {}
        impl crate::field_map::FieldMap for EpochTwo {
            const FIELDS: &'static [crate::field_map::FieldInfo] =
                &[crate::field_map::FieldInfo::new("v", HopperHeader::SIZE, 8)];
        }
        impl LayoutContract for EpochTwo {
            const DISC: u8 = 91;
            const VERSION: u8 = 1;
            const LAYOUT_ID: [u8; 8] = [0x91; 8];
            const SIZE: usize = HopperHeader::SIZE + core::mem::size_of::<Self>();
            const SCHEMA_EPOCH: u32 = 2;
        }
        impl LayoutMigration for EpochTwo {
            // Misdeclared chain: jumps 1 → 3 while SCHEMA_EPOCH is 2.
            const MIGRATIONS: &'static [MigrationEdge] = &[MigrationEdge {
                from_epoch: 1,
                to_epoch: 3,
                migrator: identity,
            }];
        }

        /// The epoch chain is gated identically to the typed migration:
        /// a foreign-owned account is refused before any edge runs.
        #[test]
        fn foreign_owned_account_is_refused_before_any_edge_runs() {
            let mut backing =
                std::vec![0u64; (RuntimeAccount::SIZE + HopperHeader::SIZE + 8).div_ceil(8)];
            let raw = backing.as_mut_ptr() as *mut RuntimeAccount;
            // SAFETY: backing is sized for the header plus data and
            // outlives the view.
            unsafe {
                raw.write(RuntimeAccount {
                    borrow_state: NOT_BORROWED,
                    is_signer: 0,
                    is_writable: 1,
                    executable: 0,
                    resize_delta: 0,
                    address: NativeAddress::new_from_array([5; 32]),
                    owner: NativeAddress::new_from_array([9; 32]),
                    lamports: 1,
                    data_len: (HopperHeader::SIZE + 8) as u64,
                });
            }
            // SAFETY: raw points at a fully initialized RuntimeAccount.
            let backend = unsafe { NativeAccountView::new_unchecked(raw) };
            let account = crate::AccountView::from_backend(backend);
            assert_eq!(
                apply_pending_migrations::<EpochTwo>(
                    &account,
                    &Address::new_from_array([6; 32]),
                    1
                ),
                Err(ProgramError::IncorrectProgramId)
            );
        }

        #[test]
        fn overshooting_edge_is_refused_before_writing() {
            let mut backing =
                std::vec![0u64; (RuntimeAccount::SIZE + HopperHeader::SIZE + 8).div_ceil(8)];
            let raw = backing.as_mut_ptr() as *mut RuntimeAccount;
            // SAFETY: backing is sized for the header plus data and
            // outlives the view.
            unsafe {
                raw.write(RuntimeAccount {
                    borrow_state: NOT_BORROWED,
                    is_signer: 0,
                    is_writable: 1,
                    executable: 0,
                    resize_delta: 0,
                    address: NativeAddress::new_from_array([5; 32]),
                    owner: NativeAddress::new_from_array([6; 32]),
                    lamports: 1,
                    data_len: (HopperHeader::SIZE + 8) as u64,
                });
            }
            // SAFETY: raw points at a fully initialized RuntimeAccount.
            let backend = unsafe { NativeAccountView::new_unchecked(raw) };
            let account = crate::AccountView::from_backend(backend);

            // The 1→3 edge would stamp the header past SCHEMA_EPOCH=2:
            // must refuse instead of silently marking the account as
            // from the future.
            assert_eq!(
                apply_pending_migrations::<EpochTwo>(
                    &account,
                    &Address::new_from_array([6; 32]),
                    1
                ),
                Err(ProgramError::InvalidAccountData)
            );
            let _ = <EpochTwo as AccountLayout>::SCHEMA_EPOCH;
        }
    }

    mod typed_layout_migration {
        use super::*;
        use crate::layout::{
            read_disc, read_flags, read_layout_id, read_schema_epoch, read_version, write_header,
            HopperHeader,
        };
        use hopper_native::{
            AccountView as NativeAccountView, Address as NativeAddress, RuntimeAccount,
            NOT_BORROWED,
        };

        const KIND: u8 = 77;

        /// Version 1: a narrow counter plus a legacy blob.
        #[repr(C)]
        #[derive(Clone, Copy)]
        struct VaultV1 {
            count: [u8; 4],
            legacy: [u8; 4],
        }
        // SAFETY: repr(C), byte-array fields, every bit pattern valid,
        // align 1, no padding.
        unsafe impl crate::Zeroable for VaultV1 {}
        // SAFETY: as above.
        unsafe impl crate::Pod for VaultV1 {}
        // SAFETY: test-local layout upholding the sealed overlay contract.
        unsafe impl crate::zerocopy::__sealed::HopperZeroCopySealed for VaultV1 {}
        impl crate::field_map::FieldMap for VaultV1 {
            const FIELDS: &'static [crate::field_map::FieldInfo] = &[
                crate::field_map::FieldInfo::new("count", HopperHeader::SIZE, 4),
                crate::field_map::FieldInfo::new("legacy", HopperHeader::SIZE + 4, 4),
            ];
        }
        impl LayoutContract for VaultV1 {
            const DISC: u8 = KIND;
            const VERSION: u8 = 1;
            const LAYOUT_ID: [u8; 8] = [0x11; 8];
            const SIZE: usize = HopperHeader::SIZE + core::mem::size_of::<Self>();
        }

        /// Version 2: the counter widens to u64, a flag appears, the
        /// legacy blob is gone. 12-byte body > V1's 8.
        #[repr(C)]
        #[derive(Clone, Copy)]
        struct VaultV2 {
            count: [u8; 8],
            flag: u8,
            pad: [u8; 3],
        }
        // SAFETY: repr(C), byte/byte-array fields, every bit pattern
        // valid, align 1, no padding.
        unsafe impl crate::Zeroable for VaultV2 {}
        // SAFETY: as above.
        unsafe impl crate::Pod for VaultV2 {}
        // SAFETY: test-local layout upholding the sealed overlay contract.
        unsafe impl crate::zerocopy::__sealed::HopperZeroCopySealed for VaultV2 {}
        impl crate::field_map::FieldMap for VaultV2 {
            const FIELDS: &'static [crate::field_map::FieldInfo] = &[
                crate::field_map::FieldInfo::new("count", HopperHeader::SIZE, 8),
                crate::field_map::FieldInfo::new("flag", HopperHeader::SIZE + 8, 1),
                crate::field_map::FieldInfo::new("pad", HopperHeader::SIZE + 9, 3),
            ];
        }
        impl LayoutContract for VaultV2 {
            const DISC: u8 = KIND;
            const VERSION: u8 = 2;
            const LAYOUT_ID: [u8; 8] = [0x22; 8];
            const SIZE: usize = HopperHeader::SIZE + core::mem::size_of::<Self>();
            // A non-default target epoch, to prove the stamp writes the
            // NEW layout's epoch rather than inheriting the old one.
            const SCHEMA_EPOCH: u32 = 5;
        }

        /// A different account kind entirely (wrong disc).
        #[repr(C)]
        #[derive(Clone, Copy)]
        struct OtherKind {
            v: [u8; 8],
        }
        // SAFETY: repr(C), byte-array field, every bit pattern valid,
        // align 1, no padding.
        unsafe impl crate::Zeroable for OtherKind {}
        // SAFETY: as above.
        unsafe impl crate::Pod for OtherKind {}
        // SAFETY: test-local layout upholding the sealed overlay contract.
        unsafe impl crate::zerocopy::__sealed::HopperZeroCopySealed for OtherKind {}
        impl crate::field_map::FieldMap for OtherKind {
            const FIELDS: &'static [crate::field_map::FieldInfo] =
                &[crate::field_map::FieldInfo::new("v", HopperHeader::SIZE, 8)];
        }
        impl LayoutContract for OtherKind {
            const DISC: u8 = KIND + 1;
            const VERSION: u8 = 3;
            const LAYOUT_ID: [u8; 8] = [0x33; 8];
            const SIZE: usize = HopperHeader::SIZE + core::mem::size_of::<Self>();
        }

        /// Same kind, same version as V1 (non-forward target).
        #[repr(C)]
        #[derive(Clone, Copy)]
        struct VaultV1b {
            count: [u8; 8],
        }
        // SAFETY: repr(C), byte-array field, every bit pattern valid,
        // align 1, no padding.
        unsafe impl crate::Zeroable for VaultV1b {}
        // SAFETY: as above.
        unsafe impl crate::Pod for VaultV1b {}
        // SAFETY: test-local layout upholding the sealed overlay contract.
        unsafe impl crate::zerocopy::__sealed::HopperZeroCopySealed for VaultV1b {}
        impl crate::field_map::FieldMap for VaultV1b {
            const FIELDS: &'static [crate::field_map::FieldInfo] =
                &[crate::field_map::FieldInfo::new(
                    "count",
                    HopperHeader::SIZE,
                    8,
                )];
        }
        impl LayoutContract for VaultV1b {
            const DISC: u8 = KIND;
            const VERSION: u8 = 1;
            const LAYOUT_ID: [u8; 8] = [0x44; 8];
            const SIZE: usize = HopperHeader::SIZE + core::mem::size_of::<Self>();
        }

        /// The executing program: the owner the fixtures stamp.
        fn pid() -> crate::address::Address {
            crate::address::Address::new_from_array([6; 32])
        }

        /// Raw account builder: `data_len` bytes plus the loader's
        /// `MAX_PERMITTED_DATA_INCREASE` growth headroom (so `resize`
        /// behaves exactly as on-chain), with the given balance, flags,
        /// and owner.
        fn raw_account(
            data_len: usize,
            lamports: u64,
            is_writable: bool,
            is_signer: bool,
            owner: [u8; 32],
        ) -> (std::vec::Vec<u64>, crate::AccountView<'static>) {
            use hopper_native::MAX_PERMITTED_DATA_INCREASE;
            let mut backing = std::vec![0u64; (RuntimeAccount::SIZE + data_len + MAX_PERMITTED_DATA_INCREASE).div_ceil(8)];
            let raw = backing.as_mut_ptr() as *mut RuntimeAccount;
            // SAFETY: backing is sized for the runtime header plus
            // `data_len` bytes plus the loader growth reserve, and
            // outlives the returned view (the caller holds the Vec).
            unsafe {
                raw.write(RuntimeAccount {
                    borrow_state: NOT_BORROWED,
                    is_signer: is_signer as u8,
                    is_writable: is_writable as u8,
                    executable: 0,
                    resize_delta: 0,
                    address: NativeAddress::new_from_array([5; 32]),
                    owner: NativeAddress::new_from_array(owner),
                    lamports,
                    data_len: data_len as u64,
                });
            }
            // SAFETY: raw points at a fully initialized RuntimeAccount
            // with its data region in the same allocation.
            let backend = unsafe { NativeAccountView::new_unchecked(raw) };
            (backing, crate::AccountView::from_backend(backend))
        }

        /// Stamp a valid VaultV1 (count = 7, legacy = [1,2,3,4], flags =
        /// 0x0102 to prove flag preservation) into an account.
        fn stamp_v1(account: &crate::AccountView<'_>) {
            let mut data = account.try_borrow_mut().expect("fixture borrow");
            write_header(
                &mut data,
                <VaultV1 as LayoutContract>::DISC,
                <VaultV1 as LayoutContract>::VERSION,
                &<VaultV1 as LayoutContract>::LAYOUT_ID,
            )
            .expect("fixture header");
            // Account-state flags a migration must carry across.
            data[2..4].copy_from_slice(&0x0102u16.to_le_bytes());
            data[16..20].copy_from_slice(&7u32.to_le_bytes());
            data[20..24].copy_from_slice(&[1, 2, 3, 4]);
        }

        /// Build a writable account of `data_len` bytes seeded as a
        /// valid VaultV1, owned by [`pid`].
        fn seeded_v1(data_len: usize) -> (std::vec::Vec<u64>, crate::AccountView<'static>) {
            let (backing, account) = raw_account(data_len, 1, true, false, [6; 32]);
            stamp_v1(&account);
            (backing, account)
        }

        fn widen(old: &VaultV1, new: &mut VaultV2) -> Result<(), ProgramError> {
            let count = u32::from_le_bytes(old.count) as u64;
            new.count = count.to_le_bytes();
            new.flag = 1;
            Ok(())
        }

        #[test]
        fn typed_migration_restamps_header_and_transforms_body() {
            // Allocation already big enough for V2 (the realloc-first
            // rule for larger shapes is exercised separately below).
            let (_b, account) = seeded_v1(HopperHeader::SIZE + 16);

            migrate_layout::<VaultV1, VaultV2, _>(&account, &pid(), widen).expect("migrates");

            let data = account.try_borrow().expect("read back");
            // Header: New identity, OLD flags.
            assert_eq!(read_disc(&data), Some(KIND));
            assert_eq!(read_version(&data), Some(2));
            assert_eq!(read_layout_id(&data), Some(&[0x22; 8]));
            assert_eq!(read_schema_epoch(&data), Some(5));
            assert_eq!(
                read_flags(&data),
                Some(0x0102),
                "flags are account state and must survive the re-stamp"
            );
            // Body: widened counter, set flag, and NOTHING left of the
            // legacy bytes (the zeroed span is the deterministic
            // default for unset fields).
            assert_eq!(&data[16..24], &7u64.to_le_bytes());
            assert_eq!(data[24], 1);
            assert_eq!(&data[25..28], &[0, 0, 0]);
        }

        #[test]
        fn migrated_account_refuses_a_second_migration() {
            let (_b, account) = seeded_v1(HopperHeader::SIZE + 16);
            migrate_layout::<VaultV1, VaultV2, _>(&account, &pid(), widen).expect("first migrates");
            // The header now reads V2: it is no longer a valid VaultV1,
            // so the identity check refuses, migrate exactly once.
            assert_eq!(
                migrate_layout::<VaultV1, VaultV2, _>(&account, &pid(), widen),
                Err(ProgramError::InvalidAccountData)
            );
        }

        #[test]
        fn transform_error_leaves_the_header_on_the_old_layout() {
            let (_b, account) = seeded_v1(HopperHeader::SIZE + 16);
            let result = migrate_layout::<VaultV1, VaultV2, _>(&account, &pid(), |_, _| {
                Err(ProgramError::Custom(9))
            });
            assert_eq!(result, Err(ProgramError::Custom(9)));
            let data = account.try_borrow().expect("read back");
            // The stamp is LAST: the header still says V1, so under
            // transaction-abort semantics the account is never observed
            // half-migrated (the body writes roll back with the tx).
            assert_eq!(read_version(&data), Some(1));
            assert_eq!(read_layout_id(&data), Some(&[0x11; 8]));
        }

        #[test]
        fn larger_new_shape_requires_realloc_first() {
            // Allocation fits V1 exactly (24 bytes); V2 needs 28.
            let (_b, account) = seeded_v1(HopperHeader::SIZE + 8);
            assert_eq!(
                migrate_layout::<VaultV1, VaultV2, _>(&account, &pid(), widen),
                Err(ProgramError::AccountDataTooSmall)
            );
            let data = account.try_borrow().expect("read back");
            assert_eq!(read_version(&data), Some(1), "refused before any write");
            assert_eq!(&data[16..20], &7u32.to_le_bytes());
        }

        #[test]
        fn cross_kind_migration_is_refused() {
            let (_b, account) = seeded_v1(HopperHeader::SIZE + 16);
            // OtherKind::DISC != VaultV1::DISC: repurposing the account
            // kind is not a migration.
            assert_eq!(
                migrate_layout::<VaultV1, OtherKind, _>(&account, &pid(), |_, _| Ok(())),
                Err(ProgramError::InvalidAccountData)
            );
        }

        #[test]
        fn non_forward_version_is_refused() {
            let (_b, account) = seeded_v1(HopperHeader::SIZE + 16);
            // Same version (1 → 1): not forward, refused before any
            // borrow or write.
            assert_eq!(
                migrate_layout::<VaultV1, VaultV1b, _>(&account, &pid(), |_, _| Ok(())),
                Err(ProgramError::InvalidAccountData)
            );
            // And backward (2 → 1) likewise.
            assert_eq!(
                migrate_layout::<VaultV2, VaultV1b, _>(&account, &pid(), |_, _| Ok(())),
                Err(ProgramError::InvalidAccountData)
            );
        }

        /// The crank-before-validators fix: a foreign-owned account whose
        /// bytes parse as a perfect Old header must be refused BEFORE the
        /// user transform reads a byte, the macro crank runs at bind
        /// ahead of the per-field validators, so this gate is the first
        /// authority to look at the account.
        #[test]
        fn foreign_owned_account_is_refused_before_the_transform_runs() {
            let (_b, account) = raw_account(HopperHeader::SIZE + 16, 1, true, false, [9; 32]);
            stamp_v1(&account);
            let mut transform_ran = false;
            let result = migrate_layout::<VaultV1, VaultV2, _>(&account, &pid(), |old, new| {
                transform_ran = true;
                widen(old, new)
            });
            assert_eq!(result, Err(ProgramError::IncorrectProgramId));
            assert!(
                !transform_ran,
                "the user transform must never run over another program's bytes"
            );
            let data = account.try_borrow().expect("read back");
            assert_eq!(read_version(&data), Some(1), "nothing was written");
        }

        /// Same gate, writability dimension.
        #[test]
        fn non_writable_account_is_refused_before_the_transform_runs() {
            let (_b, account) = raw_account(HopperHeader::SIZE + 16, 1, false, false, [6; 32]);
            stamp_v1(&account);
            assert_eq!(
                migrate_layout::<VaultV1, VaultV2, _>(&account, &pid(), widen),
                Err(ProgramError::InvalidAccountData)
            );
        }

        /// The resizing variant grows the allocation to fit New and tops
        /// up the rent-exempt minimum from the payer, exactly the
        /// deficit, nothing more.
        #[test]
        fn resizing_migration_grows_and_tops_up_exactly_the_deficit() {
            use crate::rent::minimum_balance_live;
            // Allocation fits V1 exactly (24 B); V2 needs 28. The account
            // holds 1 lamport, far below the grown minimum.
            let (_b, account) = raw_account(HopperHeader::SIZE + 8, 1, true, false, [6; 32]);
            stamp_v1(&account);
            let payer_start = 1_000_000_000u64;
            let (_pb, payer) = raw_account(0, payer_start, true, true, [0; 32]);

            migrate_layout_resizing::<VaultV1, VaultV2, _>(&account, &payer, &pid(), false, widen)
                .expect("grow + migrate");

            let min_new = minimum_balance_live(HopperHeader::SIZE + 12).expect("host rent");
            assert_eq!(account.data_len(), HopperHeader::SIZE + 12);
            assert_eq!(account.lamports(), min_new, "topped up to the minimum");
            assert_eq!(
                payer.lamports(),
                payer_start - (min_new - 1),
                "payer debited exactly the deficit"
            );
            let data = account.try_borrow().expect("read back");
            assert_eq!(read_version(&data), Some(2));
            assert_eq!(&data[16..24], &7u64.to_le_bytes());
        }

        /// A well-funded account grows without touching (or requiring a
        /// signature from) the payer at all.
        #[test]
        fn resizing_migration_needs_no_payer_when_already_funded() {
            use crate::rent::minimum_balance_live;
            let funded = minimum_balance_live(HopperHeader::SIZE + 12).expect("host rent") + 777;
            let (_b, account) = raw_account(HopperHeader::SIZE + 8, funded, true, false, [6; 32]);
            stamp_v1(&account);
            // The payer is NOT a signer and NOT writable: must not matter.
            let (_pb, payer) = raw_account(0, 5, false, false, [0; 32]);

            migrate_layout_resizing::<VaultV1, VaultV2, _>(&account, &payer, &pid(), false, widen)
                .expect("grow without payer");
            assert_eq!(account.lamports(), funded, "balance untouched");
            assert_eq!(payer.lamports(), 5, "payer untouched");
        }

        /// Version 3: narrows back to a 4-byte body, SMALLER than V2,
        /// to exercise the shrink path.
        #[repr(C)]
        #[derive(Clone, Copy)]
        struct VaultV3 {
            count: [u8; 4],
        }
        // SAFETY: repr(C), byte-array field, every bit pattern valid,
        // align 1, no padding.
        unsafe impl crate::Zeroable for VaultV3 {}
        // SAFETY: as above.
        unsafe impl crate::Pod for VaultV3 {}
        // SAFETY: test-local layout upholding the sealed overlay contract.
        unsafe impl crate::zerocopy::__sealed::HopperZeroCopySealed for VaultV3 {}
        impl crate::field_map::FieldMap for VaultV3 {
            const FIELDS: &'static [crate::field_map::FieldInfo] =
                &[crate::field_map::FieldInfo::new(
                    "count",
                    HopperHeader::SIZE,
                    4,
                )];
        }
        impl LayoutContract for VaultV3 {
            const DISC: u8 = KIND;
            const VERSION: u8 = 3;
            const LAYOUT_ID: [u8; 8] = [0x55; 8];
            const SIZE: usize = HopperHeader::SIZE + core::mem::size_of::<Self>();
        }

        fn narrow(old: &VaultV2, new: &mut VaultV3) -> Result<(), ProgramError> {
            let count = u64::from_le_bytes(old.count) as u32;
            new.count = count.to_le_bytes();
            Ok(())
        }

        /// Migrate a V1 fixture up to V2 so shrink tests have a V2 start.
        fn seeded_v2(lamports: u64) -> (std::vec::Vec<u64>, crate::AccountView<'static>) {
            let (backing, account) = raw_account(HopperHeader::SIZE + 12, 1, true, false, [6; 32]);
            stamp_v1(&account);
            migrate_layout::<VaultV1, VaultV2, _>(&account, &pid(), widen).expect("to V2");
            account.try_set_lamports(lamports).expect("fund fixture");
            (backing, account)
        }

        /// THE anti-drain proof (Quasar `account.rs:117-125` normalizes
        /// the balance to rent-min and pays the whole difference to the
        /// payer, deposits leave with it). Hopper's shrink refunds
        /// EXACTLY the freed rent delta; a surplus deposit riding on the
        /// account stays on the account.
        #[test]
        fn shrink_refunds_only_the_rent_delta_and_never_touches_deposits() {
            use crate::rent::minimum_balance_live;
            let min_old = minimum_balance_live(HopperHeader::SIZE + 12).expect("host rent");
            let min_new = minimum_balance_live(HopperHeader::SIZE + 4).expect("host rent");
            let deposit = 500_000u64;
            let (_b, account) = seeded_v2(min_old + deposit);
            let (_pb, payer) = raw_account(0, 10, true, false, [0; 32]);

            migrate_layout_resizing::<VaultV2, VaultV3, _>(&account, &payer, &pid(), true, narrow)
                .expect("migrate + shrink");

            assert_eq!(account.data_len(), HopperHeader::SIZE + 4);
            assert_eq!(
                account.lamports(),
                min_new + deposit,
                "the deposit MUST stay on the account, only the freed \
                 rent requirement is refunded"
            );
            assert_eq!(
                payer.lamports(),
                10 + (min_old - min_new),
                "payer receives exactly the rent delta"
            );
        }

        /// One `migrate_chain!` call heals an account from ANY declared
        /// starting version: V1 walks both hops, V2 only the second,
        /// V3 none, and a foreign layout is untouched with 0 hops.
        #[test]
        fn migrate_chain_heals_from_any_starting_version() {
            fn run_chain(account: &crate::AccountView<'_>) -> Result<u32, ProgramError> {
                Ok(crate::migrate_chain!(account, &pid(), {
                    VaultV1 => VaultV2: widen,
                    VaultV2 => VaultV3: narrow,
                }))
            }

            // V1 start: both hops fire; the value threads through both
            // transforms (7 widened, then narrowed back to u32).
            let (_b, v1) = seeded_v1(HopperHeader::SIZE + 16);
            assert_eq!(run_chain(&v1), Ok(2));
            {
                let data = v1.try_borrow().unwrap();
                assert_eq!(read_version(&data), Some(3));
                assert_eq!(&data[16..20], &7u32.to_le_bytes());
            }

            // V2 start: only the second hop fires.
            let (_b2, v2) = seeded_v2(1);
            assert_eq!(run_chain(&v2), Ok(1));
            assert_eq!(read_version(&v2.try_borrow().unwrap()), Some(3));

            // Already-V3: zero hops, byte-identical.
            assert_eq!(run_chain(&v2), Ok(0));

            // Foreign layout: untouched, zero hops (the chain is a
            // healing pass; the caller's typed load still rejects it).
            let (_b3, other) = raw_account(HopperHeader::SIZE + 16, 1, true, false, [6; 32]);
            {
                let mut data = other.try_borrow_mut().unwrap();
                write_header(
                    &mut data,
                    <OtherKind as LayoutContract>::DISC,
                    <OtherKind as LayoutContract>::VERSION,
                    &<OtherKind as LayoutContract>::LAYOUT_ID,
                )
                .unwrap();
            }
            assert_eq!(run_chain(&other), Ok(0));
            assert_eq!(
                read_disc(&other.try_borrow().unwrap()),
                Some(<OtherKind as LayoutContract>::DISC)
            );
        }

        /// The resizing chain grows ONCE, to the LARGEST hop target (the
        /// middle V2 shape here, 28 B; not the smaller final V3), with
        /// the rent deficit debited from the payer.
        #[test]
        fn migrate_chain_with_payer_grows_once_to_the_largest_hop() {
            fn run_chain<'a>(
                account: &crate::AccountView<'a>,
                payer: &crate::AccountView<'a>,
            ) -> Result<u32, ProgramError> {
                Ok(crate::migrate_chain!(account, &pid(), payer = payer, {
                    VaultV1 => VaultV2: widen,
                    VaultV2 => VaultV3: narrow,
                }))
            }

            // Sized for V1 only (24 B) with 1 lamport: the V2 hop (28 B)
            // cannot run without the up-front grow + top-up.
            let (_b, account) = raw_account(HopperHeader::SIZE + 8, 1, true, false, [6; 32]);
            stamp_v1(&account);
            let payer_start = 1_000_000_000u64;
            let (_pb, payer) = raw_account(0, payer_start, true, true, [0; 32]);

            assert_eq!(run_chain(&account, &payer), Ok(2));
            // Grown to the LARGEST hop (V2's 28), never shrunk (the
            // chain has no shrink phase, that is `resize = fit`'s job).
            assert_eq!(account.data_len(), HopperHeader::SIZE + 12);
            let data = account.try_borrow().unwrap();
            assert_eq!(read_version(&data), Some(3));
            assert_eq!(&data[16..20], &7u32.to_le_bytes());
            assert!(payer.lamports() < payer_start, "payer funded the grow");
        }

        /// The shared acceptance predicate behind `epoch_migrate`:
        /// identity must match exactly, the epoch may lag but never
        /// lead, and pre-epoch zero headers read as epoch 1.
        #[test]
        fn epoch_migration_header_predicate_accepts_lag_refuses_lead() {
            use crate::layout::write_header_with_epoch;

            #[repr(C)]
            #[derive(Clone, Copy)]
            struct EpochThree {
                v: [u8; 8],
            }
            // SAFETY: repr(C), byte-array field, every bit pattern
            // valid, align 1, no padding.
            unsafe impl crate::Zeroable for EpochThree {}
            // SAFETY: as above.
            unsafe impl crate::Pod for EpochThree {}
            // SAFETY: test-local layout upholding the sealed overlay
            // contract.
            unsafe impl crate::zerocopy::__sealed::HopperZeroCopySealed for EpochThree {}
            impl crate::field_map::FieldMap for EpochThree {
                const FIELDS: &'static [crate::field_map::FieldInfo] =
                    &[crate::field_map::FieldInfo::new("v", HopperHeader::SIZE, 8)];
            }
            impl LayoutContract for EpochThree {
                const DISC: u8 = 93;
                const VERSION: u8 = 1;
                const LAYOUT_ID: [u8; 8] = [0x93; 8];
                const SIZE: usize = HopperHeader::SIZE + 8;
                const SCHEMA_EPOCH: u32 = 3;
            }

            let mut data = std::vec![0u8; HopperHeader::SIZE + 8];
            // Stale epoch (1): accepted, effective epoch returned.
            write_header_with_epoch(&mut data, 93, 1, &[0x93; 8], 1).unwrap();
            assert_eq!(
                validate_header_for_epoch_migration::<EpochThree>(&data),
                Ok(1)
            );
            // Current epoch (3): accepted (the crank then no-ops).
            write_header_with_epoch(&mut data, 93, 1, &[0x93; 8], 3).unwrap();
            assert_eq!(
                validate_header_for_epoch_migration::<EpochThree>(&data),
                Ok(3)
            );
            // Future epoch (4): refused, never "migrated" down.
            write_header_with_epoch(&mut data, 93, 1, &[0x93; 8], 4).unwrap();
            assert!(validate_header_for_epoch_migration::<EpochThree>(&data).is_err());
            // Pre-epoch zero header reads as effective epoch 1.
            write_header_with_epoch(&mut data, 93, 1, &[0x93; 8], 0).unwrap();
            assert_eq!(
                validate_header_for_epoch_migration::<EpochThree>(&data),
                Ok(1)
            );
            // Identity mismatches refuse regardless of epoch.
            write_header_with_epoch(&mut data, 94, 1, &[0x93; 8], 1).unwrap();
            assert!(validate_header_for_epoch_migration::<EpochThree>(&data).is_err());
            write_header_with_epoch(&mut data, 93, 2, &[0x93; 8], 1).unwrap();
            assert!(validate_header_for_epoch_migration::<EpochThree>(&data).is_err());
            write_header_with_epoch(&mut data, 93, 1, &[0x44; 8], 1).unwrap();
            assert!(validate_header_for_epoch_migration::<EpochThree>(&data).is_err());
            // Undersized allocation refused.
            let tiny = std::vec![0u8; HopperHeader::SIZE + 4];
            assert!(validate_header_for_epoch_migration::<EpochThree>(&tiny).is_err());
        }

        /// Shrink is opt-in: with `shrink_to_fit = false` the allocation
        /// keeps its size and no lamport moves (dynamic-tail layouts
        /// depend on this default, shrinking to `required_len` would
        /// truncate their tail).
        #[test]
        fn shrink_is_opt_in_and_off_by_default_in_the_macro() {
            use crate::rent::minimum_balance_live;
            let min_old = minimum_balance_live(HopperHeader::SIZE + 12).expect("host rent");
            let (_b, account) = seeded_v2(min_old);
            let (_pb, payer) = raw_account(0, 10, true, false, [0; 32]);

            migrate_layout_resizing::<VaultV2, VaultV3, _>(&account, &payer, &pid(), false, narrow)
                .expect("migrate without shrink");
            assert_eq!(account.data_len(), HopperHeader::SIZE + 12, "size kept");
            assert_eq!(account.lamports(), min_old, "no refund");
            assert_eq!(payer.lamports(), 10);
        }
    }
}