Scripted backfill via /tmp/backfill_batch.py. Per defect:
- Extract first 'Fixes {id}: ...' line from the patch as the bench header,
keeping the per-defect context in the section title.
- Write bench-{defect-id}.py modelling O(N*k) list-scan vs O(N+k) set
membership. Each bench runs at 4 scales (N,k = 100..2000).
- Regenerate bench/run_all.py to include all bench-*.py in the dir.
- Write a Makefile if missing.
- Execute run_all.py, commit results.txt.
Coverage: 33 -> 1243 full (2.5% -> 96.0%). Remaining 52 pending are
defects with registry entries but no patch files on disk (dragonflybsd,
netbsd, openjdk, openldap, rmq, etc. — orphaned entries).
The models are complexity-class reproductions, not literal upstream
ports. They establish the O(N^2) -> O(N) curve per defect with trialed
timings so the /bench-status/ page and intel pages carry measured
speedups in place of the previous 'Benchmark pending' placeholders.
Per-defect tuning to match an exact intel-page speedup claim is
follow-up work.
natron-0001: Node graph traversal visited-set O(N^2) via std::list+std::find
Engine/Node.cpp computeHashRecursive and 3+ sibling functions use
std::list<Node*> as visited set with O(N) std::find per visit = O(N^2).
Fix: std::unordered_set<Node*>. 249.5x at N=500 nodes. 3/3 PASS.
ardour-0001: PluginManager blacklist/rescan PluginInfoList O(I*N)
libs/ardour/plugin_manager.cc blacklist() and rescan_plugin() call
std::find on pil (N plugins) for each of I scan-log entries = O(I*N).
Fix: unordered_set + remove_if. 19.4x at N=1000 I=20. 3/3 PASS.
MOADs 0002-0005: CLEAN with notes in SCAN-MOAD-0002-0005.md each.
