{"$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":"D33","name":"JS/npm Dependency Vulnerabilities","shortDescription":{"text":"JS/npm Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D33","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":"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}},{"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"},{"id":"D42","name":"Runtime Threat Enforcement","shortDescription":{"text":"Runtime Threat Enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/D42"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"cluster.GetState (cyclomatic 35): cluster.GetState has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/cluster/status.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7d55868c4553596fb673ee6dc69b75af61fadc3f1c98e45cabf264228d5fa6"}},{"ruleId":"D1","level":"warning","message":{"text":"node.Start (cyclomatic 34): node.Start has cyclomatic complexity 34 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/node/start.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed385cbf43018c77ba5d6e8aed10ff5f725aee89f5141c2fbdb0e6037f1dff93"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.Create (cyclomatic 34): Driver.Create 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/drivers/parallels/parallels_darwin.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5733b5238dc17d589149c31b223df77e038f84d0058a7ae2982bb8da2ab355"}},{"ruleId":"D1","level":"warning","message":{"text":"oci.CreateContainerNode (cyclomatic 33): oci.CreateContainerNode 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/drivers/kic/oci/oci.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"86143655299b991c9ae31424dc0c6b0ff10201037fa63d37320d0f15b42effb5"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.validateFlags (cyclomatic 32): cmd.validateFlags has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/start.go"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb343013a563774e8c362fc38b47a05060b4e6d6c94645706c183da35864844b"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.runStart (cyclomatic 29): cmd.runStart 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":"cmd/minikube/cmd/start.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce9387ae8d01d9cd972fb12b73deeb1af96351d19f3ea5ed0ae3deb1a5f4e1f"}},{"ruleId":"D1","level":"warning","message":{"text":"Bootstrapper.restartPrimaryControlPlane (cyclomatic 29): Bootstrapper.restartPrimaryControlPlane has cyclomatic complexity 29 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 4 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/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"b344ad70d583e87f6ed086848bab14d23b700bf292003680f030bf3997634a94"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.provisionWithDriver (cyclomatic 28): cmd.provisionWithDriver has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/start.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e9470acb5607ebcdf6912752d783828d869d97f363646540f4de006d639afb"}},{"ruleId":"D1","level":"warning","message":{"text":"cluster.HostIP (cyclomatic 28): cluster.HostIP 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/minikube/cluster/ip.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d7acbfb7b606e5d6a93a0fd89d3b96234007c799d1c99b9a8d7c7cfaac3026"}},{"ruleId":"D1","level":"warning","message":{"text":"main.execute (cyclomatic 28): main.execute 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":"hack/benchmark/cpu_usage/auto_pause/chart.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd9b04a286afb5e22bf59c168c474015d6418a4854cb86c515fcde905ed882d"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.selectDriver (cyclomatic 27): cmd.selectDriver has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/start.go"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"db003eecc62607df34e24f5171d5800cda5167b02637db49712448e243175910"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.updateExistingConfigFromFlags (cyclomatic 27): cmd.updateExistingConfigFromFlags has cyclomatic complexity 27 (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":"cmd/minikube/cmd/start_flags.go"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"428e39ecd9aa4e486bcd24af53f294c5768fafe6741eb585b64dc73dc7558e35"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.Start (cyclomatic 25): Driver.Start 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/drivers/virtualbox/virtualbox.go"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c8d6f987cf5de72f3d217516387a0f00d5389e78d9d20a5b989c069a8ce382"}},{"ruleId":"D1","level":"warning","message":{"text":"bsutil.GenerateKubeadmYAML (cyclomatic 25): bsutil.GenerateKubeadmYAML 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/minikube/bootstrapper/bsutil/kubeadm.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e1c88c2fec808a652a7acbb40f9b0481eb0ebf304626f6ae90647a9133996e"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.validateKubernetesVersion (cyclomatic 24): cmd.validateKubernetesVersion 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":"cmd/minikube/cmd/start.go"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"953143bb488a2cb664a1f2283b5d57ff34bcc9a759c825e9f59648e7809dc736"}},{"ruleId":"D1","level":"warning","message":{"text":"config.processRegistryCredsConfig (cyclomatic 24): config.processRegistryCredsConfig 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":"cmd/minikube/cmd/config/configure_registry_creds.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c85c3252bb360809d2863ceef507d8d4177dbe21289194ab3838793ee19201d"}},{"ruleId":"D1","level":"warning","message":{"text":"addons.addonSpecificChecks (cyclomatic 24): addons.addonSpecificChecks 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/addons/addons.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee4d571e795aab4b6a94d72e4c11bd49768a91ff6f2b4a31ae927ebbc5e4e06"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.Start (cyclomatic 24): Driver.Start 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/drivers/qemu/qemu.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74d2cb0084e3afd974020b3e6499a5fe16d30f7620a5b83505290e65eb563df"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.CreateVM (cyclomatic 24): Driver.CreateVM has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/virtualbox/virtualbox.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6890066d092682e10b841aa734eda7cead98b1cfb73e6968ca8fa83c068fafb"}},{"ruleId":"D1","level":"warning","message":{"text":"Bootstrapper.WaitForNode (cyclomatic 24): Bootstrapper.WaitForNode 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/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b4895a064c0b2d060a704820f31bcb18574be4a2c2b267c87e90972c439a64"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.Create (cyclomatic 23): Driver.Create 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/drivers/kic/kic.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c18e4d04940b27a02d02cfd72590e674c4ec35449392835f7129461c6627b37"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrapper.SetupCerts (cyclomatic 22): bootstrapper.SetupCerts has cyclomatic complexity 22 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/bootstrapper/certs.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8194cdf0ede1d1d12a446f012c62784c8c6d835da4ce9a65fa751fb1c60b2bda"}},{"ruleId":"D1","level":"warning","message":{"text":"bsutil.extraKubeletOpts (cyclomatic 22): bsutil.extraKubeletOpts 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/minikube/bootstrapper/bsutil/kubelet.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b05640d587a4817ce547404a2c4e149badacb4e70b47bcbfba2faa852ef100"}},{"ruleId":"D1","level":"warning","message":{"text":"node.beginDownloadKicBaseImage (cyclomatic 22): node.beginDownloadKicBaseImage 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 138). 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/minikube/node/cache.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3f3097e16ed8a6ddc7fa07b65e7993f2e195e033bcd5c342fc2b6686402539"}},{"ruleId":"D1","level":"warning","message":{"text":"provision.ConfigureAuth (cyclomatic 21): provision.ConfigureAuth 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/libmachine/provision/utils.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1af863c23bd4112fcd4956d7cdaa74dad4da74601134bf18b6b97a1ab3fcad"}},{"ruleId":"D1","level":"warning","message":{"text":"cluster.NodeStatus (cyclomatic 21): cluster.NodeStatus 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/minikube/cluster/status.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea23ee44b363d4f4a6608c60cabbd9bace7a133fe9a63a0940db135bb26ea05"}},{"ruleId":"D1","level":"warning","message":{"text":"download.ImageToCache (cyclomatic 21): download.ImageToCache 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/minikube/download/image.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"357e771ecdfb7bface2ca8104c16387761343fd9ccbaf239b0646272a89de286"}},{"ruleId":"D1","level":"warning","message":{"text":"generate.ErrorCodes (cyclomatic 20): generate.ErrorCodes 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 97, 57). 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/generate/errorcodes.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"310bb0e772a40af19bc2e9308ba4bdfbba6e0feeecea8ff263b4da29a8ebd451"}},{"ruleId":"D1","level":"warning","message":{"text":"assets.GenerateTemplateData (cyclomatic 20): assets.GenerateTemplateData 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/minikube/assets/addons.go"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c537fe8d1d8c8ab9afe901987aa8484c88d8500797c6d69399690be34b8349e"}},{"ruleId":"D1","level":"warning","message":{"text":"Bootstrapper.init (cyclomatic 20): Bootstrapper.init has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to 3 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/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"607877dff4085cf37914f26bc72df678a9031a67073a2c8cba60d1aac9aee91c"}},{"ruleId":"D1","level":"warning","message":{"text":"CRIO.Preload (cyclomatic 20): CRIO.Preload has cyclomatic complexity 20 (threshold 15). Of this number, 19 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/minikube/cruntime/crio.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38028926c3d3d36aeb1dc64eae25bb97cec6e12ea7da626e8d430d16f0a0cd8"}},{"ruleId":"D1","level":"warning","message":{"text":"machine.BuildImage (cyclomatic 20): machine.BuildImage 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/minikube/machine/build_images.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a5d2fff70c734be716002c03e7e4746f4dab1ca4bc8cae5ba20350f5183bc3"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrapper.generateProfileCerts (cyclomatic 19): bootstrapper.generateProfileCerts 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/minikube/bootstrapper/certs.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"97be898be5acc81a7db5c2961c73c00d976faf5fa6f10b771a761a6a3501f5fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Bootstrapper.UpdateNode (cyclomatic 19): Bootstrapper.UpdateNode 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/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d29cfa3157194a9a9d44cec093e0a2cba093fc6844fe073057441f9e42137fb"}},{"ruleId":"D1","level":"warning","message":{"text":"cruntime.generateContainerdConfig (cyclomatic 19): cruntime.generateContainerdConfig 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/minikube/cruntime/containerd.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"380590aaf5d2a310967448cf560e3bca4cbd6db4c2530da3b5410ae1622e4b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"Docker.Enable (cyclomatic 19): Docker.Enable 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/minikube/cruntime/docker.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1261e80f003836084573c564cd5d1fb37c8feb684b596678d3fa3860e5f742"}},{"ruleId":"D1","level":"warning","message":{"text":"machine.ListImages (cyclomatic 19): machine.ListImages 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/minikube/machine/cache_images.go"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafd28e803193f11d20d348b9e165301d934b382ea045757ce686d55359414c5"}},{"ruleId":"D1","level":"warning","message":{"text":"main.execute (cyclomatic 19): main.execute 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":"hack/benchmark/cpu_usage/idle_only/chart.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6729a511693cee5adcb5ca4110c368a42101cfaa4d8364b391f0c5af08c416f5"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.generateNewConfigFromFlags (cyclomatic 18): cmd.generateNewConfigFromFlags 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":"cmd/minikube/cmd/start_flags.go"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4e83735434d28dccf27551a4d4c6c7e2b9546f9de02c0cb8a379627a410997"}},{"ruleId":"D1","level":"warning","message":{"text":"oci.runCmd (cyclomatic 18): oci.runCmd 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/drivers/kic/oci/cli_runner.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9afcad280d26d345bb8561a46b9ebb21d095492349652f8b1875552ea120f7f"}},{"ruleId":"D1","level":"warning","message":{"text":"main.processCommitFolder (cyclomatic 18): main.processCommitFolder 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":"hack/legacy_fill_db/filldb.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ce03b96dc78a6e81c48a21e98ede02587a698e4ac54c8b11f0ec9cfbe2a8d1"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.validateRequestedMemorySize (cyclomatic 17): cmd.validateRequestedMemorySize 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":"cmd/minikube/cmd/start.go"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"36943f586d235608d945c8b9bc8aecbeed3b6d2b659cb08a0d975ef00abcacda"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.validateCPUCount (cyclomatic 17): cmd.validateCPUCount 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":"cmd/minikube/cmd/start.go"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"989da74836ee917c05bbe5edc245946b8be75e83a97d3daf020144df27ab38f4"}},{"ruleId":"D1","level":"warning","message":{"text":"addons.EnableOrDisableAddon (cyclomatic 17): addons.EnableOrDisableAddon 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/addons/addons.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5ef3080ecd5dfc547073b074e8e264c643d59ecd37d512e4059b7536c0657d"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.Create (cyclomatic 17): Driver.Create 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/drivers/hyperv/hyperv.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f227407da491b7f88b89c732b493b32346b3c42eeaf2895170f371730dc71ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"oci.RoutableHostIPFromInside (cyclomatic 17): oci.RoutableHostIPFromInside 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/drivers/kic/oci/network.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd50026cff8560d461b15db52740952f02f727d10592b119c432cbde40e458e"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.Create (cyclomatic 17): Driver.Create has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: 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/drivers/kvm/kvm.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf12f425c385c0a7cfa7cc078ef244dd37d794733dd0edc7f51927c7a7678ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.Create (cyclomatic 17): Driver.Create 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/drivers/qemu/qemu.go"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f9a620606c6cdc78bff957cbbc1ca3b6c18760c60d178ce840ebb0d5fddd82"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.generateDiskImage (cyclomatic 17): Driver.generateDiskImage 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/drivers/vmware/driver.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc6c7252fadf85fdd66521ab1082031d25311acd3d0551bcf0cc3993d4e5628"}},{"ruleId":"D1","level":"warning","message":{"text":"X509CertGenerator.GenerateCert (cyclomatic 17): X509CertGenerator.GenerateCert 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/libmachine/cert/cert.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"16df044d3d598d52ddb1de7d87167cf88e8404b57925d1063c9987543e13422e"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.runDelete (cyclomatic 16): cmd.runDelete 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":"cmd/minikube/cmd/delete.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d3fd606a5d786d94c9d0f06201671d9ca33c2bfae0b2d150cbafd57844ab18"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.Execute (cyclomatic 16): cmd.Execute has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/root.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8192e8eb7f077152b0ddd08d643e9927b78ebc6d9f6c663f29df7bafe6d7ebab"}},{"ruleId":"D1","level":"warning","message":{"text":"cmd.writeStatusesAtInterval (cyclomatic 16): cmd.writeStatusesAtInterval 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":"cmd/minikube/cmd/status.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"120c0d142504615c66ebe8ae17de50dd0acbe88d73e0b3b426b8dbd86c333c6f"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver.createNetwork (cyclomatic 16): Driver.createNetwork has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/kvm/network.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d9a531b018f201fd033336d2a20b933cf02f2505e48c624b7512eafda3199d"}},{"ruleId":"D1","level":"warning","message":{"text":"virtualbox.listHostOnlyAdapters (cyclomatic 16): virtualbox.listHostOnlyAdapters has cyclomatic complexity 16 (threshold 15). 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 136). 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/drivers/virtualbox/network.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e90026f5b758c71eea96144b6b8c26b44e8334248f4fd9eceb7b19e19f0908d"}},{"ruleId":"D1","level":"warning","message":{"text":"host.MigrateHost (cyclomatic 16): host.MigrateHost 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/libmachine/host/migrate.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6a61127d7243a955dc915254cfaae073cafd14ca632b9b77a207bea2ff9a9d"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.writeStringsToFiles (cyclomatic 16): extract.writeStringsToFiles has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 452). 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/minikube/extract/extract.go"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"006e8d4b0fe0795bd0c9a74143813ec7ea9ddebefba512c78e1f24d4335c7ff8"}},{"ruleId":"D1","level":"warning","message":{"text":"mustload.running (cyclomatic 16): mustload.running 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/minikube/mustload/mustload.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f987dc6d35cd93dd500eb1b1551e30cd2c582c4d87460c06299674fd13034c"}},{"ruleId":"D1","level":"warning","message":{"text":"persistentRegistry.Register (cyclomatic 16): persistentRegistry.Register has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/tunnel/registry.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d5a1aae31ecd24617fec742874b3232b1c42f3e98207f619cb94d194dc18cb"}},{"ruleId":"D1","level":"warning","message":{"text":"update.GHReleases (cyclomatic 16): update.GHReleases 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":"hack/update/github.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c52fe7fb1a6839cb9d281bbb8360df75e866ad6740a390746ca8f3b20ee06c5"}},{"ruleId":"D1","level":"warning","message":{"text":"main.main (cyclomatic 16): main.main 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":"hack/update/get_version/get_version.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3660be617af7c6c759d19f7d589b2203edaeda006c61cc6f5b7b300ccfb6f7"}},{"ruleId":"D2","level":"warning","message":{"text":"node.Start (cognitive 59): node.Start has cognitive complexity 59 (threshold 15). Drivers by points: if/else 54, boolean chains 5 (nesting depth added 23). Of this number, 42 points are the body\u0027s own statements and 17 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/minikube/node/start.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"830952da7b7044c9fc29e2a79bac7ec5176b5e2efa68bc0111787704d82a85d9"}},{"ruleId":"D2","level":"warning","message":{"text":"generate.ErrorCodes (cognitive 54): generate.ErrorCodes has cognitive complexity 54 (threshold 15). Drivers by points: if/else 52, boolean chains 1, loops 1 (nesting depth added 35). Most of this is not in the body itself: 10 of the 54 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 97, 57). 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/generate/errorcodes.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d95d6a3813d6d0ae3e15cb7438668a551065eb6d5acdd20d6d4e05c5b22fd12"}},{"ruleId":"D2","level":"warning","message":{"text":"cluster.GetState (cognitive 52): cluster.GetState has cognitive complexity 52 (threshold 15). Drivers by points: if/else 37, loops 7, match/switch 5, boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/cluster/status.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b059339cef3a31fafde74f38c612abf3a15b2819b81f619a3cac040255118a"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.runStart (cognitive 51): cmd.runStart has cognitive complexity 51 (threshold 15). Drivers by points: if/else 46, loops 3, boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/start.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4666d22f192bfdf3de3c3cca5b35299702262464ef99a67b23bd0747ddc109b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.Create (cognitive 48): Driver.Create has cognitive complexity 48 (threshold 15). Drivers by points: if/else 45, loops 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/drivers/parallels/parallels_darwin.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5a4384b114092ed851120ee11722d0a5171976ab57f8340bb4f6d7ce7ea285"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.selectDriver (cognitive 45): cmd.selectDriver has cognitive complexity 45 (threshold 15). Drivers by points: if/else 31, loops 8, boolean chains 4, match/switch 2 (nesting depth added 20). Of this number, 43 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":"cmd/minikube/cmd/start.go"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89a29b574015f84c37ae5a6a7be52a619cdd714244d764c436fff29d1cc02fc"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.validateFlags (cognitive 44): cmd.validateFlags has cognitive complexity 44 (threshold 15). Drivers by points: if/else 40, boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/start.go"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20e478b4aeb0fc15de5abc4bb7947e54acb36c50220160f8217cf2d6a22d20c"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.BuildImage (cognitive 42): machine.BuildImage has cognitive complexity 42 (threshold 15). Drivers by points: if/else 36, boolean chains 3, loops 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/machine/build_images.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"384f361e44211270559367a9fefdf709e1c1e7b1d96940ed8abc8e247bf038f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Bootstrapper.WaitForNode (cognitive 40): Bootstrapper.WaitForNode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 39, 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/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a25ccdeaeb1b9c68885d7660ee38bf3abc289b505aac1ac62c24191dafad798"}},{"ruleId":"D2","level":"warning","message":{"text":"oci.CreateContainerNode (cognitive 39): oci.CreateContainerNode has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29, boolean chains 8, loops 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/kic/oci/oci.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4f9e85a3da0753ea53c5f5956ce037d817cd22ca94e6ea6c4829ef48317e28"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.writeStatusesAtInterval (cognitive 38): cmd.writeStatusesAtInterval has cognitive complexity 38 (threshold 15). Drivers by points: if/else 30, loops 4, boolean chains 2, match/switch 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/status.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"159f3d6eaec8c6e5b17bfffb481014783f353b8b78bca1cbfef2ee4c9ecd8d57"}},{"ruleId":"D2","level":"warning","message":{"text":"update.GHReleases (cognitive 38): update.GHReleases 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":"hack/update/github.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fadce05d372d4e7d47d9bd9e11d733d882f51193470488078919e0c6e6b99ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Bootstrapper.restartPrimaryControlPlane (cognitive 37): Bootstrapper.restartPrimaryControlPlane has cognitive complexity 37 (threshold 15). Drivers by points: if/else 32, loops 3, boolean chains 2 (nesting depth added 8). Of this number, 29 points are the body\u0027s own statements and 8 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/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f290eab88504d02de6e3109a6a8083b882126f4a54e33c0249bb19b64db73b4"}},{"ruleId":"D2","level":"warning","message":{"text":"cluster.HostIP (cognitive 37): cluster.HostIP has cognitive complexity 37 (threshold 15). Drivers by points: if/else 34, loops 2, match/switch 1 (nesting depth added 19). 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/minikube/cluster/ip.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c5362dd904c428c39e132932f15f7e5616581a076484084914ea796e584c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.ListImages (cognitive 35): machine.ListImages has cognitive complexity 35 (threshold 15). Drivers by points: if/else 26, loops 8, 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/minikube/machine/cache_images.go"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3272e315682a02844a3ff9909c2e0711eaf62c1a8f571537698562378eda06"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.validateKubernetesVersion (cognitive 34): cmd.validateKubernetesVersion has cognitive complexity 34 (threshold 15). Drivers by points: if/else 31, boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/start.go"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"d962ce52fb1d1a1f2755e7db628c40ebc2f4560d8e9f6bc9c1853b10d75aa049"}},{"ruleId":"D2","level":"warning","message":{"text":"addons.addonSpecificChecks (cognitive 34): addons.addonSpecificChecks has cognitive complexity 34 (threshold 15). Drivers by points: if/else 27, boolean chains 7 (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/addons/addons.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cae241d8c85d51c800da26b4fc17acc59a79d82cf1a7c0523ef3c33df52cd9"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.Start (cognitive 34): Driver.Start has cognitive complexity 34 (threshold 15). Drivers by points: if/else 31, match/switch 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/qemu/qemu.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"beef6762bc778f86063ce81090dda2fc17659c18025ecda1feb7ad6580041e35"}},{"ruleId":"D2","level":"warning","message":{"text":"host.MigrateHost (cognitive 34): host.MigrateHost has cognitive complexity 34 (threshold 15). Drivers by points: if/else 29, match/switch 3, loops 2 (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/libmachine/host/migrate.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5cb50638a42dcbc2f3f64d2353e7f021d04c44bf89098bf7db918afe2c7bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrapper.SetupCerts (cognitive 34): bootstrapper.SetupCerts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 26, loops 7, boolean chains 1 (nesting depth added 13). 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/minikube/bootstrapper/certs.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c8fba82f9f843c05a34f8580edeef99d0a0c4a4ced56a34cc4bcf1e662341d"}},{"ruleId":"D2","level":"warning","message":{"text":"download.ImageToCache (cognitive 34): download.ImageToCache has cognitive complexity 34 (threshold 15). Drivers by points: if/else 30, match/switch 2, boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/download/image.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1c41135f073d48af2ee823cfd043113cc961ee1450f27263ad35a625c3dfc8"}},{"ruleId":"D2","level":"warning","message":{"text":"mustload.running (cognitive 34): mustload.running has cognitive complexity 34 (threshold 15). Drivers by points: if/else 33, 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/minikube/mustload/mustload.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fb515db1772e9bb660359479664b20dcbe472ebfd81fbb7b460352fad26f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.generateNewConfigFromFlags (cognitive 33): cmd.generateNewConfigFromFlags has cognitive complexity 33 (threshold 15). Drivers by points: if/else 29, 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":"cmd/minikube/cmd/start_flags.go"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3038c70c3f629df99618ba7821434187f70b17f37b9aae25f86a90979c215cb"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.validateInsecureRegistry (cognitive 32): cmd.validateInsecureRegistry has cognitive complexity 32 (threshold 15). Drivers by points: if/else 26, boolean chains 4, loops 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":"cmd/minikube/cmd/start.go"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0311ee4ac2ad82a55ce9ad841e623757a58054bde2098e4c767e8077063c86"}},{"ruleId":"D2","level":"warning","message":{"text":"main.execute (cognitive 32): main.execute has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22, loops 6, match/switch 3, 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":"hack/benchmark/cpu_usage/auto_pause/chart.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5b7287790be24fba56874e69ac585e019ce7a1abf2d89ec3873cd609c3d6d6"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.provisionWithDriver (cognitive 31): cmd.provisionWithDriver has cognitive complexity 31 (threshold 15). Drivers by points: if/else 24, boolean chains 7 (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":"cmd/minikube/cmd/start.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f139d005569f62c372372d5401fed15fe09adcbeda7315ea87d9582f7e17d83f"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.Start (cognitive 31): Driver.Start has cognitive complexity 31 (threshold 15). Drivers by points: if/else 28, boolean chains 2, 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/drivers/virtualbox/virtualbox.go"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f848487cda600e75c32eb19f0b5c4f84cebda9aa3ae1d4d0aee1058007c2d63"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrapper.generateProfileCerts (cognitive 31): bootstrapper.generateProfileCerts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 27, 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/minikube/bootstrapper/certs.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d9f48f0362c5c45de968a594245793475c47a267f06db7d50dc633bfbd13ee"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.DoLoadImages (cognitive 31): machine.DoLoadImages has cognitive complexity 31 (threshold 15). Drivers by points: if/else 28, loops 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/machine/cache_images.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9412e18a6cfabcfb313b87866d372de145537b2a180f2e189273b6682e0f30"}},{"ruleId":"D2","level":"warning","message":{"text":"node.beginDownloadKicBaseImage (cognitive 31): node.beginDownloadKicBaseImage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 24, boolean chains 5, loops 2 (nesting depth added 10). Most of this is not in the body itself: 0 of the 31 points are its own statements and the rest belongs to one function literal inside it that branches (line 138). 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/minikube/node/cache.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f2f106a94c11aea3df5288746b88edd7a1287a532b963f85e19ba529e0e408"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.Create (cognitive 30): Driver.Create has cognitive complexity 30 (threshold 15). Drivers by points: if/else 28, boolean chains 2 (nesting depth added 6). Of this number, 25 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/drivers/kic/kic.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d226f453f050fe0d291662f66455aa707afdd400ec05297b3c4499499faf479"}},{"ruleId":"D2","level":"warning","message":{"text":"CRIO.Preload (cognitive 30): CRIO.Preload has cognitive complexity 30 (threshold 15). Drivers by points: if/else 26, loops 4 (nesting depth added 10). Of this number, 29 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/minikube/cruntime/crio.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6f820c0453152f3435c9d5aa87cf74ce2d57495fbec41c4b33af57bf24c76d"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.CreateVM (cognitive 29): Driver.CreateVM has cognitive complexity 29 (threshold 15). Drivers by points: if/else 28, boolean chains 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/drivers/virtualbox/virtualbox.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7f2de5467c6609f42af9d553ad1ee753197470f184efacb151c4dcda96e865"}},{"ruleId":"D2","level":"warning","message":{"text":"cert.BootstrapCertificates (cognitive 29): cert.BootstrapCertificates has cognitive complexity 29 (threshold 15). Drivers by points: if/else 29 (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/libmachine/cert/bootstrap.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd93d0949e0b7b8469f55bd5bcc797539ea282ea5ad15c5de27746b981711bfc"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrapper.collectCACerts (cognitive 29): bootstrapper.collectCACerts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24, loops 4, boolean chains 1 (nesting depth added 15). Most of this is not in the body itself: 8 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 461). 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/minikube/bootstrapper/certs.go"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"c172a8e2aba8a45e9ee3ed564d5a600fe72b08ce4529fc42a009a18bc6cc47fe"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.DoSaveImages (cognitive 29): machine.DoSaveImages has cognitive complexity 29 (threshold 15). Drivers by points: if/else 26, loops 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/machine/cache_images.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d23f52bd3d43fe4ec94a3700af8be2e9ce93db1a05f7bcb4f28135769328a0"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.updateExistingConfigFromFlags (cognitive 28): cmd.updateExistingConfigFromFlags has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19, boolean chains 9 (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":"cmd/minikube/cmd/start_flags.go"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"3207a96fb96abe66e6434a7d7146917400d68c134117559f331a3b8215cf93d9"}},{"ruleId":"D2","level":"warning","message":{"text":"oci.RoutableHostIPFromInside (cognitive 28): oci.RoutableHostIPFromInside has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21, match/switch 3, boolean chains 2, loops 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/drivers/kic/oci/network.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfabd9023a2dd7219af73c217beacf2f659f9f0b904e9daf9d76a8b46d8e11f"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.dockerSetScript (cognitive 27): cmd.dockerSetScript has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22, loops 3, match/switch 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/docker-env.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d278b0136b241761f408e4fa309ffc3befb743104edb7b4389569bca1dcb3350"}},{"ruleId":"D2","level":"warning","message":{"text":"oci.runCmd (cognitive 27): oci.runCmd has cognitive complexity 27 (threshold 15). Drivers by points: if/else 25, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/kic/oci/cli_runner.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"53154066673f67283401cb066b941d3fb19cb1009f97b2f774a637e1252fd4e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.Create (cognitive 27): Driver.Create has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22, loops 4, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/qemu/qemu.go"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8f19cd7085553532435d2b9999b7610a1e096841d343438073f0ebd5c30086"}},{"ruleId":"D2","level":"warning","message":{"text":"assets.GenerateTemplateData (cognitive 27): assets.GenerateTemplateData has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, boolean chains 3, 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/minikube/assets/addons.go"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a13ca49980eec8f922080456170a7d4080ea5453110889dd908fb53765c521"}},{"ruleId":"D2","level":"warning","message":{"text":"bsutil.GenerateKubeadmYAML (cognitive 27): bsutil.GenerateKubeadmYAML has cognitive complexity 27 (threshold 15). Drivers by points: if/else 25, boolean chains 2 (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/minikube/bootstrapper/bsutil/kubeadm.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f4ebebb22e1bcbedcc869438bfd93b5b6657e19d8229b5d8e6d537eb1475b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Bootstrapper.UpdateNode (cognitive 27): Bootstrapper.UpdateNode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 26, 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/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a35f2426ab1cc6ccb9d2d5eac7b163c157610ae94d0aca5591c107eb79c2d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Docker.Enable (cognitive 27): Docker.Enable has cognitive complexity 27 (threshold 15). Drivers by points: if/else 27 (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/minikube/cruntime/docker.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2a55e0bcdf257a376fe0eef57e49de0c23d3c5f61617fca9751095d6c1b210"}},{"ruleId":"D2","level":"warning","message":{"text":"main.readData (cognitive 27): main.readData has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, loops 3, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hack/jenkins/test-flake-chart/compute_flake_rate.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1868ca9597590e89c7a8c8a3571b782eea3c69cf6ab0ec05612213234b8d4ef4"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.validateCPUCount (cognitive 26): cmd.validateCPUCount has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, boolean chains 3, match/switch 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":"cmd/minikube/cmd/start.go"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e86c88f80b6d0c257b475d359a37561edf79d9dc98fa5d742bc5990573a5c43"}},{"ruleId":"D2","level":"warning","message":{"text":"addons.enableOrDisableAddonInternal (cognitive 26): addons.enableOrDisableAddonInternal has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25, loops 1 (nesting depth added 12). Of this number, 22 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/addons/addons.go"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbf35b9b2761d59ee7cf1fde312d37fcd13b67b22c937c752dc8ef0eabf7fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"addons.patchServiceAccounts (cognitive 26): addons.patchServiceAccounts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, loops 8 (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/addons/addons_gcpauth.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5434f24312d677dfd5ceeac6838f4f930957d530bc285c3d3628272764c9ddac"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.createNetwork (cognitive 26): Driver.createNetwork has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25, loops 1 (nesting depth added 8). Of this number, 25 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/drivers/kvm/network.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"802ba2c55dec58280f9137da39adf2d30677074309065c87d8bdf2821d81daab"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.dockerUnsetScript (cognitive 25): cmd.dockerUnsetScript has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, loops 3, match/switch 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/docker-env.go"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2adf32815ef057c25d1a49a4acb8dea3c0831ffaa83d788ac20adb923fb4184"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.validateRequestedMemorySize (cognitive 25): cmd.validateRequestedMemorySize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 22, boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/start.go"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"542f0d557e422e778b20a1de8cf5a95899938c6e9d71cf96d7e05dde159863ae"}},{"ruleId":"D2","level":"warning","message":{"text":"addons.refreshExistingPods (cognitive 25): addons.refreshExistingPods has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, loops 6 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/addons/addons_gcpauth.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d271b5bcc8f546c00c14fc17bf667bf591fb38207e35622779a48c0d7ebba0"}},{"ruleId":"D2","level":"warning","message":{"text":"addons.disableAddonGCPAuth (cognitive 25): addons.disableAddonGCPAuth has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, loops 6 (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/addons/addons_gcpauth.go"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"df308dbd16b39c663fcffe74b4381141fef62caebe5cda317d427c60dba6457a"}},{"ruleId":"D2","level":"warning","message":{"text":"cruntime.generateContainerdConfig (cognitive 25): cruntime.generateContainerdConfig has cognitive complexity 25 (threshold 15). Drivers by points: if/else 23, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/cruntime/containerd.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"256f6ebf93cf5c20008ec6a5786809fc8b36222a42392d043e9fb47a7c503850"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.runDelete (cognitive 24): cmd.runDelete has cognitive complexity 24 (threshold 15). Drivers by points: if/else 21, loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/delete.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a9252eceec94a412e8f30c133a7fbd768194fdadf93d5072840db8843fc876"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.Execute (cognitive 24): cmd.Execute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, boolean chains 2, 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":"cmd/minikube/cmd/root.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c65e9293949d23c00fa31b4e5a06e2278e9f93ebede0ca4ff012e4bdcc81e77"}},{"ruleId":"D2","level":"warning","message":{"text":"kubeadm.adviseNodePressure (cognitive 24): kubeadm.adviseNodePressure has cognitive complexity 24 (threshold 15). Drivers by points: if/else 22, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ff4f32c655b24f5e0105a7dc0f363956d2e302367b747f31d4b26d16589347"}},{"ruleId":"D2","level":"warning","message":{"text":"kicRunner.Copy (cognitive 24): kicRunner.Copy has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, 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/minikube/command/kic_runner.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"727ad002af0a4156cb9583d85c8527f0b2d5201a76a044543c9e88a0723892c1"}},{"ruleId":"D2","level":"warning","message":{"text":"hyperv.chooseSwitch (cognitive 24): hyperv.chooseSwitch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, loops 7, 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/minikube/registry/drvs/hyperv/vswitch.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40363dc7be3acc918461c2898175e1a78c260bc0b702b42cda79ac67ae0c104"}},{"ruleId":"D2","level":"warning","message":{"text":"main.readInLatestTestResult (cognitive 24): main.readInLatestTestResult has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, loops 5 (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":"hack/benchmark/image-build/generate-chart.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b51fed81038f3039eac2621c52c63409a711277d59c7e52b43cbd64707c511"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 24): main.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 22, boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hack/update/update_all/update_all.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0ce741b9aa3fda4bfc645f18afd4933e487481db5d116af233ed14f5608b26"}},{"ruleId":"D2","level":"warning","message":{"text":"main.generateCommentMessage (cognitive 24): main.generateCommentMessage has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, 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":"hack/jenkins/test-flake-chart/report_flakes/report_flake.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc3b291d6fa4ffb337fd909619b9cbdd79b83200ed040eebb5fe05e83dc57b5"}},{"ruleId":"D2","level":"warning","message":{"text":"config.processRegistryCredsConfig (cognitive 23): config.processRegistryCredsConfig has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, match/switch 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":"cmd/minikube/cmd/config/configure_registry_creds.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d427cc939d8ef90adbf789e0e01926c2d47ffa2cb7e34bde38937c19847cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"config.profilesToTableData (cognitive 23): config.profilesToTableData has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, loops 7, match/switch 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/config/profile_list.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"28595e634a3ddb50851c51b8a4ebc143056d3f79c80edc5ced9bb29f8e29c9dd"}},{"ruleId":"D2","level":"warning","message":{"text":"cluster.NodeStatus (cognitive 23): cluster.NodeStatus has cognitive complexity 23 (threshold 15). Drivers by points: if/else 21, 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/minikube/cluster/status.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b3f56990bfabb67781e87ed96275bece47e64bd8479de0c04cd31f98766414"}},{"ruleId":"D2","level":"warning","message":{"text":"main.processCommitFolder (cognitive 23): main.processCommitFolder has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, boolean chains 2, loops 2 (nesting depth added 8). 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":"hack/legacy_fill_db/filldb.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"248f8af19176bfd72c51c931fde756446d8015c7b45b6dbcbd9a4c5ab16261a9"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.deleteProfile (cognitive 22): cmd.deleteProfile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, boolean chains 3, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/delete.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fb2173f36d9cb0c6c600311278f1d1bb2ddda143c90d5487c6cf8be86e8d58"}},{"ruleId":"D2","level":"warning","message":{"text":"X509CertGenerator.GenerateCert (cognitive 22): X509CertGenerator.GenerateCert has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, loops 2, boolean chains 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/libmachine/cert/cert.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9932cd7bb7dab556c1fdbc6b71e5660dea150e3fc1e93b8ab15d4e997d6dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"bsutil.extraKubeletOpts (cognitive 22): bsutil.extraKubeletOpts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, boolean chains 3, loops 2 (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/minikube/bootstrapper/bsutil/kubelet.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"18becd269a861e2f384747e08942ce6905a5f6a102f01ca092d4a1311e79b621"}},{"ruleId":"D2","level":"warning","message":{"text":"Bootstrapper.init (cognitive 22): Bootstrapper.init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, boolean chains 2 (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 3 belong to 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"08269ad77a6bd0d90df9c70f41a77bfbe93efc15d594692ac2d8306221209fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"persistentRegistry.Register (cognitive 22): persistentRegistry.Register has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, boolean chains 2, loops 1 (nesting depth added 6). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/tunnel/registry.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22754ed65f7fa6c3eef38fc2fc75bda9b89c6a6c8ad0140c6046af1e3f15b92"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.appendKnownHelper (cognitive 21): cmd.appendKnownHelper has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21 (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":"cmd/minikube/cmd/ssh-host.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c089c0fa732b752c38a25bb2f09653c7abd73db4448dcc251b25d423943fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.Create (cognitive 21): Driver.Create has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/hyperv/hyperv.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"951bffb88debcea61c082c2636751bc12475ec295978175a9ad543b6a7aa046d"}},{"ruleId":"D2","level":"warning","message":{"text":"virtualbox.listHostInterfaces (cognitive 21): virtualbox.listHostInterfaces has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9, match/switch 6, loops 5, 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/drivers/virtualbox/network.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c849aa2ca819991510ab3078c09f2639ba1f7f048bc9c84e7857c46a482f709"}},{"ruleId":"D2","level":"warning","message":{"text":"provision.configureSwarm (cognitive 21): provision.configureSwarm has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, 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/libmachine/provision/configure_swarm.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0099653ed0eb1709cc70afd427c35b967fccfdd3f24a1ab0447c02569a5e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"provision.ConfigureAuth (cognitive 21): provision.ConfigureAuth has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21 (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/libmachine/provision/utils.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"574c1d35a8e48967af85c6436c2707b7715ef4be8fb02cfc2225d0935ef4a704"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.extractAdvice (cognitive 21): extract.extractAdvice has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, loops 3 (nesting depth added 12). 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 534). 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/minikube/extract/extract.go"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdabb315276b10164260e6bfa8452d14bcc7cc5d5aa10d3290fb36ee906b0503"}},{"ruleId":"D2","level":"warning","message":{"text":"resultManager.summarizeResults (cognitive 21): resultManager.summarizeResults has cognitive complexity 21 (threshold 15). Drivers by points: loops 12, if/else 9 (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/minikube/perf/result_manager.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"096bf879296f078177dcc5af0eac8871d84ca7a4dcb3360f635924e968548f06"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 21): main.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, 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":"hack/update/kubeadm_constants/kubeadm_constants.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"422d83bbbf383664c4bd4d7a6999bebd9a62f707fc3568dc57e1d807b292ab15"}},{"ruleId":"D2","level":"warning","message":{"text":"oci.DaemonHost (cognitive 20): oci.DaemonHost has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20 (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/drivers/kic/oci/oci.go"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae780d4a7ce3f9684443b363d3cfac7760f22852d3fae5a566666aafd425905c"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.Create (cognitive 20): Driver.Create has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, loops 1 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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/drivers/kvm/kvm.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"72032e7fc80e9845c769698cdfcdac4c32e29eab952f153e6c24a903cdf1886f"}},{"ruleId":"D2","level":"warning","message":{"text":"virtualbox.parseHostOnlyNet (cognitive 20): virtualbox.parseHostOnlyNet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 2, boolean chains 1, loops 1 (nesting depth added 8). Of this number, 15 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/drivers/virtualbox/virtualbox.go"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e974952c0db026aa965af643608770153b7aeef841bed4bdd5077534a638c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.getIPfromVmnetConfigurationFile (cognitive 20): Driver.getIPfromVmnetConfigurationFile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/vmware/driver.go"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d553b943a5252a5251b17d01f49ab34eae84b293ae20897dccc7b89acb7f0ac4"}},{"ruleId":"D2","level":"warning","message":{"text":"driver.Suggest (cognitive 20): driver.Suggest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, 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/minikube/driver/driver.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f989ec8a80610a2711cebf9671ddd58c9b1838772183eb89a69764664075bce"}},{"ruleId":"D2","level":"warning","message":{"text":"image.retrieveImage (cognitive 20): image.retrieveImage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/image/image.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96d0c484051775dbc5bf034128f64097918c02cac17df71ac1a886201a36ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"proxy.SetDockerEnv (cognitive 20): proxy.SetDockerEnv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, boolean chains 2, loops 1 (nesting depth added 12). Of this number, 19 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/minikube/proxy/proxy.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93ccea645c6d092c75b64e0b887e1222f3a015812f1e739010c586b18ccc344"}},{"ruleId":"D2","level":"warning","message":{"text":"virtualbox.status (cognitive 20): virtualbox.status has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, 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/minikube/registry/drvs/virtualbox/virtualbox.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b75213903715409b03bc060db02b86bbc3cf5c33f275aadf11a913e1fcd1f9"}},{"ruleId":"D2","level":"warning","message":{"text":"network.FreeSubnet (cognitive 20): network.FreeSubnet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, 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/network/network.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"971091f019019f9c666f5f978078f773a9127fa9846f161fa589af4ddd6711de"}},{"ruleId":"D2","level":"warning","message":{"text":"main.readInLatestBenchmark (cognitive 20): main.readInLatestBenchmark has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 8 (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":"hack/benchmark/time-to-k8s/public-chart/generate-chart.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"422658c8d3cd833f9559a4482740c9575285b31507f5eed08e6d63b5b56f3a44"}},{"ruleId":"D2","level":"warning","message":{"text":"main.createWeeklyChart (cognitive 20): main.createWeeklyChart has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, loops 6, 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":"hack/benchmark/time-to-k8s/public-chart/generate-chart.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5124970019ec421010f6db6b4bb9469c9be56bc53429aa43be908623f620aa5"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 20): main.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hack/jenkins/test-flake-chart/process_last_90/process_last_90.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"163aa8a0234d6dee97ef363458423b2156bf338b1cfe9f4eed67a6fc4ebf2477"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.startWithDriver (cognitive 19): cmd.startWithDriver has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/start.go"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"7726685a21329464ede2a79e8c0470d0429b3b8938aeb21b59e8a706a5a515bc"}},{"ruleId":"D2","level":"warning","message":{"text":"addons.EnableOrDisableAddon (cognitive 19): addons.EnableOrDisableAddon has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/addons/addons.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4692003a1b11b922b9b8d15cf5e2489a4d8a2f45f9359a6dc0a4901d42c397"}},{"ruleId":"D2","level":"warning","message":{"text":"addons.enableAddonGCPAuth (cognitive 19): addons.enableAddonGCPAuth has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, 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/addons/addons_gcpauth.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bedcc198c1310120516896a061d41f9fe78dc0777fc239b397924db02c0f180"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.parseIPForMACFromIPAddr (cognitive 19): Driver.parseIPForMACFromIPAddr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/virtualbox/virtualbox.go"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"117fe9f8dba906a517a041859ac3e8a2851f967b06cb689562d0d04d0187a72b"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultRPCClientDriverFactory.NewRPCClientDriver (cognitive 19): DefaultRPCClientDriverFactory.NewRPCClientDriver has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, match/switch 2, loops 1 (nesting depth added 7). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 188, 144). 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/libmachine/drivers/rpcdriver/client_driver.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efa2d11b8db8398a97fbc18c090ee346e44a8d4d9bc91901f3db6d7f83c9cae"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.writeStringsToFiles (cognitive 19): extract.writeStringsToFiles has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, loops 2 (nesting depth added 3). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 452). 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/minikube/extract/extract.go"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76b02e44ea5f7ad90ecaaaf0d96d0d8e9d4c6832b6f1731ec52487edc8f6b51"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.PullImages (cognitive 19): machine.PullImages 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/minikube/machine/cache_images.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b44d37dd85c3f836ce392137b2105baa9d1d75738fa80c13dc5a8bb476db8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.RemoveImages (cognitive 19): machine.RemoveImages 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/minikube/machine/cache_images.go"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd7b8f3acc737e76aa6529980a1229492c9cbf19e95012f2a5a508b7745f422"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.TagImage (cognitive 19): machine.TagImage 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/minikube/machine/cache_images.go"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a1024600ab6ea6dcdeefa6fe6340d964b9cc199199956010f3b25e036021c1"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.PushImages (cognitive 19): machine.PushImages 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/minikube/machine/cache_images.go"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b698dad22d68637d5af257b25ceaa9cf427a01ac9344f60e7088fa2971bc62"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.postStartSetup (cognitive 19): machine.postStartSetup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, 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/minikube/machine/start.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a432d03f34fea098b702468a4aac1fe120143f3b8e7466be7a207c6eb5a1f03"}},{"ruleId":"D2","level":"warning","message":{"text":"node.validateNetwork (cognitive 19): node.validateNetwork has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, 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/minikube/node/start.go"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b0a88ba34c991b49b518be87d08cb279c0fc158bf4db35afe625d94332a048"}},{"ruleId":"D2","level":"warning","message":{"text":"main.execute (cognitive 19): main.execute has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 3, match/switch 3, boolean chains 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":"hack/benchmark/cpu_usage/idle_only/chart.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a0d5813b5f0353afecc6ef2203628bbea0a2d4540739220a92dbcb3bbd2320"}},{"ruleId":"D2","level":"warning","message":{"text":"update.fsUpdate (cognitive 19): update.fsUpdate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, 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":"hack/update/filesystem.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3e2b23305db827a7fdf02eca54dd5e193789800d3c04323d49fe309004beda"}},{"ruleId":"D2","level":"warning","message":{"text":"main.LatestControllerTag (cognitive 19): main.LatestControllerTag 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":"hack/update/ingress_version/ingress_version.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff0512f8d1c31937b9cc4c51daa33e06d277db1d7215e81b8d337d0c3b2ceb3"}},{"ruleId":"D2","level":"warning","message":{"text":"dhcp.parseLeases (cognitive 18): dhcp.parseLeases has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, match/switch 5, 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/drivers/common/dhcp/lease.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"43695d53b6f5b2a4caf8c3301567c4478b3ca0536fbe698abad9d46d1f89575c"}},{"ruleId":"D2","level":"warning","message":{"text":"oci.ForwardedPort (cognitive 18): oci.ForwardedPort has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, 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/drivers/kic/oci/network.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75426cff98615ca504f7afe547684f65d8e41e6a8b05486f03b4effe47f1333"}},{"ruleId":"D2","level":"warning","message":{"text":"kvm.getPassthroughableNVIDIADevices (cognitive 18): kvm.getPassthroughableNVIDIADevices has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, 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/drivers/kvm/gpu.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b756abf03f037cb52192fcdabe34fd1e1d16f7e820623ce53287c4282b4ed10f"}},{"ruleId":"D2","level":"warning","message":{"text":"ssh.NewExternalClient (cognitive 18): ssh.NewExternalClient has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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/libmachine/ssh/client.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c1629b5abc1c2b97e02f1963ac93629d6416bec75d0dcb3ae827eeda6ae080"}},{"ruleId":"D2","level":"warning","message":{"text":"assets.SelectAndPersistImages (cognitive 18): assets.SelectAndPersistImages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, 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/minikube/assets/addons.go"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3a7f5a8e81f0ea28a298b45890e7f51aaf0c91803f80808c5f1ce1a3b5956d"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.checkIdentForStringValue (cognitive 18): extract.checkIdentForStringValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, 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/minikube/extract/extract.go"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1d04ea93416409868060cdaf246349cb17ddc55715c065880daa1dbce8b596"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.checkKeyValueExpression (cognitive 18): extract.checkKeyValueExpression has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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/minikube/extract/extract.go"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ae3dcb11d8679957c93c1dd7b9469b4149fdf56bf5e398e5d7778005739b15"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.checkBinaryExpression (cognitive 18): extract.checkBinaryExpression has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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/minikube/extract/extract.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"9981cafbe38ffb9fa0590096ee184255f14506c84ca9596efd56aac1a1badbdf"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.mergeImageLists (cognitive 18): machine.mergeImageLists has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 7 (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/minikube/machine/cache_images.go"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fa93de8ec3be3492a425b856a0425d46694423418a5f222f9bbba67810aa2e"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.recreateIfNeeded (cognitive 18): machine.recreateIfNeeded has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/machine/fix.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"630b59d042656c15b7e9da6d85e4f31ddd5de67ca0d03a6d2fc8c7e33e418195"}},{"ruleId":"D2","level":"warning","message":{"text":"node.teardown (cognitive 18): node.teardown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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/minikube/node/node.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c8320ed11dacaf97d104d7679862c2fbe0d657be29ca6dc19483796cde1ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"service.printURLsForService (cognitive 18): service.printURLsForService has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 6, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/service/service.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe488f3043ad3f3beea50292dba50af2cd9c554fb8e27b0054e08c8a196e70a"}},{"ruleId":"D2","level":"warning","message":{"text":"tunnel.setupRoute (cognitive 18): tunnel.setupRoute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/tunnel/tunnel.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd5ba1870bb13ad7c351f861d60068d893753cceb3a8c905d7ed3a76ca20e38"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.interpretWaitFlag (cognitive 17): cmd.interpretWaitFlag has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, loops 3, 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":"cmd/minikube/cmd/start_flags.go"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"1415af0b87b1d47aa2636b2b90e38d2eb4a9719cd53dc376818b0334a04fe514"}},{"ruleId":"D2","level":"warning","message":{"text":"main.setFlags (cognitive 17): main.setFlags has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/main.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"231b97addb41d20b9d283fa4c341df5688c7ed2fd1365be72a188742309b5bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"addons.enableOrDisableStorageClasses (cognitive 17): addons.enableOrDisableStorageClasses has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, boolean chains 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/addons/addons_storage_classes.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6c2c7304617196f9ba3960472e3bf36313623c0610483e404077c2ee8e0130"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.Stop (cognitive 17): Driver.Stop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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/drivers/kic/kic.go"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"343d2450bb621c2a960016ede4c5dfe6e6e158ff0fd0796a2535b009c159b826"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeClient.Shell (cognitive 17): NativeClient.Shell has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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/libmachine/ssh/client.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09242c62d5b0e5a8b7e3a7c9050af30e411cec81b3959d1840b68f04c0a7cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"cluster.getIPForInterface (cognitive 17): cluster.getIPForInterface has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, 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/minikube/cluster/ip.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b47b6366eac80cfaf1dd0273fe17addb91b24a3cd43d4b2140f73c12045cb98"}},{"ruleId":"D2","level":"warning","message":{"text":"SSHRunner.Copy (cognitive 17): SSHRunner.Copy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (nesting depth added 3). Of this number, 11 points are the body\u0027s own statements and 6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/command/ssh_runner.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e11a8b9be95bd290ab19636b2c770e2e39ea6b44941abec17a486b327a4aba5"}},{"ruleId":"D2","level":"warning","message":{"text":"cruntime.containerdImagesPreloaded (cognitive 17): cruntime.containerdImagesPreloaded has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, 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/minikube/cruntime/containerd.go"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96ad4ac3cb5d9c8af9a82968a41a074a1d727eaa3e9a033c63bc4d6c20c1479"}},{"ruleId":"D2","level":"warning","message":{"text":"cruntime.listCRIContainers (cognitive 17): cruntime.listCRIContainers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 2, loops 2 (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/minikube/cruntime/cri.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d245ea1eba056f8403ed7528fd85df2330921d429eac1bb87c0505cd3d672aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"cruntime.crioImagesPreloaded (cognitive 17): cruntime.crioImagesPreloaded has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, 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/minikube/cruntime/crio.go"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db5768672197b1044f70dd324ab3280273f29478f86e80fdcd446361b5a64fa"}},{"ruleId":"D2","level":"warning","message":{"text":"download.PreloadExists (cognitive 17): download.PreloadExists has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 3, 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/minikube/download/preload.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c557dd18c2aa86147fa6530d386931a3e654c08e4dbdfe2267f74b89d9556f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"download.Preload (cognitive 17): download.Preload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 2 (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/minikube/download/preload.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ede739fc9ff051bbaecd5bafc8357d4108543eaddbb61c528c9a1e81046e0c7"}},{"ruleId":"D2","level":"warning","message":{"text":"machine.MaybeDisplayAdvice (cognitive 17): machine.MaybeDisplayAdvice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/machine/advice.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2db8ca4ea12dbac6df270d8b3d7ccfdd80a0715fea8460a2fe9fdd88f8dadb"}},{"ruleId":"D2","level":"warning","message":{"text":"SSHTunnel.Start (cognitive 17): SSHTunnel.Start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, loops 5, 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/minikube/tunnel/kic/ssh_tunnel.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e053e992ed6702b6a47b9219787e9702f89adba7e22299d1c806939405609a8"}},{"ruleId":"D2","level":"warning","message":{"text":"osRouter.padCIDR (cognitive 17): osRouter.padCIDR has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, loops 7 (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/minikube/tunnel/route_darwin.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cc7595230e6780c6c90c16cb7615115e7fb470c3a7d22e575e9bdd1a7479a2"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.maybeDeleteAndRetry (cognitive 16): cmd.maybeDeleteAndRetry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/start.go"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"190abb5a2cc8d50f9f88c4bec3d1a50f3b252b05b2c5766613639c8d093a9b5b"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.selectImageRepository (cognitive 16): cmd.selectImageRepository has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, loops 5, 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":"cmd/minikube/cmd/start.go"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b768d6fda650b7371b0b566f45f0c344fb01dcf2f2add1c68ca37c30b8e1b50"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.checkDomains (cognitive 16): Driver.checkDomains has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, 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/drivers/kvm/network.go"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"722587efce38012742671f3305094e0a30df945d81970f4f588affd7d5c73f45"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver.generateDiskImage (cognitive 16): Driver.generateDiskImage 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/drivers/vmware/driver.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32d6093943c3a6167c745b1482946aa7dd28e0e276501f68671d824851eafb6"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrapper.installCertSymlinks (cognitive 16): bootstrapper.installCertSymlinks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/bootstrapper/certs.go"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f3a69e5d98cdd185b749cc163a5cc55750d878441b593bb5cd51761232b010"}},{"ruleId":"D2","level":"warning","message":{"text":"kverify.NodePressure (cognitive 16): kverify.NodePressure 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/minikube/bootstrapper/bsutil/kverify/node_conditions.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52e2fbcd10f379e0d41cd4c7003903e5b45b94b89c08e47853997b6d72c33b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Containerd.BuildImage (cognitive 16): Containerd.BuildImage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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/minikube/cruntime/containerd.go"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97acda07fed3bfebf52d19ca5376a90251ed97bdfb8ead83d22387075b7b67e"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.checkCallExpression (cognitive 16): extract.checkCallExpression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 4, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/extract/extract.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b134642e3f1488fad4788e1e10fb794828494da5542f85a416f142eb8157776"}},{"ruleId":"D2","level":"warning","message":{"text":"mustload.Healthy (cognitive 16): mustload.Healthy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/mustload/mustload.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a814b5ff3cc899cc9439e2327b3cfaa4cd41da2d66c8c532752c658ffeaea4"}},{"ruleId":"D2","level":"warning","message":{"text":"perf.collectResults (cognitive 16): perf.collectResults has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, 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/minikube/perf/start.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"715797805bad1d01e76cf7797b7d9a0c68345cb4333c861a77538ce670b84bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"podman.status (cognitive 16): podman.status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/registry/drvs/podman/podman.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad64988c9aecb7c924bd52258fed8b652158c209e4a4a88c2e503de4f0aa602"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/start.go: FileTooLong \u2014 1251 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/minikube/cmd/start.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df668b5b8c9bcc6657ae167bdcbf82e59261394ecde1acce5a83c45c116a81d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: assets/addons.go: FileTooLong \u2014 879 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: Addons (115-824). Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/assets/addons.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"712cde84f1dca87cf33a30274a836211c53c7024d0f504db3aef9a23a4ac89c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: virtualbox/virtualbox.go: FileTooLong \u2014 836 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/drivers/virtualbox/virtualbox.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0317fbb2c85a06541c3cfd9ec89da8dee08ab52340a829a6439d1d860145da13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reason/known_issues.go: FileTooLong \u2014 834 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/minikube/reason/known_issues.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"037d89d6c73e78f1232746acf6080ae0bcf89ddc1c69dbb91ec91d45c90b133a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/start_flags.go: FileTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: initKubernetesFlags (226-1178). Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/start_flags.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1865abc89302d548c955ede8ac4d184a12d28cfb6a57398476fb5d46d6d1ca8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Driver: TooManyMethods \u2014 43 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/vfkit/vfkit.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"282a0b44dee889bf1d10af305a3341744fe7789e2c0b0a844e46b7f1c02a6aa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kubeadm/kubeadm.go: FileTooLong \u2014 709 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/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3181fbad85ecaca8ed389a492be4b96f1c169919850e0d4b510c9903ff47ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: test-flake-chart/flake_chart.js: FileTooLong \u2014 614 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). 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":"hack/jenkins/test-flake-chart/flake_chart.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eb3d451a19c4d733772532e59d2b60e1e82f8a7b598642cf2643790c8a4296"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: machine/cache_images.go: FileTooLong \u2014 597 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/minikube/machine/cache_images.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"171553209a6c009f7e639130c03f0fc490358b0749155a9c98b684913fa1c436"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Driver: TooManyMethods \u2014 35 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/krunkit/krunkit.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"852ae74f0edee0443a5f010829f8b598606056b796e58ca690e97f0382008c5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: qemu/qemu.go: FileTooLong \u2014 548 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/drivers/qemu/qemu.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5281796bde79a9b8de86bf6655a77d391808659ddb173ad640066d0f155162e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node/start.go: FileTooLong \u2014 543 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/minikube/node/start.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d78f5f5ad7db8fe7f6bced7aff61063fb108cf0d85d446ff4e69637ff31b77c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Docker: TooManyMethods \u2014 31 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/cruntime/docker.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b42cc669cd2ecf2416e5a03f9d5a5819dfd1e3de2dad1bc4bfc4773ea74a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): pkg/minikube/cruntime/containerd.go:610-629 | pkg/minikube/cruntime/crio.go:536-555 \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/minikube/cruntime/containerd.go:610\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/minikube/cruntime/containerd.go"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"2812c4ab5b22b5398ce8f009d60780f7705b96d48af7a0800b4a8facb9d844c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): cmd/minikube/cmd/docker-env.go:487-503 | cmd/minikube/cmd/docker-env.go:533-549 \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/minikube/cmd/docker-env.go:487\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/minikube/cmd/docker-env.go"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"5658ab442521a4c1fb583c600da1d7eaf66aea2b5c8433df026a694c6511b689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): pkg/libmachine/provision/debian.go:135-151 | pkg/libmachine/provision/ubuntu.go:129-145 \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/libmachine/provision/debian.go:135\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/libmachine/provision/debian.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8a98c2c15fbee8c957918a3f8f325209f82333ffbe630081ebf0515a710676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): pkg/libmachine/provision/generic.go:134-150 | pkg/libmachine/provision/systemd.go:76-92 \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/libmachine/provision/generic.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. 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/libmachine/provision/generic.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe56c95aa848b2d960a93d8c48244f59699fcd615d98f94771e1f33475c2852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pkg/provision/buildroot.go:133-148 | pkg/provision/ubuntu.go:149-164 \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/provision/buildroot.go:133\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/provision/buildroot.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"319601702760fa3f04fc6b3fc20bd214b0187009554ed5ba4e3a97dc6d8bf524"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/libmachine/cert/cert.go:296-310 | pkg/minikube/machine/client.go:312-326 \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/libmachine/cert/cert.go:296\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/libmachine/cert/cert.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43199b8d50f477427ba82217a0b03200a8efebc3fc8da89f009384a066a872a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): pkg/minikube/machine/cache_images.go:551-564 | pkg/minikube/machine/cache_images.go:631-644 | pkg/minikube/machine/cache_images.go:687-700 | pkg/minikube/machine/cache_images.go:859-872 | pkg/minikube/machine/cache_images.go:939-952 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/minikube/machine/cache_images.go:551\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/minikube/machine/cache_images.go"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0b095b5188503c35dc60d0223006a5ae4263bdba09b4ee00eded67146d17d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): pkg/libmachine/provision/boot2docker.go:190-203 | pkg/libmachine/provision/generic.go:134-147 | pkg/libmachine/provision/systemd.go:76-89 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/libmachine/provision/boot2docker.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f872dede9985b9935aadf5441e84fb96a6dec91e844be01a96a9a55c227425a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/drivers/qemu/qemu.go:271-284 | pkg/drivers/vfkit/vfkit.go:207-220 \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/drivers/qemu/qemu.go:271\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/drivers/qemu/qemu.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8467157ebb53292e438afabdee864237eeae3a7f19d0f73ed2cb66df87011e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/libmachine/cert/cert.go:152-166 | pkg/libmachine/cert/cert.go:236-249 \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/libmachine/cert/cert.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"099d2ddf58afe072ea7c7738c478efed6ce2631252ae3d574c6fff394f6d431d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/libmachine/cert/cert.go:167-182 | pkg/libmachine/cert/cert.go:250-263 \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/libmachine/cert/cert.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb788cccb3a58726c7e2458d74399f6d68735bc1c1919bd63fb7f9da1c6604e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/libmachine/provision/utils.go:110-125 | pkg/provision/provision.go:117-130 \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/libmachine/provision/utils.go:110\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/libmachine/provision/utils.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"681f6f653c0b7a6bfcd9abd8c70e3eef003e8f8334e560c97a3e4a9c4f713657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/minikube/registry/drvs/docker/docker.go:67-80 | pkg/minikube/registry/drvs/podman/podman.go:74-87 \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/minikube/registry/drvs/docker/docker.go:67\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/minikube/registry/drvs/docker/docker.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc35769957f76d81e8a17a3fdbf4caef8ad2807340299a240d9bf1c6e19f3a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/minikube/machine/cache_images.go:211-224 | pkg/minikube/machine/cache_images.go:379-392 \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/minikube/machine/cache_images.go:211\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/minikube/machine/cache_images.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e9bc03b269940a7e84ca305f3ebf36a8567645781b20795659ac1d77472a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): hack/jenkins/release_update_releases_json.go:88-101 | hack/jenkins/release_update_releases_json.go:202-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":"hack/jenkins/release_update_releases_json.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd90cb7dd3669ebe8ef9385d537387f574c1e3fec6010a09519115a0c54b3789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): cmd/auto-pause/auto-pause-hook/certs.go:50-62 | cmd/auto-pause/auto-pause-hook/certs.go:88-100 \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/auto-pause/auto-pause-hook/certs.go:50\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/auto-pause/auto-pause-hook/certs.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8554936dfcb2b2a9ac204adb5ba89651b294c27be2de4b5fb8e93bc094442727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/drivers/none/none.go:154-166 | pkg/drivers/ssh/ssh.go:220-232 \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/drivers/none/none.go:154\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/drivers/none/none.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"679b4c964b8dad755c03fcce522d671381d6bb009eedc576a133ac74e5654960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/libmachine/persist/filestore.go:55-67 | pkg/minikube/config/profile.go:156-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/libmachine/persist/filestore.go:55\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/libmachine/persist/filestore.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f085dda44097c155fad98d07e334f029f04f742df7e9b860a5d357f867766f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/provision/buildroot.go:65-77 | pkg/provision/ubuntu.go:66-81 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/provision/buildroot.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24481ac4b1fdacca7c46886b4161e19fbf37d30c72799f77bddb43ae4441eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/provision/buildroot.go:177-189 | pkg/provision/ubuntu.go:193-206 \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/provision/buildroot.go:177\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/provision/buildroot.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2628fcc30093001d0bfe38c69b697c4ab5a93610af69de305523cb85dd231c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): pkg/minikube/machine/build_images.go:103-114 | pkg/minikube/machine/cache_images.go:229-240 | pkg/minikube/machine/cache_images.go:398-409 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/minikube/machine/build_images.go:103\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/minikube/machine/build_images.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"606233c68549e503c60a2fa364e880f292730d2396447edb5a914320dd9df195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cmd/minikube/cmd/podman-env.go:119-130 | pkg/libmachine/host/host.go:93-104 \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/minikube/cmd/podman-env.go:119\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/minikube/cmd/podman-env.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b4a9f03c699467ddf3e61d954ba03bbf6ad62360c9d2c330c9c594d50c699a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/minikube/command/exec_runner.go:77-88 | pkg/minikube/command/ssh_runner.go:224-236 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/command/exec_runner.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa31af47820c8909467e772d1e8b7b3f3826d11d85ce9c27288b369eb9a5aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/minikube/command/fake_runner.go:66-77 | pkg/minikube/command/fake_runner.go:112-123 \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/minikube/command/fake_runner.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. 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/minikube/command/fake_runner.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3680eb09f48ce3e8b1dc5fe271aac0abae064ac13724da10feae2a7a62130998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/minikube/command/ssh_runner.go:358-369 | pkg/minikube/command/ssh_runner.go:417-428 \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. 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/minikube/command/ssh_runner.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1988cc44b77d80f887fc7c09edddcec08de504c6c255f1bbe4d80e4ff978b563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/drivers/krunkit/krunkit.go:136-147 | pkg/drivers/vfkit/vfkit.go:138-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/drivers/krunkit/krunkit.go:136\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/drivers/krunkit/krunkit.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"72108b47955f72adc349bcfb22b3c70f02aedac38ea04b816570d2285573571d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): pkg/drivers/qemu/qemu.go:679-689 | pkg/drivers/vmware/driver.go:235-245 | pkg/drivers/krunkit/krunkit.go:469-479 | pkg/drivers/vfkit/vfkit.go:610-620 \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/drivers/qemu/qemu.go:679\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/drivers/qemu/qemu.go"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c31ad0aa855fd39c7d159697c08aeae49d6f49ddb18cc4fc82fe38bd404be38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): pkg/drivers/kic/oci/cli_runner.go:174-184 | pkg/minikube/command/exec_runner.go:65-75 | pkg/minikube/command/kic_runner.go:103-113 \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/drivers/kic/oci/cli_runner.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"248240e3a17018e451bb1cc315991495b0b321b02ab13d9bf29def75c2d9fc27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): pkg/minikube/cruntime/containerd.go:529-540 | pkg/minikube/cruntime/crio.go:420-431 | pkg/minikube/cruntime/docker.go:613-623 \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/minikube/cruntime/containerd.go:529\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/minikube/cruntime/containerd.go"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79fffc743a5bf736dd51c0a77a10459477225ce42a3360fa4c12a61a4f4093e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): pkg/minikube/cruntime/containerd.go:546-556 | pkg/minikube/cruntime/crio.go:471-481 | pkg/minikube/cruntime/docker.go:634-644 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/minikube/cruntime/containerd.go"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdb978f88bb57f2807827464417e4896b45faace06bdbe10223e77d218faa5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): hack/prow/minitest/tester/docker_linux_arm64_integration.go:38-48 | hack/prow/minitest/tester/kvm_general.go:31-41 | hack/prow/minitest/tester/none_docker_linux_amd64_integration.go:39-49 \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 \u0060hack/prow/minitest/tester/docker_linux_arm64_integration.go:38\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":"hack/prow/minitest/tester/docker_linux_arm64_integration.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4aa59f495440ab734dea3ab569eaf4e46deb89d1bc7d2b9f8ce9622e8fc8f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/drivers/kvm/network.go:125-137 | pkg/drivers/kvm/kvm.go:497-507 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. The matched lines also 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/drivers/kvm/network.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca7d6128a390dd6c0ddec505eb3f2b6df52136b963180373e703632d6137a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/drivers/kvm/network.go:431-441 | pkg/drivers/kvm/network.go:463-473 \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/drivers/kvm/network.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 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/drivers/kvm/network.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bcba43a487c32d5238c033a41c143f3939d5bb2d775bff17d5c14713207388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/libmachine/provision/debian.go:118-128 | pkg/libmachine/provision/ubuntu.go:112-122 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/libmachine/provision/debian.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/libmachine/provision/debian.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b900d1b5f4cbc4e04f65b5eaf3a3b104a08f28e47e132f0790943a52196712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/minikube/bootstrapper/kubeadm/kubeadm.go:1188-1198 | pkg/minikube/bootstrapper/kubeadm/kubeadm.go:1208-1218 \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/minikube/bootstrapper/kubeadm/kubeadm.go:1188\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/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da01e661104b4586ab14ae0bb2338506817bd2b6942a78c5f7d1881b949af9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/minikube/cruntime/containerd.go:230-240 | pkg/minikube/cruntime/docker.go:136-146 \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/minikube/cruntime/containerd.go:230\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/minikube/cruntime/containerd.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f7041e5bba12c43943f26e9793ab91eb921979a0ec9d425bb4a7e96fe95bea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/minikube/cruntime/crio.go:316-326 | pkg/minikube/cruntime/docker.go:366-376 \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. 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/minikube/cruntime/crio.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"590506bce49600cf3d08b616cc8897fe1a4849173231e19de5c8c9f9d29ac773"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/minikube/tunnel/loadbalancer_patcher.go:108-118 | pkg/minikube/tunnel/loadbalancer_patcher.go:134-144 \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/minikube/tunnel/loadbalancer_patcher.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"784fe10c2d561d8c86284400cfb18691c98d8bd9452134af37b8c97e227aef05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/drivers/krunkit/krunkit.go:499-509 | pkg/drivers/vfkit/vfkit.go:640-650 \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/drivers/krunkit/krunkit.go:499\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/drivers/krunkit/krunkit.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1712fd1d4a6d228764426f52124edff49d18f9273ba46079e89605aab03261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/addons/addons_gcpauth.go:141-151 | pkg/addons/addons_gcpauth.go:264-275 \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/addons/addons_gcpauth.go:141\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/addons/addons_gcpauth.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcc83bc896e52d7d34d01062495a3cc76946a35631cdc6d4288b12bc918e95f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hack/update/cni_plugins_version/cni_plugins_version.go:75-85 | hack/update/crictl_version/crictl_version.go:84-94 \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 \u0060hack/update/cni_plugins_version/cni_plugins_version.go:75\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":"hack/update/cni_plugins_version/cni_plugins_version.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8380e31e29583336afa0aafb34291102ef8e52e4d3621d10a31ab6fed659ac24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): hack/update/cni_plugins_version/cni_plugins_version.go:95-104 | hack/update/crictl_version/crictl_version.go:104-113 | hack/update/crun_version/crun_version.go:75-84 | hack/update/docker_version/docker_version.go:78-87 | hack/update/nerdctl_version/nerdctl_version.go:88-97 | hack/update/runc_version/runc_version.go:74-83 \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. 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":"hack/update/cni_plugins_version/cni_plugins_version.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e2930dc479f4e4b071fff57d078dc72ca6fed044b64f847e88f6fb2035d513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): pkg/drivers/qemu/qemu.go:134-143 | pkg/drivers/krunkit/krunkit.go:135-144 | pkg/drivers/vfkit/vfkit.go:137-146 \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/drivers/qemu/qemu.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. 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/drivers/qemu/qemu.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"823369afb19adeada9b336f5b291ee4810f435af27bfdd948f393cddd61ad7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): pkg/drivers/qemu/qemu.go:292-301 | pkg/drivers/krunkit/krunkit.go:186-195 | pkg/drivers/vfkit/vfkit.go:221-230 \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/drivers/qemu/qemu.go:292\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/drivers/qemu/qemu.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcd44632f812ddbab41fced6c3a6d1fa1c418276c667a227ff4bd524c6e82da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): hack/update/amd_device_gpu_plugin_version/amd_device_gpu_plugin_version.go:51-60 | hack/update/headlamp_version/headlamp_version.go:51-60 | hack/update/nvidia_device_plugin_version/nvidia_device_plugin_version.go:51-60 \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 \u0060hack/update/amd_device_gpu_plugin_version/amd_device_gpu_plugin_version.go:51\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":"hack/update/amd_device_gpu_plugin_version/amd_device_gpu_plugin_version.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"189e4d3dea80c41e58a88bc425591bb0dcbc63fc30e0fb7ef386e90f0ff99121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cmd/minikube/cmd/config/configure.go:108-117 | cmd/minikube/cmd/pause.go:79-88 \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":"cmd/minikube/cmd/config/configure.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56f38f928216bfc81d7201895b5e8e1aa6578a17e4fcd5cee86a8633501e211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/drivers/kvm/network.go:173-184 | pkg/drivers/kvm/kvm.go:61-70 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. The matched lines also 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/drivers/kvm/network.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4318f38caa0b5ca10fa202f05989d56e603392f9ea5fa7318618a31306542f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/drivers/qemu/qemu.go:360-369 | pkg/drivers/virtualbox/virtualbox.go:1319-1328 \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/drivers/qemu/qemu.go"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e283c03ce84b6b5187e6786fa0a20e924f544b93438d25529f4558b39f119d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/minikube/command/ssh_runner.go:203-212 | pkg/minikube/command/ssh_runner.go:289-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 \u0060pkg/minikube/command/ssh_runner.go:203\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/minikube/command/ssh_runner.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c58c0b48261a4cd4bd487c1399ed51274be7829ed41f3f44eab0014c6bd0b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/minikube/image/cache.go:105-114 | pkg/minikube/download/iso.go:123-132 \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/minikube/image/cache.go:105\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. 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/minikube/image/cache.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"606b5ebc194747897ec2501722f2991e0943b11b4a3ae3bb08913cb68b94d48b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/minikube/node/start.go:675-684 | cmd/minikube/cmd/mount.go:277-286 \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. 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/minikube/node/start.go"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"91eaf0bd5fc50d4613d0fe223a5869ead5ee183b7ec5de560246116fd0156209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/minikube/machine/build_images.go:189-198 | pkg/minikube/machine/cache_images.go:293-302 \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/minikube/machine/build_images.go:189\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/minikube/machine/build_images.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d7c7c991cd0b0531cba7010b72379c68667c60b86639c9cf1e839fd3bce4f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/minikube/schedule/daemonize_windows.go:46-55 | pkg/minikube/schedule/daemonize_windows.go:84-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/minikube/schedule/daemonize_windows.go:46\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/minikube/schedule/daemonize_windows.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e854e40ab49939470653ee1c3f3c9f7460dd8e5d9bb26937f9de4ca3208e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hack/jenkins/release_update_releases_json.go:109-118 | hack/jenkins/release_update_releases_json.go:223-232 \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":"hack/jenkins/release_update_releases_json.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30b171097f8291d33a31af9c838d06428de16968079a01befb91726cfa02a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hack/update/buildkit_version/buildkit_version.go:97-106 | hack/update/cri_o_version/cri_o_version.go:92-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. 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":"hack/update/buildkit_version/buildkit_version.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eca6d8de638184634065d6f8deec41bddc80c99b09ea0e25e91a2c9d160581c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): hack/update/cni_plugins_version/cni_plugins_version.go:105-113 | hack/update/crictl_version/crictl_version.go:114-122 | hack/update/docker_version/docker_version.go:88-96 | hack/update/nerdctl_version/nerdctl_version.go:98-106 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hack/update/cni_plugins_version/cni_plugins_version.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baee5be38f137660eb43b1fd09d56583cdc665a775cb12a333caf2e10633830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/drivers/kic/oci/cli_runner.go:54-62 | pkg/minikube/command/command_runner.go:99-107 \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/drivers/kic/oci/cli_runner.go:54\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/drivers/kic/oci/cli_runner.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5f763bcbde5b233a28ff13fb8b663fc5d6b9569a3c3c0a836b7a124db020da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/drivers/vmware/driver.go:335-343 | pkg/drivers/parallels/parallels_darwin.go:297-305 \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/drivers/vmware/driver.go:335\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/drivers/vmware/driver.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d75acc29a464adfe445a8dd910a5ea1396f78e782f7aa3ae7dda7ff194d4334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/libmachine/libmachine.go:94-102 | pkg/minikube/machine/client.go:110-118 \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/libmachine/libmachine.go:94\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/libmachine/libmachine.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae230307b2c87eab87315de887ceb746920811dc671003abc1b72dd87d7f594"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/minikube/command/exec_runner.go:149-157 | pkg/minikube/command/kic_runner.go:162-170 \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/minikube/command/exec_runner.go:149\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/minikube/command/exec_runner.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1fb1b1d1104fe676faee4b602e1484650853d8c7ea7b60f634ad6bce4340c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/minikube/localpath/localpath.go:93-101 | pkg/minikube/localpath/localpath.go:118-126 \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/minikube/localpath/localpath.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0775e6171a28ae5fbb82d4772dbaa16b7b4a73b02fd415461e2b99383350dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/minikube/machine/info.go:202-210 | pkg/minikube/machine/info.go:225-233 \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/minikube/machine/info.go:202\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/minikube/machine/info.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c204d7848d4570c84f70a132c4751d528af3b47f11a097624e740db8c57ebc9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/drivers/krunkit/krunkit.go:353-361 | pkg/drivers/vfkit/vfkit.go:156-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. 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/drivers/krunkit/krunkit.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5248746c780d89cff7e81c0a06995bc421e6013ab222bf898f7893f4f9a53ac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hack/jenkins/release_update_releases_json.go:169-177 | hack/jenkins/release_update_releases_json.go:257-265 \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":"hack/jenkins/release_update_releases_json.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb0273c602bb79f0544eccb2f6211b0e3cc9387ad19d0dc91ac901c57308f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hack/update/buildkit_version/buildkit_version.go:88-96 | hack/update/cri_o_version/cri_o_version.go:83-91 \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":"hack/update/buildkit_version/buildkit_version.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c1108a0315da7f2af5e57e12023d7d6e2b7234681abacf3b43c622b3262b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hack/update/containerd_version/containerd_version.go:120-128 | hack/update/docker_buildx_version/docker_buildx_version.go:131-139 \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":"hack/update/containerd_version/containerd_version.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbf2d3608611382b35c8b87c8980db6bb8d1731c67e04566237db04aa1af20d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hack/update/cri_o_version/cri_o_version.go:110-118 | hack/update/runc_version/runc_version.go:93-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hack/update/cri_o_version/cri_o_version.go:110\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. 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":"hack/update/cri_o_version/cri_o_version.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"861f2aa87e288a030a8a23495bb4c1325b27f5ebf6957ed7146f4f3e498072f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hack/update/inspektor_gadget_version/inspektor_gadget_version.go:72-80 | hack/update/volcano_version/volcano_version.go:90-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 \u0060hack/update/inspektor_gadget_version/inspektor_gadget_version.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. 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":"hack/update/inspektor_gadget_version/inspektor_gadget_version.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e90db6734dfdc74e6eea27dc78cb8728e758f4e24bb627a4a7df3193ec458db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hack/update/kubeadm_constants/kubeadm_constants.go:63-71 | hack/update/kubernetes_versions_list/kubernetes_versions_list.go:53-61 \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 \u0060hack/update/kubeadm_constants/kubeadm_constants.go:63\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":"hack/update/kubeadm_constants/kubeadm_constants.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca85a1b7524117bc446dcdca71de5661fe69d857cfe350266d252a3bd6b2e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hack/prow/minitest/deployer/boskos_deployer.go:62-70 | hack/prow/minitest/deployer/boskos_macos_deployer.go:52-60 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hack/prow/minitest/deployer/boskos_deployer.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"34450c6efdb280d112d23606d156f1eeaf72ed0d48a820c274e3274dd6a218a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): pkg/provision/provision.go:161-168 | pkg/provision/provision.go:201-208 | pkg/minikube/machine/build_images.go:192-199 | pkg/minikube/machine/cache_images.go:296-303 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/provision/provision.go:161\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. 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/provision/provision.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de6f4aa2c9005c4072a8af3bd88c39a5e52005a66aa8aad1a7c7fa6593d8071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/drivers/kic/oci/cli_runner.go:216-223 | pkg/minikube/command/exec_runner.go:81-88 | pkg/minikube/command/ssh_runner.go:229-236 \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/drivers/kic/oci/cli_runner.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"294f6af43d68efdd579406303599ac358cac195ec29e96aa3eafe33b5bdfb10d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/drivers/qemu/qemu.go:518-525 | pkg/drivers/krunkit/krunkit.go:281-288 | pkg/drivers/vfkit/vfkit.go:420-427 \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/drivers/qemu/qemu.go:518\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/qemu/qemu.go"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"879a0d0c39e313f276f74890e2745dc813f253f3af9d2ec12851c31837aee55c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cmd/minikube/cmd/start.go:659-666 | cmd/minikube/cmd/start.go:917-924 \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/minikube/cmd/start.go:659\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/minikube/cmd/start.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7654a88160239f9fc8f4fb64c2cbf844840decf3d33ac973def0160c0022e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/minikube/command/exec_runner.go:95-102 | pkg/minikube/command/ssh_runner.go:278-286 \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/minikube/command/exec_runner.go:95\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/minikube/command/exec_runner.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d86d6423611db398f65b72e4bc9817eb2cf0472c73b6759986cbfc2d1731a84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/minikube/command/ssh_runner.go:171-178 | pkg/minikube/command/ssh_runner.go:253-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/minikube/command/ssh_runner.go:171\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/minikube/command/ssh_runner.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9370ca556df896fa37a646f2424fe47d2a9e078ea45870f84b76d312b84888ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/minikube/cruntime/containerd.go:575-582 | pkg/minikube/cruntime/crio.go:500-507 \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/minikube/cruntime/containerd.go:575\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/minikube/cruntime/containerd.go"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"813438ea9a1cec305458b28b5198512e414fe4b64578c348848c4c19cf6825e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/drivers/kic/oci/cli_runner.go:67-73 | pkg/minikube/command/command_runner.go:112-118 \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/drivers/kic/oci/cli_runner.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cffcb3587a37028bf6dfa7645c26d3a335d8da68c59c8bc5d9640b2db6b4091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/generate/testdocs.go:50-56 | pkg/generate/errorcodes.go:44-50 \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/generate/testdocs.go:50\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/generate/testdocs.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d6c3a864b6fda7aef42154c6495eb2fc533dae8e560d0d3178927702caaa8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/minikube/cruntime/containerd.go:421-427 | pkg/minikube/cruntime/crio.go:327-333 \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/minikube/cruntime/containerd.go:421\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/minikube/cruntime/containerd.go"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fc3198497a064dc0e12f89ef72ca62acf3f85ae31dc413d8461de77f3311dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/util/retry/retry.go:92-98 | pkg/util/retry/retry.go:114-122 \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/util/retry/retry.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. 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/util/retry/retry.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef5b099fd9cd7b0fdce497a229b3240f6c3e423e8528ab7cd6be361eb92456c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): hack/prow/minitest/deployer/boskos_deployer.go:145-150 | hack/prow/minitest/deployer/boskos_deployer.go:154-159 | hack/prow/minitest/deployer/boskos_macos_deployer.go:123-128 | hack/prow/minitest/deployer/boskos_macos_deployer.go:132-137 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. 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":"hack/prow/minitest/deployer/boskos_deployer.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21df7084e0c9638e3db7dc0ee5a378cf25c0ed46d067a377ea363dbd5f219ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): pkg/drivers/kic/kic.go:452-457 | pkg/drivers/none/none.go:217-222 | pkg/drivers/ssh/ssh.go:193-198 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/drivers/kic/kic.go"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0685d1d00bde503e47d219c326000a4eab2d44b710e00aa7c8f0ec1373c6233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/minikube/tunnel/route_darwin.go:206-211 | pkg/minikube/tunnel/route_darwin.go:216-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/minikube/tunnel/route_darwin.go:206\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/minikube/tunnel/route_darwin.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69c052c79faa9073305e9903fd9b53ae8e010b02927129fd830fdac6bba4d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hack/prow/minitest/deployer/docker_deployer.go:201-206 | hack/prow/minitest/deployer/docker_deployer.go:210-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. 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":"hack/prow/minitest/deployer/docker_deployer.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee213d61162c8bbe7ed0e006d382febf5e7100e0310bbcbec0dc3ba01e839fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cmd/minikube/cmd/docker-env.go:241-245 | pkg/minikube/bootstrapper/bsutil/kverify/api_server.go:54-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/minikube/cmd/docker-env.go:241\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/minikube/cmd/docker-env.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4857d806a383c271e991bc43258b1db2a1372f1f820de0a463a0d54c631124ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/minikube/assets/addons.go: pkg/minikube/assets/addons.go changed 17 times in last 90 days, max complexity 20. 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/minikube/assets/addons.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b9603394f4d50d3b0a91ce8c9c96a2103f49b089b470a0b8d8ff9204447933"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/minikube/node/start.go: pkg/minikube/node/start.go changed 8 times in last 90 days, max complexity 34. 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/minikube/node/start.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d0f876c9c79ae0da22894bbee79d8db48a3fb3e02cc8a48a14a23a876c420c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/minikube/cmd/start_flags.go: cmd/minikube/cmd/start_flags.go changed 10 times in last 90 days, max complexity 27. 1 of those changes was a fix/bug commit, and the other 9 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/minikube/cmd/start_flags.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7853f16dbd6c809b4acf2ae51fe05182faf5485f30aa3a4201c79d9173ea011f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/minikube/cmd/start.go: cmd/minikube/cmd/start.go changed 5 times in last 90 days, max complexity 32. 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":"cmd/minikube/cmd/start.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8b477a221c7cae1a70825440f2b1c2f4fbe62df90221f63f136134ee96108d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/minikube/bootstrapper/kubeadm/kubeadm.go: pkg/minikube/bootstrapper/kubeadm/kubeadm.go changed 5 times in last 90 days, max complexity 29. 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/minikube/bootstrapper/kubeadm/kubeadm.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b4007ba2e734887955499f856674fc270006862157f2756ace6c1cd1f77a0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/addons/addons.go: pkg/addons/addons.go changed 5 times in last 90 days, max complexity 24. 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/addons/addons.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd897964174dfd84a7ae72b075646d2b8a29f947b17ec3438ab316a9f947c56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/drivers/kic/oci/oci.go: pkg/drivers/kic/oci/oci.go changed 3 times in last 90 days, max complexity 33. 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/drivers/kic/oci/oci.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0945aa3468a91e4a7dac0b0433841583e178332bc440785a6047202c1fada1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/minikube/cruntime/docker.go: pkg/minikube/cruntime/docker.go changed 4 times in last 90 days, max complexity 19. 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/minikube/cruntime/docker.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34742096ef21ce970157ca4bad7e7a5637e8cc04f3ef44a9de7dcc4c79a8a9d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/drivers/qemu/qemu.go: pkg/drivers/qemu/qemu.go changed 3 times in last 90 days, max complexity 24. 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/drivers/qemu/qemu.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0755b744513629875e9728b5a05276a47ddd1c1263be83ecc182d2bcf1d063"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/minikube/node/cache.go: pkg/minikube/node/cache.go changed 3 times in last 90 days, max complexity 22. 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/minikube/node/cache.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90927a61a63041f248a6c65d2a79b659a5590a2b902502b0fe85bd3f0b7c4431"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 23 significant file(s) lose their only recent owner: pkg/minikube/reason/known_issues.go, pkg/minikube/bootstrapper/certs.go, pkg/minikube/download/preload.go, pkg/minikube/bootstrapper/bsutil/kverify/api_server.go, pkg/drivers/none/none.go, cmd/minikube/cmd/dashboard.go, pkg/minikube/command/fake_runner.go, pkg/minikube/driver/auxdriver/install.go (\u002B15 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c758b9334fcb38f82a43b4627d9f759aaf70aa03fbfbea438c5f69c12a5b849"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 6 significant file(s) lose their only recent owner: pkg/minikube/bootstrapper/images/images.go, pkg/minikube/cluster/ha/kube-vip/kube-vip.go, pkg/perf/monitor/github.go, hack/update/github.go, hack/update/ingress_version/ingress_version.go, hack/update/kubernetes_versions_list/kubernetes_versions_list.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"582f444fa90a070df6b285489115d26ddc54d42dd1845ad29d50f5c59fc88eca"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 6 significant file(s) lose their only recent owner: pkg/drivers/krunkit/krunkit.go, pkg/drivers/common/dhcp/lease.go, cmd/minikube/cmd/config/validations.go, pkg/drivers/common/ssh.go, cmd/minikube/cmd/config/util.go, pkg/minikube/registry/drvs/vfkit/vfkit.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"32621a080ba4dcce0b701648abb119613c440873f3af17dc0a94c729ac478bbe"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 5 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 (42 single-owned of 344 analysed files in total, counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). They are anonymized user #4 (2 file(s)), anonymized user #5 (2 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (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":"D19","level":"note","message":{"text":"The README is a single-file landing page with no links to the full minikube docs (e.g. concepts/principles, installation, or more features) beyond the brief intro.: Link the README to the primary documentation site (https://minikube.sigs.k8s.io/docs/contrib/documentation/) so users can find all the detailed guides without leaving the landing page."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a448373d9892a3a79ba1365215e875ac84b9f6a35556e435ecc88ca3322c705"}},{"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":"32a8651c5c2dcd454fac8a341f0c41736e67d4f70e02a73e2a6ad9cbd3e6f3b2"},"taxa":[{"id":"CWE-78","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":"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":"fe7be47dbbcb797d5821433b462083ada949a53cf43e2a662b5349d914b13d3a"},"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":"81b8965f29b0f171802f3c26802569fedd754a263b3b639e7d994adbba94c53b"},"taxa":[{"id":"CWE-78","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":"e6d14b44a08229b2c3ab589abe816487888c3e6c3a3776944f0acc9d34fa55b7"},"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":"d6c13debdc7c5ef1218c06b30af440eb6db10c8606a9227ab7893cff1f7a2d32"},"taxa":[{"id":"CWE-78","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":"f5de878dac15b73f4be6d0025b5ac85b1461847fe78feb2cade29a66b9f1572a"},"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":"018cdee162c76db23cff2762492bd60c293316ca02dde9c8aef8152d918d1c25"},"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":"37d31a70f4d94ca09ee5a1817a0145c80bf456d0dfb177f0db418e7d152040df"},"taxa":[{"id":"CWE-319","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":"4bb48b568c18284fc6e9c7a5f41cc009f5719bdf882243838119fce02cb8bb25"},"taxa":[{"id":"CWE-328","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":"a3a2de45ac2f862acd3fe979b885363e4140a287e16b0b36ea543cfadcdff1e2"},"taxa":[{"id":"CWE-732","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":"541eeba95549c120c6ff738e443d89578b4247dd68568fa366f57cfe114c3893"},"taxa":[{"id":"CWE-319","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":"85cd7aca8ed9befaf8065e3f7a39875302cdb54c0dd7cc158e3892b0f8907a6f"},"taxa":[{"id":"CWE-732","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":"545989e36e35b7ddf60f055aebdbd5f3be8957dc6e166c27b1ea1faff80c6e98"},"taxa":[{"id":"CWE-338","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":"e816ebc711000222e1c65acbcc72fdcfcba243905f377e5eb73ec7b17d7cc5e1"},"taxa":[{"id":"CWE-338","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":"3edb35ef23c803dc3707e99aaf75055e8a09eab621b84bf34d563437d7abf2ca"},"taxa":[{"id":"CWE-328","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":"4579219ad2a3c10f44f13d0d90822dbfb10473acace0e282f98b3b756c6f85f2"},"taxa":[{"id":"CWE-328","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":"547e0ad02e315e8ba493ce1ccd0def8a9f2edbd0acea7a823818ac70b992340c"},"taxa":[{"id":"CWE-732","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":"f09487120b422c9a41950c595cb67569a17bd7ded816099ba2bd05e84c894ac5"},"taxa":[{"id":"CWE-732","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":"f4a01ca14f9dd01e4d4c33e476da472be48f9ca9f479a67bf107aae6bff6384f"},"taxa":[{"id":"CWE-732","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":"05802146d683b4f015dd22f5707c686b8dc4f66173dff886cdfc15e984e8bdec"},"taxa":[{"id":"CWE-732","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":"440fcaf89312c011b0846415f89177fdb75f1e664d42d0ca5a9638ee477e2917"},"taxa":[{"id":"CWE-732","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":"3bfac333fcd069d49f453c2dd9c4776b7d7ae0a24a9b841166cca39d857e2298"},"taxa":[{"id":"CWE-328","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":"16a5a68a659f009aba75688afa86bbbe64975bc36ab7821cf48bddc02f74ef91"},"taxa":[{"id":"CWE-328","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":"9545fe1e77d6a827cb87cd38da4d87b842cc17df621fdc0cd769f4417429c601"},"taxa":[{"id":"CWE-79","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":"838d2e5f9246934861d0175cfb4ae793911ed2e41d854a62e2dafb8117dc1040"},"taxa":[{"id":"CWE-79","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":"ec018475beb79a2b7d49e342dd581bb361cde622225eba5034496878f6ae6cdf"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0513c700d0075b49b164b1150016ed8393b4db1b98c25042fe6e40bd536eedde"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e66b317f781f91eae886342362b4e0df84b6ef493117d9356dcea7512ab4d8be"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7390404bc6af9c50e83875bce03e6da5448e797a43d503a67348a8682805b246"},"taxa":[{"id":"CWE-322","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"867bfeed134cc6831d1f487bf253b651d3ffd58470cef51ff736afc04fe1d21b"},"taxa":[{"id":"CWE-327","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":"4372b4cb7552b5f6891c27860a44fc72817488d3933ca7351b3f156008179ac3"}},{"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":"414bf79137f5f4e36de79517de2c3ef00668337ecbb98796f48cfef5a580898d"}},{"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":"4577e263719fd18c76b86aa72771219c4e57466d06ced2f06735fa839d51563f"}},{"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":"54501a0aeb351eeb756774e072c07354e8595cbf11658e531d3381c77dbf22d0"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 85 of 347 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/minikube/cni/cni.go, pkg/minikube/service/service.go, cmd/minikube/cmd/completion.go (and 82 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":"error","message":{"text":"Boundary-crossing change coupling: kubernetes_version.go \u2194 kubernetes_versions_list.go: \u0060cmd/minikube/cmd/config/kubernetes_version.go\u0060 (context cmd) and \u0060hack/update/kubernetes_versions_list/kubernetes_versions_list.go\u0060 (context hack) sit in DIFFERENT parts of the tree yet change together 94% of the time (29 of the 31 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/config/kubernetes_version.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba66e0e9691287afeecdbd8f124a6716186bd239eda1fc850896b2124de335dd"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: kubernetes_versions_list.go \u2194 github.go: \u0060hack/update/kubernetes_versions_list/kubernetes_versions_list.go\u0060 (context hack) and \u0060pkg/perf/monitor/github.go\u0060 (context pkg) sit in DIFFERENT parts of the tree yet change together 94% of the time (29 of the 31 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hack/update/kubernetes_versions_list/kubernetes_versions_list.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b849ad23bcbd388f3827c9374ec0b57dda28dc539fbdbd676a1242aa9a2bfee9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ingress_version.go \u2194 github.go: \u0060hack/update/ingress_version/ingress_version.go\u0060 (context hack) and \u0060pkg/perf/monitor/github.go\u0060 (context pkg) sit in DIFFERENT parts of the tree yet change together 88% of the time (29 of the 33 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hack/update/ingress_version/ingress_version.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ccdd5e017d6ac9e81d49b868c24476c99358c502b50d792c048bb02c15750d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: kubeadm_constants.go \u2194 github.go: \u0060hack/update/kubeadm_constants/kubeadm_constants.go\u0060 (context hack) and \u0060pkg/perf/monitor/github.go\u0060 (context pkg) sit in DIFFERENT parts of the tree yet change together 88% of the time (29 of the 33 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hack/update/kubeadm_constants/kubeadm_constants.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"956b32057af7cf9573e5d6cecc541d4022b3c6b8b3ffe9b90f91fa28b16c7e72"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: kubernetes_version.go \u2194 site_node_version.go: \u0060cmd/minikube/cmd/config/kubernetes_version.go\u0060 (context cmd) and \u0060hack/update/site_node_version/site_node_version.go\u0060 (context hack) sit in DIFFERENT parts of the tree yet change together 86% of the time (24 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/config/kubernetes_version.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6e63c69aa5291e4162d43f3ce266f7e163e271e769284fbb273011dfefe231"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: site_node_version.go \u2194 github.go: \u0060hack/update/site_node_version/site_node_version.go\u0060 (context hack) and \u0060pkg/perf/monitor/github.go\u0060 (context pkg) sit in DIFFERENT parts of the tree yet change together 86% of the time (24 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hack/update/site_node_version/site_node_version.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cca2d00c8b53c839e141737da5db56a61ff246ad54b30c476357c74feb99e3"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: kubernetes_version.go \u2194 ingress_version.go: \u0060cmd/minikube/cmd/config/kubernetes_version.go\u0060 (context cmd) and \u0060hack/update/ingress_version/ingress_version.go\u0060 (context hack) sit in DIFFERENT parts of the tree yet change together 82% of the time (28 of the 34 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/config/kubernetes_version.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c080776f74b12195c8998f21c00968d4ec2c99573f68b9a84dd1fa11133fca4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: assets.go \u2194 config.go: \u0060deploy/addons/assets.go\u0060 (context deploy) and \u0060pkg/addons/config.go\u0060 (context pkg) sit in DIFFERENT parts of the tree yet change together 80% of the time (12 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/addons/assets.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97393d540c234b0469655bfaa1be988b4a1ab46e7b01122460f0612066f25f40"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: kubernetes_version.go \u2194 kubeadm_constants.go: \u0060cmd/minikube/cmd/config/kubernetes_version.go\u0060 (context cmd) and \u0060hack/update/kubeadm_constants/kubeadm_constants.go\u0060 (context hack) sit in DIFFERENT parts of the tree yet change together 76% of the time (29 of the 38 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/config/kubernetes_version.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5c8250228d47cbb3d12cd846f2e3c05bb3fdd72f0d269f3a9a09196034cfef"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: kubernetes_version.go \u2194 github.go: \u0060cmd/minikube/cmd/config/kubernetes_version.go\u0060 (context cmd) and \u0060hack/update/github.go\u0060 (context hack) sit in DIFFERENT parts of the tree yet change together 76% of the time (28 of the 37 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/minikube/cmd/config/kubernetes_version.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"277d2baac562c4c9866adfc9713c6d2b9eae005cf8b3cef611f5f4cc6188d821"}},{"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"ruleId":"D38","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":"180098ad28b8ec88ea6d9d65ee5bc15f4d0baa3b9973c6b6be6d625ae224abce"}},{"ruleId":"D38","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":"7af43eccdad7bf5348a119f67ed8af38b51463985942ddf2383f94261a860d1d"}},{"ruleId":"D38","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":"24fcae53239a1ac72bc974dcc3442f0bef6a331b9ed40849b5e99c9cb4cbc05a"}},{"ruleId":"D38","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":"f4129b76226ac299ba23bc77eac03651d364dcb380082054b50eace058a176b7"}},{"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":"c3101d36131a52584dde37b042bdfe9fc6a1d1edad6398c91ef166385743b007"}},{"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":"98fa81f68a207cbc187f958f2f8e20ef185cfebacdd579568ef786fe5560551c"}},{"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":"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":"c31b5760d21e13b4374f2b5d1ba3d9b55eb46267e4ef2be9d065fe5a8bf6a946"}},{"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":"1656ce9f14174489eb7a720acd1cd3e90061ead1da7a34b031cb91efb345eaf5"}},{"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":"6b4deab06cd1fc2fb6e57103d1f3ef991634da4c2b7c329a7a2420a12731f08c"}},{"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":"b88ccdd3fe624c15fef53cb3306a78603f269ae5a46b317bc818321c7a464502"}},{"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":"D42","level":"note","message":{"text":"No runtime threat detection: No runtime threat-detection engine (Tetragon TracingPolicy / Falco) is committed. These observe process, file and network activity in-kernel and can alert or kill on malicious behaviour a static scan cannot catch."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aade9827a37dfc7ee064f80a997f47b5d11e31bc09704e26b9252bef00aa0c58"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.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-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"CWE-319","shortDescription":{"text":"CWE-319"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-322","guid":"f9bcce90-227a-d056-9902-7b1c2f9f299c","name":"CWE-322","shortDescription":{"text":"CWE-322"},"helpUri":"https://cwe.mitre.org/data/definitions/322.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"CWE-327","shortDescription":{"text":"CWE-327"},"helpUri":"https://cwe.mitre.org/data/definitions/327.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-338","guid":"e89b7604-c3f7-8b53-bc8c-4d4718c28617","name":"CWE-338","shortDescription":{"text":"CWE-338"},"helpUri":"https://cwe.mitre.org/data/definitions/338.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":50,"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."]}]}