j2k-native 0.6.0

Pure-Rust JPEG 2000 codec engine for j2k
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
418
419
420
//! MQ arithmetic encoder for JPEG 2000 (ITU-T T.800 Annex C).
//!
//! This is the encoding counterpart of `arithmetic_decoder.rs`.
//! It uses the same QE probability table and context state machine.

use alloc::vec::Vec;

/// MQ arithmetic encoder context (identical layout to decoder context).
///
/// Bits 0-6: state index (0-46) into the QE table.
/// Bit 7: MPS (Most Probable Symbol, 0 or 1).
#[derive(Copy, Clone, Debug, Default)]
pub(crate) struct ArithmeticEncoderContext(u8);

impl ArithmeticEncoderContext {
    #[inline(always)]
    pub(crate) fn index(self) -> u32 {
        (self.0 & 0x7F) as u32
    }

    #[inline(always)]
    pub(crate) fn mps(self) -> u32 {
        (self.0 >> 7) as u32
    }

    #[inline(always)]
    fn set_index(&mut self, index: u8) {
        self.0 = (self.0 & 0x80) | index;
    }

    #[inline(always)]
    fn xor_mps(&mut self, val: u32) {
        self.0 ^= ((val & 1) << 7) as u8;
    }

    #[inline(always)]
    pub(crate) fn reset_with_index(&mut self, index: u8) {
        self.0 = index;
    }
}

/// QE table entry for the MQ coder (Table C.2).
#[derive(Debug, Clone, Copy)]
struct QeData {
    qe: u32,
    nmps: u8,
    nlps: u8,
    switch: bool,
}

macro_rules! qe {
    ($($qe:expr, $nmps:expr, $nlps:expr, $switch:expr),+ $(,)?) => {
        [$(QeData { qe: $qe, nmps: $nmps, nlps: $nlps, switch: $switch }),+]
    }
}

#[rustfmt::skip]
static QE_TABLE: [QeData; 47] = qe!(
    0x5601, 1, 1, true,
    0x3401, 2, 6, false,
    0x1801, 3, 9, false,
    0x0AC1, 4, 12, false,
    0x0521, 5, 29, false,
    0x0221, 38, 33, false,
    0x5601, 7, 6, true,
    0x5401, 8, 14, false,
    0x4801, 9, 14, false,
    0x3801, 10, 14, false,
    0x3001, 11, 17, false,
    0x2401, 12, 18, false,
    0x1C01, 13, 20, false,
    0x1601, 29, 21, false,
    0x5601, 15, 14, true,
    0x5401, 16, 14, false,
    0x5101, 17, 15, false,
    0x4801, 18, 16, false,
    0x3801, 19, 17, false,
    0x3401, 20, 18, false,
    0x3001, 21, 19, false,
    0x2801, 22, 19, false,
    0x2401, 23, 20, false,
    0x2201, 24, 21, false,
    0x1C01, 25, 22, false,
    0x1801, 26, 23, false,
    0x1601, 27, 24, false,
    0x1401, 28, 25, false,
    0x1201, 29, 26, false,
    0x1101, 30, 27, false,
    0x0AC1, 31, 28, false,
    0x09C1, 32, 29, false,
    0x08A1, 33, 30, false,
    0x0521, 34, 31, false,
    0x0441, 35, 32, false,
    0x02A1, 36, 33, false,
    0x0221, 37, 34, false,
    0x0141, 38, 35, false,
    0x0111, 39, 36, false,
    0x0085, 40, 37, false,
    0x0049, 41, 38, false,
    0x0025, 42, 39, false,
    0x0015, 43, 40, false,
    0x0009, 44, 41, false,
    0x0005, 45, 42, false,
    0x0001, 45, 43, false,
    0x5601, 46, 46, false,
);

/// MQ arithmetic encoder (ITU-T T.800 Annex C).
///
/// Uses the direct buffer approach with proper 7-bit stuffing after 0xFF
/// to match the decoder's Annex G byte input convention.
pub(crate) struct ArithmeticEncoder {
    /// Output byte stream. Index 0 is a sentinel byte (0x00).
    data: Vec<u8>,
    /// A-register (interval size), 16-bit precision.
    a: u32,
    /// C-register (code value), 28-bit + carry at bit 27.
    c: u32,
    /// Bit shift counter (12 initially, then 7 after 0xFF, 8 otherwise).
    ct: u32,
}

impl ArithmeticEncoder {
    pub(crate) fn new() -> Self {
        Self::with_capacity(1)
    }

    pub(crate) fn with_capacity(capacity: usize) -> Self {
        let mut data = Vec::with_capacity(capacity.max(1));
        data.push(0x00);

        Self {
            data, // Sentinel byte at index 0
            a: 0x8000,
            c: 0,
            ct: 12,
        }
    }

    /// Encode a single symbol (0 or 1) with the given context (C.2.6 ENCODE).
    #[inline(always)]
    pub(crate) fn encode(&mut self, bit: u32, context: &mut ArithmeticEncoderContext) {
        let qe_entry = &QE_TABLE[context.index() as usize];
        self.a -= qe_entry.qe;

        if bit == context.mps() {
            // MPS path (CODEMPS, C.2.6)
            if self.a & 0x8000 != 0 {
                // No renormalization needed: fast path
                self.c += qe_entry.qe;
                return;
            }
            if self.a < qe_entry.qe {
                // Conditional exchange: MPS coded in lower sub-interval
                // C stays (don't add Qe), A takes the larger Qe value
                self.a = qe_entry.qe;
            } else {
                // Normal: MPS coded in upper sub-interval
                self.c += qe_entry.qe;
            }
            context.set_index(qe_entry.nmps);
        } else {
            // LPS path (CODELPS, C.2.6)
            if self.a < qe_entry.qe {
                // Conditional exchange: LPS coded in upper sub-interval
                self.c += qe_entry.qe;
            } else {
                // Normal: LPS coded in lower sub-interval, A = Qe
                self.a = qe_entry.qe;
            }
            if qe_entry.switch {
                context.xor_mps(1);
            }
            context.set_index(qe_entry.nlps);
        }

        self.renormalize();
    }

    /// Renormalize the encoder (C.2.7 RENORME).
    fn renormalize(&mut self) {
        loop {
            self.a <<= 1;
            self.c <<= 1;
            self.ct -= 1;
            if self.ct == 0 {
                self.byte_out();
            }
            if self.a & 0x8000 != 0 {
                break;
            }
        }
    }

    /// Output a byte with carry propagation and bit stuffing (C.2.8 BYTEOUT).
    ///
    /// After 0xFF, only 7 bits are extracted (bit stuffing) to prevent
    /// marker-like byte sequences in the output.
    fn byte_out(&mut self) {
        let last_byte = *self.data.last().unwrap();
        if last_byte == 0xFF {
            // 7-bit mode after 0xFF (bit stuffing)
            let b = (self.c >> 20) as u8;
            self.data.push(b);
            self.c &= 0xFFFFF;
            self.ct = 7;
        } else if self.c & 0x8000000 == 0 {
            // No carry: normal 8-bit output
            let b = (self.c >> 19) as u8;
            self.data.push(b);
            self.c &= 0x7FFFF;
            self.ct = 8;
        } else {
            // Carry occurred (bit 27 set): propagate into last byte
            let last = self.data.last_mut().unwrap();
            *last += 1;
            self.c &= 0x7FFFFFF; // Clear carry bit
            if *last == 0xFF {
                // Carry made last byte 0xFF: switch to 7-bit mode
                let b = (self.c >> 20) as u8;
                self.data.push(b);
                self.c &= 0xFFFFF;
                self.ct = 7;
            } else {
                let b = (self.c >> 19) as u8;
                self.data.push(b);
                self.c &= 0x7FFFF;
                self.ct = 8;
            }
        }
    }

    /// SETBITS procedure (C.2.9).
    fn set_bits(&mut self) {
        let temp = self.c + self.a;
        self.c |= 0xFFFF;
        if self.c >= temp {
            self.c -= 0x8000;
        }
    }

    /// Flush the encoder state (C.2.9 FLUSH).
    pub(crate) fn flush(&mut self) {
        self.set_bits();
        self.c <<= self.ct;
        self.byte_out();
        self.c <<= self.ct;
        self.byte_out();
    }

    /// Return the encoded data (excluding sentinel), consuming the encoder.
    pub(crate) fn finish(mut self) -> Vec<u8> {
        self.flush();
        // Remove sentinel byte at index 0
        self.data.drain(..1);
        self.data
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::j2c::arithmetic_decoder::{ArithmeticDecoder, ArithmeticDecoderContext};
    use alloc::{vec, vec::Vec};

    #[test]
    fn test_encode_decode_round_trip() {
        let symbols: Vec<u32> = vec![0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1];
        let mut encoder = ArithmeticEncoder::new();
        let mut enc_ctx = ArithmeticEncoderContext::default();

        for &s in &symbols {
            encoder.encode(s, &mut enc_ctx);
        }
        let encoded = encoder.finish();

        // Decode and verify (new() already calls initialize())
        let mut decoder = ArithmeticDecoder::new(&encoded);
        let mut dec_ctx = ArithmeticDecoderContext::default();

        let mut decoded = Vec::new();
        for _ in 0..symbols.len() {
            decoded.push(decoder.decode(&mut dec_ctx));
        }

        assert_eq!(symbols, decoded);
    }

    #[test]
    fn test_encode_all_mps() {
        let mut encoder = ArithmeticEncoder::new();
        let mut ctx = ArithmeticEncoderContext::default();
        for _ in 0..100 {
            encoder.encode(0, &mut ctx);
        }
        let encoded = encoder.finish();

        let mut decoder = ArithmeticDecoder::new(&encoded);
        let mut dec_ctx = ArithmeticDecoderContext::default();
        for _ in 0..100 {
            assert_eq!(decoder.decode(&mut dec_ctx), 0);
        }
    }

    #[test]
    fn with_capacity_preserves_round_trip_encoding() {
        let mut encoder = ArithmeticEncoder::with_capacity(128);
        let mut enc_ctx = ArithmeticEncoderContext::default();
        let symbols = [0u32, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1];

        for &symbol in &symbols {
            encoder.encode(symbol, &mut enc_ctx);
        }
        let encoded = encoder.finish();

        let mut decoder = ArithmeticDecoder::new(&encoded);
        let mut dec_ctx = ArithmeticDecoderContext::default();
        for &symbol in &symbols {
            assert_eq!(decoder.decode(&mut dec_ctx), symbol);
        }
    }

    #[test]
    fn test_encode_all_lps() {
        let mut encoder = ArithmeticEncoder::new();
        let mut ctx = ArithmeticEncoderContext::default();
        for _ in 0..50 {
            encoder.encode(1, &mut ctx);
        }
        let encoded = encoder.finish();

        let mut decoder = ArithmeticDecoder::new(&encoded);
        let mut dec_ctx = ArithmeticDecoderContext::default();
        for _ in 0..50 {
            assert_eq!(decoder.decode(&mut dec_ctx), 1);
        }
    }

    #[test]
    fn test_multiple_contexts() {
        let symbols_a = [0u32, 1, 0, 0, 1, 1, 0, 1];
        let symbols_b = [1u32, 1, 0, 1, 0, 0, 1, 0];

        let mut encoder = ArithmeticEncoder::new();
        let mut ctx_a = ArithmeticEncoderContext::default();
        let mut ctx_b = ArithmeticEncoderContext::default();

        for i in 0..8 {
            encoder.encode(symbols_a[i], &mut ctx_a);
            encoder.encode(symbols_b[i], &mut ctx_b);
        }
        let encoded = encoder.finish();

        let mut decoder = ArithmeticDecoder::new(&encoded);
        let mut dec_ctx_a = ArithmeticDecoderContext::default();
        let mut dec_ctx_b = ArithmeticDecoderContext::default();

        for i in 0..8 {
            assert_eq!(decoder.decode(&mut dec_ctx_a), symbols_a[i]);
            assert_eq!(decoder.decode(&mut dec_ctx_b), symbols_b[i]);
        }
    }

    #[test]
    fn test_many_context_round_trip() {
        let mut state = 0x1234_5678u32;
        let mut symbols = Vec::new();
        let mut labels = Vec::new();
        let mut encoder = ArithmeticEncoder::new();
        let mut enc_contexts = [ArithmeticEncoderContext::default(); 19];
        enc_contexts[0].reset_with_index(4);
        enc_contexts[17].reset_with_index(3);
        enc_contexts[18].reset_with_index(46);

        for _ in 0..100_000 {
            state = state.wrapping_mul(1_664_525).wrapping_add(1_013_904_223);
            let label = (state % 19) as usize;
            state = state.wrapping_mul(1_664_525).wrapping_add(1_013_904_223);
            let bit = (state >> 31) & 1;
            encoder.encode(bit, &mut enc_contexts[label]);
            labels.push(label);
            symbols.push(bit);
        }

        let encoded = encoder.finish();
        let mut decoder = ArithmeticDecoder::new(&encoded);
        let mut dec_contexts = [ArithmeticDecoderContext::default(); 19];
        dec_contexts[0].reset_with_index(4);
        dec_contexts[17].reset_with_index(3);
        dec_contexts[18].reset_with_index(46);

        for (index, (&label, &symbol)) in labels.iter().zip(symbols.iter()).enumerate() {
            let decoded = decoder.decode(&mut dec_contexts[label]);
            assert_eq!(decoded, symbol, "mismatch at symbol {index}");
        }
    }

    #[test]
    fn test_context_state_identical() {
        let mut enc_ctx = ArithmeticEncoderContext::default();
        let mut dec_ctx = ArithmeticDecoderContext::default();

        let bits = [0u32, 0, 1, 0, 1, 1, 0, 0];
        let mut encoder = ArithmeticEncoder::new();
        for &b in &bits {
            encoder.encode(b, &mut enc_ctx);
        }
        let encoded = encoder.finish();

        let mut decoder = ArithmeticDecoder::new(&encoded);
        for &b in &bits {
            let decoded = decoder.decode(&mut dec_ctx);
            assert_eq!(decoded, b);
        }

        // Both contexts should be in same state
        assert_eq!(enc_ctx.index(), dec_ctx.index());
        assert_eq!(enc_ctx.mps(), dec_ctx.mps());
    }
}