Public report of rust-lang/miri, published 27 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 27 October 2026, 17:31 UTC · Survey ID cd_d0e0369197dc4779800859fd024ea59d
rust-lang/miri
Measured 27 October 2026, 17:26 UTC, at code version 79c8b3a
No regression since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Up 2 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 57,648 lines of product code in 15 projects, tests not counted · Estimated rebuild effort: about 0.9 person-years · Weakest lens: Maturity, 59
Findings by how serious they are
20 critical651 serious49 minor
15 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
27 October 2026, 17:26 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
58of 58 dimensions measured by tools.
695of 720 findings point to an exact file and line, so you can open each one in the code. The other 25 concern the repository as a whole, such as missing documentation.
58dimensions across 6 lenses, read from 57,648 lines of product code in 15 projects.
rust-lang/miri falls short of our standard for production, in part because we found no recorded design decisions and no architecture document or diagram. It scores 63 out of 100 and is rated Adequate, and all 20 of its critical findings are security problems in the build pipeline.
Maturity, at 59, is the weakest lens, level with Production Readiness, and counts most in the score. The best first step is recording design decisions, worth about 4 points. Raising Maturity to 70 would lift the score to about 65.
Fourteen pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Five pipeline steps install packages that can change without warning. Pinning each tool to an exact version and pinning what the pipeline installs would close both risks. Passing outside input through environment variables would fix the pipeline step that puts outside input straight into a shell command.
The product code is 57,648 lines, about €130,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Maturity rose from 59 to 70, the lowest score rated Strong, the score would rise from 63 to about 65.
Code composition: what the lines of code are
Product code 50%Tests 50%
New since the last survey: 109 findings
These 109 critical or serious findings weren't in the previous survey, on 13 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 123 findings
These 123 critical or serious findings were in the previous survey, on 13 October 2026, and are gone from this one. The first 100 are listed here.
€43,000 to €220,000, for 722 to 2,289 hours of work, about 0.9 person-years for 1 to 2 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.9 at a score of 63. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 57,648 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 4 points · Low effort · ADR Quality
2
Record your significant design decisions.
Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €130,000 to build again, about 0.9 person-years of work. Its weakest lens is Maturity, at 59 (Adequate). Maturity is about how well the project explains and looks after itself, which decides whether a new developer, or a new supplier, can take over. Because the weakest lens counts most in the score, work on Maturity also moves the score most.
Based on: the rebuild estimate · the Maturity grade · how much each lens counts
What to do: Start with the Maturity actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 4 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.1 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 32,631 lines over the last 90 days, which is about 132,337 lines a year. At that pace, the extra work comes to an estimated 7.4 to 44.6 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
155 modules, with 316 dependencies between them. 3 loops run through 37 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 115 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
miri.borrow_tracker.stacked_borrows.item uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.borrow_tracker.stacked_borrows.item, while a change to miri.borrow_tracker.stacked_borrows.item can't break miri.borrow_tracker.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.borrow_tracker.tree_borrows.wildcard uses miri.borrow_tracker.tree_borrows.unimap, so a change to miri.borrow_tracker.tree_borrows.unimap can break miri.borrow_tracker.tree_borrows.wildcard, while a change to miri.borrow_tracker.tree_borrows.wildcard can't break miri.borrow_tracker.tree_borrows.unimap.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.wildcard uses a module listed above it, which is the healthy direction.
4→8 miri.borrow_tracker.tree_borrows.wildcard uses miri.borrow_tracker.tree_borrows.treepart of a loop✕
Connections
1 pair of types, where a type in miri.borrow_tracker.tree_borrows.wildcard uses a type in miri.borrow_tracker.tree_borrows.tree.
miri.borrow_tracker.tree_borrows.wildcard uses miri.borrow_tracker.tree_borrows.tree, so a change to miri.borrow_tracker.tree_borrows.tree can break miri.borrow_tracker.tree_borrows.wildcard, while a change to miri.borrow_tracker.tree_borrows.wildcard can't break miri.borrow_tracker.tree_borrows.tree.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
4→31 miri.borrow_tracker.tree_borrows.wildcard uses miri.borrow_trackerpart of a loop✕
Connections
2 pairs of types, where a type in miri.borrow_tracker.tree_borrows.wildcard uses a type in miri.borrow_tracker.
miri.borrow_tracker.tree_borrows.wildcard uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.borrow_tracker.tree_borrows.wildcard, while a change to miri.borrow_tracker.tree_borrows.wildcard can't break miri.borrow_tracker.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
5→28 miri.concurrency.vector_clock uses miri.concurrency.data_racepart of a loop✕
Connections
1 pair of types, where a type in miri.concurrency.vector_clock uses a type in miri.concurrency.data_race.
miri.concurrency.vector_clock uses miri.concurrency.data_race, so a change to miri.concurrency.data_race can break miri.concurrency.vector_clock, while a change to miri.concurrency.vector_clock can't break miri.concurrency.data_race.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
6→9 miri.eval uses miri.concurrency.genmc.configpart of a loop✕
Connections
1 pair of types, where a type in miri.eval uses a type in miri.concurrency.genmc.config.
miri.eval uses miri.concurrency.genmc.config, so a change to miri.concurrency.genmc.config can break miri.eval, while a change to miri.eval can't break miri.concurrency.genmc.config.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
6→13 miri.eval uses miri.concurrency.genmc.dummypart of a loop✕
Connections
1 pair of types, where a type in miri.eval uses a type in miri.concurrency.genmc.dummy.
miri.eval uses miri.concurrency.genmc.dummy, so a change to miri.concurrency.genmc.dummy can break miri.eval, while a change to miri.eval can't break miri.concurrency.genmc.dummy.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.eval uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.eval, while a change to miri.eval can't break miri.borrow_tracker.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
6→33 miri.eval uses miri.alloc_addressespart of a loop✕
Connections
1 pair of types, where a type in miri.eval uses a type in miri.alloc_addresses.
miri.eval uses miri.alloc_addresses, so a change to miri.alloc_addresses can break miri.eval, while a change to miri.eval can't break miri.alloc_addresses.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
7→21 miri.shims.sig uses miri.machinepart of a loop✕
Connections
1 pair of types, where a type in miri.shims.sig uses a type in miri.machine.
miri.borrow_tracker.tree_borrows.tree uses miri.borrow_tracker.tree_borrows.unimap, so a change to miri.borrow_tracker.tree_borrows.unimap can break miri.borrow_tracker.tree_borrows.tree, while a change to miri.borrow_tracker.tree_borrows.tree can't break miri.borrow_tracker.tree_borrows.unimap.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.tree uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows.tree uses miri.borrow_tracker.stacked_borrows.item, so a change to miri.borrow_tracker.stacked_borrows.item can break miri.borrow_tracker.tree_borrows.tree, while a change to miri.borrow_tracker.tree_borrows.tree can't break miri.borrow_tracker.stacked_borrows.item.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.tree uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows.tree uses miri.borrow_tracker.tree_borrows.wildcard, so a change to miri.borrow_tracker.tree_borrows.wildcard can break miri.borrow_tracker.tree_borrows.tree, while a change to miri.borrow_tracker.tree_borrows.tree can't break miri.borrow_tracker.tree_borrows.wildcard.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.tree uses a module listed above it, which is the healthy direction.
8→12 miri.borrow_tracker.tree_borrows.tree uses miri.borrow_tracker.tree_borrows.foreign_access_skippingpart of a loop✕
Connections
3 pairs of types, where a type in miri.borrow_tracker.tree_borrows.tree uses a type in miri.borrow_tracker.tree_borrows.foreign_access_skipping.
miri.borrow_tracker.tree_borrows.tree uses miri.borrow_tracker.tree_borrows.foreign_access_skipping, so a change to miri.borrow_tracker.tree_borrows.foreign_access_skipping can break miri.borrow_tracker.tree_borrows.tree, while a change to miri.borrow_tracker.tree_borrows.tree can't break miri.borrow_tracker.tree_borrows.foreign_access_skipping.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
8→16 miri.borrow_tracker.tree_borrows.tree uses miri.borrow_tracker.tree_borrows.diagnosticspart of a loop✕
Connections
4 pairs of types, where a type in miri.borrow_tracker.tree_borrows.tree uses a type in miri.borrow_tracker.tree_borrows.diagnostics.
miri.borrow_tracker.tree_borrows.tree uses miri.borrow_tracker.tree_borrows.diagnostics, so a change to miri.borrow_tracker.tree_borrows.diagnostics can break miri.borrow_tracker.tree_borrows.tree, while a change to miri.borrow_tracker.tree_borrows.tree can't break miri.borrow_tracker.tree_borrows.diagnostics.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
8→21 miri.borrow_tracker.tree_borrows.tree uses miri.machinepart of a loop✕
Connections
2 pairs of types, where a type in miri.borrow_tracker.tree_borrows.tree uses a type in miri.machine.
miri.borrow_tracker.tree_borrows.tree uses miri.machine, so a change to miri.machine can break miri.borrow_tracker.tree_borrows.tree, while a change to miri.borrow_tracker.tree_borrows.tree can't break miri.machine.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
8→22 miri.borrow_tracker.tree_borrows.tree uses miri.provenance_gcpart of a loop✕
Connections
1 pair of types, where a type in miri.borrow_tracker.tree_borrows.tree uses a type in miri.provenance_gc.
miri.borrow_tracker.tree_borrows.tree uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.borrow_tracker.tree_borrows.tree, while a change to miri.borrow_tracker.tree_borrows.tree can't break miri.provenance_gc.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
8→28 miri.borrow_tracker.tree_borrows.tree uses miri.concurrency.data_racepart of a loop✕
Connections
2 pairs of types, where a type in miri.borrow_tracker.tree_borrows.tree uses a type in miri.concurrency.data_race.
miri.borrow_tracker.tree_borrows.tree uses miri.concurrency.data_race, so a change to miri.concurrency.data_race can break miri.borrow_tracker.tree_borrows.tree, while a change to miri.borrow_tracker.tree_borrows.tree can't break miri.concurrency.data_race.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
8→31 miri.borrow_tracker.tree_borrows.tree uses miri.borrow_trackerpart of a loop✕
Connections
6 pairs of types, where a type in miri.borrow_tracker.tree_borrows.tree uses a type in miri.borrow_tracker.
miri.borrow_tracker.tree_borrows.tree uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.borrow_tracker.tree_borrows.tree, while a change to miri.borrow_tracker.tree_borrows.tree can't break miri.borrow_tracker.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
8→33 miri.borrow_tracker.tree_borrows.tree uses miri.alloc_addressespart of a loop✕
Connections
1 pair of types, where a type in miri.borrow_tracker.tree_borrows.tree uses a type in miri.alloc_addresses.
miri.borrow_tracker.tree_borrows.tree uses miri.alloc_addresses, so a change to miri.alloc_addresses can break miri.borrow_tracker.tree_borrows.tree, while a change to miri.borrow_tracker.tree_borrows.tree can't break miri.alloc_addresses.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.concurrency.genmc.config uses genmc_sys.ffi, so a change to genmc_sys.ffi can break miri.concurrency.genmc.config, while a change to miri.concurrency.genmc.config can't break genmc_sys.ffi.
Position
Below the diagonal: miri.concurrency.genmc.config uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc.config uses miri.eval, so a change to miri.eval can break miri.concurrency.genmc.config, while a change to miri.concurrency.genmc.config can't break miri.eval.
Position
Below the diagonal: miri.concurrency.genmc.config uses a module listed above it, which is the healthy direction.
miri.shims.env uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.shims.env, while a change to miri.shims.env can't break miri.provenance_gc.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
10→26 miri.shims.env uses miri.concurrency.threadpart of a loop✕
Connections
1 pair of types, where a type in miri.shims.env uses a type in miri.concurrency.thread.
miri.shims.env uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.shims.env, while a change to miri.shims.env can't break miri.concurrency.thread.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.shims.unix.fd uses miri.shims.sig, so a change to miri.shims.sig can break miri.shims.unix.fd, while a change to miri.shims.unix.fd can't break miri.shims.sig.
Position
Below the diagonal: miri.shims.unix.fd uses a module listed above it, which is the healthy direction.
11→18 miri.shims.unix.fd uses miri.shims.filespart of a loop✕
Connections
2 pairs of types, where a type in miri.shims.unix.fd uses a type in miri.shims.files.
miri.shims.unix.fd uses miri.shims.files, so a change to miri.shims.files can break miri.shims.unix.fd, while a change to miri.shims.unix.fd can't break miri.shims.files.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
11→21 miri.shims.unix.fd uses miri.machinepart of a loop✕
Connections
2 pairs of types, where a type in miri.shims.unix.fd uses a type in miri.machine.
miri.shims.unix.fd uses miri.machine, so a change to miri.machine can break miri.shims.unix.fd, while a change to miri.shims.unix.fd can't break miri.machine.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.borrow_tracker.tree_borrows.foreign_access_skipping uses miri.borrow_tracker.tree_borrows.tree, so a change to miri.borrow_tracker.tree_borrows.tree can break miri.borrow_tracker.tree_borrows.foreign_access_skipping, while a change to miri.borrow_tracker.tree_borrows.foreign_access_skipping can't break miri.borrow_tracker.tree_borrows.tree.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.foreign_access_skipping uses a module listed above it, which is the healthy direction.
12→31 miri.borrow_tracker.tree_borrows.foreign_access_skipping uses miri.borrow_trackerpart of a loop✕
Connections
1 pair of types, where a type in miri.borrow_tracker.tree_borrows.foreign_access_skipping uses a type in miri.borrow_tracker.
miri.borrow_tracker.tree_borrows.foreign_access_skipping uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.borrow_tracker.tree_borrows.foreign_access_skipping, while a change to miri.borrow_tracker.tree_borrows.foreign_access_skipping can't break miri.borrow_tracker.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.concurrency.genmc.dummy uses miri.eval, so a change to miri.eval can break miri.concurrency.genmc.dummy, while a change to miri.concurrency.genmc.dummy can't break miri.eval.
Position
Below the diagonal: miri.concurrency.genmc.dummy uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc.dummy uses miri.concurrency.genmc.config, so a change to miri.concurrency.genmc.config can break miri.concurrency.genmc.dummy, while a change to miri.concurrency.genmc.dummy can't break miri.concurrency.genmc.config.
Position
Below the diagonal: miri.concurrency.genmc.dummy uses a module listed above it, which is the healthy direction.
13→21 miri.concurrency.genmc.dummy uses miri.machinepart of a loop✕
Connections
1 pair of types, where a type in miri.concurrency.genmc.dummy uses a type in miri.machine.
miri.concurrency.genmc.dummy uses miri.machine, so a change to miri.machine can break miri.concurrency.genmc.dummy, while a change to miri.concurrency.genmc.dummy can't break miri.machine.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
13→22 miri.concurrency.genmc.dummy uses miri.provenance_gcpart of a loop✕
Connections
1 pair of types, where a type in miri.concurrency.genmc.dummy uses a type in miri.provenance_gc.
miri.concurrency.genmc.dummy uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.concurrency.genmc.dummy, while a change to miri.concurrency.genmc.dummy can't break miri.provenance_gc.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
13→26 miri.concurrency.genmc.dummy uses miri.concurrency.threadpart of a loop✕
Connections
2 pairs of types, where a type in miri.concurrency.genmc.dummy uses a type in miri.concurrency.thread.
miri.concurrency.genmc.dummy uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.concurrency.genmc.dummy, while a change to miri.concurrency.genmc.dummy can't break miri.concurrency.thread.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
13→28 miri.concurrency.genmc.dummy uses miri.concurrency.data_racepart of a loop✕
Connections
4 pairs of types, where a type in miri.concurrency.genmc.dummy uses a type in miri.concurrency.data_race.
miri.concurrency.genmc.dummy uses miri.concurrency.data_race, so a change to miri.concurrency.data_race can break miri.concurrency.genmc.dummy, while a change to miri.concurrency.genmc.dummy can't break miri.concurrency.data_race.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.borrow_tracker.tree_borrows.perms uses miri.borrow_tracker.stacked_borrows.item, so a change to miri.borrow_tracker.stacked_borrows.item can break miri.borrow_tracker.tree_borrows.perms, while a change to miri.borrow_tracker.tree_borrows.perms can't break miri.borrow_tracker.stacked_borrows.item.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.perms uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows.perms uses miri.borrow_tracker.tree_borrows.wildcard, so a change to miri.borrow_tracker.tree_borrows.wildcard can break miri.borrow_tracker.tree_borrows.perms, while a change to miri.borrow_tracker.tree_borrows.perms can't break miri.borrow_tracker.tree_borrows.wildcard.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.perms uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows.perms uses miri.borrow_tracker.tree_borrows.tree, so a change to miri.borrow_tracker.tree_borrows.tree can break miri.borrow_tracker.tree_borrows.perms, while a change to miri.borrow_tracker.tree_borrows.perms can't break miri.borrow_tracker.tree_borrows.tree.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.perms uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows.perms uses miri.borrow_tracker.tree_borrows.foreign_access_skipping, so a change to miri.borrow_tracker.tree_borrows.foreign_access_skipping can break miri.borrow_tracker.tree_borrows.perms, while a change to miri.borrow_tracker.tree_borrows.perms can't break miri.borrow_tracker.tree_borrows.foreign_access_skipping.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.perms uses a module listed above it, which is the healthy direction.
14→16 miri.borrow_tracker.tree_borrows.perms uses miri.borrow_tracker.tree_borrows.diagnosticspart of a loop✕
Connections
1 pair of types, where a type in miri.borrow_tracker.tree_borrows.perms uses a type in miri.borrow_tracker.tree_borrows.diagnostics.
miri.borrow_tracker.tree_borrows.perms uses miri.borrow_tracker.tree_borrows.diagnostics, so a change to miri.borrow_tracker.tree_borrows.diagnostics can break miri.borrow_tracker.tree_borrows.perms, while a change to miri.borrow_tracker.tree_borrows.perms can't break miri.borrow_tracker.tree_borrows.diagnostics.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
14→31 miri.borrow_tracker.tree_borrows.perms uses miri.borrow_trackerpart of a loop✕
Connections
1 pair of types, where a type in miri.borrow_tracker.tree_borrows.perms uses a type in miri.borrow_tracker.
miri.borrow_tracker.tree_borrows.perms uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.borrow_tracker.tree_borrows.perms, while a change to miri.borrow_tracker.tree_borrows.perms can't break miri.borrow_tracker.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.concurrency.data_race_handler uses miri.concurrency.genmc.dummy, so a change to miri.concurrency.genmc.dummy can break miri.concurrency.data_race_handler, while a change to miri.concurrency.data_race_handler can't break miri.concurrency.genmc.dummy.
Position
Below the diagonal: miri.concurrency.data_race_handler uses a module listed above it, which is the healthy direction.
15→22 miri.concurrency.data_race_handler uses miri.provenance_gcpart of a loop✕
Connections
2 pairs of types, where a type in miri.concurrency.data_race_handler uses a type in miri.provenance_gc.
miri.concurrency.data_race_handler uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.concurrency.data_race_handler, while a change to miri.concurrency.data_race_handler can't break miri.provenance_gc.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
15→28 miri.concurrency.data_race_handler uses miri.concurrency.data_racepart of a loop✕
Connections
1 pair of types, where a type in miri.concurrency.data_race_handler uses a type in miri.concurrency.data_race.
miri.concurrency.data_race_handler uses miri.concurrency.data_race, so a change to miri.concurrency.data_race can break miri.concurrency.data_race_handler, while a change to miri.concurrency.data_race_handler can't break miri.concurrency.data_race.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
15→31 miri.concurrency.data_race_handler uses miri.borrow_trackerpart of a loop✕
Connections
1 pair of types, where a type in miri.concurrency.data_race_handler uses a type in miri.borrow_tracker.
miri.concurrency.data_race_handler uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.concurrency.data_race_handler, while a change to miri.concurrency.data_race_handler can't break miri.borrow_tracker.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.borrow_tracker.tree_borrows.diagnostics uses miri.borrow_tracker.tree_borrows.unimap, so a change to miri.borrow_tracker.tree_borrows.unimap can break miri.borrow_tracker.tree_borrows.diagnostics, while a change to miri.borrow_tracker.tree_borrows.diagnostics can't break miri.borrow_tracker.tree_borrows.unimap.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.diagnostics uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows.diagnostics uses miri.borrow_tracker.stacked_borrows.item, so a change to miri.borrow_tracker.stacked_borrows.item can break miri.borrow_tracker.tree_borrows.diagnostics, while a change to miri.borrow_tracker.tree_borrows.diagnostics can't break miri.borrow_tracker.stacked_borrows.item.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.diagnostics uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows.diagnostics uses miri.borrow_tracker.tree_borrows.tree, so a change to miri.borrow_tracker.tree_borrows.tree can break miri.borrow_tracker.tree_borrows.diagnostics, while a change to miri.borrow_tracker.tree_borrows.diagnostics can't break miri.borrow_tracker.tree_borrows.tree.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.diagnostics uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows.diagnostics uses miri.borrow_tracker.tree_borrows.perms, so a change to miri.borrow_tracker.tree_borrows.perms can break miri.borrow_tracker.tree_borrows.diagnostics, while a change to miri.borrow_tracker.tree_borrows.diagnostics can't break miri.borrow_tracker.tree_borrows.perms.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows.diagnostics uses a module listed above it, which is the healthy direction.
16→31 miri.borrow_tracker.tree_borrows.diagnostics uses miri.borrow_trackerpart of a loop✕
Connections
5 pairs of types, where a type in miri.borrow_tracker.tree_borrows.diagnostics uses a type in miri.borrow_tracker.
miri.borrow_tracker.tree_borrows.diagnostics uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.borrow_tracker.tree_borrows.diagnostics, while a change to miri.borrow_tracker.tree_borrows.diagnostics can't break miri.borrow_tracker.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.shims.readiness uses miri.concurrency.vector_clock, so a change to miri.concurrency.vector_clock can break miri.shims.readiness, while a change to miri.shims.readiness can't break miri.concurrency.vector_clock.
Position
Below the diagonal: miri.shims.readiness uses a module listed above it, which is the healthy direction.
miri.shims.readiness uses miri.borrow_tracker.tree_borrows.diagnostics, so a change to miri.borrow_tracker.tree_borrows.diagnostics can break miri.shims.readiness, while a change to miri.shims.readiness can't break miri.borrow_tracker.tree_borrows.diagnostics.
Position
Below the diagonal: miri.shims.readiness uses a module listed above it, which is the healthy direction.
17→18 miri.shims.readiness uses miri.shims.filespart of a loop✕
Connections
2 pairs of types, where a type in miri.shims.readiness uses a type in miri.shims.files.
miri.shims.readiness uses miri.shims.files, so a change to miri.shims.files can break miri.shims.readiness, while a change to miri.shims.readiness can't break miri.shims.files.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
17→21 miri.shims.readiness uses miri.machinepart of a loop✕
Connections
2 pairs of types, where a type in miri.shims.readiness uses a type in miri.machine.
miri.shims.readiness uses miri.machine, so a change to miri.machine can break miri.shims.readiness, while a change to miri.shims.readiness can't break miri.machine.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
17→22 miri.shims.readiness uses miri.provenance_gcpart of a loop✕
Connections
1 pair of types, where a type in miri.shims.readiness uses a type in miri.provenance_gc.
miri.shims.readiness uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.shims.readiness, while a change to miri.shims.readiness can't break miri.provenance_gc.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
17→26 miri.shims.readiness uses miri.concurrency.threadpart of a loop✕
Connections
1 pair of types, where a type in miri.shims.readiness uses a type in miri.concurrency.thread.
miri.shims.readiness uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.shims.readiness, while a change to miri.shims.readiness can't break miri.concurrency.thread.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.shims.files uses miri.shims.unix.fd, so a change to miri.shims.unix.fd can break miri.shims.files, while a change to miri.shims.files can't break miri.shims.unix.fd.
Position
Below the diagonal: miri.shims.files uses a module listed above it, which is the healthy direction.
miri.shims.files uses miri.shims.readiness, so a change to miri.shims.readiness can break miri.shims.files, while a change to miri.shims.files can't break miri.shims.readiness.
Position
Below the diagonal: miri.shims.files uses a module listed above it, which is the healthy direction.
18→21 miri.shims.files uses miri.machinepart of a loop✕
Connections
1 pair of types, where a type in miri.shims.files uses a type in miri.machine.
miri.shims.files uses miri.machine, so a change to miri.machine can break miri.shims.files, while a change to miri.shims.files can't break miri.machine.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
18→22 miri.shims.files uses miri.provenance_gcpart of a loop✕
Connections
2 pairs of types, where a type in miri.shims.files uses a type in miri.provenance_gc.
miri.shims.files uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.shims.files, while a change to miri.shims.files can't break miri.provenance_gc.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.concurrency.blocking_io uses miri.shims.readiness, so a change to miri.shims.readiness can break miri.concurrency.blocking_io, while a change to miri.concurrency.blocking_io can't break miri.shims.readiness.
Position
Below the diagonal: miri.concurrency.blocking_io uses a module listed above it, which is the healthy direction.
miri.concurrency.blocking_io uses miri.shims.files, so a change to miri.shims.files can break miri.concurrency.blocking_io, while a change to miri.concurrency.blocking_io can't break miri.shims.files.
Position
Below the diagonal: miri.concurrency.blocking_io uses a module listed above it, which is the healthy direction.
19→21 miri.concurrency.blocking_io uses miri.machinepart of a loop✕
Connections
1 pair of types, where a type in miri.concurrency.blocking_io uses a type in miri.machine.
miri.concurrency.blocking_io uses miri.machine, so a change to miri.machine can break miri.concurrency.blocking_io, while a change to miri.concurrency.blocking_io can't break miri.machine.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
19→24 miri.concurrency.blocking_io uses miri.clockpart of a loop✕
Connections
1 pair of types, where a type in miri.concurrency.blocking_io uses a type in miri.clock.
miri.concurrency.blocking_io uses miri.clock, so a change to miri.clock can break miri.concurrency.blocking_io, while a change to miri.concurrency.blocking_io can't break miri.clock.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
19→26 miri.concurrency.blocking_io uses miri.concurrency.threadpart of a loop✕
Connections
1 pair of types, where a type in miri.concurrency.blocking_io uses a type in miri.concurrency.thread.
miri.concurrency.blocking_io uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.concurrency.blocking_io, while a change to miri.concurrency.blocking_io can't break miri.concurrency.thread.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.shims.unix.fs uses miri.shims.sig, so a change to miri.shims.sig can break miri.shims.unix.fs, while a change to miri.shims.unix.fs can't break miri.shims.sig.
Position
Below the diagonal: miri.shims.unix.fs uses a module listed above it, which is the healthy direction.
miri.shims.unix.fs uses miri.shims.files, so a change to miri.shims.files can break miri.shims.unix.fs, while a change to miri.shims.unix.fs can't break miri.shims.files.
Position
Below the diagonal: miri.shims.unix.fs uses a module listed above it, which is the healthy direction.
20→21 miri.shims.unix.fs uses miri.machinepart of a loop✕
Connections
2 pairs of types, where a type in miri.shims.unix.fs uses a type in miri.machine.
miri.shims.unix.fs uses miri.machine, so a change to miri.machine can break miri.shims.unix.fs, while a change to miri.shims.unix.fs can't break miri.machine.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
20→22 miri.shims.unix.fs uses miri.provenance_gcpart of a loop✕
Connections
1 pair of types, where a type in miri.shims.unix.fs uses a type in miri.provenance_gc.
miri.shims.unix.fs uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.shims.unix.fs, while a change to miri.shims.unix.fs can't break miri.provenance_gc.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.machine uses miri.concurrency.genmc.dummy, so a change to miri.concurrency.genmc.dummy can break miri.machine, while a change to miri.machine can't break miri.concurrency.genmc.dummy.
Position
Below the diagonal: miri.machine uses a module listed above it, which is the healthy direction.
miri.machine uses miri.concurrency.data_race_handler, so a change to miri.concurrency.data_race_handler can break miri.machine, while a change to miri.machine can't break miri.concurrency.data_race_handler.
Position
Below the diagonal: miri.machine uses a module listed above it, which is the healthy direction.
miri.machine uses miri.shims.readiness, so a change to miri.shims.readiness can break miri.machine, while a change to miri.machine can't break miri.shims.readiness.
Position
Below the diagonal: miri.machine uses a module listed above it, which is the healthy direction.
miri.machine uses miri.shims.files, so a change to miri.shims.files can break miri.machine, while a change to miri.machine can't break miri.shims.files.
Position
Below the diagonal: miri.machine uses a module listed above it, which is the healthy direction.
miri.machine uses miri.concurrency.blocking_io, so a change to miri.concurrency.blocking_io can break miri.machine, while a change to miri.machine can't break miri.concurrency.blocking_io.
Position
Below the diagonal: miri.machine uses a module listed above it, which is the healthy direction.
miri.machine uses miri.shims.unix.fs, so a change to miri.shims.unix.fs can break miri.machine, while a change to miri.machine can't break miri.shims.unix.fs.
Position
Below the diagonal: miri.machine uses a module listed above it, which is the healthy direction.
21→22 miri.machine uses miri.provenance_gcpart of a loop✕
Connections
5 pairs of types, where a type in miri.machine uses a type in miri.provenance_gc.
miri.machine uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.machine, while a change to miri.machine can't break miri.provenance_gc.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.machine uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.machine, while a change to miri.machine can't break miri.concurrency.thread.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
21→28 miri.machine uses miri.concurrency.data_racepart of a loop✕
Connections
1 pair of types, where a type in miri.machine uses a type in miri.concurrency.data_race.
miri.machine uses miri.concurrency.data_race, so a change to miri.concurrency.data_race can break miri.machine, while a change to miri.machine can't break miri.concurrency.data_race.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
21→31 miri.machine uses miri.borrow_trackerpart of a loop✕
Connections
2 pairs of types, where a type in miri.machine uses a type in miri.borrow_tracker.
miri.machine uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.machine, while a change to miri.machine can't break miri.borrow_tracker.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.provenance_gc uses miri.machine, so a change to miri.machine can break miri.provenance_gc, while a change to miri.provenance_gc can't break miri.machine.
Position
Below the diagonal: miri.provenance_gc uses a module listed above it, which is the healthy direction.
miri.shims.unix.socket uses miri.shims.unix.fd, so a change to miri.shims.unix.fd can break miri.shims.unix.socket, while a change to miri.shims.unix.socket can't break miri.shims.unix.fd.
Position
Below the diagonal: miri.shims.unix.socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.socket uses miri.shims.files, so a change to miri.shims.files can break miri.shims.unix.socket, while a change to miri.shims.unix.socket can't break miri.shims.files.
Position
Below the diagonal: miri.shims.unix.socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.socket uses miri.machine, so a change to miri.machine can break miri.shims.unix.socket, while a change to miri.shims.unix.socket can't break miri.machine.
Position
Below the diagonal: miri.shims.unix.socket uses a module listed above it, which is the healthy direction.
miri.clock uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.clock, while a change to miri.clock can't break miri.provenance_gc.
Position
Below the diagonal: miri.clock uses a module listed above it, which is the healthy direction.
miri.shims.unix.udp_socket uses miri.shims.unix.fd, so a change to miri.shims.unix.fd can break miri.shims.unix.udp_socket, while a change to miri.shims.unix.udp_socket can't break miri.shims.unix.fd.
Position
Below the diagonal: miri.shims.unix.udp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.udp_socket uses miri.shims.readiness, so a change to miri.shims.readiness can break miri.shims.unix.udp_socket, while a change to miri.shims.unix.udp_socket can't break miri.shims.readiness.
Position
Below the diagonal: miri.shims.unix.udp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.udp_socket uses miri.shims.files, so a change to miri.shims.files can break miri.shims.unix.udp_socket, while a change to miri.shims.unix.udp_socket can't break miri.shims.files.
Position
Below the diagonal: miri.shims.unix.udp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.udp_socket uses miri.concurrency.blocking_io, so a change to miri.concurrency.blocking_io can break miri.shims.unix.udp_socket, while a change to miri.shims.unix.udp_socket can't break miri.concurrency.blocking_io.
Position
Below the diagonal: miri.shims.unix.udp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.udp_socket uses miri.shims.unix.socket, so a change to miri.shims.unix.socket can break miri.shims.unix.udp_socket, while a change to miri.shims.unix.udp_socket can't break miri.shims.unix.socket.
Position
Below the diagonal: miri.shims.unix.udp_socket uses a module listed above it, which is the healthy direction.
miri.concurrency.thread uses miri.eval, so a change to miri.eval can break miri.concurrency.thread, while a change to miri.concurrency.thread can't break miri.eval.
Position
Below the diagonal: miri.concurrency.thread uses a module listed above it, which is the healthy direction.
miri.concurrency.thread uses miri.machine, so a change to miri.machine can break miri.concurrency.thread, while a change to miri.concurrency.thread can't break miri.machine.
Position
Below the diagonal: miri.concurrency.thread uses a module listed above it, which is the healthy direction.
miri.concurrency.thread uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.concurrency.thread, while a change to miri.concurrency.thread can't break miri.provenance_gc.
Position
Below the diagonal: miri.concurrency.thread uses a module listed above it, which is the healthy direction.
miri.concurrency.thread uses miri.clock, so a change to miri.clock can break miri.concurrency.thread, while a change to miri.concurrency.thread can't break miri.clock.
Position
Below the diagonal: miri.concurrency.thread uses a module listed above it, which is the healthy direction.
miri.shims.unix.tcp_socket uses miri.shims.sig, so a change to miri.shims.sig can break miri.shims.unix.tcp_socket, while a change to miri.shims.unix.tcp_socket can't break miri.shims.sig.
Position
Below the diagonal: miri.shims.unix.tcp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.tcp_socket uses miri.shims.unix.fd, so a change to miri.shims.unix.fd can break miri.shims.unix.tcp_socket, while a change to miri.shims.unix.tcp_socket can't break miri.shims.unix.fd.
Position
Below the diagonal: miri.shims.unix.tcp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.tcp_socket uses miri.shims.readiness, so a change to miri.shims.readiness can break miri.shims.unix.tcp_socket, while a change to miri.shims.unix.tcp_socket can't break miri.shims.readiness.
Position
Below the diagonal: miri.shims.unix.tcp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.tcp_socket uses miri.shims.files, so a change to miri.shims.files can break miri.shims.unix.tcp_socket, while a change to miri.shims.unix.tcp_socket can't break miri.shims.files.
Position
Below the diagonal: miri.shims.unix.tcp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.tcp_socket uses miri.concurrency.blocking_io, so a change to miri.concurrency.blocking_io can break miri.shims.unix.tcp_socket, while a change to miri.shims.unix.tcp_socket can't break miri.concurrency.blocking_io.
Position
Below the diagonal: miri.shims.unix.tcp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.tcp_socket uses miri.machine, so a change to miri.machine can break miri.shims.unix.tcp_socket, while a change to miri.shims.unix.tcp_socket can't break miri.machine.
Position
Below the diagonal: miri.shims.unix.tcp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.tcp_socket uses miri.shims.unix.socket, so a change to miri.shims.unix.socket can break miri.shims.unix.tcp_socket, while a change to miri.shims.unix.tcp_socket can't break miri.shims.unix.socket.
Position
Below the diagonal: miri.shims.unix.tcp_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.tcp_socket uses miri.clock, so a change to miri.clock can break miri.shims.unix.tcp_socket, while a change to miri.shims.unix.tcp_socket can't break miri.clock.
Position
Below the diagonal: miri.shims.unix.tcp_socket uses a module listed above it, which is the healthy direction.
miri.concurrency.data_race uses genmc_sys.ffi, so a change to genmc_sys.ffi can break miri.concurrency.data_race, while a change to miri.concurrency.data_race can't break genmc_sys.ffi.
Position
Below the diagonal: miri.concurrency.data_race uses a module listed above it, which is the healthy direction.
miri.concurrency.data_race uses miri.concurrency.vector_clock, so a change to miri.concurrency.vector_clock can break miri.concurrency.data_race, while a change to miri.concurrency.data_race can't break miri.concurrency.vector_clock.
Position
Below the diagonal: miri.concurrency.data_race uses a module listed above it, which is the healthy direction.
miri.concurrency.data_race uses miri.eval, so a change to miri.eval can break miri.concurrency.data_race, while a change to miri.concurrency.data_race can't break miri.eval.
Position
Below the diagonal: miri.concurrency.data_race uses a module listed above it, which is the healthy direction.
miri.concurrency.data_race uses miri.machine, so a change to miri.machine can break miri.concurrency.data_race, while a change to miri.concurrency.data_race can't break miri.machine.
Position
Below the diagonal: miri.concurrency.data_race uses a module listed above it, which is the healthy direction.
miri.concurrency.data_race uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.concurrency.data_race, while a change to miri.concurrency.data_race can't break miri.provenance_gc.
Position
Below the diagonal: miri.concurrency.data_race uses a module listed above it, which is the healthy direction.
miri.concurrency.data_race uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.concurrency.data_race, while a change to miri.concurrency.data_race can't break miri.concurrency.thread.
Position
Below the diagonal: miri.concurrency.data_race uses a module listed above it, which is the healthy direction.
miri.shims.unix.linux_like.eventfd uses miri.concurrency.vector_clock, so a change to miri.concurrency.vector_clock can break miri.shims.unix.linux_like.eventfd, while a change to miri.shims.unix.linux_like.eventfd can't break miri.concurrency.vector_clock.
Position
Below the diagonal: miri.shims.unix.linux_like.eventfd uses a module listed above it, which is the healthy direction.
miri.shims.unix.linux_like.eventfd uses miri.shims.unix.fd, so a change to miri.shims.unix.fd can break miri.shims.unix.linux_like.eventfd, while a change to miri.shims.unix.linux_like.eventfd can't break miri.shims.unix.fd.
Position
Below the diagonal: miri.shims.unix.linux_like.eventfd uses a module listed above it, which is the healthy direction.
miri.shims.unix.linux_like.eventfd uses miri.shims.readiness, so a change to miri.shims.readiness can break miri.shims.unix.linux_like.eventfd, while a change to miri.shims.unix.linux_like.eventfd can't break miri.shims.readiness.
Position
Below the diagonal: miri.shims.unix.linux_like.eventfd uses a module listed above it, which is the healthy direction.
miri.shims.unix.linux_like.eventfd uses miri.shims.files, so a change to miri.shims.files can break miri.shims.unix.linux_like.eventfd, while a change to miri.shims.unix.linux_like.eventfd can't break miri.shims.files.
Position
Below the diagonal: miri.shims.unix.linux_like.eventfd uses a module listed above it, which is the healthy direction.
miri.shims.unix.linux_like.eventfd uses miri.machine, so a change to miri.machine can break miri.shims.unix.linux_like.eventfd, while a change to miri.shims.unix.linux_like.eventfd can't break miri.machine.
Position
Below the diagonal: miri.shims.unix.linux_like.eventfd uses a module listed above it, which is the healthy direction.
miri.shims.unix.linux_like.eventfd uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.shims.unix.linux_like.eventfd, while a change to miri.shims.unix.linux_like.eventfd can't break miri.concurrency.thread.
Position
Below the diagonal: miri.shims.unix.linux_like.eventfd uses a module listed above it, which is the healthy direction.
miri.shims.unix.virtual_socket uses miri.concurrency.vector_clock, so a change to miri.concurrency.vector_clock can break miri.shims.unix.virtual_socket, while a change to miri.shims.unix.virtual_socket can't break miri.concurrency.vector_clock.
Position
Below the diagonal: miri.shims.unix.virtual_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.virtual_socket uses miri.shims.sig, so a change to miri.shims.sig can break miri.shims.unix.virtual_socket, while a change to miri.shims.unix.virtual_socket can't break miri.shims.sig.
Position
Below the diagonal: miri.shims.unix.virtual_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.virtual_socket uses miri.shims.unix.fd, so a change to miri.shims.unix.fd can break miri.shims.unix.virtual_socket, while a change to miri.shims.unix.virtual_socket can't break miri.shims.unix.fd.
Position
Below the diagonal: miri.shims.unix.virtual_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.virtual_socket uses miri.shims.readiness, so a change to miri.shims.readiness can break miri.shims.unix.virtual_socket, while a change to miri.shims.unix.virtual_socket can't break miri.shims.readiness.
Position
Below the diagonal: miri.shims.unix.virtual_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.virtual_socket uses miri.shims.files, so a change to miri.shims.files can break miri.shims.unix.virtual_socket, while a change to miri.shims.unix.virtual_socket can't break miri.shims.files.
Position
Below the diagonal: miri.shims.unix.virtual_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.virtual_socket uses miri.machine, so a change to miri.machine can break miri.shims.unix.virtual_socket, while a change to miri.shims.unix.virtual_socket can't break miri.machine.
Position
Below the diagonal: miri.shims.unix.virtual_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.virtual_socket uses miri.shims.unix.socket, so a change to miri.shims.unix.socket can break miri.shims.unix.virtual_socket, while a change to miri.shims.unix.virtual_socket can't break miri.shims.unix.socket.
Position
Below the diagonal: miri.shims.unix.virtual_socket uses a module listed above it, which is the healthy direction.
miri.shims.unix.virtual_socket uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.shims.unix.virtual_socket, while a change to miri.shims.unix.virtual_socket can't break miri.concurrency.thread.
Position
Below the diagonal: miri.shims.unix.virtual_socket uses a module listed above it, which is the healthy direction.
miri.borrow_tracker uses miri.eval, so a change to miri.eval can break miri.borrow_tracker, while a change to miri.borrow_tracker can't break miri.eval.
Position
Below the diagonal: miri.borrow_tracker uses a module listed above it, which is the healthy direction.
miri.borrow_tracker uses miri.machine, so a change to miri.machine can break miri.borrow_tracker, while a change to miri.borrow_tracker can't break miri.machine.
Position
Below the diagonal: miri.borrow_tracker uses a module listed above it, which is the healthy direction.
miri.borrow_tracker uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.borrow_tracker, while a change to miri.borrow_tracker can't break miri.provenance_gc.
Position
Below the diagonal: miri.borrow_tracker uses a module listed above it, which is the healthy direction.
miri.borrow_tracker uses miri.concurrency.data_race, so a change to miri.concurrency.data_race can break miri.borrow_tracker, while a change to miri.borrow_tracker can't break miri.concurrency.data_race.
Position
Below the diagonal: miri.borrow_tracker uses a module listed above it, which is the healthy direction.
miri.concurrency.weak_memory uses miri.concurrency.vector_clock, so a change to miri.concurrency.vector_clock can break miri.concurrency.weak_memory, while a change to miri.concurrency.weak_memory can't break miri.concurrency.vector_clock.
Position
Below the diagonal: miri.concurrency.weak_memory uses a module listed above it, which is the healthy direction.
miri.concurrency.weak_memory uses miri.machine, so a change to miri.machine can break miri.concurrency.weak_memory, while a change to miri.concurrency.weak_memory can't break miri.machine.
Position
Below the diagonal: miri.concurrency.weak_memory uses a module listed above it, which is the healthy direction.
miri.concurrency.weak_memory uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.concurrency.weak_memory, while a change to miri.concurrency.weak_memory can't break miri.provenance_gc.
Position
Below the diagonal: miri.concurrency.weak_memory uses a module listed above it, which is the healthy direction.
miri.concurrency.weak_memory uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.concurrency.weak_memory, while a change to miri.concurrency.weak_memory can't break miri.concurrency.thread.
Position
Below the diagonal: miri.concurrency.weak_memory uses a module listed above it, which is the healthy direction.
miri.concurrency.weak_memory uses miri.concurrency.data_race, so a change to miri.concurrency.data_race can break miri.concurrency.weak_memory, while a change to miri.concurrency.weak_memory can't break miri.concurrency.data_race.
Position
Below the diagonal: miri.concurrency.weak_memory uses a module listed above it, which is the healthy direction.
miri.alloc_addresses uses miri.eval, so a change to miri.eval can break miri.alloc_addresses, while a change to miri.alloc_addresses can't break miri.eval.
Position
Below the diagonal: miri.alloc_addresses uses a module listed above it, which is the healthy direction.
miri.alloc_addresses uses miri.machine, so a change to miri.machine can break miri.alloc_addresses, while a change to miri.alloc_addresses can't break miri.machine.
Position
Below the diagonal: miri.alloc_addresses uses a module listed above it, which is the healthy direction.
miri.alloc_addresses uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.alloc_addresses, while a change to miri.alloc_addresses can't break miri.provenance_gc.
Position
Below the diagonal: miri.alloc_addresses uses a module listed above it, which is the healthy direction.
miri.alloc_addresses uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.alloc_addresses, while a change to miri.alloc_addresses can't break miri.borrow_tracker.
Position
Below the diagonal: miri.alloc_addresses uses a module listed above it, which is the healthy direction.
miri.concurrency.sync uses miri.concurrency.vector_clock, so a change to miri.concurrency.vector_clock can break miri.concurrency.sync, while a change to miri.concurrency.sync can't break miri.concurrency.vector_clock.
Position
Below the diagonal: miri.concurrency.sync uses a module listed above it, which is the healthy direction.
miri.concurrency.sync uses miri.machine, so a change to miri.machine can break miri.concurrency.sync, while a change to miri.concurrency.sync can't break miri.machine.
Position
Below the diagonal: miri.concurrency.sync uses a module listed above it, which is the healthy direction.
miri.concurrency.sync uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.concurrency.sync, while a change to miri.concurrency.sync can't break miri.provenance_gc.
Position
Below the diagonal: miri.concurrency.sync uses a module listed above it, which is the healthy direction.
miri.concurrency.sync uses miri.clock, so a change to miri.clock can break miri.concurrency.sync, while a change to miri.concurrency.sync can't break miri.clock.
Position
Below the diagonal: miri.concurrency.sync uses a module listed above it, which is the healthy direction.
miri.concurrency.sync uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.concurrency.sync, while a change to miri.concurrency.sync can't break miri.concurrency.thread.
Position
Below the diagonal: miri.concurrency.sync uses a module listed above it, which is the healthy direction.
miri.concurrency.sync uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.concurrency.sync, while a change to miri.concurrency.sync can't break miri.borrow_tracker.
Position
Below the diagonal: miri.concurrency.sync uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows.stack uses miri.borrow_tracker.stacked_borrows.item, so a change to miri.borrow_tracker.stacked_borrows.item can break miri.borrow_tracker.stacked_borrows.stack, while a change to miri.borrow_tracker.stacked_borrows.stack can't break miri.borrow_tracker.stacked_borrows.item.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows.stack uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows.stack uses miri.machine, so a change to miri.machine can break miri.borrow_tracker.stacked_borrows.stack, while a change to miri.borrow_tracker.stacked_borrows.stack can't break miri.machine.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows.stack uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows.stack uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.borrow_tracker.stacked_borrows.stack, while a change to miri.borrow_tracker.stacked_borrows.stack can't break miri.borrow_tracker.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows.stack uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows.stack uses miri.alloc_addresses, so a change to miri.alloc_addresses can break miri.borrow_tracker.stacked_borrows.stack, while a change to miri.borrow_tracker.stacked_borrows.stack can't break miri.alloc_addresses.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows.stack uses a module listed above it, which is the healthy direction.
35→37 miri.borrow_tracker.stacked_borrows.stack uses miri.borrow_tracker.stacked_borrows.diagnosticspart of a loop✕
Connections
1 pair of types, where a type in miri.borrow_tracker.stacked_borrows.stack uses a type in miri.borrow_tracker.stacked_borrows.diagnostics.
miri.borrow_tracker.stacked_borrows.stack uses miri.borrow_tracker.stacked_borrows.diagnostics, so a change to miri.borrow_tracker.stacked_borrows.diagnostics can break miri.borrow_tracker.stacked_borrows.stack, while a change to miri.borrow_tracker.stacked_borrows.stack can't break miri.borrow_tracker.stacked_borrows.diagnostics.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
35→39 miri.borrow_tracker.stacked_borrows.stack uses miri.borrow_tracker.stacked_borrowspart of a loop✕
Connections
1 pair of types, where a type in miri.borrow_tracker.stacked_borrows.stack uses a type in miri.borrow_tracker.stacked_borrows.
miri.borrow_tracker.stacked_borrows.stack uses miri.borrow_tracker.stacked_borrows, so a change to miri.borrow_tracker.stacked_borrows can break miri.borrow_tracker.stacked_borrows.stack, while a change to miri.borrow_tracker.stacked_borrows.stack can't break miri.borrow_tracker.stacked_borrows.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
miri.concurrency.genmc.global_allocations uses miri.machine, so a change to miri.machine can break miri.concurrency.genmc.global_allocations, while a change to miri.concurrency.genmc.global_allocations can't break miri.machine.
Position
Below the diagonal: miri.concurrency.genmc.global_allocations uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc.global_allocations uses miri.alloc_addresses, so a change to miri.alloc_addresses can break miri.concurrency.genmc.global_allocations, while a change to miri.concurrency.genmc.global_allocations can't break miri.alloc_addresses.
Position
Below the diagonal: miri.concurrency.genmc.global_allocations uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows.diagnostics uses miri.borrow_tracker.stacked_borrows.item, so a change to miri.borrow_tracker.stacked_borrows.item can break miri.borrow_tracker.stacked_borrows.diagnostics, while a change to miri.borrow_tracker.stacked_borrows.diagnostics can't break miri.borrow_tracker.stacked_borrows.item.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows.diagnostics uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows.diagnostics uses miri.machine, so a change to miri.machine can break miri.borrow_tracker.stacked_borrows.diagnostics, while a change to miri.borrow_tracker.stacked_borrows.diagnostics can't break miri.machine.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows.diagnostics uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows.diagnostics uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.borrow_tracker.stacked_borrows.diagnostics, while a change to miri.borrow_tracker.stacked_borrows.diagnostics can't break miri.borrow_tracker.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows.diagnostics uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows.diagnostics uses miri.alloc_addresses, so a change to miri.alloc_addresses can break miri.borrow_tracker.stacked_borrows.diagnostics, while a change to miri.borrow_tracker.stacked_borrows.diagnostics can't break miri.alloc_addresses.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows.diagnostics uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows.diagnostics uses miri.borrow_tracker.stacked_borrows.stack, so a change to miri.borrow_tracker.stacked_borrows.stack can break miri.borrow_tracker.stacked_borrows.diagnostics, while a change to miri.borrow_tracker.stacked_borrows.diagnostics can't break miri.borrow_tracker.stacked_borrows.stack.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows.diagnostics uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc uses genmc_sys.ffi, so a change to genmc_sys.ffi can break miri.concurrency.genmc, while a change to miri.concurrency.genmc can't break genmc_sys.ffi.
Position
Below the diagonal: miri.concurrency.genmc uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc uses miri.eval, so a change to miri.eval can break miri.concurrency.genmc, while a change to miri.concurrency.genmc can't break miri.eval.
Position
Below the diagonal: miri.concurrency.genmc uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc uses miri.concurrency.genmc.config, so a change to miri.concurrency.genmc.config can break miri.concurrency.genmc, while a change to miri.concurrency.genmc can't break miri.concurrency.genmc.config.
Position
Below the diagonal: miri.concurrency.genmc uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc uses miri.machine, so a change to miri.machine can break miri.concurrency.genmc, while a change to miri.concurrency.genmc can't break miri.machine.
Position
Below the diagonal: miri.concurrency.genmc uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.concurrency.genmc, while a change to miri.concurrency.genmc can't break miri.provenance_gc.
Position
Below the diagonal: miri.concurrency.genmc uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc uses miri.concurrency.thread, so a change to miri.concurrency.thread can break miri.concurrency.genmc, while a change to miri.concurrency.genmc can't break miri.concurrency.thread.
Position
Below the diagonal: miri.concurrency.genmc uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc uses miri.concurrency.data_race, so a change to miri.concurrency.data_race can break miri.concurrency.genmc, while a change to miri.concurrency.genmc can't break miri.concurrency.data_race.
Position
Below the diagonal: miri.concurrency.genmc uses a module listed above it, which is the healthy direction.
miri.concurrency.genmc uses miri.concurrency.genmc.global_allocations, so a change to miri.concurrency.genmc.global_allocations can break miri.concurrency.genmc, while a change to miri.concurrency.genmc can't break miri.concurrency.genmc.global_allocations.
Position
Below the diagonal: miri.concurrency.genmc uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows uses miri.borrow_tracker.stacked_borrows.item, so a change to miri.borrow_tracker.stacked_borrows.item can break miri.borrow_tracker.stacked_borrows, while a change to miri.borrow_tracker.stacked_borrows can't break miri.borrow_tracker.stacked_borrows.item.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows uses miri.machine, so a change to miri.machine can break miri.borrow_tracker.stacked_borrows, while a change to miri.borrow_tracker.stacked_borrows can't break miri.machine.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows uses miri.provenance_gc, so a change to miri.provenance_gc can break miri.borrow_tracker.stacked_borrows, while a change to miri.borrow_tracker.stacked_borrows can't break miri.provenance_gc.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.borrow_tracker.stacked_borrows, while a change to miri.borrow_tracker.stacked_borrows can't break miri.borrow_tracker.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows uses miri.alloc_addresses, so a change to miri.alloc_addresses can break miri.borrow_tracker.stacked_borrows, while a change to miri.borrow_tracker.stacked_borrows can't break miri.alloc_addresses.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.stacked_borrows uses miri.borrow_tracker.stacked_borrows.diagnostics, so a change to miri.borrow_tracker.stacked_borrows.diagnostics can break miri.borrow_tracker.stacked_borrows, while a change to miri.borrow_tracker.stacked_borrows can't break miri.borrow_tracker.stacked_borrows.diagnostics.
Position
Below the diagonal: miri.borrow_tracker.stacked_borrows uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows uses miri.borrow_tracker.stacked_borrows.item, so a change to miri.borrow_tracker.stacked_borrows.item can break miri.borrow_tracker.tree_borrows, while a change to miri.borrow_tracker.tree_borrows can't break miri.borrow_tracker.stacked_borrows.item.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows uses miri.machine, so a change to miri.machine can break miri.borrow_tracker.tree_borrows, while a change to miri.borrow_tracker.tree_borrows can't break miri.machine.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows uses miri.borrow_tracker, so a change to miri.borrow_tracker can break miri.borrow_tracker.tree_borrows, while a change to miri.borrow_tracker.tree_borrows can't break miri.borrow_tracker.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows uses a module listed above it, which is the healthy direction.
miri.borrow_tracker.tree_borrows uses miri.borrow_tracker.stacked_borrows, so a change to miri.borrow_tracker.stacked_borrows can break miri.borrow_tracker.tree_borrows, while a change to miri.borrow_tracker.tree_borrows can't break miri.borrow_tracker.stacked_borrows.
Position
Below the diagonal: miri.borrow_tracker.tree_borrows uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 66% · Adequate · gated by X4 ·
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
A05:2025 — Injection
20
High / Critical
A03:2025 — Software Supply Chain Failures
10
Medium
Roadmap
First, establish a formal process for recording significant design decisions by creating Architecture Decision Records in a dedicated folder. Next, enable automated dependency review tools to strengthen security and performance monitoring. Then, extend structured logging across all runnable modules to ensure full observability in production. Finally, add a high-level architecture overview to the root README to improve project documentation.
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.
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
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 — 20
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 — 651
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 — 49
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 15
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. 58 of 58 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.8 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 58 dimensions across the health lenses
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, 695 of 720 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
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.
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, 15 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.
D19 Documentation Quality — 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. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — 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. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — 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. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — 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.
D27 Navigability — 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. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D44 Platform End-of-Life — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
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.
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 reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Python, Rust, cpp is not read yet, 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.
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 reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Python, Rust, cpp is not read yet, 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.
M4 Documentation accuracy — 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. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
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 reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in 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.
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 reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in 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.
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 reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Cpp, Python, Rust is not read yet, 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.
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.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
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.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret 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 publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
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.
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.
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.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
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.
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.
48 function(s) exceeded the cyclomatic complexity threshold of 15; the worst was EvalContextExt::emulate_foreign_item_inner at 159. A further 3 function(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 DapSession::display_command at 42 — they are counted neither in the figure above nor in this dimension's score. 2 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: priroda/src/frontend/dap.rs (DapSession::display_command at 42), src/borrow_tracker/tree_borrows/perms.rs (PermTransition::is_relevant 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.
+ 7 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 120 down to 120 or less in Cyclomatic Complexity — start with EvalContextExt::emulate_foreign_item_inner (cyclomatic 159). — Refactoring it lifts Cyclomatic Complexity from 5.4 to about 5.7/10.
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.
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.
+ 15 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 4 bodies over 60 down to 60 or less in Cognitive Complexity — start with miri::bin::miri::main (cognitive 127), EvalContextExtPriv::emulate_foreign_item_inner (cognitive 80), cargo_miri::phases::phase_rustc (cognitive 75). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 4 together lifts Cognitive Complexity from 4.9 to about 6.0/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
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 Classes6.8 / 10Adequate✓ 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.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 23 MethodTooLong finding(s) in God Classes — start with foreign_items.rs (7), fs.rs (3), mod.rs (2). — One of this dimension's main actionable groups (23 warning-level).
Resolve the 20 FileTooLong finding(s) in God Classes — start with foreign_items.rs (3), mod.rs (3), fs.rs (2). — One of this dimension's main actionable groups (20 warning-level).
Resolve the 12 ClassTooLong finding(s) in God Classes — start with foreign_items.rs (3), fs.rs (2), machine.rs. — One of this dimension's main actionable groups (12 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.
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.
192 duplicated block group(s) detected. A further 6 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 1 of the 198 are in trees this repository does not ship — vendored, example/demo, project-template, 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.
+ 53 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 27 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with foreign_items.rs (13), aarch64.rs (3), avx.rs (3). — One of this dimension's main actionable groups (27 warning-level).
Resolve the 26 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with foreign_items.rs (18), data_race.rs, shims.rs. — One of this dimension's main actionable groups (26 warning-level).
Resolve the 23 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with foreign_items.rs (12), sse.rs (2), arg.rs. — One of this dimension's main actionable groups (23 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 · Coupling10.0 / 10Exemplary✓ 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.
15 production modules (Cargo), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 0 module(s) off the main sequence, with abstractness counted on 6 of the 15 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with diagnostics.rs, udp_socket.rs. — One of this dimension's main actionable groups (2 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_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.
47 test methods: 41 unit, 6 integration, 0 BDD, 0 e2e. The Rust suite contributes 47 `#[test]` function(s) across 15 file(s) declaring at least one; its unit/integration split is Cargo's own — 1 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.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
9 outdated, 0 yanked direct Cargo dependencies. 36 of 54 direct crates were graded against crates.io (0 not published there, 18 not resolved by a committed REDACTED). Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.
Outdated: backtrace · ×9
What to do
Enforce Dependency Hygiene in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
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.
0 of 178 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED 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.
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.
Resolve the 22 Hotspot finding(s) in Churn × Complexity Hotspots — start with foreign_items.rs (7), fs.rs (2), math.rs (2). — One of this dimension's main actionable groups (22 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor9.2 / 10Exemplary✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
11 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/shims/unix/socket.rs. Counted over 135 of the 181 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)
✓ On the Gold path — maintain.
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
247 deducted task-comment markers across 57648 LoC (0.4/KLoC) → score 9.2. 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.
Resolve the 224 FixmeComment finding(s) in Explicit Debt — start with foreign_items.rs (60), debugger.rs (21), fs.rs (10). — One of this dimension's main actionable groups (224 warning-level).
Resolve the 22 TodoComment finding(s) in Explicit Debt — start with helpers.rs (7), intrinsics-x86-sse.rs (4), mod.rs (2). — One of this dimension's main actionable groups (22 warning-level).
Resolve the 1 XxxComment finding(s) in Explicit Debt — start with windows_join_main.rs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 1 documentation facets pass in full. 5 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
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.
1 of 15 build units (Cargo) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret 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.
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).
20 finding(s): 0 critical, 20 high, 0 medium, 0 low. 13 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 1 file(s) — `miri-script/src/commands.rs` (line 104) — 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 2 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
What to do
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (5 issue-level).
Resolve the 1 REDACTED finding(s) charged to Static Analysis (SAST) — the other 13 are reported here at file:line but scored by D36 (supply-chain provenance), which charges them once. — One of this dimension's main actionable groups (14 issue-level, 1 of them charged here).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via 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 (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), 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.
Resolve the 4 Medium advisory (unsound) finding(s) in Dependency Vulnerabilities — start with REDACTED (4). — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
10 of 135 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/borrow_tracker/tree_borrows/unimap.rs. Counted over 135 of the 181 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
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.
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.
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.
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.
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.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
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.
Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.
Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.
Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
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 an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 25 of 25 project(s) that lack one — worth up to 2 pts.
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.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
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.
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?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability4.2 / 10Weak✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 1/14 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `bench-cargo-miri/backtraces`, `bench-cargo-miri/big-allocs`, `bench-cargo-miri/mse`, `bench-cargo-miri/range-iteration`, `bench-cargo-miri/serde1` and 8 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.
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.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
`debug!` at line 188 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:188
`debug!` at line 395 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:395
`debug!` at line 418 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:418
`debug!` at line 437 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:437
`debug!` at line 464 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:464
`debug!` at line 597 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:597
`debug!` at line 658 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:658
`debug!` at line 671 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:671
`debug!` at line 683 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:683
`debug!` at line 719 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:719
`debug!` at line 744 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:744
`debug!` at line 783 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/mod.rs:783
`info!` at line 66 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/run.rs:66
`debug!` at line 50 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/shims.rs:50
`debug!` at line 158 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/shims.rs:158
`debug!` at line 221 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/concurrency/genmc/shims.rs:221
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.
Unscored — 2 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
X10 Duplicated predicate — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 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.
P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 58 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~57771 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
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.
D21 Naming Consistency — Naming consistency is measured on C# only; Python, Rust not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
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, nor 2+ projects each declaring an entity of their own. 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 — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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.
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 32 value object(s); 1 domain event(s); its domain events are published by services or handlers — no domain entity raises one
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 — no mutating command handlers or message consumers detected — idempotency check not applicable
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. 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
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the 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 applicable: no benchmark suite was found. This check searched for `#[bench]`, criterion's `bench_function`/`bench_with_input`, `#[divan::bench]` or `#[library_benchmark]` in any `.rs` file, or criterion, divan, iai or a `[[bench]]` target in a Cargo.toml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb.
PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
S1 Web-Security Posture — No web surface: 167 Rust file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. This repository serves no HTTP of its own — no HTTP-server crate (actix-web, axum, Rocket, warp, poem, tide, salvo, tonic, a hyper server, …) among its Cargo manifests' run-time dependencies, and no server started in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
X16 Unfloored truncation loop — 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
X18 Disposal-pattern 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
X2 Cancellation propagation — no C# was loaded; this repository's Python and Rust were read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation; a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
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 — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
FixmeComment tests/ui.rs:80— // FIXME: Automate gathering of all relevant C source files in the directory. — 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/ui.rs:220— // FIXME: make it just skip `-Zmiri` flags. — 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/ui.rs:354— // FIXME(genmc): remove this when GenMC and SB can be used together. — 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/ui.rs:498— // FIXME(genmc,cross-platform): Technically we do support cross-target execution as long as 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/pass-dep/libc/eventfd.rs:6— // FIXME(static_mut_refs): use raw pointers instead of references — 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/pass-dep/libc/pipe.rs:83— // FIXME(static_mut_refs): use raw pointers instead of references — 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/pass-dep/libc/socketpair.rs:6— // FIXME(static_mut_refs): use raw pointers instead of references — 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/pass-dep/concurrency/linux-futex.rs:5— // FIXME(static_mut_refs): use raw pointers instead of references — 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/pass/atomic.rs:6— // FIXME(static_mut_refs): use raw pointers instead of references — 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/pass/static_memory_modification.rs:1— // FIXME(static_mut_refs): use raw pointers instead of references — 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/pass/static_mut.rs:1— // FIXME(static_mut_refs): use raw pointers instead of references — 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/pass/tls/tls_static.rs:11— // FIXME(static_mut_refs): use raw pointers instead of references — 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/pass-dep/libc/fs-flock.rs:67— // FIXME(#miri/5074): except on Windows hosts... — 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/pass-dep/libc/fs-flock.rs:74— // FIXME(#miri/5074): this does not behave correctly on Windows hosts. — 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/pass-dep/libc/fs.rs:541— // FIXME: O_NOFOLLOW does not work with openat on Windows hosts. — 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/pass-dep/libc/fs.rs:1110— // FIXME: Seems like FreeBSD does not set permissions for non-file-backed FDs. — 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/pass-dep/libc/pipe.rs:128— // FIXME: Pipes are bidirectional on FreeBSD but Miri's shim implements them as — 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/pass-dep/libc/socket-tcp-no-blocking.rs:711— // FIXME: On Windows hosts a connecting socket is bound to the unspecified address. — 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/pass-dep/concurrency/freebsd-futex.rs:75— // can't really test this natively (FIXME: test with mmap?) — 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/pass-dep/concurrency/linux-futex.rs:56— // can't really test this natively (FIXME: test with mmap?) — 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/pass-dep/concurrency/pthread_cond_timedwait_relative_np_apple.rs:6— // FIXME: remove once this is in libc. — 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/pass/async-drop.rs:13— // FIXME(zetanumbers): consider AsyncDestruct::async_drop cleanup tests — 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/pass/async-drop.rs:196— // FIXME(zetanumbers): Disallow types with `AsyncDrop` in unions — 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/pass/async-panic-track-caller.rs:138— // FIXME(async_fn_track_caller): Currently, #[track_caller] on an async function — 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/pass/async-panic-track-caller.rs:154— // FIXME(closure_track_caller): if closure_track_caller is enabled, but — 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.
Duplicated block (5 lines × 2) src/intrinsics/aarch64.rs:69— src/intrinsics/aarch64.rs:69-73 | src/intrinsics/x86/mod.rs:1223-1227 — 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/intrinsics/aarch64.rs:446— src/intrinsics/aarch64.rs:446-450 | src/intrinsics/x86/sha.rs:135-139 — 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/intrinsics/simd.rs:31— src/intrinsics/simd.rs:31-35 | src/intrinsics/simd.rs:65-71 — 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/intrinsics/x86/avx.rs:92— src/intrinsics/x86/avx.rs:92-96 | src/intrinsics/x86/sse.rs:113-117 — 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/intrinsics/x86/avx.rs:104— src/intrinsics/x86/avx.rs:104-108 | src/intrinsics/x86/sse2.rs:189-193 — 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/intrinsics/x86/avx.rs:208— src/intrinsics/x86/avx.rs:208-212 | src/intrinsics/x86/sse41.rs:155-159 — 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/intrinsics/x86/avx512.rs:220— src/intrinsics/x86/avx512.rs:220-227 | src/intrinsics/x86/mod.rs:1222-1226 — 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/intrinsics/x86/mod.rs:746— src/intrinsics/x86/mod.rs:746-750 | src/intrinsics/x86/mod.rs:974-978 — 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/intrinsics/x86/mod.rs:1173— src/intrinsics/x86/mod.rs:1173-1181 | src/intrinsics/x86/sse41.rs:30-34 — 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/shims/unix/fd.rs:473— src/shims/unix/fd.rs:473-477 | src/shims/unix/fd.rs:596-600 — 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/shims/unix/foreign_items.rs:364— src/shims/unix/foreign_items.rs:364-368 | src/shims/unix/linux/foreign_items.rs:57-61 — 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/shims/unix/foreign_items.rs:420— src/shims/unix/foreign_items.rs:420-424 | src/shims/unix/macos/foreign_items.rs:78-82 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 65 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 (5 lines × 2) src/shims/unix/foreign_items.rs:738— src/shims/unix/foreign_items.rs:738-742 | src/shims/unix/solarish/foreign_items.rs:138-142 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/solarish/foreign_items.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 47 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 (5 lines × 2) src/shims/unix/foreign_items.rs:1112— src/shims/unix/foreign_items.rs:1112-1116 | src/shims/unix/macos/foreign_items.rs:421-425 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 65 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 (5 lines × 2) src/shims/unix/socket.rs:1135— src/shims/unix/socket.rs:1135-1139 | src/shims/unix/socket.rs:1159-1163 — 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/shims/unix/thread.rs:53— src/shims/unix/thread.rs:53-57 | src/shims/unix/thread.rs:71-75 — 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/shims/unix/android/foreign_items.rs:68— src/shims/unix/android/foreign_items.rs:68-74 | src/shims/unix/linux/foreign_items.rs:144-148 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (5 lines × 2) src/shims/unix/foreign_items.rs:359— src/shims/unix/foreign_items.rs:359-363 | src/shims/unix/linux/foreign_items.rs:50-56 — 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/shims/unix/android/foreign_items.rs:59— src/shims/unix/android/foreign_items.rs:59-63 | src/shims/unix/foreign_items.rs:494-498 — 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/intrinsics/x86/sse.rs:94— src/intrinsics/x86/sse.rs:94-98 | src/intrinsics/x86/sse2.rs:170-174 — 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/shims/unix/foreign_items.rs:475— src/shims/unix/foreign_items.rs:475-479 | src/shims/unix/macos/foreign_items.rs:87-91 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 65 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 (5 lines × 2) src/intrinsics/aarch64.rs:65— src/intrinsics/aarch64.rs:65-69 | src/intrinsics/aarch64.rs:152-156 — 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/shims/unix/android/foreign_items.rs:58— src/shims/unix/android/foreign_items.rs:58-62 | src/shims/unix/linux/foreign_items.rs:91-95 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (5 lines × 2) src/shims/unix/foreign_items.rs:230— src/shims/unix/foreign_items.rs:230-234 | src/shims/unix/foreign_items.rs:237-241 — 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/shims/unix/foreign_items.rs:267— src/shims/unix/foreign_items.rs:267-271 | src/shims/unix/foreign_items.rs:274-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 (7 lines × 2) src/concurrency/data_race.rs:848— src/concurrency/data_race.rs:848-854 | src/concurrency/data_race.rs:896-903 — 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/concurrency/genmc/shims.rs:75— src/concurrency/genmc/shims.rs:75-82 | src/concurrency/genmc/shims.rs:141-147 — 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/intrinsics/simd.rs:23— src/intrinsics/simd.rs:23-29 | src/intrinsics/simd.rs:80-86 — 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/shims/cpu_affinity.rs:103— src/shims/cpu_affinity.rs:103-109 | src/shims/cpu_affinity.rs:158-164 — 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/shims/unix/foreign_items.rs:210— src/shims/unix/foreign_items.rs:210-216 | src/shims/unix/foreign_items.rs:220-226 — 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/shims/unix/foreign_items.rs:394— src/shims/unix/foreign_items.rs:394-400 | src/shims/unix/macos/foreign_items.rs:68-74 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 65 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 (7 lines × 2) src/shims/unix/foreign_items.rs:402— src/shims/unix/foreign_items.rs:402-408 | src/shims/unix/macos/foreign_items.rs:60-66 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 65 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 (7 lines × 2) src/shims/unix/foreign_items.rs:410— src/shims/unix/foreign_items.rs:410-416 | src/shims/unix/macos/foreign_items.rs:52-58 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 65 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 (7 lines × 2) src/shims/unix/foreign_items.rs:581— src/shims/unix/foreign_items.rs:581-587 | src/shims/unix/macos/foreign_items.rs:95-101 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 65 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 (7 lines × 2) src/shims/unix/foreign_items.rs:636— src/shims/unix/foreign_items.rs:636-642 | src/shims/unix/solarish/foreign_items.rs:113-119 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/solarish/foreign_items.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 47 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 (7 lines × 2) src/shims/unix/foreign_items.rs:644— src/shims/unix/foreign_items.rs:644-650 | src/shims/unix/solarish/foreign_items.rs:121-127 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/solarish/foreign_items.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 47 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 (7 lines × 2) src/shims/unix/foreign_items.rs:1266— src/shims/unix/foreign_items.rs:1266-1272 | src/shims/unix/linux/foreign_items.rs:312-318 — 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 (7 lines × 2) src/shims/unix/linux_like/epoll.rs:325— src/shims/unix/linux_like/epoll.rs:325-331 | src/shims/unix/linux_like/epoll.rs:355-361 — 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/shims/unix/linux_like/sync.rs:54— src/shims/unix/linux_like/sync.rs:54-60 | src/shims/unix/linux_like/sync.rs:204-210 — 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/shims/unix/macos/foreign_items.rs:215— src/shims/unix/macos/foreign_items.rs:215-221 | src/shims/unix/macos/foreign_items.rs:225-234 — 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/shims/unix/foreign_items.rs:423— src/shims/unix/foreign_items.rs:423-429 | src/shims/unix/foreign_items.rs:447-454 — 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/shims/unix/foreign_items.rs:374— src/shims/unix/foreign_items.rs:374-381 | src/shims/unix/foreign_items.rs:439-445 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/shims/unix/foreign_items.rs:815— src/shims/unix/foreign_items.rs:815-822 | src/shims/unix/foreign_items.rs:1223-1229 — 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/shims/unix/android/foreign_items.rs:69— src/shims/unix/android/foreign_items.rs:69-76 | src/shims/unix/foreign_items.rs:504-510 — 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 (7 lines × 2) src/shims/windows/foreign_items.rs:402— src/shims/windows/foreign_items.rs:402-408 | src/shims/windows/foreign_items.rs:1071-1078 — 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/shims/windows/foreign_items.rs:194— src/shims/windows/foreign_items.rs:194-201 | src/shims/windows/foreign_items.rs:410-416 — 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/shims/unix/socket_address.rs:167— src/shims/unix/socket_address.rs:167-173 | src/shims/unix/socket_address.rs:194-200 — 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/shims/unix/macos/foreign_items.rs:39— src/shims/unix/macos/foreign_items.rs:39-45 | src/shims/unix/solarish/foreign_items.rs:157-163 — `src/shims/unix/macos/foreign_items.rs` and `src/shims/unix/solarish/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 42 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (7 lines × 2) src/shims/unix/foreign_items.rs:799— src/shims/unix/foreign_items.rs:799-805 | src/shims/unix/foreign_items.rs:807-813 — 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/shims/unix/freebsd/foreign_items.rs:173— src/shims/unix/freebsd/foreign_items.rs:173-179 | src/shims/unix/linux/foreign_items.rs:340-346 — `src/shims/unix/freebsd/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 30 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
EvalContextExt::emulate_foreign_item_inner (cyclomatic 159) src/shims/unix/foreign_items.rs:111— EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 159 (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.
EvalContextExt::emulate_foreign_item_inner (cyclomatic 108) src/shims/windows/foreign_items.rs:132— EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 108 (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.
EvalContextExt::emulate_foreign_item_inner (cyclomatic 45) src/shims/unix/macos/foreign_items.rs:23— EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 45 (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.
EvalContextExt::emulate_foreign_item_inner (cyclomatic 44) src/shims/math.rs:11— EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 44 (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.
EvalContextExt::open (cyclomatic 40) src/shims/unix/fs.rs:444— EvalContextExt::open has cyclomatic complexity 40 (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.
EvalContextExt::emulate_x86_sse2_intrinsic (cyclomatic 37) src/intrinsics/x86/sse2.rs:12— EvalContextExt::emulate_x86_sse2_intrinsic has cyclomatic complexity 37 (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.
EvalContextExt::emulate_foreign_item_inner (cyclomatic 37) src/shims/unix/linux/foreign_items.rs:29— EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 37 (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.
EvalContextExt::emulate_math_intrinsic (cyclomatic 35) src/intrinsics/math.rs:92— EvalContextExt::emulate_math_intrinsic has cyclomatic complexity 35 (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.
EvalContextExt::emulate_aarch64_intrinsic (cyclomatic 34) src/intrinsics/aarch64.rs:9— EvalContextExt::emulate_aarch64_intrinsic has cyclomatic complexity 34 (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.
EvalContextExt::CreateFileW (cyclomatic 34) src/shims/windows/fs.rs:109— EvalContextExt::CreateFileW has cyclomatic complexity 34 (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.
EvalContextExt::emulate_x86_avx_intrinsic (cyclomatic 31) src/intrinsics/x86/avx.rs:12— EvalContextExt::emulate_x86_avx_intrinsic has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
EvalContextExt::emulate_x86_sse42_intrinsic (cyclomatic 30) src/intrinsics/x86/sse42.rs:277— EvalContextExt::emulate_x86_sse42_intrinsic 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.
EvalContextExt::emulate_x86_avx2_intrinsic (cyclomatic 28) src/intrinsics/x86/avx2.rs:11— EvalContextExt::emulate_x86_avx2_intrinsic has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
EvalContextExt::emulate_x86_sse_intrinsic (cyclomatic 25) src/intrinsics/x86/sse.rs:12— EvalContextExt::emulate_x86_sse_intrinsic has cyclomatic complexity 25 (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.
EvalContextExt::emulate_x86_intrinsic (cyclomatic 24) src/intrinsics/x86/mod.rs:28— EvalContextExt::emulate_x86_intrinsic has cyclomatic complexity 24 (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.
EvalContextExt::emulate_simd_intrinsic (cyclomatic 23) src/intrinsics/simd.rs:13— EvalContextExt::emulate_simd_intrinsic has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
EvalContextExt::emulate_foreign_item_inner (cyclomatic 22) src/shims/unix/solarish/foreign_items.rs:18— EvalContextExt::emulate_foreign_item_inner 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.
EvalContextExt::emulate_x86_avx512_intrinsic (cyclomatic 21) src/intrinsics/x86/avx512.rs:11— EvalContextExt::emulate_x86_avx512_intrinsic 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.
EvalContextExt::emulate_x86_sse41_intrinsic (cyclomatic 18) src/intrinsics/x86/sse41.rs:8— EvalContextExt::emulate_x86_sse41_intrinsic has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
EvalContextExt::fcntl (cyclomatic 18) src/shims/unix/fd.rs:228— EvalContextExt::fcntl 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.
EvalContextExt::emulate_foreign_item_inner (cyclomatic 18) src/shims/unix/freebsd/foreign_items.rs:15— EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
EvalContextExt::epoll_ctl (cyclomatic 18) src/shims/unix/linux_like/epoll.rs:79— EvalContextExt::epoll_ctl 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.
EvalContextExt::emulate_x86_bmi_intrinsic (cyclomatic 16) src/intrinsics/x86/bmi.rs:8— EvalContextExt::emulate_x86_bmi_intrinsic has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
EvalContextExt::set_generic_socket_option (cyclomatic 16) src/shims/unix/socket.rs:885— EvalContextExt::set_generic_socket_option 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.
EvalContextExt::get_generic_socket_option (cyclomatic 16) src/shims/unix/socket.rs:1062— EvalContextExt::get_generic_socket_option 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.
EvalContextExt::open (cognitive 64) src/shims/unix/fs.rs:444— EvalContextExt::open has cognitive complexity 64 (threshold 15). Drivers by points: if/else 39 (56 pts), match/switch 4 (5 pts), boolean chains 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.
EvalContextExt::CreateFileW (cognitive 54) src/shims/windows/fs.rs:109— EvalContextExt::CreateFileW has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (42 pts), boolean chains 7, match/switch 2 (4 pts), loops 1 (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.
EvalContextExt::emulate_foreign_item_inner (cognitive 51) src/shims/windows/foreign_items.rs:132— EvalContextExt::emulate_foreign_item_inner has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 8 (13 pts), boolean chains 2 (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.
EvalContextExt::emulate_x86_sse42_intrinsic (cognitive 40) src/intrinsics/x86/sse42.rs:277— EvalContextExt::emulate_x86_sse42_intrinsic has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 3 (5 pts), loops 1 (3 pts), boolean chains 1 (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.
EvalContextExt::_umtx_op (cognitive 39) src/shims/unix/freebsd/sync.rs:37— EvalContextExt::_umtx_op has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (36 pts), boolean chains 2, match/switch 1 (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.
EvalContextExt::emulate_aarch64_intrinsic (cognitive 34) src/intrinsics/aarch64.rs:9— EvalContextExt::emulate_aarch64_intrinsic has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 5 (10 pts), match/switch 3 (5 pts) (nesting depth added 16). 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.
EvalContextExt::emulate_foreign_item_inner (cognitive 28) src/shims/unix/foreign_items.rs:111— EvalContextExt::emulate_foreign_item_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 4 (7 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.
EvalContextExt::epoll_ctl (cognitive 28) src/shims/unix/linux_like/epoll.rs:79— EvalContextExt::epoll_ctl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19 (27 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.
EvalContextExt::set_generic_socket_option (cognitive 24) src/shims/unix/socket.rs:885— EvalContextExt::set_generic_socket_option has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 1 (2 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.
EvalContextExt::emulate_x86_bmi_intrinsic (cognitive 23) src/intrinsics/x86/bmi.rs:8— EvalContextExt::emulate_x86_bmi_intrinsic has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (17 pts), loops 2 (4 pts), boolean chains 1, 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.
EvalContextExt::emulate_math_intrinsic (cognitive 22) src/intrinsics/math.rs:92— EvalContextExt::emulate_math_intrinsic has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 8 (12 pts), if/else 5 (10 pts) (nesting depth added 9). 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.
EvalContextExt::emulate_simd_intrinsic (cognitive 22) src/intrinsics/simd.rs:13— EvalContextExt::emulate_simd_intrinsic has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (6 pts), loops 3 (6 pts) (nesting depth added 12). 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.
EvalContextExt::host_error_to_errnum (cognitive 22) src/shims/io_error.rs:346— EvalContextExt::host_error_to_errnum has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (7 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.
EvalContextExt::lookup_exported_symbol (cognitive 20) src/shims/foreign_items.rs:116— EvalContextExt::lookup_exported_symbol has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
EvalContextExt::fcntl (cognitive 20) src/shims/unix/fd.rs:228— EvalContextExt::fcntl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, 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.
EvalContextExt::convert_path (cognitive 19) src/shims/os_str.rs:263— EvalContextExt::convert_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 3). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (unix_to_windows, windows_to_unix). 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.
EvalContextExt::emulate_foreign_item_inner (cognitive 19) src/shims/unix/freebsd/foreign_items.rs:15— EvalContextExt::emulate_foreign_item_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 7). 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.
EvalContextExt::get_generic_socket_option (cognitive 19) src/shims/unix/socket.rs:1062— EvalContextExt::get_generic_socket_option has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 5). 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.
EvalContextExt::try_errnum_to_io_error (cognitive 18) src/shims/io_error.rs:387— EvalContextExt::try_errnum_to_io_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (6 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.
EvalContextExt::emulate_x86_avx_intrinsic (cognitive 17) src/intrinsics/x86/avx.rs:12— EvalContextExt::emulate_x86_avx_intrinsic has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (11 pts), loops 2 (4 pts), boolean chains 2 (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.
EvalContextExt::emulate_x86_sse2_intrinsic (cognitive 17) src/intrinsics/x86/sse2.rs:12— EvalContextExt::emulate_x86_sse2_intrinsic has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (15 pts), loops 1 (2 pts) (nesting depth added 8). 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.
EvalContextExt::socket (cognitive 17) src/shims/unix/socket.rs:218— EvalContextExt::socket has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EvalContextExt::call_llvm_intrinsic (cognitive 16) src/intrinsics/mod.rs:153— EvalContextExt::call_llvm_intrinsic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 1 (2 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.
EvalContextExt::emulate_x86_sse41_intrinsic (cognitive 16) src/intrinsics/x86/sse41.rs:8— EvalContextExt::emulate_x86_sse41_intrinsic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 7). 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.
MethodTooLong: EvalContextExt.emulate_foreign_item_inner src/shims/unix/foreign_items.rs:111— MethodTooLong — emulate_foreign_item_inner runs 1096 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 996 over it, 10.96× 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: EvalContextExt.emulate_foreign_item_inner src/shims/windows/foreign_items.rs:132— MethodTooLong — emulate_foreign_item_inner runs 826 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 726 over it, 8.26× 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: EvalContextExtPriv.emulate_foreign_item_inner src/shims/foreign_items.rs:258— MethodTooLong — emulate_foreign_item_inner runs 430 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 330 over it, 4.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.
MethodTooLong: EvalContextExt.emulate_foreign_item_inner src/shims/unix/macos/foreign_items.rs:23— MethodTooLong — emulate_foreign_item_inner runs 310 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 210 over it, 3.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: EvalContextExt.emulate_foreign_item_inner src/shims/unix/linux/foreign_items.rs:29— MethodTooLong — emulate_foreign_item_inner runs 257 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 157 over it, 2.57× 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: EvalContextExt.emulate_aarch64_intrinsic src/intrinsics/aarch64.rs:9— MethodTooLong — emulate_aarch64_intrinsic runs 231 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 131 over it, 2.31× 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: EvalContextExt.emulate_foreign_item_inner src/shims/math.rs:11— MethodTooLong — emulate_foreign_item_inner runs 192 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 92 over it, 1.92× 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: EvalContextExt.open src/shims/unix/fs.rs:444— MethodTooLong — open runs 180 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 80 over it, 1.80× 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: EvalContextPrivExt.sb_reborrow src/borrow_tracker/stacked_borrows/mod.rs:594— MethodTooLong — sb_reborrow 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: EvalContextExt.emulate_foreign_item_inner src/shims/unix/solarish/foreign_items.rs:18— MethodTooLong — emulate_foreign_item_inner runs 151 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 51 over it, 1.51× 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: MiriMachine.emit_diagnostic src/diagnostics.rs:634— MethodTooLong — emit_diagnostic runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: EvalContextPrivExt.tb_reborrow src/borrow_tracker/tree_borrows/mod.rs:238— MethodTooLong — tb_reborrow runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: MiriMachine.new src/machine.rs:700— MethodTooLong — new runs 134 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 34 over it, 1.34× 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: EvalContextExt.emulate_x86_sse2_intrinsic src/intrinsics/x86/sse2.rs:12— MethodTooLong — emulate_x86_sse2_intrinsic runs 124 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 24 over it, 1.24× 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: DisplayRepr.print src/borrow_tracker/tree_borrows/diagnostics.rs:691— MethodTooLong — print 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.
MethodTooLong: EvalContextExt.linux_statx src/shims/unix/fs.rs:1032— MethodTooLong — linux_statx 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.
MethodTooLong: EvalContextExt.emulate_x86_avx_intrinsic src/intrinsics/x86/avx.rs:12— MethodTooLong — emulate_x86_avx_intrinsic runs 114 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 14 over it, 1.14× 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: EvalContextExt.emulate_foreign_item_inner src/shims/unix/freebsd/foreign_items.rs:15— MethodTooLong — emulate_foreign_item_inner 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.
MethodTooLong: EvalContextExt.CreateFileW src/shims/windows/fs.rs:109— MethodTooLong — CreateFileW 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.
MethodTooLong: EvalContextExt.emulate_x86_avx2_intrinsic src/intrinsics/x86/avx2.rs:11— MethodTooLong — emulate_x86_avx2_intrinsic runs 111 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 11 over it, 1.11× 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: EvalContextExt.emulate_x86_sse42_intrinsic src/intrinsics/x86/sse42.rs:277— MethodTooLong — emulate_x86_sse42_intrinsic 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: EvalContextExt._umtx_op src/shims/unix/freebsd/sync.rs:37— MethodTooLong — _umtx_op runs 103 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 3 over it, 1.03× 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: EvalContextExt.emulate_x86_avx512_intrinsic src/intrinsics/x86/avx512.rs:11— MethodTooLong — emulate_x86_avx512_intrinsic runs 102 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 2 over it, 1.02× 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.
Duplicated block (6 lines × 2) cargo-miri/src/arg.rs:49— cargo-miri/src/arg.rs:49-54 | cargo-miri/src/arg.rs:60-65 — 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/borrow_tracker/tree_borrows/wildcard.rs:202— src/borrow_tracker/tree_borrows/wildcard.rs:202-207 | src/borrow_tracker/tree_borrows/wildcard.rs:232-237 — 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/intrinsics/x86/avx.rs:196— src/intrinsics/x86/avx.rs:196-202 | src/intrinsics/x86/sse3.rs:25-30 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) src/intrinsics/x86/bmi.rs:32— src/intrinsics/x86/bmi.rs:32-37 | src/intrinsics/x86/sse42.rs:432-437 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) src/intrinsics/x86/sse.rs:124— src/intrinsics/x86/sse.rs:124-129 | src/intrinsics/x86/sse2.rs:200-205 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) src/shims/unix/android/foreign_items.rs:62— src/shims/unix/android/foreign_items.rs:62-67 | src/shims/unix/linux/foreign_items.rs:138-143 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (6 lines × 2) src/shims/unix/foreign_items.rs:246— src/shims/unix/foreign_items.rs:246-251 | src/shims/unix/foreign_items.rs:257-262 — 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/shims/unix/foreign_items.rs:305— src/shims/unix/foreign_items.rs:305-310 | src/shims/unix/foreign_items.rs:321-326 — 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/shims/unix/foreign_items.rs:607— src/shims/unix/foreign_items.rs:607-612 | src/shims/unix/solarish/foreign_items.rs:104-109 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/solarish/foreign_items.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 47 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/shims/unix/foreign_items.rs:674— src/shims/unix/foreign_items.rs:674-679 | src/shims/unix/solarish/foreign_items.rs:129-134 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/solarish/foreign_items.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 47 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/shims/unix/foreign_items.rs:1281— src/shims/unix/foreign_items.rs:1281-1286 | src/shims/unix/macos/foreign_items.rs:114-119 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 65 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/shims/unix/freebsd/foreign_items.rs:73— src/shims/unix/freebsd/foreign_items.rs:73-78 | src/shims/unix/linux/foreign_items.rs:127-132 — `src/shims/unix/freebsd/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 30 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (6 lines × 2) src/shims/unix/socket.rs:495— src/shims/unix/socket.rs:495-500 | src/shims/unix/socket.rs:574-579 — 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/shims/unix/tcp_socket.rs:296— src/shims/unix/tcp_socket.rs:296-301 | src/shims/unix/udp_socket.rs:161-166 — before extracting anything, compare `src/shims/unix/tcp_socket.rs` and `src/shims/unix/udp_socket.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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/shims/unix/virtual_socket.rs:617— src/shims/unix/virtual_socket.rs:617-622 | src/shims/unix/virtual_socket.rs:628-633 — 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/shims/unix/foreign_items.rs:140— src/shims/unix/foreign_items.rs:140-145 | src/shims/unix/netbsd/foreign_items.rs:25-32 — 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/shims/unix/fs.rs:957— src/shims/unix/fs.rs:957-962 | src/shims/unix/fs.rs:989-994 — 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/shims/windows/foreign_items.rs:882— src/shims/windows/foreign_items.rs:882-887 | src/shims/windows/foreign_items.rs:900-905 — 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/shims/unix/sync.rs:285— src/shims/unix/sync.rs:285-290 | src/shims/unix/sync.rs:397-402 — 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/shims/windows/foreign_items.rs:620— src/shims/windows/foreign_items.rs:620-625 | src/shims/windows/foreign_items.rs:677-682 — 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/intrinsics/x86/sse.rs:152— src/intrinsics/x86/sse.rs:152-157 | src/intrinsics/x86/sse2.rs:228-233 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) src/shims/unix/foreign_items.rs:465— src/shims/unix/foreign_items.rs:465-470 | src/shims/unix/macos/foreign_items.rs:83-88 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 65 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/shims/unix/foreign_items.rs:1225— src/shims/unix/foreign_items.rs:1225-1230 | src/shims/unix/foreign_items.rs:1235-1240 — 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.
Hotspot: src/shims/unix/foreign_items.rs src/shims/unix/foreign_items.rs:111— src/shims/unix/foreign_items.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 159 in EvalContextExt::emulate_foreign_item_inner at line 111. 1 of those changes was a fix/bug commit, and the other 33 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/unix/foreign_items.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/shims/windows/foreign_items.rs src/shims/windows/foreign_items.rs:132— src/shims/windows/foreign_items.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 108 in EvalContextExt::emulate_foreign_item_inner at line 132. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/windows/foreign_items.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/shims/unix/fs.rs src/shims/unix/fs.rs:444— src/shims/unix/fs.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in EvalContextExt::open at line 444. 4 of those changes were fix/bug commits, and the other 40 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/unix/fs.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/shims/foreign_items.rs src/shims/foreign_items.rs:258— src/shims/foreign_items.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in EvalContextExtPriv::emulate_foreign_item_inner at line 258. 1 of those changes was a fix/bug commit, and the other 21 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/foreign_items.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: priroda/src/frontend/dap.rs priroda/src/frontend/dap.rs:743— priroda/src/frontend/dap.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in DapSession::display_command at line 743. 1 of those changes was a fix/bug commit, and the other 37 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- priroda/src/frontend/dap.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/shims/unix/macos/foreign_items.rs src/shims/unix/macos/foreign_items.rs:23— src/shims/unix/macos/foreign_items.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in EvalContextExt::emulate_foreign_item_inner at line 23. 1 of those changes was a fix/bug commit, and the other 18 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/unix/macos/foreign_items.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/shims/unix/linux/foreign_items.rs src/shims/unix/linux/foreign_items.rs:29— src/shims/unix/linux/foreign_items.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in EvalContextExt::emulate_foreign_item_inner at line 29. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/unix/linux/foreign_items.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: priroda/src/debugger.rs priroda/src/debugger.rs:655— priroda/src/debugger.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in PrirodaContext::render_source_shaped_op_inner at line 655. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- priroda/src/debugger.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/diagnostics.rs src/diagnostics.rs:236— src/diagnostics.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in miri::diagnostics::report_result at line 236. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/diagnostics.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/shims/unix/socket.rs src/shims/unix/socket.rs:885— src/shims/unix/socket.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EvalContextExt::set_generic_socket_option at line 885. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/unix/socket.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/shims/windows/fs.rs src/shims/windows/fs.rs:109— src/shims/windows/fs.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in EvalContextExt::CreateFileW at line 109. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/windows/fs.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/intrinsics/math.rs src/intrinsics/math.rs:92— src/intrinsics/math.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in EvalContextExt::emulate_math_intrinsic at line 92. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/intrinsics/math.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/shims/unix/freebsd/foreign_items.rs src/shims/unix/freebsd/foreign_items.rs:15— src/shims/unix/freebsd/foreign_items.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EvalContextExt::emulate_foreign_item_inner at line 15. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/unix/freebsd/foreign_items.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/machine.rs src/machine.rs:1470— src/machine.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MiriMachine::extern_static_pointer at line 1470. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/machine.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/shims/unix/solarish/foreign_items.rs src/shims/unix/solarish/foreign_items.rs:18— src/shims/unix/solarish/foreign_items.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in EvalContextExt::emulate_foreign_item_inner at line 18. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/unix/solarish/foreign_items.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/intrinsics/x86/sse2.rs src/intrinsics/x86/sse2.rs:12— src/intrinsics/x86/sse2.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in EvalContextExt::emulate_x86_sse2_intrinsic at line 12. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/intrinsics/x86/sse2.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/intrinsics/x86/mod.rs src/intrinsics/x86/mod.rs:28— src/intrinsics/x86/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in EvalContextExt::emulate_x86_intrinsic at line 28. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/intrinsics/x86/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/intrinsics/x86/avx2.rs src/intrinsics/x86/avx2.rs:11— src/intrinsics/x86/avx2.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in EvalContextExt::emulate_x86_avx2_intrinsic at line 11. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/intrinsics/x86/avx2.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/shims/math.rs src/shims/math.rs:11— src/shims/math.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in EvalContextExt::emulate_foreign_item_inner at line 11. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/math.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/shims/unix/fd.rs src/shims/unix/fd.rs:228— src/shims/unix/fd.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EvalContextExt::fcntl at line 228. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/unix/fd.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/intrinsics/x86/avx512.rs src/intrinsics/x86/avx512.rs:11— src/intrinsics/x86/avx512.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in EvalContextExt::emulate_x86_avx512_intrinsic at line 11. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/intrinsics/x86/avx512.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/shims/unix/linux_like/sync.rs src/shims/unix/linux_like/sync.rs:13— src/shims/unix/linux_like/sync.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in miri::shims::unix::linux_like::sync::futex at line 13. 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-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 14:02:47 +00:00' --until='2026-10-27 14:02:47 +00:00' --full-history --no-merges -- src/shims/unix/linux_like/sync.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.
TodoComment tests/pass-dep/windows-fs.rs:221— // TODO: Once we support more of the std API, it would be nice to test against an actual symlink — 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 tests/pass/provenance.rs:49— // TODO: also test ptr::swap, ptr::copy, ptr::copy_nonoverlapping. — 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 tests/pass/stacked_borrows/stacked-borrows.rs:25— // TODO: This is currently disabled, waiting on a decision on <https://github.com/rust-lang/rust/issues/56604>
TodoComment tests/pass/shims/x86/intrinsics-x86-sse.rs:369— // TODO: this test is exactly the same as for `_mm_cmpge_ss`, but there — 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 tests/pass/shims/x86/intrinsics-x86-sse.rs:399— // TODO: this test is exactly the same as for `_mm_cmpgt_ss`, but there — 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 tests/pass/shims/x86/intrinsics-x86-sse.rs:429— // TODO: this test is exactly the same as for `_mm_cmple_ss`, but there — 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 tests/pass/shims/x86/intrinsics-x86-sse.rs:459— // TODO: this test is exactly the same as for `_mm_cmplt_ss`, but there — 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/helpers.rs:203— // TODO: Cache the result. — 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/helpers.rs:211— // TODO: Cache the result. — 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/helpers.rs:219— // TODO: Cache the result. — 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/helpers.rs:227— // TODO: Cache the result. — 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/helpers.rs:235— // TODO: Cache the result. — 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/helpers.rs:248— // TODO: Cache the result. — 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/helpers.rs:256— // TODO: Cache the result. — 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/machine.rs:2164— /// 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 src/shims/tls.rs:174— // TODO: In the future, we might consider randomizing destructor order, but we still have to — 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/shims/unix/freebsd/foreign_items.rs:99— // TODO: Use gettid? I'm (LorrensP-2158466) not that familiar with this api . — 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/shims/native_lib/mod.rs:374— // TODO: unions, etc. — 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/shims/native_lib/mod.rs:378— // TODO: Certain non-C reprs should be okay also. — 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/shims/native_lib/trace/child.rs:196— // TODO: Maybe use clone3() instead for better signalling of when the child exits? — 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/intrinsics/x86/aesni.rs:190— // TODO: use `truncate` method on stabilization — 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 priroda/src/frontend/cli.rs:128— // TODO: look at the Spanned crate for how to easily produce errors in — 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.
FileTooLong: unix/fs.rs src/shims/unix/fs.rs— FileTooLong — 1435 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: EvalContextExt (443-2161). The bar is 500 significant lines; this is 935 over it, 2.87× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/machine.rs src/machine.rs— FileTooLong — 1363 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: MiriMachine (4 blocks, 511-2139). The bar is 500 significant lines; this is 863 over it, 2.73× 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: unix/foreign_items.rs src/shims/unix/foreign_items.rs— FileTooLong — 1168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 97% of them inside a single declaration: EvalContextExt (53-1521). The bar is 500 significant lines; this is 668 over it, 2.34× 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: concurrency/data_race.rs src/concurrency/data_race.rs— FileTooLong — 1108 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 608 over it, 2.22× 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: windows/foreign_items.rs src/shims/windows/foreign_items.rs— FileTooLong — 902 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 92% of them inside a single declaration: EvalContextExt (131-1263). The bar is 500 significant lines; this is 402 over it, 1.80× 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: x86/mod.rs src/intrinsics/x86/mod.rs— FileTooLong — 861 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 35 free functions. The bar is 500 significant lines; this is 361 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: unix/tcp_socket.rs src/shims/unix/tcp_socket.rs— FileTooLong — 808 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 308 over it, 1.62× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: unix/socket.rs src/shims/unix/socket.rs— FileTooLong — 747 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 83% of them inside a single declaration: EvalContextExt (215-1232). The bar is 500 significant lines; this is 247 over it, 1.49× 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: unix/sync.rs src/shims/unix/sync.rs— FileTooLong — 714 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 214 over it, 1.43× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/helpers.rs src/helpers.rs— FileTooLong — 639 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: EvalContextExt (169-1016). The bar is 500 significant lines; this is 139 over it, 1.28× 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: concurrency/thread.rs src/concurrency/thread.rs— FileTooLong — 611 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 111 over it, 1.22× 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: shims/foreign_items.rs src/shims/foreign_items.rs— FileTooLong — 611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 73% of them inside a single declaration: EvalContextExtPriv (257-950). The bar is 500 significant lines; this is 111 over it, 1.22× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/diagnostics.rs src/diagnostics.rs— FileTooLong — 608 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 108 over it, 1.22× 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: tree_borrows/tree.rs src/borrow_tracker/tree_borrows/tree.rs— FileTooLong — 598 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 98 over it, 1.20× 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: frontend/dap.rs priroda/src/frontend/dap.rs— FileTooLong — 593 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 89% of them inside a single declaration: DapSession (4 blocks, 94-820). The bar is 500 significant lines; this is 93 over it, 1.19× 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: stacked_borrows/mod.rs src/borrow_tracker/stacked_borrows/mod.rs— FileTooLong — 556 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 56 over it, 1.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: concurrency/sync.rs src/concurrency/sync.rs— FileTooLong — 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 72% of them inside a single declaration: EvalContextExt (313-951). The bar is 500 significant lines; this is 52 over it, 1.10× 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: windows/fs.rs src/shims/windows/fs.rs— FileTooLong — 542 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 83% of them inside a single declaration: EvalContextExt (108-825). The bar is 500 significant lines; this is 42 over it, 1.08× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/debugger.rs priroda/src/debugger.rs— FileTooLong — 513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 81% of them inside a single declaration: PrirodaContext (2 blocks, 38-991). The bar is 500 significant lines; this is 13 over it, 1.03× 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: genmc/mod.rs src/concurrency/genmc/mod.rs— FileTooLong — 507 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 89% of them inside a single declaration: GenmcCtx (5 blocks, 110-815). The bar is 500 significant lines; this is 7 over it, 1.01× 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.
Duplicated block (8 lines × 2) src/borrow_tracker/stacked_borrows/mod.rs:602— src/borrow_tracker/stacked_borrows/mod.rs:602-609 | src/borrow_tracker/tree_borrows/mod.rs:245-252 — 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 (8 lines × 2) src/concurrency/sync.rs:372— src/concurrency/sync.rs:372-379 | src/concurrency/sync.rs:426-433 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/intrinsics/x86/avx512.rs:220— src/intrinsics/x86/avx512.rs:220-227 | src/intrinsics/x86/mod.rs:1025-1032 — 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/intrinsics/x86/mod.rs:319— src/intrinsics/x86/mod.rs:319-326 | src/intrinsics/x86/mod.rs:410-417 — 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/machine.rs:1500— src/machine.rs:1500-1507 | src/machine.rs:1544-1551 — 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/shims/foreign_items.rs:364— src/shims/foreign_items.rs:364-371 | src/shims/foreign_items.rs:395-402 — 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/shims/unix/android/foreign_items.rs:101— src/shims/unix/android/foreign_items.rs:101-108 | src/shims/unix/netbsd/foreign_items.rs:28-35 — 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 (8 lines × 2) src/shims/unix/android/foreign_items.rs:112— src/shims/unix/android/foreign_items.rs:112-119 | src/shims/unix/linux/foreign_items.rs:250-257 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (8 lines × 2) src/shims/unix/foreign_items.rs:704— src/shims/unix/foreign_items.rs:704-711 | src/shims/unix/solarish/foreign_items.rs:144-151 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/solarish/foreign_items.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 47 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 (8 lines × 2) src/shims/unix/socket.rs:460— src/shims/unix/socket.rs:460-467 | src/shims/unix/socket.rs:814-821 — 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/shims/unix/socket.rs:774— src/shims/unix/socket.rs:774-781 | src/shims/unix/socket.rs:806-813 — 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/shims/unix/linux_like/thread.rs:28— src/shims/unix/linux_like/thread.rs:28-38 | src/shims/unix/linux_like/thread.rs:44-51 — 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/shims/unix/macos/foreign_items.rs:340— src/shims/unix/macos/foreign_items.rs:340-348 | src/shims/unix/macos/foreign_items.rs:350-357 — 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/shims/unix/fs.rs:1756— src/shims/unix/fs.rs:1756-1763 | src/shims/unix/fs.rs:1885-1892 — 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/shims/windows/foreign_items.rs:185— src/shims/windows/foreign_items.rs:185-192 | src/shims/windows/foreign_items.rs:221-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.
Duplicated block (8 lines × 2) src/shims/unix/socket.rs:909— src/shims/unix/socket.rs:909-916 | src/shims/unix/socket.rs:1045-1052 — 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/shims/unix/foreign_items.rs:200— src/shims/unix/foreign_items.rs:200-207 | src/shims/unix/solarish/foreign_items.rs:214-221 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/solarish/foreign_items.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 47 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.
ClassTooLong: EvalContextExt src/shims/unix/foreign_items.rs:53— ClassTooLong — 1133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 3 methods. The bar is 400 significant lines; this is 733 over it, 2.83× 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: MiriMachine src/machine.rs:511— ClassTooLong — 1043 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 24 methods, 4 blocks, lines 511-2139. The bar is 400 significant lines; this is 643 over it, 2.61× 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: EvalContextExt src/shims/unix/fs.rs:443— ClassTooLong — 1001 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 33 methods. The bar is 400 significant lines; this is 601 over it, 2.50× 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: EvalContextExt src/shims/windows/foreign_items.rs:131— ClassTooLong — 827 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 1 methods. The bar is 400 significant lines; this is 427 over it, 2.07× 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: EvalContextExt src/shims/unix/socket.rs:215— ClassTooLong — 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 18 methods. The bar is 400 significant lines; this is 219 over it, 1.55× 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: DapSession priroda/src/frontend/dap.rs:94— ClassTooLong — 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 30 methods, 4 blocks, lines 94-820. The bar is 400 significant lines; this is 129 over it, 1.32× 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: EvalContextExt src/helpers.rs:169— ClassTooLong — 489 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 49 methods. The bar is 400 significant lines; this is 89 over it, 1.22× 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: TcpSocket src/shims/unix/tcp_socket.rs:89— ClassTooLong — 480 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 1 methods, 6 blocks, lines 89-1546. The bar is 400 significant lines; this is 80 over it, 1.20× 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: GenmcCtx src/concurrency/genmc/mod.rs:110— ClassTooLong — 452 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 34 methods, 5 blocks, lines 110-815. The bar is 400 significant lines; this is 52 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: EvalContextExt src/shims/windows/fs.rs:108— ClassTooLong — 450 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 9 methods. The bar is 400 significant lines; this is 50 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: EvalContextExtPriv src/shims/foreign_items.rs:257— ClassTooLong — 445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods. The bar is 400 significant lines; this is 45 over it, 1.11× 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: PrirodaContext priroda/src/debugger.rs:38— ClassTooLong — 415 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 39 methods, 2 blocks, lines 38-991. The bar is 400 significant lines; this is 15 over it, 1.04× 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.
Duplicated block (9 lines × 2) src/intrinsics/x86/mod.rs:262— src/intrinsics/x86/mod.rs:262-270 | src/intrinsics/x86/mod.rs:279-287 — 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/intrinsics/x86/sha.rs:77— src/intrinsics/x86/sha.rs:77-85 | src/intrinsics/x86/sha.rs:95-103 — 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/shims/unix/android/foreign_items.rs:36— src/shims/unix/android/foreign_items.rs:36-44 | src/shims/unix/linux/foreign_items.rs:69-77 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (9 lines × 2) src/shims/unix/android/foreign_items.rs:48— src/shims/unix/android/foreign_items.rs:48-56 | src/shims/unix/linux/foreign_items.rs:81-89 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (9 lines × 2) src/shims/unix/socket.rs:501— src/shims/unix/socket.rs:501-509 | src/shims/unix/socket.rs:580-588 — 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/shims/windows/foreign_items.rs:598— src/shims/windows/foreign_items.rs:598-606 | src/shims/windows/foreign_items.rs:655-663 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/shims/unix/tcp_socket.rs:211— src/shims/unix/tcp_socket.rs:211-219 | src/shims/unix/udp_socket.rs:112-120 — before extracting anything, compare `src/shims/unix/tcp_socket.rs` and `src/shims/unix/udp_socket.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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/shims/unix/mem.rs:160— src/shims/unix/mem.rs:160-174 | src/shims/unix/mem.rs:210-218 — 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/shims/unix/fs.rs:779— src/shims/unix/fs.rs:779-787 | src/shims/unix/fs.rs:1314-1322 — 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/shims/unix/thread.rs:101— src/shims/unix/thread.rs:101-109 | src/shims/unix/thread.rs:137-145 — 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/shims/unix/fs.rs:903— src/shims/unix/fs.rs:903-911 | src/shims/unix/fs.rs:931-939 — 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/shims/unix/sync.rs:297— src/shims/unix/sync.rs:297-305 | src/shims/unix/sync.rs:409-417 — 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/concurrency/data_race.rs:1325— src/concurrency/data_race.rs:1325-1334 | src/concurrency/data_race.rs:1355-1364 — 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/intrinsics/x86/sse.rs:164— src/intrinsics/x86/sse.rs:164-173 | src/intrinsics/x86/sse2.rs:240-249 — 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 (10 lines × 2) src/shims/alloc.rs:128— src/shims/alloc.rs:128-137 | src/shims/foreign_items.rs:329-338 — 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 (10 lines × 2) src/shims/alloc.rs:151— src/shims/alloc.rs:151-160 | src/shims/foreign_items.rs:348-357 — 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 (10 lines × 2) src/shims/os_str.rs:275— src/shims/os_str.rs:275-284 | src/shims/os_str.rs:303-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.
Duplicated block (10 lines × 2) src/shims/unix/macos/foreign_items.rs:314— src/shims/unix/macos/foreign_items.rs:314-323 | src/shims/unix/macos/foreign_items.rs:329-338 — 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/shims/unix/mem.rs:145— src/shims/unix/mem.rs:145-154 | src/shims/unix/mem.rs:182-191 — 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/shims/unix/socket.rs:1124— src/shims/unix/socket.rs:1124-1133 | src/shims/unix/socket.rs:1164-1174 — 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/intrinsics/aarch64.rs:341— src/intrinsics/aarch64.rs:341-350 | src/intrinsics/aarch64.rs:388-397 — 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/borrow_tracker/stacked_borrows/mod.rs:701— src/borrow_tracker/stacked_borrows/mod.rs:701-710 | src/borrow_tracker/tree_borrows/mod.rs:289-298 — 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.
miri::bin::miri::main (cognitive 127) src/bin/miri.rs:408— miri::bin::miri::main has cognitive complexity 127 (threshold 15). Drivers by points: if/else 77 (101 pts), match/switch 4 (10 pts), loops 3 (9 pts), boolean chains 7 (nesting depth added 36). 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.
miri::diagnostics::report_result (cognitive 57) src/diagnostics.rs:236— miri::diagnostics::report_result has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 5 (12 pts), match/switch 6 (12 pts) (nesting depth added 33). 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.
miri::intrinsics::x86::sse42::compare_strings (cognitive 53) src/intrinsics/x86/sse42.rs:73— miri::intrinsics::x86::sse42::compare_strings has cognitive complexity 53 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 7 (19 pts), match/switch 3 (4 pts), boolean chains 1 (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.
miri::shims::unix::linux_like::sync::futex (cognitive 41) src/shims/unix/linux_like/sync.rs:13— miri::shims::unix::linux_like::sync::futex has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 2, match/switch 1 (nesting depth added 19). 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.
miri::diagnostics::report_msg (cognitive 25) src/diagnostics.rs:548— miri::diagnostics::report_msg has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 4 (6 pts), boolean chains 1, 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.
miri::shims::windows::foreign_items::win_get_full_path_name (cognitive 22) src/shims/windows/foreign_items.rs:33— miri::shims::windows::foreign_items::win_get_full_path_name has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, match/switch 1 (2 pts), loops 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.
miri::eval::args_to_utf16_command_string (cognitive 20) src/eval.rs:641— miri::eval::args_to_utf16_command_string has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (8 pts), match/switch 1 (4 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.
miri::helpers::iter_exported_symbols (cognitive 17) src/helpers.rs:119— miri::helpers::iter_exported_symbols has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 3 (4 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.
miri::math::fixed_float_value (cognitive 17) src/math.rs:264— miri::math::fixed_float_value has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (6 pts), match/switch 1 (nesting depth added 2). 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.
miri::bin::miri::main (cyclomatic 92) src/bin/miri.rs:408— miri::bin::miri::main has cyclomatic complexity 92 (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.
miri::diagnostics::report_result (cyclomatic 47) src/diagnostics.rs:236— miri::diagnostics::report_result has cyclomatic complexity 47 (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.
miri::math::fixed_float_value (cyclomatic 29) src/math.rs:264— miri::math::fixed_float_value has cyclomatic complexity 29 (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.
miri::intrinsics::x86::sse42::compare_strings (cyclomatic 26) src/intrinsics/x86/sse42.rs:73— miri::intrinsics::x86::sse42::compare_strings 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.
miri::shims::unix::linux_like::sync::futex (cyclomatic 18) src/shims/unix/linux_like/sync.rs:13— miri::shims::unix::linux_like::sync::futex 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.
miri::shims::windows::foreign_items::win_get_full_path_name (cyclomatic 17) src/shims/windows/foreign_items.rs:33— miri::shims::windows::foreign_items::win_get_full_path_name 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.
miri::diagnostics::report_msg (cyclomatic 16) src/diagnostics.rs:548— miri::diagnostics::report_msg 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.
Duplicated block (12 lines × 2) src/concurrency/sync.rs:609— src/concurrency/sync.rs:609-620 | src/concurrency/sync.rs:696-707 — 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/intrinsics/x86/mod.rs:1070— src/intrinsics/x86/mod.rs:1070-1081 | src/intrinsics/x86/mod.rs:1118-1129 — 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/shims/unix/macos/sync.rs:417— src/shims/unix/macos/sync.rs:417-428 | src/shims/unix/macos/sync.rs:466-477 — 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/shims/unix/socket.rs:894— src/shims/unix/socket.rs:894-905 | src/shims/unix/socket.rs:1070-1081 — 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/shims/unix/virtual_socket.rs:387— src/shims/unix/virtual_socket.rs:387-398 | src/shims/unix/virtual_socket.rs:478-489 — 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/shims/unix/tcp_socket.rs:632— src/shims/unix/tcp_socket.rs:632-643 | src/shims/unix/tcp_socket.rs:680-691 — 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/shims/cpu_affinity.rs:113— src/shims/cpu_affinity.rs:113-123 | src/shims/cpu_affinity.rs:168-178 — 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/shims/unix/fd.rs:361— src/shims/unix/fd.rs:361-371 | src/shims/unix/fd.rs:418-428 — 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/shims/unix/socket.rs:332— src/shims/unix/socket.rs:332-342 | src/shims/unix/socket.rs:850-860 — 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/shims/windows/foreign_items.rs:609— src/shims/windows/foreign_items.rs:609-619 | src/shims/windows/foreign_items.rs:666-676 — 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/shims/unix/fs.rs:1000— src/shims/unix/fs.rs:1000-1011 | src/shims/unix/fs.rs:1823-1833 — 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/shims/unix/socket_address.rs:282— src/shims/unix/socket_address.rs:282-292 | src/shims/unix/socket_address.rs:325-335 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
FunctionTooLong: miri::bin::miri::main src/bin/miri.rs:408— FunctionTooLong — miri::bin::miri::main runs 238 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 138 over it, 2.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.
FunctionTooLong: miri::diagnostics::report_result src/diagnostics.rs:236— FunctionTooLong — miri::diagnostics::report_result runs 195 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 95 over it, 1.95× 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_miri::phases::phase_rustc cargo-miri/src/phases.rs:276— FunctionTooLong — cargo_miri::phases::phase_rustc runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: cargo_miri::setup::setup cargo-miri/src/setup.rs:16— FunctionTooLong — cargo_miri::setup::setup 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.
FunctionTooLong: cargo_miri::phases::phase_cargo_miri cargo-miri/src/phases.rs:59— FunctionTooLong — cargo_miri::phases::phase_cargo_miri runs 104 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 4 over it, 1.04× 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.
Duplicated block (6 lines × 3) src/shims/unix/android/foreign_items.rs:90— src/shims/unix/android/foreign_items.rs:90-95 | src/shims/unix/linux/foreign_items.rs:195-200 | src/shims/unix/solarish/foreign_items.rs:47-52 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (6 lines × 3) src/shims/unix/socket.rs:703— src/shims/unix/socket.rs:703-713 | src/shims/unix/socket.rs:776-781 | src/shims/unix/socket.rs:808-813 — 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 (6 lines × 3) src/shims/unix/socket.rs:943— src/shims/unix/socket.rs:943-949 | src/shims/unix/socket.rs:982-987 | src/shims/unix/socket.rs:1047-1053 — 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 (6 lines × 3) src/shims/unix/sync.rs:164— src/shims/unix/sync.rs:164-170 | src/shims/unix/sync.rs:296-301 | src/shims/unix/sync.rs:408-413 — 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 (6 lines × 3) src/intrinsics/aarch64.rs:320— src/intrinsics/aarch64.rs:320-325 | src/intrinsics/aarch64.rs:345-350 | src/intrinsics/aarch64.rs:392-397 — 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.
cargo_miri::phases::phase_rustc (cognitive 75) cargo-miri/src/phases.rs:276— cargo_miri::phases::phase_rustc has cognitive complexity 75 (threshold 15). Drivers by points: if/else 26 (54 pts), loops 6 (13 pts), boolean chains 8 (nesting depth added 35). Of this number, 63 points are the body's own statements and 12 belong to 2 function items inside it that branch. 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_miri::phases::phase_cargo_miri (cognitive 31) cargo-miri/src/phases.rs:59— cargo_miri::phases::phase_cargo_miri has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 6, match/switch 3 (4 pts), loops 2 (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.
cargo_miri::setup::setup (cognitive 31) cargo-miri/src/setup.rs:16— cargo_miri::setup::setup has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 5, match/switch 3, loops 1 (2 pts) (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.
cargo_miri::phases::phase_runner (cognitive 19) cargo-miri/src/phases.rs:545— cargo_miri::phases::phase_runner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2, 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.
EvalContextPrivExt::tb_reborrow (cognitive 34) src/borrow_tracker/tree_borrows/mod.rs:238— EvalContextPrivExt::tb_reborrow has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 1 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EvalContextPrivExt::sb_reborrow (cognitive 26) src/borrow_tracker/stacked_borrows/mod.rs:594— EvalContextPrivExt::sb_reborrow has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 3 (4 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.
EvalContextPrivExt::schedule (cognitive 25) src/concurrency/scheduler.rs:52— EvalContextPrivExt::schedule has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 1 (2 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.
EvalContextPrivExt::virtual_socket_read (cognitive 18) src/shims/unix/virtual_socket.rs:443— EvalContextPrivExt::virtual_socket_read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (3 pts), boolean chains 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.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×4
Duplicated block (7 lines × 3) src/shims/unix/android/foreign_items.rs:82— src/shims/unix/android/foreign_items.rs:82-88 | src/shims/unix/linux/foreign_items.rs:187-193 | src/shims/unix/solarish/foreign_items.rs:38-44 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (7 lines × 3) src/shims/unix/android/foreign_items.rs:96— src/shims/unix/android/foreign_items.rs:96-102 | src/shims/unix/linux/foreign_items.rs:201-207 | src/shims/unix/solarish/foreign_items.rs:54-60 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (7 lines × 3) src/shims/unix/foreign_items.rs:657— src/shims/unix/foreign_items.rs:657-663 | src/shims/unix/foreign_items.rs:710-716 | src/shims/unix/foreign_items.rs:718-724 — 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/shims/unix/fs.rs:1737— src/shims/unix/fs.rs:1737-1743 | src/shims/unix/fs.rs:1755-1761 | src/shims/unix/fs.rs:1884-1890 — 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.
cargo_miri::phases::phase_rustc (cyclomatic 37) cargo-miri/src/phases.rs:276— cargo_miri::phases::phase_rustc has cyclomatic complexity 37 (threshold 15). Of this number, 30 points are the body's own statements and 7 belong to 2 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.
cargo_miri::phases::phase_cargo_miri (cyclomatic 30) cargo-miri/src/phases.rs:59— cargo_miri::phases::phase_cargo_miri has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
cargo_miri::setup::setup (cyclomatic 24) cargo-miri/src/setup.rs:16— cargo_miri::setup::setup 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.
EvalContextPrivExt::tb_reborrow (cyclomatic 17) src/borrow_tracker/tree_borrows/mod.rs:238— EvalContextPrivExt::tb_reborrow 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.
EvalContextPrivExt::sb_reborrow (cyclomatic 16) src/borrow_tracker/stacked_borrows/mod.rs:594— EvalContextPrivExt::sb_reborrow 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.
EvalContextPrivExt::schedule (cyclomatic 16) src/concurrency/scheduler.rs:52— EvalContextPrivExt::schedule 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.
EvalContextExtPriv::emulate_foreign_item_inner (cognitive 80) src/shims/foreign_items.rs:258— EvalContextExtPriv::emulate_foreign_item_inner has cognitive complexity 80 (threshold 15). Drivers by points: if/else 35 (66 pts), match/switch 6 (11 pts), boolean chains 3 (nesting depth added 36). 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.
EvalContextExtPriv::addr_from_alloc_id_uncached (cognitive 19) src/alloc_addresses/mod.rs:108— EvalContextExtPriv::addr_from_alloc_id_uncached has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EvalContextExtPriv::tracing_apply_accesses (cognitive 18) src/shims/native_lib/mod.rs:181— EvalContextExtPriv::tracing_apply_accesses has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (7 pts), match/switch 1 (3 pts), boolean chains 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.
Stack::retain (cognitive 18) src/borrow_tracker/stacked_borrows/stack.rs:45— Stack::retain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), match/switch 1 (2 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.
Stack::access (cognitive 17) src/borrow_tracker/stacked_borrows/mod.rs:271— Stack::access has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (2 pts), boolean chains 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.
Stack::disable_uniques_starting_at (cognitive 17) src/borrow_tracker/stacked_borrows/stack.rs:380— Stack::disable_uniques_starting_at has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (4 members, 50+ identical tokens) src/intrinsics/x86/mod.rs:790— src/intrinsics/x86/mod.rs:790-811 | src/intrinsics/x86/mod.rs:821-844 | src/intrinsics/x86/mod.rs:1171-1199 | src/intrinsics/x86/mod.rs:1220-1249 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) src/shims/unix/freebsd/foreign_items.rs:21— src/shims/unix/freebsd/foreign_items.rs:21-184 | src/shims/unix/linux/foreign_items.rs:35-364 | src/shims/unix/macos/foreign_items.rs:29-447 | src/shims/unix/solarish/foreign_items.rs:24-226 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) src/shims/unix/fs.rs:1734— src/shims/unix/fs.rs:1734-1747 | src/shims/unix/fs.rs:1749-1765 | src/shims/unix/fs.rs:1773-1792 | src/shims/unix/fs.rs:1865-1894 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (17 lines × 2) src/shims/unix/tcp_socket.rs:226— src/shims/unix/tcp_socket.rs:226-242 | src/shims/unix/udp_socket.rs:127-143 — before extracting anything, compare `src/shims/unix/tcp_socket.rs` and `src/shims/unix/udp_socket.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 (17 lines × 2) src/shims/unix/tcp_socket.rs:774— src/shims/unix/tcp_socket.rs:774-790 | src/shims/unix/udp_socket.rs:268-284 — before extracting anything, compare `src/shims/unix/tcp_socket.rs` and `src/shims/unix/udp_socket.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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 (17 lines × 2) src/shims/unix/tcp_socket.rs:1173— src/shims/unix/tcp_socket.rs:1173-1189 | src/shims/unix/tcp_socket.rs:1318-1334 — 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/shims/math.rs:103— src/shims/math.rs:103-116 | src/shims/math.rs:195-208 — 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/shims/unix/foreign_items.rs:885— src/shims/unix/foreign_items.rs:885-898 | src/shims/windows/foreign_items.rs:638-651 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) src/shims/windows/sync.rs:266— src/shims/windows/sync.rs:266-279 | src/shims/windows/sync.rs:286-299 — 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/concurrency/weak_memory.rs:504— src/concurrency/weak_memory.rs:504-516 | src/concurrency/weak_memory.rs:608-620 — 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/intrinsics/x86/avx2.rs:182— src/intrinsics/x86/avx2.rs:182-194 | src/intrinsics/x86/sse2.rs:56-68 — 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 (13 lines × 2) src/shims/unix/linux/foreign_items.rs:202— src/shims/unix/linux/foreign_items.rs:202-214 | src/shims/unix/solarish/foreign_items.rs:55-67 — `src/shims/unix/linux/foreign_items.rs` and `src/shims/unix/solarish/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 50 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (5 lines × 3) src/shims/unix/virtual_socket.rs:612— src/shims/unix/virtual_socket.rs:612-616 | src/shims/unix/virtual_socket.rs:623-627 | src/shims/unix/virtual_socket.rs:686-690 — 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 (5 lines × 3) src/shims/unix/foreign_items.rs:169— src/shims/unix/foreign_items.rs:169-174 | src/shims/unix/foreign_items.rs:456-461 | src/shims/unix/foreign_items.rs:586-590 — 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 (5 lines × 3) src/shims/unix/foreign_items.rs:475— src/shims/unix/foreign_items.rs:475-479 | src/shims/unix/linux/foreign_items.rs:170-174 | src/shims/unix/macos/foreign_items.rs:87-91 — before extracting anything, compare `src/shims/unix/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 65 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.
MiriMachine::emit_diagnostic (cyclomatic 34) src/diagnostics.rs:634— MiriMachine::emit_diagnostic has cyclomatic complexity 34 (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.
MiriMachine::extern_static_pointer (cyclomatic 16) src/machine.rs:1470— MiriMachine::extern_static_pointer 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.
PrirodaContext::render_source_shaped_op_inner (cyclomatic 22) priroda/src/debugger.rs:655— PrirodaContext::render_source_shaped_op_inner 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.
PrirodaContext::resume (cyclomatic 19) priroda/src/debugger.rs:318— PrirodaContext::resume 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.
PrirodaContext::render_source_shaped_op_inner (cognitive 34) priroda/src/debugger.rs:655— PrirodaContext::render_source_shaped_op_inner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (6 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PrirodaContext::resume (cognitive 30) priroda/src/debugger.rs:318— PrirodaContext::resume has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (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.
MiriMachine::extern_static_pointer (cognitive 23) src/machine.rs:1470— MiriMachine::extern_static_pointer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, match/switch 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.
MiriMachine::before_memory_write (cognitive 16) src/machine.rs:1736— MiriMachine::before_memory_write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), boolean chains 1, 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.
TooManyFields: MiriMachine src/machine.rs:511— TooManyFields — 60 stored fields beside 24 methods. The bar is 30 stored fields; this is 30 over it, 2.00× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: MiriConfig src/eval.rs:93— TooManyFields — 38 stored fields. The bar is 30 stored fields; this is 8 over it, 1.27× 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.
TooManyMethods: PrirodaContext priroda/src/debugger.rs:38— TooManyMethods — 39 methods. The bar is 30 methods; this is 9 over it, 1.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: GenmcCtx src/concurrency/genmc/mod.rs:110— TooManyMethods — 34 methods, declared across 4 files: genmc/mod.rs (29), genmc/run.rs (3), genmc/scheduling.rs (1), genmc/shims.rs (1). The bar is 30 methods; this is 4 over it, 1.13× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (15 lines × 2) src/shims/math.rs:66— src/shims/math.rs:66-80 | src/shims/math.rs:159-173 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) src/shims/unix/socket.rs:373— src/shims/unix/socket.rs:373-387 | src/shims/unix/socket.rs:506-520 — 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–14 lines × 2) src/intrinsics/x86/avx.rs:135— src/intrinsics/x86/avx.rs:135-147 | src/intrinsics/x86/avx.rs:168-181 — 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–14 lines × 2) src/shims/time.rs:335— src/shims/time.rs:335-348 | src/shims/time.rs:363-375 — 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 × 3) src/intrinsics/aarch64.rs:328— src/intrinsics/aarch64.rs:328-336 | src/intrinsics/aarch64.rs:353-361 | src/intrinsics/aarch64.rs:400-408 — 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 (9 lines × 3) src/intrinsics/x86/mod.rs:338— src/intrinsics/x86/mod.rs:338-346 | src/intrinsics/x86/mod.rs:866-874 | src/intrinsics/x86/mod.rs:912-920 — 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 (8 lines × 3) src/intrinsics/x86/avx.rs:134— src/intrinsics/x86/avx.rs:134-141 | src/intrinsics/x86/avx.rs:167-174 | src/intrinsics/x86/mod.rs:1521-1528 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (8 lines × 3) src/shims/unix/socket.rs:373— src/shims/unix/socket.rs:373-380 | src/shims/unix/socket.rs:506-513 | src/shims/unix/socket.rs:585-592 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Low cohesion: DisplayFmt (LCOM4 4) src/borrow_tracker/tree_borrows/diagnostics.rs:539— DisplayFmt's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: UdpSocket (LCOM4 4) src/shims/unix/udp_socket.rs:15— UdpSocket's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
EvalContextExtPriv::emulate_foreign_item_inner (cyclomatic 74) src/shims/foreign_items.rs:258— EvalContextExtPriv::emulate_foreign_item_inner has cyclomatic complexity 74 (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.
ChromeLayer::new (cyclomatic 20) src/bin/log/tracing_chrome.rs:335— ChromeLayer::new has cyclomatic complexity 20 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
NewPermission::new (cyclomatic 19) src/borrow_tracker/tree_borrows/mod.rs:126— NewPermission::new has cyclomatic complexity 19 (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.
DisplayRepr::print (cyclomatic 17) src/borrow_tracker/tree_borrows/diagnostics.rs:691— DisplayRepr::print 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, 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.
Command::bench (cyclomatic 16) miri-script/src/commands.rs:273— Command::bench has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
VClockAlloc::report_data_race (cyclomatic 16) src/concurrency/data_race.rs:1111— VClockAlloc::report_data_race has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
XxxComment tests/fail-dep/concurrency/windows_join_main.rs:13— // XXX HACK: This is how miri represents the handle for thread 0. — 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.
ChromeLayer::new (cognitive 35) src/bin/log/tracing_chrome.rs:335— ChromeLayer::new has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 20). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
ChildListener::next (cognitive 31) src/shims/native_lib/trace/parent.rs:119— ChildListener::next has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 3 (8 pts), loops 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.
DisplayRepr::print (cognitive 24) src/borrow_tracker/tree_borrows/diagnostics.rs:691— DisplayRepr::print has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 7 (8 pts) (nesting depth added 5). Of this number, 15 points are the body's own statements and 9 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.
NewPermission::new (cognitive 23) src/borrow_tracker/tree_borrows/mod.rs:126— NewPermission::new has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
DedupRangeMap::iter_mut (cognitive 23) src/data_structures/dedup_range_map.rs:137— DedupRangeMap::iter_mut has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). 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.
FileMetadata::at (cognitive 23) src/shims/unix/fs.rs:2229— FileMetadata::at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 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.
Command::bench (cognitive 22) miri-script/src/commands.rs:273— Command::bench has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 3 (4 pts), boolean chains 2 (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.
Frontend::parse_from_args (cognitive 20) priroda/src/main.rs:57— Frontend::parse_from_args has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VClockAlloc::report_data_race (cognitive 19) src/concurrency/data_race.rs:1111— VClockAlloc::report_data_race has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6 (nesting depth added 1). 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.
DapSession::run_requests (cognitive 17) priroda/src/frontend/dap.rs:140— DapSession::run_requests has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 2 (6 pts), loops 2 (4 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.
Cli::print_command_result (cognitive 16) priroda/src/frontend/cli.rs:45— Cli::print_command_result has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (3 pts), loops 1 (3 pts) (nesting depth added 8). 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.
TlsDtorsState::on_stack_empty (cognitive 16) src/shims/tls.rs:261— TlsDtorsState::on_stack_empty has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts) (nesting depth added 7). 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.
Near-duplicate member pair (83 shared lines) src/shims/unix/android/foreign_items.rs:25— src/shims/unix/android/foreign_items.rs:25-130 | src/shims/unix/linux/foreign_items.rs:35-364 — These two members are variants of one another: 83 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· Edited copy of a member (34 corresponding lines) · ×1
Edited copy of a member (34 corresponding lines) priroda/src/frontend/dap.rs:488— priroda/src/frontend/dap.rs:488-531 | priroda/src/frontend/dap.rs:537-576 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (18 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (18 members, 50+ identical tokens) src/intrinsics/aarch64.rs:14— src/intrinsics/aarch64.rs:14-418 | src/intrinsics/x86/avx.rs:17-249 | src/intrinsics/x86/avx512.rs:218-251 | src/intrinsics/x86/gfni.rs:12-64 | src/intrinsics/x86/gfni.rs:78-127 | src/intrinsics/x86/mod.rs:306-326 | src/intrinsics/x86/mod.rs:336-354 | src/intrinsics/x86/mod.rs:515-557 | src/intrinsics/x86/mod.rs:581-603 | src/intrinsics/x86/mod.rs:864-896 | src/intrinsics/x86/mod.rs:910-943 | src/intrinsics/x86/mod.rs:1024-1056 | src/intrinsics/x86/mod.rs:1171-1199 | src/intrinsics/x86/mod.rs:1220-1249 | src/intrinsics/x86/mod.rs:1263-1287 | src/intrinsics/x86/mod.rs:1361-1387 | src/intrinsics/x86/mod.rs:1519-1539 | src/intrinsics/x86/sse41.rs:13-163 — These 18 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 18 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 18 times.
Duplicated block (44 lines × 2) src/shims/unix/fd.rs:479— src/shims/unix/fd.rs:479-522 | src/shims/unix/fd.rs:602-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 (29 lines × 2) src/shims/windows/fs.rs:638— src/shims/windows/fs.rs:638-666 | src/shims/windows/fs.rs:739-767 — 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 (27 lines × 2) src/shims/unix/android/foreign_items.rs:74— src/shims/unix/android/foreign_items.rs:74-100 | src/shims/unix/linux/foreign_items.rs:179-205 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (23–27 lines × 2) src/shims/unix/fd.rs:707— src/shims/unix/fd.rs:707-729 | src/shims/unix/fd.rs:755-781 — 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 (26 lines × 2) src/shims/windows/foreign_items.rs:235— src/shims/windows/foreign_items.rs:235-260 | src/shims/windows/foreign_items.rs:275-300 — 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 (25 lines × 2) src/intrinsics/x86/mod.rs:483— src/intrinsics/x86/mod.rs:483-507 | src/intrinsics/x86/mod.rs:533-557 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (23 lines × 3) priroda/src/frontend/dap.rs:368— priroda/src/frontend/dap.rs:368-390 | priroda/src/frontend/dap.rs:509-531 | priroda/src/frontend/dap.rs:554-576 — 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 (20–21 lines × 3) src/shims/unix/socket.rs:236— src/shims/unix/socket.rs:236-256 | src/shims/unix/socket.rs:380-400 | src/shims/unix/virtual_socket.rs:567-586 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (14–20 lines × 2) src/intrinsics/aarch64.rs:276— src/intrinsics/aarch64.rs:276-289 | src/intrinsics/loongarch.rs:44-63 — 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 (20 lines × 2) src/shims/unix/virtual_socket.rs:631— src/shims/unix/virtual_socket.rs:631-650 | src/shims/unix/virtual_socket.rs:705-724 — 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–18 lines × 3) src/shims/unix/freebsd/foreign_items.rs:42— src/shims/unix/freebsd/foreign_items.rs:42-53 | src/shims/unix/macos/foreign_items.rs:263-280 | src/shims/unix/solarish/foreign_items.rs:83-92 — `src/shims/unix/freebsd/foreign_items.rs` and `src/shims/unix/macos/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 35 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (18 lines × 2) src/shims/unix/tcp_socket.rs:252— src/shims/unix/tcp_socket.rs:252-269 | src/shims/unix/virtual_socket.rs:275-292 — 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 (16 lines × 2) src/shims/math.rs:231— src/shims/math.rs:231-246 | src/shims/math.rs:253-268 — 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–15 lines × 2) src/shims/unix/socket.rs:703— src/shims/unix/socket.rs:703-717 | src/shims/unix/socket.rs:776-785 — 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 × 3) src/shims/foreign_items.rs:761— src/shims/foreign_items.rs:761-773 | src/shims/foreign_items.rs:788-800 | src/shims/foreign_items.rs:883-895 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10–12 lines × 2) src/shims/foreign_items.rs:617— src/shims/foreign_items.rs:617-626 | src/shims/windows/foreign_items.rs:952-963 — 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 (11 lines × 3) src/shims/time.rs:335— src/shims/time.rs:335-345 | src/shims/time.rs:363-373 | src/shims/time.rs:443-453 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10–11 lines × 2) src/shims/windows/fs.rs:584— src/shims/windows/fs.rs:584-594 | src/shims/windows/fs.rs:690-699 — 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–10 lines × 4) src/shims/unix/freebsd/foreign_items.rs:39— src/shims/unix/freebsd/foreign_items.rs:39-46 | src/shims/unix/linux/foreign_items.rs:223-230 | src/shims/unix/macos/foreign_items.rs:258-267 | src/shims/unix/solarish/foreign_items.rs:80-87 — `src/shims/unix/freebsd/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 4 separate duplicated blocks between them, totalling at least 30 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (10 lines × 3) src/shims/unix/tcp_socket.rs:371— src/shims/unix/tcp_socket.rs:371-380 | src/shims/unix/tcp_socket.rs:779-788 | src/shims/unix/udp_socket.rs:273-282 — before extracting anything, compare `src/shims/unix/tcp_socket.rs` and `src/shims/unix/udp_socket.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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–10 lines × 2) src/borrow_tracker/tree_borrows/tree.rs:540— src/borrow_tracker/tree_borrows/tree.rs:540-549 | src/borrow_tracker/tree_borrows/tree.rs:638-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 (6–10 lines × 2) src/shims/unix/virtual_socket.rs:607— src/shims/unix/virtual_socket.rs:607-616 | src/shims/unix/virtual_socket.rs:685-690 — 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 × 4) src/intrinsics/aarch64.rs:326— src/intrinsics/aarch64.rs:326-333 | src/intrinsics/aarch64.rs:351-358 | src/intrinsics/aarch64.rs:398-405 | src/intrinsics/x86/sha.rs:56-63 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (7 lines × 10) src/intrinsics/x86/avx.rs:134— src/intrinsics/x86/avx.rs:134-140 | src/intrinsics/x86/avx.rs:167-173 | src/intrinsics/x86/gfni.rs:48-54 | src/intrinsics/x86/mod.rs:338-344 | src/intrinsics/x86/mod.rs:517-523 | src/intrinsics/x86/mod.rs:866-872 | src/intrinsics/x86/mod.rs:912-918 | src/intrinsics/x86/mod.rs:1265-1271 | src/intrinsics/x86/mod.rs:1363-1369 | src/intrinsics/x86/mod.rs:1521-1527 — there are 10 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 10 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (7 lines × 7) src/intrinsics/aarch64.rs:326— src/intrinsics/aarch64.rs:326-332 | src/intrinsics/aarch64.rs:351-357 | src/intrinsics/aarch64.rs:375-381 | src/intrinsics/aarch64.rs:398-404 | src/intrinsics/x86/sha.rs:56-62 | src/intrinsics/x86/sha.rs:76-82 | src/intrinsics/x86/sha.rs:94-100 — there are 7 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (7 lines × 6) src/shims/unix/socket.rs:317— src/shims/unix/socket.rs:317-323 | src/shims/unix/socket.rs:338-344 | src/shims/unix/socket.rs:676-682 | src/shims/unix/socket.rs:713-719 | src/shims/unix/socket.rs:781-787 | src/shims/unix/socket.rs:856-862 — all 6 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 × 5) src/shims/unix/socket.rs:372— src/shims/unix/socket.rs:372-378 | src/shims/unix/socket.rs:459-465 | src/shims/unix/socket.rs:505-511 | src/shims/unix/socket.rs:584-590 | src/shims/unix/socket.rs:813-819 — all 5 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–7 lines × 3) src/intrinsics/aarch64.rs:235— src/intrinsics/aarch64.rs:235-240 | src/intrinsics/simd.rs:81-87 | src/intrinsics/x86/mod.rs:427-433 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (4–7 lines × 4) src/intrinsics/x86/mod.rs:798— src/intrinsics/x86/mod.rs:798-804 | src/intrinsics/x86/mod.rs:831-837 | src/intrinsics/x86/mod.rs:1188-1191 | src/intrinsics/x86/mod.rs:1236-1239 — 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.
Duplicated block (6 lines × 11) src/intrinsics/aarch64.rs:27— src/intrinsics/aarch64.rs:27-32 | src/intrinsics/x86/avx.rs:134-140 | src/intrinsics/x86/avx.rs:167-173 | src/intrinsics/x86/gfni.rs:48-54 | src/intrinsics/x86/mod.rs:338-344 | src/intrinsics/x86/mod.rs:517-523 | src/intrinsics/x86/mod.rs:866-872 | src/intrinsics/x86/mod.rs:912-918 | src/intrinsics/x86/mod.rs:1265-1271 | src/intrinsics/x86/mod.rs:1363-1369 | src/intrinsics/x86/mod.rs:1521-1527 — there are 11 copies across 4 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 11 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (5 lines × 12) src/intrinsics/x86/gfni.rs:79— src/intrinsics/x86/gfni.rs:79-83 | src/intrinsics/x86/mod.rs:307-311 | src/intrinsics/x86/mod.rs:337-341 | src/intrinsics/x86/mod.rs:516-520 | src/intrinsics/x86/mod.rs:582-586 | src/intrinsics/x86/mod.rs:865-869 | src/intrinsics/x86/mod.rs:911-915 | src/intrinsics/x86/mod.rs:1025-1032 | src/intrinsics/x86/mod.rs:1172-1180 | src/intrinsics/x86/mod.rs:1264-1268 | src/intrinsics/x86/mod.rs:1362-1366 | src/intrinsics/x86/mod.rs:1520-1524 — there are 12 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 12 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (5 lines × 6) src/shims/unix/android/foreign_items.rs:32— src/shims/unix/android/foreign_items.rs:32-36 | src/shims/unix/android/foreign_items.rs:43-47 | src/shims/unix/foreign_items.rs:247-251 | src/shims/unix/foreign_items.rs:258-262 | src/shims/unix/linux/foreign_items.rs:65-69 | src/shims/unix/linux/foreign_items.rs:76-80 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (5 lines × 4) src/shims/unix/fs.rs:852— src/shims/unix/fs.rs:852-857 | src/shims/unix/linux_like/epoll.rs:86-90 | src/shims/unix/socket.rs:665-669 | src/shims/unix/socket.rs:699-703 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (5 lines × 5) src/shims/unix/android/foreign_items.rs:107— src/shims/unix/android/foreign_items.rs:107-112 | src/shims/unix/freebsd/foreign_items.rs:155-159 | src/shims/unix/linux/foreign_items.rs:321-325 | src/shims/unix/macos/foreign_items.rs:38-44 | src/shims/unix/solarish/foreign_items.rs:156-161 — `src/shims/unix/android/foreign_items.rs` and `src/shims/unix/linux/foreign_items.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 12 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (6 lines × 4) src/shims/unix/fs.rs:1737— src/shims/unix/fs.rs:1737-1743 | src/shims/unix/fs.rs:1755-1761 | src/shims/unix/fs.rs:1780-1785 | src/shims/unix/fs.rs:1884-1890 — 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.
Duplicated block (16–18 lines × 3) test-cargo-miri/src/main.rs:34— test-cargo-miri/src/main.rs:34-49 | test-cargo-miri/subcrate/main.rs:14-30 | test-cargo-miri/subcrate/test.rs:16-33 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
P12 · CI test-gate honesty· Coverage collected but not gated · ×1
Coverage collected but not gated — CI collects a coverage report but no step enforces a minimum — coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool's minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository's CI files AND its coverage configuration — the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited — matched against the threshold settings this check knows by name. A floor set in your coverage service's web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:188— `debug!` at line 188 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:395— `debug!` at line 395 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:418— `debug!` at line 418 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:437— `debug!` at line 437 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:464— `debug!` at line 464 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:597— `debug!` at line 597 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:658— `debug!` at line 658 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:671— `debug!` at line 671 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:683— `debug!` at line 683 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:719— `debug!` at line 719 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:744— `debug!` at line 744 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/mod.rs:783— `debug!` at line 783 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/run.rs:66— `info!` at line 66 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/shims.rs:50— `debug!` at line 50 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/shims.rs:158— `debug!` at line 158 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging src/concurrency/genmc/shims.rs:221— `debug!` at line 221 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Orphaned file src/borrow_tracker/tree_borrows/unimap.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/data_structures/range_object_map.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/alloc/alloc_bytes.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/concurrency/genmc/global_allocations.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/concurrency/data_race_handler.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file miri-script/src/coverage.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/alloc_addresses/address_generator.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/shims/native_lib/trace/messages.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/borrow_tracker/tree_borrows/exhaustive.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/concurrency/genmc/thread_id_map.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 7 significant file(s) lose their only recent owner: src/shims/unix/macos/sync.rs, bench-cargo-miri/mse/src/main.rs, src/concurrency/scheduler.rs, src/shims/cpu_affinity.rs, src/alloc_addresses/reuse_pool.rs, src/data_structures/mono_hash_map.rs, test-cargo-miri/src/main.rs. Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 3 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 (11 single-owned of 135 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 135 of the 181 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: priroda/src/frontend/dap.rs, priroda/src/frontend/cli.rs, src/shims/unix/socket.rs, src/borrow_tracker/stacked_borrows/item.rs.
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 15 project(s) overshoot their size bounds, lowering Project Cohesion to 8.7/10. The most over is `(repository root)` (53994 LoC, 317 module-visible types across 27 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.
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 10 of 135 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, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 135 of the 181 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: src/borrow_tracker/tree_borrows/unimap.rs, src/data_structures/range_object_map.rs, src/alloc/alloc_bytes.rs, src/concurrency/genmc/global_allocations.rs, src/concurrency/data_race_handler.rs, miri-script/src/coverage.rs, src/alloc_addresses/address_generator.rs, src/shims/native_lib/trace/messages.rs (and 2 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.
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.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
Logging is not universal — Only 1/14 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `bench-cargo-miri/backtraces`, `bench-cargo-miri/big-allocs`, `bench-cargo-miri/mse`, `bench-cargo-miri/range-iteration`, `bench-cargo-miri/serde1` and 8 more.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Duplicated predicate src/borrow_tracker/stacked_borrows/mod.rs:74— `pointee.is_unpin(*cx.tcx, cx.typing_env()) && pointee.is_unsafe_unpin(*cx.tcx, cx.typing_env())` appears character-identically in 2 files — src/borrow_tracker/stacked_borrows/mod.rs, src/borrow_tracker/tree_borrows/mod.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Outdated: backtrace — `backtrace` is locked at 0.3.76 but 0.3.77 is the current stable release on crates.io, and it already satisfies the `"0.3.65"` requirement declared in bench-cargo-miri/backtraces/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p backtrace` and commit the updated REDACTED.
Outdated: cc — `cc` is locked at 1.5.1 but 1.10.0 is the current stable release on crates.io, and it already satisfies the `"1.2.16"` requirement declared in genmc-sys/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p cc` and commit the updated REDACTED.
Outdated: cxx — `cxx` is locked at 1.0.202 but 1.0.205 is the current stable release on crates.io, and it already satisfies the `"1.0.173"` requirement declared in genmc-sys/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p cxx` and commit the updated REDACTED.
Outdated: cxx-build — `cxx-build` is locked at 1.0.202 but 1.0.205 is the current stable release on crates.io, and it already satisfies the `"1.0.173"` requirement declared in genmc-sys/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p cxx-build` and commit the updated REDACTED.
Outdated: libc — `libc` is locked at 0.2.189 but 0.2.191 is the current stable release on crates.io, and it already satisfies the `"0.2"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libc` and commit the updated REDACTED.
Outdated: libffi — `libffi` is locked at 5.1.0 but 5.2.0 is the current stable release on crates.io, and it already satisfies the `"5.1.0"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libffi` and commit the updated REDACTED.
Outdated: mio — `mio` is locked at 1.2.3 but 1.2.4 is the current stable release on crates.io, and it already satisfies the `"1.1.1"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p mio` and commit the updated REDACTED.
Outdated: serde_json — `serde_json` is locked at 1.0.151 but 1.0.154 is the current stable release on crates.io, and it already satisfies the `"1.0"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde_json` and commit the updated REDACTED.
Outdated: smallvec — `smallvec` is locked at 1.16.2 but 1.16.4 is the current stable release on crates.io, and it already satisfies the `"1.7"` requirement declared in Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p smallvec` and commit the updated REDACTED.
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.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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.
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.
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.
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.
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.
Run 01a17e65-df07-743d-9513-0b3647db705a · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 20 · Warnings: 651 · Recommendations: 40 · Info: 9 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 27-10-2026 @ 17:26 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.