Public report of XedaHQ/xeda, published 17 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 report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). 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, 17 November 2026, 12:26 UTC · Survey ID cd_d1808a8be52242b08741a96c52210fa9

XedaHQ/xeda

Measured 17 November 2026, 12:25 UTC, at code version dbc05ef

First survey, so nothing to compare with yet
CAI score 64.3out of 100 Adequate
CriticalWeakAdequateStrongExemplary

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 large codebase: 104,834 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 2.3 person-years · Weakest lens: Security and Compliance, 49.6

Findings by how serious they are

41 critical 595 serious 70 minor

15 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

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 12:25 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 ▸

48of 48 dimensions measured by tools.
699of 706 findings point to an exact file and line, so you can open each one in the code. The other 7 concern the repository as a whole, such as missing documentation.
48dimensions across 6 lenses, read from 104,834 lines of product code in 2 projects.
Chapters

Executive summary

XedaHQ/xeda falls short of our standard for production, in part because it has pipeline tools referenced by a changeable name. It scores 64.3 out of 100 and is rated Adequate, and all 41 of its critical findings are security problems.

Security and Compliance, at 49.6, is the weakest lens and counts most in the score. The best first step is pinning the build's installs, worth about 2.1 points. Fixing the password or key in the code comes next, worth about 1.9 points. Raising Security and Compliance to 70 would lift the score to about 73.7.

Twenty-eight pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Seven pipeline steps install packages that can change without warning, and one automatic update takes new releases before a bad one can be spotted. Pinning each tool to an exact version, pinning what the pipeline installs and setting a waiting period for automatic updates would close these risks. Limiting each secret to its own step would fix the secret exposed to more of the pipeline than needed, and fixing the weaknesses the scanner points to would deal with the security weakness in the code.

The product code is 104,834 lines, about €330,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 for The 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.
Security and Compliance 49.6 · counts for 46%Production Readiness 73.8 · counts for 25%Code Health 74.5 · counts for 14%Maturity 76.5 · counts for 8%Architecture 90.6 · counts for 4%Performance 100.0 · counts for 2%

If Security and Compliance rose from 49.6 to 70, the lowest score rated Strong, the score would rise from 64.3 to about 73.7.

Code composition: what the lines of code are
Product code 37%Tests 63%
Rebuild cost: about €330,000 · Estimate
Cost to rebuild€110,000 to €550,000, for 1,816 to 5,762 hours of work, about 2.3 person-years for 1 to 5 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.9 at a score of 64. 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.
SizeLarge: 104,834 lines of product code
What it is notNot 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 7 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED, REDACTED.
Raises the score by about 2.1 points · Low effort · Static Analysis (SAST)
2
Resolve the 1 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED.
Raises the score by about 1.9 points · Low effort · REDACTED Scanning
3
Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED.
Raises the score by about 1.5 points · Low effort · Secrets (history)

Diagnosis: what the measurements show together

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 €330,000 to build again, about 2.3 person-years of work. Its weakest lens is Security and Compliance, at 49.6 (Weak). 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 7 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 2.1 points for low effort, because it clears the 7 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
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.6 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 4% to 8% on every change. The history of the code shows how much it changes: about 487,122 lines over the last 90 days, which is about 1,975,550 lines a year. At that pace, the extra work comes to an estimated 176 to 1056.1 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture: 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.

156 modules, with 366 dependencies between them. 2 loops run through 7 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 116 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.
uses →1 _internal.dataclass2 _internal.flow_runner.launch_options3 _internal.units4 _internal.flow.settings_group5 _internal.platforms.model6 _internal.records7 _internal.spec8 _internal.tool9 _internal.flows.openroad.groups10 _internal.outcomes11 _internal.plan12 _internal.workspace13 errors14 _internal.design15 _internal.sweep16 _internal.deliver17 _internal.flow.flow18 _internal.flow_runner.launch_node19 _internal.flow.sim20 _internal.flow.synth21 _internal.flow_runner.resolver22 _internal.flows.openroad.base23 _internal24 _internal.flow25 _internal.flow_runner26 _internal.flow_runner.default_runner27 _internal.flows.bsc28 _internal.flows.ghdl29 _internal.flows.nextpnr30 _internal.flows.nvc31 _internal.flows.openfpgaloader32 _internal.flows.openroad.cts33 _internal.flows.openroad.final34 _internal.flows.openroad.place35 _internal.flows.vivado.vivado_synth36 _internal.flow_runner.dse.dse_runner37 _internal.flows38 _internal.flows.openroad39 _internal.flows.vivado40 _internal.remote
1 _internal.dataclass
2 _internal.flow_runner.launch_options
3 _internal.units
4 _internal.flow.settings_group1
5 _internal.platforms.model1
6 _internal.records1
7 _internal.spec1
8 _internal.tool2
9 _internal.flows.openroad.groups14
10 _internal.outcomes11
11 _internal.plan1
12 _internal.workspace22111
13 errors1
14 _internal.design102
15 _internal.sweep312421
16 _internal.deliver1
17 _internal.flow.flow11
18 _internal.flow_runner.launch_node11
19 _internal.flow.sim213
20 _internal.flow.synth1213
21 _internal.flow_runner.resolver1
22 _internal.flows.openroad.base12112
23 _internal321055512842213
24 _internal.flow31131
25 _internal.flow_runner161424183219115
26 _internal.flow_runner.default_runner111141114
27 _internal.flows.bsc2371
28 _internal.flows.ghdl15411
29 _internal.flows.nextpnr1231
30 _internal.flows.nvc11112
31 _internal.flows.openfpgaloader121
32 _internal.flows.openroad.cts223
33 _internal.flows.openroad.final133
34 _internal.flows.openroad.place323
35 _internal.flows.vivado.vivado_synth1322
36 _internal.flow_runner.dse.dse_runner11121
37 _internal.flows213411
38 _internal.flows.openroad21711111
39 _internal.flows.vivado131
40 _internal.remote211313212
Uses a module listed above itPart of a loopThe module itself
1 _internal.dataclass2 _internal.flow_runner.launch_options3 _internal.units4 _internal.flow.settings_group5 _internal.platforms.model6 _internal.records7 _internal.spec8 _internal.tool9 _internal.flows.openroad.groups10 _internal.outcomes11 _internal.plan12 _internal.workspace13 errors14 _internal.design15 _internal.sweep16 _internal.deliver17 _internal.flow.flow18 _internal.flow_runner.launch_node19 _internal.flow.sim20 _internal.flow.synth21 _internal.flow_runner.resolver22 _internal.flows.openroad.base23 _internal24 _internal.flow25 _internal.flow_runner26 _internal.flow_runner.default_runner27 _internal.flows.bsc28 _internal.flows.ghdl29 _internal.flows.nextpnr30 _internal.flows.nvc31 _internal.flows.openfpgaloader32 _internal.flows.openroad.cts33 _internal.flows.openroad.final34 _internal.flows.openroad.place35 _internal.flows.vivado.vivado_synth36 _internal.flow_runner.dse.dse_runner37 _internal.flows38 _internal.flows.openroad39 _internal.flows.vivado40 _internal.remote_internal.dataclass1_internal.flow_runner.launch_options2_internal.units3_internal.flow.settings_group4_internal.platforms.model5_internal.records6_internal.spec7_internal.tool8_internal.flows.openroad.groups9_internal.outcomes10_internal.plan11_internal.workspace12errors13_internal.design14_internal.sweep15_internal.deliver16_internal.flow.flow17_internal.flow_runner.launch_node18_internal.flow.sim19_internal.flow.synth20_internal.flow_runner.resolver21_internal.flows.openroad.base22_internal23_internal.flow24_internal.flow_runner25_internal.flow_runner.default_runner26_internal.flows.bsc27_internal.flows.ghdl28_internal.flows.nextpnr29_internal.flows.nvc30_internal.flows.openfpgaloader31_internal.flows.openroad.cts32_internal.flows.openroad.final33_internal.flows.openroad.place34_internal.flows.vivado.vivado_synth35_internal.flow_runner.dse.dse_runner36_internal.flows37_internal.flows.openroad38_internal.flows.vivado39_internal.remote4011112141112211111023124211111121312131121123210555128422133113116142418321911511114111423711541112311111212122313332313221112121341121711111131211313212+116 more modules (most-connected shown)

At a glance — Code Health · 74.5 · Adequate · gated by D2 ·

At a glance — Architecture · 90.6 · Adequate · gated by D26 ·

At a glance — Maturity · 76.5 · Strong ·

At a glance — Readiness · 73.8 · Strong ·

At a glance — Security · 49.6 · Weak · gated by D29, D36 ·

At a glance — Performance · 100.0 · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection51High / Critical
A03:2025 — Software Supply Chain Failures5Medium
A07:2025 — Authentication Failures3High / Critical

Roadmap

Top priorities: Resolve the 7 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED, REDACTED; Resolve the 1 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED; Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED.

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

Do thisHelpsEffortDimension
Resolve the 7 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED, REDACTED.+2.1 ptsLowStatic Analysis (SAST)
Resolve the 1 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED.+1.9 ptsLowREDACTED Scanning
Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED.+1.5 ptsLowSecrets (history)
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.+1.5 ptsLowStatic Analysis (SAST)
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing.+1.5 ptsLowSupply-chain Provenance & Signing
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing.+1.5 ptsLowSupply-chain Provenance & Signing
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED.+1.5 ptsLowSupply-chain Provenance & Signing
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with REDACTED.+1.5 ptsLowADR Quality

File quality

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

FileScoreBandWorst signal
REDACTED2.3SlopREDACTED Scanning: Leaked secret: REDACTED
REDACTED3.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.6MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.4MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.4MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.8MixedStatic Analysis (SAST): High: REDACTED
src/xeda/_internal/flows/yosys/yosys.py6.0MixedExplicit Debt: TodoComment
src/xeda/_internal/flows/ghdl/__init__.py6.0MixedExplicit Debt: TodoComment
src/xeda/_internal/flows/nvc/__init__.py6.0MixedExplicit Debt: TodoComment
src/xeda/_internal/flows/vivado/vivado_synth.py6.0MixedExplicit Debt: TodoComment
REDACTED6.2MixedStatic Analysis (SAST): High: REDACTED
src/xeda/_internal/flows/openroad/base.py6.3MixedCognitive Complexity: OpenroadStage._check_liberty_units (cognitive 18)
REDACTED6.3MixedCyclomatic Complexity: Nextpnr.run (cyclomatic 36)
REDACTED6.7MixedCyclomatic Complexity: tool_store._release_asset (cyclomatic 18)

How the grades work

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

Critical — 41

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

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

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

Could not be resolved — 15

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

Methodology & how to trust this report

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 48 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, 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 — 48 dimensions across the health lenses
D1D2D3D4D6D13D14D15D17D19D20D26D27D28D29D30D34D35D36D43D44AX10AX3AX4AX6M1M2M3M4P1P10P2P3P4P6PF3X12X13X17X19X23X24X25X27X28X3X30X4

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
  1. 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, 699 of 706 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.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. 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.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic

Every finding is locatable in findings.md. Run 01a1e978-0d3a-78d4-a3f0-8591252493b1.

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

Run transparency — what happened this run

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

  • 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: the Python half could not be measured — the pytest suite ran no test, so nothing was measured (no report). Coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, not a defect in the repo.
  • 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) and this repository declares a Python test suite (repository root, 373 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D12 Dependency Hygiene — not measured this run — 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. This repository's 3 shipped Python distribution(s) across 2 manifest(s) WERE read; what went unanswered is the currency half, because it grades an EXACT pin against the newest release and every declaration here is a floor or a range — which installs the newest release it admits and so cannot be behind one. So pypi.org was never asked. This is a true statement about the repository, and the healthy one, NOT a gap on our side: no reader we could write would find a currency question here.
  • D16 Bus Factor — 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. Single-maintainer repository — bus factor is not applicable (4 contributor(s) across 1411 commit(s) sampled, automation and bot accounts excluded). One of them holds 99% of the history; the other 3 hold 0.3% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
  • 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. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these 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 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
  • 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.
  • AX1 Captive dependencies — 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 reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository defines its own container in src/xeda/_internal/flows/yosys/asic_groups.py, whose lifetimes are not modelled yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • 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: 2 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.
  • GD1 Unfinished & placeholder code — 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 reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Java was found, and this repository's Python, c, cpp, tcl, verilog is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • IC1 Incompleteness & stubs — not measured this run — 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 reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby, Scala and Rust source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby, Scala or Rust was found, and this repository's Python, c, cpp, tcl, verilog is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — 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. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • 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.
  • X16 Unfloored truncation loop — 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 reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala, Kotlin and Rust source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala, Kotlin or Rust was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X18 Disposal-pattern correctness — not measured this run — 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 reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala, PHP, Rust and Elixir source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala, PHP, Rust or Elixir was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X29 Per-element action decided by a fixed element — 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 reads C# syntax, and JavaScript/TypeScript (Vue and Svelte components included), Java, Rust, Dart, Ruby, Scala, Kotlin and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • X5 Nullable reference types — 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 reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, Kotlin source, and Rust source only, and no C# was loaded, no TypeScript was found, and this repository's C, Cpp, Python, Tcl, Verilog is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

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

Limitations & what we did not check

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.
  • 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.
  • 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.
  • 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.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • 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.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity4.9 / 10Weak✓ Tool-verified

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

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

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

128 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was FlowLauncher._launch at 98.

FlowLauncher._launch (cyclomatic 98)src/xeda/_internal/flow_runner/default_runner.py:1611
resolver.resolve (cyclomatic 85)src/xeda/_internal/flow_runner/resolver.py:1059
cli_settings_completion._parse_request_words (cyclomatic 68)src/xeda/_internal/cli_settings_completion.py:140
FlowLauncher._request (cyclomatic 68)src/xeda/_internal/flow_runner/default_runner.py:3358
Vcs.run (cyclomatic 66)src/xeda/_internal/flows/vcs.py:356

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

What to do

  1. Bring the 5 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with FlowLauncher._launch (cyclomatic 98), resolver.resolve (cyclomatic 85), cli_settings_completion._parse_request_words (cyclomatic 68). — 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 5 together lifts Cyclomatic Complexity from 4.9 to about 5.7/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D2 · Cognitive Complexity2.0 / 10Critical✓ Tool-verified

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

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

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

254 method(s) exceeded the cognitive complexity threshold of 15; the worst was resolver.resolve at 176.

resolver.resolve (cognitive 176)src/xeda/_internal/flow_runner/resolver.py:1059
cli_settings_completion._parse_request_words (cognitive 166)src/xeda/_internal/cli_settings_completion.py:140
FlowLauncher._launch (cognitive 148)src/xeda/_internal/flow_runner/default_runner.py:1611
Dse.run_flow (cognitive 123)src/xeda/_internal/flow_runner/dse/dse_runner.py:615
Vcs.run (cognitive 93)src/xeda/_internal/flows/vcs.py:356

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

What to do

  1. Bring the 14 bodies over 60 down to 60 or less in Cognitive Complexity — start with resolver.resolve (cognitive 176), cli_settings_completion._parse_request_words (cognitive 166), FlowLauncher._launch (cognitive 148). — 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 14 together lifts Cognitive Complexity from 2.0 to about 3.4/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

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

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

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

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

44 god class(es) detected.

FileTooLong: _internal/design.py · ×40src/xeda/_internal/design.py
TooManyMethods: FlowLauncher · ×4src/xeda/_internal/flow_runner/default_runner.py:441

What to do

  1. Resolve the 40 FileTooLong finding(s) in God Classes — start with REDACTED (5), design.py, default_runner.py. — One of this dimension's main actionable groups (40 warning-level).
  2. Resolve the 4 TooManyMethods finding(s) in God Classes — start with default_runner.py, REDACTED, design.py. — One of this dimension's main actionable groups (4 warning-level).

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

D4 · Code Duplication9.5 / 10Stronggated by 61 serious findings✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

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

24 duplicated block group(s) detected. 1.2 % of the production lines (1,235 of 104,834) are in a reported copy. A further 37 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 15 of the 61 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.

Edited copy of a member (10 corresponding lines) · ×5src/xeda/_internal/flows/ghdl/__init__.py:586
Edited copy of a member (8 corresponding lines) · ×4src/xeda/_internal/flow_runner/run_lock.py:261
Edited copy of a member (5 corresponding lines) · ×4src/xeda/_internal/flow_runner/resolver.py:170
Duplicated block (6 lines × 2) · ×4src/xeda/_internal/flow_runner/outputs.py:148
Edited copy of a member (4 corresponding lines) · ×3src/xeda/_internal/flow_runner/trace_inputs.py:459

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

What to do

  1. Resolve the 5 Edited copy of a member (10 corresponding lines) finding(s) in Code Duplication — start with REDACTED, place_pdn.py, pdk_cli.py. — One of this dimension's main actionable groups (5 warning-level).
  2. Resolve the 4 Edited copy of a member (8 corresponding lines) finding(s) in Code Duplication — start with run_lock.py, metrics.py, fetch.py. — One of this dimension's main actionable groups (4 warning-level).
  3. Resolve the 4 Edited copy of a member (5 corresponding lines) finding(s) in Code Duplication — start with resolver.py, local_settings.py, dataclass.py. — One of this dimension's main actionable groups (4 warning-level).

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

D6 · Cohesion (LCOM4)9.9 / 10Stronggated by 1 serious finding✓ Tool-verified

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.

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

1 of 119 classes have LCOM4 above 3.

Low cohesion: OpenroadStage (LCOM4 4)src/xeda/_internal/flows/openroad/base.py:332

What to do

  1. Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with base.py. — One of this dimension's main actionable groups (1 warning-level).

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

D13 · REDACTED Scanning5.0 / 10Adequate✓ Tool-verified

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

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

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

1 secret(s) detected.

REDACTED

What to do

  1. Resolve the 1 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).

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

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

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

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

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

0 of 8 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 3 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (5 reached that way). Requirements it states ONLY under an extra, a PEP 735 dependency group, a Poetry dev group or a dev-named requirements file are excluded: pip does not install any of them for a consumer. ★ This repository commits no dependency lockfile that this pass reads, so each licence is the one PyPI publishes for the distribution's CURRENT release rather than for a pinned version. 1 of them publish no licence on PyPI this pass can read; that is missing data, not a violation, and none of them is charged. This repository publishes itself under Apache-2.0, which is its own choice and is not judged here.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.5 / 10Stronggated by 47 serious findings✓ Tool-verified

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

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

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

Top hotspots: src/xeda/_internal/flow_runner/default_runner.py (110×98=10780); src/xeda/_internal/flow_runner/resolver.py (42×85=3570); src/xeda/_internal/flow_runner/dse/dse_runner.py (37×58=2146)

Hotspot: src/xeda/_internal/flow_runner/default_runner.py · ×47src/xeda/_internal/flow_runner/default_runner.py:1611

What to do

  1. Resolve the 47 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED (6), sim_evidence.py (4), default_runner.py. — One of this dimension's main actionable groups (47 warning-level).

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

D17 · Explicit Debt10.0 / 10Stronggated by 17 serious findings✓ Tool-verified

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

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

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

17 deducted task-comment markers across 104834 LoC (0.0/KLoC) → score 10.0. 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 · ×17REDACTED:368

What to do

  1. Resolve the 17 TodoComment finding(s) in Explicit Debt — start with REDACTED (7), REDACTED, REDACTED. — One of this dimension's main actionable groups (17 warning-level).

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

D19 · Documentation Quality10.0 / 10Exemplary○ Nothing flagged

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.

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

1 of 1 documentation facets pass in full. 23 document(s) read across 1 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

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.

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

No architecture decision records were found.

No ADRs foundREDACTED:73

What to do

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

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

D26 · Project Cohesion0.0 / 10Critical✓ Tool-verified

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

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

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

1 of 2 build units (Python) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesionREDACTED:1

What to do

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

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

D27 · Navigability9.9 / 10Exemplary✓ Tool-verified

What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.

Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.

Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.

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

73 % of calls cross a namespace and 1 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

D28 · Secrets (history)9.0 / 10Adequategated by 1 critical finding✓ Tool-verified

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

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

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

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

  1. Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. 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.

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

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

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

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

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

51 finding(s): 0 critical, 39 high, 10 medium, 2 low. 28 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.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 7 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED, REDACTED. — One of this dimension's main actionable groups (7 issue-level).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. No action in Static Analysis (SAST) — all 28 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 (28 issue-level, 0 of them charged here).

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

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

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir 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.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

D34 · Knowledge Freshness10.0 / 10Exemplary✓ Tool-verified

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

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

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

Every significant source file has living knowledge — recently and meaningfully worked. Counted over 170 of the 198 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

D35 · Change Coupling10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ Tool-verified

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

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

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

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

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  2. 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).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. 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.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

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

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

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

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

AX6 · Interface segregation10.0 / 10Exemplary✓ Tool-verified

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.

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

Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.

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

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation5.0 / 10Adequate✓ Tool-verified

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

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

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

What to do

  • Record 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.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

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

M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

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

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

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

  • `python -m tox -e mypy,black,ruff,consumer-typing` invokes black in the mode that REWRITES the files it reformats and exits 0 whatever it changed. The rewrite happens inside the runner's throwaway checkout and is then discarded, so the step passes on a badly-formatted change exactly as it passes on a clean one — it enforces nothing, and no other step in this file reads the result. `--check` is the flag that turns the same invocation into a gate: it leaves the files alone and exits non-zero when anything would have been reformatted. — REDACTED:333

What to do

  • Add `--check` to the black step in `REDACTED` so a change that is not formatted fails CI, instead of being silently reformatted into a checkout that is thrown away — or, if reformatting the branch is the intent, commit the result back so the fix reaches the repository.
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language'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.

P2 · Observability9.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

What to do

  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

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

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

  • The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release. — REDACTED:35

What to do

  • Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

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.

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.

X17 · Uncapped recursion over a caller-supplied document1.7 / 10Critical✓ Tool-verified

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.

  • `iter_artifact_paths` is public and takes `artifacts: Any` from its caller, and it calls itself at line 24 (`iter_artifact_paths`) with a piece of `artifacts` (and at line 27) — and nowhere in `iter_artifact_paths` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `iter_artifact_paths` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/artifacts.py:24
  • `map_artifact_paths` is public and takes `artifacts: Any` from its caller, and it calls itself at line 35 (`map_artifact_paths`) with a piece of `artifacts` (and at line 37, line 39) — and nowhere in `map_artifact_paths` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `map_artifact_paths` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/artifacts.py:35
  • `filter_artifact_paths` is public and takes `artifacts: Any` from its caller, and it calls itself at line 51 (`filter_artifact_paths`) with a piece of `artifacts` (and at line 58) — and nowhere in `filter_artifact_paths` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `filter_artifact_paths` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/artifacts.py:51
  • `escaped_names_atomic` is public and takes `value: Any` from its caller, and it calls itself at line 582 (`escaped_names_atomic`) with a piece of `value` (and at line 587) — and nowhere in `escaped_names_atomic` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `escaped_names_atomic` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/dataclass.py:582
  • `scalar_problems` is public and takes `annotation: Any` from its caller, and it calls itself at line 1464 (`scalar_problems`) with a piece of `annotation` (and at line 1469, line 1478, line 1514, line 1517, line 1525) — and nowhere in `scalar_problems` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `scalar_problems` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/dataclass.py:1464
  • `freeze` is public and takes `value: Any` from its caller, and it calls itself at line 59 (`freeze`) with a piece of `value` (and at line 61) — and nowhere in `freeze` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `freeze` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/frozen.py:59
  • `thaw` is public and takes `value: Any` from its caller, and it calls itself at line 68 (`thaw`) with a piece of `value` (and at line 70) — and nowhere in `thaw` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `thaw` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/frozen.py:68
  • `type_str` is public and takes `field_schema: Any` from its caller, and it calls itself at line 311 (`type_str`) with a piece of `field_schema` (and at line 332, line 347, line 350) — and nowhere in `type_str` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `type_str` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/introspect.py:311
  • `unit_of` is public, takes a document from its caller (line 357) and hands it to `collect`, which calls itself at line 368 (`collect`) with a piece of `node` (and at line 375) — and nowhere in `collect` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `collect` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/introspect.py:368
  • `location_free` is public and takes `value: Any` from its caller, and it calls itself at line 497 (`location_free`) with a piece of `value` (and at line 499) — and nowhere in `location_free` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `location_free` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:497
  • `json_key` is public and takes `key: Any` from its caller, and it calls itself at line 621 (`json_key`) with a piece of `key` — and nowhere in `json_key` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `json_key` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:621
  • `with_json_keys` is public and takes `value: Any` from its caller, and it calls itself at line 654 (`with_json_keys`) with a piece of `value` (and at line 657) — and nowhere in `with_json_keys` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `with_json_keys` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:654
  • `try_convert_to_primitives` is public and takes `s: Any` from its caller, and it calls itself at line 817 (`try_convert_to_primitives`) with a piece of `s` — and nowhere in `try_convert_to_primitives` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `try_convert_to_primitives` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:817
  • `set_hierarchy` is public, takes a document from its caller (line 836) and hands it to `_set_hierarchy`, which calls itself at line 897 (`_set_hierarchy`) with a piece of `dct` (and at line 907) — and nowhere in `_set_hierarchy` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_set_hierarchy` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:897
  • `semantic_hash` is public, takes a document from its caller (line 1545) and hands it to `_sorted_dict_str`, which calls itself at line 1548 (`_sorted_dict_str`) with a piece of `data` (and at line 1550) — and nowhere in `_sorted_dict_str` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_sorted_dict_str` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:1548
  • `translate_paths` is public and takes `document: Any` from its caller, and it calls itself at line 364 (`translate_paths`) with a piece of `document` (and at line 366) — and nowhere in `translate_paths` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `translate_paths` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/remote/fetch.py:364
  • `flatten_leaves` is public, takes a document from its caller (line 478) and hands it to `walk`, which calls itself at line 490 (`walk`) with a piece of `table` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/platforms/model.py:490
  • `to_micrometers` is public and takes `length: Any` from its caller, and it calls itself at line 208 (`to_micrometers`) with a piece of `length` — and nowhere in `to_micrometers` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `to_micrometers` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/flows/openroad/base.py:208
  • `split_bindings` is public, takes a document from its caller (line 125) and hands it to `_freeze`, which calls itself at line 119 (`_freeze`) with a piece of `value` (and at line 121) — and nowhere in `_freeze` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_freeze` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/flow_runner/bindings.py:119
  • `anchored_sections` is public, takes a document from its caller (line 96) and hands it to `_members`, which calls itself at line 38 (`_members`) with a piece of `annotation` — and nowhere in `_members` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_members` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/flow_runner/layer_paths.py:38
  • `anchored_sections` is public, takes a document from its caller (line 96) and hands it to `_anchor`, which calls itself at line 62 (`_anchor`) with a piece of `annotation` (and at line 70) — and nowhere in `_anchor` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_anchor` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/flow_runner/layer_paths.py:62
  • `resolve` is public, takes a document from its caller (line 1059) and hands it to `_explicit`, which calls itself at line 362 (`_explicit`) with a piece of `value` (and at line 368, line 376, line 378) — and nowhere in `_explicit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_explicit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/flow_runner/resolver.py:362
  • `settings_difference` is public, takes a document from its caller (line 534) and hands it to `_flatten`, which calls itself at line 529 (`_flatten`) with a piece of `value` — and nowhere in `_flatten` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_flatten` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/flow_runner/trace.py:529
  • `map_keyed_path_leaves` is public, takes a document from its caller (line 261) and hands it to `_annotation_matches_value`, which calls itself at line 194 (`_annotation_matches_value`) with a piece of `annotation` (and at line 196, line 213, line 215) — and nowhere in `_annotation_matches_value` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_annotation_matches_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:194
  • `map_keyed_path_leaves` is public and takes `annotation: Any` from its caller, and it calls itself at line 272 (`map_keyed_path_leaves`) with a piece of `annotation` (and at line 280, line 285, line 295, line 302, line 303) — and nowhere in `map_keyed_path_leaves` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `map_keyed_path_leaves` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:272
  • `non_finite_in` is public and takes `value: Any` from its caller, and it calls itself at line 118 (`non_finite_in`) with a piece of `value` (and at line 123) — and nowhere in `non_finite_in` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `non_finite_in` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/xeda/_internal/flow/metrics.py:118

What to do

  • Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

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.

X23 · Unguarded diagnostic materialisation5.7 / 10Adequate✓ Tool-verified

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.

  • `debug` at line 569 is called with an argument built by `"…".join(sorted(environ))` (line 569), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — REDACTED:569
  • `debug` at line 759 is called with an argument built by `"…".join(args)` (line 759), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — src/xeda/_internal/flows/openfpgaloader.py:759
  • `debug` at line 1123 is called with an argument built by `"…".join(str(s) for s in xdc_files)` (line 1123), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — src/xeda/_internal/flows/vivado/vivado_synth.py:1123
  • `debug` at line 1124 is called with an argument built by `"…".join(str(s) for s in tcl_files)` (line 1124), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — src/xeda/_internal/flows/vivado/vivado_synth.py:1124
  • `debug` at line 81 is called with an argument built by `"…".join(splitted[: i])` (line 81), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — src/xeda/_internal/flows/dc/__init__.py:81
  • `debug` at line 567 is called with an argument built by `"…".join(sorted(clocks))` (line 571), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — src/xeda/_internal/flows/dc/__init__.py:567
  • `debug` at line 118 is called with an argument built by `"…".join(sorted(late))` (line 118), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — src/xeda/_internal/flow_runner/launch_locks.py:118
  • `debug` at line 983 is called with an argument built by `{ k : optimizer.best.results.get(k) for k in results_sub }` (line 985), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — src/xeda/_internal/flow_runner/dse/dse_runner.py:983

What to do

  • In Python, put the construction behind the logger's own check (`if logger.isEnabledFor(logging.DEBUG):`), or pass the collection itself with a `%s` placeholder (`logger.debug("Items %s", items)`) so the logging module renders it only when the record is emitted. The placeholder alone is not the fix when the argument is still built first: it defers the formatting, not a `json.dumps`, a `join` or a comprehension in the argument, and an f-string defers nothing at all.
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.

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

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.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

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.

X3 · Exception handling7.9 / 10Strong✓ Tool-verified

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.

  • `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×3) — src/xeda/_internal/cli_settings_completion.py:330, src/xeda/_internal/outcomes.py:307, REDACTED:783
  • `except BaseException` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — src/xeda/_internal/remote/agent.py:350

What to do

  • Swallowed exception (caught, then discarded)
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.

X4 · Structured logging7.5 / 10Strong✓ Tool-verified

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.

  • `info` at line 2316 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — src/xeda/_internal/design.py:2316
  • `debug` at line 450 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. — src/xeda/_internal/tool.py:450
  • `debug` at line 495 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. — src/xeda/_internal/tool.py:495
  • `error` at line 553 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. — src/xeda/_internal/flows/vcs.py:553
  • `error` at line 564 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. — src/xeda/_internal/flows/vcs.py:564
  • `debug` at line 81 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. — src/xeda/_internal/flows/dc/__init__.py:81
  • `info` at line 981 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — src/xeda/_internal/flow_runner/dse/dse_runner.py:981

What to do

  • Interpolated log message defeats structured logging

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.

LensScoreRatingImpact
Code Health74.5Adequate — gated by D2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture90.6Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity76.5StrongSolid.
Readiness73.8StrongSolid.
Security49.6Weak — gated by D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance100.0ExemplaryStrongest area.
Unscored — 3 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.

  • X10 Duplicated predicate — 37 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X6 Hand-rolled structured-format parsing — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 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.

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 65 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 (4 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC2 Forms & labels — Frontend below the scale floor (4 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC3 Page structure — Frontend below the scale floor (4 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC4 Keyboard semantics — Frontend below the scale floor (4 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC5 ARIA correctness — Frontend below the scale floor (4 DOM element(s) < 25) — too little surface to assess accessibility.
  • AC6 Visual & motion safety — Frontend below the scale floor (4 DOM element(s) < 25) — too little surface to assess accessibility.
  • AX1 Captive dependencies — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX2 Stateful singletons — 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.
  • 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
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXB2 Runtime readiness — 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 — No access-control surface detected in the analyzed source — this repository registers no route and starts no server another machine can reach (no Flask/FastAPI/Starlette route, Django urlpatterns or class-based view, Tornado handler). Access control is therefore N/A here — a library or command-line tool is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or MongoEngine model, a migration or a SQL schema — and no database or data-store client (Django ORM, SQLAlchemy, psycopg, PyMongo, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D10 Test Quality — ~178165 lines of test source are present (.py) 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 .py suite was found but not re-run
  • D12 Dependency Hygiene — Dependency currency not established — no declaration carries an exact pin to grade
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • 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 — D21 withholds its sibling role token rows: 3 candidate(s) found and not reported.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • 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, 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
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • 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.
  • D5 Coupling — Not applicable — this Python build ships 1 production module(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production modules are not part of the shipped graph.)
  • 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 measured — Python suite
  • DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 186 value object(s); 1 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • 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
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Python 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 — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, 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 scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • 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.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X2 Cancellation propagation — no C# was loaded; this repository's Python was read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 41 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 3 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D13 · REDACTED Scanning · Leaked secret · ×1
  • REDACTED
D28 · Secrets (history) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 595 finding(s)
D15 · Churn × Complexity Hotspots · Hotspot · ×47
  • Hotspot: src/xeda/_internal/flow_runner/default_runner.py src/xeda/_internal/flow_runner/default_runner.py:1611 — src/xeda/_internal/flow_runner/default_runner.py changed 110 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in FlowLauncher._launch at line 1611. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/default_runner.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow_runner/resolver.py src/xeda/_internal/flow_runner/resolver.py:1059 — src/xeda/_internal/flow_runner/resolver.py changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in resolver.resolve at line 1059. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/resolver.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow_runner/dse/dse_runner.py src/xeda/_internal/flow_runner/dse/dse_runner.py:615 — src/xeda/_internal/flow_runner/dse/dse_runner.py changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in Dse.run_flow at line 615. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/dse/dse_runner.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:261 — REDACTED changed 100 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in flow.map_keyed_path_leaves at line 261. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flows/verilator/__init__.py src/xeda/_internal/flows/verilator/__init__.py:585 — src/xeda/_internal/flows/verilator/__init__.py changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in Verilator.run at line 585. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flows/verilator/__init__.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flows/bsc/__init__.py src/xeda/_internal/flows/bsc/__init__.py:1697 — src/xeda/_internal/flows/bsc/__init__.py changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in BscSim.run at line 1697. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flows/bsc/__init__.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flows/yosys/yosys_fpga.py src/xeda/_internal/flows/yosys/yosys_fpga.py:652 — src/xeda/_internal/flows/yosys/yosys_fpga.py changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Settings.synth_command at line 652. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flows/yosys/yosys_fpga.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow/sim.py src/xeda/_internal/flow/sim.py:223 — src/xeda/_internal/flow/sim.py changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in sim.judge_evidence at line 223. 1 of those changes was a fix/bug commit, and the other 37 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow/sim.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flows/yosys/yosys.py src/xeda/_internal/flows/yosys/yosys.py:818 — src/xeda/_internal/flows/yosys/yosys.py changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Yosys.asic_values at line 818. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flows/yosys/yosys.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow_runner/settings_layers.py src/xeda/_internal/flow_runner/settings_layers.py:326 — src/xeda/_internal/flow_runner/settings_layers.py changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in settings_layers._merge_settings_layer at line 326. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/settings_layers.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow_runner/trace.py src/xeda/_internal/flow_runner/trace.py:590 — src/xeda/_internal/flow_runner/trace.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in trace.check_trace at line 590. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/trace.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/proc_utils.py src/xeda/_internal/proc_utils.py:795 — src/xeda/_internal/proc_utils.py changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in proc_utils._run_copying at line 795. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/proc_utils.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow_runner/plan_freshness.py src/xeda/_internal/flow_runner/plan_freshness.py:322 — src/xeda/_internal/flow_runner/plan_freshness.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in plan_freshness.judge_node at line 322. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/plan_freshness.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow_runner/trace_inputs.py src/xeda/_internal/flow_runner/trace_inputs.py:968 — src/xeda/_internal/flow_runner/trace_inputs.py changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in trace_inputs.build_trace at line 968. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/trace_inputs.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/deliver.py src/xeda/_internal/deliver.py:1404 — src/xeda/_internal/deliver.py changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Deliveries.deliver at line 1404. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/deliver.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:492 — REDACTED changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Cocotb.env at line 492. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: tools/api_baseline.py tools/api_baseline.py:1470 — tools/api_baseline.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in api_baseline._classify_contract at line 1470. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- tools/api_baseline.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/cli.py src/xeda/_internal/cli.py:1191 — src/xeda/_internal/cli.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in cli.run at line 1191. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/cli.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flows/nvc/__init__.py src/xeda/_internal/flows/nvc/__init__.py:465 — src/xeda/_internal/flows/nvc/__init__.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Nvc.execute at line 465. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flows/nvc/__init__.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow_runner/bindings.py src/xeda/_internal/flow_runner/bindings.py:295 — src/xeda/_internal/flow_runner/bindings.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in bindings.node_bindings at line 295. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/bindings.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow_runner/launch_run.py src/xeda/_internal/flow_runner/launch_run.py:125 — src/xeda/_internal/flow_runner/launch_run.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in launch_run.execute at line 125. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/launch_run.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow_runner/outputs.py src/xeda/_internal/flow_runner/outputs.py:106 — src/xeda/_internal/flow_runner/outputs.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in outputs.record_outputs at line 106. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/outputs.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow/fpga.py src/xeda/_internal/flow/fpga.py:68 — src/xeda/_internal/flow/fpga.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in FPGA._fpga_root_validator at line 68. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow/fpga.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/flow_runner/error_codes.py src/xeda/_internal/flow_runner/error_codes.py:385 — src/xeda/_internal/flow_runner/error_codes.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in error_codes._settings_error at line 385. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/flow_runner/error_codes.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/xeda/_internal/agent_skill.py src/xeda/_internal/agent_skill.py:96 — src/xeda/_internal/agent_skill.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in agent_skill._flow_section at line 96. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 08:26:55 -05:00' --until='2026-11-16 08:26:55 -05:00' --full-history --no-merges -- src/xeda/_internal/agent_skill.py`: 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.
  • + 22 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×40
  • FileTooLong: _internal/design.py src/xeda/_internal/design.py — FileTooLong — 3050 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2550 over it, 6.10× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: flow_runner/default_runner.py src/xeda/_internal/flow_runner/default_runner.py — FileTooLong — 2567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2067 over it, 5.13× 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: openroad/place_groups.py src/xeda/_internal/flows/openroad/place_groups.py — FileTooLong — 1732 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1232 over it, 3.46× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: bsc/__init__.py src/xeda/_internal/flows/bsc/__init__.py — FileTooLong — 1425 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 925 over it, 2.85× 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: remote/agent.py src/xeda/_internal/remote/agent.py — FileTooLong — 1321 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 821 over it, 2.64× 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: REDACTED REDACTED — FileTooLong — 1236 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 736 over it, 2.47× 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: _internal/cli.py src/xeda/_internal/cli.py — FileTooLong — 1234 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 734 over it, 2.47× 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: flow_runner/resolver.py src/xeda/_internal/flow_runner/resolver.py — FileTooLong — 1218 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 718 over it, 2.44× 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: REDACTED REDACTED — FileTooLong — 1120 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 620 over it, 2.24× 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: _internal/sweep.py src/xeda/_internal/sweep.py — FileTooLong — 986 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 486 over it, 1.97× 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: _internal/records.py src/xeda/_internal/records.py — FileTooLong — 960 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 460 over it, 1.92× 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: _internal/deliver.py src/xeda/_internal/deliver.py — FileTooLong — 909 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 409 over it, 1.82× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: yosys/yosys_fpga.py src/xeda/_internal/flows/yosys/yosys_fpga.py — FileTooLong — 903 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 403 over it, 1.81× 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: _internal/introspect.py src/xeda/_internal/introspect.py — FileTooLong — 875 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 375 over it, 1.75× 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: _internal/proc_utils.py src/xeda/_internal/proc_utils.py — FileTooLong — 857 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 357 over it, 1.71× 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: sby/__init__.py src/xeda/_internal/flows/sby/__init__.py — FileTooLong — 849 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 349 over it, 1.70× 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: _internal/dataclass.py src/xeda/_internal/dataclass.py — FileTooLong — 844 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 344 over it, 1.69× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: vivado/vivado_synth.py src/xeda/_internal/flows/vivado/vivado_synth.py — FileTooLong — 824 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 324 over it, 1.65× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 805 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 305 over it, 1.61× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: _internal/units.py src/xeda/_internal/units.py — FileTooLong — 741 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 241 over it, 1.48× 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: yosys/yosys.py src/xeda/_internal/flows/yosys/yosys.py — FileTooLong — 719 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 219 over it, 1.44× 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: yosys/asic_groups.py src/xeda/_internal/flows/yosys/asic_groups.py — FileTooLong — 717 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 217 over it, 1.43× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: _internal/tool.py src/xeda/_internal/tool.py — FileTooLong — 717 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 217 over it, 1.43× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: dse/dse_runner.py src/xeda/_internal/flow_runner/dse/dse_runner.py — FileTooLong — 712 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 212 over it, 1.42× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: flow_runner/chains.py src/xeda/_internal/flow_runner/chains.py — FileTooLong — 699 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 199 over it, 1.40× 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.
  • + 15 more in this group — see findings.md.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×26
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/artifacts.py:24 — `iter_artifact_paths` is public and takes `artifacts: Any` from its caller, and it calls itself at line 24 (`iter_artifact_paths`) with a piece of `artifacts` (and at line 27) — and nowhere in `iter_artifact_paths` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `iter_artifact_paths` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/artifacts.py:35 — `map_artifact_paths` is public and takes `artifacts: Any` from its caller, and it calls itself at line 35 (`map_artifact_paths`) with a piece of `artifacts` (and at line 37, line 39) — and nowhere in `map_artifact_paths` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `map_artifact_paths` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/artifacts.py:51 — `filter_artifact_paths` is public and takes `artifacts: Any` from its caller, and it calls itself at line 51 (`filter_artifact_paths`) with a piece of `artifacts` (and at line 58) — and nowhere in `filter_artifact_paths` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `filter_artifact_paths` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/dataclass.py:582 — `escaped_names_atomic` is public and takes `value: Any` from its caller, and it calls itself at line 582 (`escaped_names_atomic`) with a piece of `value` (and at line 587) — and nowhere in `escaped_names_atomic` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `escaped_names_atomic` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/dataclass.py:1464 — `scalar_problems` is public and takes `annotation: Any` from its caller, and it calls itself at line 1464 (`scalar_problems`) with a piece of `annotation` (and at line 1469, line 1478, line 1514, line 1517, line 1525) — and nowhere in `scalar_problems` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `scalar_problems` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/frozen.py:59 — `freeze` is public and takes `value: Any` from its caller, and it calls itself at line 59 (`freeze`) with a piece of `value` (and at line 61) — and nowhere in `freeze` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `freeze` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/frozen.py:68 — `thaw` is public and takes `value: Any` from its caller, and it calls itself at line 68 (`thaw`) with a piece of `value` (and at line 70) — and nowhere in `thaw` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `thaw` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/introspect.py:311 — `type_str` is public and takes `field_schema: Any` from its caller, and it calls itself at line 311 (`type_str`) with a piece of `field_schema` (and at line 332, line 347, line 350) — and nowhere in `type_str` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `type_str` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/introspect.py:368 — `unit_of` is public, takes a document from its caller (line 357) and hands it to `collect`, which calls itself at line 368 (`collect`) with a piece of `node` (and at line 375) — and nowhere in `collect` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `collect` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap REDACTED:497 — `location_free` is public and takes `value: Any` from its caller, and it calls itself at line 497 (`location_free`) with a piece of `value` (and at line 499) — and nowhere in `location_free` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `location_free` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap REDACTED:621 — `json_key` is public and takes `key: Any` from its caller, and it calls itself at line 621 (`json_key`) with a piece of `key` — and nowhere in `json_key` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `json_key` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap REDACTED:654 — `with_json_keys` is public and takes `value: Any` from its caller, and it calls itself at line 654 (`with_json_keys`) with a piece of `value` (and at line 657) — and nowhere in `with_json_keys` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `with_json_keys` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap REDACTED:817 — `try_convert_to_primitives` is public and takes `s: Any` from its caller, and it calls itself at line 817 (`try_convert_to_primitives`) with a piece of `s` — and nowhere in `try_convert_to_primitives` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `try_convert_to_primitives` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap REDACTED:897 — `set_hierarchy` is public, takes a document from its caller (line 836) and hands it to `_set_hierarchy`, which calls itself at line 897 (`_set_hierarchy`) with a piece of `dct` (and at line 907) — and nowhere in `_set_hierarchy` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_set_hierarchy` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap REDACTED:1548 — `semantic_hash` is public, takes a document from its caller (line 1545) and hands it to `_sorted_dict_str`, which calls itself at line 1548 (`_sorted_dict_str`) with a piece of `data` (and at line 1550) — and nowhere in `_sorted_dict_str` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_sorted_dict_str` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/remote/fetch.py:364 — `translate_paths` is public and takes `document: Any` from its caller, and it calls itself at line 364 (`translate_paths`) with a piece of `document` (and at line 366) — and nowhere in `translate_paths` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `translate_paths` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/platforms/model.py:490 — `flatten_leaves` is public, takes a document from its caller (line 478) and hands it to `walk`, which calls itself at line 490 (`walk`) with a piece of `table` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/flows/openroad/base.py:208 — `to_micrometers` is public and takes `length: Any` from its caller, and it calls itself at line 208 (`to_micrometers`) with a piece of `length` — and nowhere in `to_micrometers` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `to_micrometers` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/flow_runner/bindings.py:119 — `split_bindings` is public, takes a document from its caller (line 125) and hands it to `_freeze`, which calls itself at line 119 (`_freeze`) with a piece of `value` (and at line 121) — and nowhere in `_freeze` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_freeze` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/flow_runner/layer_paths.py:38 — `anchored_sections` is public, takes a document from its caller (line 96) and hands it to `_members`, which calls itself at line 38 (`_members`) with a piece of `annotation` — and nowhere in `_members` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_members` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/flow_runner/layer_paths.py:62 — `anchored_sections` is public, takes a document from its caller (line 96) and hands it to `_anchor`, which calls itself at line 62 (`_anchor`) with a piece of `annotation` (and at line 70) — and nowhere in `_anchor` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_anchor` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/flow_runner/resolver.py:362 — `resolve` is public, takes a document from its caller (line 1059) and hands it to `_explicit`, which calls itself at line 362 (`_explicit`) with a piece of `value` (and at line 368, line 376, line 378) — and nowhere in `_explicit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_explicit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/xeda/_internal/flow_runner/trace.py:529 — `settings_difference` is public, takes a document from its caller (line 534) and hands it to `_flatten`, which calls itself at line 529 (`_flatten`) with a piece of `value` — and nowhere in `_flatten` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_flatten` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap REDACTED:194 — `map_keyed_path_leaves` is public, takes a document from its caller (line 261) and hands it to `_annotation_matches_value`, which calls itself at line 194 (`_annotation_matches_value`) with a piece of `annotation` (and at line 196, line 213, line 215) — and nowhere in `_annotation_matches_value` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_annotation_matches_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap REDACTED:272 — `map_keyed_path_leaves` is public and takes `annotation: Any` from its caller, and it calls itself at line 272 (`map_keyed_path_leaves`) with a piece of `annotation` (and at line 280, line 285, line 295, line 302, line 303) — and nowhere in `map_keyed_path_leaves` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `map_keyed_path_leaves` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • + 1 more in this group — see findings.md.
D17 · Explicit Debt · TodoComment · ×17
  • TodoComment REDACTED:368 — # TODO windows? — 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 REDACTED:1529 — # TODO fix debug and verbosity levels! — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/xeda/_internal/flows/yosys/cxx_rtl.py:200 — # TODO where should this go? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/xeda/_internal/flows/yosys/yosys.py:938 — # TODO factor out common code — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/xeda/_internal/flows/vivado/vivado_alt_synth.py:281 — # TODO: verify with a post-implementation timing simulation. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/xeda/_internal/flows/vivado/vivado_sim.py:52 — # TODO: Vivado can run several configurations (test vectors) in one run through `run_configs`. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/xeda/_internal/flows/vivado/vivado_synth.py:297 — # TODO add alternative methods for adding multiple user hooks? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/xeda/_internal/flows/nvc/__init__.py:503 — # TODO factor out cocotb 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.
  • TodoComment src/xeda/_internal/flows/ghdl/__init__.py:756 — # TODO factor out cocotb 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.
  • TodoComment src/xeda/_internal/flows/modelsim/__init__.py:110 — # TODO: check whether library paths work. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/xeda/_internal/flows/ghdl/__init__.py:583 — # TODO workdir? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/xeda/_internal/flows/ghdl/__init__.py:660 — # TODO: check the GNAT version too? The LLVM limit is a guess. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/xeda/_internal/flows/ghdl/__init__.py:730 — # TODO move to validation — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment src/xeda/_internal/flows/diamond/__init__.py:186 — # The `.mrp` file can have page breaks anywhere (TODO: check for other kinds of break), so — 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 REDACTED:1518 — # TODO better/cleaner way — 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 examples/vhdl/sqrt/tb_sqrt.py:41 — # TODO make sure ranges are within G_IN_WIDTH bits — 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 examples/vhdl/Trivium/trivium_tb.py:98 — # TODO init/set other signals? — 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.
D29 · Static Analysis (SAST) · REDACTED · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×5
  • Edited copy of a member (10 corresponding lines) src/xeda/_internal/flows/ghdl/__init__.py:586 — src/xeda/_internal/flows/ghdl/__init__.py:586-595 | src/xeda/_internal/flows/nvc/__init__.py:228-244 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) src/xeda/_internal/flows/openroad/place_pdn.py:275 — src/xeda/_internal/flows/openroad/place_pdn.py:275-284 | src/xeda/_internal/flows/openroad/place_pdn.py:288-297 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) src/xeda/_internal/pdk_cli.py:71 — src/xeda/_internal/pdk_cli.py:71-80 | src/xeda/_internal/tools_cli.py:58-67 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) src/xeda/_internal/outcomes.py:331 — src/xeda/_internal/outcomes.py:331-340 | src/xeda/_internal/plan.py:221-236 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) src/xeda/_internal/design.py:1692 — src/xeda/_internal/design.py:1692-1702 | src/xeda/_internal/flow_runner/launch_generation.py:192-201 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D29 · Static Analysis (SAST) · REDACTED · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D3 · God Classes · TooManyMethods · ×4
  • TooManyMethods: FlowLauncher src/xeda/_internal/flow_runner/default_runner.py:441 — TooManyMethods — 63 methods. The bar is 30 methods; this is 33 over it, 2.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.
  • TooManyMethods: Flow REDACTED:765 — TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× 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: Design src/xeda/_internal/design.py:3351 — TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Nextpnr REDACTED:288 — TooManyMethods — 38 methods. The bar is 30 methods; this is 8 over it, 1.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication · Edited copy of a member (8 corresponding lines) · ×4
  • Edited copy of a member (8 corresponding lines) src/xeda/_internal/flow_runner/run_lock.py:261 — src/xeda/_internal/flow_runner/run_lock.py:261-269 | src/xeda/_internal/flow_runner/run_lock.py:485-492 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) src/xeda/_internal/flows/openroad/metrics.py:47 — src/xeda/_internal/flows/openroad/metrics.py:47-54 | src/xeda/_internal/flows/openroad/metrics.py:58-71 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) src/xeda/_internal/remote/fetch.py:357 — src/xeda/_internal/remote/fetch.py:357-367 | src/xeda/_internal/spec.py:26-33 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) src/xeda/_internal/flows/vivado/vivado_synth.py:82 — src/xeda/_internal/flows/vivado/vivado_synth.py:82-89 | src/xeda/_internal/flows/yosys/common.py:1024-1032 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (5 corresponding lines) · ×4
  • Edited copy of a member (5 corresponding lines) src/xeda/_internal/flow_runner/resolver.py:170 — src/xeda/_internal/flow_runner/resolver.py:170-174 | src/xeda/_internal/frozen.py:53-62 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) src/xeda/_internal/local_settings.py:254 — src/xeda/_internal/local_settings.py:254-258 | src/xeda/_internal/project.py:271-275 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) src/xeda/_internal/dataclass.py:843 — src/xeda/_internal/dataclass.py:843-847 | src/xeda/_internal/units.py:1122-1127 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (5 corresponding lines) src/xeda/_internal/code_epoch.py:196 — src/xeda/_internal/code_epoch.py:196-200 | src/xeda/_internal/remote/environment.py:87-96 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×4
  • Duplicated block (6 lines × 2) src/xeda/_internal/flow_runner/outputs.py:148 — src/xeda/_internal/flow_runner/outputs.py:148-153 | src/xeda/_internal/flow_runner/outputs.py:217-222 — 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. 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 (6 lines × 2) REDACTED:1216 — REDACTED:1216-1225 | src/xeda/_internal/flow/settings_group.py:114-119 — 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. 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 (6 lines × 2) src/xeda/_internal/flow_runner/bindings.py:267 — src/xeda/_internal/flow_runner/bindings.py:267-272 | src/xeda/_internal/frozen.py:66-71 — 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. 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 (6 lines × 2) tools/asic_parity.py:1704 — tools/asic_parity.py:1704-1709 | tools/asic_parity.py:1761-1766 — 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.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×4
  • Swallowed exception (caught, then discarded) src/xeda/_internal/cli_settings_completion.py:330 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) src/xeda/_internal/outcomes.py:307 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:783 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) src/xeda/_internal/remote/agent.py:350 — `except BaseException` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D4 · Code Duplication · Edited copy of a member (4 corresponding lines) · ×3
  • Edited copy of a member (4 corresponding lines) src/xeda/_internal/flow_runner/trace_inputs.py:459 — src/xeda/_internal/flow_runner/trace_inputs.py:459-464 | src/xeda/_internal/records.py:532-535 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) src/xeda/_internal/dataclass.py:349 — src/xeda/_internal/dataclass.py:349-352 | src/xeda/_internal/setting_text.py:62-65 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (4 corresponding lines) src/xeda/_internal/flows/vivado/vivado_project.py:97 — src/xeda/_internal/flows/vivado/vivado_project.py:97-102 | src/xeda/_internal/flows/vivado/vivado_synth.py:1076-1079 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (19 corresponding lines) · ×2
  • Edited copy of a member (19 corresponding lines) src/xeda/_internal/dataclass.py:642 — src/xeda/_internal/dataclass.py:642-661 | REDACTED:476-494 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (19 corresponding lines) src/xeda/_internal/flow/metrics.py:299 — src/xeda/_internal/flow/metrics.py:299-317 | src/xeda/_internal/flow/metrics.py:391-412 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×2
  • Edited copy of a member (14 corresponding lines) src/xeda/_internal/cli.py:781 — src/xeda/_internal/cli.py:781-798 | src/xeda/_internal/remote/client.py:575-588 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (14 corresponding lines) src/xeda/_internal/flows/iverilog/__init__.py:385 — src/xeda/_internal/flows/iverilog/__init__.py:385-398 | src/xeda/_internal/flows/verilator/__init__.py:472-489 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×2
  • Edited copy of a member (11 corresponding lines) .github/scripts/bump_ci_pins.py:387 — .github/scripts/bump_ci_pins.py:387-397 | .github/scripts/bump_ci_pins.py:406-416 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) src/xeda/_internal/dataclass.py:573 — src/xeda/_internal/dataclass.py:573-588 | src/xeda/_internal/design.py:3194-3204 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×2
  • Edited copy of a member (15 corresponding lines) src/xeda/_internal/sweep.py:563 — src/xeda/_internal/sweep.py:563-579 | src/xeda/_internal/sweep.py:845-859 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (15 corresponding lines) examples/bluespec/ascon/tb/generate_vectors.py:99 — examples/bluespec/ascon/tb/generate_vectors.py:99-113 | examples/bluespec/ascon/tb/generate_vectors.py:117-131 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×2
  • Edited copy of a member (6 corresponding lines) src/xeda/_internal/flow_runner/trace.py:526 — src/xeda/_internal/flow_runner/trace.py:526-531 | tools/asic_parity.py:1302-1307 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (6 corresponding lines) examples/bluespec/uart_link/host/leanlink/fpga_model.py:499 — examples/bluespec/uart_link/host/leanlink/fpga_model.py:499-504 | examples/bluespec/uart_link/host/leanlink/fpga_model.py:507-514 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×2
  • Duplicated block (10 lines × 2) src/xeda/_internal/platforms/upstream.py:352 — src/xeda/_internal/platforms/upstream.py:352-361 | src/xeda/_internal/platforms/upstream.py:792-801 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) examples/bluespec/ascon/tb/generate_vectors.py:237 — examples/bluespec/ascon/tb/generate_vectors.py:237-246 | examples/bluespec/ascon/tb/generate_vectors.py:285-294 — 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 `examples/bluespec/ascon/tb/generate_vectors.py:237` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `examples/bluespec/ascon/tb/generate_vectors.py:295` calls `decrypt` and `examples/bluespec/ascon/tb/generate_vectors.py:247` 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.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×2
  • Duplicated block (5 lines × 2) src/xeda/_internal/flows/dc/__init__.py:712 — src/xeda/_internal/flows/dc/__init__.py:712-716 | src/xeda/_internal/flows/dc/__init__.py:720-728 — 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. 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 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 (5 lines × 2) examples/bluespec/uart_link/tb/lean_perf.py:210 — examples/bluespec/uart_link/tb/lean_perf.py:210-214 | examples/bluespec/uart_link/tb/lean_perf.py:274-278 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `examples/bluespec/uart_link/tb/lean_perf.py:210` 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.
D4 · Code Duplication · Duplicated block (8–9 lines × 2) · ×2
  • Duplicated block (8–9 lines × 2) examples/bluespec/uart_link/tb/lean_credit.py:139 — examples/bluespec/uart_link/tb/lean_credit.py:139-146 | examples/bluespec/uart_link/tb/lean_credit.py:151-159 — 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–9 lines × 2) examples/bluespec/uart_link/tb/lean_session.py:475 — examples/bluespec/uart_link/tb/lean_session.py:475-482 | examples/bluespec/uart_link/tb/lean_session.py:621-629 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×2
  • Duplicated block (7 lines × 2) examples/bluespec/uart_link/host/leanlink/codec.py:403 — examples/bluespec/uart_link/host/leanlink/codec.py:403-409 | examples/bluespec/uart_link/host/leanlink/codec.py:487-493 — 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. 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 (7 lines × 2) examples/bluespec/uart_link/tb/lean_perf.py:205 — examples/bluespec/uart_link/tb/lean_perf.py:205-211 | examples/bluespec/uart_link/tb/lean_perf.py:233-239 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D1 · Cyclomatic Complexity · FlowLauncher._launch (cyclomatic 98) · ×1
  • FlowLauncher._launch (cyclomatic 98) src/xeda/_internal/flow_runner/default_runner.py:1611 — FlowLauncher._launch has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · resolver.resolve (cyclomatic 85) · ×1
  • resolver.resolve (cyclomatic 85) src/xeda/_internal/flow_runner/resolver.py:1059 — resolver.resolve has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · cli_settings_completion._parse_request_words (cyclomatic 68) · ×1
  • cli_settings_completion._parse_request_words (cyclomatic 68) src/xeda/_internal/cli_settings_completion.py:140 — cli_settings_completion._parse_request_words has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FlowLauncher._request (cyclomatic 68) · ×1
  • FlowLauncher._request (cyclomatic 68) src/xeda/_internal/flow_runner/default_runner.py:3358 — FlowLauncher._request has cyclomatic complexity 68 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Vcs.run (cyclomatic 66) · ×1
  • Vcs.run (cyclomatic 66) src/xeda/_internal/flows/vcs.py:356 — Vcs.run has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Dse.run_flow (cyclomatic 58) · ×1
  • Dse.run_flow (cyclomatic 58) src/xeda/_internal/flow_runner/dse/dse_runner.py:615 — Dse.run_flow has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · trace.check_trace (cyclomatic 49) · ×1
  • trace.check_trace (cyclomatic 49) src/xeda/_internal/flow_runner/trace.py:590 — trace.check_trace has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Verilator.run (cyclomatic 46) · ×1
  • Verilator.run (cyclomatic 46) src/xeda/_internal/flows/verilator/__init__.py:585 — Verilator.run has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · sim_evidence.parse_xsim_evidence (cyclomatic 46) · ×1
  • sim_evidence.parse_xsim_evidence (cyclomatic 46) src/xeda/_internal/flows/vivado/sim_evidence.py:22 — sim_evidence.parse_xsim_evidence has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · cli.run (cyclomatic 43) · ×1
  • cli.run (cyclomatic 43) src/xeda/_internal/cli.py:1191 — cli.run has cyclomatic complexity 43 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · plan_freshness.judge_node (cyclomatic 43) · ×1
  • plan_freshness.judge_node (cyclomatic 43) src/xeda/_internal/flow_runner/plan_freshness.py:322 — plan_freshness.judge_node has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · sim_evidence.parse_modelsim_evidence (cyclomatic 43) · ×1
  • sim_evidence.parse_modelsim_evidence (cyclomatic 43) src/xeda/_internal/flows/modelsim/sim_evidence.py:20 — sim_evidence.parse_modelsim_evidence has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · dataclass.scalar_problems (cyclomatic 41) · ×1
  • dataclass.scalar_problems (cyclomatic 41) src/xeda/_internal/dataclass.py:1440 — dataclass.scalar_problems has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · vcs_evidence.parse_vcs_evidence (cyclomatic 41) · ×1
  • vcs_evidence.parse_vcs_evidence (cyclomatic 41) src/xeda/_internal/flows/vcs_evidence.py:69 — vcs_evidence.parse_vcs_evidence has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · sby.timing_problems (cyclomatic 38) · ×1
  • sby.timing_problems (cyclomatic 38) src/xeda/_internal/flows/sby/__init__.py:441 — sby.timing_problems has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · launch_run.execute (cyclomatic 36) · ×1
  • launch_run.execute (cyclomatic 36) src/xeda/_internal/flow_runner/launch_run.py:125 — launch_run.execute has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Nextpnr.run (cyclomatic 36) · ×1
  • Nextpnr.run (cyclomatic 36) REDACTED:1193 — Nextpnr.run has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · design.generated_declarations (cyclomatic 34) · ×1
  • design.generated_declarations (cyclomatic 34) src/xeda/_internal/design.py:1575 — design.generated_declarations has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · resolver._normalized_leaves (cyclomatic 34) · ×1
  • resolver._normalized_leaves (cyclomatic 34) src/xeda/_internal/flow_runner/resolver.py:576 — resolver._normalized_leaves has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Openfpgaloader._probe_arguments (cyclomatic 34) · ×1
  • Openfpgaloader._probe_arguments (cyclomatic 34) src/xeda/_internal/flows/openfpgaloader.py:762 — Openfpgaloader._probe_arguments has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · BscSim.run (cyclomatic 33) · ×1
  • BscSim.run (cyclomatic 33) src/xeda/_internal/flows/bsc/__init__.py:1697 — BscSim.run has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Settings.pass_flag_conflicts (cyclomatic 33) · ×1
  • Settings.pass_flag_conflicts (cyclomatic 33) src/xeda/_internal/flows/yosys/yosys_fpga.py:557 — Settings.pass_flag_conflicts has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · sim.judge_evidence (cyclomatic 31) · ×1
  • sim.judge_evidence (cyclomatic 31) src/xeda/_internal/flow/sim.py:223 — sim.judge_evidence has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Yosys.asic_values (cyclomatic 31) · ×1
  • Yosys.asic_values (cyclomatic 31) src/xeda/_internal/flows/yosys/yosys.py:818 — Yosys.asic_values has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · launch_generation.settle (cyclomatic 30) · ×1
  • launch_generation.settle (cyclomatic 30) src/xeda/_internal/flow_runner/launch_generation.py:507 — launch_generation.settle has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · upstream.read_orfs_config_mk (cyclomatic 30) · ×1
  • upstream.read_orfs_config_mk (cyclomatic 30) src/xeda/_internal/platforms/upstream.py:830 — upstream.read_orfs_config_mk has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · settings_layers._merge_settings_layer (cyclomatic 29) · ×1
  • settings_layers._merge_settings_layer (cyclomatic 29) src/xeda/_internal/flow_runner/settings_layers.py:326 — settings_layers._merge_settings_layer has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GhdlSim.run (cyclomatic 29) · ×1
  • GhdlSim.run (cyclomatic 29) src/xeda/_internal/flows/ghdl/__init__.py:687 — GhdlSim.run has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · OpenroadPlace.check_settings_supported (cyclomatic 29) · ×1
  • OpenroadPlace.check_settings_supported (cyclomatic 29) src/xeda/_internal/flows/openroad/place.py:480 — OpenroadPlace.check_settings_supported has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · cli_utils.print_results (cyclomatic 28) · ×1
  • cli_utils.print_results (cyclomatic 28) src/xeda/_internal/cli_utils.py:607 — cli_utils.print_results has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Nextpnr.target_for_settings (cyclomatic 28) · ×1
  • Nextpnr.target_for_settings (cyclomatic 28) REDACTED:1105 — Nextpnr.target_for_settings has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Settings.synth_command (cyclomatic 28) · ×1
  • Settings.synth_command (cyclomatic 28) src/xeda/_internal/flows/yosys/yosys_fpga.py:652 — Settings.synth_command has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Design._target_overlay (cyclomatic 27) · ×1
  • Design._target_overlay (cyclomatic 27) src/xeda/_internal/design.py:3688 — Design._target_overlay has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · settings_group._declaration_problems (cyclomatic 27) · ×1
  • settings_group._declaration_problems (cyclomatic 27) src/xeda/_internal/flow/settings_group.py:212 — settings_group._declaration_problems has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proc_utils._run_copying (cyclomatic 27) · ×1
  • proc_utils._run_copying (cyclomatic 27) src/xeda/_internal/proc_utils.py:795 — proc_utils._run_copying has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · sim_evidence.parse_nvc_log (cyclomatic 26) · ×1
  • sim_evidence.parse_nvc_log (cyclomatic 26) src/xeda/_internal/flow/sim_evidence.py:138 — sim_evidence.parse_nvc_log has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · outputs.record_outputs (cyclomatic 26) · ×1
  • outputs.record_outputs (cyclomatic 26) src/xeda/_internal/flow_runner/outputs.py:106 — outputs.record_outputs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · nextpnr_constraints._commands (cyclomatic 26) · ×1
  • nextpnr_constraints._commands (cyclomatic 26) src/xeda/_internal/flows/nextpnr_constraints.py:70 — nextpnr_constraints._commands has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · def2stream.merge_gds (cyclomatic 26) · ×1
  • def2stream.merge_gds (cyclomatic 26) src/xeda/_internal/flows/openroad/data/def2stream.py:11 — def2stream.merge_gds has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · place.effective (cyclomatic 26) · ×1
  • place.effective (cyclomatic 26) src/xeda/_internal/flows/openroad/place.py:229 — place.effective has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FloorplanGroup.problems (cyclomatic 26) · ×1
  • FloorplanGroup.problems (cyclomatic 26) src/xeda/_internal/flows/openroad/place_groups.py:364 — FloorplanGroup.problems has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FPGA._fpga_root_validator (cyclomatic 25) · ×1
  • FPGA._fpga_root_validator (cyclomatic 25) src/xeda/_internal/flow/fpga.py:68 — FPGA._fpga_root_validator 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.
D1 · Cyclomatic Complexity · Yosys.run (cyclomatic 25) · ×1
  • Yosys.run (cyclomatic 25) src/xeda/_internal/flows/yosys/yosys.py:936 — Yosys.run 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.
D1 · Cyclomatic Complexity · FmaxOptimizer.update_bounds (cyclomatic 24) · ×1
  • FmaxOptimizer.update_bounds (cyclomatic 24) src/xeda/_internal/flow_runner/dse/fmax.py:208 — FmaxOptimizer.update_bounds has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · resolver._pin_pdks (cyclomatic 24) · ×1
  • resolver._pin_pdks (cyclomatic 24) src/xeda/_internal/flow_runner/resolver.py:668 — resolver._pin_pdks has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RepairTiming.problems (cyclomatic 24) · ×1
  • RepairTiming.problems (cyclomatic 24) src/xeda/_internal/flows/openroad/groups.py:382 — RepairTiming.problems has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Design._merged_with (cyclomatic 23) · ×1
  • Design._merged_with (cyclomatic 23) src/xeda/_internal/design.py:4166 — Design._merged_with has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · flow_catalog.complete_builtin_request (cyclomatic 23) · ×1
  • flow_catalog.complete_builtin_request (cyclomatic 23) src/xeda/_internal/flow_catalog.py:90 — flow_catalog.complete_builtin_request has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FlowLauncher.launch_flow (cyclomatic 23) · ×1
  • FlowLauncher.launch_flow (cyclomatic 23) src/xeda/_internal/flow_runner/default_runner.py:851 — FlowLauncher.launch_flow has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Sby.check_results (cyclomatic 23) · ×1
  • Sby.check_results (cyclomatic 23) src/xeda/_internal/flows/sby/__init__.py:1132 — Sby.check_results has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · abc_strategies.composed_abc_script (cyclomatic 23) · ×1
  • abc_strategies.composed_abc_script (cyclomatic 23) src/xeda/_internal/flows/yosys/abc_strategies.py:46 — abc_strategies.composed_abc_script has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · agent.clean (cyclomatic 23) · ×1
  • agent.clean (cyclomatic 23) src/xeda/_internal/remote/agent.py:1577 — agent.clean has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · client._run (cyclomatic 23) · ×1
  • client._run (cyclomatic 23) src/xeda/_internal/remote/client.py:1706 — client._run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · fetch.select_fetch (cyclomatic 23) · ×1
  • fetch.select_fetch (cyclomatic 23) src/xeda/_internal/remote/fetch.py:215 — fetch.select_fetch has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Docker.run (cyclomatic 23) · ×1
  • Docker.run (cyclomatic 23) src/xeda/_internal/tool.py:105 — Docker.run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · cli_settings_completion._settings_candidates (cyclomatic 22) · ×1
  • cli_settings_completion._settings_candidates (cyclomatic 22) src/xeda/_internal/cli_settings_completion.py:387 — cli_settings_completion._settings_candidates has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · io.check_io_declarations (cyclomatic 22) · ×1
  • io.check_io_declarations (cyclomatic 22) src/xeda/_internal/flow/io.py:367 — io.check_io_declarations has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Nvc.execute (cyclomatic 22) · ×1
  • Nvc.execute (cyclomatic 22) src/xeda/_internal/flows/nvc/__init__.py:465 — Nvc.execute has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · cli.dse (cyclomatic 21) · ×1
  • cli.dse (cyclomatic 21) src/xeda/_internal/cli.py:1612 — cli.dse has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Cocotb.env (cyclomatic 21) · ×1
  • Cocotb.env (cyclomatic 21) REDACTED:492 — Cocotb.env has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · edif._close (cyclomatic 21) · ×1
  • edif._close (cyclomatic 21) src/xeda/_internal/edif.py:174 — edif._close has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · resolver._agree (cyclomatic 21) · ×1
  • resolver._agree (cyclomatic 21) src/xeda/_internal/flow_runner/resolver.py:839 — resolver._agree has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · trace_inputs.build_trace (cyclomatic 21) · ×1
  • trace_inputs.build_trace (cyclomatic 21) src/xeda/_internal/flow_runner/trace_inputs.py:968 — trace_inputs.build_trace has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Sby.check_design_supported (cyclomatic 21) · ×1
  • Sby.check_design_supported (cyclomatic 21) src/xeda/_internal/flows/sby/__init__.py:762 — Sby.check_design_supported has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Settings.synth_pass_only_conflicts (cyclomatic 21) · ×1
  • Settings.synth_pass_only_conflicts (cyclomatic 21) src/xeda/_internal/flows/yosys/yosys_fpga.py:797 — Settings.synth_pass_only_conflicts has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · local_settings.local_settings (cyclomatic 21) · ×1
  • local_settings.local_settings (cyclomatic 21) src/xeda/_internal/local_settings.py:110 — local_settings.local_settings has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Design._select_target (cyclomatic 20) · ×1
  • Design._select_target (cyclomatic 20) src/xeda/_internal/design.py:3560 — Design._select_target has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SimFlow.check_design_supported (cyclomatic 20) · ×1
  • SimFlow.check_design_supported (cyclomatic 20) src/xeda/_internal/flow/sim.py:518 — SimFlow.check_design_supported has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · bindings.node_bindings (cyclomatic 20) · ×1
  • bindings.node_bindings (cyclomatic 20) src/xeda/_internal/flow_runner/bindings.py:295 — bindings.node_bindings has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · launch_producers.run_producers (cyclomatic 20) · ×1
  • launch_producers.run_producers (cyclomatic 20) src/xeda/_internal/flow_runner/launch_producers.py:264 — launch_producers.run_producers has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · launch_result.launch_result (cyclomatic 20) · ×1
  • launch_result.launch_result (cyclomatic 20) src/xeda/_internal/flow_runner/launch_result.py:560 — launch_result.launch_result has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · nextpnr_constraints.reconcile_clocks (cyclomatic 20) · ×1
  • nextpnr_constraints.reconcile_clocks (cyclomatic 20) src/xeda/_internal/flows/nextpnr_constraints.py:179 — nextpnr_constraints.reconcile_clocks has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ArithmeticGroup.problems (cyclomatic 20) · ×1
  • ArithmeticGroup.problems (cyclomatic 20) src/xeda/_internal/flows/yosys/asic_groups.py:268 — ArithmeticGroup.problems has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · generation.judge (cyclomatic 20) · ×1
  • generation.judge (cyclomatic 20) src/xeda/_internal/generation.py:302 — generation.judge 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.
D1 · Cyclomatic Complexity · derive.read_liberty_summary (cyclomatic 20) · ×1
  • derive.read_liberty_summary (cyclomatic 20) src/xeda/_internal/platforms/derive.py:525 — derive.read_liberty_summary has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · bump_ci_pins.find_update (cyclomatic 19) · ×1
  • bump_ci_pins.find_update (cyclomatic 19) .github/scripts/bump_ci_pins.py:570 — bump_ci_pins.find_update has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · agent_skill._flow_section (cyclomatic 19) · ×1
  • agent_skill._flow_section (cyclomatic 19) src/xeda/_internal/agent_skill.py:96 — agent_skill._flow_section 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.
D1 · Cyclomatic Complexity · Deliveries.deliver (cyclomatic 19) · ×1
  • Deliveries.deliver (cyclomatic 19) src/xeda/_internal/deliver.py:1404 — Deliveries.deliver has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FmaxOptimizer.process_outcome (cyclomatic 19) · ×1
  • FmaxOptimizer.process_outcome (cyclomatic 19) src/xeda/_internal/flow_runner/dse/fmax.py:475 — FmaxOptimizer.process_outcome has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · resolver._explicit (cyclomatic 19) · ×1
  • resolver._explicit (cyclomatic 19) src/xeda/_internal/flow_runner/resolver.py:341 — resolver._explicit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · nextpnr_constraints._words (cyclomatic 19) · ×1
  • nextpnr_constraints._words (cyclomatic 19) src/xeda/_internal/flows/nextpnr_constraints.py:120 — nextpnr_constraints._words has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · openfpgaloader_probes.parse_scan_usb (cyclomatic 19) · ×1
  • openfpgaloader_probes.parse_scan_usb (cyclomatic 19) src/xeda/_internal/flows/openfpgaloader_probes.py:214 — openfpgaloader_probes.parse_scan_usb has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · final.effective (cyclomatic 19) · ×1
  • final.effective (cyclomatic 19) REDACTED:246 — final.effective 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.
D1 · Cyclomatic Complexity · client._finish (cyclomatic 19) · ×1
  • client._finish (cyclomatic 19) src/xeda/_internal/remote/client.py:1919 — client._finish has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · WithFpgaBoardSettings._fpga_validate (cyclomatic 18) · ×1
  • WithFpgaBoardSettings._fpga_validate (cyclomatic 18) src/xeda/_internal/board.py:272 — WithFpgaBoardSettings._fpga_validate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · GitReference.validate_repo (cyclomatic 18) · ×1
  • GitReference.validate_repo (cyclomatic 18) src/xeda/_internal/design.py:3042 — GitReference.validate_repo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Design._initialize (cyclomatic 18) · ×1
  • Design._initialize (cyclomatic 18) src/xeda/_internal/design.py:3821 — Design._initialize has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · edif._modules (cyclomatic 18) · ×1
  • edif._modules (cyclomatic 18) src/xeda/_internal/edif.py:133 — edif._modules has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · flow.map_keyed_path_leaves (cyclomatic 18) · ×1
  • flow.map_keyed_path_leaves (cyclomatic 18) REDACTED:261 — flow.map_keyed_path_leaves has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FlowLauncher._validate_plan (cyclomatic 18) · ×1
  • FlowLauncher._validate_plan (cyclomatic 18) src/xeda/_internal/flow_runner/default_runner.py:765 — FlowLauncher._validate_plan has cyclomatic complexity 18 (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.
D1 · Cyclomatic Complexity · layer_paths._anchor (cyclomatic 18) · ×1
  • layer_paths._anchor (cyclomatic 18) src/xeda/_internal/flow_runner/layer_paths.py:52 — layer_paths._anchor has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · IoGroup.problems (cyclomatic 18) · ×1
  • IoGroup.problems (cyclomatic 18) src/xeda/_internal/flows/openroad/place_groups.py:1168 — IoGroup.problems has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · introspect.flow_chain_cells (cyclomatic 18) · ×1
  • introspect.flow_chain_cells (cyclomatic 18) src/xeda/_internal/introspect.py:252 — introspect.flow_chain_cells has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · introspect.type_str (cyclomatic 18) · ×1
  • introspect.type_str (cyclomatic 18) src/xeda/_internal/introspect.py:307 — introspect.type_str has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proc_utils.run_process (cyclomatic 18) · ×1
  • proc_utils.run_process (cyclomatic 18) src/xeda/_internal/proc_utils.py:1063 — proc_utils.run_process 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.
D1 · Cyclomatic Complexity · commands._clean_host (cyclomatic 18) · ×1
  • commands._clean_host (cyclomatic 18) src/xeda/_internal/remote/commands.py:353 — commands._clean_host has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Tool._sibling_executable (cyclomatic 18) · ×1
  • Tool._sibling_executable (cyclomatic 18) src/xeda/_internal/tool.py:902 — Tool._sibling_executable has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · tool_store._release_asset (cyclomatic 18) · ×1
  • tool_store._release_asset (cyclomatic 18) REDACTED:332 — tool_store._release_asset 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.
D1 · Cyclomatic Complexity · XedaBaseModel._booleans_are_not_text (cyclomatic 17) · ×1
  • XedaBaseModel._booleans_are_not_text (cyclomatic 17) src/xeda/_internal/dataclass.py:1298 — XedaBaseModel._booleans_are_not_text has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · settings_group.render_flags (cyclomatic 17) · ×1
  • settings_group.render_flags (cyclomatic 17) src/xeda/_internal/flow/settings_group.py:272 — settings_group.render_flags has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Settings.get_flags (cyclomatic 17) · ×1
  • Settings.get_flags (cyclomatic 17) src/xeda/_internal/flows/ghdl/__init__.py:205 — Settings.get_flags has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Openroad.check_settings_supported (cyclomatic 17) · ×1
  • Openroad.check_settings_supported (cyclomatic 17) REDACTED:768 — Openroad.check_settings_supported has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · sby._staged_name (cyclomatic 17) · ×1
  • sby._staged_name (cyclomatic 17) src/xeda/_internal/flows/sby/__init__.py:164 — sby._staged_name has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Xezim.run (cyclomatic 17) · ×1
  • Xezim.run (cyclomatic 17) src/xeda/_internal/flows/xezim.py:418 — Xezim.run has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · AbcGroup.problems (cyclomatic 17) · ×1
  • AbcGroup.problems (cyclomatic 17) src/xeda/_internal/flows/yosys/asic_groups.py:808 — AbcGroup.problems has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · introspect._in_field_units (cyclomatic 17) · ×1
  • introspect._in_field_units (cyclomatic 17) src/xeda/_internal/introspect.py:381 — introspect._in_field_units has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · packaging.package_inputs (cyclomatic 17) · ×1
  • packaging.package_inputs (cyclomatic 17) src/xeda/_internal/remote/packaging.py:155 — packaging.package_inputs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SettingsCompletionMixin.get_completions (cyclomatic 16) · ×1
  • SettingsCompletionMixin.get_completions (cyclomatic 16) src/xeda/_internal/cli_settings_completion.py:472 — SettingsCompletionMixin.get_completions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · flow._annotation_matches_value (cyclomatic 16) · ×1
  • flow._annotation_matches_value (cyclomatic 16) REDACTED:187 — flow._annotation_matches_value has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · SimFlow.check_settings_supported (cyclomatic 16) · ×1
  • SimFlow.check_settings_supported (cyclomatic 16) src/xeda/_internal/flow/sim.py:454 — SimFlow.check_settings_supported has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · chains.complete_request (cyclomatic 16) · ×1
  • chains.complete_request (cyclomatic 16) src/xeda/_internal/flow_runner/chains.py:908 — chains.complete_request has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · chains.fitting_outputs (cyclomatic 16) · ×1
  • chains.fitting_outputs (cyclomatic 16) src/xeda/_internal/flow_runner/chains.py:962 — chains.fitting_outputs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · FlowLauncher._finish_launch (cyclomatic 16) · ×1
  • FlowLauncher._finish_launch (cyclomatic 16) src/xeda/_internal/flow_runner/default_runner.py:1315 — FlowLauncher._finish_launch has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · FlowLauncher._refuse_unaccepted_request (cyclomatic 16) · ×1
  • FlowLauncher._refuse_unaccepted_request (cyclomatic 16) src/xeda/_internal/flow_runner/default_runner.py:2348 — FlowLauncher._refuse_unaccepted_request has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · FmaxOptimizer.next_batch (cyclomatic 16) · ×1
  • FmaxOptimizer.next_batch (cyclomatic 16) src/xeda/_internal/flow_runner/dse/fmax.py:350 — FmaxOptimizer.next_batch has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · error_codes._settings_error (cyclomatic 16) · ×1
  • error_codes._settings_error (cyclomatic 16) src/xeda/_internal/flow_runner/error_codes.py:385 — error_codes._settings_error has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · plan_check.plan_difference (cyclomatic 16) · ×1
  • plan_check.plan_difference (cyclomatic 16) src/xeda/_internal/flow_runner/plan_check.py:52 — plan_check.plan_difference has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · settings_layers._given_leaves (cyclomatic 16) · ×1
  • settings_layers._given_leaves (cyclomatic 16) src/xeda/_internal/flow_runner/settings_layers.py:602 — settings_layers._given_leaves has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · sim_evidence.verilator_evidence (cyclomatic 16) · ×1
  • sim_evidence.verilator_evidence (cyclomatic 16) src/xeda/_internal/flows/bsc/sim_evidence.py:34 — sim_evidence.verilator_evidence has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Dc.parse_timing_reports (cyclomatic 16) · ×1
  • Dc.parse_timing_reports (cyclomatic 16) src/xeda/_internal/flows/dc/__init__.py:507 — Dc.parse_timing_reports has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Dc.parse_reports (cyclomatic 16) · ×1
  • Dc.parse_reports (cyclomatic 16) src/xeda/_internal/flows/dc/__init__.py:623 — Dc.parse_reports has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Nextpnr._parse_utilization (cyclomatic 16) · ×1
  • Nextpnr._parse_utilization (cyclomatic 16) REDACTED:1484 — Nextpnr._parse_utilization has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Nvc.simulation_evidence (cyclomatic 16) · ×1
  • Nvc.simulation_evidence (cyclomatic 16) src/xeda/_internal/flows/nvc/__init__.py:417 — Nvc.simulation_evidence has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Quartus.parse_reports (cyclomatic 16) · ×1
  • Quartus.parse_reports (cyclomatic 16) src/xeda/_internal/flows/quartus/__init__.py:289 — Quartus.parse_reports has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VivadoPostsynthSim.run (cyclomatic 16) · ×1
  • VivadoPostsynthSim.run (cyclomatic 16) src/xeda/_internal/flows/vivado/vivado_postsynthsim.py:103 — VivadoPostsynthSim.run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · VivadoSim.run (cyclomatic 16) · ×1
  • VivadoSim.run (cyclomatic 16) src/xeda/_internal/flows/vivado/vivado_sim.py:201 — VivadoSim.run has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · client._failed (cyclomatic 16) · ×1
  • client._failed (cyclomatic 16) src/xeda/_internal/remote/client.py:1640 — client._failed has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · launch_entry.execute (cyclomatic 16) · ×1
  • launch_entry.execute (cyclomatic 16) src/xeda/_internal/remote/launch_entry.py:295 — launch_entry.execute 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.
D2 · Cognitive Complexity · resolver.resolve (cognitive 176) · ×1
  • resolver.resolve (cognitive 176) src/xeda/_internal/flow_runner/resolver.py:1059 — resolver.resolve has cognitive complexity 176 (threshold 15). Drivers by points: if/else 37 (99 pts), loops 19 (34 pts), boolean chains 20, ternaries 6 (15 pts), error handling 3 (8 pts) (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cli_settings_completion._parse_request_words (cognitive 166) · ×1
  • cli_settings_completion._parse_request_words (cognitive 166) src/xeda/_internal/cli_settings_completion.py:140 — cli_settings_completion._parse_request_words has cognitive complexity 166 (threshold 15). Drivers by points: if/else 43 (130 pts), boolean chains 15, loops 5 (11 pts), ternaries 3 (7 pts), error handling 2 (3 pts) (nesting depth added 98). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · FlowLauncher._launch (cognitive 148) · ×1
  • FlowLauncher._launch (cognitive 148) src/xeda/_internal/flow_runner/default_runner.py:1611 — FlowLauncher._launch has cognitive complexity 148 (threshold 15). Drivers by points: if/else 56 (86 pts), ternaries 15 (24 pts), boolean chains 18, error handling 7 (11 pts), loops 5 (9 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Dse.run_flow (cognitive 123) · ×1
  • Dse.run_flow (cognitive 123) src/xeda/_internal/flow_runner/dse/dse_runner.py:615 — Dse.run_flow has cognitive complexity 123 (threshold 15). Drivers by points: if/else 37 (73 pts), ternaries 10 (23 pts), boolean chains 11, loops 5 (10 pts), error handling 1 (6 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Vcs.run (cognitive 93) · ×1
  • Vcs.run (cognitive 93) src/xeda/_internal/flows/vcs.py:356 — Vcs.run has cognitive complexity 93 (threshold 15). Drivers by points: if/else 55 (74 pts), ternaries 3 (10 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sim_evidence.parse_xsim_evidence (cognitive 87) · ×1
  • sim_evidence.parse_xsim_evidence (cognitive 87) src/xeda/_internal/flows/vivado/sim_evidence.py:22 — sim_evidence.parse_xsim_evidence has cognitive complexity 87 (threshold 15). Drivers by points: if/else 28 (56 pts), ternaries 5 (18 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlowLauncher._request (cognitive 85) · ×1
  • FlowLauncher._request (cognitive 85) src/xeda/_internal/flow_runner/default_runner.py:3358 — FlowLauncher._request has cognitive complexity 85 (threshold 15). Drivers by points: ternaries 31 (40 pts), if/else 28 (36 pts), boolean chains 9 (nesting depth added 17). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · trace.check_trace (cognitive 76) · ×1
  • trace.check_trace (cognitive 76) src/xeda/_internal/flow_runner/trace.py:590 — trace.check_trace has cognitive complexity 76 (threshold 15). Drivers by points: if/else 32 (56 pts), boolean chains 8, loops 5 (6 pts), error handling 2 (5 pts), ternaries 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · vcs_evidence.parse_vcs_evidence (cognitive 74) · ×1
  • vcs_evidence.parse_vcs_evidence (cognitive 74) src/xeda/_internal/flows/vcs_evidence.py:69 — vcs_evidence.parse_vcs_evidence has cognitive complexity 74 (threshold 15). Drivers by points: if/else 22 (44 pts), ternaries 7 (19 pts), boolean chains 10, loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dataclass.scalar_problems (cognitive 63) · ×1
  • dataclass.scalar_problems (cognitive 63) src/xeda/_internal/dataclass.py:1440 — dataclass.scalar_problems has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 13, loops 4 (9 pts), ternaries 3 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cli_utils.print_results (cognitive 62) · ×1
  • cli_utils.print_results (cognitive 62) src/xeda/_internal/cli_utils.py:607 — cli_utils.print_results has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 5 (24 pts), if/else 8 (22 pts), boolean chains 11, loops 2 (5 pts) (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · design.generated_declarations (cognitive 61) · ×1
  • design.generated_declarations (cognitive 61) src/xeda/_internal/design.py:1575 — design.generated_declarations has cognitive complexity 61 (threshold 15). Drivers by points: if/else 23 (47 pts), loops 3 (7 pts), boolean chains 6, ternaries 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sby.timing_problems (cognitive 61) · ×1
  • sby.timing_problems (cognitive 61) src/xeda/_internal/flows/sby/__init__.py:441 — sby.timing_problems has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 7 (15 pts), ternaries 3 (9 pts), boolean chains 6 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Verilator.run (cognitive 61) · ×1
  • Verilator.run (cognitive 61) src/xeda/_internal/flows/verilator/__init__.py:585 — Verilator.run has cognitive complexity 61 (threshold 15). Drivers by points: if/else 35 (46 pts), ternaries 5 (7 pts), loops 4 (5 pts), boolean chains 2, error handling 1 (nesting depth added 14). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · launch_generation.settle (cognitive 60) · ×1
  • launch_generation.settle (cognitive 60) src/xeda/_internal/flow_runner/launch_generation.py:507 — launch_generation.settle has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 5 (9 pts), boolean chains 7, ternaries 3 (6 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plan_freshness.judge_node (cognitive 60) · ×1
  • plan_freshness.judge_node (cognitive 60) src/xeda/_internal/flow_runner/plan_freshness.py:322 — plan_freshness.judge_node has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (36 pts), boolean chains 11, error handling 4 (5 pts), ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fetch.select_fetch (cognitive 56) · ×1
  • fetch.select_fetch (cognitive 56) src/xeda/_internal/remote/fetch.py:215 — fetch.select_fetch has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 4 (8 pts), boolean chains 5, error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cli.run (cognitive 55) · ×1
  • cli.run (cognitive 55) src/xeda/_internal/cli.py:1191 — cli.run has cognitive complexity 55 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 9, error handling 7 (9 pts), ternaries 6 (8 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · resolver._normalized_leaves (cognitive 54) · ×1
  • resolver._normalized_leaves (cognitive 54) src/xeda/_internal/flow_runner/resolver.py:576 — resolver._normalized_leaves has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (31 pts), error handling 3 (8 pts), boolean chains 6, loops 3 (6 pts), ternaries 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resolver._agree (cognitive 53) · ×1
  • resolver._agree (cognitive 53) src/xeda/_internal/flow_runner/resolver.py:839 — resolver._agree has cognitive complexity 53 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 7 (16 pts), ternaries 3 (8 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · settings_layers._merge_settings_layer (cognitive 53) · ×1
  • settings_layers._merge_settings_layer (cognitive 53) src/xeda/_internal/flow_runner/settings_layers.py:326 — settings_layers._merge_settings_layer has cognitive complexity 53 (threshold 15). Drivers by points: if/else 7 (22 pts), ternaries 6 (17 pts), boolean chains 9, loops 2 (5 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · sim_evidence.parse_nvc_log (cognitive 52) · ×1
  • sim_evidence.parse_nvc_log (cognitive 52) src/xeda/_internal/flow/sim_evidence.py:138 — sim_evidence.parse_nvc_log has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 6 (19 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sim_evidence.parse_modelsim_evidence (cognitive 52) · ×1
  • sim_evidence.parse_modelsim_evidence (cognitive 52) src/xeda/_internal/flows/modelsim/sim_evidence.py:20 — sim_evidence.parse_modelsim_evidence has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 11, ternaries 6 (10 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Nextpnr.run (cognitive 52) · ×1
  • Nextpnr.run (cognitive 52) REDACTED:1193 — Nextpnr.run has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (33 pts), ternaries 3 (7 pts), boolean chains 6, loops 5, error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resolver._pin_pdks (cognitive 51) · ×1
  • resolver._pin_pdks (cognitive 51) src/xeda/_internal/flow_runner/resolver.py:668 — resolver._pin_pdks has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (25 pts), ternaries 3 (10 pts), loops 4 (8 pts), boolean chains 4, error handling 2 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · upstream.read_orfs_config_mk (cognitive 51) · ×1
  • upstream.read_orfs_config_mk (cognitive 51) src/xeda/_internal/platforms/upstream.py:830 — upstream.read_orfs_config_mk has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 9, loops 5 (8 pts), error handling 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Design._target_overlay (cognitive 50) · ×1
  • Design._target_overlay (cognitive 50) src/xeda/_internal/design.py:3688 — Design._target_overlay has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 8 (15 pts), loops 9 (14 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · outputs.record_outputs (cognitive 49) · ×1
  • outputs.record_outputs (cognitive 49) src/xeda/_internal/flow_runner/outputs.py:106 — outputs.record_outputs has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (27 pts), ternaries 3 (7 pts), boolean chains 6, error handling 2 (6 pts), loops 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sim.judge_evidence (cognitive 48) · ×1
  • sim.judge_evidence (cognitive 48) src/xeda/_internal/flow/sim.py:223 — sim.judge_evidence has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (25 pts), ternaries 6 (13 pts), boolean chains 5, error handling 2 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · launch_run.execute (cognitive 47) · ×1
  • launch_run.execute (cognitive 47) src/xeda/_internal/flow_runner/launch_run.py:125 — launch_run.execute has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 12, loops 4 (5 pts), ternaries 1 (3 pts), error handling 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · agent.clean (cognitive 47) · ×1
  • agent.clean (cognitive 47) src/xeda/_internal/remote/agent.py:1577 — agent.clean has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 4 (6 pts), error handling 2 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FPGA._fpga_root_validator (cognitive 45) · ×1
  • FPGA._fpga_root_validator (cognitive 45) src/xeda/_internal/flow/fpga.py:68 — FPGA._fpga_root_validator has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (36 pts), ternaries 2 (6 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · nextpnr_constraints.reconcile_clocks (cognitive 43) · ×1
  • nextpnr_constraints.reconcile_clocks (cognitive 43) src/xeda/_internal/flows/nextpnr_constraints.py:179 — nextpnr_constraints.reconcile_clocks has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 5 (10 pts), ternaries 3 (10 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resolver._unreached (cognitive 42) · ×1
  • resolver._unreached (cognitive 42) src/xeda/_internal/flow_runner/resolver.py:900 — resolver._unreached has cognitive complexity 42 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 5 (13 pts), ternaries 2 (9 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · trace_inputs.build_trace (cognitive 42) · ×1
  • trace_inputs.build_trace (cognitive 42) src/xeda/_internal/flow_runner/trace_inputs.py:968 — trace_inputs.build_trace has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (31 pts), ternaries 3 (5 pts), loops 4, boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RepairTiming.problems (cognitive 42) · ×1
  • RepairTiming.problems (cognitive 42) src/xeda/_internal/flows/openroad/groups.py:382 — RepairTiming.problems has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 7 (13 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · OpenroadPlace.check_settings_supported (cognitive 41) · ×1
  • OpenroadPlace.check_settings_supported (cognitive 41) src/xeda/_internal/flows/openroad/place.py:480 — OpenroadPlace.check_settings_supported has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 11, loops 2 (5 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Design._merged_with (cognitive 40) · ×1
  • Design._merged_with (cognitive 40) src/xeda/_internal/design.py:4166 — Design._merged_with has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 7, loops 3 (4 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · flow_catalog.complete_builtin_request (cognitive 40) · ×1
  • flow_catalog.complete_builtin_request (cognitive 40) src/xeda/_internal/flow_catalog.py:90 — flow_catalog.complete_builtin_request has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · chains.default_graph (cognitive 40) · ×1
  • chains.default_graph (cognitive 40) src/xeda/_internal/flow_runner/chains.py:716 — chains.default_graph has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (25 pts), ternaries 2 (8 pts), loops 3 (7 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FmaxOptimizer.update_bounds (cognitive 40) · ×1
  • FmaxOptimizer.update_bounds (cognitive 40) src/xeda/_internal/flow_runner/dse/fmax.py:208 — FmaxOptimizer.update_bounds has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (34 pts), boolean chains 6 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Nextpnr.target_for_settings (cognitive 40) · ×1
  • Nextpnr.target_for_settings (cognitive 40) REDACTED:1105 — Nextpnr.target_for_settings has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 10, ternaries 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · bindings.node_bindings (cognitive 39) · ×1
  • bindings.node_bindings (cognitive 39) src/xeda/_internal/flow_runner/bindings.py:295 — bindings.node_bindings has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 2 (7 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · layer_paths._anchor (cognitive 39) · ×1
  • layer_paths._anchor (cognitive 39) src/xeda/_internal/flow_runner/layer_paths.py:52 — layer_paths._anchor has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (24 pts), ternaries 2 (7 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Openfpgaloader._probe_arguments (cognitive 39) · ×1
  • Openfpgaloader._probe_arguments (cognitive 39) src/xeda/_internal/flows/openfpgaloader.py:762 — Openfpgaloader._probe_arguments has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (25 pts), ternaries 5 (7 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Cocotb.env (cognitive 38) · ×1
  • Cocotb.env (cognitive 38) REDACTED:492 — Cocotb.env has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlowLauncher.launch_flow (cognitive 38) · ×1
  • FlowLauncher.launch_flow (cognitive 38) src/xeda/_internal/flow_runner/default_runner.py:851 — FlowLauncher.launch_flow has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 6, ternaries 2 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · def2stream.merge_gds (cognitive 38) · ×1
  • def2stream.merge_gds (cognitive 38) src/xeda/_internal/flows/openroad/data/def2stream.py:11 — def2stream.merge_gds has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 7 (8 pts), boolean chains 4, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Design._with_expanded_sources (cognitive 37) · ×1
  • Design._with_expanded_sources (cognitive 37) src/xeda/_internal/design.py:3941 — Design._with_expanded_sources has cognitive complexity 37 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 3 (13 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · settings_group._declaration_problems (cognitive 37) · ×1
  • settings_group._declaration_problems (cognitive 37) src/xeda/_internal/flow/settings_group.py:212 — settings_group._declaration_problems has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 3, loops 3, error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cli_settings_completion._settings_candidates (cognitive 36) · ×1
  • cli_settings_completion._settings_candidates (cognitive 36) src/xeda/_internal/cli_settings_completion.py:387 — cli_settings_completion._settings_candidates has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 2, loops 2, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · settings_layers._given_leaves (cognitive 36) · ×1
  • settings_layers._given_leaves (cognitive 36) src/xeda/_internal/flow_runner/settings_layers.py:602 — settings_layers._given_leaves has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 4 (11 pts), loops 3 (6 pts), error handling 1 (4 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Settings.pass_flag_conflicts (cognitive 36) · ×1
  • Settings.pass_flag_conflicts (cognitive 36) src/xeda/_internal/flows/yosys/yosys_fpga.py:557 — Settings.pass_flag_conflicts has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 11, ternaries 3 (6 pts), error handling 2 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · nextpnr_constraints._commands (cognitive 35) · ×1
  • nextpnr_constraints._commands (cognitive 35) src/xeda/_internal/flows/nextpnr_constraints.py:70 — nextpnr_constraints._commands has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 10, ternaries 2 (6 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Deliveries.deliver (cognitive 34) · ×1
  • Deliveries.deliver (cognitive 34) src/xeda/_internal/deliver.py:1404 — Deliveries.deliver has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FmaxOptimizer.next_batch (cognitive 34) · ×1
  • FmaxOptimizer.next_batch (cognitive 34) src/xeda/_internal/flow_runner/dse/fmax.py:350 — FmaxOptimizer.next_batch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · launch_producers.run_producers (cognitive 34) · ×1
  • launch_producers.run_producers (cognitive 34) src/xeda/_internal/flow_runner/launch_producers.py:264 — launch_producers.run_producers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 7 (12 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · openfpgaloader_probes.parse_scan_usb (cognitive 34) · ×1
  • openfpgaloader_probes.parse_scan_usb (cognitive 34) src/xeda/_internal/flows/openfpgaloader_probes.py:214 — openfpgaloader_probes.parse_scan_usb has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 3 (8 pts), boolean chains 7, error handling 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SynthFlow.reconcile_clocks (cognitive 33) · ×1
  • SynthFlow.reconcile_clocks (cognitive 33) src/xeda/_internal/flow/synth.py:223 — SynthFlow.reconcile_clocks has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (25 pts), ternaries 1 (5 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · resolver._explicit (cognitive 33) · ×1
  • resolver._explicit (cognitive 33) src/xeda/_internal/flow_runner/resolver.py:341 — resolver._explicit has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Nvc.execute (cognitive 33) · ×1
  • Nvc.execute (cognitive 33) src/xeda/_internal/flows/nvc/__init__.py:465 — Nvc.execute has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (29 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · place.effective (cognitive 33) · ×1
  • place.effective (cognitive 33) src/xeda/_internal/flows/openroad/place.py:229 — place.effective has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 9, ternaries 5 (6 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · derive.read_liberty_summary (cognitive 33) · ×1
  • derive.read_liberty_summary (cognitive 33) src/xeda/_internal/platforms/derive.py:525 — derive.read_liberty_summary has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (18 pts), ternaries 3 (8 pts), boolean chains 6, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proc_utils._run_copying (cognitive 33) · ×1
  • proc_utils._run_copying (cognitive 33) src/xeda/_internal/proc_utils.py:795 — proc_utils._run_copying has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 9, loops 3 (5 pts), ternaries 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DesignPart._sources_to_files (cognitive 32) · ×1
  • DesignPart._sources_to_files (cognitive 32) src/xeda/_internal/design.py:1751 — DesignPart._sources_to_files has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 2 (6 pts), loops 2 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BscSim.run (cognitive 32) · ×1
  • BscSim.run (cognitive 32) src/xeda/_internal/flows/bsc/__init__.py:1697 — BscSim.run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 6, ternaries 4 (6 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · FloorplanGroup.problems (cognitive 32) · ×1
  • FloorplanGroup.problems (cognitive 32) src/xeda/_internal/flows/openroad/place_groups.py:364 — FloorplanGroup.problems has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 10, loops 5 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · launch_entry.execute (cognitive 32) · ×1
  • launch_entry.execute (cognitive 32) src/xeda/_internal/remote/launch_entry.py:295 — launch_entry.execute has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 7 (20 pts), if/else 6 (9 pts), boolean chains 2, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resolver._check_links_pass_through (cognitive 31) · ×1
  • resolver._check_links_pass_through (cognitive 31) src/xeda/_internal/flow_runner/resolver.py:466 — resolver._check_links_pass_through has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 2 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Yosys.asic_values (cognitive 31) · ×1
  • Yosys.asic_values (cognitive 31) src/xeda/_internal/flows/yosys/yosys.py:818 — Yosys.asic_values has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 8, boolean chains 4 (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.
D2 · Cognitive Complexity · client._run (cognitive 31) · ×1
  • client._run (cognitive 31) src/xeda/_internal/remote/client.py:1706 — client._run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 3 (4 pts), boolean chains 3, error handling 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · io.check_io_declarations (cognitive 30) · ×1
  • io.check_io_declarations (cognitive 30) src/xeda/_internal/flow/io.py:367 — io.check_io_declarations has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5, loops 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · trace.changed_edge (cognitive 30) · ×1
  • trace.changed_edge (cognitive 30) src/xeda/_internal/flow_runner/trace.py:200 — trace.changed_edge has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Dc.parse_reports (cognitive 30) · ×1
  • Dc.parse_reports (cognitive 30) src/xeda/_internal/flows/dc/__init__.py:623 — Dc.parse_reports has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), ternaries 1 (3 pts), boolean chains 2, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GhdlSim.run (cognitive 30) · ×1
  • GhdlSim.run (cognitive 30) src/xeda/_internal/flows/ghdl/__init__.py:687 — GhdlSim.run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, ternaries 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Vivado.parse_xml_report (cognitive 30) · ×1
  • Vivado.parse_xml_report (cognitive 30) REDACTED:181 — Vivado.parse_xml_report has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 3 (6 pts), ternaries 1 (4 pts), error handling 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Docker.run (cognitive 30) · ×1
  • Docker.run (cognitive 30) src/xeda/_internal/tool.py:105 — Docker.run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, loops 3 (6 pts), error handling 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GitReference.validate_repo (cognitive 29) · ×1
  • GitReference.validate_repo (cognitive 29) src/xeda/_internal/design.py:3042 — GitReference.validate_repo has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SimFlow.check_design_supported (cognitive 29) · ×1
  • SimFlow.check_design_supported (cognitive 29) src/xeda/_internal/flow/sim.py:518 — SimFlow.check_design_supported has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, loops 2 (4 pts), error handling 1 (3 pts), ternaries 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.
D2 · Cognitive Complexity · chains.complete_request (cognitive 29) · ×1
  • chains.complete_request (cognitive 29) src/xeda/_internal/flow_runner/chains.py:908 — chains.complete_request has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (4 pts), error handling 1 (3 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VivadoImplementation.parse_reports (cognitive 29) · ×1
  • VivadoImplementation.parse_reports (cognitive 29) src/xeda/_internal/flows/vivado/vivado_synth.py:667 — VivadoImplementation.parse_reports has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (11 pts), error handling 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Yosys.run (cognitive 29) · ×1
  • Yosys.run (cognitive 29) src/xeda/_internal/flows/yosys/yosys.py:936 — Yosys.run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5 (9 pts), boolean chains 4, loops 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · introspect.flow_chain_cells (cognitive 29) · ×1
  • introspect.flow_chain_cells (cognitive 29) src/xeda/_internal/introspect.py:252 — introspect.flow_chain_cells has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 4 (7 pts), boolean chains 3, loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · records._generated_places (cognitive 29) · ×1
  • records._generated_places (cognitive 29) src/xeda/_internal/records.py:971 — records._generated_places has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 2 (7 pts), error handling 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · bump_ci_pins.find_update (cognitive 28) · ×1
  • bump_ci_pins.find_update (cognitive 28) .github/scripts/bump_ci_pins.py:570 — bump_ci_pins.find_update has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · edif._modules (cognitive 28) · ×1
  • edif._modules (cognitive 28) src/xeda/_internal/edif.py:133 — edif._modules has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sim_evidence.parse_ghdl_log (cognitive 28) · ×1
  • sim_evidence.parse_ghdl_log (cognitive 28) src/xeda/_internal/flow/sim_evidence.py:81 — sim_evidence.parse_ghdl_log has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 3 (9 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FmaxOptimizer.process_outcome (cognitive 28) · ×1
  • FmaxOptimizer.process_outcome (cognitive 28) src/xeda/_internal/flow_runner/dse/fmax.py:475 — FmaxOptimizer.process_outcome has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 6, loops 2 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Yosys.check_settings_supported (cognitive 28) · ×1
  • Yosys.check_settings_supported (cognitive 28) src/xeda/_internal/flows/yosys/yosys.py:506 — Yosys.check_settings_supported has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (8 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · records._outputs_of (cognitive 28) · ×1
  • records._outputs_of (cognitive 28) src/xeda/_internal/records.py:1132 — records._outputs_of has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (8 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · WithFpgaBoardSettings._fpga_validate (cognitive 27) · ×1
  • WithFpgaBoardSettings._fpga_validate (cognitive 27) src/xeda/_internal/board.py:272 — WithFpgaBoardSettings._fpga_validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, error handling 1 (2 pts), ternaries 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.
D2 · Cognitive Complexity · launch_run.clean_up_run (cognitive 27) · ×1
  • launch_run.clean_up_run (cognitive 27) src/xeda/_internal/flow_runner/launch_run.py:248 — launch_run.clean_up_run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · run_lock._acquire_set (cognitive 27) · ×1
  • run_lock._acquire_set (cognitive 27) src/xeda/_internal/flow_runner/run_lock.py:445 — run_lock._acquire_set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (8 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Settings.validate_set_attributes (cognitive 27) · ×1
  • Settings.validate_set_attributes (cognitive 27) src/xeda/_internal/flows/yosys/common.py:435 — Settings.validate_set_attributes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (8 pts), loops 2 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · YosysFpga.parse_reports (cognitive 27) · ×1
  • YosysFpga.parse_reports (cognitive 27) src/xeda/_internal/flows/yosys/yosys_fpga.py:1255 — YosysFpga.parse_reports has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 1 (4 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · introspect.type_str (cognitive 27) · ×1
  • introspect.type_str (cognitive 27) src/xeda/_internal/introspect.py:307 — introspect.type_str has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Tool.process_version_output (cognitive 27) · ×1
  • Tool.process_version_output (cognitive 27) src/xeda/_internal/tool.py:431 — Tool.process_version_output has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · flow.map_keyed_path_leaves (cognitive 26) · ×1
  • flow.map_keyed_path_leaves (cognitive 26) REDACTED:261 — flow.map_keyed_path_leaves has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (7 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Sby.check_design_supported (cognitive 26) · ×1
  • Sby.check_design_supported (cognitive 26) src/xeda/_internal/flows/sby/__init__.py:762 — Sby.check_design_supported has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7, 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.
D2 · Cognitive Complexity · Settings.synth_command (cognitive 26) · ×1
  • Settings.synth_command (cognitive 26) src/xeda/_internal/flows/yosys/yosys_fpga.py:652 — Settings.synth_command has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 4, ternaries 2 (4 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.
D2 · Cognitive Complexity · Tool._sibling_executable (cognitive 26) · ×1
  • Tool._sibling_executable (cognitive 26) src/xeda/_internal/tool.py:902 — Tool._sibling_executable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 8, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Design._select_target (cognitive 25) · ×1
  • Design._select_target (cognitive 25) src/xeda/_internal/design.py:3560 — Design._select_target has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 3 (5 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SimFlow.check_settings_supported (cognitive 25) · ×1
  • SimFlow.check_settings_supported (cognitive 25) src/xeda/_internal/flow/sim.py:454 — SimFlow.check_settings_supported has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, error handling 1 (2 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · related_inputs.check_related_inputs (cognitive 25) · ×1
  • related_inputs.check_related_inputs (cognitive 25) src/xeda/_internal/flow_runner/related_inputs.py:242 — related_inputs.check_related_inputs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · bsc._parse_haskell_strings (cognitive 25) · ×1
  • bsc._parse_haskell_strings (cognitive 25) src/xeda/_internal/flows/bsc/__init__.py:285 — bsc._parse_haskell_strings has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ArithmeticGroup.problems (cognitive 25) · ×1
  • ArithmeticGroup.problems (cognitive 25) src/xeda/_internal/flows/yosys/asic_groups.py:268 — ArithmeticGroup.problems has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AbcGroup.problems (cognitive 25) · ×1
  • AbcGroup.problems (cognitive 25) src/xeda/_internal/flows/yosys/asic_groups.py:808 — AbcGroup.problems has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · introspect._in_field_units (cognitive 25) · ×1
  • introspect._in_field_units (cognitive 25) src/xeda/_internal/introspect.py:381 — introspect._in_field_units has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 2 (5 pts), ternaries 2 (4 pts), loops 2 (3 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.
D2 · Cognitive Complexity · _LefReader.read (cognitive 25) · ×1
  • _LefReader.read (cognitive 25) src/xeda/_internal/platforms/derive.py:165 — _LefReader.read has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · bump_ci_pins.run (cognitive 24) · ×1
  • bump_ci_pins.run (cognitive 24) .github/scripts/bump_ci_pins.py:810 — bump_ci_pins.run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (8 pts), ternaries 1 (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.
D2 · Cognitive Complexity · XedaBaseModel._booleans_are_not_text (cognitive 24) · ×1
  • XedaBaseModel._booleans_are_not_text (cognitive 24) src/xeda/_internal/dataclass.py:1298 — XedaBaseModel._booleans_are_not_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Deliveries.collect (cognitive 24) · ×1
  • Deliveries.collect (cognitive 24) src/xeda/_internal/deliver.py:1320 — Deliveries.collect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · settings_group.render_flags (cognitive 24) · ×1
  • settings_group.render_flags (cognitive 24) src/xeda/_internal/flow/settings_group.py:272 — settings_group.render_flags has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · error_codes._settings_error (cognitive 24) · ×1
  • error_codes._settings_error (cognitive 24) src/xeda/_internal/flow_runner/error_codes.py:385 — error_codes._settings_error has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 6 (8 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IoGroup.problems (cognitive 24) · ×1
  • IoGroup.problems (cognitive 24) src/xeda/_internal/flows/openroad/place_groups.py:1168 — IoGroup.problems has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 6 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Quartus.parse_reports (cognitive 24) · ×1
  • Quartus.parse_reports (cognitive 24) src/xeda/_internal/flows/quartus/__init__.py:289 — Quartus.parse_reports has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (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.
D2 · Cognitive Complexity · sby.staged_names (cognitive 24) · ×1
  • sby.staged_names (cognitive 24) src/xeda/_internal/flows/sby/__init__.py:223 — sby.staged_names has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _TclReader.leaves (cognitive 24) · ×1
  • _TclReader.leaves (cognitive 24) src/xeda/_internal/platforms/upstream.py:575 — _TclReader.leaves has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (7 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dataclass.annotation_kind (cognitive 23) · ×1
  • dataclass.annotation_kind (cognitive 23) src/xeda/_internal/dataclass.py:602 — dataclass.annotation_kind has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · equivalence.json_netlist_digest (cognitive 23) · ×1
  • equivalence.json_netlist_digest (cognitive 23) src/xeda/_internal/equivalence.py:37 — equivalence.json_netlist_digest has cognitive complexity 23 (threshold 15). Drivers by points: loops 3 (12 pts), if/else 4 (10 pts), error handling 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · chains.parse_request (cognitive 23) · ×1
  • chains.parse_request (cognitive 23) src/xeda/_internal/flow_runner/chains.py:142 — chains.parse_request has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · chains.fitting_outputs (cognitive 23) · ×1
  • chains.fitting_outputs (cognitive 23) src/xeda/_internal/flow_runner/chains.py:962 — chains.fitting_outputs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · launch_producers._produced (cognitive 23) · ×1
  • launch_producers._produced (cognitive 23) src/xeda/_internal/flow_runner/launch_producers.py:121 — launch_producers._produced has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (8 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Dc.parse_timing_reports (cognitive 23) · ×1
  • Dc.parse_timing_reports (cognitive 23) src/xeda/_internal/flows/dc/__init__.py:507 — Dc.parse_timing_reports has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Openroad.check_settings_supported (cognitive 23) · ×1
  • Openroad.check_settings_supported (cognitive 23) REDACTED:768 — Openroad.check_settings_supported has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sby._clock_races (cognitive 23) · ×1
  • sby._clock_races (cognitive 23) src/xeda/_internal/flows/sby/__init__.py:394 — sby._clock_races has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 2 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · Settings.synth_pass_only_conflicts (cognitive 23) · ×1
  • Settings.synth_pass_only_conflicts (cognitive 23) src/xeda/_internal/flows/yosys/yosys_fpga.py:797 — Settings.synth_pass_only_conflicts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (20 pts), loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · local_settings.local_settings (cognitive 23) · ×1
  • local_settings.local_settings (cognitive 23) src/xeda/_internal/local_settings.py:110 — local_settings.local_settings has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 13 (14 pts), if/else 4 (6 pts), boolean chains 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · _TclReader.value (cognitive 23) · ×1
  • _TclReader.value (cognitive 23) src/xeda/_internal/platforms/upstream.py:484 — _TclReader.value has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _Deadline._poll (cognitive 23) · ×1
  • _Deadline._poll (cognitive 23) src/xeda/_internal/proc_utils.py:340 — _Deadline._poll has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (18 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proc_utils._subprocess_tty (cognitive 23) · ×1
  • proc_utils._subprocess_tty (cognitive 23) src/xeda/_internal/proc_utils.py:1228 — proc_utils._subprocess_tty has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 3 (5 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · records._inputs_of (cognitive 23) · ×1
  • records._inputs_of (cognitive 23) src/xeda/_internal/records.py:1277 — records._inputs_of has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 3 (12 pts), loops 3 (5 pts), if/else 2 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · client._finish (cognitive 23) · ×1
  • client._finish (cognitive 23) src/xeda/_internal/remote/client.py:1919 — client._finish has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 4 (7 pts), boolean chains 4, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · commands._clean_host (cognitive 23) · ×1
  • commands._clean_host (cognitive 23) src/xeda/_internal/remote/commands.py:353 — commands._clean_host has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · packaging.package_inputs (cognitive 23) · ×1
  • packaging.package_inputs (cognitive 23) src/xeda/_internal/remote/packaging.py:155 — packaging.package_inputs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 3, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · tools_cli.tools_install (cognitive 23) · ×1
  • tools_cli.tools_install (cognitive 23) src/xeda/_internal/tools_cli.py:366 — tools_cli.tools_install has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (5 pts), boolean chains 3, error handling 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.
D2 · Cognitive Complexity · cli._print_plan (cognitive 22) · ×1
  • cli._print_plan (cognitive 22) src/xeda/_internal/cli.py:914 — cli._print_plan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 pts), ternaries 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SettingsCompletionMixin.get_completions (cognitive 22) · ×1
  • SettingsCompletionMixin.get_completions (cognitive 22) src/xeda/_internal/cli_settings_completion.py:472 — SettingsCompletionMixin.get_completions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 7, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Design._initialize (cognitive 22) · ×1
  • Design._initialize (cognitive 22) src/xeda/_internal/design.py:3821 — Design._initialize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (6 pts), boolean chains 3, error handling 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · chains._check_chain (cognitive 22) · ×1
  • chains._check_chain (cognitive 22) src/xeda/_internal/flow_runner/chains.py:280 — chains._check_chain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), ternaries 1 (3 pts), boolean chains 2, error handling 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.
D2 · Cognitive Complexity · launch_result.launch_result (cognitive 22) · ×1
  • launch_result.launch_result (cognitive 22) src/xeda/_internal/flow_runner/launch_result.py:560 — launch_result.launch_result has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, error handling 3, ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · outputs.recorded_outputs (cognitive 22) · ×1
  • outputs.recorded_outputs (cognitive 22) src/xeda/_internal/flow_runner/outputs.py:60 — outputs.recorded_outputs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plan_check.plan_difference (cognitive 22) · ×1
  • plan_check.plan_difference (cognitive 22) src/xeda/_internal/flow_runner/plan_check.py:52 — plan_check.plan_difference has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 6, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · scrub.list_run_directories (cognitive 22) · ×1
  • scrub.list_run_directories (cognitive 22) src/xeda/_internal/flow_runner/scrub.py:674 — scrub.list_run_directories has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setting_text._parse (cognitive 22) · ×1
  • setting_text._parse (cognitive 22) src/xeda/_internal/setting_text.py:127 — setting_text._parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cli.dse (cognitive 21) · ×1
  • cli.dse (cognitive 21) src/xeda/_internal/cli.py:1612 — cli.dse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, error handling 5, ternaries 2 (3 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · deliver._resolved_patterns (cognitive 21) · ×1
  • deliver._resolved_patterns (cognitive 21) src/xeda/_internal/deliver.py:514 — deliver._resolved_patterns has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), error handling 1 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · edif._close (cognitive 21) · ×1
  • edif._close (cognitive 21) src/xeda/_internal/edif.py:174 — edif._close has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlowLauncher._finish_launch (cognitive 21) · ×1
  • FlowLauncher._finish_launch (cognitive 21) src/xeda/_internal/flow_runner/default_runner.py:1315 — FlowLauncher._finish_launch has cognitive complexity 21 (threshold 15). Drivers by points: error handling 3 (7 pts), loops 4 (6 pts), boolean chains 5, if/else 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · launch_result._ended_node (cognitive 21) · ×1
  • launch_result._ended_node (cognitive 21) src/xeda/_internal/flow_runner/launch_result.py:413 — launch_result._ended_node has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (7 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resolver._check_design_producers (cognitive 21) · ×1
  • resolver._check_design_producers (cognitive 21) src/xeda/_internal/flow_runner/resolver.py:982 — resolver._check_design_producers has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (11 pts), boolean chains 5, if/else 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · nextpnr_constraints._words (cognitive 21) · ×1
  • nextpnr_constraints._words (cognitive 21) src/xeda/_internal/flows/nextpnr_constraints.py:120 — nextpnr_constraints._words has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 7, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · quartus.parse_csv (cognitive 21) · ×1
  • quartus.parse_csv (cognitive 21) src/xeda/_internal/flows/quartus/__init__.py:29 — quartus.parse_csv has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VivadoPostsynthSim.run (cognitive 21) · ×1
  • VivadoPostsynthSim.run (cognitive 21) src/xeda/_internal/flows/vivado/vivado_postsynthsim.py:103 — VivadoPostsynthSim.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, ternaries 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · agent_skill._flow_section (cognitive 20) · ×1
  • agent_skill._flow_section (cognitive 20) src/xeda/_internal/agent_skill.py:96 — agent_skill._flow_section has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · TestResults.parse_results (cognitive 20) · ×1
  • TestResults.parse_results (cognitive 20) REDACTED:225 — TestResults.parse_results has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 2 (6 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · design._generator_recipe (cognitive 20) · ×1
  • design._generator_recipe (cognitive 20) src/xeda/_internal/design.py:2366 — design._generator_recipe has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dependencies._merge (cognitive 20) · ×1
  • dependencies._merge (cognitive 20) src/xeda/_internal/flow_runner/dependencies.py:435 — dependencies._merge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · outputs._design_entries (cognitive 20) · ×1
  • outputs._design_entries (cognitive 20) src/xeda/_internal/flow_runner/outputs.py:244 — outputs._design_entries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sim_evidence.verilator_evidence (cognitive 20) · ×1
  • sim_evidence.verilator_evidence (cognitive 20) src/xeda/_internal/flows/bsc/sim_evidence.py:34 — sim_evidence.verilator_evidence has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Nextpnr._parse_utilization (cognitive 20) · ×1
  • Nextpnr._parse_utilization (cognitive 20) REDACTED:1484 — Nextpnr._parse_utilization has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · final.effective (cognitive 20) · ×1
  • final.effective (cognitive 20) REDACTED:246 — final.effective has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (6 pts), ternaries 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · sby._staged_name (cognitive 20) · ×1
  • sby._staged_name (cognitive 20) src/xeda/_internal/flows/sby/__init__.py:164 — sby._staged_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · vivado_synth.run_steps (cognitive 20) · ×1
  • vivado_synth.run_steps (cognitive 20) src/xeda/_internal/flows/vivado/vivado_synth.py:199 — vivado_synth.run_steps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · abc_strategies.composed_abc_script (cognitive 20) · ×1
  • abc_strategies.composed_abc_script (cognitive 20) src/xeda/_internal/flows/yosys/abc_strategies.py:46 — abc_strategies.composed_abc_script has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 7 (9 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · records.collect_metrics (cognitive 20) · ×1
  • records.collect_metrics (cognitive 20) src/xeda/_internal/records.py:457 — records.collect_metrics has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 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.
D2 · Cognitive Complexity · client._launch_result (cognitive 20) · ×1
  • client._launch_result (cognitive 20) src/xeda/_internal/remote/client.py:1015 — client._launch_result has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (7 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · client._failed (cognitive 20) · ×1
  • client._failed (cognitive 20) src/xeda/_internal/remote/client.py:1640 — client._failed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 3 (5 pts), error handling 2 (4 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.
D2 · Cognitive Complexity · manifest.iter_tar (cognitive 20) · ×1
  • manifest.iter_tar (cognitive 20) src/xeda/_internal/remote/manifest.py:201 — manifest.iter_tar has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · XedaBaseModel._exact_scalars (cognitive 19) · ×1
  • XedaBaseModel._exact_scalars (cognitive 19) src/xeda/_internal/dataclass.py:1374 — XedaBaseModel._exact_scalars has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · design._normalize_parameters (cognitive 19) · ×1
  • design._normalize_parameters (cognitive 19) src/xeda/_internal/design.py:1296 — design._normalize_parameters has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · edif._tokens (cognitive 19) · ×1
  • edif._tokens (cognitive 19) src/xeda/_internal/edif.py:97 — edif._tokens has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), boolean chains 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.
D2 · Cognitive Complexity · chains.binding_points (cognitive 19) · ×1
  • chains.binding_points (cognitive 19) src/xeda/_internal/flow_runner/chains.py:775 — chains.binding_points has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlowLauncher._validate_plan (cognitive 19) · ×1
  • FlowLauncher._validate_plan (cognitive 19) src/xeda/_internal/flow_runner/default_runner.py:765 — FlowLauncher._validate_plan has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (5 pts), error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 2). 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.
D2 · Cognitive Complexity · scrub._remove_confirmed (cognitive 19) · ×1
  • scrub._remove_confirmed (cognitive 19) src/xeda/_internal/flow_runner/scrub.py:368 — scrub._remove_confirmed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Iverilog.check_settings_supported (cognitive 19) · ×1
  • Iverilog.check_settings_supported (cognitive 19) src/xeda/_internal/flows/iverilog/__init__.py:272 — Iverilog.check_settings_supported has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (6 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Sby.check_results (cognitive 19) · ×1
  • Sby.check_results (cognitive 19) src/xeda/_internal/flows/sby/__init__.py:1132 — Sby.check_results has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (6 pts), ternaries 2 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · YosysBase.check_design_supported (cognitive 19) · ×1
  • YosysBase.check_design_supported (cognitive 19) src/xeda/_internal/flows/yosys/common.py:551 — YosysBase.check_design_supported has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 6 (7 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · generation.judge (cognitive 19) · ×1
  • generation.judge (cognitive 19) src/xeda/_internal/generation.py:302 — generation.judge has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 4, error handling 3, ternaries 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · proc_utils.run_process (cognitive 19) · ×1
  • proc_utils.run_process (cognitive 19) src/xeda/_internal/proc_utils.py:1063 — proc_utils.run_process has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · proc_utils.run_capture_pty (cognitive 19) · ×1
  • proc_utils.run_capture_pty (cognitive 19) src/xeda/_internal/proc_utils.py:1271 — proc_utils.run_capture_pty has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · project._entry (cognitive 19) · ×1
  • project._entry (cognitive 19) src/xeda/_internal/project.py:317 — project._entry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SweepResult._row (cognitive 19) · ×1
  • SweepResult._row (cognitive 19) src/xeda/_internal/sweep.py:155 — SweepResult._row has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (13 pts), loops 4, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · tool_store._extract (cognitive 19) · ×1
  • tool_store._extract (cognitive 19) REDACTED:626 — tool_store._extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · XedaHelpGroup._main_machine_readable (cognitive 18) · ×1
  • XedaHelpGroup._main_machine_readable (cognitive 18) src/xeda/_internal/cli_utils.py:325 — XedaHelpGroup._main_machine_readable has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 2 (5 pts), error handling 4, loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Generator._sources_to_files (cognitive 18) · ×1
  • Generator._sources_to_files (cognitive 18) src/xeda/_internal/design.py:2022 — Generator._sources_to_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Generator.execution_executable_path (cognitive 18) · ×1
  • Generator.execution_executable_path (cognitive 18) src/xeda/_internal/design.py:2124 — Generator.execution_executable_path has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, ternaries 3 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Design._merge_target (cognitive 18) · ×1
  • Design._merge_target (cognitive 18) src/xeda/_internal/design.py:3647 — Design._merge_target has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 3 (5 pts), boolean chains 4, 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.
D2 · Cognitive Complexity · flow._annotation_matches_value (cognitive 18) · ×1
  • flow._annotation_matches_value (cognitive 18) REDACTED:187 — flow._annotation_matches_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · io._check_relation (cognitive 18) · ×1
  • io._check_relation (cognitive 18) src/xeda/_internal/flow/io.py:457 — io._check_relation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SimFlow.check_results (cognitive 18) · ×1
  • SimFlow.check_results (cognitive 18) src/xeda/_internal/flow/sim.py:646 — SimFlow.check_results has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · chains._link (cognitive 18) · ×1
  • chains._link (cognitive 18) src/xeda/_internal/flow_runner/chains.py:358 — chains._link has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, error handling 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlowLauncher._refuse_unaccepted_request (cognitive 18) · ×1
  • FlowLauncher._refuse_unaccepted_request (cognitive 18) src/xeda/_internal/flow_runner/default_runner.py:2348 — FlowLauncher._refuse_unaccepted_request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, ternaries 3, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · node_settings._problems (cognitive 18) · ×1
  • node_settings._problems (cognitive 18) src/xeda/_internal/flow_runner/node_settings.py:67 — node_settings._problems has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), ternaries 1 (3 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.
D2 · Cognitive Complexity · outputs._design_record (cognitive 18) · ×1
  • outputs._design_record (cognitive 18) src/xeda/_internal/flow_runner/outputs.py:184 — outputs._design_record has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · related_inputs._advice (cognitive 18) · ×1
  • related_inputs._advice (cognitive 18) src/xeda/_internal/flow_runner/related_inputs.py:149 — related_inputs._advice has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (3 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.
D2 · Cognitive Complexity · resolver.check_settings_without_design (cognitive 18) · ×1
  • resolver.check_settings_without_design (cognitive 18) src/xeda/_internal/flow_runner/resolver.py:759 — resolver.check_settings_without_design has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · iverilog.icarus_evidence (cognitive 18) · ×1
  • iverilog.icarus_evidence (cognitive 18) src/xeda/_internal/flows/iverilog/__init__.py:101 — iverilog.icarus_evidence has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (5 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · OpenroadStage._check_liberty_units (cognitive 18) · ×1
  • OpenroadStage._check_liberty_units (cognitive 18) src/xeda/_internal/flows/openroad/base.py:424 — OpenroadStage._check_liberty_units has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · verilator.parse_end_record (cognitive 18) · ×1
  • verilator.parse_end_record (cognitive 18) src/xeda/_internal/flows/verilator/__init__.py:54 — verilator.parse_end_record has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (5 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · derive._ties (cognitive 18) · ×1
  • derive._ties (cognitive 18) src/xeda/_internal/platforms/derive.py:667 — derive._ties has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · model.leaf_annotation (cognitive 18) · ×1
  • model.leaf_annotation (cognitive 18) src/xeda/_internal/platforms/model.py:410 — model.leaf_annotation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Session.take_lock (cognitive 18) · ×1
  • Session.take_lock (cognitive 18) src/xeda/_internal/remote/agent.py:877 — Session.take_lock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sweep._check_points (cognitive 18) · ×1
  • sweep._check_points (cognitive 18) src/xeda/_internal/sweep.py:1136 — sweep._check_points has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 6 (9 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Tool.__init__ (cognitive 18) · ×1
  • Tool.__init__ (cognitive 18) src/xeda/_internal/tool.py:312 — Tool.__init__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · tree_outputs._visit (cognitive 18) · ×1
  • tree_outputs._visit (cognitive 18) src/xeda/_internal/tree_outputs.py:133 — tree_outputs._visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (6 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · conf._clean_signature (cognitive 17) · ×1
  • conf._clean_signature (cognitive 17) docs/conf.py:127 — conf._clean_signature has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 4 (7 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · board.board_entry (cognitive 17) · ×1
  • board.board_entry (cognitive 17) src/xeda/_internal/board.py:120 — board.board_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 4, ternaries 1 (3 pts), loops 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cli_utils.print_flow_settings (cognitive 17) · ×1
  • cli_utils.print_flow_settings (cognitive 17) src/xeda/_internal/cli_utils.py:850 — cli_utils.print_flow_settings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, ternaries 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Deliveries._copy (cognitive 17) · ×1
  • Deliveries._copy (cognitive 17) src/xeda/_internal/deliver.py:1553 — Deliveries._copy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · FileResource.__init__ (cognitive 17) · ×1
  • FileResource.__init__ (cognitive 17) src/xeda/_internal/design.py:504 — FileResource.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, ternaries 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · ChiselGenerator.execution_command (cognitive 17) · ×1
  • ChiselGenerator.execution_command (cognitive 17) src/xeda/_internal/design.py:2270 — ChiselGenerator.execution_command has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Design._source_entries (cognitive 17) · ×1
  • Design._source_entries (cognitive 17) src/xeda/_internal/design.py:4529 — Design._source_entries has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 2 (5 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · scrub._run_directories_in (cognitive 17) · ×1
  • scrub._run_directories_in (cognitive 17) src/xeda/_internal/flow_runner/scrub.py:154 — scrub._run_directories_in has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Ghdl.find_top (cognitive 17) · ×1
  • Ghdl.find_top (cognitive 17) src/xeda/_internal/flows/ghdl/__init__.py:255 — Ghdl.find_top has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 1 (3 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Iverilog.check_design_supported (cognitive 17) · ×1
  • Iverilog.check_design_supported (cognitive 17) src/xeda/_internal/flows/iverilog/__init__.py:317 — Iverilog.check_design_supported has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 2, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · nextpnr_constraints._net_bits (cognitive 17) · ×1
  • nextpnr_constraints._net_bits (cognitive 17) src/xeda/_internal/flows/nextpnr_constraints.py:160 — nextpnr_constraints._net_bits has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (7 pts), ternaries 1 (5 pts), if/else 1 (3 pts), boolean chains 1, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PdnGroup.problems (cognitive 17) · ×1
  • PdnGroup.problems (cognitive 17) src/xeda/_internal/flows/openroad/place_groups.py:774 — PdnGroup.problems has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Sby._failure_text (cognitive 17) · ×1
  • Sby._failure_text (cognitive 17) src/xeda/_internal/flows/sby/__init__.py:1003 — Sby._failure_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Xezim.run (cognitive 17) · ×1
  • Xezim.run (cognitive 17) src/xeda/_internal/flows/xezim.py:418 — Xezim.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), loops 2, ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · introspect._field_entries (cognitive 17) · ×1
  • introspect._field_entries (cognitive 17) src/xeda/_internal/introspect.py:538 — introspect._field_entries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 5, ternaries 2 (4 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · residue.effective_residue (cognitive 17) · ×1
  • residue.effective_residue (cognitive 17) src/xeda/_internal/platforms/residue.py:630 — residue.effective_residue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3, boolean chains 1, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · proc_utils._copy_from_terminal (cognitive 17) · ×1
  • proc_utils._copy_from_terminal (cognitive 17) src/xeda/_internal/proc_utils.py:605 — proc_utils._copy_from_terminal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Project.load (cognitive 17) · ×1
  • Project.load (cognitive 17) src/xeda/_internal/project.py:87 — Project.load has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 2 (3 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · records.record_of (cognitive 17) · ×1
  • records.record_of (cognitive 17) src/xeda/_internal/records.py:1348 — records.record_of has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 4 (5 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Session.run (cognitive 17) · ×1
  • Session.run (cognitive 17) src/xeda/_internal/remote/agent.py:814 — Session.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 2, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Session.sync (cognitive 17) · ×1
  • Session.sync (cognitive 17) src/xeda/_internal/remote/agent.py:912 — Session.sync has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · _Sweep.__init__ (cognitive 17) · ×1
  • _Sweep.__init__ (cognitive 17) src/xeda/_internal/sweep.py:634 — _Sweep.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Tool._start (cognitive 17) · ×1
  • Tool._start (cognitive 17) src/xeda/_internal/tool.py:730 — Tool._start has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, ternaries 3 (6 pts), if/else 4, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · tool_store._release_asset (cognitive 17) · ×1
  • tool_store._release_asset (cognitive 17) REDACTED:332 — tool_store._release_asset has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 6, ternaries 5. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · bump_ci_pins.main (cognitive 16) · ×1
  • bump_ci_pins.main (cognitive 16) .github/scripts/bump_ci_pins.py:867 — bump_ci_pins.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · code_epoch._imported_modules (cognitive 16) · ×1
  • code_epoch._imported_modules (cognitive 16) src/xeda/_internal/code_epoch.py:151 — code_epoch._imported_modules has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), loops 2 (4 pts), ternaries 1 (4 pts), boolean chains 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · code_epoch._module_files (cognitive 16) · ×1
  • code_epoch._module_files (cognitive 16) src/xeda/_internal/code_epoch.py:203 — code_epoch._module_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PhysicalClock.root_validate_phys_clock (cognitive 16) · ×1
  • PhysicalClock.root_validate_phys_clock (cognitive 16) src/xeda/_internal/flow/synth.py:90 — PhysicalClock.root_validate_phys_clock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FlowLauncher.run_flow (cognitive 16) · ×1
  • FlowLauncher.run_flow (cognitive 16) src/xeda/_internal/flow_runner/default_runner.py:2291 — FlowLauncher.run_flow has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 2 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · error_codes.public_error (cognitive 16) · ×1
  • error_codes.public_error (cognitive 16) src/xeda/_internal/flow_runner/error_codes.py:453 — error_codes.public_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · resolver._components (cognitive 16) · ×1
  • resolver._components (cognitive 16) src/xeda/_internal/flow_runner/resolver.py:541 — resolver._components has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · trace_inputs._programs (cognitive 16) · ×1
  • trace_inputs._programs (cognitive 16) src/xeda/_internal/flow_runner/trace_inputs.py:833 — trace_inputs._programs has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 3 (5 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BscSim._link_flags (cognitive 16) · ×1
  • BscSim._link_flags (cognitive 16) src/xeda/_internal/flows/bsc/__init__.py:2019 — BscSim._link_flags has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · GhdlSynth.run (cognitive 16) · ×1
  • GhdlSynth.run (cognitive 16) src/xeda/_internal/flows/ghdl/__init__.py:388 — GhdlSynth.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GhdlSim.elaborate (cognitive 16) · ×1
  • GhdlSim.elaborate (cognitive 16) src/xeda/_internal/flows/ghdl/__init__.py:624 — GhdlSim.elaborate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Nvc.simulation_evidence (cognitive 16) · ×1
  • Nvc.simulation_evidence (cognitive 16) src/xeda/_internal/flows/nvc/__init__.py:417 — Nvc.simulation_evidence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, ternaries 2 (3 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Openfpgaloader.run (cognitive 16) · ×1
  • Openfpgaloader.run (cognitive 16) src/xeda/_internal/flows/openfpgaloader.py:976 — Openfpgaloader.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 1 (3 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Sby.run (cognitive 16) · ×1
  • Sby.run (cognitive 16) src/xeda/_internal/flows/sby/__init__.py:850 — Sby.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3, boolean chains 2, loops 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · VivadoPower.parse_power_report (cognitive 16) · ×1
  • VivadoPower.parse_power_report (cognitive 16) REDACTED:139 — VivadoPower.parse_power_report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · xilinx.find_xilinx_layout (cognitive 16) · ×1
  • xilinx.find_xilinx_layout (cognitive 16) src/xeda/_internal/flows/xilinx.py:110 — xilinx.find_xilinx_layout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 2, loops 1 (2 pts), ternaries 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · xilinx.locate_part_data (cognitive 16) · ×1
  • xilinx.locate_part_data (cognitive 16) src/xeda/_internal/flows/xilinx.py:307 — xilinx.locate_part_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Result.__str__ (cognitive 16) · ×1
  • Result.__str__ (cognitive 16) src/xeda/_internal/outcomes.py:242 — Result.__str__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · outcomes.aggregate (cognitive 16) · ×1
  • outcomes.aggregate (cognitive 16) src/xeda/_internal/outcomes.py:146 — outcomes.aggregate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _LogTail.pump (cognitive 16) · ×1
  • _LogTail.pump (cognitive 16) src/xeda/_internal/remote/agent.py:399 — _LogTail.pump has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · provision._execute (cognitive 16) · ×1
  • provision._execute (cognitive 16) src/xeda/_internal/remote/provision.py:345 — provision._execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3, boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _Sweep._schedule (cognitive 16) · ×1
  • _Sweep._schedule (cognitive 16) src/xeda/_internal/sweep.py:926 — _Sweep._schedule has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sweep._execute_in_worker (cognitive 16) · ×1
  • sweep._execute_in_worker (cognitive 16) src/xeda/_internal/sweep.py:512 — sweep._execute_in_worker has cognitive complexity 16 (threshold 15). Drivers by points: error handling 4 (5 pts), if/else 3 (4 pts), ternaries 1 (3 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Tool._version_is_gte (cognitive 16) · ×1
  • Tool._version_is_gte (cognitive 16) src/xeda/_internal/tool.py:487 — Tool._version_is_gte has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Edited copy of a member (27 corresponding lines) · ×1
  • Edited copy of a member (27 corresponding lines) src/xeda/_internal/flows/iverilog/__init__.py:72 — src/xeda/_internal/flows/iverilog/__init__.py:72-98 | src/xeda/_internal/flows/nvc/__init__.py:384-412 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (22 corresponding lines) · ×1
  • Edited copy of a member (22 corresponding lines) src/xeda/_internal/sweep.py:323 — src/xeda/_internal/sweep.py:323-344 | src/xeda/_internal/sweep.py:356-379 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×1
  • Edited copy of a member (13 corresponding lines) src/xeda/_internal/flow/settings_group.py:322 — src/xeda/_internal/flow/settings_group.py:322-334 | src/xeda/_internal/flows/openroad/groups.py:126-138 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 20+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 20+ corresponding lines) src/xeda/_internal/pdk_cli.py:432 — src/xeda/_internal/pdk_cli.py:432-451 | src/xeda/_internal/remote/commands.py:566-591 | src/xeda/_internal/tools_cli.py:452-471 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×1
  • Edited copy of a member (9 corresponding lines) src/xeda/_internal/flows/openroad/base.py:146 — src/xeda/_internal/flows/openroad/base.py:146-154 | src/xeda/_internal/flows/openroad/base.py:158-168 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (3 corresponding lines) · ×1
  • Edited copy of a member (3 corresponding lines) src/xeda/_internal/outcomes.py:206 — src/xeda/_internal/outcomes.py:206-208 | src/xeda/_internal/plan.py:143-145 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×1
  • Edited copy of a member (7 corresponding lines) src/xeda/_internal/sweep.py:219 — src/xeda/_internal/sweep.py:219-225 | tools/asic_parity.py:1040-1046 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (1 corresponding lines) · ×1
  • Edited copy of a member (1 corresponding lines) src/xeda/_internal/deliver.py:421 — src/xeda/_internal/deliver.py:421-421 | src/xeda/_internal/sweep.py:1131-1133 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (2 corresponding lines) · ×1
  • Edited copy of a member (2 corresponding lines) src/xeda/_internal/remote/agent.py:752 — src/xeda/_internal/remote/agent.py:752-753 | src/xeda/_internal/remote/frames.py:70-72 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (26–27 lines × 2) · ×1
  • Duplicated block (26–27 lines × 2) src/xeda/_internal/flows/openroad/cts.py:231 — src/xeda/_internal/flows/openroad/cts.py:231-256 | src/xeda/_internal/flows/openroad/place.py:672-698 — 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. 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.
D4 · Code Duplication · Duplicated block (24–26 lines × 2) · ×1
  • Duplicated block (24–26 lines × 2) src/xeda/_internal/introspect.py:510 — src/xeda/_internal/introspect.py:510-533 | src/xeda/_internal/introspect.py:548-573 — 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. 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.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×1
  • Duplicated block (16 lines × 2) src/xeda/_internal/flow_runner/default_runner.py:2822 — src/xeda/_internal/flow_runner/default_runner.py:2822-2837 | src/xeda/_internal/flow_runner/default_runner.py:2968-2983 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (9–12 lines × 2) · ×1
  • Duplicated block (9–12 lines × 2) src/xeda/_internal/flows/ghdl/__init__.py:586 — src/xeda/_internal/flows/ghdl/__init__.py:586-594 | src/xeda/_internal/flows/nvc/__init__.py:228-239 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1
  • Duplicated block (6 lines × 3) src/xeda/_internal/flows/yosys/cxx_rtl.py:176 — src/xeda/_internal/flows/yosys/cxx_rtl.py:176-182 | src/xeda/_internal/flows/yosys/yosys.py:990-995 | src/xeda/_internal/flows/yosys/yosys_fpga.py:1218-1225 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `src/xeda/_internal/flows/yosys/cxx_rtl.py:176` 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 first that the copies are not typed on the same thing: `GhdlSynth` names `...flows.ghdl` in one and `..ghdl` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×1
  • Duplicated block (11 lines × 2) REDACTED:463 — REDACTED:463-473 | src/xeda/_internal/flows/yosys/yosys_fpga.py:412-423 — 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. 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.
D4 · Code Duplication · Duplicated block (6 lines × 4) · ×1
  • Duplicated block (6 lines × 4) src/xeda/_internal/flows/openroad/cts.py:211 — src/xeda/_internal/flows/openroad/cts.py:211-216 | REDACTED:889-894 | src/xeda/_internal/flows/openroad/grt.py:289-294 | src/xeda/_internal/flows/openroad/place.py:634-639 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once. 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.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×1
  • Duplicated block (12 lines × 2) src/xeda/_internal/flows/openroad/final_groups.py:329 — src/xeda/_internal/flows/openroad/final_groups.py:329-340 | src/xeda/_internal/flows/openroad/grt_groups.py:518-529 — 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. 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.
D4 · Code Duplication · Edited copy of a member (25 corresponding lines) · ×1
  • Edited copy of a member (25 corresponding lines) examples/bluespec/uart_link/tb/lean_perf.py:197 — examples/bluespec/uart_link/tb/lean_perf.py:197-221 | examples/bluespec/uart_link/tb/lean_perf.py:258-287 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 4+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 4+ corresponding lines) examples/bluespec/uart_link/tb/lean_arq.py:22 — examples/bluespec/uart_link/tb/lean_arq.py:22-25 | examples/bluespec/uart_link/tb/lean_credit.py:28-31 | examples/bluespec/uart_link/tb/lean_perf.py:17-20 | examples/bluespec/uart_link/tb/lean_sizes.py:24-27 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (25 lines × 2) · ×1
  • Duplicated block (25 lines × 2) examples/bluespec/ascon/tb/generate_vectors.py:160 — examples/bluespec/ascon/tb/generate_vectors.py:160-184 | examples/bluespec/ascon/tb/generate_vectors.py:294-318 — 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 `examples/bluespec/ascon/tb/generate_vectors.py:160` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `examples/bluespec/ascon/tb/generate_vectors.py:157` calls `enumerate`, `pattern` and `examples/bluespec/ascon/tb/generate_vectors.py:293` 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.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×1
  • Duplicated block (17 lines × 2) examples/bluespec/ascon/tb/generate_vectors.py:257 — examples/bluespec/ascon/tb/generate_vectors.py:257-273 | examples/bluespec/ascon/tb/generate_vectors.py:319-335 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `examples/bluespec/ascon/tb/generate_vectors.py:257` 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.
D4 · Code Duplication · Duplicated block (15 lines × 3) · ×1
  • Duplicated block (15 lines × 3) examples/bluespec/ascon/tb/generate_vectors.py:173 — examples/bluespec/ascon/tb/generate_vectors.py:173-187 | examples/bluespec/ascon/tb/generate_vectors.py:272-286 | examples/bluespec/ascon/tb/generate_vectors.py:307-321 — 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 `examples/bluespec/ascon/tb/generate_vectors.py:173` 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.
D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) examples/bluespec/uart_link/host/leanlink/applications.py:66 — examples/bluespec/uart_link/host/leanlink/applications.py:66-72 | examples/bluespec/uart_link/host/leanlink/applications.py:105-112 — 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. 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.
D6 · Cohesion (LCOM4) · Low cohesion · ×1
  • Low cohesion: OpenroadStage (LCOM4 4) src/xeda/_internal/flows/openroad/base.py:332 — OpenroadStage'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.
P1 · CI/CD gates · CI formatting step cannot fail · ×1
  • CI formatting step cannot fail REDACTED:333 — `python -m tox -e mypy,black,ruff,consumer-typing` invokes black in the mode that REWRITES the files it reformats and exits 0 whatever it changed. The rewrite happens inside the runner's throwaway checkout and is then discarded, so the step passes on a badly-formatted change exactly as it passes on a clean one — it enforces nothing, and no other step in this file reads the result. `--check` is the flag that turns the same invocation into a gate: it leaves the files alone and exits non-zero when anything would have been reformatted.
Minor — 69 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×37
  • Duplicated predicate src/xeda/_internal/flows/vcs_evidence.py:95 — `actual is None or tick is None or tick <= 0 or actual % tick` appears character-identically in 2 files — src/xeda/_internal/flows/vcs_evidence.py, src/xeda/_internal/flows/vivado/sim_evidence.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 REDACTED:975 — `declaration.cardinality == "optional" and declaration.enabled_by is None` appears character-identically in 2 files — REDACTED, src/xeda/_internal/flow/io.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 src/xeda/_internal/flow/sim_evidence.py:49 — `evidence.time is not None and evidence.time < 0` appears character-identically in 2 files — src/xeda/_internal/flow/sim_evidence.py, src/xeda/_internal/flows/bsc/sim_evidence.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 src/xeda/_internal/flow_runner/default_runner.py:2230 — `flow.results.get("artifacts") or flow.artifacts` appears character-identically in 2 files — src/xeda/_internal/flow_runner/default_runner.py, src/xeda/_internal/flow_runner/trace_inputs.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 src/xeda/_internal/flows/fpga_pack.py:130 — `fpga.part and fpga.device and fpga.package and fpga.pins and fpga.speed` appears character-identically in 2 files — src/xeda/_internal/flows/fpga_pack.py, REDACTED. 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 src/xeda/_internal/board.py:273 — `info.field_name is not None and info.data is None` appears character-identically in 6 files — src/xeda/_internal/board.py, src/xeda/_internal/dataclass.py, src/xeda/_internal/design.py, REDACTED. 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 .github/scripts/bump_ci_pins.py:444 — `isinstance(a, dict) and a.get("name") == name` appears character-identically in 2 files — .github/scripts/bump_ci_pins.py, REDACTED. 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 REDACTED:1762 — `isinstance(cls, type) and issubclass(cls, Flow)` appears character-identically in 2 files — REDACTED, src/xeda/_internal/flow_runner/code_digest.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 src/xeda/_internal/flow_runner/launch_producers.py:158 — `isinstance(error, DeliveryError) and error.before_run` appears character-identically in 2 files — src/xeda/_internal/flow_runner/launch_producers.py, src/xeda/_internal/flow_runner/launch_result.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 src/xeda/_internal/flows/fpga_pack.py:164 — `isinstance(inputs, self.Inputs) and isinstance(declared, self.Outputs)` appears character-identically in 3 files — src/xeda/_internal/flows/fpga_pack.py, REDACTED, src/xeda/_internal/flows/vivado/vivado_impl.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 src/xeda/_internal/flows/vivado/vivado_synth.py:86 — `isinstance(v, str) and not re.match(r"\d+'b[01]+", v)` appears character-identically in 2 files — src/xeda/_internal/flows/vivado/vivado_synth.py, src/xeda/_internal/flows/yosys/common.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 src/xeda/_internal/cli_utils.py:687 — `isinstance(value, (int, float)) and not isinstance(value, bool)` appears character-identically in 4 files — src/xeda/_internal/cli_utils.py, src/xeda/_internal/dataclass.py, src/xeda/_internal/flow/metrics.py, src/xeda/_internal/flows/dc/__init__.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 REDACTED:756 — `isinstance(value, (str, list, tuple, set, frozenset, dict)) and len(value) == 0` appears character-identically in 2 files — REDACTED, src/xeda/_internal/flow/io.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 src/xeda/_internal/flows/openroad/base.py:82 — `isinstance(value, bool) or not isinstance(value, (int, float)) or not math.isfinite(value)` appears character-identically in 2 files — src/xeda/_internal/flows/openroad/base.py, src/xeda/_internal/flows/openroad/metrics.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 src/xeda/_internal/cli_utils.py:595 — `isinstance(value, int) and not isinstance(value, bool)` appears character-identically in 4 files — src/xeda/_internal/cli_utils.py, src/xeda/_internal/dataclass.py, src/xeda/_internal/design.py, src/xeda/_internal/flow/metrics.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 REDACTED:1275 — `isinstance(value, str) and _is_comma_separated_list(annotation)` appears character-identically in 2 files — REDACTED, src/xeda/_internal/flow/settings_group.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 src/xeda/_internal/remote/packaging.py:331 — `isinstance(value, str) and os.path.isabs(value)` appears character-identically in 2 files — src/xeda/_internal/remote/packaging.py, REDACTED. 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 src/xeda/_internal/flow_runner/dse/dse_runner.py:115 — `module == IMPL or module.startswith(f"{IMPL}.")` appears character-identically in 2 files — src/xeda/_internal/flow_runner/dse/dse_runner.py, tools/api_baseline.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 src/xeda/_internal/design.py:1387 — `name.startswith(".") and not pattern.startswith(".")` appears character-identically in 2 files — src/xeda/_internal/design.py, src/xeda/_internal/tree_outputs.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 src/xeda/_internal/design.py:3267 — `not isinstance(name, str) or not DESIGN_NAME.fullmatch(name)` appears character-identically in 2 files — src/xeda/_internal/design.py, src/xeda/_internal/workspace.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 src/xeda/_internal/records.py:307 — `not isinstance(node, Mapping) or segment not in node` appears character-identically in 2 files — src/xeda/_internal/records.py, tools/asic_parity.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 src/xeda/_internal/design.py:1965 — `not isinstance(value, (str, os.PathLike)) or not os.fspath(value)` appears character-identically in 2 files — src/xeda/_internal/design.py, src/xeda/_internal/remote/packaging.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 src/xeda/_internal/pdk_cli.py:393 — `not yes and not click.confirm("Install now?", default=False)` appears character-identically in 2 files — src/xeda/_internal/pdk_cli.py, src/xeda/_internal/tools_cli.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 src/xeda/_internal/dataclass.py:629 — `origin in (dict, Mapping) or annotation in (dict, Mapping)` appears character-identically in 2 files — src/xeda/_internal/dataclass.py, src/xeda/_internal/introspect.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 src/xeda/_internal/deliver.py:288 — `os.fspath(leaf) and Path(leaf).is_absolute()` appears character-identically in 2 files — src/xeda/_internal/deliver.py, REDACTED. 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.
  • + 12 more in this group — see findings.md.
X23 · Unguarded diagnostic materialisation · Diagnostic log message is built whether or not it is wanted · ×8
  • Diagnostic log message is built whether or not it is wanted REDACTED:569 — `debug` at line 569 is called with an argument built by `"…".join(sorted(environ))` (line 569), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/xeda/_internal/flows/openfpgaloader.py:759 — `debug` at line 759 is called with an argument built by `"…".join(args)` (line 759), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/xeda/_internal/flows/vivado/vivado_synth.py:1123 — `debug` at line 1123 is called with an argument built by `"…".join(str(s) for s in xdc_files)` (line 1123), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/xeda/_internal/flows/vivado/vivado_synth.py:1124 — `debug` at line 1124 is called with an argument built by `"…".join(str(s) for s in tcl_files)` (line 1124), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/xeda/_internal/flows/dc/__init__.py:81 — `debug` at line 81 is called with an argument built by `"…".join(splitted[: i])` (line 81), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/xeda/_internal/flows/dc/__init__.py:567 — `debug` at line 567 is called with an argument built by `"…".join(sorted(clocks))` (line 571), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/xeda/_internal/flow_runner/launch_locks.py:118 — `debug` at line 118 is called with an argument built by `"…".join(sorted(late))` (line 118), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted src/xeda/_internal/flow_runner/dse/dse_runner.py:983 — `debug` at line 983 is called with an argument built by `{ k : optimizer.best.results.get(k) for k in results_sub }` (line 985), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
X4 · Structured logging · Interpolated log message defeats structured logging · ×7
  • Interpolated log message defeats structured logging src/xeda/_internal/design.py:2316 — `info` at line 2316 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging src/xeda/_internal/tool.py:450 — `debug` at line 450 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 src/xeda/_internal/tool.py:495 — `debug` at line 495 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 src/xeda/_internal/flows/vcs.py:553 — `error` at line 553 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 src/xeda/_internal/flows/vcs.py:564 — `error` at line 564 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 src/xeda/_internal/flows/dc/__init__.py:81 — `debug` at line 81 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 src/xeda/_internal/flow_runner/dse/dse_runner.py:981 — `info` at line 981 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
X7 · Silent fallback defaults · Silent fallback default on parse failure · ×6
  • Silent fallback default on parse failure src/xeda/_internal/cli.py:686 — `_request_table` returns `{}` when `ValueError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure src/xeda/_internal/code_epoch.py:161 — `_imported_modules` returns `set()` when `(OSError, SyntaxError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure src/xeda/_internal/flow_runner/launch_generation.py:841 — `misplaced_hint` returns `''` when `(ValidationError, ValueError, OSError, GenerationError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure src/xeda/_internal/flow_runner/trace.py:545 — `_changed_settings` returns `'(the previous settings were not recorded)'` when `(OSError, ValueError, KeyError, TypeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure src/xeda/_internal/platforms/providers.py:395 — `_nodeinfo` returns `[]` when `(ValueError, AttributeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure src/xeda/_internal/records.py:1203 — `_source_digest` returns `''` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found REDACTED:73 — 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/`. ADRs are expected here because `REDACTED` makes this repository a deployable product (line 73).
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion REDACTED:1 — `(repository root)` (104714 LoC, 917 module-visible types across 34 directories) overshoots its size bounds. 1 of 2 build unit(s) (Python) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D28 · Secrets (history) · Rotate the exposed credentials · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P4 · Deployment & Rollback · No release approval gate · ×1
  • No release approval gate REDACTED:35 — The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
X6 · Hand-rolled structured-format parsing · Hand-rolled JSON/XML parsing via regex · ×1
  • Hand-rolled JSON/XML parsing via regex REDACTED:113 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Minor — 1 finding(s)
D12 · Dependency Hygiene · Dependency hygiene PARTLY measured · ×1
  • Dependency hygiene PARTLY measured — Python dependencies read, no exact pin to grade for currency — This repository's Python dependencies were read: 3 shipped distribution(s) across 2 manifest(s) (25 development or optional declaration(s) excluded, because a consumer does not install them). Whether any of them is behind its current release is the dependency-CURRENCY question, and no declaration here carries an EXACT pin to ask it about — every one is a floor or a range, which installs the newest release it admits and therefore cannot be behind one. That is a healthy declaration style, NOT a defect and NOT a gap in this analyzer; there is simply no currency question to answer. This is NOT a finding that these dependencies are current or healthy. Lockfiles are deliberately not read (poetry.lock, uv.lock, Pipfile.lock, pdm.lock): the four disagree about dev/optional membership, and misreading one would charge a test-only package a consumer never receives. Known CVEs in the same dependency graph are a separate question, reported under D30.

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.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-cd5db5c4fce9453bb7705c849264fbc0/history.json --exit-code 0 --source .1artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=800" --report-format json --report-path /tmp/watchdog-gitleaks-cd5db5c4fce9453bb7705c849264fbc0/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=1000 --max-count=418" --report-format json --report-path /tmp/watchdog-gitleaks-cd5db5c4fce9453bb7705c849264fbc0/history-2.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-2.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-cd5db5c4fce9453bb7705c849264fbc0/tree.json --exit-code 0 --source .1artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .51artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json

Run 01a1e978-0d3a-78d4-a3f0-8591252493b1 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

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.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md