{"$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":"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":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"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":"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"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":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"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":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"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":"godwarf.readType (cyclomatic 94): godwarf.readType has cyclomatic complexity 94 (threshold 15). Of this number, 83 points are the body\u0027s own statements and 11 belong to 3 function literals inside it that branch. This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/godwarf/type.go"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c7f0cc0cdc901cd26381695287b31429adffbc193931e62c1749aa5fd2b708"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.next (cyclomatic 74): proc.next has cyclomatic complexity 74 (threshold 15). Of this number, 73 points are the body\u0027s own statements and 1 belongs 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":"pkg/proc/target_exec.go"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"83744c88515d7e0e5544fd4f854bf2148aa213a2c04952f72b93050e5efe26ef"}},{"ruleId":"D1","level":"warning","message":{"text":"TargetGroup.Continue (cyclomatic 66): TargetGroup.Continue has cyclomatic complexity 66 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 1 belongs 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":"pkg/proc/target_exec.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"99707746165f24c0dec7a88c1740ac6d82b972f67359f3afed438401dee3da7b"}},{"ruleId":"D1","level":"warning","message":{"text":"evalStack.executeOp (cyclomatic 65): evalStack.executeOp has cyclomatic complexity 65 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 1 belongs 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":"pkg/proc/eval.go"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7193ad8acf94c69f712a548ae9f9bc406186cb8a2aa850adc2110cfc49ae92aa"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalScope.evalTypeCast (cyclomatic 61): EvalScope.evalTypeCast has cyclomatic complexity 61 (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":"pkg/proc/eval.go"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3fbe459b8b0aa57b51815c879fb18313447fa3d4c24bcb1b8aad613d62c9c1"}},{"ruleId":"D1","level":"warning","message":{"text":"compileCtx.compileAST (cyclomatic 61): compileCtx.compileAST has cyclomatic complexity 61 (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":"pkg/proc/evalop/evalcompile.go"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d8f399397fa5d8ade1da623ff1a99cd2e0389a48a0815fa649a8d11c6618f1"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalScope.simpleLocals (cyclomatic 59): EvalScope.simpleLocals has cyclomatic complexity 59 (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":"pkg/proc/eval.go"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be19dc78b1203e84c8d9545255acd9b41b01eb097afa35d7cf986ee5b5fc2c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.handleRequest (cyclomatic 57): Session.handleRequest has cyclomatic complexity 57 (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":"service/dap/server.go"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"903285ed0a4fbbccb77dcb3c20ec37f9d151d716eb69e04d45463effbc798f84"}},{"ruleId":"D1","level":"warning","message":{"text":"Debugger.Command (cyclomatic 56): Debugger.Command has cyclomatic complexity 56 (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":"service/debugger/debugger.go"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"54416f0451bfcfe3872cb629d9834a721fb7d7c5efdce6caa5efdd7ef681dd88"}},{"ruleId":"D1","level":"warning","message":{"text":"native.trapWaitInternal (cyclomatic 53): native.trapWaitInternal has cyclomatic complexity 53 (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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddb7db6a4b550f37f6219d4523d7a36aa705cf3eb0ceb7aba65df675c7d2acb"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.onLaunchRequest (cyclomatic 53): Session.onLaunchRequest has cyclomatic complexity 53 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 9 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":"service/dap/server.go"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06b9287914e167cc43ab11a22434d5272d404716c6f66e5bde00eae2074af7f"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.loadValueInternal (cyclomatic 46): Variable.loadValueInternal 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":"pkg/proc/variables.go"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6892b3dc15a0f191d5dad4e331f34c13607987843cf8122f3b2caa7dd9b5c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.convertVariableWithOpts (cyclomatic 46): Session.convertVariableWithOpts has cyclomatic complexity 46 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 2 belong to 2 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":"service/dap/server.go"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d889564f78df79304cdf7dd1dce39aa8e5c3d403cf8029bd238af305287268f9"}},{"ruleId":"D1","level":"warning","message":{"text":"cmds.traceCmd (cyclomatic 45): cmds.traceCmd has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 1 of the 45 points is its own statement and the rest belongs to one function literal inside it that branches (line 673). 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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1d584af4ea0a5023df6efbfa5c70d1dea664e4cee3644a0b7d9bed56d8e104"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.findStructMemberOrMethod (cyclomatic 45): Variable.findStructMemberOrMethod has cyclomatic complexity 45 (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":"pkg/proc/eval.go"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c37c7f692786b1046e6ba8f3b050fa619c52a0a3faf98d717f9fb6cf5beb684"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.arm64SwitchStack (cyclomatic 44): proc.arm64SwitchStack has cyclomatic complexity 44 (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":"pkg/proc/arm64_arch.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69fae4db36eeaa1e097d2a2e0a1d6a83fb38e3c8f1f99f59e0c2331b286d920"}},{"ruleId":"D1","level":"warning","message":{"text":"processGroup.waitForDebugEvent (cyclomatic 42): processGroup.waitForDebugEvent has cyclomatic complexity 42 (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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d2599816a1fcc5f1e586afdb2d9a46694f707198d5398fcf3ee75652c5a0b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.writeTo (cyclomatic 41): Variable.writeTo has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/api/prettyprint.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a33c780c66366f537beff66e7ec03e20537a67d193336a860b36173fd4ba3a"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.rangeFuncStackTrace (cyclomatic 39): proc.rangeFuncStackTrace has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 7 of the 39 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1224, 1197, 1189). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stack.go"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa59fb3ad517b77762365f584649d54bf27da36fc202bbf755129cea8002b24"}},{"ruleId":"D1","level":"warning","message":{"text":"RISCV64Registers.SetReg (cyclomatic 38): RISCV64Registers.SetReg has cyclomatic complexity 38 (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":"pkg/proc/linutil/regs_riscv64_arch.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c10cbc0f09cb163b58516ebebd4d145b0b07150e639c8c76a1e18ab73e8598b"}},{"ruleId":"D1","level":"warning","message":{"text":"goversion.Parse (cyclomatic 37): goversion.Parse has cyclomatic complexity 37 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 1 belongs 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":"pkg/goversion/go_version.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a260bd7d18cc7187f47ddeee182e38e91d2f9230358a6c158eae9c31ec2ff8"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalScope.evalCallInjectionStart (cyclomatic 37): EvalScope.evalCallInjectionStart has cyclomatic complexity 37 (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":"pkg/proc/fncall.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6221fd46c2d65d34ede1291fe627b0ed3395584c13546ea84f01d2a70954d9b0"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.newVariable (cyclomatic 36): proc.newVariable has cyclomatic complexity 36 (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":"pkg/proc/variables.go"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f15ea31cf2fa6c437b3ea0aff2e762b0b2dd943c3ed75e6661866b01f8b39d"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryInfo.loadDebugInfoMaps (cyclomatic 36): BinaryInfo.loadDebugInfoMaps has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":2942}}}],"partialFingerprints":{"codehealthFindingId/v1":"686f9087d4a39fb584aadee6ea333b5e374e7f1b6dc9f41cfbe100b5ac3975d3"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbConn.parseStopPacket (cyclomatic 36): gdbConn.parseStopPacket has cyclomatic complexity 36 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 10 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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4cd076c3431a6d0108f59dde27e20ddd222a29c23cd0d81cc5d993ad6f13ec"}},{"ruleId":"D1","level":"warning","message":{"text":"mapIteratorSwiss.loadTypes (cyclomatic 36): mapIteratorSwiss.loadTypes has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/mapiter.go"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"967ffcce4c06f9be7f5c0e703258666dc47f33270d58bff1797648f074b732fc"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.setBreakpoint (cyclomatic 36): terminal.setBreakpoint has cyclomatic complexity 36 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 4 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":"pkg/terminal/command.go"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"660b118896acaa2ad76de4a8c39cf48b58704b02b2175cbd1e878c4e73cd3b14"}},{"ruleId":"D1","level":"warning","message":{"text":"Debugger.traverse (cyclomatic 36): Debugger.traverse has cyclomatic complexity 36 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 14 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":"service/debugger/debugger.go"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee34686019bf490174dba5c0bb80407367940bb876f620dd6dc68f9119daa3a1"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.funcCallStep (cyclomatic 35): proc.funcCallStep has cyclomatic complexity 35 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 2 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":"pkg/proc/fncall.go"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad5d105079c604c711503c61a896764a430240d5e60cbd9fa76a789e11782ac"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.breakpointConditionSatisfiable (cyclomatic 34): proc.breakpointConditionSatisfiable has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 8 of the 34 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1301, 1269, 1260). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/breakpoints.go"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c4631eff04858e86522c554ed544d49cc5e1d2579832cdb188c88500f55576"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbserial.LLDBLaunch (cyclomatic 34): gdbserial.LLDBLaunch has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55a0ecd685c0c33300ab19010b4ccd7f70cbf43c0612c1a9de7901ab77a333b"}},{"ruleId":"D1","level":"warning","message":{"text":"colorize.Print (cyclomatic 34): colorize.Print has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 9 of the 34 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 97, 69, 155). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/colorize/colorize.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9259974af3ee1d7baf5fe26ba5002f14f5b4f02a4d04b80dace81d478b3d92"}},{"ruleId":"D1","level":"warning","message":{"text":"debugger.guessSubstitutePath (cyclomatic 34): debugger.guessSubstitutePath has cyclomatic complexity 34 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 5 belong to 3 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":"service/debugger/debugger.go"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"147352c4560868b029e82225d5f688ac328ade12591d98a0dc0ecd8bb537ed55"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.FindFileLocation (cyclomatic 33): proc.FindFileLocation has cyclomatic complexity 33 (threshold 15). Of this number, 30 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":"pkg/proc/bininfo.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f997e17800c785d9652336c393fdde762b51e64c26ce5c0b001e01fa9a39d011"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.compareOp (cyclomatic 33): proc.compareOp 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":"pkg/proc/eval.go"},"region":{"startLine":2634}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f36bea913ee8124f8987a2a49553e411e001b2a73eae2283870512944dc6386"}},{"ruleId":"D1","level":"warning","message":{"text":"api.shortenTypeEx (cyclomatic 33): api.shortenTypeEx 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":"service/api/shorten_type.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1160549104869fcd8634eef609f339b5582d762f97c07c4dca3ed730c823f7e"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.arm64LinkerTrampolineTarget (cyclomatic 32): proc.arm64LinkerTrampolineTarget has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/arm64_disasm.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cacd59aaf093da732a6af09b89d891553137d359ceabeded0a1bbcc119f3be"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryInfo.loadDebugInfoMapsCompileUnit (cyclomatic 32): BinaryInfo.loadDebugInfoMapsCompileUnit 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":"pkg/proc/bininfo.go"},"region":{"startLine":3125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb41828256d93de37e49c494dc2e3c78782caa0e1b02b1f8bd0f93b8fcbb54e"}},{"ruleId":"D1","level":"warning","message":{"text":"mapIteratorClassic.nextBucket (cyclomatic 32): mapIteratorClassic.nextBucket 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":"pkg/proc/mapiter.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb99504c83781a49d5c0f189f5c0a3c7c428c7af4927968afb89d6f28fc2ce1e"}},{"ruleId":"D1","level":"warning","message":{"text":"Term.Run (cyclomatic 32): Term.Run has cyclomatic complexity 32 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 12 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":"pkg/terminal/terminal.go"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c676d5bd8539467bb73f863ac7ff0488470b8fce92f061143fa96cfda433750"}},{"ruleId":"D1","level":"warning","message":{"text":"cmds.execute (cyclomatic 31): cmds.execute has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/dlv/cmds/commands.go"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a233869d68a8ef1b7ce99361b257497d09a7f407c31c1873532be4ba3ed9dd"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.riscv64SwitchStack (cyclomatic 31): proc.riscv64SwitchStack has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/riscv64_arch.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c6c5dea19ba66e5c85ad34cfd4b3019be23e981e41e01df726784b62694375"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.amd64SwitchStack (cyclomatic 30): proc.amd64SwitchStack has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5667729e9603e4980593a45fa877f1ef7374a19ea6a728700f96860427468f"}},{"ruleId":"D1","level":"warning","message":{"text":"mapIteratorSwiss.next (cyclomatic 30): mapIteratorSwiss.next has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/mapiter.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f71c93ba0fb535c34757aa69098a6dee548401b95286fc18e44f247dfdcef81"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.printTracepoint (cyclomatic 30): terminal.printTracepoint has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":3004}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8613b72a513dffd0c55a4fb727875bfd28eafb73fafdcd1da7049a53779de0b"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.childrenToDAPVariables (cyclomatic 30): Session.childrenToDAPVariables has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":2875}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae488b951e673d38457e14442b1bb04987baf948dbfc7bc3c904ba937b184a9"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.typeCastCompatibleTypes (cyclomatic 29): proc.typeCastCompatibleTypes has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"902b6d961bc7f165fbbb25729c35683eb03861b38bb0ec3389cc958ffd71286c"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.loong64SwitchStack (cyclomatic 29): proc.loong64SwitchStack has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/loong64_arch.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65c89c897e4a9be48f2d96757ca17afa78002a56143fb3f6b8d922151615ca7"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.onThreadsRequest (cyclomatic 29): Session.onThreadsRequest has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 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":"service/dap/server.go"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba54624ad7c44e73b905b0e4ecc89fbf6beef679d812511c48385b59a01846a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Debugger.CreateBreakpoint (cyclomatic 29): Debugger.CreateBreakpoint has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 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":"service/debugger/debugger.go"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6935c457cf6f9a46d38afc471fa8f7e9de03a3136ef720ce81bcd6eef590229"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.ppc64leSwitchStack (cyclomatic 28): proc.ppc64leSwitchStack 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":"pkg/proc/ppc64le_arch.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"192005d201cd66e1790ad8304f35347e0b344d7eeb41841db619dd006a3977ce"}},{"ruleId":"D1","level":"warning","message":{"text":"minidump.Open (cyclomatic 28): minidump.Open 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":"pkg/proc/core/minidump/minidump.go"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d6dda3631cd617e659d90f806838914bf803365b25017bf26685dc0a4daf2d"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.parseG (cyclomatic 28): Variable.parseG has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"pkg/proc/variables.go"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25b447bceaf776179e5f2fce0d3bd47c84dc8862303a0fda76030f2dab9ba6b"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryInfo.openSeparateDebugInfo (cyclomatic 27): BinaryInfo.openSeparateDebugInfo has cyclomatic complexity 27 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 5 belong to 2 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":"pkg/proc/bininfo.go"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adebded47c286c681305ffea06406d4eea9e3087f93b35cf34e0e5a158ec2b8"}},{"ruleId":"D1","level":"warning","message":{"text":"BreakpointState.checkCond (cyclomatic 27): BreakpointState.checkCond has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/breakpoints.go"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6692dd6856f7908f057173ae1135dc12499dd2a25e174ba7a9d33fd3c1902802"}},{"ruleId":"D1","level":"warning","message":{"text":"core.readNote (cyclomatic 27): core.readNote has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/core/linux_core.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb68c6b4c5b3349e4835417c5f10ac3ad8d943e4b602471f34ce811a3577b80"}},{"ruleId":"D1","level":"warning","message":{"text":"AMD64Registers.SetReg (cyclomatic 27): AMD64Registers.SetReg has cyclomatic complexity 27 (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":"pkg/proc/fbsdutil/regs.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b3cc44114a56fb4c17d9446b2afe4039d4b81128bf8e3cbdef9a067af803ee"}},{"ruleId":"D1","level":"warning","message":{"text":"AMD64Registers.SetReg (cyclomatic 27): AMD64Registers.SetReg has cyclomatic complexity 27 (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":"pkg/proc/linutil/regs_amd64_arch.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"09129d6b53ecfcc6a3d7fa0736f3f2a50beedc3fe2720704ab4d88d1b62e0c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"stackIterator.Next (cyclomatic 27): stackIterator.Next has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stack.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5c684b0d1f5d140d73f59da61369b2f7a917d4b29b3309eb7003f6aa11cf1c"}},{"ruleId":"D1","level":"warning","message":{"text":"Target.Dump (cyclomatic 27): Target.Dump has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 4 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":"pkg/proc/dump.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ab0b716a740e6992c232e16a64092e8709a5c60cdfb044a4c9add2eb4385c9"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.breakpoints (cyclomatic 27): terminal.breakpoints has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs 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":"pkg/terminal/command.go"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d97488403e77d22badb15cf2de3fb0335b30be172341e6802be0a6c4392084a"}},{"ruleId":"D1","level":"warning","message":{"text":"formReader.next (cyclomatic 26): formReader.next has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/line/parse_util.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b65c02c764619cdb3d59ef381701dc2f9bd88ca5e04d3981632750002a9e2a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Target.handleHardcodedBreakpoints (cyclomatic 26): Target.handleHardcodedBreakpoints has cyclomatic complexity 26 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 7 belong to 2 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":"pkg/proc/target_exec.go"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"305febb3aeb895fe5e52934b8d4daff18b1d59af0ee86f1945281d4c283c4d9e"}},{"ruleId":"D1","level":"warning","message":{"text":"starbind.unmarshalStarlarkValueIntl (cyclomatic 26): starbind.unmarshalStarlarkValueIntl has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 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":"pkg/terminal/starbind/conv.go"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aed1e5bfd8438f18fb5b040500fa15cbf1ca9fe3b7b5ab1c4e61f042e304b8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.onExceptionInfoRequest (cyclomatic 26): Session.onExceptionInfoRequest has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":4134}}}],"partialFingerprints":{"codehealthFindingId/v1":"330af70f77558b348c6676d9f652cb83b9560fa9b2c74593b9177abdf2a234a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.runUntilStopAndNotify (cyclomatic 26): Session.runUntilStopAndNotify has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":4437}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f359282bcec2c81f6de6ff971ef5bd4ed8f21fe1acbf9e91e7cc3b20133faa"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.stepIntoCoroutineMaybe (cyclomatic 25): proc.stepIntoCoroutineMaybe 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":"pkg/proc/target_exec.go"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"9191ea359eea339fce1b9b65bc673e91c75e9ce01d96812509753df9991b9f36"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalScope.evalBinary (cyclomatic 25): EvalScope.evalBinary 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":"pkg/proc/eval.go"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ad496e7b716118125286b84e2500523e4911f3274cadd3c11a69e887c480a4"}},{"ruleId":"D1","level":"warning","message":{"text":"stackIterator.readSigtrampgoContext (cyclomatic 25): stackIterator.readSigtrampgoContext has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. 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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d0590e5d2b95c06012ddfe11f5ee7a46bd5d27e1d32d0f8b3c54ac674a2012"}},{"ruleId":"D1","level":"warning","message":{"text":"AMD64CONTEXT.SetReg (cyclomatic 25): AMD64CONTEXT.SetReg has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"pkg/proc/winutil/regs_amd64_arch.go"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac6eaae98810c991203ffe807afff023a6e0fedcc57cefcc08b6ecb469ef289"}},{"ruleId":"D1","level":"warning","message":{"text":"Env.interfaceToStarlarkValue (cyclomatic 25): Env.interfaceToStarlarkValue has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"pkg/terminal/starbind/conv.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb5aa6d95c106cc4457097ae12eee6a4bd02a6d919241d422fcd541eae66bf9"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.skipAutogeneratedWrappersIn (cyclomatic 24): proc.skipAutogeneratedWrappersIn has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/target_exec.go"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf3051327b1fc01ad6ba70cc50775ee60422a016ee5aad10506310bc4872737"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryInfo.macOSDebugFrameBugWorkaround (cyclomatic 24): BinaryInfo.macOSDebugFrameBugWorkaround has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb9fbd723f5aafeab8e5c2cc0d4d6ca42afd1fd4ad1a4aeb579e7ac12cb83f3"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalScope.Locals (cyclomatic 24): EvalScope.Locals has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 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":"pkg/proc/eval.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adec09581884ebee14857c6af05b4822c6aa46f48825d31710914a454686c63"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbProcess.ContinueOnce (cyclomatic 24): gdbProcess.ContinueOnce has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f69854b97461c4a866cdb8b0794b2bb54592e19581c04cb758ad8d0862667db"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbThread.reloadRegisters (cyclomatic 24): gdbThread.reloadRegisters has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec448f3697138be0f74fcc645b3efdc94021d5ef926da66865ba160868feff85"}},{"ruleId":"D1","level":"warning","message":{"text":"Target.SetWatchpoint (cyclomatic 24): Target.SetWatchpoint has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/breakpoints.go"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"80979dd96533f011a29786fe8217ef5338aa723db148e363313ae0be0f098576"}},{"ruleId":"D1","level":"warning","message":{"text":"Target.setBreakpointInternal (cyclomatic 24): Target.setBreakpointInternal has cyclomatic complexity 24 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 11 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":"pkg/proc/breakpoints.go"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c4eafa4faf27beec85ffd9452fa93ca0b0b6a8325d1f5276655dbf96c2e4e9"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.i386SwitchStack (cyclomatic 23): proc.i386SwitchStack has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/i386_arch.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c11fdc4bc55637216f8aa53eb3bbf9cbfd2fe6ddb6410bac627429d5006d686"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.setStepIntoNewProcBreakpoint (cyclomatic 23): proc.setStepIntoNewProcBreakpoint has cyclomatic complexity 23 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 10 belong to one function literal inside it that branches. 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":"pkg/proc/target_exec.go"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6484fc7bf287c497c213fbc672135cb10b4b487105c674020bc807385c4a5277"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbRegisters.Slice (cyclomatic 23): gdbRegisters.Slice has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa6159c98ba1458048d65300789cc4dbabf83dbf7c515dde37d323cec12d0fa"}},{"ruleId":"D1","level":"warning","message":{"text":"native.stop1 (cyclomatic 23): native.stop1 has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/proc_linux.go"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc86f7614949070220cbce07b75e19336c66af8120969285e1c9035484556fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.isType (cyclomatic 23): Variable.isType has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":2795}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ddaeeb492d7466c456b54b65b412d6fd344e8f63f38a96e10e7537a97a09ed"}},{"ruleId":"D1","level":"warning","message":{"text":"starbind.New (cyclomatic 23): starbind.New has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 164, 85, 105, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/starbind/starlark.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9db2289a01e87944957cb5ae69b26f24adb62a16a5f24578f61d12b34e1349b"}},{"ruleId":"D1","level":"warning","message":{"text":"Env.variableValueToStarlarkValue (cyclomatic 23): Env.variableValueToStarlarkValue has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"pkg/terminal/starbind/conv.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb959218aef12679752388d1ca7c1e34345a744c5eb5e7510adaa873811b2f3"}},{"ruleId":"D1","level":"warning","message":{"text":"api.ParseGoroutineArgs (cyclomatic 23): api.ParseGoroutineArgs has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/api/command.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3617575004205cf12c3bc8e531809aa12c8222a8b056008a9fc45d3f160c59"}},{"ruleId":"D1","level":"warning","message":{"text":"Debugger.collectBreakpointInformation (cyclomatic 23): Debugger.collectBreakpointInformation has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9ee5b0ff893a89dabbbbd3a970368159ccdafd35ab99ae839b4221686beed4"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbConn.recv (cyclomatic 22): gdbConn.recv 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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6e86d3c31e5ffff5221c8a8abd784f10696b78d202bf70561d531c37792834"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.structField (cyclomatic 22): Variable.structField 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":"pkg/proc/variables.go"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"170f436d6ee0b88fe3e17b79344a3d000a046ef06fc1bc2485461fd78aed2669"}},{"ruleId":"D1","level":"warning","message":{"text":"Term.handleExit (cyclomatic 22): Term.handleExit 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":"pkg/terminal/terminal.go"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b106a49fc45fae93d0c65f385e1f5e1c265382d5a97cb6ccaa6525bcff9443"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.onAttachRequest (cyclomatic 22): Session.onAttachRequest 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":"service/dap/server.go"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"112ab5a1c9f6d20b373c84202bc86ef5d077499e214b34648e677d4194c37280"}},{"ruleId":"D1","level":"warning","message":{"text":"op.PrettyPrint (cyclomatic 21): op.PrettyPrint 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":"pkg/dwarf/op/op.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d4fc3765f72730206b2a9ee044af0e984d4f1b3e5276874e0351eb06b76e84"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.negotiateType (cyclomatic 21): proc.negotiateType 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":"pkg/proc/eval.go"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"a581542ebca330c9b475dea611aadd808805e0728030b7444d4331032e70f64a"}},{"ruleId":"D1","level":"warning","message":{"text":"core.threadsFromDelveNotes (cyclomatic 21): core.threadsFromDelveNotes has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to 2 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":"pkg/proc/core/delve_core.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01bcc5d09900efdd237018b867303a4d52505cbb229edc804e38b93febff53d"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbProcess.handleThreadSignals (cyclomatic 21): gdbProcess.handleThreadSignals 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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4712783f5fc54377a00e37de8bbc7ac47f6dc5f0f5532e03796a333cb5f47b"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbThread.SetReg (cyclomatic 21): gdbThread.SetReg 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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d64c3385fbcf5cf32384913de66f57d1fa55660ab736466d381123e2bf1bf1"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbConn.step (cyclomatic 21): gdbConn.step 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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"be06e8c991f77e6e73b2b07cbc2848a118d62ac4dcf7b9f760eebf636d096ca4"}},{"ruleId":"D1","level":"warning","message":{"text":"stackIterator.advanceRegsDWARF (cyclomatic 21): stackIterator.advanceRegsDWARF 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":"pkg/proc/stack.go"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcef1a84b17fb46e9b50696dcfc8721396c6a21f04c3348ad139422b5eba52ee"}},{"ruleId":"D1","level":"warning","message":{"text":"Term.expandPrompt (cyclomatic 21): Term.expandPrompt has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to 2 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":"pkg/terminal/terminal.go"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2008afaf1bc2ad3b6880a1e107bb3ebf0c30687836fb0cc02b8577c650281c1"}},{"ruleId":"D1","level":"warning","message":{"text":"api.ParseExamineMemoryArg (cyclomatic 21): api.ParseExamineMemoryArg has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 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":"service/api/command.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0f14124acde8cf8a317e6fbf4ddf1d01fe43c296b6e769c21fc5c29f86c364"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.targetCmd (cyclomatic 21): Session.targetCmd 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":"service/dap/command.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68a1f300066876cea6479d2d4515562a9858a995bc2d8836d2e54e3984e36a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.onEvaluateRequest (cyclomatic 21): Session.onEvaluateRequest 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":"service/dap/server.go"},"region":{"startLine":3309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece6be3c7e4ea19c632db6fa8829f53ef4b7d2049b69ff851a39d2ffc730eff0"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalScope.setValue (cyclomatic 20): EvalScope.setValue 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":"pkg/proc/eval.go"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d899cbf2117714713082969575d2a5fd5111e2314ebd389a58913a6ce4a94e"}},{"ruleId":"D1","level":"warning","message":{"text":"processGroup.ContinueOnce (cyclomatic 20): processGroup.ContinueOnce 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":"pkg/proc/native/proc.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2467c9bb3a817e9407b8770cc8ee665c68c9d3f9b6ccc64fddcead2df92dd479"}},{"ruleId":"D1","level":"warning","message":{"text":"TargetGroup.addTarget (cyclomatic 20): TargetGroup.addTarget 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":"pkg/proc/target_group.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bacc1076b94e5a2cf8ea1990ebbf1ec5cd07abacf76dd856a99c39049164252"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.mapIterator (cyclomatic 20): Variable.mapIterator has cyclomatic complexity 20 (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":"pkg/proc/mapiter.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f55e572d37479e1669e7a6a756bc024e020ea821ede608bbcb4542669e0db1"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.parseStackArgs (cyclomatic 20): terminal.parseStackArgs has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 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":"pkg/terminal/command.go"},"region":{"startLine":2495}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c007e9c5efc3336d830da012a73339920b33f627f8d60a9e664150100d11540"}},{"ruleId":"D1","level":"warning","message":{"text":"api.PrintStack (cyclomatic 20): api.PrintStack has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 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":"service/api/prettyprint.go"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e85c914776dff7123cdc5c0b34e461a5acbaeb0c0014cf91a7b10e3d7b7723"}},{"ruleId":"D1","level":"warning","message":{"text":"cmds.New (cyclomatic 19): cmds.New has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 181, 525, 188, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/dlv/cmds/commands.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f772747dcaeba900192d369efc058b9e56688294007833e64105acb0ce360eba"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.loadBinaryInfoElf (cyclomatic 19): proc.loadBinaryInfoElf 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":"pkg/proc/bininfo.go"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16674163227759d55d44c992b9a3101fdccf4657f920f6a5833fe2e16bb742a"}},{"ruleId":"D1","level":"warning","message":{"text":"EBPFContext.handleParamEvent (cyclomatic 19): EBPFContext.handleParamEvent has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/internal/ebpf/helpers.go"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfba459d813f8efa7795a2b2cf8a5477c8e7b98d2afda5853be67790939dd604"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeProcess.initialize (cyclomatic 19): nativeProcess.initialize has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/proc.go"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c48ee7a048e7cfe8d3e3c75cb2ecdd028815f5e3db9ef04562345fd1943f4e9"}},{"ruleId":"D1","level":"warning","message":{"text":"stackIterator.advanceRegs (cyclomatic 19): stackIterator.advanceRegs 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":"pkg/proc/stack.go"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"25027ba119011756be7ff45848bfc2bd11f221a619a6233ffd0e82daa1b296e2"}},{"ruleId":"D1","level":"warning","message":{"text":"Target.setStackWatchBreakpoints (cyclomatic 19): Target.setStackWatchBreakpoints 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":"pkg/proc/stackwatch.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a49ea8e126d7793d0537580181ac5c4f0097ec9bd6a5ef5ea541418356ab2df"}},{"ruleId":"D1","level":"warning","message":{"text":"G.Labels (cyclomatic 19): G.Labels 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":"pkg/proc/variables.go"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d384e2dfc98b2a602ca1bf0d16d05c547b48c849718974581c610cdbb6361d7b"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.printcontext (cyclomatic 19): terminal.printcontext 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":"pkg/terminal/command.go"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"105cddb76a1d1795b4d26edfca314d0af9edc816fc7877239c5c2c02d5b503ab"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.target (cyclomatic 19): terminal.target 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":"pkg/terminal/command.go"},"region":{"startLine":3573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ff47da29918ee8828d53be76375b2e541c3640add0925a32581f369e0f4b36"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerImpl.serveJSONCodec (cyclomatic 19): ServerImpl.serveJSONCodec has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 3 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":"service/rpccommon/server.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88e87289e4aceb590772dffef60b4c96af0de4f1d755880c1d46a35834d8345"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalLocationSpec.Find (cyclomatic 18): NormalLocationSpec.Find 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":"pkg/locspec/locations.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"906c12d00d06236424c48aabdfc531eec98357d63a75c63fa7f21ac4f2d5790f"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.GoroutinesInfo (cyclomatic 18): proc.GoroutinesInfo 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":"pkg/proc/variables.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6cdff009e59ea8469e582a11bfe5f404d1faffb3e7b24ffb52d58320a9fac3"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalScope.evalJump (cyclomatic 18): EvalScope.evalJump 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":"pkg/proc/eval.go"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb1e51d458b185bb8ea247cbb3cb816c6145167fe1d1df27d912e228501ce31"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalScope.evalIndex (cyclomatic 18): EvalScope.evalIndex 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":"pkg/proc/eval.go"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c6e8efe63a90645881b7ecd2f70d7d938d4d087c573d8191a0b81837519e6a"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbConn.handshake (cyclomatic 18): gdbConn.handshake 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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf9e7b60a0835952a7adb8c90318e5898bf07e51be39128db6d3edeceec0b90"}},{"ruleId":"D1","level":"warning","message":{"text":"stackIterator.tryFramePointerUnwind (cyclomatic 18): stackIterator.tryFramePointerUnwind 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":"pkg/proc/stack.go"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"4256626bafa7edc1438ebe35f4b9eabf57a6859ae1fd6f396833716c334647b4"}},{"ruleId":"D1","level":"warning","message":{"text":"TargetGroup.StepOut (cyclomatic 18): TargetGroup.StepOut has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"pkg/proc/target_exec.go"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a04a8162405db7479d3c71b1281a2caabe201b0c038aebb4132508144db331"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.reslice (cyclomatic 18): Variable.reslice 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":"pkg/proc/eval.go"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"25141d33eb2eabef1b09f01c01fb89f106b88d478babe6becc345639d632533d"}},{"ruleId":"D1","level":"warning","message":{"text":"Debugger.Restart (cyclomatic 18): Debugger.Restart 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":"service/debugger/debugger.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a708ecc239d6ef45ad01688d9c489184bf833bba3e0a3586e1d3b3fbfee7a7"}},{"ruleId":"D1","level":"warning","message":{"text":"config.ConfigureSetSimple (cyclomatic 17): config.ConfigureSetSimple has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 73). 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":"pkg/config/split.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98e493c9644594a695dd4f4978fb0f6862488edbaf8f028852af304a0ad627f"}},{"ruleId":"D1","level":"warning","message":{"text":"line.parseFileEntries5 (cyclomatic 17): line.parseFileEntries5 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":"pkg/dwarf/line/line_parser.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e57ec445413e60fac5b32ec1f6fe925122ed6930484ff921439a473026c5e4"}},{"ruleId":"D1","level":"warning","message":{"text":"logflags.Setup (cyclomatic 17): logflags.Setup 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":"pkg/logflags/logflags.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8910d772022c44225fd52b60686513769b510b42c086899faa4fc9a5e5a0fb4f"}},{"ruleId":"D1","level":"warning","message":{"text":"Function.parse (cyclomatic 17): Function.parse 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":"pkg/proc/bininfo.go"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d2ae673da345676fc7fc68018c06e3032f4391ec77ae7a53fc3d639b243a33"}},{"ruleId":"D1","level":"warning","message":{"text":"core.readLinuxOrPlatformIndependentCore (cyclomatic 17): core.readLinuxOrPlatformIndependentCore 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":"pkg/proc/core/linux_core.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"124c0430cede7dbaaa831799fa9c8109ee141c87367fcac790b6b971c8551484"}},{"ruleId":"D1","level":"warning","message":{"text":"SplicedMemory.Add (cyclomatic 17): SplicedMemory.Add has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"pkg/proc/core/core.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f960a68c17c5b4c4926466da30f752761b54a4d0fae3ffa8c099568f663874e"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalScope.ChanGoroutines (cyclomatic 17): EvalScope.ChanGoroutines has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 280, 259, 270). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6775ba4e36e07cbd1a1d878ed661f9da62b2a680ae04a7fb42596615e1aad028"}},{"ruleId":"D1","level":"warning","message":{"text":"compileCtx.compileTypeCastOrFuncCall (cyclomatic 17): compileCtx.compileTypeCastOrFuncCall has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs 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":"pkg/proc/evalop/evalcompile.go"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1be1e3ee7cf3adc38fa897e830ceca374ec8f1ca8cfaafc8e216520bf4f68df"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbConn.readRegisterInfo (cyclomatic 17): gdbConn.readRegisterInfo 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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"66917f2370ecbd8732e5159451b725512bf05761fac7a6e3252ea7f854bfe894"}},{"ruleId":"D1","level":"warning","message":{"text":"stackIterator.newStackframe (cyclomatic 17): stackIterator.newStackframe 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":"pkg/proc/stack.go"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b376cb987f0dab5f0a057a37ded2c5efa8f286daebe42a7a2526f51085907d"}},{"ruleId":"D1","level":"warning","message":{"text":"stackIterator.executeFrameRegRule (cyclomatic 17): stackIterator.executeFrameRegRule 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":"pkg/proc/stack.go"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc99950fd63540de8220dc1697b5159f7e4ad737e793fb458a95e8ddb1e94f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Target.shouldDumpMemory (cyclomatic 17): Target.shouldDumpMemory has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/dump.go"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"0413d4a7acbf58bbc97f98c8f6c5c9041ef123ac3fa4a46987770a900bbf1e3c"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.registerVariableTypeConv (cyclomatic 17): Variable.registerVariableTypeConv 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":"pkg/proc/variables.go"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"17661461ca1877edab5a740080c2c46a946a3437bbbf20943cc62161c5de6d09"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.getLocation (cyclomatic 17): terminal.getLocation 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":"pkg/terminal/command.go"},"region":{"startLine":2567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ebcacaf57d51c636cd1c18adbf8400d0343e4a1d173f501dc88a700636d2fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.writeBasicType (cyclomatic 17): Variable.writeBasicType 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":"service/api/prettyprint.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"522ca69030026f5bd8acd46aab66eb854124ce772c9c2139c835630a0fb6be52"}},{"ruleId":"D1","level":"warning","message":{"text":"frame.parseCIE (cyclomatic 16): frame.parseCIE 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":"pkg/dwarf/frame/parser.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45b08b970818dea50bac800403315388850902e54e47cc6b4be6d23ddb7ee59"}},{"ruleId":"D1","level":"warning","message":{"text":"StateMachine.PCToLine (cyclomatic 16): StateMachine.PCToLine 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":"pkg/dwarf/line/state_machine.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9650ea41f8aac8f13a36aa352ba1cd434c14991638e41af3c6f758123aa1a167"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.loadBinaryInfoMacho (cyclomatic 16): proc.loadBinaryInfoMacho 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":"pkg/proc/bininfo.go"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"971764599ab6b7166733e2e64ede2ea9bff6e851c613b4f6d9c4c100163e07a3"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.allPointers (cyclomatic 16): proc.allPointers 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":"pkg/proc/fncall.go"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"4839cba80ceae344f5bf0f4038c09ff5f366bbf241b25bbd0ea2cb2421604a23"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.resolveCallArgLOONG64 (cyclomatic 16): proc.resolveCallArgLOONG64 has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"pkg/proc/loong64_disasm.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e378c8c1ea1d4ac11d24eb4ea26b2fb35832eb12ecbaef75982b7e08e5961ca2"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.FindGoroutine (cyclomatic 16): proc.FindGoroutine 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":"pkg/proc/variables.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"6433de2c0ecbd1bff6682fd45589e8f68924ad7c8e79a41056ba21b6b12e0549"}},{"ruleId":"D1","level":"warning","message":{"text":"proc.resolveCallArgX86 (cyclomatic 16): proc.resolveCallArgX86 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":"pkg/proc/x86_disasm.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5b4e0a0e85a612a7e5fad91b6f49e21573d3d2e9ce00a6159deb584e89cc0d"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalScope.findGlobalInternal (cyclomatic 16): EvalScope.findGlobalInternal 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":"pkg/proc/eval.go"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d8c84529dcf573859c53c88258084f8e3fbaa75193a16cf38aa975d2f84bac"}},{"ruleId":"D1","level":"warning","message":{"text":"gdbProcess.updateThreadList (cyclomatic 16): gdbProcess.updateThreadList 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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ea349387f2b78a367f6499a6a5f067e291d68bd62ce4cc70f57155c1c941b3"}},{"ruleId":"D1","level":"warning","message":{"text":"nativeProcess.addThread (cyclomatic 16): nativeProcess.addThread 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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75f068245c970b96230a66aac429025236955a56d5389c9a842ec4111959b15"}},{"ruleId":"D1","level":"warning","message":{"text":"TargetGroup.enableBreakpoint (cyclomatic 16): TargetGroup.enableBreakpoint 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":"pkg/proc/target_group.go"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c24128843f61871215701dc89084331754e01d684bc5daff2657bb497e624fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.loadMap (cyclomatic 16): Variable.loadMap 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":"pkg/proc/variables.go"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e79f3e09cd68c1692e7a8a253cfa97926770ff241b9813562e882732e65fc34"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.formatTime (cyclomatic 16): Variable.formatTime 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":"pkg/proc/variables.go"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a434049106d724e49aaab22de18157a4c256d23146e9e6bd8db72b4637110dd4"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.whatisCommand (cyclomatic 16): terminal.whatisCommand 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":"pkg/terminal/command.go"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89b00d0303d8b1108c458dc0c5d9eccf58af935121bcd60bfed7df5d31ca403"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.printcontextThread (cyclomatic 16): terminal.printcontextThread 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":"pkg/terminal/command.go"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"002cafec4e316c6a960747e40ebb47174e22c9b0f8ea32fd9d83e48e186ba796"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.New (cyclomatic 16): terminal.New has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 146). 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":"pkg/terminal/terminal.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"703906d61051f05048bf469da6421a7e24ac328746f30a821cf203eba707578f"}},{"ruleId":"D1","level":"warning","message":{"text":"Term.sigintGuard (cyclomatic 16): Term.sigintGuard 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":"pkg/terminal/terminal.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9efbaa078bfec815e1458e807d40b60efdd5a642ba8a7ab88d489b4653b39a"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.onRestartRequest (cyclomatic 16): Session.onRestartRequest 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":"service/dap/server.go"},"region":{"startLine":3508}}}],"partialFingerprints":{"codehealthFindingId/v1":"343b082e4c7efba9894ed296f00c05f69a35eee9b7bdb9efc105c2078023f7e8"}},{"ruleId":"D1","level":"warning","message":{"text":"rpc2.MakeGuessSusbtitutePathIn (cyclomatic 16): rpc2.MakeGuessSusbtitutePathIn 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":"service/rpc2/client.go"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc70f44404912544d599fe468840ab92f7ddfbcc11704f3b658112993a9f5d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroup.Continue (cognitive 171): TargetGroup.Continue has cognitive complexity 171 (threshold 15). Drivers by points: if/else 43 (129 pts), loops 13 (31 pts), boolean chains 6, match/switch 2 (5 pts) (nesting depth added 107). Of this number, 170 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"pkg/proc/target_exec.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1a67a08ec355ffefd7991f8962c09933635c60955bbab95bbfc9b35e7080ce"}},{"ruleId":"D2","level":"warning","message":{"text":"godwarf.readType (cognitive 164): godwarf.readType has cognitive complexity 164 (threshold 15). Drivers by points: if/else 42 (105 pts), match/switch 13 (33 pts), jumps 12, loops 6 (11 pts), boolean chains 3 (nesting depth added 88). Of this number, 146 points are the body\u0027s own statements and 18 belong to 3 function literals inside it that branch. This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/godwarf/type.go"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed167e2d494946a576e20f8cca907abb57664e618cb482e888b0d8df311dbfa"}},{"ruleId":"D2","level":"warning","message":{"text":"native.trapWaitInternal (cognitive 147): native.trapWaitInternal has cognitive complexity 147 (threshold 15). Drivers by points: if/else 45 (134 pts), boolean chains 7, loops 2 (6 pts) (nesting depth added 93). 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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84f5785f2f0b631a0781ff1aac8f08eeba3fe090d30a033ccab0213bcccadee"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.next (cognitive 123): proc.next has cognitive complexity 123 (threshold 15). Drivers by points: if/else 51 (97 pts), boolean chains 15, loops 5 (11 pts) (nesting depth added 52). Of this number, 122 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":"pkg/proc/target_exec.go"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f43220513c36bb3936c9300f93df690d4c0476076f6a322910e9d4fc00b0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"cmds.traceCmd (cognitive 122): cmds.traceCmd has cognitive complexity 122 (threshold 15). Drivers by points: if/else 39 (92 pts), loops 6 (21 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 70). None of this is in the body itself: all 122 points belong to one function literal inside it that branches (line 673). 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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f5ee9d4f0664a5d1543ddc36bb690905c976f49457721e05d0acea915384de"}},{"ruleId":"D2","level":"warning","message":{"text":"processGroup.waitForDebugEvent (cognitive 109): processGroup.waitForDebugEvent has cognitive complexity 109 (threshold 15). Drivers by points: if/else 27 (95 pts), loops 2 (7 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 76). To reduce it, split the body into named stages: move each independent 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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4967250ad2a743d662c5b81ea288b69fe998742872b9aa3e32d50f229fd1d534"}},{"ruleId":"D2","level":"warning","message":{"text":"compileCtx.compileAST (cognitive 101): compileCtx.compileAST has cognitive complexity 101 (threshold 15). Drivers by points: if/else 19 (67 pts), match/switch 9 (23 pts), boolean chains 8, loops 1 (3 pts) (nesting depth added 64). 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":"pkg/proc/evalop/evalcompile.go"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8200417de3f900fdf7b00522f8d08623e170daea2612d39dbf0ae4c0ab02e3df"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.findStructMemberOrMethod (cognitive 99): Variable.findStructMemberOrMethod has cognitive complexity 99 (threshold 15). Drivers by points: if/else 29 (85 pts), loops 3 (6 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent 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":"pkg/proc/eval.go"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c28341bafef5a49a544d6560611bb4dbb45219b66c76d23dcc04653d6b60dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger.traverse (cognitive 98): Debugger.traverse has cognitive complexity 98 (threshold 15). Drivers by points: if/else 23 (78 pts), loops 5 (15 pts), boolean chains 5 (nesting depth added 65). Of this number, 40 points are the body\u0027s own statements and 58 belong 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":"service/debugger/debugger.go"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b71cc06b94d88a4819323991f626d905f90faae0a088fe4a50a8ff3fa91b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.simpleLocals (cognitive 94): EvalScope.simpleLocals has cognitive complexity 94 (threshold 15). Drivers by points: if/else 29 (70 pts), boolean chains 16, loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 45). 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":"pkg/proc/eval.go"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3bf124e7b92aed9b1d50e2951708776fd4bc9f786ab9c679d9d877d0b430d7"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.evalTypeCast (cognitive 93): EvalScope.evalTypeCast has cognitive complexity 93 (threshold 15). Drivers by points: if/else 22 (56 pts), match/switch 10 (19 pts), loops 4 (14 pts), boolean chains 4 (nesting depth added 53). To reduce it, split the body into named stages: move each independent 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":"pkg/proc/eval.go"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b98d501928ef42e126d0deebd396ed0775baeea909b6fbdb4957f1b4c723d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.onLaunchRequest (cognitive 84): Session.onLaunchRequest has cognitive complexity 84 (threshold 15). Drivers by points: if/else 43 (71 pts), loops 4 (6 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 31). Of this number, 66 points are the body\u0027s own statements and 18 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"service/dap/server.go"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f392af8d1285daf7c5650b218894c8f49d3303d26a6b46581c4907bcce9301"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.loadDebugInfoMaps (cognitive 83): BinaryInfo.loadDebugInfoMaps has cognitive complexity 83 (threshold 15). Drivers by points: if/else 25 (69 pts), loops 4 (8 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 49). 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":"pkg/proc/bininfo.go"},"region":{"startLine":2942}}}],"partialFingerprints":{"codehealthFindingId/v1":"2096de4fa330b2c9e890278449fa688c3955989741c1bf79a641c9399cbeb99b"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.onThreadsRequest (cognitive 81): Session.onThreadsRequest has cognitive complexity 81 (threshold 15). Drivers by points: if/else 24 (62 pts), loops 4 (14 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 49). Of this number, 74 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"service/dap/server.go"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2979b4ea700c9e61ba5296b32ac02f052f823c4bbfae0fdaaa6dc7193a01fd"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.loadDebugInfoMapsCompileUnit (cognitive 74): BinaryInfo.loadDebugInfoMapsCompileUnit has cognitive complexity 74 (threshold 15). Drivers by points: if/else 22 (68 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (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":"pkg/proc/bininfo.go"},"region":{"startLine":3125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead0c4fba295592c719ac0f92021aa6e2638a866b701fab16e51a487af5b289a"}},{"ruleId":"D2","level":"warning","message":{"text":"G.Labels (cognitive 74): G.Labels has cognitive complexity 74 (threshold 15). Drivers by points: if/else 12 (57 pts), loops 2 (11 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 57). 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":"pkg/proc/variables.go"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce174eb5a745b1ad5a8cdb95bc3165fd2de896a29714cd5f8a892095a3e85760"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.printTracepoint (cognitive 74): terminal.printTracepoint has cognitive complexity 74 (threshold 15). Drivers by points: if/else 24 (60 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 42). 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":"pkg/terminal/command.go"},"region":{"startLine":3004}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7c66395262f55693e7e3568fdaaf6490e973a7d4dfcae52621b12c2967ff79"}},{"ruleId":"D2","level":"warning","message":{"text":"mapIteratorSwiss.next (cognitive 70): mapIteratorSwiss.next has cognitive complexity 70 (threshold 15). Drivers by points: if/else 19 (57 pts), boolean chains 7, loops 3 (6 pts) (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":"pkg/proc/mapiter.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"119ca448b244eed9431c049685330d156689e7b8e2809eedea1c0715893240d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger.Command (cognitive 70): Debugger.Command has cognitive complexity 70 (threshold 15). Drivers by points: if/else 30 (60 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"175911def8c37f22aceb70cc6a56ae1bbb5f0bf221e674235b39a1744a52f883"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.convertVariableWithOpts (cognitive 68): Session.convertVariableWithOpts has cognitive complexity 68 (threshold 15). Drivers by points: if/else 30 (61 pts), boolean chains 6, match/switch 1 (nesting depth added 31). Of this number, 65 points are the body\u0027s own statements and 3 belong to 2 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":"service/dap/server.go"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a37b0189131d2d69d4fddd535a3482f4846a1e4edb4a11b72c1d0ebf35375b6"}},{"ruleId":"D2","level":"warning","message":{"text":"debugger.guessSubstitutePath (cognitive 68): debugger.guessSubstitutePath has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 10 (16 pts), boolean chains 6 (nesting depth added 35). Of this number, 61 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"service/debugger/debugger.go"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fc04a0a0c78fed70bfb8c7ba11ec6e720624a01112dadc006ddab4653b3bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.arm64SwitchStack (cognitive 67): proc.arm64SwitchStack has cognitive complexity 67 (threshold 15). Drivers by points: if/else 25 (57 pts), boolean chains 8, match/switch 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/arm64_arch.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e9f7a86772359bddce09f5fd3420b3756021326bc82ebe19130c25801f9432"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.breakpoints (cognitive 67): terminal.breakpoints has cognitive complexity 67 (threshold 15). Drivers by points: if/else 24 (58 pts), loops 3 (5 pts), match/switch 1 (3 pts), jumps 1 (nesting depth added 38). Of this number, 65 points are the body\u0027s own statements and 2 belong 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":"pkg/terminal/command.go"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ded065fdf711cb72f3055f942d21216c1d0942f4cfe9a98a7336ea7c2d0b53"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.writeTo (cognitive 67): Variable.writeTo has cognitive complexity 67 (threshold 15). Drivers by points: if/else 32 (56 pts), boolean chains 6, loops 1 (4 pts), match/switch 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/api/prettyprint.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f97dbc19d41277cc386ab8be12e801748b64f30d04c60a2ab73843e9eb651d"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.loadValueInternal (cognitive 64): Variable.loadValueInternal has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (50 pts), boolean chains 6, match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/variables.go"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c52297cf4ec4bb77c4d800774753f4689285687af1345ac08dae66d9dad644"}},{"ruleId":"D2","level":"warning","message":{"text":"Term.Run (cognitive 63): Term.Run has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (44 pts), loops 7 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 33). Of this number, 37 points are the body\u0027s own statements and 26 belong 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":"pkg/terminal/terminal.go"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1d73c7ca3847edc553d6805b06a28452788f5cea6b06dc85ae47b2c748ac61"}},{"ruleId":"D2","level":"warning","message":{"text":"goversion.Parse (cognitive 61): goversion.Parse has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (42 pts), boolean chains 7, loops 2 (7 pts), match/switch 2 (5 pts) (nesting depth added 33). Of this number, 58 points are the body\u0027s own statements and 3 belong 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":"pkg/goversion/go_version.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83bb91e6eda0f98b734a1350f66cac15e9a20e836fe5942baa84c2a972c29c9"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbThread.reloadRegisters (cognitive 60): gdbThread.reloadRegisters has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (35 pts), loops 5 (19 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee8f71163a756d6226a5f1eff97018b5615450e85be587abe501a87cb8c989f"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbConn.parseStopPacket (cognitive 60): gdbConn.parseStopPacket has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (42 pts), loops 3 (8 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 36). Of this number, 44 points are the body\u0027s own statements and 16 belong to one function literal inside it that branches. 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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"161c9935f397e57543f261cc0263c383e37069789f49a39ba7fb1b31927d14c8"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbserial.LLDBLaunch (cognitive 58): gdbserial.LLDBLaunch has cognitive complexity 58 (threshold 15). Drivers by points: if/else 26 (45 pts), loops 3 (9 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"946738433861363181fb59aa6545ec05c1c330b4709cd0f1479de18bc03114de"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.FindFileLocation (cognitive 57): proc.FindFileLocation has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 10 (18 pts), boolean chains 7 (nesting depth added 27). Of this number, 51 points are the body\u0027s own statements and 6 belong 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":"pkg/proc/bininfo.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed0da904fca1ccc5a364c904d72b9fc84c83b2568e678e66e3788325b68c450"}},{"ruleId":"D2","level":"warning","message":{"text":"evalStack.executeOp (cognitive 57): evalStack.executeOp has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (52 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 27). Of this number, 56 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":"pkg/proc/eval.go"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cbfb6f049a294b77cbefdcfb670ab5e7361abdad746b5b355871dd3a683cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.funcCallStep (cognitive 56): proc.funcCallStep has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (46 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (nesting depth added 26). Of this number, 51 points are the body\u0027s own statements and 5 belong 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":"pkg/proc/fncall.go"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4585f0c9c45a472125e690b0252f1595010dec28fe00193cace5f8be0865a34"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.childrenToDAPVariables (cognitive 56): Session.childrenToDAPVariables has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (37 pts), match/switch 3 (7 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 33). 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":"service/dap/server.go"},"region":{"startLine":2875}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58c9f04bda2fc8165c3818bf62bc2632ce5eee059652987775d0cb4b24e78b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger.CreateBreakpoint (cognitive 55): Debugger.CreateBreakpoint has cognitive complexity 55 (threshold 15). Drivers by points: if/else 22 (39 pts), loops 4 (13 pts), boolean chains 1, jumps 1, match/switch 1 (nesting depth added 26). Of this number, 52 points are the body\u0027s own statements and 3 belong 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":"service/debugger/debugger.go"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"84540db453bb4ffa3d9118ed20ccc3c31e8278bb4abda20cd2548cabb2d5dae0"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.setBreakpoint (cognitive 54): terminal.setBreakpoint has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (41 pts), loops 3 (6 pts), boolean chains 4, match/switch 3 (nesting depth added 21). Of this number, 47 points are the body\u0027s own statements and 7 belong 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":"pkg/terminal/command.go"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd577b521df4d34c2ed3063050f615b522e769350c8985836ba9ad3a325dcf81"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.skipAutogeneratedWrappersIn (cognitive 53): proc.skipAutogeneratedWrappersIn has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/target_exec.go"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c01f51e1c376005414ebf2d95fa2adabadd2e4b917a10981141486c0f1962ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Term.handleExit (cognitive 52): Term.handleExit has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (51 pts), boolean chains 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":"pkg/terminal/terminal.go"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6f03bbf704046264186fe5a15e869d54f76a4b9848939d3ebbdebbafef2438"}},{"ruleId":"D2","level":"warning","message":{"text":"core.threadsFromDelveNotes (cognitive 49): core.threadsFromDelveNotes has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 30). Of this number, 40 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"pkg/proc/core/delve_core.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad29b89179d1c16b43ef40467361549359e3ae6fa2175ca18691b22644f53596"}},{"ruleId":"D2","level":"warning","message":{"text":"mapIteratorSwiss.loadTypes (cognitive 49): mapIteratorSwiss.loadTypes has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 4 (12 pts), loops 4 (8 pts), boolean chains 5 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/mapiter.go"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ae3cc90cb7b10f546582e32d556835bab73cd2676b5d41309ed3bc8e735ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"native.stop1 (cognitive 49): native.stop1 has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 30). 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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"0054912e367fbb9de22e6452bc00bcf8911987ec56b37ea578368cbb1c9e17e3"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbConn.recv (cognitive 47): gdbConn.recv has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (43 pts), boolean chains 3, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ff91634065b20e2cffbf8fc9a8e4482439721c71926f151d1ed96dcb7e5a64"}},{"ruleId":"D2","level":"warning","message":{"text":"api.shortenTypeEx (cognitive 47): api.shortenTypeEx has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 4 (9 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 26). 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":"service/api/shorten_type.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf840b59d49317118c9cfa1a5c0aa2a20aefa2e11b86eac6a02c0f4230ef3ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.runUntilStopAndNotify (cognitive 45): Session.runUntilStopAndNotify has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":4437}}}],"partialFingerprints":{"codehealthFindingId/v1":"648c160ce154e5ec81a5d3ef82d66200fb18a8231f37468c4af6f9ed9f0be1d6"}},{"ruleId":"D2","level":"warning","message":{"text":"cmds.execute (cognitive 44): cmds.execute has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/dlv/cmds/commands.go"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c355ade58426a613b79eb8943a152e84b7ddd830c483ad896b28a25f6a157b"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.rangeFuncStackTrace (cognitive 44): proc.rangeFuncStackTrace has cognitive complexity 44 (threshold 15). Drivers by points: if/else 25 (35 pts), boolean chains 7, loops 1, match/switch 1 (nesting depth added 10). Most of this is not in the body itself: 6 of the 44 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1224, 1197, 1189). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stack.go"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0305b5ba14c8ec8124bdd008269c18276bcec8c61a9eedd22eac90f80544ff"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.openSeparateDebugInfo (cognitive 44): BinaryInfo.openSeparateDebugInfo has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (40 pts), boolean chains 3, loops 1 (nesting depth added 18). Of this number, 37 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"pkg/proc/bininfo.go"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d1fe20fa94760f088c0f753f2fa945bb4f493eaf168a39e8373ea2853230e0"}},{"ruleId":"D2","level":"warning","message":{"text":"colorize.Print (cognitive 44): colorize.Print has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (29 pts), loops 6 (10 pts), boolean chains 4, match/switch 1 (nesting depth added 13). Most of this is not in the body itself: 10 of the 44 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 97, 69, 155). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/colorize/colorize.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac63f05608b2ea6094416a984c899fd525faacfa32e9fc6e16498568da386f47"}},{"ruleId":"D2","level":"warning","message":{"text":"minidump.Open (cognitive 43): minidump.Open has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 4 (10 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/core/minidump/minidump.go"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15693e6fc1fc825aafe2ba2b1859552d2ab1832485d58c0159ed96e93285aee"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.targetCmd (cognitive 43): Session.targetCmd has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 25). 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":"service/dap/command.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3a806f362a7bdd0a0db163e9f78f09669dec93308a17b775a3aeebe6f3a871"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.evalCallInjectionStart (cognitive 42): EvalScope.evalCallInjectionStart has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/fncall.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac30b3c39b0b141986d6bd656e05dfa9f15b7fc62f277ab00c668fa9d123d09"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerImpl.serveJSONCodec (cognitive 42): ServerImpl.serveJSONCodec has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 2, loops 1 (nesting depth added 22). Of this number, 34 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"service/rpccommon/server.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd119a7014b41773671f29222292ad25e9399dc0750c7a17cb23b101c85f2f9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.parseG (cognitive 41): Variable.parseG has cognitive complexity 41 (threshold 15). Drivers by points: if/else 26 (33 pts), boolean chains 7, loops 1 (nesting depth added 7). Of this number, 39 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"pkg/proc/variables.go"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"2167c9bf332c8c37b63bec00a2e3b0351f37ad10bc9ffa95202c36e1e1d4c102"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.riscv64SwitchStack (cognitive 40): proc.riscv64SwitchStack has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 6, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/riscv64_arch.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"60160fc12e17ed1e75031cb2d1345b8ac87550969fd05085babcd19dc326a4d7"}},{"ruleId":"D2","level":"warning","message":{"text":"processGroup.ContinueOnce (cognitive 40): processGroup.ContinueOnce has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 5 (14 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/proc.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c169e0dc42b458f1043f049d84706c378addf8de37d9c0bdefceeecded413c8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.handleHardcodedBreakpoints (cognitive 40): Target.handleHardcodedBreakpoints has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 7, loops 2, match/switch 1 (2 pts) (nesting depth added 16). Of this number, 30 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"pkg/proc/target_exec.go"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"068c19afeff496ad9523f5b97c60917d9ec0377f76dc7c16c6c26dd620f824b8"}},{"ruleId":"D2","level":"warning","message":{"text":"mapIteratorClassic.nextBucket (cognitive 39): mapIteratorClassic.nextBucket has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/mapiter.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5c711e3ee5f103be1f51fa74bd972704657c455a5f217f981923279cfcccbc"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.amd64SwitchStack (cognitive 38): proc.amd64SwitchStack has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 7, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9b66060b3b0980343502ec96e5e7f7da1f7fbc6d5d3949f52809716ead5719"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbProcess.ContinueOnce (cognitive 38): gdbProcess.ContinueOnce has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 3 (4 pts), boolean chains 2, jumps 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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce260ffcef247e7bf85ec90d55c17a67ee71c580dfae65db425fc7ffa8428cc"}},{"ruleId":"D2","level":"warning","message":{"text":"stackIterator.advanceRegsDWARF (cognitive 38): stackIterator.advanceRegsDWARF has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stack.go"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"995c2e8c051310eb0159492ade00dc166b1dc1d39ca434ad49ddec60da1886b0"}},{"ruleId":"D2","level":"warning","message":{"text":"api.ParseExamineMemoryArg (cognitive 38): api.ParseExamineMemoryArg has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (29 pts), jumps 3, boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 19). Of this number, 35 points are the body\u0027s own statements and 3 belong 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":"service/api/command.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5d8f1011f0d6c8707d69f45c6834c4ccec6c0e30118edc4eb5624ee9870d51"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.onEvaluateRequest (cognitive 38): Session.onEvaluateRequest has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 5, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":3309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2debcabe3ba7ca7e2be67671f85b7bab6710a4dc23469c3961de40ff50c15e"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.ppc64leSwitchStack (cognitive 37): proc.ppc64leSwitchStack has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/ppc64le_arch.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2a599957bd5ef3bcdf89d743fd2bf9a05c63b2c3c9f0b3271ccfe3c24338b9"}},{"ruleId":"D2","level":"warning","message":{"text":"starbind.unmarshalStarlarkValueIntl (cognitive 37): starbind.unmarshalStarlarkValueIntl has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (5 pts), match/switch 2 (3 pts) (nesting depth added 19). Of this number, 35 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"pkg/terminal/starbind/conv.go"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"9293177c5df667568bcdc0e737509e249b4cc6ef03d83e73363f6bf6f59142fc"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.typeCastCompatibleTypes (cognitive 36): proc.typeCastCompatibleTypes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdaa74ff684540079601183b487ec50ebe65b7588fc56bd69d31b5fea6e780b"}},{"ruleId":"D2","level":"warning","message":{"text":"BreakpointState.checkCond (cognitive 36): BreakpointState.checkCond has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/breakpoints.go"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab77023363426dbb063e63792c3e0086d2e02d6221220638326ba856f483079c"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.evalBinary (cognitive 36): EvalScope.evalBinary has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 3, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"792bfb6f542f34ea6cfb2d8f208d257d6922c2a405db9ab44cfad0bf38d2777a"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.structField (cognitive 36): Variable.structField has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/variables.go"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"694ade1537407c4fcb963789ac49eb22085ed84100af91a1a42a6ed0d6f1eecd"}},{"ruleId":"D2","level":"warning","message":{"text":"Term.sigintGuard (cognitive 36): Term.sigintGuard has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (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":"pkg/terminal/terminal.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb69b5f33b9b220df7f798078733157e2dc2beb339f11605f787ebabd3758113"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.setBreakpoints (cognitive 36): Session.setBreakpoints has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 2, loops 2 (nesting depth added 20). 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":"service/dap/server.go"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"918f0a97cfdd12facc7d8d31d7120e5f2011f1be4c63789449fe92b26cb7f667"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.onExceptionInfoRequest (cognitive 36): Session.onExceptionInfoRequest has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":4134}}}],"partialFingerprints":{"codehealthFindingId/v1":"800890c63125cf5a02978f1d9d69bacd94a9b2d427b71653ee4cb4ce7daafc06"}},{"ruleId":"D2","level":"warning","message":{"text":"stackIterator.Next (cognitive 35): stackIterator.Next has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stack.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9b2aba26d5826b0b07a1ae1dbd8167bc306b6f11e39f3a46f615a6f57b7ac9"}},{"ruleId":"D2","level":"warning","message":{"text":"locspec.SubstitutePath (cognitive 34): locspec.SubstitutePath has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/locspec/locations.go"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a577c714a1ebce987a87f50f570bb59b5df57598e4f790b73ab70f7f2330366c"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.compareOp (cognitive 34): proc.compareOp has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 5 (9 pts), boolean chains 4 (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":"pkg/proc/eval.go"},"region":{"startLine":2634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca96a7c6fd6cdc4cb252165530838d96d69b7a2c1dc3e940b79dd55823e616cf"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.parseStackArgs (cognitive 34): terminal.parseStackArgs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 2 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 22). Of this number, 28 points are the body\u0027s own statements and 6 belong 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":"pkg/terminal/command.go"},"region":{"startLine":2495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca28682f0d9e249ed7e63e7abbc5c20b1c1f70c172e28b98c339c6e20c2d3719"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.loong64SwitchStack (cognitive 33): proc.loong64SwitchStack has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 7, match/switch 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":"pkg/proc/loong64_arch.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a9df45be8e2068a9fd5ac65e2534c8a82ab76ce7fa376071a97f8b3da616aa"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.macOSDebugFrameBugWorkaround (cognitive 33): BinaryInfo.macOSDebugFrameBugWorkaround has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e0c0748a2d64c429d1f6fe83188270be4d14580262edd84a01674da36dfe06"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbConn.handshake (cognitive 33): gdbConn.handshake has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2919653f9f768b86a70a4bc22da46d9b529cf9e8cd14b667f5205c1275176e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbConn.step (cognitive 33): gdbConn.step has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (29 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e17b016fd9e9d8475836d6de15064faf3ce7f53349eb22878bd5349d0c16791"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroup.addTarget (cognitive 33): TargetGroup.addTarget has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/target_group.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce8beeb31c4c48b0362aee1dcd0bb990ad254c61258e77a81086d422e4020f5"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.target (cognitive 33): terminal.target has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 18). 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":"pkg/terminal/command.go"},"region":{"startLine":3573}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5875148ace8d2ce90c8741503126e470530aa1158424d3f27b7480b81fc3ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbRegisters.Slice (cognitive 32): gdbRegisters.Slice has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (22 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b75e71a21011c92aa96bcb62c9d4afa90a4e4922390bfd688e548318b0e2da"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbConn.readRegisterInfo (cognitive 32): gdbConn.readRegisterInfo has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 1 (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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6abd969e3fd7b29c099e67867d722aebd6386115c258d1eb9fd87ce7bfe563"}},{"ruleId":"D2","level":"warning","message":{"text":"stackIterator.advanceRegs (cognitive 32): stackIterator.advanceRegs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 16). 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":"pkg/proc/stack.go"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d40d097ea722743a599ea5bd68930e5d21ac14b0236c7f8047143c18ef48aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"Defer.load (cognitive 32): Defer.load has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (6 pts) (nesting depth added 18). 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":"pkg/proc/stack.go"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4cc5442139e4964fb9a2939062dcae7931d76278b4f4a3e8318dd46e2787cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Term.expandPrompt (cognitive 32): Term.expandPrompt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 17). Of this number, 26 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"pkg/terminal/terminal.go"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d74bd5b92d62bbebac7919772391d58e74040927e507c89cec6724aa885871e"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.setBreakpointInternal (cognitive 31): Target.setBreakpointInternal has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 11 belong 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":"pkg/proc/breakpoints.go"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"640aa25cde4f1fbce5249a4fb028b27b73d788a3153d32975ba08801824091ea"}},{"ruleId":"D2","level":"warning","message":{"text":"starbind.New (cognitive 31): starbind.New has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 3 (6 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). None of this is in the body itself: all 31 points belong to 5 function literals inside it that branch (lines 164, 85, 105, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/starbind/starlark.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b521d15a5d005bdc990e2b233449d0263c118ebf4dc9d5729986ddf2f3e0b51"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.loadBinaryInfoElf (cognitive 30): proc.loadBinaryInfoElf has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d510b2165aeb27744e00c3c8199333e240ce999d67fa9cc2faecc49b07f1db99"}},{"ruleId":"D2","level":"warning","message":{"text":"core.readNote (cognitive 30): core.readNote has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/core/linux_core.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8b229a3d57228d672d49634a33b39aba69c54f64503c12f47e4e4eac13e2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Commands.help (cognitive 30): Commands.help has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"02606350a8619fd59de269e370423efa6eaaeae3a4f2dcd3ee5319079446d91f"}},{"ruleId":"D2","level":"warning","message":{"text":"api.ParseGoroutineArgs (cognitive 30): api.ParseGoroutineArgs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (26 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/api/command.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f2f5b7901ec55e7708f30d423ec93fd19d3ef69725cac6543c813e2e06abd0"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger.collectBreakpointInformation (cognitive 30): Debugger.collectBreakpointInformation has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40ef8be073fd40c8ee7108df53355774803970d95e54e9227f44499d4c07363"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.Locals (cognitive 29): EvalScope.Locals has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, loops 4 (nesting depth added 7). Of this number, 24 points are the body\u0027s own statements and 5 belong 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":"pkg/proc/eval.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69f403f8afbeee6048b2e13e220c75659294c0d40ddc5e41a2f17ea7a9a4df1"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.findGlobalInternal (cognitive 29): EvalScope.findGlobalInternal has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (5 pts), match/switch 1 (4 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":"pkg/proc/eval.go"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"c109a49f3380d9b275abc1489075dee9b10966ebeb2b0a9d7c5cd4b0e5fd24c8"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.evalIndex (cognitive 29): EvalScope.evalIndex has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 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":"pkg/proc/eval.go"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d533f298560cd9ee6f1856890dcb6d56d946438533884cd03bdcb2e8d0a116b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.Dump (cognitive 29): Target.Dump has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 3 (4 pts), match/switch 2, boolean chains 1 (nesting depth added 9). Of this number, 25 points are the body\u0027s own statements and 4 belong 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":"pkg/proc/dump.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"033125408f1341947075af31bfc12c07f4e9eed007edadad157b00a1d32cf251"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.setStackWatchBreakpoints (cognitive 29): Target.setStackWatchBreakpoints has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stackwatch.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c17b290c6c6db069850261e5ac05c0e2a5f021d79f57b03d5586696ee100126"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.getLocation (cognitive 29): terminal.getLocation has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 2, match/switch 1 (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":"pkg/terminal/command.go"},"region":{"startLine":2567}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a9aa1746cb85fbbb33c89f68fa54f154c12112bf4f3baf7c4c2c58bd8a30f2"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.printcontext (cognitive 29): terminal.printcontext has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da7c61430a852a7d8a5f5f0d81fbeccb93f69b8077fd1840fb4039ac66b0a64"}},{"ruleId":"D2","level":"warning","message":{"text":"Commands.goroutines (cognitive 29): Commands.goroutines has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c17e5e2c8532b7290f4fb7e8cfc5de20bdd3177bd88c99a0de968272e68049"}},{"ruleId":"D2","level":"warning","message":{"text":"config.ConfigureSetSimple (cognitive 28): config.ConfigureSetSimple has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 1, match/switch 1 (nesting depth added 14). Most of this is not in the body itself: 6 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 73). 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":"pkg/config/split.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"db415ff46ce835e9518c6c6d942b558499116cdc7a61398170534e69a9a713e2"}},{"ruleId":"D2","level":"warning","message":{"text":"line.parseIncludeDirs5 (cognitive 28): line.parseIncludeDirs5 has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (7 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/line/line_parser.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6231371fb1d45e06962388713b90edb8d0cea481eee395524e0801636a9b184"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalLocationSpec.Find (cognitive 28): NormalLocationSpec.Find has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/locspec/locations.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a226ac3f86e21e8a56c52cf5be58bc980c873c4be5ca6c437e23c732fa25dff"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.breakpointConditionSatisfiable (cognitive 28): proc.breakpointConditionSatisfiable has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7, match/switch 4 (5 pts) (nesting depth added 5). Most of this is not in the body itself: 11 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1301, 1269, 1260). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/breakpoints.go"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b574b404299aa2ce4a34b27bbec769a6b5d894b1429dbf75d591f45bac51baf"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.i386SwitchStack (cognitive 28): proc.i386SwitchStack has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, match/switch 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":"pkg/proc/i386_arch.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2ee6ddd2df93c3df77c13e2db0d50dc75821ad0a57cc380df2ca034f3349ea"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.stepIntoCoroutineMaybe (cognitive 28): proc.stepIntoCoroutineMaybe has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/target_exec.go"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"248b6b2269c78f8a882732eead47de28f11be8a7ff66174e7cbf2dacc5a7117b"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbProcess.updateThreadList (cognitive 28): gdbProcess.updateThreadList has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"40359a3dade8663cb5272bd80295a182d3590641b0354a59ef6054eb24424633"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbThread.SetReg (cognitive 28): gdbThread.SetReg has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bec86e0d5982bec94c1a967e2f49873cce43acf6c3556ff9af8c489a3f51940"}},{"ruleId":"D2","level":"warning","message":{"text":"api.PrintStack (cognitive 28): api.PrintStack has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 10). Of this number, 25 points are the body\u0027s own statements and 3 belong 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":"service/api/prettyprint.go"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6027b8a13b6a64f9383c63d35d0de252777469377ceef176b25d02897cd6668"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.onAttachRequest (cognitive 28): Session.onAttachRequest has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 2, loops 1 (2 pts), match/switch 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":"service/dap/server.go"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6e22c3a504a460da3d4161aa19d39121e3a74ad3e88c4b498f48fda264ae86"}},{"ruleId":"D2","level":"warning","message":{"text":"debugger.attachErrorMessageLinux (cognitive 28): debugger.attachErrorMessageLinux has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger_linux.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e65fa6bd369e205180cfc9d70975a831df44ee210e31d008489e8dcd0aa8463"}},{"ruleId":"D2","level":"warning","message":{"text":"line.parseFileEntries5 (cognitive 27): line.parseFileEntries5 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/line/line_parser.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6eb4abfe90f3287ff859e768acb23ab2804d30eccfedf8995e87df213b869d"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.loadBinaryInfoMacho (cognitive 27): proc.loadBinaryInfoMacho has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19ab98b60fac09ec2bddf99a7a4afbe8dcdd858b2adcb6a933b6e8db2ee6207"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.newCompositeMemory (cognitive 27): proc.newCompositeMemory has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/mem.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafe81804f5a4d18b440be08218bc6feb75b0c1ac7d0c445b256df8f5ccbd7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.newVariable (cognitive 27): proc.newVariable has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 3 (5 pts), boolean chains 2 (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":"pkg/proc/variables.go"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfc97665d7162260757aa563b4dcd91723e00220ba0e0cbee9280762c6a4668"}},{"ruleId":"D2","level":"warning","message":{"text":"StateMachine.PCToLine (cognitive 26): StateMachine.PCToLine has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/line/state_machine.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f50295aac227782b4bd6fc18a8144a55dddebd17cccd29c9264c1b2373d32d"}},{"ruleId":"D2","level":"warning","message":{"text":"op.PrettyPrint (cognitive 26): op.PrettyPrint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/op/op.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cf484c2bddd69f518e474f1a3ebe548a4688c57e761ef161191c09da475ea6"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.negotiateType (cognitive 26): proc.negotiateType has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0302c870063173d2573c7ccfc3859f340716d6dee74a356f858460f5fb39b1be"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.stepInstructionOut (cognitive 26): proc.stepInstructionOut has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 4, loops 1 (nesting depth added 14). 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":"pkg/proc/target_exec.go"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1327421927691a753c96b0da9ad33808c95ba527671f18566c408f8cfa064e"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.GoroutinesInfo (cognitive 26): proc.GoroutinesInfo has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, loops 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":"pkg/proc/variables.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6f0db2288a459c5e8bc08bc5beaa772e8710632c6ae9468662397cec01bf27"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbProcess.handleThreadSignals (cognitive 26): gdbProcess.handleThreadSignals has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, 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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcbb129a857755b4d1da11e6526a0bcb29c55a801d2813b5c67a531a894daca"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroup.enableBreakpoint (cognitive 26): TargetGroup.enableBreakpoint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (2 pts), jumps 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":"pkg/proc/target_group.go"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8303bb532c6349995c450d42d3d2ccc10dd36a5ded8088800320e69d89abdda0"}},{"ruleId":"D2","level":"warning","message":{"text":"rpc2.MakeGuessSusbtitutePathIn (cognitive 26): rpc2.MakeGuessSusbtitutePathIn has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (5 pts), boolean chains 2 (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":"service/rpc2/client.go"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c637667224575f963bd911e8f42f7cfce3525364e97701517831d23b7474dbe"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader.FindEntryNamed (cognitive 25): Reader.FindEntryNamed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 2, 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":"pkg/dwarf/reader/reader.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ba6310508e7c67ca2e139b2aeeaa385e3b2af7214ff5c9121943726454bba4"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.setStepIntoNewProcBreakpoint (cognitive 25): proc.setStepIntoNewProcBreakpoint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 5). Most of this is not in the body itself: 12 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 1281). 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":"pkg/proc/target_exec.go"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b71876e0375fd522fb77e47901b73d265e84c6e79d20c4f1d698e8600a32e84"}},{"ruleId":"D2","level":"warning","message":{"text":"evalStack.run (cognitive 25): evalStack.run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (4 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ce34da9acdc3171f43b4d2cc518f2701fb7791e406b10b01d19a6c0cc2a3ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.onRestartRequest (cognitive 25): Session.onRestartRequest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":3508}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e643f721154d11e6948abaf0df736c98538064e2b70254e5249a41d3ea3e310"}},{"ruleId":"D2","level":"warning","message":{"text":"frame.parseCIE (cognitive 24): frame.parseCIE has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/frame/parser.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f53efd435181d3dc80e1ca25b7c379c5508551ef38fb13a54e391f4f71374d3"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.stepOutReverse (cognitive 24): proc.stepOutReverse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/target_exec.go"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ca5e846ed7332d2c4d8b38feadc3ee1d5f293e8c37c2e737053d4fa7c83654"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.loadDebugInfoMapsInlinedCalls (cognitive 24): BinaryInfo.loadDebugInfoMapsInlinedCalls has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":3356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4352dfcd5a625a90c904aa2bf0dce4bdcca843c3b2ac914b5bb42f4ba2aa7509"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.ChanGoroutines (cognitive 24): EvalScope.ChanGoroutines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 2 (nesting depth added 7). Most of this is not in the body itself: 5 of the 24 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 280, 259, 270). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5417a734725c9a4e5e525c28e91fa2ef617805c737122a44afd567ad68de4fba"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeProcess.addThread (cognitive 24): nativeProcess.addThread has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/proc_linux.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"65af181f17d126e97a2902bac618cdd40d51661f8aa536e73862a7ae7c096db9"}},{"ruleId":"D2","level":"warning","message":{"text":"stackIterator.readSigtrampgoContext (cognitive 24): stackIterator.readSigtrampgoContext has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (7 pts), loops 1 (nesting depth added 9). Of this number, 17 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bf66ce96b5dfa0e200a41b0355fe35ba3d867b60eac225a19587a349bc2da8"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.isType (cognitive 24): Variable.isType has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, match/switch 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":"pkg/proc/eval.go"},"region":{"startLine":2795}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b0052d44d19eda23791a281aa1f42ed8da5dba6ac9dcb7c4d6645b766f04ad"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.resolveCallArgLOONG64 (cognitive 23): proc.resolveCallArgLOONG64 has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 4 (9 pts), boolean chains 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/loong64_disasm.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8224a4ebdc7e17daa5c6f3388299ed6f534b5ec1b449e168c63820de9c8f24"}},{"ruleId":"D2","level":"warning","message":{"text":"Function.parse (cognitive 23): Function.parse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"985dd86d0e88fb3c71ff0db95c8fd61eeaa30abf13a9a2e4563e188f701a2d99"}},{"ruleId":"D2","level":"warning","message":{"text":"core.readLinuxOrPlatformIndependentCore (cognitive 23): core.readLinuxOrPlatformIndependentCore has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/core/linux_core.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b259e1da200a76e9a4297f52af1d704aac21fd3a2085ac59631a87ee5bfdf97f"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbProcess.initialize (cognitive 23): gdbProcess.initialize has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d67c13f1535be17da9e209b0da15d64d8a0a5d4acd9c40e5a74ff1ece2caa4"}},{"ruleId":"D2","level":"warning","message":{"text":"compositeMemory.WriteMemory (cognitive 23): compositeMemory.WriteMemory has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (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":"pkg/proc/mem.go"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ca8ad08a601f283678433b679d67d564a6116f589fe7ff2f51b8d136efdec4"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.SetWatchpoint (cognitive 23): Target.SetWatchpoint has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/breakpoints.go"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"da118e9558f37b7876765db11921c21a2200effd751161311d9f87d0b2f85f59"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.whatisCommand (cognitive 23): terminal.whatisCommand has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5358eb8f0e7faef63a2ef29faf97d76e8dfd4a6444a964c995ebe68597256580"}},{"ruleId":"D2","level":"warning","message":{"text":"debugger.New (cognitive 23): debugger.New has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"137abdf0a22be3b062967563d5b25a63b82293d66a7bfc235fa523e547828430"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger.Restart (cognitive 23): Debugger.Restart has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"288f8b81d39c77e67c179cce77fec5418ac6aab755c6f9a3f5babb23dae23045"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.findTLSGGOTEntryElf (cognitive 22): proc.findTLSGGOTEntryElf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 3 (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":"pkg/proc/bininfo.go"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"549a5188beef81650687d1a72adbd09b9181732a173be6e60c44b52593c30044"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.FindGoroutine (cognitive 22): proc.FindGoroutine has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/variables.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"3720df9f19b6c2edd91d5f8fe3c520d30004c6e281dd6e348e3e9962839d5776"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbserial.LLDBAttach (cognitive 22): gdbserial.LLDBAttach has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f98db879cc65619b99c7b7e2aed0098898a672a59f3c01f133a33445245521"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbThread.SetCurrentBreakpoint (cognitive 22): gdbThread.SetCurrentBreakpoint has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, 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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"034d86815244821cedc67e8fce2df6e77cba7720021b243b9c22def5e84b91ee"}},{"ruleId":"D2","level":"warning","message":{"text":"EBPFContext.handleParamEvent (cognitive 22): EBPFContext.handleParamEvent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/internal/ebpf/helpers.go"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a568408a4f738fbe4a914b520b4756a447ac222e1d19f7d8b0b6fc0e591578"}},{"ruleId":"D2","level":"warning","message":{"text":"lineWriter.Write (cognitive 22): lineWriter.Write has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/colorize/colorize.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be9ed6a5490809267c140c5357f63ed28d66ba99250a75e956c3c0ce9b99df1"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.New (cognitive 22): terminal.New has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). Most of this is not in the body itself: 7 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 146). 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":"pkg/terminal/terminal.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a29a47a1c8ccd705ff5dc1998e2ee8765b40ef5a6c049bf1c42672c0b1a6d91"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.writeBasicType (cognitive 22): Variable.writeBasicType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/api/prettyprint.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1262045c16f810fd6acd85538b71b0a30a68a1b5b430ca01677395bb4de065"}},{"ruleId":"D2","level":"warning","message":{"text":"dap.parseLogPoint (cognitive 22): dap.parseLogPoint has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":4747}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc90081bd406d13de65bc98d1a97459691abd1b994bb564ae65b22d14ae630d8"}},{"ruleId":"D2","level":"warning","message":{"text":"cmds.New (cognitive 21): cmds.New has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 3 (nesting depth added 3). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 181, 525, 188, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/dlv/cmds/commands.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b8b75c0612c243f348cd072d7abcae4e44818dcd0a32d43cb12c38de1abade"}},{"ruleId":"D2","level":"warning","message":{"text":"formReader.next (cognitive 21): formReader.next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 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":"pkg/dwarf/line/parse_util.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"576e1d65e7b380fe1c629dfd2e91ce0935a8fc2d4c9bb6d00f0ca145b95ffa95"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalLocationSpec.findFuncCandidates (cognitive 21): NormalLocationSpec.findFuncCandidates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (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":"pkg/locspec/locations.go"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4414b72149ab2a0bdf347cc65caf69a002685b021f3b7aa23496aa9596dc06d"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.setDeferBreakpoint (cognitive 21): proc.setDeferBreakpoint has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/target_exec.go"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"757cde8904b15ea1e366741ed561b0a26420dd2a72db986884dbd8c4ad98dc53"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbserial.wiredecode (cognitive 21): gdbserial.wiredecode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b920eb743b5c3239b7ebd6f385ceb06145d1ec9213a77a59003d8cb0ae7f2f"}},{"ruleId":"D2","level":"warning","message":{"text":"stackIterator.newStackframe (cognitive 21): stackIterator.newStackframe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stack.go"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"094a3f8284c1f00e3f0ac4d3801c76ab61011f56a73c529c93cf6a9c9cab34a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.setEBPFTracepointOnFunc (cognitive 21): Target.setEBPFTracepointOnFunc has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/breakpoints.go"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9756cca46cdbb59c039d9fbf9d5c3524fdca31b50cd32e8c9e637a0b48cb5fe"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroup.StepOut (cognitive 21): TargetGroup.StepOut has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 1 (nesting depth added 4). Of this number, 20 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/target_exec.go"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9b66e26502393acac3440c0dd59bbd40b4b0b68f0268ee87fc70a4efb47ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.loadSliceInfo (cognitive 21): Variable.loadSliceInfo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/variables.go"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6a303debb4a0cfaee742cd9b63cc25c25de39c495642bb254d7a7e95790491"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.loadMap (cognitive 21): Variable.loadMap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/variables.go"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db428c5c7f80441fcb5fa109c4bafa07e1b1d50f09afa83ebcc896041f26792"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.examineMemoryCmd (cognitive 21): terminal.examineMemoryCmd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 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":"pkg/terminal/command.go"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"714d03bd9ecc1d8346ddbc4bbd1b1f103dfb3e66d3772d786b75b8af7060cef1"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.configureSetSubstitutePath (cognitive 21): terminal.configureSetSubstitutePath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (8 pts), boolean chains 1, match/switch 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":"pkg/terminal/config.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"27af4bd9740b7b2964d5b99c968a7870c29c3980526d5e4da8894f06d05fa4dd"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.arm64LinkerTrampolineTarget (cognitive 20): proc.arm64LinkerTrampolineTarget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/arm64_disasm.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb659739cb100f38c8a21e4b8450f1c50f945a421fcd8b4475164d9f8f2afee8"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.funcCallArgs (cognitive 20): proc.funcCallArgs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/fncall.go"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed83d1cc0cfb208e910a1be38b1b311b390f263968a3cfc54cf01fccd1df6a14"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbProcess.setCurrentBreakpoints (cognitive 20): gdbProcess.setCurrentBreakpoints has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cafa86a2d851848915c587790f04d86108d086fd6626f2eb39083555e508100"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.registerVariableTypeConv (cognitive 20): Variable.registerVariableTypeConv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/variables.go"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"652970b9ce80d04e9bf56930e007d5c7955513d5df16599dd68e84d588578b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.formatBreakpointAttrs (cognitive 20): terminal.formatBreakpointAttrs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"pkg/terminal/command.go"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa5cf09b4f064cf89ddf5213dc68a72ce3a3133cd27645bc962551807dab59b"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.printcontextThread (cognitive 20): terminal.printcontextThread has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c0871c0180c51a7e2316cd2d8da866ee652daad0194f6c8c297e1a333a059b"}},{"ruleId":"D2","level":"warning","message":{"text":"Commands.printGoroutines (cognitive 20): Commands.printGoroutines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, 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":"pkg/terminal/command.go"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14c2cb9d44550b38ed1b5344189be4134f194ea0921802a651554a8fae25381"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.CheckStopLocation (cognitive 20): Client.CheckStopLocation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/daptest/client.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"9363d3f83078c8bad0cdf764c976dae9582038a3a8d01a6296caddc5b5293bce"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.onScopesRequest (cognitive 20): Session.onScopesRequest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (4 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":"service/dap/server.go"},"region":{"startLine":2686}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a0f9c5a8f759e0adebe143fd997311dc8487992f453ce9963b3175f512d935"}},{"ruleId":"D2","level":"warning","message":{"text":"reader.variablesInternal (cognitive 19): reader.variablesInternal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (3 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":"pkg/dwarf/reader/variables.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8df79ddb46a76f0cacd99435851524d90009298e64785d0fc26f18b4ef3d51"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.findTypeExpr (cognitive 19): BinaryInfo.findTypeExpr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3 (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":"pkg/proc/bininfo.go"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7808fb1e5c324ff74b776d28d4859a40afce2557c40fbb6fae959d8b1e53c0"}},{"ruleId":"D2","level":"warning","message":{"text":"compileCtx.compileTypeCastOrFuncCall (cognitive 19): compileCtx.compileTypeCastOrFuncCall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). Of this number, 18 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":"pkg/proc/evalop/evalcompile.go"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f19efcfa1d72981bd2092ad55f85a017d435271014e1fdbed7a00d3088822d"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbThread.reloadGAtPC (cognitive 19): gdbThread.reloadGAtPC has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1, loops 1 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 2 belong 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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2009cc9932ba379bda581722e273104ae4a3f8052f91ff890945334b433c65b"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.clearAll (cognitive 19): terminal.clearAll has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"921e2c7b5cc07df3fd564f7ac67f25abb0dde20d70b6bde08ec91d7565387620"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.writeStructTo (cognitive 19): Variable.writeStructTo has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/api/prettyprint.go"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e142f340ecd3efdecc37ff9eeb40b37fc10c8b6e67adb2ad090922078fe696"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.writeMapTo (cognitive 19): Variable.writeMapTo has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/api/prettyprint.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c452519c0912c6a588f0fe18a28cb47aaab59ba8febd1637f69533e96cbf2b92"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.newNoDebugProcess (cognitive 19): Session.newNoDebugProcess has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (2 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent 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":"service/dap/server.go"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"442f0fafd57e12380057f4cd722a4dc25a7363f987d5c363f9800f5a2670ff9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.stopDebugSession (cognitive 19): Session.stopDebugSession has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (4 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":"service/dap/server.go"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"026e1381ccd72f9d3887d39d9a3f3d1bb42dabfdec086f16d6b7417170b57048"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugLineInfo.PrologueEndPC (cognitive 18): DebugLineInfo.PrologueEndPC has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/line/state_machine.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64a438a8c1b8d7aade0818f5f957c9db04b177eb30f04d038a4a3433ddb6196"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.callInjectionProtocol (cognitive 18): proc.callInjectionProtocol has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/fncall.go"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"46777fe08f6b1e391e5b387cf6efd80870bc7768779084a22d19b5962a263ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.setStepIntoBreakpoints (cognitive 18): proc.setStepIntoBreakpoints has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/target_exec.go"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddc7ebf8f5afb4c5a21e45c07669df298745866e28bdbac4960093cfb911f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.resolveCallArgX86 (cognitive 18): proc.resolveCallArgX86 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/x86_disasm.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4f6d59169952d73c67a7a9acbb6b68b30da231c7000639bbc5db18b39557d9"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.AddImage (cognitive 18): BinaryInfo.AddImage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"9449b01e97840558926e28238f8247d2aae1e5c0693e39c3cbe303f54fc53f39"}},{"ruleId":"D2","level":"warning","message":{"text":"core.buildMemory (cognitive 18): core.buildMemory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/core/linux_core.go"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0401f1737b021a27e245ba30c337663eac391bd847a5e716c35191d5d81691"}},{"ruleId":"D2","level":"warning","message":{"text":"debuginfod.execFind (cognitive 18): debuginfod.execFind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 31, 43). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/debuginfod/debuginfod.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9789ad3bd5831310776eb6dd6bc9ebb7ca026d3935d4db7991422ed961622a2"}},{"ruleId":"D2","level":"warning","message":{"text":"stackIterator.tryFramePointerUnwind (cognitive 18): stackIterator.tryFramePointerUnwind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stack.go"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8c0baa3b3a508a7d19baf82ab571f38917615f5ce0d4fab9f1e43c50e7099c"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroup.pickCurrentTarget (cognitive 18): TargetGroup.pickCurrentTarget has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3, 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":"pkg/proc/target_exec.go"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"94591ee9464e8fe82daff485b23367d2e927c6d66a7c596c183c9181fbdc4534"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroup.disableBreakpoint (cognitive 18): TargetGroup.disableBreakpoint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 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":"pkg/proc/target_group.go"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e455f11376998f3bb6635bdf73099c90331ca0bc8729749e256adbaa3ce295e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.reslice (cognitive 18): Variable.reslice has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4 (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, 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":"pkg/proc/eval.go"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"e445a8c28f8972afb5403ff93a39abc907492ff06fa0cc390e1beb28be0edb2b"}},{"ruleId":"D2","level":"warning","message":{"text":"G.readDefers (cognitive 18): G.readDefers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, 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":"pkg/proc/stack.go"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad359b8977a437a2e20556e5258885cbf4c94f4c6be7a3b2e267272df33fceb2"}},{"ruleId":"D2","level":"warning","message":{"text":"Commands.onCmd (cognitive 18): Commands.onCmd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (18 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":3233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb9aa0d7ac643eeb684d278ff1777f718a73750819071ad142a6dfdfd541ace"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.ServeDAPCodec (cognitive 18): Session.ServeDAPCodec has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 11). Of this number, 17 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":"service/dap/server.go"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45e28fa41be87ed509cb8b273335c4fc57dade1e0c8dd1334f96d14d056fea5"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.onSetVariableRequest (cognitive 18): Session.onSetVariableRequest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":3630}}}],"partialFingerprints":{"codehealthFindingId/v1":"477a179635dbe0909bb1e3d317485a0f0ac38a14e114cb5e1729ef6f69fa7936"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger.state (cognitive 18): Debugger.state has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"770697061e1ecc2c946dc651b3ba02a6533ff1975a1a5d378f2c93bbce67883e"}},{"ruleId":"D2","level":"warning","message":{"text":"RPCClient.continueDir (cognitive 18): RPCClient.continueDir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 119). 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":"service/rpc2/client.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4842cec767f5e0461467b6f9e4afe8e2c67c7a4bc98d979cb1b22e14c3b14de2"}},{"ruleId":"D2","level":"warning","message":{"text":"RPCServer.ListGoroutines (cognitive 18): RPCServer.ListGoroutines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 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":"service/rpc2/server.go"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed73ef4f85d40bf609fbb01bd5d0505a493246574f34529606fb7782ccdeaaf"}},{"ruleId":"D2","level":"warning","message":{"text":"cmds.dapCmd (cognitive 17): cmds.dapCmd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16 (17 pts) (nesting depth added 1). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 548). 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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba41d47a2935ea9f807953e1b0aecc5ad8a2d422ca8c80cea633108e13473da9"}},{"ruleId":"D2","level":"warning","message":{"text":"config.SplitQuotedFields (cognitive 17): config.SplitQuotedFields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (5 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":"pkg/config/split.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"343272b17b0312af6c5e7a2301ec41ecd4c258503704ebbad61806807e3727b5"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugLineInfo.FirstStmt (cognitive 17): DebugLineInfo.FirstStmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/line/state_machine.go"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"44225a0f7e7cc3653c09b9937d454787b282685f92096c3b2def0f1393d66fb4"}},{"ruleId":"D2","level":"warning","message":{"text":"goversion.Compatible (cognitive 17): goversion.Compatible has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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":"pkg/goversion/compat.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dcf1cad8743950bc912b3d548db9e98bdedad8dcb0d03aac67787fc33d2444"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.FirstPCAfterPrologue (cognitive 17): proc.FirstPCAfterPrologue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 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":"pkg/proc/bininfo.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b447f74e4a099b9632b0b6acf5e5453b3df6e230cf75e8b499910b2a6f1de403"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.minmaxBuiltin (cognitive 17): proc.minmaxBuiltin has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"4987418e6bb48af1894340864fd9b6ca8dcc763c1187a200f4076119b75794b5"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.allPointers (cognitive 17): proc.allPointers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/fncall.go"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa7581420102d60760364fd7dbd899761367df9b58127d861e7fbf44ae4d041"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.setValue (cognitive 17): EvalScope.setValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdc5b0a886bbe2fd906f61943975be7cf4d1f7c52ab883c985ad74414f9cb08"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbConn.waitForvContStop (cognitive 17): gdbConn.waitForvContStop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, 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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3330fa48eb269b0c9e061b115cab6f32032552ccaeeb12853b5ced298efda56"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbConn.queryThreads (cognitive 17): gdbConn.queryThreads has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"391d0edd314c357ac22cb3558027d7156a9c7a075142c57a0a9c3b590ff63d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbConn.send (cognitive 17): gdbConn.send 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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"e364af55734e37652950f620c1f2c3bcf1c1441100f404da7d6dcaf7decc9ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.ClearSteppingBreakpoints (cognitive 17): Target.ClearSteppingBreakpoints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Target.clearInactivatedSteppingBreakpoint) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/breakpoints.go"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84364eb9b8b9395eea469d3f5e01533f55cc78d1c09475f8f148695c0e2e215"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.clearInactivatedSteppingBreakpoint (cognitive 17): Target.clearInactivatedSteppingBreakpoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Target.ClearSteppingBreakpoints) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/breakpoints.go"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e8461c397a56dc9bfad9e1392d7257f721226f0199ce43d0511f72f6381297"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroup.ChangeBreakpointCondition (cognitive 17): TargetGroup.ChangeBreakpointCondition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/target_group.go"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2bb8ee3bbeb3312716d91e347a20b0fba39e4ffafffd552b88e5e15680f13f"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroup.manageUnsatisfiableBreakpoints (cognitive 17): TargetGroup.manageUnsatisfiableBreakpoints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/target_group.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"062d27a588c14203e96247f454616f9a7dfb2726c7144b1cbaa922b82765eba2"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.mapAccess (cognitive 17): Variable.mapAccess has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28b0bb1ea10b0ab4dbe009f7aa836d38a922985d4656730154688c915751d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.formatTime (cognitive 17): Variable.formatTime has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/variables.go"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d876c0a74c1c2221e721fc820f2451c3b1ce93f5f30197a16c3ea6a1555671"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.continueUntilCompleteNext (cognitive 17): terminal.continueUntilCompleteNext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce8dc43bde8339409f002f20b06bb26458949efda1cc860b3ef42f162e127eb"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.disassCommand (cognitive 17): terminal.disassCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e96e4e5f60b08d4c81123be2fb76f931404f0b381c9985a5459967529eca9bc"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.printBreakpointInfo (cognitive 17): terminal.printBreakpointInfo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 2 belong 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":"pkg/terminal/command.go"},"region":{"startLine":2948}}}],"partialFingerprints":{"codehealthFindingId/v1":"f502da0ec1b00e50f8b270cfff725e04570ad6322c910bd9728e1f264464744f"}},{"ruleId":"D2","level":"warning","message":{"text":"pagingWriter.Write (cognitive 17): pagingWriter.Write has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, 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":"pkg/terminal/out.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da5b9f740fc798f3f9f2f64aa804ce163db5b37e30f11e339d1126053c4fd40"}},{"ruleId":"D2","level":"warning","message":{"text":"starbind.rep (cognitive 17): starbind.rep has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 pts) (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/starbind/repl.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7537eef45fd18d841f5fd92fdf20bc961e509a37e31230ef01a0204a2f31633b"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.onDataBreakpointInfoRequest (cognitive 17): Session.onDataBreakpointInfoRequest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), 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":"service/dap/server.go"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fad910565e981df7f10e6216223aa17b96af34e42a9c6fd581fa5f1c697173c"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.onDisassembleRequest (cognitive 17): Session.onDisassembleRequest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 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":"service/dap/server.go"},"region":{"startLine":3904}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5b889c9c8921f6e73cdc867886326f3b108756b6fcfa6cbd7ab95753c5d415"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger.Launch (cognitive 17): Debugger.Launch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (nesting depth added 7). Of this number, 10 points are the body\u0027s own statements and 7 belong 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":"service/debugger/debugger.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d54e401553779d81291385c3f77e2e9258fd030db835c9bfedfb6c6e8d3330"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger.Functions (cognitive 17): Debugger.Functions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3351e6d204886c0dcf3a7ff7b0f0b486acb02a300465976354e74380934f17fc"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugLineInfo.AllPCsBetween (cognitive 16): DebugLineInfo.AllPCsBetween has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/line/state_machine.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b32ee5119540547928a91c3bc940a11a8a8b04437f6675a1dfdc0d5bdc7fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"dwarf.ReadUnitVersions (cognitive 16): dwarf.ReadUnitVersions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), boolean chains 2, 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":"pkg/dwarf/parseutil.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"109befcd283f8f8bdfd173777c109eb92bfbe3e45c61aa7368f81d1b66b4d9be"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.runtimeOptimizedWorkaround (cognitive 16): proc.runtimeOptimizedWorkaround has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/fncall.go"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6fe816fd522357cb1a7b9a7dfef2e963aaaea5f100fe8e0bd5aa0cd1b50838"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.GetG (cognitive 16): proc.GetG has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/variables.go"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeca206ebaeaa4eb008249bd98c5e23cfbea453848424ab5a7a5dcd724f0c17"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.setGStructOffsetPE (cognitive 16): BinaryInfo.setGStructOffsetPE has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 7). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 2270). 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":"pkg/proc/bininfo.go"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc21e0ec777e6573df1bacd199e2c1d670dd9c3b7538a1689a1fb659c2fd1b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.ListPackagesBuildInfo (cognitive 16): BinaryInfo.ListPackagesBuildInfo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":3535}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c229b04b828021c8f62b40b54a15c2f41059ae7a495268d62aa030458515aa2"}},{"ruleId":"D2","level":"warning","message":{"text":"SplicedMemory.Add (cognitive 16): SplicedMemory.Add has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 5). 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 into named stages: move each independent 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":"pkg/proc/core/core.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc7cd4c74bdf075db6960e1b90874278fbad493043e5405937bda6ab52d5253"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.evalJump (cognitive 16): EvalScope.evalJump has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, match/switch 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":"pkg/proc/eval.go"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab082730cefe94e57244ef50c957b50e48817c80bc75141bab8a8831d0c2acce"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbConn.memoryRegionInfo (cognitive 16): gdbConn.memoryRegionInfo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef188395eb568b0ba43e747618c6d796de51c9ab3382ceb33a293d6793f0a354"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeThread.SetCurrentBreakpoint (cognitive 16): nativeThread.SetCurrentBreakpoint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1 (nesting depth added 8). 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":"pkg/proc/native/threads.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c8f5f0da9bf6b8701da822d141685435f8490cd3f06717bd005ec0f26da2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroup.setCurrentThreads (cognitive 16): TargetGroup.setCurrentThreads has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, 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":"pkg/proc/target_exec.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"754ef383481cd4a29cda666668580950286b56ed181f461222351019b53f5c83"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.restartRecorded (cognitive 16): terminal.restartRecorded 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":"pkg/terminal/command.go"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8c08139256a88fde7d9368d743be1e75c9477276b82538fb240c9b73f114fe"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.configureSetDebugInfoDirectories (cognitive 16): terminal.configureSetDebugInfoDirectories has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/config.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2677c15f2a084e475448d522dcaa97eb8eaa3a8ade73d6aa38e36821687f9d2"}},{"ruleId":"D2","level":"warning","message":{"text":"Env.variableValueToStarlarkValue (cognitive 16): Env.variableValueToStarlarkValue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/starbind/conv.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b9d6c813483d6ecfa5308aa13e4e343d96c9947bcfe90f4914aad0e54730d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerImpl.Run (cognitive 16): ServerImpl.Run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 7). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 135). 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":"service/rpccommon/server.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"44de735b6b0ebe7b910930a6490fa331625c09012703d6b5bc006805c466dae7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Client: TooManyMethods \u2014 199 methods, declared across 2 files: daptest/resp.go (122), daptest/client.go (77). The bar is 30 methods; this is 169 over it, 6.63\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":"service/dap/daptest/client.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c55a12b3b6ffafc16ae02d5bc7a1ece5e0050012fec4215bbd49630fd46ce85"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Session: ClassTooLong \u2014 2373 significant lines (blank, comment-only and punctuation-only lines excluded), 109 methods, 103 blocks, lines 177-4737. The bar is 400 significant lines; this is 1973 over it, 5.93\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":"service/dap/server.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7c8e6c789f6c4784a29fa6b59479b9e62389a0cb696a52dac80a186e2b3798"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dap/server.go: FileTooLong \u2014 2840 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: Session (103 blocks, 177-4737). The bar is 500 significant lines; this is 2340 over it, 5.68\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":"service/dap/server.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"779f216c6e73f371be9fb414fa0bffe5bb89f582fc6231e3349e2dc06fd44675"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: terminal/command.go: FileTooLong \u2014 2169 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1669 over it, 4.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbdf924a8521021ee25a842f9a93532afea73fba424f16819d5151a3a037b9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proc/eval.go: FileTooLong \u2014 2166 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1666 over it, 4.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":"pkg/proc/eval.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2571cbc8945fbfebafa15dbe1ca9390914e1378066e33c62400fe40d28899960"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proc/bininfo.go: FileTooLong \u2014 2089 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1589 over it, 4.18\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":"pkg/proc/bininfo.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e1c001b0c74c3d4e92315ac930ef0a05a46d7a48b4b7c02a2ad5f56852deea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 109 methods, declared across 2 files: dap/server.go (102), dap/command.go (7). The bar is 30 methods; this is 79 over it, 3.63\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":"service/dap/server.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7ca617e1bab4c0c1c832af7fdf3f7defd33962e5bc00f13153822090dc9ae2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Debugger: ClassTooLong \u2014 1421 significant lines (blank, comment-only and punctuation-only lines excluded), 97 methods, 98 blocks, lines 64-2871. The bar is 400 significant lines; this is 1021 over it, 3.55\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":"service/debugger/debugger.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ad18f7e59878bb3681da52793796c883d9b6fde0a6f642f0441d9cecac81bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: debugger/debugger.go: FileTooLong \u2014 1741 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: Debugger (98 blocks, 64-2871). The bar is 500 significant lines; this is 1241 over it, 3.48\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":"service/debugger/debugger.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a697be34a487d2b6eaa179dbfa61ef7d7d7db6a0afa7a90059a497a0e15b58bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: godwarf.readType: FunctionTooLong \u2014 readType runs 339 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 239 over it, 3.39\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":"pkg/dwarf/godwarf/type.go"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"db974a169b049a3c275661c39c2114d2a2dd87d9849848877be3be3bbdf15087"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Debugger: TooManyMethods \u2014 97 methods. The bar is 30 methods; this is 67 over it, 3.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":"service/debugger/debugger.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a684b086fd2780e9c4ba2ffb3322c3ed34241c0bc5030c45cb69d948ba65b3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proc/variables.go: FileTooLong \u2014 1528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1028 over it, 3.06\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":"pkg/proc/variables.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5d698428398964e519202c3309ba8ede12b6787bdab2e36b7f1abaef83bb83"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RPCClient: TooManyMethods \u2014 90 methods. The bar is 30 methods; this is 60 over it, 3.00\u00D7 the bar. Most of these members implement service.Client (83 of 90 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/rpc2/client.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"902e6ec45f0c99b588469c3887864c14158340c1e126e217fa0fd543c9594f38"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BinaryInfo: ClassTooLong \u2014 1044 significant lines (blank, comment-only and punctuation-only lines excluded), 65 methods, 65 blocks, lines 56-3574. The bar is 400 significant lines; this is 644 over it, 2.61\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":"pkg/proc/bininfo.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"930770880564b205c49972b487f502406a24321b85387682aade2c4cff4ecbbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gdbserial/gdbserver.go: FileTooLong \u2014 1277 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 777 over it, 2.55\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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0923bffaf4d3022eb23622360699eae9571616a6a9ce8ea9d5bc030be4c44dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.onLaunchRequest: MethodTooLong \u2014 onLaunchRequest runs 233 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\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":"service/dap/server.go"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce209f38f396f3b800f1761d3bcf58eb99a28270cbb342f499f0140e97ceb85"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cmds.New: FunctionTooLong \u2014 New runs 227 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 127 over it, 2.27\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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f542f0b491045ba796954e4e3b25f39dfe1bad172e15c1eb00411c683c239e5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalScope: ClassTooLong \u2014 893 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods, 26 blocks, lines 40-2630. The bar is 400 significant lines; this is 493 over it, 2.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":"pkg/proc/eval.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b1e721f3b7eacfb3aebcc5b44d791c08c8443b026bb2a232e3e89470c6e482"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BinaryInfo: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.17\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":"pkg/proc/bininfo.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c711781260d1b791951685e3bb3c713ae357e2db84d438ae0fb20933e500070"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalScope.evalTypeCast: MethodTooLong \u2014 evalTypeCast runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\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":"pkg/proc/eval.go"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2da606d9a6286b7eac7d319d8a79cd37d45bea928198182f26c9169dccd717"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proc/target_exec.go: FileTooLong \u2014 1070 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 570 over it, 2.14\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":"pkg/proc/target_exec.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b21716925beccff9c144ab4d961ab072ec99d311c44fa0e4592ce6f4760694"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: gdbConn: ClassTooLong \u2014 799 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods, 45 blocks, lines 23-1470. The bar is 400 significant lines; this is 399 over it, 2.00\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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f22d37b6bd6d96575ceb688f4454e835d5004bbdcc0088f822535f36f66b4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gdbserial/gdbserver_conn.go: FileTooLong \u2014 996 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: gdbConn (45 blocks, 23-1470). The bar is 500 significant lines; this is 496 over it, 1.99\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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b8536bd2738af362f9590435f0025f1655dc6f7fe3612ab07a77da872bb641"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RPCServer: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\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":"service/rpc2/server.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1995aa3524333a6592b8ab2d4a526a7fcbec342874ec73b474da7c8b5247bc3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: evalStack.executeOp: MethodTooLong \u2014 executeOp runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\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":"pkg/proc/eval.go"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67dc4383655f82b5ccb9e358fc2d19ce4271a8b43d29ecfb337308b8787bad9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cmds.traceCmd: FunctionTooLong \u2014 traceCmd runs 179 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86d079239655f58ca0456184d6f4b0b1fe07be1049b958f25b33e3798e22d92"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Variable: ClassTooLong \u2014 706 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods, 34 blocks, lines 103-2458. The bar is 400 significant lines; this is 306 over it, 1.77\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":"pkg/proc/variables.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5401cfc93a8ea11ff5353c0cdff8035897d49d109273f8c8444e781f404e37c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmds/commands.go: FileTooLong \u2014 840 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 340 over it, 1.68\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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b32caa01a313ddd23279350672af1df592da730c443040c9d5f8f40bf60743"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TargetGroup.Continue: MethodTooLong \u2014 Continue 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":"pkg/proc/target_exec.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42bd0feaa83a5743f7bfd12cee8b8ceb5bf0b6164a65e4b498e9d2597037439"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proc/fncall.go: FileTooLong \u2014 812 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 312 over it, 1.62\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":"pkg/proc/fncall.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bb4f77a203d3f7e7d3a43a07ae0adaccb4f9c6767d50893be1b54a5cb91897"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.handleRequest: MethodTooLong \u2014 handleRequest runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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":"service/dap/server.go"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ac3f6c1af2665ae42b0bcd3c0b5181b817542f5027e8148c1839221b9808d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proc/stack.go: FileTooLong \u2014 783 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 283 over it, 1.57\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":"pkg/proc/stack.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb17950f40e3be4dd5e9ae0fcb9bfcddab894ec9bf6af7381cfda97fcf205e00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proc/breakpoints.go: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 269 over it, 1.54\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":"pkg/proc/breakpoints.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37107a9e4d53989b98c465f2731f3de2faf286b420c9097374e3947786b9abe1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proc/stack_sigtramp.go: FileTooLong \u2014 767 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 267 over it, 1.53\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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e6301652de4e8c8d65d637e5e2262916c28cd0bddf271e889d5c23a6fb6f6e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: gdbProcess: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b795df111ea7020ab311f1660fff875fb21cc4ea8022465c6a81f3f7cfbcb80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AMD64CONTEXT: TooManyFields \u2014 46 stored fields beside 4 methods. The bar is 30 stored fields; this is 16 over it, 1.53\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":"pkg/proc/winutil/regs_amd64_arch.go"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f22461f6fe6e3bee49226511d7d1eff7d3b1cc186936151528d4995187e667"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Variable: TooManyMethods \u2014 45 methods, declared across 3 files: proc/variables.go (34), proc/eval.go (10), proc/mapiter.go (1). The bar is 30 methods; this is 15 over it, 1.50\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":"pkg/proc/variables.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6ab0258e9c7c6541d2d2ebe7791612ff158aaa25003b863d529dd138a7969a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: gdbConn: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50dfbb8e5cb5b415ed66980c8edc24e6190c27fa10575f4e35f70e7fd4f37f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: proc.next: FunctionTooLong \u2014 next runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"pkg/proc/target_exec.go"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb544848c8f05832dbd6788dc53bfb3d82379ce1531404750a3bd43de42f446"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Debugger.Command: MethodTooLong \u2014 Command runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"service/debugger/debugger.go"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e393fda321b4e08c7925dfd5622267a2dd9f1abdf5cb25a469f492a0046be63"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: compileCtx.compileAST: MethodTooLong \u2014 compileAST runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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":"pkg/proc/evalop/evalcompile.go"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea81c459c83b6c966143853dd81a077bfbba4aceb6bc93c935cbe5eb53a15dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rpc2/server.go: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: RPCServer (59 blocks, 17-1290). The bar is 500 significant lines; this is 188 over it, 1.38\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":"service/rpc2/server.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fdca479729c2731f31ca9e474596c43097eedaf1a79f6d7b3cad5ab78e69a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: godwarf/type.go: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 179 over it, 1.36\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":"pkg/dwarf/godwarf/type.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e207cff3eb23852820c54877ec671135912487ba889d20b6845338da675bbc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Target: TooManyMethods \u2014 40 methods, declared across 5 files: proc/target.go (23), proc/breakpoints.go (9), proc/dump.go (4), proc/stackwatch.go (2), \u002B1 more file(s). The bar is 30 methods; this is 10 over it, 1.33\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":"pkg/proc/target.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9c54a79a21e42a84b64b6a4ea493b52bcfbd895d97a09fbd1f7ece98ec2f5d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: gdbProcess: ClassTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods, 47 blocks, lines 144-1664. The bar is 400 significant lines; this is 101 over it, 1.25\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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4013ba0b7849c5231508b87b7bbeff912e5ce0a37b6e6815f48bdbac62d198a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/proc_linux.go: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/proc_linux.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00c4299a9fc2442670c5a6ede9061c939201e7286f71cbfc37fae5d26ad7d2a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: compileCtx: ClassTooLong \u2014 498 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods, 20 blocks, lines 31-885. The bar is 400 significant lines; this is 98 over it, 1.25\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":"pkg/proc/evalop/evalcompile.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd8bd6c7ff367097babeb1b9c08477b37ee071363f9d655429ffcc982ab1778"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: _RTL_USER_PROCESS_PARAMETERS: TooManyFields \u2014 37 stored fields. The bar is 30 stored fields; this is 7 over it, 1.23\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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"367593aff6fb322fc5b14bd49262164e75de863c7177b8f14c475c8f7b14f6ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: proc.sigtrampContextDarwinAMD64: FunctionTooLong \u2014 sigtrampContextDarwinAMD64 runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf7a0e5f3917da86a39b73955d463f95e01177574106f3b4fbdad63ba30cba5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: evalop/evalcompile.go: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: compileCtx (20 blocks, 31-885). The bar is 500 significant lines; this is 105 over it, 1.21\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":"pkg/proc/evalop/evalcompile.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5098d4b9001df6ebc725229c48026d8e159c858ff362b9dfcdc5a212448d6d21"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: process: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"pkg/proc/core/core.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b43376704763ce406acb4befa4e658fe3921a0834e1f6f9fe06f8eb7f2d193"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: native.trapWaitInternal: FunctionTooLong \u2014 trapWaitInternal runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbd20518f12b6973b41abf80b339d5022283e919c33300bee7971fd5d3b040e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: processGroup.waitForDebugEvent: MethodTooLong \u2014 waitForDebugEvent runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6163e94aa2c038dabb27237a59a7a30eccff96d18bf29016d9f8040f61527ff4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Commands: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods, 29 blocks, lines 86-3407. The bar is 400 significant lines; this is 61 over it, 1.15\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":"pkg/terminal/command.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1be7b12da617aa356c82dec360206ef165658965de26d2f8e7ef9899ef54ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: proc.arm64SwitchStack: FunctionTooLong \u2014 arm64SwitchStack runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"pkg/proc/arm64_arch.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d046bf2114fb57a939c27a936a6c9d055d632e722e93b16b1d1b8dee2f6a498e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Term: TooManyMethods \u2014 34 methods, declared across 2 files: terminal/terminal.go (27), terminal/command.go (7). The bar is 30 methods; this is 4 over it, 1.13\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":"pkg/terminal/terminal.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a507b4001dbbdf866f859667a3914ca15d4d839f6999606e64eaf93694f00ada"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Variable.loadValueInternal: MethodTooLong \u2014 loadValueInternal 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":"pkg/proc/variables.go"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28130d2dad0e957c61596001c0b957d3d65f8bd33329eb7d3abdc55206cc527"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.childrenToDAPVariables: MethodTooLong \u2014 childrenToDAPVariables 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":"service/dap/server.go"},"region":{"startLine":2875}}}],"partialFingerprints":{"codehealthFindingId/v1":"8806271c90703f59af3cc02449783e08099c5ce9f271a62696e1f8a532d469f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: terminal/terminal.go: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: Term (28 blocks, 58-832). The bar is 500 significant lines; this is 47 over it, 1.09\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":"pkg/terminal/terminal.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7ad7febbf93610700021c1196a21b79e633f002c05165105d9b17a3e463850"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: terminal.setBreakpoint: FunctionTooLong \u2014 setBreakpoint runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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":"pkg/terminal/command.go"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"986b0851592a71bad648283ce7d9f091592691bacf6993f5c110ea4e81be3fd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cmds.execute: FunctionTooLong \u2014 execute runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c1add65b35809d67175446c4e30f44336ba8cc7135e337b12de48757314758"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalScope.evalCallInjectionStart: MethodTooLong \u2014 evalCallInjectionStart runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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":"pkg/proc/fncall.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d186dc95fec02d3824ffcf755ab4de46e036d75396830d2441facd84ce63097b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: nativeProcess: TooManyMethods \u2014 32 methods, declared across 6 files: native/proc.go (16), native/proc_linux.go (10), native/proc_windows.go (3), native/dump_linux.go (1), \u002B2 more file(s). The bar is 30 methods; this is 2 over it, 1.07\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":"pkg/proc/native/proc.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffefbca4137199dcf0248ed6c86f1ef0aa353c1fc9b8cb7a23925d57609cccd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RISCV64PtraceRegs: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\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":"pkg/proc/linutil/regs_riscv64_arch.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6f263ac0743072ec2a014b698d80090082131aa36f8865fe69a3c23ba3fb4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/proc_windows.go: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 33 over it, 1.07\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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"654e37676cf8532f52f15c41e301e8cc978805a61ee896ce87100b116f7bced6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Term: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods, 28 blocks, lines 58-832. The bar is 400 significant lines; this is 26 over it, 1.07\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":"pkg/terminal/terminal.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5728324a3f3e671c8fc106206cfcfc4019e769179a376c8e7dce72d2c29761"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: proc.rangeFuncStackTrace: FunctionTooLong \u2014 rangeFuncStackTrace runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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":"pkg/proc/stack.go"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69a073e487f72d53fd782ab7f9d7f080047865e3049ef1696a5477a7d7c4049"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RPCServer: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded), 58 methods, 59 blocks, lines 17-1290. The bar is 400 significant lines; this is 18 over it, 1.05\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":"service/rpc2/server.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ee9ce95ebfe247ee98dd333f0ccf88f53900930937d30b35904e346abd7a80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TargetGroup: TooManyMethods \u2014 31 methods, declared across 3 files: proc/target_group.go (19), proc/target_exec.go (8), proc/target.go (4). The bar is 30 methods; this is 1 over it, 1.03\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":"pkg/proc/target_group.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3ef880e44c29db692b09020f0168f185ca75bb71ac68e59c1c9c79e4528185"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Arch: TooManyFields \u2014 31 stored fields beside 9 methods. The bar is 30 stored fields; this is 1 over it, 1.03\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":"pkg/proc/arch.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fa82bab37100a2313bdb7b8a0fb883df58da367903cc7938d6e89c6fc4fdfa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Variable.findStructMemberOrMethod: MethodTooLong \u2014 findStructMemberOrMethod runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"pkg/proc/eval.go"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"f324103004f953fc261395231365b1fc6326cf50e3061ce331f7d41fd4f577ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: proc.funcCallStep: FunctionTooLong \u2014 funcCallStep runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"pkg/proc/fncall.go"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"be99dfd9b5d1efd3163b842a2e598cc83d643417801a39576c63b6fff5369bfa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: stackIterator: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods, 16 blocks, lines 224-886. The bar is 400 significant lines; this is 4 over it, 1.01\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":"pkg/proc/stack.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5617dc738d0d11d9c0e69c4d9d4d9e69102348014afbf56ce88cd9264875532d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (51 shared lines): pkg/proc/arm64_arch.go:147-356 | pkg/proc/ppc64le_arch.go:105-229 \u2014 These two members are variants of one another: 51 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/arm64_arch.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b789a0dc1953b6d7fc58b160d284122fca0d04347d6a62fbce03e5b57dcf6f63"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): pkg/proc/amd64_arch.go:50-129 | pkg/proc/arm64_arch.go:61-142 | pkg/proc/i386_arch.go:43-116 | pkg/proc/loong64_arch.go:48-115 | pkg/proc/ppc64le_arch.go:49-100 | pkg/proc/riscv64_arch.go:51-134 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15548776ea6630b9efbcd6797f1bb912bb9dea9cb47a15f075bb60838cdccdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): pkg/proc/amd64_arch.go:136-260 | pkg/proc/arm64_arch.go:147-356 | pkg/proc/i386_arch.go:119-186 | pkg/proc/loong64_arch.go:119-251 | pkg/proc/riscv64_arch.go:138-280 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee21c98139253c952556f6a72f145b4cc32d963d9bf5159ff9739a1f64de370f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): pkg/proc/linutil/regs_amd64_arch.go:59-105 | pkg/proc/linutil/regs_arm64_arch.go:37-90 | pkg/proc/linutil/regs_loong64_arch.go:42-99 | pkg/proc/linutil/regs_ppc64le_arch.go:79-142 | pkg/proc/linutil/regs_riscv64_arch.go:71-126 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/linutil/regs_amd64_arch.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"078a897e9dcc9282c700d81ec35be2b30cc768892e2e8ff1f2ca5b9ebf3c05a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): pkg/proc/stack_sigtramp.go:116-213 | pkg/proc/stack_sigtramp.go:215-284 | pkg/proc/stack_sigtramp.go:286-327 | pkg/proc/stack_sigtramp.go:329-372 | pkg/proc/stack_sigtramp.go:374-480 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac132b1d9a0c6c762fc8d6de22dfa79ce8f281210f4307e1d0031144d00f4d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): pkg/proc/linutil/regs_arm64_arch.go:126-146 | pkg/proc/linutil/regs_loong64_arch.go:140-163 | pkg/proc/linutil/regs_ppc64le_arch.go:145-165 | pkg/proc/linutil/regs_riscv64_arch.go:168-191 \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":"pkg/proc/linutil/regs_arm64_arch.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb5210b492898998ffe7f4d296400f5c1f425022be9eb641af4575ac1ba2a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 59\u002B corresponding lines): pkg/proc/fbsdutil/regs.go:186-252 | pkg/proc/linutil/regs_amd64_arch.go:160-228 | pkg/proc/winutil/regs_amd64_arch.go:290-348 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 59 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":"pkg/proc/fbsdutil/regs.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4ba79aafce942ecd7e5db767a23320d0f75ffc8203469d757cdbc49da9a2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): pkg/proc/bininfo.go:2635-2687 | pkg/proc/bininfo.go:2691-2743 \u2014 These two members are one piece of code written twice and then edited apart: 53 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":"pkg/proc/bininfo.go"},"region":{"startLine":2635}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee2fbf0fbc879fee0f5833f651dd0227a04c7f07cea453bd944d2d63c40b8b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): pkg/proc/gdbserial/rr.go:73-124 | pkg/proc/native/proc.go:440-487 \u2014 These two members are one piece of code written twice and then edited apart: 48 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":"pkg/proc/gdbserial/rr.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4071e53a081deae87256e637f563b7c4c029b6298cd865148467f250ef00e3f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): pkg/proc/eval.go:1905-1936 | pkg/proc/eval.go:1938-1978 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"pkg/proc/eval.go"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"a694ba127ad95bceb2e1e629ea93255efd7703e562a76ab9d0d5ad258d52c8f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): pkg/proc/amd64_arch.go:332-363 | pkg/proc/i386_arch.go:222-247 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"pkg/proc/amd64_arch.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7fab345ed47849d14c5a900798eb08d7582614e6bb8701bd34b5fbe493ca0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): pkg/proc/amd64_disasm.go:25-41 | pkg/proc/arm64_disasm.go:184-199 | pkg/proc/i386_disasm.go:23-42 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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":"pkg/proc/amd64_disasm.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cff277e71d0a51c541f94042bffb7f257cdb0c101ec0ae98e423a69dfc92c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): pkg/proc/linutil/regs_arm64_arch.go:148-180 | pkg/proc/linutil/regs_loong64_arch.go:165-198 | pkg/proc/linutil/regs_ppc64le_arch.go:167-203 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 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":"pkg/proc/linutil/regs_arm64_arch.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4870700c36a7ec6939993b97e8d736a15a6b5288d46a69fb7ff6540b5f4e339"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pkg/locspec/locations.go:626-649 | pkg/locspec/locations.go:652-668 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"pkg/locspec/locations.go"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e101b42f0758e4ced2d1a2aaf6260f243bc18b61ba8afabdd5a0ada159d85b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): pkg/proc/fbsdutil/regs.go:164-184 | pkg/proc/linutil/regs_amd64_arch.go:138-158 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"pkg/proc/fbsdutil/regs.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fcaa0257c64074acc779aa7d5e9d97f86722865f4b41b39811ce7383d17ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): service/debugger/debugger.go:1393-1422 | service/debugger/debugger.go:1630-1658 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"service/debugger/debugger.go"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"235fc96a3ece6f4588be09a4bf73f77d18498d14b35589a5cc08c1b07037e05f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): pkg/proc/amd64_arch.go:20-48 | pkg/proc/loong64_arch.go:17-46 | pkg/proc/ppc64le_arch.go:18-47 | pkg/proc/riscv64_arch.go:20-49 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 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":"pkg/proc/amd64_arch.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e973e63a8935adf50830d671354b75b06a9a5f5902b8bad2ca4e7071c0a80ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): pkg/dwarf/op/op.go:290-314 | pkg/dwarf/op/op.go:316-342 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/op/op.go"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"457ff5fc293d02ea030d350519e1918f91f4d0a2c7528fa0e8c38f56d739ed90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): pkg/proc/gdbserial/gdbserver_conn.go:482-502 | pkg/proc/gdbserial/gdbserver_conn.go:523-547 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6fe4075df4d05af8f3f7d9292b330535c215bfc9957710b452a9a6eabe823b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): pkg/proc/native/proc_linux.go:712-737 | pkg/proc/native/proc_windows.go:536-565 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd36fb02ac4c64c94759e26c538ac878485a93f8d2431461bd6c244a1847e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pkg/proc/native/ptrace_linux_64bit.go:13-22 | pkg/proc/native/ptrace_linux_64bit.go:25-34 \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":"pkg/proc/native/ptrace_linux_64bit.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cec3b4b26be9ebd647a180ee7053a2841c42bf643777abd81c8dd9766030a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pkg/proc/eval.go:2029-2046 | pkg/proc/eval.go:2048-2065 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"pkg/proc/eval.go"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cbe92c6a51c4caacf96d8b09e635c2176ba6af09b12eb009f9380bff4a14f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pkg/proc/eval.go:2751-2767 | pkg/proc/eval.go:2769-2785 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"pkg/proc/eval.go"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc7b154374152be7223018b08dfa804a100c59a2e29aeb426c476044b99eea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): pkg/dwarf/line/state_machine.go:330-355 | pkg/dwarf/line/state_machine.go:359-380 \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":"pkg/dwarf/line/state_machine.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0934ea31bffa4007c3ea575af2c510ecd22aad69a2a036503b38dfc8f7670c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): pkg/proc/breakpoints.go:943-965 | pkg/proc/breakpoints.go:967-988 \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":"pkg/proc/breakpoints.go"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"6269305c50dced8e591d57574efab2b1890ffe82d3ee80ac87b88c8d36cbd98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): pkg/proc/variables.go:1822-1843 | pkg/proc/variables.go:1863-1884 \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":"pkg/proc/variables.go"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3af87691a43fabf73c27e88d5c7535f339ae59d4d3fada0cdc16fe52645db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): service/rpc2/server.go:343-362 | service/rpc2/server.go:375-397 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"service/rpc2/server.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0d1c8fa1a68c1abebbefd69725efe6a93a833ff7c8370d9824daf38fc6fbab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pkg/terminal/command.go:1647-1663 | pkg/terminal/command.go:1706-1722 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"pkg/terminal/command.go"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd29b57568851d5579d6f3dc9f92328ca6b1c7c8de07cef2dfc13dbd380a50dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pkg/proc/internal/ebpf/helpers.go:341-352 | pkg/proc/internal/ebpf/helpers.go:354-367 \u2014 These two members are one piece of code written twice and then edited apart: 12 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":"pkg/proc/internal/ebpf/helpers.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"33301eec8a58fafd8586fea842129a11b829e34f6b3a09a4b2e61afe51b087b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): service/api/prettyprint.go:404-427 | service/api/prettyprint.go:447-469 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"service/api/prettyprint.go"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"d616c845c2544fe054347129c5e67b07ad4a8c555b7791e79933eb28f459358e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): pkg/proc/native/threads_windows.go:106-123 | pkg/proc/native/threads_windows.go:127-140 \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":"pkg/proc/native/threads_windows.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca177d3baa843253e6104b644cb571257971ecdbe5181c93528a190f3903c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): pkg/proc/dump.go:402-417 | service/rpccommon/server.go:394-410 \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":"pkg/proc/dump.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd4a9dedddb344aafcc414af95380c524871f9a7d6c3a83a210abad6fe66f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pkg/proc/gdbserial/gdbserver_conn.go:505-520 | pkg/proc/gdbserial/gdbserver_conn.go:550-564 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"2286e70ffc0f9362915ef56eb942faf2416b5a5e1ac5723e7565fb2c815d7643"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): cmd/dlv/cmds/commands.go:658-670 | cmd/dlv/cmds/commands.go:927-944 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/dlv/cmds/commands.go"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42d2dd7f4f21dc7d9de79d57eb2c099ca7ac5f8373b6b68ab69312348a3ac44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pkg/proc/native/threads_linux.go:51-67 | pkg/proc/native/threads_linux.go:69-81 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/threads_linux.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18bde4ef7f4cd7ef62a94aaf9ebd78672acb3db6b5e51c2401b45fda48308d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pkg/dwarf/godwarf/addr.go:20-37 | pkg/dwarf/loclist/dwarf5_loclist.go:21-44 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"pkg/dwarf/godwarf/addr.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8da620e7bc98048241e49b31f0e2e74f5e71382bb1d4f6ac8f389c4c746366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): pkg/dwarf/regnum/arm64.go:41-56 | pkg/dwarf/regnum/riscv64.go:80-92 | pkg/proc/arm64_arch.go:367-379 \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":"pkg/dwarf/regnum/arm64.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d17b5a6284e146f9f78aa471b017c9ffc1f9ac937d58a7ea1a96f3162f358e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): pkg/proc/core/minidump/minidump.go:38-49 | pkg/proc/core/minidump/minidump.go:51-62 | pkg/proc/core/minidump/minidump.go:64-75 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"pkg/proc/core/minidump/minidump.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"53970a04a582a535ec2a6278032cba45928a69c1558a5acbbfd7e92fe238e2f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pkg/proc/gdbserial/gdbserver.go:1773-1783 | pkg/proc/gdbserial/gdbserver.go:1806-1817 \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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c4640367f23cd3191f787dfe0cb52e42f956bcbb04f572575730fbb4c96ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pkg/terminal/command.go:1479-1495 | pkg/terminal/command.go:1605-1625 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"pkg/terminal/command.go"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"479ec0ceb81a7e67bd4583976d57787ea2beca353c66291e577c82108d82e81e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pkg/proc/linutil/regs_loong64_arch.go:209-220 | pkg/proc/linutil/regs_riscv64_arch.go:368-380 \u2014 These two members are one piece of code written twice and then edited apart: 12 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":"pkg/proc/linutil/regs_loong64_arch.go"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6415fa817654b7b6ef5080fb6a979404137229a45b199088806e5101d729ed2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pkg/terminal/command.go:2389-2403 | pkg/terminal/command.go:2405-2419 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":2389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4b87d175a65bbef185148f608c44c3fc491588d59aec510060f9cd438b45ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): pkg/proc/amd64_arch.go:323-330 | pkg/proc/arm64_arch.go:388-396 | pkg/proc/i386_arch.go:213-220 | pkg/proc/loong64_arch.go:265-273 | pkg/proc/ppc64le_arch.go:243-250 | pkg/proc/riscv64_arch.go:294-302 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb29b8ae62aa1806c9a0e9df49aaea4714e12a9c45d0c0ac3aa7b4c6faf7f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): pkg/proc/bininfo.go:1936-1968 | pkg/proc/bininfo.go:1970-1983 \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":"pkg/proc/bininfo.go"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3da49a085dd32661308b784c8d551074c82e085c75524f9d7efde0cb756085d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pkg/proc/core/minidump/minidump.go:495-508 | pkg/proc/core/minidump/minidump.go:510-522 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/core/minidump/minidump.go"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f452348330be897baddb730dc632e2b13f147bdff104f8affb41e74b80ad758c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pkg/dwarf/op/op.go:384-390 | pkg/dwarf/op/op.go:392-398 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/op/op.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ee66374d387346619621f22f79e50413b02f0d9ed198bea8d34eb537ccdb39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pkg/proc/eval.go:715-726 | pkg/proc/eval.go:729-740 \u2014 These two members are one piece of code written twice and then edited apart: 12 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":"pkg/proc/eval.go"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbf2cf8a53ff31bff094013fc904338c89e7b37a931a83d7ad9cfe2bb6c59ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): service/dap/server.go:4267-4278 | service/dap/server.go:4293-4306 \u2014 These two members are one piece of code written twice and then edited apart: 12 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":"service/dap/server.go"},"region":{"startLine":4267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2c1ee1629c4d995be9e5fc6a444ad54bbb222f0a4512e1bc5bd42f9fd16b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pkg/proc/loong64_arch.go:275-289 | pkg/proc/riscv64_arch.go:304-316 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/loong64_arch.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5ed6c891229dfc4624d7b760e3cd9adea660c08272349c05d05c2c09606dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): service/debugger/debugger.go:2078-2093 | service/debugger/debugger.go:2211-2225 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"834719b0923ca662dedd1347182a9b0bd2269451304e5e8fd65bd1a54f060c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pkg/proc/bininfo.go:3082-3093 | pkg/proc/bininfo.go:3095-3104 \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":"pkg/proc/bininfo.go"},"region":{"startLine":3082}}}],"partialFingerprints":{"codehealthFindingId/v1":"355ad580404fbbd0cbb0ecac5804d79349f87297d9ea2cbc205191277877debb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pkg/proc/dump.go:419-426 | service/rpccommon/server.go:412-419 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/dump.go"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b751a3ccd84252daea356fed24bc8b92a0c2f33785da761e882a5520cf1b159"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pkg/proc/native/proc.go:49-60 | pkg/proc/native/proc.go:63-73 \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":"pkg/proc/native/proc.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7430d9a17e7fd4e0a2382257ab1de5f6a64afe320b4a764d0995fa06d285ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): service/dap/server.go:2063-2078 | service/dap/server.go:2080-2093 \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":"service/dap/server.go"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5691539b898ff15a936f35f1199a322f1d2c5a56c193dd10bbfa20e0ccdbcf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): pkg/dwarf/godwarf/sections.go:19-33 | pkg/dwarf/godwarf/sections.go:40-54 | pkg/dwarf/godwarf/sections.go:72-86 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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":"pkg/dwarf/godwarf/sections.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5442959d8af1d1dbfa5053408ec802b4f51c28b94738192b54e72e62696e751a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): pkg/proc/arm64_disasm.go:227-233 | pkg/proc/loong64_disasm.go:168-176 | pkg/proc/riscv64_disasm.go:146-154 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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":"pkg/proc/arm64_disasm.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb0fa20393402302b82624302463386d76324001837cf3e4e3ad94f1453dee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): service/debugger/debugger.go:2096-2110 | service/debugger/debugger.go:2116-2126 \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":"service/debugger/debugger.go"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"6151cf03e2732a79493127494a972a95ac10fd79ac74c6d104bba2d7a5541ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): service/rpc2/server.go:540-547 | service/rpc2/server.go:559-566 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/rpc2/server.go"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d776f751d5c4e7cb3e26f1eccf6cd1b84c6cf8797128ec9f97aa2fcc15b1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pkg/dwarf/frame/table.go:299-312 | pkg/dwarf/frame/table.go:358-367 \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":"pkg/dwarf/frame/table.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4218115ac5bf784f75a54ceb7462b0b246185d6df16ba0146ceeb6c21faa1a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): pkg/proc/native/cpuid/xsave_x86.go:17-35 | pkg/proc/native/cpuid/xsave_x86.go:42-60 \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":"pkg/proc/native/cpuid/xsave_x86.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0faff78a7a7ca070ba6a290297d8950c89fd992b108e5f0bea80fed73fcbf3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): pkg/proc/loong64_disasm.go:143-158 | pkg/proc/ppc64le_disasm.go:117-132 \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":"pkg/proc/loong64_disasm.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"15951c17ac596cbfd305cb00b69ddda7902d09a0fe98b4f7faea9f095d289f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): service/dap/daptest/client.go:34-41 | service/rpc2/client.go:32-38 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/daptest/client.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb2ddf079219f6f9fc9bf5fc4863d642bdf238119c9488cb9c32c706c66481d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): pkg/proc/fbsdutil/regs.go:188-223 | pkg/proc/linutil/regs_amd64_arch.go:162-197 \u2014 before extracting anything, compare \u0060pkg/proc/fbsdutil/regs.go\u0060 and \u0060pkg/proc/linutil/regs_amd64_arch.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/fbsdutil/regs.go:188\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":"pkg/proc/fbsdutil/regs.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd8a8c50e9b779d442acf0e680aab046eebbcd06f2ec12f7aa06410958c69ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201335 lines \u00D7 3): pkg/proc/amd64_arch.go:221-255 | pkg/proc/i386_arch.go:147-181 | pkg/proc/riscv64_arch.go:243-276 \u2014 before extracting anything, compare \u0060pkg/proc/amd64_arch.go\u0060 and \u0060pkg/proc/i386_arch.go\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f0a8706076a2f7d0f922a3222b74e21a49281acfec0c802d21aacc2a5527e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): pkg/proc/arm64_arch.go:316-347 | pkg/proc/ppc64le_arch.go:187-219 \u2014 before extracting anything, compare \u0060pkg/proc/arm64_arch.go\u0060 and \u0060pkg/proc/ppc64le_arch.go\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/ppc64le_arch.go:187\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":"pkg/proc/arm64_arch.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"59189313bc6cc828f6f767070c715fe6ee61473133b8921435b3de93f6947c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201326 lines \u00D7 4): pkg/proc/arm64_arch.go:256-258 | pkg/proc/loong64_arch.go:212-237 | pkg/proc/ppc64le_arch.go:144-146 | pkg/proc/riscv64_arch.go:235-260 \u2014 before extracting anything, compare \u0060pkg/proc/arm64_arch.go\u0060 and \u0060pkg/proc/loong64_arch.go\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/arm64_arch.go:256\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":"pkg/proc/arm64_arch.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4539dc3c28b960c4d71db24618f15bdb1bc860e4be60bf22f14d0b521c16e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): pkg/proc/loong64_arch.go:154-193 | pkg/proc/riscv64_arch.go:177-216 \u2014 before extracting anything, compare \u0060pkg/proc/loong64_arch.go\u0060 and \u0060pkg/proc/riscv64_arch.go\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 159 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/loong64_arch.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d61f3a91ca12f258585b746db8bf39042579149652f3de46e6435c037e8be08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): pkg/proc/eval.go:3069-3091 | pkg/proc/variables.go:1181-1203 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/eval.go:3069\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":"pkg/proc/eval.go"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"0375e08f8d88bca1efe419405d81f67a02e9813bd93270566b3dcef8b3dc4e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): pkg/proc/amd64_arch.go:174-195 | pkg/proc/loong64_arch.go:172-193 | pkg/proc/riscv64_arch.go:195-216 \u2014 before extracting anything, compare \u0060pkg/proc/amd64_arch.go\u0060 and \u0060pkg/proc/loong64_arch.go\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8845e513f94e675fc64c4bd57fc874e0fc478517c7d58a52894589e9429a8fb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): pkg/proc/gdbserial/rr.go:104-124 | pkg/proc/native/proc.go:467-487 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/gdbserial/rr.go:104\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":"pkg/proc/gdbserial/rr.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc472450b793f972ed7bdebeab833d08500995d8ac322825e59c847043499987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): pkg/proc/eval.go:3044-3063 | pkg/proc/variables.go:1161-1180 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/eval.go:3044\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":"pkg/proc/eval.go"},"region":{"startLine":3044}}}],"partialFingerprints":{"codehealthFindingId/v1":"769615cd7489943c2753993f03a66c929ae54d9ec9a287feb169643e31543137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): pkg/dwarf/godwarf/addr.go:25-37 | pkg/dwarf/loclist/dwarf5_loclist.go:27-44 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/dwarf/godwarf/addr.go:25\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 \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":"pkg/dwarf/godwarf/addr.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f7f64c1386992390565746017841070690d0f2cb8f8768eb151c0174bd94ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): pkg/proc/gdbserial/gdbserver.go:1874-1891 | pkg/proc/gdbserial/gdbserver.go:1927-1944 \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 \u0060pkg/proc/gdbserial/gdbserver.go:1874\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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"390fab0dc1e86afd026d02d209e92a5eac8db637e67759454504492617772d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): pkg/proc/gdbserial/gdbserver_conn.go:1481-1498 | pkg/proc/gdbserial/gdbserver_conn.go:1528-1545 \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 \u0060pkg/proc/gdbserial/gdbserver_conn.go:1481\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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"171c3e809e970503a4e8fb30f4a6010e138b9279f71a9239f3f1abbcad785dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): pkg/proc/breakpoints.go:949-965 | pkg/proc/breakpoints.go:972-988 \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 \u0060pkg/proc/breakpoints.go:949\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":"pkg/proc/breakpoints.go"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3df3636d0e00f5c21f4eae7b9575c98311d040faec9b41045702a2905372b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): pkg/proc/loong64_arch.go:121-137 | pkg/proc/riscv64_arch.go:140-156 \u2014 before extracting anything, compare \u0060pkg/proc/loong64_arch.go\u0060 and \u0060pkg/proc/riscv64_arch.go\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 159 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/loong64_arch.go:121\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":"pkg/proc/loong64_arch.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5a71f227a6708982c5d2295200bd34eb7f465541a12a05cc5d1f66a5c3da69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 5): pkg/proc/linutil/regs_amd64_arch.go:93-105 | pkg/proc/linutil/regs_arm64_arch.go:78-90 | pkg/proc/linutil/regs_loong64_arch.go:84-99 | pkg/proc/linutil/regs_ppc64le_arch.go:130-142 | pkg/proc/linutil/regs_riscv64_arch.go:111-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/linutil/regs_amd64_arch.go:93\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 \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":"pkg/proc/linutil/regs_amd64_arch.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a5391a4de44c9a7b95862e9aba240d0f7e93c2ae9975b9631512d63c845b56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pkg/proc/gdbserial/rr.go:83-98 | pkg/proc/native/proc.go:450-465 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/gdbserial/rr.go:83\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":"pkg/proc/gdbserial/rr.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeab7bafc1b3ba6073236c89b83846dc21784f7bfd23b9b545865881ab8e672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/proc/arm64_arch.go:225-241 | pkg/proc/ppc64le_arch.go:117-131 \u2014 before extracting anything, compare \u0060pkg/proc/arm64_arch.go\u0060 and \u0060pkg/proc/ppc64le_arch.go\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/arm64_arch.go:225\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":"pkg/proc/arm64_arch.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"171d3e9a9508148158d9a241676e4b600c0a995f82ef6865b55bbf4357685e4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/proc/dump.go:403-417 | service/rpccommon/server.go:396-410 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060service/rpccommon/server.go:396\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 before the matched lines, \u0060service/rpccommon/server.go:395\u0060 calls \u0060Inc\u0060 and \u0060pkg/proc/dump.go:402\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/dump.go"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"268dd268c62e2c8f38a219a5f302ea7fad94cb88f08f4ed44fee8f476be6e149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/proc/eval.go:1641-1655 | pkg/proc/eval.go:1657-1671 \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":"pkg/proc/eval.go"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"24285beaa9e72284b1adf06f9c026f4a2845c6579c22b61ed6e02bcddc77e96d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/proc/fbsdutil/regs.go:165-179 | pkg/proc/linutil/regs_amd64_arch.go:139-153 \u2014 before extracting anything, compare \u0060pkg/proc/fbsdutil/regs.go\u0060 and \u0060pkg/proc/linutil/regs_amd64_arch.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/fbsdutil/regs.go:165\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":"pkg/proc/fbsdutil/regs.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cddd2a43d6428919a8a2c3153657a338ef3292ac875accff1e932330850ecd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/proc/loong64_arch.go:196-209 | pkg/proc/riscv64_arch.go:219-232 \u2014 before extracting anything, compare \u0060pkg/proc/loong64_arch.go\u0060 and \u0060pkg/proc/riscv64_arch.go\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 159 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/loong64_arch.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dd699f15c7991fa68af93e1ea19945ad159831729621a8d488e60f742b357b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 6): pkg/proc/amd64_arch.go:94-104 | pkg/proc/arm64_arch.go:105-115 | pkg/proc/i386_arch.go:87-99 | pkg/proc/loong64_arch.go:81-91 | pkg/proc/ppc64le_arch.go:74-85 | pkg/proc/riscv64_arch.go:99-109 \u2014 before extracting anything, compare \u0060pkg/proc/amd64_arch.go\u0060 and \u0060pkg/proc/arm64_arch.go\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/amd64_arch.go:94\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":"pkg/proc/amd64_arch.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afa7dc38f2670f0f4d6ab184ebd108ecd793c443a12979f5ad156a4174799d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 4): pkg/proc/linutil/regs_arm64_arch.go:136-146 | pkg/proc/linutil/regs_loong64_arch.go:151-163 | pkg/proc/linutil/regs_ppc64le_arch.go:155-165 | pkg/proc/linutil/regs_riscv64_arch.go:179-191 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/linutil/regs_arm64_arch.go:136\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 \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":"pkg/proc/linutil/regs_arm64_arch.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"103e63d25f87a2688af9ecd735cafb695f5d39db2256a5ae4855e8675bf5a7be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/dwarf/parseutil.go:30-42 | pkg/proc/linutil/dynamic.go:30-42 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/dwarf/parseutil.go:30\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":"pkg/dwarf/parseutil.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d2376eb334d498a5782ef0ceb2077bb4c5c4289ecbb6cdd15b55d472ff0a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/proc/stack_sigtramp.go:828-840 | pkg/proc/stack_sigtramp.go:907-919 \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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb5b438355299c5365fe5b92525f543913249c7e78e317faca5527d73711fdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): pkg/proc/amd64_arch.go:233-244 | pkg/proc/arm64_arch.go:277-288 | pkg/proc/i386_arch.go:159-170 | pkg/proc/riscv64_arch.go:255-266 \u2014 before extracting anything, compare \u0060pkg/proc/amd64_arch.go\u0060 and \u0060pkg/proc/arm64_arch.go\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a93e3a925e889ad4f7bb8ba5b808a126070e946a19eabd6efe5398dab9ece0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): service/debugger/debugger.go:1370-1380 | service/debugger/debugger.go:1394-1404 | service/debugger/debugger.go:1631-1642 \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 \u0060service/debugger/debugger.go:1370\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"144694877c6367e456bcc0540ddf390f7eef9fcf7e0d167ed2b79a3472297948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): service/rpc2/server.go:178-189 | service/rpc2/server.go:344-355 | service/rpc2/server.go:376-387 \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":"service/rpc2/server.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"593981e3bd0ad93b4bd1729fc6726506ff440b9d8dc11c5e40b861bf29805c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): pkg/proc/amd64_arch.go:137-147 | pkg/proc/arm64_arch.go:149-159 | pkg/proc/i386_arch.go:120-130 | pkg/proc/loong64_arch.go:120-130 | pkg/proc/riscv64_arch.go:139-149 \u2014 before extracting anything, compare \u0060pkg/proc/amd64_arch.go\u0060 and \u0060pkg/proc/arm64_arch.go\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/amd64_arch.go:137\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":"pkg/proc/amd64_arch.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db9e063fb9602d1dec89efb2e3fa034e5ef06ebbcce7ca83bb0889f1601c050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): pkg/proc/fbsdutil/regs.go:174-184 | pkg/proc/linutil/regs_amd64_arch.go:148-158 | pkg/proc/linutil/regs_i386_arch.go:130-140 \u2014 before extracting anything, compare \u0060pkg/proc/fbsdutil/regs.go\u0060 and \u0060pkg/proc/linutil/regs_amd64_arch.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/fbsdutil/regs.go:174\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 \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":"pkg/proc/fbsdutil/regs.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5343f3cf204798319563b87b3de49a098f6dc0330b9f76b8cbf6a529a8a9418d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/dwarf/regnum/amd64.go:134-144 | pkg/dwarf/regnum/i386.go:74-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/dwarf/regnum/amd64.go:134\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":"pkg/dwarf/regnum/amd64.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f24715ae0e5f048e67e0d640af7f6cae0aac0eea3741c4a923bfb4a2bd30625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/proc/arm64_disasm.go:64-74 | pkg/proc/ppc64le_disasm.go:103-113 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/arm64_disasm.go:64\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":"pkg/proc/arm64_disasm.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"39120df03fef800725bb9a62b6f05f1a04feb507a0c2a4fbba21405efb5aefbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/proc/stack_sigtramp.go:644-653 | pkg/proc/stack_sigtramp.go:704-713 \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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"497cf23960c555458d43420a80af0d6b89e195ca2bc7054d4e5852b3bf15d726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/proc/eval.go:1924-1932 | pkg/proc/eval.go:1957-1965 \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 \u0060pkg/proc/eval.go:1924\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":"pkg/proc/eval.go"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cacaf46017c7d5411f93dd90e0908fc92aea6ea847a332df8842ce1cc639cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/proc/evalop/evalcompile.go:746-754 | pkg/proc/evalop/evalcompile.go:776-784 \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 \u0060pkg/proc/evalop/evalcompile.go:746\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":"pkg/proc/evalop/evalcompile.go"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e85217430e9984ea3caaeb85a92d42afd60a6ebb4762f5ef0b67bd72fd2cf50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/proc/stack_sigtramp.go:356-364 | pkg/proc/stack_sigtramp.go:436-444 \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 \u0060pkg/proc/stack_sigtramp.go:356\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. 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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90edc57e436475aeee887e281e816fd59be50ba8f1bbdc09f9c89e36fe1cfb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/proc/stack_sigtramp.go:311-318 | pkg/proc/stack_sigtramp.go:357-364 | pkg/proc/stack_sigtramp.go:437-444 \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 \u0060pkg/proc/stack_sigtramp.go:311\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. 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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8daa7f49ed15730b347106550e500b66cd3a88529fb5a52707529fac954446e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/proc/eval.go:1591-1598 | pkg/proc/eval.go:1618-1625 \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 \u0060pkg/proc/eval.go:1591\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":"pkg/proc/eval.go"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e68a5e38e0234967872ec4ae01713832ba3cf77a6bcb8fca1fc130cd6d242be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): pkg/proc/gdbserial/gdbserver.go:1716-1724 | pkg/proc/gdbserial/gdbserver.go:1736-1745 \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 \u0060pkg/proc/gdbserial/gdbserver.go:1716\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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a082007144ddf66f7c5229d691247b8249f98cb04f0333cd2e380992242a7979"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/proc/stack.go:681-688 | pkg/proc/stack.go:734-741 \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":"pkg/proc/stack.go"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9ea8f68cd79130b4bd805a64509f1ecedbebaa94c56b02149fff097f139105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/proc/stack_sigtramp.go:538-545 | pkg/proc/stack_sigtramp.go:824-831 \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 \u0060pkg/proc/stack_sigtramp.go:538\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. 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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"784029999d2d3618626aaca0477a7894b01282261b7ad4f28a6f85d4fa30b13e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): pkg/proc/amd64_arch.go:198-205 | pkg/proc/loong64_arch.go:196-202 | pkg/proc/riscv64_arch.go:219-225 \u2014 before extracting anything, compare \u0060pkg/proc/amd64_arch.go\u0060 and \u0060pkg/proc/loong64_arch.go\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"pkg/proc/amd64_arch.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5025248e4e654d9c26cb51699e033813faeec8302902c35083e298ad67861248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): pkg/proc/arm64_arch.go:260-266 | pkg/proc/loong64_arch.go:215-222 | pkg/proc/riscv64_arch.go:238-245 \u2014 before extracting anything, compare \u0060pkg/proc/arm64_arch.go\u0060 and \u0060pkg/proc/loong64_arch.go\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/arm64_arch.go:260\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":"pkg/proc/arm64_arch.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99288cd9307b816aa25a866bb947f175ad098233739f19065e6b4698d788e0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/proc/amd64_arch.go:352-363 | pkg/proc/i386_arch.go:236-247 \u2014 before extracting anything, compare \u0060pkg/proc/amd64_arch.go\u0060 and \u0060pkg/proc/i386_arch.go\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/amd64_arch.go:352\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, \u0060pkg/proc/i386_arch.go:234\u0060 calls \u0060Sprintf\u0060 and \u0060pkg/proc/amd64_arch.go:350\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":"pkg/proc/amd64_arch.go"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1925367cb725c3f770ff73b4ac6cad48d384682aefc0c8513b05faee289e195a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/proc/dump.go:420-426 | service/rpccommon/server.go:413-419 \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":"pkg/proc/dump.go"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd2df0e5ac47ac6c9eb06185109c4f0de7f3ca6edde1e826fddcbeac324ea95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): pkg/proc/amd64_arch.go:51-75 | pkg/proc/arm64_arch.go:62-86 | pkg/proc/i386_arch.go:44-68 | pkg/proc/loong64_arch.go:49-59 | pkg/proc/ppc64le_arch.go:50-55 \u2014 before extracting anything, compare \u0060pkg/proc/amd64_arch.go\u0060 and \u0060pkg/proc/arm64_arch.go\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/amd64_arch.go:51\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":"pkg/proc/amd64_arch.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fc3c077072b27991a52e4b28f0d44f28145da0b67e4d7467728f2c79996aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): pkg/proc/stack_sigtramp.go:184-189 | pkg/proc/stack_sigtramp.go:261-266 | pkg/proc/stack_sigtramp.go:314-319 | pkg/proc/stack_sigtramp.go:360-365 | pkg/proc/stack_sigtramp.go:440-445 \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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51bc63bd2164f7af86032b891a9fc1d144be15d016642e459ab423c6f942f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): pkg/proc/stack_sigtramp.go:541-546 | pkg/proc/stack_sigtramp.go:827-832 | pkg/proc/stack_sigtramp.go:906-911 \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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdff405866c259b88a1b4dc8ed9a37b58c613350e95edf4f550787077e43a9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): service/api/prettyprint.go:386-391 | service/api/prettyprint.go:486-491 \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 \u0060service/api/prettyprint.go:386\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":"service/api/prettyprint.go"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfffeef984d2d5b8323bf0d3876ec916ca1f75984de05a604e453d0d0ae0c463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): pkg/terminal/starbind/starlark.go:106-110 | pkg/terminal/starbind/starlark.go:122-126 | pkg/terminal/starbind/starlark.go:140-144 \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 \u0060pkg/terminal/starbind/starlark.go:106\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":"pkg/terminal/starbind/starlark.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e14694d9f55b2f3cb306815b1f9e173b49eefacf6aee3d1708b0dec6e8a8cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): service/api/conversions.go:196-205 | service/api/conversions.go:217-226 \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":"service/api/conversions.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8586180ec0efc2097f5bc82e4f8a1ec6a093de7eebdad66abddce862dcf135"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/proc/gdbserial/gdbserver.go:816-822 | pkg/proc/native/proc.go:151-157 \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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"c172aed186fc7037976a0677ee3e730161bbeb893c7bc14567595f2b8c3795b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/terminal/command.go:2751-2756 | service/api/prettyprint.go:587-592 \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":"pkg/terminal/command.go"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ed5a8bc29d05008b0d6cf4c948bb981f2ac71eac0c30b798cb85a0b2c6fcea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pkg/proc/arm64_disasm.go:203-218 | pkg/proc/riscv64_disasm.go:121-136 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/arm64_disasm.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45af1c55a9f0a3b9f468efa61cbb4e3d4eafe47b469d8c72a1543d5d34f376b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/proc/winutil/regs_amd64_arch.go:267-271 | pkg/proc/winutil/regs_arm64_arch.go:140-144 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/winutil/regs_amd64_arch.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c81d48e88addeeb1f52ae26df6109d4fb3b9bf2b7fcf7afb7a451829d111651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/proc/bininfo.go:2649-2663 | pkg/proc/bininfo.go:2705-2719 \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 \u0060pkg/proc/bininfo.go:2649\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":"pkg/proc/bininfo.go"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f007308c369b1004f31804af77f95d970c39743cbd4c50497d9718d8de62a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/proc/bininfo.go:2667-2678 | pkg/proc/bininfo.go:2723-2734 \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 \u0060pkg/proc/bininfo.go:2667\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":"pkg/proc/bininfo.go"},"region":{"startLine":2667}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b8190d33cbffe5ad3f3435ea8359aa63f7c264959b20d5bcbfb3f6657d5b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/proc/eval.go:1911-1919 | pkg/proc/eval.go:1943-1951 \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 \u0060pkg/proc/eval.go:1911\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":"pkg/proc/eval.go"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"365c63e14baac64570889f0ae50e24998aaed4f54b56420dd14684855c465186"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/proc/eval.go:2752-2760 | pkg/proc/eval.go:2770-2778 \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 \u0060pkg/proc/eval.go:2752\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":"pkg/proc/eval.go"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"68abb606e11976a29f3da5e17399e58e611791caf03bb0066db7eb242417af0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): service/dap/server.go:1180-1186 | service/dap/server.go:1192-1198 \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":"service/dap/server.go"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab476a9bbd59d7f4a7f6e94bfd894f3c44fa1003c8930d5cdf57b663a64d5f75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/proc/gdbserial/gdbserver.go:2187-2193 | pkg/proc/gdbserial/gdbserver.go:2196-2202 \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 \u0060pkg/proc/gdbserial/gdbserver.go:2187\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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7563bd77b32daed22bc5480224170bbeee9eb1dc3b5f92077a6613a4644dfa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/proc/gdbserial/gdbserver_conn.go:492-497 | pkg/proc/gdbserial/gdbserver_conn.go:1036-1041 \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 \u0060pkg/proc/gdbserial/gdbserver_conn.go:492\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060annex\u0060 in one and \u0060conn *gdbConn) appendThreadSelector(threadID\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2246ccd39c7ccf084e034b297ace40b402c595dab3448319474d4d67122d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/proc/variables.go:941-945 | pkg/proc/variables.go:946-950 \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 \u0060pkg/proc/variables.go:941\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":"pkg/proc/variables.go"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a8083a7387bba1bec18ec7317f12538b35a5390ca8e0d07f9796af20b6874d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/proc/eval.go:1695-1699 | pkg/proc/eval.go:1717-1721 \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 \u0060pkg/proc/eval.go:1695\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":"pkg/proc/eval.go"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"3880c434da98f6b944463250b8bbc8aa729e7e1b93041b3c2650be9c041a3be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/proc/stack_sigtramp.go:191-198 | pkg/proc/stack_sigtramp.go:672-679 | pkg/proc/stack_sigtramp.go:850-857 \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":"pkg/proc/stack_sigtramp.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc95cdf703808d4e64dd428d689589fdf9dc3ae45ac65fd8f28d6e24087d16d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Reader (LCOM4 7): Reader\u0027s methods fall into 7 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 7 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":"pkg/dwarf/reader/reader.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de6845a178cfe3955e63e821ae24115364217ab54412cbd8661eb0e11bb0e79"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EvalScope (LCOM4 7): EvalScope\u0027s methods fall into 7 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 7 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":"pkg/proc/eval.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0530b7b434738590a19625a00015ebd00a43d1ab1ee5dad6e1b055fc8814f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Target (LCOM4 6): Target\u0027s methods fall into 6 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 6 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":"pkg/proc/target.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bb599067dedd5fa7f4a7644a3b750646f7bfd0720179ba7c33130efe331133"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Image (LCOM4 4): Image\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":"pkg/proc/bininfo.go"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b61d5a59e87600fac5906e7e07f4f3b7fda443e59a0ccde5cc4ff4abc37288"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: TestBreakPointFailWithCond: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022flaky\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command_test.go"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b0c481e4e7f859bbcfebc2994b2f5c1ec5137304c838f7b03f6ceec99edcaa"}},{"ruleId":"D12","level":"warning","message":{"text":"Dependency pinned to a stale untagged commit: go.starlark.net: Direct dependency \u0060go.starlark.net\u0060 is required at \u0060v0.0.0-20231101134539-556fd59b42f6\u0060 in go.mod \u2014 a pseudo-version, which pins an UNTAGGED commit from 2023-11-01, 3 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 \u0060go.starlark.net\u0060 and has not moved this requirement in 3 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 \u0060go.starlark.net\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":"e5562bb3c9b6923166f33d23762821dd74052373f139f2d07df1c9f473cb1590"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/proc/target_exec.go: pkg/proc/target_exec.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in TargetGroup.Continue at line 57. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:22:47 -08:00\u0027 --until=\u00272026-11-12 15:22:47 -08:00\u0027 --full-history --no-merges -- pkg/proc/target_exec.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":"pkg/proc/target_exec.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adffedf1531f328f1cdc42ee3b90dbb6b1f6cdc283c7a881a178b1f73ba6fe5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/proc/bininfo.go: pkg/proc/bininfo.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in BinaryInfo.openSeparateDebugInfo at line 1704. 2 of those changes were fix/bug commits, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:22:47 -08:00\u0027 --until=\u00272026-11-12 15:22:47 -08:00\u0027 --full-history --no-merges -- pkg/proc/bininfo.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":"pkg/proc/bininfo.go"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ba73f3c014bf925c01c642a195ef7c1d848981820e1fe3320cd2e805727982"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/proc/mapiter.go: pkg/proc/mapiter.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in mapIteratorSwiss.next at line 521. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 15:22:47 -08:00\u0027 --until=\u00272026-11-12 15:22:47 -08:00\u0027 --full-history --no-merges -- pkg/proc/mapiter.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":"pkg/proc/mapiter.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cad26e69a92a85a26f77523d5acae84279f7491e0e8f82e8e6d3c21387d010"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 5 significant file(s) lose their only recent owner: pkg/dwarf/op/op.go, pkg/dwarf/reader/reader.go, pkg/proc/stackwatch.go, pkg/proc/native/registers_linux_riscv64.go, pkg/proc/native/registers_linux_ppc64le.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ab083779450803850fb953b80e9fb9709b673c742f3d5c50bdd9a37641b40556"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: service/rpccommon/server.go, pkg/dwarf/line/line_parser.go, pkg/terminal/config.go, pkg/dwarf/godwarf/sections.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3b3188751e92d9295eaac163fda4c1f3524346eca3f696389d684ac6e52a4fca"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (13 single-owned of 133 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 133 of the 234 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: pkg/proc/arm64_arch.go, pkg/proc/native/threads_windows.go, pkg/proc/native/syscall_windows.go, pkg/dwarf/parseutil.go."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): if arg contains a running goroutines filter (not negated) \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":"service/rpc2/server.go"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d14dcd6f15a0a8237d32386343a756a298a0c30d0aa702631b81b9d84c6009"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: get byte order from debugger.target.BinInfo().Arch \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":"service/rpc2/server.go"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"c936d95f05d54d66ab7a33c5ab0456f551047e64f32a15336c9d3f5f333e2fcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(optimization): Consider using an iterator to avoid materializing \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":"service/debugger/debugger.go"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d25eabcacb8aaedb397851c1d6ef331e032f1771db955103951dc4cbcbecf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): what do we do if the user switches to a different target after starting a dump but before it\u0027s finished? \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":"service/debugger/debugger.go"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d020ae470d4dcdd850bcbcd7882021043b8538a3e05ed938ca81f6052f3caf56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(derekparker) exec.LookPath looks for valid Windows extensions. \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":"service/debugger/debugger.go"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"606ff6c02fcc23d68317320d4ff9fba27cc5294a138362219125ce6827935ce1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(fata): do not include the final panic/fatal function if bp.Name is fatalthrow/panic \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":"service/debugger/debugger.go"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19f6257746fad96eb054ea1667ac5ee9f943f9f8e620c8c17ae245cc54ae734"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This may cause inconsistency between debugger and frontend. \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":"service/dap/command.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5b2bc1f61d4581411d0c40cb0275d919f6bbbed9b4367f35052b9b7b74b075"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): move this to a different file/package \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":"service/dap/server.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f93ea3d3083db39e8ae39418c08b00cf9039219e0b8248bec81200b86db2d41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polinasok): clean up this and its reference (Server.args) \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":"service/dap/server.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"228c26f9d1b1c296ececb5a87dd38be15f05fb82d956413be78ac85c3ffa8543"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): consider 1024 limit instead: \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":"service/dap/server.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"722a94dc53af3b3d811c4ea67a6fd11259087358eea3816e97f5cb8afca173eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): allow new client connections for new debug sessions, \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":"service/dap/server.go"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a6bd258b0b1e07c13175f24e7ced00ee529f6c80e8dd7f3c38d3b144b2e2b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): consider using a channel for all the sends and to have a dedicated \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":"service/dap/server.go"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"3494fa39acc85fb2139b03cd245acb89280bac3a6ddf7454c1a57780000e0206"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): Respond with an error if debug session started \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":"service/dap/server.go"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4029d54ecff20be5aa9d33cf2d9b1ca309f979f3092e0b8d15bec5033ca7677"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): support these requests in addition to vscode-go feature parity \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":"service/dap/server.go"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"639adedb98a7ff398d24e3fe403a95fb529e0fd55e4e20f107701c9a15a84f54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(hyangah): gracefully terminate the process and its children processes. \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":"service/dap/server.go"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f608e06ff61ce03a065b48d4a6081879c5875d9d3c37546208163d0dd69c9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): should we always issue a continue here if it is not running \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":"service/dap/server.go"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f1e6a176135fb93191b5e8cf32687f22f7bafab3bea9a33dfba0326307f601"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): log exited error when the process exits, which may have been before \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":"service/dap/server.go"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cb82de8d31ce493f07b21f5658794e7809546c9ef2837bceee578dab0c0044"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@Lslightly): For DAP v1.68.0, Reason can be set to \u0022pending\u0022 when a \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":"service/dap/server.go"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87348277843e03abd1c19796c9bb10cee8b749df190a24026c3a3e5546aa308"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): Consider putting the selected goroutine at the top. \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":"service/dap/server.go"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e439e979cc5e5ad9a3544ff47631cbc3e505cf422810d160d026abb67056d0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): support SupportSuspendDebuggee when available \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":"service/dap/server.go"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e163eb156049a4ac49988d66ef130e6ef320a3e55bceea5057b26832d867017"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): consider differentiating between next, step in, and step out. \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":"service/dap/server.go"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15e37be39a080ec9cdaf4edfca41268ef04b2ee08ec2e23540da780610c1e8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): This is how vscode-go currently does it to make \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":"service/dap/server.go"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24848bebe0e9a93193ce4ce72b6103e2becd4aef47e04f79b3e8200c5fd12e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): consider convertVariableToString instead of convertVariable \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":"service/dap/server.go"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"61887f139837b741b51b7e9882c5f6abcbbe0c3820e57d61caaf7a7e87c5b709"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): should we support a special evaluateName syntax that \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":"service/dap/server.go"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2634547168c45240be7379a6506444cacbd187531b2bf9025b3e4eb15d233d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): Add evaluate name. Using string(name) will not get the same result because the \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":"service/dap/server.go"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"535af775ccc65d5da2b906658bce515be1eb99aa625d732e423dbdaaca39810f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): Get *proc.Variable object from debugger instead. Export a function to set v.loaded to false \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":"service/dap/server.go"},"region":{"startLine":3165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9c5d4b4fe048c88d57f2f1adc4cf23315fcfb5234db457feb2ec1d623a6b2a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): what is more appropriate? \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":"service/dap/server.go"},"region":{"startLine":3201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9d2baf8d185e1e5f503331b151ee1969631cbdad06b6315675a6444aa3f888"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): see if reloadVariable can be reused here \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":"service/dap/server.go"},"region":{"startLine":3204}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b57936c5183d25c5251586fb2572c2687d2150795f98297af2db24c60ac543"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): implement auto-loading here. \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":"service/dap/server.go"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"1057a9662c3d5703016bc4db5025794bb5bfb404f8d949b2b45ba99b88e0487e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Partially missing (TODO) \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":"service/dap/server.go"},"region":{"startLine":3261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19014139b9a4928211a8b8077c5d6bf39e77b3cf142761938ef5ef70657b815"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): users have complained about having to click to expand multi-level \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":"service/dap/server.go"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8150c12857e05d2c1bf07a7548d2310107b25e477b90e62018525a7904f5f695"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: investigate whether we need to increase other limits. For example, \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":"service/dap/server.go"},"region":{"startLine":3410}}}],"partialFingerprints":{"codehealthFindingId/v1":"9417e580c95e8e2cfe7bb68d98b3c95aded3eee8ec231a2ba04cedbd2d72cd57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): since call will resume execution of all goroutines, \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":"service/dap/server.go"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"579592d13775d166809da3c3dddd5b32642192fad759e09143f434ad551d78fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): once this is asynchronous, we could wait to reply until the user \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":"service/dap/server.go"},"region":{"startLine":3484}}}],"partialFingerprints":{"codehealthFindingId/v1":"233a10e608aeecd91080ef74967806a655da28a25bd9940ef0b7fd5d3a509779"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(deparker) handle args from the launch regarding re-recording. \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":"service/dap/server.go"},"region":{"startLine":3580}}}],"partialFingerprints":{"codehealthFindingId/v1":"7143b70b94c1236d597b253e21e7882b87197736c8ff07ec203e2861541e5cbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(hyangah): it\u0027s possible to set a non-string variable using (\u0060call i = fn()\u0060) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":3663}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d924fb6fc4b2256c683269438c06c8431fda9a041cf63e9356c20d298e18069"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(hyangah): function call injection currently allows to assign return values of \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":"service/dap/server.go"},"region":{"startLine":3669}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c59e3a2ec201dc447acb00f6bde91958b4201877c56fc2bc7808775af1d12b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: isn\u0027t it simpler to do this in s.doCall? \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":"service/dap/server.go"},"region":{"startLine":3678}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3b9ab635392fafa3717e4d05789ca2a98e42bf7459e83a59c864421885f817"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(hyangah): instead of arg.Value, reload the variable and return \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":"service/dap/server.go"},"region":{"startLine":3720}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccfe0809f58291007c4f0298778caa33ecc2e5559262fb61a4701069070f40c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): microsoft/vscode#129655 is discussing the difference between"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":3905}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bd86482de40c70d335309b2a6513d955694a91a436fe51dee94a9664ac17ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): consider adding fake addresses that would allow us to receive out of bounds \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":"service/dap/server.go"},"region":{"startLine":3915}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9129d50136b0e9040d09c2e87b2a3dfc1232fc6ff1515464203672134713b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): move this logic into the runUntilStop command \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":"service/dap/server.go"},"region":{"startLine":4516}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02f8a22a5e63f53f99e3aa75ccdc1cd9d2820a77c9311ea9b94c805afdcc7e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): This is a workaround for detecting hard coded breakpoints, \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":"service/dap/server.go"},"region":{"startLine":4626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ae3c4538e7e3b45ee8d78fbd18295534660a36130d9cb20efacb3c3af82ab3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): support individual braces in string values in \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":"service/dap/server.go"},"region":{"startLine":4750}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ad3566d3d8d7684b4fc60e8fff42ac412eae6944e589c5e5489faf4a0a9de4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): once https://github.com/go-delve/delve/issues/2259 is"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server_test.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cef4abcd5013fb2003709ce0b9480cd5f59c45b6d1d1d02c0248827bae6b25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO build mode, see TestFollowExecFindLocation in integration2_test.go \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server_test.go"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b33f7cc76041979ad83f46ef9ebdd79033ecc3c0aaf9e7740a4e66c7754599c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check all the frames. \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":"service/dap/server_test.go"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc110deb881b450c335bd474ed76e5ff19849b3c4ddd17a9485625f7a2d44440"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): how to test for \u0022nil\u0022 (without type) and \u0022void\u0022? \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":"service/dap/server_test.go"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"344035da108ee18302bdecf65d88b9f0970f35ef9965661b8063f4c8e49efdc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): how do I test for unsafe.Pointer(nil)? \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":"service/dap/server_test.go"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6e32d016e066a1744bb89b9f7c7377f3c9655a1ab06ccf2e9cd65d65123791"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): there should be children here once we support auto loading \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":"service/dap/server_test.go"},"region":{"startLine":2527}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e77186d176b813419327c2ce4b91edf2f75194799b4696ebb47ba706b510a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): there should be a child here once we support auto loading - test for \u0022aas[0].aas[0].aas\u0022 \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":"service/dap/server_test.go"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5948b1e8b105ce64e81ab5ea163f11cfcf18437be0043a7a40193efa0d08cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): this evaluate name is not usable - it should be empty \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":"service/dap/server_test.go"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4bf8c0c118a8dbc1af2bd1ce5fb7653ce616b9710ce779601b4d96324994d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): need fully missing array/slice test case \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":"service/dap/server_test.go"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f22823c176b7559014fcbea6454d68a418981fe59016c04e2417ca0e8c84e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): unlike main.p, this prefix won\u0027t work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server_test.go"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca644834e13f3835e6255d4bbeccb5dfb0688619f8ca399b8a5d678be7006b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): there is an existing issue that breakpoints with identical locations \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":"service/dap/server_test.go"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f853c4cd388c6923d74cbe8579d2096767400993de12b6921d9235156deb9c9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): We could return an error, but it probably is not necessary since breakpoints, \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":"service/dap/server_test.go"},"region":{"startLine":3502}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fa2bdbfbcc3b0a309c490e39054e1454ab04edb152e8d4bae10165768159c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): The dap server may identify some false \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":"service/dap/server_test.go"},"region":{"startLine":3903}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0a6d234ae366456681da8ebcfefdec39486ac5cd38190ebc3066e2e09b964e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): do I need to sanity check testBackend and runtime.GOOS? \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":"service/dap/server_test.go"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"272d5f8e75d94bf78483099b87b2de9bb953edb03a1cb85d39aa76c819973dbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: target switch \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":"service/dap/server_test.go"},"region":{"startLine":4715}}}],"partialFingerprints":{"codehealthFindingId/v1":"d463c0228115dd55114d605ef935216d355e56e48cb9be8be9394732ea6bed76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(suzmue): Get the exception info for the thread and check the description \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":"service/dap/server_test.go"},"region":{"startLine":5790}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b38eab6ee14043884bc926cd550193d01ceb7be21c2fd40eb003ac81f71b961"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): See if we can make this more like withTestProcessArgs in proc_test: \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":"service/dap/server_test.go"},"region":{"startLine":5886}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69c3e3d324667cedfba615e1eeaad63cffa045c006a6728338b27f0fafc23fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(hyangah): continue after this causes runtime error while resuming \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":"service/dap/server_test.go"},"region":{"startLine":7182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3666192c73beda0782cc17e55ec23dc96591ee9f72dfc937cd27c2ca46264e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack to test the inner connection logic that is used by a server that does. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server_test.go"},"region":{"startLine":7693}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eabfa6f8ef660733f53f87ecce0903d6eabd9f803bcd7146004cf39130e4868"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(hyangah): change this to \u0027validateLaunchMode\u0027 that checks \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":"service/dap/types.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e008e96477d2be9ff967d9e8fc213910768d202c973d1497ad01545ff3892adc"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: in go \u0027=\u0027 is not an operator, we detect the error and try to recover from it by splitting the input string \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee835e2409ce473b3ce05e42bb3aff4212d605d6bc5785c52d10264010529e09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: check for \u0027exit\u0027 \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":"pkg/terminal/starbind/repl.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d741b8395be2df28df7d5de54eeafcebe50f057c38c269995f379b9d5005c0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): builtin functions? basic types? \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":"pkg/terminal/colorize/colorize.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ed1c1bd11658a6606d621012cae33ef88414f21f1a4337294a4c69e8435eee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: disassembler support should be compiled in unconditionally, \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":"pkg/proc/amd64_disasm.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab244cda1936e5c366cba9d041496ac14d2c8982065f727c88560cfbd64641c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: disassembler support should be compiled in unconditionally, \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":"pkg/proc/i386_disasm.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"796bfed140bc52a6e299fbc5f9f75bbc0e62f757a8f3bd406fc24c1edacdfc66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find better way to determine proc arch (perhaps use executable file info). \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":"pkg/proc/bininfo.go"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f5f07488ee6dbcf8f5f899456c0c9c39a8b32401cae4bc112835478013568f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): handle DW_FORM_loclistx attribute form new in DWARFv5 \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":"pkg/proc/bininfo.go"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"815056c60687ba78d210624b470a78d2300ae949393e9d8630237554a623f7bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(chainhelen), need to parse others types. \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":"pkg/proc/bininfo.go"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"220cad5145bc4819c62f7b07a969f00c677d1ab252dfd155c0553ff35db5c846"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): what\u0027s the correct thing to do for plugins? \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":"pkg/proc/bininfo.go"},"region":{"startLine":3540}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be2f9ecc7d0d40a5229771ba0f28443bd6ce365a3c4d534c39fc1a1334c1264"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): inlined calls? \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":"pkg/proc/breakpoints.go"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"782ca60f845b906ef893edc6a930c41ae1eea9f9115b5783f15f35699a3a117e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): it is reasonable to expect to be able to watch string \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":"pkg/proc/breakpoints.go"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c5a9fd6b06cb12bb4d30f971f7e12f1cfa27a624f4121aa92483bda7650b8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): convert function entry into a function type? \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":"pkg/proc/eval.go"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"de49aecb1ad77448c678fb157d01ed54a812caacf51c88ebace69c71ad93824f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: slicing a map expression with [0:0] will return the whole map \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":2261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5187b9e94b5acafce27efdec0b3ba54970844e80a095faacef53808cdff11d5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): when struct literals are implemented this needs to be \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":"pkg/proc/eval.go"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2204733b00501650fe685f1b7ef7c4bf4f9043d2aa3a7862c2d5ac7ecb6623a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(derekparker) This, I think, creates a new bug where \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":"pkg/proc/eval.go"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90cabc1b1992296b5bf2c575b35cf86cf1c0c4102fc352174e90954076aef6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): at the moment we aren\u0027t using the ParamType and \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":"pkg/proc/eval.go"},"region":{"startLine":3317}}}],"partialFingerprints":{"codehealthFindingId/v1":"989ba804f623e9f5e4bc39729053b5eabf1ac33f2abcc2ba71ff98c4a0286181"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use target architecture endianness instead of LittleEndian \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":"pkg/proc/fncall.go"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"de794466b3aca47eb7749afeeca7322f5ac8ef7924a54d7989a94c9c8119bce1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): only apply the escapeCheck to leaking parameters. \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":"pkg/proc/fncall.go"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"90471e9d0dfeaa41d84d28cb48bb579323732f1955117a647cb053763a5f49a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): automatic wrapping in interfaces for cases not handled \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":"pkg/proc/fncall.go"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cc985f6b50959ab721c0eeb9b1e5b37d3c535e897ac0c1af2691973e93bcd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this generic for other platforms. \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":"pkg/proc/fncall.go"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff617d449dad789811ab1571d5b9490d24ef3c276797e2d5c3b0f87fdcf8dce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(chainhelen), need to check whether there is a bad frame descriptor like amd64. \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":"pkg/proc/i386_arch.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7722c61e5200d9770bf9b74c2174da11f5041ece31830563d95b7958f57c94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(chainhelen), need to support cgo stacktraces. \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":"pkg/proc/i386_arch.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc7bff9671516ac9dba73fab71b7eb7ba7c7ce273ac0d8b2bffef5541b387ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(chainhelen), need to support other OSs. \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":"pkg/proc/i386_disasm.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f313505fd352afb29d01742fd5d41a68d274a01701872bb9251563e83256392d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this needs to be \u003E hashTophashEmptyOne for go \u003E= 1.12 \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":"pkg/proc/mapiter.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7209755823fce5ee44547bb53340318e816da2842cbcb3895830cf5f20220064"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check that this hasn\u0027t changed after it\u0027s merged and the TODO is deleted \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":"pkg/proc/mapiter.go"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a0c5083458d1d0b8483813347020f4fb4ce19b83918acabd0479f6ce716bdd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is this save slot correct? \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":"pkg/proc/ppc64le_arch.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc6c5063728a1a9c0546315fb4215ef0591bccb1e778439bb4e6417a6b41646"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(derekparker): Add support for PE. \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":"pkg/proc/proc_test.go"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"0923505540e2185aa1451c2aef8375f995179c15fda1f17ba945588c8c5223df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(derekparker): Add support for PE. \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":"pkg/proc/proc_test.go"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"9531284833e8f64f8cd61f18a229b630b9b9d2f3a87de9ae3e95e358cdef7ee1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(qmuntal): seems to be an upstream issue, investigate. \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":"pkg/proc/proc_test.go"},"region":{"startLine":3766}}}],"partialFingerprints":{"codehealthFindingId/v1":"751384f8584135ea7887d8894839cb73f7ec485b8de5b226202c8e4b8857ff20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"pkg/proc/riscv64_arch.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacb57a5b91b9461f7375b8cd0893cba80a1edb429ea2b94bec213a3af327b0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(derekparker) it should be possible to still use some internal \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":"pkg/proc/target_exec.go"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9f494f755e7fa96ae46afbed982bbbae771ddf8e392aa4be990590633e32d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): if we want to let users hide functions \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":"pkg/proc/target_exec.go"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcbf6400e64b6cac5b840f374b5b6f709f5eccfcdc66568b0e42476a45f78ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(deparker): we *should* get an error here, but the one we expect in this test \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":"pkg/proc/variables_test.go"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eee59bad6f04a6e7f6defd2b4b7d6ef470b839d0c4ef9a73a407120099b540d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dp) might be better to malloc mem in C and then free it here \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":"pkg/proc/native/proc_darwin.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0018c4b861d9f2aeeea4a01504c8ab7cbd8e127f7beef9233a458f82c4045d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): implement this \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":"pkg/proc/native/proc_darwin.go"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fab31bf4a2b56a1498e93b01c34d772187bb7cb58a44e23ecdd6dce0b594451"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dp) alert user about unexpected signals here. \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":"pkg/proc/native/proc_freebsd.go"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5e795172f7170c555e095770bf85ecd244a04c3242619f86532aae4e158635"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dp) alert user about unexpected signals here. \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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"406325aaa1b5cffe97d4fe56d793fd1af759707d8ee17fc5631466fd8db3ab01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(derekparker) Since this means something different based on the \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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dc8ef7e3643878e2d4f359ba6f3ca77919c5f544fa9eac9b248e7a3c02165e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): if we want to give users the ability to stop the target \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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9b61a19ceb31e9e54d8040b7bda0e9f86154a99510bc3fb1c3066031bef07e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(derekparker): this whole thing could likely be optimized a bit. \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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5687d5e8cad12cd6dcfca0d39e604352c8e74000626adb7b98ced27c83d878"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Probably should have SeDebugPrivilege before starting here. \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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b00a700d9fd6d431571fc3bd2c543ede80d56b727830ea97dff6931558c2efb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should not have to ignore failures here, \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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79bfab488437cab087d55fffa969701498c37b2f7e9478ead89e11ad6019b9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle proc.ErrBadBinaryInfo \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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9511f8b238b7cb1f9d69daaa1e665998b1ef692bc58a2555fe1a7b562401cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: Handle debug output strings \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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8d8df39d8f687531597f6ec8ab053e5ff404772945c74d9680bcc10eef0944"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): when debug.Target exist Detach should be moved to \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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cbe89588077c515361aaaac996a3f41ce36ae23de6eef1f4f6ec197c60cf61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): when the register calling convention is adopted by Go on \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":"pkg/proc/native/register_linux_386.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94a457fbe90194ed4af3758156c0413ac91d83e43dfed1463f05aa68c6867ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): implement this to support function calls \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":"pkg/proc/native/registers_darwin_amd64.go"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b15dbde44b03fa724c425f67dcb1ed8d79fc5c683557e821497398160d01e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dp) set flag for ptrace stops \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":"pkg/proc/native/threads_darwin.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee498c3fe4d12e6b8227342e46e18f91f08f26e1ca11aa218a89bb4e2ee6c48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: calling cgo may overwrite $x27, read it from the kernel \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":"pkg/proc/linutil/regs_riscv64_arch.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"597b0f22a0f330705ec6e0477fec87cf5aba58cbe252d6aa943a531b674a6933"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(deparker): We can skip single stepping in the case of thread.BinInfo().Arch.BreakInstrMovesPC(). \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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f70c01ab58516ea6c7d85aea1f1ef2cc5b65df461f638cbdbbe7e994b8942f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(deparker): Can we support this optimization for the RR backend? \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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"376cd003edb4d48971f1d2b0e795d680f182e8bd7f34845da7e679b90735c794"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(derekparker): Use jstopInfo directly, if present, instead of \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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb2002971357ad5305d7cdd746a6ce41eb9a4daf637245e938d0271473cf512"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(deparker): There\u0027s an optimization here since we will do this \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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ea6e4f0dcbd9caf899d9d201b2044499f6ae35142d50298011b97f2dabc89f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): if we ever actually need to write something with qXfer, \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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08d4777d527f69b377a381886ba80be04713da03f94a17d8163fba75b460502"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(deparker): we can ask debugserver for the number of hardware breakpoints \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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac12db7387bf38e5a795042263975f00da301e046ed591da203b07be73d0718"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): do not send packets larger than conn.PacketSize \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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"776ed2f4fd105fe8bb532746684ecf09155daffa107074e65c06f23313f62c7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support 386 \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":"pkg/proc/core/linux_core.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bb3c41a4d010a3bbb714246b6eb062bf82748ec0231f1629b84e2c9ed454df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): mmap? \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":"pkg/proc/core/minidump/minidump.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff81cac5a666483942d0324cc9199a8b3518c7859e3de427e5a151706b4e72a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): this stream contains the exception that made the \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":"pkg/proc/core/minidump/minidump.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d759d1a3cf761c40cc4dc7206338f412e8ff437816dcbb6b24c6428279d33b60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(aarzilli): if xstate_bv.hasHi16_ZMM() is set then xstateargs[1664:2688] \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":"pkg/proc/amd64util/xsave.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c5fd167fa244c9cbb38c2680360dc739ec6a9ca2452d8cdb8d27c1748dc2a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: change this!!! \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":"pkg/proc/amd64util/xsave.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ea62e28a8df5b329730bffc69490f8469e254dbb2911bda5d0fb55778e90a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): this needs only the list of function we should make it work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/locspec/locations.go"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6519e13f3636db91084e705603357a3e77c56ce42fbb51c0280b1a2e9e18cc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): these constants probably need to be in a better place. \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":"pkg/elfwriter/delve_core_notes.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebcd5866ba66529f3d8d25ee633687bcdeff7bc74d50513d7b40c1b7dfd7ae3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rsc): Can also be TagEnumerationType \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":"pkg/dwarf/godwarf/type.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"08392c3bf878a5dcfee40934689d012468bc480e362b092e2b8b1ed0bc4d437e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should have original compilation \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":"pkg/dwarf/godwarf/type.go"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacd8fb3e8872813c6ada3b9580820085f6bb830565e94b755e7902d681bb531"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(aarzilli): this does not support 64bit DWARF \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":"pkg/dwarf/frame/parser.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79f07324351de80305d09c20a66335ba88e68e31452d1ac74eab942b4353404"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(derekparker) this test has to be a bit vague to avoid flakiness. \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":"cmd/dlv/dlv_test.go"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"5585b99aa1103a1588fea6934e67188e7cfc0d9fd3733d8b987a4516973e6339"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Perhaps we shouldn\u0027t be setting these default breakpoints in trace mode, however. \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":"cmd/dlv/dlv_test.go"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"096001a05dfb81e3738968fa00807610395973dc46a35349f14338c82ee5427f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(polina): support --tty when dlv dap allows to launch a program from command-line \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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c26f7aa93c21b4941a097f076e80dbfa9030046f2da5a2c735528a24bfa5f3"}},{"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 \u0060cmd/dlv/main.go\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/dlv/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecff5a7f1ad6219171b49abafa14afa71272721eb6d5776ce22226fce5ea0d1"}},{"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":"6ee9f9d57e12dce0fafc04d6757659d0f5b440ae46d67c3d5faa5869c936c3f9"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"e5781a1d0f5d983c645ddbc0ac96f8a2f783b7eb0ff0e7d869cb2b84b353ddb0"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"d0b9cb4eabca525996c2c459d55daf76e9c1c8d0f6cf8d2be7f704d7cf78ec41"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"6621ccc453b797dceddadb31dd02c8440deea748e6a321a521567c9f25009ddc"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"930026441901082a709cd802d34ac06627d64f24d554fdfada397d9c1bfd42ab"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"7b04dc7d3a019de83ead5888618f6587952deabec2ea958dd8e764cf3f75a9ec"},"taxa":[{"id":"CWE-242","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":"19e0bec2fd355ccadc775f41f65b7deb05084819f177f301a3772d85c22bbbb7"},"taxa":[{"id":"CWE-242","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":"7d4feadc1e78264f4fb536e7a08d845b2ae3c95dce070a9ae544b2c8938f0483"},"taxa":[{"id":"CWE-242","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":"3e496062ea4204f101c13b026115fa229e79ef4e6c1e08acf1029aca52ad3a75"},"taxa":[{"id":"CWE-242","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":"6e5a6eb6880427cb2cc4aca9e6708eb9bedfae5980bc61454ce494ad92d076e2"},"taxa":[{"id":"CWE-242","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":"0034aae46b2a9347574e6cc4762fa59d3ec884543d132a41b20191454dbdbb26"},"taxa":[{"id":"CWE-242","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":"7c083588fb817b626f9ae3ea54859780a205bb80ec972f07fd8654e7479bc89a"},"taxa":[{"id":"CWE-242","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":"78ea80a2aa91791498f346e2a3bc2f92a878943216ab32aeb797e8ed951e4363"},"taxa":[{"id":"CWE-242","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":"6708d56f29635e5fe16a0e2323a706410c659ff4fa8ea48a2d9ad5760265f4a8"},"taxa":[{"id":"CWE-242","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":"4bce61098e4e0107727ac33328393e3a7be5ede6ee2b4d361e04cf8418f04b9b"},"taxa":[{"id":"CWE-242","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":"962df89287e99e72c0c199da0439c1cf7bd5750be8a3e671ed8f03e40c1b89c2"},"taxa":[{"id":"CWE-242","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":"d7b98a9cb297bc10ded5a5188d26d43b2a64ef96dbba65457044869160eec353"},"taxa":[{"id":"CWE-242","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":"f60858f730c3484edd69d8b977a54389a5b416612e59b95e2ad7799d6930443c"},"taxa":[{"id":"CWE-242","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":"1382e695d525a4f92bdd00c6aebdeaa8a231517c679f3e01bfe17021b5fb276f"},"taxa":[{"id":"CWE-242","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":"4331c23ec234ac86876929de3b88859bf51a75b909a0cda00b127f596ee68c6e"},"taxa":[{"id":"CWE-242","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":"9cfd215cb0d639e467f757acf73f590c46542aee6ac5426612ad09e0426134b1"},"taxa":[{"id":"CWE-242","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":"bb5b59fc6fdcae645992135a5356a19e1d08a88872267ff2ec64ca1b29d01184"},"taxa":[{"id":"CWE-242","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":"28dec4e49a73f09834b64e6a76073a0471c0117daca3ab6b97bce47e398249bb"},"taxa":[{"id":"CWE-242","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":"67b659d9e415ce36be08111f39004d57862f29d9276ddbeda2d86810fd93753c"},"taxa":[{"id":"CWE-242","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":"0dd00db6b46c747da6b51297d6913a504424826f6bbf936663412bc7173121c8"},"taxa":[{"id":"CWE-242","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":"2741522d35a66776a68c356313c7f404f998ed6e89d35bf790b7415d69807bb5"},"taxa":[{"id":"CWE-242","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":"84f31788cb8e932072e9b2e0a6a79f19d8ba2734f41245dbe46c9632ec328c5d"},"taxa":[{"id":"CWE-242","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":"4a4c18c3cf65f9aa479b5b83bfbcb1566f894f92a76878e4d3f7db712e1ff57c"},"taxa":[{"id":"CWE-242","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":"059a9e20a10d8184820afc5e0081487d5591704fe2521c994cc675a7d698350b"},"taxa":[{"id":"CWE-242","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":"aad4a6203b5d5d950df7772f1a371cf055c83dd23f5936bb732946ddde6a7d40"},"taxa":[{"id":"CWE-242","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":"2d968256c9a170fd6501dd151e9ccd563a6fe1442cf2025a778004f2fb46fe5e"},"taxa":[{"id":"CWE-242","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":"474b470249ef337619c3cdf379c77fe07ec00fbd38c931b31b071b97330ac978"},"taxa":[{"id":"CWE-242","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":"13bde153aaf54bda8d0e19b267297c40bc0c7de2c147c0dbb623b07419d89cd3"},"taxa":[{"id":"CWE-242","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":"cf6f3fa40022b93afc55fb70de847f02056f9ab499c218946d7ce031bb918376"},"taxa":[{"id":"CWE-242","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":"dee738d1670456fe9bd5813f6ca3eb2615de93ff604f1d0e9f5829e6f06df308"},"taxa":[{"id":"CWE-242","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":"fbb0215a78b5bfefb2da69f8a59018a70b79ac64f9866a890434a689a94239de"},"taxa":[{"id":"CWE-242","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":"57a0e56654c10132c5dc4ec30d1e715a425a6580e0e1da1133553f8677b79758"},"taxa":[{"id":"CWE-242","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":"d7d2929fbfb7f34916949b09c732d794c49d675ff32ebe3a0dd48203540b3a00"},"taxa":[{"id":"CWE-242","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":"7885d7710911098e44c2a6cb1c10d2b163bfa04e2414f1b7e92c8008582d9bb4"},"taxa":[{"id":"CWE-242","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":"954ee5cb8b64da59fdb48159c72d93ac4c6a8905bdcb9e63ed716e75d79521fb"},"taxa":[{"id":"CWE-242","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":"7e2cb31c9a76aba5ae77de3a229466118707178769e5776fc2b880f62bae7fab"},"taxa":[{"id":"CWE-242","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":"bc669ae1618ed5cb7d6faa13cb7dc3e6e3dfc31ea9a7b97f326bef61ecf22d4c"},"taxa":[{"id":"CWE-242","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":"04b72571b99b9275820e8682994b9a663df6b02d92fe768301ccbffe83ab6cf5"},"taxa":[{"id":"CWE-242","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":"3e4a8f1495ce7701054ca0a9900b198fe74f52758725f24bf53046947e77fd55"},"taxa":[{"id":"CWE-242","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":"ddc6f1b2105b88848d8806841f012fb5978479183edbed5abc42b373e3d74064"},"taxa":[{"id":"CWE-242","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":"5e5e394eae0d82e2f58885cd886aab53ef4271333a6ef1dda06e31a466735a97"},"taxa":[{"id":"CWE-242","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":"a8521bfbea8bdddc9d81b9f03ac8e20dac86d84e019c68aa4fc15ed0c6bba01e"},"taxa":[{"id":"CWE-242","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":"87905d0aaa74eb01a3af41e117c66bb7d171d775bf755a44a31ceb07b9693d66"},"taxa":[{"id":"CWE-242","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":"eb0f415b13c64857da115ee859db9a4a8b387f1bdb4055e54b8f77e78e364e03"},"taxa":[{"id":"CWE-242","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":"4b308f8f115d1ec086fc8b42d7174a0e73d63822ebfd8ac2503bbe2887f6ee42"},"taxa":[{"id":"CWE-242","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":"a88dd2638ac27a67444a02a939cf2ec96c413c8692d039a05ea4ce34a9cda2d6"},"taxa":[{"id":"CWE-242","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":"566a6a49c6109d972eadb3cf28c3a245b6c7f667ff407e51a4678318f6109eb1"},"taxa":[{"id":"CWE-242","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":"3eb6e3d6fa8d41ca4458e56a9ad70f72c4f4f0acc7a9a0242f24b70b434d8084"},"taxa":[{"id":"CWE-242","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":"8546c066375696b8e500004c3b862ff97765278ba8dd45992f75dddb890ce2cd"},"taxa":[{"id":"CWE-242","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":"00a4e41c125e52b39be4302a0acaf666cedf2945307cc53512f3de4753b7620f"},"taxa":[{"id":"CWE-242","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":"9c00ca2e6c5053e755e2d2f176b0f5629bb3bf72e545db06ac57f483fce2537c"},"taxa":[{"id":"CWE-242","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":"566025d171262b439fb7ae18cfd2f137b62697e83f1df24e304732f29d867778"},"taxa":[{"id":"CWE-242","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":"5a99e56c64abaa4d288d4b3a431175d332f09ee201a54cb222870f0ee61f2a10"},"taxa":[{"id":"CWE-242","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":"050768e1405b7056b59706f744eef30a7b7cec379c927c39ab3d82818e841f1f"},"taxa":[{"id":"CWE-242","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":"f7548334da66bb62b835ef70a8a114c27e8351192146cddea3e66c0496fff3df"},"taxa":[{"id":"CWE-242","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":"3443c46c3c131bd4f2779dab654f07684755ba0c480095c84dd9a7d19c5328de"},"taxa":[{"id":"CWE-242","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":"3e4856f996c535f496a14f4dd84436698c679f6f209f3a9da3af74dbc8dd0f28"},"taxa":[{"id":"CWE-242","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":"dbc206f04a623b1d162931a74349607171da60898f3c66b5f660af0c18c0077f"},"taxa":[{"id":"CWE-242","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":"cf4dc4f10b5d65048434d27cf057e2c9e372c5553d13fd78d89bad56d0ec4445"},"taxa":[{"id":"CWE-242","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":"9bcf969344772ef441acf98159940c03df5bec5ac06ac43bb00f34b017f42e7d"},"taxa":[{"id":"CWE-242","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":"9c723245e8a5b0f12b16e59bd6595b3dbf5d5b12257c66af3c3e56e9a4d3a14e"},"taxa":[{"id":"CWE-242","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":"05beca8ac37ac55ca5698068a0f6ee0ed1e5c70d884ee17772abb0087fcb21f6"},"taxa":[{"id":"CWE-242","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":"041798a4cf1323ee41e57f9b3c1cd22fc031f09c11477bd378f7c87cce0b618d"},"taxa":[{"id":"CWE-242","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":"a45feb7a0591d562a925cbeb3dfb85f3bab29528c9b24a5769f108b76bd24337"},"taxa":[{"id":"CWE-242","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":"eebcfc252fe31aac7cc5472da603cb63da73327719e5e0fd9c6782dc817a9fd2"},"taxa":[{"id":"CWE-242","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":"4e08a401ea3a86b58f5a7b47ea7cb2e8bdcb198de0aba961145b4a8991ed2a3d"},"taxa":[{"id":"CWE-242","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":"dbcd227414775d473c91785d73de4a2e4fccc6642e0112af6722fee6b498ef11"},"taxa":[{"id":"CWE-242","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":"6aabac2179513a9f0106d483c037ab6805c9b173731fcd97e715ff795e2c2e2a"},"taxa":[{"id":"CWE-242","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":"1dd7fbce2313597055c97e855d7c5aa7ac1187454917f6c300ebaf48297179ad"},"taxa":[{"id":"CWE-242","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":"df57d7accede1881516fba0d915ee3f42c535ae581db2baa81b27923f3f0eeac"},"taxa":[{"id":"CWE-242","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":"f19ba6a7b33e528aa479f0db548468001ed4aa6d57fc98a50f7609b45e0f41e9"},"taxa":[{"id":"CWE-242","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":"92be782070d63ce1f311ef2c0efc78ad63c2be796bf765c03526077372f0345e"},"taxa":[{"id":"CWE-242","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":"9a53f587f76225a4cd867beb94313a16306009a6cc566e19461c526ac4a3d89b"},"taxa":[{"id":"CWE-242","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":"67c6a7f401806157a2c7aad90a7d56c84d6c941c27c9b749ae4e49da6bffc657"},"taxa":[{"id":"CWE-242","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":"7a37914440f4057f3254d82a9d446e12aecc216acd1bddd8a0fc198510154636"},"taxa":[{"id":"CWE-242","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":"3ad2a2b203b5d20bf2f4e94dab83f4aa2bc260d08be6edf88462fefb4d233154"},"taxa":[{"id":"CWE-242","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":"2ade33bccfc15e09b40d555b0fc80b084a1d080da5823a7ff3ff7d02d3d249e0"},"taxa":[{"id":"CWE-242","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":"b9b6f259607b722e990a2c2c93565ccea4a5b65876f791dcdca398a36e7ef68d"},"taxa":[{"id":"CWE-242","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":"390836ea87c4ceef91b8594fdf43992174ac28ea324c7431e171d78b62035433"},"taxa":[{"id":"CWE-242","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":"b886d7616cee3f3bac3a80e7d8c3dd54034ad9384932946d1450322c21d5b58b"},"taxa":[{"id":"CWE-242","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":"19b56463f41d1a34ba5a15e5ac45e6098ea5f20172f53c2af05f2a381dc8f6be"},"taxa":[{"id":"CWE-242","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":"1cf477f600709037b900ffdf51dc05f2cfd38ed44745f28c458dd3702c434d67"},"taxa":[{"id":"CWE-242","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":"747c6325d0533c34ca318d5e18a9c40d27fb0943fea6d6d39054397a71c234bc"},"taxa":[{"id":"CWE-242","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":"654affa0adba6e39abe9b3f66ca2c802b1b99998a3c69a90c7b6b3e873b6e372"},"taxa":[{"id":"CWE-242","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":"29d167caff527e93c0f669ad9e9bb84f6faf121e452d30b8e9ee0b2a40fe5a0b"},"taxa":[{"id":"CWE-242","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":"b748de5d59b6bbf0d4d281e9611e4ffc8662d5f365f29664dacccd0ef9b27ed5"},"taxa":[{"id":"CWE-242","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":"0780168907d13047df270beccfbebbd1a8916301078e2210a52e8151aa9d0e4e"},"taxa":[{"id":"CWE-242","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":"cf1855bde662579657b85f0adcf5bbb6ffa6a59174da413057acf772108e645f"},"taxa":[{"id":"CWE-242","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":"4dbeb1a20115a370ad6b81fca2aede5d3a5f1dee7840afb566278c0350062f2d"},"taxa":[{"id":"CWE-242","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":"637b2365214d631f9ac67f70ef0ed6f24fe7ed6b12527a0209fa24fd6fd1ead8"},"taxa":[{"id":"CWE-242","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":"915e0c2f860e817f1dac2edb7d9d9c1db3a994d5e74edc257f5043093002e685"},"taxa":[{"id":"CWE-242","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":"362f704e38c7fee6d5754e7abf396a7a26ed170ef35bde4cee446cc2691a2316"},"taxa":[{"id":"CWE-242","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":"a79efa3629ccf81beb36446253f511ed74f7696c707177dff16ee83bf6eb1d19"},"taxa":[{"id":"CWE-242","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":"3b0c453ece6eb21fa87f4a54aa5cc44ded1593917a37067575ecf3ae40e58067"},"taxa":[{"id":"CWE-242","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":"e99d769570b23158770be90faa62583e6beefb98ca9b400e133d9162ef7f15fc"},"taxa":[{"id":"CWE-242","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":"0fb4d30affa19ee031a6b25aea8c1e9994bd6cbd6a20a37c2fc6a3a282535cd1"},"taxa":[{"id":"CWE-242","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":"e25fa1e34da0ea9b41b1003f26be40b217a5c67c04866943d2f091d4980e7106"},"taxa":[{"id":"CWE-242","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":"68e355cb26e8d79484cce6399712b278dae9f1a508422b09ea3ad71081f4659a"},"taxa":[{"id":"CWE-242","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":"df713c960e18384a6bd58b79f66c436b0563a43590be85e5ec5afbe5bd0ab2ff"},"taxa":[{"id":"CWE-242","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":"b76b30c5a082051c8b801850012cecafcf3499a669855e1d915a04bab6f5fec1"},"taxa":[{"id":"CWE-242","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":"52e7c8bece08e0980ed48f14dd8a16e4c385090a6c835c65193652bb5b3e781a"},"taxa":[{"id":"CWE-242","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":"da5f71f201be8d2646304302d4ed80ee17a3c7bdb9af6cc3ed15f9b8182bb614"},"taxa":[{"id":"CWE-242","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":"baaaa7de0c35eb290f6661a54f9f863cbec78c3b1af5d6def8261ffd0dcf9f66"},"taxa":[{"id":"CWE-242","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":"4ba05c438c25555b14b132515c5e51aa34df06477f8af665f08ef754309921f3"},"taxa":[{"id":"CWE-242","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":"a9826ba2b131f4653c90f7856cfa4b64a56b85be4a6cb3060295aa4c5e0c111b"},"taxa":[{"id":"CWE-242","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":"4b15da87af730e2aa8fed4b34d96cdb5554a6601d3f81d94c27cbf2fa5e8b06c"},"taxa":[{"id":"CWE-242","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":"df851fdb5382469d98383d2ebce375fbe43529b0c68f461b5f87f291a2289988"},"taxa":[{"id":"CWE-242","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":"50b3515fca7d7583540a662aa2dee7229364cd41278be3a3e67bcef0218d286e"},"taxa":[{"id":"CWE-242","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":"bf16d2db175027ef5920c008efb25f41482f7ba200bd99c446b179fb9e88df0b"},"taxa":[{"id":"CWE-242","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":"b738c5a7025afbf4a5975cce2f512c4d77fb0b48e4a96fea475533589cee07e4"},"taxa":[{"id":"CWE-242","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":"43611477029f80cb4ba2ad9587a3d9e293e441cd5d90c74199af8870f84f5afc"},"taxa":[{"id":"CWE-242","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":"996c0866e697c8ec0005546f947b99b9aab9a68399d3d4f265b904bfdd875f77"},"taxa":[{"id":"CWE-242","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":"8e9b4fc505a9e37ea222557fb2b4591900fd8df703911ec250da233670696958"},"taxa":[{"id":"CWE-242","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":"bc9847e6ed7af85bd189a12a53b1f1317b8677d4f5343530d887aa413aeb1cb3"},"taxa":[{"id":"CWE-242","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":"6a6b7a78cd83ff6dd0dabcffbab5d15fda6c6450c2d1a6f0f8c86fd3605e5e82"},"taxa":[{"id":"CWE-242","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":"051bc65c19025f841f0537a376e7034732f085dd8a10a898273b958651dd3981"},"taxa":[{"id":"CWE-242","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":"e8430f4db1ada3865492bfe7b2b67bbb3e8ffde4cecbc27ac11867c7d5bac431"},"taxa":[{"id":"CWE-242","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":"248db6fa3cbc3cbc5e46b3e13c713f35511c65dc302af40a9e9d39da71cfb72b"},"taxa":[{"id":"CWE-242","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":"2f43ca20f377349e4a5835be4c30c73b1e883f7d529a761faa09c1e1a8459f6d"},"taxa":[{"id":"CWE-242","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":"2ef2feafb3877e86e30aaea04afa0961923fa99649dceec5923041f3d75718a5"},"taxa":[{"id":"CWE-242","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":"8b547d61a1ce81e32d95acf2c7b035420d0573b0a2d3856e86a38a077e35102b"},"taxa":[{"id":"CWE-242","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":"2ad3fb116dd20ebae7b343b1bd4fa18f3dd9cb508354ec8352a0f0b64b4dda0a"},"taxa":[{"id":"CWE-242","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":"717b65472f41dbb1932d472c03d462eb81c38a098a3c0a6b5b5198805f4cbfa5"},"taxa":[{"id":"CWE-242","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":"fb337da215ffd9050a59b4597335deef859375b3770b6edc11f00bae6f2a6024"},"taxa":[{"id":"CWE-242","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":"d6d6639816031ee3f6b41adea634a290ddc828b25893537dee6dadb89f4e2671"},"taxa":[{"id":"CWE-242","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":"c5134227d4f7c435ce768fd6403fc2f808c325fa9a5b9b65b01207f9e4845f2e"},"taxa":[{"id":"CWE-242","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":"12439d79197d0d8cc5d634a7ff70f86f9903361cb42b3d8f37f6455ea971195a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6f52ea19481df6a261f8d6fb74692dd6b697262d3166181ac337294186789ab0"},"properties":{"dependency":{"package":"golang.org/x/text","version":"0.40.0","advisory":"GO-2026-6629","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 17 of 133 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 133 of the 234 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: pkg/proc/linutil/regs_riscv64_arch.go, pkg/proc/native/threads_linux_riscv64.go, pkg/proc/linutil/regs_ppc64le_arch.go, pkg/proc/linutil/regs_loong64_arch.go, pkg/proc/ppc64le_disasm.go, pkg/proc/winutil/regs_arm64_arch.go, pkg/proc/loong64_disasm.go, pkg/proc/native/registers_linux_loong64.go (and 9 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/linutil/regs_riscv64_arch.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfc44aa7f0e8da22671f913c5eb69964b4d8b8d0326726755120bfa2b476354"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/threads_linux_riscv64.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c10ef948f52442b45ebf10cf1061af7eebfa0d273c3a49fdd744888e5ad5b0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/api/command.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"307a5d09306e0feb2c8b3c8a15674e2fc3c230b2318ee76b828040a4c22a5119"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/linutil/regs_ppc64le_arch.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ba7d97e596aeeb23919e6c0a309f9a852f9af2bfa1289a1f7c3cfd8d58fbd6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/linutil/regs_loong64_arch.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd870079b6e8bf21aa277c59eb964cfcd0f25e28cf13ea707ad9a705ec7e16b4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/ppc64le_disasm.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"385857cc3e01893e158ab79f3efdf6cd0765d461e03fe7374916501afc28a6a1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/config/split.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3a9a7890efd9b273e27425ca362919e8974bc0be6b5ac74477be2502b28d0b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/winutil/regs_arm64_arch.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"576f5db4b6dcfa5ab06226aeb9f905e9dd36d9bdbfa5f0e45abccfb5bf11ea7a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df826c4a8d31a59c395b06f75a07d3553930af032d55d923d02c09f598539cf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/loong64_disasm.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d76019269e6fd958ca23ef95d94ba15ebff58b3da6fcc83dd715ec63bf9d0c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/registers_linux_loong64.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9848f90a84eceb7d76e8d1104a25fba63e56b24c281575bcc0d6a52674a38f92"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/registers_linux_riscv64.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0315edc8bbf8d7cb05e9bcfb9596a952b74f200dd28e7826400689a18df6b6d8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/riscv64_disasm.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9e37d1a62d1146fe170a65277384912b58057ad698fb57b5c54f7b63fc39a6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/regnum/ppc64le.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2c8466629d083b5bd868099e58f944077220f34778f5a898a44d0d5a61a922"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/x86_disasm.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26892c71179b278b43a355b830ede8a851770527a8abc0d44733800d55919ebf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/registers_linux_ppc64le.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45c16b891b665152212dce6dd2a9afdd2453152c5754ae7572af13176e60c03"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/ptrace_freebsd_amd64.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"416f283ff2405580d4f013b653ea207264821e4d8f591e1bb93cd4b8da4d21c5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: client.go \u2194 error_ids.go: \u0060service/dap/daptest/client.go\u0060 and \u0060service/dap/error_ids.go\u0060 change together 79% of the time (19 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 19 shared commits counted here, the most recent 3 are \u0060c0809b87\u0060 service/dap: add dap write memory request handler (#4364); \u00602a508e53\u0060 service/dap: support data breakpoints (#4294); \u00609103a459\u0060 service/dap: add dap read memory request handler (#4083) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/daptest/client.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ed264719dc9cc01d517213dee703fa55573e73dee69a365c51fb5400cd3f82"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: arm64_arch.go \u2194 i386_arch.go: \u0060pkg/proc/arm64_arch.go\u0060 and \u0060pkg/proc/i386_arch.go\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006050a45f1b\u0060 proc: propogate errors from switchToGoroutineStack; \u0060281f3920\u0060 proc: fix stacktraces on freebsd/amd64/go1.20 (#3458); \u00603507ff97\u0060 proc: support multiple functions with the same name (#3297) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/arm64_arch.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7abf3da944c5eaaf2ef72fafed1aa51ea307435fa62ee67f278821573a859fb"}},{"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":"6d8ae5361b6b4d16d9f9554718c665b4f39c37417f99a1462dd05c77beb79e5f"}},{"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","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":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(status == nil || status.Exited()) \u0026\u0026 wpid == t.dbp.pid\u0060 appears character-identically in 2 files \u2014 pkg/proc/native/threads_hardware_singlestep_linux.go, pkg/proc/native/threads_linux_riscv64.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/threads_hardware_singlestep_linux.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c06180368d188249ac0e8adb04fa496192e5a3ed60e4bb84dbf95f0948895dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(thread.ThreadID() != trapthread.ThreadID()) \u0026\u0026 !thread.SoftExc()\u0060 appears character-identically in 2 files \u2014 pkg/proc/fncall.go, pkg/proc/target_exec.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/fncall.go"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d50cd47e89ce596479b8b534e21e53240e6f96c3f344c47651d0442e6d30f22"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.crosscall2fn != nil \u0026\u0026 pc \u003E= a.crosscall2fn.Entry \u0026\u0026 pc \u003C a.crosscall2fn.End\u0060 appears character-identically in 5 files \u2014 pkg/proc/amd64_arch.go, pkg/proc/arm64_arch.go, pkg/proc/loong64_arch.go, pkg/proc/ppc64le_arch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b82e470cdac04175efad619f0782475da479b2553656fe8bb5961543221a62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deferpc != 0 \u0026\u0026 deferpc != topframe.Current.PC\u0060 appears character-identically in 2 files \u2014 pkg/proc/stackwatch.go, pkg/proc/target_exec.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stackwatch.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b09ffe44be026957c717c3c83adaf040efc67238748c8f680c9fde6923fafd7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err == syscall.ENODEV || err == syscall.EIO || err == syscall.EINVAL\u0060 appears character-identically in 2 files \u2014 pkg/proc/native/ptrace_linux_386.go, pkg/proc/native/ptrace_linux_amd64.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/ptrace_linux_386.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"80afc959cc4806118ea46fe2ebaa03cafbabd72bd580b4e6facadff90b90123a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err == syscall.Errno(0) || err == syscall.ENODEV\u0060 appears character-identically in 2 files \u2014 pkg/proc/native/ptrace_linux_386.go, pkg/proc/native/ptrace_linux_amd64.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/ptrace_linux_386.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f05f1455e27302312149fd70c86d6554ade77a8591b0d33cf48381db2a5ff3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fctxt == nil || (a.sigreturnfn != nil \u0026\u0026 pc \u003E= a.sigreturnfn.Entry \u0026\u0026 pc \u003C a.sigreturnfn.End)\u0060 appears character-identically in 4 files \u2014 pkg/proc/amd64_arch.go, pkg/proc/arm64_arch.go, pkg/proc/loong64_arch.go, pkg/proc/ppc64le_arch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2c93af61b2bfc06628654222a9c332793cfec72dadfee6cfbfd65326ccd6f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.top || !it.systemstack || it.g == nil\u0060 appears character-identically in 5 files \u2014 pkg/proc/amd64_arch.go, pkg/proc/arm64_arch.go, pkg/proc/i386_arch.go, pkg/proc/loong64_arch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"277f8022ce3d0f056eeccb4bef59f791588c3d0c6f0e3636a7aa3cffff01f7bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rd == riscv64asm.X0 \u0026\u0026 rs1 == riscv64asm.X1\u0060 appears character-identically in 2 files \u2014 pkg/proc/native/threads_linux_riscv64.go, pkg/proc/riscv64_disasm.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/threads_linux_riscv64.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"952833af7e200243361c078b1cce26aa4bf19d43af1df9f6b4270071285a687c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reg.Bytes != nil \u0026\u0026 strings.HasPrefix(n, \u0022st(\u0022)\u0060 appears character-identically in 2 files \u2014 pkg/proc/amd64_arch.go, pkg/proc/i386_arch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c9907ad24ad870661d58bf114d4b64afd2de2db4edc9481f1c387f43ac71a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reg.Bytes != nil \u0026\u0026 strings.HasPrefix(n, \u0022xmm\u0022)\u0060 appears character-identically in 2 files \u2014 pkg/proc/amd64_arch.go, pkg/proc/i386_arch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"764b3bb7e4a1c434cef29cb651c3be22572ba47102d386e5161bca5fbb6a83a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reg.Bytes == nil || (reg.Bytes != nil \u0026\u0026 len(reg.Bytes) \u003C 16)\u0060 appears character-identically in 2 files \u2014 pkg/proc/arm64_arch.go, pkg/proc/ppc64le_arch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/arm64_arch.go"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32955cb0b12b8f5f4c7ac6ceadd4a757308d8d6ac5ec05a4da0fa7ae302bede"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reg.Bytes == nil || (reg.Bytes != nil \u0026\u0026 len(reg.Bytes) \u003C= 8)\u0060 appears character-identically in 2 files \u2014 pkg/proc/amd64_arch.go, pkg/proc/i386_arch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/amd64_arch.go"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"a461a732d58aa2adefbb1c9df186394b12961159b6c58c93b94e2f4113434079"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060regNum \u003C regnum.AMD64_XMM0 || regNum \u003E regnum.AMD64_XMM0\u002B15\u0060 appears character-identically in 3 files \u2014 pkg/proc/fbsdutil/regs.go, pkg/proc/linutil/regs_amd64_arch.go, pkg/proc/winutil/regs_amd64_arch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/fbsdutil/regs.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c24f91bd72891185a863c77c5d4ff85fbc815c5e56b80601a11166fdbdb7a99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060regNum \u003E= regnum.ARM64_V0 \u0026\u0026 regNum \u003C= regnum.ARM64_V0\u002B30\u0060 appears character-identically in 2 files \u2014 pkg/proc/linutil/regs_arm64_arch.go, pkg/proc/winutil/regs_arm64_arch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/linutil/regs_arm64_arch.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"007bc649b64a8b24365969589297e6017bb973d651579cece7f226dc64f0f3c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060regNum \u003E= regnum.ARM64_X0 \u0026\u0026 regNum \u003C= regnum.ARM64_X0\u002B30\u0060 appears character-identically in 2 files \u2014 pkg/proc/linutil/regs_arm64_arch.go, pkg/proc/winutil/regs_arm64_arch.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/linutil/regs_arm64_arch.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"130550724ad37bbb585d40b7598d89532c51fe085c35268f58924dad5fe191a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060restoreRegistersErr != syscall.Errno(0) \u0026\u0026 restoreRegistersErr != nil\u0060 appears character-identically in 2 files \u2014 pkg/proc/native/threads_linux_arm64.go, pkg/proc/native/threads_linux_ppc64le.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/threads_linux_arm64.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4eff1d9cf94d87e55f800249380b6d5c783a6bc3a70a9c048992cceea6193dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stack.callInjectionContinue \u0026\u0026 stack.err == nil\u0060 appears character-identically in 2 files \u2014 pkg/proc/eval.go, pkg/proc/fncall.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64bc4b40e40e6497dbf0c0e057c5d1263a45f4276a670d1a35414f0b26fcf95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stdin == nil || !isatty.IsTerminal(stdin.Fd())\u0060 appears character-identically in 2 files \u2014 pkg/proc/native/proc_freebsd.go, pkg/proc/native/proc_linux.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/proc_freebsd.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"865f07db05d30246a67dac43c5d22178120f81442d336d5347c780e2b8589bfd"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060dlen\u0060 is read from the bytes being parsed at line 111 (\u0060binary.BigEndian.Uint64\u0060), then used to size a \u0060make([]byte, \u2026)\u0060 at line 112 \u2014 and nowhere in its scope is \u0060dlen\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: \u0060make\u0060 reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the runtime cannot satisfy is \u0060fatal error: out of memory\u0060 \u2014 not a panic, so no \u0060recover\u0060 intercepts it and the whole process dies; a 64-bit length too large to represent panics with \u0060makeslice: len out of range\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060dlen\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/godwarf/sections.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b9a8c32c7f61a79458b9d2b9f0ff05b0f56574febe4e1ecab4f5c4b856341c"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept a context.Context: Only 0/2 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: Dial: \u0060Dial\u0060 calls \u0060net.Dial(\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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"607efb40bb524b74f7a44c92b3347f97fef1588ebf1f51e6f7d57f32bdd027ab"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: netDial: \u0060netDial\u0060 calls \u0060net.Dial(\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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"13db80d4d3b7b950428aa895487d5e5f9fa73080b321c92cca00552870b8d47f"}},{"ruleId":"X26","level":"warning","message":{"text":"Collection crosses a callback boundary unsynchronised: \u0060main\u0060 starts a goroutine on every pass of a loop, and each one writes \u0060failedPlatforms\u0060, a slice declared before the loop \u2014 \u0060failedPlatforms = append(failedPlatforms, \u2026)\u0060 on line 67. The loop never waits on \u0060wg\u0060 before its next pass, so the goroutines of successive passes run at the same time and each one\u0027s write races the next one\u0027s; waiting on \u0060wg\u0060 after the loop orders only what follows the wait. \u0060failedPlatforms = append(failedPlatforms, \u2026)\u0060 rewrites the slice variable itself \u2014 its pointer, length and capacity \u2014 so the other side reads or rewrites a variable mid-update: an append is lost, or a read sees a length its backing array does not have. \u0060wg\u0060 is a \u0060sync.WaitGroup\u0060, which orders the handoff\u0027s signal and takes no exclusion over the slice\u0027s own state. Guard every write to \u0060failedPlatforms\u0060 with one \u0060sync.Mutex\u0060, or have each goroutine send its result on a channel that this body alone receives from and writes into \u0060failedPlatforms\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"_scripts/gen-capslock-all.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f0a1d3437dc9b15587eb0e2cdaba54470342b6dea9589889282a7057e481f5"}},{"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":"service/rpc2/client.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a255b478b3e422fe19a144f0584ff6b8c1c962f0f43ce3353e2b6777bb7d371"}},{"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":"service/debugger/debugger.go"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d82275cef405afd0858d15535af37d13eafd9802cc97cc57c3c0b0d6389af65"}},{"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":"service/debugger/debugger_linux.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c6c31a0380dc4e36ead47def1243fa3b19f1243fda9ab26bc7b49b02e488ee"}},{"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":"service/debugger/debugger_linux.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ce9bb1142e85e0ff0b9d1e0d6fffc3b95e8ecd6df28d801a1ef1262d209976"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := parser.ParseExpr(expr); 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":"service/dap/server.go"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc40df3e85640f22703100e28ed618033dee5a6b2d1f53e3ff810999ada78212"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := s.debugger.State(false); 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":"service/dap/server.go"},"region":{"startLine":3576}}}],"partialFingerprints":{"codehealthFindingId/v1":"345610b0e65a4dbe76b966e8fa16df8d43ef73a30e7ad431bcba0b5a4e7c1493"}},{"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":"pkg/terminal/terminal.go"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbc509367f14fc1594b161ef7232c4e5053611b0c01236ee171481a52aa3346"}},{"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":"pkg/terminal/terminal_windows.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"85977e357fd277bbef2a8beac8503c922ab1b7069af75a48b0a90f874652ad1b"}},{"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":"pkg/terminal/terminal_windows.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"589ed3185559132f99dd72c60935fdde1d8544b4fe090157ce1f558b2099753f"}},{"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":"pkg/terminal/starbind/conv.go"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"788975b6bd287a818f5258d8fa6ccd747da2f90f8dd6a8302e1b44b12078309f"}},{"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":"pkg/terminal/starbind/conv.go"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae22cd162aff87ebfce9e6eb6d9584fbe06b0d18bb7aa43122365fe437194d69"}},{"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":"pkg/terminal/starbind/conv.go"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f4da7b96077fb96947a16c5fcc32c6101842c3826e7f01714d11e2228db8cc"}},{"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":"pkg/proc/arm64_disasm.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c99f99f21ef36f81845c6874812b30338615b05e1b3e784ab9464918fdeddb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := p.Memory().ReadMemory(target, addr); 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":"pkg/proc/arm64_disasm.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"164edd2493c45a3cc286fdc0f6650a61335dc50a18f29f93dfba7f0b5a888e94"}},{"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":"pkg/proc/bininfo.go"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df2895bd789bbbc49adb528e55411199772900537ddc1e8a3855059a9f5bcaf"}},{"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":"pkg/proc/bininfo.go"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b82581c1729b9ab34fb60da44c51209d516cd35a210fa9c4a573eaa303b8e95"}},{"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":"pkg/proc/bininfo.go"},"region":{"startLine":3234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5197c6656e7ac4ac15447f662b735b02962d2960776d9483809c202af9bfba0"}},{"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":"pkg/proc/dump.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e6802f1cbd0a9d02efda2223cc6813d7479fea5e851188a79e700f4b889d61"}},{"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":"pkg/proc/eval.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c1853321e7991e6e5449566d0fd4f7760435ab9ce1196cf242eb69090bdf5b"}},{"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":"pkg/proc/eval.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec90dd6f77556a7501ad0c5d455615f5ae7012df74b50adb3c92abdacb4f10a"}},{"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":"pkg/proc/fncall.go"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20bd896e5cd030da2c9dba40deb0c2ff404101b2b9cd6bb3b7f606337aed5c2"}},{"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":"pkg/proc/loong64_disasm.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"db675afe7ea2305402d9cdfbdd30972bcfe6646f4572996f3b3074b2c7587af5"}},{"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":"pkg/proc/mapiter.go"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b191dc6d9388ec9ce4c8cf25501297001256083969589e7637368412c02a67"}},{"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":"pkg/proc/ppc64le_disasm.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b074409c9ed07fbea9d8cd42c2ecefd97d6c4ed5f5b81dd789381a7d5491b1f9"}},{"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":"pkg/proc/riscv64_disasm.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cca034adc6223eab3e297c296e9ffdc0ec7e242acc047af6549044d30ef6af"}},{"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":"pkg/proc/stack.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb529120179ab7cd423d1c6d8ff083c1a7cce168a343392df52d1dcba08cc66"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if fileErr != 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":"pkg/proc/stack.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88b35aaa8911de8a85539de3768643dcad27f99b67ae668e853bc75fdb5b038"}},{"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":"pkg/proc/target.go"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dfce3c7f04a54cb8b067c69ecc0cc9aac40f02ffdc58bcfd98183e09a763fa"}},{"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":"pkg/proc/target_exec.go"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25a33697a1f32578e25ba53373ae542b7ebea9feb31b5d5dacb01d883570e7d"}},{"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":"pkg/proc/variables.go"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"1591ebe6580260ce2a9c8a4ec4a7c4bb3805a1d74a3fe873f4fcb46f2f81cb72"}},{"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":"pkg/proc/variables.go"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"99573558a62f0100ce85fed983c1877a2efde1f86113d53a6a3e2cb80a8dba41"}},{"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":"pkg/proc/variables.go"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e8d34af82291ba2d1fbb22a4a98a876f77b6758f7452c28a334bd5d23736eb"}},{"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":"pkg/proc/x86_disasm.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"120d98e5c775ea5b6e9d5e62590ff25d4b4565291cccc42eea2a664fda3828a5"}},{"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":"pkg/proc/x86_disasm.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01a3c17b0c5a63936ee84d7af77e8eb35aa992531fd7f12a2b96a7f431183a3"}},{"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":"pkg/proc/native/proc_freebsd.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b1a06731460127e156b9cf992d1755d524bd4c482492ae019e63c19965d7e9"}},{"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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"78aa5014c52b6ba5e220ab42b09b5cfa8607ff5187e31763265abfc9f2a9ffcf"}},{"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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee560ba7ef6a3e5d4d1a3d640fcfc0eb3df16235844680e7ab1e7473bb12a2c"}},{"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":"pkg/proc/native/proc_windows.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e8ab024b9a62b015f9cf288f221dd481d826bc7cd00b9129c50cbda734b9f0"}},{"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":"pkg/proc/native/threads_linux_riscv64.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"323adb0b7b4bd3b4ff95eac5bee541f1cf472c4e4578efc817f37493d7b194ad"}},{"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":"pkg/proc/macutil/rosetta_darwin.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cefa3e3b79722f11a9b7b56e2eafcb684263978cf9a48dd9337a89f2f51e10"}},{"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":"pkg/proc/linutil/auxv.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7440d43b0edba941ca9b003396bebcd8cdc0b57582d95a4b71432cd57ae53c0a"}},{"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":"pkg/proc/linutil/auxv.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7f2376f7fe67726cd4de8b1255161b940dec7bc76f18837168d00fed9460c7"}},{"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":"pkg/proc/internal/ebpf/helpers.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f914a315a67dd7d02c34d87aeb648215e8422c2113b9fc7b9434e21390c709a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := exec.LookPath(\u0022 \u0022); 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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a5f1649a1b955884f4c2bd1d47d24436c9393941e279342db2ab80ee46af0b"}},{"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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c37f1230b269b26c15d218001cf20cfc1642f12432a4e19da324cdcb1b0c8f"}},{"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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb8c1d3f959ddea486151ee942a2355a37a2adfd5651ea29bed04e6f6b0740d"}},{"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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee9c91dbf87ce29e0df38fd2d2746c35e78d0eaa9ffc3300215244fc6743b6e"}},{"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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a5bf535fd80e89c7e3a3fbd9abf510494ade2006b404ad62c581f773fd86d6"}},{"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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb38fd9f7ee4c5be7a428ad5612a3dfc173e5d08f997bbc802048cf3c1fad2a"}},{"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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aa07357c92e2c0cc25871e0497417703aafde8d39306cf6a91a08e24cbc232"}},{"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":"pkg/proc/gdbserial/gdbserver_conn.go"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a1c68444b933f76ccbe07cc7a384f7cf64d5487461b0120e75f24fe8feeb62"}},{"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":"pkg/proc/gdbserial/rr.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"79071d539d217f4bddedabc19dfeefe16c8f2b86eeb72676655ad05a3dd88be7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := os.Remove(filepath.Join(dir, fi.Name())); 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":"pkg/proc/gdbserial/rr.go"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a19c9fb6311524c3e56c6723b31610d866e0833ae8c0aa627dcf50dbd6cc81"}},{"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":"pkg/proc/core/delve_core.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8531895f211e7c8065cf416201cbb59da542eeeb514a992cc30f0571d8a0e04"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/internal/gosym/pclntab.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a040be207b699eb644e6d15e0d0c566696ddf3dbab3ef282f42386768010a534"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/internal/gosym/pclntab.go"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d023118e2fdd6e87f1194df11a1ad059ca4ce58a3c60729a82514115805ada"}},{"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":"pkg/dwarf/op/op.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f205d7e116507c1e97010ae6395eb8cfbadfc9329ec3ea7fe4a334e7a19947ac"}},{"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":"pkg/dwarf/op/op.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f958eda794b6126a233087f940ae36929b3c5221a34bc193a8cd0196d45a5308"}},{"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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e0e27338d620a3889f110f7846d943026c70d6831509f2fa03b19477affd5f"}},{"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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"4552943d2475b9dd4bedac5f95b6f21784a8b2e631abae07d1fd6288aad58e65"}},{"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":"_scripts/gen-capslock-all.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02ee5484a5e0a51e5c2f211d5b5f86a59fc157c46dc83c394afb58a460c7711"}},{"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":"_scripts/make.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fc519db13fcb262ebf14c2349a5bfec0d8daa4e2543d24365de62142d2d401"}},{"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":"_scripts/make.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1259c8ee9b9b092b2476dcb3536e2c8200254fbbd9fc08d98fadf259af8f2bc9"}},{"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":"_scripts/make.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53f2ad63723641f55ba30623996f9729ac7ac70ae09a7676302eeec8d85a10a"}},{"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":"_scripts/rtype.go"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"201c152ac67f16558cde89dbd9daf3662d78e4d82a9ff72541136877dc13021b"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"_scripts/gen-faq-toc.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5a8b2f3725859df5882312d6735592a9465c9bc893b4e8f6699ed4b05a0ad8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060getPackageDir\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":"cmd/dlv/cmds/commands.go"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"af813665231d71aae712ef52417264a6669762fe51a4e62de9941cf98cb195fe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060unusedPort\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022:8081\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":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faf696cab09e49c771bf996a4fd9ca53589ecd1302022a5206f52c4c9fe3116"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060status\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0027\\000\u0027\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":"pkg/proc/native/proc_linux.go"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"e595edba198f001ba84b247bcbb91a1470691cce2548a201347af539a7a2f1d3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060frameBase\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\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":"pkg/proc/stack.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"864376e4e0a4c237a13352ac3e870b8305738f1f344b1e60fa41f5acca3d26ae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060BuildID\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":"service/debugger/debugger.go"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"630ede8a46a5f9eaeecefec7cf012a16b863a48bbd7069fce1822fa50ecbc346"}}],"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-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-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.html"},{"id":"CWE-252","guid":"78915dc5-e486-f858-bc3c-aa570ad9010d","name":"Unchecked Return Value","shortDescription":{"text":"Unchecked Return Value"},"helpUri":"https://cwe.mitre.org/data/definitions/252.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-391","guid":"d9ef5687-8d79-9b51-b509-b83411fbcdc3","name":"Unchecked Error Condition","shortDescription":{"text":"Unchecked Error Condition"},"helpUri":"https://cwe.mitre.org/data/definitions/391.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-703","guid":"fa730aa9-95e4-845e-83fa-8169f2cf339e","name":"Improper Check or Handling of Exceptional Conditions","shortDescription":{"text":"Improper Check or Handling of Exceptional Conditions"},"helpUri":"https://cwe.mitre.org/data/definitions/703.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-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":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"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/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"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-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-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":138,"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."]}]}