quiche — Watchdog Audit

Executive summary

Band capped at Weak: the weakest category (Security, 0%) reads Critical — the cover never out-promises the category table.

Preview (pre-1.0). This repo hasn't declared a stable release, so it's judged against a relaxed, pre-production bar.

This large-scale asset, representing nearly one person-year of effort to rebuild, currently operates at a weak overall standing of 52%. While the underlying architecture is robust and the codebase is mature, the system carries significant business risk due to critical gaps in operational readiness and accessibility. The value tied up here is substantial, with a rebuild cost estimated at €110,000, making it essential to protect this investment through targeted, high-leverage improvements rather than wholesale replacement.

The most urgent concern is accessibility compliance, which sits at a dangerously low 41%. For a system of this size, this gap exposes the organization to legal liability and excludes a segment of users, directly impacting revenue and brand reputation. The cost of inaction is high: annual maintenance drag on the frequently changed code areas suggests a recurring tax of 4–9% on development velocity. Addressing the top accessibility fix, which involves adding programmatic labels to controls and buttons, pays for itself within months by eliminating this recurring drag and reducing future defect rates.

A secondary theme is operational fragility. Despite strong code health and architectural integrity, the system’s readiness score is only 47%, indicating that changes may ripple unpredictably or that security and testing safeguards are insufficient. This creates a risk of unexpected outages or security exposures, particularly given that supply-chain provenance is not actively monitored. The lack of measured security controls and incomplete documentation maturity means a new team would struggle to maintain the system safely, increasing long-term support costs.

The genuine strength lies in the solid architectural foundation and high event-sourcing maturity, which provide a stable base for change. To maximize leverage, leadership should prioritize enforcing accessibility in the test suite immediately. This single action offers the fastest return on investment, stabilizing the user experience and reducing the annual velocity tax. Until confidence improves in unmeasured areas like security and supply chain, treat the current picture as partial and focus resources on the highest-impact, lowest-effort fixes.

Code Health 81% Strong Architecture 93% ★ Exemplary Maturity 77% Strong Readiness 47% Adequate · gated by D13 Security 61% Adequate · gated by D29 Event Sourcing 100% ★ Exemplary Accessibility 41% Weak · gated by AC2, AC3 Performance 100% ★ Exemplary

How the score is built — each lens's share of the headline Width is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.

Accessibility 41% · 45% weightReadiness 47% · 25% weightSecurity 61% · 14% weightMaturity 77% · 8% weightCode Health 81% · 4% weightArchitecture 93% · 2% weightEvent Sourcing 100% · 1% weightPerformance 100% · 1% weight

Raise Accessibility 41 → 70 (the Healthy floor) ⇒ headline 52 → ~59.

Code composition — where the lines go

Tests 100%

New since the last scan (15+)

15 finding(s) are new versus the previous scan (2026-09-12) — surfaced by this scheduled scan itself, no pull request required.

D5 · Unstable project tokio-quiche
D5 · Off the main sequence: netlog
D5 · Off the main sequence: task-killswitch
D5 · Off the main sequence: qlog
D5 · Off the main sequence: octets
D15 · Hotspot: apps/src/client.rs apps/src/client.rs
D15 · Hotspot: quiche/src/recovery/gcongestion/bbr2.rs quiche/src/recovery/gcongestion/bbr2.rs
D17 · TodoComment quiche/src/tests.rs
D22 · Duplicate function signature with different parameter names (fd vs _fd) in the same module. This suggests copy-paste error or unresolved conflict.
D22 · Ambiguous intent between `get` and `get_empty`. It is unclear if `get` returns a buffer with existing data or if it is an alias for `get_empty`. If `get` is the standard allocator, `get_empty` is redundant or confusingly named.
D22 · Inconsistent error handling for similar operations. `ConsumeBuffer` returns a boolean (likely success/fail), while `DgramBuffer` returns a `Result`. This forces users to handle errors differently for conceptually identical buffer manipulation.
D22 · Inconsistent return types for 'as' accessors. `as_raw_io` returns a typed borrow (`BorrowedFd`), while `as_buf_io` returns a `String` (likely a name or path). This breaks the expectation that `as_*` methods return references or borrows of the underlying type.
D22 · Naming inconsistency between `send_headers_frame` and `send_headers_frame_literal`. The distinction (literal vs encoded?) is not obvious from the name alone and lacks a consistent pattern (e.g., `encode` vs `raw`).
D29 · REDACTED
D35 · Change coupling: recv_buf.rs ↔ tests.rs quiche/src/stream/recv_buf.rs

A full-fidelity diff against the previous run's complete recorded findings — line-move tolerant: a finding that only shifted line counts as unchanged, only genuinely new titles/files surface here.

Rebuild cost & value ~ Modeled — €38,000–€190,000

Cost to rebuild	€38,000–€190,000 (0.4–1.2 person-years (634–2,011 h), ~1–2 engineers)
Domain complexity	Standard — harder problems cost more per line
Quality factor	0.7× (at 52% quality) — the last 20% of quality is most of the work
Size & shape	Large · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)

This codebase represents roughly ~0.8 person-years of build effort (about ~€110,000 to rebuild). Its weakest lens is Accessibility at 41% — the part of that asset most exposed by the findings below.

How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.0) — standard service × a 0.7× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).

Top priorities

The highest-leverage moves; the full ranked list is in the Roadmap below.

Resolve the 3 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (3).

+6.7 pts · Low effort · REDACTED Scanning

Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.

+9.1 pts · Medium effort · Forms & labels

Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.

+9.1 pts · Medium effort · Page structure

Diagnosis — what's actually going on

Value concentrated against a weak lens · High · Value at risk

This is a Large asset (~0.8 person-years to rebuild), and its weakest lens is Accessibility at 41%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.

Evidence: valuation: Large, ~0.8 person-years rebuild (111,460 LoC) · weakest lens: Accessibility 41%

→ Direct remediation budget at Accessibility first — highest risk-reduction per euro on an asset this size.

The top fix pays for itself · High · Economics

The top-ranked fix costs roughly 1–3 engineer-days once. Not doing it costs about 4.8–28.8 engineer-days every year, paid as drag on the ~48,423 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 1–7 months and is free after that. Method, stated so this is not read as a quotation: debt from the ranked task's effort band; interest = annual changed lines (measured, annualised from the 90-day window) ÷ an ASSUMED 150–400 lines per engineer-day × the 4–9% drag implied by the code-quality signals; breaking point = debt ÷ annual interest. A modelled planning range built from measured inputs and one named assumption — not a quotation, a valuation, or a certified figure.

Evidence: D15 churn: 11,940 line(s) changed over a 90-day window ⇒ ~48,423/year · D1/D2/D4 code quality: averaging 6.4/10 ⇒ a 4–9% drag on each change · top-ranked remediation: Low effort ⇒ about 1–3 engineer-day(s)

→ Do the top-ranked fix now if this code will still be yours in 7 months.

Highest-leverage move · Medium · Leverage

Of everything flagged, the best return on effort is: Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label. The rest can wait behind it.

Evidence: priority ranking: top of 5 ranked by impact/effort

→ Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.

A velocity tax on every change · Medium · Economics

The code-quality signals (complexity, duplication, cohesion) average 6.4/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 4–9% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)

Evidence: D1/D2/D4 code quality: averaging 6.4/10 across the code-quality signals actually measured

→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.

Architecture — module dependency matrix

Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)

175 modules, 451 dependencies. 9 dependency cycles across 54 modules, marked above the diagonal.

Showing the 40 most-connected modules; 135 more are not drawn.

Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
depends on →	1 datagram_socket.socket_stats	2 h3i.config	3 netlog.h2	4 quiche.recovery.bandwidth	5 quiche.recovery.rtt	6 octets	7 qlog.events.http3	8 quiche.recovery.gcongestion	9 quiche.recovery.gcongestion.bbr2.network_model	10 h3i.prompts.h3	11 qlog	12 qlog.events.quic	13 quiche.frame	14 quiche.h3	15 quiche.recovery	16 quiche.h3.ffi	17 quiche.path	18 quiche.recovery.gcongestion.bbr2.mode	19 quiche.packet	20 quiche.recovery.gcongestion.bbr2	21 quiche	22 quiche.ffi	23 quiche.tls	24 tokio_quiche.quic.io.worker	25 qlog.events	26 tokio_quiche.quic.connection	27 h3i.recordreplay.qlog	28 qlog_dancer.datastore	29 quiche.recovery.congestion.recovery	31 tokio_quiche.quic.router	32 h3i.actions.h3	33 qlog_dancer.config	36 quiche.recovery.congestion	40 qlog_dancer
1 datagram_socket.socket_stats
2 h3i.config
3 netlog.h2
4 quiche.recovery.bandwidth
5 quiche.recovery.rtt
6 octets										1
7 qlog.events.http3																									4
8 quiche.recovery.gcongestion				1	1										1
9 quiche.recovery.gcongestion.bbr2.network_model				2																2
10 h3i.prompts.h3		1				1																									1
11 qlog			1							1															1
12 qlog.events.quic							1				1												1		16
13 quiche.frame						4						1
14 quiche.h3		1				1				1			1									1
15 quiche.recovery	3	1		2				1					1						1				1		2
16 quiche.h3.ffi		1	1											3								1
17 quiche.path	1	1													4							1
18 quiche.recovery.gcongestion.bbr2.mode									1						3					9
19 quiche.packet						2						1			1	1
20 quiche.recovery.gcongestion.bbr2				3	1			5							1			1
21 quiche		2						2		1			1		6	1	3		5			4	2		1
22 quiche.ffi		1												1	1		2		1		1
23 quiche.tls															1							2
24 tokio_quiche.quic.io.worker	2																1		2			1				1
25 qlog.events			1								1												1
26 tokio_quiche.quic.connection	9																		2			2	2	2
27 h3i.recordreplay.qlog			1				3					1				1							2		1						2
28 qlog_dancer.datastore			2				3				3	6													1
29 quiche.recovery.congestion.recovery	1			1	2								2		9				2						1								1
30 tokio_quiche.http3.driver		1	1							1				1		1										2
31 tokio_quiche.quic.router		2								1						1			2				2			3
32 h3i.actions.h3														1		1											1
33 qlog_dancer.config																												1						1
34 qlog_dancer.plots																												2
35 qlog_dancer.seriesstore																												1
36 quiche.recovery.congestion	1			1	1										3														1
37 quiche.recovery.gcongestion.recovery	1			1	1			2					2		10				1						1				3
38 tokio_quiche.quic.router.acceptor		1														1			1		1					1				1
39 tokio_quiche.quic.router.connector		1										1				1			2				1			1				1
40 qlog_dancer											1	1																1				1

Dependency, pointing down the layeringAbove the diagonal — part of a cycleThe module itself

At a glance — Code Health · 81% · Strong ·

The Good

D3 · Rust God Classes 8.1 D4 · Rust Code Duplication 9.6 D17 · Rust Explicit Debt 9.7

The Bad

D1 · Rust Cyclomatic Complexity 5.4

The Ugly

D2 · Rust Cognitive Complexity 4.3

At a glance — Architecture · 93% · Exemplary ·

The Good

D26 · Rust Project Cohesion 8.3 D35 · Rust Change Coupling 9.6 AX10 · Repo Code composition 9.8 AX3 · Repo Project dependency cycles 10.0 AX4 · Repo Dependency direction 10.0 AX8 · Repo Test isolation 10.0 AX9 · Repo CQS / query purity 10.0

The Bad

D5 · Rust Coupling 6.2 D22 · Rust Internal API Consistency 6.0

At a glance — Maturity · 77% · Strong ·

The Good

D15 · Rust Churn × Complexity Hotspots 8.4 D16 · Rust Bus Factor 9.4 D19 · Rust Documentation Quality 7.8 D21 · Rust Naming Consistency 10.0 D34 · Rust Knowledge Freshness 9.0 M1 · Repo Documentation (README) 7.9 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 10.0

The Bad

M2 · Repo Architecture documentation 5.0

The Ugly

D20 · Rust ADR Quality 0.0

At a glance — Readiness · 47% · Adequate · gated by D13 ·

The Good

D9 · Rust Test Distribution 10.0 P1 · Repo CI/CD gates 10.0 P2 · Repo Observability 7.0 P3 · Repo Security & performance tooling 8.0

The Bad

P4 · Repo Deployment & Rollback 5.0 P6 · Repo Release Hygiene 5.0

The Ugly

D13 · Rust REDACTED Scanning 0.0

At a glance — Security · 61% · Adequate · gated by D29 ·

The Good

D31 · Rust IaC & Container Security 8.4 S1 · Repo Web-Security Posture 8.0

The Ugly

D28 · Rust Secrets (history) 4.0 D29 · Rust Static Analysis (SAST) 1.8

At a glance — Event Sourcing · 100% · Exemplary ·

The Good

ES1 · Repo Fold determinism 10.0 ES2 · Repo Immutable events 10.0

At a glance — Accessibility · 41% · Weak · gated by AC2, AC3 ·

The Good

AC6 · Repo Visual & motion safety 10.0

The Ugly

AC2 · Repo Forms & labels 3.5 AC3 · Repo Page structure 2.2 AC7 · Repo A11y enforcement 4.0

At a glance — Performance · 100% · Exemplary ·

The Good

PF3 · Repo Async & latency hygiene 10.0

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP category	Findings	Severity
A03:2021 — Injection	46	High / Critical
A02:2021 — Cryptographic Failures	10	High / Critical
A05:2021 — Security Misconfiguration	7	High / Critical

Roadmap

First, fix accessibility by adding programmatic labels to all controls and buttons, and correct page structure by defining language, title, main landmark, and proper heading order. Next, enforce these accessibility standards in your test suite and CI pipeline to prevent regressions, while simultaneously resolving the three leaked secrets found in your codebase. Finally, implement a manual approval gate or draft release process to ensure no bad build reaches users without human intervention.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do this	Helps	Effort	Dimension
Resolve the 3 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (3).	+6.7 pts	Low	REDACTED Scanning
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.	+9.1 pts	Medium	Forms & labels
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.	+9.1 pts	Medium	Page structure
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.	+9.1 pts	Medium	A11y enforcement
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.	+6.6 pts	Medium	Deployment & Rollback
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.	+6.6 pts	Medium	Release Hygiene
Resolve the 6 REDACTED finding(s) in Secrets (history) — start with REDACTED (5), REDACTED.	+2.2 pts	Low	Secrets (history)
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED (3).	+2.2 pts	Low	Static Analysis (SAST)

File quality

Per-file score 0–10 — a quality signature. Of 110 files carrying findings, judged against the Preview bar: 1% slop · 50% mixed · 49% near-clean.

File	Score	Band	Worst signal
REDACTED	1.1	Slop	IaC & Container Security: High IaC: REDACTED
REDACTED	3.0	Mixed	REDACTED Scanning: Leaked secret: REDACTED
REDACTED	4.4	Mixed	REDACTED Scanning: Leaked secret: REDACTED
REDACTED	4.4	Mixed	REDACTED Scanning: Leaked secret: REDACTED
REDACTED	4.4	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	4.4	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	4.4	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	4.6	Mixed	Static Analysis (SAST): High: REDACTED
apps/src/bin/quiche-server.rs	5.6	Mixed	Cyclomatic Complexity: quiche_apps::bin::quiche-server::main (cyclomatic 65)
REDACTED	5.8	Mixed	Static Analysis (SAST): High: REDACTED
quiche/src/lib.rs	6.0	Mixed	Explicit Debt: TodoComment
h3i/src/client/sync_client.rs	6.0	Mixed	Explicit Debt: TodoComment
quiche/src/frame.rs	6.0	Mixed	Explicit Debt: TodoComment
quiche/src/h3/mod.rs	6.0	Mixed	Explicit Debt: TodoComment
qlog-dancer/src/datastore.rs	6.0	Mixed	Explicit Debt: TodoComment
quiche/src/transport_params.rs	6.0	Mixed	Explicit Debt: TodoComment
quiche/src/recovery/gcongestion/bbr2.rs	6.0	Mixed	Explicit Debt: TodoComment
qlog-dancer/src/reports/events.rs	6.0	Mixed	Explicit Debt: TodoComment
qlog-dancer/src/plots/stream_multiplex.rs	6.0	Mixed	Explicit Debt: TodoComment
qlog-dancer/src/plots/stream_sparks.rs	6.0	Mixed	Explicit Debt: TodoComment

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 63

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 491

Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.

Minor — 8

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 51

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 37 of 42 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 5 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.8 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.

What we checked — 42 dimensions across the health lenses

D1D2D3D4D5D9D13D15D16D17D19D20D21D22D26D28D29D31D34D35AC2AC3AC6AC7AX10AX3AX4AX8AX9ES1ES2M1M2M3M4P1P2P3P4P6PF3S1

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions

Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 542 of 562 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

Method	Backs	Version	Evaluator
Roslyn static analysis	Complexity, cohesion, coupling, dead code, API surface, layering	5.3.0	✓ deterministic
Native secret scanner	Hardcoded secrets / credentials	1.0.0	✓ deterministic
Watchdog duplication detector (in-process)	Code duplication	1.0.0	✓ deterministic
Coverage (coverlet / dotnet-coverage)	Line & branch coverage	10.0.400	✓ deterministic
NuGet / dotnet	Outdated, vulnerable & deprecated dependencies	10.0.400	✓ deterministic
git / LibGit2Sharp	Churn hotspots, knowledge concentration, history	2.43.0 · 0.31.0	✓ deterministic
gitleaks · semgrep · trivy · checkov	Secrets in history, SAST, CVEs, IaC & container, PII / GDPR	1.86.0 · 0.69.3 · 3.2.533	✓ deterministic
LLM (sampled · advisory)	Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement	Local LLM	◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a0eae6-180a-7e3b-96c2-5dad5cf2b65f.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

D6 Cohesion (LCOM4) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.rs) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs) and this repository declares a Cargo test suite (repository root, 80 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — 35 direct Cargo declaration(s) were read, but the outdated signal needs crates.io, and no committed Cargo.lock resolves them to versions, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
D14 License Compliance — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — this repository declares Cargo manifests but commits no Cargo.lock, so the set of crates it actually ships is not resolvable from the checkout: its declarations carry version RANGES, and grading whichever release happens to be newest today would be a verdict about a dependency graph this repository has not pinned. Commit the lock and this dimension grades the closure against crates.io. NOT a finding that this repository's licences are compliant: this dimension asserts nothing about its licensing in either direction.
D30 Dependency Vulnerabilities — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Osv: the scanner produced no output at all, so no dependency was actually scanned. 'osv-scanner' exited 128 and produced no findings, and that exit code has no documented repo-side meaning — so this run measured nothing, and nothing here is a statement about the repository.
D43 Malicious Dependencies — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Osv: the scanner produced no output at all, so no dependency was actually scanned. 'osv-scanner' exited 128 and produced no findings, and that exit code has no documented repo-side meaning — so this run measured nothing, and nothing here is a statement about the repository.
D44 Platform End-of-Life — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a REDACTED) is simply not read here yet.
AX1 Captive dependencies — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AX2 Stateful singletons — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
ED5 Idempotency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check finds retry-prone mutations by walking the repository's declared types, and NONE was loaded on this run, so it had nothing to look at. That is a limit of the analyzer's reach — it reads .NET projects — not a finding that this repository has no command handlers or message consumers.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P10 Library API & versioning — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads NuGet packaging and C# public API only, and no .NET project was loaded for this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
PF1 Benchmark discipline — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
PF2 Allocation hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X1 Async correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X10 Duplicated predicate — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X14 Bypassable address classification — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X20 Mistyped argument guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X21 Side-effecting pattern guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X23 Unguarded diagnostic materialisation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X25 Inert configuration knob — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X26 Unsynchronised callback handoff — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X28 Index access outside its own emptiness guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X30 Support guard that admits what it rejects — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X32 Type resolved by simple name across every loaded assembly — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X6 Hand-rolled structured-format parsing — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X7 Silent fallback defaults — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D22 Internal API Consistency: API-surface coherence is an LLM judgement over a sample of the public surface — consistency of intent across the whole API is approximated, not exhaustively verified.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

The LLM boundary

LLM-set scores this run (5): D19, D21, D22, D26, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.

Dimensions

D1 · Cyclomatic Complexity5.4 / 10Adequate✓ Tool-verified

What it measures: How tangled the control flow is — methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

Maturity: Documented → Verified → Prevented · effective 5.4 / 10 · rule-coverage 100% · ceiling Prevented

50 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Connection::send_single at 180. A further 14 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being EventType::from at 51 — they are counted neither in the figure above nor in this dimension's score. 7 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: qlog/src/events/mod.rs (EventType::from at 51), h3i/src/prompts/h3/errors.rs (h3i::prompts::h3::errors::prompt_transport_or_app_error at 42), netlog/src/h2.rs (netlog::h2::parse_event at 26), h3i/src/prompts/h3/mod.rs (Prompter::handle_action at 25), tokio-quiche/src/metrics/labels.rs (H3Error::serialize at 24), and 2 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

Connection::send_single (cyclomatic 180) · ×11quiche/src/lib.rs:4123

qlog_dancer::reports::events::frames_to_string (cyclomatic 28) · ×6qlog-dancer/src/reports/events.rs:81

Frame::from_bytes (cyclomatic 42) · ×4quiche/src/frame.rs:190

Http3Conn::build_h3_response (cyclomatic 31) · ×3apps/src/common.rs:900

quiche_apps::client::connect (cyclomatic 72) · ×2apps/src/client.rs:47

+ 18 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 11 Connection finding(s) in Cyclomatic Complexity — start with lib.rs (7), mod.rs (4). — One of this dimension's main actionable groups (11 warning-level).
Resolve the 6 qlog_dancer finding(s) in Cyclomatic Complexity — start with events.rs (2), datastore.rs, stream_multiplex.rs. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 4 Frame finding(s) in Cyclomatic Complexity — start with frame.rs (4). — One of this dimension's main actionable groups (4 warning-level).
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D2 · Cognitive Complexity4.3 / 10Weak✓ Tool-verified

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

Maturity: Documented → Verified → Prevented · effective 4.3 / 10 · rule-coverage 100% · ceiling Prevented

78 method(s) exceeded the cognitive complexity threshold of 15; the worst was Connection::send_single at 332.

Connection::send_single (cognitive 332) · ×12quiche/src/lib.rs:4123

qlog_dancer::datastore::with_netlog_reader (cognitive 96) · ×10qlog-dancer/src/datastore.rs:1749

Http3Conn::build_h3_response (cognitive 39) · ×5apps/src/common.rs:900

Datastore::consume_netlog_quic (cognitive 46) · ×4qlog-dancer/src/datastore.rs:409

quiche_apps::bin::quiche-server::main (cognitive 199) · ×3apps/src/bin/quiche-server.rs:56

+ 32 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 12 Connection finding(s) in Cognitive Complexity — start with lib.rs (8), mod.rs (4). — One of this dimension's main actionable groups (12 warning-level).
Resolve the 10 qlog_dancer finding(s) in Cognitive Complexity — start with events.rs (2), datastore.rs, stream_sparks.rs. — One of this dimension's main actionable groups (10 warning-level).
Resolve the 5 Http3Conn finding(s) in Cognitive Complexity — start with common.rs (5). — One of this dimension's main actionable groups (5 warning-level).
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D3 · God Classes8.1 / 10Strong✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

Maturity: Documented → Verified → Prevented · effective 8.1 / 10 · rule-coverage 100% · ceiling Prevented

82 god class(es) detected.

MethodTooLong: Connection.send_single · ×23quiche/src/lib.rs:4123

FileTooLong: src/lib.rs · ×17quiche/src/lib.rs

FunctionTooLong: qlog_dancer::plots::stream_sparks::plot_sparks · ×13qlog-dancer/src/plots/stream_sparks.rs:608

ClassTooLong: Connection · ×11quiche/src/lib.rs:1323

TooManyMethods: Connection · ×10quiche/src/lib.rs:1323

+ 1 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 23 MethodTooLong finding(s) in God Classes — start with frame.rs (7), mod.rs (5), lib.rs (4). — One of this dimension's main actionable groups (23 warning-level).
Resolve the 17 FileTooLong finding(s) in God Classes — start with mod.rs (4), recovery.rs (2), lib.rs. — One of this dimension's main actionable groups (17 warning-level).
Resolve the 13 FunctionTooLong finding(s) in God Classes — start with main.rs (2), stream_sparks.rs, quiche-server.rs. — One of this dimension's main actionable groups (13 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D4 · Code Duplication9.6 / 10Stronggated by 103 serious findings✓ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

Maturity: Documented → Verified → Prevented · effective 9.6 / 10 · rule-coverage 100% · ceiling Verified

101 duplicated block group(s) detected. A further 2 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.

Duplicated block (9 lines × 2) · ×7apps/src/client.rs:77

Duplicated block (14 lines × 2) · ×6apps/src/bin/quiche-server.rs:116

Duplicated block (12 lines × 2) · ×6qlog-dancer/src/plots/pending.rs:166

Duplicated block (19 lines × 2) · ×5qlog-dancer/src/plots/packet_received.rs:48

Duplicated block (17 lines × 2) · ×5h3i/src/prompts/h3/mod.rs:420

+ 48 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 7 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with client.rs, common.rs, stream_sparks.rs. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 6 Duplicated block (14 lines × 2) finding(s) in Code Duplication — start with quiche-server.rs, common.rs, stream_multiplex.rs. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 6 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with pending.rs, html.rs, ffi.rs. — One of this dimension's main actionable groups (6 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D5 · Coupling6.2 / 10Adequate✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 6.2 / 10 · rule-coverage 100% · ceiling Prevented

11 production modules (Cargo), 0 dependency cycle(s), 1 unstable depended-on module(s). Read from the build's own module declarations; 4 module(s) off the main sequence.

Off the main sequence: netlog · ×4

Unstable project tokio-quiche

What to do

Resolve the 4 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 1 Unstable project tokio-quiche finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

1005 test methods: 894 unit, 111 integration, 0 BDD, 0 e2e. The Rust suite contributes 1005 `#[test]` function(s) across 80 file(s) declaring at least one; its unit/integration split is Cargo's own — 14 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

Do you agree with this assessment?

D13 · REDACTED Scanning0.0 / 10Critical✓ Tool-verified

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Prevented

3 secret(s) detected.

REDACTED

What to do

Resolve the 3 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Enforce REDACTED Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D15 · Churn × Complexity Hotspots8.4 / 10Strong✓ Tool-verified

What it measures: Files that change often and are also complex — the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

Maturity: Documented → Verified → Prevented · effective 8.4 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: quiche/src/lib.rs (11×180=1980); quiche/src/h3/mod.rs (8×42=336); apps/src/client.rs (2×72=144)

Hotspot: quiche/src/lib.rs · ×9quiche/src/lib.rs:4123

What to do

Resolve the 9 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (3), lib.rs, client.rs. — One of this dimension's main actionable groups (9 warning-level).

Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D16 · Bus Factor9.4 / 10Exemplary✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

Maturity: Documented → Verified → Prevented · effective 9.4 / 10 · rule-coverage 100% · ceiling Documented

9 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is qlog-dancer/src/request_stub.rs. Counted over 163 of the 180 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1

Further sole-owners (lower concentration)

✓ On the Gold path — maintain.

Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D17 · Explicit Debt9.7 / 10Stronggated by 149 serious findings✓ Tool-verified

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Prevented

149 deducted task-comment markers across 111460 LoC (0.1/KLoC) → score 9.7. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

TodoComment · ×140h3i/src/main.rs:361

FixmeComment · ×8quiche/src/path.rs:361

XxxCommentquiche/src/lib.rs:8824

What to do

Resolve the 140 TodoComment finding(s) in Explicit Debt — start with mod.rs (30), lib.rs (11), datastore.rs (7). — One of this dimension's main actionable groups (140 warning-level).
Resolve the 8 FixmeComment finding(s) in Explicit Debt — start with recovery.rs (6), path.rs, tests.rs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 1 XxxComment finding(s) in Explicit Debt — start with lib.rs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D19 · Documentation QualityStrong◐ Sampled · advisory

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.

Maturity: Documented → Verified → Prevented · effective Strong / 10 · rule-coverage 100% · ceiling Documented

The repository's root README (1747 words) and its subdirectories' READMEs all provide strong project context: an overview of what quiche is (an QUIC/HTTP3 transport protocol implementation), a post on how it came about and design insights, usage examples for the command-line apps, and links to relevant RFCs. The fuzz/README, h3i/README, netlog/README, qlog-dancer/README, qlog/README, tokio-quiche/README, and quiche/examples/README each document their own directories (fuzzers, interactive tool, reverse-logging crate, stats/generator, logging model, bridging library, C examples) without the repository-level overview. The READMEs are well structured with headings and a visible outline; none is unstructured or missing an architecture/design doc. The tools/http3_test README describes what it provides (an API to build httpbin test requests and expected outcomes) and gives a short building/run example with cargo test. It documents the directory rather than the repository root, so its overview is limited to that file's content; the body covers setup, an environment-variable override list, and some test options, but no usage examples beyond the inline commands. The architecture/design docs are absent (0 files).

What to do

Improve Documentation Quality — currently 7.8/10. — The repository's root README (1747 words) and its subdirectories' READMEs all provide strong project context: an overview of what quiche is (an QUIC/HTTP3 transport protocol implementation), a post on how it came about and design insights, usage examples for the command-line apps, and links to relevant RFCs. The fuzz/README, h3i/README, netlog/README, qlog-dancer/README, qlog/README, tokio-quiche/README, and quiche/examples/README each document their own directories (fuzzers, interactive tool, reverse-logging crate, stats/generator, logging model, bridging library, C examples) without the repository-level overview. The READMEs are well structured with headings and a visible outline; none is unstructured or missing an architecture/design doc. The tools/http3_test README describes what it provides (an API to build httpbin test requests and expected outcomes) and gives a short building/run example with cargo test. It documents the directory rather than the repository root, so its overview is limited to that file's content; the body covers setup, an environment-variable override list, and some test options, but no usage examples beyond the inline commands. The architecture/design docs are absent (0 files).

Detailed fixes: d19_recommendation.md.

Do you agree with this assessment?

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs found

What to do

Resolve the 1 No ADRs found finding(s) in ADR Quality. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D21 · Naming ConsistencyExemplary◐ Sampled · advisory

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.

Maturity: Documented → Verified → Prevented · effective Exemplary / 10 · rule-coverage 100% · ceiling Verified

0 naming inconsistencies across 0 sampled symbols.

✓ On the Gold path — maintain.

Detailed fixes: d21_recommendation.md.

Do you agree with this assessment?

D22 · Internal API ConsistencyAdequate◐ Sampled · advisory

What it measures: Whether the internal API surface is consistent and coherent.

Method: Judged by language model at low temperature over a sample of the public API surface (IsPackable or .Contracts types). Sampled, advisory; confidence discounted by model uncertainty.

Maturity: Documented → Verified → Prevented · effective Adequate / 10 · rule-coverage 100% · ceiling Verified

5 API inconsistencies across a 400-member sample of 488 exposed types.

Duplicate function signature with different parameter names (fd vs _fd) in the same module. This suggests copy-paste error or unresolved conflict.

Ambiguous intent between `get` and `get_empty`. It is unclear if `get` returns a buffer with existing data or if it is an alias for `get_empty`. If `get` is the standard allocator, `get_empty` is redundant or confusingly named.

Inconsistent error handling for similar operations. `ConsumeBuffer` returns a boolean (likely success/fail), while `DgramBuffer` returns a `Result`. This forces users to handle errors differently for conceptually identical buffer manipulation.

Inconsistent return types for 'as' accessors. `as_raw_io` returns a typed borrow (`BorrowedFd`), while `as_buf_io` returns a `String` (likely a name or path). This breaks the expectation that `as_*` methods return references or borrows of the underlying type.

Naming inconsistency between `send_headers_frame` and `send_headers_frame_literal`. The distinction (literal vs encoded?) is not obvious from the name alone and lacks a consistent pattern (e.g., `encode` vs `raw`).

What to do

Resolve the 1 Duplicate function signature with different parameter names (fd vs _fd)… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Ambiguous intent between `get` and `get_empty`. It is unclear if `get`… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Inconsistent error handling for similar operations. `ConsumeBuffer`… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d22_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D26 · Project Cohesion8.3 / 10Strong✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic, LLM-independent.

Maturity: Documented → Verified → Prevented · effective 8.3 / 10 · rule-coverage 100% · ceiling Documented

1 of 12 build units (Cargo) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D28 · Secrets (history)4.0 / 10Weak✓ Tool-verified

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

Maturity: Documented → Verified → Prevented · effective 4.0 / 10 · rule-coverage 100% · ceiling Documented

6 finding(s): 0 critical, 6 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.

REDACTED

What to do

Resolve the 6 REDACTED finding(s) in Secrets (history) — start with REDACTED (5), REDACTED. — One of this dimension's main actionable groups (6 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D29 · Static Analysis (SAST)1.8 / 10Critical✓ Tool-verified

What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.

Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.

Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).

Maturity: Documented → Verified → Prevented · effective 1.8 / 10 · rule-coverage 100% · ceiling Documented

46 finding(s): 0 critical, 46 high, 0 medium, 0 low. 36 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. Separately, one or more rules could not re-parse an embedded snippet in 2 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED

What to do

Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED (3). — One of this dimension's main actionable groups (6 issue-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
No action in Static Analysis (SAST) — all 36 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (36 issue-level, 0 of them charged here).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D31 · IaC & Container Security8.4 / 10Adequategated by 4 critical findings✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 8.4 / 10 · rule-coverage 100% · ceiling Documented

7 finding(s): 0 critical, 4 high, 3 medium, 0 low.

REDACTED

What to do

Resolve the 4 High IaC finding(s) in IaC & Container Security — start with REDACTED (4). — One of this dimension's main actionable groups (4 issue-level).
Resolve the 3 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (3). — One of this dimension's main actionable groups (3 warning-level).

Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D34 · Knowledge Freshness9.0 / 10Adequategated by 1 critical finding✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

Maturity: Documented → Verified → Prevented · effective 9.0 / 10 · rule-coverage 100% · ceiling Documented

16 of 163 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is datagram-socket/src/datagram.rs. Counted over 163 of the 180 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledgedatagram-socket/src/datagram.rs

Further orphaned files (smaller)

What to do

Resolve the 1 Orphaned knowledge finding(s) in Knowledge Freshness — start with datagram.rs. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D35 · Change Coupling9.6 / 10Stronggated by 4 serious findings✓ Tool-verified

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

Maturity: Documented → Verified → Prevented · effective 9.6 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: recv_buf.rs↔tests.rs 70%; hystart.rs↔mod.rs 67%; quiche-server.rs↔client.rs 55%

Change coupling: recv_buf.rs ↔ tests.rs · ×4quiche/src/stream/recv_buf.rs

What to do

Resolve the 4 Change coupling finding(s) in Change Coupling — start with recv_buf.rs, hystart.rs, quiche-server.rs. — One of this dimension's main actionable groups (4 warning-level).

Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AC2 · Forms & labels3.5 / 10Weak✓ Tool-verified

Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.

Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. — qlog-dancer/index.html:33

What to do

Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.

Do you agree with this assessment?

AC3 · Page structure2.2 / 10Weak✓ Tool-verified

Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.

Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). — qlog-dancer/index.html:1
A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>. — qlog-dancer/index.html:1
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. — qlog-dancer/index.html:1

What to do

Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.

Do you agree with this assessment?

AC6 · Visual & motion safety10.0 / 10Exemplary○ Nothing flagged

Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.

Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.

Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

Do you agree with this assessment?

AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified

Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.

Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.

Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.

No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 2 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.

What to do

Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.

Do you agree with this assessment?

AX10 · Code composition9.8 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

What to do

The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.

Do you agree with this assessment?

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

Do you agree with this assessment?

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

Do you agree with this assessment?

AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.

Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.

Do you agree with this assessment?

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.

Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.

Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.

Do you agree with this assessment?

ES1 · Fold determinism10.0 / 10Exemplary✓ Tool-verified

Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.

Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.

Do you agree with this assessment?

ES2 · Immutable events10.0 / 10Exemplary✓ Tool-verified

Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.

Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.

Do you agree with this assessment?

M1 · Documentation (README)7.9 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

Add a 'Testing' section to the root README — how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 5 of 13 project(s) that lack one — worth up to 0.8 pts.

Do you agree with this assessment?

M2 · Architecture documentation5.0 / 10Adequate✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).

Do you agree with this assessment?

M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

Do you agree with this assessment?

M4 · Documentation accuracy10.0 / 10Exemplary◐ Sampled · advisory

Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

Do you agree with this assessment?

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

Do you agree with this assessment?

P2 · Observability7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

Do you agree with this assessment?

P3 · Security & performance tooling8.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

What to do

Dependabot is configured but does not watch `github-actions` — add that `package-ecosystem` entry to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.

Do you agree with this assessment?

P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

What to do

Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.

Do you agree with this assessment?

P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.

Do you agree with this assessment?

PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin) or inside a Java method returning a Reactor Mono/Flux — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

Do you agree with this assessment?

S1 · Web-Security Posture8.0 / 10Strong✓ Tool-verified

Other · Security — Only what this repository's own non-C# files could be read for was assessed — markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. Nothing else in this dimension was assessed: the transport, cookie, input-validation and crypto controls are read from a source model that was not loaded for this repository’s language, so their absence here is not a finding about this repository.

Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. Deterministic.

`https://code.jquery.com/jquery-3.7.0.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. 3 such include(s) across the repository's markup. — qlog-dancer/index.html:5

What to do

Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.

Do you agree with this assessment?

WCAG coverage — what static analysis assessed

Statically assessed 10 of 55 WCAG 2.2 Level A/AA success criteria (18%; ≈20% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 45 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).

Dimension	WCAG 2.2 A/AA criteria	Coverage
AC2 · Forms & labels	1.3.1, 3.3.2, 4.1.2	Partial signal
AC3 · Page structure	1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2	Partial signal
AC6 · Visual & motion safety	1.4.3, 2.4.7	Partial — literal CSS only
AC7 · A11y enforcement	enforcement — no page criterion	Enforcement posture (process)

Not statically assessed — these 45 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.1.1, 1.2.1, 1.2.2, 1.2.3, 1.2.4, 1.2.5, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.1, 1.4.2, 1.4.5, 1.4.10, 1.4.11, 1.4.12, 1.4.13, 2.1.1, 2.1.2, 2.1.4, 2.2.2, 2.3.1, 2.4.3, 2.4.4, 2.4.5, 2.4.6, 2.4.11, 2.5.1, 2.5.2, 2.5.3, 2.5.4, 2.5.7, 2.5.8, 3.1.2, 3.2.1, 3.2.2, 3.2.3, 3.2.4, 3.2.6, 3.3.1, 3.3.3, 3.3.4, 3.3.7, 3.3.8, 4.1.3.

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

Lens	Score	Rating	Impact
Code Health	81%	Strong	Solid.
Architecture	93%	Exemplary	Solid.
Maturity	77%	Strong	Solid.
Readiness	47%	Adequate — gated by D13	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security	61%	Adequate — gated by D29	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Event Sourcing	100%	Exemplary	Strongest area.
Accessibility	41%	Weak — gated by AC2, AC3	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance	100%	Exemplary	Solid.

Not evidenced — 4 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control

Not included — 75 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
AX1 Captive dependencies — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX2 Stateful singletons — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — DEPRECATED: The legacy builder is deprecated and will be removed in a future release. Install the buildx component to build images with BuildKit: https://docs.docker.com/go/bui…; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~7800 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
D12 Dependency Hygiene — Not scored — 35 direct Cargo declaration(s) were read, but the outdated signal needs crates.io, and no committed Cargo.lock resolves them to versions, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
D14 License Compliance — Crate licences not graded — this Cargo repository commits no Cargo.lock
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout nor 2+ sibling source directories each declaring an aggregate root. Aggregate roots were found in only one source directory (qlog-dancer), which is a layered codebase, not two contexts. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — symbol resolution incomplete — too few calls resolved to assess navigability
D30 Dependency Vulnerabilities — Scanner failed to run — not a clean result
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D36 Supply-chain Provenance & Signing — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D43 Malicious Dependencies — Scanner failed to run — not a clean result
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D6 Cohesion (LCOM4) — D6 reads a CS/VB/GO/SCALA/SWIFT/DART/JAVA/PY/KT/TS/TSX/MTS/CTS/JS/JSX/MJS/CJS/PHP class graph only — this repository's production source is .c, .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — applicable but not scored (3 signals for this style, 3 needed — the count is met but a required primary signal is absent): 1 aggregate root(s) (types guarding their own state behind command methods — this language has no AggregateRoot base to inherit); 32 value object(s); 6 domain event(s); its domain events are published by services or handlers — no domain entity raises one; no aggregate is declared and no domain structure surrounds the state-guarding types: not claimed as DDD
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — This check finds retry-prone mutations (command handlers and message/event consumers) by walking the repository's declared types, and none was loaded here, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
GD1 Unfinished & placeholder code — no source files were read — this check reads C# syntax, and none was loaded for this repository. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P10 Library API & versioning — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JavaScript/TypeScript, Rust source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
PF2 Allocation hygiene — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X10 Duplicated predicate — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X24 Document value interpolated into markup unescaped — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X27 Collection changed while being enumerated — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X28 Index access outside its own emptiness guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X29 Per-element action decided by a fixed element — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X7 Silent fallback defaults — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 63 finding(s)

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 11 more in this group — see findings.md.

D28 · Secrets (history) · REDACTED · ×6

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D31 · IaC & Container Security · High IaC · ×4

REDACTED
REDACTED
REDACTED
REDACTED

D13 · REDACTED Scanning · Leaked secret · ×3

REDACTED
REDACTED
REDACTED

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED

AC2 · Forms & labels · <input> without a programmatic label · ×1

<input> without a programmatic label qlog-dancer/index.html:33 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.

AC3 · Page structure · <html> without a lang · ×1

<html> without a lang qlog-dancer/index.html:1 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").

AC3 · Page structure · Document without a <title> · ×1

Document without a <title> qlog-dancer/index.html:1 — A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D34 · Knowledge Freshness · Orphaned knowledge · ×1

Orphaned knowledge datagram-socket/src/datagram.rs — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.

Serious — 491 finding(s)

D17 · Explicit Debt · TodoComment · ×140

TodoComment h3i/src/main.rs:361 — // TODO: CLI/qlog don't support passing close trigger frames at the moment — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/frame.rs:552 — // TODO(evanrittenhouse): we could theoretically hand-roll a — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/client/sync_client.rs:517 — // TODO: the wait period could still be larger than the — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/client/mod.rs:164 — // TODO: make serialization smarter — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/client/mod.rs:216 — // TODO: make serialization smarter — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/client/mod.rs:197 — // TODO - consider storying result in ConnectionSummary too. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/client/mod.rs:375 — // TODO: ignoring control streams — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/client/async_client.rs:416 — // TODO: customizable close trigger frames — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/prompts/h3/mod.rs:80 — // TODO(erittenhouse): exploring generating prompts at compile-time — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/prompts/h3/mod.rs:257 — // TODO: make this an enum to automatically pick up new actions — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/prompts/h3/errors.rs:83 — // TODO: do we want to rely on the qlog enum here? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/recordreplay/qlog.rs:394 — // TODO add these — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment h3i/src/recordreplay/qlog.rs:429 — // TODO: remove unwrap when https://github.com/cloudflare/quiche/issues/1731
TodoComment netlog/src/quic.rs:90 — // TODO: this should really be done using serde, not hacked like this. What — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment netlog/src/quic.rs:376 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment netlog/src/quic.rs:412 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment netlog/src/quic.rs:432 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment netlog/src/quic.rs:451 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment netlog/src/h3.rs:158 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment netlog/src/h2.rs:576 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment qlog-dancer/src/datastore.rs:1348 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment qlog/src/events/mod.rs:679 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment quiche/src/lib.rs:1345 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment quiche/src/recovery/gcongestion/recovery.rs:1169 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment quiche/src/recovery/gcongestion/recovery.rs:1174 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
+ 115 more in this group — see findings.md.

D3 · God Classes · MethodTooLong · ×23

MethodTooLong: Connection.send_single quiche/src/lib.rs:4123 — MethodTooLong — send_single runs 745 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 645 over it, 7.45× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Connection.recv_single quiche/src/lib.rs:2972 — MethodTooLong — recv_single runs 450 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 350 over it, 4.50× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Connection.process_frame quiche/src/lib.rs:8343 — MethodTooLong — process_frame runs 278 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 178 over it, 2.78× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: AppConfig.from_clap qlog-dancer/src/config.rs:88 — MethodTooLong — from_clap runs 241 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 141 over it, 2.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Connection.process_frame quiche/src/h3/mod.rs:3016 — MethodTooLong — process_frame runs 209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 109 over it, 2.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Connection.process_readable_stream quiche/src/h3/mod.rs:2594 — MethodTooLong — process_readable_stream runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Datastore.consume_netlog_h2 qlog-dancer/src/datastore.rs:801 — MethodTooLong — consume_netlog_h2 runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Connection.with_tls quiche/src/lib.rs:1992 — MethodTooLong — with_tls runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Frame.to_qlog quiche/src/frame.rs:836 — MethodTooLong — to_qlog runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Datastore.consume_netlog_quic qlog-dancer/src/datastore.rs:409 — MethodTooLong — consume_netlog_quic runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Frame.wire_len quiche/src/frame.rs:601 — MethodTooLong — wire_len runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Frame.to_bytes quiche/src/frame.rs:372 — MethodTooLong — to_bytes runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Http3Conn.build_h3_response apps/src/common.rs:900 — MethodTooLong — build_h3_response runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SparkCaption.draw qlog-dancer/src/plots/stream_sparks.rs:332 — MethodTooLong — draw runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: InboundPacketRouter.poll_recv_and_rx_time tokio-quiche/src/quic/router/mod.rs:432 — MethodTooLong — poll_recv_and_rx_time runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SerializableQFrame.serialize h3i/src/frame.rs:300 — MethodTooLong — serialize runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Http3Conn.handle_requests apps/src/common.rs:1406 — MethodTooLong — handle_requests runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TransportParams.encode quiche/src/transport_params.rs:402 — MethodTooLong — encode runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Frame.to_bytes quiche/src/h3/frame.rs:153 — MethodTooLong — to_bytes runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Frame.fmt quiche/src/frame.rs:1091 — MethodTooLong — fmt runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: QlogMetrics.maybe_update quiche/src/recovery/mod.rs:566 — MethodTooLong — maybe_update runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Frame.from_bytes quiche/src/frame.rs:190 — MethodTooLong — from_bytes runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: EventType.from qlog/src/events/mod.rs:294 — MethodTooLong — from runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.

D3 · God Classes · FileTooLong · ×17

FileTooLong: src/lib.rs quiche/src/lib.rs — FileTooLong — 3957 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 86% of them inside a single declaration: Connection (3 blocks, 1323-9381). The bar is 500 significant lines; this is 3457 over it, 7.91× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: h3/mod.rs quiche/src/h3/mod.rs — FileTooLong — 1733 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 68% of them inside a single declaration: Connection (2 blocks, 997-3356). The bar is 500 significant lines; this is 1233 over it, 3.47× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/ffi.rs quiche/src/ffi.rs — FileTooLong — 1446 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 151 free functions. The bar is 500 significant lines; this is 946 over it, 2.89× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/datastore.rs qlog-dancer/src/datastore.rs — FileTooLong — 1214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 73% of them inside a single declaration: Datastore (2 blocks, 246-1702). The bar is 500 significant lines; this is 714 over it, 2.43× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/common.rs apps/src/common.rs — FileTooLong — 998 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 498 over it, 2.00× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: plots/stream_sparks.rs qlog-dancer/src/plots/stream_sparks.rs — FileTooLong — 915 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 415 over it, 1.83× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/frame.rs quiche/src/frame.rs — FileTooLong — 882 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 88% of them inside a single declaration: Frame (3 blocks, 58-1257). The bar is 500 significant lines; this is 382 over it, 1.76× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: events/quic.rs qlog/src/events/quic.rs — FileTooLong — 810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 310 over it, 1.62× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: driver/mod.rs tokio-quiche/src/http3/driver/mod.rs — FileTooLong — 796 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 74% of them inside a single declaration: H3Driver (5 blocks, 363-1447). The bar is 500 significant lines; this is 296 over it, 1.59× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: gcongestion/recovery.rs quiche/src/recovery/gcongestion/recovery.rs — FileTooLong — 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 62% of them inside a single declaration: GRecovery (4 blocks, 458-1261). The bar is 500 significant lines; this is 228 over it, 1.46× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: io/worker.rs tokio-quiche/src/quic/io/worker.rs — FileTooLong — 699 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 73% of them inside a single declaration: IoWorker (5 blocks, 293-1292). The bar is 500 significant lines; this is 199 over it, 1.40× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: tls/mod.rs quiche/src/tls/mod.rs — FileTooLong — 684 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 184 over it, 1.37× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: congestion/recovery.rs quiche/src/recovery/congestion/recovery.rs — FileTooLong — 595 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 95 over it, 1.19× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/packet.rs quiche/src/packet.rs — FileTooLong — 583 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 83 over it, 1.17× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/web.rs qlog-dancer/src/web.rs — FileTooLong — 566 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 71% of them inside a single declaration: QlogDancerWeb (2 blocks, 244-851). The bar is 500 significant lines; this is 66 over it, 1.13× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/path.rs quiche/src/path.rs — FileTooLong — 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 49 over it, 1.10× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: router/mod.rs tokio-quiche/src/quic/router/mod.rs — FileTooLong — 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 78% of them inside a single declaration: InboundPacketRouter (4 blocks, 145-821). The bar is 500 significant lines; this is 21 over it, 1.04× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.

D3 · God Classes · FunctionTooLong · ×13

FunctionTooLong: qlog_dancer::plots::stream_sparks::plot_sparks qlog-dancer/src/plots/stream_sparks.rs:608 — FunctionTooLong — qlog_dancer::plots::stream_sparks::plot_sparks runs 367 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 267 over it, 3.67× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: quiche_apps::bin::quiche-server::main apps/src/bin/quiche-server.rs:56 — FunctionTooLong — quiche_apps::bin::quiche-server::main runs 341 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 241 over it, 3.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: quiche_apps::client::connect apps/src/client.rs:47 — FunctionTooLong — quiche_apps::client::connect runs 310 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 210 over it, 3.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing qlog-dancer/src/plots/stream_multiplex.rs:69 — FunctionTooLong — qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing runs 260 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 160 over it, 2.60× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: http3_test::runner::run tools/http3_test/src/runner.rs:33 — FunctionTooLong — http3_test::runner::run runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: h3i::client::sync_client::connect_with_early_data h3i/src/client/sync_client.rs:148 — FunctionTooLong — h3i::client::sync_client::connect_with_early_data runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: h3i::config_from_clap h3i/src/main.rs:100 — FunctionTooLong — h3i::config_from_clap runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: qlog_dancer::reports::events::sqlog_event_list qlog-dancer/src/reports/events.rs:226 — FunctionTooLong — qlog_dancer::reports::events::sqlog_event_list runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: qlog_dancer::run qlog-dancer/src/main.rs:63 — FunctionTooLong — qlog_dancer::run runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: h3i::client::execute_action h3i/src/client/mod.rs:151 — FunctionTooLong — h3i::client::execute_action runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: netlog::h2::parse_event netlog/src/h2.rs:419 — FunctionTooLong — netlog::h2::parse_event runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: qlog_dancer::datastore::with_netlog_reader qlog-dancer/src/datastore.rs:1749 — FunctionTooLong — qlog_dancer::datastore::with_netlog_reader runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: qlog_dancer::plots::pending::plot_pending qlog-dancer/src/plots/pending.rs:53 — FunctionTooLong — qlog_dancer::plots::pending::plot_pending runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.

D2 · Cognitive Complexity · Connection · ×12

Connection::send_single (cognitive 332) quiche/src/lib.rs:4123 — Connection::send_single has cognitive complexity 332 (threshold 15). Drivers by points: if/else 114 (250 pts), boolean chains 35, match/switch 9 (24 pts), loops 12 (23 pts) (nesting depth added 162). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold — including the worst — and 580 of the 1975 points over it (29%), 3.2× the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::recv_single (cognitive 129) quiche/src/lib.rs:2972 — Connection::recv_single has cognitive complexity 129 (threshold 15). Drivers by points: if/else 57 (97 pts), boolean chains 14, match/switch 5 (11 pts), loops 5 (7 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold — including the worst — and 580 of the 1975 points over it (29%), 3.2× the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::process_frame (cognitive 97) quiche/src/lib.rs:8343 — Connection::process_frame has cognitive complexity 97 (threshold 15). Drivers by points: if/else 34 (76 pts), boolean chains 9, loops 3 (6 pts), match/switch 5 (6 pts) (nesting depth added 46). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass's cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold — including the worst — and 580 of the 1975 points over it (29%), 3.2× the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::process_readable_stream (cognitive 72) quiche/src/h3/mod.rs:2594 — Connection::process_readable_stream has cognitive complexity 72 (threshold 15). Drivers by points: if/else 13 (44 pts), match/switch 10 (24 pts), loops 2 (4 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Connection::process_frame (cognitive 48) quiche/src/h3/mod.rs:3016 — Connection::process_frame has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (40 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 24). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Connection::stream_do_send (cognitive 37) quiche/src/lib.rs:6007 — Connection::stream_do_send has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 10, match/switch 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass's cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold — including the worst — and 580 of the 1975 points over it (29%), 3.2× the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::send_on_path (cognitive 32) quiche/src/lib.rs:3978 — Connection::send_on_path has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 5, match/switch 3 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold — including the worst — and 580 of the 1975 points over it (29%), 3.2× the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::write_pkt_type (cognitive 29) quiche/src/lib.rs:8220 — Connection::write_pkt_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold — including the worst — and 580 of the 1975 points over it (29%), 3.2× the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::do_handshake (cognitive 23) quiche/src/lib.rs:8081 — Connection::do_handshake has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold — including the worst — and 580 of the 1975 points over it (29%), 3.2× the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::on_timeout (cognitive 21) quiche/src/lib.rs:7121 — Connection::on_timeout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold — including the worst — and 580 of the 1975 points over it (29%), 3.2× the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::do_send_body (cognitive 20) quiche/src/h3/mod.rs:1672 — Connection::do_send_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Connection::poll (cognitive 17) quiche/src/h3/mod.rs:2110 — Connection::poll has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (6 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.

D1 · Cyclomatic Complexity · Connection · ×11

Connection::send_single (cyclomatic 180) quiche/src/lib.rs:4123 — Connection::send_single has cyclomatic complexity 180 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold — including the worst — and 331 of the 838 points over it (39%), 5.8× the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::recv_single (cyclomatic 83) quiche/src/lib.rs:2972 — Connection::recv_single has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold — including the worst — and 331 of the 838 points over it (39%), 5.8× the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::process_frame (cyclomatic 80) quiche/src/lib.rs:8343 — Connection::process_frame has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold — including the worst — and 331 of the 838 points over it (39%), 5.8× the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::process_readable_stream (cyclomatic 42) quiche/src/h3/mod.rs:2594 — Connection::process_readable_stream has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Connection::process_frame (cyclomatic 32) quiche/src/h3/mod.rs:3016 — Connection::process_frame has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Connection::stream_do_send (cyclomatic 30) quiche/src/lib.rs:6007 — Connection::stream_do_send has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold — including the worst — and 331 of the 838 points over it (39%), 5.8× the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::send_on_path (cyclomatic 25) quiche/src/lib.rs:3978 — Connection::send_on_path has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold — including the worst — and 331 of the 838 points over it (39%), 5.8× the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::write_pkt_type (cyclomatic 21) quiche/src/lib.rs:8220 — Connection::write_pkt_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold — including the worst — and 331 of the 838 points over it (39%), 5.8× the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Connection::poll (cyclomatic 19) quiche/src/h3/mod.rs:2110 — Connection::poll has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: Error::to_c (cyclomatic 20) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
Connection::do_send_body (cyclomatic 17) quiche/src/h3/mod.rs:1672 — Connection::do_send_body has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: Error::to_c (cyclomatic 20) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
Connection::do_handshake (cyclomatic 17) quiche/src/lib.rs:8081 — Connection::do_handshake has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold — including the worst — and 331 of the 838 points over it (39%), 5.8× the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.

D3 · God Classes · ClassTooLong · ×11

ClassTooLong: Connection quiche/src/lib.rs:1323 — ClassTooLong — 3422 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 141 methods, 3 blocks, lines 1323-9381. The bar is 400 significant lines; this is 3022 over it, 8.56× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Connection quiche/src/h3/mod.rs:997 — ClassTooLong — 1181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 35 methods, 2 blocks, lines 997-3356. The bar is 400 significant lines; this is 781 over it, 2.95× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Datastore qlog-dancer/src/datastore.rs:246 — ClassTooLong — 892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 20 methods, 2 blocks, lines 246-1702. The bar is 400 significant lines; this is 492 over it, 2.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Frame quiche/src/frame.rs:58 — ClassTooLong — 772 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 6 methods, 3 blocks, lines 58-1257. The bar is 400 significant lines; this is 372 over it, 1.93× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: H3Driver tokio-quiche/src/http3/driver/mod.rs:363 — ClassTooLong — 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 23 methods, 5 blocks, lines 363-1447. The bar is 400 significant lines; this is 190 over it, 1.48× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Http3Conn apps/src/common.rs:758 — ClassTooLong — 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 3 methods, 3 blocks, lines 758-1671. The bar is 400 significant lines; this is 156 over it, 1.39× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: IoWorker tokio-quiche/src/quic/io/worker.rs:293 — ClassTooLong — 513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 18 methods, 5 blocks, lines 293-1292. The bar is 400 significant lines; this is 113 over it, 1.28× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: GRecovery quiche/src/recovery/gcongestion/recovery.rs:458 — ClassTooLong — 448 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 7 methods, 4 blocks, lines 458-1261. The bar is 400 significant lines; this is 48 over it, 1.12× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: SeriesStore qlog-dancer/src/seriesstore.rs:38 — ClassTooLong — 425 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 43 methods, 2 blocks, lines 38-773. The bar is 400 significant lines; this is 25 over it, 1.06× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: InboundPacketRouter tokio-quiche/src/quic/router/mod.rs:145 — ClassTooLong — 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 7 methods, 4 blocks, lines 145-821. The bar is 400 significant lines; this is 4 over it, 1.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: QlogDancerWeb qlog-dancer/src/web.rs:244 — ClassTooLong — 403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 21 methods, 2 blocks, lines 244-851. The bar is 400 significant lines; this is 3 over it, 1.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.

D2 · Cognitive Complexity · qlog_dancer · ×10

qlog_dancer::datastore::with_netlog_reader (cognitive 96) qlog-dancer/src/datastore.rs:1749 — qlog_dancer::datastore::with_netlog_reader has cognitive complexity 96 (threshold 15). Drivers by points: if/else 13 (66 pts), match/switch 4 (15 pts), loops 4 (13 pts), boolean chains 2 (nesting depth added 73). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
qlog_dancer::plots::stream_sparks::plot_sparks (cognitive 50) qlog-dancer/src/plots/stream_sparks.rs:608 — qlog_dancer::plots::stream_sparks::plot_sparks has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (41 pts), match/switch 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing (cognitive 37) qlog-dancer/src/plots/stream_multiplex.rs:69 — qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 8, loops 4 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
qlog_dancer::run (cognitive 33) qlog-dancer/src/main.rs:63 — qlog_dancer::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
qlog_dancer::reports::text::print_packet_loss (cognitive 33) qlog-dancer/src/reports/text.rs:387 — qlog_dancer::reports::text::print_packet_loss has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
qlog_dancer::plots::pending::plot_pending (cognitive 24) qlog-dancer/src/plots/pending.rs:53 — qlog_dancer::plots::pending::plot_pending has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
qlog_dancer::reports::html::table_cell_value (cognitive 21) qlog-dancer/src/reports/html.rs:453 — qlog_dancer::reports::html::table_cell_value has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (21 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
qlog_dancer::reports::events::frames_to_string (cognitive 19) qlog-dancer/src/reports/events.rs:81 — qlog_dancer::reports::events::frames_to_string has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
qlog_dancer::wirefilter::stream_ids (cognitive 18) qlog-dancer/src/wirefilter.rs:38 — qlog_dancer::wirefilter::stream_ids has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 2 (6 pts), loops 1 (4 pts) (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
qlog_dancer::reports::events::sqlog_event_list (cognitive 18) qlog-dancer/src/reports/events.rs:226 — qlog_dancer::reports::events::sqlog_event_list has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D3 · God Classes · TooManyMethods · ×10

TooManyMethods: Connection quiche/src/lib.rs:1323 — TooManyMethods — 141 methods. The bar is 30 methods; this is 111 over it, 4.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: StreamMap quiche/src/stream/mod.rs:143 — TooManyMethods — 54 methods. The bar is 30 methods; this is 24 over it, 1.80× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Config quiche/src/lib.rs:562 — TooManyMethods — 51 methods. The bar is 30 methods; this is 21 over it, 1.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BBRv2NetworkModel quiche/src/recovery/gcongestion/bbr2/network_model.rs:134 — TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: SeriesStore qlog-dancer/src/seriesstore.rs:38 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Handshake quiche/src/tls/mod.rs:368 — TooManyMethods — 38 methods, declared across 2 files: tls/mod.rs (29), tls/boringssl.rs (9). The bar is 30 methods; this is 8 over it, 1.27× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: OctetsMut octets/src/lib.rs:437 — TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Connection quiche/src/h3/mod.rs:997 — TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Stream quiche/src/h3/stream.rs:128 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ConnectionIdentifiers quiche/src/cid.rs:222 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.

D15 · Churn × Complexity Hotspots · Hotspot · ×9

Hotspot: quiche/src/lib.rs quiche/src/lib.rs:4123 — quiche/src/lib.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 180 in Connection::send_single at line 4123. 2 of those changes were fix/bug commits, and the other 9 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-23 12:54:21 +00:00' --until='2026-09-21 12:54:21 +00:00' --full-history --no-merges -- quiche/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: quiche/src/h3/mod.rs quiche/src/h3/mod.rs:2594 — quiche/src/h3/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Connection::process_readable_stream at line 2594. 2 of those changes were fix/bug commits, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-23 12:54:21 +00:00' --until='2026-09-21 12:54:21 +00:00' --full-history --no-merges -- quiche/src/h3/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: apps/src/client.rs apps/src/client.rs:47 — apps/src/client.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in quiche_apps::client::connect at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-23 12:54:21 +00:00' --until='2026-09-21 12:54:21 +00:00' --full-history --no-merges -- apps/src/client.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: tokio-quiche/src/http3/driver/mod.rs tokio-quiche/src/http3/driver/mod.rs:504 — tokio-quiche/src/http3/driver/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in H3Driver::process_h3_data at line 504. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-23 12:54:21 +00:00' --until='2026-09-21 12:54:21 +00:00' --full-history --no-merges -- tokio-quiche/src/http3/driver/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: quiche/src/h3/stream.rs quiche/src/h3/stream.rs:446 — quiche/src/h3/stream.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Stream::set_frame_payload_len at line 446. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-23 12:54:21 +00:00' --until='2026-09-21 12:54:21 +00:00' --full-history --no-merges -- quiche/src/h3/stream.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: tokio-quiche/src/quic/io/worker.rs tokio-quiche/src/quic/io/worker.rs:578 — tokio-quiche/src/quic/io/worker.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in IoWorker::gather_data_from_quiche_conn at line 578. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-23 12:54:21 +00:00' --until='2026-09-21 12:54:21 +00:00' --full-history --no-merges -- tokio-quiche/src/quic/io/worker.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: quiche/src/stream/mod.rs quiche/src/stream/mod.rs:271 — quiche/src/stream/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in StreamMap::get_or_create at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-23 12:54:21 +00:00' --until='2026-09-21 12:54:21 +00:00' --full-history --no-merges -- quiche/src/stream/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: quiche/src/recovery/gcongestion/bbr2.rs quiche/src/recovery/gcongestion/bbr2.rs:222 — quiche/src/recovery/gcongestion/bbr2.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Params::with_overrides at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-23 12:54:21 +00:00' --until='2026-09-21 12:54:21 +00:00' --full-history --no-merges -- quiche/src/recovery/gcongestion/bbr2.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: quiche/src/recovery/gcongestion/bbr2/network_model.rs quiche/src/recovery/gcongestion/bbr2/network_model.rs:318 — quiche/src/recovery/gcongestion/bbr2/network_model.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BBRv2NetworkModel::on_congestion_event_start at line 318. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-23 12:54:21 +00:00' --until='2026-09-21 12:54:21 +00:00' --full-history --no-merges -- quiche/src/recovery/gcongestion/bbr2/network_model.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.

D17 · Explicit Debt · FixmeComment · ×8

FixmeComment quiche/src/path.rs:361 — // FIXME: we should check that there is nothing in the sent queue. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment quiche/src/recovery/congestion/recovery.rs:1015 — // FIXME only used by gcongestion — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment quiche/src/recovery/gcongestion/recovery.rs:1098 — // FIXME only used by gcongestion — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment quiche/src/recovery/congestion/recovery.rs:1035 — // FIXME only used by congestion — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment quiche/src/recovery/congestion/recovery.rs:1040 — // FIXME only used by congestion — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment quiche/src/recovery/gcongestion/recovery.rs:1167 — // FIXME only used by congestion — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment quiche/src/recovery/gcongestion/recovery.rs:1172 — // FIXME only used by congestion — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment tokio-quiche/src/http3/driver/tests.rs:268 — // FIXME: This should not produce `Disconnected`. The test channel has — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.

D3 · God Classes · TooManyFields · ×8

TooManyFields: Connection quiche/src/lib.rs:1323 — TooManyFields — 87 stored fields beside 141 methods. The bar is 30 stored fields; this is 57 over it, 2.90× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: Datastore qlog-dancer/src/datastore.rs:246 — TooManyFields — 74 stored fields beside 20 methods. The bar is 30 stored fields; this is 44 over it, 2.47× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: SeriesStore qlog-dancer/src/seriesstore.rs:38 — TooManyFields — 60 stored fields beside 43 methods. The bar is 30 stored fields; this is 30 over it, 2.00× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: QuicSettings tokio-quiche/src/settings/quic.rs:38 — TooManyFields — 47 stored fields beside 25 methods. The bar is 30 stored fields; this is 17 over it, 1.57× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: Params quiche/src/recovery/gcongestion/bbr2.rs:62 — TooManyFields — 45 stored fields beside 1 method. The bar is 30 stored fields; this is 15 over it, 1.50× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: Constants netlog/src/constants.rs:44 — TooManyFields — 35 stored fields beside 1 method. The bar is 30 stored fields; this is 5 over it, 1.17× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: HttpRequestStub qlog-dancer/src/request_stub.rs:75 — TooManyFields — 34 stored fields beside 10 methods. The bar is 30 stored fields; this is 4 over it, 1.13× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: Path quiche/src/path.rs:153 — TooManyFields — 31 stored fields beside 27 methods. The bar is 30 stored fields; this is 1 over it, 1.03× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.

D4 · Code Duplication · Duplicated block (9 lines × 2) · ×7

Duplicated block (9 lines × 2) apps/src/client.rs:77 — apps/src/client.rs:77-85 | tools/http3_test/src/runner.rs:73-81 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) apps/src/common.rs:242 — apps/src/common.rs:242-250 | tools/http3_test/src/runner.rs:431-439 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) qlog-dancer/src/plots/stream_sparks.rs:911 — qlog-dancer/src/plots/stream_sparks.rs:911-919 | qlog-dancer/src/plots/stream_sparks.rs:921-929 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) quiche/src/ffi.rs:501 — quiche/src/ffi.rs:501-509 | quiche/src/ffi.rs:511-519 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) quiche/src/lib.rs:5887 — quiche/src/lib.rs:5887-5895 | quiche/src/lib.rs:6170-6178 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) quiche/src/recovery/congestion/recovery.rs:1073 — quiche/src/recovery/congestion/recovery.rs:1073-1081 | quiche/src/recovery/gcongestion/recovery.rs:1225-1233 — `quiche/src/recovery/congestion/recovery.rs` and `quiche/src/recovery/gcongestion/recovery.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (9 lines × 2) quiche/src/h3/frame.rs:370 — quiche/src/h3/frame.rs:370-378 | quiche/src/h3/frame.rs:386-394 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D1 · Cyclomatic Complexity · qlog_dancer · ×6

qlog_dancer::reports::events::frames_to_string (cyclomatic 28) qlog-dancer/src/reports/events.rs:81 — qlog_dancer::reports::events::frames_to_string has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
qlog_dancer::datastore::with_netlog_reader (cyclomatic 28) qlog-dancer/src/datastore.rs:1749 — qlog_dancer::datastore::with_netlog_reader has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing (cyclomatic 27) qlog-dancer/src/plots/stream_multiplex.rs:69 — qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
qlog_dancer::plots::stream_sparks::plot_sparks (cyclomatic 27) qlog-dancer/src/plots/stream_sparks.rs:608 — qlog_dancer::plots::stream_sparks::plot_sparks has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
qlog_dancer::run (cyclomatic 17) qlog-dancer/src/main.rs:63 — qlog_dancer::run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
qlog_dancer::reports::events::sqlog_event_list (cyclomatic 16) qlog-dancer/src/reports/events.rs:226 — qlog_dancer::reports::events::sqlog_event_list has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D4 · Code Duplication · Duplicated block (14 lines × 2) · ×6

Duplicated block (14 lines × 2) apps/src/bin/quiche-server.rs:116 — apps/src/bin/quiche-server.rs:116-129 | apps/src/client.rs:118-131 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) apps/src/common.rs:701 — apps/src/common.rs:701-714 | apps/src/common.rs:1657-1670 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) qlog-dancer/src/plots/stream_multiplex.rs:305 — qlog-dancer/src/plots/stream_multiplex.rs:305-318 | qlog-dancer/src/plots/stream_multiplex.rs:322-335 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) quiche/src/lib.rs:9305 — quiche/src/lib.rs:9305-9318 | quiche/src/lib.rs:9330-9343 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) tools/http3_test/src/runner.rs:219 — tools/http3_test/src/runner.rs:219-232 | tools/http3_test/src/runner.rs:411-424 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) qlog-dancer/src/plots/packet_sent.rs:181 — qlog-dancer/src/plots/packet_sent.rs:181-194 | qlog-dancer/src/plots/packet_sent.rs:317-333 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (12 lines × 2) · ×6

Duplicated block (12 lines × 2) qlog-dancer/src/plots/pending.rs:166 — qlog-dancer/src/plots/pending.rs:166-177 | qlog-dancer/src/plots/pending.rs:189-201 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) qlog-dancer/src/reports/html.rs:146 — qlog-dancer/src/reports/html.rs:146-157 | qlog-dancer/src/reports/html.rs:205-216 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) quiche/src/ffi.rs:548 — quiche/src/ffi.rs:548-559 | quiche/src/ffi.rs:652-663 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) quiche/src/lib.rs:3073 — quiche/src/lib.rs:3073-3084 | quiche/src/lib.rs:3137-3148 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) quiche/src/h3/frame.rs:372 — quiche/src/h3/frame.rs:372-383 | quiche/src/h3/frame.rs:397-409 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) qlog-dancer/src/plots/conn_flow_control.rs:248 — qlog-dancer/src/plots/conn_flow_control.rs:248-259 | qlog-dancer/src/plots/conn_overview.rs:301-312 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.

D2 · Cognitive Complexity · Http3Conn · ×5

Http3Conn::build_h3_response (cognitive 39) apps/src/common.rs:900 — Http3Conn::build_h3_response has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 8 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Http3Conn::handle_responses (cognitive 30) apps/src/common.rs:1235 — Http3Conn::handle_responses has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 4 (11 pts), loops 3 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Http3Conn::handle_requests (cognitive 25) apps/src/common.rs:1406 — Http3Conn::handle_requests has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (6 pts), loops 4 (5 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Http3Conn::with_urls (cognitive 20) apps/src/common.rs:773 — Http3Conn::with_urls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Http3Conn::send_requests (cognitive 20) apps/src/common.rs:1134 — Http3Conn::send_requests has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 4 (7 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D4 · Code Duplication · Duplicated block (19 lines × 2) · ×5

Duplicated block (19 lines × 2) qlog-dancer/src/plots/packet_received.rs:48 — qlog-dancer/src/plots/packet_received.rs:48-66 | qlog-dancer/src/plots/packet_sent.rs:377-395 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (19 lines × 2) qlog-dancer/src/plots/stream_multiplex.rs:177 — qlog-dancer/src/plots/stream_multiplex.rs:177-195 | qlog-dancer/src/plots/stream_multiplex.rs:225-243 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) qlog-dancer/src/reports/text.rs:433 — qlog-dancer/src/reports/text.rs:433-451 | qlog-dancer/src/reports/text.rs:460-478 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) quiche/src/recovery/congestion/recovery.rs:136 — quiche/src/recovery/congestion/recovery.rs:136-154 | quiche/src/recovery/gcongestion/recovery.rs:186-204 — `quiche/src/recovery/congestion/recovery.rs` and `quiche/src/recovery/gcongestion/recovery.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (19 lines × 2) quiche/src/recovery/congestion/recovery.rs:511 — quiche/src/recovery/congestion/recovery.rs:511-529 | quiche/src/recovery/gcongestion/recovery.rs:667-685 — `quiche/src/recovery/congestion/recovery.rs` and `quiche/src/recovery/gcongestion/recovery.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.

D4 · Code Duplication · Duplicated block (17 lines × 2) · ×5

Duplicated block (17 lines × 2) h3i/src/prompts/h3/mod.rs:420 — h3i/src/prompts/h3/mod.rs:420-436 | h3i/src/prompts/h3/mod.rs:443-459 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) qlog-dancer/src/plots/stream_multiplex.rs:339 — qlog-dancer/src/plots/stream_multiplex.rs:339-355 | qlog-dancer/src/plots/stream_multiplex.rs:357-373 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) qlog-dancer/src/plots/stream_sparks.rs:184 — qlog-dancer/src/plots/stream_sparks.rs:184-200 | qlog-dancer/src/plots/stream_sparks.rs:272-288 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) qlog-dancer/src/plots/stream_sparks.rs:407 — qlog-dancer/src/plots/stream_sparks.rs:407-423 | qlog-dancer/src/plots/stream_sparks.rs:493-509 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) quiche/src/h3/mod.rs:3248 — quiche/src/h3/mod.rs:3248-3264 | quiche/src/h3/mod.rs:3317-3333 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (8 lines × 2) · ×5

Duplicated block (8 lines × 2) h3i/src/frame.rs:308 — h3i/src/frame.rs:308-315 | h3i/src/frame.rs:438-445 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) qlog-dancer/src/plots/packet_sent.rs:169 — qlog-dancer/src/plots/packet_sent.rs:169-177 | qlog-dancer/src/plots/packet_sent.rs:306-313 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) quiche/src/ffi.rs:791 — quiche/src/ffi.rs:791-798 | quiche/src/ffi.rs:812-819 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) quiche/src/recovery/gcongestion/bbr2/mode.rs:226 — quiche/src/recovery/gcongestion/bbr2/mode.rs:226-233 | quiche/src/recovery/gcongestion/bbr2/mode.rs:236-243 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) tokio-quiche/src/quic/io/utilization_estimator.rs:288 — quiche/src/recovery/gcongestion/bbr/windowed_filter.rs:59-66 | tokio-quiche/src/quic/io/utilization_estimator.rs:288-295 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D1 · Cyclomatic Complexity · Frame · ×4

Frame::from_bytes (cyclomatic 42) quiche/src/frame.rs:190 — Frame::from_bytes has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Frame::to_bytes (cyclomatic 31) quiche/src/frame.rs:372 — Frame::to_bytes has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Frame::to_bytes (cyclomatic 26) quiche/src/h3/frame.rs:153 — Frame::to_bytes has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Frame::to_qlog (cyclomatic 18) quiche/src/h3/frame.rs:338 — Frame::to_qlog has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D2 · Cognitive Complexity · Datastore · ×4

Datastore::consume_netlog_quic (cognitive 46) qlog-dancer/src/datastore.rs:409 — Datastore::consume_netlog_quic has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 3 (10 pts), match/switch 1 (nesting depth added 26). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Datastore::consume_qlog_packet_received (cognitive 33) qlog-dancer/src/datastore.rs:1224 — Datastore::consume_qlog_packet_received has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (9 pts), match/switch 1 (3 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
Datastore::consume_netlog_h2 (cognitive 29) qlog-dancer/src/datastore.rs:801 — Datastore::consume_netlog_h2 has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 2 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Datastore::consume_netlog_h3 (cognitive 18) qlog-dancer/src/datastore.rs:686 — Datastore::consume_netlog_h3 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D35 · Change Coupling · Change coupling · ×4

Change coupling: recv_buf.rs ↔ tests.rs quiche/src/stream/recv_buf.rs — `quiche/src/stream/recv_buf.rs` and `quiche/src/tests.rs` change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `a64d9721` fix connection flow-control double-counting from zero-length STREAM f…; `e97798e1` tokio-quiche: make body_recv_buf max size configurable, default 16 KiB; `3ca46b77` tokio-quiche: size body_recv_buf to contiguous readable length (#2547) — run `git show` on any of them.
Change coupling: hystart.rs ↔ mod.rs quiche/src/recovery/congestion/hystart.rs — `quiche/src/recovery/congestion/hystart.rs` and `quiche/src/recovery/mod.rs` change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `754e328e` recovery: merge epoch data into a struct (at that commit the file was still `quiche/src/recovery/hystart.rs`); `a22bb4b3` packet: refactor Epoch to be an enum instead of usize consts (at that commit the file was still `quiche/src/recovery/hystart.rs`); `56edda76` recovery: remove ABC_L constant and its logic (at that commit the files were still `src/recovery/hystart.rs` and `src/recovery/mod.rs`) — run `git show` on any of them.
Change coupling: quiche-server.rs ↔ client.rs apps/src/bin/quiche-server.rs — `apps/src/bin/quiche-server.rs` and `apps/src/client.rs` change together 55% of the time (18 of the 33 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are `5f00e83a` path: add PMTU path event; `b6fd412d` Expose initial RTT config in `quiche-client` and `quiche-server` CLI; `d707c50e` apps: more workspace dependencies — run `git show` on any of them.
Change coupling: worker.rs ↔ acceptor.rs tokio-quiche/src/quic/io/worker.rs — `tokio-quiche/src/quic/io/worker.rs` and `tokio-quiche/src/quic/router/acceptor.rs` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `736d0deb` tokio-quiche: box quiche::Connection to shrink async state; `444fb3ed` tokio-quiche: Refresh connection IDs in IoWorker::work_loop; `31766ebb` Add TimeHistogram for time spent in the sendmsg loop (#2223) — run `git show` on any of them.

D4 · Code Duplication · Duplicated block (20 lines × 2) · ×4

Duplicated block (20 lines × 2) buffer-pool/src/raw_pool_buf_io.rs:57 — buffer-pool/src/raw_pool_buf_io.rs:57-76 | datagram-socket/src/datagram.rs:79-98 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (20 lines × 2) quiche/src/h3/stream.rs:614 — quiche/src/h3/stream.rs:614-633 | quiche/src/h3/stream.rs:667-686 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20 lines × 2) quiche/src/lib.rs:8494 — quiche/src/lib.rs:8494-8513 | quiche/src/lib.rs:8673-8692 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20 lines × 2) quiche/src/recovery/congestion/recovery.rs:771 — quiche/src/recovery/congestion/recovery.rs:771-790 | quiche/src/recovery/gcongestion/recovery.rs:924-943 — `quiche/src/recovery/congestion/recovery.rs` and `quiche/src/recovery/gcongestion/recovery.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.

D4 · Code Duplication · Duplicated block (15 lines × 2) · ×4

Duplicated block (15 lines × 2) qlog-dancer/src/datastore.rs:893 — qlog-dancer/src/datastore.rs:893-907 | qlog-dancer/src/datastore.rs:977-991 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) qlog-dancer/src/plots/conn_overview.rs:355 — qlog-dancer/src/plots/conn_overview.rs:355-369 | qlog-dancer/src/plots/conn_overview.rs:405-419 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) qlog-dancer/src/trackers/stream_buffer_tracker.rs:65 — qlog-dancer/src/trackers/stream_buffer_tracker.rs:65-79 | qlog-dancer/src/trackers/stream_max_tracker.rs:62-76 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (15 lines × 2) quiche/src/tls/mod.rs:782 — quiche/src/tls/mod.rs:782-796 | quiche/src/tls/mod.rs:831-845 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (13 lines × 2) · ×4

Duplicated block (13 lines × 2) apps/src/client.rs:503 — apps/src/client.rs:503-515 | h3i/src/client/sync_client.rs:431-443 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) datagram-socket/src/mmsg.rs:58 — datagram-socket/src/mmsg.rs:58-70 | datagram-socket/src/mmsg.rs:118-130 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) qlog-dancer/src/seriesstore.rs:533 — qlog-dancer/src/seriesstore.rs:533-545 | qlog-dancer/src/seriesstore.rs:565-577 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) qlog-dancer/src/plots/packet_sent.rs:241 — qlog-dancer/src/plots/packet_sent.rs:241-253 | qlog-dancer/src/plots/packet_sent.rs:307-320 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (11 lines × 2) · ×4

Duplicated block (11 lines × 2) apps/src/common.rs:1374 — apps/src/common.rs:1374-1384 | apps/src/common.rs:1576-1586 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) qlog-dancer/src/datastore.rs:1533 — qlog-dancer/src/datastore.rs:1533-1543 | qlog-dancer/src/datastore.rs:1573-1583 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) quiche/src/lib.rs:3671 — quiche/src/lib.rs:3671-3681 | quiche/src/lib.rs:3727-3737 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) tokio-quiche/src/quic/io/worker.rs:323 — tokio-quiche/src/quic/io/worker.rs:323-333 | tokio-quiche/src/quic/io/worker.rs:1146-1156 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D5 · Coupling · Off the main sequence · ×4

Off the main sequence: netlog — netlog: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: task-killswitch — task-killswitch: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: qlog — qlog: abstractness 0.01, instability 0.00, distance 0.99 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: octets — octets: abstractness 0.25, instability 0.00, distance 0.75 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.

D1 · Cyclomatic Complexity · Http3Conn · ×3

Http3Conn::build_h3_response (cyclomatic 31) apps/src/common.rs:900 — Http3Conn::build_h3_response has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Http3Conn::handle_requests (cyclomatic 21) apps/src/common.rs:1406 — Http3Conn::handle_requests has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Http3Conn::handle_responses (cyclomatic 18) apps/src/common.rs:1235 — Http3Conn::handle_responses has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D2 · Cognitive Complexity · quiche_apps · ×3

quiche_apps::bin::quiche-server::main (cognitive 199) apps/src/bin/quiche-server.rs:56 — quiche_apps::bin::quiche-server::main has cognitive complexity 199 (threshold 15). Drivers by points: if/else 46 (145 pts), match/switch 8 (26 pts), loops 9 (23 pts), boolean chains 5 (nesting depth added 131). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
quiche_apps::client::connect (cognitive 156) apps/src/client.rs:47 — quiche_apps::client::connect has cognitive complexity 156 (threshold 15). Drivers by points: if/else 47 (109 pts), loops 10 (22 pts), match/switch 6 (20 pts), boolean chains 5 (nesting depth added 88). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
quiche_apps::common::dump_json (cognitive 16) apps/src/common.rs:164 — quiche_apps::common::dump_json has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · h3i · ×3

h3i::client::sync_client::connect_with_early_data (cognitive 103) h3i/src/client/sync_client.rs:148 — h3i::client::sync_client::connect_with_early_data has cognitive complexity 103 (threshold 15). Drivers by points: if/else 27 (61 pts), loops 9 (21 pts), match/switch 5 (18 pts), boolean chains 3 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
h3i::client::execute_action (cognitive 33) h3i/src/client/mod.rs:151 — h3i::client::execute_action has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (9 pts), loops 2 (6 pts) (nesting depth added 22). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
h3i::client::parse_streams (cognitive 24) h3i/src/client/mod.rs:368 — h3i::client::parse_streams has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 2 (7 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · H3Driver · ×3

H3Driver::process_h3_data (cognitive 30) tokio-quiche/src/http3/driver/mod.rs:504 — H3Driver::process_h3_data has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
H3Driver::process_write_frame (cognitive 25) tokio-quiche/src/http3/driver/mod.rs:796 — H3Driver::process_write_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
H3Driver::process_writable_stream (cognitive 20) tokio-quiche/src/http3/driver/mod.rs:1196 — H3Driver::process_writable_stream has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · RecoveryEpoch · ×3

RecoveryEpoch::detect_and_remove_lost_packets (cognitive 28) quiche/src/recovery/gcongestion/recovery.rs:269 — RecoveryEpoch::detect_and_remove_lost_packets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
RecoveryEpoch::detect_and_remove_acked_packets (cognitive 24) quiche/src/recovery/congestion/recovery.rs:120 — RecoveryEpoch::detect_and_remove_acked_packets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RecoveryEpoch::detect_and_remove_acked_packets (cognitive 21) quiche/src/recovery/gcongestion/recovery.rs:174 — RecoveryEpoch::detect_and_remove_acked_packets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D31 · IaC & Container Security · Medium IaC · ×3

REDACTED
REDACTED
REDACTED

D4 · Code Duplication · Duplicated block (10 lines × 2) · ×3

Duplicated block (10 lines × 2) qlog-dancer/src/reports/events.rs:372 — qlog-dancer/src/reports/events.rs:372-381 | qlog-dancer/src/reports/events.rs:383-392 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) qlog-dancer/src/seriesstore.rs:429 — qlog-dancer/src/seriesstore.rs:429-438 | qlog-dancer/src/seriesstore.rs:460-469 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) qlog-dancer/src/plots/conn_overview.rs:52 — qlog-dancer/src/plots/conn_overview.rs:52-61 | qlog-dancer/src/plots/packet_sent.rs:46-55 — before extracting anything, compare `qlog-dancer/src/plots/conn_overview.rs` and `qlog-dancer/src/plots/packet_sent.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.

D4 · Code Duplication · Duplicated block (7 lines × 2) · ×3

Duplicated block (7 lines × 2) h3i/src/client/connection_summary.rs:486 — h3i/src/client/connection_summary.rs:486-492 | h3i/src/client/connection_summary.rs:512-518 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) quiche/src/crypto/mod.rs:368 — quiche/src/crypto/mod.rs:368-374 | quiche/src/crypto/mod.rs:377-383 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) qlog-dancer/src/plots/conn_overview.rs:446 — qlog-dancer/src/plots/conn_overview.rs:446-452 | qlog-dancer/src/plots/packet_received.rs:38-44 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.

D1 · Cyclomatic Complexity · quiche_apps · ×2

quiche_apps::client::connect (cyclomatic 72) apps/src/client.rs:47 — quiche_apps::client::connect has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
quiche_apps::bin::quiche-server::main (cyclomatic 65) apps/src/bin/quiche-server.rs:56 — quiche_apps::bin::quiche-server::main has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · h3i · ×2

h3i::client::sync_client::connect_with_early_data (cyclomatic 46) h3i/src/client/sync_client.rs:148 — h3i::client::sync_client::connect_with_early_data has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
h3i::client::execute_action (cyclomatic 19) h3i/src/client/mod.rs:151 — h3i::client::execute_action has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Datastore · ×2

Datastore::consume_netlog_h2 (cyclomatic 33) qlog-dancer/src/datastore.rs:801 — Datastore::consume_netlog_h2 has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Datastore::consume_netlog_quic (cyclomatic 30) qlog-dancer/src/datastore.rs:409 — Datastore::consume_netlog_quic has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · TransportParams · ×2

TransportParams::decode (cyclomatic 33) quiche/src/transport_params.rs:223 — TransportParams::decode has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TransportParams::encode (cyclomatic 21) quiche/src/transport_params.rs:402 — TransportParams::encode has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · H3Driver · ×2

H3Driver::process_h3_data (cyclomatic 21) tokio-quiche/src/http3/driver/mod.rs:504 — H3Driver::process_h3_data has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
H3Driver::process_write_frame (cyclomatic 17) tokio-quiche/src/http3/driver/mod.rs:796 — H3Driver::process_write_frame has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · BBRv2NetworkModel · ×2

BBRv2NetworkModel::on_congestion_event_start (cyclomatic 17) quiche/src/recovery/gcongestion/bbr2/network_model.rs:318 — BBRv2NetworkModel::on_congestion_event_start has cyclomatic complexity 17 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
BBRv2NetworkModel::adapt_lower_bounds (cyclomatic 17) quiche/src/recovery/gcongestion/bbr2/network_model.rs:443 — BBRv2NetworkModel::adapt_lower_bounds has cyclomatic complexity 17 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D2 · Cognitive Complexity · IoWorker · ×2

IoWorker::gather_data_from_quiche_conn (cognitive 40) tokio-quiche/src/quic/io/worker.rs:578 — IoWorker::gather_data_from_quiche_conn has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
IoWorker::work_loop (cognitive 35) tokio-quiche/src/quic/io/worker.rs:389 — IoWorker::work_loop has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (9 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · TransportParams · ×2

TransportParams::decode (cognitive 39) quiche/src/transport_params.rs:223 — TransportParams::decode has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (36 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TransportParams::encode (cognitive 23) quiche/src/transport_params.rs:402 — TransportParams::encode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20 (23 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.

D2 · Cognitive Complexity · Http09Conn · ×2

Http09Conn::handle_requests (cognitive 35) apps/src/common.rs:567 — Http09Conn::handle_requests has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 3 (7 pts), match/switch 1 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Http09Conn::handle_responses (cognitive 19) apps/src/common.rs:480 — Http09Conn::handle_responses has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 2 (8 pts), if/else 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · quiche · ×2

quiche::recovery::congestion::cubic::on_packet_acked (cognitive 34) quiche/src/recovery/congestion/cubic.rs:211 — quiche::recovery::congestion::cubic::on_packet_acked has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
quiche::recovery::congestion::cubic::on_packet_sent (cognitive 16) quiche/src/recovery/congestion/cubic.rs:157 — quiche::recovery::congestion::cubic::on_packet_sent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1 (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.

D2 · Cognitive Complexity · BBRv2NetworkModel · ×2

BBRv2NetworkModel::adapt_lower_bounds (cognitive 21) quiche/src/recovery/gcongestion/bbr2/network_model.rs:443 — BBRv2NetworkModel::adapt_lower_bounds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 6). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
BBRv2NetworkModel::on_congestion_event_start (cognitive 20) quiche/src/recovery/gcongestion/bbr2/network_model.rs:318 — BBRv2NetworkModel::on_congestion_event_start has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 2 (nesting depth added 3). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D2 · Cognitive Complexity · Stream · ×2

Stream::try_fill_buffer (cognitive 20) quiche/src/h3/stream.rs:578 — Stream::try_fill_buffer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Stream::set_frame_payload_len (cognitive 18) quiche/src/h3/stream.rs:446 — Stream::set_frame_payload_len has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D4 · Code Duplication · Duplicated block (23 lines × 2) · ×2

Duplicated block (23 lines × 2) qlog-dancer/src/web.rs:507 — qlog-dancer/src/web.rs:507-529 | qlog-dancer/src/web.rs:591-613 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (23 lines × 2) tools/http3_test/src/runner.rs:293 — tools/http3_test/src/runner.rs:293-315 | tools/http3_test/src/runner.rs:334-356 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (14–15 lines × 2) · ×2

Duplicated block (14–15 lines × 2) apps/src/bin/quiche-server.rs:284 — apps/src/bin/quiche-server.rs:284-297 | apps/src/bin/quiche-server.rs:322-336 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–15 lines × 2) quiche/src/h3/mod.rs:2033 — quiche/src/h3/mod.rs:2033-2047 | quiche/src/h3/mod.rs:2433-2446 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (11–12 lines × 2) · ×2

Duplicated block (11–12 lines × 2) qlog-dancer/src/plots/stream_multiplex.rs:298 — qlog-dancer/src/plots/stream_multiplex.rs:298-308 | qlog-dancer/src/plots/stream_multiplex.rs:393-404 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–12 lines × 2) quiche/src/lib.rs:5013 — quiche/src/lib.rs:5013-5023 | quiche/src/lib.rs:5029-5040 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×2

Duplicated block (10–11 lines × 2) qlog-dancer/src/datastore.rs:1604 — qlog-dancer/src/datastore.rs:1604-1614 | qlog-dancer/src/datastore.rs:1642-1651 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10–11 lines × 2) quiche/src/ffi.rs:662 — quiche/src/ffi.rs:662-672 | quiche/src/ffi.rs:723-732 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (10 lines × 3) · ×2

Duplicated block (10 lines × 3) qlog-dancer/src/plots/stream_sparks.rs:710 — qlog-dancer/src/plots/stream_sparks.rs:710-719 | qlog-dancer/src/plots/stream_sparks.rs:721-730 | qlog-dancer/src/plots/stream_sparks.rs:732-741 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) quiche/src/ffi.rs:547 — quiche/src/ffi.rs:547-556 | quiche/src/ffi.rs:651-660 | quiche/src/ffi.rs:707-716 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (6 lines × 2) · ×2

Duplicated block (6 lines × 2) quiche/src/recovery/gcongestion/bbr2/drain.rs:110 — quiche/src/recovery/gcongestion/bbr2/drain.rs:110-115 | quiche/src/recovery/gcongestion/bbr2/probe_rtt.rs:64-69 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) quiche/src/lib.rs:9285 — quiche/src/lib.rs:9285-9290 | quiche/src/lib.rs:9295-9300 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

AC3 · Page structure · Page without a main landmark · ×1

Page without a main landmark qlog-dancer/index.html:1 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.

AC7 · A11y enforcement · Accessibility enforcement below the top rung · ×1

Accessibility enforcement below the top rung — No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 2 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.

D1 · Cyclomatic Complexity · http3_test · ×1

http3_test::runner::run (cyclomatic 55) tools/http3_test/src/runner.rs:33 — http3_test::runner::run has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Params · ×1

Params::with_overrides (cyclomatic 29) quiche/src/recovery/gcongestion/bbr2.rs:222 — Params::with_overrides has cyclomatic complexity 29 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D1 · Cyclomatic Complexity · RecvBuf · ×1

RecvBuf::write (cyclomatic 29) quiche/src/stream/recv_buf.rs:92 — RecvBuf::write has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · QlogMetrics · ×1

QlogMetrics::maybe_update (cyclomatic 24) quiche/src/recovery/mod.rs:566 — QlogMetrics::maybe_update has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · AppConfig · ×1

AppConfig::from_clap (cyclomatic 23) qlog-dancer/src/config.rs:88 — AppConfig::from_clap has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · IoWorker · ×1

IoWorker::gather_data_from_quiche_conn (cyclomatic 23) tokio-quiche/src/quic/io/worker.rs:578 — IoWorker::gather_data_from_quiche_conn has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · InboundPacketRouter · ×1

InboundPacketRouter::poll_recv_and_rx_time (cyclomatic 22) tokio-quiche/src/quic/router/mod.rs:432 — InboundPacketRouter::poll_recv_and_rx_time has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · RequestTableDecorator · ×1

RequestTableDecorator::visit_element_mut (cyclomatic 19) qlog-dancer/src/reports/html.rs:580 — RequestTableDecorator::visit_element_mut has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · FrameParser · ×1

FrameParser::try_parse_frame (cyclomatic 18) h3i/src/frame_parser.rs:118 — FrameParser::try_parse_frame has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Stream · ×1

Stream::set_frame_payload_len (cyclomatic 16) quiche/src/h3/stream.rs:446 — Stream::set_frame_payload_len has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Header · ×1

Header::from_bytes (cyclomatic 16) quiche/src/packet.rs:355 — Header::from_bytes has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · quiche · ×1

quiche::recovery::congestion::cubic::on_packet_acked (cyclomatic 16) quiche/src/recovery/congestion/cubic.rs:211 — quiche::recovery::congestion::cubic::on_packet_acked has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · qlog-dancer-ui.redrawByCanvasId (cyclomatic 16) · ×1

qlog-dancer-ui.redrawByCanvasId (cyclomatic 16) qlog-dancer/qlog-dancer-ui.js:175 — qlog-dancer-ui.redrawByCanvasId has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D17 · Explicit Debt · XxxComment · ×1

XxxComment quiche/src/lib.rs:8824 — // XXX: We do not remove unused paths now, we instead — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.

D2 · Cognitive Complexity · http3_test · ×1

http3_test::runner::run (cognitive 114) tools/http3_test/src/runner.rs:33 — http3_test::runner::run has cognitive complexity 114 (threshold 15). Drivers by points: if/else 25 (66 pts), match/switch 10 (31 pts), loops 6 (14 pts), boolean chains 3 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · RequestTableDecorator · ×1

RequestTableDecorator::visit_element_mut (cognitive 56) qlog-dancer/src/reports/html.rs:580 — RequestTableDecorator::visit_element_mut has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (55 pts), boolean chains 1 (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.

D2 · Cognitive Complexity · InboundPacketRouter · ×1

InboundPacketRouter::poll_recv_and_rx_time (cognitive 42) tokio-quiche/src/quic/router/mod.rs:432 — InboundPacketRouter::poll_recv_and_rx_time has cognitive complexity 42 (threshold 15). Drivers by points: if/else 6 (25 pts), match/switch 4 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · RecvBuf · ×1

RecvBuf::write (cognitive 41) quiche/src/stream/recv_buf.rs:92 — RecvBuf::write has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · QlogMetrics · ×1

QlogMetrics::maybe_update (cognitive 38) quiche/src/recovery/mod.rs:566 — QlogMetrics::maybe_update has cognitive complexity 38 (threshold 15). Drivers by points: if/else 31 (37 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · Frame · ×1

Frame::to_bytes (cognitive 35) quiche/src/h3/frame.rs:153 — Frame::to_bytes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · H2ClosureTableDecorator · ×1

H2ClosureTableDecorator::visit_element_mut (cognitive 29) qlog-dancer/src/reports/html.rs:476 — H2ClosureTableDecorator::visit_element_mut has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (29 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (QUICClosureTableDecorator::visit_element_mut) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.

D2 · Cognitive Complexity · QUICClosureTableDecorator · ×1

QUICClosureTableDecorator::visit_element_mut (cognitive 29) qlog-dancer/src/reports/html.rs:528 — QUICClosureTableDecorator::visit_element_mut has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (29 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (H2ClosureTableDecorator::visit_element_mut) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.

D2 · Cognitive Complexity · Params · ×1

Params::with_overrides (cognitive 28) quiche/src/recovery/gcongestion/bbr2.rs:222 — Params::with_overrides has cognitive complexity 28 (threshold 15). Drivers by points: if/else 28. This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D2 · Cognitive Complexity · InlineRangeSet · ×1

InlineRangeSet::insert (cognitive 26) quiche/src/ranges.rs:199 — InlineRangeSet::insert has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Hystart · ×1

Hystart::on_packet_acked (cognitive 24) quiche/src/recovery/congestion/hystart.rs:123 — Hystart::on_packet_acked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.

D2 · Cognitive Complexity · StreamMap · ×1

StreamMap::get_or_create (cognitive 22) quiche/src/stream/mod.rs:271 — StreamMap::get_or_create has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FrameParser · ×1

FrameParser::try_parse_frame (cognitive 21) h3i/src/frame_parser.rs:118 — FrameParser::try_parse_frame has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · HmmDetector · ×1

HmmDetector::on_rtt_sample (cognitive 21) quiche/src/recovery/gcongestion/bbr2/rtt_jump_detector/hmm.rs:277 — HmmDetector::on_rtt_sample has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ProbeBW · ×1

ProbeBW::update_probe_up (cognitive 19) quiche/src/recovery/gcongestion/bbr2/probe_bw.rs:382 — ProbeBW::update_probe_up has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2 (nesting depth added 8). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D2 · Cognitive Complexity · SeriesStore · ×1

SeriesStore::packet_sent (cognitive 18) qlog-dancer/src/seriesstore.rs:266 — SeriesStore::packet_sent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · AppConfig · ×1

AppConfig::from_clap (cognitive 17) qlog-dancer/src/config.rs:88 — AppConfig::from_clap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · ConnectionIdentifiers · ×1

ConnectionIdentifiers::new_dcid (cognitive 17) quiche/src/cid.rs:450 — ConnectionIdentifiers::new_dcid has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Decoder · ×1

Decoder::decode (cognitive 17) quiche/src/h3/qpack/decoder.rs:140 — Decoder::decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · SendBuf · ×1

SendBuf::retransmit (cognitive 17) quiche/src/stream/send_buf.rs:380 — SendBuf::retransmit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Http3Test · ×1

Http3Test::send_requests (cognitive 17) tools/http3_test/src/lib.rs:435 — Http3Test::send_requests has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Action · ×1

Action::from (cognitive 16) h3i/src/recordreplay/qlog.rs:490 — Action::from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Path · ×1

Path::on_loss_detection_timeout (cognitive 16) quiche/src/path.rs:498 — Path::on_loss_detection_timeout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D22 · Internal API Consistency · Duplicate function signature with different parameter names (fd vs _fd) in the same module. This suggests copy-paste error or unresolved conflict. · ×1

Duplicate function signature with different parameter names (fd vs _fd) in the same module. This suggests copy-paste error or unresolved conflict. — Remove the duplicate entry. If they are intended to be overloads, ensure distinct signatures; otherwise, keep only one. (signatures: datagram_socket.is_nonblocking(fd: &impl AsRawFd): Result | datagram_socket.is_nonblocking(_fd: &impl AsRawFd): Result)

D22 · Internal API Consistency · Ambiguous intent between `get` and `get_empty`. It is unclear if `get` returns a buffer with existing data or if it is an alias for `get_empty`. If `get` is the standard allocator, `get_empty` is redundant or confusingly named. · ×1

Ambiguous intent between `get` and `get_empty`. It is unclear if `get` returns a buffer with existing data or if it is an alias for `get_empty`. If `get` is the standard allocator, `get_empty` is redundant or confusingly named. — Rename `get_empty` to `get_zeroed` or `get_clear` if it ensures zeroed memory, or remove it if `get` always returns empty/cleared buffers. (signatures: buffer_pool.Pool.get(): Pooled | buffer_pool.Pool.get_empty(): Pooled)

D22 · Internal API Consistency · Inconsistent error handling for similar operations. `ConsumeBuffer` returns a boolean (likely success/fail), while `DgramBuffer` returns a `Result`. This forces users to handle errors differently for conceptually identical buffer manipulation. · ×1

Inconsistent error handling for similar operations. `ConsumeBuffer` returns a boolean (likely success/fail), while `DgramBuffer` returns a `Result`. This forces users to handle errors differently for conceptually identical buffer manipulation. — Standardize on `Result` for both, or `bool` if errors are unrecoverable/panic-worthy. `Result` is generally preferred for explicit error handling. (signatures: buffer_pool.ConsumeBuffer.add_prefix(prefix: &[u8]): bool | datagram_socket.buffer.DgramBuffer.try_add_prefix(prefix: &[u8]): Result)

D22 · Internal API Consistency · Inconsistent return types for 'as' accessors. `as_raw_io` returns a typed borrow (`BorrowedFd`), while `as_buf_io` returns a `String` (likely a name or path). This breaks the expectation that `as_*` methods return references or borrows of the underlying type. · ×1

Inconsistent return types for 'as' accessors. `as_raw_io` returns a typed borrow (`BorrowedFd`), while `as_buf_io` returns a `String` (likely a name or path). This breaks the expectation that `as_*` methods return references or borrows of the underlying type. — If `as_buf_io` is meant to provide access to the buffer I/O interface, it should return a reference to that interface, not a String. If it returns a name, rename to `buf_io_name()`. (signatures: datagram_socket.datagram.DatagramSocket.as_buf_io(): String | datagram_socket.datagram.DatagramSocket.as_raw_io(): BorrowedFd)

D22 · Internal API Consistency · Naming inconsistency between `send_headers_frame` and `send_headers_frame_literal`. The distinction (literal vs encoded?) is not obvious from the name alone and lacks a consistent pattern (e.g., `encode` vs `raw`). · ×1

Naming inconsistency between `send_headers_frame` and `send_headers_frame_literal`. The distinction (literal vs encoded?) is not obvious from the name alone and lacks a consistent pattern (e.g., `encode` vs `raw`). — Use consistent suffixes like `send_headers_encoded` and `send_headers_raw`, or clarify the distinction in documentation and naming. (signatures: h3i.actions.h3.h3.send_headers_frame(...) | h3i.actions.h3.h3.send_headers_frame_literal(...))

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D4 · Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) · ×1

Members sharing a duplicated core (7 members, 50+ identical tokens) qlog-dancer/src/web.rs:408 — qlog-dancer/src/web.rs:408-435 | qlog-dancer/src/web.rs:443-469 | qlog-dancer/src/web.rs:477-502 | qlog-dancer/src/web.rs:662-693 | qlog-dancer/src/web.rs:700-728 | qlog-dancer/src/web.rs:735-765 | qlog-dancer/src/web.rs:772-803 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.

D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1

Members sharing a duplicated core (5 members, 50+ identical tokens) qlog-dancer/src/plots/congestion_control.rs:43 — qlog-dancer/src/plots/congestion_control.rs:43-91 | qlog-dancer/src/plots/conn_overview.rs:346-391 | qlog-dancer/src/plots/conn_overview.rs:396-439 | qlog-dancer/src/plots/packet_sent.rs:299-369 | qlog-dancer/src/plots/rtt.rs:75-115 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.

D4 · Code Duplication · Duplicated block (67 lines × 2) · ×1

Duplicated block (67 lines × 2) tokio-quiche/src/quic/io/utilization_estimator.rs:305 — quiche/src/recovery/gcongestion/bbr/windowed_filter.rs:88-154 | tokio-quiche/src/quic/io/utilization_estimator.rs:305-371 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (42–43 lines × 2) · ×1

Duplicated block (42–43 lines × 2) qlog-dancer/src/plots/stream_sparks.rs:347 — qlog-dancer/src/plots/stream_sparks.rs:347-389 | qlog-dancer/src/plots/stream_sparks.rs:427-468 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (38–40 lines × 2) · ×1

Duplicated block (38–40 lines × 2) h3i/src/client/mod.rs:165 — h3i/src/client/mod.rs:165-204 | h3i/src/client/mod.rs:217-254 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (30 lines × 2) · ×1

Duplicated block (30 lines × 2) apps/src/client.rs:335 — apps/src/client.rs:335-364 | apps/src/client.rs:554-583 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (25–28 lines × 2) · ×1

Duplicated block (25–28 lines × 2) h3i/src/prompts/h3/errors.rs:96 — h3i/src/prompts/h3/errors.rs:96-120 | h3i/src/prompts/h3/errors.rs:125-152 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (27–28 lines × 2) · ×1

Duplicated block (27–28 lines × 2) quiche/src/lib.rs:8433 — quiche/src/lib.rs:8433-8459 | quiche/src/lib.rs:8606-8633 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (23–24 lines × 2) · ×1

Duplicated block (23–24 lines × 2) quiche/src/lib.rs:6321 — quiche/src/lib.rs:6321-6343 | quiche/src/lib.rs:8531-8554 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (22–23 lines × 2) · ×1

Duplicated block (22–23 lines × 2) h3i/src/frame.rs:387 — h3i/src/frame.rs:387-409 | h3i/src/frame.rs:412-433 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (22 lines × 3) · ×1

Duplicated block (22 lines × 3) qlog-dancer/src/web.rs:119 — qlog-dancer/src/web.rs:119-140 | qlog-dancer/src/web.rs:148-169 | qlog-dancer/src/web.rs:177-198 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (22 lines × 2) · ×1

Duplicated block (22 lines × 2) octets/src/lib.rs:218 — octets/src/lib.rs:218-239 | octets/src/lib.rs:520-541 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (21 lines × 2) · ×1

Duplicated block (21 lines × 2) apps/src/common.rs:177 — apps/src/common.rs:177-197 | apps/src/common.rs:204-224 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (19–21 lines × 2) · ×1

Duplicated block (19–21 lines × 2) qlog-dancer/src/wirefilter.rs:114 — qlog-dancer/src/wirefilter.rs:114-134 | qlog-dancer/src/wirefilter.rs:136-154 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (18–20 lines × 3) · ×1

Duplicated block (18–20 lines × 3) qlog-dancer/src/web.rs:410 — qlog-dancer/src/web.rs:410-429 | qlog-dancer/src/web.rs:445-462 | qlog-dancer/src/web.rs:479-496 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (18 lines × 4) · ×1

Duplicated block (18 lines × 4) qlog-dancer/src/web.rs:664 — qlog-dancer/src/web.rs:664-681 | qlog-dancer/src/web.rs:702-719 | qlog-dancer/src/web.rs:737-754 | qlog-dancer/src/web.rs:774-791 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (17–18 lines × 2) · ×1

Duplicated block (17–18 lines × 2) quiche/src/lib.rs:3625 — quiche/src/lib.rs:3625-3641 | quiche/src/lib.rs:4183-4200 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (15–17 lines × 2) · ×1

Duplicated block (15–17 lines × 2) qlog-dancer/src/plots/conn_flow_control.rs:202 — qlog-dancer/src/plots/conn_flow_control.rs:202-216 | qlog-dancer/src/plots/conn_flow_control.rs:237-253 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (16–17 lines × 2) · ×1

Duplicated block (16–17 lines × 2) qlog-dancer/src/seriesstore.rs:621 — qlog-dancer/src/seriesstore.rs:621-636 | qlog-dancer/src/seriesstore.rs:653-669 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (14 lines × 3) · ×1

Duplicated block (14 lines × 3) h3i/src/client/mod.rs:181 — h3i/src/client/mod.rs:181-194 | h3i/src/client/mod.rs:233-246 | h3i/src/main.rs:402-415 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.

D4 · Code Duplication · Duplicated block (13–14 lines × 3) · ×1

Duplicated block (13–14 lines × 3) qlog-dancer/src/plots/congestion_control.rs:101 — qlog-dancer/src/plots/congestion_control.rs:101-114 | qlog-dancer/src/plots/conn_overview.rs:489-501 | qlog-dancer/src/plots/rtt.rs:125-138 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.

D4 · Code Duplication · Duplicated block (8–14 lines × 2) · ×1

Duplicated block (8–14 lines × 2) qlog-dancer/src/plots/stream_sparks.rs:902 — qlog-dancer/src/plots/stream_sparks.rs:902-909 | qlog-dancer/src/plots/stream_sparks.rs:943-956 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (13 lines × 7) · ×1

Duplicated block (13 lines × 7) qlog-dancer/src/web.rs:409 — qlog-dancer/src/web.rs:409-421 | qlog-dancer/src/web.rs:444-456 | qlog-dancer/src/web.rs:478-490 | qlog-dancer/src/web.rs:663-675 | qlog-dancer/src/web.rs:701-713 | qlog-dancer/src/web.rs:736-748 | qlog-dancer/src/web.rs:773-785 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (12–13 lines × 5) · ×1

Duplicated block (12–13 lines × 5) qlog-dancer/src/plots/congestion_control.rs:80 — qlog-dancer/src/plots/congestion_control.rs:80-91 | qlog-dancer/src/plots/conn_overview.rs:379-391 | qlog-dancer/src/plots/conn_overview.rs:427-439 | qlog-dancer/src/plots/packet_sent.rs:357-369 | qlog-dancer/src/plots/rtt.rs:103-115 — before extracting anything, compare `qlog-dancer/src/plots/conn_overview.rs` and `qlog-dancer/src/plots/packet_sent.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.

D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1

Duplicated block (13 lines × 3) qlog-dancer/src/plots/conn_overview.rs:329 — qlog-dancer/src/plots/conn_overview.rs:329-341 | qlog-dancer/src/plots/packet_sent.rs:147-159 | qlog-dancer/src/plots/packet_sent.rs:220-232 — before extracting anything, compare `qlog-dancer/src/plots/conn_overview.rs` and `qlog-dancer/src/plots/packet_sent.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.

D4 · Code Duplication · Duplicated block (9–13 lines × 2) · ×1

Duplicated block (9–13 lines × 2) apps/src/client.rs:69 — apps/src/client.rs:69-77 | h3i/src/client/mod.rs:579-591 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (12 lines × 3) · ×1

Duplicated block (12 lines × 3) qlog-dancer/src/reports/html.rs:477 — qlog-dancer/src/reports/html.rs:477-488 | qlog-dancer/src/reports/html.rs:529-540 | qlog-dancer/src/reports/html.rs:581-592 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (9 lines × 4) · ×1

Duplicated block (9 lines × 4) qlog-dancer/src/plots/mod.rs:198 — qlog-dancer/src/plots/mod.rs:198-206 | qlog-dancer/src/plots/packet_received.rs:40-48 | qlog-dancer/src/plots/pending.rs:67-75 | qlog-dancer/src/plots/stream_multiplex.rs:123-131 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once.

D4 · Code Duplication · Duplicated block (7–9 lines × 3) · ×1

Duplicated block (7–9 lines × 3) apps/src/client.rs:523 — apps/src/client.rs:523-531 | h3i/src/client/sync_client.rs:450-458 | tools/http3_test/src/runner.rs:389-395 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.

D4 · Code Duplication · Duplicated block (9 lines × 3) · ×1

Duplicated block (9 lines × 3) qlog-dancer/src/reports/html.rs:512 — qlog-dancer/src/reports/html.rs:512-520 | qlog-dancer/src/reports/html.rs:564-572 | qlog-dancer/src/reports/html.rs:650-658 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (8 lines × 4) · ×1

Duplicated block (8 lines × 4) qlog-dancer/src/plots/stream_sparks.rs:710 — qlog-dancer/src/plots/stream_sparks.rs:710-717 | qlog-dancer/src/plots/stream_sparks.rs:721-728 | qlog-dancer/src/plots/stream_sparks.rs:732-739 | qlog-dancer/src/plots/stream_sparks.rs:743-750 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (7 lines × 3) · ×1

Duplicated block (7 lines × 3) qlog-dancer/src/reports/text.rs:255 — qlog-dancer/src/reports/text.rs:255-261 | qlog-dancer/src/reports/text.rs:279-285 | qlog-dancer/src/reports/text.rs:303-309 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1

Duplicated block (6 lines × 3) qlog-dancer/src/reports/text.rs:262 — qlog-dancer/src/reports/text.rs:262-267 | qlog-dancer/src/reports/text.rs:286-291 | qlog-dancer/src/reports/text.rs:310-315 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (5 lines × 3) · ×1

Duplicated block (5 lines × 3) qlog-dancer/src/reports/html.rs:160 — qlog-dancer/src/reports/html.rs:160-164 | qlog-dancer/src/reports/html.rs:219-223 | qlog-dancer/src/reports/html.rs:411-415 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (5 lines × 2) · ×1

Duplicated block (5 lines × 2) quiche/src/h3/mod.rs:2387 — quiche/src/h3/mod.rs:2387-2391 | quiche/src/h3/mod.rs:2415-2419 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D5 · Coupling · Unstable project tokio-quiche · ×1

Unstable project tokio-quiche — tokio-quiche has instability 0.83 with 1 dependents.

S1 · Web-Security Posture · Third-party script without Subresource Integrity · ×1

Third-party script without Subresource Integrity qlog-dancer/index.html:5 — `https://code.jquery.com/jquery-3.7.0.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. 3 such include(s) across the repository's markup.

Minor — 8 finding(s)

D16 · Bus Factor · Off-boarding risk · ×1

Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 4 significant file(s) lose their only recent owner: qlog-dancer/src/request_stub.rs, qlog-dancer/src/reports/text.rs, qlog/src/events/http3.rs, qlog/src/testing/mod.rs. Pair on, review, or document these before any departure.

D16 · Bus Factor · Further sole-owners (lower concentration) · ×1

Further sole-owners (lower concentration) — 4 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (9 single-owned of 163 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 163 of the 180 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above.

D20 · ADR Quality · No ADRs found · ×1

No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.

D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1

Projects may be oversized for their cohesion — 1 of 12 project(s) overshoot their size bounds, lowering Project Cohesion to 8.3/10. The most over is `quiche` (60499 LoC, 144 public types across 11 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.

D28 · Secrets (history) · Rotate the exposed credentials · ×1

REDACTED

D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1

Further orphaned files (smaller) — 15 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: quiche/src/minmax.rs, qlog/src/writer.rs, tokio-quiche/src/http3/stats.rs, datagram-socket/src/mmsg.rs, quiche/src/recovery/congestion/hystart.rs, tokio-quiche/src/quic/addr_validation_token.rs, quiche/src/recovery/congestion/prr.rs, quiche/src/recovery/congestion/test_sender.rs (and 7 more) (16 orphaned of 163 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 163 of the 180 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.

M2 · Architecture documentation · No ADRs · ×1

No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

P6 · Release Hygiene · No changelog · ×1

No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

Dimension	Tool	Version	Command	Findings	Raw output
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-d98f6389733b416aaec334a78cdeffb8/history.json --exit-code 0 --source .	5	artifacts/raw/gitleaks-history.json
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-d98f6389733b416aaec334a78cdeffb8/tree.json --exit-code 0 --source .	3	artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)	semgrep	—	semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off .	46	artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilities	osv-scanner	—	osv-scanner --format json --recursive .	0	—
D31 · IaC & Container Security	trivy	—	trivy config --format json --quiet .	7	artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)	semgrep	—	semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.	0	—
D37 · Vulnerability-disclosure Policy	disclosure	—	disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.	0	—
D40 · Network Egress Confinement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.	0	—
D41 · Kernel & Syscall Confinement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.	0	—
D42 · Runtime Threat Enforcement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.	0	—
D43 · Malicious Dependencies	osv-scanner	—	osv-scanner --format json --recursive .	0	—

Run 01a0eae6-180a-7e3b-96c2-5dad5cf2b65f · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Cloudflare/quiche

Findings by grade

This survey was produced by

Executive summary

Top priorities

Diagnosis — what's actually going on

Architecture — module dependency graph

Architecture — module dependency matrix

At a glance — Code Health · 81% · Strong ·

At a glance — Architecture · 93% · Exemplary ·

At a glance — Maturity · 77% · Strong ·

At a glance — Readiness · 47% · Adequate · gated by D13 ·

At a glance — Security · 61% · Adequate · gated by D29 ·

At a glance — Event Sourcing · 100% · Exemplary ·

At a glance — Accessibility · 41% · Weak · gated by AC2, AC3 ·

At a glance — Performance · 100% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

Roadmap

File quality

How the grades work

Methodology & how to trust this report

Tools & methods

Run transparency — what happened this run

Limitations & what we did not check

Per-dimension blind spots

The LLM boundary

Dimensions

Frontend & cross-cutting dimensions

WCAG coverage — what static analysis assessed

Reference — by lens

Appendix A — Findings (grouped)

Appendix B — Reproduction & audit trail

Downloadable artifacts