{"$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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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"]}},{"id":"D40","name":"Network Egress Confinement","shortDescription":{"text":"Network Egress Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D40"},{"id":"D41","name":"Kernel \u0026 Syscall Confinement","shortDescription":{"text":"Kernel \u0026 Syscall Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D41"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Request.executeRequest (cyclomatic 128): Request.executeRequest has cyclomatic complexity 128 (threshold 15). Of this number, 125 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/protocols/http/request.go"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"5624feea8bce8254c9e358620117b518cf2809eab75db52dde9090fcdd01c145"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.New (cyclomatic 74): runner.New has cyclomatic complexity 74 (threshold 15). Of this number, 69 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":"internal/runner/runner.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5313bef606bd3190f952c35eb17ffce4cae61f01ac47c4769d02871272a5f8c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.Compile (cyclomatic 61): Request.Compile 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/protocols/http/http.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d960c0599dec1e19ec9c4e33fdd9d835d41915ea3dcfd150a8ec2908bdfaf98f"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.RunEnumeration (cyclomatic 56): Runner.RunEnumeration has cyclomatic complexity 56 (threshold 15). Of this number, 55 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":"internal/runner/runner.go"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ad2302b851f04c061266e0899bce9fad61bea6a399700a24260cd1637f7574"}},{"ruleId":"D1","level":"warning","message":{"text":"openapi.generateRequestsFromOp (cyclomatic 53): openapi.generateRequestsFromOp 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/input/formats/openapi/generator.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"69065bd06774d2b05b73afc9103a824f44981c715f17095437ef524dda9cda42"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.LoadTemplatesWithTags (cyclomatic 52): Store.LoadTemplatesWithTags has cyclomatic complexity 52 (threshold 15). Most of this is not in the body itself: 6 of the 52 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 862, 797, 827). 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/catalog/loader/loader.go"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6545204d424b3c53113853e11c600412c784846d074fea8155599da85f66d60"}},{"ruleId":"D1","level":"warning","message":{"text":"main.readConfig (cyclomatic 49): main.readConfig has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/nuclei/main.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecc9f8afbcc033047ea1a439ec966d6d4b4315bf1f1f673f80fe8c432c42d84"}},{"ruleId":"D1","level":"warning","message":{"text":"openapi.openAPIExample (cyclomatic 48): openapi.openAPIExample has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/input/formats/openapi/examples.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80e536af7b6a577894ff33951c66c1e56d1678dd97d312a92f449ca886be272"}},{"ruleId":"D1","level":"warning","message":{"text":"NucleiEngine.init (cyclomatic 46): NucleiEngine.init has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sdk_private.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3555299679f57525305a4de768050d5f921c394523b4fdd332171e67ef8781c6"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeParallelHTTP (cyclomatic 46): Request.executeParallelHTTP has cyclomatic complexity 46 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 22 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/protocols/http/request.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"54528e10694b720d318c6dde708f9493c826ce1f535e577ec80d3fc1378de0bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.preflightResolveAndPortScan (cyclomatic 43): Runner.preflightResolveAndPortScan has cyclomatic complexity 43 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 23 belong to 6 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":"internal/runner/preflight_portscan.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed4cb5bd358d05149e95066e6335cb0326100d654c744563ab7a3a8dbf2f40b"}},{"ruleId":"D1","level":"warning","message":{"text":"Page.ExecuteActions (cyclomatic 40): Page.ExecuteActions has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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/protocols/headless/engine/page_actions.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aa7e8385adefcccc975eb50eb7f517e543e9415b55325d6bc07ddb58ad5504"}},{"ruleId":"D1","level":"warning","message":{"text":"httpclientpool.wrappedGet (cyclomatic 40): httpclientpool.wrappedGet has cyclomatic complexity 40 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 20 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/protocols/http/httpclientpool/clientpool.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4b7610a90e5ae172e2dd8a47d5c7772a044f157337e12e87ac34ab503265a8"}},{"ruleId":"D1","level":"warning","message":{"text":"decoder.decode (cyclomatic 40): decoder.decode has cyclomatic complexity 40 (threshold 15). 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/reporting/trackers/linear/jsonutil/jsonutil.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa5529840e21b6f523687a3b099db368aacbd800dd74dd60e55368bc97eff62"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.ValidateOptions (cyclomatic 38): runner.ValidateOptions has cyclomatic complexity 38 (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":"internal/runner/options.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c954cb130a6b4d7910776e7b9e397195e6edb312c4fe985dc971fdd741efbabd"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.ExecuteWithResults (cyclomatic 38): Request.ExecuteWithResults has cyclomatic complexity 38 (threshold 15). Of this number, 36 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/protocols/code/code.go"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"40de14a189797e33ccba001ff2a8a4323b57b809336665fc1b1952daafb70657"}},{"ruleId":"D1","level":"warning","message":{"text":"EntityParser.Parse (cyclomatic 37): EntityParser.Parse has cyclomatic complexity 37 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 11 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/js/devtools/tsgen/parser.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0f40b4508c6a2d4354622c9c89abec857aff8689b7de3d026ebc47739aeeef"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.ExecuteWithResults (cyclomatic 36): Request.ExecuteWithResults has cyclomatic complexity 36 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 20 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/protocols/http/request.go"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"598dad1a166880f9fe3c655a06a6faf10aca648def6214ac801f2ab77f9c983c"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.Compile (cyclomatic 35): Request.Compile has cyclomatic complexity 35 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 7 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/protocols/javascript/js.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"383610ed749e7d0b32502c35bda169d3f33835aaa16d3c87a2f2af10f11d0fa4"}},{"ruleId":"D1","level":"warning","message":{"text":"main.main (cyclomatic 34): main.main has cyclomatic complexity 34 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 15 belong to 6 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":"cmd/nuclei/main.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"670ac8f4f78108d16a68243b7919305b9bcc4d311289db8ba0f012b5c2b47db1"}},{"ruleId":"D1","level":"warning","message":{"text":"main.main (cyclomatic 34): main.main has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 14 of the 34 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 83, 148, 45). 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/js/devtools/scrapefuncs/main.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"535aa1673fbeb9d2be913745dbc1a12ebc0c25e70b7028e240b7a46a16ac0805"}},{"ruleId":"D1","level":"warning","message":{"text":"Operators.Execute (cyclomatic 34): Operators.Execute 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/operators/operators.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eadfafb6ac939bdc9f786c0439f7e9eeca8825d91b53e835f6d29d6c9f58eaf"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeWithResults (cyclomatic 33): Request.executeWithResults has cyclomatic complexity 33 (threshold 15). Of this number, 31 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/protocols/javascript/js.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc11fc682d7b86cedccae0b89fdded249e3813f643b1498f73c0d5e827718bbd"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeRequestWithPayloads (cyclomatic 33): Request.executeRequestWithPayloads 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/protocols/network/request.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd3c9f5efbd1e02ae1c466b4e516d84355e4f8e58a6a3accc11ec82d5e90462"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.ExecuteWithResults (cyclomatic 33): Request.ExecuteWithResults 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/protocols/ssl/ssl.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c947cf360f3b3810de38c36deb0ebe074a5ac7414aaa1c0bc422e9a5486f81a2"}},{"ruleId":"D1","level":"warning","message":{"text":"reporting.New (cyclomatic 33): reporting.New 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/reporting/reporting.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d0fa4ca4143f3a597c0bdefad5993cdc5d8a40cf9206dbe7178e4b136dcfcd"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.runWorkflowStep (cyclomatic 31): Engine.runWorkflowStep has cyclomatic complexity 31 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 15 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":"pkg/core/workflow_execute.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1152c623dc55975b0a1b5796099fd7436a7abb9fdf95843910a0d61bb8cbdea"}},{"ruleId":"D1","level":"warning","message":{"text":"Helper.convertInputToType (cyclomatic 31): Helper.convertInputToType 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/input/transform.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0e432b3f868abc985cddb3baaa735a3cf4d05c20e9c0ce029b4130b9ddd73e"}},{"ruleId":"D1","level":"warning","message":{"text":"Template.validateAllRequestIDs (cyclomatic 31): Template.validateAllRequestIDs 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/templates/templates.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e605f262c2b6ecf62ad89570b45ec7289a7b88906b0ce26a6bdc3c60a63ab8d"}},{"ruleId":"D1","level":"warning","message":{"text":"requestGenerator.generateRawRequest (cyclomatic 29): requestGenerator.generateRawRequest 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/protocols/http/build_request.go"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2b084721cd716a01ad659517f7f85dd14496d832ebf64612149e66a70689cf"}},{"ruleId":"D1","level":"warning","message":{"text":"templates.NewTagFilter (cyclomatic 29): templates.NewTagFilter 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/templates/tag_filter.go"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c012599260e33926a68d1f1e0c6b5125e84bb20247ab9874cf2f93fcfbea3a"}},{"ruleId":"D1","level":"warning","message":{"text":"Instance.Run (cyclomatic 28): Instance.Run has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/headless/engine/page.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eac1b3c8c86bf542f41052b94fe13ce16b663bdf644f173515e539d7f059047"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.Compile (cyclomatic 28): Request.Compile 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/protocols/network/network.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ad9b645c9186dae10a3da1d737fb4ae248bcedbc7d88c6a9d74567dd1ff350"}},{"ruleId":"D1","level":"warning","message":{"text":"Secret.Validate (cyclomatic 27): Secret.Validate 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/authprovider/authx/file.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"effbea21d432a54366431e08150f81005e569b79bbf5c25aa41214c8122b4327"}},{"ruleId":"D1","level":"warning","message":{"text":"xss.AnalyzeReflectionContext (cyclomatic 27): xss.AnalyzeReflectionContext 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/fuzz/analyzers/xss/analyzer.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eefed694b6e0ffefce1173ba9a84f3e84cf3a7832d130788a0170c41d9d39c4"}},{"ruleId":"D1","level":"warning","message":{"text":"Template.ImportFileRefs (cyclomatic 27): Template.ImportFileRefs has cyclomatic complexity 27 (threshold 15). Of this number, 25 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/templates/templates.go"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"faffccb578f3c12ee336cd336886de031289ce27a1043d6c0685c0fab95a28bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.ExecuteWithResults (cyclomatic 26): Request.ExecuteWithResults has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 4 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 60). 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/protocols/file/request.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"488fe4e57516a2deb68135f05c8762d6eecb6406aedb229fd30a0a790271aa9f"}},{"ruleId":"D1","level":"warning","message":{"text":"loader.New (cyclomatic 25): loader.New has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 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/catalog/loader/loader.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a541d9bfd3490d78f63c8a01e16a411ec4c0141fc68017304b566ae2b1af6c3"}},{"ruleId":"D1","level":"warning","message":{"text":"mssql.parsePreloginResponse (cyclomatic 25): mssql.parsePreloginResponse has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/mssql/fingerprint.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf792b0c0af10f662ad3d17495ccf8978149fee92ebc361dd03709b506fbede"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.processInteractionForRequest (cyclomatic 25): Client.processInteractionForRequest has cyclomatic complexity 25 (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/protocols/common/interactsh/interactsh.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6147941e0cfa4d023936b740120bc2d2bb1bcb81f0853dc89e247dbd49177dac"}},{"ruleId":"D1","level":"warning","message":{"text":"protocolstate.initDialers (cyclomatic 25): protocolstate.initDialers has cyclomatic complexity 25 (threshold 15). Of this number, 22 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/protocols/common/protocolstate/state.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd9359101390b18251f6448e212f2bdae525b610edd9354f93698d37791672f"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeRaceRequest (cyclomatic 25): Request.executeRaceRequest has cyclomatic complexity 25 (threshold 15). Of this number, 19 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/protocols/http/request.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5d5ef4eaff47e27ef608e13123d8f076bceb9838ec39f2bd2b9296c2663edd"}},{"ruleId":"D1","level":"warning","message":{"text":"NucleiEngine.applyRequiredDefaults (cyclomatic 24): NucleiEngine.applyRequiredDefaults 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":"lib/sdk_private.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ec7130805ce59d8c0d81288d16caa86bd2db7dd6c48ca8f2cbe7b71d3a5b85"}},{"ruleId":"D1","level":"warning","message":{"text":"Rule.Compile (cyclomatic 24): Rule.Compile 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/fuzz/execute.go"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"636b38180ad30e1a20f173e8b16636092b8718e8d86c62d10cb8503a666171ba"}},{"ruleId":"D1","level":"warning","message":{"text":"global.initBuiltInFunc (cyclomatic 24): global.initBuiltInFunc has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 120, 151, 182, \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/js/global/scripts.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd7c29a264cabad481cfee781fbc23a160cba549a1bc62f7be2ddaa8c53a465"}},{"ruleId":"D1","level":"warning","message":{"text":"Matcher.CompileMatchers (cyclomatic 24): Matcher.CompileMatchers 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/operators/matchers/compile.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5032edb57619437037ec9cdb99b3cff611825c862f1f51556fe5d5b87713b3c"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeTurboHTTP (cyclomatic 24): Request.executeTurboHTTP has cyclomatic complexity 24 (threshold 15). Of this number, 18 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/protocols/http/request.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d237e4b7a3123c485c546ab41b402b272c945f772305f5c42116f2bfeb95832"}},{"ruleId":"D1","level":"warning","message":{"text":"raw.Parse (cyclomatic 24): raw.Parse 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/protocols/http/raw/raw.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b777cfc83eb2c142a08dc5fd1f1e7d4487dd69f9b2e1cf986cd12c461451a206"}},{"ruleId":"D1","level":"warning","message":{"text":"requestGenerator.fillRequest (cyclomatic 24): requestGenerator.fillRequest 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/protocols/http/build_request.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d61b6bc180c753119a9dbc607357b2793aeaa50b38724d25456b19ce700dac"}},{"ruleId":"D1","level":"warning","message":{"text":"format.CreateReportDescription (cyclomatic 24): format.CreateReportDescription 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/reporting/format/format_utils.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9781359ad8617c6810bc92584a4faf27b229f2e43307a7db487f5384dec6c1"}},{"ruleId":"D1","level":"warning","message":{"text":"templates.tryCollectConditionsMatchinfo (cyclomatic 24): templates.tryCollectConditionsMatchinfo has cyclomatic complexity 24 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/templates/tag_filter.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"eada18c06a6ede03bd7a926173658ba7f790b0d55cf2cd5e3564802ef67b5d28"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.readUntil (cyclomatic 24): Client.readUntil 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/utils/telnetmini/telnet.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae8d7e387de43ffdd58aefe139dda9626f3d129df7391d5b88cfed93c1ba37e"}},{"ruleId":"D1","level":"warning","message":{"text":"Rule.Execute (cyclomatic 23): Rule.Execute 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/fuzz/execute.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a647d1b36ff22b0238126fe40cbaab360994309220070c497072faa3121c3c8"}},{"ruleId":"D1","level":"warning","message":{"text":"SwaggerDownloader.Download (cyclomatic 23): SwaggerDownloader.Download has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/input/formats/swagger/downloader.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8aa0312169ec77f84722e5bef6ab4e55497b49a0217f9fac7c62d08e3e0e46"}},{"ruleId":"D1","level":"warning","message":{"text":"goexec.MergeOptions (cyclomatic 23): goexec.MergeOptions has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/goexec/options.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86ee2b726dca8cc94c4391bd2cd326d10c5b047d81ce1a6f5dfa09e8b649248"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.do (cyclomatic 23): Client.do has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/http/http.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db7cc49277f4ce01bfc88428bb7a8a83a3ac304afeeab74fcfd3a6e9f2c3b6c"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeRequestParallel (cyclomatic 23): Request.executeRequestParallel has cyclomatic complexity 23 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 10 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/protocols/javascript/js.go"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a477c7c4261ad2e146e040e02c20d7a30d739bb9b9f27b46a9cc91e55421074"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeRequestWithPayloads (cyclomatic 23): Request.executeRequestWithPayloads 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/protocols/javascript/js.go"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0a4297ba89c167b1cf98b813c17d7a8b47e2f68cddf15ce094ef853023ea2b"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateExecuter.Execute (cyclomatic 23): TemplateExecuter.Execute has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 150, 141). 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/tmplexec/exec.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fb6ed18b24b5963d2bc4c84297f78ce2e530c05e8e413a33e7fefd3ca410cb"}},{"ruleId":"D1","level":"warning","message":{"text":"telnetmini.parseTargetInfo (cyclomatic 23): telnetmini.parseTargetInfo 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/utils/telnetmini/ntlm.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a359a898f18fa04194fa2c3c6e3c5ab58d962cc112533f4be8eee667329513d"}},{"ruleId":"D1","level":"warning","message":{"text":"main.process (cyclomatic 22): main.process 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":"cmd/tmc/main.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbbb7042f9e56c58b3f2edda8acfe956a66fc2aeecd42896909a59e8318881f"}},{"ruleId":"D1","level":"warning","message":{"text":"Form.Encode (cyclomatic 22): Form.Encode has cyclomatic complexity 22 (threshold 15). Of this number, 18 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/fuzz/dataformat/form.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c3b72da4079ac59ea9463570115b0a6fc49b52c42261a7e5a84414d5289e95"}},{"ruleId":"D1","level":"warning","message":{"text":"ListInputProvider.Set (cyclomatic 22): ListInputProvider.Set has cyclomatic complexity 22 (threshold 15). Of this number, 21 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/input/provider/list/hmap.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"857326cb6605011864cfe7fbbd02fadde42371596a7b7d24c4a7b8c2bd880a12"}},{"ruleId":"D1","level":"warning","message":{"text":"ListInputProvider.Del (cyclomatic 22): ListInputProvider.Del has cyclomatic complexity 22 (threshold 15). Of this number, 21 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/input/provider/list/hmap.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f44a79d6600d5afec99c03bb6bb686925178987672cdd80e848f6c424571576"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateManager.writeTemplatesToDisk (cyclomatic 22): TemplateManager.writeTemplatesToDisk has cyclomatic complexity 22 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 9 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/installer/template.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69a7aa465adb0d5e8780ac4ace9a16238cfc2620a5f750b114ba7236ad6b0b3"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.DCSync (cyclomatic 22): Client.DCSync has cyclomatic complexity 22 (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/js/libs/secretsdump/secretsdump.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e597d6ca1e1e3ea68aa3d3c55a17d19db76ecdffccb0dbaade24cbf8d8ef756"}},{"ruleId":"D1","level":"warning","message":{"text":"dsl.init (cyclomatic 22): dsl.init has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 28, 105). 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/operators/common/dsl/dsl.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"705f18026ecdff13dcde3b0e7ed4644bf9664e054b1c5ba739ac8750a741b1d3"}},{"ruleId":"D1","level":"warning","message":{"text":"StandardWriter.Write (cyclomatic 22): StandardWriter.Write 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/output/output.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44dbd0bbbb119ab83bbfb4990a934bdbedb998329dc6a629e02d986122dfcc2"}},{"ruleId":"D1","level":"warning","message":{"text":"Page.routingRuleHandler (cyclomatic 22): Page.routingRuleHandler has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to one function literal inside it that branches (line 17). 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/protocols/headless/engine/rules.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80c3216d10b489924ae702ab939f4bd8928ec3356208315a5e4e3c37c043ba0"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeRequestWithPayloads (cyclomatic 22): Request.executeRequestWithPayloads 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/protocols/headless/request.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ac61abda0c3af99985806aa14d80c5958224cb3027471ab029b54dbe113fce"}},{"ruleId":"D1","level":"warning","message":{"text":"raw.readRawRequest (cyclomatic 22): raw.readRawRequest 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/protocols/http/raw/raw.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3136765f29359e7b8bd098f437bd21613824ddede0fbcddccc6cb195acb6459"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.generateVariables (cyclomatic 22): utils.generateVariables 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/protocols/utils/variables.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed8d539cbeef93276c3c0fd75c677ac677479565a071c7e0389eed571250869"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.GetLazyAuthFetchCallback (cyclomatic 21): runner.GetLazyAuthFetchCallback has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to one function literal inside it that branches (line 69). 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":"internal/runner/lazy.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8af043c2a01e3a693adaf4f7570382c355a19a31461f2a952d1e4855c7f6202"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.ParseOptions (cyclomatic 21): runner.ParseOptions has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runner/options.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a63f81378088b15d7957e6a2d71895491ba46de31f81b2f0011935103170579"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.displayExecutionInfo (cyclomatic 21): Runner.displayExecutionInfo has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runner/runner.go"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"0940aaaa7115b7f4272d763468eb1dc787e9c16d996055bf7a41c0a4db30762e"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.LoadTemplatesOnlyMetadata (cyclomatic 21): Store.LoadTemplatesOnlyMetadata 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/catalog/loader/loader.go"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"914846ba361b2888c952195bbdd1c58a44bea5aadffaf7f2b41a95115eff0e51"}},{"ruleId":"D1","level":"warning","message":{"text":"mysql.enrichMySQLHandshake (cyclomatic 21): mysql.enrichMySQLHandshake has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/mysql/fingerprint.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2973a66f2dc34968bc6b5ef23939e874f3b05d3fbf4f56dfab7ce57ddf40d499"}},{"ruleId":"D1","level":"warning","message":{"text":"rdp.checkRDPEncryption (cyclomatic 21): rdp.checkRDPEncryption 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/js/libs/rdp/rdp.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2e6c6518793a763b69f9922f2b7c7191cd29305d7e4589439d2ef7d66df469"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.findMatchesWithReader (cyclomatic 21): Request.findMatchesWithReader 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":"pkg/protocols/file/request.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b564dc55f6bedffb3e126d85a9eb09eef9ad3df6b6168d84590253547a57320"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.preflightOneResolved (cyclomatic 20): Runner.preflightOneResolved has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. 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":"internal/runner/preflight_portscan.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f147ff0bae51794311c015e8103df8257a5d95ce56747ef5bf7f412c3b21e0a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.executeTemplateWithTargets (cyclomatic 20): Engine.executeTemplateWithTargets has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 121, 97). 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/core/executors.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"155b780ebb2d1419e3293082e37cb7095c6aad316b50f49ac7dba002f3e65418"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAPIDownloader.Download (cyclomatic 20): OpenAPIDownloader.Download has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/input/formats/openapi/downloader.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08dd8511e5c1e787094015760077a7e247ac6d5abb9ef00c645117eb30d6326"}},{"ruleId":"D1","level":"warning","message":{"text":"fuzzMatcherCandidate.applyLines (cyclomatic 20): fuzzMatcherCandidate.applyLines has cyclomatic complexity 20 (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/operators/matchers/fuzz_harness.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56a4754a4b27c0f72fb4a5ca92ae1626b458cac3e34de3278af8ec80e5be717"}},{"ruleId":"D1","level":"warning","message":{"text":"StandardWriter.formatScreen (cyclomatic 20): StandardWriter.formatScreen 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/output/format_screen.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d6b8a9c7f04986d55a49d72c5ed3859ddc9a6abfda7673d7f004bd325414a6"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.execute (cyclomatic 20): Request.execute has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/dns/request.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf0872cd1f5194b8661e1f2d66e15dff35fcd4adb867e0b0c3651ce76ff3260"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.Compile (cyclomatic 20): Request.Compile 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/protocols/headless/headless.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a26eb985b6853577ffe0f1d44da3aa625f8da9ca1053cc764d69bc90db9815"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeGeneratedFuzzingRequest (cyclomatic 20): Request.executeGeneratedFuzzingRequest has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/http/request_fuzz.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f654a34a19dcb0ec16f4f554d26943575df10b9e5ff43705319e3aa1b60e4023"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeRequestWithPayloads (cyclomatic 20): Request.executeRequestWithPayloads has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/websocket/websocket.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1f36045b117e51f414f53413ef305e12b23a83c4a9527fcc10f256336d8c09"}},{"ruleId":"D1","level":"warning","message":{"text":"FileAuthProvider.init (cyclomatic 19): FileAuthProvider.init 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/authprovider/file.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8fa52a43aac959b37f0e88cc01d3c2a7c88e5011ad47316e3b1e4c2b8acd07"}},{"ruleId":"D1","level":"warning","message":{"text":"openapi.GenerateRequestsFromSchema (cyclomatic 19): openapi.GenerateRequestsFromSchema has cyclomatic complexity 19 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/input/formats/openapi/generator.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7744c31fa1ff9c5874c73f22f2d3492f265cd28fc816ca7cfff100552543907"}},{"ruleId":"D1","level":"warning","message":{"text":"ListInputProvider.initializeInputSources (cyclomatic 19): ListInputProvider.initializeInputSources has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/input/provider/list/hmap.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9cdab3c438a81c11dc4adec5dbc58a5b7f6ca6af6c7f66a8707f27132288b9"}},{"ruleId":"D1","level":"warning","message":{"text":"types.ParseRawRequest (cyclomatic 19): types.ParseRawRequest 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/input/types/http.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d6ca84646084d3d29a95a32833041d0e2dacf8f93c61736fbbcdaac63105b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Extractor.CompileExtractors (cyclomatic 19): Extractor.CompileExtractors 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/operators/extractors/compile.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d4ce982d09692ab543c3283bf292c17cd3d6da7fb91fe6f4aec70ceb6d98ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.debugPrintInteraction (cyclomatic 19): Client.debugPrintInteraction 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/protocols/common/interactsh/interactsh.go"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b3dcae5ea26adc686ac9bffb34d253307dd0da038ce5ba64d6f83b4e247a4d"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.ExecuteWithResults (cyclomatic 19): Request.ExecuteWithResults has cyclomatic complexity 19 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/protocols/headless/request.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f10e73528a8d26d52a3c4a00065d0664b3535634188f8c71f3be7adf8a8883"}},{"ruleId":"D1","level":"warning","message":{"text":"requestGenerator.makeSelfContainedRequest (cyclomatic 19): requestGenerator.makeSelfContainedRequest 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/protocols/http/build_request.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0b35c20349b35df662a2ee09d2d981a7e95646dc28235a0a4b5ccb6f4b0930"}},{"ruleId":"D1","level":"warning","message":{"text":"templates.parseWorkflowTemplate (cyclomatic 19): templates.parseWorkflowTemplate 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/templates/workflows.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ee3e50b687393c4d04c45b1facc44f863a7e2cb3eae9bdf11ab125ef83649c"}},{"ruleId":"D1","level":"warning","message":{"text":"ClusterExecuter.Execute (cyclomatic 19): ClusterExecuter.Execute has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 9 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/templates/cluster.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c5b9ff4045a8ee2831c95ab1399d4b9280dfac22da80184c3bb917fbd6a3b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.LoadTemplateTags (cyclomatic 18): Store.LoadTemplateTags 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/catalog/loader/loader.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dbb66eaeac6d55c7dbead5e26e5e1ca6aac66a2181921602b80d32e29dd3d5"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.NewInputProvider (cyclomatic 18): provider.NewInputProvider 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/input/provider/interface.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2896ddc89a804781c6750038b96dfe96b3a0879cb6edb6e454a0fa566904d0"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateManager.cleanupOrphanedTemplates (cyclomatic 18): TemplateManager.cleanupOrphanedTemplates has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 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/installer/template.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"869caeacec81e85d50f6bca33e31f2c496232ea9d1251e611c8b474337f9a083"}},{"ruleId":"D1","level":"warning","message":{"text":"ldap.NewClient (cyclomatic 18): ldap.NewClient 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/js/libs/ldap/ldap.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8b8f8a0071117d4a51c603512166f0544ba0c316ae5df24765855239bb91ad"}},{"ruleId":"D1","level":"warning","message":{"text":"smbsession.listTree (cyclomatic 18): smbsession.listTree has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 275). 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/js/libs/smbsession/session.go"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4759e628e60a7b409bafba6eb87749e6f1ae55c212e1b9cf534c35ce4122048f"}},{"ruleId":"D1","level":"warning","message":{"text":"Matcher.MatchRegex (cyclomatic 18): Matcher.MatchRegex 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/operators/matchers/match.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"761107f0d235a664bd41207cac4b14b77224df5d0981bea3f1e54fd117415cdf"}},{"ruleId":"D1","level":"warning","message":{"text":"uncover.GetUncoverTargetsFromMetadata (cyclomatic 18): uncover.GetUncoverTargetsFromMetadata has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 106). 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/protocols/common/uncover/uncover.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a0e6ffb8408e0c8f5516669fda55c372e4dbcbb2b8fe1dcdd020497b8f0177"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.New (cyclomatic 18): engine.New 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/protocols/headless/engine/engine.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c3dd55f4d9e9cc519f3402a4bb9ca3063ab8e81d4493e43d7465c89b7c78df"}},{"ruleId":"D1","level":"warning","message":{"text":"http.enrichEventWithTLSMetadata (cyclomatic 18): http.enrichEventWithTLSMetadata 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/protocols/http/tls_metadata.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e33e05a52c35e1db99215a244146e42379ab61800125d7f50fa5608e4a2748"}},{"ruleId":"D1","level":"warning","message":{"text":"Integration.CreateNewIssue (cyclomatic 18): Integration.CreateNewIssue 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/reporting/trackers/jira/jira.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3983c46fc501063fdcec3601644c75ae622b2f201dfa3b37186a87921755d63"}},{"ruleId":"D1","level":"warning","message":{"text":"Template.compileProtocolRequests (cyclomatic 18): Template.compileProtocolRequests 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/templates/compile.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8d7183d504eef34670ed6d32e426d729ffc024b6a901c49af893e6b7064cb0"}},{"ruleId":"D1","level":"warning","message":{"text":"Template.UnmarshalYAML (cyclomatic 18): Template.UnmarshalYAML 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/templates/templates.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4b5137150423a5756ad7196c9bcbb26f44cc4cb4a4df0bdb1ea8255851322c"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowExecutor.Compile (cyclomatic 18): FlowExecutor.Compile has cyclomatic complexity 18 (threshold 15). Of this number, 14 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/tmplexec/flow/flow_executor.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b996dc792995d04a5d802c3c1050f59ba22ce5cafb7ee70bb7d0c3f15f2ce7c"}},{"ruleId":"D1","level":"warning","message":{"text":"UploadWriter.autoCommit (cyclomatic 17): UploadWriter.autoCommit has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 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":"internal/pdcp/writer.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1173ef6fa4364134ce6c906e7ea6c011e6a86c9607c7f2d13eac393a288403dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.Close (cyclomatic 17): Runner.Close 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":"internal/runner/runner.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4671675ecdf2b259b92001852e74c5bae1cfa1e00dcaba562a9b36352077038"}},{"ruleId":"D1","level":"warning","message":{"text":"NucleiEngine.closeInternal (cyclomatic 17): NucleiEngine.closeInternal 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":"lib/sdk.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedb4a7f3b9ab22fd21cf81cbe3234d7562dc4b7fdfb6362c502a9b8609967ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Dynamic.applyValuesToSecret (cyclomatic 17): Dynamic.applyValuesToSecret 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/authprovider/authx/dynamic.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff57f0dedcda6ef607fdda145d1921a29a52ec43b790cee4c61dbc6995ea741"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiPartForm.Encode (cyclomatic 17): MultiPartForm.Encode has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 70). 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/fuzz/dataformat/multipart.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc07714f4b7b6639d91a3add49e8c0273914348497754d6f63024d95abd567d4"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.CreateTemplateData (cyclomatic 17): generator.CreateTemplateData 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/js/devtools/bindgen/generator.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b83e18ba798430723958e5d9411c60331c3fdae6b90278fa9016ecc5e6ca489"}},{"ruleId":"D1","level":"warning","message":{"text":"redis.RunLuaScript (cyclomatic 17): redis.RunLuaScript 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/js/libs/redis/redis.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb9107ae934ad80e60353b7067691ad7b2eb3f6e5423fb4f9ee794331fd6f19"}},{"ruleId":"D1","level":"warning","message":{"text":"fuzzExtractorCandidate.applyLines (cyclomatic 17): fuzzExtractorCandidate.applyLines has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/operators/extractors/fuzz_harness.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0146c82a750ecf289031e457635a8e40286c14ea6c33b9d176333302edaa79"}},{"ruleId":"D1","level":"warning","message":{"text":"code.registerPreConditionFunctions (cyclomatic 17): code.registerPreConditionFunctions 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/protocols/code/helpers.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4283e5dacf05fa9193766275aeb3f0f5dd2c9b46c33b80088386c8a940a1a78d"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.Compile (cyclomatic 17): Request.Compile 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/protocols/code/code.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f4cec924c8dd7cb6c13117ca53e4da15d3e245aefb18716e8a7cd22fc75ae5"}},{"ruleId":"D1","level":"warning","message":{"text":"templates.applyTemplateVerification (cyclomatic 17): templates.applyTemplateVerification 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/templates/compile.go"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccb5b3f30f4f9e09d40ceef8e30de459576e50a9ab26cfba855ec3e26bcb9e8"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowExecutor.requestExecutor (cyclomatic 17): FlowExecutor.requestExecutor 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/tmplexec/flow/flow_internal.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd902479e0f27dfdb95ab377f1ef906cb9de4feb898989229726e594c533a57"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiProtocol.ExecuteWithResults (cyclomatic 17): MultiProtocol.ExecuteWithResults has cyclomatic complexity 17 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/tmplexec/multiproto/multi.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1cd89ff1563af3c9b141ca89d0c5907e260fe409ba84fb9d093e6a564b9559"}},{"ruleId":"D1","level":"warning","message":{"text":"customTemplateGitLabRepo.Download (cyclomatic 16): customTemplateGitLabRepo.Download 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/external/customtemplates/gitlab.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99039227511b87974677356ba22ad19b4655726cfdef1b46771bb7b58a04e61"}},{"ruleId":"D1","level":"warning","message":{"text":"tsgen.recursiveScrapeType (cyclomatic 16): tsgen.recursiveScrapeType has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/devtools/tsgen/scrape.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c6ef6f9145eb9b45ca5a15cf49c53b4b2314152f2f99bbe4a8100c7b9ed1f2"}},{"ruleId":"D1","level":"warning","message":{"text":"main.main (cyclomatic 16): main.main 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 2 function literals inside it that branch (lines 60, 39). 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/js/devtools/tsgen/cmd/tsgen/main.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fe7a26b963867e2760bd221363050859fa70ca2f2404983b9c7dd285354c5c"}},{"ruleId":"D1","level":"warning","message":{"text":"Matcher.MatchWords (cyclomatic 16): Matcher.MatchWords 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/operators/matchers/match.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f808e0efcb7bbad67f3baa4d8932a87c6afc5db302f30253594d27218a7f5dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Matcher.Validate (cyclomatic 16): Matcher.Validate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/operators/matchers/validate.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea560c5e7afd983148ad88bfe7abfb4ef5b1ad99b5d9a0f8ab3a9eee0da01a2e"}},{"ruleId":"D1","level":"warning","message":{"text":"StatsTicker.makePrintCallback (cyclomatic 16): StatsTicker.makePrintCallback has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 146). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/progress/progress.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b10ada69702477f9f617de9142c51093342eb975e56f14808488a442326c08"}},{"ruleId":"D1","level":"warning","message":{"text":"Page.Screenshot (cyclomatic 16): Page.Screenshot has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/headless/engine/page_actions.go"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10cb1b6176d0efad72cfc04ed8488f8151283a7d4fbf5cd09f8b991940e0d8b"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeOnTarget (cyclomatic 16): Request.executeOnTarget has cyclomatic complexity 16 (threshold 15). Of this number, 14 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/protocols/network/request.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a281a84bf6d6a68f7d98c10ba971765ef097639f6d07f4eb19c32780c5495280"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.executeAddress (cyclomatic 16): Request.executeAddress has cyclomatic complexity 16 (threshold 15). Of this number, 14 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/protocols/network/request.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1890f104f96488d8a220910e5da01b3fd762edb2a2999082ce931ab4d45121"}},{"ruleId":"D1","level":"warning","message":{"text":"ReportingClient.CreateIssue (cyclomatic 16): ReportingClient.CreateIssue 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/reporting/reporting.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8bd77acd20a6f5a5d21644c24742ed432738385a844048080b4994af0c2939"}},{"ruleId":"D1","level":"warning","message":{"text":"templates.Cluster (cyclomatic 16): templates.Cluster 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/templates/cluster.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b16c03997ae891cec02a2c8b53973cc44534741199958b5cb6e695cd1a51aad"}},{"ruleId":"D1","level":"warning","message":{"text":"templates.parseTemplateNoVerify (cyclomatic 16): templates.parseTemplateNoVerify 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/templates/compile.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa95c80806ab4ae4c8ad72c04cea0fe67b4690729b960edeb8df73237a5d1ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.ParseTemplate (cyclomatic 16): Parser.ParseTemplate 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/templates/parser.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8c1fbda07b28dc27cbafacd327a76f212ab5a40065551d3483b4279103a544"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeRequest (cognitive 231): Request.executeRequest has cognitive complexity 231 (threshold 15). Drivers by points: if/else 202, boolean chains 25, loops 4 (nesting depth added 110). Of this number, 227 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/protocols/http/request.go"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"66190ff9728b3ac28ada56e8a02a60c1cf30243a2295a97d0778748e4df2d89d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 133): main.main has cognitive complexity 133 (threshold 15). Drivers by points: if/else 79, loops 41, match/switch 13 (nesting depth added 102). Of this number, 28 points are the body\u0027s own statements and 105 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/js/devtools/scrapefuncs/main.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeffec93e81e9d9093e670b0bdcb605566b867d0711f32f5f0f6e587a5c8e40b"}},{"ruleId":"D2","level":"warning","message":{"text":"openapi.generateRequestsFromOp (cognitive 127): openapi.generateRequestsFromOp has cognitive complexity 127 (threshold 15). Drivers by points: if/else 104, loops 13, boolean chains 5, match/switch 5 (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/input/formats/openapi/generator.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc83794d01111e2b281b4787f845371d4f6827e7a4392c7f79ce7ceb79ad0f4"}},{"ruleId":"D2","level":"warning","message":{"text":"decoder.decode (cognitive 114): decoder.decode has cognitive complexity 114 (threshold 15). Drivers by points: if/else 76, loops 27, match/switch 7, boolean chains 4 (nesting depth added 79). 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/reporting/trackers/linear/jsonutil/jsonutil.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9f60a02047e93210e65e6688901ec5efa5afe83d2605ce7705bbc8671b4d60"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.LoadTemplatesWithTags (cognitive 112): Store.LoadTemplatesWithTags has cognitive complexity 112 (threshold 15). Drivers by points: if/else 98, boolean chains 13, loops 1 (nesting depth added 61). Most of this is not in the body itself: 5 of the 112 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 862, 797, 827). 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/catalog/loader/loader.go"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b9c3dbaba0d7f12db9dd09fe641346d3d43ebe17f66650688b2c9d018bc5fb"}},{"ruleId":"D2","level":"warning","message":{"text":"main.readConfig (cognitive 110): main.readConfig has cognitive complexity 110 (threshold 15). Drivers by points: if/else 94, loops 13, boolean chains 3 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into 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/nuclei/main.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a88c995d79b1c3bfc0484d1462a11ec78e107b66b6d232b7148208e478bd89"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.New (cognitive 103): runner.New has cognitive complexity 103 (threshold 15). Drivers by points: if/else 90, boolean chains 13 (nesting depth added 29). Of this number, 96 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":"internal/runner/runner.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"779ababd9badc7006c871715f5f6ba73f06ea05bc5e63aea92826357e2608eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.runWorkflowStep (cognitive 98): Engine.runWorkflowStep has cognitive complexity 98 (threshold 15). Drivers by points: if/else 61, loops 29, match/switch 6, boolean chains 2 (nesting depth added 65). Of this number, 38 points are the body\u0027s own statements and 60 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/core/workflow_execute.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b9d345c12d73854b8f4ce9fb4eefa393ae60bdf7c6f2e3a2258b0b9295c364"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.Compile (cognitive 97): Request.Compile has cognitive complexity 97 (threshold 15). Drivers by points: if/else 68, loops 19, boolean chains 9, match/switch 1 (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/protocols/http/http.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dabb41c26f634b657d8734946ba1f8ceef86c36d61a8a77929df704b57264c0"}},{"ruleId":"D2","level":"warning","message":{"text":"openapi.openAPIExample (cognitive 95): openapi.openAPIExample has cognitive complexity 95 (threshold 15). Drivers by points: if/else 75, loops 13, boolean chains 6, match/switch 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/input/formats/openapi/examples.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dbe7071f089ed476f9014e022bb554e05be55c2a9c1abade0a83d87634f756"}},{"ruleId":"D2","level":"warning","message":{"text":"EntityParser.Parse (cognitive 87): EntityParser.Parse has cognitive complexity 87 (threshold 15). Drivers by points: if/else 69, loops 14, boolean chains 2, jumps 2 (nesting depth added 48). Of this number, 52 points are the body\u0027s own statements and 35 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/js/devtools/tsgen/parser.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"517df8673795bf1e3fa9fda0a09996b738bcd38ce23fb4c2f98a314c08b287b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.RunEnumeration (cognitive 73): Runner.RunEnumeration has cognitive complexity 73 (threshold 15). Drivers by points: if/else 64, boolean chains 7, loops 2 (nesting depth added 19). Of this number, 71 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":"internal/runner/runner.go"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b75e3e07d1878d706eec0ad8f27ed7eda3b01d8ba51d4f94aad62425f0a4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Form.Encode (cognitive 71): Form.Encode has cognitive complexity 71 (threshold 15). Drivers by points: if/else 58, loops 10, boolean chains 3 (nesting depth added 48). Of this number, 58 points are the body\u0027s own statements and 13 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/fuzz/dataformat/form.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c803846c928c40b8b37b7ce29f0ab912d8955b6e53892cf962044a9143f3c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.preflightResolveAndPortScan (cognitive 70): Runner.preflightResolveAndPortScan has cognitive complexity 70 (threshold 15). Drivers by points: if/else 47, loops 13, boolean chains 5, match/switch 5 (nesting depth added 30). Of this number, 27 points are the body\u0027s own statements and 43 belong to 6 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":"internal/runner/preflight_portscan.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e991ac2e70f0f9ea3557f9072f2ef6a2fc3b0d7de70a3babc7f4e0f38dad65"}},{"ruleId":"D2","level":"warning","message":{"text":"Operators.Execute (cognitive 65): Operators.Execute has cognitive complexity 65 (threshold 15). Drivers by points: if/else 49, loops 10, boolean chains 6 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/operators/operators.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"400e12d09f75bb242a129f7b52ca1fef1f9cc5397dbf33013ea0d126567abf5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeParallelHTTP (cognitive 63): Request.executeParallelHTTP has cognitive complexity 63 (threshold 15). Drivers by points: if/else 37, boolean chains 11, match/switch 8, loops 7 (nesting depth added 25). Of this number, 40 points are the body\u0027s own statements and 23 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/protocols/http/request.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea481c50df8fb6531dfc85f40d93d4917bff9f2f5047687dff57bf31eec0885d"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.Compile (cognitive 63): Request.Compile has cognitive complexity 63 (threshold 15). Drivers by points: if/else 53, boolean chains 5, loops 5 (nesting depth added 27). Of this number, 47 points are the body\u0027s own statements and 16 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/protocols/javascript/js.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee40ec2393e90df0377f6be9f3f4a2bbc53d0dafc7316f5162cba9766b4429da"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.readUntil (cognitive 63): Client.readUntil has cognitive complexity 63 (threshold 15). Drivers by points: if/else 50, loops 8, match/switch 3, boolean chains 2 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/utils/telnetmini/telnet.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ef033e7767d20a2e9444e6d220687f6dc8344c82503f1c749e9c8f7d631be4"}},{"ruleId":"D2","level":"warning","message":{"text":"NucleiEngine.init (cognitive 60): NucleiEngine.init has cognitive complexity 60 (threshold 15). Drivers by points: if/else 55, boolean chains 5 (nesting depth added 13). 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":"lib/sdk_private.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e7467d88afe77978038a2158903399e312f5273b15fedf420b88fb12150f9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Template.validateAllRequestIDs (cognitive 60): Template.validateAllRequestIDs has cognitive complexity 60 (threshold 15). Drivers by points: if/else 40, loops 20 (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/templates/templates.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0453d72a603609bbd7c2293824fbc9b1d9ead34225075fd19ff1dbb0a25ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.findMatchesWithReader (cognitive 59): Request.findMatchesWithReader has cognitive complexity 59 (threshold 15). Drivers by points: if/else 29, loops 28, boolean chains 2 (nesting depth added 37). Of this number, 55 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/protocols/file/request.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f18478a7f33e1299a9ba316c247644ca64c55508e73655b6801f74a09b985a"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeWithResults (cognitive 59): Request.executeWithResults has cognitive complexity 59 (threshold 15). Drivers by points: if/else 43, boolean chains 8, loops 5, match/switch 3 (nesting depth added 25). Of this number, 55 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/protocols/javascript/js.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"43eae9959bd220f44f6eca3193bc9c3e08b0b9d6cf42320795de88d56e354247"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.ExecuteWithResults (cognitive 58): Request.ExecuteWithResults has cognitive complexity 58 (threshold 15). Drivers by points: if/else 55, match/switch 3 (nesting depth added 34). Most of this is not in the body itself: 3 of the 58 points are its own statements and the rest belongs to one function literal inside it that branches (line 60). 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/protocols/file/request.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec276b9eacc12427618c40a1246a9995e4a6f3b2a8d28327569909e88eeacbd"}},{"ruleId":"D2","level":"warning","message":{"text":"Template.ImportFileRefs (cognitive 58): Template.ImportFileRefs has cognitive complexity 58 (threshold 15). Drivers by points: if/else 46, boolean chains 6, loops 6 (nesting depth added 30). Of this number, 53 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/templates/templates.go"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"157f80d9c774126e3171d094793530903968d9096fb70b3dc11a95c1f27ebbbd"}},{"ruleId":"D2","level":"warning","message":{"text":"FileAuthProvider.init (cognitive 56): FileAuthProvider.init has cognitive complexity 56 (threshold 15). Drivers by points: if/else 44, loops 12 (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/authprovider/file.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c60bcbd4a65901c4d9469fbdcdca61d649d8f98934b5c3c0eeb19fe7d24eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.ExecuteWithResults (cognitive 55): Request.ExecuteWithResults has cognitive complexity 55 (threshold 15). Drivers by points: if/else 40, boolean chains 12, match/switch 2, loops 1 (nesting depth added 19). Of this number, 21 points are the body\u0027s own statements and 34 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/protocols/http/request.go"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fca08108771ec030c469d870e1875d2aa8dceec1c15be8d08135e2fdc984e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 54): main.main has cognitive complexity 54 (threshold 15). Drivers by points: if/else 49, loops 4, boolean chains 1 (nesting depth added 20). Of this number, 27 points are the body\u0027s own statements and 27 belong to 6 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":"cmd/nuclei/main.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b0a72574eefc00752703b0986d477800adaf3af43a95b9ddb97e7150d1b468"}},{"ruleId":"D2","level":"warning","message":{"text":"main.process (cognitive 54): main.process has cognitive complexity 54 (threshold 15). Drivers by points: if/else 53, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/tmc/main.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ee3fb0d146a717789cb0e751b582da765f0d8942368e42535bc568c6d7c431"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.LoadTemplatesOnlyMetadata (cognitive 53): Store.LoadTemplatesOnlyMetadata has cognitive complexity 53 (threshold 15). Drivers by points: if/else 50, loops 2, boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/catalog/loader/loader.go"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c7f6b74069b0e668a608f7288080140f0ec121dae35e1b16d5a5ee76f6c6cf"}},{"ruleId":"D2","level":"warning","message":{"text":"httpclientpool.wrappedGet (cognitive 52): httpclientpool.wrappedGet has cognitive complexity 52 (threshold 15). Drivers by points: if/else 44, boolean chains 6, match/switch 2 (nesting depth added 13). Of this number, 23 points are the body\u0027s own statements and 29 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/protocols/http/httpclientpool/clientpool.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"71222242024abbdd8b05ef14eb6420c1ad97da2a250d8ead9de08018a3d387c2"}},{"ruleId":"D2","level":"warning","message":{"text":"templates.NewTagFilter (cognitive 51): templates.NewTagFilter has cognitive complexity 51 (threshold 15). Drivers by points: if/else 28, loops 23 (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/templates/tag_filter.go"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"25982c86e81133108f9a21ce1bde0405ae013c27175168927c9d1d6685484a49"}},{"ruleId":"D2","level":"warning","message":{"text":"xss.AnalyzeReflectionContext (cognitive 50): xss.AnalyzeReflectionContext has cognitive complexity 50 (threshold 15). Drivers by points: if/else 39, boolean chains 5, match/switch 5, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/fuzz/analyzers/xss/analyzer.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c08804bb85154fad6cf691ceda003f96bfe49b689060d5c91976bf5313d819c"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeRequestWithPayloads (cognitive 49): Request.executeRequestWithPayloads has cognitive complexity 49 (threshold 15). Drivers by points: if/else 45, boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/network/request.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9d9c1ad821c0945cb216591f5fc76b406891a8de17ee3b2a185e99c3130ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.ExecuteWithResults (cognitive 47): Request.ExecuteWithResults has cognitive complexity 47 (threshold 15). Drivers by points: if/else 37, boolean chains 8, loops 2 (nesting depth added 11). Of this number, 45 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/protocols/code/code.go"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5108f55a92b74d0928162a77caa7adb9a7241339945651e41760e8db0d882d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.Compile (cognitive 47): Request.Compile has cognitive complexity 47 (threshold 15). Drivers by points: if/else 37, loops 7, boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/network/network.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e615e9d2a29bac7ce1e6b1e0516d01a6f249332e91098491386fb8091352f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"ListInputProvider.Set (cognitive 46): ListInputProvider.Set has cognitive complexity 46 (threshold 15). Drivers by points: if/else 38, loops 5, boolean chains 3 (nesting depth added 21). Of this number, 44 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/input/provider/list/hmap.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a00cfc7248d9007fa027f9ec001fdaaf8ffa828f643288d0915820ad80ea0b"}},{"ruleId":"D2","level":"warning","message":{"text":"ListInputProvider.Del (cognitive 46): ListInputProvider.Del has cognitive complexity 46 (threshold 15). Drivers by points: if/else 38, loops 5, boolean chains 3 (nesting depth added 21). Of this number, 44 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/input/provider/list/hmap.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b35b30fd0404f736deca1b64e5d11da0dec02e229aa80bcd9902b9989277971"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeRequestParallel (cognitive 46): Request.executeRequestParallel has cognitive complexity 46 (threshold 15). Drivers by points: if/else 35, boolean chains 4, match/switch 3, jumps 2, loops 2 (nesting depth added 23). Of this number, 25 points are the body\u0027s own statements and 21 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/protocols/javascript/js.go"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e4111cc527833b62a568ef319ebe85cd08f393c192d05b1d2cdf845fd297d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Secret.Validate (cognitive 45): Secret.Validate has cognitive complexity 45 (threshold 15). Drivers by points: if/else 34, loops 8, boolean chains 2, match/switch 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/authprovider/authx/file.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"277a502b82d77edd4a553cac3532a70850aaf551d3566ebc4bcf346559dfa264"}},{"ruleId":"D2","level":"warning","message":{"text":"reporting.New (cognitive 45): reporting.New has cognitive complexity 45 (threshold 15). Drivers by points: if/else 43, 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/reporting/reporting.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e987f8a13e1bf785bfe05e48613d2c7c441b2e4c0eacdf1cee83b788b2a4124b"}},{"ruleId":"D2","level":"warning","message":{"text":"raw.Parse (cognitive 44): raw.Parse has cognitive complexity 44 (threshold 15). Drivers by points: if/else 38, boolean chains 5, match/switch 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":"pkg/protocols/http/raw/raw.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4327761b57a9cd4ec623ccdd3555a5a63fe96c6ab63d44a0b5d82c43fd63eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"requestGenerator.generateRawRequest (cognitive 43): requestGenerator.generateRawRequest has cognitive complexity 43 (threshold 15). Drivers by points: if/else 37, boolean chains 5, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/http/build_request.go"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dba3e952c4f9e2ae0132f82daca7f3277f5db3fe94b4462739b2807ede66b9"}},{"ruleId":"D2","level":"warning","message":{"text":"UploadWriter.autoCommit (cognitive 42): UploadWriter.autoCommit has cognitive complexity 42 (threshold 15). Drivers by points: if/else 38, loops 2, match/switch 2 (nesting depth added 26). Of this number, 37 points are the body\u0027s own statements and 5 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":"internal/pdcp/writer.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"795b22af1323b534d080db83eb4d17451d88048715087ddb5f2745718044d2bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.LoadTemplateTags (cognitive 42): Store.LoadTemplateTags has cognitive complexity 42 (threshold 15). Drivers by points: if/else 32, loops 8, boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/catalog/loader/loader.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db22248e98e3a26af6a9ea6686bd5b75cf42531a977b9af30668ccca628ab7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Helper.convertInputToType (cognitive 42): Helper.convertInputToType has cognitive complexity 42 (threshold 15). Drivers by points: if/else 33, boolean chains 8, 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/input/transform.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c7e8e94454585d6b3fd1e28c2b27c3f2663d3ed18d6b726e596471f295810c"}},{"ruleId":"D2","level":"warning","message":{"text":"NucleiEngine.applyRequiredDefaults (cognitive 41): NucleiEngine.applyRequiredDefaults has cognitive complexity 41 (threshold 15). Drivers by points: if/else 37, boolean chains 2, loops 2 (nesting depth added 14). Of this number, 33 points are the body\u0027s own statements and 8 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":"lib/sdk_private.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b962adf3b5bbf28231b9aa5f0aabaadde46a63dc9a9a3a19245f786e72dce2"}},{"ruleId":"D2","level":"warning","message":{"text":"Rule.Compile (cognitive 41): Rule.Compile has cognitive complexity 41 (threshold 15). Drivers by points: if/else 37, loops 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/fuzz/execute.go"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e6078a396291a474fe0152287b6205f642c8949f64287aa1f62c2d4dbf0c65"}},{"ruleId":"D2","level":"warning","message":{"text":"format.CreateReportDescription (cognitive 41): format.CreateReportDescription has cognitive complexity 41 (threshold 15). Drivers by points: if/else 29, loops 10, 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/reporting/format/format_utils.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"44269df37a5eb116fa4042f0764ae840a61ccf08eaa133b7d4414a13e079be23"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiProtocol.ExecuteWithResults (cognitive 41): MultiProtocol.ExecuteWithResults has cognitive complexity 41 (threshold 15). Drivers by points: if/else 26, loops 9, boolean chains 3, match/switch 3 (nesting depth added 23). Of this number, 16 points are the body\u0027s own statements and 25 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/tmplexec/multiproto/multi.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e23661a809fa951d308d897d52e3e568aec8d8300a30c1bd075330adf68129"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.ValidateOptions (cognitive 40): runner.ValidateOptions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 26, boolean chains 9, loops 3, match/switch 2 (nesting depth added 8). 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":"internal/runner/options.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dea30162d55d9a1b654eaf32a93d430373c11b845ff62046f34d8d3a4044596"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.getTagsUsingDetectionTemplates (cognitive 40): Service.getTagsUsingDetectionTemplates has cognitive complexity 40 (threshold 15). Drivers by points: if/else 26, loops 13, boolean chains 1 (nesting depth added 28). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to one function literal inside it that branches (line 260). 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/protocols/common/automaticscan/automaticscan.go"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0aa86e349f9900f51b8a9303118df811531ea7b49b5d67d6de1b653558df854"}},{"ruleId":"D2","level":"warning","message":{"text":"uncover.GetUncoverTargetsFromMetadata (cognitive 40): uncover.GetUncoverTargetsFromMetadata has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18, loops 11, match/switch 6, jumps 3, boolean chains 2 (nesting depth added 21). Of this number, 18 points are the body\u0027s own statements and 22 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/protocols/common/uncover/uncover.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b75a86a8789bbdc8c16d184a4e3b62152366ca3ea18eb6d804c21f639a4ba02"}},{"ruleId":"D2","level":"warning","message":{"text":"Instance.Run (cognitive 40): Instance.Run has cognitive complexity 40 (threshold 15). Drivers by points: if/else 29, loops 9, boolean chains 2 (nesting depth added 13). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/headless/engine/page.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a46ad21162403b63b356a77e9ea790adf54e997a7316f220fa1b6483aee17af"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.ExecuteWithResults (cognitive 40): Request.ExecuteWithResults has cognitive complexity 40 (threshold 15). Drivers by points: if/else 31, boolean chains 7, 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/protocols/ssl/ssl.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ca466e0766951ccf89e246892f028eb0b3e70246566cafcc3cf64be958ecd4"}},{"ruleId":"D2","level":"warning","message":{"text":"Rule.Execute (cognitive 39): Rule.Execute has cognitive complexity 39 (threshold 15). Drivers by points: if/else 30, loops 6, boolean chains 2, jumps 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/fuzz/execute.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef92712beff7b1fa0807099a34558883a0e23bea10fa8f96a7cb7d5887efe5e2"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowExecutor.requestExecutor (cognitive 39): FlowExecutor.requestExecutor has cognitive complexity 39 (threshold 15). Drivers by points: if/else 34, loops 3, 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/tmplexec/flow/flow_internal.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"441a61cefe292fed2877724beb4018ae8b7d841111a25ee512ac65b2b16fbc9e"}},{"ruleId":"D2","level":"warning","message":{"text":"customTemplateGitLabRepo.Download (cognitive 38): customTemplateGitLabRepo.Download has cognitive complexity 38 (threshold 15). Drivers by points: if/else 34, loops 3, boolean chains 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/external/customtemplates/gitlab.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f69ce7ef5e597373c4450a55f30904874bcecb005df48d416bffc924820d395"}},{"ruleId":"D2","level":"warning","message":{"text":"openapi.GenerateRequestsFromSchema (cognitive 38): openapi.GenerateRequestsFromSchema has cognitive complexity 38 (threshold 15). Drivers by points: if/else 27, loops 10, boolean chains 1 (nesting depth added 18). Of this number, 37 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/input/formats/openapi/generator.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb088301855bb200f2c0feb2297da5832defef086856b5163c8fb68664c4165"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardWriter.formatScreen (cognitive 37): StandardWriter.formatScreen has cognitive complexity 37 (threshold 15). Drivers by points: if/else 31, loops 6 (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/output/format_screen.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9640ce9deb7ada2ba24f69ba0e96a4641b069b271e7bf187daa43ee7b2a682"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeAddress (cognitive 37): Request.executeAddress has cognitive complexity 37 (threshold 15). Drivers by points: if/else 31, match/switch 3, loops 2, boolean chains 1 (nesting depth added 21). Of this number, 31 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/protocols/network/request.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"067c9ea043645978f9b9382672f12a5a43a04e1e8463a94051fb0b17fd93f61d"}},{"ruleId":"D2","level":"warning","message":{"text":"telnetmini.DetectEncryption (cognitive 37): telnetmini.DetectEncryption has cognitive complexity 37 (threshold 15). Drivers by points: if/else 25, loops 11, boolean chains 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/utils/telnetmini/telnet.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"08598ee9636d22110b0e32dc76918d6478dd5551cd372974a6f748099326a04d"}},{"ruleId":"D2","level":"warning","message":{"text":"Matcher.CompileMatchers (cognitive 36): Matcher.CompileMatchers has cognitive complexity 36 (threshold 15). Drivers by points: if/else 25, loops 7, boolean chains 4 (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/operators/matchers/compile.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57d0863e5851bcaa4b78f9a587f6b131989dbcc3924535dbf80a3626862bfb0"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowExecutor.Compile (cognitive 36): FlowExecutor.Compile has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22, loops 10, match/switch 3, boolean chains 1 (nesting depth added 18). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/tmplexec/flow/flow_executor.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca8ad1762af0eb59772015d6e67b5c9ae4d5d49a2bfe549a9303057b5a8453f"}},{"ruleId":"D2","level":"warning","message":{"text":"ldap.NewClient (cognitive 35): ldap.NewClient has cognitive complexity 35 (threshold 15). Drivers by points: if/else 28, match/switch 5, 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/js/libs/ldap/ldap.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20ee81af93688cd0d0e6cd8cebf5a06437fc4b0c425a66102a06a314823d55b"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.New (cognitive 35): engine.New has cognitive complexity 35 (threshold 15). Drivers by points: if/else 30, loops 3, boolean chains 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":"pkg/protocols/headless/engine/engine.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e586dfc17251c8b0bb4cc726ae23599b0bce1c6460721ace27fd2c01608672c5"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateManager.writeTemplatesToDisk (cognitive 34): TemplateManager.writeTemplatesToDisk has cognitive complexity 34 (threshold 15). Drivers by points: if/else 34 (nesting depth added 12). Of this number, 16 points are the body\u0027s own statements and 18 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/installer/template.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81f6b59b78824bdedbfd9cb3abd855fbc5997a18765aecdd6c252db54f55cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"protocolstate.initDialers (cognitive 34): protocolstate.initDialers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 29, match/switch 3, boolean chains 1, loops 1 (nesting depth added 9). Of this number, 31 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/protocols/common/protocolstate/state.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea0b64108422ef1638326d797a71e04dac577148bf0d81d7a76a1d9190e037b"}},{"ruleId":"D2","level":"warning","message":{"text":"Page.ExecuteActions (cognitive 34): Page.ExecuteActions has cognitive complexity 34 (threshold 15). Drivers by points: if/else 27, loops 5, match/switch 2 (nesting depth added 21). Of this number, 32 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/protocols/headless/engine/page_actions.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"19eafdf2074903fec61f47705dfe24a36ebb8e9f6e4823b2d2ede462897ee492"}},{"ruleId":"D2","level":"warning","message":{"text":"templates.Parse (cognitive 34): templates.Parse has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21, loops 13 (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/templates/compile.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2e91c2d113228653735d743b7a2d605d168982fbe51aa965dd2d002a9ca5dd"}},{"ruleId":"D2","level":"warning","message":{"text":"templates.parseWorkflowTemplate (cognitive 34): templates.parseWorkflowTemplate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 26, loops 5, boolean chains 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/templates/workflows.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cfcd1a1910a78d99c25899da92f4aa577b17e9bef42076b38ce72dc4e8404a"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.displayExecutionInfo (cognitive 33): Runner.displayExecutionInfo has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24, boolean chains 5, loops 4 (nesting depth added 11). Of this number, 32 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":"internal/runner/runner.go"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86876dca8836a854b4789e9fa4c1fd83c91c51c3a61cb375051b9476d27c196"}},{"ruleId":"D2","level":"warning","message":{"text":"Rule.executeRuleValues (cognitive 33): Rule.executeRuleValues has cognitive complexity 33 (threshold 15). Drivers by points: if/else 31, loops 2 (nesting depth added 20). Of this number, 22 points are the body\u0027s own statements and 11 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/fuzz/execute.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b44fc47452627a8be783d5d79df33b15278c95733104fdf33902b86dd153c2"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardWriter.Write (cognitive 33): StandardWriter.Write has cognitive complexity 33 (threshold 15). Drivers by points: if/else 28, boolean chains 5 (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/output/output.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a66628244642c28e2c821b69d524bc3e338d33af7935a7e98dd2f1058158e8"}},{"ruleId":"D2","level":"warning","message":{"text":"raw.readRawRequest (cognitive 33): raw.readRawRequest has cognitive complexity 33 (threshold 15). Drivers by points: if/else 26, boolean chains 5, jumps 1, 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/protocols/http/raw/raw.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f332b4472112c45a70ed75b23fda7f25dd06ca92780fa1940154cf18ae55bfd"}},{"ruleId":"D2","level":"warning","message":{"text":"templates.Cluster (cognitive 33): templates.Cluster has cognitive complexity 33 (threshold 15). Drivers by points: if/else 26, loops 4, match/switch 2, boolean chains 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/templates/cluster.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"de99485144b426a6c21065a080201cb217b73ffce12b2851632e28cceff3dcad"}},{"ruleId":"D2","level":"warning","message":{"text":"Matcher.MatchRegex (cognitive 32): Matcher.MatchRegex has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19, match/switch 8, boolean chains 4, 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/operators/matchers/match.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc79fe94bb2512bf7e3364f7dfd203460ff9d012958bec4209072ec191f32dc"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateExecuter.Execute (cognitive 32): TemplateExecuter.Execute has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23, boolean chains 7, loops 2 (nesting depth added 8). Most of this is not in the body itself: 10 of the 32 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 150, 141). 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/tmplexec/exec.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20acf0168ae6c1ea41afe97e236d0e65b89d35dfbe22fc57a60a9e6e7003ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"loader.New (cognitive 31): loader.New has cognitive complexity 31 (threshold 15). Drivers by points: if/else 24, boolean chains 5, loops 2 (nesting depth added 5). Of this number, 24 points are the body\u0027s own statements and 7 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/catalog/loader/loader.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"507670dbde416641a2175d2509e4c6f7b5024f33359036980150e1ded7119693"}},{"ruleId":"D2","level":"warning","message":{"text":"SwaggerDownloader.Download (cognitive 31): SwaggerDownloader.Download has cognitive complexity 31 (threshold 15). Drivers by points: if/else 29, 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/input/formats/swagger/downloader.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d491ede0a1014ba93324e139d1179f94b3df0c58d9b902ed951ea7838842da"}},{"ruleId":"D2","level":"warning","message":{"text":"telnetmini.parseTargetInfo (cognitive 31): telnetmini.parseTargetInfo has cognitive complexity 31 (threshold 15). Drivers by points: if/else 28, match/switch 2, 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":"pkg/utils/telnetmini/ntlm.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8741fc4c16bee4c2a24b6036be678ed869535c017d6905357bea5c3dc5cb3f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.NewInputProvider (cognitive 30): provider.NewInputProvider has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21, boolean chains 4, match/switch 3, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/input/provider/interface.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f877d5d48f16150123e2335217aab9a22dc57ae9953469a7f700e7189e4f3ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.processInteractionForRequest (cognitive 30): Client.processInteractionForRequest has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22, boolean chains 7, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/common/interactsh/interactsh.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb14aa852220db263b7a8d1945f7b82182dedeb92c5877b4bc3087094633a27"}},{"ruleId":"D2","level":"warning","message":{"text":"Template.compileProtocolRequests (cognitive 30): Template.compileProtocolRequests has cognitive complexity 30 (threshold 15). Drivers by points: if/else 28, 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/templates/compile.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"479af315fd6541cac66529c65513fb46ca740dffaec7b19132ad660c8f61be01"}},{"ruleId":"D2","level":"warning","message":{"text":"ListInputProvider.initializeInputSources (cognitive 29): ListInputProvider.initializeInputSources has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13, loops 9, match/switch 5, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/input/provider/list/hmap.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c27b73550e70a5e2bd5d48b8d3339533fd252f2e3c910b9b09a27acc6a4189"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.GetServiceTicket (cognitive 29): Client.GetServiceTicket has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19, loops 10 (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/js/libs/kerberos/kerberosx.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4180894b5b6d7e24627cd0b2141aec4797f019103d0d941e034e7e2db3d5d5"}},{"ruleId":"D2","level":"warning","message":{"text":"mssql.parsePreloginResponse (cognitive 29): mssql.parsePreloginResponse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, boolean chains 4, loops 2, match/switch 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/js/libs/mssql/fingerprint.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e755713f3be87e3b9901348b8f8dc05cc3dfc8f94a80192cc41f392ba1cb8a31"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.Compile (cognitive 29): Request.Compile has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23, loops 3, boolean chains 2, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/headless/headless.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"727d209f4941e66d9834e7d344006108f97d5f9cdc95db41179948d002432bad"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.ExecuteWithResults (cognitive 29): Request.ExecuteWithResults has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24, boolean chains 3, loops 2 (nesting depth added 11). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/headless/request.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d967ad0922a3383f9298407a2701d4440c37c4b5b468021f1a1f54d073fd08"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.generateEventData (cognitive 29): Request.generateEventData has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, loops 7, 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/protocols/javascript/js.go"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fae35115328dba06842c3588160d15fcbef3fe39fb9ff76581894dd5cf9fff"}},{"ruleId":"D2","level":"warning","message":{"text":"templates.tryCollectConditionsMatchinfo (cognitive 29): templates.tryCollectConditionsMatchinfo has cognitive complexity 29 (threshold 15). Drivers by points: loops 22, if/else 6, boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/templates/tag_filter.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9212d9a98b605ca887ad270b5202639343c3100378632fe0cb24223fdf3c14"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.preflightOneResolved (cognitive 28): Runner.preflightOneResolved has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 12, if/else 9, loops 5, boolean chains 2 (nesting depth added 11). Most of this is not in the body itself: 10 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 381, 428). 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":"internal/runner/preflight_portscan.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ae478efb78d1462c86e71bd5f975c2a89c02b973836c0d23fd672664394657"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiPartForm.Encode (cognitive 28): MultiPartForm.Encode has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21, loops 6, match/switch 1 (nesting depth added 14). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 70). 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/fuzz/dataformat/multipart.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb680c8a79bb2dde74a81e9e8246543998f9c8abede33fda62f6975bc5bc6df"}},{"ruleId":"D2","level":"warning","message":{"text":"global.initBuiltInFunc (cognitive 28): global.initBuiltInFunc has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18, loops 6, boolean chains 3, match/switch 1 (nesting depth added 5). Most of this is not in the body itself: 0 of the 28 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 182, 120, 151, \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/js/global/scripts.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"522bb9b260d264f830232b18d07d4be6f9dc30bbab047535a07159a740084923"}},{"ruleId":"D2","level":"warning","message":{"text":"operators.MakeDynamicValuesCallback (cognitive 28): operators.MakeDynamicValuesCallback has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22, loops 6 (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/operators/operators.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35620482614891057ab6626410561ecf24e2c48dc1eaff81e7fc968f7081e34"}},{"ruleId":"D2","level":"warning","message":{"text":"PayloadGenerator.validate (cognitive 28): PayloadGenerator.validate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22, 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/protocols/common/generators/validate.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a8156ab535045e3691929cb121a8732ee77a014a2b42b8060e81466cd8ff8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.ExecuteWithResults (cognitive 28): Request.ExecuteWithResults has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22, match/switch 3, loops 2, boolean chains 1 (nesting depth added 14). 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":"pkg/protocols/dns/request.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c59bce0ff61a0a0cc96c5716b418b31ad6659c0cdde558129d6f1316bd4f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeRaceRequest (cognitive 28): Request.executeRaceRequest has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19, boolean chains 5, loops 2, match/switch 2 (nesting depth added 7). Of this number, 21 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/protocols/http/request.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d30f42b70b7e6cc15273f9bb9c956bc37eccdcb12142c9d47f46685bb33cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeTurboHTTP (cognitive 28): Request.executeTurboHTTP has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19, boolean chains 4, match/switch 4, loops 1 (nesting depth added 8). Of this number, 21 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/protocols/http/request.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57ebff25a5b41487314227eb6f0319783b85936586b7ba8133ab06014d7cefe"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.parseAnnotations (cognitive 28): Request.parseAnnotations has cognitive complexity 28 (threshold 15). Drivers by points: if/else 24, match/switch 4 (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/protocols/http/request_annotations.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5b68abc10f1e124a02adc32df2bbcb6b5b47f2156a4099e47d0b564613376a"}},{"ruleId":"D2","level":"warning","message":{"text":"PerHostRateLimitPool.GetOrCreate (cognitive 28): PerHostRateLimitPool.GetOrCreate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 26, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/http/httpclientpool/perhost_ratelimit_pool.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d162325e706b56757bbd3844832e50d4ca11f322f133abb4db03d318818c4ef8"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportingClient.CreateIssue (cognitive 28): ReportingClient.CreateIssue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21, loops 4, boolean chains 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/reporting/reporting.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c338cb7eb24105fbb212aeda9abebebf9ebd366c23c64b8b0d723f308f7aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"Integration.CreateNewIssue (cognitive 28): Integration.CreateNewIssue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18, loops 4, match/switch 4, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/reporting/trackers/jira/jira.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f329222ba2fcfad15d83d044a81b582546e42f70f011c3efbdc68dd499dda1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.ParseTemplate (cognitive 28): Parser.ParseTemplate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 26, boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/templates/parser.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd448c69dfd5a4c019243ac62cb068c8b6c97c41424674a01258b28916025316"}},{"ruleId":"D2","level":"warning","message":{"text":"config.GetNucleiTemplatesIndex (cognitive 27): config.GetNucleiTemplatesIndex has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, loops 4, boolean chains 2 (nesting depth added 15). Of this number, 22 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/catalog/config/template.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6b0ec7734c90a8bd2a8c9a3a2d266a5e4ca0e81a52ce8f76c4b0f3f054dfe6"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.areWorkflowOrTemplatesValid (cognitive 27): Store.areWorkflowOrTemplatesValid has cognitive complexity 27 (threshold 15). Drivers by points: if/else 25, 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/catalog/loader/loader.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6b6d9f4b2a2b99b5657338dee9fbe6d4a5e97571501cd6b0b77adb972479f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.executeTemplateWithTargets (cognitive 27): Engine.executeTemplateWithTargets has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18, match/switch 4, loops 3, boolean chains 2 (nesting depth added 8). Most of this is not in the body itself: 6 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 121, 97). 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/core/executors.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48771409a3da50f50b08bd4dfa5bba78b481b6be8e115105eca93c887e4376b"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.UnmarshalSQLRows (cognitive 27): utils.UnmarshalSQLRows has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, loops 5, match/switch 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/js/utils/util.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d335ed549aff7c0000441eb69f4a8881f80a42d6e8d8b5a54a2c665c8b12e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Matcher.MatchDSL (cognitive 27): Matcher.MatchDSL has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, match/switch 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/operators/matchers/match.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"93302d8b181cdc5e85f8ae9169d27a40afeca2cb58dbdd7886b2ad0957d3239d"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.Compile (cognitive 27): Request.Compile has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, boolean chains 4, loops 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/code/code.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d96d1620b3bd45f632b2cf8e4b818a8e2a25611156e0872f4e946d925b257d"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeRequestWithPayloads (cognitive 27): Request.executeRequestWithPayloads has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20, boolean chains 5, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/headless/request.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b4580b11477aab1a433a1b51e90db9cea2d885065e6743df63258b7519f381"}},{"ruleId":"D2","level":"warning","message":{"text":"requestGenerator.makeSelfContainedRequest (cognitive 27): requestGenerator.makeSelfContainedRequest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, boolean chains 2, jumps 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/protocols/http/build_request.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e51a1ab5d7435b56140a68f8bd0da758ce3544d8afdc591749c57673af548c7"}},{"ruleId":"D2","level":"warning","message":{"text":"requestGenerator.fillRequest (cognitive 27): requestGenerator.fillRequest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, boolean chains 4, match/switch 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":"pkg/protocols/http/build_request.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a65e63a19de222b1617e914b0b4452cb77d77846ae82870bc29f5782c15153"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeRequestWithPayloads (cognitive 27): Request.executeRequestWithPayloads has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, boolean chains 6 (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/protocols/javascript/js.go"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d76190754ce2335843c305c39af7e43e884fac51ab66ee44372d3b448764de"}},{"ruleId":"D2","level":"warning","message":{"text":"ClusterExecuter.Execute (cognitive 27): ClusterExecuter.Execute has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, boolean chains 5, loops 3 (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 12 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/templates/cluster.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"96560903ba7dfc2c1f8c5b7be33edb1e5c89333d9343494a09c1f19e857333e9"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.GetLazyAuthFetchCallback (cognitive 26): runner.GetLazyAuthFetchCallback has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, loops 5, boolean chains 3 (nesting depth added 6). Most of this is not in the body itself: 0 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 69). 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":"internal/runner/lazy.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"43550775ae7d0472121c7c1b142ce0b4892adc91dd5f9f00c2c860524fa67882"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamic.applyValuesToSecret (cognitive 26): Dynamic.applyValuesToSecret has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22, loops 4 (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/authprovider/authx/dynamic.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"24525e5fe294ba0cc7f2ce3ab547a19e1bcae6600b402bad36f86d9d403114d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor.CompileExtractors (cognitive 26): Extractor.CompileExtractors has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17, loops 6, 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/operators/extractors/compile.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f762ad874edc0f3d06d354b5f36a8daf02f5324c63e1afdabe0610ccc3250b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Matcher.MatchWords (cognitive 26): Matcher.MatchWords has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, boolean chains 3, match/switch 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/operators/matchers/match.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8249f75a6075ad05c3438ad61fe58307d392f9876c74ff3168a5d606d4914be1"}},{"ruleId":"D2","level":"warning","message":{"text":"PayloadGenerator.loadPayloads (cognitive 26): PayloadGenerator.loadPayloads has cognitive complexity 26 (threshold 15). Drivers by points: if/else 23, match/switch 2, 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/protocols/common/generators/load.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13f232b47edda9cb53e648f0801b68e88824b31d36eee198d88ef0ec942c853"}},{"ruleId":"D2","level":"warning","message":{"text":"telnetmini.processTelnetOptions (cognitive 26): telnetmini.processTelnetOptions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17, loops 5, boolean chains 4 (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/utils/telnetmini/telnet.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"095a5be268556748273bd0912af9f45fe0f4e0f55d4a4028a48a75ccb781b852"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.do (cognitive 25): Client.do has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, boolean chains 3, loops 3 (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 5 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/js/libs/http/http.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0676b39def5439e2b6a367a7666ba97efed20d1bb17d4d0f4868420ab5b18670"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.ParseOptions (cognitive 24): runner.ParseOptions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, boolean chains 5, loops 2 (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runner/options.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b1869197db9906ff22d8c87caede2b09f1dc6b8ba42cc08c308780213154ce"}},{"ruleId":"D2","level":"warning","message":{"text":"redis.RunLuaScript (cognitive 24): redis.RunLuaScript has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, loops 9, match/switch 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/js/libs/redis/redis.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6701536824867323dffcf8c64a4e56edfafe45c4eb43b662b7bb8cafface8be7"}},{"ruleId":"D2","level":"warning","message":{"text":"generators.MergeMapsMany (cognitive 24): generators.MergeMapsMany has cognitive complexity 24 (threshold 15). Drivers by points: loops 12, match/switch 7, if/else 5 (nesting depth added 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/common/generators/maps.go"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cfa1ffe7d251e11388e440686bee051991084bd5543e08c12b66908a0e2a28"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeFuzzingRule (cognitive 24): Request.executeFuzzingRule has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, 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/protocols/http/request_fuzz.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2241404cdf99ea356991eab005f3e2bf76d648ce15d5375037ef87901e29131"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskCatalog.GetTemplatesPath (cognitive 23): DiskCatalog.GetTemplatesPath has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 5, 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/catalog/disk/find.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2199e118022932abc34fdc4f7840430e8a083408b0256cfdcaca3046ddd816aa"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAPIDownloader.Download (cognitive 23): OpenAPIDownloader.Download has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, boolean chains 3 (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/input/formats/openapi/downloader.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"851b7275de6d3f52eac7b24819a4ceb358c5851e04e5fbce022ec7d6aac6a9d2"}},{"ruleId":"D2","level":"warning","message":{"text":"types.ParseRawRequest (cognitive 23): types.ParseRawRequest has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, boolean chains 5, 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":"pkg/input/types/http.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1198d11deff6f1d3d65d987fe7e272e1a29945454292b7c154fc1996809b406d"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateManager.cleanupOrphanedTemplates (cognitive 23): TemplateManager.cleanupOrphanedTemplates has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, loops 3 (nesting depth added 5). Of this number, 17 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/installer/template.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd337ef6885db0228d4160bc666cd419179039912e5e9f8bce6f08d3cd0982c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 23): main.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 5, boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 60, 39). 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/js/devtools/tsgen/cmd/tsgen/main.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b234763576dd716f77e29a1953713eb16c9d854f7130028cecb9feffb100e23"}},{"ruleId":"D2","level":"warning","message":{"text":"rdp.checkRDPEncryption (cognitive 23): rdp.checkRDPEncryption has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, match/switch 6, boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/rdp/rdp.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcb1e11b43f4e8532cabe0cee2c458742a3540844d9476a8c90cd3b6fef067b"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.DCSync (cognitive 23): Client.DCSync has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, boolean chains 4, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/secretsdump/secretsdump.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36f8d5f9031a67de8b27a509c4e3da85ca3c9355bbacd18e82193ef4471a6d7"}},{"ruleId":"D2","level":"warning","message":{"text":"smbsession.listTree (cognitive 23): smbsession.listTree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, boolean chains 3, loops 1 (nesting depth added 6). Most of this is not in the body itself: 6 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 275). 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/js/libs/smbsession/session.go"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"592ccc33e0c184c318e499d9a28d90515417e1d588461dfc2e099b14865ed616"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions.replaceStringPlaceholders (cognitive 23): expressions.replaceStringPlaceholders has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, 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/protocols/common/expressions/expressions.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa8d22145773de0e934303b2124489dc64ec325723defceacffb8cbc5bf5e93"}},{"ruleId":"D2","level":"warning","message":{"text":"eventcreator.CreateEventWithAdditionalOptions (cognitive 23): eventcreator.CreateEventWithAdditionalOptions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, loops 6, boolean chains 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/protocols/common/helpers/eventcreator/eventcreator.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4ed3125996f6d86c03ce623a14f91d710af342435dfbd26054e33d4691a285"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.execute (cognitive 23): Request.execute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/dns/request.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c629e21dab8fccf578eee788a071076b40fea647c4ef576053640ce26a5a07b"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.Close (cognitive 22): Runner.Close has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, loops 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runner/runner.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e449c69399a4c57277461400c910edf5e37dba7faf62c74fde0942fa1b2bf6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Filter.isExcluded (cognitive 22): Filter.isExcluded has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, loops 4, 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/catalog/index/filter.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"789ee76998fed8fc411ef6fabac3980e907df81508ac628cec30d38bd67e0925"}},{"ruleId":"D2","level":"warning","message":{"text":"ListInputProvider.removeTargets (cognitive 22): ListInputProvider.removeTargets has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, loops 6, boolean chains 2 (nesting depth added 8). Of this number, 12 points are the body\u0027s own statements and 10 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/input/provider/list/hmap.go"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fa039329aadb4df19e03af71cc1a409be353059c985ed6a2fee8a04feba6f0"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.CreateTemplateData (cognitive 22): generator.CreateTemplateData has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, loops 9, boolean chains 1, jumps 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/js/devtools/bindgen/generator.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"99395f493a821ee8af530075563026bc326e913e98cf4c3fd433478ae2e7adf6"}},{"ruleId":"D2","level":"warning","message":{"text":"EntityParser.extractReturnType (cognitive 22): EntityParser.extractReturnType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 4, boolean chains 2 (nesting depth added 8). Of this number, 20 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/js/devtools/tsgen/parser.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb4ad4eb8bce51987572989f291e9c5b0ed8e40c6383d4fba8f387506844e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"goexec.MergeOptions (cognitive 22): goexec.MergeOptions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 21, boolean chains 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/js/libs/goexec/options.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"12caae6e711ca55e278c504d0ac15789c40129fab988d91e1fc3feb3830f161e"}},{"ruleId":"D2","level":"warning","message":{"text":"mysql.enrichMySQLHandshake (cognitive 22): mysql.enrichMySQLHandshake has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/mysql/fingerprint.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2df31723f90f1fc474ab760a300b946574c445d79902a4fd34bf4788c7df90d"}},{"ruleId":"D2","level":"warning","message":{"text":"templates.applyTemplateVerification (cognitive 22): templates.applyTemplateVerification has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, boolean chains 5, 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/templates/compile.go"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac37462cd290eb1d9d78907e1ddae65d300968c8f88b6ac5837bcbbc93673bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowExecutor.protocolResultCallback (cognitive 22): FlowExecutor.protocolResultCallback has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 4, boolean chains 2 (nesting depth added 12). Most of this is not in the body itself: 0 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 105). 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/tmplexec/flow/flow_internal.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc7bfea1094d005bfba4fd7e1992d6d10ffe96187f3cbd8e05637a7710ce9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Generic.ExecuteWithResults (cognitive 22): Generic.ExecuteWithResults has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, boolean chains 3, match/switch 2, loops 1 (nesting depth added 9). Of this number, 18 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/tmplexec/generic/exec.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92f68a07179d7bc58662fc7a3857aad365c7b75255105e819e0ed8e21612e72"}},{"ruleId":"D2","level":"warning","message":{"text":"yaml.preProcess (cognitive 22): yaml.preProcess has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18, 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":"pkg/utils/yaml/preprocess.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0e850a928a2a5bc5ab203c6c7b4d44f59470dfd750d027ebdfbb82472e1d0b"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.listAvailableStoreTemplates (cognitive 21): Runner.listAvailableStoreTemplates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, 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":"internal/runner/templates.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f7421f2513ad3e1f4bf4e9f5a66417e4951bf985a642046e415f5703392434"}},{"ruleId":"D2","level":"warning","message":{"text":"config.IsTemplateWithRoot (cognitive 21): config.IsTemplateWithRoot has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, loops 5, 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/catalog/config/template.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a7bbfb9f1e99542e554926febf7395595543a09a0143fee65ee8554e1c1f34"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateManager.updateTemplatesAt (cognitive 21): TemplateManager.updateTemplatesAt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/installer/template.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8657d54972a3c29e14d380845eaae20ec38fa2439cbdf085830a01fcd9f6bfa5"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.identifyGenDecl (cognitive 21): generator.identifyGenDecl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, 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":"pkg/js/devtools/bindgen/generator.go"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"46afa0207f935b87c0e9ebc5566758fef77d5fcf42b7dc82e93333f2c0974458"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateData.collectTypeFromExternal (cognitive 21): TemplateData.collectTypeFromExternal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 3, 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/js/devtools/bindgen/generator.go"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6201fea6435123b872632fc483f94f9ddf8d4a6c75a44d95ccd13044d61661f"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracker.DisplayTopStats (cognitive 21): Tracker.DisplayTopStats has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, 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/output/stats/stats.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b17434b3a20082ebc4bbce87920a47bb5a1d1717645782286f11fabf9cee08"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.getDnsClient (cognitive 21): Request.getDnsClient has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, 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":"pkg/protocols/dns/dns.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cd2ba41256a327a50b26f0d2ff2061c204281b02692453b6db631644b03bae"}},{"ruleId":"D2","level":"warning","message":{"text":"Page.routingRuleHandler (cognitive 21): Page.routingRuleHandler has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, loops 4, match/switch 4 (nesting depth added 7). Most of this is not in the body itself: 0 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 17). 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/protocols/headless/engine/rules.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"df558104d41d4f5444cf3a2a3559f54555c6e05b1dd8a9912c3fd364c2c65e61"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeRequestWithPayloads (cognitive 21): Request.executeRequestWithPayloads has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/websocket/websocket.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8013af000a2d3b5f8151391d3cf7a3ce1a7ebcb4083885cad714e72385d956"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateSigner.Sign (cognitive 21): TemplateSigner.Sign has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/templates/signer/tmpl_signer.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf2fce4aaf31d8a219b95a080d5d6884d1c7900f0fcd1acb2726457466732d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Template.UnmarshalYAML (cognitive 21): Template.UnmarshalYAML has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/templates/templates.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fa50b4debf356c3e1761873246b1ccca8e9cb50d0efa84769e83cb227eb6ed"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.DoHealthCheck (cognitive 20): runner.DoHealthCheck has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runner/healthcheck.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8b7cd9f2912aefdf7763741b6ef257d2b43a344916b490d775a25f5075e5db"}},{"ruleId":"D2","level":"warning","message":{"text":"FileAuthProvider.PreFetchSecrets (cognitive 20): FileAuthProvider.PreFetchSecrets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, loops 6 (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/authprovider/file.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae835c4a62f3d65c91ab3019c7dcb7b11d8135ae50d2e494ce19a0f8b0e3c7a0"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskCatalog.findDirectoryMatches (cognitive 20): DiskCatalog.findDirectoryMatches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 2 (nesting depth added 9). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 220, 244). 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/catalog/disk/find.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a322564e3398653405d85807ecb648632870dd081d8c65ec93c911702b9041da"}},{"ruleId":"D2","level":"warning","message":{"text":"Rule.evaluateVarsWithInteractsh (cognitive 20): Rule.evaluateVarsWithInteractsh has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 8 (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/fuzz/execute.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5910fb238f0f92f6bbc585c8361e6d021a04c6af65b8f0323825b3e062afa1"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateData.gatherPackageData (cognitive 20): TemplateData.gatherPackageData has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, match/switch 8, loops 2 (nesting depth added 11). Most of this is not in the body itself: 0 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 240). 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/js/devtools/bindgen/generator.go"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7a54e75f46dc041fe9472b22ed6ea207f92c368d77ff214bfcc3a72d7d363a"}},{"ruleId":"D2","level":"warning","message":{"text":"EntityParser.extractVarsNConstants (cognitive 20): EntityParser.extractVarsNConstants has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, loops 3, match/switch 3 (nesting depth added 13). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 480). 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/js/devtools/tsgen/parser.go"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"783c1a5a31d1c2c8528f9fdd9f3177fc2f4fe17ed7f485c0d8578261c765190e"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor.ExtractRegex (cognitive 20): Extractor.ExtractRegex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, loops 3, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/operators/extractors/extract.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"773610493f4975f39d336a351738d5cf3bc94c1247628b06afbd6fa672b7245d"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeGeneratedFuzzingRequest (cognitive 20): Request.executeGeneratedFuzzingRequest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 6, loops 1 (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 10 belong to one function literal inside it that branches. 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/protocols/http/request_fuzz.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42d4962cdfc348eca0acbfbdb5e7b1db9a71416c223c2777c70e5de796b2fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.generateVariables (cognitive 20): utils.generateVariables has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, match/switch 4, 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/protocols/utils/variables.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd16585802e6a0b2bb68d5f3154edf4bd06e052cd6317b41a9a21250d863f471"}},{"ruleId":"D2","level":"warning","message":{"text":"templates.ParseTemplateFromReader (cognitive 20): templates.ParseTemplateFromReader has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/templates/compile.go"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4506bce3ed86799621d53f424678654611154dc6d0a4f635c6bffc4266458d"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.portsPopularityFromTemplates (cognitive 19): runner.portsPopularityFromTemplates has cognitive complexity 19 (threshold 15). Drivers by points: loops 16, if/else 2, boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runner/preflight_portscan.go"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5a332363f3b29ba934b7a076a601563317fd541f935485914bc6296aca0fe0"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.loadProxyServers (cognitive 19): runner.loadProxyServers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, 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":"internal/runner/proxy.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2d63fc9763ae56fbb7d1bfc5e2c6328c69e1e0f267521ca0a3ee066a2ff1c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Rule.executePartComponentOnValues (cognitive 19): Rule.executePartComponentOnValues has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19 (nesting depth added 6). Most of this is not in the body itself: 6 of the 19 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/fuzz/parts.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c30073f3aecfb40f67bec4e02987dedc4d44b0d684e5c02b14ad36899533df"}},{"ruleId":"D2","level":"warning","message":{"text":"GoExecRunner.runWMI (cognitive 19): GoExecRunner.runWMI has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, match/switch 1 (nesting depth added 9). 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/js/libs/goexec/adapter_goexec.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cd3c7c678d3e0b566422c940cff966c92a04e59afcc69ea2463df4c05cd312"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions.ContainsVariablesWithNames (cognitive 19): expressions.ContainsVariablesWithNames has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/common/expressions/variables.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fece78d1441be8bf7dd17bb472fbaa0445c50d41e26eca84eb383cd529b65b"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.RequestEvent (cognitive 19): Client.RequestEvent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 4, boolean chains 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/protocols/common/interactsh/interactsh.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0af8b9720e7dc6b0d578e4a69ace62a0cc97cb4428da94a55cb6cffcc97283"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.debugPrintInteraction (cognitive 19): Client.debugPrintInteraction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 6, match/switch 1 (nesting depth added 6). 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/protocols/common/interactsh/interactsh.go"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"26adb56426688dbf9561989e6115f02072816f50cfc8b67e30448a2d22a3cd09"}},{"ruleId":"D2","level":"warning","message":{"text":"excludematchers.New (cognitive 19): excludematchers.New has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, 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/protocols/common/utils/excludematchers/excludematchers.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bdf49d79c11f98221fb3183b6038f3d057391d726a54b3af8af66ec7e98b40"}},{"ruleId":"D2","level":"warning","message":{"text":"raw.fuzzRawHTTPParsing (cognitive 19): raw.fuzzRawHTTPParsing has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, loops 5 (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/protocols/http/raw/fuzz_harness.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4b03291b5dc93413df899dad3a863209723d1cf598a11f7dcd7fd2b4dace19"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.executeOnTarget (cognitive 19): Request.executeOnTarget has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 4, match/switch 2, loops 1 (nesting depth added 4). 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/protocols/network/request.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d66294c500be59daddb1688c9d66c8cfb4bb15f9ce82f0aaa31a3590117b65f"}},{"ruleId":"D2","level":"warning","message":{"text":"templates.parseWorkflow (cognitive 19): templates.parseWorkflow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, loops 4, 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/templates/workflows.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9cfe8a7470f2a4f693d383f038717e2eae1739fdc9986a680638737eb4a3c0"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiPartForm.Decode (cognitive 18): MultiPartForm.Decode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, loops 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/fuzz/dataformat/multipart.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cb7bb6e2496b4e22561dcb44d04ad8973fb8b23c9973f76b27f74fb2767400"}},{"ruleId":"D2","level":"warning","message":{"text":"Rule.matchKeyOrValue (cognitive 18): Rule.matchKeyOrValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 4, boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/fuzz/fuzz.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"273b6d19857765c6f2c2efcda74620717d1807ba200debe57ee2dfa9d3d2303c"}},{"ruleId":"D2","level":"warning","message":{"text":"EntityParser.extractClassProperties (cognitive 18): EntityParser.extractClassProperties has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, loops 3, 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/js/devtools/tsgen/parser.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4207c6dbe77af505f68224b2388f796776899d1602ab4c9355e2f96cd3f47b16"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor.ExtractJSON (cognitive 18): Extractor.ExtractJSON has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, 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/operators/extractors/extract.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3255d5e0ed4ae30126b5e18b1b71e423edfa10158e1c382398d2f3d32e94c64c"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions.evaluate (cognitive 18): expressions.evaluate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, loops 4, 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/protocols/common/expressions/expressions.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5f9da881f0df029e0750f0c2e84694671e929cc72e72071a8ea0b1cc815270"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions.ContainsVariablesWithIgnoreList (cognitive 18): expressions.ContainsVariablesWithIgnoreList has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, 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":"pkg/protocols/common/expressions/variables.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"946fd21063f22748194f6cafaa40e3d021b29df09a012418b09de5981949d62e"}},{"ruleId":"D2","level":"warning","message":{"text":"writer.WriteResult (cognitive 18): writer.WriteResult 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/protocols/common/helpers/writer/writer.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49a7fcd73fb5a094a5d5ca2a1af455cf8094a4ea81751938399052822cff914"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache.checkError (cognitive 18): Cache.checkError has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, 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":"pkg/protocols/common/hosterrorscache/hosterrorscache.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e115b306504cd5259c001a4e8c786ea7928f7fd1c3a55c899d8a3da5dc0cf72"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.Compile (cognitive 18): Request.Compile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 3, match/switch 3, 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/protocols/file/file.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbeb85c2b8e3740a99b1f4545c4b90033eb2d5d49e9b437e30982966bb311591"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.validatePath (cognitive 18): Request.validatePath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 4 (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/protocols/file/find.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a98cf6da3683ac5884b128c8b0d91f5b7cea79bf02084f27fea83ce2070673"}},{"ruleId":"D2","level":"warning","message":{"text":"Page.Screenshot (cognitive 18): Page.Screenshot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/protocols/headless/engine/page_actions.go"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"a606b523216caafa2d6f5dc844dde2ec0da274f226cdf4f965b6e6b471886d61"}},{"ruleId":"D2","level":"warning","message":{"text":"Page.pageElementBy (cognitive 18): Page.pageElementBy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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/protocols/headless/engine/page_actions.go"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"463b68e6e01579a73b2e1f9823681c39396175fe05cbb2e20d477c43b21bac41"}},{"ruleId":"D2","level":"warning","message":{"text":"http.enrichEventWithTLSMetadata (cognitive 18): http.enrichEventWithTLSMetadata has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/http/tls_metadata.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d232179db5e3aa20a5c46c9b9dbab37edde8cc9e3d805a3a65621866b516395"}},{"ruleId":"D2","level":"warning","message":{"text":"Integration.CreateIssue (cognitive 18): Integration.CreateIssue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, boolean chains 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/reporting/trackers/github/github.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e8d67c14d71aa466d856d0b31cf00c5ef5405e060ee58db222304f8eb1d552"}},{"ruleId":"D2","level":"warning","message":{"text":"Integration.FindExistingIssue (cognitive 18): Integration.FindExistingIssue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, 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":"pkg/reporting/trackers/jira/jira.go"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"328339a0ae1c2630e54336542d68d6fb801fd1f9a330ba812f642d4d761a810c"}},{"ruleId":"D2","level":"warning","message":{"text":"templates.ClusterTemplates (cognitive 18): templates.ClusterTemplates has cognitive complexity 18 (threshold 15). Drivers by points: loops 13, if/else 4, boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/templates/cluster.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6b7a62d346e82e859e090192a95dd2fc0c7290c606f055fc9af06afb437758"}},{"ruleId":"D2","level":"warning","message":{"text":"templates.parseTemplateNoVerify (cognitive 18): templates.parseTemplateNoVerify has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, 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/templates/compile.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0264794b1f3ea7a116435b956b92a7b91dcd087f1c819509362d42204b6fcaf"}},{"ruleId":"D2","level":"warning","message":{"text":"yaml.restoreYAMLv2InterfaceMapShapeValue (cognitive 18): yaml.restoreYAMLv2InterfaceMapShapeValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, loops 6, boolean chains 1, 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/utils/yaml/yaml_decode_wrapper.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a9fcfc15fb3266ae1926e489cd361747b6720017c10910e3bd4e75ea816591"}},{"ruleId":"D2","level":"warning","message":{"text":"NucleiEngine.closeInternal (cognitive 17): NucleiEngine.closeInternal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, boolean chains 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":"lib/sdk.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d4199637def7fe8e8f752b7e6bc66a8ffd3beea122d21a8457d1e7c58f8afa"}},{"ruleId":"D2","level":"warning","message":{"text":"loader.workflowContainsProtocol (cognitive 17): loader.workflowContainsProtocol has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, loops 7, 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/catalog/loader/loader.go"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fbaa16a8385de4488d6fd3c37e71b2fb484fc0674d7bca7f0f05435ccb0acf"}},{"ruleId":"D2","level":"warning","message":{"text":"customTemplateAzureBlob.Download (cognitive 17): customTemplateAzureBlob.Download 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":"pkg/external/customtemplates/azure_blob.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fe97e2bf48a082d191d2eeca59a0da888657973ec17c5f46f9d646cd17989f"}},{"ruleId":"D2","level":"warning","message":{"text":"time.checkTimingDependency (cognitive 17): time.checkTimingDependency has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/fuzz/analyzers/time/time_delay.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a14947ce2184004def2f0bd9ea290a741a13b5d819bb33d8ce93771ae19260"}},{"ruleId":"D2","level":"warning","message":{"text":"tsgen.recursiveScrapeType (cognitive 17): tsgen.recursiveScrapeType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, match/switch 4, loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/devtools/tsgen/scrape.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"644eba3b0a1997c5389c60554089786401085e436d4d3d40a1a084ca1955f736"}},{"ruleId":"D2","level":"warning","message":{"text":"EntityParser.loadImportedPackages (cognitive 17): EntityParser.loadImportedPackages 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":"pkg/js/devtools/tsgen/parser.go"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d4c11c67f0088267277bb851f0b7790f3ab0a3eb029d17959c30569a81a13d"}},{"ruleId":"D2","level":"warning","message":{"text":"matchers.findDSLStringMarkers (cognitive 17): matchers.findDSLStringMarkers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, loops 4, 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/operators/matchers/dsl_string_markers.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf37d91c6ba4da02a996f878eb98f4f0d10b3eb9b010f7b4f0679897fc9374b0"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions.unresolvedVarMarkers (cognitive 17): expressions.unresolvedVarMarkers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, 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/protocols/common/expressions/expressions.go"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"29725000209f42c991b25acccd467fc610e9c467311df9245d0ba6572b60c60a"}},{"ruleId":"D2","level":"warning","message":{"text":"honeypotdetector.normalizeHostKey (cognitive 17): honeypotdetector.normalizeHostKey has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 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/protocols/common/honeypotdetector/honeypotdetector.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"261a4f849ac8700772127dfc55ae399bc16f2d5535bd28977a01aa63b24a88ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.Compile (cognitive 17): Request.Compile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, 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":"pkg/protocols/dns/dns.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d136f670aa5bfe767a02c4102804ee9cc8dd709c541b807ee601ff32214f072"}},{"ruleId":"D2","level":"warning","message":{"text":"httpclientpool.SendRawRequest (cognitive 17): httpclientpool.SendRawRequest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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/protocols/http/httpclientpool/options.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dea5671471530f7b432e36bffa836dcf71376bcba17a80d5143554b2ecdbb1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.ExecuteWithResults (cognitive 17): Request.ExecuteWithResults has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 3, loops 2, 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/protocols/whois/whois.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e383c3e39dfc593b92cebbc8a2d23fe7f2e478c091e0afe0c89cc5965865d0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 16): main.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (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":"cmd/tools/signer/main.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"418a5165f28d45da49a015e41a3e2988db88fc28237c6fc5134e56923e4f2133"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.createReportingOptions (cognitive 16): runner.createReportingOptions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (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":"internal/runner/options.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf397f3787aaa4e35aab5cc9e0350abfc187d628eb2d98df9a42f6c43ae6c48"}},{"ruleId":"D2","level":"warning","message":{"text":"openapi.GetGlobalParamsForSecurityRequirement (cognitive 16): openapi.GetGlobalParamsForSecurityRequirement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 3, boolean chains 1, jumps 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/input/formats/openapi/generator.go"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"549e0554025379bf0a5c03248a2ba10343b044878fe997b74e50408e43b9c543"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateManager.getAbsoluteFilePath (cognitive 16): TemplateManager.getAbsoluteFilePath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/installer/template.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd3fb3ec298ca5984219a7d61785d19ff55c107e28ab303ab0fc58da3901da2"}},{"ruleId":"D2","level":"warning","message":{"text":"extractors.fuzzIdentifier (cognitive 16): extractors.fuzzIdentifier has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 4, match/switch 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/operators/extractors/fuzz_harness.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"647a316c666312c6124c86e2215d35535f32dc262a39dcb9d16c82609bcaa78f"}},{"ruleId":"D2","level":"warning","message":{"text":"Result.Merge (cognitive 16): Result.Merge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 5, boolean chains 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/operators/operators.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6420d96f2bae7df7e47474446235a685a5bbb7343f189f60419e265a80aef0bc"}},{"ruleId":"D2","level":"warning","message":{"text":"StatsTicker.makePrintCallback (cognitive 16): StatsTicker.makePrintCallback has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 3 (nesting depth added 2). Most of this is not in the body itself: 0 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 146). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/progress/progress.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d399cccd3b858f30f43d7bd5d85f03e96a8e34153203d1e8d09e1b9dc7432c7"}},{"ruleId":"D2","level":"warning","message":{"text":"code.registerPreConditionFunctions (cognitive 16): code.registerPreConditionFunctions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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/protocols/code/helpers.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c2b3cf403b41bcbc97cb19af9b8279f9a7f8df9e0c4fecfb88e246cd4e002b"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions.ContainsUnresolvedVariables (cognitive 16): expressions.ContainsUnresolvedVariables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, 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/protocols/common/expressions/variables.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ae1eec1226ec8b22c2f9ef9cf0b715f7d349d27dc958cdd7a30ad1f9712d58"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.poll (cognitive 16): Client.poll has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 5 (nesting depth added 2). 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 102). 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/protocols/common/interactsh/interactsh.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66744b38a3812bff12333f5ebe1e35a24f2bfb2818ff3daec31852347cf4711"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.enumerateSMBInputs (cognitive 16): Request.enumerateSMBInputs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, 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/protocols/file/smb_bridge.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"127afb600ff26a4c3b12b153f08f395a8c2b74eb9bef65bdf877ed9aa541dddf"}},{"ruleId":"D2","level":"warning","message":{"text":"Page.ExtractElement (cognitive 16): Page.ExtractElement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"pkg/protocols/headless/engine/page_actions.go"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"64910696bb8b99d53b860cefa248196ec4bba502ba3b318a46c19b4594e2df3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.ApplyAuthStrategy (cognitive 16): Request.ApplyAuthStrategy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 6, 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/protocols/http/raw/raw.go"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cf82136c4c7cfb79e808ccfc0b93dc6699373ad52e4cea25a9732c8f9a1652"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.ExecuteWithResults (cognitive 16): Request.ExecuteWithResults has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 1 (nesting depth added 4). Of this number, 14 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/protocols/network/request.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"837d10b1869763187a1c46893281e8862a887d37255481de49dd1e6346d08a13"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportingClient.Close (cognitive 16): ReportingClient.Close has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, 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/reporting/reporting.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5217ee1b77f971a6dce98a4ffcf4141f9d923d98f621301a2d8cb89db9e32738"}},{"ruleId":"D2","level":"warning","message":{"text":"Integration.evaluateCustomFieldValue (cognitive 16): Integration.evaluateCustomFieldValue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, match/switch 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/reporting/trackers/jira/jira.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e405ba9ae3e74afedfad23b850234beb3bf2c812d41e6cff0a82350abe65e5"}},{"ruleId":"D2","level":"warning","message":{"text":"signer.NewTemplateSigner (cognitive 16): signer.NewTemplateSigner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/templates/signer/tmpl_signer.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d2f8eef83b87b1b3e8b60d28f6323ceebaaead2c3396efba316364d72ec413"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http/request.go: FileTooLong \u2014 846 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/protocols/http/request.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9324d1c967573692f2c2aa26f50c86e3860edab4b96f46facf8b286fe69910"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Template: TooManyMethods \u2014 49 methods, declared across 4 files: templates/templates.go (19), templates/templates_utils.go (16), templates/compile.go (8), templates/capability.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":"pkg/templates/templates.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2161de84ae859676d638b8eedd52c37a873132a3b43b2ba1f05a9e031f34714f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Request: TooManyMethods \u2014 48 methods, declared across 9 files: http/request.go (17), http/http.go (10), http/operators.go (9), http/request_fuzz.go (6), \u002B5 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/protocols/http/http.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e84660581925747fb8487147d2da8762eb020726917f84e209ccab571ae82a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runner/runner.go: FileTooLong \u2014 724 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":"internal/runner/runner.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d9a0e6fc5f93730929ed12718da01354da5ba779df49868fcb8912c63731e8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Page: TooManyMethods \u2014 43 methods, declared across 3 files: engine/page_actions.go (30), engine/page.go (11), engine/rules.go (2). 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/protocols/headless/engine/page.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c20ce2faa4eb41e1bccf4b137c38df8e273de904405e1292e408d8d70d9682"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/page_actions.go: FileTooLong \u2014 642 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/protocols/headless/engine/page_actions.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2462c36eb5482291b2ac4f231829bfde12e80c152d69154537a3b9e49aee8725"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nuclei/main.go: FileTooLong \u2014 608 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/nuclei/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecf0654360ab6a4dae6faee1754fd4912889693550af3dba132e7025de32b43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/types.go: FileTooLong \u2014 600 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/types/types.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ea84f20d6f08401c17b2f12302f7a4f3d24d0bb59eee9d837f98fd4a8d7bf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: loader/loader.go: FileTooLong \u2014 594 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/catalog/loader/loader.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d0a8b0027c4245920672e222bc970b6687a557e8d49387a0c63513b906282c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: javascript/js.go: FileTooLong \u2014 581 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/protocols/javascript/js.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba930227066b0d677e2e3d8fb4a3ad81cb7218e299f30dcbb9da8bc6bcd131d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): pkg/operators/matchers/match.go:272-296 | pkg/operators/matchers/match.go:309-333 \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/operators/matchers/match.go:272\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/operators/matchers/match.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d791dc2fc37f2d9cb421cf5e8689cbf8174dd35adfc5f522fe7f827819db1b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): pkg/protocols/http/request.go:224-242 | pkg/protocols/http/request.go:437-455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also 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":"pkg/protocols/http/request.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e7547c11fda1f64b2b524acbeda66b68c3f6a26f3ab08cd011142a730fb253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): pkg/reporting/exporters/jsonl/jsonl.go:47-63 | pkg/reporting/exporters/mongo/mongo.go:99-115 \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/reporting/exporters/jsonl/jsonl.go:47\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/reporting/exporters/jsonl/jsonl.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"659c050c9c2db2526767ac21c9ac974250ea2ebb7dc4a3a830071680fb72407c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pkg/input/provider/list/hmap.go:197-212 | pkg/input/provider/list/hmap.go:444-459 \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/input/provider/list/hmap.go:197\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/input/provider/list/hmap.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"414e9ba81ad63effb17972a0227f94227aabe95e368afdb53e17d3cd3e056881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pkg/protocols/common/variables/variables.go:93-108 | pkg/protocols/common/variables/variables.go:146-161 \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/protocols/common/variables/variables.go:93\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/protocols/common/variables/variables.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ff50b09ecc50f1bf393249ce5d4ac1749156d6928c498a14ecf5616dbe1522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pkg/utils/telnetmini/smb.go:223-238 | pkg/utils/telnetmini/smb.go:313-328 \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/utils/telnetmini/smb.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4e761c0ed8052a30b043ce97e1f1db9318cab361949ce63fc9a891a09a578d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pkg/utils/telnetmini/smb.go:637-653 | pkg/utils/telnetmini/smb.go:666-681 \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/utils/telnetmini/smb.go"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"67292e4811d99008b3a16bc689f3dd08c5801905a229df09d5155330e41dec1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pkg/templates/compile.go:126-141 | pkg/templates/compile.go:210-225 \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/templates/compile.go:126\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/templates/compile.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4597b4cd90c5cdaeadcc274efddfa08b643bf96b562f733ea4c7956e8fa8655b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/js/libs/mssql/mssql.go:162-177 | pkg/js/libs/mysql/mysql.go:224-238 \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 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":"pkg/js/libs/mssql/mssql.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cfea81a5cb6e2670426b655e7e4c4a1d0d296ea3b2b7a6efd012ae70e67376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/js/libs/rsync/rsync.go:132-146 | pkg/js/libs/rsync/rsync.go:172-186 \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/js/libs/rsync/rsync.go:132\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/js/libs/rsync/rsync.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8af340bf4b905cb12497246d9236a96c0165744d6eecd3d6103de126fb620d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/protocols/headless/engine/page_actions.go:302-316 | pkg/protocols/headless/engine/page_actions.go:330-344 \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/protocols/headless/engine/page_actions.go:302\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/protocols/headless/engine/page_actions.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932292e9fa1c23f72b054ec63206d2a6ad868846e166ff07b771b90a831b0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/tmplexec/flow/flow_executor.go:143-157 | pkg/tmplexec/multiproto/multi.go:44-58 \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. 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/tmplexec/flow/flow_executor.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f76efaa52cd5ab2e27c6f86b0713a971d509bf9f18d88c905c9ab36d05cdf77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/js/libs/redis/redis.go:36-50 | pkg/js/libs/redis/redis.go:118-132 \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/js/libs/redis/redis.go:36\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 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":"pkg/js/libs/redis/redis.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5978c95b35c9879b2b03dad66349bddfd529a76f46cb1edb719d1bfa919f2d4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/js/libs/redis/redis.go:117-131 | pkg/js/libs/redis/redis.go:192-206 \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/js/libs/redis/redis.go:117\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 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. 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/js/libs/redis/redis.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d967ae2bdd6368e5c94165b79121875c93b305cd4ea401cbafa34438f0f687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/protocols/dns/request.go:72-86 | pkg/protocols/network/request.go:240-254 \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/protocols/dns/request.go:72\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/protocols/dns/request.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2749ed613bc6d16f8b87a22af0158067d1854dcf4851f07adb4808ebd62b5797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/input/formats/openapi/downloader.go:34-47 | pkg/input/formats/swagger/downloader.go:43-56 \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/input/formats/openapi/downloader.go:34\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/input/formats/openapi/downloader.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"649b4b9ccd2b92a39a11e1697350949a7e7cb4c009c4730ba1236c65a47ecbfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/js/gojs/gojs.go:83-97 | pkg/js/gojs/set.go:58-71 \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/js/gojs/gojs.go:83\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/gojs/gojs.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"93edf97ddb3b4b0ff770f7ccfcdf574157663c4cde11c5355d05f1f46fc81704"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/operators/extractors/fuzz_harness.go:339-352 | pkg/operators/matchers/fuzz_harness.go:280-293 \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/operators/extractors/fuzz_harness.go:339\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/operators/extractors/fuzz_harness.go"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ee9e9360cb9a515307cc2ed2c032c50ec8dbb1e9d05ab1f17d87e72eb8db51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/protocols/utils/fields.go:35-48 | pkg/protocols/utils/fields.go:67-80 \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/protocols/utils/fields.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99a9ea2b651ae2416885a2dbad9230c7b7d953921fff39f70d299e73131172f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/reporting/exporters/es/elasticsearch.go:71-84 | pkg/reporting/exporters/splunk/splunkhec.go:63-76 \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/reporting/exporters/es/elasticsearch.go:71\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/reporting/exporters/es/elasticsearch.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c6364756bea78313c7413a0af2c7bcfdfc78d987aef0fb87de96ff2c0dd494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/protocols/file/find.go:37-50 | pkg/protocols/offlinehttp/find.go:21-37 \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/protocols/file/find.go:37\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/protocols/file/find.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6d054aa698dfa5d1615f8fe3a03a61ad7ea7ad94fd59f3c86649ad8f39ef3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/input/provider/list/hmap.go:168-180 | pkg/input/provider/list/hmap.go:415-427 \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/input/provider/list/hmap.go:168\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/input/provider/list/hmap.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fc4563c843214786184a822704356fc994fbe9f1a66e36561fbb44077b1a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/input/types/fuzz_harness.go:230-242 | pkg/protocols/http/raw/fuzz_harness.go:286-298 \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/input/types/fuzz_harness.go:230\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/input/types/fuzz_harness.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ddf66dee411be8a375f168544ea47a69e079c9af5cd5365903083527ebf130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/js/libs/rdp/rdp.go:301-313 | pkg/js/libs/rdp/rdp.go:334-346 \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/js/libs/rdp/rdp.go:301\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/js/libs/rdp/rdp.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"483c4e51364d8aad6b830b2a3cde83cc2810593ba9fa5ab3eaf63147d781a838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/model/types/severity/severities.go:40-52 | pkg/model/types/severity/severities.go:57-69 \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/model/types/severity/severities.go:40\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/model/types/severity/severities.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaf35231c0f17447b95bccaf0f4002de9d824351575b87a0632a7a5dd372215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/js/global/scripts.go:124-136 | pkg/js/global/scripts.go:155-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/js/global/scripts.go:124\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 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":"pkg/js/global/scripts.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6656fdcd4d3ce8661eefccb0bf1f51b37543426d50a33de5ae05a313b26210b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/input/types/fuzz_harness.go:158-169 | pkg/protocols/http/raw/fuzz_harness.go:212-223 \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/input/types/fuzz_harness.go:158\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/input/types/fuzz_harness.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"762254973a019ce24406cd7f01612b9625fc33dd8c5af971b6bb9524b359d0bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/input/types/fuzz_harness.go:268-279 | pkg/protocols/http/raw/fuzz_harness.go:335-346 \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/input/types/fuzz_harness.go:268\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/input/types/fuzz_harness.go"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2d7633b95696039c833e9c5847333c72fd4ecce1bd1a382f6464d020258431"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/js/libs/mssql/mssql.go:86-97 | pkg/js/libs/postgres/postgres.go:228-239 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/js/libs/mssql/mssql.go:86\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/js/libs/mssql/mssql.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4464a964f908eff1467587278d937030d1aba9a5d27b6d084bd8cbc5f326422e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/js/libs/rdp/rdp.go:215-226 | pkg/js/libs/rdp/rdp.go:256-267 \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/js/libs/rdp/rdp.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0628d4c7ae10bbc90832d23fd7a094aa84c02bf6726660d576e4d6736b509203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/operators/extractors/fuzz_harness.go:256-267 | pkg/operators/matchers/fuzz_harness.go:211-222 \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/operators/extractors/fuzz_harness.go:256\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/operators/extractors/fuzz_harness.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"1628dc2cf9728adad48bd6ebdcc8b0c8ba200a41edf7a6ee6a8d149787d19137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/operators/extractors/fuzz_harness.go:274-285 | pkg/operators/matchers/fuzz_harness.go:229-240 \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/operators/extractors/fuzz_harness.go:274\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/operators/extractors/fuzz_harness.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69d4c38473f9fbcac5789af18efb3aa20130e09bffc7d4cc33a8aa78d0b759f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/protocols/file/request.go:182-193 | pkg/protocols/file/request.go:202-213 \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/protocols/file/request.go:182\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/protocols/file/request.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83732ddaa13fa2a4f2eaacb6aae4520da7e050f6d7b080a4da9e605c364258f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/protocols/headless/engine/page_actions.go:643-654 | pkg/protocols/headless/engine/page_actions.go:665-676 \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/protocols/headless/engine/page_actions.go:643\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/protocols/headless/engine/page_actions.go"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"3161f1d4c3da42457dd0acb322143c8a5c638dde557b9bef9c123cdc2cd6c518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/protocols/protocols.go:431-442 | pkg/protocols/file/operators.go:48-59 \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/protocols/protocols.go:431\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/protocols/protocols.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98b989fe415e7cf32139a56071a58f01e13d5dd5688401b3bc7049aa75aa04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/utils/telnetmini/ntlm.go:193-204 | pkg/utils/telnetmini/ntlm.go:206-217 \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/utils/telnetmini/ntlm.go"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d29f4ace1f88fa0c72db07a03be5d544006ed914dc546a14e02bee0b1b2108d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/catalog/disk/find.go:223-234 | pkg/catalog/disk/find.go:247-258 \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/catalog/disk/find.go:223\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/catalog/disk/find.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a3072ec591c4827cf974e0763c7ed6bcd429268e408c3708b0a070290cf822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/protocols/http/operators.go:86-97 | pkg/protocols/offlinehttp/operators.go:81-92 \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/protocols/http/operators.go:86\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/protocols/http/operators.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6181c4432d3c5b1ae201209cdd59c3b7fd868f93465d263ea815579b8e3ba0b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/protocols/network/operators.go:43-55 | pkg/protocols/offlinehttp/operators.go:65-76 \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/protocols/network/operators.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5392163aa266637cd3251da663f23a4f57691b1558c12e08fa4e43963ab67da5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): pkg/protocols/headless/operators.go:20-30 | pkg/protocols/http/operators.go:24-34 | pkg/protocols/offlinehttp/operators.go:23-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/protocols/headless/operators.go:20\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. 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/protocols/headless/operators.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc8f09b295c886bd1dc5b717d8aeeb9a0f529ec85bef2e648970e39afc94b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/input/provider/list/hmap.go:532-542 | pkg/input/provider/list/hmap.go:591-601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/input/provider/list/hmap.go"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"57407eaa04eca4bab4ed8a7b34dd9938c07696643db1bfb45b1a8729f375d096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/js/libs/mssql/mssql.go:60-70 | pkg/js/libs/postgres/postgres.go:188-199 \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. 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/js/libs/mssql/mssql.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"408dc423c4a9ec689bdde78008776f5450693e6d7b3e568cd5a5e27338c62fef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/protocols/dns/dns.go:168-178 | pkg/protocols/headless/headless.go:109-119 \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/protocols/dns/dns.go:168\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/protocols/dns/dns.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75b3c9c709049cb2f36302d2e963dcd7fdcadf4d827c323a126683a24d02428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/protocols/http/httpclientpool/clientpool.go:395-406 | pkg/protocols/headless/engine/http_client.go:68-78 \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/protocols/http/httpclientpool/clientpool.go:395\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/protocols/http/httpclientpool/clientpool.go"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4e5105403d3f0a5a61200a9150069f07881dc8d98e1dc9e168c93d8589fdb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/protocols/javascript/js.go:468-478 | pkg/protocols/headless/request.go:95-105 \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/protocols/javascript/js.go:468\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/protocols/javascript/js.go"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fd2027ed56852d6957916909825adc2104cd09d156cf59fabf36f8ccfbc85c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/tmplexec/generic/exec.go:45-55 | pkg/tmplexec/multiproto/multi.go:82-98 \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/tmplexec/generic/exec.go:45\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/tmplexec/generic/exec.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"680ef98d99ed95adeb05ae64634c5ebe2031bd0fddab2b0a12e6020554af485b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/types/interfaces.go:34-44 | pkg/utils/insertion_ordered_map.go:65-75 \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/types/interfaces.go:34\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/types/interfaces.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45c3eb521b4a2295e1f4c3a69d0398f8a6ead6ff204044119f51bba70b37b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/js/libs/redis/redis.go:70-80 | pkg/js/libs/redis/redis.go:185-195 \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/js/libs/redis/redis.go:70\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/redis/redis.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d5e789695332ab7e24ee756ef695d26d89f0f52ca03384176d1248837a649b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/protocols/http/request.go:178-189 | pkg/protocols/http/request.go:492-502 \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/protocols/http/request.go:178\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. 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":"pkg/protocols/http/request.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae767caa3d2683d9fde3c09ee626d5b1f2d239842d6956a0b3d2aa39fbcd4677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/protocols/http/request_fuzz.go:69-79 | pkg/protocols/http/request_fuzz.go:102-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/protocols/http/request_fuzz.go:69\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/protocols/http/request_fuzz.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66dee88db2e289fbacd60f2e2d43faee837d7cfdb6b63492879388cee3cd109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): pkg/protocols/network/network.go:269-278 | pkg/protocols/websocket/websocket.go:120-129 | pkg/protocols/whois/whois.go:69-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/protocols/network/network.go:269\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/protocols/network/network.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1609a79733ef598f9be4fec9e9138bd1a78789d3ff3e74cc3b1e98a792997158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/js/libs/postgres/postgres.go:49-58 | pkg/js/libs/redis/redis.go:155-164 \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/js/libs/postgres/postgres.go:49\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/postgres/postgres.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa8f679096ad8ffcb1e5a34afd2ddb9b1aecd51d398ccddf4ce631bb55093e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/js/libs/rdp/rdp.go:54-63 | pkg/js/libs/rdp/rdp.go:112-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also 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":"pkg/js/libs/rdp/rdp.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f284a8403c27c4ca3fb82c61df730f8ec066d299855e39a12e95b3a9cb1d06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/protocols/file/request.go:75-84 | pkg/protocols/file/request.go:178-189 \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/protocols/file/request.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddde40f56462291068b951a80f9607d6e90905ea5d28f83309f66393b8f40580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/protocols/headless/engine/page_actions.go:792-801 | pkg/protocols/headless/engine/page_actions.go:816-825 \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/protocols/headless/engine/page_actions.go"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"881939701f83bd383266775ea2061f23c78f36e111fa1ecef2cee2d45b47155a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/protocols/headless/headless.go:144-153 | pkg/protocols/http/http.go:429-440 \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/protocols/headless/headless.go:144\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/protocols/headless/headless.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4375fc478949f282707c75d8f1e30b64122a8ca4f850fafe9293072acee01b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/protocols/headless/headless.go:156-165 | pkg/protocols/http/http.go:521-530 \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/protocols/headless/headless.go:156\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/protocols/headless/headless.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2d64118281ffa274b370c28b44f3f8e5edd475316d53512df71caee1707fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/protocols/ssl/ssl.go:307-316 | pkg/protocols/ssl/ssl.go:326-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/protocols/ssl/ssl.go:307\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/protocols/ssl/ssl.go"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"10eeff5afbb9534b7c021fa304d903f21cdef037759264c5abe91f7839cfa95b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/tmplexec/flow/builtin/dedupe.go:19-28 | pkg/tmplexec/flow/vm.go:84-93 \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/tmplexec/flow/builtin/dedupe.go:19\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/tmplexec/flow/builtin/dedupe.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b378b11b1d53e6fe1cf99a6add746ebbddbbfe5c5094a84faa028d9ccc90aa70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/utils/telnetmini/smb.go:396-405 | pkg/utils/telnetmini/smb.go:408-417 \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/utils/telnetmini/smb.go"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"0722c4265ea866359de8a74e78d4d6a30e55c8da3eddc0630f87160659771c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/core/executors.go:152-161 | pkg/core/executors.go:206-215 \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/core/executors.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb9a9e10f44a6573b5fd1afe562f89512dd27a67e283aa641aa2dcc127ac618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/js/libs/kerberos/sendtokdc.go:94-103 | pkg/js/libs/kerberos/sendtokdc.go:135-145 \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/js/libs/kerberos/sendtokdc.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/js/libs/kerberos/sendtokdc.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"824d765636d8414082f75f35059e7b89fec91ff126b5e74bd909da4c32b05723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/operators/extractors/compile.go:31-40 | pkg/operators/matchers/compile.go:49-60 \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/operators/extractors/compile.go:31\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/operators/extractors/compile.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"74460949fe8c49fea6a254272001874fc9b3e48be53b79d2746d3a41361878c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/protocols/headless/operators.go:68-77 | pkg/protocols/network/operators.go:43-52 \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/protocols/headless/operators.go:68\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/protocols/headless/operators.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c76ec2c73f012fd0e6512712bbf59628e42f84cabc467927ffeb64d280a8ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): pkg/protocols/file/operators.go:41-50 | pkg/protocols/headless/operators.go:67-76 | pkg/protocols/http/operators.go:65-73 | pkg/protocols/network/operators.go:42-51 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/protocols/file/operators.go:41\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/protocols/file/operators.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"601786f74c7d4abe7cf3f750b35d06fef44696d479b819d8f899fcd10ee7324a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/input/formats/openapi/generator.go:365-373 | pkg/input/formats/openapi/generator.go:382-390 \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/input/formats/openapi/generator.go"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7cb7b691527b2d3877acac8e6d1d085bdaea646ee5e5e088dfc4c001214e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/input/provider/list/hmap.go:145-153 | pkg/input/provider/list/hmap.go:392-400 \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/input/provider/list/hmap.go:145\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/input/provider/list/hmap.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6118494328a988f4c84dc386d4340aa85cc94a092ec6e15609dd69d9691e61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/js/libs/oracle/oracle.go:66-74 | pkg/js/libs/pop3/pop3.go:52-60 \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 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":"pkg/js/libs/oracle/oracle.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5069fd24023c854c233e3c10196e619a4689177abc396f30465b31aaae7afc27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/js/libs/postgres/postgres.go:85-93 | pkg/js/libs/postgres/postgres.go:173-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/postgres/postgres.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e735a835ed714bca2755c96733dbf64e5e3bfed297ff79faea921b3c9b54fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/js/libs/telnet/telnet.go:91-99 | pkg/js/libs/vnc/vnc.go:135-143 \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 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":"pkg/js/libs/telnet/telnet.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed781f1cdc01d352274b2d4a07bf5ab3eac54836b5e1a28c45c53ebcec39b833"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/protocols/http/httpclientpool/perhost_ratelimit_pool.go:104-113 | pkg/protocols/http/httpclientpool/perhost_ratelimit_pool.go:138-146 \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/protocols/http/httpclientpool/perhost_ratelimit_pool.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/protocols/http/httpclientpool/perhost_ratelimit_pool.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62c4b399dd00c87e3b418daf72d356b3314286377b77d1799125212118a73e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/reporting/exporters/es/elasticsearch.go:116-124 | pkg/reporting/exporters/splunk/splunkhec.go:103-111 \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/reporting/exporters/es/elasticsearch.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec77921fcbcdde14dffca021f27f19b26936ecc8f9bdcd07e198e2040d4544db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/js/libs/kerberos/sendtokdc.go:67-76 | pkg/js/libs/kerberos/sendtokdc.go:109-117 \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/js/libs/kerberos/sendtokdc.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a529b38957e88c1f3560f739fb3a502a8e8fe7419ab6788ebe6d7e77aa0870c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/protocols/http/request.go:285-293 | pkg/protocols/http/request.go:591-599 \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/protocols/http/request.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbc904fb5d4a7d7de344daf8004d80aeacb7458a4b25ea0a4a417a92bff633c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/protocols/network/request.go:110-118 | pkg/protocols/network/request.go:176-184 \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/protocols/network/request.go:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/protocols/network/request.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"884e7f0424c4e4a837b44000ffc256570ce19ee8157b8e9cbcb27bff233c5c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): pkg/protocols/dns/dns.go:156-163 | pkg/protocols/headless/headless.go:144-151 | pkg/protocols/http/http.go:429-436 | pkg/protocols/network/network.go:269-276 | pkg/protocols/websocket/websocket.go:120-127 | pkg/protocols/whois/whois.go:69-76 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/protocols/dns/dns.go:156\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/protocols/dns/dns.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae4e4b66314dfdd1d67c7470b37596c0c08a8e88379d9288156b3723f61ccc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): pkg/js/libs/dcom/dcom.go:59-66 | pkg/js/libs/scmr/scmr.go:60-67 | pkg/js/libs/tsch/tsch.go:55-62 | pkg/js/libs/wmi/wmi.go:68-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/js/libs/dcom/dcom.go:59\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/js/libs/dcom/dcom.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c220ca1a621ce2dcb70c27d589d7f18100dd36fb4f12f8c7d969a53ef9dc61a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/input/types/fuzz_harness.go:172-179 | pkg/protocols/http/raw/fuzz_harness.go:226-233 | pkg/templates/fuzz_harness.go:316-323 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. 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/input/types/fuzz_harness.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20cb63f2fcfb0e27012b3851c2d6fe9e7e1da17098731ae3384a70104dd7d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/js/libs/dcerpc/dcerpc.go:314-321 | pkg/js/libs/dcerpc/dcerpc.go:379-386 | pkg/js/libs/dcerpc/wmiexec.go:49-56 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. 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/js/libs/dcerpc/dcerpc.go"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab742c9f007a26ab18f981bf9f489f08ab2d3138402fc4c09621b79643f633d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/protocols/protocols.go:461-468 | pkg/protocols/file/operators.go:25-32 | pkg/protocols/offlinehttp/operators.go:36-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/protocols/protocols.go:461\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/protocols/protocols.go"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4898520ebd55ad87fcde6294910e4d25fe62bbd3c5c5dbed942d0863eaaa775"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/protocols/headless/operators.go:33-40 | pkg/protocols/http/operators.go:37-44 | pkg/protocols/network/operators.go:26-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/protocols/headless/operators.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/protocols/headless/operators.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ff0c28867eeff9d238012a4c084df28a601a9625ff823b79e9ed30a576c37f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cmd/tmc/main.go:242-249 | cmd/tmc/main.go:276-283 \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 \u0060cmd/tmc/main.go:242\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":"cmd/tmc/main.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6df7e4ec17ccf72e020d96d675515a10beeefc0e14e6e68fe761b03f5e6959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/fuzzplayground/server.go:289-296 | internal/server/server.go:368-375 \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 \u0060internal/fuzzplayground/server.go:289\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 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":"internal/fuzzplayground/server.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9568fc782e370bda17b7b19e1fadf242287dcec58701489ee284bf37533bfa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/catalog/loader/loader.go:472-479 | pkg/catalog/loader/loader.go:538-547 \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/catalog/loader/loader.go:472\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/catalog/loader/loader.go"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dfda0c740e47faf7da83d9d65739b66235baa5874d3847da0c2bb685f1ea8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/operators/extractors/fuzz_harness.go:288-295 | pkg/operators/matchers/fuzz_harness.go:243-250 \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/operators/extractors/fuzz_harness.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d840e16023efde10d2e610b623bcb184eed6917bc74fbeb5893a0bc2d4c74b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/protocols/headless/engine/page_actions.go:490-497 | pkg/protocols/headless/engine/page_actions.go:515-522 \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/protocols/headless/engine/page_actions.go:490\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/protocols/headless/engine/page_actions.go"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3fd2081483c5edc4aeb3b2b2f021e67b6da84c92eb8bd6947696efa71d0ec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/protocols/ssl/ssl.go:438-445 | pkg/protocols/websocket/websocket.go:451-458 \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/protocols/ssl/ssl.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f9820a075a3df38a3f7d237726b8a71f5dd5783d4db6f90ff84144bf0559f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/protocols/websocket/websocket.go:183-190 | pkg/protocols/whois/whois.go:94-101 \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/protocols/websocket/websocket.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"20890e9a0d5d7566076b8d5a3a7599d0166655a2da223193853146981d34f1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/reporting/trackers/linear/jsonutil/jsonutil.go:93-100 | pkg/reporting/trackers/linear/jsonutil/jsonutil.go:123-130 \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/reporting/trackers/linear/jsonutil/jsonutil.go:93\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/reporting/trackers/linear/jsonutil/jsonutil.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31b89a71785dcedcc6da6f77e28b6b1670f51154136b03e4eac014e1142bb43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/templates/cluster.go:65-73 | pkg/templates/cluster.go:76-83 \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/templates/cluster.go:65\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/templates/cluster.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"118520ca5bc174ad4ac51d86d7372df8d33816f79f6179e7b626e07d53cdb0b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/utils/telnetmini/smb.go:534-541 | pkg/utils/telnetmini/smb.go:610-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/utils/telnetmini/smb.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"0597b2662ec04589c0633575c91bd5d995921d70f4304c0b394c3b1c377e3622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/js/global/scripts.go:87-94 | pkg/tmplexec/flow/vm.go:70-77 \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/js/global/scripts.go:87\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/js/global/scripts.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc9a6603ea421ad1c6295ab246a7da5d115fcb26c05467b4fc201468ddd0085"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/js/libs/kerberos/sendtokdc.go:85-92 | pkg/js/libs/kerberos/sendtokdc.go:126-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also 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":"pkg/js/libs/kerberos/sendtokdc.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa88150ecfd6fc6af0f60ac3ced050c9ba96479c6524c4afe7352dca6796bc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/js/libs/smb/smb_share.go:24-31 | pkg/js/libs/smb/smb_share.go:50-57 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also 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":"pkg/js/libs/smb/smb_share.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50cfac32abea0ab12077e16a45140d895bd85f319d528ae08e065adbdc5295a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/operators/extractors/compile.go:58-65 | pkg/operators/matchers/compile.go:71-78 \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/operators/extractors/compile.go:58\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/operators/extractors/compile.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bc92fbffcf6df32ee1ca21d5bc181d0b5e580a4a29921eae6830ce33d395bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/protocols/common/generators/load.go:23-30 | pkg/protocols/common/generators/load.go:40-47 \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/protocols/common/generators/load.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d669175dbad8b0fae98248e14e327d7b873c2c97b1a8308cf1e2d86f0d263f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/protocols/dns/request.go:243-250 | pkg/protocols/http/request.go:1337-1344 \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/protocols/dns/request.go:243\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/protocols/dns/request.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c47d9fecacc03b866cf1604863fcdedccd8a1f28a5ab6573d8189d3ed6be5e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/protocols/file/operators.go:17-24 | pkg/protocols/network/operators.go:18-25 \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/protocols/file/operators.go:17\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/protocols/file/operators.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cd29caf45a36111e23fd008a9eae46043b307553a0f9ef413945ec0670143a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/templates/compile.go:455-462 | pkg/templates/compile.go:488-498 \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/templates/compile.go:455\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/templates/compile.go"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6726ed80ec7058c30e2e7a11106e249ef62fa43ebeeef684b7a63564c1ad5b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): pkg/reporting/trackers/gitea/gitea.go:95-101 | pkg/reporting/trackers/github/github.go:91-98 | pkg/reporting/trackers/gitlab/gitlab.go:81-87 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. 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/reporting/trackers/gitea/gitea.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a4f1a630e97edeb9324cecb99d79c17b84fd46585f4fcd2be23748d50cbc15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): pkg/scan/charts/echarts.go:118-124 | pkg/scan/charts/echarts.go:280-286 | pkg/scan/charts/echarts.go:367-373 \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/scan/charts/echarts.go:118\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/scan/charts/echarts.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b293daa7a5e4547dc4bb555bda846b4575e5740172c2f45d8583e77ffb0d9b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/sdk_private.go:123-130 | lib/sdk_private.go:290-296 \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":"lib/sdk_private.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"770a8e37be23dd09041355886d4e02cd594dbaee9da6d3475979ce39825c71a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/authprovider/authx/dynamic.go:134-140 | pkg/authprovider/authx/dynamic.go:159-165 \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/authprovider/authx/dynamic.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d529029774a2ab3d43e1cd1e9c7da70fc999603869472c02cda0b28c7419a76f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/authprovider/file.go:78-84 | pkg/authprovider/file.go:111-118 \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/authprovider/file.go:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/authprovider/file.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"478482eff4be4e16f24031f2e4a2404c9cc0f9bcb41f1cfd58e85da63caa43d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/catalog/index/filter.go:304-310 | pkg/catalog/index/filter.go:314-320 \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/catalog/index/filter.go:304\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/catalog/index/filter.go"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03aef81db92559cdf49451603b7a2cf1f72507ab3f239567146a9c74e125997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/input/formats/openapi/generator.go:221-227 | pkg/input/formats/openapi/generator.go:237-243 \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/input/formats/openapi/generator.go:221\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/input/formats/openapi/generator.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5f700727f2c958172dd83138c655290f5e093d8199bed627a70c205c9ce5b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/input/types/fuzz_harness.go:132-138 | pkg/protocols/http/raw/fuzz_harness.go:169-175 \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/input/types/fuzz_harness.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"beab2e02ee2e027e44e91e99bd5a9eaa3d2144034164c7f036d02853544172fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/js/libs/mssql/fingerprint.go:117-123 | pkg/js/libs/mysql/mysql.go:139-145 \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 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":"pkg/js/libs/mssql/fingerprint.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b2df3378b474df474817bc54e4db717c55a22cb8120e943dc3a1535ae377a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/protocols/code/code.go:422-428 | pkg/protocols/websocket/websocket.go:443-449 \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/protocols/code/code.go:422\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/protocols/code/code.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2038c3d5eb173bce4d81197e57e42e2b235d5b516b1a6b401bc8b504726631e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/protocols/http/httpclientpool/clientpool.go:374-380 | pkg/protocols/headless/engine/http_client.go:51-57 \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/protocols/http/httpclientpool/clientpool.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcd0e15be1e9a8a3c142ac48cd7c18c898d61e220bf7a51258b7e5d4598fb9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/protocols/javascript/js.go:700-706 | pkg/protocols/network/request.go:472-478 \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/protocols/javascript/js.go:700\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/protocols/javascript/js.go"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fc28ca9c809447bba7546a0d9387289b58422a396af74529eee2d93c906614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/protocols/javascript/js.go:917-923 | pkg/protocols/network/operators.go:105-111 \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/protocols/javascript/js.go"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c3b968e24594672ef7f2789227120bdf577fcbeeb551dbf4d0a399ec6cdb4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/protocols/ssl/ssl.go:226-232 | pkg/protocols/whois/whois.go:103-109 \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/protocols/ssl/ssl.go:226\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/protocols/ssl/ssl.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8b9c5eee7e3081f0a8233824b64a5cf0ecca058e5a0cbeacc344ee092f4084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/utils/telnetmini/smb.go:482-488 | pkg/utils/telnetmini/smb.go:531-537 \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/utils/telnetmini/smb.go"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"a437767290c3c96ca6c49779cd1465afa96d2be003a6877e53b7bc1a0fb9cf78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/utils/yaml/yaml_decode_wrapper.go:165-171 | internal/runner/options.go:147-153 \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/utils/yaml/yaml_decode_wrapper.go:165\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/utils/yaml/yaml_decode_wrapper.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa519ae5d58d5d0f77a9cb4fb2d9394a8381863faacba68a6415bfd2d87d5c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/protocols/headless/operators.go:153-159 | pkg/protocols/network/operators.go:114-120 \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/protocols/headless/operators.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"89356a4ba46c47c3d74d366b4fc0b9cde234e23e849922f0844bee0fee4ba740"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cmd/nuclei/main.go:851-857 | internal/runner/options.go:93-98 \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 \u0060cmd/nuclei/main.go:851\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":"cmd/nuclei/main.go"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"2922bf2cd562e42716c1abb3ec9a24adee902a3a931b401ce86a1bfb7a69bb9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cmd/tmc/main.go:259-264 | cmd/tmc/main.go:293-298 \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 \u0060cmd/tmc/main.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/tmc/main.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1029e9a46ca75d43283ba70fcc50203d75f15d7fae88e01e12077615042aaf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/protocols/dns/dns.go:180-185 | pkg/protocols/network/network.go:252-257 \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/protocols/dns/dns.go:180\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/protocols/dns/dns.go"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f912685b0494648b1f3544157072123ad23391716f5d3e5e4233ca8ea53bfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/protocols/websocket/websocket.go:446-451 | pkg/protocols/whois/whois.go:195-200 \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. 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/protocols/websocket/websocket.go"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"de21787bfa82abf73f0c5caf742d85ad04fb6c47f331d6744fa2c14a48232d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/protocols/dns/operators.go:114-119 | pkg/protocols/offlinehttp/operators.go:143-148 \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/protocols/dns/operators.go:114\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/protocols/dns/operators.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f68923a0241c8264c21e742cdefef274c208fe92aefd45178f6c1791ac05f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/tmplexec/flow/flow_internal.go:39-44 | pkg/tmplexec/flow/flow_internal.go:76-81 \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/tmplexec/flow/flow_internal.go:39\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/tmplexec/flow/flow_internal.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5b3198c3562654bf4b0ab5311fc2e0c31c4afe84f0d0dc08609a0bfa8f88da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): pkg/utils/telnetmini/smb.go:569-573 | pkg/utils/telnetmini/smb.go:574-578 | pkg/utils/telnetmini/smb.go:579-583 | pkg/utils/telnetmini/smb.go:584-588 | pkg/utils/telnetmini/smb.go:589-593 \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. 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/utils/telnetmini/smb.go"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb696763fb5e68443bfb5610ef0d433ed5bd2257bc466bb4bf6a0417b017443c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): pkg/js/libs/dcom/dcom.go:24-28 | pkg/js/libs/scmr/scmr.go:24-28 | pkg/js/libs/tsch/tsch.go:24-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/js/libs/dcom/dcom.go:24\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/js/libs/dcom/dcom.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0781e2c830f9acb1627660b29c03e3818db70960706a7acc65302a0cd184d945"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cmd/tmc/main.go:266-270 | cmd/tmc/main.go:300-304 \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 \u0060cmd/tmc/main.go:266\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":"cmd/tmc/main.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a325220a263dbbec974541407eb1263051811de7c3faa3691f02f49f315c3ba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/js/libs/scmr/scmr.go:66-70 | pkg/js/libs/tsch/tsch.go:73-77 \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/js/libs/scmr/scmr.go:66\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/js/libs/scmr/scmr.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc8d22c78746912dc90347da9bbacef53588553c654f0215827c06cc7f8d2e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/js/libs/tsch/tsch.go:64-68 | pkg/js/libs/tsch/tsch.go:70-74 \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/js/libs/tsch/tsch.go:64\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/js/libs/tsch/tsch.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"685ecf04b0eb49d4fe923491499666a7e0fd897d35f23cfa6e074629fb40262f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/js/libs/wmi/wmi.go:84-88 | pkg/js/libs/wmi/wmi.go:89-93 \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/js/libs/wmi/wmi.go:84\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/js/libs/wmi/wmi.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb832d49e17b405e8719a27f87c4067d24cba9bb73cea4120767d0247f767444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/js/libs/wmi/wmi.go:94-98 | pkg/js/libs/wmi/wmi.go:101-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/js/libs/wmi/wmi.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73c91dfbb3e282c5795fd513ab51dad12e8279eb5573acbde1ad5c96f790576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/protocols/file/request.go:308-313 | pkg/protocols/network/request.go:461-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. 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/protocols/file/request.go"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f561440b5d0e5d30af79d58becaff5ab2a96c4e01f411f431c643bb1f58ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/protocols/javascript/js.go:684-688 | pkg/protocols/ssl/ssl.go:271-275 \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/protocols/javascript/js.go:684\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/protocols/javascript/js.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0a81f481f500bac0d94a2cb980c52098a71bcd477b8851888140a2fecfd0e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/core/workflow_execute.go:37-41 | pkg/core/workflow_execute.go:142-146 \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/core/workflow_execute.go:37\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/core/workflow_execute.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af5e0a148fab1159286bdd5bbdb4184fe0e01fc7c0d233600a97f52ba33c214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/protocols/file/operators.go:105-109 | pkg/protocols/offlinehttp/operators.go:145-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/protocols/file/operators.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"85362ff4b8587308c92f41f80c81f2c4a5928e62e5495922bed92c8283fa9e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/protocols/headless/operators.go:134-138 | pkg/protocols/http/operators.go:164-168 \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/protocols/headless/operators.go:134\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/protocols/headless/operators.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95393d3aa713bc89a749208f90c9e963ca68477bad7bd0c099137c651a7c4e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/protocols/headless/request.go:64-68 | pkg/protocols/network/request.go:165-172 \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. 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/protocols/headless/request.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca85d959ea9a5619a7843979cbd25e9cf0d970c10ee78561526052c51d5f2d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/protocols/http/operators.go:129-134 | pkg/protocols/offlinehttp/operators.go:124-128 \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/protocols/http/operators.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9f50ff539929f821e9d97012b60ec4aa83ad42379af15261da0bfdec3330c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runner/runner.go: internal/runner/runner.go changed 14 times in last 90 days, max complexity 74. 3 of those changes were fix/bug commits, and the other 11 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":"internal/runner/runner.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65690efbecf34b358cac402671b165b5aa18e2363cf67d3bcfa98c0b1d0cf832"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/protocols/http/request.go: pkg/protocols/http/request.go changed 5 times in last 90 days, max complexity 128. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, 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/protocols/http/request.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7061071f14191c9d18a81360fb30243f032ca02d49dbbe658fb7f66f592e153a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/catalog/loader/loader.go: pkg/catalog/loader/loader.go changed 8 times in last 90 days, max complexity 52. 2 of those changes were fix/bug commits, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, 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/catalog/loader/loader.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe91da531aa957e78d304f1468b590c14808c1a3c85e3f5e8eec3c44884520e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/protocols/http/http.go: pkg/protocols/http/http.go changed 5 times in last 90 days, max complexity 61. 1 of those changes was a fix/bug commit, and the other 4 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/protocols/http/http.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba25cd43a4cff0ba4f5cf1145c0ccc56f9a060f50e17e2b4723e8eb55654335"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/nuclei/main.go: cmd/nuclei/main.go changed 6 times in last 90 days, max complexity 49. 2 of those changes were fix/bug commits, and the other 4 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":"cmd/nuclei/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"562bae3dda40c83b3a6fb1964d11eae3c14d7312cc353ff47dcf43adc370d021"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/sdk_private.go: lib/sdk_private.go changed 6 times in last 90 days, max complexity 46. 1 of those changes was a fix/bug commit, and the other 5 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":"lib/sdk_private.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c350f4382b3c9297982a7284368447e922460f06efae4a9dde7c0328ce322333"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/protocols/headless/engine/page_actions.go: pkg/protocols/headless/engine/page_actions.go changed 5 times in last 90 days, max complexity 40. 1 of those changes was a fix/bug commit, and the other 4 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/protocols/headless/engine/page_actions.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91688412a152dcb979471272bb2298e27ad28383c222e30654a39b1f57312213"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/protocols/javascript/js.go: pkg/protocols/javascript/js.go changed 4 times in last 90 days, max complexity 35. 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/protocols/javascript/js.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dabe33f7dec1eb2c137f5b1435ab467ade67e842a3e11bbd3cb9e53f51eacf1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/templates/templates.go: pkg/templates/templates.go changed 4 times in last 90 days, max complexity 31. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, 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/templates/templates.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d14ee916c19267c5530aba7f1cc86e7c8600a4090aeb0989774bcade2e9890"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/protocols/http/httpclientpool/clientpool.go: pkg/protocols/http/httpclientpool/clientpool.go changed 3 times in last 90 days, max complexity 40. 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/protocols/http/httpclientpool/clientpool.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"577aa49d32ac0fba512bd7337100cf0c6f68c47d9cd530225321e7a4938c53e5"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 7 significant file(s) lose their only recent owner: pkg/js/libs/dcerpc/dcerpc.go, pkg/js/generated/ts/dcerpc.ts, pkg/protocols/http/httpclientpool/http_to_https_tracker.go, pkg/protocols/headless/operators.go, pkg/js/libs/vnc/vnc.go, pkg/protocols/dns/dns_types.go, pkg/js/libs/dcerpc/wmiexec.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9af3bb1c12461621d2ef2b7f983e8f8fadb3caf4668db13c9da54c72d41a647d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 3 significant file(s) lose their only recent owner: pkg/catalog/index/index.go, pkg/catalog/index/metadata.go, pkg/templates/templates_utils.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"576763934b6ee9f9a1db6ef1d30aa6cb83187da6e3afbce0bccab314ab994f99"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (14 single-owned of 318 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 #3 (2 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2042c2f6576e7593c8cedd4791a75195df513a2b29d241b70ab0182c4e60e33"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"53d5bdc5fb74f163367daea8717506984f9f8c4b5536a810b34d5145fe58538b"},"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":"e8710a8b90ebe8d30ebf3184388fe5a1a9e5bd48ac6fced34989b30598e8283d"},"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":"ab3ce72fc321a6bfb40193ddca869231063da52cad2d5529ee43e61b6eb3e42a"},"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":"9761b1971d82a9982fa5f69612c58b887b7d82f0777b86325608d82f16312328"},"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":"54ef9f96bbb6a420ac55dc5043a47528aa2a8e96728a75719ebd602fc2d29cf1"},"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":"299416b52453b27cbbd0c194ea5c25c5ede71f8cbaa55f3b7aa79c536d7227cc"},"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":"71f33adbe198a099c387e5807a2b1a061ad4f8914562288663d7b24f059c76da"},"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":"dfbbe0bcadac3c6686546b6aa3aeadc85bbee345bd3d350438c91ab79d5bfb40"},"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":"d94fde9db6057c987f24f2e44c0ce0fb47e4880d71a580f1fa7568a347344d9d"},"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":"c543d1dd7ed13553374b9e51cdb73d4e946776e26dbf321daccde29e480741ce"},"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":"cd111c5556ee665d367516c79ddbb82bfd43e586fb31209cd46db1788d4f601d"},"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":"dd9831e0103e2086b0b3b8d567d2d14f5a6464b05c9178966988890e60ab03a2"},"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":"7c93bd79b0adb3b4f5c687095b827835d0d3cf5813da65cfb21097a4a5daa5e1"},"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":"e95064bc49fb94977a2d5d918e4345376d7ad48eea16b9d1edc6ea2adbdfad30"},"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":"8ab5f08c445665668d7891a25d8c141ac3df9fb65d408199f43cf0bcbac67612"},"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":"b754c9425f764f3e8cde9f9532fc8dc67741be49f819a1e928ed1cb68b1d979f"},"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":"a3fb4310000c0548f0d7c7abf7b74e492626ecf787fff11a8a9b7273229fb6a1"},"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":"62e41bc264569b0c76e4a20630cff7c186fec9f1aabde7da9c30880262dd721f"},"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":"e779a99b8190c5692586874f446a6fc32ecbd04ed430eb662953da054ffdff1d"},"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":"5816cd709cec3cb957deb347f789cec39e942a22b226021ba21270f9da0de835"},"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":"cd5766b00ada8dfad7c25a5ba1374f4341af4e8b365a37a5400cf817b8368ed4"},"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":"7aba5d3c83b2ba0f665fa3a2008c15a3561737ba700b7c8b9f8210459c3f2aa8"},"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":"482415cbb5f6601e7d748abb30ed7469bb1d1207126ff7f28f3e30a2758ef906"},"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":"6f0c0a2104dcc577db28c4ccfac1c98dc1e27a732c917b28f7bacea4e133dbf2"},"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":"17c56664839b943900077574539ac3ed581eadb4525ae6a2064e44ee98b13739"},"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":"87159c3784e253d6b830fb8398eb494977ab4240e3234854f9ff27d3b53a18de"},"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":"6a5622694f0927608f4c91e2bd48493455ede2782fa3a8bfa947663566eafbca"},"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":"ecaf592e1baac5aa88fad73f2adc5e3b3a2eb85e96f2c5f74e2556dd54c2e444"},"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":"aa47c82ed6dee56159a92a24ae8e9bf196a19aed617417a11635e04878f0a0f5"},"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":"aee9e5c5310b1486ab84b6fd1e02fdf3c40e07892f6e61bc9bfd9b8c16fd9e9e"},"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":"b8919b9c87c2eb051aa66112638cc6a6872d449bfe8e5006d0d90dec69e0ce7a"},"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":"ad3f4d53d43c1f11093eeb42aeec5232567b0a28ad461c151ff1da89a10fcc1e"},"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":"81224dd56ce99b03d364bb1be6e2b022eb0a6598fc1c7a09d64ea61c4874f64c"},"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":"791483e1f6894ccd736ad991d9c7c263dba4a135e2e9a95f6cb451d0206eb928"},"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":"d965090654bddd45400740a65ba639ce69b6e48c5652ad3b9aa298e51d87a86e"},"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":"fdae476f2fd92282376c34f044e7bf2a9c30bcc39d6aa1522fe746946ad1b404"},"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":"f468f2344a4b90ef9bd8e0e5b84d017c5aee2531050d1fdc0f0be9000a914bdc"},"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":"2d6c055ad741669a2bf2b383c2fc538f8893bcb4023a30c47efcbc2060c72fca"},"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":"77b7242a3684524cb19206af9a3aec6b51886e89917626f61a1748bda339830c"},"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":"90a76485fb8a09caa3043f8c1ff859b4984674f79618c6b3325e9924324c4a00"},"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":"aaade4e2fc99a306e52c90ea02ec2073bc215ad1c8f021056a867957fc612d5d"},"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":"c405af68f6612324b97fa364b7c198477c27c193f16912f3a533f14054897357"},"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":"489a7f3916b3a9c17f9e744e1e2894d77d6bc9a5ff49807dff6c8e5e69cc41ae"},"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":"95d43fe04e79ab3efa6c5c1104951b56762e625f301cffec92f08299599c6121"},"taxa":[{"id":"CWE-89","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":"d7ec1f1df8d3c9b16836c62dcb8a7d626d4496f678c19717e087c2947c58a116"},"taxa":[{"id":"CWE-89","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":"5a7a22c6288ead67917d2c1bad639c6689036de822697718f93e264fe687e300"},"taxa":[{"id":"CWE-89","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":"8f7d2ac1bb1253a614b85e1d813065d1a8f325723a0d44979020769a052063b1"},"taxa":[{"id":"CWE-502","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":"8665df08e9f4d9c3eb4172070c7fd7fd33fd47ef63a2e165ff5f0fc9b90fa480"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5c9845ce6a8969767e4695699226c666d9c75ed5ca1293ac6608b7b4683cafc"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","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":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","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":"81b7b122dd29fa300cc907bb6c67190012ccd02c5ea06ad02dcacb4f073ceaf0"}},{"ruleId":"D31","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":"6f4584881b70b2a4a9537d11bac9fa8d6f02218cbf0c4317e17fafd48d481017"}},{"ruleId":"D31","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":"0a219fca69b151fffa098dd0f59255ea4a009b747aac6c6b6597b0b918af2f1b"}},{"ruleId":"D31","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":"e3d40a786969e23434788b4af598fd499eeafa4720433cd66cbcb68e557d926e"}},{"ruleId":"D31","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":"becbc5502f94878197b05d70c7ef15f1353fd99a90efcb824b9c43f11ae5ce7a"}},{"ruleId":"D31","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":"96432df12fc0e73a39c7d9724726ae9b9081c9b82ccbb802866b563bc5effa61"}},{"ruleId":"D31","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":"75188b9f87d6c6b2fce0cd7400bc33db8aa74ece09af5a73087bcc2c2a5ac402"}},{"ruleId":"D31","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":"eb7bba13614c9e5155ca962bd1159a53c393b10ec162cc5edaf307077cce6ed7"}},{"ruleId":"D31","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":"e10a22c7bc98bcabd5794d32b82b69b65cbf138504fa427bc02d8f864a9d8a45"}},{"ruleId":"D31","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":"2465c912f06bb88fa73a98d1e96aca6144ac28f69e6f794f890eccb91ba4cbc9"}},{"ruleId":"D31","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":"4285fad0ad929639dc991f97626ac8442f5965ee11963f2d96d053a278adfd5f"}},{"ruleId":"D31","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":"c729c636a395dbd8d336912f3b4a010b1361e95608171447c8641cda88477bd0"}},{"ruleId":"D31","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":"d173d303d6f387d08243502cb419957ad925eef0b964828d76a7ab4496c3b206"}},{"ruleId":"D31","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":"25a67609fdef083e9d2c59b4a2236f960f55c098364206a9557d8126dcc597b4"}},{"ruleId":"D31","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":"3f1293cdd3ca333cc96dd4f0c42acc9b6e93bca2e05b38460c6a4492fc8b7783"}},{"ruleId":"D31","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":"bd068b3b6ae5003244f9542c0e31b58955c5d6f17f011cb5b61174c59f41f247"}},{"ruleId":"D31","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":"ae2dfb06bfe0dcadfc949c881aa237cb2a4aac5b1cc69adf101d9e003549ef46"}},{"ruleId":"D31","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":"b67787f58bbdcde79a43cc08af597219f8bc8ccd5a82b8588a8f7af6b62ec402"}},{"ruleId":"D31","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":"673040359bb359d4bd52ff671202e3b3ff8734afd9de37d2bc36c4075e89e341"}},{"ruleId":"D31","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":"cfd0dd4cefa42b08df34711c98ddcecedd94cd1480f8bf42cd40683588983def"}},{"ruleId":"D31","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":"7bfef2fb34c7b13e0c721ff21626f86f3739a60e19d68aba349489d318c377f6"}},{"ruleId":"D31","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":"60a9430bb9ba2a7dd2520932c52f913793ab6fbf353df8735355cb3684dd0836"}},{"ruleId":"D31","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":"a9159d7cd78d8a5df2ed7e498f4c47d3489bbfa20759845eea65e942b1aaf3b8"}},{"ruleId":"D31","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":"51813f0a64c19328c6f4f3522296add5025d4734c835c11127860a605d75db70"}},{"ruleId":"D31","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":"5937042519af8846e60d718eade7b9ca3f07c7f67545077cdcb513fb2157006b"}},{"ruleId":"D31","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":"3d783cb3931e3fd4c2950c0515a6c07e44ec0bc8941fffdf255a1bebcdee808b"}},{"ruleId":"D31","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":"4d01e692757c91f8a628c4a75b0331451b312c4a7d5d53c32e6c5f60ef2844fe"}},{"ruleId":"D31","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":"39698b603f9904cc92eb648710af3cdb716c77b4f1bf98701a380de95c2bf1c5"}},{"ruleId":"D31","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":"282d9b5c7fefb19e61066d488c00d35e75b3c6624252609ff324ad8f997b57d4"}},{"ruleId":"D31","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":"b504f963b2afe07b49931d118ccf335882f7a79f539be43ea5cd48685e8978b6"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 32 of 318 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/templates/signer/handler.go, pkg/reporting/trackers/github/github.go, pkg/fuzz/component/headers.go (and 29 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: compile.go \u2194 extract.go: \u0060pkg/operators/extractors/compile.go\u0060 and \u0060pkg/operators/extractors/extract.go\u0060 change together 60% of the time (9 of the 15 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/operators/extractors/compile.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ceea89dbb90e87871087c9f090e94eb6c6ff0e78b238dc284b628a91562ff4"}},{"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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"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":"50c379534161bb30611d421e82af3666b891a67b9a6a35df5a4fc4b4977e653b"}},{"ruleId":"D40","level":"note","message":{"text":"No network policy: No Kubernetes NetworkPolicy (or Cilium policy) found. Without one, every pod can talk to every other pod and reach out to the internet by default. Add a default-deny policy and open only the flows you need."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"295828650a2aaa1b03ae9b32ae6843a0c38011e5a70b1926442c4fa7187de5f0"}},{"ruleId":"D41","level":"note","message":{"text":"No seccomp profile: Workloads do not set a seccomp profile (RuntimeDefault or a Localhost profile). Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3f418e9f76c3ac90484e0e94a454bfe9b08e914e1cdd218e1fc9e3b261a3bf6e"}},{"ruleId":"D41","level":"note","message":{"text":"No AppArmor/SELinux confinement: Workloads declare no AppArmor or SELinux profile. A mandatory-access-control profile confines what a compromised container can touch on the host, complementing seccomp\u0027s syscall filter."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e83fbc31033373d6c51983ed230eb4ba61f7775ed02afb30f5fc1840bde01d4f"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"CWE-328","shortDescription":{"text":"CWE-328"},"helpUri":"https://cwe.mitre.org/data/definitions/328.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-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"CWE-502","shortDescription":{"text":"CWE-502"},"helpUri":"https://cwe.mitre.org/data/definitions/502.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.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":89,"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."]}]}