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
mod api;
use crate::{
common::{DEFAULT_BUF_SIZE, DICTIONARY_SIZE},
lz4, Error, ErrorKind, Result,
};
use api::{CompressionContext, DecompressionContext};
use std::{borrow::Cow, cmp, collections::LinkedList, pin::Pin};
pub struct Compressor<'a> {
ctx: CompressionContext,
dict: Pin<Cow<'a, [u8]>>,
safe_buf: Vec<u8>,
}
impl<'a> Compressor<'a> {
pub fn new() -> Result<Self> {
Ok(Self {
ctx: CompressionContext::new()?,
dict: Pin::new(Cow::Borrowed(&[])),
safe_buf: Vec::new(),
})
}
pub fn with_dict<D>(dict: D) -> Result<Self>
where
D: Into<Cow<'a, [u8]>>,
{
let mut comp = Self {
dict: Pin::new(dict.into()),
..Self::new()?
};
comp.ctx.load_dict(&comp.dict);
Ok(comp)
}
pub fn next(&mut self, src: &[u8], dst: &mut [u8], acc: i32) -> Result<usize> {
let src_is_empty = src.is_empty();
let acc = cmp::min(acc, 33_554_431);
let dst_len = self.ctx.next(&src, dst, acc);
self.save_dict();
if dst_len > 0 {
Ok(dst_len)
} else if src_is_empty && dst.is_empty() {
Ok(0)
} else {
Err(Error::new(ErrorKind::CompressionFailed))
}
}
pub fn next_to_vec(&mut self, src: &[u8], dst: &mut Vec<u8>, acc: i32) -> Result<usize> {
let orig_len = dst.len();
dst.reserve(lz4::max_compressed_size(src.len()));
#[allow(unsafe_code)]
unsafe {
dst.set_len(dst.capacity());
}
let result = self.next(src, &mut dst[orig_len..], acc);
dst.resize_with(orig_len + result.as_ref().unwrap_or(&0), Default::default);
result
}
fn save_dict(&mut self) {
self.safe_buf.resize(DICTIONARY_SIZE, 0);
self.ctx.save_dict(&mut self.safe_buf);
}
}
pub struct Decompressor<'a> {
ctx: DecompressionContext,
cache: LinkedList<Vec<u8>>,
cache_len: usize,
last_len: usize,
dict: Pin<Cow<'a, [u8]>>,
}
impl<'a> Decompressor<'a> {
pub fn new() -> Result<Self> {
Ok(Self {
ctx: DecompressionContext::new()?,
cache: LinkedList::new(),
cache_len: 0,
last_len: 0,
dict: Pin::new(Cow::Borrowed(&[])),
})
}
pub fn with_dict<D>(dict: D) -> Result<Self>
where
D: Into<Cow<'a, [u8]>>,
{
let mut decomp = Self {
dict: Pin::new(dict.into()),
..Self::new()?
};
decomp.ctx.reset(&decomp.dict)?;
Ok(decomp)
}
pub fn next(&mut self, src: &[u8], original_size: usize) -> Result<&[u8]> {
if self
.cache
.back()
.map(|v| v.capacity() - v.len())
.filter(|n| *n >= original_size)
.is_none()
{
self.cache.push_back(Vec::with_capacity(cmp::max(
original_size,
DEFAULT_BUF_SIZE,
)));
}
let back = self.cache.back_mut().unwrap();
let len = back.len();
#[allow(unsafe_code)]
unsafe {
back.set_len(len + original_size);
}
let dst_len = self.ctx.decompress(src, &mut back[len..])?;
self.last_len = original_size;
self.cache_len += dst_len;
while let Some(len) = self
.cache
.front()
.map(Vec::len)
.filter(|n| self.cache_len - n >= DICTIONARY_SIZE)
{
self.cache.pop_front();
self.cache_len -= len;
}
Ok(self.data())
}
fn data(&self) -> &[u8] {
if let Some(back) = self.cache.back() {
let offset = back.len() - self.last_len;
&back[offset..]
} else {
&[]
}
}
}