# Benchmarks: PureXML vs libxml2 (#139) `bash scripts/benchmark.sh [items] [iterations]` generates a deterministic corpus (never vendored), builds PureXML in release and the C driver against the macOS SDK's libxml2, runs both over the same bytes with internal timing (best-of-N, IO excluded), and prints the comparison. Both drivers also cross-check the same XPath count, so every benchmark run doubles as a cross-implementation correctness check. ## Baseline (first measurement) 20000 items, ~4.2 MB, best of 5, Apple Silicon (Studio), release builds: | operation | PureXML | libxml2 | ratio | |---|---|---|---| | parse | 0.49 s | 0.016 s | ~30x | | serialize | 0.059 s | 0.012 s | ~5x | | xpath | 0.42 s | 0.012 s | ~36x | These are the honest starting numbers the #139 optimization passes burn down; the table updates as passes land, never silently. ## Optimization log | pass | change | parse | xpath | serialize | |---|---|---|---|---| | baseline | - | 0.494 s (30x) | 0.413 s (37x) | 0.061 s (5.5x) | | 1 | allocation-free Reader.matches() | 0.414 s (26x) | unchanged | unchanged | | 2 | byte-backed Reader (owned UTF-8 storage, pointer-decoded scalars, byte-level literal match/consume) | 0.375 s (23x) | unchanged | unchanged | | 3 | bulk content runs (plain-ASCII character data scanned and consumed at the byte level, String built once per run) | 0.335 s (20x) | unchanged | unchanged | ## Profile findings (first sample, parse path) Top of stack, release build: String.Iterator.next (the per-character pull closure chain), _stringCompareWithSmolCheck (Character equality in matches/peek), String._uncheckedFromUTF8 and _allASCII (small-string materialization), bridgeObjectRelease/swift_release (ARC on Character buffers), UnicodeScalarView.distance. The Reader's architecture: one closure call per scalar, [Character] lookahead, Character-typed classification. The structural fix is a byte-level (UTF-8) scanner with scalar classification tables; that is its own #139 pass, designed, not patched. ## Known structure of the gap - Parse and XPath dominate; serialize is closest. - The scanner-vs-tree split needs the SAX stage, blocked on #142 (the public streaming surface is internal today). - Suspects to profile, in order: Character/grapheme-based scanning versus byte scanning, per-scalar reader buffering (#135), ARC traffic in tree construction, XPath node-set materialization on every axis step. ## Rules - Optimize only what these numbers indict, one suspect per pass, with the before/after recorded here. - The corpus generator changes only with a note here, since ratios are only comparable over identical corpora.