//! bzip2 low-level block APIs

use tinyvec::ArrayVec;

pub use self::error::BlockError;
use crate::bitreader::BitReader;
use crate::crc::Hasher;
use crate::header::Header;
use crate::huffman::HuffmanTree;
use crate::move_to_front::MoveToFrontDecoder;

mod bwt;
mod error;

const BLOCK_MAGIC: u64 = 0x314159265359;
const FINAL_MAGIC: u64 = 0x177245385090;

pub(crate) struct Block {
    header: Header,

    tt: Vec<u32>,
    pre_rle_used: u32,
    t_pos: u32,
    last_byte: i16,
    byte_repeats: u8,
    repeats: u8,

    hasher: Hasher,
    expected_crc: u32,

    state: State,
}

enum State {
    ReadyForRead,
    Reading,
    NotReady,
}

impl Block {
    pub fn new(header: Header) -> Self {
        let max_blocksize = header.max_blocksize();

        Self {
            header,

            tt: Vec::with_capacity(max_blocksize as usize),
            pre_rle_used: 0,
            t_pos: 0,
            last_byte: -1,
            byte_repeats: 0,
            repeats: 0,

            hasher: Hasher::new(),
            expected_crc: 0,

            state: State::NotReady,
        }
    }

    pub fn is_ready_for_read(&self) -> bool {
        match self.state {
            State::ReadyForRead => true,
            State::Reading | State::NotReady => false,
        }
    }

    pub fn is_reading(&self) -> bool {
        match self.state {
            State::Reading => true,
            State::ReadyForRead | State::NotReady => false,
        }
    }

    pub fn is_not_ready(&self) -> bool {
        match self.state {
            State::NotReady => true,
            State::ReadyForRead | State::Reading => false,
        }
    }

    pub fn set_ready_for_read(&mut self) {
        self.state = State::ReadyForRead;
    }

    pub fn read(
        &mut self,
        reader: &mut BitReader<'_>,
        out: &mut [u8],
    ) -> Result<usize, BlockError> {
        match &self.state {
            State::ReadyForRead => {
                let magic = reader
                    .read_u64(48)
                    .ok_or_else(|| BlockError::new("next magic truncated"))?;
                match magic {
                    BLOCK_MAGIC => {
                        self.read_block(reader)?;
                        self.state = State::Reading;

                        self.read(reader, out)
                    }
                    FINAL_MAGIC => {
                        let _crc = reader
                            .read_u32(32)
                            .ok_or_else(|| BlockError::new("whole stream crc truncated"))?;

                        // TODO: check whole stream crc

                        self.state = State::NotReady;
                        Ok(0)
                    }
                    _ => {
                        self.state = State::NotReady;
                        Err(BlockError::new("bad magic value found"))
                    }
                }
            }
            State::Reading => {
                let n = self.read_from_block(out)?;
                if n == 0 && !out.is_empty() {
                    self.state = State::NotReady;
                }

                Ok(n)
            }
            State::NotReady => Err(BlockError::new("not ready")),
        }
    }

    pub fn read_from_block(&mut self, out: &mut [u8]) -> Result<usize, BlockError> {
        let mut read = 0;

        while (self.repeats > 0 || self.pre_rle_used < (self.tt.len() as u32)) && read < out.len() {
            if self.repeats > 0 {
                out[read] = self.last_byte as u8;
                read += 1;

                self.repeats -= 1;
                if self.repeats == 0 {
                    self.last_byte = -1;
                }
                continue;
            }

            self.t_pos = self.tt[self.t_pos as usize];
            let b = self.t_pos as u8;
            self.t_pos >>= 8;
            self.pre_rle_used += 1;

            if self.byte_repeats == 3 {
                self.repeats = b;
                self.byte_repeats = 0;
                continue;
            }

            if self.last_byte == i16::from(b) {
                self.byte_repeats += 1;
            } else {
                self.byte_repeats = 0;
            }
            self.last_byte = i16::from(b);

            out[read] = b;
            read += 1;
        }

        if read == 0 && !out.is_empty() {
            self.state = State::NotReady;

            let crc = self.hasher.finalyze();
            return if self.expected_crc == crc {
                Ok(0)
            } else {
                Err(BlockError::new("bad crc"))
            };
        }

        self.hasher.update(&out[..read]);
        Ok(read)
    }

    pub fn read_block(&mut self, reader: &mut BitReader<'_>) -> Result<(), BlockError> {
        self.hasher = Hasher::new();
        self.tt.clear();

        self.expected_crc = reader
            .read_u32(32)
            .ok_or_else(|| BlockError::new("crc truncated"))?;

        let randomised = reader
            .read_bool()
            .ok_or_else(|| BlockError::new("randomised truncated"))?;
        if randomised {
            return Err(BlockError::new("randomised expected to be 'normal'"));
        }

        let orig_ptr = reader
            .read_u32(24)
            .ok_or_else(|| BlockError::new("orig ptr truncated"))?;

        let mut huffman_used_symbols = ArrayVec::<[u8; 16]>::new();
        let mut huffman_used_bitmaps = ArrayVec::<[u8; 256]>::new();

        for i in 0..16 {
            if reader
                .read_bool()
                .ok_or_else(|| BlockError::new("symbol range truncated"))?
            {
                huffman_used_symbols.push(i);
            }
        }

        for symbol_range in huffman_used_symbols {
            for symbol in 0..16 {
                if reader
                    .read_bool()
                    .ok_or_else(|| BlockError::new("symbol range truncated"))?
                {
                    huffman_used_bitmaps.push(symbol_range * 16 + symbol);
                }
            }
        }

        if huffman_used_bitmaps.is_empty() {
            return Err(BlockError::new("huffman no symbols in input"));
        }

        let huffman_groups = reader
            .read_u8(3)
            .ok_or_else(|| BlockError::new("huffmann groups truncated"))?;
        if huffman_groups < 2 || huffman_groups > 6 {
            return Err(BlockError::new("invalid number of huffman trees"));
        }

        let selectors_used = reader
            .read_u16(15)
            .ok_or_else(|| BlockError::new("selectors used truncated"))?;

        #[cfg(feature = "rustc_1_51")]
        let mut selectors_list = ArrayVec::<[u8; 18001]>::new();
        #[cfg(feature = "rustc_1_51")]
        selectors_list.set_len(selectors_used as usize);
        #[cfg(not(feature = "rustc_1_51"))]
        let mut selectors_list = vec![0u8; selectors_used as usize];

        let mut move_to_front_decoder = MoveToFrontDecoder::new();
        for selector_item in selectors_list.iter_mut().rev() {
            let mut trees = 0;

            while reader
                .read_bool()
                .ok_or_else(|| BlockError::new("selector truncated"))?
            {
                trees += 1;
            }

            if trees >= huffman_groups {
                return Err(BlockError::new("tree index too large"));
            }

            *selector_item = move_to_front_decoder.decode(trees);
        }

        // limited in lenght of huffman_used_symbols
        let mut symbols = [0u8; 256];
        for (count, index) in huffman_used_bitmaps.iter().enumerate() {
            symbols[count] = *index;
        }

        let mut move_to_front_decoder_2 = MoveToFrontDecoder::new_from_symbols(symbols);

        let mut huffman_trees = ArrayVec::<[HuffmanTree; 6]>::new();

        let mut lengths = ArrayVec::<[u8; crate::LEN_258]>::new();
        lengths.set_len(huffman_used_bitmaps.len() + 2);

        for _ in 0..huffman_groups {
            let mut length = reader
                .read_u8(5)
                .ok_or_else(|| BlockError::new("huffman group length truncated"))?;

            for length_item in &mut *lengths {
                loop {
                    if length < 1 || length > 20 {
                        return Err(BlockError::new("huffman length out of range"));
                    }

                    if !reader
                        .read_bool()
                        .ok_or_else(|| BlockError::new("length bit1 truncated"))?
                    {
                        break;
                    }

                    if reader
                        .read_bool()
                        .ok_or_else(|| BlockError::new("length bit2 truncated"))?
                    {
                        length -= 1;
                    } else {
                        length += 1;
                    }
                }

                *length_item = length;
            }

            let tree = HuffmanTree::new(&lengths).map_err(BlockError::new)?;
            huffman_trees.push(tree);
        }

        let selector = selectors_list
            .pop()
            .ok_or_else(|| BlockError::new("no tree selectors given"))?;
        let mut current_huffman_tree = huffman_trees
            .get(selector as usize)
            .ok_or_else(|| BlockError::new("tree selector out of range"))?;

        let mut repeat = 0u32;
        let mut repeat_power = 0u32;
        let mut c = [0u32; 256];

        let mut decoded = 0;
        loop {
            if decoded == 50 {
                let selector = selectors_list.pop().ok_or_else(|| {
                    BlockError::new("insufficient selector indices for number of symbols")
                })?;

                current_huffman_tree = huffman_trees
                    .get(selector as usize)
                    .ok_or_else(|| BlockError::new("tree selector out of range"))?;
                decoded = 0;
            }

            let v = current_huffman_tree
                .decode(reader)
                .map_err(BlockError::new)?;
            decoded += 1;

            if v < 2 {
                if repeat == 0 {
                    repeat_power = 1;
                }
                repeat += repeat_power << v;
                repeat_power <<= 1;

                if repeat > 2 * 1024 * 1024 {
                    return Err(BlockError::new("repeat count too large"));
                }
                continue;
            }

            if repeat > 0 {
                if repeat > self.header.max_blocksize() - (self.tt.len() as u32) {
                    return Err(BlockError::new("repeats past end of block"));
                }

                for _ in 0..repeat {
                    let b = move_to_front_decoder_2.first();
                    self.tt.push(b as u32);
                    c[b as usize] += 1;
                }

                repeat = 0;
            }

            if v as usize == (huffman_used_bitmaps.len() + 2) - 1 {
                break;
            }

            let b = move_to_front_decoder_2.decode((v - 1) as u8);
            if self.tt.len() as u32 >= self.header.max_blocksize() {
                return Err(BlockError::new("data exceeds block size"));
            }

            self.tt.push(b as u32);
            c[b as usize] += 1;
        }

        if orig_ptr >= (self.tt.len() as u32) {
            return Err(BlockError::new("orig_ptr out of bounds"));
        }

        self.pre_rle_used = 0;
        self.t_pos = bwt::inverse_bwt(&mut self.tt, orig_ptr as usize, &mut c);
        self.last_byte = -1;
        self.byte_repeats = 0;
        self.repeats = 0;

        Ok(())
    }
}

#[cfg(test)]
mod tests {
    use std::convert::TryInto;

    use super::*;

    #[test]
    fn decode1() {
        let compressed = include_bytes!("../../tests/samplefiles/sample1.bz2");
        let decompressed = include_bytes!("../../tests/samplefiles/sample1.ref");

        let header = Header::parse(compressed[..4].try_into().unwrap()).unwrap();
        println!("block_size: {}", header.raw_blocksize());

        let compressed = &compressed[4..];

        let mut bits = BitReader::new(&compressed);
        let mut reader = Block::new(header);

        let mut out = vec![0u8; decompressed.len()];

        reader.set_ready_for_read();
        let read = reader.read(&mut bits, &mut out).unwrap();
        assert_eq!(&out[..read], decompressed.as_ref());
    }

    #[test]
    fn decode2() {
        let compressed = include_bytes!("../../tests/samplefiles/sample2.bz2");
        let decompressed = include_bytes!("../../tests/samplefiles/sample2.ref");

        let header = Header::parse(compressed[..4].try_into().unwrap()).unwrap();
        println!("block_size: {}", header.raw_blocksize());

        let compressed = &compressed[4..];

        let mut bits = BitReader::new(&compressed);
        let mut reader = Block::new(header);

        let mut out = vec![0u8; decompressed.len()];

        reader.set_ready_for_read();
        let read1 = reader.read(&mut bits, &mut out).unwrap();
        reader.set_ready_for_read();
        let read2 = reader.read(&mut bits, &mut out[read1..]).unwrap();
        assert_eq!(&out[..read1 + read2], decompressed.as_ref());
    }

    #[test]
    fn decode3() {
        let compressed = include_bytes!("../../tests/samplefiles/sample3.bz2");
        let decompressed = include_bytes!("../../tests/samplefiles/sample3.ref");

        let header = Header::parse(compressed[..4].try_into().unwrap()).unwrap();
        println!("block_size: {}", header.raw_blocksize());

        let compressed = &compressed[4..];

        let mut bits = BitReader::new(&compressed);
        let mut reader = Block::new(header);

        let mut out = vec![0u8; decompressed.len()];

        reader.set_ready_for_read();
        let read = reader.read(&mut bits, &mut out).unwrap();
        assert_eq!(&out[..read], decompressed.as_ref());
    }
}
