{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"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":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"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":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"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":"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"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":"Processor.walk (cyclomatic 244): Processor.walk has cyclomatic complexity 244 (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":"preprocess/preprocess.go"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2774a92690299933385ff12a8723195254633d33958ee33606b6e72b187a9a5b"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker.typecheck (cyclomatic 106): Checker.typecheck has cyclomatic complexity 106 (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":"types/types.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"810409b003672e12ce4e2a3a80be2b0936589dd60ad0f23cdfe7911429478932"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker.inferFunction (cyclomatic 88): Checker.inferFunction has cyclomatic complexity 88 (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":"types/types.go"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e896b4f2fe3a8538732c814c873069d32df8188144040f66d03de90aebae5ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Logger.renderSteps (cyclomatic 71): Logger.renderSteps has cyclomatic complexity 71 (threshold 15). Of this number, 59 points are the body\u0027s own statements and 12 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/scenario/log.go"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b45b71ae3dd33bc6a65d1bf44d9deacafefb6f6077dae82a25829623f17787"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.Update (cyclomatic 57): Model.Update has cyclomatic complexity 57 (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":"tui/model.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bf8ce8b911810c85dbe875acd3d81f8ca0efe4828733e15de81e2e8ace1edd"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker.infer (cyclomatic 55): Checker.infer has cyclomatic complexity 55 (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":"types/types.go"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94fd4e6e4e009b2865bc632c0134858160c0eecabedcda0c738a90515430fa1"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.compileInfix (cyclomatic 54): Compiler.compileInfix has cyclomatic complexity 54 (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":"llvm/compiler.go"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4b9056f3818af28e7e085cda74728d062edee2897407eb6a8d16bef03ee4fc"}},{"ruleId":"D1","level":"warning","message":{"text":"LLBlock.parseStore (cyclomatic 51): LLBlock.parseStore has cyclomatic complexity 51 (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":"generator/unroll/instructions.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"198aed0521ea799b99c205d28768ca39e8c0b716896bb36a02ddb2ba1fa3ee3d"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.processSpec (cyclomatic 46): Compiler.processSpec 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":"llvm/compiler.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bfd1d14a9ffaa4ad973838d8ccff2c627e82c7f3736319aa17d327cd8cea25"}},{"ruleId":"D1","level":"warning","message":{"text":"Precompiler.walk (cyclomatic 46): Precompiler.walk has cyclomatic complexity 46 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function taking that case\u0027s concrete type, so the dispatch reads one line per case. These arms are selected by TYPE rather than by value, so there is no key a lookup table could be built on; where you own the matched types, giving them one shared interface method and calling that is the form a table would have taken, and where you do not, keep the cases \u2014 they stay explicit and reviewable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"swaps/swaps.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ab17d51efda7565e015d554ab50f79bc5efc32fb372083b37cddde8ac5c62d"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.convertAssertVariables (cyclomatic 33): Compiler.convertAssertVariables has cyclomatic complexity 33 (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":"llvm/compiler.go"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b306864fecbd2772db7768eb04a69384ef575172daac3c2ad213278c52203f"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runTraditionalMode (cyclomatic 32): main.runTraditionalMode has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"main.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f2ce5b7b011630b31fd5e9d5f16581613e9baabbc560762f609d3ee86431b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.Run (cyclomatic 32): Runner.Run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runner/runner.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd107a8bf400d11a1f332eece003753643d5dce15d114154b65296d419f2e44f"}},{"ruleId":"D1","level":"warning","message":{"text":"execute.evalNumericExpr (cyclomatic 28): execute.evalNumericExpr 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":"execute/violations.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efedab686dba89c6b636e5d2fec041942c6ee1060e8e1c4a2250aa135d70087"}},{"ruleId":"D1","level":"warning","message":{"text":"Logger.Kill (cyclomatic 28): Logger.Kill 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":"generator/scenario/log.go"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6324bcc03e94ad2ec86d4a0238cf73ae295d769927127826e626deaeb6088ea"}},{"ruleId":"D1","level":"warning","message":{"text":"Tracer.walk (cyclomatic 28): Tracer.walk 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":"reachability/reachability.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1580bb3a92c188faeb27961ceeec169778c09084ed2271326fcccddfcc95b8b"}},{"ruleId":"D1","level":"warning","message":{"text":"Unpacker.unpackWhenThen (cyclomatic 26): Unpacker.unpackWhenThen has cyclomatic complexity 26 (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":"generator/unpack/unpack.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"744f4b920639e4e39f3e1d3c92d486df48b429ffd25550bb7b0c73208650eff1"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.ProcessUnfuncs (cyclomatic 25): Generator.ProcessUnfuncs 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":"generator/generator.go"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9d0555027037ae2b798620c39eff0dbda468d0ababb7fdd4b31c13cda51052"}},{"ruleId":"D1","level":"warning","message":{"text":"Unpacker.unpackIte (cyclomatic 23): Unpacker.unpackIte 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":"generator/unpack/unpack.go"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"181865c0338091fdd07558a3915adf5c2583f160bbeb910a5fa5edcb8e446cd7"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.compile (cyclomatic 23): Compiler.compile has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function taking that case\u0027s concrete type, so the dispatch reads one line per case. These arms are selected by TYPE rather than by value, so there is no key a lookup table could be built on; where you own the matched types, giving them one shared interface method and calling that is the form a table would have taken, and where you do not, keep the cases \u2014 they stay explicit and reviewable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dc1d2343e6c327e38550f9ae0d4414d39a71560ec29bc2fe152f4d693377e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint.parseWhenThen (cyclomatic 22): Constraint.parseWhenThen 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":"generator/asserts/asserts.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"819b3d5dcd52c8806f2e5e3ad88a7bc5f6636093d3e5183ef204b08e8c53d3a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint.Package (cyclomatic 22): Constraint.Package 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":"generator/asserts/asserts.go"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb8f30efa239f5aad322798c819cc6ff3b3049b3f3cd0ba9387ec8f45e4fcc9"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultsModel.formatAnnotations (cyclomatic 22): ResultsModel.formatAnnotations has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/results.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee69cde4eb64b8be12fd61b8b67149cfb3b2ca33d52dda15fcee05094e5e4d5"}},{"ruleId":"D1","level":"warning","message":{"text":"execute.evalBoolExpr (cyclomatic 21): execute.evalBoolExpr 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":"execute/violations.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ade411632df5901e86eb484adc4c3b5ad64759df1a8031ba54456b1b6050e15"}},{"ruleId":"D1","level":"warning","message":{"text":"FaultListener.ExitSolvable (cyclomatic 21): FaultListener.ExitSolvable 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":"listener/listener_exit.go"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8930249d9a10b46c8918fdcfa0426557f22a099bd939b61445c10eee0cbbc395"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.processFunc (cyclomatic 21): Compiler.processFunc 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. This is NOT this file\u0027s highest cyclomatic complexity: Compiler.compileValue (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"b118162e6e1100eb102c4def35a1e4bb979380bf079b6c8b8526e96be21a2293"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.processStruct (cyclomatic 21): Compiler.processStruct 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. This is NOT this file\u0027s highest cyclomatic complexity: Compiler.compileValue (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceccc7b7645ffa428d0d12e78e6a984333553cf5dc482a64ff93d04b6536638"}},{"ruleId":"D1","level":"warning","message":{"text":"LLBlock.constantRule (cyclomatic 20): LLBlock.constantRule 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":"generator/unroll/unroll.go"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd425876cdbcf4f2b763ea690cf601ebf88f0ded86341157ecc359b31f4f67"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint.parseSSAIterated (cyclomatic 19): Constraint.parseSSAIterated 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":"generator/asserts/asserts.go"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c38c37f6d3607a6d856f72c9d96efe5fc08ada60c2b1c2ae7739b878c4f1ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.annotCondToSMT (cyclomatic 19): generator.annotCondToSMT has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/generator.go"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"c150e8d874c5c1f46c91fa741fb740de6dcb5960bc449c761e49b7102a5a800f"}},{"ruleId":"D1","level":"warning","message":{"text":"FaultListener.ExitAnnotationDecl (cyclomatic 19): FaultListener.ExitAnnotationDecl 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":"listener/listener_exit.go"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"781f009501b68a4632e59862aa480a4e30f9eeff8a1842e7f812af0e1387efb7"}},{"ruleId":"D1","level":"warning","message":{"text":"format.BuildJSON (cyclomatic 18): format.BuildJSON 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":"format/format.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3876fbc52d210f8d6bbe726467b2862c93ca9c89b022cf7426fc250cc4313cca"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint.mergeSameIndex (cyclomatic 18): Constraint.mergeSameIndex 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":"generator/asserts/asserts.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"af928715497a21002c9c200dbb2d6c2d7e8d24a52bd5857082a75a112f907076"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint.applyTemporal (cyclomatic 18): Constraint.applyTemporal 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":"generator/asserts/asserts.go"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c747aec672ab26a7f4f2daf2208602b50c4d0a84e89ab6a10349f0ffd37c248"}},{"ruleId":"D1","level":"warning","message":{"text":"Init.WriteRule (cyclomatic 18): Init.WriteRule 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":"generator/rules/rules.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4708569eac09afcdc8642f4888df98ba429d3e80bdd04752e41ad29ff4f51ea"}},{"ruleId":"D1","level":"warning","message":{"text":"FaultListener.packageCallsAsRunSteps (cyclomatic 18): FaultListener.packageCallsAsRunSteps 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":"listener/listener_exit.go"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea77fd6c39dd59779eed195108aa6b3c8218fcdbb73c8748ee2b8bd13556c006"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint.parseNode (cyclomatic 17): Constraint.parseNode has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function taking that case\u0027s concrete type, so the dispatch reads one line per case. These arms are selected by TYPE rather than by value, so there is no key a lookup table could be built on; where you own the matched types, giving them one shared interface method and calling that is the form a table would have taken, and where you do not, keep the cases \u2014 they stay explicit and reviewable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/asserts/asserts.go"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c0637ae04610521043078a939ce9f481f1da9e74be4807665bfb1b4d827f29"}},{"ruleId":"D1","level":"warning","message":{"text":"unroll.WhenThen (cyclomatic 17): unroll.WhenThen 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":"generator/unroll/unroll.go"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8d11d488cb49848236cb84788dad3355a3489c7bd99c05b7a60895f420f92a"}},{"ruleId":"D1","level":"warning","message":{"text":"LLBlock.scanTemps (cyclomatic 17): LLBlock.scanTemps 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":"generator/unroll/unroll.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"340f62bb016bc09dee5794d239c69a7d801dd0fa883478e88c82ce84945b245c"}},{"ruleId":"D1","level":"warning","message":{"text":"Processor.formatIndex (cyclomatic 17): Processor.formatIndex has cyclomatic complexity 17 (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":"preprocess/preprocess.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"435968f020ef3b2aa690ee2c3619687daf6db26b4ff3036da5c23c7abb0de57f"}},{"ruleId":"D1","level":"warning","message":{"text":"SetupModel.handleEnter (cyclomatic 17): SetupModel.handleEnter has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/setup.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6d521419b155b4416bf6fbe0727145d2fd677131ef4d54d90aa85b2366562d"}},{"ruleId":"D1","level":"warning","message":{"text":"types.typeAdju (cyclomatic 17): types.typeAdju 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. This is NOT this file\u0027s highest cyclomatic complexity: types.typeable (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"db20a95aa9809042ee5a175bcfc9348c1c0fc71cd666897bdf395dc252037b61"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker.lookupReference (cyclomatic 17): Checker.lookupReference 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. This is NOT this file\u0027s highest cyclomatic complexity: types.typeable (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9307a3526b75cf437309536c3d4fba3d049815634152ae7e82e201d98b0cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"SMTListener.ExitFunction_def (cyclomatic 16): SMTListener.ExitFunction_def 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":"execute/responses.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3be8b4a2a344f226dc253e626d98cdf04b3b25d29ba0f4ffdbb3d241431fcd"}},{"ruleId":"D1","level":"warning","message":{"text":"FileBrowserModel.Update (cyclomatic 16): FileBrowserModel.Update 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":"tui/filebrowser.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f9e8c24a7b9134d0a4b925c0aab7fc2a4c0a1fd71ca4daf091a6fd1a5d2105"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker.LookupType (cyclomatic 16): Checker.LookupType 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. This is NOT this file\u0027s highest cyclomatic complexity: types.typeable (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"3951eb27ba05e1dd0fd901949e7ab5898cecf2347b0dbf6aef797bdde29da11b"}},{"ruleId":"D2","level":"warning","message":{"text":"Processor.walk (cognitive 618): Processor.walk has cognitive complexity 618 (threshold 15). Drivers by points: if/else 181 (499 pts), loops 25 (79 pts), match/switch 9 (26 pts), boolean chains 14 (nesting depth added 389). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/preprocess.go"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"abadcb7ced576d01db3cb47716478f24e6225a1d9c5ae4566e9010e1991bce32"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker.typecheck (cognitive 176): Checker.typecheck has cognitive complexity 176 (threshold 15). Drivers by points: if/else 47 (136 pts), loops 13 (31 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 111). To reduce it, split the body into named stages: move each independent 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":"types/types.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffc184b776ab9771db6e50224e113192ac727c172e49086ed4154a1781d4ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"Logger.renderSteps (cognitive 168): Logger.renderSteps has cognitive complexity 168 (threshold 15). Drivers by points: if/else 53 (134 pts), loops 8 (21 pts), boolean chains 9, match/switch 2 (4 pts) (nesting depth added 96). Of this number, 154 points are the body\u0027s own statements and 14 belong to 4 function literals inside it that branch. 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":"generator/scenario/log.go"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce53a82990d4a6168b01ff0f26daa5322bb80743c43c7e820f9a36c0548283e"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker.inferFunction (cognitive 154): Checker.inferFunction has cognitive complexity 154 (threshold 15). Drivers by points: if/else 54 (118 pts), loops 5 (16 pts), boolean chains 12, match/switch 3 (8 pts) (nesting depth added 80). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac897f801dd5391254e134c1679e4a71457d1071054aa8ec83349a842379ae4"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.processSpec (cognitive 116): Compiler.processSpec has cognitive complexity 116 (threshold 15). Drivers by points: if/else 21 (73 pts), match/switch 6 (22 pts), loops 8 (19 pts), boolean chains 2 (nesting depth added 79). To reduce it, split the body into named stages: move each independent 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":"llvm/compiler.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea016fad739a46ed0a8ed217f48f7d185cd1dd27b2f375d18928e288c6b5bd6e"}},{"ruleId":"D2","level":"warning","message":{"text":"LLBlock.parseStore (cognitive 114): LLBlock.parseStore has cognitive complexity 114 (threshold 15). Drivers by points: if/else 39 (98 pts), boolean chains 9, match/switch 2 (5 pts), loops 1 (2 pts) (nesting depth added 63). 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":"generator/unroll/instructions.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6f53e7898b9410ea1ff6c0a71a1aadce436fedb796e6dd983866cf236718c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.compileInfix (cognitive 83): Compiler.compileInfix has cognitive complexity 83 (threshold 15). Drivers by points: if/else 35 (73 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 41). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caf197d80dabf19aa625ba366c764b9f33779901e8467af518a30f916ab8380"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.processFunc (cognitive 81): Compiler.processFunc has cognitive complexity 81 (threshold 15). Drivers by points: if/else 19 (67 pts), loops 2 (7 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 56). 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":"llvm/compiler.go"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"862d6f77a9b8d456218fcf5f03ca7d6fc703c0fccddeaee156f2b741fc5e2074"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.Update (cognitive 73): Model.Update has cognitive complexity 73 (threshold 15). Drivers by points: if/else 23 (57 pts), match/switch 7 (16 pts) (nesting depth added 43). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/model.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcd975d773532132e586978c843ec5b05542b3c47b2cd585a92d2d6369437a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.ProcessUnfuncs (cognitive 71): Generator.ProcessUnfuncs has cognitive complexity 71 (threshold 15). Drivers by points: if/else 13 (43 pts), loops 8 (15 pts), match/switch 3 (13 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":"generator/generator.go"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a52bb8b9181fa336912238ee5fe7cf7efa0a2aaaaca7872e7f1326dbb65455a"}},{"ruleId":"D2","level":"warning","message":{"text":"Logger.Kill (cognitive 67): Logger.Kill has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (51 pts), loops 5 (9 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent 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":"generator/scenario/log.go"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6224bc3fd1cd7488792e79495379784fd9287e4664ca4b465e9d1011879a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker.infer (cognitive 64): Checker.infer has cognitive complexity 64 (threshold 15). Drivers by points: if/else 26 (57 pts), match/switch 3 (7 pts) (nesting depth added 35). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbdc174eef4c09252db569ae52b68652ad7759da3189d7e1ad89c91ef9e6fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"unroll.WhenThen (cognitive 63): unroll.WhenThen has cognitive complexity 63 (threshold 15). Drivers by points: if/else 8 (35 pts), loops 8 (28 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":"generator/unroll/unroll.go"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4687310b3f19dccdb48b262cb0dffc48f43baff1cb578ff63cd8a68ddd40775"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.Run (cognitive 60): Runner.Run has cognitive complexity 60 (threshold 15). Drivers by points: if/else 28 (58 pts), boolean chains 1, match/switch 1 (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":"runner/runner.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcfe683f2b3e7181d99d4482c1dda3999657c2acab4ff575af4b0f004777ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.Package (cognitive 56): Constraint.Package has cognitive complexity 56 (threshold 15). Drivers by points: if/else 22 (53 pts), boolean chains 2, loops 1 (nesting depth added 31). 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":"generator/asserts/asserts.go"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd910b12386591f86e9ebd4a3647b71857767af7aea6db4789d54403c525eec"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker.complexInstances (cognitive 50): Checker.complexInstances has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (49 pts), loops 1 (nesting depth added 37). 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":"types/types.go"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1300b068a18c6ef375f25256e531c15c47525ee9767297934658fc5290b9768"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.parseSSAIterated (cognitive 47): Constraint.parseSSAIterated has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 5 (11 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":"generator/asserts/asserts.go"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68e7f58a3b28f97b080043aa204a6cae69a222e522a0b81734dc0fe235a903c"}},{"ruleId":"D2","level":"warning","message":{"text":"Unpacker.buildPhisOrs (cognitive 43): Unpacker.buildPhisOrs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 5 (11 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unpack/unpack.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c5f305d94f7ec26f706487a6c037bd64870e6e5766e9371b6d9ad599d86f85"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracer.walk (cognitive 42): Tracer.walk has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 6 (12 pts), match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reachability/reachability.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22bf0883e7cf7822907ec598b85f63cd9273cdc5dff87c19a71a58a51f1fee4"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runTraditionalMode (cognitive 38): main.runTraditionalMode has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 6, match/switch 4, loops 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":"main.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9607f00883f6491a502de95545d83b863628db4c7192d999e11aee93713104be"}},{"ruleId":"D2","level":"warning","message":{"text":"execute.evalNumericExpr (cognitive 37): execute.evalNumericExpr has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 4 (8 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"execute/violations.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e86c8ac759fbed9ccf9c33c7d7f8da0a838f91e856916ddc8dec1c9daaef54a"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.mergeSameIndex (cognitive 37): Constraint.mergeSameIndex has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 8 (17 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/asserts/asserts.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"0796bd9a1afb850ca1409c37eaf7293103742f2b4246bfd5b293b3bdfb6e9e04"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.convertAssertVariables (cognitive 37): Compiler.convertAssertVariables has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 2 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"3780cab92b90ee1a4c0337fe75b23757af02451abd06c5a5742c08ff3fc56190"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.applyTemporal (cognitive 35): Constraint.applyTemporal has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (32 pts), match/switch 2 (3 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/asserts/asserts.go"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac910e270448f1b4917195719f9c882b1c6f7c7bd2c7b362e56358307f2e6a93"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.processStruct (cognitive 34): Compiler.processStruct has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 2 (6 pts), loops 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":"llvm/compiler.go"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b694158300976a8e7881d46d611f47456903b5e78ee931218d0a73b5a63a9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Unpacker.unpackIte (cognitive 33): Unpacker.unpackIte has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21 (27 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 9). 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":"generator/unpack/unpack.go"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"6602fd7183d42546c49b4c14aa61e2fd2de5b84c0917737b65aa72c19a1f3401"}},{"ruleId":"D2","level":"warning","message":{"text":"LLBlock.scanTemps (cognitive 33): LLBlock.scanTemps has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (30 pts), match/switch 1 (2 pts), loops 1 (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":"generator/unroll/unroll.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e49d789ff07de9fb31a39590bfebb6138a96228ac925d4760e5a3bcf9b18618"}},{"ruleId":"D2","level":"warning","message":{"text":"FaultListener.ExitAnnotationDecl (cognitive 32): FaultListener.ExitAnnotationDecl has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 3 (7 pts), loops 3 (4 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":"listener/listener_exit.go"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece022da9e57bc67610c789144f9633b00cf81cdb05e4fed0ab7e33aa33c7a25"}},{"ruleId":"D2","level":"warning","message":{"text":"execute.evalBoolExpr (cognitive 31): execute.evalBoolExpr has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 3 (7 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"execute/violations.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"432149b1050f305b6d4058ba1547c79d6e49057620888c895011e75c15d5b9e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultsModel.formatAnnotations (cognitive 31): ResultsModel.formatAnnotations has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (6 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 14). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/results.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932762b4c44dab411cc105a9d34c5f4c4aed09a7c2526effd500caae80c3bd3"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker.lookupReference (cognitive 30): Checker.lookupReference has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 2, match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ff3e685f1a07ef5068a1d0d690edaac93e79c6966b49d876ab93eecc3888e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.FilterRegistry (cognitive 29): Constraint.FilterRegistry has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (8 pts), boolean chains 3 (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":"generator/asserts/asserts.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5f32c3c3553f6b7f30756f42b2e0d1033b0fa4b43dda857ccaff7f0425c305"}},{"ruleId":"D2","level":"warning","message":{"text":"LLBlock.constantRule (cognitive 27): LLBlock.constantRule has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 2, match/switch 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":"generator/unroll/unroll.go"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f40d3bd89ebed5bc414a6027c151f1f3dbb483a7c99f89ec36a472b41498bc"}},{"ruleId":"D2","level":"warning","message":{"text":"FaultListener.ExitSolvable (cognitive 26): FaultListener.ExitSolvable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (7 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4112c6c2e8a0e95ae0e47b6d4b963228c8ec1df3012872107cc53391dbd0f3b9"}},{"ruleId":"D2","level":"warning","message":{"text":"listener.blockToRunSteps (cognitive 26): listener.blockToRunSteps has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (8 pts), match/switch 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":"listener/listener_exit.go"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca0006d3c2b98a832d7f9dbd18931f50567673c96cdcc2dec5d27a67cf385b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.parseNodeSSAN (cognitive 25): Constraint.parseNodeSSAN has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/asserts/asserts.go"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaa6dde5f185400669c097f035e6ad8b42ea10185e59f7455d8c9ac43b770d9"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.inferBoolVarNames (cognitive 25): generator.inferBoolVarNames has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (4 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":"generator/generator.go"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"472a8deace0824815293aad4457b5c0aee1ea78231b4f973f7353a47d8c927d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Unpacker.unpackWhenThen (cognitive 25): Unpacker.unpackWhenThen has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unpack/unpack.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a68619fb6f5da6b1e15ec6cbd35dd2bb200dedc0821bebb75fa155742c3ad3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Unpacker.buildItePhis (cognitive 25): Unpacker.buildItePhis has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (9 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":"generator/unpack/unpack.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f86cb64c4d6053f13054df85366092a3511bbabd85b1cd019c996881ad8dd26"}},{"ruleId":"D2","level":"warning","message":{"text":"format.BuildJSON (cognitive 24): format.BuildJSON has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (5 pts), boolean chains 3, match/switch 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":"format/format.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"574e3c5975abb60a6510dbcc7336a28746bdcb1be52a207a7b9d8ca7fefcaca2"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.parseWhenThen (cognitive 24): Constraint.parseWhenThen has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/asserts/asserts.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd3e5d88c82f681bb175bb0cfb8f0d38c321323c3d98993a54b5877c1a71e56"}},{"ruleId":"D2","level":"warning","message":{"text":"Unpacker.unpackOrs (cognitive 23): Unpacker.unpackOrs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (7 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":"generator/unpack/unpack.go"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb10efd672d661995816134086683b100c6a6d918d9bdfb94488cd43379e751"}},{"ruleId":"D2","level":"warning","message":{"text":"LLBlock.parseCondNode (cognitive 23): LLBlock.parseCondNode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/instructions.go"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5405a0214ff4a63c46ac20c988f5913fe8de69080acc72a68ea2b085dc2acd"}},{"ruleId":"D2","level":"warning","message":{"text":"SMTListener.ExitTerm (cognitive 22): SMTListener.ExitTerm has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (7 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":"execute/responses.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c9cc2af307b678ec005ae4ccb6a6f3ccc0c7076475fd1dc1016682ff6b5157"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.skipCommentsNl (cognitive 22): Runner.skipCommentsNl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), boolean chains 5 (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":"runner/runner.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"486a4dfb3c98f05ba9dd599805ff817ce34f91eb0463caf5d18f2221e35e0dc5"}},{"ruleId":"D2","level":"warning","message":{"text":"FileBrowserModel.Update (cognitive 22): FileBrowserModel.Update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (3 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/filebrowser.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9415b41ff3bbe9d4ab8c0a6c0e64c878b3d802f75204a378b4757413d14bb1e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.round0OrConstantSSA (cognitive 21): Constraint.round0OrConstantSSA has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (6 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":"generator/asserts/asserts.go"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"9425840cefee695af739b1e5d143504257a80506b5f2952d68a5aea0686457f9"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.topoSortAnnotations (cognitive 21): generator.topoSortAnnotations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (8 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":"generator/generator.go"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"481aab98135836f386ef59b7101fe86e55a6384e317a112a00f118cbebe5d9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Logger.Trace (cognitive 21): Logger.Trace has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/scenario/log.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd3f31db4beb644742c27256d1dabd503b841580dac79d1ed1a54ce94f5518c"}},{"ruleId":"D2","level":"warning","message":{"text":"LLBlock.createMultiCondRule (cognitive 21): LLBlock.createMultiCondRule has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (21 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":"generator/unroll/instructions.go"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd55ac547782b36087b3be4dcb354dec1224d8ea5a4c2ad0587ed50499717b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.compileComponent (cognitive 21): Compiler.compileComponent has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (9 pts), match/switch 1 (2 pts) (nesting depth added 12). 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":"llvm/compiler.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"affb13e262cf5f97a93418f3cc1db5d14c94e83da895ec6b23e9be05082b733c"}},{"ruleId":"D2","level":"warning","message":{"text":"util.Filepath (cognitive 21): util.Filepath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"util/util.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0a389adc30f498aeb74c8fbede4d2406a9063bdb9806d5fb6f6bd8d1b06c9f"}},{"ruleId":"D2","level":"warning","message":{"text":"unroll.FindWriteSets (cognitive 20): unroll.FindWriteSets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), boolean chains 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":"generator/unroll/unroll.go"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3561120f28edfc1ad7071ed857d094ac6aa084685ee11f1bf825e960658b76c"}},{"ruleId":"D2","level":"warning","message":{"text":"FaultListener.packageCallsAsRunSteps (cognitive 20): FaultListener.packageCallsAsRunSteps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c94f01fbc806264043b43ee7139d47c6b1524c9c5139b62a9816e08e6580f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.compile (cognitive 20): Compiler.compile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c7c01f8eed7fc67e67c2af4e0b8ed414473da39af706187263542a13c7c441"}},{"ruleId":"D2","level":"warning","message":{"text":"SMTListener.ExitFunction_def (cognitive 19): SMTListener.ExitFunction_def has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1, match/switch 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, 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":"execute/responses.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c245c9b29173d962bea50ec9f7c4948f647a8d8990b40b0f17e27c7f12b6141"}},{"ruleId":"D2","level":"warning","message":{"text":"Precompiler.walk (cognitive 19): Precompiler.walk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"swaps/swaps.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d14ede5848291948a3e7426992b9f15820465fed9f0e3cc18333603f57480b0"}},{"ruleId":"D2","level":"warning","message":{"text":"FaultListener.ExitImportSpec (cognitive 18): FaultListener.ExitImportSpec has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 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":"listener/listener_exit.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c0eed76a2ae5ef56beca24b321316f2d01e577042c87316d1cc3b6630f8f93"}},{"ruleId":"D2","level":"warning","message":{"text":"llvm.negate (cognitive 18): llvm.negate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":2663}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93588d1dbb0a2334c2d3c3d84129d9f5a351d07b669d52d5d4a079cc03c5dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"types.typeAdju (cognitive 18): types.typeAdju has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (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":"types/types.go"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7f92965d00795bdf01591b58b23dc8104c4b7c07bf59ce5279eb19b389f96b"}},{"ruleId":"D2","level":"warning","message":{"text":"execute.annotationViolated (cognitive 17): execute.annotationViolated has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 4). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 95). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"execute/violations.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"49235d2ab9a0042050e9b3c7e93515df5db612a848c9b0e24887afe15bcd6287"}},{"ruleId":"D2","level":"warning","message":{"text":"Unpacker.buildPhis (cognitive 17): Unpacker.buildPhis has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 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":"generator/unpack/unpack.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"420165ce7ea20285fefcda0b67b169eac370fa53d24ac53a17cbd68b836b1249"}},{"ruleId":"D2","level":"warning","message":{"text":"unroll.convertInfixVar (cognitive 17): unroll.convertInfixVar has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (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":"generator/unroll/unroll.go"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"2349f2beafe17d4fbf3788b0e3bcc183768e254382e2cc64ac8312826a41bfcd"}},{"ruleId":"D2","level":"warning","message":{"text":"FaultListener.validate (cognitive 17): FaultListener.validate 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":"listener/listener.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a258009b5b9d3820a4a5b6fb799087717901943bc1bfc3c498d6a6842c5ae6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.generateParameters (cognitive 17): Compiler.generateParameters has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 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":"llvm/compiler.go"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfe62d399da44b3cc47188b0e679a7436b80fb81776365f6943af99651dc84f"}},{"ruleId":"D2","level":"warning","message":{"text":"ast.Evaluate (cognitive 16): ast.Evaluate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 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":"ast/ast_utils.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70358522a5f609b21d72dda35d49b30e7168a807d7f483c2f9366fd16d7efdb"}},{"ruleId":"D2","level":"warning","message":{"text":"execute.evalConstraint (cognitive 16): execute.evalConstraint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"execute/violations.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d1ca9d5489ce91796228cebb0c33e238f4d56e4c92be50105d43beb65827a4"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.annotCondToSMT (cognitive 16): generator.annotCondToSMT has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/generator.go"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15b42969d9563146564c0444dc5e4223a26088865ca53782dc8404afa4983c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Unpacker.unpackSynthSlot (cognitive 16): Unpacker.unpackSynthSlot has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 3 (6 pts) (nesting depth added 7). 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":"generator/unpack/unpack.go"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c17e55f5c99ad31516feb097917b978b4135efec1c45115135a6ad1ea8d59bd"}},{"ruleId":"D2","level":"warning","message":{"text":"unpack.splitAsserts (cognitive 16): unpack.splitAsserts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (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":"generator/unpack/unpack.go"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d44fca651d20eceaee65c65b697b56041a3ea697e68fd30f757ebbcade6527"}},{"ruleId":"D2","level":"warning","message":{"text":"LLBlock.parseChoose (cognitive 16): LLBlock.parseChoose has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 2 (6 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/instructions.go"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcd4c6a81eedc451d562919f548fe9101e8a5c47ce8e70bc78975a5bc65d7a0"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runRender (cognitive 16): main.runRender has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 2 (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":"render.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9912278b4a3fa4944e51743e6c398aa84c5e4941ab47c5a43e0ff4dabddd3ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.assertionRefsActive (cognitive 16): Compiler.assertionRefsActive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c4a03044d009a9169f20bf742ade41891ee43f9850a680f482594764cc22f3"}},{"ruleId":"D2","level":"warning","message":{"text":"SetupModel.updateFileStep (cognitive 16): SetupModel.updateFileStep has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/setup.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"de762f9cf8da3d404b6b72f7c6129e7cda6b8e56d256de957a06da3f4c42ab7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker.checkUnfuncFieldRef (cognitive 16): Checker.checkUnfuncFieldRef has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 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":"types/types.go"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"d038822416c2aa9cb91d2c1d78042ddd807699a7850ce96fe30a33479c388c94"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker.validateEvidenceCondition (cognitive 16): Checker.validateEvidenceCondition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 2 (4 pts) (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"types/types.go"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"0648e18883834cdc9621c3ba668f30d290efeab55bbdf846c6ebf790b40c18f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Processor.walk: MethodTooLong \u2014 walk runs 889 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 789 over it, 8.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/preprocess.go"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9367a0b011bf8f4943976c6c9fe68071ff976323823bb2a3dd0e43ab9bc0a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FaultListener: TooManyMethods \u2014 133 methods, declared across 3 files: listener/listener_exit.go (100), listener/listener_enter.go (25), listener/listener.go (8). The bar is 30 methods; this is 103 over it, 4.43\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27556fb528755f3c879c90c1089eca2045bf162d3f19d7edd7a361b10c2eef3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Compiler: ClassTooLong \u2014 1695 significant lines (blank, comment-only and punctuation-only lines excluded), 76 methods, 71 blocks, lines 106-2790. The bar is 400 significant lines; this is 1295 over it, 4.24\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":"llvm/compiler.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ef7284eb1f91af88159f259172364b49a696486d7af6a95d7250d4da496543"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: llvm/compiler.go: FileTooLong \u2014 1906 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: Compiler (71 blocks, 106-2790). The bar is 500 significant lines; this is 1406 over it, 3.81\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd327a594fd9a97c64d8f5d8f15953df3b845243c4eccb40c9b784b8022009c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: listener/listener_exit.go: FileTooLong \u2014 1807 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: FaultListener (99 blocks, 20-2669). The bar is 500 significant lines; this is 1307 over it, 3.61\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c30cd137d43301d483b4f4d13d816b8395f1eb5ef6213b830dc2092488e1b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Checker.typecheck: MethodTooLong \u2014 typecheck runs 296 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 196 over it, 2.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9069bc188a4e9d5934c338775b8dcfe8843ddffddefb2b8eef740ce1529988ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Checker: ClassTooLong \u2014 1128 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods, 27 blocks, lines 26-1742. The bar is 400 significant lines; this is 728 over it, 2.82\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":"types/types.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"184027b2d89c45b172c04d51dd44c8b55cb07742de206fc02355481a867777df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/ast.go: FileTooLong \u2014 1382 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 882 over it, 2.76\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":"ast/ast.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dfa22a16be935ee4f4597c66cb2a989ea34b37cd93aa118d8cfa2435b550f1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Processor: ClassTooLong \u2014 1086 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods, 18 blocks, lines 25-1693. The bar is 400 significant lines; this is 686 over it, 2.72\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":"preprocess/preprocess.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a8306f36360f2131fc23015549373e32286f5e0c310c97762f8509cae91786"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/types.go: FileTooLong \u2014 1280 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: Checker (27 blocks, 26-1742). The bar is 500 significant lines; this is 780 over it, 2.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e64839facf6f7da34cbb437539387b681e85de0625fc4e2785a877d8204f98f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Compiler: TooManyMethods \u2014 76 methods, declared across 2 files: llvm/compiler.go (70), llvm/alloc.go (6). The bar is 30 methods; this is 46 over it, 2.53\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"052eabcef6e74f843d3f663111c814e9bb2fd146522745936ebf02e3d49799de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: preprocess/preprocess.go: FileTooLong \u2014 1180 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: Processor (18 blocks, 25-1693). The bar is 500 significant lines; this is 680 over it, 2.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/preprocess.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fe42177ba4a11efb0412377cd747f3945cde2cf2eea8e8e1e7dad84b2f5bd9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Checker.inferFunction: MethodTooLong \u2014 inferFunction runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd1df4379d76e939990f0d7ec867385f6dc8e52be3df14361f223c262788b58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.Update: MethodTooLong \u2014 Update runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/model.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dfa5df525b5ddbf2aa452cd21cd72ff24426e7285f4fe4800444275fe7d666"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rules/rules.go: FileTooLong \u2014 950 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 450 over it, 1.90\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":"generator/rules/rules.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2d8528b18fa4a37cb065388b9f611f965d712f82d11a1f252a1b0597d8f89d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Runner.Run: MethodTooLong \u2014 Run runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runner/runner.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebefa032e2a3a2496998165a529efe03b08101d86d77455fe6ff817e7ca898c8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LLBlock: TooManyMethods \u2014 52 methods, declared across 3 files: unroll/instructions.go (31), unroll/unroll.go (19), unroll/variables.go (2). The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/unroll.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5781a1099ce083f0521a7512cd068086c87d598398f4cdeaba9591eca26e4be5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Logger.renderSteps: MethodTooLong \u2014 renderSteps runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/scenario/log.go"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01fa114af374dd952c4dbbcfc1c41593810f93fa56a7a50f3c556738caa906a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compiler.compileInfix: MethodTooLong \u2014 compileInfix runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40f8c76152c81a9e3fe3622fb573e5e1620e44d66a698d69bf32070a8d84cd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generator/generator.go: FileTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 314 over it, 1.63\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":"generator/generator.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"068284f00f278698166c90516006f448091a91a59ddb4694f5256007ce345e40"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Unpacker: ClassTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods, 30 blocks, lines 21-1114. The bar is 400 significant lines; this is 216 over it, 1.54\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":"generator/unpack/unpack.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2b694959bbed64104022e088b85ad3c796dbad1d1a61e92564f7cb408171d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: asserts/asserts.go: FileTooLong \u2014 749 significant lines (blank, comment-only and punctuation-only lines excluded), about 70% of them inside a single declaration: Constraint (23 blocks, 20-1099). The bar is 500 significant lines; this is 249 over it, 1.50\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/asserts/asserts.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c265e14cb35b9cbd34ad7a01478580b34123dc6e3b8eafb4762a76247469b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LLBlock.parseStore: MethodTooLong \u2014 parseStore runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/instructions.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0551348f86382ac6bebaea4ec135f6ac94dc8565605fd88e5948644d087ca166"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unpack/unpack.go: FileTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: Unpacker (30 blocks, 21-1114). The bar is 500 significant lines; this is 197 over it, 1.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unpack/unpack.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7e0d570337018d8bccd6026e37415db121b12a8f47f507b293962d344599fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unroll/unroll.go: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 167 over it, 1.33\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":"generator/unroll/unroll.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4a9ff764bb6c735e77bc9df789641f1d276226d97028a1e71f3fa1968b4f6e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Constraint: ClassTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods, 23 blocks, lines 20-1099. The bar is 400 significant lines; this is 127 over it, 1.32\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":"generator/asserts/asserts.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"02887e2dc205b2d94651b134eefa3b84721daa711ed9c2c70652e9567af2b849"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Checker.infer: MethodTooLong \u2014 infer runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7595ae4e3f9fe905381c321aac0498db20ec2c0e6229a0553e09fe05ef29989"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scenario/log.go: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: Logger (29 blocks, 14-1105). The bar is 500 significant lines; this is 140 over it, 1.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/scenario/log.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dd6509efb22e4dffe43502fe665f6c2f3430fb4d10efd02316b4a5f8b6a5c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unroll/instructions.go: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: LLBlock (31 blocks, 17-957). The bar is 500 significant lines; this is 140 over it, 1.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/instructions.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c5b428edf8db293dd17a44153ca5bfe6126d33b43ee0efb15f6230e86dec6a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compiler.processSpec: MethodTooLong \u2014 processSpec runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"badee1e63bf17936a4454b2a101f54eb573b2cfc6d86a4c478a0f4ecfe6bc8f3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Logger: ClassTooLong \u2014 491 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods, 29 blocks, lines 14-1105. The bar is 400 significant lines; this is 91 over it, 1.23\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":"generator/scenario/log.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"22edba1232266da74676add384679c6471b3852cf5010dc1b09e74fd600df445"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Compiler: TooManyFields \u2014 34 stored fields beside 76 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d3bda0f4b56a2cf9f2ac3c1d04a6cca1e2a0bd783963616765e23ff4667993"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tui.CategorizeError: FunctionTooLong \u2014 CategorizeError runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/errors.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"507b85cc5d02ca97578a3f4b7f7fdc6d57e9dc0193d39a6dd9057578ff26f4fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Precompiler.walk: MethodTooLong \u2014 walk runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"swaps/swaps.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"15706b942b0e60acbfbf5c9ea87ec5d8d858c02291b8ad33458dc21a52a7e9e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): execute/violations.go:179-214 | execute/violations.go:217-267 \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":"execute/violations.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"49be44d84c075a51579b43910295efe5704107432598aae1341fa5c2270bea3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): listener/listener_exit.go:302-313 | listener/listener_exit.go:315-326 | listener/listener_exit.go:328-341 | listener/listener_exit.go:343-367 | listener/listener_exit.go:396-411 | listener/listener_exit.go:426-439 | listener/listener_exit.go:642-657 | listener/listener_exit.go:659-672 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9759912a93fcc3c5373bb2b415d815e6dae7395dcea45baa6ab54ed2f68d30"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): listener/listener_exit.go:1112-1126 | listener/listener_exit.go:1128-1142 | listener/listener_exit.go:1144-1158 | listener/listener_exit.go:1160-1174 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e60cf61a5236167ec2b2735ab77f515ff48c9e26dc5e253a3af40cc2190f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (86 corresponding lines): generator/unpack/unpack.go:621-706 | generator/unpack/unpack.go:712-805 \u2014 These two members are one piece of code written twice and then edited apart: 86 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":"generator/unpack/unpack.go"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e23d21f22ed31316046c2b55aa6b56c8a4c35626b7347badb1b2f3cc339bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): listener/listener_exit.go:1833-1914 | listener/listener_exit.go:1916-1986 \u2014 These two members are one piece of code written twice and then edited apart: 71 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":"listener/listener_exit.go"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4da6fea073dab5c6314b5627e48a11f5c2367d3907817d0d5e222efe730b963"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): listener/listener_exit.go:930-968 | listener/listener_exit.go:970-1002 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"listener/listener_exit.go"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81dbf675657d11cfe8f31b21805374decf1d66237d44b9e9987ddf318305e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): listener/listener_exit.go:566-596 | listener/listener_exit.go:599-640 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"listener/listener_exit.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f5f5eaa402cb5091f6ef364416f4d2ea6a712fe2e4d7f9370cbb1234902c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): generator/unroll/unroll.go:167-183 | generator/unroll/unroll.go:379-394 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"generator/unroll/unroll.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9931918e7b97699e24d94419d97d5b81c637acc81a524e886db652143ab4da78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): tui/theme.go:28-43 | tui/theme.go:46-62 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"tui/theme.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e51ce95db6cd09a9fadb9d8392bd0f3e146a25166cd0ad3c39af9b91a8746d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lint.go:15-41 | render.go:14-44 \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":"lint.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd8bc60601018b4cf13fb3ff7a1a8a2d4a3187c6c9db09e2e8d26b586db77d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): generator/unroll/instructions.go:722-735 | generator/unroll/instructions.go:807-821 \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":"generator/unroll/instructions.go"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce65bf8b1aee2abf191cca578ec8b5fe1de3b529c8674522d88c125cb9e4942"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): generator/rules/rules.go:381-398 | generator/rules/rules.go:474-487 \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":"generator/rules/rules.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f577f91e783c7f8d9efe93e32b0736c16d4f135b22be117ce5a07dc15fa99e57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): listener/listener_exit.go:31-46 | listener/listener_exit.go:2119-2135 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"listener/listener_exit.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2247732443e7ffc6f074992dc288db5b6dbd7c8f9c90e74d35cde203601899d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): llvm/compiler.go:2316-2340 | llvm/compiler.go:2342-2360 \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":"llvm/compiler.go"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c5fc2394dc6164eb62041d19b90a0050f2410e60cfee76eb161afcb7734e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): generator/unroll/instructions.go:386-395 | generator/unroll/instructions.go:397-406 \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":"generator/unroll/instructions.go"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e1432f006a7878e2ecdb21d7073663a4f07a734f6f7e192bce962b4a0865de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): generator/asserts/asserts.go:729-750 | util/util.go:346-364 \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":"generator/asserts/asserts.go"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8666583d640ca7d58d9a4969ce31bb05d7f3e850b4abd476eb055f8991b480d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): listener/listener_exit.go:1495-1507 | listener/listener_exit.go:1543-1555 | listener/listener_exit.go:1628-1640 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"listener/listener_exit.go"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"1664226fffe982131f083076fbbfe3dbd27e84b1f4d87aef3fd65ef485d9466f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): listener/listener_exit.go:512-523 | listener/listener_exit.go:525-536 | listener/listener_exit.go:1809-1819 | listener/listener_exit.go:1821-1831 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 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":"listener/listener_exit.go"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa40f3d156ef3e7c9ea9e69291f8b920f5b8184f5041b839e68f8fa713d86e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): generator/unroll/unroll.go:149-164 | generator/unroll/unroll.go:361-376 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"generator/unroll/unroll.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"954a317d25443dd545b760b9825ee3edabb470ce90e64e636f2fecbb9a72d05c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): ast/ast.go:1534-1548 | ast/ast.go:1580-1593 \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":"ast/ast.go"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1957efbd54f7f994baa6b7d40a6572e1c36aae6475a68cd81425e2b24f8f43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): generator/generator.go:318-335 | generator/generator.go:1339-1354 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"generator/generator.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8783c91133f72b66d2e0a45003af3c96b2839538576aa90d144e479dcbe800"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ast/ast.go:325-339 | ast/ast.go:409-419 \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":"ast/ast.go"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ca353f086ae481af2f7dc094c9cb8629ceba5d0394f4610fd0805ec6d8e0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): generator/unroll/unroll.go:213-241 | generator/unroll/unroll.go:426-453 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/unroll.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d81df5db075ed62164b7e10880d4719c84a4200b9fc3417d39d4f1c5636bbd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): preprocess/preprocess.go:1140-1164 | preprocess/preprocess.go:1215-1240 \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 \u0060preprocess/preprocess.go:1140\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, \u0060preprocess/preprocess.go:1213\u0060 calls \u0060buildIdContext\u0060, \u0060Id\u0060 and \u0060preprocess/preprocess.go:1138\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":"preprocess/preprocess.go"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bf3f688fd40650bd0a2b0836ecb450e026e3f345eed4f227b74ebd572e8b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201325 lines \u00D7 3): preprocess/preprocess.go:592-616 | preprocess/preprocess.go:644-668 | preprocess/preprocess.go:695-704 \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 \u0060preprocess/preprocess.go:592\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 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":"preprocess/preprocess.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"081b776c11e984876aa3e470ee29339115229445c927ff5f500391d39abebdee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): generator/unpack/unpack.go:641-664 | generator/unpack/unpack.go:747-770 \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 \u0060generator/unpack/unpack.go:641\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 before the matched lines, \u0060generator/unpack/unpack.go:746\u0060 calls \u0060InspectRule\u0060 and \u0060generator/unpack/unpack.go:640\u0060 does not \u2014 after which the two agree again for 3 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":"generator/unpack/unpack.go"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec468ea00dc4cd2da0d9b66cff0603cd8a36a430e0d6b99625c9f73ffb2bb20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): listener/listener_exit.go:1861-1884 | listener/listener_exit.go:1941-1964 \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 \u0060listener/listener_exit.go:1861\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":"listener/listener_exit.go"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b23fe549fd20b47f440671716ad488233799ef32a4df294adc3d70891f53edf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): execute/violations.go:192-213 | execute/violations.go:221-242 \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 \u0060execute/violations.go:192\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. 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":"execute/violations.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b165f3ed22f27a0a36813e03a5482f49e2578aa28ad7bc1a7899888694a0b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): preprocess/preprocess.go:1315-1336 | preprocess/preprocess.go:1376-1397 \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 \u0060preprocess/preprocess.go:1315\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, \u0060preprocess/preprocess.go:1375\u0060 calls \u0060buildIdContext\u0060, \u0060Id\u0060 and \u0060preprocess/preprocess.go:1314\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":"preprocess/preprocess.go"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a728bb6663fde70318569dcec0282a94e87f834787eee35e7eff3a92482b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): types/types.go:873-894 | types/types.go:951-972 \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":"types/types.go"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"297041acb2bf7030b8a06c467f1c0adc021e4e56691e73c1f3fab9e9344a6a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): listener/listener_exit.go:1839-1858 | listener/listener_exit.go:1921-1940 \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 \u0060listener/listener_exit.go:1839\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"416d4b016967c66e2b1758ceaa1e06469aa65ffd64f0e7fec4ec0cdf37b8dcdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): llvm/compiler.go:288-312 | llvm/compiler.go:466-490 \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 \u0060llvm/compiler.go:288\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":"llvm/compiler.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebc7bd167e4f3a58d977077893ff396e8a4691d48087f260d0de6815445d1bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): generator/asserts/asserts.go:733-750 | util/util.go:347-364 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/asserts/asserts.go"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06c125285b77028ed86fe8a876051259215c4347f9ce76e1bef74a80a5b5fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): generator/unroll/instructions.go:451-470 | generator/unroll/instructions.go:472-490 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/instructions.go"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c81cfe00bdcfa972e1177c31bb1bdaba0c601f9d4ed6cadf9ce6ae96a31d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): generator/scenario/log.go:749-762 | generator/scenario/log.go:959-974 \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 \u0060generator/scenario/log.go:749\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/scenario/log.go"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"9919b135155a6c952dfd5c2f598f6a2ae534af6708f0bb2dc0dc1a567919b4a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): listener/listener_exit.go:569-584 | listener/listener_exit.go:602-617 \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 \u0060listener/listener_exit.go:569\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. 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":"listener/listener_exit.go"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86aa1f9d4f7221c0cea8d42260b7c1e9440614ffb0a47b0104e2b0ead5aa737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): llvm/compiler.go:798-812 | llvm/compiler.go:836-851 \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":"llvm/compiler.go"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c9fd37a9c23cbf0e536bd0c5334ad836ae13d392748fcc351c3b7e867eef57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): ast/ast.go:1710-1724 | ast/ast.go:1765-1779 | ast/ast.go:1820-1834 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ast/ast.go"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79e91866ec36b284aaa17d6ee7d0d3a549d16f8dc3da92d8cd07b62cfe58327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): listener/listener_exit.go:1113-1126 | listener/listener_exit.go:1129-1142 | listener/listener_exit.go:1145-1158 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"891c014eba50dce5c15a62ffbf8c36a1f78d1b29be00ed1daff4efc2d2586e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): generator/asserts/asserts.go:913-926 | generator/asserts/asserts.go:930-943 \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":"generator/asserts/asserts.go"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"4774f1c06f81ad4c69e1a942d550ae111e1078c5e290c4d95cafe1b41b0f3a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): llvm/compiler.go:1453-1466 | llvm/compiler.go:1475-1488 \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 \u0060llvm/compiler.go:1453\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":"llvm/compiler.go"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ed55bf9507dbb0b57eccbf70a3bf009714cb0dbd65e49d00972c9af69584f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): types/types.go:1141-1154 | types/types.go:1161-1174 \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 \u0060types/types.go:1141\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. 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":"types/types.go"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4a60825ba9f484649822e18048bf957cef6800ede38b03da28d8eeae4a5150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ast/ast.go:255-267 | ast/ast.go:288-300 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ast/ast.go"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6398ab257a769c9f96990b33d8fe9f35980c118f381fc38bc9a6f29967d98bd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ast/ast.go:461-473 | ast/ast.go:493-505 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ast/ast.go"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c067a682cc8fdd8bcd14fb70cf5e780106c4d53a572b0897802ad72bbe4f345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): preprocess/preprocess.go:1135-1147 | preprocess/preprocess.go:1311-1322 \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 \u0060preprocess/preprocess.go:1135\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 after the matched lines, \u0060preprocess/preprocess.go:1148\u0060 calls \u0060SetId\u0060, \u0060IdString\u0060 and \u0060preprocess/preprocess.go:1323\u0060 does not \u2014 after which the two agree again for 3 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":"preprocess/preprocess.go"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ba3579751b5128d794580e2d563bffd4d66950de195e319356897c170a97a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): preprocess/preprocess.go:1240-1251 | preprocess/preprocess.go:1397-1409 \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 \u0060preprocess/preprocess.go:1240\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":"preprocess/preprocess.go"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5ecbe2bd9f65c42e426d568546f9cf5ddfc3ab5476e1ba3f2a6c5010ad6187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): types/types.go:736-748 | types/types.go:1264-1276 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060types/types.go:733\u0060 calls \u0060Errorf\u0060 and \u0060types/types.go:1263\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":"types/types.go"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f22176a5dc2e3f59f977287e3552944767dd3b990dfb066485fe1ca504e2476"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): listener/listener_exit.go:400-411 | listener/listener_exit.go:646-657 \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 \u0060listener/listener_exit.go:400\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"listener/listener_exit.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acb2c59d4f79e7895c1c9258c033be4706b1442eb61b1b3c920f584a128b598"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): listener/listener_exit.go:1062-1073 | listener/listener_exit.go:2220-2231 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"d701bf0eee9483eeac5341ac240bf6426e819ebb0bd2804f20c840418c47f61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): listener/listener_exit.go:1076-1089 | listener/listener_exit.go:1097-1110 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b1ae92553bca382793902448fb5223620f69c86eccc1a0a0b2864a39279b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): listener/listener_exit.go:1246-1257 | listener/listener_exit.go:1272-1283 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060listener/listener_exit.go:1285\u0060 calls \u0060Sprintf\u0060, \u0060loc\u0060, \u0060GetStart\u0060 and \u0060listener/listener_exit.go:1258\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":"listener/listener_exit.go"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4df2e71de108c3b7c36e96d8e7e4f85faf5acb49671415ff7ec4cb858d8021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): preprocess/preprocess.go:1164-1175 | preprocess/preprocess.go:1336-1347 \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 \u0060preprocess/preprocess.go:1164\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":"preprocess/preprocess.go"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefd00ae35bf26b0b64890119af7e8bd29a6c2a8d2e08a922176bd0cad1965ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): preprocess/preprocess.go:1211-1222 | preprocess/preprocess.go:1373-1383 \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 \u0060preprocess/preprocess.go:1211\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 after the matched lines, \u0060preprocess/preprocess.go:1223\u0060 calls \u0060SetId\u0060, \u0060IdString\u0060 and \u0060preprocess/preprocess.go:1384\u0060 does not \u2014 after which the two agree again for 3 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":"preprocess/preprocess.go"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a7a0206e0026245da7ece00dc0250f27ebeef580400e133cd8023951506e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): generator/asserts/asserts.go:405-414 | generator/asserts/asserts.go:482-492 \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 \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":"generator/asserts/asserts.go"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bf1747e2052e75e4be6aeb3f2826eddc24c9055a95b9a18551a9961d76e543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): generator/asserts/asserts.go:554-564 | generator/unroll/unroll.go:726-736 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/asserts/asserts.go"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"40367b3fb3ba517dbc80e63c283d421c9775220d4bf5ead85a9736d57dac9f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): listener/listener_exit.go:414-424 | listener/listener_exit.go:675-685 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7c65c5c816402cd8b08fa35d0961b601cc7a0824c5bca64d3f4e587517f2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): listener/listener_exit.go:2294-2312 | listener/listener_exit.go:2315-2333 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dba1881c7151bfbf44a7b219411088a2e6ae0079c8857acf2f8f63b556d321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): llvm/compiler.go:1665-1675 | llvm/compiler.go:1677-1687 \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 \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":"llvm/compiler.go"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"024302fdf5258d491a23844c729bad6adcabbd33030cd04b55a46a4928072d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): preprocess/preprocess.go:765-774 | preprocess/preprocess.go:864-874 \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 \u0060preprocess/preprocess.go:765\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":"preprocess/preprocess.go"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7adf1f48d25f548a54cf741a64f19f149b7c29c8a0c50940bdaf232fb258cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tui/setup.go:143-153 | tui/setup.go:157-167 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tui/setup.go:154\u0060 calls \u0060handleEnter\u0060 and \u0060tui/setup.go:168\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":"tui/setup.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d160464f9923b239eae0eaca217a35a31fd5ba2bf0ddf529ad1ddda0e2f49c11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): listener/listener_exit.go:430-439 | listener/listener_exit.go:663-672 \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 \u0060listener/listener_exit.go:430\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"listener/listener_exit.go"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad0237b5586b3b1320f8b928ed973b2ac57dc67240757c1531c73444c189504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): listener/listener_exit.go:514-523 | listener/listener_exit.go:527-536 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bfbe6f3f4d34dabdf427e12f597f9c1c6bf1fcf76b1f845aeabae16cdc7c43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): llvm/compiler.go:415-424 | llvm/compiler.go:426-435 \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 \u0060llvm/compiler.go:415\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":"llvm/compiler.go"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"6834fe9516c52f9231dd8e5607edd7bcef15ccf717c42ab532918e321e821c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): llvm/compiler.go:524-533 | llvm/compiler.go:586-594 \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":"llvm/compiler.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8efee91a0482d36a22952c12a5c4b7e706127533c020a7ff68fafe5c142714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): llvm/compiler.go:1759-1768 | llvm/compiler.go:2603-2609 \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":"llvm/compiler.go"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2ea513f2a267abef68eb70b6a8ce08dd18b6aa99144e2809ce3da5128db9e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): preprocess/preprocess.go:627-636 | preprocess/preprocess.go:679-688 \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 \u0060preprocess/preprocess.go:627\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/preprocess.go"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"8636d8e3fdb7a1226ecc7b7b997cb9e5de8e7ee0308958ed6e1ee81f6219bde8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): types/types.go:223-232 | types/types.go:251-260 \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 \u0060types/types.go:223\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. 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":"types/types.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3214048a4237d0af54c4902535b6908386dade456f99ab2b675a4069968fe6bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): listener/listener_exit.go:304-312 | listener/listener_exit.go:317-325 | listener/listener_exit.go:428-435 | listener/listener_exit.go:661-668 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"af247cd314ebffecd0d6286dad82831548869e166df59f7e3e0de5416fd168d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): generator/unroll/unroll.go:946-957 | generator/unroll/unroll.go:958-969 \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 \u0060generator/unroll/unroll.go:946\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":"generator/unroll/unroll.go"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf98aa272adee8830e7e37a9cb483ffaf5e6e39886d5290b409ab00ef8de7cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): listener/listener_exit.go:378-384 | listener/listener_exit.go:2248-2256 \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 \u0060listener/listener_exit.go:2248\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. 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":"listener/listener_exit.go"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96d023036a138f869ea7f6d54ffaa3cb1c833abde3b5ec79376d9ec458ce9f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): listener/listener_exit.go:582-596 | listener/listener_exit.go:626-640 \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 \u0060listener/listener_exit.go:582\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":"listener/listener_exit.go"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead91d9ee797f7864e5a097d2db7fde7f67f853b7c4b575cdde35e0acad56051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): listener/listener_exit.go:952-960 | listener/listener_exit.go:981-989 \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":"listener/listener_exit.go"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af5468ec0181e9af0d32e7cdccfaeb2e9373c2bb1ffd80dcf6fe6b4bcc49b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): listener/listener_exit.go:1593-1600 | listener/listener_exit.go:2183-2191 \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":"listener/listener_exit.go"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"9312164235218f41585e7afe5bd42f2bbbf31a463ef91930367783cdb36e1336"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): llvm/compiler.go:875-883 | llvm/compiler.go:949-957 \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 \u0060llvm/compiler.go:875\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"354bbfbdd8010abd2cc854ce8b5850df37e77c94a1694198dad35ce4cd03335e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): preprocess/preprocess.go:1074-1082 | preprocess/preprocess.go:1272-1280 \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":"preprocess/preprocess.go"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c7c7f22c749fa58ff0d8ccc5af5e9204106188ad4e79d917d38537d6748f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): runner/runner.go:501-509 | runner/runner.go:601-609 \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 \u0060runner/runner.go:501\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runner/runner.go"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4df919f57544eef8a0c3e2d03d6a70c6b94df1532beb073a17cf6bfe6836c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): types/types.go:987-995 | types/types.go:1010-1018 \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 \u0060types/types.go:987\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. 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":"types/types.go"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"1409a82e4043c3acd9667069faa0123da4c094f3c3c7581394d87818b4b85ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): types/types.go:1251-1259 | types/types.go:1303-1311 \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":"types/types.go"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"beab4712c7b2769d5964a336f3df31b8b2c4d697860a87e0820c65df937c8449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 8): listener/listener_exit.go:303-309 | listener/listener_exit.go:316-322 | listener/listener_exit.go:329-336 | listener/listener_exit.go:344-351 | listener/listener_exit.go:397-403 | listener/listener_exit.go:427-433 | listener/listener_exit.go:643-649 | listener/listener_exit.go:660-666 \u2014 all 8 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 \u0060listener/listener_exit.go:303\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2c75cbbea7485c3f4098e9ad914ab1455ff2275fbe0b9772117127235e21b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): generator/unroll/instructions.go:574-580 | generator/unroll/instructions.go:582-589 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060generator/unroll/instructions.go:583\u0060 calls \u0060In\u0060 and \u0060generator/unroll/instructions.go:592\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":"generator/unroll/instructions.go"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f68f30287f4a25d6d324cdd0af9958e690ef41a4bf67bfd28f91667c4665a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): preprocess/preprocess.go:378-385 | preprocess/preprocess.go:387-394 | preprocess/preprocess.go:395-402 \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 \u0060preprocess/preprocess.go:378\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 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060preprocess/preprocess.go:387\u0060 calls \u0060collect\u0060 and \u0060preprocess/preprocess.go:395\u0060 does not \u2014 after which the two agree again for 5 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":"preprocess/preprocess.go"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee1cffbd67fd1de4baadab66305382206da4e4953973fe83d6715650f21af84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): types/types.go:247-254 | types/types.go:278-285 \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 \u0060types/types.go:247\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"types/types.go"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4e7daa52efe0527be1b0c712bdccbf0b54d3d1ccbc3c3b7af3b045144598d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): preprocess/preprocess.go:1167-1173 | preprocess/preprocess.go:1243-1249 | preprocess/preprocess.go:1339-1345 | preprocess/preprocess.go:1400-1407 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \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 \u0060preprocess/preprocess.go:1167\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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, \u0060preprocess/preprocess.go:1176\u0060 calls \u0060IdString\u0060 and \u0060preprocess/preprocess.go:1348\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":"preprocess/preprocess.go"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d39761db792cb909aad3e5ecd3ea5f1794090a938cebcef353357d96fbbef46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): llvm/compiler.go:1363-1368 | llvm/compiler.go:1372-1377 | llvm/compiler.go:1382-1387 | llvm/compiler.go:1392-1397 | llvm/compiler.go:1402-1407 | llvm/compiler.go:1412-1417 | llvm/compiler.go:1422-1427 | llvm/compiler.go:1432-1437 | llvm/compiler.go:1442-1447 \u2014 all 9 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bad98ddaf24e29cb87f9e34eec62fd5f0a50a7980a870cbae0dbda93b375dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): generator/unroll/unroll.go:674-679 | generator/unroll/unroll.go:681-686 | generator/unroll/unroll.go:705-710 | generator/unroll/unroll.go:712-717 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \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 \u0060generator/unroll/unroll.go:674\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":"generator/unroll/unroll.go"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"8065af605c10b06267feefc437de6cae46dc72ec90607ce7ff9d0a030f091999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): llvm/compiler.go:1452-1457 | llvm/compiler.go:1474-1479 | llvm/compiler.go:1496-1501 | llvm/compiler.go:1506-1511 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a764e8f750f230c02040aff218655de7363107727fc47ea1bf1c10331c45748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): listener/listener_exit.go:487-492 | listener/listener_exit.go:577-582 | listener/listener_exit.go:610-615 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8609a514b68a0ce3fdab76e29ae11002dfb0545f8e969d63a58d0a69910e16ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): generator/unpack/unpack.go:429-437 | generator/unpack/unpack.go:466-468 | generator/unpack/unpack.go:494-499 \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 \u0060generator/unpack/unpack.go:429\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 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060generator/unpack/unpack.go:437\u0060 calls \u0060Sprintf\u0060, \u0060Get\u0060, \u0060NewInit\u0060 and \u0060generator/unpack/unpack.go:468\u0060 does not \u2014 after which the two agree again for 3 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":"generator/unpack/unpack.go"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba3de0a5f70fca43d7fc5476c05082f8592e50112e07f73f3518d1e8481958e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): listener/listener_exit.go:1039-1044 | listener/listener_exit.go:1441-1446 \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 \u0060listener/listener_exit.go:1039\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 before the matched lines, \u0060listener/listener_exit.go:1038\u0060 calls \u0060GetText\u0060 and \u0060listener/listener_exit.go:1440\u0060 does not \u2014 after which the two agree again for 3 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":"listener/listener_exit.go"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e164f1b0bee514f0eafb5b53ecf2242f3a171d47e9e1f72ac5b9f17b927ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): listener/listener_exit.go:1810-1815 | listener/listener_exit.go:1822-1827 \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 \u0060listener/listener_exit.go:1810\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"857275b17f63fd215ba18bb4a72f61e05ab5e5210952e51253c1ff3253f24703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): llvm/compiler.go:569-574 | llvm/compiler.go:653-658 \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 \u0060llvm/compiler.go:569\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/compiler.go"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"90199a7c6926a6726ab86478fc80d14d7e8571a0b5a41407c9ef1fed81efde2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): generator/unroll/instructions.go:250-254 | generator/unroll/instructions.go:288-292 | generator/unroll/instructions.go:950-954 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/instructions.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"12eb2492fc62e54e5db561faeda74da49a29a97d3698611af80981e0f9e50f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): generator/unpack/unpack.go:559-565 | generator/unpack/unpack.go:566-572 \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":"generator/unpack/unpack.go"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"9236b0afb2adb1c547485ed2f94d90f03535190dc3b55e3759b72c6603821c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): generator/unroll/instructions.go:728-733 | generator/unroll/instructions.go:814-819 \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":"generator/unroll/instructions.go"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1f8c5283e906e4d1c6189a0072799c332db743755c193445ba7f7cf029c285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): listener/listener_exit.go:938-943 | listener/listener_exit.go:977-981 \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 \u0060listener/listener_exit.go:938\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"01db72bf0450c327ea563c317fbca5815267f5464fc3c5c6e2f47f81d2c5821a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): format/format.go:195-207 | generator/scenario/log.go:609-621 \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":"format/format.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e32e19655f059a6b861561c1f1c4c642639f02fea1ab1f76f7aeec50e022bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): preprocess/preprocess.go:63-72 | types/types.go:53-62 \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":"preprocess/preprocess.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a75335f7337a004deac46a18d2d61a4642c6ab046f1533c0f902be06cddaf60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): ast/ast.go:136-143 | ast/ast.go:1399-1407 | ast/ast.go:1426-1434 | generator/rules/rules.go:400-406 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ast/ast.go:1435\u0060 calls \u0060Type\u0060 and \u0060ast/ast.go:1408\u0060 does not \u2014 after which the two agree again for 3 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":"ast/ast.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"036fc6a8a472ae3df10da7ca67f70ac212007ca603d85e46a868a21bf44c5f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): types/types.go:578-590 | types/types.go:592-604 \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 \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":"types/types.go"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19ec36f054448aa8f358d038a537f509c9ed18b0bbdd94c859c0367c444d21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): listener/listener_exit.go:1115-1126 | listener/listener_exit.go:1131-1142 | listener/listener_exit.go:1147-1158 | listener/listener_exit.go:1163-1174 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \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 \u0060listener/listener_exit.go:1115\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"listener/listener_exit.go"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0dff7bf7cf9dd435047156be63064403353095430615e64f084ac4d6b6cb3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tui/model.go:369-379 | tui/model.go:467-477 \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 \u0060tui/model.go:369\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. 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":"tui/model.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa31d56f0feda8f01ef22a9b36baac3d892c1e72e2b923a79f6931d7a0aaeb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): format/format.go:304-313 | format/format.go:316-325 \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":"format/format.go"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee3945a2b525a2bd16acbc107d3a702cf06c1d07327606583a6680cd183b261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): listener/listener_exit.go:21-29 | listener/listener_exit.go:2109-2117 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_exit.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abdcd0d66e8f42a2f63cd4125861ba0fe7b75968ebfe1e31868320cb69cd793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tui/setup.go:336-342 | tui/setup.go:346-352 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tui/setup.go:353\u0060 calls \u0060WriteString\u0060, \u0060Render\u0060 and \u0060tui/setup.go:343\u0060 does not \u2014 after which the two agree again for 3 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":"tui/setup.go"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe3027f44831838d0595833c68293193403f8e7ecbb857286ede42ae3138ca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): types/types.go:234-240 | types/types.go:265-271 \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 \u0060types/types.go:234\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":"types/types.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38a25a2dbc22bce31116242e30a2d6f5cb4ecaa71e18c8b6d8c93745070d0e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): preprocess/preprocess.go:518-524 | preprocess/preprocess.go:625-631 | preprocess/preprocess.go:677-683 \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 \u0060preprocess/preprocess.go:518\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/preprocess.go"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"036c2e9efdcc014e3c35a1196f76183000fcd0979581c8dc0813e2852532adc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): generator/unroll/instructions.go:390-395 | generator/unroll/instructions.go:401-406 \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 \u0060generator/unroll/instructions.go:390\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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. 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":"generator/unroll/instructions.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c326ad3564534c59f9b323e31017a7432434997feed58fc24a8e5a9a215c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): generator/unroll/unroll.go:289-295 | generator/unroll/unroll.go:297-303 | generator/unroll/unroll.go:305-311 | generator/unroll/unroll.go:313-319 | generator/unroll/unroll.go:321-327 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/unroll.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b489cf1e16ded62462a6602aee381cced7ce1bfa5972b09fce81e7063953790"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): listener/listener_exit.go:767-771 | listener/listener_exit.go:2045-2049 \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 \u0060listener/listener_exit.go:767\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":"listener/listener_exit.go"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"995b2f466471d2e9c437622d1cc0945db1d3f10a6607e56df5422130cdf926b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): listener/listener_exit.go:776-780 | listener/listener_exit.go:2052-2056 \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 \u0060listener/listener_exit.go:776\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":"listener/listener_exit.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e77ad009e7643b5ce6373f42e81a8e19b3ec4b1d2b5958805be0bbf667983d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): preprocess/preprocess.go:484-489 | preprocess/preprocess.go:495-500 \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":"preprocess/preprocess.go"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3a8eb130c0a161654beff6b4796728692e473fcc3c0b4617869d224fac735b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FaultListener (LCOM4 4): FaultListener\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":"listener/listener.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3225d679d42393df5fb0cda0a3a068f16522a2c504b3e1a0e974571a77cda4cc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: execute/execute.go: 8.2% line coverage (8/97)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"execute/execute.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca7331a6f6203d16cb74c3db625268b839f8e384edcb3ab26c5e9e4f603e400"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: execute/history.go: 0.0% line coverage (0/43)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"execute/history.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75565cc1796987c47089388168a0a824aefda2ff85c3015aea55ed0dea160f7b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: execute/responses.go: 0.0% line coverage (0/155)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"execute/responses.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d9874379946cd8ef4ded697bc518964cc10576109b267e5f5cfcf112051463"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: execute/violations.go: 0.0% line coverage (0/231)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"execute/violations.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2302caaa5f23fe26bb44d6c088d15d40ab61f39e2d25f62676b9ab4e5733fd5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: format/format.go: 0.0% line coverage (0/203)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"format/format.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"795bb1b7b26db3ceae3a0dc6ccf1e21ed29b0128cfd55aa744fcae2b150c45cf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: generator/rules/rules.go: 47.0% line coverage (363/773)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/rules/rules.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2586e2511f6d273063fb9ba8dddcb224cb757801d9b3c7ae797d4e562ac4de"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lint.go: 0.0% line coverage (0/71)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lint.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88bd043f71bb0bf6b850194aa990003a5a26d3ad7cc39dd63b8148e7b726a02"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: llvm/alloc.go: 30.3% line coverage (27/89)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llvm/alloc.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41db46d9fccb6d14631ca8f2a7c839559fbee297123cacb1b73007c0114364ae"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: main.go: 0.0% line coverage (0/237)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e554851c30d387e22875d4438325173e6b8abdfe3fc5965b588b7a6a1a33b4cf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: render.go: 0.0% line coverage (0/122)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"render.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb872757a9c4e27b2178892a99a2710a01a0f6a6136bae3caa456e933113b66"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runner/runner.go: 43.7% line coverage (197/451)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runner/runner.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6aa8da6cc06a074a6533f0792a38610fe6f056691b0f12d88d98dba652608c2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tui/errors.go: 0.0% line coverage (0/154)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/errors.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57cca1b2cef8598c0b9dd11373d66f9159980edaaad5b6f1ba96ebd92549789"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tui/filebrowser.go: 0.0% line coverage (0/118)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/filebrowser.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d81dd4d9ca57958d2265edbd698fddc738c9481975a985243cba28afee8925"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tui/model.go: 0.0% line coverage (0/327)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/model.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7072eead967b05a2eeebbb89fa8a1c135754f71d44dd79963407e7cb611efc6b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tui/progress.go: 0.0% line coverage (0/95)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/progress.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f08e885d3fa250a99ea33cfd002f36a28a48a817cd2a8009f830fa735601347"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tui/results.go: 0.0% line coverage (0/302)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/results.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66244e79eb963e0d9c8f4fc2d5bcd9f53bd18b44e63f158041506f5c3a73df43"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tui/setup.go: 0.0% line coverage (0/263)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/setup.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acbfb66c8d7c986da57072239c55f3ae2bacfb7792b33b03165eb3d989ca7f6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tui/styles.go: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/styles.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65283bc2c408a8d916fa0962658035e1ad67152d3a4d2477fab453717128a38f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tui/theme.go: 0.0% line coverage (0/123)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/theme.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3163e16599e5b090c64eef086be1b3cbfcf346e15d1b66cec5b8e4207b56143a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: update.go: 0.0% line coverage (0/245)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af428b1ce0982afb6f2b67d8ec23e5b30c3c0acbb8344fad78f83237b2f40c2"}},{"ruleId":"D12","level":"warning","message":{"text":"Dependency pinned to a stale untagged commit: github.com/barkimedes/go-deepcopy: Direct dependency \u0060github.com/barkimedes/go-deepcopy\u0060 is required at \u0060v0.0.0-20220514131651-17c30cfc62df\u0060 in go.mod \u2014 a pseudo-version, which pins an UNTAGGED commit from 2022-05-14, 4.5 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of \u0060github.com/barkimedes/go-deepcopy\u0060 and has not moved this requirement in 4.5 years: every fix the module has published since that commit \u2014 including any security fix \u2014 is absent from this build, whether the module went quiet or moved on without you. Check whether \u0060github.com/barkimedes/go-deepcopy\u0060 now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7ee87fd373fc7d2a83ac408788b2f07ac89fe28bf2ff637934a84b29445629d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: types/types.go: types/types.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in Checker.typecheck 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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 18:04:29 -05:00\u0027 --until=\u00272026-11-06 18:04:29 -05:00\u0027 --full-history --no-merges -- types/types.go\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":"types/types.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9486f6419f61a8b1eb1adb9fb4210c1c02dbde0dafc286048c58beb3017fbdfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: runner/runner.go: runner/runner.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Runner.Run at line 342. 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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 18:04:29 -05:00\u0027 --until=\u00272026-11-06 18:04:29 -05:00\u0027 --full-history --no-merges -- runner/runner.go\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":"runner/runner.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"040bd2fcf4581425dcdc5e4123ab4986982aee9c4a43f256adfb243b55b97f3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when the model mixes whole() with unknown()/uncertain() there is no \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":"llvm/compiler.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b0168640b4356d5ccbfa4675605c9624c053ecbfec208c10776c8fab46febf"}},{"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 \u0060lint.go\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lint.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56959177ec9a6e6a274561670ee93c05db9fe78caaa6f2c05c58c818964f1bf4"}},{"ruleId":"D22","level":"warning","message":{"text":"\u0060Generator.ParamManifest\u0060 returns a map (\u0060map[K]V\u0060) where its 4 siblings return a slice (\u0060[]T\u0060): 4 of 5 collection-returning members of \u0060Generator\u0060 return a slice (\u0060[]T\u0060) (4 of 5). Siblings: Generator.GetWarnings (generator/generator.go:55); Generator.ProcessAsserts (generator/generator.go:272); Generator.ProcessUnfuncs (generator/generator.go:445); Generator.ProcessAnnotations (generator/generator.go:1120). Return a slice (\u0060[]T\u0060). [rule A4]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/generator.go"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28a5bee7090e57e7a16747416e803cf96781e86610d41d6736a03c61b9d6285"}},{"ruleId":"D22","level":"warning","message":{"text":"\u0060unroll.NewConstants\u0060 returns a slice (\u0060[]T\u0060) where its 4 siblings return a map (\u0060map[K]V\u0060): 4 of 5 collection-returning members of \u0060package unroll\u0060 return a map (\u0060map[K]V\u0060) (4 of 5). Siblings: unroll.FindMutableVars (generator/unroll/unroll.go:509); unroll.FindUsedVars (generator/unroll/unroll.go:528); unroll.FindWriteSets (generator/unroll/unroll.go:549); unroll.WhenThen (generator/unroll/unroll.go:653). Return a map (\u0060map[K]V\u0060). [rule A4]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/unroll.go"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3a61be1bbb3bca541eaeaf2bd4bb6e958d67bff6b4daa268fdf9917311a90b"}},{"ruleId":"D22","level":"warning","message":{"text":"\u0060SpecRecord.FetchOrder\u0060 returns a slice (\u0060[]T\u0060) where its 3 siblings return a map (\u0060map[K]V\u0060): 3 of 4 collection-returning members of \u0060SpecRecord\u0060 return a map (\u0060map[K]V\u0060) (3 of 4). Siblings: SpecRecord.Fetch (preprocess/record.go:124); SpecRecord.FetchInstanceStrMap (preprocess/record.go:165); SpecRecord.FetchAll (preprocess/record.go:227). Return a map (\u0060map[K]V\u0060). [rule A4]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/record.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"05eafeff6ffbc70bb5c2cfb1cf4f79a653fd98353dea2c7416204d25ec22463e"}},{"ruleId":"D22","level":"warning","message":{"text":"\u0060SpecRecord.Index\u0060 takes (ty, name) where its 3 siblings take (name, ty): 3 of 4 members of \u0060SpecRecord\u0060 with these two same-typed parameters take them in the order (name, ty) (3 of 4). Siblings: SpecRecord.AddInstance (preprocess/record.go:57); SpecRecord.Fetch (preprocess/record.go:124); SpecRecord.FetchInstanceStrMap (preprocess/record.go:165). Reorder to (name, ty); both are the same type, so the compiler cannot catch a swapped call. [rule A3]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/record.go"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"67aabedb3d429fb88619dac7741f9ae8fdc078388d9f820111865aa3b5aeba67"}},{"ruleId":"D27","level":"note","message":{"text":"High interface indirection: 33 % of calls go through an interface \u2014 tracing a call means resolving the implementation each hop. Prefer concrete types where there\u0027s a single implementation."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cdce37f9abf7531f8d28e92afaa9d119cadea0ab8dd2d3958949c20b31f486ec"}},{"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":"b5ccdbb4f94bf4ccf0ca287f2ad270f88200f7b47357057f8b4aaca0872fd8fb"},"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"}},{"id":"CICD-SEC-8","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":"9a63136b6a8a88bc6a9b442d172a9ef78b197135e4596dc1b26790ccdfca06a7"},"taxa":[{"id":"CWE-494","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":"4f526bcbf7e7a63a73ef6287efdb737042b5dd82d264fcebc9fb88a1fc6c44d3"},"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":"6b453e5b9baaabcf4feec5c16881bebe1fb9995726f25f5294dcaee29f7e0b99"},"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":"d817efe387c0afa286596b6c6c915a38fd04ee4de1398c48c1aa42ea92bfd311"},"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":"efa1b9ca8a7fc55fa673b48b3b02b54d1216aeb1ff53351db97d6ae5b048cc2b"},"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":"b9891c132751754981c8c09d3bbcd99fa719fe72563c06a3b16e45f86603633f"},"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":"7f9622b7d817a75c7794142b7fcdb10054671ded51167b699f6410e34ecb57b6"},"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":"6692d052d5b97f9ee77cba7946b53ea23b34cf20568bf7fd50159c327aa28e46"},"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":"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":"566414afd1a46f97a9483648fdd66e33b47c3b74789c1665056abf5449462dad"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"24886d388c493c75f4b42c915696e1345813597f705afb29ec1ace9ce347053f"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"8040fc93cf2c0123971448f489eee9be1882f96790705a6729988696dc837b76"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"7bfb7189e77a193f8b22d5ebb545f8a2391e11f28d3f61f0be64112b1e830ef6"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"0c8ff487ea882ab6742926763f6a5e0294b4d1da784a7a8b4afd3dcf5cc890dd"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"1d124b4c09c30fe4027b2a2161c0466f653e372e386f32506ba223d1c98f1dad"},"taxa":[{"id":"CWE-400","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"0a7446afb287cb67c0cc67b6e3af36261268113d2f68a937b4f69e1361ef55c6"},"taxa":[{"id":"CWE-400","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":"bbcbad036ce50e514481e249c33dc925cd9ae0dafbad6806e05bf13627d3f5b6"},"taxa":[{"id":"CWE-377","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"849d163c4ac0a84203f0479748bb742c511771b0fb155925bec55d420ce9420e"},"taxa":[{"id":"CWE-377","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","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":"d94222fa9934edd47ba3a0ef99e3a7d85a9c2a0dac93507e5359a1abb9d5d840"},"properties":{"dependency":{"package":"stdlib","version":"1.25.0","advisory":"GO-2025-3955","aliases":["BIT-golang-2025-47910","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.25.1","relation":"direct","declaredRange":"1.25.0","reachability":{"kind":"production","file":"listener/listener_fetch.go","line":83,"symbol":"http.Get"}}}},{"ruleId":"D30","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":"34d92b4e8ceb16a1fd57062952c6ce862546a7f5a590d99835b621f385dc5d89"},"properties":{"dependency":{"package":"golang.org/x/mod","version":"0.17.0","advisory":"GO-2026-6179","aliases":["BIT-golang-2026-56864","BIT-golang-2026-56865","[CVE redacted]","[CVE redacted]","GO-2026-6180"],"severity":"medium","fixedVersion":"0.40.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"362d19fbc20680c130f6d3f829465778e97203407075f4ceb76a4cf0cc41a027"},"properties":{"dependency":{"package":"golang.org/x/sys","version":"0.43.0","advisory":"GO-2026-5024","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.44.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"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":"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":"790db71063bb49084b0ab16362261a53b7440c84f48dcfe5c4215223160106a8"},"taxa":[{"id":"CICD-SEC-5","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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","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":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add gosec / govulncheck (or golangci-lint) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060go.mod\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"go.mod"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a2e1d4ec30322a872affe28883b4491a6c0e2043ba24bdb2e79623c819f5b0"}},{"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/goreleaser.yml"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept a context.Context: Only 0/3 functions that make a cancellable request (net/http, net.Dial) accept a context.Context or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a cancelled request, a shutdown, an expired deadline. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it (\u0060http.NewRequestWithContext\u0060, \u0060DialContext\u0060); where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"faab330444baf00d50193f250b5c9b514f84cdca16c24014ef3776329847910c"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: fetchRelease: \u0060fetchRelease\u0060 calls \u0060http.NewRequestWithContext(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"215fdc1815bfebe7c4b8e379c5b47253a9b9eb4ad14922f36e0537d014d30a5f"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: downloadTo: \u0060downloadTo\u0060 calls \u0060http.Get(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"56768b4077a08936dca09b9d71e57e47f093a5d8471b99cb5bbbe5647bf36475"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: fetchOrCacheURL: \u0060fetchOrCacheURL\u0060 calls \u0060http.Get(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listener/listener_fetch.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18a07f93dfd6304763bcd2ee5cd80deda1b304bae9470449fc92a70e787aa29"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: This slices the parameter \u0060rawid\u0060 with a constant bound, \u0060rawid[1:len(rawid)-1]\u0060, and nothing in the function checks \u0060len(rawid)\u0060 first. The value is input the caller hands in: a shorter one panics with \u0060slice bounds out of range\u0060. Test \u0060len(rawid)\u0060 against the bound and return an error, or document and enforce the minimum length at the boundary."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/record.go"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21469fe61a0eb7015a6162744a79cc1f96ad240920a21b9c4d2290b4cd7ad12"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060idx\u0060 is the result of a search that answers -1 when nothing is found, and \u0060without[:idx]\u0060 uses it as a bound with no test of \u0060idx\u0060 in between. When the search misses, the bound is -1 and the access panics with \u0060slice bounds out of range\u0060. Test \u0060idx \u003C 0\u0060 (or use \u0060strings.Cut\u0060) before using it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/instructions.go"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a8eeb883b43f9852aa147337472115eecbfced424dcd9852cbb2b8e0ecb3ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"main.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d6efdc8776c031b8ea7cc4a868f78bf0e132aefbc083145aef345ed552d331"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"util/util.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7f15e04c2d64f29c9eb92ef78eb1386a272ae986f5c6b8741934aa47654ed7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"util/util.go"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6e4a41fb262427f26ae090865ee6a0fa772dd012905134aa2aadf3c14f3c6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"util/util.go"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c88761199836123aa874b92b695d05964f0891d7a23921b676dc6beace21fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"types/types.go"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"29eff29bdc99e81c259038a48f31179bd536d8a3b855c0d22390c907228b5510"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"tui/filebrowser.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f06d3d1645535b3e8f3ec1467c1e0027531e7d5208b92e12fb22c76ff4489e"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (an error-returning call as a bare statement): \u0060spec.UpdateVar(rawid, ty, proFn)\u0060 returns an error, and the statement drops it: when \u0060spec.UpdateVar\u0060 fails nothing records it and the code after it runs as if it had succeeded. Check it (\u0060if err := spec.UpdateVar(rawid, ty, proFn); err != nil { \u2026 }\u0060) and return or log it with what was being done, or assign it to \u0060_\u0060 with a comment saying why the failure cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/preprocess.go"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcdaaf609ef4b7e37c3f2d46740cf133951fff9adcc27c92747b6be0d2c06a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (an error-returning call as a bare statement): \u0060sr.UpdateStock(name, val)\u0060 returns an error, and the statement drops it: when \u0060sr.UpdateStock\u0060 fails nothing records it and the code after it runs as if it had succeeded. Check it (\u0060if err := sr.UpdateStock(name, val); err != nil { \u2026 }\u0060) and return or log it with what was being done, or assign it to \u0060_\u0060 with a comment saying why the failure cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/record.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4450a1728941b16587971fea9be8f1919251a06d26293b406d3b80aff2ac1e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (an error-returning call as a bare statement): \u0060sr.UpdateFlow(name, val)\u0060 returns an error, and the statement drops it: when \u0060sr.UpdateFlow\u0060 fails nothing records it and the code after it runs as if it had succeeded. Check it (\u0060if err := sr.UpdateFlow(name, val); err != nil { \u2026 }\u0060) and return or log it with what was being done, or assign it to \u0060_\u0060 with a comment saying why the failure cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/record.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5a38ac091bb2752c32dddcaadd9f7b2460f46fff38a11dffc01c0af1dc478a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (an error-returning call as a bare statement): \u0060sr.UpdateComponent(name, val)\u0060 returns an error, and the statement drops it: when \u0060sr.UpdateComponent\u0060 fails nothing records it and the code after it runs as if it had succeeded. Check it (\u0060if err := sr.UpdateComponent(name, val); err != nil { \u2026 }\u0060) and return or log it with what was being done, or assign it to \u0060_\u0060 with a comment saying why the failure cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"preprocess/record.go"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac5b59e17fe3b9fb97cd24a572393157ba8734fb670b1f8f7512e61ba49d68d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"llvm/compiler.go"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c155e9ae9c6f3467d009bb4969b0d05ae281d8f5d0180bf627f6080943535a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"llvm/compiler.go"},"region":{"startLine":2760}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f79d175cef661bf65332e7996f2e6f988c0e8946d50da8853b5eb6607bf8ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := cmd.Run(); err != nil\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":"llvm/compiler.go"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a9d1ece08f342d3f11c6699d85c512dbb561563ab4ece8e1ddfbffde879b09"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := asm.ParseString(\u0022\u0022, optimized); err != nil\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":"llvm/compiler.go"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"125f89bfb7d083630c68a2269f6d99313c4983a6c0346e3092dd4d8912710f14"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"listener/listener_fetch.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"93db6e432aa329a45fad880d3f9ee227376a3c6c841c7452e8030ba76cacf28d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := fmt.Sscanf(key, \u0022 \u0022, \u0026round); err != nil\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":"generator/generator.go"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84e183dadd20a40c1aa65fc14671b1c4b34af5fcb96cec3c343e7a4945d61b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060offset, _ := strconv.Atoi(without[:idx])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060offset\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060offset\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060offset\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/unroll/instructions.go"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0db06a47f37f19a8650115e036c521c088c5e2ac6c3d8a58038dd621b6d232e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := strconv.Atoi(suffix); err != nil\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":"generator/asserts/asserts.go"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff65de54e0f7c230528d278223b328c9980b19db9fb2b1e2c282d6e3b63240b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"execute/violations.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d005d244fcf5687780401ea79a9d8d396328aeed62cccc22e9c8a01bca078ccf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"execute/violations.go"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fab3d912b9188eda79579e020d7297b82eea91f7853095392cb42e03e4d11f8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060ssaIndexOf\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generator/asserts/asserts.go"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ce9d276e1b604309b2e5e97fbb968f23f891780837dbb7a453358763000626"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.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-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"Reversible One-Way Hash","shortDescription":{"text":"Reversible One-Way Hash"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-338","guid":"e89b7604-c3f7-8b53-bc8c-4d4718c28617","name":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)","shortDescription":{"text":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)"},"helpUri":"https://cwe.mitre.org/data/definitions/338.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-377","guid":"53bb4a85-bb20-a053-b6e4-4a9f656e96bb","name":"Insecure Temporary File","shortDescription":{"text":"Insecure Temporary File"},"helpUri":"https://cwe.mitre.org/data/definitions/377.html"},{"id":"CWE-400","guid":"ca529a89-676d-8857-aac1-84359c77bb6c","name":"CWE-400","shortDescription":{"text":"CWE-400"},"helpUri":"https://cwe.mitre.org/data/definitions/400.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-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-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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_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-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"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":26,"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."]}]}