roshi-interface 0.10.1

use solana_instruction::AccountMeta;
use solana_pubkey::Pubkey;
use solana_sha256_hasher::hash;
use wincode::{SchemaRead, SchemaWrite};

/// Maximum number of authorization predicates stored on one Action account.
///
/// Each stored op is four bytes, so 32 ops reserve 128 bytes inside the fixed
/// Action account layout. More complex workflows should split across multiple
/// authorized actions rather than growing this account dynamically.
pub const MAX_ACTION_OPS: usize = 32;

#[derive(Clone, Copy, Debug, Eq, PartialEq, codama_macros::CodamaType, SchemaWrite, SchemaRead)]
#[wincode(tag_encoding = "u8")]
pub enum ActionScope {
    #[wincode(tag = 0)]
    Manager,
    #[wincode(tag = 1)]
    Swap,
    #[wincode(tag = 2)]
    AtomicRedeem,
    /// Strategist-relayed SPL `approve` that grants a one-shot delegate on a
    /// sub-account custody account, bound at relay so a forced `flash_repay`
    /// consumes it exactly and clears it. Relayed through `manage`/`manage_batch`
    /// like `Manager`, but its approved account is exempt from the standard
    /// custody reverify in favor of a bounded-delegate check.
    #[wincode(tag = 3)]
    FlashApprove,
}

#[derive(Clone, Copy, Debug, Eq, PartialEq, codama_macros::CodamaType, SchemaWrite, SchemaRead)]
#[wincode(tag_encoding = "u8")]
pub enum Op {
    #[wincode(tag = 0)]
    Noop,
    #[wincode(tag = 1)]
    IngestInstruction { offset: u16, len: u8 },
    #[wincode(tag = 2)]
    IngestAccount { index: u8 },
    #[wincode(tag = 3)]
    IngestInstructionDataSize,
    /// Commit a top-level sibling instruction's program id plus a leading data
    /// slice (its selector). `relative_index` locates the sibling relative to
    /// the executing top-level instruction (the `manage`/`manage_batch` call);
    /// the sibling's program id is always folded so a discriminator cannot be
    /// forged under a different program. Reaches the instructions sysvar at
    /// relay; see [`compute_action_hash_from_metas`].
    #[wincode(tag = 4)]
    IngestSiblingInstruction {
        relative_index: i8,
        offset: u8,
        len: u8,
    },
    /// Commit a top-level sibling instruction's account pubkey at `index`,
    /// located by `relative_index` as in [`Op::IngestSiblingInstruction`].
    #[wincode(tag = 5)]
    IngestSiblingAccount { relative_index: i8, index: u8 },
}

#[derive(Clone, Copy, Debug, Eq, PartialEq, codama_macros::CodamaType, SchemaWrite, SchemaRead)]
#[repr(C)]
pub struct StoredOp {
    pub kind: u8,
    pub arg0: u8,
    pub arg1: u8,
    pub arg2: u8,
}

impl StoredOp {
    pub const fn noop() -> Self {
        Self {
            kind: 0,
            arg0: 0,
            arg1: 0,
            arg2: 0,
        }
    }

    fn try_to_op(self) -> Result<Op, ActionHashError> {
        let op = match self.kind {
            0 if self.arg0 == 0 && self.arg1 == 0 && self.arg2 == 0 => Op::Noop,
            1 => Op::IngestInstruction {
                offset: u16::from_le_bytes([self.arg1, self.arg2]),
                len: self.arg0,
            },
            2 if self.arg1 == 0 && self.arg2 == 0 => Op::IngestAccount { index: self.arg0 },
            3 if self.arg0 == 0 && self.arg1 == 0 && self.arg2 == 0 => {
                Op::IngestInstructionDataSize
            }
            4 => Op::IngestSiblingInstruction {
                relative_index: self.arg0 as i8,
                offset: self.arg1,
                len: self.arg2,
            },
            5 if self.arg2 == 0 => Op::IngestSiblingAccount {
                relative_index: self.arg0 as i8,
                index: self.arg1,
            },
            _ => return Err(ActionHashError::InvalidOp),
        };

        Ok(op)
    }
}

impl Default for StoredOp {
    fn default() -> Self {
        Self::noop()
    }
}

impl From<Op> for StoredOp {
    fn from(op: Op) -> Self {
        match op {
            Op::Noop => Self::noop(),
            Op::IngestInstruction { offset, len } => {
                let [arg1, arg2] = offset.to_le_bytes();
                Self {
                    kind: 1,
                    arg0: len,
                    arg1,
                    arg2,
                }
            }
            Op::IngestAccount { index } => Self {
                kind: 2,
                arg0: index,
                arg1: 0,
                arg2: 0,
            },
            Op::IngestInstructionDataSize => Self {
                kind: 3,
                arg0: 0,
                arg1: 0,
                arg2: 0,
            },
            Op::IngestSiblingInstruction {
                relative_index,
                offset,
                len,
            } => Self {
                kind: 4,
                arg0: relative_index as u8,
                arg1: offset,
                arg2: len,
            },
            Op::IngestSiblingAccount {
                relative_index,
                index,
            } => Self {
                kind: 5,
                arg0: relative_index as u8,
                arg1: index,
                arg2: 0,
            },
        }
    }
}

#[derive(Clone, Copy, Debug, Eq, PartialEq, codama_macros::CodamaType, SchemaWrite, SchemaRead)]
#[repr(C)]
pub struct Ops {
    pub ops: [StoredOp; 32],
    pub ops_len: u8,
}

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

    // The single-buffer preimage must hash bit-for-bit identically to the old
    // `Vec<Vec<u8>>` + `hashv(&refs)` approach (#24). Reproduce that reference
    // independently here, exercising every op arm, so any divergence is caught.
    #[test]
    fn streamed_hash_matches_chunked_reference() {
        let program_id = Pubkey::new_unique();
        let ix_data = (0u8..40).collect::<Vec<_>>();
        let account = AccountMeta::new(Pubkey::new_unique(), true);
        let sibling_accounts = [Pubkey::new_unique(), Pubkey::new_unique()];
        let sibling_data = (10u8..30).collect::<Vec<_>>();
        let siblings = [ResolvedSibling {
            relative_index: -1,
            program_id: Pubkey::new_unique(),
            data: &sibling_data,
            accounts: &sibling_accounts,
        }];
        let ops = Ops::new([
            Op::Noop,
            Op::IngestInstruction { offset: 5, len: 7 },
            Op::IngestAccount { index: 0 },
            Op::IngestInstructionDataSize,
            Op::IngestSiblingInstruction {
                relative_index: -1,
                offset: 2,
                len: 8,
            },
            Op::IngestSiblingAccount {
                relative_index: -1,
                index: 1,
            },
        ])
        .unwrap();

        // Reference: the pre-#24 chunked algorithm, byte-for-byte.
        let mut chunks: Vec<Vec<u8>> = vec![program_id.to_bytes().to_vec()];
        chunks.push(vec![0]);
        chunks.push(vec![1]);
        chunks.push(5u16.to_le_bytes().to_vec());
        chunks.push(vec![7]);
        chunks.push(ix_data[5..12].to_vec());
        chunks.push(vec![2]);
        chunks.push(vec![0]);
        chunks.push(account.pubkey.to_bytes().to_vec());
        chunks.push(vec![1]);
        chunks.push(vec![1]);
        chunks.push(vec![3]);
        chunks.push((ix_data.len() as u32).to_le_bytes().to_vec());
        chunks.push(vec![4]);
        chunks.push(vec![(-1i8) as u8]);
        chunks.push(siblings[0].program_id.to_bytes().to_vec());
        chunks.push(vec![2]);
        chunks.push(vec![8]);
        chunks.push(sibling_data[2..10].to_vec());
        chunks.push(vec![5]);
        chunks.push(vec![(-1i8) as u8]);
        chunks.push(vec![1]);
        chunks.push(sibling_accounts[1].to_bytes().to_vec());
        let refs = chunks.iter().map(Vec::as_slice).collect::<Vec<_>>();
        let reference = solana_sha256_hasher::hashv(&refs).to_bytes();

        let streamed =
            compute_action_hash_from_metas(&program_id, &ops, &[account], &ix_data, &siblings)
                .unwrap();

        assert_eq!(streamed, reference);
    }

    #[test]
    fn stored_ops_are_compact() {
        assert_eq!(core::mem::size_of::<StoredOp>(), 4);
        assert_eq!(core::mem::size_of::<Ops>(), MAX_ACTION_OPS * 4 + 1);
        assert_eq!(serialize(&StoredOp::noop()).unwrap().len(), 4);
        assert_eq!(
            serialize(&Ops::empty()).unwrap().len(),
            MAX_ACTION_OPS * 4 + 1
        );
    }

    #[test]
    fn ops_new_enforces_capacity() {
        let ops = vec![Op::Noop; MAX_ACTION_OPS + 1];

        assert_eq!(Ops::new(ops), Err(ActionHashError::TooManyOps));
    }

    #[test]
    fn ops_round_trip_logical_ops() {
        let ops = Ops::new([
            Op::Noop,
            Op::IngestInstruction {
                offset: 513,
                len: 7,
            },
            Op::IngestAccount { index: 9 },
            Op::IngestInstructionDataSize,
            Op::IngestSiblingInstruction {
                relative_index: -1,
                offset: 0,
                len: 8,
            },
            Op::IngestSiblingAccount {
                relative_index: 2,
                index: 5,
            },
        ])
        .unwrap();
        let decoded = ops.iter().unwrap().collect::<Result<Vec<_>, _>>().unwrap();

        assert_eq!(
            decoded,
            vec![
                Op::Noop,
                Op::IngestInstruction {
                    offset: 513,
                    len: 7,
                },
                Op::IngestAccount { index: 9 },
                Op::IngestInstructionDataSize,
                Op::IngestSiblingInstruction {
                    relative_index: -1,
                    offset: 0,
                    len: 8,
                },
                Op::IngestSiblingAccount {
                    relative_index: 2,
                    index: 5,
                },
            ]
        );
    }

    #[test]
    fn hash_rejects_corrupt_stored_ops() {
        let program_id = Pubkey::new_unique();
        let account_metas = [];
        let ix_data = [];

        let mut too_many = Ops::empty();
        too_many.ops_len = u8::try_from(MAX_ACTION_OPS + 1).unwrap();
        assert_eq!(
            compute_action_hash_from_metas(&program_id, &too_many, &account_metas, &ix_data, &[]),
            Err(ActionHashError::TooManyOps)
        );

        let mut invalid_kind = Ops::empty();
        invalid_kind.ops[0] = StoredOp {
            kind: 255,
            arg0: 0,
            arg1: 0,
            arg2: 0,
        };
        invalid_kind.ops_len = 1;
        assert_eq!(
            compute_action_hash_from_metas(
                &program_id,
                &invalid_kind,
                &account_metas,
                &ix_data,
                &[]
            ),
            Err(ActionHashError::InvalidOp)
        );

        let mut non_canonical = Ops::empty();
        non_canonical.ops[0] = StoredOp {
            kind: 0,
            arg0: 1,
            arg1: 0,
            arg2: 0,
        };
        non_canonical.ops_len = 1;
        assert_eq!(
            compute_action_hash_from_metas(
                &program_id,
                &non_canonical,
                &account_metas,
                &ix_data,
                &[]
            ),
            Err(ActionHashError::InvalidOp)
        );
    }
}

impl Ops {
    pub const fn empty() -> Self {
        Self {
            ops: [StoredOp::noop(); MAX_ACTION_OPS],
            ops_len: 0,
        }
    }

    pub fn new(ops: impl IntoIterator<Item = Op>) -> Result<Self, ActionHashError> {
        let mut stored_ops = Self::empty();

        for (index, op) in ops.into_iter().enumerate() {
            if index >= MAX_ACTION_OPS {
                return Err(ActionHashError::TooManyOps);
            }

            stored_ops.ops[index] = StoredOp::from(op);
            stored_ops.ops_len =
                u8::try_from(index + 1).map_err(|_| ActionHashError::InvalidInstructionData)?;
        }

        Ok(stored_ops)
    }

    pub fn len(&self) -> Result<usize, ActionHashError> {
        let len = usize::from(self.ops_len);
        if len > MAX_ACTION_OPS {
            return Err(ActionHashError::TooManyOps);
        }

        Ok(len)
    }

    pub fn is_empty(&self) -> Result<bool, ActionHashError> {
        Ok(self.len()? == 0)
    }

    pub fn iter(
        &self,
    ) -> Result<impl Iterator<Item = Result<Op, ActionHashError>> + '_, ActionHashError> {
        let len = self.len()?;
        Ok(self.ops[..len].iter().copied().map(StoredOp::try_to_op))
    }
}

impl Default for Ops {
    fn default() -> Self {
        Self::empty()
    }
}

#[derive(Clone, Copy, Debug, Eq, PartialEq)]
pub enum ActionHashError {
    InvalidOp,
    TooManyOps,
    InstructionSliceOutOfBounds,
    AccountIndexOutOfBounds,
    InvalidInstructionData,
    MissingSibling,
}

/// A top-level sibling instruction already read from the transaction, supplied
/// to the hash so [`Op::IngestSiblingInstruction`]/[`Op::IngestSiblingAccount`]
/// can fold its observed fields. On-chain the relay reads these from the
/// instructions sysvar; off-chain the admin supplies the intended sibling when
/// precomputing the authorized hash. Hashing stays a pure function of its
/// inputs — it never touches the sysvar itself.
pub struct ResolvedSibling<'a> {
    pub relative_index: i8,
    pub program_id: Pubkey,
    pub data: &'a [u8],
    pub accounts: &'a [Pubkey],
}

pub fn compute_action_hash_from_metas(
    program_id: &Pubkey,
    ops: &Ops,
    accounts: &[AccountMeta],
    ix_data: &[u8],
    siblings: &[ResolvedSibling],
) -> Result<[u8; 32], ActionHashError> {
    // Build the hash preimage in one pre-sized buffer and hash it in a single
    // syscall, rather than collecting a `Vec<Vec<u8>>` of pieces. The on-chain
    // bump allocator never frees within an instruction, so the old per-piece
    // allocations accumulated across a large `manage_batch` and crossed the
    // default heap (#24). The bytes — and therefore the hash — are identical:
    // `hashv` already concatenates these same pieces. (An incremental hasher is
    // native-only in `solana-sha256-hasher`, so streaming isn't an option here.)
    let mut preimage = Vec::with_capacity(preimage_len(ops)?);
    preimage.extend_from_slice(&program_id.to_bytes());

    for op in ops.iter()? {
        match op? {
            Op::Noop => preimage.push(0),
            Op::IngestInstruction { offset, len } => {
                let slice = instruction_slice(ix_data, usize::from(offset), len)?;
                preimage.push(1);
                preimage.extend_from_slice(&offset.to_le_bytes());
                preimage.push(len);
                preimage.extend_from_slice(slice);
            }
            Op::IngestAccount { index } => {
                let account = accounts
                    .get(usize::from(index))
                    .ok_or(ActionHashError::AccountIndexOutOfBounds)?;

                preimage.push(2);
                preimage.push(index);
                preimage.extend_from_slice(&account.pubkey.to_bytes());
                preimage.push(u8::from(account.is_signer));
                preimage.push(u8::from(account.is_writable));
            }
            Op::IngestInstructionDataSize => {
                let data_len = u32::try_from(ix_data.len())
                    .map_err(|_| ActionHashError::InvalidInstructionData)?;

                preimage.push(3);
                preimage.extend_from_slice(&data_len.to_le_bytes());
            }
            Op::IngestSiblingInstruction {
                relative_index,
                offset,
                len,
            } => {
                let sibling = resolve_sibling(siblings, relative_index)?;
                let slice = instruction_slice(sibling.data, usize::from(offset), len)?;

                preimage.push(4);
                preimage.push(relative_index as u8);
                preimage.extend_from_slice(&sibling.program_id.to_bytes());
                preimage.push(offset);
                preimage.push(len);
                preimage.extend_from_slice(slice);
            }
            Op::IngestSiblingAccount {
                relative_index,
                index,
            } => {
                let sibling = resolve_sibling(siblings, relative_index)?;
                let account = sibling
                    .accounts
                    .get(usize::from(index))
                    .ok_or(ActionHashError::AccountIndexOutOfBounds)?;

                preimage.push(5);
                preimage.push(relative_index as u8);
                preimage.push(index);
                preimage.extend_from_slice(&account.to_bytes());
            }
        }
    }

    Ok(hash(&preimage).to_bytes())
}

/// Exact byte length of the hash preimage for `ops`, so the buffer is allocated
/// once with no reallocation (each realloc would leak under the bump allocator).
/// Mirrors the per-op layout in [`compute_action_hash_from_metas`]; slice bounds
/// are validated there, so this uses the committed `len` as-is.
fn preimage_len(ops: &Ops) -> Result<usize, ActionHashError> {
    let mut len = 32; // program id
    for op in ops.iter()? {
        len += match op? {
            Op::Noop => 1,
            Op::IngestInstruction { len, .. } => 4 + usize::from(len),
            Op::IngestAccount { .. } => 36,
            Op::IngestInstructionDataSize => 5,
            Op::IngestSiblingInstruction { len, .. } => 36 + usize::from(len),
            Op::IngestSiblingAccount { .. } => 35,
        };
    }

    Ok(len)
}

fn instruction_slice(data: &[u8], offset: usize, len: u8) -> Result<&[u8], ActionHashError> {
    let end = offset
        .checked_add(usize::from(len))
        .ok_or(ActionHashError::InstructionSliceOutOfBounds)?;
    data.get(offset..end)
        .ok_or(ActionHashError::InstructionSliceOutOfBounds)
}

fn resolve_sibling<'a, 'b>(
    siblings: &'a [ResolvedSibling<'b>],
    relative_index: i8,
) -> Result<&'a ResolvedSibling<'b>, ActionHashError> {
    siblings
        .iter()
        .find(|sibling| sibling.relative_index == relative_index)
        .ok_or(ActionHashError::MissingSibling)
}