cargo — Watchdog Audit

Executive summary

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

The system holds a strong overall standing of 69%, indicating a robust asset that delivers value but carries manageable risks. With nearly 300,000 lines of code, it represents a significant investment, estimated at roughly €440,000 to rebuild. This scale underscores the importance of maintaining its current trajectory rather than starting over, as the existing logic is well-structured and mature.

The most critical opportunity lies in observability. Extending structured logging to all runnable modules is the highest-leverage action, as it ensures every production issue is diagnosable. This fix pays for itself within one to two months by preventing the annual drag of 19 to 114 engineer-days caused by unmeasured complexity. Without this visibility, the team faces a hidden velocity tax, where changes in weaker areas cost 4–8% more effort due to complexity and duplication. This tax compounds over time, slowing delivery and increasing defect rates.

A secondary risk involves release safety. While the release job declares environments, the protection rules are not visible in the repository, creating a gap in security exposure. Confirming required reviewers or using draft releases prevents bad builds from reaching users, protecting the business from potential outages and reputational damage. Additionally, documenting significant decisions in a centralized location will help new team members understand the context of past choices, reducing onboarding time and architectural drift.

The codebase benefits from excellent domain modeling and performance, with no boilerplate or straight-line logic diluting the core business value. These strengths provide a solid foundation for future growth. To maximize leverage, focus first on extending structured logging, as it addresses the most immediate cost and risk. This single action resolves the biggest bottleneck in delivery speed and reliability, ensuring the system remains a competitive asset for the business.

Code Health 81% Adequate · gated by D2 Architecture 70% Adequate · gated by AX7 Maturity 66% Adequate · gated by M2 Readiness 66% Strong Security 81% Adequate · gated by D36 Domain Modelling 100% ★ Exemplary 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.

Readiness 66% · 46% weightMaturity 66% · 25% weightArchitecture 70% · 14% weightCode Health 81% · 8% weightSecurity 81% · 4% weightDomain Modelling 100% · 2% weightPerformance 100% · 1% weight

No single dominant problem — the weakest areas are close, so progress on any of them moves the score.

Code composition — where the lines go

Tests 100%

New since the last scan (24+)

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

D1 · UnusedDepState::new (cyclomatic 17) src/compiler/unused_deps.rs
D1 · PackageRegistry::query (cyclomatic 16) src/workspace/registry.rs
D3 · MethodTooLong: ArgMatchesExt.compile_options src/util/command_prelude.rs
D3 · TooManyMethods: Feature src/workspace/features.rs
D3 · FileTooLong: ops/cargo_clean.rs src/ops/cargo_clean.rs
D3 · FunctionTooLong: cargo::bin::cargo::commands::install::exec src/bin/cargo/commands/install.rs
D4 · Duplicated block (13 lines × 2) src/sources/path.rs
D5 · Off the main sequence: cargo-platform
D5 · Off the main sequence: cargo-util
D5 · Off the main sequence: cargo-util-schemas
D5 · Off the main sequence: rustfix
D5 · Off the main sequence: crates-io
D5 · Off the main sequence: cargo-credential
D15 · Hotspot: src/compiler/unused_deps.rs src/compiler/unused_deps.rs
D15 · Repeated repair: src/compiler/trim_paths.rs src/compiler/trim_paths.rs
D22 · Redundant and inconsistent access to Cargo configuration values. The `input` type has a generic `cargo_cfg` method, while the `cfg` type exposes specific methods for every known config key. This creates two ways to access the same data with different signatures (generic lookup vs specific typed accessors) and potential for drift if new configs are added to one but not the other.
D22 · Inconsistent naming and parameter structure for linking arguments. `rustc_link_arg` takes a single flag. `rustc_link_arg_bin` takes a bin name and a flag. However, `rustc_link_arg_bins`, `tests`, `examples`, and `benches` take only a flag, implying they apply to all targets of that kind. This inconsistency makes it unclear if `rustc_link_arg_bin` is meant to be the general case for a single target, while the others are bulk operations, or if the naming is just arbitrary.
D22 · Inconsistent parameter order for symlink operations. `ProjectBuilder` methods take `dst` then `src`, while `Project.symlink` takes `src` then `dst`. This inconsistency increases the risk of errors when switching between building a project and manipulating an existing one.
D22 · Inconsistent naming for project creation helpers. `project` creates in a default location, `project_in` takes a directory, and `project_in_home` takes a name (presumably relative to home). The naming doesn't clearly convey the relationship between the arguments and the resulting path structure.
D35 · Boundary-crossing change coupling: lib.rs ↔ directory.rs crates/resolver-tests/src/lib.rs
D35 · Change coupling clique: blanket_hint_mostly_unused.rs, im_a_teapot.rs, unknown_lints.rs src/diagnostics/rules/blanket_hint_mostly_unused.rs
AX7 · Cross-slice coupling: cargo → cargo_platform src/compiler/mod.rs
AX7 · Cross-slice coupling: cargo → cargo_util_schemas src/context/schema.rs
AX7 · Cross-slice coupling: cargo → cargo_platform src/ops/cargo_metadata.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 — €150,000–€730,000

Cost to rebuild	€150,000–€730,000 (1.4–4.6 person-years (2,429–7,707 h), ~1–6 engineers)
Domain complexity	Standard — harder problems cost more per line
Quality factor	1.0× (at 69% 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 ~3.0 person-years of build effort (about ~€440,000 to rebuild). Its weakest lens is Readiness at 66% — the part of that asset most exposed by the findings below.

How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.1) — vertical slice × a 1.0× 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 1 No ADRs found finding(s) in ADR Quality.

+3.3 pts · Low effort · ADR Quality

Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.

+3.4 pts · Medium effort · Observability

The release job declares an environment, but its protection rules are not visible from the repository — confirm required reviewers are attached, or publish as a draft release so a bad build can be stopped before users can download it.

+3.4 pts · Medium effort · Deployment & Rollback

Diagnosis — what's actually going on

The top fix pays for itself · High · Economics

The top-ranked fix costs roughly 1–3 engineer-days once. Not doing it costs about 19–114.2 engineer-days every year, paid as drag on the ~207,774 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–2 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–8% 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: 51,232 line(s) changed over a 90-day window ⇒ ~207,774/year · D1/D2/D4 code quality: averaging 6.5/10 ⇒ a 4–8% 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 2 months.

Highest-leverage move · Medium · Leverage

Of everything flagged, the best return on effort is: Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production. The rest can wait behind it.

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

→ Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.

A velocity tax on every change · Medium · Economics

The code-quality signals (complexity, duplication, cohesion) average 6.5/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 4–8% 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.5/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.)

333 modules, 1256 dependencies. 4 dependency cycles across 99 modules, marked above the diagonal.

Showing the 40 most-connected modules; 293 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 cargo_credential_1password	2 mdman.format	3 cargo.ops.cargo_tree.format	4 cargo_test_support.registry	5 cargo.context.value	6 cargo.util.interning	7 cargo_util_schemas.core.package_id_spec	8 crates_io	9 cargo.util.flock	10 cargo.workspace.source_id	11 cargo_util.process_builder	12 cargo.workspace.features	13 cargo.workspace.package_id	14 cargo.ops.registry	15 cargo.resolver.resolve	16 cargo.sources.source	17 cargo.workspace.workspace	18 cargo.workspace.package	19 cargo.workspace.profiles	20 cargo.compiler.unit_dependencies	21 cargo.compiler.unit	22 cargo.compiler.build_context	23 cargo.compiler.build_runner	24 cargo.compiler.job_queue	25 cargo.workspace.dependency	26 cargo.workspace.summary	27 cargo.workspace.manifest	28 cargo.compiler.build_context.target_info	29 cargo.resolver.features	30 cargo.ops.cargo_tree	31 cargo_util_schemas.manifest	32 cargo.context.schema	33 cargo.context	34 cargo.compiler.compile_kind	35 cargo.diagnostics.lint	37 cargo.compiler.build_config
1 cargo_credential_1password
2 mdman.format
3 cargo.ops.cargo_tree.format		1
4 cargo_test_support.registry	4	1						2
5 cargo.context.value		2	1
6 cargo.util.interning		1	1
7 cargo_util_schemas.core.package_id_spec	2	1	1										1
8 crates_io				2
9 cargo.util.flock			1					1																									2
10 cargo.workspace.source_id	3	3	3			1																											1
11 cargo_util.process_builder		1	1					1
12 cargo.workspace.features		1	1								1																						1
13 cargo.workspace.package_id		2	1			2	1			2
14 cargo.ops.registry				1				1		2			1																				1
15 cargo.resolver.resolve		1											1													1				1
16 cargo.sources.source		1		2						2			1
17 cargo.workspace.workspace				2	2				1	1		3	1			2					1								1		3	1	3
18 cargo.workspace.package		1	1	1	1	3	1			2		1	3		1	1	1								1	1		1	2	2	2		1
19 cargo.workspace.profiles		3	3		1	3							3		2		2				1			1					1	1	6		2	3
20 cargo.compiler.unit_dependencies				3		1							2		2		2	2	5		4			1				2	3	1			2	1		3
21 cargo.compiler.unit		2	1	2		2													2	2										2			1	4		2
22 cargo.compiler.build_context						1											1	1	1		1				1			1					1			1
23 cargo.compiler.build_runner																					1	1
24 cargo.compiler.job_queue		1	1					2													2	1	2										2
25 cargo.workspace.dependency		2	2	2		3				3		1	1											3		1								2
26 cargo.workspace.summary		2	2	2		4		1		1			2												1
27 cargo.workspace.manifest		3	1		1	1		4	1	1		5	1				3									1				2	5		1	1
28 cargo.compiler.build_context.target_info				1		1					2						1										1			1			3	3		1
29 cargo.resolver.features		1	1	1		2							2		1		2	1								1		1						1
30 cargo.ops.cargo_tree			1														1												1
31 cargo_util_schemas.manifest		9	8		3																									5
32 cargo.context.schema		2	2		2																										1		1
33 cargo.context					3				1	1				1			1															2
34 cargo.compiler.compile_kind						1					1																			1			1
35 cargo.diagnostics.lint		2	2									3																			1		1
36 cargo.ops.cargo_package				2					2	1				2	1		2	1											1	1		1	3
37 cargo.compiler.build_config						1					1																					1	1	1
38 cargo.diagnostics				1								2																					2		3
39 cargo.compiler						1		1			3		3								4	1	4	1						3			1	1		3
40 cargo.ops.cargo_compile													1		1		1	1			2						1	1	4				2	1		3

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

At a glance — Code Health · 81% · Adequate · gated by D2 ·

The Good

D3 · Rust God Classes 7.3 D4 · Rust Code Duplication 9.6 D17 · Rust Explicit Debt 9.8

The Bad

D1 · Rust Cyclomatic Complexity 6.4

The Ugly

D2 · Rust Cognitive Complexity 3.6

At a glance — Architecture · 70% · Adequate · gated by AX7 ·

The Good

D5 · Rust Coupling 7.9 D22 · Rust Internal API Consistency 7.0 D26 · Rust Project Cohesion 9.3 D35 · Rust Change Coupling 9.7 AX10 · Repo Code composition 9.9 AX3 · Repo Project dependency cycles 10.0 AX5 · Repo Architecture & structure 10.0 AX8 · Repo Test isolation 10.0 AX9 · Repo CQS / query purity 10.0

The Ugly

AX7 · Repo Slice cohesion 1.0

At a glance — Maturity · 66% · Adequate · gated by M2 ·

The Good

D15 · Rust Churn × Complexity Hotspots 9.7 D16 · Rust Bus Factor 8.8 D19 · Rust Documentation Quality 8.0 D21 · Rust Naming Consistency 10.0 D34 · Rust Knowledge Freshness 9.5 M1 · Repo Documentation (README) 7.3 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 10.0

The Ugly

D20 · Rust ADR Quality 0.0 M2 · Repo Architecture documentation 2.0

At a glance — Readiness · 66% · Strong ·

The Good

D9 · Rust Test Distribution 10.0 D13 · Rust REDACTED Scanning 10.0 D14 · Rust License Compliance 10.0 P1 · Repo CI/CD gates 10.0 P6 · Repo Release Hygiene 10.0

The Bad

P2 · Repo Observability 4.7 P3 · Repo Security & performance tooling 5.0 P4 · Repo Deployment & Rollback 5.0

At a glance — Security · 81% · Adequate · gated by D36 ·

The Good

D29 · Rust Static Analysis (SAST) 9.9 D30 · Rust Dependency Vulnerabilities 10.0 D31 · Rust IaC & Container Security 10.0 D43 · Rust Malicious Dependencies 10.0 D44 · Rust Platform End-of-Life 10.0 S1 · Repo Web-Security Posture 8.0

The Bad

D28 · Rust Secrets (history) 6.0

The Ugly

D36 · Rust Supply-chain Provenance & Signing 2.5

At a glance — Domain Modelling · 100% · Exemplary ·

The Good

DM4 · Repo Rich vs anemic domain model 10.0 DM5 · Repo Encapsulated state 10.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
A02:2021 — Cryptographic Failures	5	High / Critical
A03:2021 — Injection	1	Medium

Roadmap

First, extend structured logging across all runnable modules to ensure full production diagnosability. Second, verify that deployment protection rules are visible and enforceable to prevent bad builds from reaching users. Third, establish a consistent directory for dated architecture decision records to capture context and consequences. Finally, add a quick-start build and run section to the root README to help newcomers get started immediately.

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

Do this	Helps	Effort	Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.	+3.3 pts	Low	ADR Quality
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.	+3.4 pts	Medium	Observability
The release job declares an environment, but its protection rules are not visible from the repository — confirm required reviewers are attached, or publish as a draft release so a bad build can be stopped before users can download it.	+3.4 pts	Medium	Deployment & Rollback
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).	+3.3 pts	Medium	Architecture documentation
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.	+3.0 pts	Medium	Documentation (README)
Keep slices independent: share cross-slice needs via an explicit contract/shared-kernel, not direct references between slices.	+2.3 pts	Medium	Slice cohesion
Resolve the 6 Off the main sequence finding(s) in Coupling.	+0.8 pts	Low	Coupling
Resolve the 1 Boundary-crossing change coupling finding(s) in Change Coupling — start with lib.rs.	+0.7 pts	Low	Change Coupling

File quality

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

File	Score	Band	Worst signal
REDACTED	5.8	Mixed	Secrets (history): REDACTED: REDACTED
REDACTED	5.8	Mixed	Secrets (history): REDACTED: REDACTED
crates/mdman/src/format/text.rs	6.0	Mixed	Explicit Debt: TodoComment
src/ops/cargo_compile/mod.rs	6.0	Mixed	Explicit Debt: TodoComment
src/resolver/errors.rs	6.0	Mixed	Explicit Debt: HackComment
src/compiler/custom_build.rs	6.0	Mixed	Explicit Debt: FixmeComment
src/ops/cargo_clean.rs	6.0	Mixed	Explicit Debt: FixmeComment
src/ops/cargo_vendor.rs	6.0	Mixed	Explicit Debt: HackComment
src/compiler/fingerprint/mod.rs	6.0	Mixed	Explicit Debt: FixmeComment
src/sources/registry/mod.rs	6.0	Mixed	Explicit Debt: HackComment
src/ops/resolve.rs	6.0	Mixed	Explicit Debt: TodoComment
src/sources/git/utils.rs	6.0	Mixed	Explicit Debt: TodoComment
src/util/command_prelude.rs	6.0	Mixed	Explicit Debt: TodoComment
src/sources/path.rs	6.0	Mixed	Explicit Debt: TodoComment
src/ops/cargo_fix/mod.rs	6.0	Mixed	Explicit Debt: HackComment
src/compiler/compilation.rs	6.0	Mixed	Explicit Debt: HackComment
src/compiler/build_context/target_info.rs	6.0	Mixed	Explicit Debt: HackComment
src/ops/cargo_update.rs	6.0	Mixed	Explicit Debt: TodoComment
src/resolver/features.rs	6.0	Mixed	Explicit Debt: TodoComment
src/compiler/unit_dependencies.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 — 6

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 — 679

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 — 14

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

Could not be resolved — 49

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. 39 of 44 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.9 — 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 — 44 dimensions across the health lenses

D1D2D3D4D5D9D13D14D15D16D17D19D20D21D22D26D28D29D30D31D34D35D36D43D44AX10AX3AX5AX7AX8AX9DM4DM5M1M2M3M4P1P2P3P4P6PF3S1

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, 676 of 699 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 01a0ea58-ad70-72d6-9899-33f50f8bf6a0.

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, 97 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 — 29 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.
D15 Churn × Complexity Hotspots — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. A hotspot's complexity is meant to be the worst body its churn actually touched. For src/workspace/features.rs that could not be established — the complexity reader for the file reports no body extents, or the history carries no per-line attribution — so the row quotes the file's worst body, which the counted changes may never have touched. The churn count is unaffected.
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.
AX7 Slice cohesion — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 20 further occurrence(s) are not listed individually; the score already reflects all 60.
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.
DM3 Integration-event coupling — 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 — a domain type leaking across a crate boundary cannot be told apart from source alone from a legitimate shared-kernel crate. Reported as guidance rather than measured.
DM7 Repository granularity — 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 — detecting 'a repository per CHILD entity' needs the aggregate-root structure, which is not resolvable from source alone here. Reported as guidance rather than measured.
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.
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").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
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").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
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.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
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.
DM4 Rich vs anemic domain model: Behaviour is detected as state mutation inside a method body — a method that enforces an invariant by validating-and-throwing without mutating reads as a query, and mutation delegated through an interface the scan can't resolve isn't credited; entities with zero public properties still drop out of the population. It detects that state changes, not whether the rule is correct.
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 Complexity6.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 6.4 / 10 · rule-coverage 100% · ceiling Prevented

90 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was TextRenderer::push_md at 68. A further 5 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 cargo_util::process_error::exit_status_to_string::status_to_string at 47 — they are counted neither in the figure above nor in this dimension's score. 4 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: crates/cargo-util/src/process_error.rs (cargo_util::process_error::exit_status_to_string::status_to_string at 47), src/bin/cargo/commands/mod.rs (cargo::bin::cargo::commands::builtin_exec at 40), src/compiler/fingerprint/dirty_reason.rs (DirtyReason::present_to at 36), crates/cargo-util-schemas/src/core/source_kind.rs (SourceKind::cmp at 19). 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.

cargo::ops::cargo_compile::create_bcx (cyclomatic 47) · ×58src/ops/cargo_compile/mod.rs:251

Dependency::update_toml (cyclomatic 27) · ×3src/workspace/editor/dependency.rs:508

InstallablePackage::install_one (cyclomatic 36) · ×2src/ops/cargo_install.rs:337

DrainState::handle_event (cyclomatic 21) · ×2src/compiler/job_queue/mod.rs:614

UnitGenerator::find_named_targets (cyclomatic 20) · ×2src/ops/cargo_compile/unit_generator.rs:233

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

What to do

Resolve the 58 cargo finding(s) in Cyclomatic Complexity — start with mod.rs (22), custom_build.rs (2), resolve.rs (2). — One of this dimension's main actionable groups (58 warning-level).
Resolve the 3 Dependency finding(s) in Cyclomatic Complexity — start with dependency.rs (3). — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 InstallablePackage finding(s) in Cyclomatic Complexity — start with cargo_install.rs (2). — One of this dimension's main actionable groups (2 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 Complexity3.6 / 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 3.6 / 10 · rule-coverage 100% · ceiling Prevented

198 method(s) exceeded the cognitive complexity threshold of 15; the worst was cargo::ops::cargo_clean::clean_specs at 116.

cargo::ops::cargo_clean::clean_specs (cognitive 116) · ×132src/ops/cargo_clean.rs:188

DrainState::drain_the_queue (cognitive 25) · ×5src/compiler/job_queue/mod.rs:801

Dependency::update_toml (cognitive 65) · ×3src/workspace/editor/dependency.rs:508

BuildRunner::compile (cognitive 60) · ×3src/compiler/build_runner/mod.rs:169

UnitGenerator::find_named_targets (cognitive 43) · ×3src/ops/cargo_compile/unit_generator.rs:233

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

What to do

Resolve the 132 cargo finding(s) in Cognitive Complexity — start with mod.rs (46), resolve.rs (4), utils.rs (4). — One of this dimension's main actionable groups (132 warning-level).
Resolve the 5 DrainState finding(s) in Cognitive Complexity — start with mod.rs (5). — One of this dimension's main actionable groups (5 warning-level).
Resolve the 3 Dependency finding(s) in Cognitive Complexity — start with dependency.rs (3). — One of this dimension's main actionable groups (3 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 Classes7.3 / 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 7.3 / 10 · rule-coverage 100% · ceiling Prevented

113 god class(es) detected.

FileTooLong: parser/mod.rs · ×41src/workspace/parser/mod.rs

FunctionTooLong: cargo::workspace::parser::to_real_manifest · ×32src/workspace/parser/mod.rs:1301

MethodTooLong: BuildOutput.parse · ×18src/compiler/custom_build.rs:798

TooManyMethods: GlobalContext · ×9src/context/mod.rs:208

ClassTooLong: GlobalContext · ×7src/context/mod.rs:208

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

What to do

Resolve the 41 FileTooLong finding(s) in God Classes — start with mod.rs (12), features.rs (2), manifest.rs (2). — One of this dimension's main actionable groups (41 warning-level).
Resolve the 32 FunctionTooLong finding(s) in God Classes — start with mod.rs (12), errors.rs, custom_build.rs. — One of this dimension's main actionable groups (32 warning-level).
Resolve the 18 MethodTooLong finding(s) in God Classes — start with mod.rs (3), cargo_install.rs (2), dependency.rs (2). — One of this dimension's main actionable groups (18 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 111 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

108 duplicated block group(s) detected. A further 3 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 1 of the 111 are in trees this repository does not ship — vendored, example/demo, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.

Duplicated block (8 lines × 2) · ×12src/ops/cargo_compile/packages.rs:61

Duplicated block (6 lines × 2) · ×10src/bin/cargo/commands/help.rs:264

Duplicated block (7 lines × 2) · ×9src/resolver/encode.rs:445

Duplicated block (10 lines × 2) · ×8crates/mdman/src/format/man.rs:308

Duplicated block (9 lines × 2) · ×7crates/home/src/env.rs:69

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

What to do

Resolve the 12 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with cargo_update.rs (2), packages.rs, features.rs. — One of this dimension's main actionable groups (12 warning-level).
Resolve the 10 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with text_direction_codepoint_in_comment.rs (2), help.rs, compilation_files.rs. — One of this dimension's main actionable groups (10 warning-level).
Resolve the 9 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with global_cache_tracker.rs (2), encode.rs, mod.rs. — One of this dimension's main actionable groups (9 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 · Coupling7.9 / 10Strong✓ 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 7.9 / 10 · rule-coverage 100% · ceiling Prevented

23 production modules (Cargo), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 6 module(s) off the main sequence, with abstractness counted on 16 of the 23 (the rest declare no modelled class or interface, export only macros, or are not Gradle/Maven modules or Cargo crates).

Off the main sequence: cargo-platform · ×6

What to do

Resolve the 6 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (6 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

386 test methods: 251 unit, 135 integration, 0 BDD, 0 e2e. The Rust suite contributes 386 `#[test]` function(s) across 97 file(s) declaring at least one; its unit/integration split is Cargo's own — 41 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 Scanning10.0 / 10Exemplary○ Nothing flagged

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 10.0 / 10 · rule-coverage 100% · ceiling Prevented

REDACTED scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

Do you agree with this assessment?

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

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

0 of 379 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's Cargo.lock closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under MIT OR Apache-2.0, which is its own choice and is not judged here.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

Do you agree with this assessment?

D15 · Churn × Complexity Hotspots9.7 / 10Stronggated by 20 serious findings✓ 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 9.7 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: src/compiler/mod.rs (25×42=1050); src/workspace/parser/mod.rs (20×45=900); src/workspace/features.rs (19×31=589) Repeated repair below the complexity floor: src/compiler/trim_paths.rs (8 of 13 changes were fixes)

Hotspot: src/compiler/mod.rs · ×19src/compiler/mod.rs:1304

Repeated repair: src/compiler/trim_paths.rssrc/compiler/trim_paths.rs:299

What to do

Resolve the 19 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (6), features.rs, resolve.rs. — One of this dimension's main actionable groups (19 warning-level).
Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with trim_paths.rs. — One of this dimension's main actionable groups (1 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 Factor8.8 / 10Strong✓ 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 8.8 / 10 · rule-coverage 100% · ceiling Documented

29 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/ops/cargo_tree/graph.rs. Counted over 244 of the 292 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)

What to do

Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

D17 · Explicit Debt9.8 / 10Stronggated by 91 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.8 / 10 · rule-coverage 100% · ceiling Prevented

91 deducted task-comment markers across 118570 LoC (0.1/KLoC) → score 9.8. 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 · ×50crates/cargo-test-support/src/lib.rs:1015

HackComment · ×22crates/build-rs/src/lib.rs:8

FixmeComment · ×18crates/cargo-util/src/paths.rs:631

XxxCommentsrc/workspace/workspace.rs:607

What to do

Resolve the 50 TodoComment finding(s) in Explicit Debt — start with mod.rs (5), cargo_metadata.rs (4), global_cache_tracker.rs (4). — One of this dimension's main actionable groups (50 warning-level).
Resolve the 22 HackComment finding(s) in Explicit Debt — start with mod.rs (3), lib.rs (2), main.rs (2). — One of this dimension's main actionable groups (22 warning-level).
Resolve the 18 FixmeComment finding(s) in Explicit Debt — start with mod.rs (4), paths.rs, custom_build.rs. — One of this dimension's main actionable groups (18 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 and a subset of architecture/Docs markdown files give an overview (Cargo, Cargo Contributor Guide) plus installation/build requirements for compiling from source, usage examples (cargo bench), and licensing. The benches/, credential/, crates/, and doc/contrib directories each document their own subdirectories with focused READMEs; the root README is the only one covering the repository's overall scope, installation, and contribution guidance. A clipped architecture/Docs set of 232 files indicates a well-structured documentation suite but no single file is flagged as missing.

What to do

Improve Documentation Quality — currently 8.0/10. — The repository's root README and a subset of architecture/Docs markdown files give an overview (Cargo, Cargo Contributor Guide) plus installation/build requirements for compiling from source, usage examples (cargo bench), and licensing. The benches/, credential/, crates/, and doc/contrib directories each document their own subdirectories with focused READMEs; the root README is the only one covering the repository's overall scope, installation, and contribution guidance. A clipped architecture/Docs set of 232 files indicates a well-structured documentation suite but no single file is flagged as missing.

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 ConsistencyStrong◐ 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 Strong / 10 · rule-coverage 100% · ceiling Verified

4 API inconsistencies across a 400-member sample of 550 exposed types.

Redundant and inconsistent access to Cargo configuration values. The `input` type has a generic `cargo_cfg` method, while the `cfg` type exposes specific methods for every known config key. This creates two ways to access the same data with different signatures (generic lookup vs specific typed accessors) and potential for drift if new configs are added to one but not the other.

Inconsistent naming and parameter structure for linking arguments. `rustc_link_arg` takes a single flag. `rustc_link_arg_bin` takes a bin name and a flag. However, `rustc_link_arg_bins`, `tests`, `examples`, and `benches` take only a flag, implying they apply to all targets of that kind. This inconsistency makes it unclear if `rustc_link_arg_bin` is meant to be the general case for a single target, while the others are bulk operations, or if the naming is just arbitrary.

Inconsistent parameter order for symlink operations. `ProjectBuilder` methods take `dst` then `src`, while `Project.symlink` takes `src` then `dst`. This inconsistency increases the risk of errors when switching between building a project and manipulating an existing one.

Inconsistent naming for project creation helpers. `project` creates in a default location, `project_in` takes a directory, and `project_in_home` takes a name (presumably relative to home). The naming doesn't clearly convey the relationship between the arguments and the resulting path structure.

What to do

Resolve the 1 Redundant and inconsistent access to Cargo configuration values. The… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Inconsistent naming and parameter structure for linking arguments.… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Inconsistent parameter order for symlink operations. `ProjectBuilder`… 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 Cohesion9.3 / 10Exemplary✓ 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 9.3 / 10 · rule-coverage 100% · ceiling Documented

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

Projects may be oversized for their cohesion

✓ On the Gold path — maintain.

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

Do you agree with this assessment?

D28 · Secrets (history)6.0 / 10Adequate✓ 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 6.0 / 10 · rule-coverage 100% · ceiling Documented

4 finding(s): 0 critical, 4 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 4 REDACTED finding(s) in Secrets (history) — start with REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (4 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)9.9 / 10Exemplary✓ 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 9.9 / 10 · rule-coverage 100% · ceiling Documented

1 finding(s): 0 critical, 0 high, 0 medium, 1 low. semgrep hit a parse error in 5 file(s) — `crates/cargo-util-schemas/src/core/partial_version.rs` (line 196, line 198, line 216, …), `crates/cargo-util-schemas/src/index.rs` (line 315, line 317), `etc/cargo.bashcomp.sh`, `src/ops/cargo_clean.rs` (line 608, line 610), `src/util/frontmatter.rs` (line 429, line 448, line 467, …) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 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

✓ On the Gold path — maintain.

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

Do you agree with this assessment?

D30 · Dependency Vulnerabilities10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir/Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex, Go, Java and Kotlin via Maven/Gradle, npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.

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

No known-vulnerable dependencies in any ecosystem this repository declares.

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

Do you agree with this assessment?

D31 · IaC & Container Security10.0 / 10Exemplary○ Nothing flagged

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

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

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

trivy and checkov found no infrastructure-as-code or container misconfigurations.

✓ On the Gold path — maintain.

Detailed fixes: d31_recommendation.md.

Do you agree with this assessment?

D34 · Knowledge Freshness9.5 / 10Exemplary✓ 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.5 / 10 · rule-coverage 100% · ceiling Documented

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

Orphaned files with no living knowledge

✓ On the Gold path — maintain.

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

Do you agree with this assessment?

D35 · Change Coupling9.7 / 10Adequategated by 1 critical finding✓ 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.7 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: mod.rs↔cargo_fetch.rs 92%; directory.rs↔mod.rs 71%; im_a_teapot.rs↔unknown_lints.rs 60%

Boundary-crossing change coupling: lib.rs ↔ directory.rscrates/resolver-tests/src/lib.rs

Change coupling: mod.rs ↔ cargo_fetch.rs · ×2src/ops/cargo_compile/mod.rs

Change coupling clique: blanket_hint_mostly_unused.rs, im_a_teapot.rs, unknown_lints.rssrc/diagnostics/rules/blanket_hint_mostly_unused.rs

What to do

Resolve the 1 Boundary-crossing change coupling finding(s) in Change Coupling — start with lib.rs. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 2 Change coupling finding(s) in Change Coupling — start with mod.rs, directory.rs. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Change coupling clique finding(s) in Change Coupling — start with blanket_hint_mostly_unused.rs. — One of this dimension's main actionable groups (1 warning-level).

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

Do you agree with this assessment?

D36 · Supply-chain Provenance & Signing2.5 / 10Weak✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

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

1/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED

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

What to do

Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.

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

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

Do you agree with this assessment?

D44 · Platform End-of-Life10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.

Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.

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

0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Do you agree with this assessment?

Frontend & cross-cutting dimensions

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

AX10 · Code composition9.9 / 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?

AX5 · Architecture & structure10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.

Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.

Do you agree with this assessment?

AX7 · Slice cohesion1.0 / 10Critical✓ Tool-verified

Other · Architecture — Whether feature slices stay independent (no direct cross-slice references) — the discipline that makes vertical-slice architecture pay off.

Method: Roslyn scan (vertical-slice gated): feature slices resolved from namespaces (.Features.*, .Slices.*) or project names; cross-slice type references detected. Deterministic, traceable.

`Execs` (slice 'cargo_test_support') depends on `ProcessBuilder` from slice 'cargo_util'. — crates/cargo-test-support/src/lib.rs:625
`ProcessBuilder` (slice 'cargo_util') depends on `Client` from slice 'cargo'. — crates/cargo-util/src/process_builder.rs:20
`TomlWorkspace` (slice 'cargo_util_schemas') depends on `Value` from slice 'cargo'. — crates/cargo-util-schemas/src/manifest/mod.rs:127
`TomlPackage` (slice 'cargo_util_schemas') depends on `Value` from slice 'cargo'. — crates/cargo-util-schemas/src/manifest/mod.rs:179
`TomlLintConfig` (slice 'cargo_util_schemas') depends on `Table` from slice 'mdman'. — crates/cargo-util-schemas/src/manifest/mod.rs:1675
`Hints` (slice 'cargo_util_schemas') depends on `Value` from slice 'cargo'. — crates/cargo-util-schemas/src/manifest/mod.rs:1700
`PrettyPrintRegistry` (slice 'resolver_tests') depends on `Summary` from slice 'cargo'. — crates/resolver-tests/src/lib.rs:224
`BuildConfig` (slice 'cargo') depends on `ProcessBuilder` from slice 'cargo_util'. — src/compiler/build_config.rs:15
`TargetInfo` (slice 'cargo') depends on `ProcessBuilder` from slice 'cargo_util'. — src/compiler/build_context/target_info.rs:38
`Compilation` (slice 'cargo') depends on `ProcessBuilder` from slice 'cargo_util'. — src/compiler/compilation.rs:75
`ErrorToHandle` (slice 'cargo') depends on `Error` from slice 'crates_io'. — src/compiler/job_queue/mod.rs:268
`ManifestErrorContext` (slice 'cargo') depends on `Cfg` from slice 'cargo_platform'. — src/compiler/mod.rs:2068
`RenderContext` (slice 'cargo') depends on `Error` from slice 'crates_io'. — src/compiler/timings/report.rs:90
`UnitInner` (slice 'cargo') depends on `Package` from slice 'cargo_test_support'. — src/compiler/unit.rs:59
`ExternState` (slice 'cargo') depends on `Dependency` from slice 'cargo_test_support'. — src/compiler/unused_deps.rs:178
`ConfigError` (slice 'cargo') depends on `Error` from slice 'crates_io'. — src/context/error.rs:10
`CredentialCacheValue` (slice 'cargo') depends on `REDACTED` from slice 'cargo_credential'. — src/context/mod.rs:199
`GlobalContext` (slice 'cargo') depends on `Shell` from slice 'cargo_util_terminal'. — src/context/mod.rs:208
`CargoBuildConfig` (slice 'cargo') depends on `ProfileName` from slice 'cargo_util_schemas'. — src/context/schema.rs:409
`Lint` (slice 'cargo') depends on `RustVersion` from slice 'cargo_util_schemas'. — src/diagnostics/lint.rs:12
`AddOptions` (slice 'cargo') depends on `Package` from slice 'cargo_test_support'. — src/ops/cargo_add/mod.rs:59
`DependencyUI` (slice 'cargo') depends on `Dependency` from slice 'cargo_test_support'. — src/ops/cargo_add/mod.rs:1136
`Proposal` (slice 'cargo') depends on `Package` from slice 'cargo_test_support'. — src/ops/cargo_compile/unit_generator.rs:29
`InstallablePackage` (slice 'cargo') depends on `Package` from slice 'cargo_test_support'. — src/ops/cargo_install.rs:82
`DepKindInfo` (slice 'cargo') depends on `Platform` from slice 'cargo_platform'. — src/ops/cargo_metadata.rs:104
`RemoveOptions` (slice 'cargo') depends on `Package` from slice 'cargo_test_support'. — src/ops/cargo_remove.rs:12
`PackageChange` (slice 'cargo') depends on `PartialVersion` from slice 'cargo_util_schemas'. — src/ops/cargo_update.rs:676
`OwnersOptions` (slice 'cargo') depends on `REDACTED` from slice 'cargo_credential'. — src/ops/registry/cargo_owner.rs:18
`PublishOpts` (slice 'cargo') depends on `REDACTED` from slice 'cargo_credential'. — src/ops/registry/cargo_publish.rs:58
`ResolveError` (slice 'cargo') depends on `Error` from slice 'crates_io'. — src/resolver/errors.rs:19
`BacktrackFrame` (slice 'cargo') depends on `Dependency` from slice 'cargo_test_support'. — src/resolver/mod.rs:698
`VersionPreferences` (slice 'cargo') depends on `PartialVersion` from slice 'cargo_util_schemas'. — src/resolver/version_prefs.rs:33
`GitDatabase` (slice 'cargo') depends on `Repository` from slice 'cargo_test_support'. — src/sources/git/utils.rs:50
`GitCheckout` (slice 'cargo') depends on `Repository` from slice 'cargo_test_support'. — src/sources/git/utils.rs:60
`PathSource` (slice 'cargo') depends on `Package` from slice 'cargo_test_support'. — src/sources/path.rs:35
`GitRegistry` (slice 'cargo') depends on `GitReference` from slice 'cargo_util_schemas'. — src/sources/registry/git_remote.rs:49
`HttpRegistry` (slice 'cargo') depends on `RegistryConfig` from slice 'cargo_util_schemas'. — src/sources/registry/http_remote.rs:66
`IndexPackageRustVersion` (slice 'cargo') depends on `RustVersion` from slice 'cargo_util_schemas'. — src/sources/registry/index/mod.rs:233
`VerboseError` (slice 'cargo') depends on `Error` from slice 'crates_io'. — src/util/errors.rs:144
`InternalError` (slice 'cargo') depends on `Error` from slice 'crates_io'. — src/util/errors.rs:179

What to do

Keep slices independent: share cross-slice needs via an explicit contract/shared-kernel, not direct references between slices.

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.

`utils$module.fetch_with_gitoxide` is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command. — src/sources/git/utils.rs:1381

What to do

Keep query handlers read-only — move the writes/event-publishes into a command handler so reads stay safe to retry, cache, and route to a read replica.

Do you agree with this assessment?

DM4 · Rich vs anemic domain model10.0 / 10Exemplary✓ Tool-verified

Other · Domain Modelling — Whether domain entities own their behaviour (invariant-enforcing commands) rather than being data-only structs driven by a foreign service.

Method: Roslyn (DDD-gated): entity method BODIES classified mutator-vs-query — only methods that mutate the entity's own declared state count as invariant-protecting behaviour, so a getter/passthrough doesn't rescue an anemic class. Deterministic, exhaustive over domain-layer entities.

Coverage: Population: entities by name/base convention; rich-vs-anemic judged by classifying each method body mutator-vs-query — logic-bearing domain types outside the convention are invisible.

Do you agree with this assessment?

DM5 · Encapsulated state10.0 / 10Exemplary✓ Tool-verified

Other · Domain Modelling — Whether a domain type's identity-bearing field stays immutable — a `pub` mutable field under a hand-rolled Hash/PartialEq breaks the value-identity invariant.

Method: Roslyn (DDD-gated): entities scanned for publicly writable state — public setters, and (C#/VB) own mutable collections handed out through an auto-property, a public field or a bare-field expression getter, where a computed/copying getter is never charged. One finding per entity; score softened when Marten/EF rehydration frameworks present. Deterministic, framework-aware.

Coverage: Population: entities by convention; encapsulation (setter shape) checked exhaustively within the set.

Do you agree with this assessment?

M1 · Documentation (README)7.3 / 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 build/run (quick start) section to the root README — the first thing a newcomer needs.
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 10 of 28 project(s) that lack one — worth up to 0.7 pts.

Do you agree with this assessment?

M2 · Architecture documentation2.0 / 10Weak✓ 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 · Observability4.7 / 10Adequate✓ 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.

Only 3/13 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `crates/cargo-test-support`, `crates/mdman`, `crates/semver-check`, `crates/xtask-build-man` and 5 more.

What to do

Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Consider OpenTelemetry tracing/metrics (opentelemetry with tracing-opentelemetry) and a health-check endpoint (a /health route on your axum/actix router) for operability.

Do you agree with this assessment?

P3 · Security & performance tooling5.0 / 10Adequate✓ 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

Enable Dependabot/Renovate or a dependency-review gate.
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

The release job declares an environment, but its protection rules are not visible from the repository — confirm required reviewers are attached, or publish as a draft release so a bad build can be stopped before users can download it.

Do you agree with this assessment?

P6 · Release Hygiene10.0 / 10Exemplary✓ 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.

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 — and because this repository commits the configuration that serves its own HTTP surface, that configuration could be read in full for the security response headers it sets. 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.

No Content-Security-Policy / X-Frame-Options / X-Content-Type-Options configuration found — defense in depth, even when a reverse proxy could set them. This is reported because `Dockerfile` builds the web-server image that serves this application, so the configuration that would carry these headers is in this repository and was read in full. (−2.0 on this card.) — crates/cargo-test-support/containers/apache/Dockerfile:1

What to do

Set security response headers on the surface this repository serves: an `add_header` directive per header in the nginx/Caddy/Apache config, a `_headers` / `vercel.json` / `netlify.toml` entry for a static host, or `helmet()` in the HTTP server. `Content-Security-Policy` is the one that pays for itself first — it is what contains an injected script once one reaches the page — followed by `X-Content-Type-Options: nosniff` and a frame policy (`X-Frame-Options: DENY`, or CSP `frame-ancestors`). Where the app is served from a build container, the header configuration belongs in the image beside the built assets, so it ships with them rather than depending on where it lands.

Do you agree with this assessment?

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%	Adequate — gated by D2	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture	70%	Adequate — gated by AX7	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity	66%	Adequate — gated by M2	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness	66%	Strong	Largest drag on the score — prioritise here.
Security	81%	Adequate — gated by D36	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Domain Modelling	100%	Exemplary	Strongest area.
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 — 78 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 — Frontend below the scale floor (21 DOM element(s) < 25) — too little surface to assess accessibility.
AC2 Forms & labels — Frontend below the scale floor (21 DOM element(s) < 25) — too little surface to assess accessibility.
AC3 Page structure — Frontend below the scale floor (21 DOM element(s) < 25) — too little surface to assess accessibility.
AC4 Keyboard semantics — Frontend below the scale floor (21 DOM element(s) < 25) — too little surface to assess accessibility.
AC5 ARIA correctness — Frontend below the scale floor (21 DOM element(s) < 25) — too little surface to assess accessibility.
AC6 Visual & motion safety — Frontend below the scale floor (21 DOM element(s) < 25) — too little surface to assess accessibility.
AC7 A11y enforcement — Frontend below the scale floor (21 DOM element(s) < 25) — too little surface to assess accessibility.
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
AX4 Dependency direction — not applicable to a vertical-slice architecture (the inward-dependency rule is for layered/clean styles)
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
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 — ~190301 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 — 29 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.
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. 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
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.
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.
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 .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 Aggregate boundaries — this Rust crate declares no domain aggregate (a struct with private state and its own command methods), so DM1's aggregate-boundary read has no population to be taken over
DM2 Strongly-typed ids — the crate defines newtype typed-ids but declares no domain aggregate that could carry an id — so DM2's adoption ratio has no population to be taken over
DM3 Integration-event coupling — not scored — a domain type leaking across a crate boundary cannot be told apart from source alone from a legitimate shared-kernel crate. Reported as guidance rather than measured
DM6 Domain ↔ infrastructure boundary — this Rust crate maps no type to a persistence framework (diesel/sea-orm/sqlx), so DM6's domain↔infrastructure fusion read has no population to be taken over
DM7 Repository granularity — not scored — detecting 'a repository per CHILD entity' needs the aggregate-root structure, which is not resolvable from source alone here. Reported as guidance rather than measured
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.
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
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, Python, 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 — 6 finding(s)

D28 · Secrets (history) · REDACTED · ×4

REDACTED
REDACTED
REDACTED
REDACTED

AX9 · CQS / query purity · Query writes persistent state on the read path · ×1

Query writes persistent state on the read path: utils$module.fetch_with_gitoxide src/sources/git/utils.rs:1381 — `utils$module.fetch_with_gitoxide` is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command.

D35 · Change Coupling · Boundary-crossing change coupling · ×1

Boundary-crossing change coupling: lib.rs ↔ directory.rs crates/resolver-tests/src/lib.rs — `crates/resolver-tests/src/lib.rs` (context crates) and `src/sources/directory.rs` (context sources) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — 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) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `dfc9401d` refactor: parameterize version requirement matching; `b45ca32b` refactor(source): Rename AlternativeVersions to RejectedVersions (at that commit the file was still `src/cargo/sources/directory.rs`); `d2fcf6b1` fix(resolver): Report unmatched versions, rather than saying no package (at that commit the file was still `src/cargo/sources/directory.rs`) — run `git show` on any of them.

Serious — 679 finding(s)

D2 · Cognitive Complexity · cargo · ×132

cargo::ops::cargo_clean::clean_specs (cognitive 116) src/ops/cargo_clean.rs:188 — cargo::ops::cargo_clean::clean_specs has cognitive complexity 116 (threshold 15). Drivers by points: loops 14 (53 pts), if/else 16 (49 pts), match/switch 4 (10 pts), boolean chains 4 (nesting depth added 78). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
cargo::resolver::errors::activation_error (cognitive 81) src/resolver/errors.rs:77 — cargo::resolver::errors::activation_error has cognitive complexity 81 (threshold 15). Drivers by points: if/else 30 (53 pts), match/switch 6 (14 pts), loops 5 (12 pts), boolean chains 2 (nesting depth added 38). 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.
cargo::ops::cargo_vendor::sync (cognitive 78) src/ops/cargo_vendor.rs:120 — cargo::ops::cargo_vendor::sync has cognitive complexity 78 (threshold 15). Drivers by points: if/else 28 (56 pts), loops 8 (12 pts), match/switch 2 (7 pts), boolean chains 3 (nesting depth added 37). 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.
cargo::ops::cargo_compile::create_bcx (cognitive 74) src/ops/cargo_compile/mod.rs:251 — cargo::ops::cargo_compile::create_bcx has cognitive complexity 74 (threshold 15). Drivers by points: if/else 32 (51 pts), loops 7 (11 pts), boolean chains 9, match/switch 3 (nesting depth added 23). 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.
cargo::resolver::activate_deps_loop (cognitive 71) src/resolver/mod.rs:195 — cargo::resolver::activate_deps_loop has cognitive complexity 71 (threshold 15). Drivers by points: if/else 15 (53 pts), match/switch 3 (8 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 44). 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.
cargo::workspace::summary::build_feature_map (cognitive 69) src/workspace/summary.rs:201 — cargo::workspace::summary::build_feature_map has cognitive complexity 69 (threshold 15). Drivers by points: if/else 16 (56 pts), loops 4 (5 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 43). 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.
cargo::ops::cargo_add::add (cognitive 66) src/ops/cargo_add/mod.rs:75 — cargo::ops::cargo_add::add has cognitive complexity 66 (threshold 15). Drivers by points: if/else 24 (58 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 37). 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.
cargo::ops::cargo_add::resolve_dependency (cognitive 66) src/ops/cargo_add/mod.rs:343 — cargo::ops::cargo_add::resolve_dependency has cognitive complexity 66 (threshold 15). Drivers by points: if/else 35 (64 pts), boolean chains 2 (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.
cargo::workspace::parser::to_real_manifest (cognitive 65) src/workspace/parser/mod.rs:1301 — cargo::workspace::parser::to_real_manifest has cognitive complexity 65 (threshold 15). Drivers by points: if/else 36 (55 pts), boolean chains 5, loops 3, match/switch 2 (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.
cargo::ops::registry::cargo_publish::publish (cognitive 65) src/ops/registry/cargo_publish.rs:72 — cargo::ops::registry::cargo_publish::publish has cognitive complexity 65 (threshold 15). Drivers by points: if/else 27 (55 pts), loops 5 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 30). 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.
cargo::resolver::encode::into_resolve (cognitive 60) src/resolver/encode.rs:136 — cargo::resolver::encode::into_resolve has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (40 pts), loops 9 (10 pts), match/switch 5 (7 pts), boolean chains 3 (nesting depth added 19). Of this number, 54 points are the body's own statements and 6 belong to one function item inside it that branches. 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.
cargo::compiler::build_base_args (cognitive 55) src/compiler/mod.rs:1304 — cargo::compiler::build_base_args has cognitive complexity 55 (threshold 15). Drivers by points: if/else 34 (44 pts), boolean chains 7, loops 1 (2 pts), match/switch 2 (nesting depth added 11). 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.
cargo::compiler::custom_build::build_work (cognitive 55) src/compiler/custom_build.rs:332 — cargo::compiler::custom_build::build_work has cognitive complexity 55 (threshold 15). Drivers by points: if/else 33 (41 pts), loops 6 (7 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 10). 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.
cargo::compiler::on_stderr_line_inner (cognitive 50) src/compiler/mod.rs:2123 — cargo::compiler::on_stderr_line_inner has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (41 pts), boolean chains 5, loops 1 (2 pts), match/switch 2 (nesting depth added 20). 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.
cargo::ops::cargo_tree::graph::add_pkg (cognitive 49) src/ops/cargo_tree/graph.rs:406 — cargo::ops::cargo_tree::graph::add_pkg has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 3 (7 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 23). 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.
cargo::bin::cargo::commands::install::exec (cognitive 47) src/bin/cargo/commands/install.rs:110 — cargo::bin::cargo::commands::install::exec has cognitive complexity 47 (threshold 15). Drivers by points: if/else 24 (38 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (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.
cargo::ops::resolve::register_previous_locks (cognitive 46) src/ops/resolve.rs:595 — cargo::ops::resolve::register_previous_locks has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 7 (10 pts), boolean chains 4 (nesting depth added 20). Of this number, 44 points are the body's own statements and 2 belong to one function item inside it that branches. 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.
cargo::diagnostics::rules::unused_dependencies::lint_package_build_results (cognitive 46) src/diagnostics/rules/unused_dependencies.rs:223 — cargo::diagnostics::rules::unused_dependencies::lint_package_build_results has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 28). 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.
cargo::compiler::fingerprint::find_stale_file (cognitive 46) src/compiler/fingerprint/mod.rs:2104 — cargo::compiler::fingerprint::find_stale_file has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (36 pts), match/switch 4 (9 pts), loops 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.
cargo::ops::cargo_fix::migrate_manifests (cognitive 45) src/ops/cargo_fix/mod.rs:320 — cargo::ops::cargo_fix::migrate_manifests has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 23). 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.
cargo::sources::git::utils::with_authentication (cognitive 45) src/sources/git/utils.rs:644 — cargo::sources::git::utils::with_authentication has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (38 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 20). 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.
cargo::bin::cargo::commands::remove::gc_workspace (cognitive 44) src/bin/cargo/commands/remove.rs:166 — cargo::bin::cargo::commands::remove::gc_workspace has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 5 (14 pts), boolean chains 1 (nesting depth added 28). 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.
cargo::workspace::parser::dep_to_dependency (cognitive 42) src/workspace/parser/mod.rs:2276 — cargo::workspace::parser::dep_to_dependency has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (31 pts), loops 3 (6 pts), boolean chains 3, match/switch 2 (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.
cargo::ops::cargo_new::mk (cognitive 40) src/ops/cargo_new.rs:724 — cargo::ops::cargo_new::mk has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 2, match/switch 2 (nesting depth added 20). 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.
cargo::compiler::rustc (cognitive 39) src/compiler/mod.rs:309 — cargo::compiler::rustc has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (35 pts), loops 9 (16 pts), boolean chains 5, match/switch 3 (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. This shape REPEATS in the file: one other method here (cargo::compiler::rustc::add_native_deps) 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.
+ 107 more in this group — see findings.md.

D1 · Cyclomatic Complexity · cargo · ×58

cargo::ops::cargo_compile::create_bcx (cyclomatic 47) src/ops/cargo_compile/mod.rs:251 — cargo::ops::cargo_compile::create_bcx has cyclomatic complexity 47 (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.
cargo::resolver::errors::activation_error (cyclomatic 46) src/resolver/errors.rs:77 — cargo::resolver::errors::activation_error 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.
cargo::workspace::parser::to_real_manifest (cyclomatic 45) src/workspace/parser/mod.rs:1301 — cargo::workspace::parser::to_real_manifest has cyclomatic complexity 45 (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.
cargo::compiler::build_base_args (cyclomatic 42) src/compiler/mod.rs:1304 — cargo::compiler::build_base_args has cyclomatic complexity 42 (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.
cargo::resolver::encode::into_resolve (cyclomatic 41) src/resolver/encode.rs:136 — cargo::resolver::encode::into_resolve has cyclomatic complexity 41 (threshold 15). Of this number, 36 points are the body's own statements and 5 belong to one function item inside it that branches. 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.
cargo::compiler::rustc (cyclomatic 40) src/compiler/mod.rs:309 — cargo::compiler::rustc has cyclomatic complexity 40 (threshold 15). Of this number, 29 points are the body's own statements and 11 belong to one function item inside it that branches. 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.
cargo::compiler::custom_build::build_work (cyclomatic 40) src/compiler/custom_build.rs:332 — cargo::compiler::custom_build::build_work has cyclomatic complexity 40 (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.
cargo::ops::cargo_clean::clean_specs (cyclomatic 38) src/ops/cargo_clean.rs:188 — cargo::ops::cargo_clean::clean_specs has cyclomatic complexity 38 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
cargo::ops::cargo_vendor::sync (cyclomatic 37) src/ops/cargo_vendor.rs:120 — cargo::ops::cargo_vendor::sync has cyclomatic complexity 37 (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.
cargo::ops::cargo_add::resolve_dependency (cyclomatic 32) src/ops/cargo_add/mod.rs:343 — cargo::ops::cargo_add::resolve_dependency 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.
cargo::compiler::on_stderr_line_inner (cyclomatic 30) src/compiler/mod.rs:2123 — cargo::compiler::on_stderr_line_inner 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.
cargo::resolver::activate_deps_loop (cyclomatic 30) src/resolver/mod.rs:195 — cargo::resolver::activate_deps_loop 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.
cargo::ops::cargo_tree::graph::add_pkg (cyclomatic 29) src/ops/cargo_tree/graph.rs:406 — cargo::ops::cargo_tree::graph::add_pkg 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.
cargo::ops::registry::cargo_publish::publish (cyclomatic 28) src/ops/registry/cargo_publish.rs:72 — cargo::ops::registry::cargo_publish::publish 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.
cargo::workspace::parser::dep_to_dependency (cyclomatic 27) src/workspace/parser/mod.rs:2276 — cargo::workspace::parser::dep_to_dependency 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.
cargo::workspace::parser::prepare_toml_for_publish (cyclomatic 27) src/workspace/parser/mod.rs:3036 — cargo::workspace::parser::prepare_toml_for_publish has cyclomatic complexity 27 (threshold 15). Of this number, 16 points are the body's own statements and 11 belong to 4 function items inside it that branch. 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.
cargo::workspace::summary::build_feature_map (cyclomatic 26) src/workspace/summary.rs:201 — cargo::workspace::summary::build_feature_map 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.
cargo::ops::resolve::register_previous_locks (cyclomatic 26) src/ops/resolve.rs:595 — cargo::ops::resolve::register_previous_locks has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body's own statements and 2 belong to one function item inside it that branches. 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.
cargo::ops::cargo_add::add (cyclomatic 26) src/ops/cargo_add/mod.rs:75 — cargo::ops::cargo_add::add 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.
cargo::bin::cargo::commands::install::exec (cyclomatic 26) src/bin/cargo/commands/install.rs:110 — cargo::bin::cargo::commands::install::exec 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.
cargo::sources::git::utils::with_authentication (cyclomatic 26) src/sources/git/utils.rs:644 — cargo::sources::git::utils::with_authentication 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.
cargo::ops::cargo_report::timings::prepare_context (cyclomatic 25) src/ops/cargo_report/timings.rs:135 — cargo::ops::cargo_report::timings::prepare_context 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.
cargo::workspace::profiles::merge_profile (cyclomatic 24) src/workspace/profiles.rs:537 — cargo::workspace::profiles::merge_profile 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.
cargo::bin::cargo::commands::tree::parse_edge_kinds (cyclomatic 22) src/bin/cargo/commands/tree.rs:270 — cargo::bin::cargo::commands::tree::parse_edge_kinds has cyclomatic complexity 22 (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.
cargo::ops::cargo_new::mk (cyclomatic 21) src/ops/cargo_new.rs:724 — cargo::ops::cargo_new::mk 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.
+ 33 more in this group — see findings.md.

D17 · Explicit Debt · TodoComment · ×50

TodoComment crates/cargo-test-support/src/lib.rs:1015 — // TODO avoid unwrap — 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 crates/cargo-test-support/src/lib.rs:1022 — // TODO avoid unwrap — 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 crates/crates-io/lib.rs:224 — /// 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 crates/mdman/src/format/text.rs:616 — // todo: word.len() > width — 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 src/compiler/unit_dependencies.rs:223 — // TODO: Does this `public` make sense? — 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 src/compiler/standard_lib.rs:60 — // TODO: Consider doing something to enforce --locked? Or to prevent 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 src/compiler/compilation.rs:383 — // TODO: handle doctest-xcompile — 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 src/compiler/build_runner/compilation_files.rs:990 — // - TODO: Maybe use `-install-name` on macOS or `-soname` on other UNIX systems — 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 src/compiler/build_runner/compilation_files.rs:1039 — // - TODO: Maybe use `-install-name` on macOS or `-soname` on other UNIX systems — 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 src/compiler/fingerprint/mod.rs:910 — // TODO: `std::env::var` is allowed at this moment. Should figure out — 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 src/compiler/fingerprint/mod.rs:2204 — // TODO: fix #5918.
TodoComment src/context/de.rs:740 — // TODO: We might want to warn unused fields, — 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 src/ops/resolve.rs:691 — // TODO: this breaks adding an optional dependency in 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 src/ops/cargo_update.rs:114 — // TODO: see comment in `resolve.rs` as well, but this — 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 src/ops/cargo_update.rs:162 — // TODO: this seems like a hokey reason to single out the registry as being — 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 src/ops/cargo_test.rs:384 — // TODO: This could be improved by combining the flags on a single line when feasible. — 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 src/ops/cargo_metadata.rs:94 — // TODO(bindeps): after -Zbindeps gets stabilized, — 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 src/ops/cargo_metadata.rs:112 — // TODO(bindeps): Remove `Option` after -Zbindeps get stabilized. — 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 src/ops/cargo_metadata.rs:135 — // TODO: Without --filter-platform, features are being resolved for `host` only. — 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 src/ops/cargo_metadata.rs:268 — // TODO(bindeps): Cargo shouldn't have `extern_name` field — 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 src/ops/cargo_config.rs:295 — // TODO: It might be a good idea to teach the Config loader to support — 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 src/ops/cargo_clean.rs:447 — // TODO: what to do about build_script_build? — 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 src/ops/cargo_compile/mod.rs:523 — // TODO: In theory, Cargo should also dedupe the roots, but I'm uncertain — 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 src/ops/cargo_fix/mod.rs:990 — // TODO: implement a way to specify this. — 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 src/ops/cargo_tree/mod.rs:148 — // TODO: Target::All is broken with -Zfeatures=itarget. To handle that properly, — 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.
+ 25 more in this group — see findings.md.

D3 · God Classes · FileTooLong · ×41

FileTooLong: parser/mod.rs src/workspace/parser/mod.rs — FileTooLong — 2584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 54 free functions. The bar is 500 significant lines; this is 2084 over it, 5.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: compiler/mod.rs src/compiler/mod.rs — FileTooLong — 1576 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 41 free functions. The bar is 500 significant lines; this is 1076 over it, 3.15× 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: context/mod.rs src/context/mod.rs — FileTooLong — 1421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 77% of them inside a single declaration: GlobalContext (2 blocks, 208-2159). The bar is 500 significant lines; this is 921 over it, 2.84× 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: workspace/workspace.rs src/workspace/workspace.rs — FileTooLong — 1369 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 75% of them inside a single declaration: Workspace (2 blocks, 50-1842). The bar is 500 significant lines; this is 869 over it, 2.74× 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: manifest/mod.rs crates/cargo-util-schemas/src/manifest/mod.rs — FileTooLong — 1163 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 663 over it, 2.33× 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: workspace/global_cache_tracker.rs src/workspace/global_cache_tracker.rs — FileTooLong — 1121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 65% of them inside a single declaration: GlobalCacheTracker (2 blocks, 335-1358). The bar is 500 significant lines; this is 621 over it, 2.24× 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: git/utils.rs src/sources/git/utils.rs — FileTooLong — 1055 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 555 over it, 2.11× 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: util/command_prelude.rs src/util/command_prelude.rs — FileTooLong — 1051 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 551 over it, 2.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: fingerprint/mod.rs src/compiler/fingerprint/mod.rs — FileTooLong — 1017 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 517 over it, 2.03× 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: cargo_add/mod.rs src/ops/cargo_add/mod.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: parser/targets.rs src/workspace/parser/targets.rs — FileTooLong — 911 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 41 free functions. The bar is 500 significant lines; this is 411 over it, 1.82× 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: workspace/features.rs src/workspace/features.rs — FileTooLong — 898 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 398 over it, 1.80× 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: compiler/custom_build.rs src/compiler/custom_build.rs — FileTooLong — 860 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 360 over it, 1.72× 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: cargo_package/mod.rs src/ops/cargo_package/mod.rs — FileTooLong — 847 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 347 over it, 1.69× 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: cargo_fix/mod.rs src/ops/cargo_fix/mod.rs — FileTooLong — 827 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 327 over it, 1.65× 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: workspace/manifest.rs src/workspace/manifest.rs — FileTooLong — 805 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 305 over it, 1.61× 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: cargo_compile/mod.rs src/ops/cargo_compile/mod.rs — FileTooLong — 789 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 289 over it, 1.58× 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: workspace/profiles.rs src/workspace/profiles.rs — FileTooLong — 782 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 282 over it, 1.56× 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: compiler/unit_dependencies.rs src/compiler/unit_dependencies.rs — FileTooLong — 731 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 231 over it, 1.46× 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: ops/cargo_update.rs src/ops/cargo_update.rs — FileTooLong — 727 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 227 over it, 1.45× 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: ops/cargo_install.rs src/ops/cargo_install.rs — FileTooLong — 711 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 211 over it, 1.42× 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: job_queue/mod.rs src/compiler/job_queue/mod.rs — FileTooLong — 710 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 69% of them inside a single declaration: DrainState (2 blocks, 173-1308). The bar is 500 significant lines; this is 210 over it, 1.42× 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: sources/path.rs src/sources/path.rs — FileTooLong — 697 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 197 over it, 1.39× 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: ops/cargo_new.rs src/ops/cargo_new.rs — FileTooLong — 679 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 179 over it, 1.36× 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: editor/dependency.rs src/workspace/editor/dependency.rs — FileTooLong — 657 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 70% of them inside a single declaration: Dependency (6 blocks, 25-730). The bar is 500 significant lines; this is 157 over it, 1.31× 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.
+ 16 more in this group — see findings.md.

AX7 · Slice cohesion · Cross-slice coupling · ×40

Cross-slice coupling: cargo_test_support → cargo_util crates/cargo-test-support/src/lib.rs:625 — `Execs` (slice 'cargo_test_support') depends on `ProcessBuilder` from slice 'cargo_util'.
Cross-slice coupling: cargo_util → cargo crates/cargo-util/src/process_builder.rs:20 — `ProcessBuilder` (slice 'cargo_util') depends on `Client` from slice 'cargo'.
Cross-slice coupling: cargo_util_schemas → cargo crates/cargo-util-schemas/src/manifest/mod.rs:127 — `TomlWorkspace` (slice 'cargo_util_schemas') depends on `Value` from slice 'cargo'.
Cross-slice coupling: cargo_util_schemas → cargo crates/cargo-util-schemas/src/manifest/mod.rs:179 — `TomlPackage` (slice 'cargo_util_schemas') depends on `Value` from slice 'cargo'.
Cross-slice coupling: cargo_util_schemas → mdman crates/cargo-util-schemas/src/manifest/mod.rs:1675 — `TomlLintConfig` (slice 'cargo_util_schemas') depends on `Table` from slice 'mdman'.
Cross-slice coupling: cargo_util_schemas → cargo crates/cargo-util-schemas/src/manifest/mod.rs:1700 — `Hints` (slice 'cargo_util_schemas') depends on `Value` from slice 'cargo'.
Cross-slice coupling: resolver_tests → cargo crates/resolver-tests/src/lib.rs:224 — `PrettyPrintRegistry` (slice 'resolver_tests') depends on `Summary` from slice 'cargo'.
Cross-slice coupling: cargo → cargo_util src/compiler/build_config.rs:15 — `BuildConfig` (slice 'cargo') depends on `ProcessBuilder` from slice 'cargo_util'.
Cross-slice coupling: cargo → cargo_util src/compiler/build_context/target_info.rs:38 — `TargetInfo` (slice 'cargo') depends on `ProcessBuilder` from slice 'cargo_util'.
Cross-slice coupling: cargo → cargo_util src/compiler/compilation.rs:75 — `Compilation` (slice 'cargo') depends on `ProcessBuilder` from slice 'cargo_util'.
Cross-slice coupling: cargo → crates_io src/compiler/job_queue/mod.rs:268 — `ErrorToHandle` (slice 'cargo') depends on `Error` from slice 'crates_io'.
Cross-slice coupling: cargo → cargo_platform src/compiler/mod.rs:2068 — `ManifestErrorContext` (slice 'cargo') depends on `Cfg` from slice 'cargo_platform'.
Cross-slice coupling: cargo → crates_io src/compiler/timings/report.rs:90 — `RenderContext` (slice 'cargo') depends on `Error` from slice 'crates_io'.
Cross-slice coupling: cargo → cargo_test_support src/compiler/unit.rs:59 — `UnitInner` (slice 'cargo') depends on `Package` from slice 'cargo_test_support'.
Cross-slice coupling: cargo → cargo_test_support src/compiler/unused_deps.rs:178 — `ExternState` (slice 'cargo') depends on `Dependency` from slice 'cargo_test_support'.
Cross-slice coupling: cargo → crates_io src/context/error.rs:10 — `ConfigError` (slice 'cargo') depends on `Error` from slice 'crates_io'.
Cross-slice coupling: cargo → cargo_credential src/context/mod.rs:199 — `CredentialCacheValue` (slice 'cargo') depends on `REDACTED` from slice 'cargo_credential'.
Cross-slice coupling: cargo → cargo_util_terminal src/context/mod.rs:208 — `GlobalContext` (slice 'cargo') depends on `Shell` from slice 'cargo_util_terminal'.
Cross-slice coupling: cargo → cargo_util_schemas src/context/schema.rs:409 — `CargoBuildConfig` (slice 'cargo') depends on `ProfileName` from slice 'cargo_util_schemas'.
Cross-slice coupling: cargo → cargo_util_schemas src/diagnostics/lint.rs:12 — `Lint` (slice 'cargo') depends on `RustVersion` from slice 'cargo_util_schemas'.
Cross-slice coupling: cargo → cargo_test_support src/ops/cargo_add/mod.rs:59 — `AddOptions` (slice 'cargo') depends on `Package` from slice 'cargo_test_support'.
Cross-slice coupling: cargo → cargo_test_support src/ops/cargo_add/mod.rs:1136 — `DependencyUI` (slice 'cargo') depends on `Dependency` from slice 'cargo_test_support'.
Cross-slice coupling: cargo → cargo_test_support src/ops/cargo_compile/unit_generator.rs:29 — `Proposal` (slice 'cargo') depends on `Package` from slice 'cargo_test_support'.
Cross-slice coupling: cargo → cargo_test_support src/ops/cargo_install.rs:82 — `InstallablePackage` (slice 'cargo') depends on `Package` from slice 'cargo_test_support'.
Cross-slice coupling: cargo → cargo_platform src/ops/cargo_metadata.rs:104 — `DepKindInfo` (slice 'cargo') depends on `Platform` from slice 'cargo_platform'.
+ 15 more in this group — see findings.md.

D3 · God Classes · FunctionTooLong · ×32

FunctionTooLong: cargo::workspace::parser::to_real_manifest src/workspace/parser/mod.rs:1301 — FunctionTooLong — cargo::workspace::parser::to_real_manifest runs 512 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 412 over it, 5.12× 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: cargo::ops::cargo_compile::create_bcx src/ops/cargo_compile/mod.rs:251 — FunctionTooLong — cargo::ops::cargo_compile::create_bcx runs 323 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 223 over it, 3.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.
FunctionTooLong: cargo::resolver::errors::activation_error src/resolver/errors.rs:77 — FunctionTooLong — cargo::resolver::errors::activation_error runs 319 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 219 over it, 3.19× 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: cargo::workspace::parser::normalize_toml src/workspace/parser/mod.rs:310 — FunctionTooLong — cargo::workspace::parser::normalize_toml runs 269 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 169 over it, 2.69× 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: cargo::compiler::custom_build::build_work src/compiler/custom_build.rs:332 — FunctionTooLong — cargo::compiler::custom_build::build_work runs 267 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 167 over it, 2.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: cargo::workspace::parser::prepare_toml_for_publish src/workspace/parser/mod.rs:3036 — FunctionTooLong — cargo::workspace::parser::prepare_toml_for_publish runs 230 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 130 over it, 2.30× 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: cargo::ops::registry::cargo_publish::publish src/ops/registry/cargo_publish.rs:72 — FunctionTooLong — cargo::ops::registry::cargo_publish::publish runs 218 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 118 over it, 2.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.
FunctionTooLong: cargo::workspace::parser::normalize_package_toml src/workspace/parser/mod.rs:640 — FunctionTooLong — cargo::workspace::parser::normalize_package_toml runs 198 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 98 over it, 1.98× 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: cargo::ops::cargo_vendor::sync src/ops/cargo_vendor.rs:120 — FunctionTooLong — cargo::ops::cargo_vendor::sync runs 197 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 97 over it, 1.97× 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: cargo::resolver::activate_deps_loop src/resolver/mod.rs:195 — FunctionTooLong — cargo::resolver::activate_deps_loop 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.
FunctionTooLong: cargo::ops::cargo_clean::clean_specs src/ops/cargo_clean.rs:188 — FunctionTooLong — cargo::ops::cargo_clean::clean_specs runs 178 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 78 over it, 1.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.
FunctionTooLong: cargo::ops::cargo_add::add src/ops/cargo_add/mod.rs:75 — FunctionTooLong — cargo::ops::cargo_add::add 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: cargo::resolver::encode::into_resolve src/resolver/encode.rs:136 — FunctionTooLong — cargo::resolver::encode::into_resolve runs 159 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 59 over it, 1.59× 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: cargo::bin::cargo::commands::add::cli src/bin/cargo/commands/add.rs:16 — FunctionTooLong — cargo::bin::cargo::commands::add::cli runs 144 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 44 over it, 1.44× 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: cargo::ops::cargo_add::resolve_dependency src/ops/cargo_add/mod.rs:343 — FunctionTooLong — cargo::ops::cargo_add::resolve_dependency runs 144 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 44 over it, 1.44× 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: cargo::sources::git::known_hosts::certificate_check src/sources/git/known_hosts.rs:151 — FunctionTooLong — cargo::sources::git::known_hosts::certificate_check 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: cargo::ops::resolve::resolve_ws_with_opts src/ops/resolve.rs:152 — FunctionTooLong — cargo::ops::resolve::resolve_ws_with_opts runs 141 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 41 over it, 1.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: cargo::bin::cargo::cli::cli src/bin/cargo/cli.rs:569 — FunctionTooLong — cargo::bin::cargo::cli::cli 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.
FunctionTooLong: cargo::diagnostics::rules::non_kebab_case_bins::lint_package_inner src/diagnostics/rules/non_kebab_case_bins.rs:84 — FunctionTooLong — cargo::diagnostics::rules::non_kebab_case_bins::lint_package_inner 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.
FunctionTooLong: cargo::ops::cargo_new::mk src/ops/cargo_new.rs:724 — FunctionTooLong — cargo::ops::cargo_new::mk 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.
FunctionTooLong: cargo::ops::cargo_install::install src/ops/cargo_install.rs:708 — FunctionTooLong — cargo::ops::cargo_install::install runs 116 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 16 over it, 1.16× 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: cargo::sources::git::utils::with_authentication src/sources/git/utils.rs:644 — FunctionTooLong — cargo::sources::git::utils::with_authentication runs 115 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 15 over it, 1.15× 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: cargo::ops::registry::cargo_info::view::pretty_view src/ops/registry/cargo_info/view.rs:15 — FunctionTooLong — cargo::ops::registry::cargo_info::view::pretty_view runs 113 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 13 over it, 1.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: cargo::compiler::future_incompat::save_and_display_report src/compiler/future_incompat.rs:372 — FunctionTooLong — cargo::compiler::future_incompat::save_and_display_report runs 112 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 12 over it, 1.12× 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: cargo::workspace::summary::build_feature_map src/workspace/summary.rs:201 — FunctionTooLong — cargo::workspace::summary::build_feature_map runs 112 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 12 over it, 1.12× 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.
+ 7 more in this group — see findings.md.

D17 · Explicit Debt · HackComment · ×22

HackComment crates/build-rs/src/lib.rs:8 — // HACK: deferred resoling this — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/build-rs/src/lib.rs:9 — // HACK: deferred resoling this — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/cargo-util-schemas/src/schema.rs:16 — // HACK: this is both more and less permissive than `TomlValue` but its close — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/cargo-util-schemas/src/core/partial_version.rs:89 — // HACK: Leverage `VersionReq` for partial version parsing — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/cargo-util/src/paths.rs:453 — //HACK: avoid reading `~/.cargo/config` when testing Cargo itself. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/xtask-lint-docs/src/main.rs:135 — // HACK: `default` is a secondary group without its own level — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/compiler/compilation.rs:378 — // HACK: `rustdoc --test` not only compiles but executes doctests. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/compiler/compilation.rs:382 — // hack is added for both phases. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/compiler/build_context/target_info.rs:263 — // HACK: abuse `--print=crate-name` to use `___` as a delimiter. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/compiler/build_runner/compilation_files.rs:834 — // HACK: This is a temporary hack for fixing rust-lang/cargo#14253 — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/compiler/build_runner/compilation_files.rs:892 — /// HACK: Detect the *potential* presence of `--remap-path-prefix` — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/ops/cargo_vendor.rs:492 — /// HACK: Perform the bare minimum of `prepare_for_publish` needed for #14348. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/ops/cargo_fix/mod.rs:325 — // HACK: Duplicate workspace migration logic between virtual manifests and real manifests to — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/ops/cargo_fix/mod.rs:359 — // HACK: As workspace migration is a special case, only report it if something — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/resolver/errors.rs:273 — // HACK: If this was a real candidate, we wouldn't hit this case. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/resolver/errors.rs:287 — // HACK: technically its unsupported and we shouldn't make assumptions — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/resolver/dep_cache.rs:215 — /// HACK: `first_version` is not kept in the cache key is it is 1:1 with — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/sources/git/utils.rs:921 — // Hack: libgit2 disallows overriding the error from check_cb since v1.8.0, — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/sources/registry/mod.rs:776 — // HACK: While source knows nothing about yank policy, — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment src/workspace/parser/embedded.rs:35 — // HACK: Since frontmatter open isn't valid TOML, we insert a comment — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment tests/build-std/main.rs:141 — // HACK: use an isolated the isolated CARGO_HOME environment (`build_std_isolated`) — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment tests/testsuite/cache_messages.rs:72 — // Hack for issue in fwdansi 1.1. It is squashing multiple resets — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.

D15 · Churn × Complexity Hotspots · Hotspot · ×19

Hotspot: src/compiler/mod.rs src/compiler/mod.rs:1304 — src/compiler/mod.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in cargo::compiler::build_base_args at line 1304. 3 of those changes were fix/bug commits, and the other 22 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/compiler/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: src/workspace/parser/mod.rs src/workspace/parser/mod.rs:1301 — src/workspace/parser/mod.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in cargo::workspace::parser::to_real_manifest at line 1301. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/workspace/parser/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: src/workspace/features.rs src/workspace/features.rs:474 — src/workspace/features.rs changed 19 times in last 90 days, max cyclomatic complexity 31 in Features::status at line 474. 2 of those changes were fix/bug commits, and the other 17 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/workspace/features.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: src/ops/cargo_compile/mod.rs src/ops/cargo_compile/mod.rs:251 — src/ops/cargo_compile/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in cargo::ops::cargo_compile::create_bcx at line 251. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/ops/cargo_compile/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: src/ops/resolve.rs src/ops/resolve.rs:595 — src/ops/resolve.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in cargo::ops::resolve::register_previous_locks at line 595. 4 of those changes were fix/bug commits, and the other 11 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/ops/resolve.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: src/ops/cargo_clean.rs src/ops/cargo_clean.rs:188 — src/ops/cargo_clean.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in cargo::ops::cargo_clean::clean_specs at line 188. 3 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/ops/cargo_clean.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: src/compiler/custom_build.rs src/compiler/custom_build.rs:332 — src/compiler/custom_build.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in cargo::compiler::custom_build::build_work at line 332. 3 of those changes were fix/bug commits, and the other 5 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/compiler/custom_build.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: src/ops/cargo_add/mod.rs src/ops/cargo_add/mod.rs:343 — src/ops/cargo_add/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in cargo::ops::cargo_add::resolve_dependency at line 343. 2 of those changes were fix/bug commits, and the other 8 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/ops/cargo_add/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: src/compiler/compilation.rs src/compiler/compilation.rs:367 — src/compiler/compilation.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Compilation::fill_env at line 367. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/compiler/compilation.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: src/compiler/fingerprint/mod.rs src/compiler/fingerprint/mod.rs:1578 — src/compiler/fingerprint/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in cargo::compiler::fingerprint::calculate_normal at line 1578. 1 of those changes was a fix/bug commit, and the other 11 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/compiler/fingerprint/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: src/compiler/build_context/target_info.rs src/compiler/build_context/target_info.rs:174 — src/compiler/build_context/target_info.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TargetInfo::new at line 174. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/compiler/build_context/target_info.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: src/resolver/errors.rs src/resolver/errors.rs:77 — src/resolver/errors.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in cargo::resolver::errors::activation_error at line 77. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/resolver/errors.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: src/sources/registry/mod.rs src/sources/registry/mod.rs:678 — src/sources/registry/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in RegistrySource::query at line 678. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/sources/registry/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: src/ops/cargo_vendor.rs src/ops/cargo_vendor.rs:120 — src/ops/cargo_vendor.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in cargo::ops::cargo_vendor::sync at line 120. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/ops/cargo_vendor.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: src/ops/cargo_tree/graph.rs src/ops/cargo_tree/graph.rs:406 — src/ops/cargo_tree/graph.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in cargo::ops::cargo_tree::graph::add_pkg at line 406. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/ops/cargo_tree/graph.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: src/ops/cargo_report/timings.rs src/ops/cargo_report/timings.rs:135 — src/ops/cargo_report/timings.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in cargo::ops::cargo_report::timings::prepare_context at line 135. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/ops/cargo_report/timings.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: src/util/frontmatter.rs src/util/frontmatter.rs:23 — src/util/frontmatter.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in ScriptSource::parse at line 23. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/util/frontmatter.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: src/workspace/registry.rs src/workspace/registry.rs:667 — src/workspace/registry.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PackageRegistry::query at line 667. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/workspace/registry.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: src/compiler/unused_deps.rs src/compiler/unused_deps.rs:23 — src/compiler/unused_deps.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in UnusedDepState::new at line 23. 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-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/compiler/unused_deps.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 · ×18

FixmeComment crates/cargo-util/src/paths.rs:631 — // FIXME: This should probably panic or have a copy fallback. Symlinks — 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 src/compiler/custom_build.rs:448 — // FIXME: We should handle raw-idents somehow instead of pretending they — 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 src/compiler/fingerprint/mod.rs:576 — // FIXME: it's basically buggy that we pass `None` to `call_box` — 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 src/compiler/fingerprint/mod.rs:1831 — /// FIXME(#6779) - see all the words above
FixmeComment src/compiler/fingerprint/mod.rs:1876 — // FIXME: this is somewhat buggy with respect to docker and — 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 src/ops/cargo_clean.rs:94 — // FIXME: https://github.com/rust-lang/cargo/issues/8790
FixmeComment src/ops/cargo_fix/mod.rs:776 — // FIXME: The error message here is not correct with --broken-code. — 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 src/ops/cargo_package/verify.rs:87 — // FIXME: Turn this on at some point in the future — 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 src/resolver/features.rs:844 — // FIXME: this needs to interact with the `default-target` — 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 src/sources/git/known_hosts.rs:486 — // FIXME: Ideally the error message should include the IP address of 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.
FixmeComment tests/testsuite/workspaces.rs:2187 — // FIXME: this fails because of how workspace.exclude and workspace.members are working. — 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 tests/testsuite/pkgid.rs:276 — // FIXME: This fails since xyz is ambiguous, but 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.
FixmeComment tests/testsuite/freshness_mtime.rs:1363 — // FIXME: This is not rebuilding when it should. — 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 tests/testsuite/build_dir_legacy.rs:614 — // FIXME: The `.cargo-lock` file should be in target-dir not build-dir. See #16707
FixmeComment tests/testsuite/build_dir_fine_grain_locking.rs:601 — // FIXME: The `.cargo-lock` file should be in target-dir not build-dir. See #16707
FixmeComment tests/testsuite/build_dir.rs:587 — // FIXME: The `.cargo-lock` file should be in target-dir not build-dir. See #16707
FixmeComment tests/testsuite/script/rustc_fixtures/multifrontmatter.rs:6 — // FIXME(frontmatter): make this diagnostic better — 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 tests/testsuite/script/rustc_fixtures/location-after-tokens.rs:5 — // FIXME(frontmatter): make this diagnostic better — 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 · MethodTooLong · ×18

MethodTooLong: BuildOutput.parse src/compiler/custom_build.rs:798 — MethodTooLong — parse runs 249 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 149 over it, 2.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: TextRenderer.push_md crates/mdman/src/format/text.rs:93 — MethodTooLong — push_md runs 208 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 108 over it, 2.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: InstallablePackage.install_one src/ops/cargo_install.rs:337 — MethodTooLong — install_one runs 206 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 106 over it, 2.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.
MethodTooLong: ManRenderer.push_man crates/mdman/src/format/man.rs:102 — MethodTooLong — push_man 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: InstallablePackage.new src/ops/cargo_install.rs:98 — MethodTooLong — new runs 155 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 55 over it, 1.55× 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: TargetInfo.new src/compiler/build_context/target_info.rs:174 — MethodTooLong — new runs 144 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 44 over it, 1.44× 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: DirtyReason.present_to src/compiler/fingerprint/dirty_reason.rs:151 — MethodTooLong — present_to runs 138 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 38 over it, 1.38× 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: ScriptSource.parse src/util/frontmatter.rs:23 — MethodTooLong — parse 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: Dependency.from_toml src/workspace/editor/dependency.rs:224 — MethodTooLong — from_toml 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.
MethodTooLong: Dependency.update_toml src/workspace/editor/dependency.rs:508 — MethodTooLong — update_toml 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: SvgRenderer.render_pipeline_graph src/compiler/timings/timings.js:126 — MethodTooLong — render_pipeline_graph runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21× 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: SvgRenderer.render_timing_graph src/compiler/timings/timings.js:360 — MethodTooLong — render_timing_graph runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21× 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: DrainState.handle_event src/compiler/job_queue/mod.rs:614 — MethodTooLong — handle_event runs 117 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 17 over it, 1.17× 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: RegistrySource.query src/sources/registry/mod.rs:678 — MethodTooLong — query 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: Workspace.missing_feature_spelling_suggestions src/workspace/workspace.rs:1400 — MethodTooLong — missing_feature_spelling_suggestions 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: PackageRegistry.patch src/workspace/registry.rs:324 — MethodTooLong — patch 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.
MethodTooLong: ArgMatchesExt.compile_options src/util/command_prelude.rs:743 — MethodTooLong — compile_options runs 105 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 5 over it, 1.05× 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: Fingerprint.compare src/compiler/fingerprint/mod.rs:1084 — MethodTooLong — compare runs 101 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 1 over it, 1.01× 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.

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

Duplicated block (8 lines × 2) src/ops/cargo_compile/packages.rs:61 — src/ops/cargo_compile/packages.rs:61-68 | src/ops/cargo_compile/packages.rs:225-232 — 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) src/ops/cargo_update.rs:554 — src/ops/cargo_update.rs:554-561 | src/ops/cargo_update.rs:580-587 — 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) src/ops/cargo_update.rs:570 — src/ops/cargo_update.rs:570-577 | src/ops/cargo_update.rs:596-603 — 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) src/workspace/features.rs:1113 — src/workspace/features.rs:1113-1120 | src/workspace/features.rs:1212-1219 — 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) src/workspace/package_id.rs:143 — src/workspace/package_id.rs:143-150 | src/workspace/source_id.rs:124-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 both call sites, so a change lands once.
Duplicated block (8 lines × 2) src/bin/cargo/commands/add.rs:198 — src/bin/cargo/commands/add.rs:198-205 | src/bin/cargo/commands/remove.rs:80-87 — before extracting anything, compare `src/bin/cargo/commands/add.rs` and `src/bin/cargo/commands/remove.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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.
Duplicated block (8 lines × 2) src/util/diagnostic_server.rs:310 — src/util/diagnostic_server.rs:310-317 | src/util/lockserver.rs:149-156 — 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 (8 lines × 2) src/diagnostics/rules/manual_readme.rs:140 — src/diagnostics/rules/manual_readme.rs:140-147 | src/diagnostics/rules/redundant_homepage.rs:135-143 — 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 (8 lines × 2) src/diagnostics/rules/non_kebab_case_packages.rs:124 — src/diagnostics/rules/non_kebab_case_packages.rs:124-131 | src/diagnostics/rules/non_snake_case_packages.rs:124-131 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_packages.rs` and `src/diagnostics/rules/non_snake_case_packages.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 101 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.
Duplicated block (8 lines × 2) src/sources/git/oxide.rs:132 — src/sources/git/oxide.rs:132-139 | src/sources/git/oxide.rs:156-163 — 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) src/ops/cargo_add/mod.rs:851 — src/ops/cargo_add/mod.rs:851-858 | src/ops/cargo_add/mod.rs:1011-1018 — 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) crates/cargo-util/src/process_error.rs:73 — crates/cargo-util/src/process_error.rs:73-80 | crates/cargo-util/src/process_error.rs:82-89 — 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 (6 lines × 2) · ×10

Duplicated block (6 lines × 2) src/bin/cargo/commands/help.rs:264 — src/bin/cargo/commands/help.rs:264-269 | src/bin/cargo/commands/help.rs:273-278 — 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 (6 lines × 2) src/compiler/build_runner/compilation_files.rs:1011 — src/compiler/build_runner/compilation_files.rs:1011-1016 | src/compiler/build_runner/compilation_files.rs:1060-1065 — 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 (6 lines × 2) src/diagnostics/rules/text_direction_codepoint_in_comment.rs:84 — src/diagnostics/rules/text_direction_codepoint_in_comment.rs:84-89 | src/diagnostics/rules/text_direction_codepoint_in_literal.rs:85-90 — before extracting anything, compare `src/diagnostics/rules/text_direction_codepoint_in_comment.rs` and `src/diagnostics/rules/text_direction_codepoint_in_literal.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 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.
Duplicated block (6 lines × 2) src/diagnostics/rules/text_direction_codepoint_in_comment.rs:101 — src/diagnostics/rules/text_direction_codepoint_in_comment.rs:101-106 | src/diagnostics/rules/text_direction_codepoint_in_literal.rs:103-108 — before extracting anything, compare `src/diagnostics/rules/text_direction_codepoint_in_comment.rs` and `src/diagnostics/rules/text_direction_codepoint_in_literal.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 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.
Duplicated block (6 lines × 2) src/ops/cargo_clean.rs:67 — src/ops/cargo_clean.rs:67-72 | src/ops/cargo_clean.rs:85-90 — 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 (6 lines × 2) src/ops/cargo_vendor.rs:507 — src/ops/cargo_vendor.rs:507-512 | src/workspace/parser/mod.rs:3006-3011 — before extracting anything, compare `src/ops/cargo_vendor.rs` and `src/workspace/parser/mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) src/workspace/editor/dependency.rs:269 — src/workspace/editor/dependency.rs:269-274 | src/workspace/editor/dependency.rs:302-307 — 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 (6 lines × 2) crates/cargo-util-schemas/src/core/partial_version.rs:156 — crates/cargo-util-schemas/src/core/partial_version.rs:156-161 | crates/cargo-util-schemas/src/manifest/rust_version.rs:111-116 — 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 (6 lines × 2) src/sources/source.rs:61 — src/sources/source.rs:61-66 | src/workspace/registry.rs:53-58 — 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 (6 lines × 2) src/compiler/build_runner/mod.rs:635 — src/compiler/build_runner/mod.rs:635-640 | src/compiler/build_runner/mod.rs:729-737 — 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.

D3 · God Classes · TooManyMethods · ×9

TooManyMethods: GlobalContext src/context/mod.rs:208 — TooManyMethods — 100 methods. The bar is 30 methods; this is 70 over it, 3.33× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: Workspace src/workspace/workspace.rs:50 — TooManyMethods — 72 methods. The bar is 30 methods; this is 42 over it, 2.40× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: Target src/workspace/manifest.rs:311 — TooManyMethods — 56 methods. The bar is 30 methods; this is 26 over it, 1.87× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: SourceId src/workspace/source_id.rs:40 — TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: Manifest src/workspace/manifest.rs:64 — TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: Shell crates/cargo-util-terminal/src/shell.rs:17 — TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: Dependency src/workspace/dependency.rs:23 — TooManyMethods — 39 methods. The bar is 30 methods; this is 9 over it, 1.30× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: ProcessBuilder crates/cargo-util/src/process_builder.rs:20 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: Feature src/workspace/features.rs:596 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.

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

Duplicated block (7 lines × 2) src/resolver/encode.rs:445 — src/resolver/encode.rs:445-451 | src/resolver/encode.rs:493-499 — 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) src/workspace/global_cache_tracker.rs:1064 — src/workspace/global_cache_tracker.rs:1064-1070 | src/workspace/global_cache_tracker.rs:1122-1128 — 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) src/workspace/parser/mod.rs:2891 — src/workspace/parser/mod.rs:2891-2897 | src/workspace/parser/mod.rs:2923-2929 — 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) src/ops/cargo_install.rs:832 — src/ops/cargo_install.rs:832-838 | src/ops/cargo_uninstall.rs:49-59 — 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 (7 lines × 2) src/diagnostics/rules/unused_workspace_dependencies.rs:134 — src/diagnostics/rules/unused_workspace_dependencies.rs:134-140 | src/diagnostics/rules/unused_workspace_package_fields.rs:103-109 — before extracting anything, compare `src/diagnostics/rules/unused_workspace_dependencies.rs` and `src/diagnostics/rules/unused_workspace_package_fields.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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.
Duplicated block (7 lines × 2) src/bin/cargo/commands/remove.rs:253 — src/bin/cargo/commands/remove.rs:253-259 | src/bin/cargo/commands/remove.rs:350-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.
Duplicated block (7 lines × 2) src/workspace/global_cache_tracker.rs:1290 — src/workspace/global_cache_tracker.rs:1290-1296 | src/workspace/global_cache_tracker.rs:1344-1350 — 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) src/diagnostics/rules/text_direction_codepoint_in_comment.rs:108 — src/diagnostics/rules/text_direction_codepoint_in_comment.rs:108-114 | src/diagnostics/rules/text_direction_codepoint_in_literal.rs:149-155 — before extracting anything, compare `src/diagnostics/rules/text_direction_codepoint_in_comment.rs` and `src/diagnostics/rules/text_direction_codepoint_in_literal.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 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.
Duplicated block (7 lines × 2) src/sources/git/utils.rs:1195 — src/sources/git/utils.rs:1195-1201 | src/sources/git/utils.rs:1203-1209 — 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 × 2) · ×8

Duplicated block (10 lines × 2) crates/mdman/src/format/man.rs:308 — crates/mdman/src/format/man.rs:308-317 | crates/mdman/src/format/text.rs:267-276 — before extracting anything, compare `crates/mdman/src/format/man.rs` and `crates/mdman/src/format/text.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 72 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.
Duplicated block (10 lines × 2) credential/cargo-credential-1password/src/main.rs:94 — credential/cargo-credential-1password/src/main.rs:94-103 | credential/cargo-credential-1password/src/main.rs:141-150 — 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) src/ops/cargo_add/mod.rs:375 — src/ops/cargo_add/mod.rs:375-384 | src/ops/cargo_add/mod.rs:412-421 — 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) src/ops/cargo_package/vcs.rs:308 — src/ops/cargo_package/vcs.rs:308-317 | src/ops/cargo_package/vcs.rs:429-438 — 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) src/ops/cargo_update.rs:576 — src/ops/cargo_update.rs:576-585 | src/ops/cargo_update.rs:623-632 — 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) src/bin/cargo/commands/add.rs:186 — src/bin/cargo/commands/add.rs:186-195 | src/bin/cargo/commands/remove.rs:67-76 — before extracting anything, compare `src/bin/cargo/commands/add.rs` and `src/bin/cargo/commands/remove.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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.
Duplicated block (10 lines × 2) src/diagnostics/rules/non_kebab_case_packages.rs:91 — src/diagnostics/rules/non_kebab_case_packages.rs:91-100 | src/diagnostics/rules/non_snake_case_packages.rs:91-100 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_packages.rs` and `src/diagnostics/rules/non_snake_case_packages.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 101 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.
Duplicated block (10 lines × 2) src/diagnostics/rules/unused_workspace_dependencies.rs:154 — src/diagnostics/rules/unused_workspace_dependencies.rs:154-163 | src/diagnostics/rules/unused_workspace_package_fields.rs:123-132 — before extracting anything, compare `src/diagnostics/rules/unused_workspace_dependencies.rs` and `src/diagnostics/rules/unused_workspace_package_fields.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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.

D3 · God Classes · ClassTooLong · ×7

ClassTooLong: GlobalContext src/context/mod.rs:208 — ClassTooLong — 1094 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 100 methods, 2 blocks, lines 208-2159. The bar is 400 significant lines; this is 694 over it, 2.74× 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: Workspace src/workspace/workspace.rs:50 — ClassTooLong — 1028 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 72 methods, 2 blocks, lines 50-1842. The bar is 400 significant lines; this is 628 over it, 2.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.
ClassTooLong: GlobalCacheTracker src/workspace/global_cache_tracker.rs:335 — ClassTooLong — 725 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 29 methods, 2 blocks, lines 335-1358. The bar is 400 significant lines; this is 325 over it, 1.81× 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: UnitGenerator src/ops/cargo_compile/unit_generator.rs:50 — ClassTooLong — 496 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 13 methods, 2 blocks, lines 50-793. The bar is 400 significant lines; this is 96 over it, 1.24× 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: DrainState src/compiler/job_queue/mod.rs:173 — ClassTooLong — 490 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 15 methods, 2 blocks, lines 173-1308. The bar is 400 significant lines; this is 90 over it, 1.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: BuildRunner src/compiler/build_runner/mod.rs:40 — ClassTooLong — 474 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, 2 blocks, lines 40-818. The bar is 400 significant lines; this is 74 over it, 1.19× 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: Dependency src/workspace/editor/dependency.rs:25 — ClassTooLong — 462 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, 6 blocks, lines 25-730. The bar is 400 significant lines; this is 62 over it, 1.16× 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.

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

Duplicated block (9 lines × 2) crates/home/src/env.rs:69 — crates/home/src/env.rs:69-77 | crates/home/src/env.rs:102-110 — 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) src/diagnostics/rules/non_kebab_case_packages.rs:146 — src/diagnostics/rules/non_kebab_case_packages.rs:146-154 | src/diagnostics/rules/non_snake_case_packages.rs:146-154 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_packages.rs` and `src/diagnostics/rules/non_snake_case_packages.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 101 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.
Duplicated block (9 lines × 2) src/ops/registry/cargo_info/mod.rs:144 — src/ops/registry/cargo_info/mod.rs:144-152 | src/ops/registry/cargo_info/mod.rs:155-163 — 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) src/compiler/build_context/target_info.rs:456 — src/compiler/build_context/target_info.rs:456-464 | src/compiler/build_context/target_info.rs:492-506 — 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) src/util/command_prelude.rs:782 — src/util/command_prelude.rs:782-792 | src/util/command_prelude.rs:793-801 — 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) src/bin/cargo/commands/package.rs:61 — src/bin/cargo/commands/package.rs:61-69 | src/bin/cargo/commands/publish.rs:44-52 — 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 (9 lines × 2) crates/cargo-test-macro/src/lib.rs:142 — crates/cargo-test-macro/src/lib.rs:142-150 | crates/cargo-test-macro/src/lib.rs:156-165 — 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 · ×6

Off the main sequence: cargo-platform — cargo-platform: 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: cargo-util — cargo-util: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: cargo-util-schemas — cargo-util-schemas: 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: rustfix — rustfix: 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: crates-io — crates-io: abstractness 0.07, instability 0.00, distance 0.93 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: cargo-credential — cargo-credential: abstractness 0.10, instability 0.00, distance 0.90 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.

D2 · Cognitive Complexity · DrainState · ×5

DrainState::drain_the_queue (cognitive 25) src/compiler/job_queue/mod.rs:801 — DrainState::drain_the_queue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 2 (3 pts), boolean chains 2 (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.
DrainState::report_warning_count (cognitive 25) src/compiler/job_queue/mod.rs:1106 — DrainState::report_warning_count has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 2, match/switch 2 (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.
DrainState::note_working_on (cognitive 20) src/compiler/job_queue/mod.rs:1223 — DrainState::note_working_on has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, match/switch 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.
DrainState::handle_event (cognitive 18) src/compiler/job_queue/mod.rs:614 — DrainState::handle_event has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 9). 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.
DrainState::emit_log_messages (cognitive 18) src/compiler/job_queue/mod.rs:1037 — DrainState::emit_log_messages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 2 (5 pts), match/switch 1 (5 pts), boolean chains 2 (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 (12 lines × 2) · ×5

Duplicated block (12 lines × 2) crates/cargo-util-terminal/src/shell.rs:329 — crates/cargo-util-terminal/src/shell.rs:329-340 | crates/cargo-util-terminal/src/shell.rs:343-354 — 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) src/ops/cargo_add/mod.rs:197 — src/ops/cargo_add/mod.rs:197-208 | src/ops/cargo_add/mod.rs:221-232 — 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) src/ops/cargo_update.rs:613 — src/ops/cargo_update.rs:613-624 | src/ops/cargo_update.rs:634-645 — 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) src/diagnostics/rules/unused_dependencies.rs:139 — src/diagnostics/rules/unused_dependencies.rs:139-150 | src/diagnostics/rules/unused_dependencies.rs:319-330 — 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) src/compiler/compilation.rs:544 — src/compiler/compilation.rs:544-555 | src/compiler/compilation.rs:592-603 — 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) · ×5

Duplicated block (11 lines × 2) src/compiler/compilation.rs:532 — src/compiler/compilation.rs:532-542 | src/compiler/compilation.rs:580-590 — 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) src/diagnostics/rules/text_direction_codepoint_in_comment.rs:149 — src/diagnostics/rules/text_direction_codepoint_in_comment.rs:149-159 | src/diagnostics/rules/text_direction_codepoint_in_literal.rs:191-201 — before extracting anything, compare `src/diagnostics/rules/text_direction_codepoint_in_comment.rs` and `src/diagnostics/rules/text_direction_codepoint_in_literal.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 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.
Duplicated block (11 lines × 2) src/util/semver_eval_ext.rs:168 — src/util/semver_eval_ext.rs:168-178 | src/util/semver_eval_ext.rs:204-214 — 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) src/diagnostics/rules/non_kebab_case_features.rs:90 — src/diagnostics/rules/non_kebab_case_features.rs:90-100 | src/diagnostics/rules/non_snake_case_features.rs:90-100 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_features.rs` and `src/diagnostics/rules/non_snake_case_features.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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.
Duplicated block (11 lines × 2) src/ops/registry/cargo_info/view.rs:272 — src/ops/registry/cargo_info/view.rs:272-282 | src/ops/registry/cargo_info/view.rs:359-369 — 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 (5 lines × 2) · ×5

Duplicated block (5 lines × 2) crates/crates-io/lib.rs:336 — crates/crates-io/lib.rs:336-340 | crates/crates-io/lib.rs:343-347 — 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 (5 lines × 2) src/compiler/timings/mod.rs:137 — src/compiler/timings/mod.rs:137-141 | src/ops/cargo_report/util.rs:100-104 — 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 (5 lines × 2) src/diagnostics/rules/manual_readme.rs:135 — src/diagnostics/rules/manual_readme.rs:135-139 | src/diagnostics/rules/redundant_homepage.rs:130-135 — 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 (5 lines × 2) src/workspace/global_cache_tracker.rs:850 — src/workspace/global_cache_tracker.rs:850-855 | src/workspace/global_cache_tracker.rs:877-881 — 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 (5 lines × 2) src/diagnostics/report.rs:17 — src/diagnostics/report.rs:17-21 | src/util/workspace.rs:137-141 — 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 (13 lines × 2) · ×4

Duplicated block (13 lines × 2) src/ops/cargo_clean.rs:295 — src/ops/cargo_clean.rs:295-307 | src/ops/cargo_clean.rs:377-389 — 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) src/ops/cargo_update.rs:749 — src/ops/cargo_update.rs:749-761 | src/ops/cargo_update.rs:764-776 — 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) src/sources/path.rs:156 — src/sources/path.rs:156-168 | src/sources/path.rs:354-366 — 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) credential/cargo-credential-libsecret/src/lib.rs:219 — credential/cargo-credential-libsecret/src/lib.rs:219-231 | credential/cargo-credential-libsecret/src/lib.rs:241-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.

D1 · Cyclomatic Complexity · Dependency · ×3

Dependency::update_toml (cyclomatic 27) src/workspace/editor/dependency.rs:508 — Dependency::update_toml 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.
Dependency::to_toml (cyclomatic 20) src/workspace/editor/dependency.rs:401 — Dependency::to_toml has cyclomatic complexity 20 (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.
Dependency::from_toml (cyclomatic 18) src/workspace/editor/dependency.rs:224 — Dependency::from_toml has cyclomatic complexity 18 (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.

D2 · Cognitive Complexity · Dependency · ×3

Dependency::update_toml (cognitive 65) src/workspace/editor/dependency.rs:508 — Dependency::update_toml has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 4 (12 pts), match/switch 5 (10 pts) (nesting depth added 32). 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.
Dependency::from_toml (cognitive 36) src/workspace/editor/dependency.rs:224 — Dependency::from_toml has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (36 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.
Dependency::to_toml (cognitive 30) src/workspace/editor/dependency.rs:401 — Dependency::to_toml has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 2 (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.

D2 · Cognitive Complexity · BuildRunner · ×3

BuildRunner::compile (cognitive 60) src/compiler/build_runner/mod.rs:169 — BuildRunner::compile has cognitive complexity 60 (threshold 15). Drivers by points: loops 11 (31 pts), if/else 8 (26 pts), match/switch 1 (3 pts) (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
BuildRunner::check_collisions (cognitive 38) src/compiler/build_runner/mod.rs:609 — BuildRunner::check_collisions has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 22). 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.
BuildRunner::prepare (cognitive 18) src/compiler/build_runner/mod.rs:466 — BuildRunner::prepare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 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.

D2 · Cognitive Complexity · UnitGenerator · ×3

UnitGenerator::find_named_targets (cognitive 43) src/ops/cargo_compile/unit_generator.rs:233 — UnitGenerator::find_named_targets has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 5 (16 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 22). 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.
UnitGenerator::create_proposals (cognitive 40) src/ops/cargo_compile/unit_generator.rs:374 — UnitGenerator::create_proposals has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 5 (10 pts), loops 2 (5 pts), boolean chains 3 (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.
UnitGenerator::validate_required_features (cognitive 16) src/ops/cargo_compile/unit_generator.rs:628 — UnitGenerator::validate_required_features has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 3 (6 pts), boolean chains 2, loops 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.

D2 · Cognitive Complexity · Workspace · ×3

Workspace::validate_manifest (cognitive 24) src/workspace/workspace.rs:1177 — Workspace::validate_manifest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 1 (2 pts) (nesting depth added 14). 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.
Workspace::find_members (cognitive 22) src/workspace/workspace.rs:848 — Workspace::find_members has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (3 pts), boolean chains 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.
Workspace::set_resolve_behavior (cognitive 17) src/workspace/workspace.rs:320 — Workspace::set_resolve_behavior has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (7 pts) (nesting depth added 6). 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 · TooManyFunctions · ×3

TooManyFunctions: build_rs::input crates/build-rs/src/input.rs:72 — TooManyFunctions — 44 free functions. The bar is 30 free functions; this is 14 over it, 1.47× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyFunctions: cargo_util::paths crates/cargo-util/src/paths.rs:20 — TooManyFunctions — 43 free functions. The bar is 30 free functions; this is 13 over it, 1.43× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyFunctions: build_rs::input::cfg crates/build-rs/src/input.rs:164 — TooManyFunctions — 33 free functions. The bar is 30 free functions; this is 3 over it, 1.10× the bar. This type is on a published API surface — a cargo-semver-checks gate in CI (REDACTED) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.

D3 · God Classes · TooManyFields · ×3

TooManyFields: GlobalContext src/context/mod.rs:208 — TooManyFields — 40 stored fields beside 100 methods. The bar is 30 stored fields; this is 10 over it, 1.33× 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: TomlPackage crates/cargo-util-schemas/src/manifest/mod.rs:179 — TooManyFields — 33 stored fields beside 19 methods. The bar is 30 stored fields; this is 3 over it, 1.10× 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: Features src/workspace/features.rs:434 — TooManyFields — 32 stored fields beside 7 methods. The bar is 30 stored fields; this is 2 over it, 1.07× 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.

D1 · Cyclomatic Complexity · InstallablePackage · ×2

InstallablePackage::install_one (cyclomatic 36) src/ops/cargo_install.rs:337 — InstallablePackage::install_one has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body's own statements and 1 belongs to one function item inside it that branches. 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.
InstallablePackage::new (cyclomatic 23) src/ops/cargo_install.rs:98 — InstallablePackage::new has cyclomatic complexity 23 (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 · DrainState · ×2

DrainState::handle_event (cyclomatic 21) src/compiler/job_queue/mod.rs:614 — DrainState::handle_event 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.
DrainState::drain_the_queue (cyclomatic 16) src/compiler/job_queue/mod.rs:801 — DrainState::drain_the_queue 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 · UnitGenerator · ×2

UnitGenerator::find_named_targets (cyclomatic 20) src/ops/cargo_compile/unit_generator.rs:233 — UnitGenerator::find_named_targets has cyclomatic complexity 20 (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.
UnitGenerator::create_proposals (cyclomatic 18) src/ops/cargo_compile/unit_generator.rs:374 — UnitGenerator::create_proposals has cyclomatic complexity 18 (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 · TargetInfo · ×2

TargetInfo::new (cyclomatic 18) src/compiler/build_context/target_info.rs:174 — TargetInfo::new has cyclomatic complexity 18 (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.
TargetInfo::file_types (cyclomatic 17) src/compiler/build_context/target_info.rs:415 — TargetInfo::file_types 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.

D2 · Cognitive Complexity · InstallablePackage · ×2

InstallablePackage::install_one (cognitive 66) src/ops/cargo_install.rs:337 — InstallablePackage::install_one has cognitive complexity 66 (threshold 15). Drivers by points: if/else 33 (54 pts), loops 5 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 25). Of this number, 64 points are the body's own statements and 2 belong to one function item inside it that branches. 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.
InstallablePackage::new (cognitive 36) src/ops/cargo_install.rs:98 — InstallablePackage::new has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26 (34 pts), boolean chains 2 (nesting depth added 8). 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 · Fingerprint · ×2

Fingerprint::compare (cognitive 41) src/compiler/fingerprint/mod.rs:1084 — Fingerprint::compare has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 2, match/switch 1 (2 pts) (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.
Fingerprint::check_filesystem (cognitive 18) src/compiler/fingerprint/mod.rs:1255 — Fingerprint::check_filesystem has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (5 pts), loops 3 (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 · TargetInfo · ×2

TargetInfo::new (cognitive 33) src/compiler/build_context/target_info.rs:174 — TargetInfo::new has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 pts), match/switch 3 (7 pts), boolean chains 2 (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.
TargetInfo::file_types (cognitive 23) src/compiler/build_context/target_info.rs:415 — TargetInfo::file_types has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, match/switch 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, 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 · Features · ×2

Features::status (cognitive 30) src/workspace/features.rs:474 — Features::status has cognitive complexity 30 (threshold 15). Drivers by points: if/else 30. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. 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.
Features::add (cognitive 19) src/workspace/features.rs:625 — Features::add has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 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.

D2 · Cognitive Complexity · PackageRegistry · ×2

PackageRegistry::query (cognitive 25) src/workspace/registry.rs:667 — PackageRegistry::query has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 pts), loops 2 (4 pts), boolean chains 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.
PackageRegistry::patch (cognitive 17) src/workspace/registry.rs:324 — PackageRegistry::patch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3, 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.

D2 · Cognitive Complexity · FeatureResolver · ×2

FeatureResolver::activate_dep_feature (cognitive 23) src/resolver/features.rs:674 — FeatureResolver::activate_dep_feature has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 2 (3 pts), boolean chains 1 (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.
FeatureResolver::deps (cognitive 22) src/resolver/features.rs:775 — FeatureResolver::deps has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7, match/switch 3 (7 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 6). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 2 function items inside it that branch (artifact_features_for, platform_activated). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.

D35 · Change Coupling · Change coupling · ×2

Change coupling: mod.rs ↔ cargo_fetch.rs src/ops/cargo_compile/mod.rs — `src/ops/cargo_compile/mod.rs` and `src/ops/cargo_fetch.rs` change together 92% of the time (12 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — 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 12 shared commits counted here, the most recent 3 are `301e7be5` docs: Update code comments to use 'target tuple'; `4a765759` feat(diag): Support build.warnings=deny in parse pass (at that commit the files were still `src/cargo/ops/cargo_compile/mod.rs` and `src/cargo/ops/cargo_fetch.rs`); `66d01408` refactor(diag): Put the caller in charge of parse pass rules (at that commit the files were still `src/cargo/ops/cargo_compile/mod.rs` and `src/cargo/ops/cargo_fetch.rs`) — run `git show` on any of them.
Change coupling: directory.rs ↔ mod.rs src/sources/directory.rs — `src/sources/directory.rs` and `src/sources/registry/mod.rs` change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — 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 10 shared commits counted here, the most recent 3 are `dfc9401d` refactor: parameterize version requirement matching; `b45ca32b` refactor(source): Rename AlternativeVersions to RejectedVersions (at that commit the files were still `src/cargo/sources/directory.rs` and `src/cargo/sources/registry/mod.rs`); `d2fcf6b1` fix(resolver): Report unmatched versions, rather than saying no package (at that commit the files were still `src/cargo/sources/directory.rs` and `src/cargo/sources/registry/mod.rs`) — run `git show` on any of them.

D36 · Supply-chain Provenance & Signing · REDACTED

REDACTED
REDACTED

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

Duplicated block (24 lines × 2) src/util/network/http.rs:174 — src/util/network/http.rs:174-197 | src/util/network/http.rs:204-227 — 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 (24 lines × 2) src/diagnostics/rules/unused_workspace_dependencies.rs:74 — src/diagnostics/rules/unused_workspace_dependencies.rs:74-97 | src/diagnostics/rules/unused_workspace_dependencies.rs:99-122 — 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 × 2) · ×2

Duplicated block (14 lines × 2) src/ops/cargo_update.rs:307 — src/ops/cargo_update.rs:307-320 | src/ops/cargo_update.rs:358-371 — 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) src/bin/cargo/commands/add.rs:394 — src/bin/cargo/commands/add.rs:394-407 | src/bin/cargo/commands/remove.rs:149-162 — before extracting anything, compare `src/bin/cargo/commands/add.rs` and `src/bin/cargo/commands/remove.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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 (12 lines × 3) · ×2

Duplicated block (12 lines × 3) src/diagnostics/rules/non_kebab_case_bins.rs:223 — src/diagnostics/rules/non_kebab_case_bins.rs:223-234 | src/diagnostics/rules/non_kebab_case_packages.rs:132-143 | src/diagnostics/rules/non_snake_case_packages.rs:132-143 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_packages.rs` and `src/diagnostics/rules/non_snake_case_packages.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 101 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.
Duplicated block (12 lines × 3) credential/cargo-credential-libsecret/src/lib.rs:180 — credential/cargo-credential-libsecret/src/lib.rs:180-191 | credential/cargo-credential-libsecret/src/lib.rs:219-230 | credential/cargo-credential-libsecret/src/lib.rs:241-252 — 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 (7 lines × 3) · ×2

Duplicated block (7 lines × 3) src/workspace/global_cache_tracker.rs:434 — src/workspace/global_cache_tracker.rs:434-440 | src/workspace/global_cache_tracker.rs:458-464 | src/workspace/global_cache_tracker.rs:498-504 — 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 (7 lines × 3) src/diagnostics/rules/non_kebab_case_bins.rs:236 — src/diagnostics/rules/non_kebab_case_bins.rs:236-242 | src/diagnostics/rules/non_kebab_case_packages.rs:145-151 | src/diagnostics/rules/non_snake_case_packages.rs:145-151 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_packages.rs` and `src/diagnostics/rules/non_snake_case_packages.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 101 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 (6 lines × 7) · ×2

Duplicated block (6 lines × 7) src/workspace/parser/mod.rs:702 — src/workspace/parser/mod.rs:702-710 | src/workspace/parser/mod.rs:726-734 | src/workspace/parser/mod.rs:738-743 | src/workspace/parser/mod.rs:752-760 | src/workspace/parser/mod.rs:783-791 | src/workspace/parser/mod.rs:795-803 | src/workspace/parser/mod.rs:811-816 — 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.
Duplicated block (6 lines × 7) src/workspace/parser/mod.rs:706 — src/workspace/parser/mod.rs:706-711 | src/workspace/parser/mod.rs:730-735 | src/workspace/parser/mod.rs:736-741 | src/workspace/parser/mod.rs:756-761 | src/workspace/parser/mod.rs:762-767 | src/workspace/parser/mod.rs:787-792 | src/workspace/parser/mod.rs:793-798 — 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.

D1 · Cyclomatic Complexity · TextRenderer · ×1

TextRenderer::push_md (cyclomatic 68) crates/mdman/src/format/text.rs:93 — TextRenderer::push_md has cyclomatic complexity 68 (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 · ManRenderer · ×1

ManRenderer::push_man (cyclomatic 64) crates/mdman/src/format/man.rs:102 — ManRenderer::push_man has cyclomatic complexity 64 (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 · BuildOutput · ×1

BuildOutput::parse (cyclomatic 43) src/compiler/custom_build.rs:798 — BuildOutput::parse has cyclomatic complexity 43 (threshold 15). Of this number, 37 points are the body's own statements and 6 belong to 3 function items inside it that branch. 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 · Features · ×1

Features::status (cyclomatic 31) src/workspace/features.rs:474 — Features::status has cyclomatic complexity 31 (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 · Fingerprint · ×1

Fingerprint::compare (cyclomatic 28) src/compiler/fingerprint/mod.rs:1084 — Fingerprint::compare 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.

D1 · Cyclomatic Complexity · RegistrySource · ×1

RegistrySource::query (cyclomatic 27) src/sources/registry/mod.rs:678 — RegistrySource::query 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.

D1 · Cyclomatic Complexity · TomlProfile · ×1

TomlProfile::merge (cyclomatic 24) crates/cargo-util-schemas/src/manifest/mod.rs:970 — TomlProfile::merge 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 · ArgMatchesExt · ×1

ArgMatchesExt::compile_options (cyclomatic 22) src/util/command_prelude.rs:743 — ArgMatchesExt::compile_options 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 · BuildRunner · ×1

BuildRunner::compile (cyclomatic 21) src/compiler/build_runner/mod.rs:169 — BuildRunner::compile has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D1 · Cyclomatic Complexity · Compilation · ×1

Compilation::fill_env (cyclomatic 19) src/compiler/compilation.rs:367 — Compilation::fill_env 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 · xtask_bump_check · ×1

xtask_bump_check::xtask::bump_check (cyclomatic 19) crates/xtask-bump-check/src/xtask.rs:114 — xtask_bump_check::xtask::bump_check 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 · Tokenizer · ×1

Tokenizer::next (cyclomatic 18) crates/cargo-platform/src/cfg.rs:345 — Tokenizer::next has cyclomatic complexity 18 (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 · ProcessBuilder · ×1

ProcessBuilder::exec_with_streaming (cyclomatic 17) crates/cargo-util/src/process_builder.rs:378 — ProcessBuilder::exec_with_streaming 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.

D1 · Cyclomatic Complexity · UnusedDepState · ×1

UnusedDepState::new (cyclomatic 17) src/compiler/unused_deps.rs:23 — UnusedDepState::new 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 · FeatureResolver · ×1

FeatureResolver::deps (cyclomatic 17) src/resolver/features.rs:775 — FeatureResolver::deps has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (artifact_features_for, platform_activated). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.

D1 · Cyclomatic Complexity · HandleConfiguration · ×1

HandleConfiguration::new (cyclomatic 17) src/util/network/http.rs:68 — HandleConfiguration::new has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body's own statements and 6 belong to one function item inside it that branches. 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 · mdman · ×1

mdman::process_args (cyclomatic 16) crates/mdman/src/main.rs:63 — mdman::process_args 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 · GlobalContext · ×1

GlobalContext::include_paths (cyclomatic 16) src/context/mod.rs:1455 — GlobalContext::include_paths 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 · RegistryQueryerAsync · ×1

RegistryQueryerAsync::query (cyclomatic 16) src/resolver/dep_cache.rs:66 — RegistryQueryerAsync::query 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 · HttpBackend · ×1

HttpBackend::fetch_uncached_no_retry (cyclomatic 16) src/sources/registry/http_remote.rs:503 — HttpBackend::fetch_uncached_no_retry has cyclomatic complexity 16 (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.

D1 · Cyclomatic Complexity · PackageRegistry · ×1

PackageRegistry::query (cyclomatic 16) src/workspace/registry.rs:667 — PackageRegistry::query 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.

D15 · Churn × Complexity Hotspots · Repeated repair · ×1

Repeated repair: src/compiler/trim_paths.rs src/compiler/trim_paths.rs:299 — src/compiler/trim_paths.rs changed 13 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is cargo::compiler::trim_paths::write_unremap_file at line 299), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(trim-paths): trim-paths as "none" by default”; “fix(trim-paths)!: unremap file in one JSON doc”; “fix(trim-paths)!: limit options to `none|object|all`”; “fix(trim-paths): custom workspace-relative member paths remap”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 16:29:28 +00:00' --until='2026-09-28 16:29:28 +00:00' --full-history --no-merges -- src/compiler/trim_paths.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 · XxxComment · ×1

XxxComment src/workspace/workspace.rs:607 — // XXX: should this also take into account version numbers? — 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 · TextRenderer · ×1

TextRenderer::push_md (cognitive 104) crates/mdman/src/format/text.rs:93 — TextRenderer::push_md has cognitive complexity 104 (threshold 15). Drivers by points: if/else 22 (63 pts), match/switch 7 (26 pts), loops 4 (15 pts) (nesting depth added 71). 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 · ManRenderer · ×1

ManRenderer::push_man (cognitive 68) crates/mdman/src/format/man.rs:102 — ManRenderer::push_man has cognitive complexity 68 (threshold 15). Drivers by points: if/else 13 (37 pts), match/switch 8 (30 pts), loops 1 (nesting depth added 46). 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 · BuildOutput · ×1

BuildOutput::parse (cognitive 61) src/compiler/custom_build.rs:798 — BuildOutput::parse has cognitive complexity 61 (threshold 15). Drivers by points: if/else 23 (48 pts), match/switch 5 (10 pts), boolean chains 2, loops 1 (nesting depth added 30). Of this number, 51 points are the body's own statements and 10 belong to 3 function items inside it that branch. 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 · ArgMatchesExt · ×1

ArgMatchesExt::compile_options (cognitive 46) src/util/command_prelude.rs:743 — ArgMatchesExt::compile_options has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 4 (15 pts), loops 2 (3 pts) (nesting depth added 30). 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 · Tokenizer · ×1

Tokenizer::next (cognitive 40) crates/cargo-platform/src/cfg.rs:345 — Tokenizer::next has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 25). 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 · Compilation · ×1

Compilation::fill_env (cognitive 36) src/compiler/compilation.rs:367 — Compilation::fill_env has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 3 (7 pts), boolean chains 3 (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 · ManifestErrorContext · ×1

ManifestErrorContext::find_crate_span (cognitive 35) src/compiler/mod.rs:2493 — ManifestErrorContext::find_crate_span has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 21). 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 · RegistrySource · ×1

RegistrySource::query (cognitive 34) src/sources/registry/mod.rs:678 — RegistrySource::query has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 4 (6 pts), boolean chains 5, loops 1 (2 pts) (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.

D2 · Cognitive Complexity · UnusedDepState · ×1

UnusedDepState::new (cognitive 33) src/compiler/unused_deps.rs:23 — UnusedDepState::new has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (9 pts), boolean chains 4 (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 · semver_check · ×1

semver_check::doit (cognitive 33) crates/semver-check/src/main.rs:32 — semver_check::doit has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (6 pts), loops 3 (5 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.

D2 · Cognitive Complexity · Display · ×1

Display::fmt (cognitive 32) src/ops/cargo_tree/format/mod.rs:60 — Display::fmt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 21). 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 · WorkerServer · ×1

WorkerServer::worker_loop (cognitive 32) src/util/network/http_async.rs:309 — WorkerServer::worker_loop has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 2 (6 pts), loops 2 (3 pts) (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 · xtask_bump_check · ×1

xtask_bump_check::xtask::bump_check (cognitive 32) crates/xtask-bump-check/src/xtask.rs:114 — xtask_bump_check::xtask::bump_check has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 5 (9 pts) (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.

D2 · Cognitive Complexity · TomlProfile · ×1

TomlProfile::merge (cognitive 30) crates/cargo-util-schemas/src/manifest/mod.rs:970 — TomlProfile::merge has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, match/switch 3 (8 pts), loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. 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.

D2 · Cognitive Complexity · ConflictStoreTrie · ×1

ConflictStoreTrie::find (cognitive 29) src/resolver/conflict_cache.rs:25 — ConflictStoreTrie::find has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 1 (2 pts), boolean chains 1, 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 · HttpBackend · ×1

HttpBackend::fetch_uncached_no_retry (cognitive 29) src/sources/registry/http_remote.rs:503 — HttpBackend::fetch_uncached_no_retry has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (10 pts), match/switch 2 (5 pts) (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.

D2 · Cognitive Complexity · RequirementError · ×1

RequirementError::into_activate_error (cognitive 28) src/resolver/dep_cache.rs:576 — RequirementError::into_activate_error has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 5 (9 pts), loops 1 (5 pts) (nesting depth added 17). 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 · ProcessBuilder · ×1

ProcessBuilder::exec_with_streaming (cognitive 26) crates/cargo-util/src/process_builder.rs:378 — ProcessBuilder::exec_with_streaming has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (21 pts), match/switch 2 (4 pts), loops 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 · LocalFingerprint · ×1

LocalFingerprint::find_stale_item (cognitive 26) src/compiler/fingerprint/mod.rs:938 — LocalFingerprint::find_stale_item has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 15). 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 · RegistryQueryerAsync · ×1

RegistryQueryerAsync::query (cognitive 25) src/resolver/dep_cache.rs:66 — RegistryQueryerAsync::query has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 2 (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 · PackageChange · ×1

PackageChange::with_diff (cognitive 24) src/ops/cargo_update.rs:700 — PackageChange::with_diff has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (12 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 · GlobalContext · ×1

GlobalContext::include_paths (cognitive 23) src/context/mod.rs:1455 — GlobalContext::include_paths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (9 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.

D2 · Cognitive Complexity · ConfigValue · ×1

ConfigValue::merge_helper (cognitive 20) src/context/config_value.rs:152 — ConfigValue::merge_helper has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). 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 · InstallTracker · ×1

InstallTracker::check_upgrade (cognitive 20) src/ops/common_for_install_and_uninstall.rs:166 — InstallTracker::check_upgrade has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 6). 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 · mdman · ×1

mdman::process_args (cognitive 19) crates/mdman/src/main.rs:63 — mdman::process_args has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 4 (7 pts), loops 1 (nesting depth added 10). 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 · SourceConfigMap · ×1

SourceConfigMap::add_config (cognitive 19) src/sources/config.rs:236 — SourceConfigMap::add_config has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 7 (8 pts), boolean chains 1 (nesting depth added 7). 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 · LockServer · ×1

LockServer::run (cognitive 19) src/util/lockserver.rs:77 — LockServer::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 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.

D2 · Cognitive Complexity · cargo_util · ×1

cargo_util::read2::imp::read2 (cognitive 18) crates/cargo-util/src/read2.rs:20 — cargo_util::read2::imp::read2 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 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.

D2 · Cognitive Complexity · ResolverContext · ×1

ResolverContext::flag_activated (cognitive 18) src/resolver/context.rs:64 — ResolverContext::flag_activated has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, match/switch 2 (nesting depth added 9). 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 · RemainingCandidates · ×1

RemainingCandidates::next (cognitive 17) src/resolver/mod.rs:750 — RemainingCandidates::next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 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 · AuthorizationError · ×1

AuthorizationError::fmt (cognitive 17) src/util/auth/mod.rs:316 — AuthorizationError::fmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 pts) (nesting depth added 6). 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 · DiagnosticPrinter · ×1

DiagnosticPrinter::print (cognitive 17) src/util/diagnostic_server.rs:106 — DiagnosticPrinter::print has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (nesting depth added 6). 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 · ScriptSource · ×1

ScriptSource::parse (cognitive 17) src/util/frontmatter.rs:23 — ScriptSource::parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 1 (2 pts), match/switch 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, 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 · CompilationFiles · ×1

CompilationFiles::calc_outputs (cognitive 16) src/compiler/build_runner/compilation_files.rs:521 — CompilationFiles::calc_outputs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 5). 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 · ConfigMapAccess · ×1

ConfigMapAccess::new_struct (cognitive 16) src/context/de.rs:284 — ConfigMapAccess::new_struct has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 pts), boolean chains 1 (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 · CleanContext · ×1

CleanContext::rm_rf (cognitive 16) src/ops/cargo_clean.rs:527 — CleanContext::rm_rf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1, match/switch 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 · IgnoreList · ×1

IgnoreList::format_existing (cognitive 16) src/ops/cargo_new.rs:602 — IgnoreList::format_existing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 pts), loops 2 (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.

D22 · Internal API Consistency · Redundant and inconsistent access to Cargo configuration values. The `input` type has a generic `cargo_cfg` method, while the `cfg` type exposes specific methods for every known config key. This creates two ways to access the same data with different signatures (generic lookup vs specific typed accessors) and potential for drift if new configs are added to one but not the other. · ×1

Redundant and inconsistent access to Cargo configuration values. The `input` type has a generic `cargo_cfg` method, while the `cfg` type exposes specific methods for every known config key. This creates two ways to access the same data with different signatures (generic lookup vs specific typed accessors) and potential for drift if new configs are added to one but not the other. — Remove the generic `input.cargo_cfg` method and rely solely on the specific accessors in `cfg`, or remove the specific accessors in `cfg` and use a single generic lookup method on `input` (or a shared `Cfg` struct) to avoid duplication. (signatures: input.cargo_cfg(cfg: str): String | cfg.cargo_cfg_feature(): String | cfg.cargo_cfg_clippy(): bool | cfg.cargo_cfg_debug_assertions(): bool | cfg.cargo_cfg_target_arch(): String)

D22 · Internal API Consistency · Inconsistent naming and parameter structure for linking arguments. `rustc_link_arg` takes a single flag. `rustc_link_arg_bin` takes a bin name and a flag. However, `rustc_link_arg_bins`, `tests`, `examples`, and `benches` take only a flag, implying they apply to all targets of that kind. This inconsistency makes it unclear if `rustc_link_arg_bin` is meant to be the general case for a single target, while the others are bulk operations, or if the naming is just arbitrary. · ×1

Inconsistent naming and parameter structure for linking arguments. `rustc_link_arg` takes a single flag. `rustc_link_arg_bin` takes a bin name and a flag. However, `rustc_link_arg_bins`, `tests`, `examples`, and `benches` take only a flag, implying they apply to all targets of that kind. This inconsistency makes it unclear if `rustc_link_arg_bin` is meant to be the general case for a single target, while the others are bulk operations, or if the naming is just arbitrary. — Unify the API. Either use a single method `rustc_link_arg(target: Option<&str>, flag: str)` where target is optional, or ensure all variants follow the same pattern (e.g., `rustc_link_arg_for_bin`, `rustc_link_arg_for_test`, etc., with consistent parameters). The current mix of 'single target' vs 'all targets of kind' with different method names is confusing. (signatures: output.rustc_link_arg(flag: str) | output.rustc_link_arg_bin(bin: str, flag: str) | output.rustc_link_arg_bins(flag: str) | output.rustc_link_arg_tests(flag: str) | output.rustc_link_arg_examples(flag: str) | output.rustc_link_arg_benches(flag: str))

D22 · Internal API Consistency · Inconsistent parameter order for symlink operations. `ProjectBuilder` methods take `dst` then `src`, while `Project.symlink` takes `src` then `dst`. This inconsistency increases the risk of errors when switching between building a project and manipulating an existing one. · ×1

Inconsistent parameter order for symlink operations. `ProjectBuilder` methods take `dst` then `src`, while `Project.symlink` takes `src` then `dst`. This inconsistency increases the risk of errors when switching between building a project and manipulating an existing one. — Standardize the parameter order across all symlink-related methods, preferably `src` then `dst` to match standard OS conventions (e.g., `os.symlink(src, dst)`). (signatures: ProjectBuilder.symlink(dst: impl AsRef<Path>, src: impl AsRef<Path>): Self | ProjectBuilder.symlink_dir(dst: impl AsRef<Path>, src: impl AsRef<Path>): Self | Project.symlink(src: impl AsRef<Path>, dst: impl AsRef<Path>))

D22 · Internal API Consistency · Inconsistent naming for project creation helpers. `project` creates in a default location, `project_in` takes a directory, and `project_in_home` takes a name (presumably relative to home). The naming doesn't clearly convey the relationship between the arguments and the resulting path structure. · ×1

Inconsistent naming for project creation helpers. `project` creates in a default location, `project_in` takes a directory, and `project_in_home` takes a name (presumably relative to home). The naming doesn't clearly convey the relationship between the arguments and the resulting path structure. — Rename to be more explicit, e.g., `project_in_temp()`, `project_in_dir(path)`, `project_in_home(name)`, or unify into a single builder pattern with a `at(path)` method (which `ProjectBuilder` already has, but the top-level helpers are inconsistent). (signatures: cargo_test_support.project(): ProjectBuilder | cargo_test_support.project_in(dir: impl AsRef<Path>): ProjectBuilder | cargo_test_support.project_in_home(name: impl AsRef<Path>): ProjectBuilder)

D35 · Change Coupling · Change coupling clique · ×1

Change coupling clique: blanket_hint_mostly_unused.rs, im_a_teapot.rs, unknown_lints.rs src/diagnostics/rules/blanket_hint_mostly_unused.rs — 3 files — `src/diagnostics/rules/blanket_hint_mostly_unused.rs`, `src/diagnostics/rules/im_a_teapot.rs`, `src/diagnostics/rules/unknown_lints.rs` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.

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

REDACTED

D4 · Code Duplication · Near-duplicate member pair (69 shared lines) · ×1

Near-duplicate member pair (69 shared lines) crates/mdman/src/format/man.rs:102 — crates/mdman/src/format/man.rs:102-380 | crates/mdman/src/format/text.rs:93-371 — These two members are variants of one another: 69 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.

D4 · Code Duplication · Near-duplicate member pair (61 shared lines) · ×1

Near-duplicate member pair (61 shared lines) src/diagnostics/rules/non_snake_case_packages.rs:86 — src/diagnostics/rules/non_snake_case_packages.rs:86-154 | src/diagnostics/rules/non_kebab_case_packages.rs:86-154 — These two members are variants of one another: 61 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.

D4 · Code Duplication · Near-duplicate member pair (44 shared lines) · ×1

Near-duplicate member pair (44 shared lines) src/diagnostics/rules/text_direction_codepoint_in_comment.rs:57 — src/diagnostics/rules/text_direction_codepoint_in_comment.rs:57-125 | src/diagnostics/rules/text_direction_codepoint_in_literal.rs:58-168 — These two members are variants of one another: 44 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.

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

Duplicated block (36 lines × 2) src/diagnostics/rules/non_kebab_case_features.rs:102 — src/diagnostics/rules/non_kebab_case_features.rs:102-137 | src/diagnostics/rules/non_snake_case_features.rs:102-137 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_features.rs` and `src/diagnostics/rules/non_snake_case_features.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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 (27 lines × 2) · ×1

Duplicated block (27 lines × 2) src/diagnostics/rules/missing_lints_features.rs:29 — src/diagnostics/rules/missing_lints_features.rs:29-55 | src/diagnostics/rules/unknown_lints.rs:60-86 — 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.

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

Duplicated block (26 lines × 2) crates/mdman/src/format/man.rs:245 — crates/mdman/src/format/man.rs:245-270 | crates/mdman/src/format/text.rs:211-236 — before extracting anything, compare `crates/mdman/src/format/man.rs` and `crates/mdman/src/format/text.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 72 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 (25 lines × 2) · ×1

Duplicated block (25 lines × 2) src/diagnostics/rules/text_direction_codepoint_in_comment.rs:58 — src/diagnostics/rules/text_direction_codepoint_in_comment.rs:58-82 | src/diagnostics/rules/text_direction_codepoint_in_literal.rs:59-83 — before extracting anything, compare `src/diagnostics/rules/text_direction_codepoint_in_comment.rs` and `src/diagnostics/rules/text_direction_codepoint_in_literal.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 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 (22–23 lines × 2) · ×1

Duplicated block (22–23 lines × 2) crates/mdman/src/format/man.rs:216 — crates/mdman/src/format/man.rs:216-238 | crates/mdman/src/format/text.rs:184-205 — before extracting anything, compare `crates/mdman/src/format/man.rs` and `crates/mdman/src/format/text.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 72 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 (22 lines × 2) · ×1

Duplicated block (22 lines × 2) src/ops/cargo_report/rebuilds.rs:43 — src/ops/cargo_report/rebuilds.rs:43-64 | src/ops/cargo_report/timings.rs:59-80 — 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.

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

Duplicated block (21–22 lines × 2) src/bin/cargo/commands/run.rs:111 — src/bin/cargo/commands/run.rs:111-131 | src/bin/cargo/commands/run.rs:145-166 — 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) src/diagnostics/rules/text_direction_codepoint_in_comment.rs:169 — src/diagnostics/rules/text_direction_codepoint_in_comment.rs:169-189 | src/diagnostics/rules/text_direction_codepoint_in_literal.rs:211-231 — before extracting anything, compare `src/diagnostics/rules/text_direction_codepoint_in_comment.rs` and `src/diagnostics/rules/text_direction_codepoint_in_literal.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 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 (20 lines × 2) · ×1

Duplicated block (20 lines × 2) src/diagnostics/rules/non_kebab_case_packages.rs:102 — src/diagnostics/rules/non_kebab_case_packages.rs:102-121 | src/diagnostics/rules/non_snake_case_packages.rs:102-121 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_packages.rs` and `src/diagnostics/rules/non_snake_case_packages.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 101 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 (15–18 lines × 2) · ×1

Duplicated block (15–18 lines × 2) src/compiler/custom_build.rs:889 — src/compiler/custom_build.rs:889-903 | src/compiler/custom_build.rs:910-927 — 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 lines × 2) · ×1

Duplicated block (18 lines × 2) src/ops/cargo_tree/graph.rs:741 — src/ops/cargo_tree/graph.rs:741-758 | src/ops/cargo_tree/graph.rs:799-816 — 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 (17–18 lines × 2) · ×1

Duplicated block (17–18 lines × 2) src/ops/cargo_update.rs:225 — src/ops/cargo_update.rs:225-241 | src/ops/cargo_update.rs:281-298 — 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 lines × 2) · ×1

Duplicated block (16 lines × 2) src/ops/cargo_vendor.rs:516 — src/ops/cargo_vendor.rs:516-531 | src/workspace/parser/mod.rs:3016-3031 — before extracting anything, compare `src/ops/cargo_vendor.rs` and `src/workspace/parser/mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

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

Duplicated block (13–15 lines × 2) src/util/semver_eval_ext.rs:200 — src/util/semver_eval_ext.rs:200-212 | src/util/semver_eval_ext.rs:231-245 — 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 lines × 2) · ×1

Duplicated block (15 lines × 2) src/diagnostics/rules/non_kebab_case_features.rs:139 — src/diagnostics/rules/non_kebab_case_features.rs:139-153 | src/diagnostics/rules/non_snake_case_features.rs:139-153 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_features.rs` and `src/diagnostics/rules/non_snake_case_features.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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–14 lines × 2) · ×1

Duplicated block (13–14 lines × 2) src/util/semver_eval_ext.rs:184 — src/util/semver_eval_ext.rs:184-197 | src/util/semver_eval_ext.rs:216-228 — 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–13 lines × 2) · ×1

Duplicated block (10–13 lines × 2) crates/mdman/src/format/man.rs:113 — crates/mdman/src/format/man.rs:113-122 | crates/mdman/src/format/text.rs:105-117 — before extracting anything, compare `crates/mdman/src/format/man.rs` and `crates/mdman/src/format/text.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 72 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–12 lines × 2) · ×1

Duplicated block (9–12 lines × 2) src/ops/cargo_update.rs:243 — src/ops/cargo_update.rs:243-251 | src/ops/cargo_update.rs:301-312 — 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) · ×1

Duplicated block (11–12 lines × 2) src/ops/cargo_vendor.rs:557 — src/ops/cargo_vendor.rs:557-567 | src/workspace/parser/mod.rs:3070-3081 — before extracting anything, compare `src/ops/cargo_vendor.rs` and `src/workspace/parser/mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

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

Duplicated block (8–11 lines × 2) src/diagnostics/rules/unused_workspace_dependencies.rs:126 — src/diagnostics/rules/unused_workspace_dependencies.rs:126-133 | src/diagnostics/rules/unused_workspace_package_fields.rs:92-102 — before extracting anything, compare `src/diagnostics/rules/unused_workspace_dependencies.rs` and `src/diagnostics/rules/unused_workspace_package_fields.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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 (8–10 lines × 3) · ×1

Duplicated block (8–10 lines × 3) src/diagnostics/rules/unused_dependencies.rs:144 — src/diagnostics/rules/unused_dependencies.rs:144-153 | src/diagnostics/rules/unused_workspace_dependencies.rs:146-153 | src/diagnostics/rules/unused_workspace_package_fields.rs:115-122 — before extracting anything, compare `src/diagnostics/rules/unused_workspace_dependencies.rs` and `src/diagnostics/rules/unused_workspace_package_fields.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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–10 lines × 2) · ×1

Duplicated block (9–10 lines × 2) src/compiler/unit_dependencies.rs:318 — src/compiler/unit_dependencies.rs:318-326 | src/compiler/unit_dependencies.rs:668-677 — 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 (9 lines × 3) · ×1

Duplicated block (9 lines × 3) src/resolver/errors.rs:158 — src/resolver/errors.rs:158-166 | src/resolver/errors.rs:183-191 | src/resolver/errors.rs:199-207 — 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 (7–9 lines × 3) · ×1

Duplicated block (7–9 lines × 3) src/diagnostics/rules/manual_readme.rs:115 — src/diagnostics/rules/manual_readme.rs:115-123 | src/diagnostics/rules/non_kebab_case_packages.rs:92-98 | src/diagnostics/rules/non_snake_case_packages.rs:92-98 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_packages.rs` and `src/diagnostics/rules/non_snake_case_packages.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 101 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 (8–9 lines × 2) · ×1

Duplicated block (8–9 lines × 2) src/sources/git/oxide.rs:384 — src/sources/git/oxide.rs:384-392 | src/sources/git/utils.rs:1698-1705 — 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.

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

Duplicated block (7–8 lines × 2) src/workspace/global_cache_tracker.rs:1056 — src/workspace/global_cache_tracker.rs:1056-1062 | src/workspace/global_cache_tracker.rs:1318-1325 — 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 (6 lines × 3) · ×1

Duplicated block (6 lines × 3) src/ops/cargo_compile/packages.rs:56 — src/ops/cargo_compile/packages.rs:56-61 | src/ops/cargo_compile/packages.rs:122-127 | src/ops/cargo_compile/packages.rs:142-147 — 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 × 4) · ×1

Duplicated block (5 lines × 4) src/ops/cargo_compile/packages.rs:58 — src/ops/cargo_compile/packages.rs:58-62 | src/ops/cargo_compile/packages.rs:124-128 | src/ops/cargo_compile/packages.rs:144-148 | src/ops/cargo_compile/packages.rs:222-226 — 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 (5 lines × 3) · ×1

Duplicated block (5 lines × 3) src/workspace/global_cache_tracker.rs:1058 — src/workspace/global_cache_tracker.rs:1058-1062 | src/workspace/global_cache_tracker.rs:1115-1119 | src/workspace/global_cache_tracker.rs:1321-1325 — 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 (10 lines × 6) · ×1

Duplicated block (10 lines × 6) src/diagnostics/rules/manual_readme.rs:74 — src/diagnostics/rules/manual_readme.rs:74-83 | src/diagnostics/rules/non_kebab_case_features.rs:68-77 | src/diagnostics/rules/non_kebab_case_packages.rs:68-77 | src/diagnostics/rules/non_snake_case_features.rs:68-77 | src/diagnostics/rules/non_snake_case_packages.rs:68-77 | src/diagnostics/rules/redundant_homepage.rs:71-80 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_features.rs` and `src/diagnostics/rules/non_snake_case_features.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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 (19 lines × 2) · ×1

Duplicated block (19 lines × 2) src/workspace/parser/mod.rs:463 — src/workspace/parser/mod.rs:463-481 | src/workspace/parser/mod.rs:516-534 — 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 × 5) · ×1

Duplicated block (8 lines × 5) src/diagnostics/rules/non_kebab_case_features.rs:96 — src/diagnostics/rules/non_kebab_case_features.rs:96-103 | src/diagnostics/rules/non_kebab_case_packages.rs:96-103 | src/diagnostics/rules/non_snake_case_features.rs:96-103 | src/diagnostics/rules/non_snake_case_packages.rs:96-103 | src/diagnostics/rules/redundant_homepage.rs:112-119 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_features.rs` and `src/diagnostics/rules/non_snake_case_features.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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 × 6) · ×1

Duplicated block (7 lines × 6) src/diagnostics/rules/non_kebab_case_features.rs:97 — src/diagnostics/rules/non_kebab_case_features.rs:97-104 | src/diagnostics/rules/non_kebab_case_packages.rs:97-104 | src/diagnostics/rules/non_snake_case_features.rs:97-104 | src/diagnostics/rules/non_snake_case_packages.rs:97-104 | src/diagnostics/rules/redundant_homepage.rs:113-120 | src/diagnostics/rules/unused_dependencies.rs:130-136 — before extracting anything, compare `src/diagnostics/rules/non_kebab_case_features.rs` and `src/diagnostics/rules/non_snake_case_features.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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.

Minor — 14 finding(s)

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

Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 23 significant file(s) lose their only recent owner: src/ops/cargo_tree/graph.rs, src/util/progress.rs, crates/cargo-util-schemas/src/index.rs, src/diagnostics/lint.rs, src/lib.rs, src/util/diagnostic_server.rs, src/diagnostics/rules/text_direction_codepoint_in_literal.rs, src/diagnostics/passes.rs (+15 more). 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 (29 single-owned of 244 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; 244 of the 292 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (2 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 27 project(s) overshoot their size bounds, lowering Project Cohesion to 9.3/10. The most over is `(repository root)` (97819 LoC, 608 public types across 34 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

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

REDACTED

D34 · Knowledge Freshness · Orphaned files with no living knowledge · ×1

Orphaned files with no living knowledge — 12 of 244 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (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; 244 of the 292 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: credential/cargo-credential/src/lib.rs, crates/resolver-tests/src/helpers.rs, crates/cargo-util/src/read2.rs, credential/cargo-credential/src/error.rs, credential/cargo-credential-wincred/src/lib.rs, src/util/lockserver.rs, credential/cargo-credential/src/stdio.rs, src/util/edit_distance.rs (and 4 more). 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.

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

REDACTED

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

REDACTED

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

REDACTED

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

REDACTED

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.

P2 · Observability · Logging is not universal · ×1

Logging is not universal — Only 3/13 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `crates/cargo-test-support`, `crates/mdman`, `crates/semver-check`, `crates/xtask-build-man` and 5 more.

S1 · Web-Security Posture · No security response headers detected · ×1

No security response headers detected crates/cargo-test-support/containers/apache/Dockerfile:1 — No Content-Security-Policy / X-Frame-Options / X-Content-Type-Options configuration found — defense in depth, even when a reverse proxy could set them. This is reported because `Dockerfile` builds the web-server image that serves this application, so the configuration that would carry these headers is in this repository and was read in full. (−2.0 on this card.)

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-ae98870f8c2d4fc39ad554d7f77cf59a/history.json --exit-code 0 --source .	6	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-ae98870f8c2d4fc39ad554d7f77cf59a/tree.json --exit-code 0 --source .	0	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 .	1	artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilities	osv-scanner	—	osv-scanner --format json --recursive .	0	artifacts/raw/osv-scanner.json
D31 · IaC & Container Security	trivy	—	trivy config --format json --quiet .	0	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	artifacts/raw/osv-scanner.json

Run 01a0ea58-ad70-72d6-9899-33f50f8bf6a0 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Rust-Lang/cargo

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% · Adequate · gated by D2 ·

At a glance — Architecture · 70% · Adequate · gated by AX7 ·

At a glance — Maturity · 66% · Adequate · gated by M2 ·

At a glance — Readiness · 66% · Strong ·

At a glance — Security · 81% · Adequate · gated by D36 ·

At a glance — Domain Modelling · 100% · Exemplary ·

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

Reference — by lens

Appendix A — Findings (grouped)

Appendix B — Reproduction & audit trail

Downloadable artifacts