threers 0.1.0

Drop-in three.js replacement for Rust and WebAssembly (wgpu) — THREE.* API, scene graph, PBR, post-fx, mesh BVH, CSG, an OpenSCAD front end with a watertight exact-CSG kernel, headless render, and native media codecs
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
//! RFC 1951 DEFLATE decoder. Pure Rust, no dependencies. Used by EXR ZIP/ZIPS
//! and any future zlib-flavoured payloads. Supports stored blocks, fixed
//! Huffman, and dynamic Huffman.
//!
//! Pass in zlib-wrapped data (1.95 RFC) or raw DEFLATE. `inflate_raw` consumes
//! raw DEFLATE; `inflate_zlib` peels the 2-byte zlib header + Adler-32 trailer.

#[derive(Debug)]
pub enum DeflateError {
    Truncated,
    BadCode,
    BadDistance,
    BadHeader,
}

pub fn inflate_zlib(input: &[u8]) -> Result<Vec<u8>, DeflateError> {
    if input.len() < 6 {
        return Err(DeflateError::Truncated);
    }
    // Zlib header: CMF (low nibble == 8 for deflate) + FLG.
    if (input[0] & 0x0f) != 8 {
        return Err(DeflateError::BadHeader);
    }
    let payload = &input[2..input.len() - 4];
    inflate_raw(payload)
}

pub fn inflate_raw(input: &[u8]) -> Result<Vec<u8>, DeflateError> {
    let mut r = BitReader::new(input);
    let mut out = Vec::new();
    loop {
        let bfinal = r.read_bits(1)?;
        let btype = r.read_bits(2)?;
        match btype {
            0 => inflate_stored(&mut r, &mut out)?,
            1 => inflate_fixed(&mut r, &mut out)?,
            2 => inflate_dynamic(&mut r, &mut out)?,
            _ => return Err(DeflateError::BadHeader),
        }
        if bfinal == 1 {
            break;
        }
    }
    Ok(out)
}

fn inflate_stored(r: &mut BitReader, out: &mut Vec<u8>) -> Result<(), DeflateError> {
    r.align_to_byte();
    let len = r.read_le_u16()? as usize;
    let _nlen = r.read_le_u16()?;
    for _ in 0..len {
        out.push(r.read_byte()?);
    }
    Ok(())
}

fn inflate_fixed(r: &mut BitReader, out: &mut Vec<u8>) -> Result<(), DeflateError> {
    let (lit, dist) = fixed_huffman_tables();
    inflate_block(r, out, &lit, &dist)
}

fn inflate_dynamic(r: &mut BitReader, out: &mut Vec<u8>) -> Result<(), DeflateError> {
    let hlit = r.read_bits(5)? as usize + 257;
    let hdist = r.read_bits(5)? as usize + 1;
    let hclen = r.read_bits(4)? as usize + 4;
    let code_length_order = [
        16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15,
    ];
    let mut clens = [0u8; 19];
    for i in 0..hclen {
        clens[code_length_order[i]] = r.read_bits(3)? as u8;
    }
    let cl_tree = build_huffman(&clens)?;

    let total = hlit + hdist;
    let mut all_lens: Vec<u8> = Vec::with_capacity(total);
    while all_lens.len() < total {
        let sym = decode_symbol(r, &cl_tree)?;
        match sym {
            0..=15 => all_lens.push(sym as u8),
            16 => {
                let n = r.read_bits(2)? as usize + 3;
                let last = *all_lens.last().ok_or(DeflateError::BadCode)?;
                for _ in 0..n {
                    all_lens.push(last);
                }
            }
            17 => {
                let n = r.read_bits(3)? as usize + 3;
                all_lens.resize(all_lens.len() + n, 0);
            }
            18 => {
                let n = r.read_bits(7)? as usize + 11;
                all_lens.resize(all_lens.len() + n, 0);
            }
            _ => return Err(DeflateError::BadCode),
        }
    }
    let lit = build_huffman(&all_lens[..hlit])?;
    let dist = build_huffman(&all_lens[hlit..hlit + hdist])?;
    inflate_block(r, out, &lit, &dist)
}

fn inflate_block(
    r: &mut BitReader,
    out: &mut Vec<u8>,
    lit: &HuffmanTree,
    dist: &HuffmanTree,
) -> Result<(), DeflateError> {
    let length_extra = [
        (3, 0),
        (4, 0),
        (5, 0),
        (6, 0),
        (7, 0),
        (8, 0),
        (9, 0),
        (10, 0),
        (11, 1),
        (13, 1),
        (15, 1),
        (17, 1),
        (19, 2),
        (23, 2),
        (27, 2),
        (31, 2),
        (35, 3),
        (43, 3),
        (51, 3),
        (59, 3),
        (67, 4),
        (83, 4),
        (99, 4),
        (115, 4),
        (131, 5),
        (163, 5),
        (195, 5),
        (227, 5),
        (258, 0),
    ];
    let dist_extra = [
        (1, 0),
        (2, 0),
        (3, 0),
        (4, 0),
        (5, 1),
        (7, 1),
        (9, 2),
        (13, 2),
        (17, 3),
        (25, 3),
        (33, 4),
        (49, 4),
        (65, 5),
        (97, 5),
        (129, 6),
        (193, 6),
        (257, 7),
        (385, 7),
        (513, 8),
        (769, 8),
        (1025, 9),
        (1537, 9),
        (2049, 10),
        (3073, 10),
        (4097, 11),
        (6145, 11),
        (8193, 12),
        (12289, 12),
        (16385, 13),
        (24577, 13),
    ];
    loop {
        let sym = decode_symbol(r, lit)?;
        if sym < 256 {
            out.push(sym as u8);
        } else if sym == 256 {
            return Ok(());
        } else {
            let lsym = (sym - 257) as usize;
            if lsym >= length_extra.len() {
                return Err(DeflateError::BadCode);
            }
            let (base, extra) = length_extra[lsym];
            let length = base as usize + r.read_bits(extra as u32)? as usize;
            let dsym = decode_symbol(r, dist)? as usize;
            if dsym >= dist_extra.len() {
                return Err(DeflateError::BadDistance);
            }
            let (dbase, dextra) = dist_extra[dsym];
            let distance = dbase as usize + r.read_bits(dextra as u32)? as usize;
            if distance > out.len() {
                return Err(DeflateError::BadDistance);
            }
            let start = out.len() - distance;
            if distance >= length {
                out.extend_from_within(start..start + length);
            } else {
                // The copy overlaps what it writes: a run, byte by byte.
                for k in 0..length {
                    let b = out[start + k];
                    out.push(b);
                }
            }
        }
    }
}

#[derive(Debug)]
/// A canonical Huffman code, stored as the counts per length and the symbols in
/// canonical order.
///
/// This replaces a table of `(length, code, symbol)` triples that
/// `decode_symbol` searched linearly — for *every bit* of every symbol, so up to
/// sixteen scans of nearly three hundred entries to decode one. Decoding an 8k
/// EXR star map runs to tens of millions of symbols and took 59 seconds.
///
/// Canonical codes need no search at all. Within a length the codes are
/// consecutive integers assigned to symbols in order, so the code's offset from
/// the first code of its length *is* its offset into that length's block of
/// symbols. That is a subtraction and an index.
///
/// Codes up to [`FAST_BITS`] long, nearly all of them, are looked up whole in
/// `fast` from the next bits of input; only longer ones walk the lengths.
struct HuffmanTree {
    /// How many codes have each length, indexed by length (0 unused).
    counts: [u16; MAX_BITS + 1],
    /// Symbols ordered by (length, code).
    symbols: Vec<u16>,
    /// Indexed by the next `FAST_BITS` bits of input (first bit lowest):
    /// `symbol | length << 9` for a code of that length, 0 for none.
    fast: Vec<u16>,
}

const MAX_BITS: usize = 15;
const FAST_BITS: u32 = 10;

fn build_huffman(lengths: &[u8]) -> Result<HuffmanTree, DeflateError> {
    let mut counts = [0u16; MAX_BITS + 1];
    for &l in lengths {
        if l as usize > MAX_BITS {
            return Err(DeflateError::BadCode);
        }
        if l > 0 {
            counts[l as usize] += 1;
        }
    }
    // More codes of a length than the shorter ones leave room for is no
    // prefix code (zlib refuses it too); fewer is allowed, and the codes
    // left over decode as errors.
    let mut room = 1i32;
    for &count in &counts[1..] {
        room = (room << 1) - count as i32;
        if room < 0 {
            return Err(DeflateError::BadCode);
        }
    }
    // Where each length's block of symbols starts.
    let mut offsets = [0usize; MAX_BITS + 2];
    for len in 1..=MAX_BITS {
        offsets[len + 1] = offsets[len] + counts[len] as usize;
    }
    let mut symbols = vec![0u16; offsets[MAX_BITS + 1]];
    let mut next = offsets;
    for (sym, &l) in lengths.iter().enumerate() {
        if l > 0 {
            symbols[next[l as usize]] = sym as u16;
            next[l as usize] += 1;
        }
    }
    // Codes are consecutive within a length, in symbol order, starting where
    // the previous length's ended (shifted one bit longer). The stream holds
    // them first bit first, so the table index is the code reversed.
    let mut fast = vec![0u16; 1 << FAST_BITS];
    let mut code = 0u32;
    let mut sym_at = 0usize;
    for len in 1..=MAX_BITS as u32 {
        for _ in 0..counts[len as usize] {
            if len <= FAST_BITS {
                let reversed = code.reverse_bits() >> (32 - len);
                let entry = symbols[sym_at] | (len as u16) << 9;
                for high in 0..1u32 << (FAST_BITS - len) {
                    fast[(reversed | high << len) as usize] = entry;
                }
            }
            code += 1;
            sym_at += 1;
        }
        code <<= 1;
    }
    Ok(HuffmanTree {
        counts,
        symbols,
        fast,
    })
}

fn decode_symbol(r: &mut BitReader, tree: &HuffmanTree) -> Result<u32, DeflateError> {
    r.refill();
    let entry = tree.fast[(r.bit_buf & ((1 << FAST_BITS) - 1)) as usize];
    if entry != 0 {
        let len = (entry >> 9) as u32;
        // Past the end of the input the buffer is zero-padded: a code that
        // only matched padding is a truncated stream.
        if len > r.bit_count {
            return Err(DeflateError::Truncated);
        }
        r.bit_buf >>= len;
        r.bit_count -= len;
        return Ok((entry & 0x1ff) as u32);
    }
    // `code` is the bits read so far, `first` the first code of this length, and
    // `index` where this length's symbols begin. If the code is inside the
    // length's range, its distance from `first` indexes straight to the symbol.
    let (mut code, mut first, mut index) = (0u32, 0u32, 0usize);
    for len in 1..=MAX_BITS {
        code |= r.read_bits(1)?;
        let count = tree.counts[len] as u32;
        if code < first + count {
            return Ok(tree.symbols[index + (code - first) as usize] as u32);
        }
        index += count as usize;
        first = (first + count) << 1;
        code <<= 1;
    }
    Err(DeflateError::BadCode)
}

fn fixed_huffman_tables() -> (HuffmanTree, HuffmanTree) {
    // The fixed literal/length code lengths from RFC 1951 section 3.2.6.
    let mut lens = vec![0u8; 288];
    lens[0..144].fill(8);
    lens[144..256].fill(9);
    lens[256..280].fill(7);
    lens[280..288].fill(8);
    let lit = build_huffman(&lens).unwrap();
    let dist = build_huffman(&[5u8; 30]).unwrap();
    (lit, dist)
}

// ---- bit reader ----

struct BitReader<'a> {
    data: &'a [u8],
    pos: usize,
    bit_buf: u32,
    bit_count: u32,
}

impl<'a> BitReader<'a> {
    fn new(data: &'a [u8]) -> Self {
        Self {
            data,
            pos: 0,
            bit_buf: 0,
            bit_count: 0,
        }
    }

    /// Top the buffer up to at least 25 bits, as far as the input goes.
    fn refill(&mut self) {
        while self.bit_count <= 24 && self.pos < self.data.len() {
            self.bit_buf |= (self.data[self.pos] as u32) << self.bit_count;
            self.pos += 1;
            self.bit_count += 8;
        }
    }

    fn read_bits(&mut self, n: u32) -> Result<u32, DeflateError> {
        while self.bit_count < n {
            if self.pos >= self.data.len() {
                return Err(DeflateError::Truncated);
            }
            self.bit_buf |= (self.data[self.pos] as u32) << self.bit_count;
            self.pos += 1;
            self.bit_count += 8;
        }
        let v = self.bit_buf & ((1u32 << n) - 1);
        self.bit_buf >>= n;
        self.bit_count -= n;
        Ok(v)
    }

    fn align_to_byte(&mut self) {
        let drop = self.bit_count % 8;
        self.bit_buf >>= drop;
        self.bit_count -= drop;
    }

    fn read_byte(&mut self) -> Result<u8, DeflateError> {
        if self.bit_count >= 8 {
            let b = (self.bit_buf & 0xff) as u8;
            self.bit_buf >>= 8;
            self.bit_count -= 8;
            Ok(b)
        } else if self.pos < self.data.len() {
            let b = self.data[self.pos];
            self.pos += 1;
            Ok(b)
        } else {
            Err(DeflateError::Truncated)
        }
    }

    fn read_le_u16(&mut self) -> Result<u16, DeflateError> {
        let a = self.read_byte()? as u16;
        let b = self.read_byte()? as u16;
        Ok(a | (b << 8))
    }
}