mirror of
https://github.com/exoticorn/upkr.git
synced 2026-01-20 11:36:42 +01:00
add bitstream variant, could be useful on 8bit platforms
This commit is contained in:
@@ -3,9 +3,13 @@ use crate::match_finder::MatchFinder;
|
|||||||
use crate::rans::RansCoder;
|
use crate::rans::RansCoder;
|
||||||
use crate::ProgressCallback;
|
use crate::ProgressCallback;
|
||||||
|
|
||||||
pub fn pack(data: &[u8], mut progress_callback: Option<ProgressCallback>) -> Vec<u8> {
|
pub fn pack(
|
||||||
|
data: &[u8],
|
||||||
|
use_bitstream: bool,
|
||||||
|
mut progress_callback: Option<ProgressCallback>,
|
||||||
|
) -> Vec<u8> {
|
||||||
let mut match_finder = MatchFinder::new(data);
|
let mut match_finder = MatchFinder::new(data);
|
||||||
let mut rans_coder = RansCoder::new();
|
let mut rans_coder = RansCoder::new(use_bitstream);
|
||||||
let mut state = lz::CoderState::new();
|
let mut state = lz::CoderState::new();
|
||||||
|
|
||||||
let mut pos = 0;
|
let mut pos = 0;
|
||||||
|
|||||||
13
src/lib.rs
13
src/lib.rs
@@ -2,17 +2,22 @@ mod context_state;
|
|||||||
mod greedy_packer;
|
mod greedy_packer;
|
||||||
mod lz;
|
mod lz;
|
||||||
mod match_finder;
|
mod match_finder;
|
||||||
mod rans;
|
|
||||||
mod parsing_packer;
|
mod parsing_packer;
|
||||||
|
mod rans;
|
||||||
|
|
||||||
pub use lz::unpack;
|
pub use lz::unpack;
|
||||||
|
|
||||||
pub type ProgressCallback<'a> = &'a mut dyn FnMut(usize);
|
pub type ProgressCallback<'a> = &'a mut dyn FnMut(usize);
|
||||||
|
|
||||||
pub fn pack(data: &[u8], level: u8, progress_callback: Option<ProgressCallback>) -> Vec<u8> {
|
pub fn pack(
|
||||||
|
data: &[u8],
|
||||||
|
level: u8,
|
||||||
|
use_bitstream: bool,
|
||||||
|
progress_callback: Option<ProgressCallback>,
|
||||||
|
) -> Vec<u8> {
|
||||||
if level == 0 {
|
if level == 0 {
|
||||||
greedy_packer::pack(data, progress_callback)
|
greedy_packer::pack(data, use_bitstream, progress_callback)
|
||||||
} else {
|
} else {
|
||||||
parsing_packer::pack(data, level, progress_callback)
|
parsing_packer::pack(data, level, use_bitstream, progress_callback)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -77,7 +77,7 @@ fn encode_length(
|
|||||||
pub struct CoderState {
|
pub struct CoderState {
|
||||||
contexts: ContextState,
|
contexts: ContextState,
|
||||||
last_offset: u32,
|
last_offset: u32,
|
||||||
prev_was_match: bool
|
prev_was_match: bool,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl CoderState {
|
impl CoderState {
|
||||||
@@ -85,7 +85,7 @@ impl CoderState {
|
|||||||
CoderState {
|
CoderState {
|
||||||
contexts: ContextState::new(1 + 255 + 1 + 64 + 64),
|
contexts: ContextState::new(1 + 255 + 1 + 64 + 64),
|
||||||
last_offset: 0,
|
last_offset: 0,
|
||||||
prev_was_match: false
|
prev_was_match: false,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -94,8 +94,8 @@ impl CoderState {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn unpack(packed_data: &[u8]) -> Vec<u8> {
|
pub fn unpack(packed_data: &[u8], use_bitstream: bool) -> Vec<u8> {
|
||||||
let mut decoder = RansDecoder::new(packed_data);
|
let mut decoder = RansDecoder::new(packed_data, use_bitstream);
|
||||||
let mut contexts = ContextState::new(1 + 255 + 1 + 64 + 64);
|
let mut contexts = ContextState::new(1 + 255 + 1 + 64 + 64);
|
||||||
let mut result = vec![];
|
let mut result = vec![];
|
||||||
let mut offset = 0;
|
let mut offset = 0;
|
||||||
|
|||||||
@@ -9,6 +9,7 @@ fn main() -> Result<()> {
|
|||||||
None => print_help(),
|
None => print_help(),
|
||||||
Some("pack") => {
|
Some("pack") => {
|
||||||
let level = args.opt_value_from_str(["-l", "--level"])?.unwrap_or(2u8);
|
let level = args.opt_value_from_str(["-l", "--level"])?.unwrap_or(2u8);
|
||||||
|
let use_bitstream = args.contains(["-b", "--bitstream"]);
|
||||||
|
|
||||||
let infile = args.free_from_os_str::<PathBuf, bool>(|s| Ok(s.into()))?;
|
let infile = args.free_from_os_str::<PathBuf, bool>(|s| Ok(s.into()))?;
|
||||||
let outfile = args.free_from_os_str::<PathBuf, bool>(|s| Ok(s.into()))?;
|
let outfile = args.free_from_os_str::<PathBuf, bool>(|s| Ok(s.into()))?;
|
||||||
@@ -21,6 +22,7 @@ fn main() -> Result<()> {
|
|||||||
let packed_data = upkr::pack(
|
let packed_data = upkr::pack(
|
||||||
&data,
|
&data,
|
||||||
level,
|
level,
|
||||||
|
use_bitstream,
|
||||||
Some(&mut |pos| {
|
Some(&mut |pos| {
|
||||||
pb.set(pos as u64);
|
pb.set(pos as u64);
|
||||||
}),
|
}),
|
||||||
@@ -36,12 +38,14 @@ fn main() -> Result<()> {
|
|||||||
File::create(outfile)?.write_all(&packed_data)?;
|
File::create(outfile)?.write_all(&packed_data)?;
|
||||||
}
|
}
|
||||||
Some("unpack") => {
|
Some("unpack") => {
|
||||||
|
let use_bitstream = args.contains(["-b", "--bitstream"]);
|
||||||
|
|
||||||
let infile = args.free_from_os_str::<PathBuf, bool>(|s| Ok(s.into()))?;
|
let infile = args.free_from_os_str::<PathBuf, bool>(|s| Ok(s.into()))?;
|
||||||
let outfile = args.free_from_os_str::<PathBuf, bool>(|s| Ok(s.into()))?;
|
let outfile = args.free_from_os_str::<PathBuf, bool>(|s| Ok(s.into()))?;
|
||||||
|
|
||||||
let mut data = vec![];
|
let mut data = vec![];
|
||||||
File::open(infile)?.read_to_end(&mut data)?;
|
File::open(infile)?.read_to_end(&mut data)?;
|
||||||
let packed_data = upkr::unpack(&data);
|
let packed_data = upkr::unpack(&data, use_bitstream);
|
||||||
File::create(outfile)?.write_all(&packed_data)?;
|
File::create(outfile)?.write_all(&packed_data)?;
|
||||||
}
|
}
|
||||||
Some(other) => {
|
Some(other) => {
|
||||||
|
|||||||
@@ -6,7 +6,7 @@ use crate::match_finder::MatchFinder;
|
|||||||
use crate::rans::{CostCounter, RansCoder};
|
use crate::rans::{CostCounter, RansCoder};
|
||||||
use crate::{lz, ProgressCallback};
|
use crate::{lz, ProgressCallback};
|
||||||
|
|
||||||
pub fn pack(data: &[u8], level: u8, progress_cb: Option<ProgressCallback>) -> Vec<u8> {
|
pub fn pack(data: &[u8], level: u8, use_bitstream: bool, progress_cb: Option<ProgressCallback>) -> Vec<u8> {
|
||||||
let mut parse = parse(data, Config::from_level(level), progress_cb);
|
let mut parse = parse(data, Config::from_level(level), progress_cb);
|
||||||
let mut ops = vec![];
|
let mut ops = vec![];
|
||||||
while let Some(link) = parse {
|
while let Some(link) = parse {
|
||||||
@@ -14,7 +14,7 @@ pub fn pack(data: &[u8], level: u8, progress_cb: Option<ProgressCallback>) -> Ve
|
|||||||
parse = link.prev.clone();
|
parse = link.prev.clone();
|
||||||
}
|
}
|
||||||
let mut state = lz::CoderState::new();
|
let mut state = lz::CoderState::new();
|
||||||
let mut coder = RansCoder::new();
|
let mut coder = RansCoder::new(use_bitstream);
|
||||||
for op in ops.into_iter().rev() {
|
for op in ops.into_iter().rev() {
|
||||||
op.encode(&mut coder, &mut state);
|
op.encode(&mut coder, &mut state);
|
||||||
}
|
}
|
||||||
|
|||||||
90
src/rans.rs
90
src/rans.rs
@@ -1,6 +1,5 @@
|
|||||||
use crate::context_state::Context;
|
use crate::context_state::Context;
|
||||||
|
|
||||||
const L_BITS: u32 = 12;
|
|
||||||
pub const PROB_BITS: u32 = 8;
|
pub const PROB_BITS: u32 = 8;
|
||||||
pub const ONE_PROB: u32 = 1 << PROB_BITS;
|
pub const ONE_PROB: u32 = 1 << PROB_BITS;
|
||||||
|
|
||||||
@@ -13,43 +12,75 @@ pub trait EntropyCoder {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub struct RansCoder(Vec<u16>);
|
pub struct RansCoder {
|
||||||
|
bits: Vec<u16>,
|
||||||
|
use_bitstream: bool,
|
||||||
|
}
|
||||||
|
|
||||||
impl EntropyCoder for RansCoder {
|
impl EntropyCoder for RansCoder {
|
||||||
fn encode_bit(&mut self, bit: bool, prob: u16) {
|
fn encode_bit(&mut self, bit: bool, prob: u16) {
|
||||||
assert!(prob < 32768);
|
assert!(prob < 32768);
|
||||||
self.0.push(prob | ((bit as u16) << 15));
|
self.bits.push(prob | ((bit as u16) << 15));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl RansCoder {
|
impl RansCoder {
|
||||||
pub fn new() -> RansCoder {
|
pub fn new(use_bitstream: bool) -> RansCoder {
|
||||||
RansCoder(Vec::new())
|
RansCoder {
|
||||||
|
bits: Vec::new(),
|
||||||
|
use_bitstream,
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn finish(self) -> Vec<u8> {
|
pub fn finish(self) -> Vec<u8> {
|
||||||
let mut buffer = vec![];
|
let mut buffer = vec![];
|
||||||
let mut state = 1 << L_BITS;
|
let l_bits: u32 = if self.use_bitstream { 15 } else { 12 };
|
||||||
|
let mut state = 1 << l_bits;
|
||||||
|
|
||||||
const MAX_STATE_FACTOR: u32 = 1 << (L_BITS + 8 - PROB_BITS);
|
let mut byte = 0u8;
|
||||||
for step in self.0.into_iter().rev() {
|
let mut bit = 8;
|
||||||
|
let mut flush_state: Box<dyn FnMut(&mut u32)> = if self.use_bitstream {
|
||||||
|
Box::new(|state: &mut u32| {
|
||||||
|
bit -= 1;
|
||||||
|
byte |= ((*state & 1) as u8) << bit;
|
||||||
|
if bit == 0 {
|
||||||
|
buffer.push(byte);
|
||||||
|
byte = 0;
|
||||||
|
bit = 8;
|
||||||
|
}
|
||||||
|
*state >>= 1;
|
||||||
|
})
|
||||||
|
} else {
|
||||||
|
Box::new(|state: &mut u32| {
|
||||||
|
buffer.push(*state as u8);
|
||||||
|
*state >>= 8;
|
||||||
|
})
|
||||||
|
};
|
||||||
|
|
||||||
|
let num_flush_bits = if self.use_bitstream { 1 } else { 8 };
|
||||||
|
let max_state_factor: u32 = 1 << (l_bits + num_flush_bits - PROB_BITS);
|
||||||
|
for step in self.bits.into_iter().rev() {
|
||||||
let prob = step as u32 & 32767;
|
let prob = step as u32 & 32767;
|
||||||
let (start, prob) = if step & 32768 != 0 {
|
let (start, prob) = if step & 32768 != 0 {
|
||||||
(0, prob)
|
(0, prob)
|
||||||
} else {
|
} else {
|
||||||
(prob, ONE_PROB - prob)
|
(prob, ONE_PROB - prob)
|
||||||
};
|
};
|
||||||
let max_state = MAX_STATE_FACTOR * prob;
|
let max_state = max_state_factor * prob;
|
||||||
while state >= max_state {
|
while state >= max_state {
|
||||||
buffer.push(state as u8);
|
flush_state(&mut state);
|
||||||
state >>= 8;
|
|
||||||
}
|
}
|
||||||
state = ((state / prob) << PROB_BITS) + (state % prob) + start;
|
state = ((state / prob) << PROB_BITS) + (state % prob) + start;
|
||||||
}
|
}
|
||||||
|
|
||||||
while state > 0 {
|
while state > 0 {
|
||||||
buffer.push(state as u8);
|
flush_state(&mut state);
|
||||||
state >>= 8;
|
}
|
||||||
|
|
||||||
|
drop(flush_state);
|
||||||
|
|
||||||
|
if self.use_bitstream && byte != 0 {
|
||||||
|
buffer.push(byte);
|
||||||
}
|
}
|
||||||
|
|
||||||
buffer.reverse();
|
buffer.reverse();
|
||||||
@@ -99,14 +130,22 @@ impl EntropyCoder for CostCounter {
|
|||||||
pub struct RansDecoder<'a> {
|
pub struct RansDecoder<'a> {
|
||||||
data: &'a [u8],
|
data: &'a [u8],
|
||||||
state: u32,
|
state: u32,
|
||||||
|
use_bitstream: bool,
|
||||||
|
byte: u8,
|
||||||
|
bits_left: u8,
|
||||||
}
|
}
|
||||||
|
|
||||||
const PROB_MASK: u32 = ONE_PROB - 1;
|
const PROB_MASK: u32 = ONE_PROB - 1;
|
||||||
const L: u32 = 1 << L_BITS;
|
|
||||||
|
|
||||||
impl<'a> RansDecoder<'a> {
|
impl<'a> RansDecoder<'a> {
|
||||||
pub fn new(data: &'a [u8]) -> RansDecoder<'a> {
|
pub fn new(data: &'a [u8], use_bitstream: bool) -> RansDecoder<'a> {
|
||||||
RansDecoder { data, state: 0 }
|
RansDecoder {
|
||||||
|
data,
|
||||||
|
state: 0,
|
||||||
|
use_bitstream,
|
||||||
|
byte: 0,
|
||||||
|
bits_left: 0,
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn decode_with_context(&mut self, context: &mut Context) -> bool {
|
pub fn decode_with_context(&mut self, context: &mut Context) -> bool {
|
||||||
@@ -117,9 +156,22 @@ impl<'a> RansDecoder<'a> {
|
|||||||
|
|
||||||
pub fn decode_bit(&mut self, prob: u16) -> bool {
|
pub fn decode_bit(&mut self, prob: u16) -> bool {
|
||||||
let prob = prob as u32;
|
let prob = prob as u32;
|
||||||
while self.state < L {
|
if self.use_bitstream {
|
||||||
self.state = (self.state << 8) | self.data[0] as u32;
|
while self.state < 32768 {
|
||||||
self.data = &self.data[1..];
|
if self.bits_left == 0 {
|
||||||
|
self.byte = self.data[0];
|
||||||
|
self.data = &self.data[1..];
|
||||||
|
self.bits_left = 8;
|
||||||
|
}
|
||||||
|
self.state = (self.state << 1) | (self.byte & 1) as u32;
|
||||||
|
self.byte >>= 1;
|
||||||
|
self.bits_left -= 1;
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
while self.state < 4096 {
|
||||||
|
self.state = (self.state << 8) | self.data[0] as u32;
|
||||||
|
self.data = &self.data[1..];
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
let bit = (self.state & PROB_MASK) < prob;
|
let bit = (self.state & PROB_MASK) < prob;
|
||||||
|
|||||||
Reference in New Issue
Block a user