1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324
//! Raw low-level manipulations of bz streams.
use std::error;
use std::fmt;
use std::marker;
use std::mem;
use std::slice;
use libc::{c_int, c_uint};
use {ffi, Compression};
/// Representation of an in-memory compression stream.
///
/// An instance of `Compress` can be used to compress a stream of bz2 data.
pub struct Compress {
inner: Stream<DirCompress>,
}
/// Representation of an in-memory decompression stream.
///
/// An instance of `Decompress` can be used to inflate a stream of bz2-encoded
/// data.
pub struct Decompress {
inner: Stream<DirDecompress>,
}
struct Stream<D: Direction> {
// libbz2 requires a stable address for this stream.
raw: Box<ffi::bz_stream>,
_marker: marker::PhantomData<D>,
}
unsafe impl<D: Direction> Send for Stream<D> {}
unsafe impl<D: Direction> Sync for Stream<D> {}
trait Direction {
unsafe fn destroy(stream: *mut ffi::bz_stream) -> c_int;
}
enum DirCompress {}
enum DirDecompress {}
/// Possible actions to take on compression.
#[derive(PartialEq, Eq, Copy, Debug, Clone)]
pub enum Action {
/// Normal compression.
Run = ffi::BZ_RUN as isize,
/// Request that the current compression block is terminate.
Flush = ffi::BZ_FLUSH as isize,
/// Request that the compression stream be finalized.
Finish = ffi::BZ_FINISH as isize,
}
/// Result of compression or decompression
#[derive(PartialEq, Eq, Copy, Debug, Clone)]
pub enum Status {
/// Decompression went fine, nothing much to report.
Ok,
/// The Flush action on a compression went ok.
FlushOk,
/// THe Run action on compression went ok.
RunOk,
/// The Finish action on compression went ok.
FinishOk,
/// The stream's end has been met, meaning that no more data can be input.
StreamEnd,
/// There was insufficient memory in the input or output buffer to complete
/// the request, but otherwise everything went normally.
MemNeeded,
}
/// Fatal errors encountered when compressing/decompressing bytes.
///
/// These errors indicate that progress could not be made in any form due to
/// input or output parameters.
#[derive(PartialEq, Eq, Copy, Debug, Clone)]
pub enum Error {
/// The sequence of operations called on a decompression/compression stream
/// were invalid. See methods for details.
Sequence,
/// The data being decompressed was invalid, or it was not a valid bz2
/// stream.
Data,
/// The magic bz2 header wasn't present when decompressing.
DataMagic,
/// The parameters to this function were invalid.
Param,
}
impl Compress {
/// Creates a new stream prepared for compression.
///
/// The `work_factor` parameter controls how the compression phase behaves
/// when presented with worst case, highly repetitive, input data. If
/// compression runs into difficulties caused by repetitive data, the
/// library switches from the standard sorting algorithm to a fallback
/// algorithm. The fallback is slower than the standard algorithm by perhaps
/// a factor of three, but always behaves reasonably, no matter how bad the
/// input.
///
/// Lower values of `work_factor` reduce the amount of effort the standard
/// algorithm will expend before resorting to the fallback. You should set
/// this parameter carefully; too low, and many inputs will be handled by
/// the fallback algorithm and so compress rather slowly, too high, and your
/// average-to-worst case compression times can become very large. The
/// default value of 30 gives reasonable behaviour over a wide range of
/// circumstances.
///
/// Allowable values range from 0 to 250 inclusive. 0 is a special case,
/// equivalent to using the default value of 30.
pub fn new(lvl: Compression, work_factor: u32) -> Compress {
unsafe {
let mut raw = Box::new(mem::zeroed());
assert_eq!(
ffi::BZ2_bzCompressInit(&mut *raw, lvl.level() as c_int, 0, work_factor as c_int),
0
);
Compress {
inner: Stream {
raw: raw,
_marker: marker::PhantomData,
},
}
}
}
/// Compress a block of input into a block of output.
///
/// If anything other than BZ_OK is seen, `Err` is returned. The action
/// given must be one of Run, Flush or Finish.
pub fn compress(
&mut self,
input: &[u8],
output: &mut [u8],
action: Action,
) -> Result<Status, Error> {
// apparently 0-length compression requests which don't actually make
// any progress are returned as BZ_PARAM_ERROR, which we don't want, to
// just translate to a success here.
if input.len() == 0 && action == Action::Run {
return Ok(Status::RunOk);
}
self.inner.raw.next_in = input.as_ptr() as *mut _;
self.inner.raw.avail_in = input.len().min(c_uint::MAX as usize) as c_uint;
self.inner.raw.next_out = output.as_mut_ptr() as *mut _;
self.inner.raw.avail_out = output.len().min(c_uint::MAX as usize) as c_uint;
unsafe {
match ffi::BZ2_bzCompress(&mut *self.inner.raw, action as c_int) {
ffi::BZ_RUN_OK => Ok(Status::RunOk),
ffi::BZ_FLUSH_OK => Ok(Status::FlushOk),
ffi::BZ_FINISH_OK => Ok(Status::FinishOk),
ffi::BZ_STREAM_END => Ok(Status::StreamEnd),
ffi::BZ_SEQUENCE_ERROR => Err(Error::Sequence),
c => panic!("unknown return status: {}", c),
}
}
}
/// Compress a block of input into an output vector.
///
/// This function will not grow `output`, but it will fill the space after
/// its current length up to its capacity. The length of the vector will be
/// adjusted appropriately.
pub fn compress_vec(
&mut self,
input: &[u8],
output: &mut Vec<u8>,
action: Action,
) -> Result<Status, Error> {
let cap = output.capacity();
let len = output.len();
unsafe {
let before = self.total_out();
let ret = {
let ptr = output.as_mut_ptr().offset(len as isize);
let out = slice::from_raw_parts_mut(ptr, cap - len);
self.compress(input, out, action)
};
output.set_len((self.total_out() - before) as usize + len);
return ret;
}
}
/// Total number of bytes processed as input
pub fn total_in(&self) -> u64 {
self.inner.total_in()
}
/// Total number of bytes processed as output
pub fn total_out(&self) -> u64 {
self.inner.total_out()
}
}
impl Decompress {
/// Creates a new stream prepared for decompression.
///
/// If `small` is true, then the library will use an alternative
/// decompression algorithm which uses less memory but at the cost of
/// decompressing more slowly (roughly speaking, half the speed, but the
/// maximum memory requirement drops to around 2300k). See
pub fn new(small: bool) -> Decompress {
unsafe {
let mut raw = Box::new(mem::zeroed());
assert_eq!(ffi::BZ2_bzDecompressInit(&mut *raw, 0, small as c_int), 0);
Decompress {
inner: Stream {
raw: raw,
_marker: marker::PhantomData,
},
}
}
}
/// Decompress a block of input into a block of output.
pub fn decompress(&mut self, input: &[u8], output: &mut [u8]) -> Result<Status, Error> {
self.inner.raw.next_in = input.as_ptr() as *mut _;
self.inner.raw.avail_in = input.len().min(c_uint::MAX as usize) as c_uint;
self.inner.raw.next_out = output.as_mut_ptr() as *mut _;
self.inner.raw.avail_out = output.len().min(c_uint::MAX as usize) as c_uint;
unsafe {
match ffi::BZ2_bzDecompress(&mut *self.inner.raw) {
ffi::BZ_OK => Ok(Status::Ok),
ffi::BZ_MEM_ERROR => Ok(Status::MemNeeded),
ffi::BZ_STREAM_END => Ok(Status::StreamEnd),
ffi::BZ_PARAM_ERROR => Err(Error::Param),
ffi::BZ_DATA_ERROR => Err(Error::Data),
ffi::BZ_DATA_ERROR_MAGIC => Err(Error::DataMagic),
ffi::BZ_SEQUENCE_ERROR => Err(Error::Sequence),
c => panic!("wut: {}", c),
}
}
}
/// Decompress a block of input into an output vector.
///
/// This function will not grow `output`, but it will fill the space after
/// its current length up to its capacity. The length of the vector will be
/// adjusted appropriately.
pub fn decompress_vec(&mut self, input: &[u8], output: &mut Vec<u8>) -> Result<Status, Error> {
let cap = output.capacity();
let len = output.len();
unsafe {
let before = self.total_out();
let ret = {
let ptr = output.as_mut_ptr().offset(len as isize);
let out = slice::from_raw_parts_mut(ptr, cap - len);
self.decompress(input, out)
};
output.set_len((self.total_out() - before) as usize + len);
return ret;
}
}
/// Total number of bytes processed as input
pub fn total_in(&self) -> u64 {
self.inner.total_in()
}
/// Total number of bytes processed as output
pub fn total_out(&self) -> u64 {
self.inner.total_out()
}
}
impl<D: Direction> Stream<D> {
fn total_in(&self) -> u64 {
(self.raw.total_in_lo32 as u64) | ((self.raw.total_in_hi32 as u64) << 32)
}
fn total_out(&self) -> u64 {
(self.raw.total_out_lo32 as u64) | ((self.raw.total_out_hi32 as u64) << 32)
}
}
impl error::Error for Error {}
impl fmt::Display for Error {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
let description = match self {
Error::Sequence => "bzip2: sequence of operations invalid",
Error::Data => "bzip2: invalid data",
Error::DataMagic => "bzip2: bz2 header missing",
Error::Param => "bzip2: invalid parameters",
};
f.write_str(description)
}
}
impl From<Error> for std::io::Error {
fn from(data: Error) -> std::io::Error {
std::io::Error::new(std::io::ErrorKind::Other, data)
}
}
impl Direction for DirCompress {
unsafe fn destroy(stream: *mut ffi::bz_stream) -> c_int {
ffi::BZ2_bzCompressEnd(stream)
}
}
impl Direction for DirDecompress {
unsafe fn destroy(stream: *mut ffi::bz_stream) -> c_int {
ffi::BZ2_bzDecompressEnd(stream)
}
}
impl<D: Direction> Drop for Stream<D> {
fn drop(&mut self) {
unsafe {
let _ = D::destroy(&mut *self.raw);
}
}
}