libzstd-rs-sys 0.0.0

a rust implementation of zstd compression and decompression
Documentation
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
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
use libc::size_t;

use crate::lib::common::fse::{
    FSE_DTableHeader, FSE_decode_t, FSE_MAX_SYMBOL_VALUE, FSE_MAX_TABLELOG,
};
use crate::lib::common::{
    bitstream::{BIT_DStream_t, StreamStatus},
    entropy_common::{DTable, FSE_readNCount_bmi2, Workspace},
    error_private::Error,
};

#[derive(Copy, Clone, Debug, PartialEq)]
#[repr(C, align(4))]
pub(crate) struct FSE_DTable {
    pub header: FSE_DTableHeader,
}

#[derive(Copy, Clone, Debug, PartialEq)]
#[repr(C)]
pub(crate) struct FSE_DecompressWksp {
    pub ncount: [core::ffi::c_short; 256],
}

#[derive(Copy, Clone)]
#[repr(C)]
struct FSE_DState_t<'a> {
    state: usize,
    table: &'a [FSE_decode_t; 90],
}

impl<'a> FSE_DState_t<'a> {
    fn new(bitD: &mut BIT_DStream_t, dt: &'a DTable) -> Self {
        let state = bitD.read_bits(dt.header.tableLog as core::ffi::c_uint);
        let _ = bitD.reload();
        let table = &dt.elements;

        Self { state, table }
    }

    #[inline]
    fn decode_symbol(&mut self, bitD: &mut BIT_DStream_t) -> u8 {
        let FSE_decode_t {
            nbBits,
            symbol,
            newState,
        } = self.table[self.state];

        let lowBits = bitD.read_bits(u32::from(nbBits));
        self.state = usize::from(newState) + lowBits;

        symbol
    }

    #[inline]
    fn decode_symbol_fast(&mut self, bitD: &mut BIT_DStream_t) -> u8 {
        let FSE_decode_t {
            nbBits,
            symbol,
            newState,
        } = self.table[self.state];

        let lowBits = bitD.read_bits_fast(u32::from(nbBits));
        self.state = usize::from(newState) + lowBits;

        symbol
    }
}

fn FSE_buildDTable_internal(
    dt: &mut DTable,
    normalizedCounter: &[core::ffi::c_short; 256],
    maxSymbolValue: core::ffi::c_uint,
    tableLog: core::ffi::c_uint,
) -> Result<(), Error> {
    let wkspSize = dt.elements[(1 << tableLog)..].len() * 4;
    let (header, elements, symbols, spread) = dt.destructure_mut(maxSymbolValue, tableLog);
    let maxSV1 = maxSymbolValue.wrapping_add(1);
    let tableSize = ((1) << tableLog) as u32;
    let mut highThreshold = tableSize.wrapping_sub(1);

    if ((::core::mem::size_of::<core::ffi::c_short>() as core::ffi::c_ulong)
        .wrapping_mul(maxSymbolValue.wrapping_add(1) as core::ffi::c_ulong)
        as core::ffi::c_ulonglong)
        .wrapping_add((1) << tableLog)
        .wrapping_add(8)
        > wkspSize as core::ffi::c_ulonglong
    {
        return Err(Error::maxSymbolValue_tooLarge);
    }

    if maxSymbolValue > FSE_MAX_SYMBOL_VALUE as core::ffi::c_uint {
        return Err(Error::maxSymbolValue_tooLarge);
    }

    if tableLog > FSE_MAX_TABLELOG as core::ffi::c_uint {
        return Err(Error::tableLog_tooLarge);
    }

    let mut DTableH = FSE_DTableHeader {
        tableLog: tableLog as u16,
        fastMode: 1,
    };

    let largeLimit = ((1) << tableLog.wrapping_sub(1)) as i16;
    let mut s: u32 = 0;
    s = 0;
    while s < maxSV1 {
        if normalizedCounter[s as usize] as core::ffi::c_int == -(1) {
            let fresh0 = highThreshold;
            highThreshold = highThreshold.wrapping_sub(1);
            elements[fresh0 as usize].symbol = s as u8;
            symbols[s as usize] = 1;
        } else {
            if normalizedCounter[s as usize] as core::ffi::c_int >= largeLimit as core::ffi::c_int {
                DTableH.fastMode = 0;
            }
            symbols[s as usize] = normalizedCounter[s as usize] as u16;
        }
        s = s.wrapping_add(1);
    }

    *header = DTableH;

    if highThreshold == tableSize.wrapping_sub(1) {
        let tableMask = tableSize.wrapping_sub(1) as size_t;
        let step = (tableSize >> 1)
            .wrapping_add(tableSize >> 3)
            .wrapping_add(3) as size_t;
        let add = 0x101010101010101u64;
        let mut pos = 0 as size_t;
        let mut sv = 0u64;

        for s_0 in 0..maxSV1 {
            let mut i: core::ffi::c_int = 0;
            let n = normalizedCounter[s_0 as usize] as core::ffi::c_int;
            spread[pos as usize..][..8].copy_from_slice(&sv.to_le_bytes());
            i = 8;
            while i < n {
                spread[pos as usize..][i as usize..][..8].copy_from_slice(&sv.to_le_bytes());
                i += 8;
            }
            pos = pos.wrapping_add(n as size_t);
            sv = sv.wrapping_add(add);
        }

        let mut position = 0 as size_t;
        let mut s_1: size_t = 0;
        let unroll = 2;
        s_1 = 0;
        while s_1 < tableSize as size_t {
            let mut u: size_t = 0;
            u = 0;
            while u < unroll {
                let uPosition = position.wrapping_add(u * step) & tableMask;
                elements[uPosition as usize].symbol = spread[(s_1 + u) as usize];
                u = u.wrapping_add(1);
            }
            position = position.wrapping_add(unroll * step) & tableMask;
            s_1 = s_1.wrapping_add(unroll);
        }
    } else {
        let tableMask_0 = tableSize.wrapping_sub(1);
        let step_0 = (tableSize >> 1)
            .wrapping_add(tableSize >> 3)
            .wrapping_add(3);

        let mut position_0 = 0u32;
        for s_2 in 0..maxSV1 {
            for _ in 0..normalizedCounter[s_2 as usize] {
                elements[position_0 as usize].symbol = s_2 as u8;
                position_0 = position_0.wrapping_add(step_0) & tableMask_0;
                while position_0 > highThreshold {
                    position_0 = position_0.wrapping_add(step_0) & tableMask_0;
                }
            }
        }

        if position_0 != 0 {
            return Err(Error::GENERIC);
        }
    }

    for u in 0..tableSize {
        let symbol = usize::from((elements[u as usize]).symbol);
        let nextState = u32::from(symbols[symbol]);
        symbols[symbol] += 1;
        (elements[u as usize]).nbBits = tableLog.wrapping_sub(nextState.ilog2()) as u8;
        (elements[u as usize]).newState = (nextState
            << (elements[u as usize]).nbBits as core::ffi::c_int)
            .wrapping_sub(tableSize) as u16;
    }

    Ok(())
}

#[inline(always)]
fn FSE_decompress_usingDTable_generic(
    dst: &mut [u8],
    cSrc: &[u8],
    dt: &DTable,
    fast: bool,
) -> Result<usize, Error> {
    enum Mode {
        Slow,
        Fast,
    }

    let mode = if fast { Mode::Fast } else { Mode::Slow };

    let mut op = 0;
    let omax = dst.len();
    let olimit = omax - 3;

    let mut bitD = BIT_DStream_t::new(cSrc)?;

    let mut state1 = FSE_DState_t::new(&mut bitD, dt);
    let mut state2 = FSE_DState_t::new(&mut bitD, dt);

    if let StreamStatus::Overflow = bitD.reload() {
        return Err(Error::corruption_detected);
    }

    while bitD.reload() == StreamStatus::Unfinished && op < olimit {
        dst[op] = match mode {
            Mode::Fast => state1.decode_symbol_fast(&mut bitD),
            Mode::Slow => state1.decode_symbol(&mut bitD),
        };

        if (FSE_MAX_TABLELOG * 2 + 7) as core::ffi::c_ulong
            > (::core::mem::size_of::<usize>() as core::ffi::c_ulong).wrapping_mul(8)
        {
            let _ = bitD.reload();
        }

        dst[op + 1] = match mode {
            Mode::Fast => state2.decode_symbol_fast(&mut bitD),
            Mode::Slow => state2.decode_symbol(&mut bitD),
        };

        if (FSE_MAX_TABLELOG * 4 + 7) as core::ffi::c_ulong
            > (size_of::<usize>() as core::ffi::c_ulong).wrapping_mul(8)
            && bitD.reload() != StreamStatus::Unfinished
        {
            op += 2;
            break;
        }

        dst[op + 2] = match mode {
            Mode::Fast => state1.decode_symbol_fast(&mut bitD),
            Mode::Slow => state1.decode_symbol(&mut bitD),
        };

        if (FSE_MAX_TABLELOG * 2 + 7) as core::ffi::c_ulong
            > (::core::mem::size_of::<usize>() as core::ffi::c_ulong).wrapping_mul(8)
        {
            let _ = bitD.reload();
        }

        dst[op + 3] = match mode {
            Mode::Fast => state2.decode_symbol_fast(&mut bitD),
            Mode::Slow => state2.decode_symbol(&mut bitD),
        };

        op += 4;
    }

    loop {
        if op > omax - 2 {
            return Err(Error::dstSize_tooSmall);
        }

        dst[op] = match mode {
            Mode::Fast => state1.decode_symbol_fast(&mut bitD),
            Mode::Slow => state1.decode_symbol(&mut bitD),
        };
        op += 1;

        if let StreamStatus::Overflow = bitD.reload() {
            dst[op] = match mode {
                Mode::Fast => state2.decode_symbol_fast(&mut bitD),
                Mode::Slow => state2.decode_symbol(&mut bitD),
            };
            op += 1;
            break;
        } else {
            if op > omax - 2 {
                return Err(Error::dstSize_tooSmall);
            }

            dst[op] = match mode {
                Mode::Fast => state2.decode_symbol_fast(&mut bitD),
                Mode::Slow => state2.decode_symbol(&mut bitD),
            };
            op += 1;

            match bitD.reload() {
                StreamStatus::Overflow => { /* fall through */ }
                _ => continue,
            }

            dst[op] = match mode {
                Mode::Fast => state1.decode_symbol_fast(&mut bitD),
                Mode::Slow => state1.decode_symbol(&mut bitD),
            };
            op += 1;

            break;
        }
    }

    Ok(op)
}

#[inline(always)]
fn FSE_decompress_wksp_body(
    dst: &mut [u8],
    cSrc: &[u8],
    maxLog: core::ffi::c_uint,
    workspace: &mut Workspace,
    bmi2: core::ffi::c_int,
) -> Result<size_t, Error> {
    let mut wkspSize = size_of::<Workspace>();

    let mut tableLog: core::ffi::c_uint = 0;
    let mut maxSymbolValue = FSE_MAX_SYMBOL_VALUE as core::ffi::c_uint;
    if wkspSize < ::core::mem::size_of::<FSE_DecompressWksp>() {
        return Err(Error::GENERIC);
    }
    let NCountLength = FSE_readNCount_bmi2(
        &mut workspace.a.ncount,
        &mut maxSymbolValue,
        &mut tableLog,
        cSrc,
        bmi2,
    )?;

    if tableLog > maxLog {
        return Err(Error::tableLog_tooLarge);
    }
    let ip = &cSrc[NCountLength as usize..];
    if ((1 + ((1) << tableLog) + 1) as core::ffi::c_ulonglong)
        .wrapping_add(
            ((::core::mem::size_of::<core::ffi::c_short>() as core::ffi::c_ulong)
                .wrapping_mul(maxSymbolValue.wrapping_add(1) as core::ffi::c_ulong)
                as core::ffi::c_ulonglong)
                .wrapping_add((1) << tableLog)
                .wrapping_add(8)
                .wrapping_add(
                    ::core::mem::size_of::<core::ffi::c_uint>() as core::ffi::c_ulong
                        as core::ffi::c_ulonglong,
                )
                .wrapping_sub(1)
                .wrapping_div(
                    ::core::mem::size_of::<core::ffi::c_uint>() as core::ffi::c_ulong
                        as core::ffi::c_ulonglong,
                ),
        )
        .wrapping_add(FSE_MAX_SYMBOL_VALUE.div_ceil(2) as core::ffi::c_ulonglong)
        .wrapping_add(1)
        .wrapping_mul(
            ::core::mem::size_of::<core::ffi::c_uint>() as core::ffi::c_ulong
                as core::ffi::c_ulonglong,
        )
        > wkspSize as core::ffi::c_ulonglong
    {
        return Err(Error::tableLog_tooLarge);
    }
    wkspSize = wkspSize.wrapping_sub((::core::mem::size_of::<FSE_DecompressWksp>()).wrapping_add(
        (1usize + (1 << tableLog)).wrapping_mul(::core::mem::size_of::<FSE_DTable>()),
    ));

    let () = FSE_buildDTable_internal(
        &mut workspace.dtable,
        &workspace.a.ncount,
        maxSymbolValue,
        tableLog,
    )?;

    FSE_decompress_usingDTable_generic(
        dst,
        ip,
        &workspace.dtable,
        workspace.dtable.header.fastMode != 0,
    )
}

fn FSE_decompress_wksp_body_default(
    dst: &mut [u8],
    cSrc: &[u8],
    maxLog: core::ffi::c_uint,
    workSpace: &mut Workspace,
) -> Result<size_t, Error> {
    FSE_decompress_wksp_body(dst, cSrc, maxLog, workSpace, 0)
}

fn FSE_decompress_wksp_body_bmi2(
    dst: &mut [u8],
    cSrc: &[u8],
    maxLog: core::ffi::c_uint,
    workSpace: &mut Workspace,
) -> Result<size_t, Error> {
    FSE_decompress_wksp_body(dst, cSrc, maxLog, workSpace, 1)
}

pub(super) fn FSE_decompress_wksp_bmi2(
    dst: &mut [u8],
    cSrc: &[u8],
    maxLog: core::ffi::c_uint,
    workSpace: &mut Workspace,
    bmi2: bool,
) -> Result<size_t, Error> {
    if bmi2 {
        FSE_decompress_wksp_body_bmi2(dst, cSrc, maxLog, workSpace)
    } else {
        FSE_decompress_wksp_body_default(dst, cSrc, maxLog, workSpace)
    }
}