This crate contains multiple implementations of the "FastCDC" content defined chunking algorithm orginally described in 2016 by Wen Xia, et al. A critical aspect of its behavior is that it returns exactly the same results for the same input. To learn more about content defined chunking and its applications, see the reference material linked below.
- Rust stable (2018 edition)
$ cargo clean
$ cargo build
$ cargo test
Examples can be found in the examples
directory of the source repository,
which demonstrate reading files of arbitrary size into a memory-mapped buffer
and passing them through the different chunker implementations.
$ cargo run --example v2020 -- --size 16384 test/fixtures/SekienAkashita.jpg
Finished dev [unoptimized + debuginfo] target(s) in 0.03s
Running `target/debug/examples/v2020 --size 16384 test/fixtures/SekienAkashita.jpg`
hash=17968276318003433923 offset=0 size=21325
hash=4098594969649699419 offset=21325 size=17140
hash=15733367461443853673 offset=38465 size=28084
hash=4509236223063678303 offset=66549 size=18217
hash=2504464741100432583 offset=84766 size=24700
The unit tests also have some short examples of using the chunkers, of which this code snippet is an example:
let read_result = fs::read("test/fixtures/SekienAkashita.jpg");
assert!(read_result.is_ok());
let contents = read_result.unwrap();
let chunker = fastcdc::v2020::FastCDC::new(&contents, 16384, 32768, 65536);
let results: Vec<Chunk> = chunker.collect();
assert_eq!(results.len(), 2);
assert_eq!(results[0].offset, 0);
assert_eq!(results[0].length, 66549);
assert_eq!(results[1].offset, 66549);
assert_eq!(results[1].length, 42917);
If you were using a release of this crate from before the 3.0 release, you will need to make a small adjustment to continue using the same implemetation as before.
Before the 3.0 release:
use fastcdc::ronomon as fastcdc;
use std::fs;
let contents = fs::read("test/fixtures/SekienAkashita.jpg").unwrap();
let chunker = fastcdc::FastCDC::new(&contents, 8192, 16384, 32768);
After the 3.0 release:
use std::fs;
let contents = fs::read("test/fixtures/SekienAkashita.jpg").unwrap();
let chunker = fastcdc::ronomon::FastCDC::new(&contents, 8192, 16384, 32768);
The cut points produced will be identical to previous releases as the ronomon
implementation was never changed in that manner. Note, however, that the other implementations will produce different results.
The original algorithm is described in FastCDC: a Fast and Efficient Content-Defined Chunking Approach for Data Deduplication, while the improved "rolling two bytes each time" version is detailed in The Design of Fast Content-Defined Chunking for Data Deduplication Based Storage Systems.
- jrobhoward/quickcdc
- Similar but slightly earlier algorithm by some of the same authors?
- rdedup_cdc at docs.rs
- Alternative implementation in Rust.
- ronomon/deduplication
- C++ and JavaScript implementation of a variation of FastCDC.
- titusz/fastcdc-py
- Pure Python port of FastCDC. Compatible with this implementation.
- wxiacode/FastCDC-c
- Canonical algorithm in C with gear table generation and mask values.
- wxiacode/restic-FastCDC
- Alternative implementation in Go with additional mask values.