{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"runtime.runComplex (cyclomatic 79): runtime.runComplex has cyclomatic complexity 79 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: agent.go holds 8 of the 42 functions over the threshold \u2014 including the worst \u2014 and 170 of the 575 points over it (30%), 3\u00D7 the next-largest file (internal/runtime/exec/scheduler.go at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5ddbac478f6814c49aba5b21f5ae307198e1775087fe4dcbb477a75cf2735c"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler.Run (cyclomatic 71): Scheduler.Run has cyclomatic complexity 71 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 50 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":"internal/runtime/exec/scheduler.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7865b0f9141d1a728b8a9e6b715e0034ab3c130df24fc2b8d7305135fd2cf3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"docker.New (cyclomatic 63): docker.New has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/config.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a85683c3c192c0d29b8bf1be10b59ed6d6a873ef4d761e6bc153d027506688"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor.Execute (cyclomatic 55): Executor.Execute has cyclomatic complexity 55 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/execute.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfae291127285e9fb77c422d37d83c7dcfe57b879936048836b91e49e128725c"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.RunInput (cyclomatic 51): Runner.RunInput has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/react/react.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e29f92b2016b18a2b22d39714ee87726f38a67025c6a11c8bb3e53de33e18d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.Execute (cyclomatic 48): Runner.Execute has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"policy/policy.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f67a684ef3c27ccea3a9ef96f9d32a8de5ae596dedf963bee4a2654ede077f"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.run (cyclomatic 43): runtime.run has cyclomatic complexity 43 (threshold 15). Of this number, 42 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: agent.go holds 8 of the 42 functions over the threshold \u2014 including the worst \u2014 and 170 of the 575 points over it (30%), 3\u00D7 the next-largest file (internal/runtime/exec/scheduler.go at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f4075398b62db8b8a43d0e78f9d0d7bd9e2f77b592fe9104559b0885477ecc"}},{"ruleId":"D1","level":"warning","message":{"text":"Plan.Validate (cyclomatic 41): Plan.Validate has cyclomatic complexity 41 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/plan.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b2d9ee99e01a161282338339a74352bd9702e2eab8aaff16907868d62bedbd"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.Resume (cyclomatic 39): runtime.Resume has cyclomatic complexity 39 (threshold 15). Of this number, 37 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: agent.go holds 8 of the 42 functions over the threshold \u2014 including the worst \u2014 and 170 of the 575 points over it (30%), 3\u00D7 the next-largest file (internal/runtime/exec/scheduler.go at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76199aa0181fa9d0b831b7926627cce1b6f53f186005c66717637c7bc548da1"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.resumeComplex (cyclomatic 37): runtime.resumeComplex has cyclomatic complexity 37 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: agent.go holds 8 of the 42 functions over the threshold \u2014 including the worst \u2014 and 170 of the 575 points over it (30%), 3\u00D7 the next-largest file (internal/runtime/exec/scheduler.go at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"579a806484b451197fe6e2a2d3e78c00ffc053de9dad82a21d43081728628f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"model.ValidateCapabilities (cyclomatic 35): model.ValidateCapabilities 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":"model/model.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a8b8497f377a812ea7cbd97635b57c090a0eccd1c17fa530ef729b3819998f"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.LoadRoot (cyclomatic 32): Catalog.LoadRoot has cyclomatic complexity 32 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 14 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/catalog.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce80f2bbb02f3fc535427044988cb7a0d2cad7621270e7cfe7287399561c53fb"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.initialRecovery (cyclomatic 28): runtime.initialRecovery 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":"recovery.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0697fb1cd4a3b132c2362bc1467c52f531dae307e2be296060f2be464fd906a6"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.Stream (cyclomatic 25): runtime.Stream has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: agent.go holds 8 of the 42 functions over the threshold \u2014 including the worst \u2014 and 170 of the 575 points over it (30%), 3\u00D7 the next-largest file (internal/runtime/exec/scheduler.go at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"277ac26577f3b62ba8376edd1c9a7c6b367ec8b9e61d8599ff1e49ec744377a3"}},{"ruleId":"D1","level":"warning","message":{"text":"plan.ValidateAgainstTools (cyclomatic 25): plan.ValidateAgainstTools 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":"plan/tool_validation.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6667e5b8d2c85eb002423b4bc400c83802a8c30dbb033901fa05d6155a0e8966"}},{"ruleId":"D1","level":"warning","message":{"text":"zhizhi.protectCompletedWrites (cyclomatic 24): zhizhi.protectCompletedWrites 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":"recovery.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bb40d381a8c211d77bcdb7f7958f256756ebf40c04dc493df656d7c7445540"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemalessBindingFix.Apply (cyclomatic 24): SchemalessBindingFix.Apply 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":"plan/fixes.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"384ab4df02dc819eef29abf9c2e83ce79b2a1e622a977b3e798cc7ab1dd1c6cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.request (cyclomatic 23): Client.request has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"757574788111983a1bbbfbabc5258c1d0a2f83df5559c15d98d05e1754a434e4"}},{"ruleId":"D1","level":"warning","message":{"text":"eventStream.finishToolCalls (cyclomatic 23): eventStream.finishToolCalls has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: agent.go holds 8 of the 42 functions over the threshold \u2014 including the worst \u2014 and 170 of the 575 points over it (30%), 3\u00D7 the next-largest file (internal/runtime/exec/scheduler.go at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64f1e855efd78eba7b9b89d03fcbfa7167657f887f895be3776d151827fc46b"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor.snapshot (cyclomatic 23): Executor.snapshot has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/files.go"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f8a336abb00750534ecb479f0373eca83710a9134ab1b82c7c9c061756d82a"}},{"ruleId":"D1","level":"warning","message":{"text":"script.Approve (cyclomatic 23): script.Approve has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/script.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"859acd06e2f95f322603084c75385c0f6b7e54dd63d7fd10200935e353678e1a"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.resumeSimple (cyclomatic 22): runtime.resumeSimple has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: agent.go holds 8 of the 42 functions over the threshold \u2014 including the worst \u2014 and 170 of the 575 points over it (30%), 3\u00D7 the next-largest file (internal/runtime/exec/scheduler.go at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7d7d454be0d28edd208a9c19bd3751a8bcebffd0954abfad2347c3005aa7be"}},{"ruleId":"D1","level":"warning","message":{"text":"eventStream.Recv (cyclomatic 22): eventStream.Recv has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: agent.go holds 8 of the 42 functions over the threshold \u2014 including the worst \u2014 and 170 of the 575 points over it (30%), 3\u00D7 the next-largest file (internal/runtime/exec/scheduler.go at 56). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b63ef8230bcb9f026f9f08b8ab7e10732f68a9398fb70b1ea69a4463e1fecb1"}},{"ruleId":"D1","level":"warning","message":{"text":"plan.generateCandidate (cyclomatic 22): plan.generateCandidate has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/output.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19015c0788646784b43a6650e953b0286eef5d99c68824e34e735b7670223db"}},{"ruleId":"D1","level":"warning","message":{"text":"plan.ValidatePatchCompatibility (cyclomatic 22): plan.ValidatePatchCompatibility has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/replan.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"586edc36cff0dcd10ac3d4c996cbac328a36b46990ef58588b5579430a3a2f0a"}},{"ruleId":"D1","level":"warning","message":{"text":"plan.outputTool (cyclomatic 21): plan.outputTool has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 117). 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":"plan/output.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8035c6effa2236e39213a0d00cb0fa73d2d868a14bdb8fe097e4de5f7ebf5b23"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor.scanWorkspace (cyclomatic 21): Executor.scanWorkspace has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 249). 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":"skill/script/docker/files.go"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8c5380780cfc021b6936d38dbe3c88b6c34f8f1b052bf33b459d2c28aa19ad"}},{"ruleId":"D1","level":"warning","message":{"text":"skillExecutor.Execute (cyclomatic 20): skillExecutor.Execute has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 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":"skill.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29f5888eedc8b1241de9423de831817672e9838988bbd7ec2f9fbdab4dbf33f"}},{"ruleId":"D1","level":"warning","message":{"text":"openaicompat.normalizeFunctionParameters (cyclomatic 19): openaicompat.normalizeFunctionParameters 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":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"239a1270a43ca80792111775bb75d4b583961ed9b5097de41acb98d2ab958162"}},{"ruleId":"D1","level":"warning","message":{"text":"plan.ClassifyError (cyclomatic 19): plan.ClassifyError has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/rule_fixer.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4128eab5b328e08240aa239349ca316e1ed7f3f576f2c3e2f061bdd0d7fe0317"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.Search (cyclomatic 19): Catalog.Search has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/search.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c564a7f40417a2746887e7a4d48aeee09eedfaf9e024cb07aa40aaf755e14ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"plan.validateStepMode (cyclomatic 18): plan.validateStepMode 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":"plan/plan.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b57c92c338adfdc420dffe8f7e1fce36799b3359e7c5ea52f65af03a9b58acd"}},{"ruleId":"D1","level":"warning","message":{"text":"skillScope.restore (cyclomatic 18): skillScope.restore 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":"skill.go"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"4640e62bdc7672cad9ff7a99ef09160b2ac5400930ff0441269bd9afcd3c22fb"}},{"ruleId":"D1","level":"warning","message":{"text":"skill.parse (cyclomatic 18): skill.parse has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/catalog.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedb67567ca190d9b4e7b4724d20ccd05b4cc8d4871793dfcabbe0b12c377a82"}},{"ruleId":"D1","level":"warning","message":{"text":"skillScriptTool.Call (cyclomatic 18): skillScriptTool.Call has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill_script.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"61085f8b8cde8e432251f8141b9dca3bdf9ac48cfa6c6d0709cf36b2e9d792a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.Generate (cyclomatic 17): Client.Generate 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":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"608039932f5da866b74ac089eada9b58fb0cf4525fbe685a3e844616573cae66"}},{"ruleId":"D1","level":"warning","message":{"text":"session.readLoop (cyclomatic 17): session.readLoop 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":"adapter/speech/doubao/client.go"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd66c193cdd4596a4d2b1df6bcc2237f65355b0b826a861f469fad5c235a4e6"}},{"ruleId":"D1","level":"warning","message":{"text":"zhizhi.WithSkillProvider (cyclomatic 16): zhizhi.WithSkillProvider has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 46). 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":"skill.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"edadbb685fb717b9e217c31e696aac3731f0968b74b5fcc3750e19f2b8412b2b"}},{"ruleId":"D1","level":"warning","message":{"text":"exec.Compile (cyclomatic 16): exec.Compile 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":"internal/runtime/exec/compiler.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe98fc099e20ccfff0f3df6ad4d86742a7f3b6b51ab76847a1661eae69ec2a48"}},{"ruleId":"D1","level":"warning","message":{"text":"Provider.Ensure (cyclomatic 16): Provider.Ensure 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":"mcp/mcp.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73cc894b843c4c87553341f9037386108e224a00f2891e8fbadd616ba0d30d8"}},{"ruleId":"D1","level":"warning","message":{"text":"plan.decodePlan (cyclomatic 16): plan.decodePlan 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":"plan/planner.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f41da5fcf2b576ca241c40014fe79de88cf61af85c456593fda613e212933c"}},{"ruleId":"D1","level":"warning","message":{"text":"DecisionEngine.Decide (cyclomatic 16): DecisionEngine.Decide has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"policy/decision.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc808f7789138880e5079f4f49da66496f8b17ccf760f63cb6033c46f404315"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.Run (cognitive 172): Scheduler.Run has cognitive complexity 172 (threshold 15). Drivers by points: if/else 42 (138 pts), loops 8 (17 pts), boolean chains 14, match/switch 1 (3 pts) (nesting depth added 107). Of this number, 37 points are the body\u0027s own statements and 135 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/scheduler.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e97b2c77988fb0ab18a9d1e052910d0f256e119c168a09835f0369f85cd829e"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.runComplex (cognitive 133): runtime.runComplex has cognitive complexity 133 (threshold 15). Drivers by points: if/else 50 (98 pts), loops 14 (23 pts), boolean chains 12 (nesting depth added 57). Of this number, 127 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a210da2a76f7155a47752b3f915c85e94d4c2915ff915dcf722405397b1ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.RunInput (cognitive 110): Runner.RunInput has cognitive complexity 110 (threshold 15). Drivers by points: if/else 35 (96 pts), boolean chains 9, loops 3 (5 pts) (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/react/react.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4672aa8dbe9b9522c5357f8c574e003a6c9138d99f0be8218978033482c04f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor.Execute (cognitive 93): Executor.Execute has cognitive complexity 93 (threshold 15). Drivers by points: if/else 48 (84 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 37). Of this number, 83 points are the body\u0027s own statements and 10 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/execute.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85fd288c315d397c98d3a346f6ce47955d2d4dbf64d789c4583e4dd7d0e8238"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.run (cognitive 92): runtime.run has cognitive complexity 92 (threshold 15). Drivers by points: if/else 38 (85 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 49). Of this number, 91 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcb9ba7b054008dccbb7f61119af3e365ef7a226e146dc0d26d3cb39fb73dd0"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan.Validate (cognitive 88): Plan.Validate has cognitive complexity 88 (threshold 15). Drivers by points: if/else 23 (61 pts), loops 10 (20 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 51). Of this number, 83 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":"plan/plan.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"caac7cd5916bc2d379d620657871b075686e761d9413abf0077c86059614074b"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.Execute (cognitive 88): Runner.Execute has cognitive complexity 88 (threshold 15). Drivers by points: if/else 25 (70 pts), boolean chains 12, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"policy/policy.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9714a1cbc9bb649a8611e67e01582c91a0391540100f6f16cf6b4abda0ce1adc"}},{"ruleId":"D2","level":"warning","message":{"text":"docker.New (cognitive 66): docker.New has cognitive complexity 66 (threshold 15). Drivers by points: if/else 38 (53 pts), boolean chains 8, loops 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/config.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"131d6e82cd34b52e1062ee50f2edc3592d51d555635a5776e6caf95da71d1881"}},{"ruleId":"D2","level":"warning","message":{"text":"plan.ValidateAgainstTools (cognitive 65): plan.ValidateAgainstTools has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (55 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/tool_validation.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0982850cd269688bcee37861363a02e31c57ff4561d11a12fe34b56d414c0cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor.scanWorkspace (cognitive 63): Executor.scanWorkspace has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (55 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 43). Most of this is not in the body itself: 5 of the 63 points are its own statements and the rest belongs to one function literal inside it that branches (line 249). 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":"skill/script/docker/files.go"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"06006454a9d7ad929399299d60e69f1a02ce842afefe166c1b14393f825ff112"}},{"ruleId":"D2","level":"warning","message":{"text":"zhizhi.protectCompletedWrites (cognitive 57): zhizhi.protectCompletedWrites has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 6 (17 pts), boolean chains 5 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"recovery.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d7d4f14582037b5d6f152e6b2bdf47d97abedc37804eba41a351594bfb39a9"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.resumeComplex (cognitive 56): runtime.resumeComplex has cognitive complexity 56 (threshold 15). Drivers by points: if/else 24 (39 pts), loops 7 (12 pts), boolean chains 5 (nesting depth added 20). Of this number, 55 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a31badc45dca10d42542d28357ab5b5ac77acec3a0b405d04f72d7763fdfa6"}},{"ruleId":"D2","level":"warning","message":{"text":"model.ValidateCapabilities (cognitive 54): model.ValidateCapabilities has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 6, loops 3 (5 pts), match/switch 2 (5 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"model/model.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a7578cec7c7bc98612be9a039ab53590c30240ec6e7cee9325bd6a56800629"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.resumeSimple (cognitive 50): runtime.resumeSimple has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (44 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 29). Of this number, 49 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":"agent.go"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"b358bed560bfc9bf7bfa142439bf94e189bd7bcc3c58f447f5084549871464ef"}},{"ruleId":"D2","level":"warning","message":{"text":"plan.generateCandidate (cognitive 50): plan.generateCandidate has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (47 pts), boolean chains 2, loops 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/output.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bc5906cff84feed722c8a4315bf13c437c6ae2476534af6992bca90d26d75b"}},{"ruleId":"D2","level":"warning","message":{"text":"eventStream.finishToolCalls (cognitive 48): eventStream.finishToolCalls has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (44 pts), loops 3, boolean chains 1 (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":"agent.go"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad166fdd8e681f7f8701a4a61f0e1ae7bd2c1e880dc94cd7d8ee8af8bc43fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"plan.ValidatePatchCompatibility (cognitive 45): plan.ValidatePatchCompatibility has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 4 (11 pts), boolean chains 4 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/replan.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"18307d12e4c3a087781b25952456c8b3b55b58215fda7a628239809958aa5ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog.LoadRoot (cognitive 45): Catalog.LoadRoot has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 7, boolean chains 4 (nesting depth added 13). Of this number, 22 points are the body\u0027s own statements and 23 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":"skill/catalog.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7051902f096bde1b031536abcb2392c1d594416b2aa3d58a6fe8d847e21dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.Resume (cognitive 43): runtime.Resume has cognitive complexity 43 (threshold 15). Drivers by points: if/else 30 (37 pts), boolean chains 5, loops 1 (nesting depth added 7). Of this number, 41 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":"agent.go"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"7401961e0d549e47e6def1b4046ff7289872784492c402c57d4379710388f55b"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemalessBindingFix.Apply (cognitive 40): SchemalessBindingFix.Apply has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 6 (8 pts), boolean chains 3 (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":"plan/fixes.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"571d0e31bdeb33c574cba5559ddf0c30ff44e2d1f6d4659672c21877e3406c51"}},{"ruleId":"D2","level":"warning","message":{"text":"plan.outputTool (cognitive 37): plan.outputTool has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (11 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 17). Most of this is not in the body itself: 2 of the 37 points are its own statements and the rest belongs to one function literal inside it that branches (line 117). 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":"plan/output.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3faccea016f88ca10c23cfebd551df1f2a0f68fe6597c540f6949b290022c4"}},{"ruleId":"D2","level":"warning","message":{"text":"eventStream.Recv (cognitive 36): eventStream.Recv has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (34 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83cffda80d98931b666d37a0aaad8321605898cd075464339fb2247a153adce"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor.snapshot (cognitive 34): Executor.snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). Of this number, 31 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/files.go"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4ecbe2215e777932af9b6e8f863dffc201148d23e95bda629288f2fa3c107e"}},{"ruleId":"D2","level":"warning","message":{"text":"Provider.Ensure (cognitive 32): Provider.Ensure has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/mcp.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d48c1cb20099618e4042a2cf1223d20d8efa7d1e43cca4d5e40f701f1fbb3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.Generate (cognitive 31): Client.Generate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 3 (8 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da154180b2dd505d29b349f394c648aec0ad92d2218fd231e97bb071d5cc195"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.Stream (cognitive 31): runtime.Stream has cognitive complexity 31 (threshold 15). Drivers by points: if/else 24 (28 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: 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":"agent.go"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"8554af0f6b3b218fc3b8dfb961a7203d068b9c07d9b0a4f98c48bd2e392562ee"}},{"ruleId":"D2","level":"warning","message":{"text":"plan.validateCandidateSchema (cognitive 31): plan.validateCandidateSchema has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (10 pts) (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":"plan/output.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a30bdceb551cb9ae669a9eae64c6b38e1f7f60afea0a2dd7296b5568b76a4b0"}},{"ruleId":"D2","level":"warning","message":{"text":"session.readLoop (cognitive 30): session.readLoop has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 4 (12 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/speech/doubao/client.go"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce5c36975f94135c3ab36fb5e85d7f3279482850ee0b00695ba8d52cedb90ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog.Search (cognitive 30): Catalog.Search has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 11). Of this number, 28 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/search.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8267c3e0fb8a27d4ba5d57380fe196355b013d47f8a75e1a85d77cb27dca2e"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelRouter.Route (cognitive 29): ModelRouter.Route has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (13 pts), 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":"route/router.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eab04c8ab52463df1443bc8c7bf2ed62b392a08292002423389a7e55f9a50a"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.request (cognitive 28): Client.request has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eb2ea9ff433f0745e731a8d3f2004c1e39d2456497be85f4663ac48433f609"}},{"ruleId":"D2","level":"warning","message":{"text":"script.Approve (cognitive 28): script.Approve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 5, 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":"skill/script/script.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6597ee885f94a00375db391ad170527707a0ab5771e1a912c976d258dff81fc"}},{"ruleId":"D2","level":"warning","message":{"text":"stream.Recv (cognitive 27): stream.Recv has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ddb7f7940706d515bbea0c5d32c98c62d0a0cbdd067d165fe706f25df10ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"openaicompat.normalizeFunctionParameters (cognitive 26): openaicompat.normalizeFunctionParameters has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad967858f1ac003b079429941d5506c1c786ac5fe57c4825c66ef54b5d53be9d"}},{"ruleId":"D2","level":"warning","message":{"text":"exec.Compile (cognitive 26): exec.Compile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/compiler.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"524dbc161b0253b2e8c06c8e0aeb3fb631a15dbb2a16e6e9a7167d0b7da0e080"}},{"ruleId":"D2","level":"warning","message":{"text":"plan.decodePlan (cognitive 26): plan.decodePlan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/planner.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"984e73746b6f0acd51be34c86f84b3c2549be6e8b3b9fe0a62bd9f683eba056f"}},{"ruleId":"D2","level":"warning","message":{"text":"openaicompat.wireModelInput (cognitive 25): openaicompat.wireModelInput has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a172a26bd38f6630ddf8c48791a23dfc8a3ff6474c88719d559555d8f37bd5b"}},{"ruleId":"D2","level":"warning","message":{"text":"skillScope.restore (cognitive 25): skillScope.restore has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill.go"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bf3a00f1bf0d4e420ce11451698b7ae2a6d10d01957d07ea283f9c9c52a061"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.initialRecovery (cognitive 24): runtime.initialRecovery has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7, loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"recovery.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0277a8cb7f0233db38349ae101587279dc58c6790cc57e3ef6dd18d73934f355"}},{"ruleId":"D2","level":"warning","message":{"text":"zhizhi.New (cognitive 23): zhizhi.New has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e613c4b64a6130e69af80d1a8d989ef585330c79201d52944298b3ffedfd2c67"}},{"ruleId":"D2","level":"warning","message":{"text":"skillScope.search (cognitive 21): skillScope.search has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6af2ab1e9edc41c5e5d0a6e5feb6b8acb1ee23a83fe57ef9d09d1790837203"}},{"ruleId":"D2","level":"warning","message":{"text":"skillExecutor.Execute (cognitive 21): skillExecutor.Execute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 4 (nesting depth added 2). Of this number, 13 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":"skill.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d511d4186021b7a28977ccef5586bd39f8dd79c59164121f80c0a8e721e482"}},{"ruleId":"D2","level":"warning","message":{"text":"plan.validateStepMode (cognitive 20): plan.validateStepMode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/plan.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d223798fd3f0e232f9962797054b427d9cf1e1ff7385435591afefe96d0d2321"}},{"ruleId":"D2","level":"warning","message":{"text":"skillScope.invoke (cognitive 20): skillScope.invoke has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c589aed1069866aba663b8e6d214d6aa3a851686cf2e3445309eebedcd609b"}},{"ruleId":"D2","level":"warning","message":{"text":"skill.parse (cognitive 20): skill.parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/catalog.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4866ae0fd33d7131073d6b83d640efb98f188c528e76bc94fb694cb289a6400c"}},{"ruleId":"D2","level":"warning","message":{"text":"Patch.Apply (cognitive 19): Patch.Apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 8 (9 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/replan.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf1bd97e603058616ea7a2bf3aa43bf40be97c07cef274a3c33653d96ceb2c7"}},{"ruleId":"D2","level":"warning","message":{"text":"CapabilityProvider.Select (cognitive 18): CapabilityProvider.Select has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), 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":"mcp/capability_provider.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1ba9cfc7c88ad7fa5ae8e799915a779391784ca0d7602a5d2714965990f139"}},{"ruleId":"D2","level":"warning","message":{"text":"plan.ClassifyError (cognitive 18): plan.ClassifyError has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 8, loops 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":"plan/rule_fixer.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"423a669ab680ea358a7a6d2b56ac858a3772859ddcd47c70426026eb32a2a53a"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor.ensureImage (cognitive 18): Executor.ensureImage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/config.go"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"276b7134f9bb35f71a470f8fe9506e9a1d09b439b6922a6ea2c04ed28b852987"}},{"ruleId":"D2","level":"warning","message":{"text":"skillScriptTool.Call (cognitive 18): skillScriptTool.Call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4 (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":"skill_script.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8dff026b20c7bea8ace709b2bc4042f986edf9c17eabe30c3c84e40fd4d325"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.agenticExecutor (cognitive 17): runtime.agenticExecutor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 496). 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":"agent.go"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c55de4594753cfa155e093469cc35957e1b748d0dad2a1f8d802f3023829fd"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.newRunConfig (cognitive 17): runtime.newRunConfig has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runoption.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7f770e812a182d0da4191314d40f95d98d05e8d891adcbee78ed11da80f229"}},{"ruleId":"D2","level":"warning","message":{"text":"observe.Sanitize (cognitive 17): observe.Sanitize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"observe/observe.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7f4662de3a8284a176dee8aca29aa5178f90c1f4bf29f1b3be6476d2607e32"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetConflictFix.Apply (cognitive 17): BudgetConflictFix.Apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), 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":"plan/fixes.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7d75a6cd1db32389e39fa13a7771cb25b4e29685a10bdffd62b65f07bdc144"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultRouter.Route (cognitive 17): DefaultRouter.Route has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"route/router.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3dac6ca692733c0d4f4b0a3681c267163715b26ae6837ab6dd9fb13e64f58a"}},{"ruleId":"D2","level":"warning","message":{"text":"remoteTool.Call (cognitive 16): remoteTool.Call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 1 (2 pts) (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":"mcp/mcp.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f312af07172b5b2eacd02f8ce1c0e60ac4b5ec2bf12b16f820e4daeb87f9b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"observe.containsFold (cognitive 16): observe.containsFold has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"observe/observe.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e98092ebe494e7bd1a94d5581ef0cbc36714a3e83b0858cdf7982352a25332"}},{"ruleId":"D2","level":"warning","message":{"text":"plan.Optimize (cognitive 16): plan.Optimize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/optimizer.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9827686074f3a65eeb42e65580ed3a74cf32db46f14e34099e73484c7cd8d89e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./agent.go: FileTooLong \u2014 1617 significant lines (blank, comment-only and punctuation-only lines excluded), about 60% of them inside a single declaration: runtime (18 blocks, 287-1885). The bar is 500 significant lines; this is 1117 over it, 3.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24d26b68986bce67f5c45c2d6afbaaedf2dd5f76c30fbc5cd6c49aec8968d29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: runtime.runComplex: MethodTooLong \u2014 runComplex runs 244 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eb142ba4a6fc591a3a86c40ac58a2b621c283f8488f28c4fc632b35a530e19"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: runtime: ClassTooLong \u2014 965 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods, 18 blocks, lines 287-1885. The bar is 400 significant lines; this is 565 over it, 2.41\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9369b432b684280341b4b52fdf79bf40c4a4dda4b93d6b902524e18fd34c1c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scheduler.Run: MethodTooLong \u2014 Run runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/scheduler.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"53285f24c45b5f471bc0b7510353440bc92a060e1feb3ee6b135fec3857e0748"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Executor.Execute: MethodTooLong \u2014 Execute runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/execute.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed329a9aef2983a3d805582d03b0f4f9890fcf3035c1e8354e6cfc8d946a9dec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: runtime.run: MethodTooLong \u2014 run runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ebfbfa9210642acf12555dea5665bf4eb62847595d6f2eda407c1c120f9550"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Runner.RunInput: MethodTooLong \u2014 RunInput runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/react/react.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dd7d18403d42ccdb0421ad640319116848cced8714002d9f4c33a2f6dddcee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: docker.New: FunctionTooLong \u2014 New runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/config.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aee17ecfb2281e7525beefc73debec8b54b4e1315050578d32eb973d10c47bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): agent.go:397-429 | agent.go:431-464 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0d6c998a4858bb2cfd0f3ca612ada0823287b004f2d9aec28765dc909595b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agent.go:375-384 | agent.go:386-395 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfa69f19340bb938fb6c2db9786179c1262a4bc4477126b6329f9350ce19ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): middleware/middleware.go:81-89 | middleware/middleware.go:106-114 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/middleware.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1442e2d78b3fae399e144f8d3a6af52c3dabaf5cfc6dda1eb4d508e9e606c4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): adapter/otel/otel.go:91-98 | adapter/otel/otel.go:100-110 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/otel/otel.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"322b3326850fed63fb34b1154efde12d38a790e0450721be7a2257f280e30459"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): speech/tools.go:66-76 | tool/tool.go:336-346 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"speech/tools.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2031feae8f3d5e4e756587c04c7a5224452ef848f54f1859ffd316f1f6180eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): adapter/speech/doubao/wire.go:89-98 | adapter/speech/doubao/wire.go:100-109 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/speech/doubao/wire.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda5fe3a6dfc52f6e5c49c5bf7c77f69b8fd85dd719113fdbf4a3bfc13653a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/runtime/exec/resolve.go:62-72 | internal/runtime/exec/scheduler.go:421-431 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/resolve.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c127523de7aa78e380ff5c4feb8bca25bb0ff757d6bb8caa70593d33d88fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skill/script/docker/config.go:256-264 | skill/script/docker/files.go:112-120 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/config.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ab58f04dfbffd3c8dc1f6f2c90104d5d75e1a971823b7deab9649f61d65951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agent.go:865-877 | agent.go:1447-1459 \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 \u0060agent.go:865\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":"agent.go"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"991aa9cc8715eec5c39bf0edf37d862aee28e771201b8123349d301ccaa8f4cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agent.go:1027-1039 | agent.go:1815-1827 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent.go:1027\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agent.go:1814\u0060 calls \u0060cancel\u0060 and \u0060agent.go:1026\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82ee66d8c4e3d0e9b69cbc857780cf15f888a3ee136cf632030282d5ee9b5ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/runtime/exec/scheduler.go:180-191 | internal/runtime/exec/scheduler.go:219-230 \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 \u0060internal/runtime/exec/scheduler.go:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/scheduler.go"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"100f8ae8c646773f67106fafcab30563447aadb1cb420973f5420db08c0cdfe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agent.go:400-409 | agent.go:433-442 \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 \u0060agent.go:400\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":"agent.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c377d9bfd55b918fa28a396f3f8df254bac018fabc669691d219d6aeafc6e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agent.go:904-913 | agent.go:1489-1498 \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":"agent.go"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f95c45a8c115fc2a62cb803b4d38716bb19cd46384238c54bf2e138d954d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agent.go:418-426 | agent.go:453-461 \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":"agent.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a35836212194e413adf5fb350eaafa03990ac481f17d2a7b06817d8e05daf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agent.go:2072-2080 | agent.go:2091-2099 \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":"agent.go"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1fd026d833a6d7234b96a4f137f6e52354045c9f03a24abc39571f3c045aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): speech/tools.go:69-76 | tool/tool.go:339-346 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060speech/tools.go:69\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"speech/tools.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7915a8e0bd20b18c1c746a91ac078b0966741b299b20725d02cf0d13fd11cd3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tool/tool.go:348-354 | tool/tool.go:373-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/tool.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ea562066dea3f89b0175287718b372e816373de59dbd4820657440b6427ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): adapter/model/openaicompat/openaicompat.go:533-540 | speech/tools.go:67-74 | tool/tool.go:337-344 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060adapter/model/openaicompat/openaicompat.go:541\u0060 calls \u0060Len\u0060 and \u0060speech/tools.go:75\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59a0a246d5e9a16c1f1367a1da5c815c920450202779466b288d2040ff931ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent.go:751-756 | agent.go:1166-1171 \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 \u0060agent.go:751\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":"agent.go"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df4ab31954e71c83233c78d650f65e7edab258536a26c69b135f8eb3ec3e66e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent.go:551-557 | internal/runtime/exec/scheduler.go:371-377 \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. Check import visibility before settling on that home: \u0060internal/runtime/exec/scheduler.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"f182c98f9692f71d74299b462a1792bfe20d6d82670d0e68e395cf9abb55f6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): plan/rule_fixer.go:178-190 | plan/tool_validation.go:116-128 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/rule_fixer.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42c128b16f6cb708b6ba6da8e826b4b150cc82b75c8ef3e7f31b6127ef5ec39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skill.go:162-168 | skill/script/docker/files.go:20-26 \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":"skill.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b6c638b45172e1844de97573c472bd10a4c1571a22cbe253589adf5469081d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): modelcounter.go:28-36 | modelcounter.go:51-59 \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":"modelcounter.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bba4eea76131d36b83357d261ca71ada4e512024932019fa9d3366f72454f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent.go:880-885 | agent.go:1467-1472 \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":"agent.go"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b331baae74f7c083ae720146080df07ebafdd8ffd5db15073104ae4c0dfdcb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agent.go:895-899 | agent.go:1482-1486 \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":"agent.go"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b5ffd29f0ea84080ca5864a2edd540f7eabd2a4b771b58c873e27ac03a1c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agent.go:1068-1072 | agent.go:1850-1854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agent.go:1857\u0060 calls \u0060cancel\u0060 and \u0060agent.go:1075\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d67054e910395d1937ff8b1bf59b1db77e2dc8c86400484522d45b5741ef65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): examples/00-chat/main.go:12-27 | examples/08-observability/main.go:14-28 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/00-chat/main.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b063aff3d79e2062fe0e59ea6300b27bebf1f4688e96978fde2b336a7f718b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): examples/14-skills/main.go:23-29 | examples/15-docker-skills/main.go:29-35 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/14-skills/main.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a42037b7540f15a309fd8b86d9265374b348c25bcdf482d41a26b0acffd411d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/10-full-agent/main.go:63-74 | examples/11-household-workflow/main.go:133-144 \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":"examples/10-full-agent/main.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1586fd4340067933af773891c343abd979efb9bf0f8a557b5cdddd6782fad23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/14-skills/main.go:35-41 | examples/15-docker-skills/main.go:41-47 \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 \u0060examples/14-skills/main.go:35\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":"examples/14-skills/main.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b7d8e04a44b6c69070edad2a6e8962338bed4b0961491f54af53a2c0536e23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/14-skills/main.go:24-29 | examples/15-docker-skills/main.go:30-35 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/14-skills/main.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f93a68cded316d45fa8b1782d315ae7c4522ba22e4ecbc224d132e01f03860"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: adapter/otel/otel.go: 0.0% line coverage (0/84)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/otel/otel.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8735c0389ab612481d8289461420abec8cbda6516d5ceb2a2eb20dbaed09d9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: config.go: 35.7% line coverage (10/28)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a0357f7d3cfb92da49d765520437029781e9b6464150cf9c297dc824406e49"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: contract/contract.go: 0.0% line coverage (0/2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contract/contract.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a79342cda6c597806caab773ff39ee8e16406c9142845fc0f6a016301fa0e1b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: eval/eval.go: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/eval.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9ed977c6c9116495d57c0a848f746e20a10f7006a7490b5a087306c846181a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/00-chat/main.go: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/00-chat/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e263779540a5c76c388467c1baa7ad9eec47103a2d07db833d1e0302d40410d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/01-stream/main.go: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/01-stream/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77dfe3ec5ebcb699780ff15565fcb9567f06e57a899cddfd7ce3ef7d61b715"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/02-function-tool/main.go: 0.0% line coverage (0/14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/02-function-tool/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"010fd3316c805bb1879548d1415ffc9ea3c1cac52143799995ec5fcab552eeea"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/03-retry/main.go: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/03-retry/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ed42d63d860733a897832cbaf7fb4362ce417312d4fa8125e3901d9ced46a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/04-fallback/main.go: 0.0% line coverage (0/4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/04-fallback/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0013baa351d267c9b3b610828b19e81112f589710be6a8683335094007dd04"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/05-local-mcp-server/main.go: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/05-local-mcp-server/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb4db60c128c2057e15f1ae43281b857b4f5f294cf7e073008905285383b3a6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/06-mcp-client/main.go: 0.0% line coverage (0/50)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/06-mcp-client/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fadd1107ec1cafd7a4bf68209cbc606f7be4d93f98862522cb2829d03a3e0f6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/07-complex-plan/main.go: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/07-complex-plan/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dc6e7e310898f1a07005829d5b66d64c6fcbe2a89b69a84db1f560e372e0ed"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/08-observability/main.go: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/08-observability/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"579a0920af274209c9fd2a6565d7a2b65ce824abeffab0d1922d05b590ea79f5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/09-config-agent/main.go: 0.0% line coverage (0/7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/09-config-agent/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f30e6c13ae0720398929079ae037d317f55b1e40a5b9445c01640ce45d63fcc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/10-full-agent/main.go: 5.6% line coverage (3/54)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/10-full-agent/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60ddb6603158eaa34c13d038065130717c0b21425284de9060dad6bf36bb688"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/11-household-workflow/main.go: 6.3% line coverage (6/95)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/11-household-workflow/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc2889725cfcc956ca90da46b52aba97e176b35624805cca7764c9c7ca250e3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/12-doubao-realtime/main.go: 0.0% line coverage (0/72)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/12-doubao-realtime/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f269703724c19aa8cb7315855fde624d8a93ea5442e06b5c32f502f4aff36f50"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/14-skills/main.go: 0.0% line coverage (0/43)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/14-skills/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f735bb98736721d05ccf738dddbd54c7014d630b98233b72894f609f045acd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/15-docker-skills/main.go: 0.0% line coverage (0/81)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/15-docker-skills/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de8b813c7ba9445d7526ca6cee4274dd3a652e4c44a29e3956a351760434e22"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/runtime/exec/resolve.go: 46.6% line coverage (27/58)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/resolve.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62dcc570c96bf2c398ec75aece7d68d26a98f72658363d8ed0da0e135325ced"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: policy/decision.go: 20.0% line coverage (5/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"policy/decision.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4574b94abfbf5dbfec797253259acc8e2f638f022ceceb3846c6d412b8d8a6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: route/router.go: 47.2% line coverage (34/72)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"route/router.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac41767ad4b45e82f6aa46393e16f73b155290f8929150169757da7f9f62f3fa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: skill/script/docker/engine.go: 7.3% line coverage (4/55)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/engine.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4bdd717be194408be84e2c6225648d0d74f6295a84d886ed8a466c56a41469"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tool/broker.go: 41.7% line coverage (10/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/broker.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30f8f0bdee6a31f70ca38948f196c3e6d920084abe8e9409d8ec0755db2b71b"}},{"ruleId":"D8","level":"note","message":{"text":"Tests reach code only in some runs: adapter/speech/doubao/client.go: 6 line(s) (358, 360, 404-407) were executed in some of the 3 runs of the suite and not in others. A test that does not take the same path every run only tests the part it always takes, so these lines are not counted as covered. Make the tests that reach them deterministic (a fixed clock, seed or ordering, or waiting on the event instead of on time), or test the paths directly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/speech/doubao/client.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8723738bfaff5e1c99edfe03315c05724f380c5bf1e37b1452412a269b83b60"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/cocoyes/zhizhi-agent-runtime/adapter/speech/doubao.TestSessionLifecycleAudioAndFunctionCall: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"795a30414c4a06d6eb55157d05d079cb2ebd61dcf3c2f07d11ef6b252c499646"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent.go: agent.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in runtime.runComplex at line 1177. 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, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 16:20:32 \u002B08:00\u0027 --until=\u00272026-11-01 16:20:32 \u002B08:00\u0027 --full-history --no-merges -- agent.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e82125669abaa994d3b09310d3a84dfe809548118d809e77ceb2bce8615432"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/exec/scheduler.go: internal/runtime/exec/scheduler.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in Scheduler.Run at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 16:20:32 \u002B08:00\u0027 --until=\u00272026-11-01 16:20:32 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/exec/scheduler.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/scheduler.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdedb021a044246b96157f7092ed9b4124115c586599fe534bf24475a45b0d4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/react/react.go: internal/runtime/react/react.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in Runner.RunInput at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 16:20:32 \u002B08:00\u0027 --until=\u00272026-11-01 16:20:32 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/react/react.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/react/react.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d32b74693b187b1a94a90ff5978c8920724fba8d8c9c6eb63b197a01c1a839c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: policy/policy.go: policy/policy.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in Runner.Execute at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 16:20:32 \u002B08:00\u0027 --until=\u00272026-11-01 16:20:32 \u002B08:00\u0027 --full-history --no-merges -- policy/policy.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"policy/policy.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1761a1a21dbb1afea4ef1d7131a8291822a2392cce9c01c7a6882ac59537541"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plan/plan.go: plan/plan.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Plan.Validate at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 16:20:32 \u002B08:00\u0027 --until=\u00272026-11-01 16:20:32 \u002B08:00\u0027 --full-history --no-merges -- plan/plan.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/plan.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfe3d375bb274f00a11133a14dbe866c39174cc24b793d9ead3777d12148829"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plan/replan.go: plan/replan.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in plan.ValidatePatchCompatibility at line 110. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 16:20:32 \u002B08:00\u0027 --until=\u00272026-11-01 16:20:32 \u002B08:00\u0027 --full-history --no-merges -- plan/replan.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/replan.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"61631faa5ca992f3b7c348946d351f485d2a838c830c677184f06fb8fbbc3df6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: adapter/model/openaicompat/openaicompat.go: adapter/model/openaicompat/openaicompat.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Client.request at line 151. 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, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 16:20:32 \u002B08:00\u0027 --until=\u00272026-11-01 16:20:32 \u002B08:00\u0027 --full-history --no-merges -- adapter/model/openaicompat/openaicompat.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fc3f6bca30ca703bcced22adf1ff3b9a36760f0bb6dae1a46cf64b05ca0a42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plan/planner.go: plan/planner.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in plan.decodePlan at line 89. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 16:20:32 \u002B08:00\u0027 --until=\u00272026-11-01 16:20:32 \u002B08:00\u0027 --full-history --no-merges -- plan/planner.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/planner.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a671736fab8d8afbdceff13766ea7a59f5155163bb5bad384492038ef4113371"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plan/tool_validation.go: plan/tool_validation.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in plan.ValidateAgainstTools at line 17. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 16:20:32 \u002B08:00\u0027 --until=\u00272026-11-01 16:20:32 \u002B08:00\u0027 --full-history --no-merges -- plan/tool_validation.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/tool_validation.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbeb73ae99cf4fcef0e5ebc8f39cbbd943674d161afedc7e2b640294a50f4ffd"}},{"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"629fe3ecc66e7c92e95655cd793b1631367cc8dd27f9abcfbf0299456ba4a2a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77b5956e63f73573b32eacced3951798fa4bd06341075c7c2b23b48e8d87edc9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"093cd46ab5c804b892e4a86bd71e5aad9fb9fbf5f6ac6711f8c92837bba5285f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"396b2247fc32f2fdf611e6685c9762be4d6e91f0b967946e2b2e1b7f2656133b"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","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":"1b48d494da732da196da8326c947248072a3ce1c3e11f611e272dedd93079ed2"},"properties":{"dependency":{"package":"github.com/buger/jsonparser","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","GO-2026-4514"],"severity":"high","fixedVersion":"1.1.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d94222fa9934edd47ba3a0ef99e3a7d85a9c2a0dac93507e5359a1abb9d5d840"},"properties":{"dependency":{"package":"stdlib","version":"1.25.0","advisory":"GO-2025-3955","aliases":["BIT-golang-2025-47910","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.25.1","relation":"direct","declaredRange":"1.25.0","reachability":{"kind":"production","file":"adapter/model/openaicompat/openaicompat.go","line":198,"symbol":"http.NewRequestWithContext"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec7853619c055f78393829d380806cfc155be3c1c5f6b20bc2d7213326a680c"},"properties":{"dependency":{"package":"go.opentelemetry.io/otel/trace","version":"1.46.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"1.47.0","relation":"direct","declaredRange":"1.46.0","reachability":{"kind":"production","file":"adapter/otel/otel.go","line":19}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"362d19fbc20680c130f6d3f829465778e97203407075f4ceb76a4cf0cc41a027"},"properties":{"dependency":{"package":"golang.org/x/sys","version":"0.41.0","advisory":"GO-2026-5024","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.44.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76d999f7f0da1c7805a61d7a77ca6e9d78cdf7e7d953cafe7b73d81759ae1a99"},"properties":{"dependency":{"package":"golang.org/x/text","version":"0.14.0","advisory":"GO-2026-5970","aliases":["[CVE redacted]","[CVE redacted]","GO-2026-6629"],"severity":"medium","fixedVersion":"0.39.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D37","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":"2e96dfd6d93fe913fb2e9028610c982dbd322c76ecf26cfdd7734b74da991d0f"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Session (16 methods): \u0060Session\u0060 declares 16 methods: \u0060ID\u0060, \u0060SendAudio\u0060, \u0060CommitAudio\u0060, \u0060SetMuted\u0060, \u0060Say\u0060, \u0060ReplaceSpeech\u0060, \u0060CreateItems\u0060, \u0060UpdateItems\u0060, \u0060RetrieveItems\u0060, \u0060DeleteItems\u0060, \u0060Update\u0060, \u0060CancelResponse\u0060, \u0060Recv\u0060, \u0060SubmitFunctionOutputs\u0060, \u0060ExecuteFunctionCalls\u0060, \u0060Close\u0060. Counted over the exported method specs the interface itself declares, once per name; an embedded interface is a role it composes, judged on its own declaration, and is not counted here. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"speech/speech.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e8ea45b0c8087f9a1c691bbb61cce746693ddaf761caadbab86a21a307cc9d"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add gosec / govulncheck (or golangci-lint) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060go.mod\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"go.mod"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a2e1d4ec30322a872affe28883b4491a6c0e2043ba24bdb2e79623c819f5b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(r \u003E= \u0027a\u0027 \u0026\u0026 r \u003C= \u0027z\u0027) || (r \u003E= \u0027A\u0027 \u0026\u0026 r \u003C= \u0027Z\u0027) || (r \u003E= \u00270\u0027 \u0026\u0026 r \u003C= \u00279\u0027) || r == \u0027_\u0027 || r == \u0027-\u0027\u0060 appears character-identically in 3 files \u2014 adapter/model/openaicompat/openaicompat.go, speech/tools.go, tool/tool.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"484c9258653aa821e5ddf4ed99c998eb4507a07bbf4f6eeab352b26ea1a40f10"}},{"ruleId":"X26","level":"warning","message":{"text":"Collection crosses a callback boundary unsynchronised: \u0060ExecuteFunctionCalls\u0060 starts a goroutine on every pass of a loop, and each one writes \u0060_\u0060, a variable declared before the loop \u2014 \u0060_ = \u2026\u0060 on line 328. The loop never waits on \u0060group\u0060 before its next pass, so the goroutines of successive passes run at the same time and each one\u0027s write races the next one\u0027s; waiting on \u0060group\u0060 after the loop orders only what follows the wait. A goroutine\u0027s closure captures \u0060_\u0060 by reference, so every goroutine and the body use ONE variable, and a plain variable has no synchronisation of its own: by the Go memory model a write concurrent with any other access to it is a data race (the race detector reports it), a racing \u0060\u002B\u002B\u0060 loses updates, and a racing read sees a stale or torn value. \u0060group\u0060 is a \u0060sync.WaitGroup\u0060, which orders the handoff\u0027s signal and takes no exclusion over the variable\u0027s own state. Guard every write to \u0060_\u0060 with one \u0060sync.Mutex\u0060, or have each goroutine send its result on a channel that this body alone receives from and writes into \u0060_\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/speech/doubao/client.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd5bd790b6af3590266df1ea32fc00750a27f18ecc49c8e580600fe964910b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060encoded, _ := json.Marshal(step)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060encoded\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060encoded\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060encoded\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f1b0dd0cda8e8b2e1eaee26ed82f0872640873ef08be086645aed7fdbecf83"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060encoded, _ := json.Marshal(raw)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060encoded\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060encoded\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060encoded\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37174ffc5c43bd6b7f4bc64bf2da007049f9e38f2c4e96afca9927162c8edc5"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060encoded, _ := json.Marshal(raw)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060encoded\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060encoded\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060encoded\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent.go"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"344ff226932e5f7c3ae8670c40bf3af44062dea4be13dbd8518e81350064d42a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(in)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac891fdf2a2455adcdbe82734ff198a814c651b44c9d3fa1fb3e629d19b4986a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err = os.MkdirAll(p, 0700); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/config.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff32669aaa75533b363ba8719a09c4e41dd9568bdd507174f0725615ec212c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if executionErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/execute.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bd8ff2f13b049c76ab56c3f8a079e173fdd27c77414ffdd77c54356f4a049b"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(w)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/script/docker/files.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6772430a6c58f26d6fc6de327bd7408ecc82dc77f3480bafe5b94385a5720c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"observe/observe.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ce17f050c3aa3f7a47fc1f0b323ad1b432c875d0837785cf5d8c5526937a0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (an error-returning call as a bare statement): \u0060result.Close()\u0060 returns an error, and the statement drops it: when \u0060result.Close\u0060 fails nothing records it and the code after it runs as if it had succeeded. Check it (\u0060if err := result.Close(); err != nil { \u2026 }\u0060) and return or log it with what was being done, or assign it to \u0060_\u0060 with a comment saying why the failure cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/capability_provider.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bfab28d9d86cb648fd1ef300df828d0da9c525b8edbe38ef9ab84977ba6de0"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (an error-returning call as a bare statement): \u0060result.Close()\u0060 returns an error, and the statement drops it: when \u0060result.Close\u0060 fails nothing records it and the code after it runs as if it had succeeded. Check it (\u0060if err := result.Close(); err != nil { \u2026 }\u0060) and return or log it with what was being done, or assign it to \u0060_\u0060 with a comment saying why the failure cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/capability_provider.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"31deae8882fd666cf0491d818c49da3580bd3a8dcab6900effd79db9e57d7818"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (an error-returning call as a bare statement): \u0060result.Close()\u0060 returns an error, and the statement drops it: when \u0060result.Close\u0060 fails nothing records it and the code after it runs as if it had succeeded. Check it (\u0060if err := result.Close(); err != nil { \u2026 }\u0060) and return or log it with what was being done, or assign it to \u0060_\u0060 with a comment saying why the failure cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/capability_provider.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc80036c4cb99c01785f6ee8c406214ac7a5c74489a9460d5aecfe4c2f9bd405"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (an error-returning call as a bare statement): \u0060result.Close()\u0060 returns an error, and the statement drops it: when \u0060result.Close\u0060 fails nothing records it and the code after it runs as if it had succeeded. Check it (\u0060if err := result.Close(); err != nil { \u2026 }\u0060) and return or log it with what was being done, or assign it to \u0060_\u0060 with a comment saying why the failure cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/capability_provider.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"476058ae6cef2f03306b3e6b5f5c30bb5e41fca16b2b093bec185a91f2c19c2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/security.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80e3488b2e5ed7c5a6210d1d7e01a90b77311001eac28575e7ac5336658b2f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/resolve.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7d28de968c13062f2281e2da9ddd94dda67b40f70d9e6621877755acd40bf9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/scheduler.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"797884b0679cfae017da9b7442ebb4c1e79e67e70f86bbf14c1784fdb452ee5d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(encoded, \u0026generic); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/scheduler.go"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bab7ba50f3666a91bf85b7dd69fe11cf60bbd6a51f8ba81c4e4d262dcaeadff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/scheduler.go"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"313a3c2ae0c46977321d5ddc560794e066e144ce961276084665af7f0bb4d9ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(encoded, \u0026normalized); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/exec/scheduler.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b5985cd1772a31325d7b56bf3ed7f4c33e169c56fbce21e564b183141b7642"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060result, _ = json.Marshal(map[string]string{\u0022error\u0022: err.Error()})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060result\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060result\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060result\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/speech/doubao/client.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd85e5ce15c1f70f51451fca35ec59852f80fc0238b3fa415021531112b626a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060tools, _ = json.Marshal(config.Tools)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060tools\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060tools\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060tools\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/speech/doubao/wire.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cc5864d4173b03bd747aeff8afa889907c6d1524f3ca368286d826d5d3fe12"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := io.ReadAll(io.LimitReader(resp.Body, limit))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060io.ReadAll\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter/model/openaicompat/openaicompat.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede70ef480f802d285858c11ccdaa6a2433842f9f5846aec6089d2a6d182c320"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060promptData\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u003Cuntrusted-evidence encoding_error=\\\u0022true\\\u0022\u003E\u003C/untrusted-evidence\u003E\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/security.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"46eb7754c3a98c4af8ff137da5b00a4e2e4e0137cba58ec83c8073e48cbf102f"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.Contains(msg, \u0022tool_budget\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060strings.Contains(msg, \u0022tool_budget\u0022)\u0060 also satisfies \u0060strings.Contains(msg, \u0022budget\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plan/fixes.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"915e3508388cd2c7bbf8daaa04776da332c040888e24970861283500f0c2ac65"}}],"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-252","guid":"78915dc5-e486-f858-bc3c-aa570ad9010d","name":"Unchecked Return Value","shortDescription":{"text":"Unchecked Return Value"},"helpUri":"https://cwe.mitre.org/data/definitions/252.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-391","guid":"d9ef5687-8d79-9b51-b509-b83411fbcdc3","name":"Unchecked Error Condition","shortDescription":{"text":"Unchecked Error Condition"},"helpUri":"https://cwe.mitre.org/data/definitions/391.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"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":13,"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."]}]}