ton_core 0.0.15

use crate::bail_ton_core_data;
use crate::cell::TonCell;
use crate::cell::ton_cell::{CellBitsReader, CellBorders};
use crate::cell::ton_cell_num::TonCellNum;
use crate::errors::TonCoreError;
use crate::errors::TonCoreResult;
use bitstream_io::Integer;
use bitstream_io::{BigEndian, BitRead, BitReader};
use std::any::type_name;
use std::io::{Cursor, SeekFrom};

#[derive(Debug, Clone)]
pub struct CellParser<'a> {
    cell: &'a TonCell,
    data_reader: CellBitsReader<'a>,
    next_ref_pos: usize,
}

impl<'a> CellParser<'a> {
    /// use cell.parser() for creation
    pub(super) fn new(cell: &'a TonCell) -> Self {
        let cursor = Cursor::new(cell.cell_data.data_storage.as_slice());
        let mut data_reader = BitReader::endian(cursor, BigEndian);
        // unwrap is safe while borders are validated (we must support this invariant)
        data_reader.seek_bits(SeekFrom::Current(cell.borders.start_bit as i64)).unwrap();
        let next_ref_pos = cell.borders.start_ref as usize;
        Self {
            cell,
            data_reader,
            next_ref_pos,
        }
    }

    pub fn original_cell(&self) -> &'a TonCell { self.cell }

    pub fn lookup_bits(&mut self, bits_len: usize) -> Result<u128, TonCoreError> {
        let value = self.read_num(bits_len)?;
        self.seek_bits(-(bits_len as i32))?;
        Ok(value)
    }

    pub fn read_bit(&mut self) -> Result<bool, TonCoreError> {
        self.ensure_enough_bits(1)?;
        Ok(self.data_reader.read_bit()?)
    }

    pub fn read_bits(&mut self, bits_len: usize) -> Result<Vec<u8>, TonCoreError> {
        let mut dst = vec![0; bits_len.div_ceil(8)];
        self.read_bits_to(bits_len, &mut dst)?;
        Ok(dst)
    }

    pub fn read_bits_to(&mut self, bits_len: usize, dst: &mut [u8]) -> Result<(), TonCoreError> {
        if dst.len() * 8 < bits_len {
            bail_ton_core_data!("Can't write {bits_len} bits into {}-bytes buffer", dst.len());
        }
        self.ensure_enough_bits(bits_len)?;
        let full_bytes = bits_len / 8;
        let remaining_bits = bits_len % 8;

        self.data_reader.read_bytes(&mut dst[..full_bytes])?;

        if remaining_bits != 0 {
            let last_byte = self.data_reader.read_var::<u8>(remaining_bits as u32)?;
            dst[full_bytes] = last_byte << (8 - remaining_bits);
        }
        Ok(())
    }

    pub fn read_num<N: TonCellNum>(&mut self, bits_len: usize) -> Result<N, TonCoreError> {
        if bits_len == 0 {
            return Ok(N::zero());
        }
        self.ensure_enough_bits(bits_len)?;
        N::tcn_read_bits(self, bits_len)
    }

    pub fn read_cell(&mut self, bits_len: usize, refs_len: u8) -> Result<TonCell, TonCoreError> {
        let start_bit = self.data_reader.position_in_bits()? as usize - self.cell.borders.start_bit;
        let end_bit = start_bit + bits_len;
        let start_ref = self.next_ref_pos as u8 - self.cell.borders.start_ref;
        let end_ref = start_ref + refs_len;
        let borders = CellBorders {
            start_bit,
            end_bit,
            start_ref,
            end_ref,
        };
        let slice = self.cell.slice(borders)?; // validation will be done in .slice()
        self.seek_bits(bits_len as i32)?;
        self.next_ref_pos += refs_len as usize;
        Ok(slice)
    }

    pub fn read_remaining(&mut self) -> Result<TonCell, TonCoreError> {
        let bits_len = self.data_bits_left()?;
        let refs_len = self.refs_left();
        self.read_cell(bits_len, refs_len as u8)
    }

    pub fn read_next_ref(&mut self) -> Result<&TonCell, TonCoreError> {
        if self.next_ref_pos == self.cell.borders.end_ref as usize {
            bail_ton_core_data!(
                "No more refs in cell: next_ref_pos={}, end_ref_pos={}",
                self.next_ref_pos,
                self.cell.borders.end_ref,
            );
        }
        let cell_ref = &self.cell.cell_data.refs[self.next_ref_pos];
        self.next_ref_pos += 1;
        Ok(cell_ref)
    }

    pub fn data_bits_left(&mut self) -> Result<usize, TonCoreError> {
        let reader_pos = self.data_reader.position_in_bits()? as usize;
        Ok(self.cell.borders.end_bit - reader_pos)
    }

    pub fn refs_left(&mut self) -> usize { self.cell.borders.end_ref as usize - self.next_ref_pos }

    pub fn seek_bits(&mut self, offset: i32) -> Result<(), TonCoreError> {
        let new_pos = self.data_reader.position_in_bits()? as i32 + offset;
        if new_pos < 0 || new_pos as usize > self.cell.borders.end_bit {
            bail_ton_core_data!(
                "Bad seek position in slice: new_pos {new_pos}, data_bits_len {}",
                self.cell.borders.end_bit
            );
        }
        self.data_reader.seek_bits(SeekFrom::Current(offset as i64))?;
        Ok(())
    }

    pub fn ensure_empty(&mut self) -> Result<(), TonCoreError> {
        let bits_left = self.data_bits_left()?;
        let refs_left = self.cell.borders.end_ref as usize - self.next_ref_pos;
        if bits_left == 0 && refs_left == 0 {
            return Ok(());
        }
        bail_ton_core_data!("Cell is not empty: {bits_left} bits left, {refs_left} refs left");
    }

    // returns remaining bits
    fn ensure_enough_bits(&mut self, bit_len: usize) -> Result<usize, TonCoreError> {
        let bits_left = self.data_bits_left()?;

        if bit_len <= bits_left {
            return Ok(bits_left);
        }
        bail_ton_core_data!("Not enough bits in cell: required {bit_len}, left {bits_left}");
    }

    // bitstream can't read/write signed properly: https://github.com/tuffy/bitstream-io/issues/26
    #[inline(always)]
    pub(crate) fn read_unsigned_primitive<I: Integer>(&mut self, bits_len: usize) -> TonCoreResult<I> {
        match self.data_reader.read_var(bits_len as u32) {
            Ok(value) => Ok(value),
            Err(err) => bail_ton_core_data!("Failed to read {} in {bits_len} bits: {err}", type_name::<I>()),
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::cell::TonCell;
    use num_bigint::{BigInt, BigUint};
    use tokio_test::{assert_err, assert_ok};

    fn make_test_cell(data: &[u8], bits_len: usize) -> anyhow::Result<TonCell> {
        let mut builder = TonCell::builder();
        builder.write_bits(data, bits_len)?;
        Ok(builder.build()?)
    }

    #[test]
    fn test_parser_seek_bits() -> anyhow::Result<()> {
        let cell = make_test_cell(&[0b10101001, 0b01010100], 10)?;
        let mut parser = CellParser::new(&cell);
        assert_ok!(parser.seek_bits(3));
        assert_eq!(parser.data_reader.position_in_bits()? as usize, 3);
        assert_ok!(parser.seek_bits(-2));
        assert_eq!(parser.data_reader.position_in_bits()? as usize, 1);
        assert_ok!(parser.seek_bits(0));
        assert_eq!(parser.data_reader.position_in_bits()? as usize, 1);
        assert_ok!(parser.seek_bits(-1));
        assert_eq!(parser.data_reader.position_in_bits()? as usize, 0);
        assert_err!(parser.seek_bits(-1));
        assert_eq!(parser.data_reader.position_in_bits()? as usize, 0);
        assert_ok!(parser.seek_bits(cell.borders.end_bit as i32 - 1));
        assert_eq!(parser.data_reader.position_in_bits()? as usize, cell.borders.end_bit - 1);
        assert_ok!(parser.seek_bits(1));
        assert_eq!(parser.data_reader.position_in_bits()? as usize, cell.borders.end_bit);
        assert_err!(parser.seek_bits(1));
        assert_err!(parser.seek_bits(20));
        Ok(())
    }

    #[test]
    fn test_parser_lookup_bits() -> anyhow::Result<()> {
        let cell = make_test_cell(&[0b10101010, 0b01010101], 16)?;
        let mut parser = CellParser::new(&cell);
        assert_eq!(parser.lookup_bits(3)?, 0b101);
        assert_eq!(parser.data_reader.position_in_bits()?, 0);
        assert!(assert_ok!(parser.read_bit()));
        assert_eq!(parser.data_reader.position_in_bits()?, 1);
        assert_eq!(parser.lookup_bits(3)?, 0b010);
        assert_eq!(parser.data_reader.position_in_bits()?, 1);
        Ok(())
    }

    #[test]
    fn test_parser_read_bit() -> anyhow::Result<()> {
        let cell = make_test_cell(&[0b10101010, 0b01010101], 16)?;
        let mut parser = CellParser::new(&cell);
        for i in 0..8 {
            assert_eq!(assert_ok!(parser.read_bit()), i % 2 == 0);
        }
        for i in 0..8 {
            assert_eq!(assert_ok!(parser.read_bit()), i % 2 != 0);
        }
        Ok(())
    }

    #[test]
    fn test_parser_ensure_enough_bits() -> anyhow::Result<()> {
        let cell = make_test_cell(&[0b10101010, 0b01010101], 10)?;
        let mut parser = CellParser::new(&cell);
        assert_eq!(parser.data_reader.position_in_bits()?, 0);
        assert_ok!(parser.ensure_enough_bits(0));
        assert_ok!(parser.ensure_enough_bits(1));
        assert_ok!(parser.ensure_enough_bits(6));
        assert_ok!(parser.ensure_enough_bits(10));
        assert_err!(parser.ensure_enough_bits(11));
        Ok(())
    }

    #[test]
    fn test_parser_read_ref() -> anyhow::Result<()> {
        let mut ref_builder = TonCell::builder();
        ref_builder.write_num(&0b11110000u8, 8)?;
        let cell1 = ref_builder.build()?;

        let mut cell_builder = TonCell::builder();
        cell_builder.write_ref(cell1.clone())?;
        cell_builder.write_ref(cell1.clone())?;
        let cell_2 = cell_builder.build()?;

        let mut parser = CellParser::new(&cell_2);
        assert_eq!(parser.read_next_ref()?, &cell1);
        assert_eq!(parser.read_next_ref()?, &cell1);
        assert!(parser.read_next_ref().is_err());
        Ok(())
    }

    #[test]
    fn test_parser_read_bits() -> anyhow::Result<()> {
        let cell = make_test_cell(&[0b10101010u8, 0b01010101u8], 16)?;
        let mut parser = CellParser::new(&cell);
        let dst = parser.read_bits(3)?;
        assert_eq!(dst, [0b10100000]);
        let dst = parser.read_bits(6)?;
        assert_eq!(dst, [0b01010000]);
        Ok(())
    }

    #[test]
    fn test_parser_read_num() -> anyhow::Result<()> {
        let cell = make_test_cell(&[0b10101010, 0b01010101], 16)?;
        let mut parser = CellParser::new(&cell);
        assert_eq!(parser.read_num::<u8>(3)?, 0b101);
        assert_eq!(parser.data_reader.position_in_bits()?, 3);
        assert_eq!(parser.read_num::<u32>(3)?, 0b010);
        assert_eq!(parser.data_reader.position_in_bits()?, 6);
        assert_eq!(parser.read_num::<u64>(3)?, 0b100);
        assert_eq!(parser.data_reader.position_in_bits()?, 9);
        Ok(())
    }

    #[test]
    fn test_parser_read_num_unaligned() -> anyhow::Result<()> {
        let cell = make_test_cell(&[0b0001_0001, 0b0000_0000, 0b1010_0000], 19)?;
        let mut parser = CellParser::new(&cell);
        assert_eq!(parser.read_num::<u8>(4)?, 1);
        assert_eq!(parser.data_reader.position_in_bits()?, 4);
        assert_eq!(parser.read_num::<u16>(5)?, 2);
        assert_eq!(parser.data_reader.position_in_bits()?, 9);
        assert_eq!(parser.read_num::<u32>(10)?, 5);
        assert_eq!(parser.data_reader.position_in_bits()?, 19);
        Ok(())
    }

    #[test]
    fn test_parser_read_cell() -> anyhow::Result<()> {
        let mut builder = TonCell::builder();
        builder.write_bits([255, 0, 255, 0], 24)?;

        for i in 0..3 {
            let mut ref_builder = TonCell::builder();
            ref_builder.write_bits([i], 8)?;
            builder.write_ref(ref_builder.build()?)?;
        }

        let orig_cell = builder.build()?;
        let mut parser = CellParser::new(&orig_cell);
        parser.read_bits(4)?; // skip 4 bits
        parser.read_next_ref()?; // skip first ref

        let cell = parser.read_remaining()?;
        let expected_borders = CellBorders {
            start_bit: 4,
            end_bit: orig_cell.borders.end_bit,
            start_ref: 1,
            end_ref: orig_cell.borders.end_ref,
        };
        assert_eq!(cell.borders, expected_borders);
        Ok(())
    }

    #[test]
    fn test_parser_read_slice() -> anyhow::Result<()> {
        let mut builder = TonCell::builder();
        builder.write_bits([255, 0, 255, 0], 24)?;

        for i in 0..3 {
            let mut ref_builder = TonCell::builder();
            ref_builder.write_bits([i], 8)?;
            builder.write_ref(ref_builder.build()?)?;
        }

        let orig_cell = builder.build()?;
        let mut parser = CellParser::new(&orig_cell);
        parser.read_bits(4)?; // skip 4 bits
        parser.read_next_ref()?; // skip first ref

        let cell = parser.read_cell(2, 0)?;
        let expected_borders = CellBorders {
            start_bit: 4,
            end_bit: 6,
            start_ref: 1,
            end_ref: 1,
        };
        assert_eq!(cell.borders, expected_borders);
        Ok(())
    }

    #[test]
    fn test_parser_read_bigint() -> anyhow::Result<()> {
        let cell = make_test_cell(&[0b111_01010, 0b01101011, 0b10000000, 0b00000001], 32)?;
        let mut parser = CellParser::new(&cell);
        assert_eq!(parser.read_num::<BigInt>(3)?, (-1).into());
        assert_eq!(parser.data_reader.position_in_bits()?, 3);
        assert_eq!(parser.read_num::<BigInt>(5)?, 10.into()); // finish with first byte
        assert_eq!(parser.data_reader.position_in_bits()?, 8);
        parser.read_bit()?; // skip 1 bit
        assert_eq!(parser.read_num::<BigInt>(7)?, (-21).into()); // finish with second byte
        assert_eq!(parser.data_reader.position_in_bits()?, 16);
        assert_eq!(parser.read_num::<BigInt>(16)?, (-32767).into());
        Ok(())
    }

    #[test]
    fn test_parser_read_bigint_unaligned() -> anyhow::Result<()> {
        let cell = make_test_cell(&[0b00011110, 0b11111111], 16)?;
        let mut parser = CellParser::new(&cell);
        parser.seek_bits(3)?;
        assert_eq!(parser.read_num::<BigInt>(9)?, (-17).into());
        Ok(())
    }

    #[test]
    fn test_parser_read_biguint() -> anyhow::Result<()> {
        let cell_slice = make_test_cell(&[0b10101010, 0b01010101, 0b11111111, 0b11111111], 32)?;
        let mut parser = CellParser::new(&cell_slice);
        assert_eq!(parser.read_num::<BigUint>(3)?, 5u32.into());
        assert_eq!(parser.data_reader.position_in_bits()?, 3);
        assert_eq!(parser.read_num::<BigUint>(5)?, 10u32.into()); // finish with first byte
        assert_eq!(parser.data_reader.position_in_bits()?, 8);
        parser.read_bit()?; // skip 1 bit
        assert_eq!(parser.read_num::<BigUint>(7)?, 85u32.into()); // finish with second byte
        assert_eq!(parser.data_reader.position_in_bits()?, 16);
        assert_eq!(parser.read_num::<BigUint>(16)?, 65535u32.into());
        Ok(())
    }

    #[test]
    fn test_parser_ensure_empty() -> anyhow::Result<()> {
        let cell_ref = make_test_cell(&[0b10101010, 0b01010101], 16)?;
        let mut builder = TonCell::builder();
        builder.write_ref(cell_ref)?;
        builder.write_num(&3, 3)?;
        let cell = builder.build()?;

        let mut parser = CellParser::new(&cell);
        assert_err!(parser.ensure_empty());
        parser.read_bits(3)?;
        assert_err!(parser.ensure_empty());
        parser.read_next_ref()?;
        assert_ok!(parser.ensure_empty());
        Ok(())
    }
}