Public report of chipsalliance/t1, published 6 November 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.11.2). 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, 6 November 2026, 21:12 UTC · Survey ID cd_6f4e2af3937348c68699ed93e543d99f
chipsalliance/t1
Measured 6 November 2026, 21:12 UTC, at code version 6c61e76
CAI scoreWeak
CriticalWeakAdequateStrongExemplary
Down 4 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: 78,064 lines of product code in 18 projects, tests not counted · Estimated rebuild effort: about 0.5 person-years · Weakest lens: Security and Compliance, 38
Findings by how serious they are
21 critical468 serious341 minor
18 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look 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
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
6 November 2026, 21:12 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 the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
The score is deterministic, which means the same code always gets the same score. We work 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 ▸
59of 59 dimensions measured by tools.
802of 830 findings point to an exact file and line, so you can open each one in the code. The other 28 concern the repository as a whole, such as missing documentation.
59dimensions across 5 lenses, read from 78,064 lines of product code in 18 projects.
chipsalliance/t1 falls short of our standard for production, in part because it has pipeline tools referenced by a changeable name. It scores 49 out of 100 and is rated Weak, and all 21 of its critical findings are security problems.
Security and Compliance, at 38, is the weakest lens and counts most in the score. The best first step is fixing the six pipeline steps that put outside input straight into a shell command, worth about 5 points. Recording design decisions comes next, worth about 2 points. Raising Security and Compliance to 70 would lift the score to about 58.
Twelve pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Six pipeline steps put outside input straight into a shell command, so an attacker can run commands in the build pipeline. Pinning each tool to an exact version and passing outside input through environment variables would close both risks. Setting a waiting period for automatic updates would fix the automatic dependency update that takes a new release at once, and the password or key in the code's history needs replacing, with the old one switched off.
The product code is 78,064 lines, about €75,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 Security and Compliance rose from 38 to 70, the lowest score rated Strong, the score would rise from 49 to about 58.
Code composition: what the lines of code are
Product code 96%Tests 4%
New since the last survey: 4 findings
These 4 critical or serious findings weren't in the previous survey, on 21 October 2026.
Code Duplication · Members sharing a duplicated core (8 members, 50+ identical tokens) t1/src/decoder/attribute/isCrosswrite.scala
Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) elaborator/src/rocketv/DCache.scala
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) t1/src/laneStage/MaskExchangeUnit.scala
Explicit Debt · TodoComment repeated across 14 files t1/src/Bundles.scala
We compare 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: 13 findings
These 13 critical or serious findings were in the previous survey, on 21 October 2026, and are gone from this one.
Code Duplication · Members sharing a duplicated core (8 members, 50+ identical tokens) t1/src/decoder/attribute/isCrosswrite.scala
Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) elaborator/src/rocketv/DCache.scala
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) t1/src/laneStage/MaskExchangeUnit.scala
Explicit Debt · TodoComment repeated across 14 files rocketv/src/HellaCache.scala
€25,000 to €120,000, for 414 to 1,312 hours of work, about 0.5 person-years for one engineer
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.7 at a score of 49. 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: 78,064 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: We price 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 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED.
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 €75,000 to build again, about 0.5 person-years of work. Its weakest lens is Security and Compliance, at 38 (checked 3 of 10). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST). Of all the actions in this report, it raises the score most for the work it takes: about 5 points for low effort, because it clears the 6 Static Analysis (SAST) findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
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.
546 modules, with 549 dependencies between them. 5 loops run through 38 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 506 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.
(global) uses org.chipsalliance.rvdecoderdb, so a change to org.chipsalliance.rvdecoderdb can break (global), while a change to (global) can't break org.chipsalliance.rvdecoderdb.
Position
Below the diagonal: (global) uses a module listed above it, which is the healthy direction.
15→21 addition.prefixadder uses additionpart of a loop✕
Connections
1 pair of types, where a type in addition.prefixadder uses a type in addition.
addition.prefixadder uses addition, so a change to addition can break addition.prefixadder, while a change to addition.prefixadder can't break addition.
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.
dpi_t1rocketemu.drive uses dpi_t1rocketemu.interconnect, so a change to dpi_t1rocketemu.interconnect can break dpi_t1rocketemu.drive, while a change to dpi_t1rocketemu.drive can't break dpi_t1rocketemu.interconnect.
Position
Below the diagonal: dpi_t1rocketemu.drive uses a module listed above it, which is the healthy direction.
17→23 org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType uses org.chipsalliance.t1.rtl.decoder.attributepart of a loop✕
Connections
1 pair of types, where a type in org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType uses a type in org.chipsalliance.t1.rtl.decoder.attribute.
org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType uses org.chipsalliance.t1.rtl.decoder.attribute, so a change to org.chipsalliance.t1.rtl.decoder.attribute can break org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType, while a change to org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType can't break org.chipsalliance.t1.rtl.decoder.attribute.
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→29 org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType uses org.chipsalliance.t1.rtl.decoderpart of a loop✕
Connections
5 pairs of types, where a type in org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType uses a type in org.chipsalliance.t1.rtl.decoder.
org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType uses org.chipsalliance.t1.rtl.decoder, so a change to org.chipsalliance.t1.rtl.decoder can break org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType, while a change to org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType can't break org.chipsalliance.t1.rtl.decoder.
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.
pokedex.difftest uses pokedex.difftest.replay, so a change to pokedex.difftest.replay can break pokedex.difftest, while a change to pokedex.difftest can't break pokedex.difftest.replay.
Position
Below the diagonal: pokedex.difftest uses a module listed above it, which is the healthy direction.
19→25 pokedex.model.ffi uses pokedex.modelpart of a loop✕
Connections
1 pair of types, where a type in pokedex.model.ffi uses a type in pokedex.model.
pokedex.model.ffi uses pokedex.model, so a change to pokedex.model can break pokedex.model.ffi, while a change to pokedex.model.ffi can't break pokedex.model.
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.
1 pair of types, where a type in spike_rs.spike_event uses a type in spike_rs.
The types involved
spike_rs.spike_event.SpikeEvent → spike_rs.Spike
Direction
spike_rs.spike_event uses spike_rs, so a change to spike_rs can break spike_rs.spike_event, while a change to spike_rs.spike_event can't break spike_rs.
Position
Below the diagonal: spike_rs.spike_event uses a module listed above it, which is the healthy direction.
addition uses addition.prefixadder, so a change to addition.prefixadder can break addition, while a change to addition can't break addition.prefixadder.
Position
Below the diagonal: addition uses a module listed above it, which is the healthy direction.
org.chipsalliance.rocketv uses org.chipsalliance.amba.axi4.bundle, so a change to org.chipsalliance.amba.axi4.bundle can break org.chipsalliance.rocketv, while a change to org.chipsalliance.rocketv can't break org.chipsalliance.amba.axi4.bundle.
Position
Below the diagonal: org.chipsalliance.rocketv uses a module listed above it, which is the healthy direction.
org.chipsalliance.rocketv uses org.chipsalliance.dwbb.stdlib.queue, so a change to org.chipsalliance.dwbb.stdlib.queue can break org.chipsalliance.rocketv, while a change to org.chipsalliance.rocketv can't break org.chipsalliance.dwbb.stdlib.queue.
Position
Below the diagonal: org.chipsalliance.rocketv uses a module listed above it, which is the healthy direction.
org.chipsalliance.rocketv uses org.chipsalliance.rvdecoderdb, so a change to org.chipsalliance.rvdecoderdb can break org.chipsalliance.rocketv, while a change to org.chipsalliance.rocketv can't break org.chipsalliance.rvdecoderdb.
Position
Below the diagonal: org.chipsalliance.rocketv uses a module listed above it, which is the healthy direction.
org.chipsalliance.rocketv uses org.chipsalliance.t1.elaborator.rocketv, so a change to org.chipsalliance.t1.elaborator.rocketv can break org.chipsalliance.rocketv, while a change to org.chipsalliance.rocketv can't break org.chipsalliance.t1.elaborator.rocketv.
Position
Below the diagonal: org.chipsalliance.rocketv uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in org.chipsalliance.rocketv uses a type in (global).
The types involved
org.chipsalliance.rocketv.Rocket → CSR
Direction
org.chipsalliance.rocketv uses (global), so a change to (global) can break org.chipsalliance.rocketv, while a change to org.chipsalliance.rocketv can't break (global).
Position
Below the diagonal: org.chipsalliance.rocketv uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl.decoder.attribute uses org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType, so a change to org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType can break org.chipsalliance.t1.rtl.decoder.attribute, while a change to org.chipsalliance.t1.rtl.decoder.attribute can't break org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType.
Position
Below the diagonal: org.chipsalliance.t1.rtl.decoder.attribute uses a module listed above it, which is the healthy direction.
23→29 org.chipsalliance.t1.rtl.decoder.attribute uses org.chipsalliance.t1.rtl.decoderpart of a loop✕
Connections
72 pairs of types, where a type in org.chipsalliance.t1.rtl.decoder.attribute uses a type in org.chipsalliance.t1.rtl.decoder. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
org.chipsalliance.t1.rtl.decoder.attribute uses org.chipsalliance.t1.rtl.decoder, so a change to org.chipsalliance.t1.rtl.decoder can break org.chipsalliance.t1.rtl.decoder.attribute, while a change to org.chipsalliance.t1.rtl.decoder.attribute can't break org.chipsalliance.t1.rtl.decoder.
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.
pokedex.difftest.pokedex uses pokedex.difftest.replay, so a change to pokedex.difftest.replay can break pokedex.difftest.pokedex, while a change to pokedex.difftest.pokedex can't break pokedex.difftest.replay.
Position
Below the diagonal: pokedex.difftest.pokedex uses a module listed above it, which is the healthy direction.
pokedex.difftest.pokedex uses pokedex.difftest, so a change to pokedex.difftest can break pokedex.difftest.pokedex, while a change to pokedex.difftest.pokedex can't break pokedex.difftest.
Position
Below the diagonal: pokedex.difftest.pokedex uses a module listed above it, which is the healthy direction.
pokedex.model uses pokedex.model.ffi, so a change to pokedex.model.ffi can break pokedex.model, while a change to pokedex.model can't break pokedex.model.ffi.
Position
Below the diagonal: pokedex.model uses a module listed above it, which is the healthy direction.
spike_rs.runner uses spike_rs.spike_event, so a change to spike_rs.spike_event can break spike_rs.runner, while a change to spike_rs.runner can't break spike_rs.spike_event.
Position
Below the diagonal: spike_rs.runner uses a module listed above it, which is the healthy direction.
dpi_t1emu.drive uses spike_rs.spike_event, so a change to spike_rs.spike_event can break dpi_t1emu.drive, while a change to dpi_t1emu.drive can't break spike_rs.spike_event.
Position
Below the diagonal: dpi_t1emu.drive uses a module listed above it, which is the healthy direction.
dpi_t1emu.drive uses spike_rs.runner, so a change to spike_rs.runner can break dpi_t1emu.drive, while a change to dpi_t1emu.drive can't break spike_rs.runner.
Position
Below the diagonal: dpi_t1emu.drive uses a module listed above it, which is the healthy direction.
org.chipsalliance.rocketv.HellaCache uses org.chipsalliance.amba.axi4.bundle, so a change to org.chipsalliance.amba.axi4.bundle can break org.chipsalliance.rocketv.HellaCache, while a change to org.chipsalliance.rocketv.HellaCache can't break org.chipsalliance.amba.axi4.bundle.
Position
Below the diagonal: org.chipsalliance.rocketv.HellaCache uses a module listed above it, which is the healthy direction.
org.chipsalliance.rocketv.HellaCache uses org.chipsalliance.dwbb.stdlib.queue, so a change to org.chipsalliance.dwbb.stdlib.queue can break org.chipsalliance.rocketv.HellaCache, while a change to org.chipsalliance.rocketv.HellaCache can't break org.chipsalliance.dwbb.stdlib.queue.
Position
Below the diagonal: org.chipsalliance.rocketv.HellaCache uses a module listed above it, which is the healthy direction.
org.chipsalliance.rocketv.HellaCache uses org.chipsalliance.rocketv, so a change to org.chipsalliance.rocketv can break org.chipsalliance.rocketv.HellaCache, while a change to org.chipsalliance.rocketv.HellaCache can't break org.chipsalliance.rocketv.
Position
Below the diagonal: org.chipsalliance.rocketv.HellaCache uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl.decoder uses org.chipsalliance.rvdecoderdb, so a change to org.chipsalliance.rvdecoderdb can break org.chipsalliance.t1.rtl.decoder, while a change to org.chipsalliance.t1.rtl.decoder can't break org.chipsalliance.rvdecoderdb.
Position
Below the diagonal: org.chipsalliance.t1.rtl.decoder uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl.decoder uses org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType, so a change to org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType can break org.chipsalliance.t1.rtl.decoder, while a change to org.chipsalliance.t1.rtl.decoder can't break org.chipsalliance.t1.rtl.decoder.attribute.FpExecutionType.
Position
Below the diagonal: org.chipsalliance.t1.rtl.decoder uses a module listed above it, which is the healthy direction.
63 pairs of types, where a type in org.chipsalliance.t1.rtl.decoder uses a type in org.chipsalliance.t1.rtl.decoder.attribute. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
org.chipsalliance.t1.rtl.decoder uses org.chipsalliance.t1.rtl.decoder.attribute, so a change to org.chipsalliance.t1.rtl.decoder.attribute can break org.chipsalliance.t1.rtl.decoder, while a change to org.chipsalliance.t1.rtl.decoder can't break org.chipsalliance.t1.rtl.decoder.attribute.
Position
Below the diagonal: org.chipsalliance.t1.rtl.decoder uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl.decoder.TableGenerator uses org.chipsalliance.t1.rtl.decoder.attribute, so a change to org.chipsalliance.t1.rtl.decoder.attribute can break org.chipsalliance.t1.rtl.decoder.TableGenerator, while a change to org.chipsalliance.t1.rtl.decoder.TableGenerator can't break org.chipsalliance.t1.rtl.decoder.attribute.
Position
Below the diagonal: org.chipsalliance.t1.rtl.decoder.TableGenerator uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl.lane uses org.chipsalliance.amba.axi4.bundle, so a change to org.chipsalliance.amba.axi4.bundle can break org.chipsalliance.t1.rtl.lane, while a change to org.chipsalliance.t1.rtl.lane can't break org.chipsalliance.amba.axi4.bundle.
Position
Below the diagonal: org.chipsalliance.t1.rtl.lane uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl.lane uses org.chipsalliance.dwbb.stdlib.queue, so a change to org.chipsalliance.dwbb.stdlib.queue can break org.chipsalliance.t1.rtl.lane, while a change to org.chipsalliance.t1.rtl.lane can't break org.chipsalliance.dwbb.stdlib.queue.
Position
Below the diagonal: org.chipsalliance.t1.rtl.lane uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl.lane uses org.chipsalliance.rocketv, so a change to org.chipsalliance.rocketv can break org.chipsalliance.t1.rtl.lane, while a change to org.chipsalliance.t1.rtl.lane can't break org.chipsalliance.rocketv.
Position
Below the diagonal: org.chipsalliance.t1.rtl.lane uses a module listed above it, which is the healthy direction.
31→35 org.chipsalliance.t1.rtl.lane uses org.chipsalliance.t1.rtlpart of a loop✕
Connections
20 pairs of types, where a type in org.chipsalliance.t1.rtl.lane uses a type in org.chipsalliance.t1.rtl.
org.chipsalliance.t1.rtl.lane uses org.chipsalliance.t1.rtl, so a change to org.chipsalliance.t1.rtl can break org.chipsalliance.t1.rtl.lane, while a change to org.chipsalliance.t1.rtl.lane can't break org.chipsalliance.t1.rtl.
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.
org.chipsalliance.t1.rtl.lsu uses org.chipsalliance.amba.axi4.bundle, so a change to org.chipsalliance.amba.axi4.bundle can break org.chipsalliance.t1.rtl.lsu, while a change to org.chipsalliance.t1.rtl.lsu can't break org.chipsalliance.amba.axi4.bundle.
Position
Below the diagonal: org.chipsalliance.t1.rtl.lsu uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl.lsu uses org.chipsalliance.dwbb.stdlib.queue, so a change to org.chipsalliance.dwbb.stdlib.queue can break org.chipsalliance.t1.rtl.lsu, while a change to org.chipsalliance.t1.rtl.lsu can't break org.chipsalliance.dwbb.stdlib.queue.
Position
Below the diagonal: org.chipsalliance.t1.rtl.lsu uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl.lsu uses org.chipsalliance.rocketv, so a change to org.chipsalliance.rocketv can break org.chipsalliance.t1.rtl.lsu, while a change to org.chipsalliance.t1.rtl.lsu can't break org.chipsalliance.rocketv.
Position
Below the diagonal: org.chipsalliance.t1.rtl.lsu uses a module listed above it, which is the healthy direction.
32→35 org.chipsalliance.t1.rtl.lsu uses org.chipsalliance.t1.rtlpart of a loop✕
Connections
14 pairs of types, where a type in org.chipsalliance.t1.rtl.lsu uses a type in org.chipsalliance.t1.rtl.
org.chipsalliance.t1.rtl.lsu uses org.chipsalliance.t1.rtl, so a change to org.chipsalliance.t1.rtl can break org.chipsalliance.t1.rtl.lsu, while a change to org.chipsalliance.t1.rtl.lsu can't break org.chipsalliance.t1.rtl.
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.
pokedex.pokedex.simulator uses pokedex.bus, so a change to pokedex.bus can break pokedex.pokedex.simulator, while a change to pokedex.pokedex.simulator can't break pokedex.bus.
Position
Below the diagonal: pokedex.pokedex.simulator uses a module listed above it, which is the healthy direction.
pokedex.pokedex.simulator uses pokedex.model.ffi, so a change to pokedex.model.ffi can break pokedex.pokedex.simulator, while a change to pokedex.pokedex.simulator can't break pokedex.model.ffi.
Position
Below the diagonal: pokedex.pokedex.simulator uses a module listed above it, which is the healthy direction.
pokedex.pokedex.simulator uses pokedex.model, so a change to pokedex.model can break pokedex.pokedex.simulator, while a change to pokedex.pokedex.simulator can't break pokedex.model.
Position
Below the diagonal: pokedex.pokedex.simulator uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl.Lane uses org.chipsalliance.t1.rtl.lane, so a change to org.chipsalliance.t1.rtl.lane can break org.chipsalliance.t1.rtl.Lane, while a change to org.chipsalliance.t1.rtl.Lane can't break org.chipsalliance.t1.rtl.lane.
Position
Below the diagonal: org.chipsalliance.t1.rtl.Lane uses a module listed above it, which is the healthy direction.
34→35 org.chipsalliance.t1.rtl.Lane uses org.chipsalliance.t1.rtlpart of a loop✕
Connections
2 pairs of types, where a type in org.chipsalliance.t1.rtl.Lane uses a type in org.chipsalliance.t1.rtl.
org.chipsalliance.t1.rtl.Lane uses org.chipsalliance.t1.rtl, so a change to org.chipsalliance.t1.rtl can break org.chipsalliance.t1.rtl.Lane, while a change to org.chipsalliance.t1.rtl.Lane can't break org.chipsalliance.t1.rtl.
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.
org.chipsalliance.t1.rtl uses org.chipsalliance.amba.axi4.bundle, so a change to org.chipsalliance.amba.axi4.bundle can break org.chipsalliance.t1.rtl, while a change to org.chipsalliance.t1.rtl can't break org.chipsalliance.amba.axi4.bundle.
Position
Below the diagonal: org.chipsalliance.t1.rtl uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl uses org.chipsalliance.dwbb.interface.DW01_absval, so a change to org.chipsalliance.dwbb.interface.DW01_absval can break org.chipsalliance.t1.rtl, while a change to org.chipsalliance.t1.rtl can't break org.chipsalliance.dwbb.interface.DW01_absval.
Position
Below the diagonal: org.chipsalliance.t1.rtl uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl uses org.chipsalliance.dwbb.stdlib.queue, so a change to org.chipsalliance.dwbb.stdlib.queue can break org.chipsalliance.t1.rtl, while a change to org.chipsalliance.t1.rtl can't break org.chipsalliance.dwbb.stdlib.queue.
Position
Below the diagonal: org.chipsalliance.t1.rtl uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl uses org.chipsalliance.rocketv, so a change to org.chipsalliance.rocketv can break org.chipsalliance.t1.rtl, while a change to org.chipsalliance.t1.rtl can't break org.chipsalliance.rocketv.
Position
Below the diagonal: org.chipsalliance.t1.rtl uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl uses org.chipsalliance.t1.rtl.decoder, so a change to org.chipsalliance.t1.rtl.decoder can break org.chipsalliance.t1.rtl, while a change to org.chipsalliance.t1.rtl can't break org.chipsalliance.t1.rtl.decoder.
Position
Below the diagonal: org.chipsalliance.t1.rtl uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl uses org.chipsalliance.t1.rtl.lane, so a change to org.chipsalliance.t1.rtl.lane can break org.chipsalliance.t1.rtl, while a change to org.chipsalliance.t1.rtl can't break org.chipsalliance.t1.rtl.lane.
Position
Below the diagonal: org.chipsalliance.t1.rtl uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl uses org.chipsalliance.t1.rtl.lsu, so a change to org.chipsalliance.t1.rtl.lsu can break org.chipsalliance.t1.rtl, while a change to org.chipsalliance.t1.rtl can't break org.chipsalliance.t1.rtl.lsu.
Position
Below the diagonal: org.chipsalliance.t1.rtl uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.rtl uses org.chipsalliance.t1.rtl.Lane, so a change to org.chipsalliance.t1.rtl.Lane can break org.chipsalliance.t1.rtl, while a change to org.chipsalliance.t1.rtl can't break org.chipsalliance.t1.rtl.Lane.
Position
Below the diagonal: org.chipsalliance.t1.rtl uses a module listed above it, which is the healthy direction.
35→36 org.chipsalliance.t1.rtl uses org.chipsalliance.t1.rtl.vrfpart of a loop✕
Connections
2 pairs of types, where a type in org.chipsalliance.t1.rtl uses a type in org.chipsalliance.t1.rtl.vrf.
org.chipsalliance.t1.rtl uses org.chipsalliance.t1.rtl.vrf, so a change to org.chipsalliance.t1.rtl.vrf can break org.chipsalliance.t1.rtl, while a change to org.chipsalliance.t1.rtl can't break org.chipsalliance.t1.rtl.vrf.
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.
org.chipsalliance.t1.rtl.vrf uses org.chipsalliance.t1.rtl, so a change to org.chipsalliance.t1.rtl can break org.chipsalliance.t1.rtl.vrf, while a change to org.chipsalliance.t1.rtl.vrf can't break org.chipsalliance.t1.rtl.
Position
Below the diagonal: org.chipsalliance.t1.rtl.vrf uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.t1emu uses org.chipsalliance.t1.rtl, so a change to org.chipsalliance.t1.rtl can break org.chipsalliance.t1.t1emu, while a change to org.chipsalliance.t1.t1emu can't break org.chipsalliance.t1.rtl.
Position
Below the diagonal: org.chipsalliance.t1.t1emu uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.tile uses org.chipsalliance.amba.axi4.bundle, so a change to org.chipsalliance.amba.axi4.bundle can break org.chipsalliance.t1.tile, while a change to org.chipsalliance.t1.tile can't break org.chipsalliance.amba.axi4.bundle.
Position
Below the diagonal: org.chipsalliance.t1.tile uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.tile uses org.chipsalliance.t1.elaborator.rocketv, so a change to org.chipsalliance.t1.elaborator.rocketv can break org.chipsalliance.t1.tile, while a change to org.chipsalliance.t1.tile can't break org.chipsalliance.t1.elaborator.rocketv.
Position
Below the diagonal: org.chipsalliance.t1.tile uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.tile uses org.chipsalliance.rocketv, so a change to org.chipsalliance.rocketv can break org.chipsalliance.t1.tile, while a change to org.chipsalliance.t1.tile can't break org.chipsalliance.rocketv.
Position
Below the diagonal: org.chipsalliance.t1.tile uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.tile uses org.chipsalliance.t1.rtl, so a change to org.chipsalliance.t1.rtl can break org.chipsalliance.t1.tile, while a change to org.chipsalliance.t1.tile can't break org.chipsalliance.t1.rtl.
Position
Below the diagonal: org.chipsalliance.t1.tile uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.tile uses org.chipsalliance.t1.rtl.vrf, so a change to org.chipsalliance.t1.rtl.vrf can break org.chipsalliance.t1.tile, while a change to org.chipsalliance.t1.tile can't break org.chipsalliance.t1.rtl.vrf.
Position
Below the diagonal: org.chipsalliance.t1.tile uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.elaborator.t1rocketv.T1RocketTile uses org.chipsalliance.t1.rtl.vrf, so a change to org.chipsalliance.t1.rtl.vrf can break org.chipsalliance.t1.elaborator.t1rocketv.T1RocketTile, while a change to org.chipsalliance.t1.elaborator.t1rocketv.T1RocketTile can't break org.chipsalliance.t1.rtl.vrf.
Position
Below the diagonal: org.chipsalliance.t1.elaborator.t1rocketv.T1RocketTile uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.elaborator.t1rocketv.T1RocketTile uses org.chipsalliance.t1.tile, so a change to org.chipsalliance.t1.tile can break org.chipsalliance.t1.elaborator.t1rocketv.T1RocketTile, while a change to org.chipsalliance.t1.elaborator.t1rocketv.T1RocketTile can't break org.chipsalliance.t1.tile.
Position
Below the diagonal: org.chipsalliance.t1.elaborator.t1rocketv.T1RocketTile uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.t1rocketemu uses org.chipsalliance.rocketv, so a change to org.chipsalliance.rocketv can break org.chipsalliance.t1.t1rocketemu, while a change to org.chipsalliance.t1.t1rocketemu can't break org.chipsalliance.rocketv.
Position
Below the diagonal: org.chipsalliance.t1.t1rocketemu uses a module listed above it, which is the healthy direction.
org.chipsalliance.t1.t1rocketemu uses org.chipsalliance.t1.tile, so a change to org.chipsalliance.t1.tile can break org.chipsalliance.t1.t1rocketemu, while a change to org.chipsalliance.t1.t1rocketemu can't break org.chipsalliance.t1.tile.
Position
Below the diagonal: org.chipsalliance.t1.t1rocketemu uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 55% · Adequate · gated by X4, X5 ·
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
21
High / Critical
A03:2025 — Software Supply Chain Failures
16
Medium
A07:2025 — Authentication Failures
2
High / Critical
Roadmap
Top priorities: Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED; Keep implementation types off the public surface (Rust: `pub(crate)`, or keep the module private) so internals can change without breaking consumers; Resolve the 1 No ADRs found finding(s) in ADR Quality.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED.
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 — 21
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 — 468
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 — 341
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 18
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
This survey 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. All 59 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.
Every figure here is one of two 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. 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.
What we checked — 59 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, 802 of 830 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 or a scanner, 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 — We 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 (.py, .scala) 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 (`coverage run -m pytest` then `coverage xml`, or `addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) 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 (`coverage run -m pytest` then `coverage xml`, or `addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) 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 — We 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 (.py, .scala) and this repository declares an sbt build (dependencies/berkeley-hardfloat, 16 test files), but it was not re-run: the analyzer environment could not run it. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we 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.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D21 Naming Consistency — not measured this run — We 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 — We 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 — We 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.
D26 Project Cohesion — not measured this run — We 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. Project size and spread are measured over build units (a .NET project, a Maven or Gradle module, an npm, Deno or JSR package, a Go module, a Cargo crate, a Python, Composer, Bundler, RubyGems, Mix, rebar3, sbt, SwiftPM or pub package, an OTP application, an Xcode project or XcodeGen spec, or a checkout that declares no build at all) whose source a code model reads. This repository's production source is in a language no model reads, or in units whose build tool D26 does not recognise. That is a gap in this analyzer's language reach — not a finding that the repository's projects are cohesive.
D27 Navigability — not measured this run — We 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.
D32 Data Compliance (PII/GDPR) — not measured this run — We 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. `omreader/src/OMReader.scala`, `omreader/src/t1/T1.scala`, `omreader/src/t1rocketv/T1RocketTile.scala`, `script/ci/src/Main.scala`, `script/emu/src/Main.scala`, … (+3 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
D44 Platform End-of-Life — not measured this run — We 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.
AXB1 Runtime evidence locked — no reproducible boot — not measured this run — We 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. Subject: 1 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
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.
S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X4 Structured logging — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. 69 further occurrence(s) are not listed individually; the score already reflects all 109.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do 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 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality 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 checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
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.
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.
19 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was uop.genTable at 80. A further 7 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being InstructionDocumentation.toString at 447 — they are counted neither in the figure above nor in this dimension's score. 4 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: t1/src/decoder/InstructionDocumentation.scala (InstructionDocumentation.toString at 447), pokedex/simulator/src/pokedex/mod.rs (pokedex::pokedex::name_of_csr at 25), dependencies/rvdecoderdb/rvdecoderdb/src/parser/parse.scala (parse.apply at 21), rocketv/src/csr/V.scala (V.chiselType at 18). 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.
+ 12 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 4 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with uop.genTable (cyclomatic 80), CommonPrefixSum.associativeOp (cyclomatic 73), latex_utils.make_ext_latex_table (cyclomatic 32). — 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 Cyclomatic Complexity from 6.7 to about 7.8/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
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.
+ 17 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 4 bodies over 30 down to 30 or less in Cognitive Complexity — start with latex_utils.make_ext_latex_table (cognitive 88), CommonPrefixSum.associativeOp (cognitive 64), Queue.io (cognitive 41). — 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 6.2 to about 7.4/10, projected with the scoring formula itself and assuming each lands exactly at 30; 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 Classes8.8 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 16 FileTooLong finding(s) in God Classes — start with CSR.scala, RocketCore.scala, HellaCache.scala. — One of this dimension's main actionable groups (16 warning-level).
Resolve the 9 ClassTooLong finding(s) in God Classes — start with RocketCore.scala, HellaCache.scala, Lane.scala. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 6 TooManyMethods finding(s) in God Classes — start with HellaCache.scala, RocketCore.scala, CSR.scala. — One of this dimension's main actionable groups (6 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.
97 duplicated block group(s) detected. A further 4 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 53 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 9 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with json_events.rs (2), PopCountAtLeast.scala, package.scala. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 7 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with json_events.rs (2), DPIModule.scala, SRT16.scala. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 7 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with RocketTile.scala, Frontend.scala, shared_utils.py. — One of this dimension's main actionable groups (7 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 · Coupling9.6 / 10Stronggated by 1 serious finding✓ 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.
18 production modules (Cargo+sbt+Mill), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; a dependsOn spread (deps: _*) and a project whose directory a helper computes are not visible there; a Mill module a helper method defines, a moduleDeps a function computes, and a module directory computed other than as a path over super.moduleDir are not visible there; 2 module(s) off the main sequence, with abstractness counted on 17 of the 18 (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).
Off the main sequence: spike_rs
Off the main sequence: dpi_common
What to do
Resolve the 1 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
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 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with PTW.scala. — One of this dimension's main actionable groups (1 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.
112 test methods: 112 unit, 0 integration, 0 BDD, 0 e2e. The Rust suite contributes 2 `#[test]` function(s) across 1 file(s) declaring at least one; its unit/integration split is Cargo's own — 0 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. The Python suite contributes 16 test function(s) across 1 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only. The Scala suite contributes 94 test case(s) across 15 file(s) in a test source set declaring at least one — every `test("…")`, `it("…")`, `property("…")` and `"…" in {…}` registration and every JUnit `@Test`, which is how munit, ScalaTest, utest, ZIO Test and specs2 declare a case; a case registered under a computed name is not counted, so this is a floor. Its tier split is INFERRED from paths and file names, except sbt's src/it source set, which the build declares.
What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
9 outdated, 0 yanked direct Cargo dependencies. 16 of 26 direct crates were graded against crates.io (0 not published there, 10 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: anyhow · ×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 94 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. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares package.json, and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
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 1 Hotspot finding(s) in Churn × Complexity Hotspots — start with VRF.scala. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor8.8 / 10Strong✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
30 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is t1/src/laneStage/MaskExchangeUnit.scala. Counted over 248 of the 761 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 · ×3
Further sole-owners (lower concentration)
What to do
Resolve the 3 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (3 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
289 deducted task-comment markers across 78064 LoC (0.4/KLoC) → score 9.3. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
TodoComment repeated across 14 filest1/src/Bundles.scala:867
What to do
Resolve the 259 TodoComment finding(s) in Explicit Debt — start with T1.scala (30), RocketCore.scala (22), simulator.rs (15). — One of this dimension's main actionable groups (259 warning-level).
Resolve the 13 FixmeComment finding(s) in Explicit Debt — start with mod.rs (2), run.rs (2), pokedex.rs (2). — One of this dimension's main actionable groups (13 warning-level).
Resolve the 1 TodoComment repeated across 14 files finding(s) in Explicit Debt — start with Bundles.scala. — 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.
0 of 1 documentation facets pass in full; short on: F2 example. 24 document(s) read across 3 unit(s).
Documentation: no build, run or usage exampledoc/en/README.md:1
What to do
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.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: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
1 finding(s): 0 critical, 1 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
21 finding(s): 0 critical, 20 high, 1 medium, 0 low. 12 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 5 file(s) — `script/ci/src/Main.scala`, `script/emu/src/Main.scala`, `t1zaozi/src/utils/Utils.scala`, `t1zaozi/src/vrf/VRF.scala`, `t1zaozi/src/zvma/ZVMA.scala` — so no absence of findings in them is evidence of anything, and nothing in them was analysed. 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 4 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
REDACTED
REDACTED
What to do
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED. — One of this dimension's main actionable groups (6 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
No action in Static Analysis (SAST) — all 12 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (12 issue-level, 0 of them charged here).
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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
Resolve the 3 Medium advisory (unsound) finding(s) in Dependency Vulnerabilities — start with REDACTED (3). — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 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.
248 of 248 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is rocketv/src/CSR.scala. Counted over 248 of the 761 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Orphaned file · ×245t1/src/T1.scala:1
Most significant orphaned file · ×3rocketv/src/CSR.scala:1
Dormant codebase
What to do
Resolve the 245 Orphaned file finding(s) in Knowledge Freshness — start with mod.rs (5), TestBench.scala (4), package.scala (3). — One of this dimension's main actionable groups (245 recommendation-level).
Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with CSR.scala, RocketCore.scala, HellaCache.scala. — One of this dimension's main actionable groups (3 recommendation-level).
Resolve the 1 Dormant codebase finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
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. Reported 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. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
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.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
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 · Code Health — Unreviewed-generation residue in this repository's Scala: methods whose whole body is still `???` or a "not implemented" throw where nothing overrides them, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Scala: methods whose body is `???` or only throws a "not implemented" error, methods that take inputs and return a constant or do nothing, dead `if (false)` branches, and skeleton classes most of whose methods are holes.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a README to the 10 of 13 project(s) that lack one — worth up to 1.5 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.
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.
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 & versioning2.0 / 10Critical✓ Tool-verified
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's code 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.
18/21 types (86%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
No explicit version was found for the Mill library declared by `build.mill`. This check read a literal `publishVersion` in the Mill build, or VcsVersion deriving it from git tags, and a CHANGELOG/CHANGES/HISTORY/NEWS/RELEASES file with a semver heading, or release tooling (changesets, release-please, semantic-release, goreleaser, cargo-release, bump2version, standard-version, git-cliff) in the library's directory or at the repository root, or a semver release tag (or a Drupal `8.x-1.2` release tag) in the repository. A version computed where none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes. — dependencies/arithmetic/build.mill
What to do
Keep implementation types off the public surface (Rust: `pub(crate)`, or keep the module private) so internals can change without breaking consumers.
Declare the version where the ecosystem expects it, or keep a CHANGELOG with semver release headings, and follow semver for breaking changes.
Do you agree with this assessment?
P2 · Observability6.7 / 10Adequate✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 9/10 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `dependencies/rvdecoderdb/sail-impl/boat/emulator`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Consider OpenTelemetry tracing/metrics (opentelemetry-java or Micrometer) and a health-check endpoint (Spring Boot Actuator's /actuator/health, or a /health route) 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.
No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 17616 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:3
`REDACTED` schedules updates, but no `package-ecosystem` entry covers `github-actions`, `npm`, `cargo`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the `updates:` list. — REDACTED:2
What to do
Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Dependabot is configured but does not watch `github-actions`, `npm`, `cargo` — add those `package-ecosystem` entries to .github/dependabot.yml so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. 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 `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. 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 type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. 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 an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `NullPointerException` (Java, Kotlin, Scala), `ArgumentError.notNull` (Dart) or `ArgumentNullException` (F#'s `nullArg`) tells the caller a parameter was null when it provably was not.
Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). 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. Also whether a `finally` that gives the primitive back unconditionally can run in a state where the method does not hold it: after a timed wait whose result was discarded, after an acquire inside the `try` that can fail, after the body already released it, or never, because a `return` left between the acquire and the `try`.
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. Whether a `for` comprehension or `foreach` leaves the mutable collection it is walking alone — an `ArrayBuffer` or `ListBuffer` counts its changes and its iterator checks the count, an `ArrayDeque` (and `mutable.Queue`/`mutable.Stack`) is walked by index up to its starting length, and a `java.util` collection walked through `asScala` is fail-fast, so a body that adds to or removes from the very collection the loop is walking makes a later step throw `ConcurrentModificationException` (`IndexOutOfBoundsException` for a deque) and the remaining elements 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 422 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — pokedex/model/scripts/riscv_opcodes_util.py:422
`debug` at line 466 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — pokedex/model/scripts/riscv_opcodes_util.py:466
`debug` at line 480 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — pokedex/model/scripts/riscv_opcodes_util.py:480
`debug` at line 497 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — pokedex/model/scripts/riscv_opcodes_util.py:497
`debug` at line 616 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — pokedex/model/scripts/riscv_opcodes_util.py:616
`debug` at line 622 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — pokedex/model/scripts/riscv_opcodes_util.py:622
`debug` at line 636 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — pokedex/model/scripts/riscv_opcodes_util.py:636
`error` at line 356 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — dependencies/riscv-opcodes/latex_utils.py:356
`error` at line 366 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — dependencies/riscv-opcodes/latex_utils.py:366
`debug` at line 413 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — dependencies/riscv-opcodes/shared_utils.py:413
`debug` at line 457 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — dependencies/riscv-opcodes/shared_utils.py:457
`debug` at line 471 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — dependencies/riscv-opcodes/shared_utils.py:471
`debug` at line 488 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — dependencies/riscv-opcodes/shared_utils.py:488
`debug` at line 589 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — dependencies/riscv-opcodes/shared_utils.py:589
`debug` at line 595 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — dependencies/riscv-opcodes/shared_utils.py:595
`debug` at line 609 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — dependencies/riscv-opcodes/shared_utils.py:609
`info!` at line 90 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`. — pokedex/simulator/src/pokedex/mod.rs:90
`info!` at line 103 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`. — pokedex/simulator/src/pokedex/mod.rs:103
`error!` at line 105 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: `error!(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`. — pokedex/simulator/src/pokedex/mod.rs:105
`info!` at line 123 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`. — pokedex/simulator/src/pokedex/mod.rs:123
`info!` at line 155 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`. — pokedex/simulator/src/model/ffi.rs:155
`debug!` at line 103 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`. — pokedex/simulator/src/model/mod.rs:103
`error!` at line 132 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: `error!(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`. — pokedex/simulator/src/model/mod.rs:132
`info!` at line 55 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`. — pokedex/simulator/src/gdb/mod.rs:55
`info!` at line 58 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`. — pokedex/simulator/src/gdb/mod.rs:58
`error!` at line 48 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: `error!(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`. — pokedex/simulator/src/gdb/run.rs:48
`debug!` at line 104 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`. — pokedex/simulator/src/gdb/run.rs:104
`debug!` at line 294 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`. — pokedex/simulator/src/bus/mod.rs:294
`debug!` at line 308 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`. — pokedex/simulator/src/bus/mod.rs:308
`info!` at line 203 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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:203
`info!` at line 219 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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:219
`info!` at line 246 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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:246
`info!` at line 270 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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:270
`info!` at line 286 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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:286
`info!` at line 313 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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:313
`info!` at line 339 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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:339
`info!` at line 359 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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:359
`info!` at line 383 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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:383
`error!` at line 442 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: `error!(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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:442
`error!` at line 451 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: `error!(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`. — difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:451
Other · Code Health — Whether Scala's null is held to the type system and not undermined by assertions — a file compiled with `-Yexplicit-nulls` is one where `String` excludes null and `String | Null` admits it, a file under WartRemover's `Null` wart or Scalafix's `DisableSyntax.noNulls` is one whose code cannot write `null` and must say `Option`, and each `.nn`, `import scala.language.unsafeNulls` or null-lint suppression is the author overruling that.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
No build over this repository's 686 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.
What to do
On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Capped at Fair by a Critical contributor — resolve it before relying on this lens.
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 — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 6 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
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
P6 Release Hygiene — not evidenced — no changelog, version stamp or semver release tag in the repo
Not included — 53 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — Frontend below the scale floor (1 DOM element(s) < 25) — too little surface to assess accessibility.
AC2 Forms & labels — Frontend below the scale floor (1 DOM element(s) < 25) — too little surface to assess accessibility.
AC3 Page structure — Frontend below the scale floor (1 DOM element(s) < 25) — too little surface to assess accessibility.
AC4 Keyboard semantics — Frontend below the scale floor (1 DOM element(s) < 25) — too little surface to assess accessibility.
AC5 ARIA correctness — Frontend below the scale floor (1 DOM element(s) < 25) — too little surface to assess accessibility.
AC6 Visual & motion safety — Frontend below the scale floor (1 DOM element(s) < 25) — too little surface to assess accessibility.
AC7 A11y enforcement — Frontend below the scale floor (1 DOM element(s) < 25) — too little surface to assess accessibility.
AX1 Captive dependencies — Not applicable: this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; 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; this repository's Scala imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
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. No class in this Scala code is a Play controller, a Cask routes object, a Scalatra servlet, a Finatra controller, an Akka/Pekko HTTP routes holder or a JSR-330/Spring singleton, so no instance 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
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~2872 lines of test source are present (.py, .scala) 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 .scala 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# and TypeScript only; Python, Rust, Scala 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+ sibling projects each declaring an entity of their own or taking another project's integration events. 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#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .py, .rs, .scala, 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
D26 Project Cohesion — D26 measured no build unit over this repository's .c, .cc, .scala, .sv source. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.scala), 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) — 8 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
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 (1 of 2 signals for this style — below the bar we score at): 375 value object(s)
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
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
M4 Documentation accuracy — Not applicable: the 24 current-state document(s) make no claim of a kind M4 checks. 20 claim(s) of kinds M4 does not check were not checked (path 8, command argument 2, environment variable 8, cd 2); M4 checks only links and versions and artefact counts.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM, 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 (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) 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 `@Benchmark` in a Java, Kotlin or Scala file importing JMH or kotlinx-benchmark, Jetpack Benchmark's `measureRepeated` in a file importing androidx.benchmark, or JMH/kotlinx-benchmark/androidx.benchmark in a pom.xml, Gradle or sbt build, 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: allocation awareness is rated where code engineers for it — at least 400 production lines that ship benchmarks or already use allocation-aware idioms (8 or more). This repository's Scala code has 73,031 production line(s), 0 such use(s) and no benchmarks, so there is no allocation work to rate. The card is reward-only: its absence costs nothing.
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 — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X2 Cancellation propagation — no C# was loaded; this repository's Scala, Python and Rust were read, and no request in it can be cancelled by a caller — a Scala request takes no token: a Future cannot be cancelled, and cats-effect, ZIO and Monix interrupt the fiber that made the request from outside the call, not through a parameter; 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
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.
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.
TodoComment t1zaozi/src/zvma/ZVMAProcessingElement.scala:103— // TODO: Temporarily there is int8 — 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 t1zaozi/src/vrf/ChainingCheck.scala:48— // todo: def — 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 t1zaozi/src/vrf/VRF.scala:115— // todo: 4 bit for ecc — 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 t1/src/vrf/VRF.scala:102— // todo: 4 bit for ecc — 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 t1zaozi/src/vrf/VRF.scala:356— // TODO: add Chaining Check Probe — 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 t1zaozi/src/vrf/VRF.scala:661— // 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 t1rocketemu/src/AXI4SlaveAgent.scala:6— // TODO: upstream to AMBA as VIP — 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 t1emu/src/AXI4SlaveAgent.scala:6— // TODO: upstream to AMBA as VIP — 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 t1rocketemu/src/TestBench.scala:142— // TODO: add payloadSize config to parameter — 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 t1rocketemu/src/TestBench.scala:143— // todo: align with parameter in the future — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment t1rocket/src/T1RocketTile.scala:82— // TODO: add S in the future — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment t1rocket/src/T1RocketTile.scala:91— // TODO: set to 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.
TodoComment t1rocket/src/T1RocketTile.scala:117— // TODO: remove it — 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 t1rocket/src/T1RocketTile.scala:127— // TODO: check decoder — 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 t1rocket/src/T1RocketTile.scala:433— // todo: Const — 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 t1rocket/src/T1RocketTile.scala:446— // TODO: buserror should be handled by NMI — 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 rocketv/src/RocketTile.scala:378— // TODO: buserror should be handled by NMI — 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 t1rocket/src/T1RocketTile.scala:467— // TODO: merge it. — 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 t1emu/src/AXI4SlaveAgent.scala:53— // TODO: consider adding the latency of the read transaction — 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 t1emu/src/AXI4SlaveAgent.scala:151— // TODO: add latency to the write transaction reply — 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 t1emu/src/TestBench.scala:103— // TODO: refactor driver to spawn 3 scoreboards for record different retirement. — 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 t1emu/src/TestBench.scala:128— // 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 dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs:121— // 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 t1/src/Bundles.scala:808— // vmacc 的vd需要跨lane读 TODO: move to [[V]] — 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 t1/src/FloatModule.scala:202— // todo timing issue — 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: src/CSR.scala rocketv/src/CSR.scala— FileTooLong — 1512 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: CSR (295-1931). The bar is 500 significant lines; this is 1012 over it, 3.02× 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/RocketCore.scala rocketv/src/RocketCore.scala— FileTooLong — 1358 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: Rocket (403-1780). The bar is 500 significant lines; this is 858 over it, 2.72× 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/HellaCache.scala rocketv/src/HellaCache.scala— FileTooLong — 1276 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: HellaCache (347-1734). The bar is 500 significant lines; this is 776 over it, 2.55× 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/Bundle.scala rocketv/src/Bundle.scala— FileTooLong — 1089 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 589 over it, 2.18× 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/RVDecoderDB.scala rocketv/src/RVDecoderDB.scala— FileTooLong — 928 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 428 over it, 1.86× 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/Lane.scala t1/src/Lane.scala— FileTooLong — 885 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: Lane (214-1448). The bar is 500 significant lines; this is 385 over it, 1.77× 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/T1.scala t1/src/T1.scala— FileTooLong — 883 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 383 over it, 1.77× 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: laneStage/MaskExchangeUnit.scala t1/src/laneStage/MaskExchangeUnit.scala— FileTooLong — 826 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: MaskExchangeUnit (92-1152). The bar is 500 significant lines; this is 326 over it, 1.65× 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: mask/MaskUnit.scala t1/src/mask/MaskUnit.scala— FileTooLong — 715 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: MaskUnit (111-1044). The bar is 500 significant lines; this is 215 over it, 1.43× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/PTW.scala rocketv/src/PTW.scala— FileTooLong — 647 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: PTW (188-942). The bar is 500 significant lines; this is 147 over it, 1.29× 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/Decoder.scala rocketv/src/Decoder.scala— FileTooLong — 578 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 78 over it, 1.16× 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/Bundles.scala t1/src/Bundles.scala— FileTooLong — 569 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 69 over it, 1.14× 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: scala/DivSqrtRecF64_mulAddZ31.scala dependencies/berkeley-hardfloat/hardfloat/src/main/scala/DivSqrtRecF64_mulAddZ31.scala— FileTooLong — 537 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: DivSqrtRecF64ToRaw_mulAddZ31 (50-694). The bar is 500 significant lines; this is 37 over it, 1.07× 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: lsu/SimpleAccessUnit.scala t1/src/lsu/SimpleAccessUnit.scala— FileTooLong — 517 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: SimpleAccessUnit (144-1107). The bar is 500 significant lines; this is 17 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: src/TLB.scala rocketv/src/TLB.scala— FileTooLong — 513 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: TLB (122-761). 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: src/Frontend.scala rocketv/src/Frontend.scala— FileTooLong — 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 over it, 1.01× 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.
FixmeComment pokedex/simulator/build.rs:7— // FIXME : generate_cstr makes generated code badly formatted, investigate it later — 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 pokedex/simulator/src/model/ffi.rs:136— // FIXME: it should be a direct CStr after bindgen generate_cstr issue fixed — 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 pokedex/simulator/src/gdb/mod.rs:80— // FIXME: currently all method prefixed to avoid name collision — 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 pokedex/simulator/src/gdb/mod.rs:126— // FIXME: report it back to gdb — 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 pokedex/simulator/src/gdb/run.rs:65— // FIXME: if the target enters infinite loop ... — 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 pokedex/simulator/src/gdb/run.rs:139— // FIXME: due to constaints of gdbstub, the VLEN is hardcoded — 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 pokedex/simulator/src/difftest/pokedex.rs:14— // FIXME: parse in stream — 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 REDACTED:105— // FIXME: parse in stream — 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 pokedex/simulator/src/difftest/pokedex.rs:115— // FIXME: error handling — 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 REDACTED:246— // FIXME: error handling — 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 pokedex/simulator/src/difftest/replay.rs:132— // FIXME: find a better way than hard-coding — 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 pokedex/simulator/src/difftest/replay.rs:206— // FIXME: find a better way than hard-coding — 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 difftest/dpi_t1rocketemu/src/interconnect.rs:349— // FIXME: impl Send in upstream MemorySystem — 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.
ClassTooLong: Rocket rocketv/src/RocketCore.scala:402— ClassTooLong — 1044 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 400 significant lines; this is 644 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: HellaCache rocketv/src/HellaCache.scala:346— ClassTooLong — 999 significant lines (blank, comment-only and punctuation-only lines excluded), 71 methods. The bar is 400 significant lines; this is 599 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: Lane t1/src/Lane.scala:213— ClassTooLong — 790 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 390 over it, 1.98× 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: MaskExchangeUnit t1/src/laneStage/MaskExchangeUnit.scala:91— ClassTooLong — 763 significant lines (blank, comment-only and punctuation-only lines excluded), 2 methods. The bar is 400 significant lines; this is 363 over it, 1.91× 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: MaskUnit t1/src/mask/MaskUnit.scala:110— ClassTooLong — 655 significant lines (blank, comment-only and punctuation-only lines excluded), 2 methods. The bar is 400 significant lines; this is 255 over it, 1.64× 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: PTW rocketv/src/PTW.scala:187— ClassTooLong — 532 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 132 over it, 1.33× 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: DivSqrtRecF64ToRaw_mulAddZ31 dependencies/berkeley-hardfloat/hardfloat/src/main/scala/DivSqrtRecF64_mulAddZ31.scala:50— ClassTooLong — 486 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 86 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: SimpleAccessUnit t1/src/lsu/SimpleAccessUnit.scala:143— ClassTooLong — 473 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 73 over it, 1.18× 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: TLB rocketv/src/TLB.scala:121— ClassTooLong — 438 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 38 over it, 1.10× 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 (5 lines × 2) rocketv/src/PopCountAtLeast.scala:12— rocketv/src/PopCountAtLeast.scala:12-16 | rocketv/src/TLB.scala:176-180 — before extracting anything, compare `rocketv/src/PopCountAtLeast.scala` and `rocketv/src/TLB.scala` as WHOLE FILES: 90% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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. Read the line range as the matched WINDOW rather than a finished unit: at `rocketv/src/PopCountAtLeast.scala:12` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) t1/src/package.scala:510— t1/src/package.scala:510-514 | t1/src/package.scala:521-525 — 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) t1/src/vfu/VectorAdder.scala:81— t1/src/vfu/VectorAdder.scala:81-85 | t1/src/vfu/VectorAdder64.scala:81-85 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/vfu/VectorAdder.scala:81` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) rocketv/src/CSR.scala:431— rocketv/src/CSR.scala:431-435 | rocketv/src/PTW.scala:238-242 — 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) t1/src/vfu/Abs32.scala:23— t1/src/vfu/Abs32.scala:23-27 | t1/src/vfu/Complement64.scala:25-29 — 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) dependencies/riscv-opcodes/shared_utils.py:66— dependencies/riscv-opcodes/shared_utils.py:66-70 | pokedex/model/scripts/riscv_opcodes_util.py:112-116 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `encoding` to `"list[str]"` in one and `list[str]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (5 lines × 2) difftest/t1-sim-checker/src/t1emu/json_events.rs:24— difftest/t1-sim-checker/src/t1emu/json_events.rs:24-28 | difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:33-37 — `difftest/t1-sim-checker/src/t1emu/json_events.rs` and `difftest/t1-sim-checker/src/t1rocketemu/json_events.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 9 separate duplicated blocks between them, totalling at least 96 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) difftest/t1-sim-checker/src/t1emu/json_events.rs:385— difftest/t1-sim-checker/src/t1emu/json_events.rs:385-389 | difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:575-579 — `difftest/t1-sim-checker/src/t1emu/json_events.rs` and `difftest/t1-sim-checker/src/t1rocketemu/json_events.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 9 separate duplicated blocks between them, totalling at least 96 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) profiler/src/input_hier.rs:534— profiler/src/input_hier.rs:534-538 | profiler/src/input_hier.rs:567-571 — 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) emuhelper/src/DPIModule.scala:68— emuhelper/src/DPIModule.scala:68-74 | emuhelper/src/DPIModuleLegacy.scala:80-86 — before extracting anything, compare `emuhelper/src/DPIModule.scala` and `emuhelper/src/DPIModuleLegacy.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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. Read the line range as the matched WINDOW rather than a finished unit: at `emuhelper/src/DPIModule.scala:68` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) dependencies/arithmetic/arithmetic/src/division/srt/srt16/SRT16.scala:94— dependencies/arithmetic/arithmetic/src/division/srt/srt16/SRT16.scala:94-100 | dependencies/arithmetic/arithmetic/src/division/srt/srt16/SRT16Split.scala:90-96 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) dependencies/arithmetic/arithmetic/src/division/srt/srt4/OTF.scala:67— dependencies/arithmetic/arithmetic/src/division/srt/srt4/OTF.scala:67-73 | dependencies/arithmetic/arithmetic/src/division/srt/srt8/OTF.scala:119-125 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `dependencies/arithmetic/arithmetic/src/division/srt/srt4/OTF.scala:67` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) dependencies/arithmetic/arithmetic/src/division/srt/srt4/QDS.scala:107— dependencies/arithmetic/arithmetic/src/division/srt/srt4/QDS.scala:107-113 | dependencies/arithmetic/arithmetic/src/division/srt/srt8/QDS.scala:130-136 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `dependencies/arithmetic/arithmetic/src/division/srt/srt4/QDS.scala:107` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) dependencies/riscv-opcodes/shared_utils.py:102— dependencies/riscv-opcodes/shared_utils.py:102-108 | pokedex/model/scripts/riscv_opcodes_util.py:148-154 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `encoding` to `"list[str]"` in one and `list[str]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (7 lines × 2) difftest/t1-sim-checker/src/t1emu/json_events.rs:305— difftest/t1-sim-checker/src/t1emu/json_events.rs:305-311 | difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:504-510 — `difftest/t1-sim-checker/src/t1emu/json_events.rs` and `difftest/t1-sim-checker/src/t1rocketemu/json_events.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 9 separate duplicated blocks between them, totalling at least 96 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) difftest/t1-sim-checker/src/t1emu/json_events.rs:33— difftest/t1-sim-checker/src/t1emu/json_events.rs:33-39 | difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:42-48 — `difftest/t1-sim-checker/src/t1emu/json_events.rs` and `difftest/t1-sim-checker/src/t1rocketemu/json_events.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 9 separate duplicated blocks between them, totalling at least 96 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 × 2) rocketv/src/RocketTile.scala:274— rocketv/src/RocketTile.scala:274-283 | t1rocket/src/T1RocketTile.scala:287-296 — before extracting anything, compare `rocketv/src/RocketTile.scala` and `t1rocket/src/T1RocketTile.scala` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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 (10 lines × 2) elaborator/src/rocketv/Frontend.scala:125— elaborator/src/rocketv/Frontend.scala:125-134 | elaborator/src/rocketv/PMAChecker.scala:63-72 — before extracting anything, compare `elaborator/src/rocketv/Frontend.scala` and `elaborator/src/rocketv/PMAChecker.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `elaborator/src/rocketv/Frontend.scala:125` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) dependencies/riscv-opcodes/shared_utils.py:43— dependencies/riscv-opcodes/shared_utils.py:43-52 | pokedex/model/scripts/riscv_opcodes_util.py:89-98 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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 (10 lines × 2) difftest/t1-sim-checker/src/t1emu/json_events.rs:211— difftest/t1-sim-checker/src/t1emu/json_events.rs:211-220 | difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:400-409 — `difftest/t1-sim-checker/src/t1emu/json_events.rs` and `difftest/t1-sim-checker/src/t1rocketemu/json_events.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 9 separate duplicated blocks between them, totalling at least 96 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 × 2) pokedex/simulator/src/bus/mod.rs:100— pokedex/simulator/src/bus/mod.rs:100-109 | pokedex/simulator/src/bus/mod.rs:115-124 — 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) pokedex/simulator/src/gdb/run.rs:159— pokedex/simulator/src/gdb/run.rs:159-168 | pokedex/simulator/src/gdb/run.rs:184-193 — 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) REDACTED:342— REDACTED:342-351 | REDACTED:355-364 — 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.
TooManyMethods: HellaCache rocketv/src/HellaCache.scala:346— TooManyMethods — 71 methods. The bar is 30 methods; this is 41 over it, 2.37× 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: Rocket rocketv/src/RocketCore.scala:402— TooManyMethods — 54 methods. The bar is 30 methods; this is 24 over it, 1.80× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CSR rocketv/src/CSR.scala:294— TooManyMethods — 51 methods. The bar is 30 methods; this is 21 over it, 1.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: SpikeEvent difftest/spike_rs/src/spike_event.rs:62— TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× 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: TLB rocketv/src/TLB.scala:121— TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: TopUop t1/src/decoder/attribute/topUop.scala:42— TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× 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 (17 lines × 2) t1/src/laneStage/Distributor.scala:84— t1/src/laneStage/Distributor.scala:84-100 | t1/src/laneStage/MaskExchangeUnit.scala:637-653 — 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 (17 lines × 2) t1/src/decoder/attribute/isDivider.scala:18— t1/src/decoder/attribute/isDivider.scala:18-34 | t1/src/decoder/attribute/isNarrow.scala:18-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 (17 lines × 2) dependencies/riscv-opcodes/shared_utils.py:461— dependencies/riscv-opcodes/shared_utils.py:461-477 | pokedex/model/scripts/riscv_opcodes_util.py:470-486 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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 (17 lines × 2) dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs:71— dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs:71-87 | difftest/spike_rs/src/util.rs:49-65 — before extracting anything, compare `dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs` and `difftest/spike_rs/src/util.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 (17 lines × 2) difftest/t1-sim-checker/src/t1emu/json_events.rs:169— difftest/t1-sim-checker/src/t1emu/json_events.rs:169-185 | difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:349-365 — `difftest/t1-sim-checker/src/t1emu/json_events.rs` and `difftest/t1-sim-checker/src/t1rocketemu/json_events.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 9 separate duplicated blocks between them, totalling at least 96 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 (17 lines × 2) difftest/t1-sim-checker/src/t1emu/json_events.rs:270— difftest/t1-sim-checker/src/t1emu/json_events.rs:270-286 | difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:466-482 — `difftest/t1-sim-checker/src/t1emu/json_events.rs` and `difftest/t1-sim-checker/src/t1rocketemu/json_events.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 9 separate duplicated blocks between them, totalling at least 96 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 (13 lines × 2) dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala:216— dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala:216-228 | dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala:231-243 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) rocketv/src/HellaCache.scala:1132— rocketv/src/HellaCache.scala:1132-1144 | rocketv/src/ICache.scala:358-370 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (13 lines × 2) t1/src/vfu/VectorAdder.scala:68— t1/src/vfu/VectorAdder.scala:68-80 | t1/src/vfu/VectorAdder64.scala:68-80 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/vfu/VectorAdder.scala:68` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) rocketv/src/RocketTile.scala:339— rocketv/src/RocketTile.scala:339-351 | t1rocket/src/T1RocketTile.scala:352-364 — before extracting anything, compare `rocketv/src/RocketTile.scala` and `t1rocket/src/T1RocketTile.scala` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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 (13 lines × 2) t1/src/decoder/attribute/maskPipeOpcode.scala:138— t1/src/decoder/attribute/maskPipeOpcode.scala:138-150 | t1/src/decoder/attribute/otherUop.scala:70-82 — 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.
pokedex::difftest::replay::pretty_print_diff (cyclomatic 22) pokedex/simulator/src/difftest/replay.rs:165— pokedex::difftest::replay::pretty_print_diff has cyclomatic complexity 22 (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.
pokedex::difftest::spike::parse_single_commit (cyclomatic 22) REDACTED:333— pokedex::difftest::spike::parse_single_commit 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.
pokedex::difftest::spike::tokenize_spike_log_line::str_to_token (cyclomatic 21) REDACTED:134— pokedex::difftest::spike::tokenize_spike_log_line::str_to_token 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.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×3
Duplicated block (9 lines × 2) dependencies/berkeley-hardfloat/hardfloat/src/main/scala/primitives.scala:92— dependencies/berkeley-hardfloat/hardfloat/src/main/scala/primitives.scala:92-100 | dependencies/berkeley-hardfloat/hardfloat/src/main/scala/primitives.scala:107-115 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (9 lines × 2) dependencies/riscv-opcodes/shared_utils.py:89— dependencies/riscv-opcodes/shared_utils.py:89-97 | pokedex/model/scripts/riscv_opcodes_util.py:135-143 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `encoding` to `"list[str]"` in one and `list[str]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (9 lines × 2) difftest/t1-sim-checker/src/t1emu/json_events.rs:345— difftest/t1-sim-checker/src/t1emu/json_events.rs:345-353 | difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:544-552 — `difftest/t1-sim-checker/src/t1emu/json_events.rs` and `difftest/t1-sim-checker/src/t1rocketemu/json_events.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 9 separate duplicated blocks between them, totalling at least 96 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) t1zaozi/src/vrf/ChainingCheck.scala:59— t1zaozi/src/vrf/ChainingCheck.scala:59-64 | t1zaozi/src/vrf/WriteCheck.scala:53-58 — 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) emuhelper/src/DPIModule.scala:17— emuhelper/src/DPIModule.scala:17-22 | emuhelper/src/DPIModuleLegacy.scala:21-26 — before extracting anything, compare `emuhelper/src/DPIModule.scala` and `emuhelper/src/DPIModuleLegacy.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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) rocketv/src/PopCountAtLeast.scala:20— rocketv/src/PopCountAtLeast.scala:20-25 | rocketv/src/TLB.scala:184-189 — before extracting anything, compare `rocketv/src/PopCountAtLeast.scala` and `rocketv/src/TLB.scala` as WHOLE FILES: 90% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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 (15 lines × 2) rocketv/src/RocketTile.scala:285— rocketv/src/RocketTile.scala:285-299 | t1rocket/src/T1RocketTile.scala:298-312 — before extracting anything, compare `rocketv/src/RocketTile.scala` and `t1rocket/src/T1RocketTile.scala` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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 (15 lines × 2) dependencies/riscv-opcodes/shared_utils.py:380— dependencies/riscv-opcodes/shared_utils.py:380-394 | pokedex/model/scripts/riscv_opcodes_util.py:387-401 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (15 lines × 2) difftest/t1-sim-checker/src/t1emu/mod.rs:35— difftest/t1-sim-checker/src/t1emu/mod.rs:35-49 | difftest/t1-sim-checker/src/t1rocketemu/mod.rs:35-49 — 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 (19 lines × 2) t1/src/decoder/attribute/isMasklogic.scala:18— t1/src/decoder/attribute/isMasklogic.scala:18-36 | t1/src/decoder/attribute/isUnorderwrite.scala:18-36 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (19 lines × 2) dependencies/riscv-opcodes/shared_utils.py:331— dependencies/riscv-opcodes/shared_utils.py:331-349 | pokedex/model/scripts/riscv_opcodes_util.py:338-356 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (19 lines × 2) difftest/t1-sim-checker/src/t1emu/json_events.rs:313— difftest/t1-sim-checker/src/t1emu/json_events.rs:313-331 | difftest/t1-sim-checker/src/t1rocketemu/json_events.rs:512-530 — `difftest/t1-sim-checker/src/t1emu/json_events.rs` and `difftest/t1-sim-checker/src/t1rocketemu/json_events.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 9 separate duplicated blocks between them, totalling at least 96 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.
pokedex::difftest::replay::pretty_print_diff (cognitive 30) pokedex/simulator/src/difftest/replay.rs:165— pokedex::difftest::replay::pretty_print_diff has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (22 pts), loops 4 (8 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
pokedex::difftest::spike::parse_single_commit (cognitive 29) REDACTED:333— pokedex::difftest::spike::parse_single_commit has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 12 (17 pts), if/else 5 (11 pts), loops 1 (nesting depth added 11). 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.
Driver::tick (cognitive 24) difftest/dpi_t1rocketemu/src/drive.rs:424— Driver::tick has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (6 pts), loops 3, boolean chains 2 (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.
Driver::issue_instruction (cognitive 23) difftest/dpi_t1emu/src/drive.rs:284— Driver::issue_instruction has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×2
Duplicated block (24 lines × 2) emuhelper/src/DPIModule.scala:77— emuhelper/src/DPIModule.scala:77-100 | emuhelper/src/DPIModuleLegacy.scala:89-112 — before extracting anything, compare `emuhelper/src/DPIModule.scala` and `emuhelper/src/DPIModuleLegacy.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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. Read the line range as the matched WINDOW rather than a finished unit: at `emuhelper/src/DPIModule.scala:77` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24 lines × 2) t1/src/decoder/attribute/adderUop.scala:69— t1/src/decoder/attribute/adderUop.scala:69-92 | t1/src/decoder/attribute/zeroUop.scala:20-43 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (6 lines × 3) rocketv/src/RocketCore.scala:141— rocketv/src/RocketCore.scala:141-146 | rocketv/src/RocketTile.scala:181-186 | t1rocket/src/T1RocketTile.scala:193-198 — 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 (6 lines × 3) dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs:71— dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs:71-76 | difftest/spike_rs/src/util.rs:21-26 | difftest/spike_rs/src/util.rs:49-54 — before extracting anything, compare `dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs` and `difftest/spike_rs/src/util.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 (9 lines × 7) rocketv/src/CSR.scala:147— rocketv/src/CSR.scala:147-155 | rocketv/src/Frontend.scala:84-92 | rocketv/src/HellaCache.scala:96-104 | rocketv/src/HellaCacheArbiter.scala:64-72 | rocketv/src/PTW.scala:79-87 | rocketv/src/RocketCore.scala:210-218 | rocketv/src/TLB.scala:54-62 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 7 call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rocketv/src/Frontend.scala:81` calls `log2Ceil` and `rocketv/src/HellaCache.scala:92` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 7) t1/src/decoder/attribute/adderUop.scala:93— t1/src/decoder/attribute/adderUop.scala:93-101 | t1/src/decoder/attribute/adderUop.scala:113-121 | t1/src/decoder/attribute/divUop.scala:27-35 | t1/src/decoder/attribute/divUop.scala:36-44 | t1/src/decoder/attribute/floatUop.scala:96-104 | t1/src/decoder/attribute/maskPipeOpcode.scala:159-167 | t1/src/decoder/attribute/otherUop.scala:61-69 — there are 7 copies across 5 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 (8 lines × 2) t1/src/vfu/Multiplier16.scala:26— t1/src/vfu/Multiplier16.scala:26-33 | t1/src/vfu/VectorMultiplier32Unsigned.scala:30-37 — 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) dependencies/riscv-opcodes/shared_utils.py:77— dependencies/riscv-opcodes/shared_utils.py:77-84 | pokedex/model/scripts/riscv_opcodes_util.py:123-130 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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 × 3) dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs:60— dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs:60-66 | difftest/spike_rs/src/util.rs:10-16 | difftest/spike_rs/src/util.rs:38-44 — before extracting anything, compare `dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs` and `difftest/spike_rs/src/util.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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 × 3) profiler/src/input_hier.rs:539— profiler/src/input_hier.rs:539-545 | profiler/src/input_hier.rs:571-577 | profiler/src/input_hier.rs:603-609 — 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 × 4) REDACTED:393— REDACTED:393-401 | REDACTED:417-425 | REDACTED:499-507 | REDACTED:560-569 — 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 (9 lines × 4) REDACTED:405— REDACTED:405-413 | REDACTED:429-437 | REDACTED:456-464 | REDACTED:473-481 — 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.
uop.genTable (cyclomatic 80) t1/src/decoder/Decoder.scala:273— uop.genTable has cyclomatic complexity 80 (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.
CommonPrefixSum.associativeOp (cyclomatic 73) dependencies/arithmetic/arithmetic/src/addition/prefixadder/common/CommonPrefixAdder.scala:11— CommonPrefixSum.associativeOp has cyclomatic complexity 73 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
latex_utils.make_ext_latex_table (cyclomatic 32) dependencies/riscv-opcodes/latex_utils.py:187— latex_utils.make_ext_latex_table has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rtl.calculateSegmentWriteMask (cyclomatic 31) t1/src/package.scala:108— rtl.calculateSegmentWriteMask has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
VFUInstantiateParameter.parse (cyclomatic 26) t1/src/VectorFunctionUnit.scala:91— VFUInstantiateParameter.parse has cyclomatic complexity 26 (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.
Queue.io (cyclomatic 25) stdlib/src/Queue.scala:34— Queue.io has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CpuState::write_csr (cyclomatic 23) pokedex/simulator/src/difftest/replay.rs:315— CpuState::write_csr 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.
DPIModule.generateComponent (cyclomatic 20) emuhelper/src/DPIModule.scala:58— DPIModule.generateComponent has cyclomatic complexity 20 (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.
DPIModuleLegacy.generateComponent (cyclomatic 20) emuhelper/src/DPIModuleLegacy.scala:70— DPIModuleLegacy.generateComponent has cyclomatic complexity 20 (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.
VRF.architecture (cyclomatic 19) t1zaozi/src/vrf/VRF.scala:310— VRF.architecture 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.
SailCodeGenerator.genSailEnc (cyclomatic 18) dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala:175— SailCodeGenerator.genSailEnc 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.
Main.run (cyclomatic 18) script/emu/src/Main.scala:208— Main.run has cyclomatic complexity 18 (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.
Driver::tick (cyclomatic 18) difftest/dpi_t1rocketemu/src/drive.rs:424— Driver::tick 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.
RocketDecodePattern.isVectorLSU (cyclomatic 17) rocketv/src/Decoder.scala:946— RocketDecodePattern.isVectorLSU has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: aluFn.genTable (cyclomatic 26) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
FType.classify (cyclomatic 16) rocketv/src/FPU.scala:466— FType.classify has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
chisel_utils.make_chisel (cyclomatic 16) dependencies/riscv-opcodes/chisel_utils.py:11— chisel_utils.make_chisel 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.
Hotspot: t1zaozi/src/vrf/VRF.scala t1zaozi/src/vrf/VRF.scala:310— t1zaozi/src/vrf/VRF.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in VRF.architecture at line 310. 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-01-31..2026-05-01, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-31 11:40:51 +08:00' --until='2026-05-01 11:40:51 +08:00' --full-history --no-merges -- t1zaozi/src/vrf/VRF.scala`: 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 repeated across 14 files t1/src/Bundles.scala:867— The identical TodoComment appears in 14 files (17 occurrences) — almost certainly one boilerplate line from a single migration or decision, not 17 independent debts. Fix the systemic cause once rather than file-by-file. Text: "// todo". Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)
latex_utils.make_ext_latex_table (cognitive 88) dependencies/riscv-opcodes/latex_utils.py:187— latex_utils.make_ext_latex_table has cognitive complexity 88 (threshold 15). Drivers by points: if/else 20 (57 pts), loops 10 (21 pts), ternaries 4 (10 pts) (nesting depth added 54). 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.
CommonPrefixSum.associativeOp (cognitive 64) dependencies/arithmetic/arithmetic/src/addition/prefixadder/common/CommonPrefixAdder.scala:11— CommonPrefixSum.associativeOp has cognitive complexity 64 (threshold 15). Drivers by points: boolean chains 63, match/switch 1. 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.
Queue.io (cognitive 41) stdlib/src/Queue.scala:34— Queue.io has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 10, match/switch 1 (2 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.
profiler::vcd_util::process_signal_map (cognitive 35) profiler/src/vcd_util.rs:17— profiler::vcd_util::process_signal_map has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 2 (4 pts), match/switch 1 (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.
rtl.calculateSegmentWriteMask (cognitive 30) t1/src/package.scala:108— rtl.calculateSegmentWriteMask has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 30. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
DPIModule.generateComponent (cognitive 29) emuhelper/src/DPIModule.scala:58— DPIModule.generateComponent has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 5 (8 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
DPIModuleLegacy.generateComponent (cognitive 29) emuhelper/src/DPIModuleLegacy.scala:70— DPIModuleLegacy.generateComponent has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 5 (8 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
uop.genTable (cognitive 29) t1/src/decoder/Decoder.scala:273— uop.genTable has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 10 (19 pts), if/else 10 (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.
chisel_utils.make_chisel (cognitive 23) dependencies/riscv-opcodes/chisel_utils.py:11— chisel_utils.make_chisel has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 8 (11 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Main.run (cognitive 22) script/emu/src/Main.scala:208— Main.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (22 pts) (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.
VRF.architecture (cognitive 21) t1zaozi/src/vrf/VRF.scala:310— VRF.architecture has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, match/switch 4. 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.
Writer._line (cognitive 19) pokedex/model/scripts/ninja_syntax.py:164— Writer._line has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
shared_utils.process_standard_instructions (cognitive 18) dependencies/riscv-opcodes/shared_utils.py:406— shared_utils.process_standard_instructions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 2 (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.
shared_utils.process_imported_instructions (cognitive 18) dependencies/riscv-opcodes/shared_utils.py:481— shared_utils.process_imported_instructions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
riscv_opcodes_util.process_standard_instructions (cognitive 18) pokedex/model/scripts/riscv_opcodes_util.py:415— riscv_opcodes_util.process_standard_instructions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 2 (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.
riscv_opcodes_util.process_imported_instructions (cognitive 18) pokedex/model/scripts/riscv_opcodes_util.py:490— riscv_opcodes_util.process_imported_instructions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SailCodeGenerator.genCSRBFBitSet (cognitive 17) dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala:365— SailCodeGenerator.genCSRBFBitSet has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), 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. This shape REPEATS in the file: one other method here (SailCodeGenerator.genCSRBFBitGet) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
SailCodeGenerator.genCSRBFBitGet (cognitive 17) dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala:409— SailCodeGenerator.genCSRBFBitGet has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), 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. This shape REPEATS in the file: one other method here (SailCodeGenerator.genCSRBFBitSet) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
dpi_t1rocketemu::dpi::axi_pop_R (cognitive 17) difftest/dpi_t1rocketemu/src/dpi.rs:243— dpi_t1rocketemu::dpi::axi_pop_R has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doccomment.build_yml_block (cognitive 16) pokedex/model/scripts/doccomment.py:116— doccomment.build_yml_block has cognitive complexity 16 (threshold 15). Drivers by points: error handling 3 (6 pts), if/else 3 (6 pts), boolean chains 2, loops 2 (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.
FunctionTooLong: pokedex::difftest::spike::parse_single_commit REDACTED:333— FunctionTooLong — pokedex::difftest::spike::parse_single_commit runs 236 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 136 over it, 2.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.
TooManyFunctions: sail_ffi::simulator dependencies/rvdecoderdb/sail-impl/boat/sail_ffi/src/simulator.rs:230— TooManyFunctions — 59 free functions. The bar is 30 free functions; this is 29 over it, 1.97× 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.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×1
D4 · Code Duplication· Near-duplicate member family (6 members, 28 shared lines) · ×1
Near-duplicate member family (6 members, 28 shared lines) t1/src/VectorFunctionUnit.scala:134— t1/src/VectorFunctionUnit.scala:134-190 | t1/src/VectorFunctionUnit.scala:193-246 | t1/src/VectorFunctionUnit.scala:392-440 | t1/src/VectorFunctionUnit.scala:442-487 | t1/src/VectorFunctionUnit.scala:490-540 | t1/src/VectorFunctionUnit.scala:542-600 — These 6 members are variants of one another: a block of 28 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 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 6 times.
D4 · Code Duplication· Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (8 members, 50+ identical tokens) t1/src/decoder/attribute/isCrosswrite.scala:18— t1/src/decoder/attribute/isCrosswrite.scala:18-55 | t1/src/decoder/attribute/isFirstwiden.scala:18-57 | t1/src/decoder/attribute/isFma.scala:18-47 | t1/src/decoder/attribute/isIndextype.scala:18-54 | t1/src/decoder/attribute/isItype.scala:18-59 | t1/src/decoder/attribute/isMultiplier.scala:18-53 | t1/src/decoder/attribute/isOther.scala:18-49 | t1/src/decoder/attribute/topUop.scala:220-264 — These 8 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 8 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 8 times.
D4 · Code Duplication· Members sharing a duplicated core (7 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (7 members, 50+ identical tokens) elaborator/src/rocketv/DCache.scala:24— elaborator/src/rocketv/DCache.scala:24-47 | elaborator/src/rocketv/Frontend.scala:25-48 | elaborator/src/rocketv/PMAChecker.scala:24-47 | elaborator/src/rocketv/RocketTile.scala:27-50 | elaborator/src/rocketv/TLB.scala:24-47 | elaborator/src/t1rocket/T1RocketTile.scala:29-52 | elaborator/src/t1rocketemu/TestBench.scala:30-53 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) t1/src/laneStage/MaskExchangeUnit.scala:708— t1/src/laneStage/MaskExchangeUnit.scala:708-755 | t1/src/mask/MaskUnit.scala:350-383 | t1/src/mask/MaskUnit.scala:612-648 | t1/src/mask/SlideIndexGen.scala:61-95 — 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 (60 lines × 2) t1/src/decoder/attribute/isMaskPipeType.scala:19— t1/src/decoder/attribute/isMaskPipeType.scala:19-78 | t1/src/decoder/attribute/isWriteCount.scala:19-78 — before extracting anything, compare `t1/src/decoder/attribute/isMaskPipeType.scala` and `t1/src/decoder/attribute/isWriteCount.scala` as WHOLE FILES: 92% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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 (42 lines × 2) dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala:366— dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala:366-407 | dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala:410-451 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala:366` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (40 lines × 3) t1/src/VectorFunctionUnit.scala:249— t1/src/VectorFunctionUnit.scala:249-288 | t1/src/VectorFunctionUnit.scala:299-338 | t1/src/VectorFunctionUnit.scala:346-385 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/VectorFunctionUnit.scala:249` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (38 lines × 3) t1/src/VectorFunctionUnit.scala:151— t1/src/VectorFunctionUnit.scala:151-188 | t1/src/VectorFunctionUnit.scala:207-244 | t1/src/VectorFunctionUnit.scala:556-593 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/VectorFunctionUnit.scala:151` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (36 lines × 2) elaborator/src/t1rocket/T1RocketTile.scala:90— elaborator/src/t1rocket/T1RocketTile.scala:90-125 | elaborator/src/t1rocketemu/TestBench.scala:91-126 — before extracting anything, compare `elaborator/src/t1rocket/T1RocketTile.scala` and `elaborator/src/t1rocketemu/TestBench.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (30 lines × 3) t1/src/VectorFunctionUnit.scala:409— t1/src/VectorFunctionUnit.scala:409-438 | t1/src/VectorFunctionUnit.scala:456-485 | t1/src/VectorFunctionUnit.scala:504-533 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/VectorFunctionUnit.scala:409` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (28–29 lines × 8) t1/src/decoder/attribute/isCrosswrite.scala:27— t1/src/decoder/attribute/isCrosswrite.scala:27-55 | t1/src/decoder/attribute/isFirstwiden.scala:30-57 | t1/src/decoder/attribute/isFma.scala:20-47 | t1/src/decoder/attribute/isIndextype.scala:27-54 | t1/src/decoder/attribute/isItype.scala:31-59 | t1/src/decoder/attribute/isMultiplier.scala:26-53 | t1/src/decoder/attribute/isOther.scala:22-49 | t1/src/decoder/attribute/topUop.scala:237-264 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 8 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/decoder/attribute/isCrosswrite.scala:27` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (28 lines × 3) t1/src/decoder/attribute/isMaskPipeType.scala:28— t1/src/decoder/attribute/isMaskPipeType.scala:28-55 | t1/src/decoder/attribute/isWriteCount.scala:28-55 | t1/src/decoder/attribute/maskPipeOpcode.scala:46-73 — before extracting anything, compare `t1/src/decoder/attribute/isMaskPipeType.scala` and `t1/src/decoder/attribute/isWriteCount.scala` as WHOLE FILES: 92% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/decoder/attribute/isMaskPipeType.scala:28` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (27 lines × 2) rocketv/src/RocketTile.scala:246— rocketv/src/RocketTile.scala:246-272 | t1rocket/src/T1RocketTile.scala:259-285 — before extracting anything, compare `rocketv/src/RocketTile.scala` and `t1rocket/src/T1RocketTile.scala` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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 (26 lines × 2) elaborator/src/t1/T1.scala:48— elaborator/src/t1/T1.scala:48-73 | elaborator/src/t1emu/TestBench.scala:49-74 — before extracting anything, compare `elaborator/src/t1/T1.scala` and `elaborator/src/t1emu/TestBench.scala` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (23 lines × 7) elaborator/src/rocketv/DCache.scala:25— elaborator/src/rocketv/DCache.scala:25-47 | elaborator/src/rocketv/Frontend.scala:26-48 | elaborator/src/rocketv/PMAChecker.scala:25-47 | elaborator/src/rocketv/RocketTile.scala:28-50 | elaborator/src/rocketv/TLB.scala:25-47 | elaborator/src/t1rocket/T1RocketTile.scala:30-52 | elaborator/src/t1rocketemu/TestBench.scala:31-53 — before extracting anything, compare `elaborator/src/rocketv/Frontend.scala` and `elaborator/src/rocketv/PMAChecker.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (23 lines × 2) t1/src/VectorFunctionUnit.scala:134— t1/src/VectorFunctionUnit.scala:134-156 | t1/src/VectorFunctionUnit.scala:392-414 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/VectorFunctionUnit.scala:134` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (22 lines × 2) rocketv/src/HellaCache.scala:256— rocketv/src/HellaCache.scala:256-277 | rocketv/src/HellaCache.scala:282-303 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `rocketv/src/HellaCache.scala:256` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20–21 lines × 3) t1/src/mask/MaskUnit.scala:358— t1/src/mask/MaskUnit.scala:358-378 | t1/src/mask/MaskUnit.scala:623-642 | t1/src/mask/SlideIndexGen.scala:69-88 — 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 (20 lines × 4) t1/src/VectorFunctionUnit.scala:193— t1/src/VectorFunctionUnit.scala:193-212 | t1/src/VectorFunctionUnit.scala:442-461 | t1/src/VectorFunctionUnit.scala:490-509 | t1/src/VectorFunctionUnit.scala:542-561 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/VectorFunctionUnit.scala:193` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16–18 lines × 6) t1/src/VectorFunctionUnit.scala:166— t1/src/VectorFunctionUnit.scala:166-183 | t1/src/VectorFunctionUnit.scala:222-239 | t1/src/VectorFunctionUnit.scala:422-437 | t1/src/VectorFunctionUnit.scala:469-484 | t1/src/VectorFunctionUnit.scala:517-532 | t1/src/VectorFunctionUnit.scala:571-588 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/VectorFunctionUnit.scala:166` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `t1/src/VectorFunctionUnit.scala:533` calls `Seq` and `t1/src/VectorFunctionUnit.scala:183` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (18 lines × 3) rocketv/src/RocketCore.scala:113— rocketv/src/RocketCore.scala:113-130 | rocketv/src/RocketTile.scala:158-175 | t1rocket/src/T1RocketTile.scala:167-184 — 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 (13 lines × 6) t1/src/VectorFunctionUnit.scala:154— t1/src/VectorFunctionUnit.scala:154-166 | t1/src/VectorFunctionUnit.scala:210-222 | t1/src/VectorFunctionUnit.scala:260-272 | t1/src/VectorFunctionUnit.scala:310-322 | t1/src/VectorFunctionUnit.scala:357-369 | t1/src/VectorFunctionUnit.scala:559-571 — 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 (12 lines × 6) t1/src/VectorFunctionUnit.scala:148— t1/src/VectorFunctionUnit.scala:148-159 | t1/src/VectorFunctionUnit.scala:204-215 | t1/src/VectorFunctionUnit.scala:406-417 | t1/src/VectorFunctionUnit.scala:453-464 | t1/src/VectorFunctionUnit.scala:501-512 | t1/src/VectorFunctionUnit.scala:553-564 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `t1/src/VectorFunctionUnit.scala:201` calls `tabulate`, `SerializableModuleGenerator`, `LaneAdderParam` and `t1/src/VectorFunctionUnit.scala:147` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10–11 lines × 2) dependencies/arithmetic/arithmetic/src/float/rawFloatFromFN.scala:44— dependencies/arithmetic/arithmetic/src/float/rawFloatFromFN.scala:44-54 | dependencies/berkeley-hardfloat/hardfloat/src/main/scala/rawFloatFromFN.scala:43-52 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `dependencies/arithmetic/arithmetic/src/float/rawFloatFromFN.scala:44` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8–9 lines × 4) t1/src/laneStage/MaskExchangeUnit.scala:714— t1/src/laneStage/MaskExchangeUnit.scala:714-721 | t1/src/mask/MaskUnit.scala:356-364 | t1/src/mask/MaskUnit.scala:621-628 | t1/src/mask/SlideIndexGen.scala:67-74 — 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 (9 lines × 3) rocketv/src/RocketCore.scala:149— rocketv/src/RocketCore.scala:149-157 | rocketv/src/RocketTile.scala:188-196 | t1rocket/src/T1RocketTile.scala:201-209 — 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 (8–9 lines × 2) dependencies/arithmetic/arithmetic/src/float/rawFloatFromFN.scala:66— dependencies/arithmetic/arithmetic/src/float/rawFloatFromFN.scala:66-73 | dependencies/berkeley-hardfloat/hardfloat/src/main/scala/rawFloatFromFN.scala:59-67 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 4) t1/src/VectorFunctionUnit.scala:99— t1/src/VectorFunctionUnit.scala:99-104 | t1/src/VectorFunctionUnit.scala:106-111 | t1/src/VectorFunctionUnit.scala:113-118 | t1/src/VectorFunctionUnit.scala:120-125 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `t1/src/VectorFunctionUnit.scala:99` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (4–5 lines × 3) t1zaozi/src/vrf/VRF.scala:506— t1zaozi/src/vrf/VRF.scala:506-510 | t1zaozi/src/vrf/VRF.scala:525-529 | t1zaozi/src/vrf/VRF.scala:548-551 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `t1zaozi/src/vrf/VRF.scala:548` calls `firstReadPipe`, `mux1H` and `t1zaozi/src/vrf/VRF.scala:506` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 30) elaborator/src/rocketv/ALU.scala:33— elaborator/src/rocketv/ALU.scala:33-37 | elaborator/src/rocketv/AMOALU.scala:33-37 | elaborator/src/rocketv/BTB.scala:84-88 | elaborator/src/rocketv/BreakpointUnit.scala:40-44 | elaborator/src/rocketv/CSR.scala:81-85 | elaborator/src/rocketv/DCache.scala:113-117 | elaborator/src/rocketv/Decoder.scala:39-43 | elaborator/src/rocketv/FPToFP.scala:43-47 | elaborator/src/rocketv/FPToInt.scala:41-45 | elaborator/src/rocketv/FPU.scala:51-55 | elaborator/src/rocketv/FPUFMAPipe.scala:52-56 | elaborator/src/rocketv/Frontend.scala:147-151 | elaborator/src/rocketv/IBuf.scala:51-55 | elaborator/src/rocketv/ICache.scala:52-56 | elaborator/src/rocketv/IntToFP.scala:43-47 | elaborator/src/rocketv/MulAddRecFNPipe.scala:37-41 | elaborator/src/rocketv/MulDiv.scala:58-62 | elaborator/src/rocketv/PMAChecker.scala:83-87 | elaborator/src/rocketv/PMP.scala:42-46 | elaborator/src/rocketv/PTW.scala:59-63 | elaborator/src/rocketv/PipelinedMultiplier.scala:40-44 | elaborator/src/rocketv/RVCExpander.scala:38-42 | elaborator/src/rocketv/Rocket.scala:89-93 | elaborator/src/rocketv/RocketTile.scala:201-205 | elaborator/src/rocketv/TLB.scala:120-124 | elaborator/src/t1/LaneShifter.scala:24-28 | elaborator/src/t1/T1.scala:85-89 | elaborator/src/t1emu/TestBench.scala:86-90 | elaborator/src/t1rocket/T1RocketTile.scala:138-142 | elaborator/src/t1rocketemu/TestBench.scala:139-143 — before extracting anything, compare `elaborator/src/rocketv/Frontend.scala` and `elaborator/src/rocketv/PMAChecker.scala` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 4) rocketv/src/CSR.scala:425— rocketv/src/CSR.scala:425-429 | rocketv/src/PipelinedMultiplier.scala:56-60 | rocketv/src/fpu/FPToInt.scala:54-58 | t1rocketemu/src/FPToIEEE.scala:59-63 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times.
Duplicated block (6 lines × 5) rocketv/src/Frontend.scala:18— rocketv/src/Frontend.scala:18-23 | rocketv/src/HellaCache.scala:46-51 | rocketv/src/PMA.scala:13-18 | rocketv/src/RocketTile.scala:16-21 | t1rocket/src/T1RocketTile.scala:39-44 — before extracting anything, compare `rocketv/src/RocketTile.scala` and `t1rocket/src/T1RocketTile.scala` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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 (11 lines × 12) t1/src/decoder/attribute/adderUop.scala:102— t1/src/decoder/attribute/adderUop.scala:102-112 | t1/src/decoder/attribute/adderUop.scala:122-132 | t1/src/decoder/attribute/adderUop.scala:133-143 | t1/src/decoder/attribute/adderUop.scala:174-184 | t1/src/decoder/attribute/floatUop.scala:63-73 | t1/src/decoder/attribute/floatUop.scala:74-84 | t1/src/decoder/attribute/floatUop.scala:85-95 | t1/src/decoder/attribute/mulUop.scala:51-61 | t1/src/decoder/attribute/otherUop.scala:83-93 | t1/src/decoder/attribute/shiftUop.scala:27-37 | t1/src/decoder/attribute/shiftUop.scala:46-56 | t1/src/decoder/attribute/topUop.scala:171-181 — there are 12 copies across 6 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 (14 lines × 3) t1/src/decoder/attribute/adderUop.scala:160— t1/src/decoder/attribute/adderUop.scala:160-173 | t1/src/decoder/attribute/floatUop.scala:129-142 | t1/src/decoder/attribute/mulUop.scala:62-75 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (13 lines × 3) t1/src/decoder/attribute/isAverage.scala:18— t1/src/decoder/attribute/isAverage.scala:18-30 | t1/src/decoder/attribute/isReadonly.scala:18-30 | t1/src/decoder/attribute/isSlid.scala:18-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 all 3 call sites, so a change lands once.
Duplicated block (25 lines × 2) t1/src/decoder/attribute/isLogic.scala:18— t1/src/decoder/attribute/isLogic.scala:18-42 | t1/src/decoder/attribute/isZero.scala:18-42 — 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 (41 lines × 2) dependencies/riscv-opcodes/shared_utils.py:171— dependencies/riscv-opcodes/shared_utils.py:171-211 | pokedex/model/scripts/riscv_opcodes_util.py:175-215 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `dependencies/riscv-opcodes/shared_utils.py:213` calls `check_arg_lut` and `pokedex/model/scripts/riscv_opcodes_util.py:221` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (33 lines × 2) dependencies/riscv-opcodes/shared_utils.py:409— dependencies/riscv-opcodes/shared_utils.py:409-441 | pokedex/model/scripts/riscv_opcodes_util.py:418-450 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `instr_dict` to `InstrDict` in one and `dict[str, SingleInstr]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (11 lines × 2) dependencies/riscv-opcodes/shared_utils.py:496— dependencies/riscv-opcodes/shared_utils.py:496-506 | pokedex/model/scripts/riscv_opcodes_util.py:504-514 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) dependencies/riscv-opcodes/shared_utils.py:313— dependencies/riscv-opcodes/shared_utils.py:313-324 | pokedex/model/scripts/riscv_opcodes_util.py:320-331 — before extracting anything, compare `dependencies/riscv-opcodes/shared_utils.py` and `pokedex/model/scripts/riscv_opcodes_util.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 187 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `instr_dict` to `InstrDict` in one and `dict[str, SingleInstr]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (18 lines × 2) difftest/t1-sim-checker/src/t1emu/mod.rs:14— difftest/t1-sim-checker/src/t1emu/mod.rs:14-31 | difftest/t1-sim-checker/src/t1rocketemu/mod.rs:14-31 — 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 (16 lines × 2) difftest/spike_rs/src/util.rs:9— difftest/spike_rs/src/util.rs:9-24 | difftest/spike_rs/src/util.rs:37-52 — 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 × 3) profiler/src/input_hier.rs:272— profiler/src/input_hier.rs:272-279 | profiler/src/input_hier.rs:298-305 | profiler/src/input_hier.rs:326-333 — 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.
Off the main sequence: spike_rs — spike_rs: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Low cohesion: PTW (LCOM4 4) rocketv/src/PTW.scala:187— PTW'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.
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.
Orphaned file t1/src/T1.scala: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 t1/src/Lane.scala: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 rocketv/src/Decoder.scala: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 rocketv/src/Bundle.scala: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 t1/src/laneStage/MaskExchangeUnit.scala: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 t1/src/lsu/SimpleAccessUnit.scala: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 t1/src/mask/MaskUnit.scala: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 t1/src/Bundles.scala: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 rocketv/src/ICache.scala: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 rocketv/src/PTW.scala: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 rocketv/src/TLB.scala: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 REDACTED: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 dependencies/berkeley-hardfloat/hardfloat/src/main/scala/DivSqrtRecF64_mulAddZ31.scala: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 rocketv/src/RVDecoderDB.scala: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 t1zaozi/src/vrf/VRF.scala: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 t1/src/laneStage/LaneExecutionBridge.scala: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 rocketv/src/Frontend.scala: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 REDACTED: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 rocketv/src/FPU.scala: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 pokedex/model/scripts/riscv_opcodes_util.py: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 dependencies/riscv-opcodes/shared_utils.py: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 t1/src/VectorFunctionUnit.scala: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 t1/src/laneStage/LaneStage1.scala: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 t1rocket/src/T1RocketTile.scala: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 dependencies/rvdecoderdb/sailcodegen/src/SailCodeGen.scala: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.
Interpolated log message defeats structured logging pokedex/model/scripts/riscv_opcodes_util.py:422— `debug` at line 422 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging pokedex/model/scripts/riscv_opcodes_util.py:466— `debug` at line 466 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging pokedex/model/scripts/riscv_opcodes_util.py:480— `debug` at line 480 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging pokedex/model/scripts/riscv_opcodes_util.py:497— `debug` at line 497 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging pokedex/model/scripts/riscv_opcodes_util.py:616— `debug` at line 616 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging pokedex/model/scripts/riscv_opcodes_util.py:622— `debug` at line 622 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging pokedex/model/scripts/riscv_opcodes_util.py:636— `debug` at line 636 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging dependencies/riscv-opcodes/latex_utils.py:356— `error` at line 356 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging dependencies/riscv-opcodes/latex_utils.py:366— `error` at line 366 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging dependencies/riscv-opcodes/shared_utils.py:413— `debug` at line 413 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging dependencies/riscv-opcodes/shared_utils.py:457— `debug` at line 457 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging dependencies/riscv-opcodes/shared_utils.py:471— `debug` at line 471 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging dependencies/riscv-opcodes/shared_utils.py:488— `debug` at line 488 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging dependencies/riscv-opcodes/shared_utils.py:589— `debug` at line 589 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging dependencies/riscv-opcodes/shared_utils.py:595— `debug` at line 595 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging dependencies/riscv-opcodes/shared_utils.py:609— `debug` at line 609 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging pokedex/simulator/src/pokedex/mod.rs:90— `info!` at line 90 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 pokedex/simulator/src/pokedex/mod.rs:103— `info!` at line 103 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 pokedex/simulator/src/pokedex/mod.rs:105— `error!` at line 105 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: `error!(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 pokedex/simulator/src/pokedex/mod.rs:123— `info!` at line 123 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 pokedex/simulator/src/model/ffi.rs:155— `info!` at line 155 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 pokedex/simulator/src/model/mod.rs:103— `debug!` at line 103 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 pokedex/simulator/src/model/mod.rs:132— `error!` at line 132 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: `error!(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 pokedex/simulator/src/gdb/mod.rs:55— `info!` at line 55 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 pokedex/simulator/src/gdb/mod.rs:58— `info!` at line 58 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`.
Duplicated predicate dependencies/riscv-opcodes/shared_utils.py:262— `char1 == "-" or char2 == "-" or char1 == char2` appears character-identically in 2 files — dependencies/riscv-opcodes/shared_utils.py, pokedex/model/scripts/riscv_opcodes_util.py. 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.
Duplicated predicate dependencies/riscv-opcodes/shared_utils.py:281— `is_in_nested_dict(a, x, y) or is_in_nested_dict(a, y, x)` appears character-identically in 2 files — dependencies/riscv-opcodes/shared_utils.py, pokedex/model/scripts/riscv_opcodes_util.py. 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.
Duplicated predicate dependencies/riscv-opcodes/shared_utils.py:465— `orig_inst.replace(".", "_") not in instr_dict or include_pseudo or name in include_pseudo_ops` appears character-identically in 2 files — dependencies/riscv-opcodes/shared_utils.py, pokedex/model/scripts/riscv_opcodes_util.py. 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.
Duplicated predicate dependencies/riscv-opcodes/shared_utils.py:432— `overlaps(item["encoding"], single_dict["encoding"]) and not extension_overlap_allowed(ext_name, item["extension"][0]) and not instruction_ov…` appears character-identically in 2 files — dependencies/riscv-opcodes/shared_utils.py, pokedex/model/scripts/riscv_opcodes_util.py. 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.
Duplicated predicate dependencies/riscv-opcodes/shared_utils.py:242— `type1 == type2 or is_rv_variant(type1, type2)` appears character-identically in 2 files — dependencies/riscv-opcodes/shared_utils.py, pokedex/model/scripts/riscv_opcodes_util.py. 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.
Duplicated predicate difftest/t1-sim-checker/src/t1emu/json_events.rs:320— `count == se.vrf_access_record.retired_writes && !se.is_rd_written && !se.is_fd_written` appears character-identically in 2 files — difftest/t1-sim-checker/src/t1emu/json_events.rs, difftest/t1-sim-checker/src/t1rocketemu/json_events.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.
Duplicated predicate difftest/t1-sim-checker/src/t1emu/json_events.rs:349— `se.is_vfence() && self.commit_queue.len() == 1` appears character-identically in 2 files — difftest/t1-sim-checker/src/t1emu/json_events.rs, difftest/t1-sim-checker/src/t1rocketemu/json_events.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.
Duplicated predicate difftest/dpi_t1emu/src/drive.rs:253— `self.timeout > 0 && tick - self.last_commit_cycle > self.timeout` appears character-identically in 2 files — difftest/dpi_t1emu/src/drive.rs, difftest/dpi_t1rocketemu/src/drive.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.
Duplicated predicate t1/src/LaneAdder.scala:191— `!operation0Sign && !operation1Sign && resultSign` appears character-identically in 2 files — t1/src/LaneAdder.scala, t1/src/vfu/ReduceAdder.scala. 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.
Duplicated predicate dependencies/arithmetic/arithmetic/src/float/DivSqrt.scala:45— `!rawA.isNaN && !rawA.isInf && rawB.isZero` appears character-identically in 3 files — dependencies/arithmetic/arithmetic/src/float/DivSqrt.scala, dependencies/arithmetic/arithmetic/src/float/DivSqrtMerge.scala, t1/src/LaneDivFP.scala. 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.
Duplicated predicate dependencies/arithmetic/arithmetic/src/float/DivSqrt.scala:48— `!rawA.isNaN && !rawA.isZero && rawA.sign` appears character-identically in 3 files — dependencies/arithmetic/arithmetic/src/float/DivSqrt.scala, dependencies/arithmetic/arithmetic/src/float/DivSqrtMerge.scala, t1/src/LaneDivFP.scala. 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.
Duplicated predicate dependencies/arithmetic/arithmetic/src/float/DivSqrtMerge.scala:198— `!sqrtIter.resultOutput.bits.zeroRemainder || sqrtIter.resultOutput.bits.result(0)` appears character-identically in 2 files — dependencies/arithmetic/arithmetic/src/float/DivSqrtMerge.scala, t1/src/LaneDivFP.scala. 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.
Duplicated predicate t1/src/mask/MaskUnit.scala:378— `!vlmul(2) && accessRegGrowth >= intLMULInput` appears character-identically in 2 files — t1/src/mask/MaskUnit.scala, t1/src/mask/SlideIndexGen.scala. 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.
Duplicated predicate t1/src/lsu/LoadUnit.scala:217— `(!idleNext && status.idle) || invalidInstructionNext` appears character-identically in 2 files — t1/src/lsu/LoadUnit.scala, t1/src/lsu/StoreUnit.scala. 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.
Duplicated predicate dependencies/chisel-interface/dwbb/src/interface/DW_tap.scala:36— `(0 <= manNum) && (manNum >= 2047) && (manNum != 127)` appears character-identically in 2 files — dependencies/chisel-interface/dwbb/src/interface/DW_tap.scala, dependencies/chisel-interface/dwbb/src/interface/DW_tap_uc.scala. 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.
Duplicated predicate dependencies/chisel-interface/dwbb/src/interface/DW_fifo_2c_df.scala:87— `(clkRatio == 1) && (memMode == 0 || memMode == 1)` appears character-identically in 2 files — dependencies/chisel-interface/dwbb/src/interface/DW_fifo_2c_df.scala, dependencies/chisel-interface/dwbb/src/interface/DW_fifoctl_2c_df.scala. 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.
Duplicated predicate t1/src/LaneAdder.scala:196— `(data(7) && !upperOverflow) || lowerOverflow` appears character-identically in 2 files — t1/src/LaneAdder.scala, t1/src/vfu/ReduceAdder.scala. 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.
Duplicated predicate dependencies/arithmetic/arithmetic/src/float/DivSqrtMerge.scala:238— `(divValid && divReady) || !divIter.output.isLastCycle` appears character-identically in 2 files — dependencies/arithmetic/arithmetic/src/float/DivSqrtMerge.scala, t1/src/LaneDivFP.scala. 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.
Duplicated predicate dependencies/arithmetic/arithmetic/src/float/DivSqrt.scala:43— `(rawA.isZero && rawB.isZero) || (rawA.isInf && rawB.isInf)` appears character-identically in 3 files — dependencies/arithmetic/arithmetic/src/float/DivSqrt.scala, dependencies/arithmetic/arithmetic/src/float/DivSqrtMerge.scala, t1/src/LaneDivFP.scala. 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.
Duplicated predicate dependencies/berkeley-hardfloat/hardfloat/src/main/scala/DivSqrtRecF64_mulAddZ31.scala:170— `(rawA_S.isZero && rawB_S.isZero) || (rawA_S.isInf && rawB_S.isInf)` appears character-identically in 2 files — dependencies/berkeley-hardfloat/hardfloat/src/main/scala/DivSqrtRecF64_mulAddZ31.scala, dependencies/berkeley-hardfloat/hardfloat/src/main/scala/DivSqrtRecFN_small.scala. 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.
Duplicated predicate dependencies/arithmetic/arithmetic/src/float/DivSqrtMerge.scala:237— `(sqrtValid && sqrtReady) || !sqrtIter.output.isLastCycle` appears character-identically in 2 files — dependencies/arithmetic/arithmetic/src/float/DivSqrtMerge.scala, t1/src/LaneDivFP.scala. 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.
Duplicated predicate t1/src/LaneAdder.scala:248— `(uopOH(6) && !less) || (uopOH(7) && less)` appears character-identically in 2 files — t1/src/LaneAdder.scala, t1/src/vfu/ReduceAdder.scala. 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.
Duplicated predicate t1/src/LaneAdder.scala:249— `(uopOH(6) && less) || (uopOH(7) && !less)` appears character-identically in 2 files — t1/src/LaneAdder.scala, t1/src/vfu/ReduceAdder.scala. 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.
Duplicated predicate dependencies/chisel-interface/dwbb/src/interface/DW_asymfifoctl_s1_df.scala:32— `1 <= log2Ceil(depth) && log2Ceil(depth) <= 24` appears character-identically in 3 files — dependencies/chisel-interface/dwbb/src/interface/DW_asymfifoctl_s1_df.scala, dependencies/chisel-interface/dwbb/src/interface/DW_asymfifoctl_s1_sf.scala, dependencies/chisel-interface/dwbb/src/interface/DW_stackctl.scala. 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.
Duplicated predicate dependencies/chisel-interface/dwbb/src/interface/DW_asymfifoctl_s2_sf.scala:38— `2 <= log2Ceil(depth) && log2Ceil(depth) <= 24` appears character-identically in 2 files — dependencies/chisel-interface/dwbb/src/interface/DW_asymfifoctl_s2_sf.scala, dependencies/chisel-interface/dwbb/src/interface/DW_fifoctl_s2_sf.scala. 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.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 15 significant file(s) lose their only recent owner: t1/src/laneStage/MaskExchangeUnit.scala, t1/src/mask/MaskUnit.scala, t1/src/Bundles.scala, t1/src/laneStage/LaneExecutionBridge.scala, t1/src/laneStage/LaneStage1.scala, t1/src/laneStage/LaneStage0.scala, t1/src/laneStage/SlotTokenManager.scala, t1/src/interface/LaneInterface.scala (+7 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 10 significant file(s) lose their only recent owner: t1zaozi/src/zvma/ZVMA.scala, t1zaozi/src/LaneZvbb.scala, t1zaozi/src/utils/Utils.scala, t1zaozi/src/zvma/ZVMAProcessingElement.scala, t1zaozi/src/vrf/WriteCheck.scala, t1zaozi/src/LaneShifter.scala, t1zaozi/src/MaskedLogic.scala, t1zaozi/src/SRAM.scala (+2 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 3 significant file(s) lose their only recent owner: pokedex/simulator/src/difftest/replay.rs, pokedex/simulator/src/bus/mod.rs, pokedex/simulator/src/pokedex/mod.rs. Pair on, review, or document these before any departure.
D34 · Knowledge Freshness· Most significant orphaned file · ×3
Most significant orphaned file rocketv/src/CSR.scala:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file rocketv/src/RocketCore.scala:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file rocketv/src/HellaCache.scala:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 1 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 (30 single-owned of 248 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; 248 of the 761 production source files in this repository met that bar). They are anonymized user #4 (2 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: pokedex/model/scripts/doccomment.py, pokedex/model/scripts/datagen.py.
Documentation: no build, run or usage example doc/en/README.md:1— `en` is a published package (`package.json` without `"private": true`) and neither `doc/en/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
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/`.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
Dormant codebase — 248 of 248 significant files have no living knowledge — the codebase as a whole is dormant, not 248 separate risks. Counted over 248 of the 761 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change.
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.
P10 · Library API & versioning· Large public API surface · ×1
Large public API surface — 18/21 types (86%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
P10 · Library API & versioning· No explicit versioning · ×1
No explicit versioning dependencies/arithmetic/build.mill— No explicit version was found for the Mill library declared by `build.mill`. This check read a literal `publishVersion` in the Mill build, or VcsVersion deriving it from git tags, and a CHANGELOG/CHANGES/HISTORY/NEWS/RELEASES file with a semver heading, or release tooling (changesets, release-please, semantic-release, goreleaser, cargo-release, bump2version, standard-version, git-cliff) in the library's directory or at the repository root, or a semver release tag (or a Drupal `8.x-1.2` release tag) in the repository. A version computed where none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes.
Logging is not universal — Only 9/10 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `dependencies/rvdecoderdb/sail-impl/boat/emulator`.
No SAST REDACTED:3— No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 17616 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling· Dependabot does not watch github-actions/npm/cargo · ×1
Dependabot does not watch github-actions/npm/cargo REDACTED:2— `REDACTED` schedules updates, but no `package-ecosystem` entry covers `github-actions`, `npm`, `cargo`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the `updates:` list.
X5 · Nullable reference types· Scala's null is not held to the type system everywhere · ×1
Scala's null is not held to the type system everywhere — No build over this repository's 686 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.
Outdated: anyhow — `anyhow` is locked at 1.0.98 but 1.0.104 is the current stable release on crates.io, and it already satisfies the `"1.0.87"` requirement declared in profiler/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p anyhow` and commit the updated REDACTED.
Outdated: clap — `clap` is locked at 4.5.37 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4.5.17"` requirement declared in profiler/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
Outdated: libc — `libc` is locked at 0.2.178 but 0.2.191 is the current stable release on crates.io, and it already satisfies the `"0.2.155"` requirement declared in difftest/spike_rs/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libc` and commit the updated REDACTED.
Outdated: log — `log` is locked at 0.4.27 but 0.4.35 is the current stable release on crates.io, and it already satisfies the `"0.4.22"` requirement declared in profiler/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p log` and commit the updated REDACTED.
Outdated: serde — `serde` is locked at 1.0.219 but 1.0.229 is the current stable release on crates.io, and it already satisfies the `"1.0"` requirement declared in difftest/t1-sim-checker/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde` and commit the updated REDACTED.
Outdated: serde_json — `serde_json` is locked at 1.0.140 but 1.0.154 is the current stable release on crates.io, and it already satisfies the `"1.0"` requirement declared in difftest/t1-sim-checker/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: tempfile — `tempfile` is locked at 3.19.1 but 3.27.0 is the current stable release on crates.io, and it already satisfies the `"3.16.0"` requirement declared in difftest/dpi_t1rocketemu/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tempfile` and commit the updated REDACTED.
Outdated: tracing — `tracing` is locked at 0.1.41 but 0.1.44 is the current stable release on crates.io, and it already satisfies the `"0.1.40"` requirement declared in difftest/dpi_common/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tracing` and commit the updated REDACTED.
Outdated: tracing-subscriber — `tracing-subscriber` is locked at 0.3.19 but 0.3.23 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in difftest/dpi_common/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tracing-subscriber` and commit the updated REDACTED.
Off the main sequence: dpi_common — dpi_common: abstractness 0.00, instability 0.00, distance 1.00 — the shape a shared-kernel / building-block library has BY DESIGN — concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket.
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. semgrep could not parse 8 file(s) — `omreader/src/OMReader.scala`, `omreader/src/t1/T1.scala`, `omreader/src/t1rocketv/T1RocketTile.scala`, `script/ci/src/Main.scala`, `script/emu/src/Main.scala`, … (+3 more) — so the PII/GDPR sweep did not cover them at all.
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 01a1b2b4-b3ab-74c2-92e3-52303ecd5d1e · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 21 · Warnings: 468 · Recommendations: 331 · Info: 10 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 06-11-2026 @ 21:12 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.