{"$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":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D38","name":"OSV Dependency Vulnerabilities","shortDescription":{"text":"OSV Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D38","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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}}]}},"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":"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":1098}}}],"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":1517}}}],"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":419}}}],"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":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"903285ed0a4fbbccb77dcb3c20ec37f9d151d716eb69e04d45463effbc798f84"}},{"ruleId":"D1","level":"warning","message":{"text":"Debugger.Command (cyclomatic 55): Debugger.Command has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":1088}}}],"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":1045}}}],"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":1338}}}],"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":3117}}}],"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":3009}}}],"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":146}}}],"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":662}}}],"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":2619}}}],"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":391}}}],"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":1845}}}],"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":1408}}}],"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":2657}}}],"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":170}}}],"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":2603}}}],"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":"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":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb41828256d93de37e49c494dc2e3c78782caa0e1b02b1f8bd0f93b8fcbb54e"}},{"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":"Term.Run (cyclomatic 31): Term.Run has cyclomatic complexity 31 (threshold 15). Of this number, 19 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":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c676d5bd8539467bb73f863ac7ff0488470b8fce92f061143fa96cfda433750"}},{"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":"processGroup.stop (cyclomatic 30): processGroup.stop 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/native/proc_linux.go"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"058337a0c6ad825c90fb0f7f358f5f4c244de1287032b5b333c0a0217000e8d9"}},{"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":2961}}}],"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":2847}}}],"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":1800}}}],"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":"mapIteratorClassic.nextBucket (cyclomatic 29): mapIteratorClassic.nextBucket 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/mapiter.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb99504c83781a49d5c0f189f5c0a3c7c428c7af4927968afb89d6f28fc2ce1e"}},{"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":2169}}}],"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":881}}}],"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":1574}}}],"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":"EvalScope.evalBinary (cyclomatic 27): EvalScope.evalBinary 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/eval.go"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ad496e7b716118125286b84e2500523e4911f3274cadd3c11a69e887c480a4"}},{"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":1680}}}],"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":"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":4106}}}],"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":4409}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f359282bcec2c81f6de6ff971ef5bd4ed8f21fe1acbf9e91e7cc3b20133faa"}},{"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":"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":2230}}}],"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":325}}}],"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":"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":2764}}}],"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":1275}}}],"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":"mapIteratorSwiss.next (cyclomatic 22): mapIteratorSwiss.next 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/mapiter.go"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f71c93ba0fb535c34757aa69098a6dee548401b95286fc18e44f247dfdcef81"}},{"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":1136}}}],"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":544}}}],"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":2314}}}],"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":2427}}}],"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":722}}}],"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":255}}}],"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":3281}}}],"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":621}}}],"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":2451}}}],"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":"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":566}}}],"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":2719}}}],"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":3530}}}],"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":316}}}],"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":1460}}}],"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":2161}}}],"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":"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":2952}}}],"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":554}}}],"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 274, 253, 264). 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":240}}}],"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":"nativeProcess.SetUProbe (cyclomatic 17): nativeProcess.SetUProbe 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/native/proc_linux.go"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe09931d9f07efaf9dbc5d818c056d6facbc150706db7c05d5e790afdf48f37"}},{"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":2181}}}],"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":2523}}}],"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.loadBinaryInfoElf (cyclomatic 16): proc.loadBinaryInfoElf 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":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16674163227759d55d44c992b9a3101fdccf4657f920f6a5833fe2e16bb742a"}},{"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":383}}}],"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":812}}}],"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.MemoryMap (cyclomatic 16): nativeProcess.MemoryMap 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/dump_linux.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3ff0ec55f9061900d2cab536b211f3120499388f8d013e673abca92be5952e"}},{"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.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":2371}}}],"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":2200}}}],"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":2806}}}],"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 140). 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":106}}}],"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":252}}}],"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":3480}}}],"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":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc70f44404912544d599fe468840ab92f7ddfbcc11704f3b658112993a9f5d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"godwarf.readType (cognitive 164): godwarf.readType has cognitive complexity 164 (threshold 15). Drivers by points: if/else 105, match/switch 33, jumps 12, loops 11, 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 134, boolean chains 7, loops 6 (nesting depth added 93). To reduce it, split the body into named stages: move each independent step or branch into 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":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84f5785f2f0b631a0781ff1aac8f08eeba3fe090d30a033ccab0213bcccadee"}},{"ruleId":"D2","level":"warning","message":{"text":"cmds.traceCmd (cognitive 122): cmds.traceCmd has cognitive complexity 122 (threshold 15). Drivers by points: if/else 92, loops 21, boolean chains 5, match/switch 4 (nesting depth added 70). Most of this is not in the body itself: 0 of the 122 points are its own statements 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":"98f5ee9d4f0664a5d1543ddc36bb690905c976f49457721e05d0acea915384de"}},{"ruleId":"D2","level":"warning","message":{"text":"processGroup.waitForDebugEvent (cognitive 109): processGroup.waitForDebugEvent has cognitive complexity 109 (threshold 15). Drivers by points: if/else 95, loops 7, match/switch 5, 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 67, match/switch 23, boolean chains 8, loops 3 (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 85, loops 6, boolean chains 5, match/switch 3 (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":3009}}}],"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 78, loops 15, 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":1408}}}],"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 70, boolean chains 16, loops 6, match/switch 2 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into 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":419}}}],"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 56, match/switch 19, loops 14, 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":1517}}}],"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 71, loops 6, boolean chains 4, match/switch 3 (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":1045}}}],"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 69, loops 8, boolean chains 4, match/switch 2 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into 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":2619}}}],"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 62, loops 14, boolean chains 3, match/switch 2 (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, split the body into named stages: move each independent step or branch into 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":2169}}}],"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 68, boolean chains 3, match/switch 2, 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":2801}}}],"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 57, loops 11, match/switch 4, boolean chains 2 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into 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":566}}}],"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 60, loops 9, boolean chains 5 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7c66395262f55693e7e3568fdaaf6490e973a7d4dfcae52621b12c2967ff79"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.convertVariableWithOpts (cognitive 68): Session.convertVariableWithOpts has cognitive complexity 68 (threshold 15). Drivers by points: if/else 61, 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, split the body into named stages: move each independent step or branch into 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":3117}}}],"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 46, loops 16, 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":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fc04a0a0c78fed70bfb8c7ba11ec6e720624a01112dadc006ddab4653b3bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger.Command (cognitive 68): Debugger.Command has cognitive complexity 68 (threshold 15). Drivers by points: if/else 58, loops 6, boolean chains 3, match/switch 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":"service/debugger/debugger.go"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"175911def8c37f22aceb70cc6a56ae1bbb5f0bf221e674235b39a1744a52f883"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.arm64SwitchStack (cognitive 67): proc.arm64SwitchStack has cognitive complexity 67 (threshold 15). Drivers by points: if/else 57, 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":146}}}],"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 58, loops 5, match/switch 3, 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":1680}}}],"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 56, boolean chains 6, loops 4, 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":"processGroup.stop (cognitive 65): processGroup.stop has cognitive complexity 65 (threshold 15). Drivers by points: if/else 45, loops 19, boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into 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":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e48db88efcdf82ee6b53f8ae2e3207c76e761a7148f6abdd410e8dcfc120102"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.loadValueInternal (cognitive 64): Variable.loadValueInternal has cognitive complexity 64 (threshold 15). Drivers by points: if/else 50, boolean chains 6, match/switch 5, loops 3 (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":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c52297cf4ec4bb77c4d800774753f4689285687af1345ac08dae66d9dad644"}},{"ruleId":"D2","level":"warning","message":{"text":"Term.Run (cognitive 62): Term.Run has cognitive complexity 62 (threshold 15). Drivers by points: if/else 43, loops 17, boolean chains 1, match/switch 1 (nesting depth added 33). Of this number, 36 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":318}}}],"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 42, boolean chains 7, loops 7, match/switch 5 (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 35, loops 19, match/switch 4, 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 42, loops 8, match/switch 6, 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":"mapIteratorSwiss.next (cognitive 59): mapIteratorSwiss.next has cognitive complexity 59 (threshold 15). Drivers by points: if/else 49, loops 6, boolean chains 4 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into 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":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"119ca448b244eed9431c049685330d156689e7b8e2809eedea1c0715893240d8"}},{"ruleId":"D2","level":"warning","message":{"text":"gdbserial.LLDBLaunch (cognitive 58): gdbserial.LLDBLaunch has cognitive complexity 58 (threshold 15). Drivers by points: if/else 45, loops 9, 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 32, loops 18, 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":170}}}],"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 52, boolean chains 2, loops 2, 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":1098}}}],"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 46, loops 5, 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 37, match/switch 7, boolean chains 6, loops 6 (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":2847}}}],"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 39, loops 13, 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 41, loops 6, 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":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd577b521df4d34c2ed3063050f615b522e769350c8985836ba9ad3a325dcf81"}},{"ruleId":"D2","level":"warning","message":{"text":"Term.handleExit (cognitive 52): Term.handleExit has cognitive complexity 52 (threshold 15). Drivers by points: if/else 51, boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into 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":544}}}],"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 37, loops 6, match/switch 4, 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 24, match/switch 12, loops 8, 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":391}}}],"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 40, loops 5, boolean chains 4 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 43, 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 29, loops 9, boolean chains 5, match/switch 4 (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 36, match/switch 6, 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":4409}}}],"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 33, boolean chains 5, match/switch 4, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 35, 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 40, 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":1574}}}],"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 29, loops 10, 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 31, loops 10, match/switch 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/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 35, loops 4, match/switch 3, 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":255}}}],"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 35, boolean chains 3, match/switch 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/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 39, 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 33, 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":881}}}],"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 33, 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 24, loops 14, 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":"proc.amd64SwitchStack (cognitive 38): proc.amd64SwitchStack has cognitive complexity 38 (threshold 15). Drivers by points: if/else 30, 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 31, loops 4, 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 34, 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 29, jumps 3, boolean chains 2, loops 2, match/switch 2 (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 28, boolean chains 5, loops 3, match/switch 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":3281}}}],"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 31, boolean chains 3, match/switch 3 (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 29, loops 5, match/switch 3 (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 30, loops 3, 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":1800}}}],"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 29, boolean chains 4, match/switch 3 (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 30, boolean chains 3, match/switch 3 (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":2491}}}],"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 29, boolean chains 3, loops 3, 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":1136}}}],"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 30, match/switch 3, 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":252}}}],"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 32, boolean chains 2, loops 2 (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":"service/dap/server.go"},"region":{"startLine":1710}}}],"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 29, boolean chains 5, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"800890c63125cf5a02978f1d9d69bacd94a9b2d427b71653ee4cb4ce7daafc06"}},{"ruleId":"D2","level":"warning","message":{"text":"mapIteratorClassic.nextBucket (cognitive 35): mapIteratorClassic.nextBucket has cognitive complexity 35 (threshold 15). Drivers by points: if/else 25, boolean chains 5, loops 3, match/switch 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/mapiter.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5c711e3ee5f103be1f51fa74bd972704657c455a5f217f981923279cfcccbc"}},{"ruleId":"D2","level":"warning","message":{"text":"stackIterator.Next (cognitive 35): stackIterator.Next has cognitive complexity 35 (threshold 15). Drivers by points: if/else 25, boolean chains 8, loops 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":"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 29, loops 3, 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 21, match/switch 9, 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":2603}}}],"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 24, match/switch 7, loops 2, 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":2451}}}],"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 25, 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 24, loops 5, 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":2230}}}],"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 31, 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 29, match/switch 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/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 29, 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 26, loops 4, match/switch 3 (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":3530}}}],"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 22, boolean chains 4, loops 4, match/switch 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/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 24, match/switch 4, loops 3, 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 23, boolean chains 7, match/switch 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 26, loops 6 (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/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 22, loops 6, match/switch 3, 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":722}}}],"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 23, boolean chains 4, loops 4 (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 19, match/switch 6, loops 5, boolean chains 1 (nesting depth added 10). Most of this is not in the body itself: 0 of the 31 points are its own statements 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":"3b521d15a5d005bdc990e2b233449d0263c118ebf4dc9d5729986ddf2f3e0b51"}},{"ruleId":"D2","level":"warning","message":{"text":"core.readNote (cognitive 30): core.readNote has cognitive complexity 30 (threshold 15). Drivers by points: if/else 25, match/switch 3, loops 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/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 24, loops 5, 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":760}}}],"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 26, match/switch 2, 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 26, 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":1275}}}],"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 20, 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":325}}}],"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 17, loops 5, match/switch 4, 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":812}}}],"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 28, 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":2161}}}],"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 22, loops 4, 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 24, boolean chains 3, loops 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":"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 26, 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":2523}}}],"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 22, loops 6, 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":2719}}}],"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 24, loops 4, 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":902}}}],"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 26, 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 18, match/switch 7, loops 3 (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 24, 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 16, boolean chains 7, match/switch 5 (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 22, 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":"gdbProcess.updateThreadList (cognitive 28): gdbProcess.updateThreadList has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22, boolean chains 3, loops 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 23, 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 18, loops 8, 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 23, boolean chains 2, loops 2, 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":2314}}}],"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 22, loops 3, match/switch 2, 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 16, match/switch 7, loops 3, 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.newCompositeMemory (cognitive 27): proc.newCompositeMemory has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, boolean chains 3, match/switch 2, 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":131}}}],"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 20, match/switch 5, 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":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfc97665d7162260757aa563b4dcd91723e00220ba0e0cbee9280762c6a4668"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeProcess.MemoryMap (cognitive 27): nativeProcess.MemoryMap has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15, loops 5, jumps 3, match/switch 3, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/dump_linux.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fe9d0b5bc8d97f47519daff4e38979650555e9fa76edb6938d6b0fcbdc1550"}},{"ruleId":"D2","level":"warning","message":{"text":"StateMachine.PCToLine (cognitive 26): StateMachine.PCToLine has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, 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 16, boolean chains 4, loops 3, match/switch 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 18, boolean chains 6, match/switch 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/eval.go"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0302c870063173d2573c7ccfc3859f340716d6dee74a356f858460f5fb39b1be"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.GoroutinesInfo (cognitive 26): proc.GoroutinesInfo has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, 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":316}}}],"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 19, boolean chains 4, match/switch 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/proc/gdbserial/gdbserver.go"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcbb129a857755b4d1da11e6526a0bcb29c55a801d2813b5c67a531a894daca"}},{"ruleId":"D2","level":"warning","message":{"text":"processGroup.resume (cognitive 26): processGroup.resume has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17, loops 8, 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/proc/native/proc_linux.go"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8029cbb69020d78517cc4fb820e34714b448a5e04a3d4ceb1be56eda66bc2f"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroup.enableBreakpoint (cognitive 26): TargetGroup.enableBreakpoint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, loops 6, boolean chains 2, match/switch 2, 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 19, loops 5, 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":635}}}],"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 22, 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":"Session.onRestartRequest (cognitive 25): Session.onRestartRequest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 24, 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":3480}}}],"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 16, boolean chains 3, match/switch 3, loops 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":"pkg/dwarf/frame/parser.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f53efd435181d3dc80e1ca25b7c379c5508551ef38fb13a54e391f4f71374d3"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.loadBinaryInfoElf (cognitive 24): proc.loadBinaryInfoElf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 24 (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":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"d510b2165aeb27744e00c3c8199333e240ce999d67fa9cc2faecc49b07f1db99"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.loadDebugInfoMapsInlinedCalls (cognitive 24): BinaryInfo.loadDebugInfoMapsInlinedCalls has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, match/switch 2, 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":3017}}}],"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 22, 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 274, 253, 264). 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":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5417a734725c9a4e5e525c28e91fa2ef617805c737122a44afd567ad68de4fba"}},{"ruleId":"D2","level":"warning","message":{"text":"evalStack.run (cognitive 24): evalStack.run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, match/switch 4, 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":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ce34da9acdc3171f43b4d2cc518f2701fb7791e406b10b01d19a6c0cc2a3ac"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeProcess.addThread (cognitive 24): nativeProcess.addThread has cognitive complexity 24 (threshold 15). Drivers by points: if/else 22, 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 16, match/switch 7, 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 18, boolean chains 3, match/switch 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/eval.go"},"region":{"startLine":2764}}}],"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 12, if/else 9, 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 14, match/switch 6, 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":554}}}],"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 20, 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 20, loops 2, 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 15, loops 3, match/switch 3, 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":186}}}],"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 17, 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 15, loops 6, 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":2200}}}],"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 18, match/switch 3, 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 18, 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":"service/debugger/debugger.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"288f8b81d39c77e67c179cce77fec5418ac6aab755c6f9a3f5babb23dae23045"}},{"ruleId":"D2","level":"warning","message":{"text":"proc.FindGoroutine (cognitive 22): proc.FindGoroutine has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, boolean chains 4, loops 4 (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":383}}}],"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 21, 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 17, 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/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 18, match/switch 2, 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 18, match/switch 2, 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 19, match/switch 2, 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 140). 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":106}}}],"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 20, 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 16, match/switch 5, 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":4719}}}],"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 18, 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 20, 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 18, 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":"gdbserial.wiredecode (cognitive 21): gdbserial.wiredecode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, loops 5, match/switch 2, 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":"nativeProcess.DumpProcessNotes (cognitive 21): nativeProcess.DumpProcessNotes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, loops 3, 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/native/dump_linux_amd64.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e71133fea838ee609f70b5f618cf706e13fb9aeb3c1cdfd554dcae9f3d42f69"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeProcess.SetUProbe (cognitive 21): nativeProcess.SetUProbe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/native/proc_linux.go"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"774e34180a07dddd0d3fe63606b1af2ca3493f480ab151a6fc6790e0238a9261"}},{"ruleId":"D2","level":"warning","message":{"text":"stackIterator.newStackframe (cognitive 21): stackIterator.newStackframe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 3, match/switch 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/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 17, loops 3, 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":"Variable.loadSliceInfo (cognitive 21): Variable.loadSliceInfo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, match/switch 2, 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":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6a303debb4a0cfaee742cd9b63cc25c25de39c495642bb254d7a7e95790491"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.examineMemoryCmd (cognitive 21): terminal.examineMemoryCmd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, match/switch 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/terminal/command.go"},"region":{"startLine":2094}}}],"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 11, loops 8, 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.funcCallArgs (cognitive 20): proc.funcCallArgs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, 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 16, loops 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/gdbserial/gdbserver.go"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cafa86a2d851848915c587790f04d86108d086fd6626f2eb39083555e508100"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeThread.withDebugRegisters (cognitive 20): nativeThread.withDebugRegisters has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, boolean chains 5, loops 3 (nesting depth added 7). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 53). 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/native/threads_linux_amd64.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdf839b46e8b4e71c5cda89c2f91712e99b9b8fae42c77b527216b43ed63f42"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.registerVariableTypeConv (cognitive 20): Variable.registerVariableTypeConv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 5, match/switch 2, 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":2181}}}],"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 16, 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":1798}}}],"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 15, boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":2806}}}],"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 16, 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":872}}}],"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 14, loops 3, match/switch 2, 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":193}}}],"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 15, loops 4, 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":2658}}}],"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 12, boolean chains 3, loops 3, 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":"proc.loadBinaryInfoMacho (cognitive 19): proc.loadBinaryInfoMacho has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, loops 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/proc/bininfo.go"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19ab98b60fac09ec2bddf99a7a4afbe8dcdd858b2adcb6a933b6e8db2ee6207"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryInfo.findTypeExpr (cognitive 19): BinaryInfo.findTypeExpr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, 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":2522}}}],"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 14, match/switch 3, 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 17, 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 13, loops 6 (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":1621}}}],"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 16, 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 15, 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 17, loops 2 (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":1409}}}],"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 14, match/switch 4, 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":1569}}}],"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 17, 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 16, 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.resolveCallArgX86 (cognitive 18): proc.resolveCallArgX86 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, 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":"core.buildMemory (cognitive 18): core.buildMemory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 7 (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 15, loops 2, 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 12, 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.disableBreakpoint (cognitive 18): TargetGroup.disableBreakpoint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, loops 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 14, 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":2952}}}],"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 15, 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 18 (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":3190}}}],"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 14, match/switch 3, 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":641}}}],"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 14, loops 3, 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":3602}}}],"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 14, loops 4 (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 11, boolean chains 4, loops 3 (nesting depth added 7). Most of this is not in the body itself: 0 of the 18 points are its own statements and the rest belongs 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 17, 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":687}}}],"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 17 (nesting depth added 1). Most of this is not in the body itself: 0 of the 17 points are its own statements and the rest belongs 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 10, match/switch 5, 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 16, 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 16, 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.minmaxBuiltin (cognitive 17): proc.minmaxBuiltin has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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":2062}}}],"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 12, loops 4, 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":"BinaryInfo.AddImage (cognitive 17): BinaryInfo.AddImage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 3, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9449b01e97840558926e28238f8247d2aae1e5c0693e39c3cbe303f54fc53f39"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalScope.setValue (cognitive 17): EvalScope.setValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, 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":621}}}],"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 14, 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 13, 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 15, 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":"native.waitForSearchProcess (cognitive 17): native.waitForSearchProcess has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 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/native/proc_linux.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bbf69f17733d6e11175a3a4f8f35d007153e861264d4049bd54be7c77e36a3"}},{"ruleId":"D2","level":"warning","message":{"text":"processGroup.singleStep (cognitive 17): processGroup.singleStep has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, match/switch 3, 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/native/threads_hardware_singlestep_linux.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8223bebbe40f70f77d16772dcf1552d0925f46cb08f673121546ed408a0ad85"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.ClearSteppingBreakpoints (cognitive 17): Target.ClearSteppingBreakpoints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 6 (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/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 11, loops 6 (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/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 10, loops 3, boolean chains 2, 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/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 14, 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.formatTime (cognitive 17): Variable.formatTime has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/variables.go"},"region":{"startLine":2371}}}],"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 11, loops 3, match/switch 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/terminal/command.go"},"region":{"startLine":1381}}}],"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 16, 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":2616}}}],"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 11, loops 4, 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":2905}}}],"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 14, 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 17 (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 15, 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":"service/dap/server.go"},"region":{"startLine":1929}}}],"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 12, loops 3, 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":3876}}}],"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 16, 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 14, loops 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":"service/debugger/debugger.go"},"region":{"startLine":1377}}}],"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 12, 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":"proc.runtimeOptimizedWorkaround (cognitive 16): proc.runtimeOptimizedWorkaround has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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 15, 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":258}}}],"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 12, 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 2071). 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":2070}}}],"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 9, loops 5, 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":3196}}}],"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 9, boolean chains 4, match/switch 2, 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 12, 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":1460}}}],"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 13, match/switch 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/gdbserial/gdbserver_conn.go"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef188395eb568b0ba43e747618c6d796de51c9ab3382ceb33a293d6793f0a354"}},{"ruleId":"D2","level":"warning","message":{"text":"native.Launch (cognitive 16): native.Launch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 2 (nesting depth added 2). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 90, 85). 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/native/proc_linux.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fb6248f44e38d9cf4e6d69b5c75d8052ab45067c60aa7a55873b3fdba4688c"}},{"ruleId":"D2","level":"warning","message":{"text":"nativeThread.SetCurrentBreakpoint (cognitive 16): nativeThread.SetCurrentBreakpoint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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/native/threads.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c8f5f0da9bf6b8701da822d141685435f8490cd3f06717bd005ec0f26da2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.mapAccess (cognitive 16): Variable.mapAccess has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, 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":2885}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28b0bb1ea10b0ab4dbe009f7aa836d38a922985d4656730154688c915751d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.restartRecorded (cognitive 16): terminal.restartRecorded has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (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":1190}}}],"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 13, loops 2, 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":150}}}],"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 9, boolean chains 4, match/switch 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/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 12, match/switch 3, 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 198 methods, declared across 2 files: daptest/resp.go (122), daptest/client.go (76). 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":"FileTooLong: dap/server.go: FileTooLong \u2014 2828 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"service/dap/server.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"779f216c6e73f371be9fb414fa0bffe5bb89f582fc6231e3349e2dc06fd44675"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: terminal/command.go: FileTooLong \u2014 2149 significant lines (blank, comment-only and punctuation-only lines excluded). 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 2147 significant lines (blank, comment-only and punctuation-only lines excluded). 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 1912 significant lines (blank, comment-only and punctuation-only lines excluded). 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 107 methods, declared across 2 files: dap/server.go (101), dap/command.go (6). 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":"FileTooLong: debugger/debugger.go: FileTooLong \u2014 1718 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"service/debugger/debugger.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a697be34a487d2b6eaa179dbfa61ef7d7d7db6a0afa7a90059a497a0e15b58bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Debugger: TooManyMethods \u2014 96 methods. 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 1502 significant lines (blank, comment-only and punctuation-only lines excluded). 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 89 methods. Most of these members implement service.Client (82 of 89 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":"FileTooLong: gdbserial/gdbserver.go: FileTooLong \u2014 1277 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"TooManyMethods: BinaryInfo: TooManyMethods \u2014 60 methods. 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":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c711781260d1b791951685e3bb3c713ae357e2db84d438ae0fb20933e500070"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gdbserial/gdbserver_conn.go: FileTooLong \u2014 996 significant lines (blank, comment-only and punctuation-only lines excluded). 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_conn.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b8536bd2738af362f9590435f0025f1655dc6f7fe3612ab07a77da872bb641"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RPCServer: TooManyMethods \u2014 57 methods. 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":"FileTooLong: cmds/commands.go: FileTooLong \u2014 840 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"FileTooLong: proc/fncall.go: FileTooLong \u2014 812 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"FileTooLong: proc/stack.go: FileTooLong \u2014 783 significant lines (blank, comment-only and punctuation-only lines excluded). 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). 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). 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. 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":"TooManyMethods: Variable: TooManyMethods \u2014 45 methods, declared across 3 files: proc/variables.go (34), proc/eval.go (10), proc/mapiter.go (1). 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. 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":"FileTooLong: godwarf/type.go: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"FileTooLong: rpc2/server.go: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"service/rpc2/server.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fdca479729c2731f31ca9e474596c43097eedaf1a79f6d7b3cad5ab78e69a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Target: TooManyMethods \u2014 38 methods, declared across 5 files: proc/target.go (21), proc/breakpoints.go (9), proc/dump.go (4), proc/stackwatch.go (2), \u002B1 more file(s). 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":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9c54a79a21e42a84b64b6a4ea493b52bcfbd895d97a09fbd1f7ece98ec2f5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/proc_linux.go: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"FileTooLong: evalop/evalcompile.go: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded). 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/evalop/evalcompile.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5098d4b9001df6ebc725229c48026d8e159c858ff362b9dfcdc5a212448d6d21"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: process: TooManyMethods \u2014 36 methods. 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":"TooManyMethods: Term: TooManyMethods \u2014 33 methods, declared across 2 files: terminal/terminal.go (26), terminal/command.go (7). 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":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a507b4001dbbdf866f859667a3914ca15d4d839f6999606e64eaf93694f00ada"}},{"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). 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":"FileTooLong: native/proc_windows.go: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"FileTooLong: terminal/terminal.go: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded). 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/terminal.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7ad7febbf93610700021c1196a21b79e633f002c05165105d9b17a3e463850"}},{"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). 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":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): pkg/proc/arm64_arch.go:316-341 | pkg/proc/ppc64le_arch.go:189-214 \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 96 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/arm64_arch.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d196ca113dfdb1a650b471f8a659b101a9095df4bc0af4d4d6fda9c51f483a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): pkg/proc/amd64_arch.go:209-233 | pkg/proc/i386_arch.go:135-159 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/amd64_arch.go:209\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":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb00c18e0631be6c816d6af7510ac72c86ea1a83a71516bcc47ca89ab5cc2fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): pkg/proc/amd64_arch.go:174-197 | pkg/proc/loong64_arch.go:172-195 | pkg/proc/riscv64_arch.go:195-218 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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/amd64_arch.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37cc5906836851ce94ac07737820f0b72c84a80cca02ef147ca411b1bb7457a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): pkg/proc/loong64_arch.go:219-237 | pkg/proc/riscv64_arch.go:242-260 \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 8 separate duplicated blocks between them, totalling at least 128 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/loong64_arch.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ef86b3c4a7b24780e463f44d312c60ed8d313025c485ae6e2c920c5b1534b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pkg/proc/loong64_arch.go:122-137 | pkg/proc/riscv64_arch.go:141-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 8 separate duplicated blocks between them, totalling at least 128 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:122\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":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5221bb4dd1354ca4448cf2175e711f3b150f2bd55e60771ba1150c721a615d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/proc/arm64_arch.go:224-240 | 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 96 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:224\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":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01e9f952ab3b0b21bd0c9b440d2a28f414796e84f1caa0f066b236d2dbc58ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/proc/breakpoints.go:952-965 | pkg/proc/breakpoints.go:975-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:952\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/breakpoints.go"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"889cb6bd4c415f74725e8b45d4df6533529c09f146726a278c41761ceb460ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/proc/gdbserial/gdbserver.go:1878-1891 | pkg/proc/gdbserial/gdbserver.go:1931-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:1878\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":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab27092d71cf6203972777148308187c7e3429cf4d248343b9ebf1366f91253f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/proc/gdbserial/rr.go:104-117 | pkg/proc/native/proc.go:467-480 \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 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":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"990984ca79090acdb436756795b737664580ba649cc791391f996c316fa4e318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/proc/loong64_arch.go:196-208 | pkg/proc/riscv64_arch.go:219-231 \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 8 separate duplicated blocks between them, totalling at least 128 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":"4c18c35ae360e5cb6b84468add694e7b46de4947530eabd5d0b48f100335486c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): pkg/proc/arm64_arch.go:105-116 | pkg/proc/loong64_arch.go:82-93 | pkg/proc/ppc64le_arch.go:75-88 | pkg/proc/riscv64_arch.go:100-112 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/arm64_arch.go:105\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/arm64_arch.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0d02936d8a3007fda7b2fb51316c5dc1811a31d2ec0c7664c4ea9bb3b119cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/dwarf/godwarf/addr.go:25-36 | pkg/dwarf/loclist/dwarf5_loclist.go:27-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/dwarf/godwarf/addr.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3fa4547ff475c8f7e1a98284800f4180f807e921018512202953ca474427c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/proc/dump.go:406-417 | service/rpccommon/server.go:399-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 \u0060pkg/proc/dump.go:406\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/dump.go"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f187f4876a23a18204ffd57431ffbd9e5460b7dd249bc9a5ff33599cf98f3c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/proc/gdbserial/gdbserver_conn.go:1481-1492 | pkg/proc/gdbserial/gdbserver_conn.go:1528-1539 \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":"8cfd6113f4d18133fa526857f5cadf246fa0493a059e31968b28f8ddc2ed07c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/proc/gdbserial/rr.go:87-98 | pkg/proc/native/proc.go:454-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. 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/rr.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e12357f753e570e35630a23347b125431c511d43c9d4157d1a6aeae5c7cb4b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/proc/linutil/regs_loong64_arch.go:84-95 | pkg/proc/linutil/regs_riscv64_arch.go:111-122 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/linutil/regs_loong64_arch.go:84\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/linutil/regs_loong64_arch.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8f529716cc980d4c3612b8c5dbc92ca927ece9583003429ea414f093850769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): pkg/proc/amd64_arch.go:94-104 | pkg/proc/arm64_arch.go:104-114 | 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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/amd64_arch.go:94\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/amd64_arch.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32583fe96153087b40beca65e1ad3d109cae77e1a5b54b033ae2fb4585c3369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): pkg/proc/linutil/regs_amd64_arch.go:94-104 | pkg/proc/linutil/regs_arm64_arch.go:79-89 | pkg/proc/linutil/regs_loong64_arch.go:85-98 | pkg/proc/linutil/regs_ppc64le_arch.go:131-141 | pkg/proc/linutil/regs_riscv64_arch.go:112-125 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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:94\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/linutil/regs_amd64_arch.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5a752ea764c628c672d72a5c99c1e358db23fa3aa5aadcf8997acea622655f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): pkg/proc/amd64_arch.go:137-147 | pkg/proc/i386_arch.go:120-130 | pkg/proc/loong64_arch.go:120-130 | pkg/proc/riscv64_arch.go:139-149 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. 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":"88e372fab79d20baf00090ae438e44fa360f9ad9de90655089b49ae42f49e133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/dwarf/parseutil.go:33-43 | pkg/proc/linutil/dynamic.go:33-43 \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:33\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":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c548daab4401a3be1d0d22a3347438eb8fb107cab510bb7c60a16a88e12168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/proc/arm64_disasm.go:62-72 | pkg/proc/ppc64le_disasm.go:103-113 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/arm64_disasm.go:62\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/arm64_disasm.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"95720595ff559562eb68e9db31d02d6a6ba18636e71c6ed0881b68986f3307bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/proc/eval.go:3018-3028 | pkg/proc/variables.go:1145-1155 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/eval.go:3018\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":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4baae4f70105c9c27cf57454c7f789d2cb408853802c34df15208ff18fe3238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/proc/fbsdutil/regs.go:165-175 | pkg/proc/linutil/regs_amd64_arch.go:139-149 \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/fbsdutil/regs.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c138864c3168bd178d31954acae12b8442247633a174888d99d23bb06cdf9b8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): service/debugger/debugger.go:1354-1363 | service/debugger/debugger.go:1378-1387 | service/debugger/debugger.go:1615-1625 \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. 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":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb6118c41d05db73db47819ba134da724f7d6a3b2c9481fd3f881f2b811f7f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): service/rpc2/server.go:178-187 | service/rpc2/server.go:318-327 | service/rpc2/server.go:350-359 \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/rpc2/server.go:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/rpc2/server.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7cbd93ff60acec9ad708e020b70cc873844544002e8814003e9ca5c7b73e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/proc/eval.go:3043-3052 | pkg/proc/variables.go:1165-1174 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/eval.go:3043\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":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d07fd50929e374233d8ac74e3b6bb2596755c3ac9782c5fd8ba484e0af45263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/proc/fbsdutil/regs.go:188-197 | pkg/proc/linutil/regs_amd64_arch.go:162-171 \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/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":"78929c3bb74d301415f61b82059da55144a8229cf6e17119ab80988f74e9ca55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/proc/stack.go:681-690 | pkg/proc/stack.go:734-750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stack.go"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"135104fd899d428cf8c4c3a26ddfc4602c8a0a9db4a20a7c7d463fb91d45fce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/proc/stack_sigtramp.go:356-365 | pkg/proc/stack_sigtramp.go:436-445 \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 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/stack_sigtramp.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a97f0bc6664f0597ec9ceac2d207656457087141e2dc4a03c4981a494549371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): pkg/proc/stack_sigtramp.go:311-319 | pkg/proc/stack_sigtramp.go:357-365 | pkg/proc/stack_sigtramp.go:437-445 \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 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/stack_sigtramp.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4cb421bf8ee51679a84f6d652f126665bceb65a177fb5d0aea4ea970cf147f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/proc/eval.go:1628-1636 | pkg/proc/eval.go:1644-1652 \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:1628\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":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2cd0e1eb37f04bed29ddbb274e4007421f03d119d7d6168ecdd13dccf892d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/proc/eval.go:1911-1919 | pkg/proc/eval.go:1944-1952 \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 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":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"714f69f727f937bd14adb9d88b648636bfc824d993614fc0a3d392e968de5794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/proc/stack_sigtramp.go:538-546 | pkg/proc/stack_sigtramp.go:824-832 \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 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/stack_sigtramp.go"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd3f2f417677e4a0f0022948627f94657254e4932ee5b6d836aa5acfdc9fce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/proc/stack_sigtramp.go:645-653 | pkg/proc/stack_sigtramp.go:705-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":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c99f5dcdf3d75ae50f4bc1e6dca9364799dd3df1891e0d3499b161a2a71194"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): pkg/proc/linutil/regs_arm64_arch.go:139-146 | pkg/proc/linutil/regs_loong64_arch.go:154-163 | pkg/proc/linutil/regs_ppc64le_arch.go:158-165 | pkg/proc/linutil/regs_riscv64_arch.go:182-191 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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:139\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/linutil/regs_arm64_arch.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3130c4962e36c24e1f6a703565f4ab5b975331260b1ef65c6ddc77c3d722cfc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/proc/arm64_arch.go:259-266 | pkg/proc/loong64_arch.go:215-232 | pkg/proc/riscv64_arch.go:238-255 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/arm64_arch.go:259\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. 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":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e428adc3addb8e6f9e4a92cdac60df8031ba5286067bf22d6be65d22cfe100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/proc/eval.go:1578-1585 | pkg/proc/eval.go:1605-1612 \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:1578\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":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"128c47a98f1b4520a2dc4e4987b15dda32b3138d4b265a95871fc9dd7337d452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/proc/gdbserial/gdbserver.go:1718-1725 | pkg/proc/gdbserial/gdbserver.go:1738-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:1718\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/gdbserial/gdbserver.go"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94619dd10e95f912e5b6915d84057b0037974c9c3e49c77f871b333391f2ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): pkg/proc/amd64_arch.go:51-76 | pkg/proc/arm64_arch.go:61-86 | pkg/proc/i386_arch.go:44-69 | pkg/proc/loong64_arch.go:49-60 | pkg/proc/ppc64le_arch.go:50-56 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. 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":"9be2332e0155f1c5d5b4dfe46afe66e42a394f296805b228045ca767a0c0e042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/proc/evalop/evalcompile.go:747-753 | pkg/proc/evalop/evalcompile.go:777-783 \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:747\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":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"2167ef166180c920251af97d28194c9bf8c50359fb7f88e09df3adef71701cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): service/api/prettyprint.go:386-392 | service/api/prettyprint.go:486-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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. 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":"service/api/prettyprint.go"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d75cd83b5ff4f21ffca516a8f466752ac8564fb63e230a71931f096710fe71d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/proc/stack_sigtramp.go:828-834 | pkg/proc/stack_sigtramp.go:907-913 \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":"637945da89b79d638a1ef705244538eb4d4186cbfe4cb1a60477b632fac3a589"}},{"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":"90a4f47281ca351ccf6a03d20c1820c4a31b49758a5d142103da70747a4e9449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): pkg/terminal/starbind/starlark.go:106-111 | pkg/terminal/starbind/starlark.go:122-127 | pkg/terminal/starbind/starlark.go:140-145 \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. 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/terminal/starbind/starlark.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f62c88dcc39d56f9c7da3ba25a985653625cc82410f83c1648f38cb37d9f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/proc/amd64_arch.go:358-363 | pkg/proc/i386_arch.go:242-247 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/proc/amd64_arch.go:358\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/amd64_arch.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"208e51215fd22dedd9f42ee8169ee0967b453a54493086f890611125e45ba2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/proc/dump.go:420-425 | service/rpccommon/server.go:413-418 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/dump.go"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"092ac9275e79e035f6d1a6cf0e4424dbdab36ea9f4b34a60b4c30030c1d0f7f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/proc/eval.go:1683-1687 | pkg/proc/eval.go:1705-1709 \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:1683\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"69aedfd7c43383794d408f21724a6755b445d62f9ebcf58389e82e3d7d78531d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): service/api/conversions.go:196-200 | service/api/conversions.go:217-221 \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/conversions.go:196\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/conversions.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7ae196414acaa66893f1e3f2711a6eeb8c7432308517b084afef8346e9239b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/dap/server.go: service/dap/server.go changed 7 times in last 90 days, max complexity 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/server.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98662f4313f0016a1e8ce9f69f33e76200a427262f2673b6142936a04e726c3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/proc/stack.go: pkg/proc/stack.go changed 4 times in last 90 days, max complexity 39. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/stack.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c169c0e54214b1d25946f6d18a932c80154b23fffb1f99e9fc011907fbc887e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/proc/eval.go: pkg/proc/eval.go changed 2 times in last 90 days, max complexity 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/eval.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d3dc22c74c1482ca5662160fa0532e08b035f6026f5744bcd8b074d4a74753"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/debugger/debugger.go: service/debugger/debugger.go changed 2 times in last 90 days, max complexity 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/debugger/debugger.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aba7ee1bda7f89cb87af7c07cd0105b79beef36863bc0fc971f6daefbc017a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/terminal/command.go: pkg/terminal/command.go changed 3 times in last 90 days, max complexity 36. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/command.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3b6150b4185891ab62a6d3ec27b1a07cf5f730de5ba978a567274ff47a3546"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/proc/bininfo.go: pkg/proc/bininfo.go changed 3 times in last 90 days, max complexity 36. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/proc/bininfo.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ba73f3c014bf925c01c642a195ef7c1d848981820e1fe3320cd2e805727982"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/terminal/terminal.go: pkg/terminal/terminal.go changed 2 times in last 90 days, max complexity 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/terminal/terminal.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99193c01df5efec1720707beabef033179c00f92b3fef1d6acfcd4cc3b5e74d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/dap/command.go: service/dap/command.go changed 2 times in last 90 days, max complexity 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/dap/command.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04042da357f2b7e3d5a4bbc8f7371aaf997a221ae24f5da6ab34fa6bb1edc599"}},{"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/client.go, service/rpccommon/server.go, pkg/dwarf/line/line_parser.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":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 3 significant file(s) lose their only recent owner: pkg/proc/arm64_arch.go, pkg/proc/native/proc.go, pkg/proc/native/threads_windows.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e0acfae4696035e6a7044449342030ca07b7973f74b6020466bb1ae6a057d392"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (13 single-owned of 136 analysed files in total, counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). They are anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c15e03ac1fa47e87e1db1facbff939b0109157aa1a15ea9510ba7aa38b6e07cb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"160f8e4f73e01d60a8b0f3a55ca62cade4ad4cf4c5bac6b888bcc7b6a7289d91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92907a34f7bb703ac2f87accff7cda97f3116882db94aa70aec8390e8b41c606"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab9df9126daf490f6bdf4f889efde01a0bce4585e52a9f0ed88f0e8ac9315ffc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07990ded271045ea1b57b7b59867276e64e8d7583a4a53d2da3df70958d5e4bd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10af382bbadbb7345dc46e028cfcbbbe9df50101b9277233e8257c1d12bf30dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f24b59018cb6686fbcad4748f6c9feaadb25cd2415c0d1d4fa27decd6dc565d8"},"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":"7dbbd1b2729b2271e7799416efd9b4d9dfc7fd7576376450cd4b3ddf0ba5760b"},"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":"7d34f3425035311dc4127d53752df9d65a790348daaa9d369dbcf72d965d2a30"},"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":"7d03517fb11d6032458df6002e4166cd14975db3a5321b9e10eb274fb41423f4"},"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":"1c2d3ea34c4c8de51c337782262ff653e2ee0596a4440a8dc431df3a94bedd67"},"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":"60fca793e40c8e0b37a77f4ec78d80955e7b8ead8c4e29003cf3817eb797995a"},"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":"ce0d600f514f07c1d976501d9eb1147d0aebd569375a177dcd5350cb6eed50cf"},"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":"70d8c0199e3b61ded23cb1a84273ea8a70257f9b303b077c1cc6a0057a7b48aa"},"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":"95992b1254606db51fc55c1d0368e82049168c35d960ce69d0096b6c36ff280c"},"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":"c02f8a2e7535fc1464c6c1ec20d9ec12980afcd879705e903a423aa0c36d9ea0"},"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":"6ed79447cce6e33452a7f2558bfb65b3868bff31824ac1b8575cd6c91509c2a9"},"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":"ff260573f3e7b324311ad6de9193848a8b6ca3a10d44710e056a8906d11594ee"},"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":"c49b3aa66fccc36de6ee2b8a3523bffb5ef99d3d31ac18a6a2c9ce1ae1b91777"},"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":"94c46a9535df354ddedd766103544ff2f82ee5c1da5a32b061549db13bfaf2bc"},"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":"6ea42b7cd9af9850231404d2ec4380ea4d05479ed7e90b3b3ab3f6c9b848516a"},"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":"ea832c7ab764d56f8ebb8afdc3708d4cb322cc99d13bea286955568d85332b5f"},"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":"d45bdd674cbdfcbf05ea8257ee3e428eb3529445ac3f89127a74fafbbf26af91"},"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":"6fea82fa1356057a7b2dade83c11c0d2e40604036cf6ae9bcf3bc280760343d7"},"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":"8b5a48420cdf0600632e1cc2c21710bed7a14a5104e08e02fbc757f2937ade95"},"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":"de60a4c886442dd58428c3fc3e6be0e4542b2209f759affe437e522df74e274e"},"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":"bc32c78cb5dbf2a05fcb03316d1d65923ce6944176defc34f94b8b930c45c883"},"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":"9129b136bd01078555ddf8141b84ead74aa5b931fa8e77b725b17f1e4e955e5f"},"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":"5108ec8acfa4291dc2562ace2cda36dd604a218c887b9e2b34f2c346bfe2cae7"},"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":"28948d9507fc3ae0a1b06f6b0cdb1b78702884746756a168beae473bea5cffd0"},"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":"b045abb136508c45b051710cb188ccb7f0c7f9f723b1a3d255e58b43064c9fa6"},"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":"3712cbeefa124cda75af217c39da0a21ce6bb116ed4b63f3136176a7fcf1e33c"},"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":"d03529f94b86f9a986872b07038caba1921149ddf67fe280013e24cf5b16a0d0"},"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":"14bfb04b71946233c7f2607f9bfaf68404c567794fa9218bc7574ee3431d4472"},"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":"260ac86fc2b18d0abb0fbcfa466d53005e87d22563592fe28af1ec7f9458ce41"},"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":"445eac246910a467cbc13a45db5de81c919a88873061a033c0b3063dce3ddf67"},"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":"63831ae517ca3b0a22f6acd6e73e72041c14ab0841a278906f0b5c60d0065f6f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 13 of 136 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 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). 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 largest first: pkg/proc/linutil/regs_riscv64_arch.go, pkg/proc/native/threads_linux_riscv64.go, pkg/proc/winutil/regs_amd64_arch.go (and 10 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":"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) 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."},"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). 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."},"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"}},{"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"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"ruleId":"D38","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":"626e01eacf94c3b3382809ff8a91277880813d4497b12c2cdcf28b0d8c94458b"}}],"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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":44,"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."]}]}