The eleventh sweep, over the built-in bounds work in2ac0843. `Painter::size_hint` refused to answer for a bounded widget by returning above the diagnostics, so that read was neither a hint hit nor a miss and `hint_read` recorded nothing. It is a miss now, with the reason on it. The two `for axis in Axis::BOTH` loops that `draw_widget` grew, both writing `own_holds`, are one loop, and the comment about combining the ask's holds no longer sits between a comment and the code it describes. `Declared::from_axes` lost its only caller with `Widgets::declared_lens`; `Bounds::from_axes` and `SizeRule::declared` never had one. The scenario shrinker printed a rule with derived `Debug`, which is 130 characters an axis in a line that carries every ancestor, in the one function whose job is output a tree can be rebuilt from. It prints its parts again. `bounds_cost` invented three environment-reading spellings where four copies of one `env` helper already existed; there is now one, in `tests/rig`, and the four copies are gone. It also verified 128 regions inside its measured loop, which the other rigs deliberately do before theirs; that measured 0.65% of the total, and none of it is layout. The 250-window row with a 300 cap was built by two tests, and the one that still explained itself tested less; they are one. The half of `a_cap_attribute_narrows_the_widgets_box` that the wrapper's removal left without its deciding assertion is the allocator's path instead, which nothing at the root covered. Format, workspace clippy under -D warnings with and without layout-diagnostics, 206 ordinary and 210 diagnostic tests, 400 depth-5 trees warm against cold in 64.19s, and the cold dump byte-identical to2ac0843across all 34,986 boxes.
106 lines
3.7 KiB
Rust
106 lines
3.7 KiB
Rust
//! A fuzzer that reduces its own counterexample.
|
|
//!
|
|
//! A seed is not a lead anybody can read: the tree is hundreds of widgets,
|
|
//! and reconstructing the part that matters by hand has failed every time it
|
|
//! has been tried. This grows the trees `iris::random` describes, takes them
|
|
//! apart, and prints the smallest one that still fails as something to write
|
|
//! a fast test from.
|
|
//!
|
|
//! cargo test --release --test shrink -- --ignored --nocapture
|
|
//!
|
|
//! `SHRINK_SEEDS` how many trees to try, `SHRINK_DEPTH` how deep to grow
|
|
//! them, `SHRINK_CASE` which scenario or `all` for every one. `SHRINK_SEED`
|
|
//! takes a single seed, which is how a failure `generated` printed is handed
|
|
//! straight here: the two run the same cases over the same trees, so a seed
|
|
//! that fails there fails here and is reduced.
|
|
//!
|
|
//! It is a fuzzer: run it once the ordinary tests pass, and turn what it
|
|
//! finds into a test of its own rather than leaving a seed as the record.
|
|
|
|
mod rig;
|
|
#[path = "scenario/mod.rs"]
|
|
mod scenario;
|
|
|
|
use iris::random::{Edits, Plan, plan};
|
|
use rig::env;
|
|
use scenario::{ALL, Case, diverges, over_seeds};
|
|
|
|
/// Takes the first simplification that still fails, until none does. The
|
|
/// simplifications come biggest first, so this walks down rather than
|
|
/// nibbling: a six-hundred-widget tree reaches single figures in a few
|
|
/// hundred builds.
|
|
fn shrink(mut node: Plan, case: Case, seed: u64) -> Plan {
|
|
loop {
|
|
let Some(next) = node
|
|
.smaller()
|
|
.into_iter()
|
|
.find(|small| diverges(small, case, seed).is_some())
|
|
else {
|
|
return node;
|
|
};
|
|
node = next;
|
|
}
|
|
}
|
|
|
|
fn cases() -> Vec<Case> {
|
|
match env("SHRINK_CASE", String::from("all")).as_str() {
|
|
"all" => ALL.to_vec(),
|
|
name => match Case::named(name) {
|
|
Some(case) => vec![case],
|
|
None => panic!(
|
|
"unknown SHRINK_CASE {name:?}; one of all, {}",
|
|
ALL.map(Case::name).join(", ")
|
|
),
|
|
},
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
#[ignore = "a fuzzer; run it once the ordinary tests pass"]
|
|
fn no_grown_tree_lays_out_differently_warm_than_cold() {
|
|
let depth: usize = env("SHRINK_DEPTH", 5);
|
|
let cases = cases();
|
|
let seeds: Vec<u64> = match std::env::var("SHRINK_SEED")
|
|
.ok()
|
|
.and_then(|v| v.parse().ok())
|
|
{
|
|
Some(seed) => vec![seed],
|
|
None => (1..=env("SHRINK_SEEDS", 400_u64)).collect(),
|
|
};
|
|
let count = seeds.len();
|
|
|
|
over_seeds(seeds, |seed| {
|
|
let grown = plan(seed, depth, &Edits::default());
|
|
for &case in &cases {
|
|
if diverges(&grown, case, seed).is_none() {
|
|
continue;
|
|
}
|
|
let small = shrink(grown.clone(), case, seed);
|
|
// Described from the shrunk tree: the grown tree's chain names
|
|
// widgets that are no longer there, and the ancestry of the
|
|
// failure is what a test is written from.
|
|
let how = diverges(&small, case, seed).unwrap_or_default();
|
|
println!(
|
|
"seed {seed} case {}: {how}\ngrown {} widgets, shrank to {}\n{small:#?}",
|
|
case.name(),
|
|
grown.size(),
|
|
small.size()
|
|
);
|
|
panic!(
|
|
"seed {seed} lays out differently warm than cold after {}",
|
|
case.name()
|
|
);
|
|
}
|
|
});
|
|
|
|
let sizes: Vec<usize> = (1..=count as u64)
|
|
.map(|seed| plan(seed, depth, &Edits::default()).size())
|
|
.collect();
|
|
println!(
|
|
"{count} trees at depth {depth} agree over {} case(s): {} widgets total, largest {}",
|
|
cases.len(),
|
|
sizes.iter().sum::<usize>(),
|
|
sizes.iter().max().copied().unwrap_or(0)
|
|
);
|
|
}
|