compcol 0.4.3

A no_std collection of compression algorithms behind a uniform streaming trait, gated per-algorithm by Cargo features.
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
//! `compcol` benchmark harness.
//!
//! Runs each compiled-in algorithm against a small fixed corpus, measuring
//! our encoder + decoder throughput and compression ratio, and compares
//! against the system reference implementation when one is available.
//!
//! Run with:
//!
//! ```sh
//! cargo run --release --all-features --example bench
//! ```
//!
//! No `criterion` dependency: we use `std::time::Instant`, run each
//! measurement after 1 warmup pass, and report the median of 2 timed
//! runs. Reference timings include subprocess startup overhead (a few
//! ms); for small inputs that dominates, so treat those numbers as a
//! "format works" sanity check rather than a serious speed comparison.

use std::io::Write;
use std::process::{Command, Stdio};
use std::time::{Duration, Instant};

use compcol::factory;

// ─── corpus ─────────────────────────────────────────────────────────────

/// A short Lorem ipsum block, repeated to fill the requested size.
const LOREM: &[u8] = b"Lorem ipsum dolor sit amet, consectetur adipiscing elit, \
sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim \
ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip \
ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate \
velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat \
cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id \
est laborum. ";

struct Input {
    name: &'static str,
    data: Vec<u8>,
}

fn build_corpus() -> Vec<Input> {
    // Sizes large enough that subprocess fork+exec (~1-3 ms on Linux) is
    // amortised relative to actual codec work, so the "Ref enc / Ref dec"
    // numbers reflect the reference impl's real throughput. Smaller inputs
    // were dominated by subprocess startup time.
    vec![
        text_input("Lorem 1 MiB", 1 << 20),
        zeros_input("Zeros 1 MiB", 1 << 20),
        random_input("Random 1 MiB", 1 << 20, 0xDEAD_BEEF),
    ]
}

fn text_input(name: &'static str, target_size: usize) -> Input {
    let mut data = Vec::with_capacity(target_size);
    while data.len() < target_size {
        let take = LOREM.len().min(target_size - data.len());
        data.extend_from_slice(&LOREM[..take]);
    }
    Input { name, data }
}

fn zeros_input(name: &'static str, size: usize) -> Input {
    Input {
        name,
        data: vec![0u8; size],
    }
}

fn random_input(name: &'static str, size: usize, seed: u32) -> Input {
    let mut data = Vec::with_capacity(size);
    let mut state = seed;
    while data.len() < size {
        state = state.wrapping_mul(1_664_525).wrapping_add(1_013_904_223);
        data.push((state >> 16) as u8);
    }
    Input { name, data }
}

// ─── timing ─────────────────────────────────────────────────────────────

const WARMUP_RUNS: usize = 1;
const TIMED_RUNS: usize = 3;

fn median_of<F: FnMut()>(mut f: F) -> Duration {
    for _ in 0..WARMUP_RUNS {
        f();
    }
    let mut samples: Vec<Duration> = (0..TIMED_RUNS)
        .map(|_| {
            let t = Instant::now();
            f();
            t.elapsed()
        })
        .collect();
    samples.sort();
    samples[samples.len() / 2]
}

fn throughput_mb_s(bytes: usize, t: Duration) -> f64 {
    let s = t.as_secs_f64();
    if s == 0.0 {
        f64::INFINITY
    } else {
        (bytes as f64) / s / 1e6
    }
}

// ─── compcol round-trip ─────────────────────────────────────────────────

fn our_encode(algo: &str, input: &[u8]) -> Result<Vec<u8>, String> {
    let mut enc = factory::encoder_by_name(algo).ok_or_else(|| format!("unknown algo {algo}"))?;
    let mut out = Vec::with_capacity(input.len());
    let mut buf = vec![0u8; 64 * 1024];
    use compcol::Status;
    let mut consumed = 0;
    while consumed < input.len() {
        let (p, status) = enc
            .encode(&input[consumed..], &mut buf)
            .map_err(|e| format!("{e}"))?;
        out.extend_from_slice(&buf[..p.written]);
        consumed += p.consumed;
        match status {
            Status::InputEmpty | Status::StreamEnd => break,
            Status::OutputFull => continue,
        }
    }
    loop {
        let (p, status) = enc.finish(&mut buf).map_err(|e| format!("{e}"))?;
        out.extend_from_slice(&buf[..p.written]);
        match status {
            Status::StreamEnd => break,
            Status::OutputFull | Status::InputEmpty => {
                if p.written == 0 {
                    return Err(format!("{algo}: encoder finish stalled"));
                }
            }
        }
    }
    Ok(out)
}

fn our_decode(algo: &str, encoded: &[u8]) -> Result<Vec<u8>, String> {
    use compcol::Status;
    let mut dec = factory::decoder_by_name(algo).ok_or_else(|| format!("unknown algo {algo}"))?;
    let mut out = Vec::with_capacity(encoded.len() * 4);
    let mut buf = vec![0u8; 64 * 1024];
    let mut consumed = 0;
    while consumed < encoded.len() {
        let (p, status) = dec
            .decode(&encoded[consumed..], &mut buf)
            .map_err(|e| format!("{e}"))?;
        out.extend_from_slice(&buf[..p.written]);
        consumed += p.consumed;
        match status {
            Status::InputEmpty | Status::StreamEnd => break,
            Status::OutputFull => continue,
        }
    }
    // Drain any queued decoded bytes the decoder is still holding
    // before declaring "no more input". Some codecs (notably bzip2)
    // buffer an entire block of decoded output internally; if the
    // caller's output buffer was smaller than that block we need to
    // call back with empty input to pull the rest out.
    loop {
        let (p, _status) = dec.decode(&[], &mut buf).map_err(|e| format!("{e}"))?;
        out.extend_from_slice(&buf[..p.written]);
        if p.written == 0 {
            break;
        }
    }
    loop {
        let (p, status) = dec.finish(&mut buf).map_err(|e| format!("{e}"))?;
        out.extend_from_slice(&buf[..p.written]);
        match status {
            Status::StreamEnd => break,
            Status::OutputFull | Status::InputEmpty => {
                if p.written == 0 {
                    return Err(format!("{algo}: decoder finish stalled"));
                }
            }
        }
    }
    Ok(out)
}

// ─── system references ──────────────────────────────────────────────────

struct Reference {
    name: &'static str,
    encode: Vec<String>,
    decode: Vec<String>,
}

fn reference_for(algo: &str) -> Option<Reference> {
    fn r(name: &'static str, encode: &[&str], decode: &[&str]) -> Reference {
        Reference {
            name,
            encode: encode.iter().map(|s| s.to_string()).collect(),
            decode: decode.iter().map(|s| s.to_string()).collect(),
        }
    }
    Some(match algo {
        "gzip" => r("gzip", &["gzip", "-c"], &["gzip", "-dc"]),
        "xz" => r("xz", &["xz", "-c"], &["xz", "-dc"]),
        "zstd" => r("zstd", &["zstd", "-c", "--no-check"], &["zstd", "-dc"]),
        "brotli" => r("brotli", &["brotli", "-c"], &["brotli", "-dc"]),
        "lz4" => r("lz4", &["lz4", "-cz"], &["lz4", "-dc"]),
        "lzw" => r("compress", &["compress", "-c"], &["uncompress", "-c"]),
        "zlib" => r(
            "py-zlib",
            &["python3", "-c", PY_ZLIB_ENC],
            &["python3", "-c", PY_ZLIB_DEC],
        ),
        "deflate" => r(
            "py-deflate",
            &["python3", "-c", PY_DEFLATE_ENC],
            &["python3", "-c", PY_DEFLATE_DEC],
        ),
        "lzma" => r(
            "py-lzma",
            &["python3", "-c", PY_LZMA_ENC],
            &["python3", "-c", PY_LZMA_DEC],
        ),
        "lzma2" => r(
            "xz-raw",
            &["xz", "--format=raw", "--lzma2=preset=6", "-c"],
            &["xz", "--format=raw", "--lzma2=preset=6", "-dc"],
        ),
        "snappy" => r(
            "py-snappy",
            &["python3", "-c", PY_SNAPPY_ENC],
            &["python3", "-c", PY_SNAPPY_DEC],
        ),
        _ => return None,
    })
}

const PY_ZLIB_ENC: &str =
    "import sys,zlib; sys.stdout.buffer.write(zlib.compress(sys.stdin.buffer.read()))";
const PY_ZLIB_DEC: &str =
    "import sys,zlib; sys.stdout.buffer.write(zlib.decompress(sys.stdin.buffer.read()))";
const PY_DEFLATE_ENC: &str = "import sys,zlib; co=zlib.compressobj(6,8,-15); \
sys.stdout.buffer.write(co.compress(sys.stdin.buffer.read())+co.flush())";
const PY_DEFLATE_DEC: &str =
    "import sys,zlib; sys.stdout.buffer.write(zlib.decompress(sys.stdin.buffer.read(), -15))";
const PY_LZMA_ENC: &str = "import sys,lzma; \
sys.stdout.buffer.write(lzma.compress(sys.stdin.buffer.read(), format=lzma.FORMAT_ALONE))";
const PY_LZMA_DEC: &str = "import sys,lzma; \
sys.stdout.buffer.write(lzma.decompress(sys.stdin.buffer.read(), format=lzma.FORMAT_ALONE))";
const PY_SNAPPY_ENC: &str =
    "import sys,snappy; sys.stdout.buffer.write(snappy.compress(sys.stdin.buffer.read()))";
const PY_SNAPPY_DEC: &str =
    "import sys,snappy; sys.stdout.buffer.write(snappy.uncompress(sys.stdin.buffer.read()))";

/// Run the reference command end-to-end once and return its output. Used
/// both for warmup (probing tool availability) and for timed runs.
///
/// Uses a dedicated thread to feed stdin so that the parent simultaneously
/// drains stdout — without this, a 1 MiB payload deadlocks both pipes at
/// the OS buffer (~64 KiB) limit.
fn pipe_through(cmd: &[String], input: &[u8]) -> Result<Vec<u8>, String> {
    let mut child = Command::new(&cmd[0])
        .args(&cmd[1..])
        .stdin(Stdio::piped())
        .stdout(Stdio::piped())
        .stderr(Stdio::piped())
        .spawn()
        .map_err(|e| format!("spawn {}: {e}", cmd[0]))?;
    let mut stdin = child.stdin.take().expect("piped stdin");
    let input_vec: Vec<u8> = input.to_vec();
    let writer = std::thread::spawn(move || -> std::io::Result<()> {
        stdin.write_all(&input_vec)?;
        drop(stdin); // close so the child sees EOF
        Ok(())
    });
    let out = child.wait_with_output().map_err(|e| format!("wait: {e}"))?;
    writer
        .join()
        .map_err(|_| "stdin writer thread panicked".to_string())?
        .map_err(|e| format!("write stdin: {e}"))?;
    if !out.status.success() {
        return Err(format!(
            "{} failed: {}",
            cmd[0],
            String::from_utf8_lossy(&out.stderr)
        ));
    }
    Ok(out.stdout)
}

// ─── per-row measurement ───────────────────────────────────────────────

#[derive(Clone, Copy)]
enum Cell {
    Value(f64),
    Bytes(usize),
    Missing,
}

impl core::fmt::Display for Cell {
    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
        match self {
            Cell::Value(v) if *v == f64::INFINITY => f.write_str(""),
            Cell::Value(v) if *v >= 1000.0 => write!(f, "{v:.0}"),
            Cell::Value(v) if *v >= 10.0 => write!(f, "{v:.1}"),
            Cell::Value(v) => write!(f, "{v:.2}"),
            Cell::Bytes(b) => write!(f, "{b}"),
            Cell::Missing => f.write_str(""),
        }
    }
}

struct Row {
    algo: String,
    input_name: String,
    input_bytes: usize,
    our_size: Cell,
    our_ratio: Cell,
    our_enc_ms: Cell,
    our_enc_mb_s: Cell,
    our_dec_ms: Cell,
    our_dec_mb_s: Cell,
    reference: String,
    ref_ratio: Cell,
    ref_enc_ms: Cell,
    ref_enc_mb_s: Cell,
    ref_dec_ms: Cell,
    ref_dec_mb_s: Cell,
}

fn ms(d: Duration) -> f64 {
    d.as_secs_f64() * 1000.0
}

/// Format a "ours/ref" speed ratio as a delta cell.
fn delta(ours: Cell, refer: Cell) -> Cell {
    match (ours, refer) {
        (Cell::Value(o), Cell::Value(r)) if r > 0.0 && o.is_finite() && r.is_finite() => {
            Cell::Value(o / r)
        }
        _ => Cell::Missing,
    }
}

fn bench_one(algo: &str, input: &Input) -> Row {
    let mut row = Row {
        algo: algo.to_string(),
        input_name: input.name.to_string(),
        input_bytes: input.data.len(),
        our_size: Cell::Missing,
        our_ratio: Cell::Missing,
        our_enc_ms: Cell::Missing,
        our_enc_mb_s: Cell::Missing,
        our_dec_ms: Cell::Missing,
        our_dec_mb_s: Cell::Missing,
        reference: "".to_string(),
        ref_ratio: Cell::Missing,
        ref_enc_ms: Cell::Missing,
        ref_enc_mb_s: Cell::Missing,
        ref_dec_ms: Cell::Missing,
        ref_dec_mb_s: Cell::Missing,
    };

    // Our encoder
    let our_encoded = match our_encode(algo, &input.data) {
        Ok(e) => e,
        Err(e) => {
            eprintln!("warning: {algo}/{} encode: {e}", input.name);
            return row;
        }
    };
    let our_decoded = match our_decode(algo, &our_encoded) {
        Ok(d) => d,
        Err(e) => {
            eprintln!("warning: {algo}/{} decode: {e}", input.name);
            return row;
        }
    };
    if our_decoded != input.data {
        eprintln!("warning: {algo}/{} round-trip mismatch", input.name);
        return row;
    }
    row.our_size = Cell::Bytes(our_encoded.len());
    row.our_ratio = Cell::Value((our_encoded.len() as f64) / (input.data.len() as f64));
    let enc_t = median_of(|| {
        let _ = our_encode(algo, &input.data).unwrap();
    });
    row.our_enc_ms = Cell::Value(ms(enc_t));
    row.our_enc_mb_s = Cell::Value(throughput_mb_s(input.data.len(), enc_t));
    let dec_t = median_of(|| {
        let _ = our_decode(algo, &our_encoded).unwrap();
    });
    row.our_dec_ms = Cell::Value(ms(dec_t));
    row.our_dec_mb_s = Cell::Value(throughput_mb_s(input.data.len(), dec_t));

    // Reference
    if let Some(r) = reference_for(algo) {
        match pipe_through(&r.encode, &input.data) {
            Ok(ref_encoded) => match pipe_through(&r.decode, &ref_encoded) {
                Ok(ref_decoded) if ref_decoded == input.data => {
                    row.reference = r.name.to_string();
                    row.ref_ratio =
                        Cell::Value((ref_encoded.len() as f64) / (input.data.len() as f64));
                    let renc_t = median_of(|| {
                        let _ = pipe_through(&r.encode, &input.data);
                    });
                    row.ref_enc_ms = Cell::Value(ms(renc_t));
                    row.ref_enc_mb_s = Cell::Value(throughput_mb_s(input.data.len(), renc_t));
                    let rdec_t = median_of(|| {
                        let _ = pipe_through(&r.decode, &ref_encoded);
                    });
                    row.ref_dec_ms = Cell::Value(ms(rdec_t));
                    row.ref_dec_mb_s = Cell::Value(throughput_mb_s(input.data.len(), rdec_t));
                }
                Ok(_) => {
                    eprintln!(
                        "warning: {algo}/{} reference round-trip mismatch",
                        input.name
                    );
                }
                Err(e) => {
                    eprintln!("warning: {algo}/{} reference decode: {e}", input.name);
                }
            },
            Err(_) => {
                // Tool missing or python module unavailable — leave as "—".
            }
        }
    }
    row
}

// ─── output ────────────────────────────────────────────────────────────

fn main() {
    let corpus = build_corpus();
    let mut algos: Vec<&str> = factory::names().to_vec();
    algos.sort();

    println!("# compcol benchmark");
    println!();
    println!(
        "Throughput in MB/s (decimal). Time in ms. Median of {TIMED_RUNS} timed runs after \
         {WARMUP_RUNS} warmup. Reference timings include subprocess startup overhead (~1–3 ms \
         on Linux); inputs are 1 MiB+ so the overhead is < 5% of the work for slower codecs \
         and 5–20% for very fast ones (lz4, snappy)."
    );
    println!();
    println!(
        "**Δ enc / Δ dec columns** = `ours / ref` MB/s. `1.0` means equal, `>1` means ours is \
         faster, `<1` means ours is slower."
    );
    println!();
    println!(
        "| Algorithm | Input | Bytes | Ours: out | Ours: ratio | Ours: enc ms | Ours: enc MB/s \
         | Ours: dec ms | Ours: dec MB/s | Reference | Ref: ratio | Ref: enc ms | Ref: enc MB/s \
         | Ref: dec ms | Ref: dec MB/s | Δ enc | Δ dec |"
    );
    println!("|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|");

    for algo in &algos {
        for input in &corpus {
            let row = bench_one(algo, input);
            let d_enc = delta(row.our_enc_mb_s, row.ref_enc_mb_s);
            let d_dec = delta(row.our_dec_mb_s, row.ref_dec_mb_s);
            println!(
                "| `{}` | {} | {} | {} | {} | {} | {} | {} | {} | {} | {} | {} | {} | {} | {} | {} | {} |",
                row.algo,
                row.input_name,
                row.input_bytes,
                row.our_size,
                row.our_ratio,
                row.our_enc_ms,
                row.our_enc_mb_s,
                row.our_dec_ms,
                row.our_dec_mb_s,
                row.reference,
                row.ref_ratio,
                row.ref_enc_ms,
                row.ref_enc_mb_s,
                row.ref_dec_ms,
                row.ref_dec_mb_s,
                d_enc,
                d_dec,
            );
        }
    }
}