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
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
//! Codebook support for bitstream reader.
//!
//! Codebook is a set of unique bit strings and values assigned to them.

use std::cmp::{max, min};
use std::collections::HashMap;
use std::marker::PhantomData;

use num_traits::AsPrimitive;
use thiserror::Error;

use crate::bitread::*;

/// Codebook operations errors.
#[derive(Debug, Error)]
pub enum CodebookError {
    /// The codebook is invalid.
    #[error("Invalid Codebook")]
    InvalidCodebook,
    /// The analyzed bitstream is not present in the codebook.
    #[error("Invalid Code")]
    InvalidCode,
}

use self::CodebookError::*;

/// Codebook operation modes.
#[derive(Debug, Copy, Clone)]
#[allow(clippy::upper_case_acronyms)]
pub enum CodebookMode {
    /// Codes in the codebook should be read most significant bit first.
    MSB,
    /// Codes in the codebook should be read least significant bit first.
    LSB,
}

/// Codebook description for `(code bits, code length, code value)` triplet.
pub struct FullCodebookDesc<S> {
    /// Codeword bits.
    pub code: u32,
    /// Codeword length.
    pub bits: u8,
    /// Codeword value (symbol).
    pub sym: S,
}

/// Codebook description for `(code bits, code length)` pair with array index
/// being used as codeword value.
pub struct ShortCodebookDesc {
    /// Codeword bits.
    pub code: u32,
    /// Codeword length.
    pub bits: u8,
}

/// This trait defines a series of methods to get some information
/// from a codebook.
pub trait CodebookDescReader<S> {
    /// Returns the codeword length for the provided index.
    fn bits(&self, idx: usize) -> u8;
    /// Returns the codeword bits for the provided index.
    fn code(&self, idx: usize) -> u32;
    /// Returns the codeword value (codeword symbol) for the provided index.
    fn sym(&self, idx: usize) -> S;

    /// Returns the total number of defined codewords.
    fn len(&self) -> usize;
    /// Tells if the codebook is empty or not.
    fn is_empty(&self) -> bool;
}

/// The codebook structure for code reading.
#[allow(dead_code)]
pub struct Codebook<S> {
    table: Vec<u32>,
    syms: Vec<S>,
    lut_bits: u8,
}

/// Adopted by a bitreader to use codebook for decoding bit sequences.
pub trait CodebookReader<S> {
    /// Reads the codeword from a bitstream and returns its value.
    fn read_cb(&mut self, cb: &Codebook<S>) -> Result<S, CodebookError>;
}

/// Returns the reversed sequence of bits passed as input.
pub fn reverse_bits(inval: u32) -> u32 {
    const REV_TAB: [u8; 16] = [
        0b0000, 0b1000, 0b0100, 0b1100, 0b0010, 0b1010, 0b0110, 0b1110, 0b0001, 0b1001, 0b0101,
        0b1101, 0b0011, 0b1011, 0b0111, 0b1111,
    ];

    let mut ret = 0;
    let mut val = inval;
    for _ in 0..8 {
        ret = (ret << 4) | u32::from(REV_TAB[(val & 0xF) as usize]);
        val >>= 4;
    }
    ret
}

const TABLE_FILL_VALUE: u32 = 0x7F;
const MAX_LUT_BITS: u8 = 10;

fn fill_lut_msb(
    table: &mut [u32],
    off: usize,
    code: u32,
    bits: u8,
    lut_bits: u8,
    symidx: u32,
    esc: bool,
) {
    if !esc {
        let fill_len = lut_bits - bits;
        let fill_size = 1 << fill_len;
        let fill_code = code << (lut_bits - bits);
        let lut_value = (symidx << 8) | u32::from(bits);
        for j in 0..fill_size {
            let idx = (fill_code + j) as usize;
            table[idx + off] = lut_value;
        }
    } else {
        let idx = (code as usize) + off;
        table[idx] = (symidx << 8) | 0x80 | u32::from(bits);
    }
}

fn fill_lut_lsb(
    table: &mut [u32],
    off: usize,
    code: u32,
    bits: u8,
    lut_bits: u8,
    symidx: u32,
    esc: bool,
) {
    if !esc {
        let fill_len = lut_bits - bits;
        let fill_size = 1 << fill_len;
        let fill_code = code;
        let step = lut_bits - fill_len;
        for j in 0..fill_size {
            let idx = (fill_code + (j << step)) as usize;
            table[idx + off] = (symidx << 8) | u32::from(bits);
        }
    } else {
        let idx = (code as usize) + off;
        table[idx] = (symidx << 8) | 0x80 | u32::from(bits);
    }
}

fn fill_lut(
    table: &mut [u32],
    mode: CodebookMode,
    off: usize,
    code: u32,
    bits: u8,
    lut_bits: u8,
    symidx: u32,
    esc: bool,
) -> bool {
    match mode {
        CodebookMode::MSB => fill_lut_msb(table, off, code, bits, lut_bits, symidx, esc),
        CodebookMode::LSB => fill_lut_lsb(table, off, code, bits, lut_bits, symidx, esc),
    };
    bits > lut_bits
}

fn resize_table(table: &mut Vec<u32>, bits: u8) -> u32 {
    let add_size = (1 << bits) as usize;
    table.reserve(add_size);
    let cur_off = table.len() as u32;
    let new_size = table.len() + add_size;
    table.resize(new_size, TABLE_FILL_VALUE);
    cur_off
}

fn extract_lut_part(code: u32, bits: u8, lut_bits: u8, mode: CodebookMode) -> u32 {
    match mode {
        CodebookMode::MSB => code >> (bits - lut_bits),
        CodebookMode::LSB => code & ((1 << lut_bits) - 1),
    }
}

fn extract_esc_part(code: u32, bits: u8, lut_bits: u8, mode: CodebookMode) -> u32 {
    match mode {
        CodebookMode::MSB => code & ((1 << (bits - lut_bits)) - 1),
        CodebookMode::LSB => code >> lut_bits,
    }
}

#[derive(Clone, Copy)]
struct Code {
    code: u32,
    bits: u8,
    idx: usize,
}

struct CodeBucket {
    maxlen: u8,
    offset: usize,
    codes: Vec<Code>,
}

impl CodeBucket {
    fn new() -> Self {
        CodeBucket {
            maxlen: 0,
            offset: 0,
            codes: Vec::new(),
        }
    }
    fn add_code(&mut self, c: Code) {
        if c.bits > self.maxlen {
            self.maxlen = c.bits;
        }
        self.codes.push(c);
    }
}

type EscapeCodes = HashMap<u32, CodeBucket>;

fn add_esc_code(cc: &mut EscapeCodes, key: u32, code: u32, bits: u8, idx: usize) {
    let bucket = cc.entry(key).or_insert_with(CodeBucket::new);
    bucket.add_code(Code { code, bits, idx });
}

fn build_esc_lut(
    table: &mut Vec<u32>,
    mode: CodebookMode,
    bucket: &CodeBucket,
) -> Result<(), CodebookError> {
    let mut escape_list: EscapeCodes = HashMap::new();
    let maxlen = min(bucket.maxlen, MAX_LUT_BITS);

    for code in &bucket.codes {
        let bits = code.bits;
        if code.bits <= MAX_LUT_BITS {
            fill_lut(
                table,
                mode,
                bucket.offset,
                code.code,
                bits,
                maxlen,
                code.idx as u32,
                false,
            );
        } else {
            let ckey = extract_lut_part(code.code, bits, MAX_LUT_BITS, mode);
            let cval = extract_esc_part(code.code, bits, MAX_LUT_BITS, mode);
            add_esc_code(&mut escape_list, ckey, cval, bits - MAX_LUT_BITS, code.idx);
        }
    }

    let cur_offset = bucket.offset;
    for (ckey, sec_bucket) in &mut escape_list {
        let key = *ckey as u32;
        let maxlen = min(sec_bucket.maxlen, MAX_LUT_BITS);
        let new_off = resize_table(table, maxlen);
        fill_lut(
            table,
            mode,
            cur_offset,
            key,
            maxlen,
            MAX_LUT_BITS,
            new_off,
            true,
        );
        sec_bucket.offset = new_off as usize;
    }

    for sec_bucket in escape_list.values() {
        build_esc_lut(table, mode, sec_bucket)?;
    }

    Ok(())
}

impl<S: Copy> Codebook<S> {
    /// Constructs a new `Codebook` instance using provided
    /// codebook description and mode.
    pub fn new(cb: &dyn CodebookDescReader<S>, mode: CodebookMode) -> Result<Self, CodebookError> {
        let mut maxbits = 0;
        let mut nnz = 0;
        let mut escape_list: EscapeCodes = HashMap::new();

        let mut symidx: usize = 0;
        for i in 0..cb.len() {
            let bits = cb.bits(i);
            if bits > 0 {
                nnz += 1;
            }
            maxbits = max(bits, maxbits);
            if bits > MAX_LUT_BITS {
                let code = cb.code(i);
                let ckey = extract_lut_part(code, bits, MAX_LUT_BITS, mode);
                let cval = extract_esc_part(code, bits, MAX_LUT_BITS, mode);
                add_esc_code(&mut escape_list, ckey, cval, bits - MAX_LUT_BITS, symidx);
            }
            if bits > 0 {
                symidx += 1;
            }
        }
        if maxbits == 0 {
            return Err(InvalidCodebook);
        }

        if maxbits > MAX_LUT_BITS {
            maxbits = MAX_LUT_BITS;
        }

        let tab_len = 1 << maxbits;
        let mut table: Vec<u32> = Vec::with_capacity(tab_len);
        let mut syms: Vec<S> = Vec::with_capacity(nnz);
        table.resize(tab_len, TABLE_FILL_VALUE);

        let mut symidx: u32 = 0;
        for i in 0..cb.len() {
            let bits = cb.bits(i);
            let code = cb.code(i);
            if bits == 0 {
                continue;
            }
            if bits <= MAX_LUT_BITS {
                fill_lut(&mut table, mode, 0, code, bits, maxbits, symidx, false);
            } else {
                let ckey = extract_lut_part(code, bits, MAX_LUT_BITS, mode) as usize;
                if table[ckey] == TABLE_FILL_VALUE {
                    let key = ckey as u32;
                    if let Some(bucket) = escape_list.get_mut(&key) {
                        let maxlen = min(bucket.maxlen, MAX_LUT_BITS);
                        let new_off = resize_table(&mut table, maxlen);
                        fill_lut(
                            &mut table,
                            mode,
                            0,
                            key,
                            maxlen,
                            MAX_LUT_BITS,
                            new_off,
                            true,
                        );
                        bucket.offset = new_off as usize;
                    }
                }
            }
            symidx += 1;
        }

        for bucket in escape_list.values() {
            build_esc_lut(&mut table, mode, bucket)?;
        }

        for i in 0..cb.len() {
            if cb.bits(i) > 0 {
                syms.push(cb.sym(i));
            }
        }

        Ok(Codebook {
            table,
            syms,
            lut_bits: maxbits,
        })
    }
}

impl<'a, S: Copy, B: BitRead<'a>> CodebookReader<S> for B {
    fn read_cb(&mut self, cb: &Codebook<S>) -> Result<S, CodebookError> {
        let mut esc = true;
        let mut idx = 0;
        let mut lut_bits = cb.lut_bits;
        while esc {
            let lut_idx = (self.peek_bits_32(lut_bits as usize) as usize) + (idx as usize);
            if cb.table[lut_idx] == TABLE_FILL_VALUE {
                return Err(InvalidCode);
            }
            let bits = cb.table[lut_idx] & 0x7F;
            esc = (cb.table[lut_idx] & 0x80) != 0;
            idx = (cb.table[lut_idx] >> 8) as usize;
            if bits > self.available() as u32 {
                return Err(InvalidCode);
            }
            let skip_bits = if esc {
                lut_bits as usize
            } else {
                bits as usize
            };
            self.skip_bits(skip_bits);
            lut_bits = bits as u8;
        }
        Ok(cb.syms[idx])
    }
}

impl<S: Copy> CodebookDescReader<S> for Vec<FullCodebookDesc<S>> {
    fn bits(&self, idx: usize) -> u8 {
        self[idx].bits
    }
    fn code(&self, idx: usize) -> u32 {
        self[idx].code
    }
    fn sym(&self, idx: usize) -> S {
        self[idx].sym
    }
    fn len(&self) -> usize {
        Vec::len(self)
    }
    fn is_empty(&self) -> bool {
        Vec::is_empty(self)
    }
}

impl CodebookDescReader<u32> for Vec<ShortCodebookDesc> {
    fn bits(&self, idx: usize) -> u8 {
        self[idx].bits
    }
    fn code(&self, idx: usize) -> u32 {
        self[idx].code
    }
    fn sym(&self, idx: usize) -> u32 {
        idx as u32
    }
    fn len(&self) -> usize {
        Vec::len(self)
    }
    fn is_empty(&self) -> bool {
        Vec::is_empty(self)
    }
}

impl<'a, S: Copy> CodebookDescReader<S> for &'a [FullCodebookDesc<S>] {
    fn bits(&self, idx: usize) -> u8 {
        self[idx].bits
    }
    fn code(&self, idx: usize) -> u32 {
        self[idx].code
    }
    fn sym(&self, idx: usize) -> S {
        self[idx].sym
    }
    fn len(&self) -> usize {
        <[FullCodebookDesc<S>]>::len(self)
    }
    fn is_empty(&self) -> bool {
        <[FullCodebookDesc<S>]>::is_empty(self)
    }
}

impl<'a> CodebookDescReader<u32> for &'a [ShortCodebookDesc] {
    fn bits(&self, idx: usize) -> u8 {
        self[idx].bits
    }
    fn code(&self, idx: usize) -> u32 {
        self[idx].code
    }
    fn sym(&self, idx: usize) -> u32 {
        idx as u32
    }
    fn len(&self) -> usize {
        <[ShortCodebookDesc]>::len(self)
    }
    fn is_empty(&self) -> bool {
        <[ShortCodebookDesc]>::is_empty(self)
    }
}

/// Flexible codebook description that uses two separate arrays for
/// codeword bits and lengths.
pub struct TableCodebookDescReader<CodeType: 'static, SymType> {
    bits: &'static [u8],
    codes: &'static [CodeType],
    _sym: PhantomData<SymType>,
}

impl<CodeType, SymType> CodebookDescReader<SymType> for TableCodebookDescReader<CodeType, SymType>
where
    CodeType: Copy + Into<u32> + 'static,
    SymType: Copy + 'static,
    usize: AsPrimitive<SymType>,
{
    fn bits(&self, idx: usize) -> u8 {
        self.bits[idx]
    }
    fn code(&self, idx: usize) -> u32 {
        self.codes[idx].into()
    }
    fn sym(&self, idx: usize) -> SymType {
        idx.as_()
    }
    fn len(&self) -> usize {
        self.bits.len()
    }
    fn is_empty(&self) -> bool {
        self.bits.is_empty()
    }
}

#[cfg(test)]
mod test {
    use super::*;

    const BITS: [u8; 8] = [0b01011011, 0b10111100, 0b11111111, 0, 0, 0, 0, 0];

    #[test]
    fn test_refill_codebook_msb() {
        // make sure reading codes across 8-byte boundary works
        let bits = [
            0b1111_1000,
            0b0011_1110,
            0b0000_1111,
            0b1000_0011,
            0b1110_0000,
            0b1111_1000,
            0b0011_1110,
            0b0000_1111,
            0b1000_0000,
            0,
            0,
            0,
            0,
            0,
            0,
            0,
        ];

        let cb_desc: Vec<ShortCodebookDesc> = vec![
            ShortCodebookDesc {
                code: 0b11111,
                bits: 5,
            },
            ShortCodebookDesc {
                code: 0b00000,
                bits: 5,
            },
        ];
        let buf = &bits;
        let mut br = BitReadBE::new(buf);
        let cb = Codebook::new(&cb_desc, CodebookMode::MSB).unwrap();

        assert_eq!(br.read_cb(&cb).unwrap(), 0);
        assert_eq!(br.read_cb(&cb).unwrap(), 1);
        assert_eq!(br.read_cb(&cb).unwrap(), 0);
        assert_eq!(br.read_cb(&cb).unwrap(), 1);
        assert_eq!(br.read_cb(&cb).unwrap(), 0);
        assert_eq!(br.read_cb(&cb).unwrap(), 1);
        assert_eq!(br.read_cb(&cb).unwrap(), 0);
        assert_eq!(br.read_cb(&cb).unwrap(), 1);
        assert_eq!(br.read_cb(&cb).unwrap(), 0);
        assert_eq!(br.read_cb(&cb).unwrap(), 1);
        assert_eq!(br.read_cb(&cb).unwrap(), 0);
        assert_eq!(br.read_cb(&cb).unwrap(), 1);
        assert_eq!(br.read_cb(&cb).unwrap(), 0);
        assert_eq!(br.read_cb(&cb).unwrap(), 1);
    }

    #[test]
    fn test_full_codebook_msb() {
        let cb_desc: Vec<FullCodebookDesc<i8>> = vec![
            FullCodebookDesc {
                code: 0b0,
                bits: 1,
                sym: 16,
            },
            FullCodebookDesc {
                code: 0b10,
                bits: 2,
                sym: -3,
            },
            FullCodebookDesc {
                code: 0b110,
                bits: 3,
                sym: 42,
            },
            FullCodebookDesc {
                code: 0b1110,
                bits: 4,
                sym: -42,
            },
        ];
        let buf = &BITS;
        let mut br = BitReadBE::new(buf);
        let cb = Codebook::new(&cb_desc, CodebookMode::MSB).unwrap();

        assert_eq!(br.read_cb(&cb).unwrap(), 16);
        assert_eq!(br.read_cb(&cb).unwrap(), -3);
        assert_eq!(br.read_cb(&cb).unwrap(), 42);
        assert_eq!(br.read_cb(&cb).unwrap(), -42);
        let ret = br.read_cb(&cb);
        if let Err(e) = ret {
            assert_matches::assert_matches!(e, InvalidCode);
        } else {
            assert_eq!(0, 1);
        }
    }

    #[test]
    fn test_short_codebook_msb() {
        let scb_desc: Vec<ShortCodebookDesc> = vec![
            ShortCodebookDesc { code: 0b0, bits: 1 },
            ShortCodebookDesc { code: 0, bits: 0 },
            ShortCodebookDesc {
                code: 0b10,
                bits: 2,
            },
            ShortCodebookDesc { code: 0, bits: 0 },
            ShortCodebookDesc { code: 0, bits: 0 },
            ShortCodebookDesc {
                code: 0b110,
                bits: 3,
            },
            ShortCodebookDesc { code: 0, bits: 0 },
            ShortCodebookDesc {
                code: 0b11100,
                bits: 5,
            },
            ShortCodebookDesc {
                code: 0b11101,
                bits: 5,
            },
            ShortCodebookDesc {
                code: 0b1111010,
                bits: 7,
            },
            ShortCodebookDesc {
                code: 0b1111011,
                bits: 7,
            },
            ShortCodebookDesc {
                code: 0b1111110,
                bits: 7,
            },
            ShortCodebookDesc {
                code: 0b11111111,
                bits: 8,
            },
        ];
        let buf = &BITS;
        let mut br2 = BitReadBE::new(buf);
        let cb = Codebook::new(&scb_desc, CodebookMode::MSB).unwrap();
        assert_eq!(br2.read_cb(&cb).unwrap(), 0);
        assert_eq!(br2.read_cb(&cb).unwrap(), 2);
        assert_eq!(br2.read_cb(&cb).unwrap(), 5);
        assert_eq!(br2.read_cb(&cb).unwrap(), 8);

        assert_eq!(
            reverse_bits(0b0000_0101_1011_1011_1101_1111_0111_1111),
            0b1111_1110_1111_1011_1101_1101_1010_0000
        );
    }

    #[test]
    fn test_short_codebook_lsb() {
        const BITS_LE: [u8; 8] = [0b11101111, 0b01110010, 0b01, 0, 0, 0, 0, 0];
        let buf = &BITS_LE;
        let scble_desc: Vec<ShortCodebookDesc> = vec![
            ShortCodebookDesc {
                code: 0b00,
                bits: 2,
            },
            ShortCodebookDesc { code: 0, bits: 0 },
            ShortCodebookDesc {
                code: 0b01,
                bits: 2,
            },
            ShortCodebookDesc { code: 0, bits: 0 },
            ShortCodebookDesc { code: 0, bits: 0 },
            ShortCodebookDesc {
                code: 0b011,
                bits: 3,
            },
            ShortCodebookDesc { code: 0, bits: 0 },
            ShortCodebookDesc {
                code: 0b10111,
                bits: 5,
            },
            ShortCodebookDesc {
                code: 0b00111,
                bits: 5,
            },
            ShortCodebookDesc {
                code: 0b0101111,
                bits: 7,
            },
            ShortCodebookDesc {
                code: 0b0111111,
                bits: 7,
            },
            ShortCodebookDesc {
                code: 0b1011101111,
                bits: 10,
            },
        ];
        let mut brl = BitReadLE::new(buf);
        let cb = Codebook::new(&scble_desc, CodebookMode::LSB).unwrap();
        assert_eq!(brl.read_cb(&cb).unwrap(), 11);
        assert_eq!(brl.read_cb(&cb).unwrap(), 0);
        assert_eq!(brl.read_cb(&cb).unwrap(), 7);
        assert_eq!(brl.read_cb(&cb).unwrap(), 0);
    }
}