{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"FlowLauncher._launch (cyclomatic 98): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fc839fda4d39920b0fb24c4be1b76508c570e956d26c11f343e18500717655"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver.resolve (cyclomatic 85): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b76ab64de70d75991fd0bddfe0568a20b1e973673790bfa9c6ba367c275dbd"}},{"ruleId":"D1","level":"warning","message":{"text":"cli_settings_completion._parse_request_words (cyclomatic 68): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_settings_completion.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"28adca3a6bb435940c7e49ac50aeddfbbc93b5588aa958e06a7509179640c70f"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowLauncher._request (cyclomatic 68): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ab4421292232b518dada42dc194a2e93444ee285e74a7d902cde3e3ae27dc6"}},{"ruleId":"D1","level":"warning","message":{"text":"Vcs.run (cyclomatic 66): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vcs.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"317a65ab43534bbc083cc8264df958264df18920217523d39828a5733a978212"}},{"ruleId":"D1","level":"warning","message":{"text":"Dse.run_flow (cyclomatic 58): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/dse_runner.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"82304d1c2d1df5ffbecbb59eabce6c9e26d1dcbd127b39e180abfcc243ff0fe2"}},{"ruleId":"D1","level":"warning","message":{"text":"trace.check_trace (cyclomatic 49): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"a273f1603471e0b126efb4f2da65e8fe531b4b28ecdad314b6388b2f6a01f896"}},{"ruleId":"D1","level":"warning","message":{"text":"Verilator.run (cyclomatic 46): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/verilator/__init__.py"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa47eed4e082da0cfdc75e1ce28f4b59887a2f2ce01d38cc73ad75fc53232430"}},{"ruleId":"D1","level":"warning","message":{"text":"sim_evidence.parse_xsim_evidence (cyclomatic 46): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/sim_evidence.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"014bbeeeb9f013bf89c6ee45cebd29daf7e0c12760aa5dfcb1e91d257442eabb"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.run (cyclomatic 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli.py"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1855cb2fa00e3efe67abea1c9a178ab519d1fb6a2f9d080482c7c99ea8da6855"}},{"ruleId":"D1","level":"warning","message":{"text":"plan_freshness.judge_node (cyclomatic 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/plan_freshness.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"4663d85da59374de8aea82ac1f8e5e92d54f4f5a2c0bbd9711ebd105bb2db9bf"}},{"ruleId":"D1","level":"warning","message":{"text":"sim_evidence.parse_modelsim_evidence (cyclomatic 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/modelsim/sim_evidence.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9216919b7ed4d751fe83cec14aa9e406ca5359eb0b372a29a390595abcb04c32"}},{"ruleId":"D1","level":"warning","message":{"text":"dataclass.scalar_problems (cyclomatic 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c023aa5234ea4d83590f85d5b07c789197c83f61bf0271d3296dbe29e467a9e7"}},{"ruleId":"D1","level":"warning","message":{"text":"vcs_evidence.parse_vcs_evidence (cyclomatic 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vcs_evidence.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"35555ccadc5b70bb3f267d5c438d8a30b05d91fb8e2c59577a118a170fc4f6b0"}},{"ruleId":"D1","level":"warning","message":{"text":"sby.timing_problems (cyclomatic 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"182a60c5c6502a3793e29e039c84d980af5a77911dcbbe4a133afa079b0b58c3"}},{"ruleId":"D1","level":"warning","message":{"text":"launch_run.execute (cyclomatic 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_run.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1821e5882aab49d9c439f7c9c5b7495df4907d014fa3d088fd1fe095fc2fc78"}},{"ruleId":"D1","level":"warning","message":{"text":"Nextpnr.run (cyclomatic 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr.py"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"01597390364607cd66dc5067d5b9d73cdf00698b7e01235f9b2ce3c73a35af1f"}},{"ruleId":"D1","level":"warning","message":{"text":"design.generated_declarations (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"446bafa9317b453cedaf9a0125fb3aa1d61ddd464c248d153cf00aca848db31d"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver._normalized_leaves (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b19a66c40a1628937b266ba14c6ab75b826a9b5b9dc0961c63df70381e6280"}},{"ruleId":"D1","level":"warning","message":{"text":"Openfpgaloader._probe_arguments (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openfpgaloader.py"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"165f37954b74addee6a0a0c671c828161107806b3256de1f467be95a3331590d"}},{"ruleId":"D1","level":"warning","message":{"text":"BscSim.run (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/bsc/__init__.py"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef1d71a49c2e791c960a633b391cf0d9bcf3d186aee23f2d6ae4ee3307b2760"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings.pass_flag_conflicts (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys_fpga.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0622c64800196b7639e7775510e0f42ae93600f0a25837d7ca244ebb48c3904"}},{"ruleId":"D1","level":"warning","message":{"text":"sim.judge_evidence (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b2091937f52c0fb5b3c92dd78b4920f00ce7a5f135490e6795e8968580e4ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Yosys.asic_values (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys.py"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"169c2054ada340d22ef3cb921816292ed4b6ae90ca617cf3834db9f77b609503"}},{"ruleId":"D1","level":"warning","message":{"text":"launch_generation.settle (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_generation.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d93196b566bb86ab69250776f5d29128e94984194ec83d4c16ff07f5c5a28ea"}},{"ruleId":"D1","level":"warning","message":{"text":"upstream.read_orfs_config_mk (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/upstream.py"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4c158d258dbd99ae3c9d4d12391da727bc1dc72851aa4bdb7c8537eb1e8de0"}},{"ruleId":"D1","level":"warning","message":{"text":"settings_layers._merge_settings_layer (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/settings_layers.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5942aad0823e49bee825ae3fcbe1add88aa551e7b43e160b9a32d25654021b"}},{"ruleId":"D1","level":"warning","message":{"text":"GhdlSim.run (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"072d287f39337ccdd5b465247c8dc98bb4f7be49de5e613c78e009f9556caa6b"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenroadPlace.check_settings_supported (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place.py"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"1148cf9bb3b95840396d6e61f91a16a4c1555e32bcd73877331675581300ccd4"}},{"ruleId":"D1","level":"warning","message":{"text":"cli_utils.print_results (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_utils.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5c51e4fd85af42c48d7bc9237f9333290cec320ce54de33332fcd556d0c6a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Nextpnr.target_for_settings (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr.py"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad934c13d414cd092938c521ff8d70d019afc746404ea0761a4fa47acf19bef"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings.synth_command (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys_fpga.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6921d2d3c2e997a6d8dc4fe9e8f541d2a9b663cb357474b7c7da63feb20d056"}},{"ruleId":"D1","level":"warning","message":{"text":"Design._target_overlay (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3688}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d99d529ac51911ca488331fa669e2b56437b769bab7c6e959b707939d7632e"}},{"ruleId":"D1","level":"warning","message":{"text":"settings_group._declaration_problems (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/settings_group.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"721390ceeb7fad47b2e15a973ab7ede882f0062fda33bdfc89f15f7d646f9b2a"}},{"ruleId":"D1","level":"warning","message":{"text":"proc_utils._run_copying (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/proc_utils.py"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b040fb8dcf7d6e962fda8a5e478e40bec6c16a9de0b625763997a9fa7fe0ef"}},{"ruleId":"D1","level":"warning","message":{"text":"sim_evidence.parse_nvc_log (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim_evidence.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d69bfadfc5ccf26581e4f93a4660e0367ef6829db9ebcda162d03efcf40fbd9"}},{"ruleId":"D1","level":"warning","message":{"text":"outputs.record_outputs (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/outputs.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd8cd499185d1a48dc1ccb49f1bffcd49b99912e555cedf8da7fe729af63fdb"}},{"ruleId":"D1","level":"warning","message":{"text":"nextpnr_constraints._commands (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr_constraints.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2773b5d6544b8ee3fc50bcaee3171b749c7c7c7f2fd706f06c1309f1fde79418"}},{"ruleId":"D1","level":"warning","message":{"text":"def2stream.merge_gds (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/data/def2stream.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf8ae087c6a4a6fffcc1d4579a730a0092ecc601022f92c34492f09148c2e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"place.effective (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa1e57f3c0dd7c3fc543742a3ce21123a62125b135b9143e3f25bd1bfd5e9d1"}},{"ruleId":"D1","level":"warning","message":{"text":"FloorplanGroup.problems (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place_groups.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a582a79963a4f2c98e2509eccfc3cd860e390ab172f80ad3a1a11984b382ab55"}},{"ruleId":"D1","level":"warning","message":{"text":"FPGA._fpga_root_validator (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/fpga.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d6ccfa8941bd766b47cab8f285c4022cdcd1508a90d3b57e0510f77883558c"}},{"ruleId":"D1","level":"warning","message":{"text":"Yosys.run (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e38e60f6e601c433bc3e0b977c6fd26a5d05798b9e9affce32e0db53fa88e7"}},{"ruleId":"D1","level":"warning","message":{"text":"FmaxOptimizer.update_bounds (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/fmax.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e2d30fd08855faa7bde3a3ceff43bd48e57de9c008ca93bdd99d39d00181bd"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver._pin_pdks (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c4c0b735d00829c8680166b994b733b6ba93fb6b4e3255b4b9c95eb71f7679"}},{"ruleId":"D1","level":"warning","message":{"text":"RepairTiming.problems (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/groups.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"80031de6188e03673b931c192f4138651222e22f4efe50371b159080a54b0980"}},{"ruleId":"D1","level":"warning","message":{"text":"Design._merged_with (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":4166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae7f626911560abe84a965af27d1d1b66be808ec938c28309075b23d13156ce"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_catalog.complete_builtin_request (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_catalog.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9e052ad1a17482f8dd383b3eee9599b09e7ec1a48f8ee4f88fa1d0cc7a86ae"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowLauncher.launch_flow (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5d711f72c65ca9ab2e835c71aa2f5c9e87f66f901056592398b007ba6f0454"}},{"ruleId":"D1","level":"warning","message":{"text":"Sby.check_results (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"13127a513014ea727e7a4202676b42e8744a797ef3be28147b5810d1634ed5c5"}},{"ruleId":"D1","level":"warning","message":{"text":"abc_strategies.composed_abc_script (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/abc_strategies.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b846fe2ad84468cbecaf7e240c0fbf595baa0296ef1cd8a37f27f2d6d45d3f"}},{"ruleId":"D1","level":"warning","message":{"text":"agent.clean (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/agent.py"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1bcc903be171cb15e61fe39dac661f74537b46a96476d9527c6ff2df75a361"}},{"ruleId":"D1","level":"warning","message":{"text":"client._run (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/client.py"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3d84868b489fa13d31cceacf93124e2a1ac99847ea69923238111a5f0cd008"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch.select_fetch (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/fetch.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d85a1a2faa83fe505d731bc7681ab69dae6fe142c61b8672b4fd763b73b3dc5"}},{"ruleId":"D1","level":"warning","message":{"text":"Docker.run (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b891dfc8b6ff084cf992ba4d9bd907039e23fcb75aa6751c6f0604807ef0752e"}},{"ruleId":"D1","level":"warning","message":{"text":"cli_settings_completion._settings_candidates (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_settings_completion.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2e5bcbc10c5f0229f012973ebdb5d56b6f09eef02fbe5f16502eae426f0c38"}},{"ruleId":"D1","level":"warning","message":{"text":"io.check_io_declarations (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/io.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3df5f42d348131ff26ffde5b91023d8eca27fcda072c110d278c78a4c373f00"}},{"ruleId":"D1","level":"warning","message":{"text":"Nvc.execute (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nvc/__init__.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cedd122edff311008373fdf05b44bb840ef5c930f6a95f58de35d8606ee48c"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.dse (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli.py"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f560ccf19319b7363d5c28155977b8f795c2e213bd202926aab6830cd4fe4836"}},{"ruleId":"D1","level":"warning","message":{"text":"Cocotb.env (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cocotb.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a139aac4fedc25af20c8979f897cada224819a81abbe81823820ec5b1f842c"}},{"ruleId":"D1","level":"warning","message":{"text":"edif._close (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/edif.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c8309e3774dff10e53b34edde2eed5f910866522ccb1683cd991b55eaaca63"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver._agree (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ef8267e8981fd4ce973170c8e238bfb582a856c7b83d749b27ee2bf28a7c18"}},{"ruleId":"D1","level":"warning","message":{"text":"trace_inputs.build_trace (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace_inputs.py"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfea27d2cc7d352a8cd7491c2d981fafa2a20c41d0a73a7db782f44002747d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Sby.check_design_supported (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e6b5e95204876be30952ba93a09e045da3db2868ed72be3c237c21c0f4fdd7"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings.synth_pass_only_conflicts (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys_fpga.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fc809f48e3655f1dcfd78af8a331c1ff6cd757b80ed5ff8b01a0eafeba9910"}},{"ruleId":"D1","level":"warning","message":{"text":"local_settings.local_settings (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/local_settings.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4035dd63d8b673a0107273ae7acaa6d21f2ec99443eabb5dd27e102741b7cf2"}},{"ruleId":"D1","level":"warning","message":{"text":"Design._select_target (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6124c015cf17b64c288780f06ab6932794d9129a7736494ee97505b12b38b906"}},{"ruleId":"D1","level":"warning","message":{"text":"SimFlow.check_design_supported (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"3958cc8d8cb9bebe77b36301548963757c533165c67569aa250937ea9bbefa45"}},{"ruleId":"D1","level":"warning","message":{"text":"bindings.node_bindings (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/bindings.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fccfb064f6af2a75fcd17411628f4b7b1d5bf13ce54ab16f25f9a0ec56fad64"}},{"ruleId":"D1","level":"warning","message":{"text":"launch_producers.run_producers (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_producers.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19a3e1d8831229591742a7d8989bd1f35c1a34140797992ad2bb69a5944e3ff"}},{"ruleId":"D1","level":"warning","message":{"text":"launch_result.launch_result (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_result.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a04e8789b49808e342b1d1409eb5c6cea5dce621ffdfef562f29b7f3678d842"}},{"ruleId":"D1","level":"warning","message":{"text":"nextpnr_constraints.reconcile_clocks (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr_constraints.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9967c35f970720f2a7371188f30d94dd94d3f15563710a21732406f7ec3daf"}},{"ruleId":"D1","level":"warning","message":{"text":"ArithmeticGroup.problems (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/asic_groups.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbded3bcd824787093ce45b9db1dcb30a7702550b13e178097a35e74e1a9cc50"}},{"ruleId":"D1","level":"warning","message":{"text":"generation.judge (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/generation.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4e4cf9d4fe0f0b5cb670cc0bcbd0430625f5c49675936f66bd59d11687ad73"}},{"ruleId":"D1","level":"warning","message":{"text":"derive.read_liberty_summary (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/derive.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1c12716f60c879d6ad4d9da57b4a9a5b701b82817966b0fc8c3939438f11c4"}},{"ruleId":"D1","level":"warning","message":{"text":"bump_ci_pins.find_update (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bump_ci_pins.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"16553ed1ed8b53011688704464abee0b17d29385449d925e132004d803cea092"}},{"ruleId":"D1","level":"warning","message":{"text":"agent_skill._flow_section (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/agent_skill.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c02cd713ce81645c98030065c3600798d98dce8841a5de720bfc5c6556971d"}},{"ruleId":"D1","level":"warning","message":{"text":"Deliveries.deliver (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/deliver.py"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9799317adf4afc47592ab9f6e3bd091cbf1113a6244c9504722130f8797a754"}},{"ruleId":"D1","level":"warning","message":{"text":"FmaxOptimizer.process_outcome (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/fmax.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"868b74917f162d81dc7e94dbd65ff20bf3d3352d4e1bea79a8fd14854f3f530f"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver._explicit (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"472d587484962a4113603c604ff8c1806a9d443e3f60d639f1dbd6fa024ed88a"}},{"ruleId":"D1","level":"warning","message":{"text":"nextpnr_constraints._words (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr_constraints.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"25549a19c9e6a59661b0588ac4a9f986f6351b2880924ee0761d71708b36365f"}},{"ruleId":"D1","level":"warning","message":{"text":"openfpgaloader_probes.parse_scan_usb (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openfpgaloader_probes.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d55ea4985635551061abc69519eb740f5b3d4357a9dc49aa1dfb9c6689307b"}},{"ruleId":"D1","level":"warning","message":{"text":"final.effective (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/final.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"382ac23f1949e20e92da3403c58da41e20c71e5ce5d2d530adcf67248bab3a31"}},{"ruleId":"D1","level":"warning","message":{"text":"client._finish (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/client.py"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da02ac9ac69c446aa826c21d7bee3c74af3f36d2e14669a5355513acf246faa"}},{"ruleId":"D1","level":"warning","message":{"text":"WithFpgaBoardSettings._fpga_validate (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/board.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"334c98aeb28db0d9d73481cca125bfc69d5f715430c66a4d09e8df8209115d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"GitReference.validate_repo (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3042}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ffc69145b871558e6da5e14cfcb0bedd4f1b9b056f4a1260d5c0a29fbb035b"}},{"ruleId":"D1","level":"warning","message":{"text":"Design._initialize (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3821}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bd75a32e7c3ec1dc2f737c24afddf76e9327807530e6abeb7b8e1c06c55cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"edif._modules (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/edif.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fd77034c1e9d2f2c3499c5f1e49ceb02725e8f8cccef5614a320387bf00d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow.map_keyed_path_leaves (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b751c76284ac4fb0cf0ed33230035450a76aaa644ee037fdb45ef06be1b4793a"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowLauncher._validate_plan (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"102c78b83c679442b3ba90780986c6e781164f7c424a9bb0c778f5dbda897ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"layer_paths._anchor (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/layer_paths.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd742f001d16a11275a750dd418ea7156b9d57f53bd6f497a28f75b5ed88fe22"}},{"ruleId":"D1","level":"warning","message":{"text":"IoGroup.problems (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place_groups.py"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce14b818dba3ff10d2427b8d7511b7e9808e113c76e0701c32b4647010db4e41"}},{"ruleId":"D1","level":"warning","message":{"text":"introspect.flow_chain_cells (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9575b6ce00d9dc1c6171e4b67142d4fa5a1ee538803fcc5729d63017a1a9644c"}},{"ruleId":"D1","level":"warning","message":{"text":"introspect.type_str (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca455047a4651c77258847423255566990c3400eb198b85bb926d19c53daf8b8"}},{"ruleId":"D1","level":"warning","message":{"text":"proc_utils.run_process (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/proc_utils.py"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"629da5259221f5224e59cd145176b88c363a89abf3127dc0d35a1bf955853f5f"}},{"ruleId":"D1","level":"warning","message":{"text":"commands._clean_host (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/commands.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cc7312f4b975b3154b32f37ca19b529474f80386cedecde8846cd142326ece"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool._sibling_executable (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"178a64b550052c5d546ddc7c55fd86f397dee7c60d43c583fea338b39a45abdd"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_store._release_asset (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool_store.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13ebb7006a9099da4743ea137a845332a1f3a169f9ffbeb41af5327a8a09eac"}},{"ruleId":"D1","level":"warning","message":{"text":"XedaBaseModel._booleans_are_not_text (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d407599e35a6ae9ae61093c9e0107eb8f4482983fa9716e53b29173d56d18f3"}},{"ruleId":"D1","level":"warning","message":{"text":"settings_group.render_flags (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/settings_group.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f06e8944c33ae22eb0c3fb476c7a98b23640b4b24c310ca103fcdfdf20168f"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings.get_flags (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5d330510937bcb2a836010c749bb9cf51e112c66aae8a06d1598c36dc1fa2e"}},{"ruleId":"D1","level":"warning","message":{"text":"Openroad.check_settings_supported (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/final.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"7363c02fa2e96761265ad5166738e47a2229fc837d96f307b9724bf0f39e3d6f"}},{"ruleId":"D1","level":"warning","message":{"text":"sby._staged_name (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d159a3f2f956e45a93eb56a39186294735de214f987b31af5ae47f734a2d42a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Xezim.run (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/xezim.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff5135fdf5a7d1163a57f80b6c40ccc5a69faaf4a3f7c2cc3a439500b42fd20"}},{"ruleId":"D1","level":"warning","message":{"text":"AbcGroup.problems (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/asic_groups.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5af8bbf2dca7cb6619b2d8be995ae2003004ef6c102a6fcd1fbce1392a16c57"}},{"ruleId":"D1","level":"warning","message":{"text":"introspect._in_field_units (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a484d111dd6068d0c0f7578f8752b31d9a8325ba572814cfadc7664c2e84b45"}},{"ruleId":"D1","level":"warning","message":{"text":"packaging.package_inputs (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/packaging.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12e52818cf63ac962240fdf4742d1f5c4a8b60396bcf71da310daa25022b401"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsCompletionMixin.get_completions (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_settings_completion.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"f548bd17b68b631c34e4405e65fcf8e8d934cc67c6b455147b7adc5d866eb294"}},{"ruleId":"D1","level":"warning","message":{"text":"flow._annotation_matches_value (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"40976428fd301c17dfdc2535520fa15e32fcaae6dfb616bfd03cb6d0c6d1230a"}},{"ruleId":"D1","level":"warning","message":{"text":"SimFlow.check_settings_supported (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f361a6cdf7d61f0352cdf959bb82521f292a2087dc41e1f9a1a2b11203964f"}},{"ruleId":"D1","level":"warning","message":{"text":"chains.complete_request (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3775a930df9b1f7fec2ef03d02157205a4090b9e959ac313c55da6d8c452559"}},{"ruleId":"D1","level":"warning","message":{"text":"chains.fitting_outputs (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74eb93d04df17c0cc7ba0fdf19cf0a2b069d3565ecd5deed1eff20e278ecfab"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowLauncher._finish_launch (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c96ff978f4e1cb2c99f926e944fd7a27ced42206a6cda64056c137771f8ede"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowLauncher._refuse_unaccepted_request (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"58729645dd602d861e9964f143b0f26d34c31ccfe7a86062dd05646ab66a1515"}},{"ruleId":"D1","level":"warning","message":{"text":"FmaxOptimizer.next_batch (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/fmax.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ab5308344abd4a5ef48cf2580164766faf77f3a2e6b1a8974f860e75ce5dbe"}},{"ruleId":"D1","level":"warning","message":{"text":"error_codes._settings_error (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/error_codes.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec206852b36402782a4c11d287bad938600996373c6310afbe99b7ab89a9ad6d"}},{"ruleId":"D1","level":"warning","message":{"text":"plan_check.plan_difference (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/plan_check.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1022037d1771f87b267d7a8b536216a89fc0a14a2dba36b483807e3d6df4c4dd"}},{"ruleId":"D1","level":"warning","message":{"text":"settings_layers._given_leaves (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/settings_layers.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdc180aff50d27022bf96f92eddd039920df9fca9e9bb8856295edcf7963894"}},{"ruleId":"D1","level":"warning","message":{"text":"sim_evidence.verilator_evidence (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/bsc/sim_evidence.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cc306008f4b06d06ae073bc34adf64a6fb73f8aeb60a5e307cd9df55606e95"}},{"ruleId":"D1","level":"warning","message":{"text":"Dc.parse_timing_reports (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/dc/__init__.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4711de207c004817c47a3956e2758e290a7da85a69660794293d4f493c9bbeb"}},{"ruleId":"D1","level":"warning","message":{"text":"Dc.parse_reports (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/dc/__init__.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fed8d404a98e11bedc2b5fad8e7ecac544c5fd4875749996144a344895aad0a"}},{"ruleId":"D1","level":"warning","message":{"text":"Nextpnr._parse_utilization (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr.py"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab944577fd8436d6983ca8da4af543244c879ad7308a5566980d0f6d915e6b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Nvc.simulation_evidence (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nvc/__init__.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaecfae09f755d64b86379740f1a027cc78c7ae49105cf7eb66cddcb75692006"}},{"ruleId":"D1","level":"warning","message":{"text":"Quartus.parse_reports (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/quartus/__init__.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"815c17a9fa8d7f8d08026608d1615e58bb6311ede70152d696ed16d8743d743f"}},{"ruleId":"D1","level":"warning","message":{"text":"VivadoPostsynthSim.run (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_postsynthsim.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bb7be898620651db2e4ab6f3a276503e81ca983d89cf85428724cf1915593e"}},{"ruleId":"D1","level":"warning","message":{"text":"VivadoSim.run (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_sim.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da5db1f899ba51540b8c5c0fd453188414acff413e6256c282c0fe937cec0b5"}},{"ruleId":"D1","level":"warning","message":{"text":"client._failed (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/client.py"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"070634b77f0a37a116a6ea3970a8b74f4b19b864e407d649b7a8ca78db74e1da"}},{"ruleId":"D1","level":"warning","message":{"text":"launch_entry.execute (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/launch_entry.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3249c79d55d692fa995a136fede9979292304374bb76f4e1ac1ec75ceb5bbe62"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.resolve (cognitive 176): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dec262d1fb87e95f36d33f877daace672ff4ef0a9748941060e6940fa5b70c"}},{"ruleId":"D2","level":"warning","message":{"text":"cli_settings_completion._parse_request_words (cognitive 166): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_settings_completion.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ffbb2ac4c1cab3025a85f28bc9e6d80d748519e5b0f6ccc9ace93603bf98ea"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowLauncher._launch (cognitive 148): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be188fba8d3535e7e13a1579972927d1fdf40e42264b026f3842f17a258d332"}},{"ruleId":"D2","level":"warning","message":{"text":"Dse.run_flow (cognitive 123): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/dse_runner.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf6d6b6ccf788f36be4e7b667e69e07133dccd016d5328c80e02644818d2109"}},{"ruleId":"D2","level":"warning","message":{"text":"Vcs.run (cognitive 93): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vcs.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb80e3849ed3eb9e0449793feb03ee8737915f1568531225376878ac047a20d"}},{"ruleId":"D2","level":"warning","message":{"text":"sim_evidence.parse_xsim_evidence (cognitive 87): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/sim_evidence.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"55752bf6b82382a876f5cc9007067b623db756d7d1563b97e745555f81f2c975"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowLauncher._request (cognitive 85): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9d21bb1889d7f2e18468d354eac660fefd18a6d50023e59797a7f4f6efebe4"}},{"ruleId":"D2","level":"warning","message":{"text":"trace.check_trace (cognitive 76): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac92816aef5ff9bc55f8f8a5b1275f113698fddf61481257224891d74aad93a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcs_evidence.parse_vcs_evidence (cognitive 74): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vcs_evidence.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39a9dcd05cd5f6bd02d5efb43dcd0af490024874729864f772904eff6e66243"}},{"ruleId":"D2","level":"warning","message":{"text":"dataclass.scalar_problems (cognitive 63): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f575fbf10cd01617e0a18dae80f1a0bdde2ab645beb359359fecee38655cd75"}},{"ruleId":"D2","level":"warning","message":{"text":"cli_utils.print_results (cognitive 62): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_utils.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"867b9f92ac37a887dea3031cee6bbf74936ce14dd0ad6c331b131dabe1a9ac1b"}},{"ruleId":"D2","level":"warning","message":{"text":"design.generated_declarations (cognitive 61): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"556f732d5d89bd6e356cccc2d2ec40a060e780ddc545c9ebfe5ca43b75d3b92f"}},{"ruleId":"D2","level":"warning","message":{"text":"sby.timing_problems (cognitive 61): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"9089d4449e207250c87433903704f9b387d8839f3b043119e47916dea41ef109"}},{"ruleId":"D2","level":"warning","message":{"text":"Verilator.run (cognitive 61): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/verilator/__init__.py"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"9522452262dfbc7fddaf2c265aee412218537f92c5472bb6712b6a2eb6627103"}},{"ruleId":"D2","level":"warning","message":{"text":"launch_generation.settle (cognitive 60): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_generation.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"442308e309149b87b5f2a26dda979a834002ad6224018f60c395674498232373"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_freshness.judge_node (cognitive 60): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/plan_freshness.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bba93046d4f29ac289d256de942b224cc7de9c8280a6fa1227ec07deac4ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch.select_fetch (cognitive 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/fetch.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac8829f6b3d16a48a5fc5084360d3c33d5ff831d7a8c5985c735660d7b3f452"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.run (cognitive 55): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli.py"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b4f31267563cb08191dc89423027a74d746bf78a76fb22d787bdd009ecc977"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver._normalized_leaves (cognitive 54): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d128773c438bb3cd2867336b64d029851663a8784d237b2380d653438eeec7"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver._agree (cognitive 53): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c62fa5778f54cd1969ecd4b28f7cd39f26945bb149dd1bf41ded38b2b98129b"}},{"ruleId":"D2","level":"warning","message":{"text":"settings_layers._merge_settings_layer (cognitive 53): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/settings_layers.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"68358b6c7691880997426e1c39d0cb20f29624118f0f58cc6c555ade81142c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"sim_evidence.parse_nvc_log (cognitive 52): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim_evidence.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfa2e7253f3d6b88a7b103542963717c3e82d76fe460cf80eb57220241d3415"}},{"ruleId":"D2","level":"warning","message":{"text":"sim_evidence.parse_modelsim_evidence (cognitive 52): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/modelsim/sim_evidence.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dcabec35565d3f789b5eee40ef14ad8aed2876a4d69c498fc1c032e57de4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Nextpnr.run (cognitive 52): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr.py"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb21a1e1b152c20551fb7b65ec8ca50dd92de02627952b8ec9c06384151309e"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver._pin_pdks (cognitive 51): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcaeeb3bd1444546181ce91c2283ec6f2ad339c5d119f907536962d2e18113a"}},{"ruleId":"D2","level":"warning","message":{"text":"upstream.read_orfs_config_mk (cognitive 51): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/upstream.py"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"d671c935a83818df43dc93ee29cdfceac1eb4646005f8291281075d023477b7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Design._target_overlay (cognitive 50): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3688}}}],"partialFingerprints":{"codehealthFindingId/v1":"3204c359e2a8867029434a0c890c7dc65fdd5b26d212d8e42de5b8af97a69e10"}},{"ruleId":"D2","level":"warning","message":{"text":"outputs.record_outputs (cognitive 49): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/outputs.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6826c5cccee52ad47f7630fd4a484fd8591d58feef3fe70fea2c4888887b5"}},{"ruleId":"D2","level":"warning","message":{"text":"sim.judge_evidence (cognitive 48): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0e688bbd4d0d52e47a4e909c4f8f4d554426e229d994b0cd364192a8f03d92"}},{"ruleId":"D2","level":"warning","message":{"text":"launch_run.execute (cognitive 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_run.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce008204175c9fab458548cd279150da263498e4c750bed6d6b097c94610903"}},{"ruleId":"D2","level":"warning","message":{"text":"agent.clean (cognitive 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/agent.py"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"3771050fcea1be9d80eb0c38167942c74cb73236ad5aed5bce58cbb167e2e9aa"}},{"ruleId":"D2","level":"warning","message":{"text":"FPGA._fpga_root_validator (cognitive 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/fpga.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ff68452e6b7849b8b732f945e8881a59f40485c451ff13bb268bcf611c64c6"}},{"ruleId":"D2","level":"warning","message":{"text":"nextpnr_constraints.reconcile_clocks (cognitive 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr_constraints.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2463af41d530545d04aa1249674892717b95dfc6a5e0303b1e41c09ff6387099"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver._unreached (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe3f1a2bc9a589b1ef67116be81030dc035fa7a77e682315b4b7d351090d72d"}},{"ruleId":"D2","level":"warning","message":{"text":"trace_inputs.build_trace (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace_inputs.py"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4734c9efffbef61de5c7f792e2981addb6df7086b8466750590dd06736b3f3"}},{"ruleId":"D2","level":"warning","message":{"text":"RepairTiming.problems (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/groups.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3d01b18ed4592e390250b8e98d1c98710aedf0fe5b39bb4b0703f602da0a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenroadPlace.check_settings_supported (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place.py"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6426f85d0f219f883112af173d637d33644be8a39c7ee3cd29adbfc14f1d3e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Design._merged_with (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":4166}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b0281c06d9a202dd1e671a1cb628ceed7be5460c53d267e17af99de8ccf68d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_catalog.complete_builtin_request (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_catalog.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e9c1c094992bdb0d89bab34e91c139dc4fef2bd4a55915904c0c775ff06626"}},{"ruleId":"D2","level":"warning","message":{"text":"chains.default_graph (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b66ec81986a194d3027357d9c3dbc4c5eefde1d9b5f8ab7b2a515a89cf63a65"}},{"ruleId":"D2","level":"warning","message":{"text":"FmaxOptimizer.update_bounds (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/fmax.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"005a5f3db1771a0d3fce40b8ec60f44d48a653c6a7e3e9ecca55d4f27f4869f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Nextpnr.target_for_settings (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr.py"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1490046dc2547d7814b5894ef72dc473217deef19ff35f80374951253c2956"}},{"ruleId":"D2","level":"warning","message":{"text":"bindings.node_bindings (cognitive 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/bindings.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"04123744b346b7b8aeea6c60347190c74b9bd73eb27189c90cf2bfd2c3165045"}},{"ruleId":"D2","level":"warning","message":{"text":"layer_paths._anchor (cognitive 39): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/layer_paths.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b06817820234bd241a96ef763e84350d4fb53c6fc29540eab77ac8bf01cadd4"}},{"ruleId":"D2","level":"warning","message":{"text":"Openfpgaloader._probe_arguments (cognitive 39): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openfpgaloader.py"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ddf7513dcbd0db4c1dceb84241939268ebc2bb7bfafd2e027fc194298a3562"}},{"ruleId":"D2","level":"warning","message":{"text":"Cocotb.env (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cocotb.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fda59e412ff1bb3f7cfbfd037b4e90da467b06a9dded38599d8b466ba716df"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowLauncher.launch_flow (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a29bb100e65ca6fa998e95823205bf7237e815a7b34f053eb899af7fc534311"}},{"ruleId":"D2","level":"warning","message":{"text":"def2stream.merge_gds (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/data/def2stream.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"42727f2efc28ae559d6344e12b91a8e368f765b4be9c59532609b054a328cc92"}},{"ruleId":"D2","level":"warning","message":{"text":"Design._with_expanded_sources (cognitive 37): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3941}}}],"partialFingerprints":{"codehealthFindingId/v1":"854cee0d5a1e873c4f6116cf507b49c57f80a6551db51b10bc37d66f25a7cb29"}},{"ruleId":"D2","level":"warning","message":{"text":"settings_group._declaration_problems (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/settings_group.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac7830702da8209bf9bef4031e4f6ca39ada269ee4dcc5a26c68a3dc0066277"}},{"ruleId":"D2","level":"warning","message":{"text":"cli_settings_completion._settings_candidates (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_settings_completion.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29891c428b39848dd213d22414a09a55dcfa28d6b2cd0bc05c5f728667a83d4"}},{"ruleId":"D2","level":"warning","message":{"text":"settings_layers._given_leaves (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/settings_layers.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a4c86f516c35cec7d127093085ba6aebc10d6fe085e86450e8468fd860cfe3"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings.pass_flag_conflicts (cognitive 36): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys_fpga.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"25340665bd157f106d83912466fd29061dec437add749fcddcb4c281b509d45f"}},{"ruleId":"D2","level":"warning","message":{"text":"nextpnr_constraints._commands (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr_constraints.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d5e145bca78610def06704090d0f4492ff3c79417ffc52ed4b88e1397ed11f"}},{"ruleId":"D2","level":"warning","message":{"text":"Deliveries.deliver (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/deliver.py"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"882c0f36c9dbf2bcc0537ed7c21e19ce7124c1a5737d3bb7649c57cc53d6d47b"}},{"ruleId":"D2","level":"warning","message":{"text":"FmaxOptimizer.next_batch (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/fmax.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc31ad9cf09ccfdb26255d87f04a6fa9f810229a3c356aa398ee9d3cf691a248"}},{"ruleId":"D2","level":"warning","message":{"text":"launch_producers.run_producers (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_producers.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"14008673d2dc46b0f869cbb1a1bced22b4932c8aecfcabe90cc566fe54778063"}},{"ruleId":"D2","level":"warning","message":{"text":"openfpgaloader_probes.parse_scan_usb (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openfpgaloader_probes.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1110b6b0fccbcfc27759c0ebf1cb97deeaef6c9272f36e63731fbf94a3f41f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"SynthFlow.reconcile_clocks (cognitive 33): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/synth.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5c0c2ee263bc02107f8c08dac5a4223e88ce6942006b6f96bc019b8fe958bc"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver._explicit (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fd790eb9c81244ea40d0d4edca63d358ff65b62dbc9976520de5b551b66f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Nvc.execute (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nvc/__init__.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fec88169dd53b5f0b39bbdaa91f51e522121339f67f8edde90f05b754e325a0"}},{"ruleId":"D2","level":"warning","message":{"text":"place.effective (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27547390252c45081a48376c5025093e53b7c17262346e916479ad5dc680a1a"}},{"ruleId":"D2","level":"warning","message":{"text":"derive.read_liberty_summary (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/derive.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cde60082300b502e3a7d5313cb20c3611d2abadd94c099d63e9d57e828afaf"}},{"ruleId":"D2","level":"warning","message":{"text":"proc_utils._run_copying (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/proc_utils.py"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f35fce8e665cde9f39ce5d59585baf1081aeb30e09d6f7e7ae726c1bb2f539"}},{"ruleId":"D2","level":"warning","message":{"text":"DesignPart._sources_to_files (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21f96f7d54658ccc69c2c43424a947c763845c53d2257ff15494591fbb03327"}},{"ruleId":"D2","level":"warning","message":{"text":"BscSim.run (cognitive 32): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/bsc/__init__.py"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"688f74da516a80ca98024c165ec3ec8776654a49d6070bee760fb308df2bf9ed"}},{"ruleId":"D2","level":"warning","message":{"text":"FloorplanGroup.problems (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place_groups.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c0b3b7dfdc912bbb014b3e6cde6b0b065349afe8d2377b7533d56a04edd428"}},{"ruleId":"D2","level":"warning","message":{"text":"launch_entry.execute (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/launch_entry.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d83901ed10ae0aacdc2cebc94bb449f727e4b8c15b69b0aaa588247764e6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver._check_links_pass_through (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd77c5ab1a84694b9be1a1cab97fe869a5f30dfc8f8173432f653dcbad03574"}},{"ruleId":"D2","level":"warning","message":{"text":"Yosys.asic_values (cognitive 31): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys.py"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"b777c715c7dda22070c6d1b13c2acb280ca1f3c014a57e52c0a1aa0b48f114ce"}},{"ruleId":"D2","level":"warning","message":{"text":"client._run (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/client.py"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63b381378fd8f4341b16ce1a6086ba172c53fa233ae2985c245115aa1b25602"}},{"ruleId":"D2","level":"warning","message":{"text":"io.check_io_declarations (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/io.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d904840f4c62c2827133f563657a20ff1c242b72d9a19e21dfd787c8237d69e"}},{"ruleId":"D2","level":"warning","message":{"text":"trace.changed_edge (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c14267a8a76c170811e813377c77da415eaa3706fac6804f80fe3ec1bdd5d2"}},{"ruleId":"D2","level":"warning","message":{"text":"Dc.parse_reports (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/dc/__init__.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5766afaf1f3bb51d6af0e553d723459778ee4f63ea2b451f170b40b7f27ccb99"}},{"ruleId":"D2","level":"warning","message":{"text":"GhdlSim.run (cognitive 30): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f8556191c239ef2f8414a121c28af6234e4c346549b0475c67b944d020af1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Vivado.parse_xml_report (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/__init__.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e1b12c1e032fa80c5e1caed7b914363685e2b12e7ec6c9deae5c682a3324e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Docker.run (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2303b42b680bb39b86596742deb77cce635bddf22ae60a709864ef8b89658db0"}},{"ruleId":"D2","level":"warning","message":{"text":"GitReference.validate_repo (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3042}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7f32aca3ffd4aec91876bf2f40276e351d826f38db5b17f6c063ff17c81bd1"}},{"ruleId":"D2","level":"warning","message":{"text":"SimFlow.check_design_supported (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1ba001240e9bc6fec2a1d5a790fe80444ff8f6b27bc8f8da3badf2ebc1f40b"}},{"ruleId":"D2","level":"warning","message":{"text":"chains.complete_request (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb08304d7ea5dd37fcced9a094eab5efb0d678f795129e616fe6205e820cdcfb"}},{"ruleId":"D2","level":"warning","message":{"text":"VivadoImplementation.parse_reports (cognitive 29): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_synth.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bd7d9f16c6dd4a942fefb07f8e44e828e58222d567c5f927334d3afc8970c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Yosys.run (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"3585875cfc9d5666c659a116497c89d7fe4de91ebdbda278f8ed70c9aaeeb973"}},{"ruleId":"D2","level":"warning","message":{"text":"introspect.flow_chain_cells (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7337357969d7c7f4aedbd84200c7dd48c9bbae89d004ab370ff5ac43806a3e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"records._generated_places (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/records.py"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04cde983eb0b6ca0e7ebebca4873361a3268db61c4aaa0e8642b7b0474479fc"}},{"ruleId":"D2","level":"warning","message":{"text":"bump_ci_pins.find_update (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bump_ci_pins.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"b874bee0d6a1e1d5f6556706ffb9fe9b3eb570b0f142293b64e3785d61f6af05"}},{"ruleId":"D2","level":"warning","message":{"text":"edif._modules (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/edif.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45e26e8322a4bce16c90d566450fa087f7c3b8e9b38cbe10508d4d584e1b645"}},{"ruleId":"D2","level":"warning","message":{"text":"sim_evidence.parse_ghdl_log (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim_evidence.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"02898a8bb719aecbb57abcb52f91bb9a2f6945647832aaffc7220721af4e5158"}},{"ruleId":"D2","level":"warning","message":{"text":"FmaxOptimizer.process_outcome (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/fmax.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"81865bd3841a4e42a6a953b8515b804b3c8e5664012aa2f9eee26e1a56285fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"Yosys.check_settings_supported (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"5496f062e40c631a18229ee5946691f689448d37f667d1c883d332a0784c23c3"}},{"ruleId":"D2","level":"warning","message":{"text":"records._outputs_of (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/records.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c074de670d90540f588646f60620f976299592763e48d1c2766ab1b5ef277356"}},{"ruleId":"D2","level":"warning","message":{"text":"WithFpgaBoardSettings._fpga_validate (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/board.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2948dea7a519e82fd6e28e0f50f632c6bc4973cf4106e0b3131ac2c875041be3"}},{"ruleId":"D2","level":"warning","message":{"text":"launch_run.clean_up_run (cognitive 27): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_run.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11d0b47851e69bceef4e165e56a91d5cf2cb6fdc7a832d6d2fbbf8a3fdfed20"}},{"ruleId":"D2","level":"warning","message":{"text":"run_lock._acquire_set (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/run_lock.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1b466876c180ff969ef8f6abb23a1defd43aeeccebf2123a3a6d6417d5a78e"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings.validate_set_attributes (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/common.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81ce71c18ced58a0fdab703cfcf34e26f2bf6941f41fd51e8d7d66069271d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"YosysFpga.parse_reports (cognitive 27): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys_fpga.py"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0682fa2277aceee9e73d75377e53b6cf54fd8258189addf3153bfadfa14a2243"}},{"ruleId":"D2","level":"warning","message":{"text":"introspect.type_str (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd6134fee4d47717bc53a004f1a194ae889c9c1861eee193cdd35748b8b556e"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool.process_version_output (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de13cb61bd188b0d6a7aec2fac3f94d01aa056e79dcec618ddafa787672313e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow.map_keyed_path_leaves (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd7ed12958d988720931de020e692f1861a4598b22ffa2b8703be786942d88c"}},{"ruleId":"D2","level":"warning","message":{"text":"Sby.check_design_supported (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4185e4f69ee269f9d989e158ebc48aec5dc3b9c046a8aad20074ec88f6b97a"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings.synth_command (cognitive 26): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys_fpga.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acb1712c072b5e74f8b62ad1ae46ba534139c5abcead904b9b77914f83935df"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool._sibling_executable (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c14bb4847f5abd62e8c810149272c053e611e2c6f29812505b8444f0e98d187"}},{"ruleId":"D2","level":"warning","message":{"text":"Design._select_target (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3560}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bffc432bc016f55a9751c10e5e20fbcd2622bc4e844b7b46fa4c2df4cf2e02"}},{"ruleId":"D2","level":"warning","message":{"text":"SimFlow.check_settings_supported (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbb8456d71817700ec8d9d3fee71970001db11be074f74fda24fd16f781969f"}},{"ruleId":"D2","level":"warning","message":{"text":"related_inputs.check_related_inputs (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/related_inputs.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba585d3709350e64f137c967539eb1028cf2b837b844ce0bc13a46b8e752af5"}},{"ruleId":"D2","level":"warning","message":{"text":"bsc._parse_haskell_strings (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/bsc/__init__.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad548722ff17665463b73b6bcdf420fd175647b68bedfdbdb1f1c1ae8bf85cc"}},{"ruleId":"D2","level":"warning","message":{"text":"ArithmeticGroup.problems (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/asic_groups.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8447d428fe28895f828dc8a0725f4c15f93db31ee319ec5a7e4adb1c7c752326"}},{"ruleId":"D2","level":"warning","message":{"text":"AbcGroup.problems (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/asic_groups.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"61042e2eb43077945f5bd2113e0fe632a7f8ec10b52863eb4edd72f184779665"}},{"ruleId":"D2","level":"warning","message":{"text":"introspect._in_field_units (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e479b42d56bc61b91c65e1f3bb00c0bfd8559385d52b55f75779993464fd3d"}},{"ruleId":"D2","level":"warning","message":{"text":"_LefReader.read (cognitive 25): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/derive.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a227c0e881da20e1451312f267d97d7b243a66976569ee2ec6e1ca026d0a47b"}},{"ruleId":"D2","level":"warning","message":{"text":"bump_ci_pins.run (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bump_ci_pins.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b7c64e93f88d0a312cde1336dcc41dd20e830e2c611475ae850f924a45e50b"}},{"ruleId":"D2","level":"warning","message":{"text":"XedaBaseModel._booleans_are_not_text (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"434ff51170eca42c73dc9bc4b8a17027a2426db56e58e831386c8815b7cd4fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"Deliveries.collect (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/deliver.py"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"81493833b7d1d69b63169f9fc2928371cdafa506d5c4119d0b3167a3bfc90ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"settings_group.render_flags (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/settings_group.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c19f50563e03d1484a6872e3c65b2516dfd52640dc75ce79311e479be8a516"}},{"ruleId":"D2","level":"warning","message":{"text":"error_codes._settings_error (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/error_codes.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"161f5f828a01653e71da33c6973695c34cffa3a8f810c47710c18f0ea8831b95"}},{"ruleId":"D2","level":"warning","message":{"text":"IoGroup.problems (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place_groups.py"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffc22b6b4eacc2cfc180523b2e2426e4ff8fe641e74cfb086f5969fd6133f35"}},{"ruleId":"D2","level":"warning","message":{"text":"Quartus.parse_reports (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/quartus/__init__.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aa95fd1eb91ee892a6f361a7b68a50d1a544629d08e813e573283e44688594"}},{"ruleId":"D2","level":"warning","message":{"text":"sby.staged_names (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc48675638609c4c08e363633a2190b9584a8decf99dd24b6551325c8cf52e2"}},{"ruleId":"D2","level":"warning","message":{"text":"_TclReader.leaves (cognitive 24): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/upstream.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5576822c9509d9a1ab316ebb6916f3c8f498787ef0f9b5711f7333384b4f193"}},{"ruleId":"D2","level":"warning","message":{"text":"dataclass.annotation_kind (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"7673de033808d3fe3bce06b433a89ad864b7e91744700e6f2f07c17ead976787"}},{"ruleId":"D2","level":"warning","message":{"text":"equivalence.json_netlist_digest (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/equivalence.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a5f5994c6077adaea920d7fa6db64015c4c9e0a07e259d9c261f99a53b7070"}},{"ruleId":"D2","level":"warning","message":{"text":"chains.parse_request (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51ddc4032ba8ee030c33dbe0bc9c7b05dae6f00a2e76d9aba0a2cfd28b7228b"}},{"ruleId":"D2","level":"warning","message":{"text":"chains.fitting_outputs (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbff40995522a4dce01562db588c31e2d01b7fa770499489fb962700016b0350"}},{"ruleId":"D2","level":"warning","message":{"text":"launch_producers._produced (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_producers.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d885fed46716064a9b86ab3e01df23e1ac712652ba9bf5ad8427005d9d793c"}},{"ruleId":"D2","level":"warning","message":{"text":"Dc.parse_timing_reports (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/dc/__init__.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba05daa82a3fedb0a0288dcc5941abb325ec425bd14526488f9b0d6b8ec6ea73"}},{"ruleId":"D2","level":"warning","message":{"text":"Openroad.check_settings_supported (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/final.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbbf956f296903601493cc89a9606fbb7839dcc1fe998801ac3e7189a114430"}},{"ruleId":"D2","level":"warning","message":{"text":"sby._clock_races (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"889576c6662a65efa40b5bdea8f30b36b19264181fd7772bd8b032ed47a36d83"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings.synth_pass_only_conflicts (cognitive 23): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys_fpga.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"4094406ce624ccf37693ad2720f273b03611ab25d1b4d0e2fdfee5ccd4d35bc0"}},{"ruleId":"D2","level":"warning","message":{"text":"local_settings.local_settings (cognitive 23): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/local_settings.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb3f747b306b84a8f93f795263eb55314b05d783baa181ad85c8143c035249f"}},{"ruleId":"D2","level":"warning","message":{"text":"_TclReader.value (cognitive 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/upstream.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8997accf65de0212cba74c1dceb2c935758e2336c35331a9af515c50fa04e7"}},{"ruleId":"D2","level":"warning","message":{"text":"_Deadline._poll (cognitive 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/proc_utils.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0576fcf37bd7f426e7962cafc0d7dd82f4642c66ab101f725e34d993980be268"}},{"ruleId":"D2","level":"warning","message":{"text":"proc_utils._subprocess_tty (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/proc_utils.py"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09937d69555da49d1798f64f91c6fe5889e1635bf7819db542e67c02bd24b72"}},{"ruleId":"D2","level":"warning","message":{"text":"records._inputs_of (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/records.py"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff0390dc9a9bd46f31bf0261625963d497e5d839183cf2f712c0754e0690826"}},{"ruleId":"D2","level":"warning","message":{"text":"client._finish (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/client.py"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff32880ba9b07883e8aec5032df1c11e4da03deec6833cf8a9675ded7df482a2"}},{"ruleId":"D2","level":"warning","message":{"text":"commands._clean_host (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/commands.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8366c8f741d7089c1174e11500c7748cd9b6937ea6a689a383bfc08fcb3460"}},{"ruleId":"D2","level":"warning","message":{"text":"packaging.package_inputs (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/packaging.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a1faadf499a6949aa36c3b947127a5b3dd0ac1e0f12bd5a3514f3ac0317d04"}},{"ruleId":"D2","level":"warning","message":{"text":"tools_cli.tools_install (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tools_cli.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b75065aa1917c30067fec4b49d16c832ce546dbbc74e526aafe1c3341f3f63"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._print_plan (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"d467f09bf976e7f07cf3d6cb964acfccce0cc2c7320a47132825315cb41bc14e"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsCompletionMixin.get_completions (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_settings_completion.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d001e190f9369cadd284e099659d65239cdbc1ea8944dd3afb15e83f93aa6d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Design._initialize (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3821}}}],"partialFingerprints":{"codehealthFindingId/v1":"039f39bffd764ac109d5c7be9c8a9413e115d90f2a968704ed3a6217ebd605e2"}},{"ruleId":"D2","level":"warning","message":{"text":"chains._check_chain (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db795ee2bbdc7d50823adc8b64abdbd45c19481824b6ca501554de7f224138e"}},{"ruleId":"D2","level":"warning","message":{"text":"launch_result.launch_result (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_result.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f13199d70c242e3b36118951be7eab4d69c88ffb07b0e2895d57cbb1fc4a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"outputs.recorded_outputs (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/outputs.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"988ebc601f08d65de7429662f2974a750d6f081032e818659864c94cf7d120da"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_check.plan_difference (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/plan_check.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b325d47afb777f563d614527661afa44a665b6df35c7325602484e082677320"}},{"ruleId":"D2","level":"warning","message":{"text":"scrub.list_run_directories (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/scrub.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac04ecb8ccb49ee74ae225ab228aef9925a2a7b06b2121037acfa7936886461"}},{"ruleId":"D2","level":"warning","message":{"text":"setting_text._parse (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/setting_text.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a99154f60e172c502c73f5d1ddb0a17ba6bb2a0a2dbd16fb82ff729f5290c5"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.dse (cognitive 21): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli.py"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58f0b44b10b9ecf4fc327889094972c1c64e359dd168dfdc92b72da5344d33e"}},{"ruleId":"D2","level":"warning","message":{"text":"deliver._resolved_patterns (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/deliver.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"4221386dd53b4f1e7601d1605b88aba08457aa4213c40ea180462bff3570a8bd"}},{"ruleId":"D2","level":"warning","message":{"text":"edif._close (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/edif.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"29827af6ce6f43cf66c662ff93ea6224f869eced967a4b7a4f0fa741f997311c"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowLauncher._finish_launch (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a1c42cdf5761fd595492c422f937e996263e06d93cde712d5b11fad2b7caf9"}},{"ruleId":"D2","level":"warning","message":{"text":"launch_result._ended_node (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_result.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"824dcf0b985d85aafc60c62415bc3b1e5f5f0d243e2aad0666f1aa30e954ea99"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver._check_design_producers (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"92688ac70ef69975ec659af8fba9ef70d0cff622932d55f633c9d6d1069fe7f1"}},{"ruleId":"D2","level":"warning","message":{"text":"nextpnr_constraints._words (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr_constraints.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ab56b0739e97845d7234c658dc248435ac081f47470b9120cead5642cb1df3"}},{"ruleId":"D2","level":"warning","message":{"text":"quartus.parse_csv (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/quartus/__init__.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70f5110e63d346ff3e7a32db41bde865c89cc15ce4460336d79aed9908e2df0"}},{"ruleId":"D2","level":"warning","message":{"text":"VivadoPostsynthSim.run (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_postsynthsim.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f62bd00fac1721045c9cf5e3f81ac1ca44fdb54174c240a0fac90054f6e2664"}},{"ruleId":"D2","level":"warning","message":{"text":"agent_skill._flow_section (cognitive 20): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/agent_skill.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"922d5a0175485300116b03e36f6b7163824501a921630175337bd7eaa2a63bb6"}},{"ruleId":"D2","level":"warning","message":{"text":"TestResults.parse_results (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cocotb.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b381d8e46316c6d896574822d89fa8bddd70448909daa7b861c7c79e98c8ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"design._generator_recipe (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d52d96118bb68073f3cea09530597e33a5c66bc8e6d93c540d5eff79be1c5ef"}},{"ruleId":"D2","level":"warning","message":{"text":"dependencies._merge (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dependencies.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"44829a4d58594b6bef2c9bee029482e683352dbb87cf996597bf64711c21b11d"}},{"ruleId":"D2","level":"warning","message":{"text":"outputs._design_entries (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/outputs.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ea401efccc8c2523192aa4ca8149a765f8deb41a1be9d359c962393a3dcc6b"}},{"ruleId":"D2","level":"warning","message":{"text":"sim_evidence.verilator_evidence (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/bsc/sim_evidence.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4c3b853625beaff599c5f67be05e04aa90de2b341c5e76c0b8c891741a246b"}},{"ruleId":"D2","level":"warning","message":{"text":"Nextpnr._parse_utilization (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr.py"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1603b28ae8e7c76d83aa0bd5ee5cda2c25661d96dd64ef33d28394f22632e00"}},{"ruleId":"D2","level":"warning","message":{"text":"final.effective (cognitive 20): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/final.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d534bb228f638fd421836026c588be84c70ccf8e386d0977fe97a3861a5d29d2"}},{"ruleId":"D2","level":"warning","message":{"text":"sby._staged_name (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"70aab29ce851d8cda373ba9f79792a2a509ebd0937db5fc69522d5a2706afa8e"}},{"ruleId":"D2","level":"warning","message":{"text":"vivado_synth.run_steps (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_synth.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff61cf604956900065be50697b513ef70018b0c20a6dd8d5db4498d21a36f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"abc_strategies.composed_abc_script (cognitive 20): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/abc_strategies.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99c89eb4a336d6c89d876f65b9c021aefe6d5c3819e9bb8ce3cd737ef4aaef7"}},{"ruleId":"D2","level":"warning","message":{"text":"records.collect_metrics (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/records.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aadc3b78caf4210abefaaf019c6adc95b00137951e62c79f390bd0666af711b"}},{"ruleId":"D2","level":"warning","message":{"text":"client._launch_result (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/client.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc217e53ed1e0c866fa16c624ae2c00fc0bbe4490ed2796c2417af33c05decf"}},{"ruleId":"D2","level":"warning","message":{"text":"client._failed (cognitive 20): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/client.py"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"684d51d510fc36624711a4f86f2a4fdc8880ceb8963fb91c34eac81e92faf1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest.iter_tar (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/manifest.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbecd29ee44bb69a286f0e903e173d65f46e5a702b2d4dddd026dbdecddebd7"}},{"ruleId":"D2","level":"warning","message":{"text":"XedaBaseModel._exact_scalars (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d20e011c4c7c33147039bdcad9e02b83c3b17cd635033bf59a54d859f4cb1d"}},{"ruleId":"D2","level":"warning","message":{"text":"design._normalize_parameters (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd996dc529a951b521822cd965b0617c1497ac19ec3692fbc7d4256ceca6d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"edif._tokens (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/edif.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02157bc1f0124731cf1c167218ad2c6e8a984484f8d66d1248616831614865a"}},{"ruleId":"D2","level":"warning","message":{"text":"chains.binding_points (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d7f8cb74d6ddbf1fdb718565bc5fdfddcb9357ce1bb44d443b0481d3f53955"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowLauncher._validate_plan (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e37502b6a14a9c95851b39d79bc6b57ae9423902b3f4c4ce94829e8f166d8be"}},{"ruleId":"D2","level":"warning","message":{"text":"scrub._remove_confirmed (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/scrub.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"992516c103735fae2267385463a93aa03fea1771fb092a4965fa34b8d1bae9d2"}},{"ruleId":"D2","level":"warning","message":{"text":"Iverilog.check_settings_supported (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/iverilog/__init__.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"be733ba5964bbcac550c999a98c5162bb9f4b360ad0f2d6067500c40e2b66348"}},{"ruleId":"D2","level":"warning","message":{"text":"Sby.check_results (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"87147c807fdedacaed8fa6dc0fbf61a2cf9b35a779ad30acdc9fe3e4568758df"}},{"ruleId":"D2","level":"warning","message":{"text":"YosysBase.check_design_supported (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/common.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fd6d8b1446618062da088b0c53edc9515dc3f381bbe901580f5115ee26868d"}},{"ruleId":"D2","level":"warning","message":{"text":"generation.judge (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/generation.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d30ea65e6bd3d86f6b98a33102355449bf8d407e85043481a24db2d91bc6a7"}},{"ruleId":"D2","level":"warning","message":{"text":"proc_utils.run_process (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/proc_utils.py"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"49809902ef3f2b159a2ae171a2c82d33a824de710d63daf387010963ccb1c66c"}},{"ruleId":"D2","level":"warning","message":{"text":"proc_utils.run_capture_pty (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/proc_utils.py"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0432b1ccfd0f1059a0c19c3b9b84be4cb6b94c1615f79a61261016f3f29b8c0a"}},{"ruleId":"D2","level":"warning","message":{"text":"project._entry (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/project.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef63a5567482d6960a1fd6a18bf8223fd453ddb09537a5d2d511febbd98c6c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"SweepResult._row (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/sweep.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fce261d03464ae5f770a26348f4956fe4a76a50be63c9defd156f9460adf998"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_store._extract (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool_store.py"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4ef437c1d02fa660c7e4759f43bdd43a8d0e7574bc803a5cdca4830095d3a5"}},{"ruleId":"D2","level":"warning","message":{"text":"XedaHelpGroup._main_machine_readable (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_utils.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2fbc4fe4e16a4d2ed752be7d2f230fb7fa8c1d1cf1d8bfb7e21f47f563b2cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator._sources_to_files (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"308acc0e9de0faeb40b6a83bad10b4f3260c97e71c2ddc380b1df875c2ad225a"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.execution_executable_path (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a49b7d19db1e93254b5bc74628f88611536d6ea5a5f47d53c87d97012a6db3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Design._merge_target (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3647}}}],"partialFingerprints":{"codehealthFindingId/v1":"9397a875ab8191264ef88b98626bd904bb0f7d86b6dc5184b21b72ae14f060ad"}},{"ruleId":"D2","level":"warning","message":{"text":"flow._annotation_matches_value (cognitive 18): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fc1c0d3fe5230412e8c5383bf18f1af83f15f804a459404309b1249452cfc2"}},{"ruleId":"D2","level":"warning","message":{"text":"io._check_relation (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/io.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f840fa5e98652ddf978e61a32996c1b12a98c4402a8f5d11d4c5c31d6320a3"}},{"ruleId":"D2","level":"warning","message":{"text":"SimFlow.check_results (cognitive 18): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim.py"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb3a674245a9316036a323bd8e9c123c5b2f4886d92b1a8dd7beb828445b957"}},{"ruleId":"D2","level":"warning","message":{"text":"chains._link (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b755b65b628f91859d7d66c33f99398a025357ef4376e07d98c3f95f9c4d8f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowLauncher._refuse_unaccepted_request (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24d29a2ef4ed6c40fe8d4c5444a08b6be221e514a98bf63f2432f05066cc32c"}},{"ruleId":"D2","level":"warning","message":{"text":"node_settings._problems (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/node_settings.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6622de333da8acd9b2527eafdde5b6af129689098da93035b659643f59e09d"}},{"ruleId":"D2","level":"warning","message":{"text":"outputs._design_record (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/outputs.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eaa4fa06776781a298b5b7ec3dd2b62fb8e67df04e68b0175ee509f534b8ca"}},{"ruleId":"D2","level":"warning","message":{"text":"related_inputs._advice (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/related_inputs.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a219b80009d2e091146651cb8ef4e6883431702af5b7c38e6cdc3e011703f110"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.check_settings_without_design (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b075a8f8342a6349f46ac985816028c86f4494e7112e6bf9b1187d969e3175"}},{"ruleId":"D2","level":"warning","message":{"text":"iverilog.icarus_evidence (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/iverilog/__init__.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5559803b12b610ddea85b84c28d2923984261dc080c5997329fcde829c76f53"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenroadStage._check_liberty_units (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/base.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3651d047f0b8da4891c4b717e0cbb6f3fd95e5d83f533eb42c9ce9564aee5bd"}},{"ruleId":"D2","level":"warning","message":{"text":"verilator.parse_end_record (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/verilator/__init__.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c384c5cf11535d6ae0897a87937574f61d5983de21f670e471a102a249df6a"}},{"ruleId":"D2","level":"warning","message":{"text":"derive._ties (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/derive.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0c25a8e0b03df6ce39b6af958675dad41d08a64b904504081c75dfdab00f60"}},{"ruleId":"D2","level":"warning","message":{"text":"model.leaf_annotation (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/model.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c0ee55a1f147493467e6aa6ac0a266c6a08603700b1e4411117aa6111bc526"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.take_lock (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/agent.py"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"9722eac0ae5404929bf9ec0d92961686a9dfc45dde0e25ca00760bf946eb6ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"sweep._check_points (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/sweep.py"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be574b2d58e127674658c1848be8e2429bbf3133808d1a5aff819f2a618d10c"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool.__init__ (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde9fddfef335550588852667cb90cf17e66826767dee431937119ef5e339611"}},{"ruleId":"D2","level":"warning","message":{"text":"tree_outputs._visit (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tree_outputs.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"698225c78628718aca37aef2bb975ddf72b8ff7d3c11cf3f4ddfe83b52dafe3c"}},{"ruleId":"D2","level":"warning","message":{"text":"conf._clean_signature (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/conf.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"58660cdfa8e03024d2859ed1e24d37038643932a5e1ae157496ed489008f8372"}},{"ruleId":"D2","level":"warning","message":{"text":"board.board_entry (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/board.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b19eecfe746c4091f74c91bdca796da6aea7b54bd6c3c4a22466f2fa458110"}},{"ruleId":"D2","level":"warning","message":{"text":"cli_utils.print_flow_settings (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_utils.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"328516b443ca09aa3dee3c4c6a7c2764ac8b18e5c372fcd5eb6d92a64d404f28"}},{"ruleId":"D2","level":"warning","message":{"text":"Deliveries._copy (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/deliver.py"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07ff9de18df56459fa49d193ff1533ffe2a43f6504133528a3c833b05fd6eed"}},{"ruleId":"D2","level":"warning","message":{"text":"FileResource.__init__ (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b409f5ad484e2f9ce88b2d31f01c926e961aa43892a35851510536c3fb82c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ChiselGenerator.execution_command (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":2270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4087c45682e9e34bcf8482c56722fd957b8d6c32639d1466707cb8b54c408a93"}},{"ruleId":"D2","level":"warning","message":{"text":"Design._source_entries (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":4529}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8882991689e962ef8862c79e72f18d53a0a762dcf7ed2664323149d26af503"}},{"ruleId":"D2","level":"warning","message":{"text":"scrub._run_directories_in (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/scrub.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df0003c84907ca6304cf9303321ae520dfa2cd906b9156041b4c57349b9cc3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Ghdl.find_top (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a209ad7caaa074ac34f0b23de931967709ef4ca1b442b979d88236c6eb4bf9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Iverilog.check_design_supported (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/iverilog/__init__.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb2a01d714bd18e735212b5acf3f79dedbd7d6f7a4d574724cbe92a2595e230"}},{"ruleId":"D2","level":"warning","message":{"text":"nextpnr_constraints._net_bits (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr_constraints.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe96a7ba1fa5824e278309619fc680a531b5645054169cd2df3cbbb9dc815ee"}},{"ruleId":"D2","level":"warning","message":{"text":"PdnGroup.problems (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place_groups.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0d84011d478dfaa1ac109d15caa76ebf5f209f2e95b5dac87fc72e0cbebf0d"}},{"ruleId":"D2","level":"warning","message":{"text":"Sby._failure_text (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c49df16a4722425da9944aadba03b5e11fd2d9a931361dd1e972a0423ce76b"}},{"ruleId":"D2","level":"warning","message":{"text":"Xezim.run (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/xezim.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc6cd96c4638753e926a26d90b4b8f045b9e62813260c806a4ccd131e63a890"}},{"ruleId":"D2","level":"warning","message":{"text":"introspect._field_entries (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eadc0a38e3fbdc3faf7f2345eb8d7bf04c8d827d7e1ed99bd1a696bde627e83"}},{"ruleId":"D2","level":"warning","message":{"text":"residue.effective_residue (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/residue.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b23d2ce3099d31d45fde9eedaf1b97b82b4b642ee3702262659cb19a1fe317"}},{"ruleId":"D2","level":"warning","message":{"text":"proc_utils._copy_from_terminal (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/proc_utils.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"14890898066c62521c4f73abee9fc81d5013892dd344e8a048cb3af20d2744ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Project.load (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/project.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aaaf5257eb6a77ac9db486dae6f63ebf7456e6cdc2230aa10f51277c986706"}},{"ruleId":"D2","level":"warning","message":{"text":"records.record_of (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/records.py"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"382f7e3cfef4a691c68e954de6e78f490a2404f904adc2b4d4bfedad59c7ece0"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.run (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/agent.py"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0a7a46426e56c285e535253f69cfec6ff4abdd69cc72ee43b5efe1cc283bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.sync (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/agent.py"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11fd764861df4de72460ed10ededcef22fd24a033eec7c5008d4f1afa956da2"}},{"ruleId":"D2","level":"warning","message":{"text":"_Sweep.__init__ (cognitive 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/sweep.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e915d30e69934cadefd509ed90956ef096f574f47bcbbb6b96a02b7101eae4"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool._start (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb339e8f1af416360d9ca41b4044223b686848e50260044dc7cb084b9776036"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_store._release_asset (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool_store.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"de37131edae57ec1e6dc801ebec9aa2d58efc375ee3d507ab7fccc952c29c1ed"}},{"ruleId":"D2","level":"warning","message":{"text":"bump_ci_pins.main (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bump_ci_pins.py"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"a698aece98f5066f5dcf7f12e4831abfeef8a05f9ad718fb7634975184508dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"code_epoch._imported_modules (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/code_epoch.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f4c68d388775e8b10db5841df0b7c0bfed74239722fe7bebff7862eda81adc"}},{"ruleId":"D2","level":"warning","message":{"text":"code_epoch._module_files (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/code_epoch.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14f870f508cdd4b5333dff5661ab1a370a9c7276063d75aa5b3d70e647bec6a"}},{"ruleId":"D2","level":"warning","message":{"text":"PhysicalClock.root_validate_phys_clock (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/synth.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cb58d07cef5be131a5341b0980976a02011f48adc20b21e03161ffd6b1873f"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowLauncher.run_flow (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bae81e11297d84d089824ae1333cc76b135eed7aa3fd16aebb76a42495668e"}},{"ruleId":"D2","level":"warning","message":{"text":"error_codes.public_error (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/error_codes.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"430cba15dc29d061d475f2a32513248ac462dab9be05cc85eea9705973d755e9"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver._components (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fc5cd11da56d889c9dea0394b3633e3138bd96b78888082c4d25254caf667b"}},{"ruleId":"D2","level":"warning","message":{"text":"trace_inputs._programs (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace_inputs.py"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bbe558d13fea800c96411ec26390768fb9c5598b87e6bb04157e8f29e80bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"BscSim._link_flags (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/bsc/__init__.py"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"791892d1db569a2e72a97b8a8a0922a69340d09538d516a8b89c1576551ab2bd"}},{"ruleId":"D2","level":"warning","message":{"text":"GhdlSynth.run (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d33e655b27bf0806ec09d8d5bff7d30b8e0e9b06e7678c72cae7df68a0e5fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"GhdlSim.elaborate (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21e60b3698232f7c458bdd831ce54d5491ae6737824ba0994a4be7ee9297d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Nvc.simulation_evidence (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nvc/__init__.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9898f9476040dc91324fe732a596072637f86ffabeb8cc7ce2999413e3d5a05"}},{"ruleId":"D2","level":"warning","message":{"text":"Openfpgaloader.run (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openfpgaloader.py"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3e19b141d52b81e7556a24a5328b4b52b9c4ff07861c4da155ca72c5d2d109"}},{"ruleId":"D2","level":"warning","message":{"text":"Sby.run (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad93b9c9b71329c876bdda8b29d99d8f2a5fcf46083317137b7e6f378440b30"}},{"ruleId":"D2","level":"warning","message":{"text":"VivadoPower.parse_power_report (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_power.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7b26ee5a400ced234f99c03404c0389b55fd97b1b5abf4e51fe2c55e8675a4"}},{"ruleId":"D2","level":"warning","message":{"text":"xilinx.find_xilinx_layout (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/xilinx.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec0d03dcaa250f63323ddfd42067d26ca8c7f7d5ed0a50618e04b806d6d071b"}},{"ruleId":"D2","level":"warning","message":{"text":"xilinx.locate_part_data (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/xilinx.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39fa5113ec3ea7532d712d1f294b40340f6a032d08007e4a4ec706da981dcbd"}},{"ruleId":"D2","level":"warning","message":{"text":"Result.__str__ (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/outcomes.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bb80418db942780bdc8cb4b7c8f6c51fa36f4e52768e771555f806aa427531"}},{"ruleId":"D2","level":"warning","message":{"text":"outcomes.aggregate (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/outcomes.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7246143a256de401270a903f780844f7b64759936fd544616431eb0a6df58f5"}},{"ruleId":"D2","level":"warning","message":{"text":"_LogTail.pump (cognitive 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/agent.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3425c3a8039d600f29a0a8e8386c94af6986789d510dde31fd5f10f9908d849e"}},{"ruleId":"D2","level":"warning","message":{"text":"provision._execute (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/provision.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3707298fc4e8fb5b27375e1549eb6df5cc6471e7d4ad3c8a856e1709c8413c"}},{"ruleId":"D2","level":"warning","message":{"text":"_Sweep._schedule (cognitive 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/sweep.py"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"00416da50082e4295e065df1357dfe5ac4919cf160238fd352b517afe195bff2"}},{"ruleId":"D2","level":"warning","message":{"text":"sweep._execute_in_worker (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/sweep.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"34076154af7faa184b1cc31c1f03b45816d709f53511bd2ef9146eefc30ae488"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool._version_is_gte (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7e5df929c067b7b576fddc44fabd2873f33f03e6385a809b51dfb392adfc7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/design.py: FileTooLong \u2014 3050 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2550 over it, 6.10\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fc78a151782cfff691c7f3cd1ec5e5e18effc24df9a40fa7ef148ddeca2ede"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_runner/default_runner.py: FileTooLong \u2014 2567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2067 over it, 5.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"792e5c282339be831329c208df2446375827155c4665383609c26a2f66f386ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openroad/place_groups.py: FileTooLong \u2014 1732 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1232 over it, 3.46\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place_groups.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec036ed89e28cb171d85121f5c8c5d84c38a7657d2f3f107276e31e2615c35d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bsc/__init__.py: FileTooLong \u2014 1425 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 925 over it, 2.85\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/bsc/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"577bf79747baeea3f5843b3256d57e00c11a6795f0684e490cb770bf529ee486"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote/agent.py: FileTooLong \u2014 1321 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 821 over it, 2.64\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/agent.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a292e0ae17d36f6607bb925f856f262b6a6f1d6d9a9b175ff9c55af1fc14d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow/flow.py: FileTooLong \u2014 1236 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 736 over it, 2.47\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"531179fdb8ce60a95a6fb4f8d3c6abc1e4001883092acd968494a0d48b15a4c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/cli.py: FileTooLong \u2014 1234 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 734 over it, 2.47\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8725066c7847f62a1e9650dab0590bf377ef2d3c254a2842abb26f3a9a561b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_runner/resolver.py: FileTooLong \u2014 1218 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 718 over it, 2.44\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8440e3b19402c5d66fd7c1a4d867a3fcf76097ac31f3d04cbdf0759551cee183"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flows/nextpnr.py: FileTooLong \u2014 1120 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 620 over it, 2.24\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc581e820803048f3afddff3d0ce9b7b85d166486a8d259d2eea7792bb699711"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FlowLauncher: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"614258a107bc66c3f9130fd8b70d97a0c8a9f89c6985208d8cb05690258560ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/sweep.py: FileTooLong \u2014 986 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 486 over it, 1.97\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/sweep.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafda61458683ff04c3a52d5bfb2ee7e99d20f02244a9d22beb52ee866c539a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/records.py: FileTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 460 over it, 1.92\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/records.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8048ad010941c4d55c21eace9dc1f331950311af62c9c4786f96111852101c54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/deliver.py: FileTooLong \u2014 909 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 409 over it, 1.82\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/deliver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98793bae342592b76be265dfd391acd885338750f3da2b11398a45d64e22dbf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yosys/yosys_fpga.py: FileTooLong \u2014 903 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 403 over it, 1.81\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys_fpga.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6258579e7cbf3f464f11941dac9903484c5b5c0af6838776f060ebfee1c0da03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/introspect.py: FileTooLong \u2014 875 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 375 over it, 1.75\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c7610332e758a331187b2fa9c7d848e2d2f28e21e1db9eec28299beb020fef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/proc_utils.py: FileTooLong \u2014 857 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 357 over it, 1.71\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/proc_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bdeda5a07430c747a4f2d3060b18b6f066c31864bbc0f35dd0a5d8e6432f92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sby/__init__.py: FileTooLong \u2014 849 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 349 over it, 1.70\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60134a21e7fe6f335069ee1fe080591e9246baaac170b5b2b1f9796b70a03ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/dataclass.py: FileTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 344 over it, 1.69\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6562012e97dea771378dd1f6ec3d8b14d21b644880c350605ab37704ee9a65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vivado/vivado_synth.py: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 324 over it, 1.65\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_synth.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"458f67333d7243744ddf436ebfd8329736df897018d315607750704578966847"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openroad/final.py: FileTooLong \u2014 805 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 305 over it, 1.61\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/final.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa7ab363f16050d8cab4ffbc63b2de1eedb7f948e800c71cedd1f3ea02d608b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Flow: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fafbbc0de21d34dd32d6ea680a532bb9738d27d557b90bf8246e1d5e5d605ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Design: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8144212d2ad7a9de7517393233265ef6b167c35d22bc303b9ebad5d10c8a547"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/units.py: FileTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 241 over it, 1.48\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/units.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3a76c9c252a27d4ff38b4432e6d0da8d99addcb5c2d6c32e1ed9597111564e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yosys/yosys.py: FileTooLong \u2014 719 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 219 over it, 1.44\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72e26a1f71d8a38a5b3bc9e533259955f512b2e82dd94690565fda430722098"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yosys/asic_groups.py: FileTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 217 over it, 1.43\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/asic_groups.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd83be358a2e3f95ba3d0b268cda5ad5f26e00dbc35b3bdb72a85addd868733"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/tool.py: FileTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 217 over it, 1.43\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a1ca4c72ac0b1b9e4f08af786d2c60a75d554f9514c5169e4303d9e9a0b5ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dse/dse_runner.py: FileTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 212 over it, 1.42\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/dse_runner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f700cd9aa5f310ea153155209b8e7e2f9a8ff4678e3bb2aab323cbac1f7668cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_runner/chains.py: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 199 over it, 1.40\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bde1c40473cd78aa93489a90e8986e9ff718a12086200b690c62b59a241b4ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openroad/final_groups.py: FileTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 168 over it, 1.34\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/final_groups.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53916abc40fee2ac63813bdd99b86610a682894cb1985c3f755f206e837e53d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_runner/trace_inputs.py: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 151 over it, 1.30\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace_inputs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25886041c6f6a886079a08f504cf9bfc7923605df6a9e66b1d69d051c668646c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: platforms/providers.py: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 134 over it, 1.27\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/providers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a16d5e7d8e5aba1d0b89521c02cf018cd5621ad574d304592beb157031791c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Nextpnr: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6051173d638c8cad3139f48ac32b7d1c76f218fe04b6fa3dd14f835fb110f18b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yosys/common.py: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cefa2cfbdd70eb6899244b5c4c0d6ae38d26cf68700c1ee31a80557fa5c981"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flows/openfpgaloader.py: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 over it, 1.22\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openfpgaloader.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"525ce6354648c991269081e02d4df2592b2f84b316f14d17776427cc97d727fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: platforms/upstream.py: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 109 over it, 1.22\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/upstream.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7366d81539c0ac094f66c7ef736b153699c770d8025b79bd090c62796e8bbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ghdl/__init__.py: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b925afe6168f82ba7affea8811db29af1e5a6b2b985f2279ab6f18e954fd52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _internal/cli_utils.py: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 98 over it, 1.20\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f098165328ad7bb7b064a3909b823ae14d707a5867a283166482026ec94054a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_runner/launch_generation.py: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_generation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6684443e23824324901f11d3cf27f5b8d57fbe68df6e9ed0ddd661cabf79b79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: verilator/__init__.py: FileTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 93 over it, 1.19\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/verilator/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18441a4079d3bdefbd0ab009e9c9ad5d6e0b1fcd6fd5cd4c8dcb3af9f8ba80a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/bump_ci_pins.py: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bump_ci_pins.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"789b6ba8528330afa1da5caa6dead69c909573d9216e0b2f10d779ab9f6d2e76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dc/__init__.py: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/dc/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c775988683d7a93e4eb4119f855a04180ae169758ea729842053c803892ac73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_runner/settings_layers.py: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/settings_layers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6c6c115d3bf6410211541f7c29555b055e96685fc1ca52fe55f873480a4dfd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flows/xilinx.py: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/xilinx.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7927238d5868c564a7107d4e4804a942e08991c7edfd0233f5fefe5242551061"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openroad/place.py: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4fba6656bd48fdcdf3077ed93adfd04f0c2dee6e4971e5eb4fae31334f8c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/xeda/_internal/flows/iverilog/__init__.py:72-98 | src/xeda/_internal/flows/nvc/__init__.py:384-412 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/iverilog/__init__.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"76281eef6fcd658110e79142b07c9b01a069031ff8206d8d64931e58050837a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/xeda/_internal/dataclass.py:642-661 | src/xeda/_internal/flow/flow.py:476-494 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f70adad9c22537ca010da45a67b51befe3a7d6b659170faea73f02beaa8b01f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/xeda/_internal/flow/metrics.py:299-317 | src/xeda/_internal/flow/metrics.py:391-412 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/metrics.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ea03fdb2a5e14c84502c20abaf5be6bd25430d878c48c3ec3b38f0463ae5c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/xeda/_internal/flow_runner/run_lock.py:261-269 | src/xeda/_internal/flow_runner/run_lock.py:485-492 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/run_lock.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5dc2e6e647229449d8512af25f5761c975113a0e4ec7f15e28fd6d6dce585e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/xeda/_internal/sweep.py:323-344 | src/xeda/_internal/sweep.py:356-379 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/sweep.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99bfd6b9b3bbb5928f751821171a23739c3cbff0c46c293c21aa9215e86553a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/xeda/_internal/flow/settings_group.py:322-334 | src/xeda/_internal/flows/openroad/groups.py:126-138 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/settings_group.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c554b4f9838c4c8b12be4a9f0e67e96b7723daa1bee5872dda142f4552ca97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/xeda/_internal/flows/ghdl/__init__.py:586-595 | src/xeda/_internal/flows/nvc/__init__.py:228-244 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9ecbf86dfaabbbe80131f486b93cbcad7044eea0ded4c4db21e0c57c64b8e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/xeda/_internal/flows/openroad/metrics.py:47-54 | src/xeda/_internal/flows/openroad/metrics.py:58-71 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/metrics.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"81000b86a656ab13a53459af2ba0151a20882deb8d65f16fe6ae400db323bb17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/xeda/_internal/cli.py:781-798 | src/xeda/_internal/remote/client.py:575-588 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64082c317ef256c9b531d0fdf244c0e74ca2e0d9813c695c1ada86634d357c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/xeda/_internal/flows/iverilog/__init__.py:385-398 | src/xeda/_internal/flows/verilator/__init__.py:472-489 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/iverilog/__init__.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"811edcc183229fcabff7a6c2aac0f5fb32f3cef4fa2b5d07f4ce1aec01e93e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/xeda/_internal/remote/fetch.py:357-367 | src/xeda/_internal/spec.py:26-33 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/fetch.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba7eed76f3b98fc90d33c4562f227406ba9732a62cbf858f7d61f8aea35ff9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): src/xeda/_internal/pdk_cli.py:432-451 | src/xeda/_internal/remote/commands.py:566-591 | src/xeda/_internal/tools_cli.py:452-471 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/pdk_cli.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccac6fa82611402143a9647726dd003adc3decaabd5e03c1512e570e7d9665e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/xeda/_internal/flows/vivado/vivado_synth.py:82-89 | src/xeda/_internal/flows/yosys/common.py:1024-1032 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_synth.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81f10830fe8727ab1f248232d27a1e0241f90cddeedba804d79ee43129f4c2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/xeda/_internal/flows/openroad/base.py:146-154 | src/xeda/_internal/flows/openroad/base.py:158-168 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/base.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"08944f3efb67dc9dd4e4fb608606e1ae0bf8069d27366ae33f01d3a258646705"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): .github/scripts/bump_ci_pins.py:387-397 | .github/scripts/bump_ci_pins.py:406-416 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bump_ci_pins.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75b21b885d6b73b6ba2d63d2b194577fb03e9d847b212136d3e02bb82c6a506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/xeda/_internal/dataclass.py:573-588 | src/xeda/_internal/design.py:3194-3204 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"f227d090e8f53223fbd3f858f4280483cc931f29918a9549ca1007f373e389a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/xeda/_internal/sweep.py:563-579 | src/xeda/_internal/sweep.py:845-859 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/sweep.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef810b2fc0158d38cf46269dc53c117c251df60545d0a95a379b6c94ff3f9ae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/xeda/_internal/flows/openroad/place_pdn.py:275-284 | src/xeda/_internal/flows/openroad/place_pdn.py:288-297 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/place_pdn.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"580953a603dad858f8431fcf6df686252353f0a115761add87e900e178d96410"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/xeda/_internal/flow_runner/trace.py:526-531 | tools/asic_parity.py:1302-1307 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"14396893745d025cb98e60bbf9873f423027137e86df8624470efe1f41b288cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/xeda/_internal/flow_runner/trace_inputs.py:459-464 | src/xeda/_internal/records.py:532-535 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace_inputs.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d54ed1306654b8d2011a8b16242dc414b1bab5c7431a03ddd505d0466179453"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/xeda/_internal/pdk_cli.py:71-80 | src/xeda/_internal/tools_cli.py:58-67 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/pdk_cli.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4c9a6ddab2780920c3d4f908a9493bb9f5b8432aa926166bdea5eb42ca9983"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/xeda/_internal/flow_runner/resolver.py:170-174 | src/xeda/_internal/frozen.py:53-62 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c432704da0c5b370ce5b2d4ee2a60f4215cc7966fab34e4b3e52066c032f8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/xeda/_internal/local_settings.py:254-258 | src/xeda/_internal/project.py:271-275 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/local_settings.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a49792e532867e34b61054eb17b78444d8b609a40afe8de3920c1ecd4a986d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/xeda/_internal/dataclass.py:843-847 | src/xeda/_internal/units.py:1122-1127 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a045ce42b343b84c6a805c779e339e5b4b518bb74c8f0e78df78d88e4ca5085a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): src/xeda/_internal/outcomes.py:206-208 | src/xeda/_internal/plan.py:143-145 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/outcomes.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"637a18ef2a29785733f7ec200eed10f30207999cf5a9f2ac986fa460e4808d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/xeda/_internal/sweep.py:219-225 | tools/asic_parity.py:1040-1046 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/sweep.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9b409b1f8619acf8544a63d23afc9e8ec879366df9508993641946a93c1355"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/xeda/_internal/code_epoch.py:196-200 | src/xeda/_internal/remote/environment.py:87-96 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/code_epoch.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbee31ca18d261af876cd3afc24197d6a4fa5436010c50b1c52ff005a6840178"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/xeda/_internal/outcomes.py:331-340 | src/xeda/_internal/plan.py:221-236 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/outcomes.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"514974fcfc5d856a52a0cbc4737ce1fdbf0dcb8e9282f1955d9da18c3ab03aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/xeda/_internal/dataclass.py:349-352 | src/xeda/_internal/setting_text.py:62-65 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d931f3f2a07c94cf13b6a1c06812c7f464e3ef0649cbf81a8387f364e8470a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): src/xeda/_internal/deliver.py:421-421 | src/xeda/_internal/sweep.py:1131-1133 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/deliver.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e05d89d3fc19b794cbd06546e7620265aaab5c08cbdb62f0e1bcccedb4440c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/xeda/_internal/design.py:1692-1702 | src/xeda/_internal/flow_runner/launch_generation.py:192-201 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b758563a74e5153d16bb713b317ae482a6ba19a08eda9b67082508e2c8d21f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): src/xeda/_internal/remote/agent.py:752-753 | src/xeda/_internal/remote/frames.py:70-72 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/agent.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"b733bd4e58b3d20b6193593b478851b2d9944099a659f9c5184f7ddaa5b9b6b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/xeda/_internal/flows/vivado/vivado_project.py:97-102 | src/xeda/_internal/flows/vivado/vivado_synth.py:1076-1079 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_project.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d574b684eb46afad065633a2ca8b2d0f140a4cf8f06dd10ff61cb73ad7c3d8c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): src/xeda/_internal/flows/openroad/cts.py:231-256 | src/xeda/_internal/flows/openroad/place.py:672-698 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/cts.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f82e286d926b3098f6931b57447ff1783177fe7773dc5f4f4867a19dbafc3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): src/xeda/_internal/introspect.py:510-533 | src/xeda/_internal/introspect.py:548-573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed14d13bca6d2f6d46c82dde09539abe4e2db00bd4a27dcd7c30d2a3c3f72ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/xeda/_internal/flow_runner/default_runner.py:2822-2837 | src/xeda/_internal/flow_runner/default_runner.py:2968-2983 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":2822}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ac879530cb3e9e5a93271857761873d39bc98e9565f88e34d6a3692cfd85bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/xeda/_internal/flows/ghdl/__init__.py:586-594 | src/xeda/_internal/flows/nvc/__init__.py:228-239 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"87782e30492b0d6a78dc8bb9707636d18b63d1b65c73f80437e7b87609492f14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/xeda/_internal/platforms/upstream.py:352-361 | src/xeda/_internal/platforms/upstream.py:792-801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/upstream.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"797d1c74e5874fde86440ac80f00164744d37240df85e031c3e86e85c2841151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): 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 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060src/xeda/_internal/flows/yosys/cxx_rtl.py:176\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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: \u0060GhdlSynth\u0060 names \u0060...flows.ghdl\u0060 in one and \u0060..ghdl\u0060 in another \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/cxx_rtl.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecabec58c51fcd4d7ca0fc150ee9aac12ecea10728b3562172b4a23d4e3bf609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/xeda/_internal/flow_runner/outputs.py:148-153 | src/xeda/_internal/flow_runner/outputs.py:217-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/outputs.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5533915871b25f58ca16825485148ef3a816478e1697d5a80a0493928abe802e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/xeda/_internal/flows/dc/__init__.py:712-716 | src/xeda/_internal/flows/dc/__init__.py:720-728 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/dc/__init__.py"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b6c104f3b5fc3d4c985f07dae964973add86fc02d4f1184c0d5e56b9994070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/xeda/_internal/flow/flow.py:1216-1225 | src/xeda/_internal/flow/settings_group.py:114-119 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"02abf97fee60a1b49440643d7f5fdcebb7772bd70ccd27d8326440be547a7749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/xeda/_internal/flows/nextpnr.py:463-473 | src/xeda/_internal/flows/yosys/yosys_fpga.py:412-423 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4985fa511c9b58f171d9fdc0ded9dc21b92e8dd6a3d28ae393e80156c2e0245b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/xeda/_internal/flows/openroad/cts.py:211-216 | src/xeda/_internal/flows/openroad/final.py:889-894 | src/xeda/_internal/flows/openroad/grt.py:289-294 | src/xeda/_internal/flows/openroad/place.py:634-639 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/cts.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f14f0575a8d516c3a351f216047215cc5221311a9dd30e04a0440125e1af488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/xeda/_internal/flows/openroad/final_groups.py:329-340 | src/xeda/_internal/flows/openroad/grt_groups.py:518-529 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/final_groups.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba2f2dd8abc9baa1e1b3ae751ff26ade4714de349ffbe3d6e458b8eaffa37ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/xeda/_internal/flow_runner/bindings.py:267-272 | src/xeda/_internal/frozen.py:66-71 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/bindings.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa697d6d73b77dcf65178202987622c4bb9a9bd160587398e65d300f32b45e69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): examples/bluespec/uart_link/tb/lean_perf.py:197-221 | examples/bluespec/uart_link/tb/lean_perf.py:258-287 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/uart_link/tb/lean_perf.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86d6be572be0c39da397d306f50d0ddb03ebc23b47f31e64f3561b8d4e1f219"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): examples/bluespec/ascon/tb/generate_vectors.py:99-113 | examples/bluespec/ascon/tb/generate_vectors.py:117-131 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/ascon/tb/generate_vectors.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b78f79a639a7ea406250b238450374eb3eb7fd62d8d2d97273aae78c0040711"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): examples/bluespec/uart_link/host/leanlink/fpga_model.py:499-504 | examples/bluespec/uart_link/host/leanlink/fpga_model.py:507-514 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/uart_link/host/leanlink/fpga_model.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f647d65508f2387be3f0c39fdf28283b92f612dc2aca5225333d033ac3cfc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/uart_link/tb/lean_arq.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f8585cefe24069f88235de92a654f92c0fd7d645d019f677fb39d5bb9134a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): examples/bluespec/ascon/tb/generate_vectors.py:160-184 | examples/bluespec/ascon/tb/generate_vectors.py:294-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060examples/bluespec/ascon/tb/generate_vectors.py:160\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/bluespec/ascon/tb/generate_vectors.py:157\u0060 calls \u0060enumerate\u0060, \u0060pattern\u0060 and \u0060examples/bluespec/ascon/tb/generate_vectors.py:293\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/ascon/tb/generate_vectors.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"408bde3ef0b9f84ce2fe4ac816f55da8164629a9c3f35c02a944ce3371be342a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): examples/bluespec/ascon/tb/generate_vectors.py:257-273 | examples/bluespec/ascon/tb/generate_vectors.py:319-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060examples/bluespec/ascon/tb/generate_vectors.py:257\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/ascon/tb/generate_vectors.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"41075c6850c55b287d3c7253deddefa0c7dc75fc4ab2e4ee8a5163b286a7f7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): 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 \u2014 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 \u2014 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 \u0060examples/bluespec/ascon/tb/generate_vectors.py:173\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/ascon/tb/generate_vectors.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4658ff40b2d77abc2cc8667117c67674ad21f5e274ee44a0932f0e7b42a53f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): examples/bluespec/uart_link/tb/lean_credit.py:139-146 | examples/bluespec/uart_link/tb/lean_credit.py:151-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/uart_link/tb/lean_credit.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"707af1b04037e5f66688b1665a5966800a088e7c4fe7bcde75f1a95a1e56a871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): examples/bluespec/uart_link/tb/lean_session.py:475-482 | examples/bluespec/uart_link/tb/lean_session.py:621-629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/uart_link/tb/lean_session.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5ea56de38321a302ee9fd430d4bddf000ff1fea8d5b74aace62990faea957a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/bluespec/ascon/tb/generate_vectors.py:237-246 | examples/bluespec/ascon/tb/generate_vectors.py:285-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060examples/bluespec/ascon/tb/generate_vectors.py:237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/bluespec/ascon/tb/generate_vectors.py:295\u0060 calls \u0060decrypt\u0060 and \u0060examples/bluespec/ascon/tb/generate_vectors.py:247\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/ascon/tb/generate_vectors.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e680aef89d093c5cd3239de5f3db1ea7bf461774f7347972c3a5fcf5703aa79a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): examples/bluespec/uart_link/host/leanlink/applications.py:66-72 | examples/bluespec/uart_link/host/leanlink/applications.py:105-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/uart_link/host/leanlink/applications.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"edced3a7576f148a6e8e4c7d81d49c7035fd1a041c2090d05c132fb6527676d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/bluespec/uart_link/host/leanlink/codec.py:403-409 | examples/bluespec/uart_link/host/leanlink/codec.py:487-493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/uart_link/host/leanlink/codec.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2d73122eaec58dcac1a29432a60e5a5df4ba07711a63c2df683e3851d62a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/bluespec/uart_link/tb/lean_perf.py:205-211 | examples/bluespec/uart_link/tb/lean_perf.py:233-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/uart_link/tb/lean_perf.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3b8a34bd407d9c69499ee619db1ce5fe4b63d99fc4ecb82770398e6f985630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/bluespec/uart_link/tb/lean_perf.py:210-214 | examples/bluespec/uart_link/tb/lean_perf.py:274-278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060examples/bluespec/uart_link/tb/lean_perf.py:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bluespec/uart_link/tb/lean_perf.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"623aaa57b3b80ed13e6f4dd24759e5d79e9ac1fe04223c5ff4f4f330b9d0261c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/asic_parity.py:1704-1709 | tools/asic_parity.py:1761-1766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/asic_parity.py"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e21a0e9b2cfebaa2477d57ee07ec62cef7d8ba385d19b73f132f4825d72e35"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OpenroadStage (LCOM4 4): OpenroadStage\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/base.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4f575bc6b46c159f19c74fbbd70689aa10fc2d3da8c98109c2a04506c9fb0e"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3fde2e01d1762a711ccc40b16152f868c8d4ecd789b43a87daae5b4294f1b59"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/default_runner.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/default_runner.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd423ff6356ff14b8634c05b3995b5b0dac1fe0423552093fe9c8bc609bc5434"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/resolver.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/resolver.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce011967a51b89fee389900a0f4717c8fb90beb17379fb11a0847d7e08469f11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/dse/dse_runner.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/dse/dse_runner.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/dse_runner.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"d884885ebc0cb661873b0c14d7f3070a0506f34a6000a1e8539882d50ada70a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow/flow.py: src/xeda/_internal/flow/flow.py 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow/flow.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"70061aa7bf783ff4c86b3701346bfcdd1cfec58ce795a135b4d220932e840c31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/verilator/__init__.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/verilator/__init__.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/verilator/__init__.py"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"745d250cd69f9f21f3315c1f3de6a51cc4e8f1793c2c5d548211564a8f784998"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/bsc/__init__.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/bsc/__init__.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/bsc/__init__.py"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd81cae17c65aae003112d6982e248e906615f097c3450d50d3be0a5e5f7c8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/yosys/yosys_fpga.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/yosys/yosys_fpga.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys_fpga.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"5450f37c38281300d07316ed39af91a6251a81bdd275f3f4353b120f607f9b33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow/sim.py: 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 \u2014 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 \u2014 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow/sim.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6024d4e98b49a2d87238807b07a05c3645619afb86793ec8f687dc26005084"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/yosys/yosys.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/yosys/yosys.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys.py"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bc0c75df066c76d6b308b653ea8e79032e16f843cd4a0b67c2abbd154b1df5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/settings_layers.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/settings_layers.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/settings_layers.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c0ccceeeb48bd746517a7406a1afd137944e4cf68c6cf94979b93cbba47575"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/trace.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/trace.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81cdd7bacdcab2ce8652a09e60bb3e98e4a34220345a6838db0df09c8ce76fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/proc_utils.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/proc_utils.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/proc_utils.py"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5c21ba3f27792b59933360c227337c5ea9e378e3bcc6e6bcdb5867b3fe358c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/plan_freshness.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/plan_freshness.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/plan_freshness.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f716150a4831c14eddf36d2ddd59bb9bec9d540ef40b7ed2fe2efc74d76f202f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/trace_inputs.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/trace_inputs.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace_inputs.py"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ec34a2e17cef1b2994a55dc9d4956b26d7190a14a76e4d0e6987bc5f183ea3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/deliver.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/deliver.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/deliver.py"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3c2173d9d331b85f507eca3a2e8a16154dc2fcc42f8918e5760b03831e530d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/cocotb.py: src/xeda/_internal/cocotb.py 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/cocotb.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cocotb.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"befaf3198e57922c126c203ee8c1b729baa848a703ad72061e42869f17d7bb71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/api_baseline.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- tools/api_baseline.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/api_baseline.py"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"5883d36eb9c6df0c832875813e6e2c85808e8b9785615c123a3a79b6d7de38ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/cli.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/cli.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli.py"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"148fc573be2a5e35f6d697ad36d0c49c1ff125f9572040b6a9a524595649b074"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/nvc/__init__.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/nvc/__init__.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nvc/__init__.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1495ced176391f8f8b9a43ae4a9e9f0e6fecf3f9ea9ba39bcd35708121d088a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/bindings.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/bindings.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/bindings.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"164bd93561ad4aba065b4adf1204cb12b01756c711f23fa61d2164c957d5087e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/launch_run.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/launch_run.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_run.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c19ab21ddbf130e584357b8e2b50a52ae7d11c48f044f72983fc9f3c942764f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/outputs.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/outputs.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/outputs.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2301fda1d5455b0198c20fec41c8224604f6d720bdd902f5defaef0c0181763"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow/fpga.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow/fpga.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/fpga.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38a201fcd36cf7cea8b61fdebaf1709b39501151d46ae12f85519ddca91601f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/error_codes.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/error_codes.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/error_codes.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f33ccb07e261f45d814fd4a22e27c1a150371e45327dc81a2a7be19b1ca6b8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/agent_skill.py: 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/agent_skill.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/agent_skill.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b79c7fb7e22a07c78490f74f9d8720778c5c8500b78adc111b1e8cf4acaf0e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/cli_settings_completion.py: src/xeda/_internal/cli_settings_completion.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in cli_settings_completion._parse_request_words at line 140. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/cli_settings_completion.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_settings_completion.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba49436277259b7fc57ac46a35b59719ed357f9c3ba51a4ce316fdd127c2c0f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/launch_generation.py: src/xeda/_internal/flow_runner/launch_generation.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in launch_generation.settle at line 507. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/launch_generation.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_generation.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"3206adf9362844a7d0e90c76ae3fcb132db73026e70c208927594ca3dfe3dd65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/dse/fmax.py: src/xeda/_internal/flow_runner/dse/fmax.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in FmaxOptimizer.update_bounds at line 208. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/dse/fmax.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/fmax.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0502ec901cd5196b972952182c777714d32dcdd1198cecb859e9f3ec0832926f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow/io.py: src/xeda/_internal/flow/io.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in io.check_io_declarations at line 367. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow/io.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/io.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c619c2271a0f99cdc2584ade0e9ac8c27eba410364a4edc36aca256252627b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/remote/launch_entry.py: src/xeda/_internal/remote/launch_entry.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in launch_entry.execute 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/remote/launch_entry.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/launch_entry.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f92fd34fcae1cc858a16ca9e36ac7c1f73bf58cf5b36fa6d12120dc954d5f96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/generation.py: src/xeda/_internal/generation.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in generation.judge at line 302. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/generation.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/generation.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f71fdd27e576ac20a59e4a48720c72f8cd62fd2f7488cc13723b7a413aa3119"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/chains.py: src/xeda/_internal/flow_runner/chains.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in chains.complete_request at line 908. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/chains.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/chains.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbdd8553e8861ffad773f5c0714681a0fb437c0f3b2566eccc88a074003d298"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/sby/__init__.py: src/xeda/_internal/flows/sby/__init__.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in sby.timing_problems at line 441. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/sby/__init__.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/sby/__init__.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c320acb30d687347fe1dc51594fbbe95e214161583d0c7941967674682246c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/launch_producers.py: src/xeda/_internal/flow_runner/launch_producers.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in launch_producers.run_producers at line 264. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/launch_producers.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_producers.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"992c5c441acea01205574d858004975bb523a0634c9597ed50fa4693e6dd4ac7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/remote/fetch.py: src/xeda/_internal/remote/fetch.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in fetch.select_fetch at line 215. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/remote/fetch.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/fetch.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c618cc00e3954554964da413b34940c9a207375970b36620ab858ef31b550c42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_runner/launch_result.py: src/xeda/_internal/flow_runner/launch_result.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in launch_result.launch_result at line 560. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_runner/launch_result.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_result.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"405e94ce042ac78e94b96f44e1036e8e023c331f2f51fcf2cb1dfd8f5653e8e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/remote/packaging.py: src/xeda/_internal/remote/packaging.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in packaging.package_inputs at line 155. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/remote/packaging.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/packaging.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb3e58db3411e37dbddd400b2a8ee90ec49e56982a37b79d81f0782c89c0ec8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/vivado/sim_evidence.py: src/xeda/_internal/flows/vivado/sim_evidence.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in sim_evidence.parse_xsim_evidence at line 22. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/vivado/sim_evidence.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/sim_evidence.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd728a4ee0f7ff8abd390b36f3db02a9c16f550c14ae78832ea36d3fb7936cf6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/modelsim/sim_evidence.py: src/xeda/_internal/flows/modelsim/sim_evidence.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in sim_evidence.parse_modelsim_evidence at line 20. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/modelsim/sim_evidence.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/modelsim/sim_evidence.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0738a1d2fcb742fc90a9892d5d7b2c66699fe8ee90aa4aa52595403edae0223"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow/sim_evidence.py: src/xeda/_internal/flow/sim_evidence.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in sim_evidence.parse_nvc_log at line 138. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow/sim_evidence.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim_evidence.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6036ce7398333b2fc39695c78f761e39f5874a5cd295001504eecd6aa5702f0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/bsc/sim_evidence.py: src/xeda/_internal/flows/bsc/sim_evidence.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in sim_evidence.verilator_evidence at line 34. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/bsc/sim_evidence.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/bsc/sim_evidence.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1a85622cd1dd10084db0f268096bee7e7283873b9d716a7639837a1b06e855"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/scripts/bump_ci_pins.py: .github/scripts/bump_ci_pins.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in bump_ci_pins.find_update at line 570. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- .github/scripts/bump_ci_pins.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bump_ci_pins.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8954d5655bbfa05cbd188fd6f7e88d6d090b01f5353bbd9b433672c1e2e52840"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flow_catalog.py: src/xeda/_internal/flow_catalog.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in flow_catalog.complete_builtin_request at line 90. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flow_catalog.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_catalog.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7c0139b778efef25b901712dd1d7c7b99b4acebbbe316ff359433f845bbcb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/local_settings.py: src/xeda/_internal/local_settings.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in local_settings.local_settings at line 110. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/local_settings.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/local_settings.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f3e284a478dee5749afdd5bf243e1ba7da70a6b5b84c93460fb8175939e90a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/nextpnr_constraints.py: src/xeda/_internal/flows/nextpnr_constraints.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in nextpnr_constraints.reconcile_clocks at line 179. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/nextpnr_constraints.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr_constraints.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2a70173bb6e1ab37fe53d477d70f8ed54fa1860e19d3394e7df75bf7f28622"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/dc/__init__.py: src/xeda/_internal/flows/dc/__init__.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Dc.parse_timing_reports at line 507. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/dc/__init__.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/dc/__init__.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99741e2149fcfd21374e7808b3116a9e395509afe08a43d58838fa4df6f68a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/xeda/_internal/flows/quartus/__init__.py: src/xeda/_internal/flows/quartus/__init__.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Quartus.parse_reports at line 289. 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 \u0060git log --since=\u00272026-08-18 08:26:55 -05:00\u0027 --until=\u00272026-11-16 08:26:55 -05:00\u0027 --full-history --no-merges -- src/xeda/_internal/flows/quartus/__init__.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/quartus/__init__.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bc808ae3cf1240ed2e1745997ce63439f5156f0c7e814268a0f7edfebba8b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO windows? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cocotb.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1245e7c2fa350e294db5d62c7f09c48ca9e7f0871159c056e5e10a5927c712"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO fix debug and verbosity levels! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/utils.py"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2239298adaa8521e053da2536bd6d7bb3555cd744f4f3d1b7fc184148fff46d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO where should this go? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/cxx_rtl.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c109aba6f2261beb3d6f1012f989711834e01dec930dfb1c33392e8ec5a419e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO factor out common code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/yosys/yosys.py"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef07adff5c6718f00bbbe81a818f1ffe8d7ef46cc536d1e010c3d66202f110b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: verify with a post-implementation timing simulation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_alt_synth.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7659295114fb3767293ddecdf1d9bee4cdcd3513cbd3e3633a0ea7718d8d4877"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Vivado can run several configurations (test vectors) in one run through \u0060run_configs\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_sim.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7bc5f1895f5d011cef36e3234959aa66bdb0a15cef978e74d5e56cc670e79f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO add alternative methods for adding multiple user hooks? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_synth.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bacd1eaa2270a68421b365260364b321ff4260bc4898e0e1f826ce62fb409b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO factor out cocotb handling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nvc/__init__.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79f70d1f082296632e6fa8ca952b7b7564e7ebac43857a21abd84fd781c499a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO factor out cocotb handling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbb9d01581b5f3d636bfcd20e962c43e7c9c29ee9a6967cf047f2b98ec1de8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check whether library paths work. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/modelsim/__init__.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"44732a1cb8d83de8647c42cebfc327325db80108bff20b39d37ec6ad8cf45fd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO workdir? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"305c63e40b1a5d82ae5f6997104fd04b0f7362c93339a1b31aaf76a698443d12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check the GNAT version too? The LLVM limit is a guess. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5ba7a233076fddf91e3324ee06270889d00dca988975ba4b7a09e27da0ba69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO move to validation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/ghdl/__init__.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e1a2429182d37919dee79f2c99483879b2a36c602aab9bdf9bb2cb460c9b13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # The \u0060.mrp\u0060 file can have page breaks anywhere (TODO: check for other kinds of break), so \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/diamond/__init__.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1f920759c9ca285751f6876ce10a09b479324b539f85b9a0acd5056485eb07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO better/cleaner way \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5abf5f61404d1d79e1538b3c3ace9be3e3010a588545ea2c8da88547d1acf1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO make sure ranges are within G_IN_WIDTH bits \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/vhdl/sqrt/tb_sqrt.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b035fdb0e2fc0387ec05cbd194a1f60ab670ace1018bd806132e1372242ae00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO init/set other signals? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/vhdl/Trivium/trivium_tb.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6b41627dbc785e8cd6ac2076e979939eb3f4e4c6c31a89de62eeb0448fcbdf"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 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 (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 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 \u0060docs/adr/\u0060. ADRs are expected here because \u0060pyproject.toml\u0060 makes this repository a deployable product (line 73)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93f7a2c78f190233679ac8202a9f8e691d2305d697b777ee579589e9c4bff1"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4842ad367a78941ccec73d857627e21e838b932492f4ae73cdd87ada79a9f00"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ffc00ac5abec1cb2332d8afd3f3d3c78d189c6852a96d9638f98f712a1f0d90"},"properties":{"commitSha":"5195497ed53637fbd85bd14b208a8af3be38b200"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7ae1674d7ea6a2c35fe9f2abb64c5730afdb5fe6760fc22841e6a6a3fba7cf7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82cefb389b5751e25fc780e25c4e7285451c2d90bd614e9aa5bb53265e728ef0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96f88121b035a898a6759141862415469563ae4858d3bd2449d90d5e5ba04a57"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9aa6419843598847a294020561ebf311bda015a9f2806245ac15fc3cb0adaae7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53041d0452eb7a0f6d7363cca46cccfc47fe77904a465fee573e39f7c59d9395"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36fbc14be81a946a51ac3ef00a15c153b89b5190c82816063cb2a1a654571647"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9545660e6add0322e3f7b23092a9bdb2b9ecacff6395f93e694cf9dc97bdaaa2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b08d91159b195b4932fb5a2abd13973ebaf77151d1992c7d35bb5e2123e99d46"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee6da1b051ddff31eece62e737e90827fa671274985f5a26bd0f59d7c044006f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65e5bdcde0d55a8ccf310fbdd82744dd377cf3cc354ac61844fa3449b89a0e99"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9efc61085c90fbe1ede50aca3f9690f82fe1c1cc9bd1ace2abe757c1e913f452"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e41ef567e61842e5e4e1c74ddf14e0342e903650f2174fc76ae8ee7b1189c2ce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49423b6754fd89d4f177efe19a91488e8e6b0e174dc46f41bec86e14f72877cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1998180f159d6f570d73d550e08badc8f2eca72e9301e782844384b9c51d8a6a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c92107f92612c817c486377def33d41825f5a95565ee3c603aaac89e8b80cfba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83a2662ee89db66ae576929802e4341b71effe50791bb837a2301948dcca22a3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddc49ef52c93f5d89390c80bf8f0444bb97743496eeea781d1b7fcf904a3ea48"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"565cb0a25235d1502010c8d34a025c6ae5aeb826c7d5e305b97bb45399050c67"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9517cc4ae56162be6ef5c2593f4757b2854c319ee602e4c89f34f65769f92a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdd80ff4efa055538dc59aafc5e380459b7d05030fbc7ee936f19fa678b3e896"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3da0ac29c51eb4c97825431fba929cb163f1b2ca71dc0bdcca574df447813966"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed6cf53afcf282421b36b49abe497a6b87e148d1a97810d2870a115773e62e59"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a43441d1af445cefe91826cdfb0a6566f81ea6c18407380b7141e8be32b6a85"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5d44859f234f7775d4e43a50bf8d0b9cf35b0312cb53c7aa70092b9673fac07"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4e04b46a9ac3e25944aabbb5df2754a177e862da83639aa247f3dc9b87ba8f7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7e13c3a6e49abc8b112f910ebf4a1b130d4a0b89fbda78a604be2bf0582d829"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79a771a7ca90dc5c0ce42b1b7256cb4dfd5c144e1cd48fb6e908a92ace1238ca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67a5ba3143813961f7920b585a53744589dd05c7bacc5b9fb4c840e166458349"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d6b4fa8ee070d50e7611e11729355a64d6c72bdc242aa24f2d7dc01f414fdbc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c043edff1304ca61aad60e65a7ec29d3310a9f4c53a032c695165034d820804"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bef2a0075e8d92cf75b8e24bd03d6805a88b89ce1ef1f19cf41826c434e5719"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89833710f31b0fc6d55ff4a2d101f7cf50e5efcbe0b6f2d8adab627e2c40c7c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd64a5f53c092887dddb5bac3899b61f47f3233ca9fb6ceeff262d7c5e902d24"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7039fab2c0e5f4cc6d5a0824d5659364a2a3e3376c3c86d73baf583fd1c8cc4d"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31113917edfc860103fe3b6609a03d35a7112fa4e7ec0a38b713f72b3cbe74a3"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b5e20d83458bf0099619ee178bf68931f7e92ba82e6b04fdbe848108d48c09b"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"726a30d61ebba645707e45539837e6c2773a6e1f993b49a67041c8e73deedec8"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cdb9eba04b4a98d2211de6a5007fe72502726e078329c9adc851433896bdba32"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"278f84b46a1b6a707f130fbad92330b8ccca20afc07bb688a60a8583b863525e"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d8a095ad156ae61991ee58e624d9e466fd866c33ebcae8291979436e1c33b00"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9651aecfb6462cf573760ddf61256da6fac6a8b98f63cc868953de4a31ca982"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c87b732b23b78e48b2e640cfa6e937a5d93811d904a8194dd6c37920bebe4e1"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0edeb4fc1fc5289214e4e3b9a20bc9d3ff809dcef3f37f4111c8f94ec54183c5"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33b69a0b0b30404e67049b3ff6fe6c5c1c71e5a47ee76d80ea7226f9b47d8602"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8cc1f3e32325a05622cfe7f1c8cb9876c8651b27e0f618d9b1a7b0af3161865"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P1","level":"warning","message":{"text":"CI formatting step cannot fail: \u0060python -m tox -e mypy,black,ruff,consumer-typing\u0060 invokes black in the mode that REWRITES the files it reformats and exits 0 whatever it changed. The rewrite happens inside the runner\u0027s throwaway checkout and is then discarded, so the step passes on a badly-formatted change exactly as it passes on a clean one \u2014 it enforces nothing, and no other step in this file reads the result. \u0060--check\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4570533cbe68dfce0ebea0973bfdd9706782e6b4690add71e8f675754a3f92"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/python-publish.yml"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060actual is None or tick is None or tick \u003C= 0 or actual % tick\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flows/vcs_evidence.py, src/xeda/_internal/flows/vivado/sim_evidence.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vcs_evidence.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d828da6159564e5a8a7c993e65b51f96b5abe2ee94caf6dd9fe6fc10a6439e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060declaration.cardinality == \u0022optional\u0022 and declaration.enabled_by is None\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow/flow.py, src/xeda/_internal/flow/io.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"170250eb026015b4fa1c8e10047c6f37e66990cfdc6907b1080614b91ca50674"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060evidence.time is not None and evidence.time \u003C 0\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow/sim_evidence.py, src/xeda/_internal/flows/bsc/sim_evidence.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/sim_evidence.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52465faffa426ae7eb71f64e6a8eb52346365d3cde9a2db48905df8f4c08b40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060flow.results.get(\u0022artifacts\u0022) or flow.artifacts\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow_runner/default_runner.py, src/xeda/_internal/flow_runner/trace_inputs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/default_runner.py"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"30323ff42bcd17e2e61f109128046e06fbb62d9d9fbc512b95b8c804b36a5d1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fpga.part and fpga.device and fpga.package and fpga.pins and fpga.speed\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flows/fpga_pack.py, src/xeda/_internal/flows/nextpnr.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/fpga_pack.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eabba8af770844699b23f814011cd344934b0d6503f1abcafc3906e02d2dee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060info.field_name is not None and info.data is None\u0060 appears character-identically in 6 files \u2014 src/xeda/_internal/board.py, src/xeda/_internal/dataclass.py, src/xeda/_internal/design.py, src/xeda/_internal/flow/flow.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/board.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"389e054eb495080f92cc11ab1a43e1f9cf5abffef9c7a3f138f3f1443033be85"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(a, dict) and a.get(\u0022name\u0022) == name\u0060 appears character-identically in 2 files \u2014 .github/scripts/bump_ci_pins.py, src/xeda/_internal/tool_store.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bump_ci_pins.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05dafd34bb0603b5638833daf1b1671ee8db900d3f97da89dcadf2ae6a23fa2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(cls, type) and issubclass(cls, Flow)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow/flow.py, src/xeda/_internal/flow_runner/code_digest.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca9a1f640638703dff60694a654f8e99d0c46871f30c677a2e393c6d2b13ff5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(error, DeliveryError) and error.before_run\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow_runner/launch_producers.py, src/xeda/_internal/flow_runner/launch_result.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_producers.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25eda9a625b18eedafb739523dc9e9f3d7a316f83ce70edf13916be33fcac20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(inputs, self.Inputs) and isinstance(declared, self.Outputs)\u0060 appears character-identically in 3 files \u2014 src/xeda/_internal/flows/fpga_pack.py, src/xeda/_internal/flows/nextpnr.py, src/xeda/_internal/flows/vivado/vivado_impl.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/fpga_pack.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6044fb20ccb9965db2b577631daa22c78abd20e24e251e43fe22625a5253f1ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(v, str) and not re.match(r\u0022\\d\u002B\u0027b[01]\u002B\u0022, v)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flows/vivado/vivado_synth.py, src/xeda/_internal/flows/yosys/common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_synth.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0d219c03d97f82aa1104ce52c91d4faee49b5875ce46bc5ef72800cee64867"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, (int, float)) and not isinstance(value, bool)\u0060 appears character-identically in 4 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_utils.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"038b04bd3c5c09e1696b79d1f044d9682eeb5376911876d4f77eec1de8b2c7bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, (str, list, tuple, set, frozenset, dict)) and len(value) == 0\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow/flow.py, src/xeda/_internal/flow/io.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a4dee32dc99248db9fd723f4b318811699b373b6f1d20ac194d999a1728b38"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, (int, float)) or not math.isfinite(value)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flows/openroad/base.py, src/xeda/_internal/flows/openroad/metrics.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/base.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca86a7a61006b93091776ee271610175fc7dd43fe12a21ef1911e6681413838"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, int) and not isinstance(value, bool)\u0060 appears character-identically in 4 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_utils.py"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa42e04ded972fdeaaf55d6e7048e7b4541155ba6257512441e165d1bc8160d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and _is_comma_separated_list(annotation)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow/flow.py, src/xeda/_internal/flow/settings_group.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6bb197c8a9d7fd49e7902fc6313980a6fe12f62b306b3878731d75c8b8aedb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and os.path.isabs(value)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/remote/packaging.py, src/xeda/_internal/utils.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/packaging.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1554347c409329792a8ab8f9f1812e292531ced894cd0044d44f68ea32407d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module == IMPL or module.startswith(f\u0022{IMPL}.\u0022)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow_runner/dse/dse_runner.py, tools/api_baseline.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/dse_runner.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4293c3f95ffec8ea9a127109b66cae0c91b57ea19c114f0d91d06e3e41e36af2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.startswith(\u0022.\u0022) and not pattern.startswith(\u0022.\u0022)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/design.py, src/xeda/_internal/tree_outputs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c361380083b07eed00f248ced15091cf706433ee10233f295294bf7a32d37197"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(name, str) or not DESIGN_NAME.fullmatch(name)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/design.py, src/xeda/_internal/workspace.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce3091e6fff255463648c652cf569c683fd43d6d51f7d94b8419949c4a5725d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(node, Mapping) or segment not in node\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/records.py, tools/asic_parity.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/records.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"9364510750d508c82dab836f07a7aa6bdf376132ef9e8d913ce293ae9e3f57c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, (str, os.PathLike)) or not os.fspath(value)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/design.py, src/xeda/_internal/remote/packaging.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f11e850113363d6624e3dd56726a66d36c3d475998162c8b1da3ebc33b655fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not yes and not click.confirm(\u0022Install now?\u0022, default=False)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/pdk_cli.py, src/xeda/_internal/tools_cli.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/pdk_cli.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"35399b3b11778495090166c1144289438c7c615704a78568cbab54d393c55c0f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060origin in (dict, Mapping) or annotation in (dict, Mapping)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/dataclass.py, src/xeda/_internal/introspect.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb5cbacfc48230721c2e159dac17c5818434e348507e929adf232d755a4ca7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.fspath(leaf) and Path(leaf).is_absolute()\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/deliver.py, src/xeda/_internal/flow/flow.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/deliver.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a783eef595271844d07f003babdf6802eaabd5337162cbb81c43579ba28b6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060platform is None and platform_file is None\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow/asic.py, src/xeda/_internal/flow_runner/resolver.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/asic.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"554d5b1529aa26d569070baa6c7fdcac379554cdda3f34afeb344716dc239ae1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.stdin is not None and process.stdout is not None\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/remote/provision.py, tools/check_wheel.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/provision.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"27da637ace17fbc5339e56342d4d68a9b4bf4e740a44f7d0cb53d01ea851f7a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selected is None or not selected.references\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow_runner/plan_freshness.py, src/xeda/_internal/flow_runner/resolver.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/plan_freshness.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6002c84bad7156e2f6ccf2282764b8c0158e86fc2348013cf67e80a72432d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.cancel is not None and self.cancel.canceled\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow_runner/dse/dse_runner.py, src/xeda/_internal/sweep.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/dse_runner.py"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afd90943bf075937bac30544e20432439209b78be893ebcc0fd038c14ab3da5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060settings.platform is None and settings.platform_file is None\u0060 appears character-identically in 4 files \u2014 src/xeda/_internal/flow/asic.py, src/xeda/_internal/flows/openroad/base.py, src/xeda/_internal/flows/openroad/final.py, src/xeda/_internal/flows/openroad/grt.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/asic.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30f70a20bb414605ad253cbc571b66e74edfdb2e660d935e3a5b9b9b70e98d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060settings.vcd is not None and settings.fst is not None\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flows/iverilog/__init__.py, src/xeda/_internal/flows/nvc/__init__.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/iverilog/__init__.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6d266f73cec096f5af22a9cb18e58dc9925bed488d589888e685d7b1b1aaa2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target is not None and not isinstance(target, str)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/design.py, src/xeda/_internal/outcomes.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":3583}}}],"partialFingerprints":{"codehealthFindingId/v1":"7686ee737d127d9094dd7ebf7e5853ea2127c46a6fbc9acbaca2ed0196a17c69"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.is_dir() and not target.is_symlink()\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/remote/fetch.py, src/xeda/_internal/utils.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/fetch.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"867c31ec1cdaa9f4085466bbc9b8e75c96d9595c5960d554f44844bf6eb85c03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value == \u0022\u0022 and _is_optional_path(annotation)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flow/flow.py, src/xeda/_internal/flow/settings_group.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8561bd305af2bada007c49d6ef6259f1526080f0fc77773892dc76268cd056f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is None or (isinstance(value, (str, Path)) and not str(value).strip())\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flows/nextpnr.py, src/xeda/_internal/flows/yosys/yosys_fpga.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/nextpnr.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee8d96e70f17b238fd296dcb73b4cba70a19545a265b9f84dc2fdc856d0d4f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is not None and Path(value) != Path(f\u0022dump.{name}\u0022)\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/flows/iverilog/__init__.py, src/xeda/_internal/flows/verilator/__init__.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/iverilog/__init__.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be9dbe3bb20489ae247f29c9cd6c9c42f1721891b51a9c492308b6bdd81e12a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060written.role == DELIVERABLE_ROLE and isinstance(leaf, (str, os.PathLike))\u0060 appears character-identically in 2 files \u2014 src/xeda/_internal/deliver.py, src/xeda/_internal/flow/flow.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/deliver.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"438cf661fb735c8cb90c8872621ff29817fe1ed8831897bc97d5e53e7d51026e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060iter_artifact_paths\u0060 is public and takes \u0060artifacts: Any\u0060 from its caller, and it calls itself at line 24 (\u0060iter_artifact_paths\u0060) with a piece of \u0060artifacts\u0060 (and at line 27) \u2014 and nowhere in \u0060iter_artifact_paths\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060iter_artifact_paths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/artifacts.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af417a8204482cffe1fd983bc93f7aeb455bea1d52b8422a25fbe9f706362b8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060map_artifact_paths\u0060 is public and takes \u0060artifacts: Any\u0060 from its caller, and it calls itself at line 35 (\u0060map_artifact_paths\u0060) with a piece of \u0060artifacts\u0060 (and at line 37, line 39) \u2014 and nowhere in \u0060map_artifact_paths\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060map_artifact_paths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/artifacts.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1e9f532d61e4121d410a807301f36172ee32c4f19f7ec7c31bb260e53ccf1e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060filter_artifact_paths\u0060 is public and takes \u0060artifacts: Any\u0060 from its caller, and it calls itself at line 51 (\u0060filter_artifact_paths\u0060) with a piece of \u0060artifacts\u0060 (and at line 58) \u2014 and nowhere in \u0060filter_artifact_paths\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060filter_artifact_paths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/artifacts.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26bf00dde1fa938103a656ca171d7bba7feaf15a43bdb0167217b993294c94d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060escaped_names_atomic\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 582 (\u0060escaped_names_atomic\u0060) with a piece of \u0060value\u0060 (and at line 587) \u2014 and nowhere in \u0060escaped_names_atomic\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060escaped_names_atomic\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a763ea751d40cb7f02deceb30df80702e2b0b879a6cc5fb3f484a7d85360fe"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060scalar_problems\u0060 is public and takes \u0060annotation: Any\u0060 from its caller, and it calls itself at line 1464 (\u0060scalar_problems\u0060) with a piece of \u0060annotation\u0060 (and at line 1469, line 1478, line 1514, line 1517, line 1525) \u2014 and nowhere in \u0060scalar_problems\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060scalar_problems\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/dataclass.py"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"568d1c4934294a0e4e85cb704c7dd45758af0e022124b8d2fdf60605441d755e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060freeze\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 59 (\u0060freeze\u0060) with a piece of \u0060value\u0060 (and at line 61) \u2014 and nowhere in \u0060freeze\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/frozen.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"43993537bda3847e4343630023a1994855504f05d978da96076e6454ed98a9ab"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060thaw\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 68 (\u0060thaw\u0060) with a piece of \u0060value\u0060 (and at line 70) \u2014 and nowhere in \u0060thaw\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060thaw\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/frozen.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f46726b7814b0f08796e14201169aae1434d63303f0d07ee25bc16a75a0255"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060type_str\u0060 is public and takes \u0060field_schema: Any\u0060 from its caller, and it calls itself at line 311 (\u0060type_str\u0060) with a piece of \u0060field_schema\u0060 (and at line 332, line 347, line 350) \u2014 and nowhere in \u0060type_str\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060type_str\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc7f8a344a0fe7ba66bb900c4bc33ccfd26c5b6517ad408ab26850d89aa72df"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060unit_of\u0060 is public, takes a document from its caller (line 357) and hands it to \u0060collect\u0060, which calls itself at line 368 (\u0060collect\u0060) with a piece of \u0060node\u0060 (and at line 375) \u2014 and nowhere in \u0060collect\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060collect\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/introspect.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74861afc9c083b9c6ff807976d411ec7f4fa11209a5807a1d671fb99d5d7361"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060location_free\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 497 (\u0060location_free\u0060) with a piece of \u0060value\u0060 (and at line 499) \u2014 and nowhere in \u0060location_free\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060location_free\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/utils.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d27492a1ebcd36f30f19363049fed4496b8ea39568004805e3950440962b98"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060json_key\u0060 is public and takes \u0060key: Any\u0060 from its caller, and it calls itself at line 621 (\u0060json_key\u0060) with a piece of \u0060key\u0060 \u2014 and nowhere in \u0060json_key\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060json_key\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/utils.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"6000c01aada722293d3f50b23cdcd6ba214a59539d6f49e660957ad15314d8c2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060with_json_keys\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 654 (\u0060with_json_keys\u0060) with a piece of \u0060value\u0060 (and at line 657) \u2014 and nowhere in \u0060with_json_keys\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060with_json_keys\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/utils.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebd5fe1dd9d75b359260e698a3e1ed9b11f3681ff8ec09df53e62d00d8d555a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060try_convert_to_primitives\u0060 is public and takes \u0060s: Any\u0060 from its caller, and it calls itself at line 817 (\u0060try_convert_to_primitives\u0060) with a piece of \u0060s\u0060 \u2014 and nowhere in \u0060try_convert_to_primitives\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060try_convert_to_primitives\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/utils.py"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f414d810d10fd5535d16b9f0b5992485ce8102ac7060a155d602dbca5a52d6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_hierarchy\u0060 is public, takes a document from its caller (line 836) and hands it to \u0060_set_hierarchy\u0060, which calls itself at line 897 (\u0060_set_hierarchy\u0060) with a piece of \u0060dct\u0060 (and at line 907) \u2014 and nowhere in \u0060_set_hierarchy\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_set_hierarchy\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/utils.py"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f01a22a56496fe150ceef6558b8db34ace11a8d5b27692ae4ea308980b766c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060semantic_hash\u0060 is public, takes a document from its caller (line 1545) and hands it to \u0060_sorted_dict_str\u0060, which calls itself at line 1548 (\u0060_sorted_dict_str\u0060) with a piece of \u0060data\u0060 (and at line 1550) \u2014 and nowhere in \u0060_sorted_dict_str\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_sorted_dict_str\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/utils.py"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c378c6b9be1d8f8ad85869d1ddcd72b3500676b663923a29d787f0fb5d1be2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060translate_paths\u0060 is public and takes \u0060document: Any\u0060 from its caller, and it calls itself at line 364 (\u0060translate_paths\u0060) with a piece of \u0060document\u0060 (and at line 366) \u2014 and nowhere in \u0060translate_paths\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060translate_paths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/fetch.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"94626241fda7f8c5736ac06cfa12ff8ad2a328850d8efcd0c97f31116ee25f8f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060flatten_leaves\u0060 is public, takes a document from its caller (line 478) and hands it to \u0060walk\u0060, which calls itself at line 490 (\u0060walk\u0060) with a piece of \u0060table\u0060 \u2014 and nowhere in \u0060walk\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/model.py"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fde7a091e44c1f8c66bceb27ff33926f38ccb6993e2d4be3f598c2c7cc9275"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_micrometers\u0060 is public and takes \u0060length: Any\u0060 from its caller, and it calls itself at line 208 (\u0060to_micrometers\u0060) with a piece of \u0060length\u0060 \u2014 and nowhere in \u0060to_micrometers\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060to_micrometers\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/base.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5f8f9f1adc3165af639d6ad00c5c86797fed8e4e984cf324da7f773f04f99f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060split_bindings\u0060 is public, takes a document from its caller (line 125) and hands it to \u0060_freeze\u0060, which calls itself at line 119 (\u0060_freeze\u0060) with a piece of \u0060value\u0060 (and at line 121) \u2014 and nowhere in \u0060_freeze\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/bindings.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"58353862983290c749f4166694a1cfbaedc4bc9d739c5e1e80b9724e2fc5439c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060anchored_sections\u0060 is public, takes a document from its caller (line 96) and hands it to \u0060_members\u0060, which calls itself at line 38 (\u0060_members\u0060) with a piece of \u0060annotation\u0060 \u2014 and nowhere in \u0060_members\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_members\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/layer_paths.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"44540b2508046a76562f8cb595efa09d6baca3a8c2b426543b5ed669b7eeb873"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060anchored_sections\u0060 is public, takes a document from its caller (line 96) and hands it to \u0060_anchor\u0060, which calls itself at line 62 (\u0060_anchor\u0060) with a piece of \u0060annotation\u0060 (and at line 70) \u2014 and nowhere in \u0060_anchor\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_anchor\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/layer_paths.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"19853a7e82048a64214dc4a7405f3eac09cd699db0be0bbf45bade632168effd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060resolve\u0060 is public, takes a document from its caller (line 1059) and hands it to \u0060_explicit\u0060, which calls itself at line 362 (\u0060_explicit\u0060) with a piece of \u0060value\u0060 (and at line 368, line 376, line 378) \u2014 and nowhere in \u0060_explicit\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_explicit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/resolver.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fbb6f4d7f39fab607d41cb474fe2d21dfebbd725b2f2ae9028608b926655f1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060settings_difference\u0060 is public, takes a document from its caller (line 534) and hands it to \u0060_flatten\u0060, which calls itself at line 529 (\u0060_flatten\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060_flatten\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_flatten\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"061f2a2223b6a16fa38203ff2cbdc9702d33f9efe7b293628a4e41e9631d180e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060map_keyed_path_leaves\u0060 is public, takes a document from its caller (line 261) and hands it to \u0060_annotation_matches_value\u0060, which calls itself at line 194 (\u0060_annotation_matches_value\u0060) with a piece of \u0060annotation\u0060 (and at line 196, line 213, line 215) \u2014 and nowhere in \u0060_annotation_matches_value\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_annotation_matches_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"3616ce518f8596509861bbf72202647b21b436bedf3f099c348fc41096e5ea27"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060map_keyed_path_leaves\u0060 is public and takes \u0060annotation: Any\u0060 from its caller, and it calls itself at line 272 (\u0060map_keyed_path_leaves\u0060) with a piece of \u0060annotation\u0060 (and at line 280, line 285, line 295, line 302, line 303) \u2014 and nowhere in \u0060map_keyed_path_leaves\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060map_keyed_path_leaves\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/flow.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fbccc03049f3a75f064de7658ddce234259dce73f4d04acc448a3e401cb894"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060non_finite_in\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 118 (\u0060non_finite_in\u0060) with a piece of \u0060value\u0060 (and at line 123) \u2014 and nowhere in \u0060non_finite_in\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060non_finite_in\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow/metrics.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"683cb46d129cffb52f7d1df7b61e143b7ca662614a5839b2c6902c0b8d79ee35"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 569 is called with an argument built by \u0060\u0022\u2026\u0022.join(sorted(environ))\u0060 (line 569), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cocotb.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"966a9a6e8065328ff30bf686aef18f7d0e484d781cdadb84af47e8dbd1e3d7ea"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 759 is called with an argument built by \u0060\u0022\u2026\u0022.join(args)\u0060 (line 759), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openfpgaloader.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"681c4941871f75b89878dfa11ef79c1bd4354d6b02a683eedc66733d06b83adb"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 1123 is called with an argument built by \u0060\u0022\u2026\u0022.join(str(s) for s in xdc_files)\u0060 (line 1123), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_synth.py"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32181376fe100183fd492d965614d2dc2c94bb267bc4c242a94c2827d72c42b"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 1124 is called with an argument built by \u0060\u0022\u2026\u0022.join(str(s) for s in tcl_files)\u0060 (line 1124), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vivado/vivado_synth.py"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b10dc32fdceb638003a10a4b9da862c6bd824c7bf8a6171e2c579afd7316289"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 81 is called with an argument built by \u0060\u0022\u2026\u0022.join(splitted[: i])\u0060 (line 81), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/dc/__init__.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2f23534ce0358e43c5bbfc75fc98634d1bbaa14aee911ad3f41286de0afa46"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 567 is called with an argument built by \u0060\u0022\u2026\u0022.join(sorted(clocks))\u0060 (line 571), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/dc/__init__.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"a410ac363426e614cd2c584742e794ddbf9f7719896a9ae3b45a360a8a6cc581"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 118 is called with an argument built by \u0060\u0022\u2026\u0022.join(sorted(late))\u0060 (line 118), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_locks.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4d3d19ea539e28b7c81c8e7aeec1d70c857eab11a79c0ce4bdadf5a4f05290"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 983 is called with an argument built by \u0060{ k : optimizer.best.results.get(k) for k in results_sub }\u0060 (line 985), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 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 \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/dse_runner.py"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"538f1acdbbbab7d46795d90bb83a3e0decae605b646337189362a1e2f71ad72e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli_settings_completion.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b6a55953f5b1adca3072defe2263f5a180bd106ea839e1abed456dac20b376"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/outcomes.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeea82ae27da839af6fab51bfdab2913c2ebd551edc3c83ac8d5f6e394a0cdf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/utils.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08bf5f86f038d745f18c3801861b2ffc87ccb02ee139c9e5e61c527ecdb633f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/remote/agent.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"380167540a9d29b9e8ce7fe3c312d31bc2677c90a04799f55a02bfca14dd0f14"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 2316 is handed an f-string as its message, so the logger receives one finished string \u2014 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: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/design.py"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89ff46914f919c93c11d43ba096a4c172b5d7384199defc9912693425a57084"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 450 is handed an f-string as its message, so the logger receives one finished string \u2014 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: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6480eed4c5578d4c26946569f1382cbee4b87337cdbfd7767ba4ed2f47eca2ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 495 is handed an f-string as its message, so the logger receives one finished string \u2014 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: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/tool.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fdc148c4d583b1c3fd873ed4a3762cd8f324f2c41a0955b534987e7fd48e89"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 553 is handed an f-string as its message, so the logger receives one finished string \u2014 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: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vcs.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b1cf2153762646cfbc6aeb957dbbcf356e89d08458d41987eb4f70bad6fbf0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 564 is handed an f-string as its message, so the logger receives one finished string \u2014 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: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/vcs.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a080bd267da6d4cbdfc79ed07d3045f4142cf0288b31efaf21a0f6acb66b6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 81 is handed an f-string as its message, so the logger receives one finished string \u2014 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: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/dc/__init__.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cccaa7957a45ce73cfb4f6315d0eb2cd9f250a03ea19078dfa585927596780"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 981 is handed an f-string as its message, so the logger receives one finished string \u2014 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: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/dse/dse_runner.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"2610fcd4f1b23f7e0d007833f1ef770711a477c6cfbe29820a891189fb3d547c"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flows/openroad/final.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"886b277bfbb990e0c1ecc2fcdf7bb1b2889e623f45e5008fc2ce42e21bb5dfb1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_request_table\u0060 returns \u0060{}\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/cli.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb40eba8d0ead29c76ba6ce45bd58bf9ce8690411a7284dbab877ea7a0ce5d9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_imported_modules\u0060 returns \u0060set()\u0060 when \u0060(OSError, SyntaxError, ValueError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/code_epoch.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbde9014a967d982e2269dbac7bb5c85db3e9a1353469d3001302201dc8c086"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060misplaced_hint\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(ValidationError, ValueError, OSError, GenerationError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/launch_generation.py"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15467812ec2fe732448ab03a766c2067aaf8772b34f1334490f013d394d9306"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_changed_settings\u0060 returns \u0060\u0027(the previous settings were not recorded)\u0027\u0060 when \u0060(OSError, ValueError, KeyError, TypeError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/flow_runner/trace.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"b755ceb351c5f0cdc2b5f627959543b78c187dc2c6c07b7dd0aba5a0c6121049"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_nodeinfo\u0060 returns \u0060[]\u0060 when \u0060(ValueError, AttributeError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/platforms/providers.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c00e1bf2616043da9c083c1610524eaff1ccaa52fc1ae0935f89fce97163327"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_source_digest\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xeda/_internal/records.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4d8660f6ed55d30d51d8c6907b1f593f1b8068214523eaf97d46a3f56c018a"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-116","guid":"c0134ca8-adc7-6959-bd17-5253a265d101","name":"Improper Encoding or Escaping of Output","shortDescription":{"text":"Improper Encoding or Escaping of Output"},"helpUri":"https://cwe.mitre.org/data/definitions/116.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":59,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}