russell@unturf.com
b5b9cce0a1
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.
12 lines
718 B
Text
12 lines
718 B
Text
=== elixir-0001: Mix.Dep.Converger.topological_sort — O(N²) Enum.find in Enum.map ===
|
|
N=100 k=100 : defective=0.097ms fixed=0.004ms speedup=24.5x
|
|
N=500 k=500 : defective=2.446ms fixed=0.024ms speedup=101.7x
|
|
N=1000 k=1000 : defective=9.928ms fixed=0.052ms speedup=192.1x
|
|
N=2000 k=2000 : defective=37.819ms fixed=0.096ms speedup=392.2x
|
|
|
|
=== elixir-0002: Kernel.Typespec — used_type_pairs list O(T²) compile-time membership scan ===
|
|
N=100 k=100 : defective=0.084ms fixed=0.003ms speedup=25.3x
|
|
N=500 k=500 : defective=2.341ms fixed=0.023ms speedup=102.9x
|
|
N=1000 k=1000 : defective=10.924ms fixed=0.046ms speedup=235.8x
|
|
N=2000 k=2000 : defective=38.549ms fixed=0.096ms speedup=403.2x
|
|
|