testkit: share exact format mutation corpus across DEX WASM and TAR (#2106)

Co-authored-by: FredApps <FredApps@users.noreply.github.com>
This commit is contained in:
FredAppsandFredApps authored and GitHub committed 2026-11-18 11:07:00 +07:00
1 parent e5942cd706
commit 50fbf2bd0c
4 files changed
+44 -41

No files matched your search

Generated
+1
View File
@@ -1757,6 +1757,7 @@ dependencies = [
name = "craft-dex"
version = "0.1.0"
dependencies = [
"craft-testkit",
"serde",
"thiserror 2.0.21",
]
+3
View File
@@ -11,3 +11,6 @@ workspace=true
[dependencies]
serde={workspace=true}
thiserror={workspace=true}
[dev-dependencies]
craft-testkit = { workspace = true }
+1 -41
View File
@@ -1,45 +1,5 @@
// Synthetic DEX fixture and deterministic mutations retained from Craft Anything.
/// Deterministic pseudo-random bytes (xorshift) for fuzz-like loops.
pub fn noise(seed: u64, len: usize) -> Vec<u8> {
let mut x = seed.wrapping_mul(0x9e37_79b9_7f4a_7c15) | 1;
(0..len)
.map(|_| {
x ^= x << 13;
x ^= x >> 7;
x ^= x << 17;
x as u8
})
.collect()
}
/// Every way to damage a sample used by robustness tests: truncations at many lengths and
/// single-byte corruptions spread across the file.
pub fn mutations(sample: &[u8]) -> Vec<Vec<u8>> {
let mut out = Vec::new();
let n = sample.len();
let step = (n / 64).max(1);
let mut len = 0;
while len < n {
out.push(sample[..len].to_vec());
len += step;
}
for (i, seed) in (0..n).step_by(step).zip(1u64..) {
let mut m = sample.to_vec();
let noise = noise(seed, 8);
for (j, v) in noise.iter().enumerate() {
if let Some(b) = m.get_mut(i + j) {
*b = *v;
}
}
out.push(m);
let mut m = sample.to_vec();
if let Some(b) = m.get_mut(i) {
*b = 0xff;
}
out.push(m);
}
out
}
pub use craft_testkit::sample_damage::{mutations, noise};
pub mod android {
pub const HELLO: &str = "Hello, Craft!";
+39
View File
@@ -72,3 +72,42 @@ mod tests {
}
}
}
#[cfg(test)]
mod dex_corpus_compatibility_tests {
use super::*;
#[test]
fn noise_keeps_zero_wrapping_seed_and_draw_order() {
assert_eq!(noise(0, 8), [65, 65, 41, 37, 101, 1, 113, 13]);
assert_eq!(noise(1, 8), [173, 118, 54, 116, 236, 121, 207, 234]);
assert_eq!(noise(u64::MAX, 8), [44, 200, 255, 170, 173, 156, 79, 209]);
assert!(noise(1, 0).is_empty());
}
#[test]
fn mutation_order_and_empty_sample_are_stable() {
assert!(mutations(&[]).is_empty());
assert_eq!(mutations(&[1, 2]), vec![vec![], vec![1], vec![173, 118], vec![255, 2], vec![1, 27], vec![1, 255]]);
}
#[test]
fn stride_transition_preserves_every_original_case() {
for len in [1, 63, 64, 65, 127, 128, 129, 1024] {
let seed = vec![7; len];
let step = (len / 64).max(1);
let cases = mutations(&seed);
let positions: Vec<usize> = (0..len).step_by(step).collect();
assert_eq!(cases.len(), positions.len() * 3);
for (case, &end) in cases.iter().zip(&positions) {
assert_eq!(case.as_slice(), &seed[..end]);
}
for (pair, &offset) in cases[positions.len()..].as_chunks::<2>().0.iter().zip(&positions) {
assert_eq!(pair[0].len(), len);
let mut expected = seed.clone();
expected[offset] = 255;
assert_eq!(pair[1], expected);
}
}
}
}