{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"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":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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":"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":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"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":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"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":"cmd.newRunCommand (cyclomatic 64): cmd.newRunCommand has cyclomatic complexity 64 (threshold 15). Most of this is not in the body itself: 1 of the 64 points is its own statement and the rest belongs to one function literal inside it that branches (line 388). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/root.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7637793af17cbddd5b267dd8be26e2ce3dd3c95e86d674e1d1196a2fa17386"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::parse (cyclomatic 64): (anonymous)::parse has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent 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: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":3379}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd0e2241815f6f6800a3228b173c211e634530a35812f4adcc9b46a313afc15"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 45): (anonymous) has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 12 of the 45 points are its own statements and the rest belongs to 43 function items inside it that branch (a function literal at line 226, getInput, exportVariable, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa42422e547cfbe6fdb8bbc707b013b04a536985252ec207240e39996f2b3e1"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 35): (anonymous) has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 8 of the 35 points are its own statements and the rest belongs to 19 function items inside it that branch (a function literal at line 41, a function literal at line 25, a function literal at line 18, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97104f5d6ae135fb542845c21fc227b90cfdd7e0caaff46a6dc5d49b885f9dd"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.execAsDocker (cyclomatic 32): runner.execAsDocker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"2107d6338ed0403654e4a4039f351eb3fbee8ac777c2e5819b4c4e777bbc54c2"}},{"ruleId":"D1","level":"warning","message":{"text":"workflowpattern.PatternToRegex (cyclomatic 31): workflowpattern.PatternToRegex has cyclomatic complexity 31 (threshold 15). Of this number, 28 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":"pkg/workflowpattern/workflow_pattern.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"85626c4be2aff387f676f5c1ee471d040aad06fbf5f43735dfcb73048cdbe6e8"}},{"ruleId":"D1","level":"warning","message":{"text":"container.checkRestrictedHostConfig (cyclomatic 29): container.checkRestrictedHostConfig has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_options_policy.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3da53afa0f28bb1b5b76038c6fd8b0a23e6277dbcb8549ab3645351a7ac3c10"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 28): (anonymous) has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 3 of the 28 points are its own statements and the rest belongs to 34 function items inside it that branch (a function literal at line 928, a function literal at line 783, a function literal at line 827, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e3f7defca0883468e6c265aa0c96ea7dadf98c50bb54ff51dd450ed433a55d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 27): (anonymous) has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 6 function items inside it that branch (ensureAbsoluteRoot, safeTrimTrailingSeparator, dirname, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7275f19b57868b109260e6b8758aa66fc0c90f931a8deb17e77eac88ccf8f23"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::expand (cyclomatic 26): (anonymous)::expand has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2955}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63457a5459ef429082107b66dc2c364594d3583661f6d73e25a334bada96bf5"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::matchOne (cyclomatic 26): (anonymous)::matchOne has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":3869}}}],"partialFingerprints":{"codehealthFindingId/v1":"b195c568799c2424b86c5b63ed4d81a3946087987687770ef747d25d53b856bc"}},{"ruleId":"D1","level":"warning","message":{"text":"FileCollector.CollectFiles (cyclomatic 25): FileCollector.CollectFiles has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to one function literal inside it that branches (line 154). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/filecollector/file_collector.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc98a215a80016776bb79d47cfbfe0c37d92dfc0f44e3cc69bcd08cbd599bfa2"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpClient.request (cyclomatic 25): HttpClient.request has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to one function literal inside it that branches (line 2364). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eab42788f7244a160673698cf53e3ce3ac348bd86828f46b1c21eef321cc716"}},{"ruleId":"D1","level":"warning","message":{"text":"git.NewGitCloneExecutor (cyclomatic 24): git.NewGitCloneExecutor has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to one function literal inside it that branches (line 335). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/common/git/git.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eaa7a56a3303082c61a07f11dd68bc8e6a49c0e280385d49f2bb430021db6c7"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpClient._getAgent (cyclomatic 24): HttpClient._getAgent has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4d6a8d2f2c696860d06b7e37d63993459b2e03790006920f0040ca69523554"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 24): (anonymous) has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 127, toString, a function literal at line 115, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af7af8f40aacc1874e781a8ffa4b0b08af3475f3ba61299f4ccdf25e1bc7367"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_getAgent (cyclomatic 24): (anonymous)::_getAgent 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b5e49e8e19a517defe27a1e17012817ff091a63ab174f0aab4c590b18b0520"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 24): (anonymous) has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 3 of the 24 points are its own statements and the rest belongs to 24 function items inside it that branch (mergeOptions, TunnelingAgent, TunnelingAgent::onFree, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":4044}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3a116e87d6fa4070a3698f46470d031e4ebd2e08118968b460ee1ede6ae124"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::v1 (cyclomatic 23): (anonymous)::v1 has cyclomatic complexity 23 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":4649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25c0e8f3be5a0890ae9ec08de0cd0377cd8219c59e64fe259226917e05aa39d"}},{"ruleId":"D1","level":"warning","message":{"text":"interperterImpl.evaluateFuncCall (cyclomatic 21): interperterImpl.evaluateFuncCall has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/exprparser/interpreter.go"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"0436f4150302f9c222ae1ef46612b8cc962d9127a98d8f5560fec0e7c1178883"}},{"ruleId":"D1","level":"warning","message":{"text":"Handler.gcCache (cyclomatic 20): Handler.gcCache has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/handler.go"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e593b9e5e721e8a41f84d91382f435713f8f547a29dbe3ce1b959a988fd7638"}},{"ruleId":"D1","level":"warning","message":{"text":"artifacts.downloads (cyclomatic 20): artifacts.downloads has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 338, 390, 303). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifacts/server.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a6b1c4ccb7d6f3f131a1292e4da981c7ae145b6fe73ea0222b1d27bf6afad4"}},{"ruleId":"D1","level":"warning","message":{"text":"Job.GetMatrixes (cyclomatic 20): Job.GetMatrixes has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/workflow.go"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b607c0584b1550ccf85e1043879ba0782d9cf97977bfad0467d3cb603378852"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContext.startJobContainer (cyclomatic 20): RunContext.startJobContainer has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 259). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a1455d0055d8afd37f914205d059ead9a734ffb98fc227f40b693057d9c5d2"}},{"ruleId":"D1","level":"warning","message":{"text":"model.NewWorkflowPlanner (cyclomatic 19): model.NewWorkflowPlanner has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/planner.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26ce50a5d4cc8ff7571dbd487e1bf4fc45f8d2b06bd492072ed7b43eee5598d"}},{"ruleId":"D1","level":"warning","message":{"text":"stepActionRemote.prepareActionExecutor (cyclomatic 19): stepActionRemote.prepareActionExecutor has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 41). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_action_remote.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc1b33b1c05accebd153661ec9b73703229804a432947b4a4e47547e908048b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 19): (anonymous) has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 571, issueCommand, a function literal at line 559, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"6385cd060dff7e828c3be94de53e7997f08c7f2f2389158dccc3781781144a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"artifacts.uploads (cyclomatic 18): artifacts.uploads has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 225, 206, 283). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifacts/server.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b856e2890cf77b86a2965f8b1789f8b81be8151838f2046adb2da573a58edf4a"}},{"ruleId":"D1","level":"warning","message":{"text":"container.parseEnvFile (cyclomatic 18): container.parseEnvFile has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to one function literal inside it that branches (line 16). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/parse_env_file.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb93cf0cc2162f1ad470c48c3436db43cf22f620eec3b56e6894260990a802ad"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.getEvaluatorInputs (cyclomatic 18): runner.getEvaluatorInputs has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5141b32100c9e742cc16bcfa86d48791f7ee9a23827ef452d8e03c178b897d"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.sanitizeTerminal (cyclomatic 18): runner.sanitizeTerminal has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/log_sanitize.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"58467c207bf9d9b8689415117cae7d0d61bda8d8a23b49edb90c6dfc79117e2a"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContext.commandHandler (cyclomatic 18): RunContext.commandHandler has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to one function literal inside it that branches (line 39). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/command.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a5f38e14262eac22f9b0424b48d4751cf9fa7d2ef45c94e89d8b19e7d5c73b"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.rewriteSubExpression (cyclomatic 17): runner.rewriteSubExpression has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d606dbfe1f755ec3895c8b8aa31be2bd85a654da7a34bf4c966325eb3d117d2"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.newJobExecutor (cyclomatic 17): runner.newJobExecutor has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 104, 42, 85, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/job_executor.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd890a378d87c39b3e95bc3a27e0d49f88529868861a8429e646d65c1485d16c"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.UnmarshalYAML (cyclomatic 17): Node.UnmarshalYAML has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/schema/schema.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ab1d133a28ad99dce27b07202c00793da138e5f14e7f3b1505c527c54e77d8"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultGlobber.globGenerator (cyclomatic 17): DefaultGlobber.globGenerator has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 1231). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"441a961c911461a6c99402f56b5f68748fa90ceda02056d998edd916a8acf914"}},{"ruleId":"D1","level":"warning","message":{"text":"Pattern.fixupPattern (cyclomatic 17): Pattern.fixupPattern has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeb2f98a4411cfbaff561bc1cd02c8f82450bae7b4137c71cbb4ce31ddbe5bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Pattern.getLiteral (cyclomatic 17): Pattern.getLiteral has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6e32657bf9fd9e04742e4cf1693221598b74c78c42e0429c5b4e366f918c6e"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 645, a function literal at line 662, a function literal at line 607, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaad80f49377dfd9df71ca6eadb9d2a55e3f188b339ab223e5cca108f1218f27"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 9 function items 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"0462cf41670eda89cd045d900c03de580f40c2676bf80d164579efc84f346ce2"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::globGenerator::globGenerator_1 (cyclomatic 17): (anonymous)::globGenerator::globGenerator_1 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3490a9e3ac78979b8c9192200ea8e3035e63f51860e699f92343517a71cf3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::getLiteral (cyclomatic 17): (anonymous)::getLiteral 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df9ca878f4c6d47a073767348684d3e63fcf4307a8c39e63b18251fb5ea8064"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContext.getGithubContext (cyclomatic 16): RunContext.getGithubContext has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d1434243208ce7aabe9fb20b59a732da48555471382cabac400c50fd06a99d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) 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 6 function items inside it that branch (checkBypass, a function literal at line 2730, getProxyUrl, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 17 of the 44 methods over the threshold \u2014 including the worst \u2014 and 194 of the 390 points over it (50%), 4\u00D7 the next-largest file (cmd/root.go at 49). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf625019efe711f7c58a6a719a6fbfae0d9a53f21024f9dc4d7901cec606b69"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parse (cognitive 83): (anonymous)::parse has cognitive complexity 83 (threshold 15). Drivers by points: if/else 24 (50 pts), boolean chains 11, ternaries 6 (10 pts), loops 4 (5 pts), error handling 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":3379}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafb27e201f64f6d7f03394ca515891d1ebe982767b4d437b546db1fcd9e693e"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.newRunCommand (cognitive 80): cmd.newRunCommand has cognitive complexity 80 (threshold 15). Drivers by points: if/else 53 (65 pts), boolean chains 10, loops 2 (5 pts) (nesting depth added 15). None of this is in the body itself: all 80 points belong to one function literal inside it that branches (line 388). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/root.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b52d75f8047d1a06da51dce9f18f7e8f697fcf4c20007325ee2c42ece37fde"}},{"ruleId":"D2","level":"warning","message":{"text":"Job.GetMatrixes (cognitive 71): Job.GetMatrixes has cognitive complexity 71 (threshold 15). Drivers by points: loops 10 (38 pts), if/else 10 (28 pts), match/switch 1 (4 pts), jumps 1 (nesting depth added 49). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/workflow.go"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97db6a9b97b24d96eaa3ce615d8940a97f6b3385ac830961cb634b97a386fb4"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.execAsDocker (cognitive 63): runner.execAsDocker has cognitive complexity 63 (threshold 15). Drivers by points: if/else 29 (58 pts), boolean chains 5 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c544c9ab476c9eab82c827213a0063dfdaabdb63733eaae5a19997608a5dd73e"}},{"ruleId":"D2","level":"warning","message":{"text":"workflowpattern.PatternToRegex (cognitive 63): workflowpattern.PatternToRegex has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (41 pts), boolean chains 10, loops 3 (6 pts), match/switch 2 (6 pts) (nesting depth added 34). Of this number, 61 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/workflowpattern/workflow_pattern.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ecfd379e734031e0ec1ceceb271986b37896f19f6794db665b34fa7544d59c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::expand (cognitive 58): (anonymous)::expand has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (42 pts), ternaries 3 (7 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2955}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bbdb3027a2dc6007942ea160d9a1b1561823fd53d9bc4bc8154603b768a41b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::matchOne (cognitive 52): (anonymous)::matchOne has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 3 (8 pts), boolean chains 7 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":3869}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63ac43011b93f5548b3e46b4b0830ac2e27e4b4676410cdd7b69c2a0fae07d8"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 50): (anonymous) has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 19, if/else 15 (19 pts), ternaries 8, error handling 2, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 11 of the 50 points are its own statements and the rest belongs to 43 function items inside it that branch (a function literal at line 226, exportVariable, getInput, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"551a45dd7e03845ae09a513f80589942a807cae7c3439cb673363418752320ac"}},{"ruleId":"D2","level":"warning","message":{"text":"model.NewWorkflowPlanner (cognitive 45): model.NewWorkflowPlanner has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 25). Of this number, 39 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/planner.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1ba65f8e1971369f223f03f4666717c8fa76af8d4e4e95fe635fbd11aa5df8"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpClient.request (cognitive 45): HttpClient.request has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 4 (10 pts), boolean chains 5, ternaries 1 (nesting depth added 24). None of this is in the body itself: all 45 points belong to one function literal inside it that branches (line 2364). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d818451cf9bd6befdc9d1ead516b4b1a84daba211a311b569671c85fc33dcbd1"}},{"ruleId":"D2","level":"warning","message":{"text":"Handler.gcCache (cognitive 43): Handler.gcCache has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 5 (11 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/handler.go"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"891557e39d1f4282a54e6874868e7b0580b2e83098db9da1e40022befd2231e7"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.getEvaluatorInputs (cognitive 43): runner.getEvaluatorInputs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"7910e2844dabe310c587d8f0c9b9140bfefc878ca299e89ad2d9c80449eb3616"}},{"ruleId":"D2","level":"warning","message":{"text":"runnerImpl.NewPlanExecutor (cognitive 42): runnerImpl.NewPlanExecutor has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 4 (9 pts) (nesting depth added 28). Most of this is not in the body itself: 1 of the 42 points is its own statement and the rest belongs to one function literal inside it that branches (line 133). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/runner.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7579a9b3cadc98ff3fc291b02d7f5520425c309a49ddad304bc6d965f5f0015b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 40): (anonymous) has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 12, error handling 4, ternaries 4, loops 2 (3 pts) (nesting depth added 6). Most of this is not in the body itself: 7 of the 40 points are its own statements and the rest belongs to 19 function items inside it that branch (a function literal at line 41, a function literal at line 25, a function literal at line 18, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"691cfe3cc42019310c7b9f814f99df15e85a78373b0096d3157ea01454bda91d"}},{"ruleId":"D2","level":"warning","message":{"text":"expressionEvaluator.evaluateMappingYamlNode (cognitive 38): expressionEvaluator.evaluateMappingYamlNode has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (36 pts), boolean chains 1, loops 1 (nesting depth added 21). Of this number, 33 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"485764ec358560a07b3bcaa074e8f64248a26a1c0388c876ff36621b2edb8300"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalRepositoryCache.GetTarArchive (cognitive 35): LocalRepositoryCache.GetTarArchive has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/local_repository_cache.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"978a0226542ec0e90c75b66ef6460d1fa5bcfd9649ae94209d075f652c91d6f0"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContext.startJobContainer (cognitive 35): RunContext.startJobContainer has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 5 (9 pts) (nesting depth added 15). None of this is in the body itself: all 35 points belong to one function literal inside it that branches (line 259). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee01255bc3f6c5b553d69eda0175475790edd22baa11ee566545b3d7d4207573"}},{"ruleId":"D2","level":"warning","message":{"text":"FileCollector.CollectFiles (cognitive 34): FileCollector.CollectFiles has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 10). None of this is in the body itself: all 34 points belong to one function literal inside it that branches (line 154). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/filecollector/file_collector.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f5172912291294d1ee7f62ccac7148b60954ef0fc2946e4e61613660e54839"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 33): (anonymous) has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 6, loops 3 (5 pts), ternaries 1 (nesting depth added 8). Most of this is not in the body itself: 3 of the 33 points are its own statements and the rest belongs to 24 function items inside it that branch (mergeOptions, TunnelingAgent::onFree, TunnelingAgent, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":4044}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1d2638173b6e6720411e5bc2fd645976bdb0a6d7fdf04671cf697f42ab7ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"common.GetOutboundIP (cognitive 32): common.GetOutboundIP has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (6 pts), match/switch 1 (5 pts) (nesting depth added 21). Of this number, 23 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/common/outbound_ip.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49f8dbb516063d39d0eca926e2d6680dd4730e5dd6ee97c2102ea773b56f800"}},{"ruleId":"D2","level":"warning","message":{"text":"stepActionRemote.prepareActionExecutor (cognitive 32): stepActionRemote.prepareActionExecutor has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). None of this is in the body itself: all 32 points belong to one function literal inside it that branches (line 41). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_action_remote.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0524a701e70e8de3b2c774bbf32ae41a4876f3a924a22639c4df1813259856d4"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.readActionImpl (cognitive 31): runner.readActionImpl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (31 pts) (nesting depth added 20). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f05fc7d9ee92f011df452b764c9593e070f7c4b1010d4af670b59d776802b2"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.rewriteSubExpression (cognitive 31): runner.rewriteSubExpression has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a899cb7b11054beee58b55f74551d6ac32a25c16fcef76aea26c2c76692ad96"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_getAgent (cognitive 31): (anonymous)::_getAgent has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 10, ternaries 4 (10 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4b1ee02ebce0cee702fa53302a17ff358f0ba0cd2ebea5dc1349882efb7933"}},{"ruleId":"D2","level":"warning","message":{"text":"container.parseEnvFile (cognitive 30): container.parseEnvFile has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 14). None of this is in the body itself: all 30 points belong to one function literal inside it that branches (line 16). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/parse_env_file.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0256bf0211999f3f3a5c491ad43e033987602c8106504ef6625599d191d6c93"}},{"ruleId":"D2","level":"warning","message":{"text":"Pattern.getLiteral (cognitive 29): Pattern.getLiteral has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"28967488ee1319faf3fe9494f27327f777df2e016f8341e1ee58804eb93a4a99"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getLiteral (cognitive 29): (anonymous)::getLiteral has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 4, loops 2 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafb04b8a8ac9d6fd7820cf4f72a298a837fc7b6b6939c44661432a5814728bd"}},{"ruleId":"D2","level":"warning","message":{"text":"git.NewGitCloneExecutor (cognitive 28): git.NewGitCloneExecutor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 5 (nesting depth added 5). None of this is in the body itself: all 28 points belong to one function literal inside it that branches (line 335). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/common/git/git.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01598309efa715372cdca3f0b290d9d70d37d34b446b96b76e04b645f7113fd"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.printList (cognitive 27): cmd.printList has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (4 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":"cmd/list.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0802eaabb61ab58484c05fc3152988b21c7fd4a7b8b24c00d86985186d1a05"}},{"ruleId":"D2","level":"warning","message":{"text":"interperterImpl.getPropertyValue (cognitive 27): interperterImpl.getPropertyValue has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), match/switch 2 (4 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/exprparser/interpreter.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a02599244e624d71d16972f9326bc0523ecf5f51b0867dd48167b16a2ea331c"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.checkMapping (cognitive 27): Node.checkMapping has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/schema/schema.go"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"475117af6e98e41e30e8c0d9cca4ed4ea0611aea848f20bafeba46e3b83149f7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 27): (anonymous) has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 12, ternaries 8, if/else 4, error handling 3. Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 34 function items inside it that branch (a function literal at line 928, a function literal at line 783, a function literal at line 827, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"b983fd6a47d36633774796d08a972dabbbe3027059bff7d6ad4847cf542ad56f"}},{"ruleId":"D2","level":"warning","message":{"text":"container.checkRestrictedHostConfig (cognitive 25): container.checkRestrictedHostConfig has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_options_policy.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb087139a8bb41d17cc562eda4b401099d890764ac2f11439b0feddc4d05fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.checkSingleExpression (cognitive 25): Node.checkSingleExpression has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 140). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/schema/schema.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83ee17bfbe814bb2cbd33e83e781b88ea773b46035653d46637c9a419c6e46d"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultGlobber.globGenerator (cognitive 25): DefaultGlobber.globGenerator has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 3, error handling 1 (2 pts) (nesting depth added 9). None of this is in the body itself: all 25 points belong to one function literal inside it that branches (line 1231). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d907af1cb2bdd6d5092a10762722bf22988a4b567d8f0883f61f897ba5283b17"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::globGenerator::globGenerator_1 (cognitive 25): (anonymous)::globGenerator::globGenerator_1 has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 3, error handling 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a149ea734de0de184a122e171b79baa3b1a970d02e12976cd1ed2b6e381beb"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.getHashFilesFunction (cognitive 24): runner.getHashFilesFunction has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 pts) (nesting depth added 15). None of this is in the body itself: all 24 points belong to one function literal inside it that branches (line 171). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3e7ba0e1cba885499ec95c78db485e39f8f3aa538d1656e5b9c82e90a48243"}},{"ruleId":"D2","level":"warning","message":{"text":"interperterImpl.format (cognitive 23): interperterImpl.format has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 3 (9 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/exprparser/functions.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dbc3496be07621e94eb1eea4622f2e7de97ddc66a2d6c63e38181c7dd0bd48"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.newJobExecutor (cognitive 23): runner.newJobExecutor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 2, boolean chains 1 (nesting depth added 6). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 104, 42, 85, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/job_executor.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee81d0a53e3857807e247bec3fa984e4be24ba4dc8780e0ad622267c91d2562"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::ensureAbsoluteRoot (cognitive 23): (anonymous)::ensureAbsoluteRoot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8770c5f3d1b8cbc9a2cdf581d62f3c384fabc7390be6a0d9fb2d6a129e113c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::v1 (cognitive 23): (anonymous)::v1 has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (8 pts), ternaries 3, loops 1 (nesting depth added 2). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":4649}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21b2be93384bc2e6e1891a2cb8a3f8c2ba594db637d82d07b289083e85ad9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"git.CloneIfRequired (cognitive 22): git.CloneIfRequired has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/common/git/git.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e265b361e103c9cc181747f2eb81be5c00777fc4224c2cb5d5c2c9f91d1d91"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContext.ApplyExtraPath (cognitive 22): RunContext.ApplyExtraPath has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (3 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec306030ea37ac1ae86542c61d5861f7ecda230332eea51af95a1e87a6bc3b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.downloads (cognitive 21): artifacts.downloads has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18 (20 pts), loops 1 (nesting depth added 2). None of this is in the body itself: all 21 points belong to 3 function literals inside it that branch (lines 338, 390, 303). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifacts/server.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7861a0cda9fda4f6c4f7988c86e17fa0f62309b1684c7d3b48c39c70d1c154"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContext.GetBindsAndMounts (cognitive 21): RunContext.GetBindsAndMounts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed44591f8dfd17096f98cc4a31591cb52e9b843e915dd4f7da8ab07be4e1e63"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpClient._getAgent (cognitive 21): HttpClient._getAgent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 10 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6e40e616cbb9acab5e42f814c29b1a5db5e7f727927f542bb43a7e0160dcec"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8, loops 1 (2 pts), ternaries 2 (nesting depth added 3). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 571, issueCommand, a function literal at line 559, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c9fe1e3da4edbbdaea2574f5fbb3a59976c0fdcaf93b9b3b6bb6b865fafa6b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 7). None of this is in the body itself: all 21 points belong to 2 function items inside it that branch (constructor, toString). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc3cd6ff0eb897c12911cf04fc24a6238aa228b082a43d25dfb30189a1db748"}},{"ruleId":"D2","level":"warning","message":{"text":"interperterImpl.hashFiles (cognitive 20): interperterImpl.hashFiles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1 (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/exprparser/functions.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dac1cd47cc6fdc3c60a9a073a51dc34e9ed5cff3b3666e4f27116ce99ae4f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpClient._processResponse (cognitive 20): HttpClient._processResponse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, error handling 1 (nesting depth added 3). None of this is in the body itself: all 20 points belong to 2 function literals inside it that branch (lines 2648, 2660). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"2148da40814bcd1132223b05838cb40bae33726f440f62b95646c3362057dcc6"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 20): (anonymous) has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 8). None of this is in the body itself: all 20 points belong to 5 function items inside it that branch (getSearchPaths, match, a function literal at line 1756, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdab6e2ce485309ac9e00cfdc9427b3f92dacbc83d8015063cb6b926aeb42630"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::range (cognitive 20): (anonymous)::range has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, ternaries 1 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2813}}}],"partialFingerprints":{"codehealthFindingId/v1":"f462d9f90bd66497c4f4fcc3eb4454029c534064cd0920c499b22f16d42639ce"}},{"ruleId":"D2","level":"warning","message":{"text":"cmd.bugReport (cognitive 19): cmd.bugReport has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/root.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c90644c2403fe171231bd8577f7836908e1eba219f9cba6908c88e429ad733"}},{"ruleId":"D2","level":"warning","message":{"text":"HostEnvironment.exec (cognitive 19): HostEnvironment.exec has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (19 pts) (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/host_environment.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffaaf04fe90cf28a314af09b9aea85841c4404a2d59fb0894e44f5c4a8b37bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.UnmarshalYAML (cognitive 19): Node.UnmarshalYAML has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/schema/schema.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddcd79da6346be0fb3a60d967709c9ea0cd6290f35b3ac2613921914ab4f21b"}},{"ruleId":"D2","level":"warning","message":{"text":"Pattern.fixupPattern (cognitive 19): Pattern.fixupPattern has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (9 pts) (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"37417c3159aba614a07f54e4724cc134a58c241be06a587c2b536eb7e4eade6b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), loops 1 (2 pts), ternaries 2 (nesting depth added 3). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 703, a function literal at line 691, a function literal at line 694, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3f407a352426b345f99471800edf0bc1d944dfa7b825c9542c6fc29206fff7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::match (cognitive 19): (anonymous)::match has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":3808}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b6b22f6fbc77f24ecb11047b28b01b717d60fe29f42a637ae73825225b62bd"}},{"ruleId":"D2","level":"warning","message":{"text":"HostEnvironment.GetContainerArchive (cognitive 18): HostEnvironment.GetContainerArchive has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/host_environment.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd5be396e20195663325758e8c4215dab3f305a12969fd49a4713f6c715c5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"model.createStages (cognitive 18): model.createStages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/planner.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fdcbcc3249f20a51bfab91303c3c4935196292c341719788716ac7065d049b"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.setupWorkflowInputs (cognitive 18): runner.setupWorkflowInputs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c82ee34a9a0dd0b4a41431c6bff9d9ef3e8949c51092c04f220027813b202e7"}},{"ruleId":"D2","level":"warning","message":{"text":"expressionEvaluator.evaluateSequenceYamlNode (cognitive 18): expressionEvaluator.evaluateSequenceYamlNode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"3410651fc94d83897780c8ddee0f9753b06850333c9832e9be454eab9b9f275e"}},{"ruleId":"D2","level":"warning","message":{"text":"artifacts.uploads (cognitive 17): artifacts.uploads has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, boolean chains 1. None of this is in the body itself: all 17 points belong to 3 function literals inside it that branch (lines 225, 206, 283). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifacts/server.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f022bb41c9295ad9cab84c4adc069218b27c1600e20178d687a2a65a8d8e137a"}},{"ruleId":"D2","level":"warning","message":{"text":"Workflow.WorkflowDispatchConfig (cognitive 17): Workflow.WorkflowDispatchConfig has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/workflow.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31d6b6c7fe1fbdde3dd27e8cb03cc370b572beeb9d4d6a8f2ef3002db67be98"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContext.NewExpressionEvaluatorWithEnv (cognitive 17): RunContext.NewExpressionEvaluatorWithEnv has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cee677660644fb0dd33f646ef5edb0c4ec3e97699047ec7da4dbf3d6ed2c22b"}},{"ruleId":"D2","level":"warning","message":{"text":"stepRun.setupShell (cognitive 17): stepRun.setupShell has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_run.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e91a9621145364e4f40ed11266b01e1b242e5fb18bf6d861f8b6a6b18dce58b"}},{"ruleId":"D2","level":"warning","message":{"text":"Command.toString (cognitive 17): Command.toString has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7826e605289678eaa95ded59804773c821deccde782f5adeccc625f6886b2e"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultGlobber.stat (cognitive 17): DefaultGlobber.stat has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 1329). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"28be27b3e0214333b9cf04e12b0ac71e95a7475f1de9470a0b32b1618b1749e3"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::toString (cognitive 17): (anonymous)::toString has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"56de9bdb6af376d28b37221ccf94b08c8b569193afc4837d820356bdfa33f048"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::fixupPattern (cognitive 17): (anonymous)::fixupPattern has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4c536f3b96ddb2a9940d58cafdb72a54b71389f8dbe1dc06879884d22b0ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 17): (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, loops 1 (nesting depth added 1). None of this is in the body itself: all 17 points belong to 6 function items inside it that branch (checkBypass, a function literal at line 2730, getProxyUrl, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a5791caed6e5dd3da647e992c519f5ad3caa3c33ea27d349279efebb5c7b9d"}},{"ruleId":"D2","level":"warning","message":{"text":"container.logDockerResponse (cognitive 16): container.logDockerResponse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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":"pkg/container/docker_logger.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5968e2f2e0f140a35d3e10048b4c8b6f2883c05d1a767193f7fb78de8ee679"}},{"ruleId":"D2","level":"warning","message":{"text":"interperterImpl.evaluateFuncCall (cognitive 16): interperterImpl.evaluateFuncCall has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/exprparser/interpreter.go"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7de45fb39918929c8b15c424014fe6522d360e628d0c1c226dad70b016df9d"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.runPreStep (cognitive 16): runner.runPreStep has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 5). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 539). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3b6934216e05c739145934bae26b8c56a6af8f3ed467369caaa7bd592fc114"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContext.getGithubContext (cognitive 16): RunContext.getGithubContext has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15 (16 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c7cc9d3934dd9c3e41d662405f54979ed9a75f84eae03a9b426313f59f2ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"stepActionLocal.main (cognitive 16): stepActionLocal.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 37). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_action_local.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45e7779ab4a45389f166212be9a4c0391f619890560b9b0eaf9e4bdc3d37277"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpClient.constructor (cognitive 16): HttpClient.constructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ac207edd94dc5a920a7cb595969986ae41bca745c90535f8ea3152caea5e50"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, error handling 4, if/else 4, ternaries 3. Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 645, a function literal at line 662, a function literal at line 607, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"4792f2af2574293728685fae575e3556e586f37ac11dfe12cfca16ed630a88a6"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::constructor (cognitive 16): (anonymous)::constructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: pkg/runner/hashfiles/index.js holds 23 of the 79 methods over the threshold \u2014 including the worst \u2014 and 332 of the 1061 points over it (31%), 4\u00D7 the next-largest file (pkg/runner/expression.go at 84). 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":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4ff35c07d52007efb9de4afd16c3c6813868fd9dd3171519e12af35d14daff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hashfiles/index.js: FileTooLong \u2014 2890 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 2390 over it, 5.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7127a5d94cdf462e32dfc34c17cf15b6d4ba981a78003fe882bdd84b76bdfe19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cmd.newRunCommand: FunctionTooLong \u2014 newRunCommand runs 227 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 127 over it, 2.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/root.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e6a84a60b957cabc3fe1b9d2aaa81496bd0ec51d56dbb57476ffda418edb97"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Input: TooManyFields \u2014 58 stored fields beside 9 methods. The bar is 30 stored fields; this is 28 over it, 1.93\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/input.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc14f1cf9865bf6b33c4e50b945b4dca2c6d99e31964b96d80cbd7600138f4f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RunContext: TooManyMethods \u2014 56 methods, declared across 4 files: runner/run_context.go (44), runner/command.go (5), runner/expression.go (5), runner/action_composite.go (2). The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2c4eab1f2ee1ca68e8d84e1a721422ce54a2c7aa12550ce02a6138f9b7a303"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RunContext: ClassTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded), 56 methods, 45 blocks, lines 35-1250. The bar is 400 significant lines; this is 311 over it, 1.78\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8369bf3109c42e215fcccb757ed85deed2b5358104d57c4cfb32e54a87bb4f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runner/run_context.go: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: RunContext (45 blocks, 35-1250). The bar is 500 significant lines; this is 324 over it, 1.65\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07c10c011691e7ff28c9bbfc3fe591865220cfeed956bd8355256e25e9f34fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Config: TooManyFields \u2014 44 stored fields beside 1 method. The bar is 30 stored fields; this is 14 over it, 1.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/runner.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"262d07d0990acaa4ad7a218a3950efcd7dda054072a5a551b5e5828532f0576a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunContext.startJobContainer: MethodTooLong \u2014 startJobContainer runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8570183eb7e2c3a85f2c4c9bd87d34af73f23cc65a2aa2951ea623d0467a72"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: containerReference: ClassTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods, 31 blocks, lines 70-934. The bar is 400 significant lines; this is 131 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_run.go"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"89560133044b799fd273624a850687303367687c1d2dc94b6273c8754c73b741"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: container/docker_run.go: FileTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: containerReference (31 blocks, 70-934). The bar is 500 significant lines; this is 148 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_run.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35300bce4a8800059f5843ea342ce4530269e76e8e25a9f925f24af4f2c03ea6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/root.go: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 94 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/root.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"989c7a4a14d72bf4a64cb9915dce6972d132763cb7c8ef03de9ce7cc8cc731b7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: interperterImpl: TooManyMethods \u2014 35 methods, declared across 2 files: exprparser/interpreter.go (20), exprparser/functions.go (15). The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/exprparser/interpreter.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4883b88096aea50bca395c2fc37482be9886eda80f4efdf7a164ba5647c313ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): pkg/runner/action.go:408-460 | pkg/runner/action_composite.go:197-220 | pkg/runner/job_executor.go:200-219 | pkg/runner/run_context.go:189-256 | pkg/runner/run_context.go:258-446 | pkg/runner/step_docker.go:92-135 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61c74daecb70aec78686e694dea45bfc5e8759b2565aa40711e54fcd686e856"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): pkg/runner/action.go:538-611 | pkg/runner/action.go:649-718 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e697bfa6405b54f355dcbf574e62b590f8dd2c9016f6017de7a5464cb715459"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): pkg/artifactcache/handler.go:249-288 | pkg/artifactcache/handler.go:291-343 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/handler.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"337624c66eacce63ee206c3342527ec3b587de16e46fa4dce716b03cd0d1ad2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): pkg/runner/logger.go:225-250 | pkg/runner/logger.go:252-277 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/logger.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b5aa796477457b8baf36105302bacfbe7b0fce87fe44520dbd254e675cc797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): pkg/artifacts/artifacts_v4.go:310-344 | pkg/artifacts/artifacts_v4.go:451-478 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifacts/artifacts_v4.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dea62e47811e9f42a13d705fd53d76d82ecf5e5f4e15d2dab321a7eaffc8f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pkg/model/workflow.go:71-85 | pkg/model/workflow.go:89-103 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/workflow.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c153a6f556eb3712dfcb5404af7567a2003f6dc6a6a82b3f9ce955b1a6d8ad7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): pkg/common/draw.go:64-74 | pkg/common/draw.go:75-85 | pkg/common/draw.go:86-95 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/common/draw.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be8a1a0b601666a4fcccf2e1b044ddb731f1515e1ca74605e710d161ae7c9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pkg/model/planner.go:232-249 | pkg/model/planner.go:252-271 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/planner.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d709ed5f5f16e872fc7b4d9b82469d7523348ceb7fb389cc3158aa6416a3b1d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): cmd/actrc.go:260-272 | cmd/actrc.go:274-285 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/actrc.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a6952aec3b842db3430556eeba13d8e0bca2ffac02c66de421c0a092f00556"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): pkg/common/executor.go:141-157 | pkg/common/executor.go:160-176 | pkg/common/executor.go:179-195 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/common/executor.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd6004ca3e7174e04924cdd85aa1802b41640e81828a440db579918db3e89aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): pkg/workflowpattern/workflow_pattern.go:151-174 | pkg/workflowpattern/workflow_pattern.go:177-196 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/workflowpattern/workflow_pattern.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"94514e75408590b142c410dd789339a2ec2a5e434fe0b6c9994f8ed62d1dc530"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pkg/runner/action.go:527-536 | pkg/runner/action.go:638-647 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b87251ec2e6ac9c0fd82c7c00028e84d6c142eec66c6110aec80563c946666"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pkg/model/workflow.go:311-327 | pkg/model/workflow.go:354-370 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/workflow.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1d1bf60c2b95de2422b68387ec0302fd35eed4bbba3cfa59f43fff3dda5c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): pkg/runner/run_context.go:571-579 | pkg/runner/run_context.go:619-627 | pkg/runner/run_context.go:629-637 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f8cfd1a1776fdda6936d9931908cfdf7b2553b192c842779f8c2ec90727f5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cmd/root.go:316-327 | pkg/runner/command.go:147-157 \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":"cmd/root.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"035d41108d97d130e38b7bd4317c02c217e27964ab4d2ede8454518bac5742fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pkg/artifacts/artifacts_v4.go:126-132 | pkg/artifacts/server.go:569-575 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifacts/artifacts_v4.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd142c55a6853f2d9bbba7b1a765fadc5e02743e3cc6bb3b3d3c6aa71f61c9af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): pkg/runner/step_action_local.go:89-91 | pkg/runner/step_action_remote.go:203-205 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_action_local.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32e490b01ea40695154506aa9925a9fc78c077b0e333d441b0f4d8e05dad757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): pkg/container/host_environment.go:147-183 | pkg/runner/local_repository_cache.go:71-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/container/host_environment.go:147\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/host_environment.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"73994d286fb8db502db98f2f6689ad6efdf740f7066980abd33bf92916dc903d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): pkg/runner/action.go:551-578 | pkg/runner/action.go:659-686 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/runner/action.go:551\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060pkg/runner/action.go:548\u0060 calls \u0060populateEnvsFromInput\u0060, \u0060getEnv\u0060 and \u0060pkg/runner/action.go:656\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f910a60f057dd56809483be7e918a4e5bd35a18bbf7fdd6d3acd4ff92f49d8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): pkg/artifactcache/handler.go:251-276 | pkg/artifactcache/handler.go:293-319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/handler.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"048981e99d6cb27daa0ff82f7553d66eb63ff013559743bbea30f5fd13e54813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): pkg/container/docker_run.go:776-796 | pkg/container/host_environment.go:108-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/container/docker_run.go:776\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_run.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"247d72fcc5a0f9efe1960d7cf8b0e12e45e5cb8062508ce6688cdd97acd7113d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): pkg/container/parse_env_file.go:21-38 | pkg/runner/run_context.go:535-553 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/container/parse_env_file.go:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/parse_env_file.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dc1553f91fc432dd2ebb141cd56b81c229507ac55631d2851f7ac59ea374ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): pkg/runner/expression.go:85-100 | pkg/runner/expression.go:147-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/runner/expression.go:85\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d96d48a3a868443af0643270a96891dbdf182c6604a0eb48149fe752713236b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): pkg/runner/logger.go:226-243 | pkg/runner/logger.go:253-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/runner/logger.go:226\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/logger.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f7705b8420e0aba3fb8b9ffdb953ce5d07da1b16a59821440e565dde17409b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): pkg/exprparser/interpreter.go:494-510 | pkg/exprparser/interpreter.go:513-529 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/exprparser/interpreter.go"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8d24889fb25a9082a1c1cdff7c7343abafa7fcba9558bde4bd0e2a277b4572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): pkg/container/docker_network.go:13-27 | pkg/container/docker_network.go:46-61 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/container/docker_network.go:13\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_network.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d790a66c8d2a6f9063a70ec8b10c17eebcbad8ff7c63056170c03109aefd1300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/model/github_context.go:55-69 | pkg/runner/run_context.go:1080-1094 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/github_context.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"348539b51b54e77baa0396c09d16588bd530f89d81976c3dce78f5743ad170ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pkg/runner/action_composite.go:206-220 | pkg/runner/job_executor.go:205-219 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/runner/action_composite.go:206\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action_composite.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5236a876c0f232e8ec6823ea01c331e00646d6a2b54143b7cd0c4ef808f256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): pkg/artifactcache/handler.go:466-477 | pkg/artifactcache/handler.go:483-494 | pkg/artifactcache/handler.go:500-511 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/artifactcache/handler.go:466\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/handler.go"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb659aa5a676f11ed6e4789fc353a879244dbe8f9d2c7fcbcf493dcf8a163eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/container/docker_images.go:17-28 | pkg/container/docker_images.go:45-56 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_images.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79957a74fd4bf092562e964a379ff08da32fc88ec1e10504e240cc78b1e85ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/container/host_environment.go:136-146 | pkg/runner/local_repository_cache.go:53-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/host_environment.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb78f81f1b31493f673f8137b22017d26581289b6498aa79eddce32c0767492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): pkg/runner/action.go:187-196 | pkg/runner/action.go:584-594 | pkg/runner/action.go:691-701 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff8ef6ceba8c8e93afc995aeb7c13d0ee260d0895ca10c56ebe87c8a08deffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/runner/run_context.go:468-477 | pkg/runner/run_context.go:511-520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c832e28a2a2748330c1d3b9c86d42228d388bbad1b08f8556cf73d0151c89ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): pkg/runner/action.go:411-419 | pkg/runner/action_composite.go:205-213 | pkg/runner/job_executor.go:204-212 | pkg/runner/step_docker.go:96-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99419f73e88ce748e4411cd22290d619210c6377d7aa01f45f4192113fca4c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): pkg/runner/action_composite.go:165-172 | pkg/runner/action_composite.go:227-235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/runner/action_composite.go:227\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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action_composite.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"210d32ec456634482ab4c7bf8dae436c067fd0b8f38ab52421104d612ee62114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/runner/action_path.go:142-150 | pkg/runner/local_repository_cache.go:116-124 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/runner/action_path.go:142\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action_path.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0f8869dd76b042497d7897b5c0ce18b26ed8eedafc4a81cd7fe9bb3fead1a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): pkg/runner/run_context.go:133-141 | pkg/runner/run_context.go:1227-1234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"217ebca248315700119e0d0e562c113ef7e460e7c2a760a897f2ef7c3fb1202a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/runner/run_context.go:192-200 | pkg/runner/run_context.go:262-270 \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 before the matched lines, \u0060pkg/runner/run_context.go:261\u0060 calls \u0060platformImage\u0060 and \u0060pkg/runner/run_context.go:191\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6cfe614500d0c3923467e21a662389fed5d5c1a1db033a85fb8d2c9df1ee77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/runner/action.go:412-419 | pkg/runner/run_context.go:193-200 | pkg/runner/step_docker.go:97-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5f6d85254763daf571232ed2a272afe6b5c7859a1c48c70588966c05824acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/runner/action_composite.go:206-213 | pkg/runner/job_executor.go:205-212 | pkg/runner/run_context.go:263-270 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action_composite.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34e14e29914d66f03e44736302cd498764115eb01fdc26374bc32de7ea31ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/runner/action.go:180-185 | pkg/runner/action.go:576-581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/runner/action.go:180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c06ec7ac09c23310326b3fb89c83f1990658fba91830ed1d2d75091244d292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/runner/action.go:372-377 | pkg/runner/step_docker.go:80-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/runner/action.go:372\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"116316e124a7eb62e8ed67d3262ef804c60f25023a9ba993e1f266af3e38a9b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pkg/common/draw.go:65-69 | pkg/common/draw.go:76-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/common/draw.go:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/common/draw.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6aa2ed45900b6751d1b30bd7b4e69bb59e060d3fe33d35f94448ff97acb29f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): pkg/runner/action.go:422-426 | pkg/runner/run_context.go:282-284 | pkg/runner/step_docker.go:107-111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/runner/action.go:422\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060pkg/runner/action.go:426\u0060 calls \u0060Sprintf\u0060 and \u0060pkg/runner/run_context.go:284\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"63503c2aed68fa3ad34b8dbca46ccbcf761a05b2023bcdeeaee3d0cb21c6cac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pkg/container/host_environment.go:223-233 | pkg/runner/step_run.go:152-162 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/host_environment.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"09be61790708dbc8456fdb963e30cdcc72d5c33ee5451c14a28b1ac44809ff44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pkg/model/workflow.go:73-80 | pkg/model/workflow.go:91-98 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/model/workflow.go:73\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/workflow.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"897ab24bac95b79f7e43cc69b07b3c4992e9363512418a62e26fcacd37834c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pkg/container/docker_run.go:71-76 | pkg/container/docker_run.go:83-88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/container/docker_run.go:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_run.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"436b119dcccdd58948876a3d35dd790d1f96426672c2b4c637462504c8847f7d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HostEnvironment (LCOM4 9): HostEnvironment\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/host_environment.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00333410211091d85ab16a24b2061921cc4a3f2cd560d47ce6f96129377c525"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Job (LCOM4 6): Job\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/workflow.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ed9e558746bd7df31467026a3d629270771b7380b8b9086b9d924ce818b387"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/cmd.TestRun: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ae67a839d20b0a3d36fb4272c5899c1d4e9ca9560035f27516f664f7d2d7a38a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/cmd.TestRunPush: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c402ecb726aebdeeec7b74bc1633114a780a286877d846bdc8e1ace524591633"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/cmd.TestRunPushJsonLogger: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3e751c858d9c4f0c04a333e40e8ff5e822e4b3b1b0c1a397e9e49c06bdfa8adc"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/evalmatrix: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"92a6055d84775125df151142b84ad72e1f75cb0846287437c4e3c175c8e78f81"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/evalmatrixneeds: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"84ca547e41812f522bc4e2392c69cf7fb515ac7db9fb1b54bf2983a7dece372c"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/local-action-docker-url: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c964e65d43c356aac7448c71bb29ffdff47dbb342bd6dce1dcaae9a194d49e85"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/local-action-dockerfile: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9605b9b1bb3bb501e093180d61da2ed5ed4b34de0ae39f47642076972cfdc5ec"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/local-action-js: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"66d833f3cc36130adbf4e9c270114053620c9045663f1831091c5dfab4886dca"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/local-action-via-composite-dockerfile: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6ae3e958ad4f406b2dc6c9bfd711cf40b09507ce8affb034c90c58998f18da8a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/remote-action-composite-action-ref: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"144f62ccad22dc82f8fd906d2b6dab6629b82e74b5df3884e878b63d6bcce2a7"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/remote-action-composite-js-pre-with-defaults: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aaad4f74cfcd4f06eca531bd52b12d2d255cee128c50de14f9d9d15f1761009d"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/shells/bash: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bf222cd0dcb7f6b3b817edeb38ab910fa1b70683903e554d832556ecc38e4c2e"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/shells/defaults: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"14b347834e19a9bd798c61cf1785ebceba59dc2bf19df596a3dd18b62380fa4a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/shells/sh: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"27566a39e2517a92832f3206c0a6181818d7286a94244140cfe0fe108edd3338"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/uses-composite: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"67242b4032dabfdcd663a3329ced9d677df16b3264dc8dcc8dd8c84aea9ff4b2"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/uses-composite-check-for-input-collision: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"880388d83388be349097acad116b78609504166dd1fe27ebfc9e9511a198e263"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/uses-composite-check-for-input-shadowing: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3e84fb8fe02c3fc42d96ddaf36310c8f01d828e0c2d518b83953d717f1960fb7"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/uses-docker-url: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2d976c1bc6e22a42511ad11633d79507500bb15e654dfe95e0a2fe2fe50f25ed"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/uses-workflow: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5e6f88b5152a5cf1da9bb06ecded4d8dab5ce79998ef4fc84a1fc958f41019b0"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: .::github.com/nektos/act/pkg/runner.TestRunEvent/uses-workflow#01: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0b038051ae55cd64a2cc2b9152d6828b1f8746a115ccfc11c088023025817ce3"}},{"ruleId":"D12","level":"warning","message":{"text":"Dependency pinned to a stale untagged commit: github.com/kballard/go-shellquote: Direct dependency \u0060github.com/kballard/go-shellquote\u0060 is required at \u0060v0.0.0-20180428030007-95032a82bc51\u0060 in go.mod \u2014 a pseudo-version, which pins an UNTAGGED commit from 2018-04-28, 8.5 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of \u0060github.com/kballard/go-shellquote\u0060 and has not moved this requirement in 8.5 years: every fix the module has published since that commit \u2014 including any security fix \u2014 is absent from this build, whether the module went quiet or moved on without you. Check whether \u0060github.com/kballard/go-shellquote\u0060 now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3de3a47e4c18b4f2d61a7422838abd8127082e3b2fb25218679bc2314cacb3ac"}},{"ruleId":"D12","level":"warning","message":{"text":"Dependency pinned to a stale untagged commit: github.com/sabhiram/go-gitignore: Direct dependency \u0060github.com/sabhiram/go-gitignore\u0060 is required at \u0060v0.0.0-20210923224102-525f6e181f06\u0060 in go.mod \u2014 a pseudo-version, which pins an UNTAGGED commit from 2021-09-23, 5.1 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of \u0060github.com/sabhiram/go-gitignore\u0060 and has not moved this requirement in 5.1 years: every fix the module has published since that commit \u2014 including any security fix \u2014 is absent from this build, whether the module went quiet or moved on without you. Check whether \u0060github.com/sabhiram/go-gitignore\u0060 now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a010b19ff11119e18873f9f424e5275ca11d4f0dba93d44563776fd00e5d07ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/root.go: cmd/root.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in cmd.newRunCommand at line 387. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 08:05:37 -08:00\u0027 --until=\u00272026-11-04 08:05:37 -08:00\u0027 --full-history --no-merges -- cmd/root.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":"cmd/root.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1ac5575658b7936823e4aba79faa4bb2f9b08f5b3b3aab79d0585468d9c7c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/runner/action.go: pkg/runner/action.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in runner.execAsDocker at line 251. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 08:05:37 -08:00\u0027 --until=\u00272026-11-04 08:05:37 -08:00\u0027 --full-history --no-merges -- pkg/runner/action.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3961a674cb1ab15edca4132462b5e85937e77164167e741096b7c7e165b37158"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/runner/run_context.go: pkg/runner/run_context.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in RunContext.startJobContainer at line 258. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 08:05:37 -08:00\u0027 --until=\u00272026-11-04 08:05:37 -08:00\u0027 --full-history --no-merges -- pkg/runner/run_context.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b25a40b80399525745f303ac21a2d057d3e4b7433a980c8a73825c0375d637e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pkg/artifacts/artifacts_v4.go: pkg/artifacts/artifacts_v4.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is artifactV4Routes.listArtifacts at line 406), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(artifacts): contain storage, bound signed URLs, drop empty-key parsing\u201D; \u201Cfix(artifacts): make v4 URL signatures unambiguous and parse the workflow\u201D; \u201Cfix(artifacts): harden the artifact server\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 08:05:37 -08:00\u0027 --until=\u00272026-11-04 08:05:37 -08:00\u0027 --full-history --no-merges -- pkg/artifacts/artifacts_v4.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifacts/artifacts_v4.go"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac99a96d61a5c9b12112ee2d65a567fc901bec93072143ebaeba81aca4a1a8d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pkg/common/auth.go: pkg/common/auth.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is common.ValidateAuthorizationToken at line 84), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(artifacts): contain storage, bound signed URLs, drop empty-key parsing\u201D; \u201Cfix: close cache upload and container attach leaks\u201D; \u201Cfix(artifacts): harden the artifact server\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 08:05:37 -08:00\u0027 --until=\u00272026-11-04 08:05:37 -08:00\u0027 --full-history --no-merges -- pkg/common/auth.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/common/auth.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"738127ebe7ea4291492ba53e4e587df68a65e0f8f14aa5ceccee7bf6f9156b8f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: pkg/filecollector/file_collector.go, pkg/artifactcache/storage.go, pkg/common/auth.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"509c25c678616fcb5e382ee6fedaa0bd2a2b18e5cd29ea68d7c3c02eaf9bf7dd"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (4 single-owned of 45 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 45 of the 87 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: pkg/runner/step_action_local.go."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: break out parts of function to reduce complexicity \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5796bc2ffbefdf9b100c43cd033f2b4149aa1411ceaa5f54e6ef11a7290c3e14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: refactor into step \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4703eeb6a22809bb75e58c2f1d6c056b1ba04042ccb06b14002936027915a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: refactor into step \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action.go"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09a4de84440cc504f573d768b713e2e1cc144020189153055d9d92657e31c94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: cleanup EvaluationEnvironment creation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e70a4166e4388477660d6a1025a7b5f9bfbe9befe5a2f6fa774986d45b6429"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: cleanup EvaluationEnvironment creation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2072e1797e53b51cce21ad725b6e1c3240d063fa8e2052a574da39a8a365fd18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: should be unavailable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"df098bc8748fca618e3c27f80796074cdc9aa04c30a1abbf95b004361ff01aaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: should be unavailable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/expression.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5200bf548c4bbf9fd1526a4882ac5501a63ff77690ed825cc7dad33bde85dfc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove below 2 lines when we can release act with breaking changes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context.go"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"70844b3c76b97a5a7b1ac0bf4fea060af45b60bc47bb915594eb65e08145cf02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move to sc.NewExpressionEvaluator(), because \u0022steps\u0022 context is not available here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context_test.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d7362b696b655e3ace9ca9e61f3e704ac8849436420635f59b14d24d6e9923"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This does not throw an error, because the evaluator does not know if the expression is inside ${{ }} or not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context_test.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07056f430fe0da23797546f9368e7ce3893447f943bdf89690b10015c750e8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This does not throw an error, because the evaluator does not know if the expression is inside ${{ }} or not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context_test.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ebc4ffdcb339ac4d13f8665859e3b545839a2cea373a5cdf4458cbc02296fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This does not throw an error, because the evaluator does not know if the expression is inside ${{ }} or not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/run_context_test.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c96809859f088689f627eabcff17622555b116c7c3bffb7d584a68b5dc64bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out why it fails \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/runner_test.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2920e074d1814c3fa985d637c29fb959ae8d2634e70ee499a99574ce7788939"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move all testdata into pkg so we can validate it with planner and runner \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/runner_test.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aad16af4adbce7593feced253ad5828198c0aed0fd94c58b35b6af20352652"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out if it will be easy to shadow/alias go-git err\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_action_remote.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6676e6cdf9a24b935909ef83809f4cb12bb762075cf4fea181c1a5077253f460"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we just ignore top level keys, BUT we should return proper error on them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_run.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"381f4595cf06394c4afedacc25c9ead0b44c9b4b83f4567ef47df691b543ee51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO enable after verifying that this runner side feature has rolled out in actions/runner \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/action.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9ed52309f43f3e37a8fdd502821dc57ab0616383bfd81d7014d4857260e213"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(thaJeztah): define these in the API-types, or query available defaults \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"36162c47541abdaaf0c72c416bb9404a345034315abba7cd1d2077d8b03b7e06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(thaJeztah): we need a flag-type to handle []netip.Addr directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7fac1ff846ffe4c7ac1cdc92ae82bde3cb231e30fbd967abb94d869120e9b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(thaJeztah): we need a flag-type to handle []netip.Addr directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d0ae0b2c2a88661100ae9c5deb57d09c8eee0bc266d47f4417aceb07beb559"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(thaJeztah): we need a flag-type to handle netip.Addr directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55df489fc5218b22b535dd941577043e4082772799d7f54a86263a58233cc48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(thaJeztah): we need a flag-type to handle netip.Addr directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"434e148b8c3e3d1011a6fd4ff4bbaa504d9e8831092a801c710b167ff94b63e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(thaJeztah): remove in next release (v30.0, or v29.x) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8ca678f009a17d3cdecf38aa8b60d97caef8f3f8ac33a387a8e8fe6f838ed3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(thaJeztah): remove uses of go-connections/nat here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli.go"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"d066d28d110318fd2bb7b438eacb289b3aa1d2bb494c105c34038d54ad10111c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(thaJeztah): we need an equivalent that handles the \u0022ip-address\u0022 part without depending on the nat package. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ff80eb8956c061a7e6af78c775a051e69f548d2cdbe5556d093d0bd08158f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should we error if _any_ advanced option is used? (i.e. forbid to combine advanced notation with the \u0022old\u0022 flags (\u0060--network-alias\u0060, \u0060--link\u0060, \u0060--ip\u0060, \u0060--ip6\u0060)? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli.go"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf43b1b6a4fed392a7282e9503d261a964a6a04b489aed2c71a4199b42fa4965"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dnephin): fix tests to accept ContainerConfig; see https://github.com/moby/moby/pull/31621"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli_test.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd45e033e2235febcbb7b6be9521292fc9013b539c79d84baa36823a97d8b93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Windows: The Windows version uses read-write as that\u0027s the only mode it supports. Can change this post TP4 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli_test.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b7b5632c36ead0574c5b16eb61ae7dd19a01c162957a5f76542df071580f99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Restrictions for accessing a cache, see https://docs.github.com/en/actions/using-workflows/caching-dependencies-to-speed-up-workflows#restrictions-for-accessing-a-cache"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/doc.go"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd83927fcca4bccbb23bf6be1ed9f93d27d4753bec32f18761ec01b55fa02e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Force deleting cache entries, see https://docs.github.com/en/actions/using-workflows/caching-dependencies-to-speed-up-workflows#force-deleting-cache-entries"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/doc.go"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ed638e0c3b1e43cb2fb88e58106514d1ae5c022058bf9d6906ce8322269c08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t support force deleting cache entries \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/handler.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"245c1f7b99592bf8341c1d28ed158ab199f03293783fa7cfa0762e06a1fdccc7"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060main.go\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a3e98f9a3db0a104ca87a623a16ba8fc33487b53a279d445cb50087c399a8a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022switch\u0022 only labels the closing brace of the switch. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":3609}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a414da6f1e2935af2fe7b7f64f23071e5ce6dc956713c6ce42ee56ba9369a66"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022** swallows a segment, and continue.\u0022 repeats the code it sits on: 3 of its 3 words (swallows, segment, continue) are already in \u0060this.debug(\u0027globstar swallow a segment, and continue\u0027)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":3956}}}],"partialFingerprints":{"codehealthFindingId/v1":"4133468a3ef92ded1588e0a4668da7ff68f5deefb51ffbd0a0b8a47e221a2085"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Return the exports of the module\u0022 repeats the code it sits on: 3 of its 3 words (return, exports, module) are already in \u0060return module.exports;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":5085}}}],"partialFingerprints":{"codehealthFindingId/v1":"9034ba16257e63e6e2ee88d5fd5062e988a3ea3ccf1783b72c916f118f6a04d8"}},{"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":"b4f4b736d443362ffd137d5d665a4d20a15fe921ef690f9ea9368e6f9afa9560"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"1d410e8809299e01014d57373bc8b4a7e886b17efed480f3858abc40d178d875"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bc131db5d3f1083e2cc4642129b676f6d21f1acf05db0e2df1c05438949cd97"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4db39418e2545190fb9c876d82d50e072482bd6d84e511d1183c46dec6909ce1"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2376768b9c5297ccd8b97a0b2773631e02fc1e80ad67e0fc445394e342e1ee6"},"taxa":[{"id":"CWE-1287","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-193","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"59f8396ed6ed376cb9e4e81e9cbaab7fc08682f09a5f6e69119da6114782b779"},"taxa":[{"id":"CWE-563","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"9f0cefd5af3859a809701b257618c35e4db76e1ea8eeb0e9c1bd0599951b127c"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b245146b42c6ffe91526958cc3fdb7c563173cd1996e5bc72cbe0ae85664f41"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2830d2cb553522ffb32450901484f6940e3fe35271dc1877e90ec91a2258616"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0125fa3b7e231f628be879d135b7259262cb69895974d3b9ddecb184572fe87"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ea983656294cf45508d43599fbcab46f5c8043785d9448ad435626eb09b11a9"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b12a3d4e0a798d10344ae404181b489716982310ed24fcbf7b03c06bfe15dfd1"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"679bb851c7e3da705b4ce6b641b1d96f9542939bcdf0c8ddcc77e932cd11f583"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"849d8899ff243b4ef895c5091dbb4aa78edac6e84e810d1f049b2c0e02b688e0"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e4f764c4acbf41d3ee3535520bc0f4e54d072dd6da55a7343f15002375cf7ed"},"taxa":[{"id":"CWE-563","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"04d3aeb724de001160fc3e87121f9873af87eeddc0cf5aa3e14339cfba5061a3"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fee7fa07e41b390a74c98141ba8fb448a3a9647f6df8c004469f03c3ad938abc"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36cc95ee6aa58aab1b3b9c173e6c98619557dee8126583059f88cc7fba97da36"},"taxa":[{"id":"CWE-362","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-567","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"88e9a289e59511ca0c7e9f1d9cf0ad02a92c54a1700ea4cb0a245aabb6ab0051"},"taxa":[{"id":"CWE-362","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-567","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"f8353e2c53cfd92de2ff4ee089f99cd109a414b5dc7f882bd788dc5cbc3faa90"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91a20f465fa566a81cfcf0ed7fac9955f631353ce2791b17f0b2c6644c8a1b31"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c98f39c5a39a743032d189f8bc063d32b3b687fe65b83360d085f5b9b2c80a79"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80af2bea55fb5c9f56792b298dc58492bab7e42f27c04e0aa5ea67da7ca906f5"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76949c9d931946497904205b8ed30f37358390da5750b5b6f60c31ed67276870"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c755e3f6b8518c7c1a15ee8d5ea32ef9c6fb7e48004ba93fc664c6b9884a94a1"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74da190c67d0bf25ff4aea2fdf60cc417e8c267d26cf57e7c9b2b9606600ac5a"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bdcab67722819430f2ab37c3d5e9d1426df836dd1ba5e8152527e5e25f6a48c"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e4bc26345f611a92e60dcaec75f56c28dd4f543764d619b19c76a273f41b05d"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"c0c998f470bf9d4228fd13ee0ec6902f2e23de1f409fa97ab41a3c14f3f78d68"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"26204b58ff1f42085e387ce31ee80d4001ee716fa43247f3daaf6e45a900f020"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"a1019ad09cfa773b598ee4fc2718c18d6bc5675dc56527ad413b7ff9d26be234"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"b7b62fb5aac3e53adc1b7d34c5b673befd52851b5a394cf6c8864e1317caa0ef"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3815d6ba97487013312c57529435af49e963752f1d69cb4d6baf9c7fc16d966"},"taxa":[{"id":"CWE-362","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-567","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"f7391a4c03722851d78cd96bae694fcb9c5709bbdfd6a3084755ae0a14264750"},"taxa":[{"id":"CWE-362","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-567","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"a1922d6c9fb509333ebbceb6eeff30965fbf4b65a42863dbd9605d242e7ec477"},"taxa":[{"id":"CWE-330","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":"bef7eaa5c3b54a20a5f6c5185953a53721af4f308e662c8323bdd3f39992bf51"},"taxa":[{"id":"CWE-330","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"31509f5777d7fb146d61f12934b9b6a701b1edc3c87b57ea8a7ae13e46e93093"},"properties":{"dependency":{"package":"stdlib","version":"1.26.10","advisory":"GO-2026-6859","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"cmd/notices.go","line":83,"symbol":"http.NewRequest"}}}},{"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":"fe34912cc1022f16defa9aa7f34d659541f4568862a4f10eaff5ff953cbf17be"},"properties":{"dependency":{"package":"github.com/klauspost/compress","version":"1.18.7","advisory":"GO-2026-6865","aliases":["[CVE redacted]","[GHSA redacted]"],"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":"1c9c7154a9d80981a2f1da0fd0aa2e12a4e104a4411624a7aabc5ce2dd45d848"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.58.0","advisory":"GO-2026-5932","reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11beda7a12efeb42d0ea9a8c0f2c5c7966834e95d997548f4254c552dd847667"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d26e1adc617792aad15adb9f98e6637dbb61c3f50d52b4357f0d78e004693d4"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9ea06d725c28524834fd66675c7e6c0ddebc983604d0ea7a9e43f14f6224528"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 13 of 46 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 46 of the 87 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: pkg/exprparser/interpreter.go, pkg/schema/schema.go, pkg/exprparser/functions.go, pkg/model/github_context.go, pkg/runner/job_executor.go, pkg/runner/action_composite.go, pkg/runner/step_run.go, pkg/runner/action_cache.go (and 5 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/exprparser/interpreter.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5eee6afdc333abed42100d8cacec75fecfea2820c879c66ee32fd9af9b693d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/schema/schema.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4977479a46279607f94ff31946c594475f317d126388ed25f7b1d4574d550f8b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/exprparser/functions.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b8e53b43a53ce096b257a0ef0f20f00301bfdd4c36235e8ef11e1b8948f24f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/model/github_context.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d1776d61b19b07005836322952729baa12fb2f33dfed48be84a15f9ce4559e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/job_executor.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1c3f8912cc59419c68e443c80a6c05d899882e777468159ff0770c22171751"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action_composite.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef914fb6a49fe09568f39b111211aaf1c5b6d822029b3c01ccda5bf7f7cdc4a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_run.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c656a03a113835ebfc00da486ebe293c888467c7ccffb132b33a3d53bc4b61"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action_cache.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe926125f58c6dfab3f86031013dbc8219d4dd1830135417555ed914670726e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/workflowpattern/workflow_pattern.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9dd480fa35d608487811a3bada872f31c513bb53e526f1759c84e865289819"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_socket.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee0f2f587e5451c583406e0abe21401bc989b190b0f378da9e57089872cea5b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_docker.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3253a54f8ef60c8216a3a6a2080720016ce73914870d413b941d3118222976ca"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/list.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03776094f72642c805b7d143d4ee0ed92d6373cffd04a4906d5203c9325c2771"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/linux_container_environment_extensions.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb74827a5edda3ebf19faae4d3f7a78b151aa5ea7ee1116376651ada19aa473"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060http.Client{\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/notices.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c398e3bd09462847f6c0d46b93e3f42a38407b36514c8e758218ac6c08908df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(r \u003C \u0027a\u0027 || r \u003E \u0027z\u0027) \u0026\u0026 (r \u003C \u0027A\u0027 || r \u003E \u0027Z\u0027)\u0060 appears character-identically in 2 files \u2014 pkg/container/docker_socket.go, pkg/runner/run_context.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_socket.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"982a578a4fb3dd105768aafbd1307255c867edb3f2f72ca3f8887bdc0759135f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(line) \u003E= 3 \u0026\u0026 line[0] == 239 \u0026\u0026 line[1] == 187 \u0026\u0026 line[2] == 191\u0060 appears character-identically in 2 files \u2014 pkg/container/parse_env_file.go, pkg/runner/run_context.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/parse_env_file.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b876bdb4792235a53eddcd855d685c10e4429d5ac781ba4036a6188a912746bb"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept a context.Context: Only 0/2 functions that make a cancellable request (net/http, net.Dial) accept a context.Context or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a cancelled request, a shutdown, an expired deadline. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it (\u0060http.NewRequestWithContext\u0060, \u0060DialContext\u0060); where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"faab330444baf00d50193f250b5c9b514f84cdca16c24014ef3776329847910c"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: GetOutboundIP: \u0060GetOutboundIP\u0060 calls \u0060net.Dial(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/common/outbound_ip.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8349b33048e6480552d9a62f5d0b65874d7980b7f21e5a26070ca22cd7bece5"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: getVersionNotices: \u0060getVersionNotices\u0060 calls \u0060http.NewRequest(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/notices.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f2381641379c92a347d3b83b80ba5a593bbf384992c70f313e5eb553e5681f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/action_path.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"107d438f68a7e9b38666970fa063d7e6929fa4762d2024cdbaebe983eaa203a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_action_local.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc09ea3bd906b73f56f1a903bfc9c4eee4925960db59b195bb398e7051a76e73"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/step_run.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a235e636f7940e77548c8c98eaf78b8942694f784ca93eed9f84c89b130e446c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb05aa4d8aabae7496f34b6642459a7ca2077f918f6cb521ecfce951c17a1618"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":3087}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc64a138f421b041df86e57000b3e67071263f5921dd5f3445168d2927203287"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/runner/hashfiles/index.js"},"region":{"startLine":4832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ab8b0920e104f9285bcbc9f7f93bccfcbda753ba108a2d3bd5302d6a0309cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_cli.go"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5017ecee84041300e8476fa24b978ebb0c10ebfc6f253e4e16d44e55a1890c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_options_policy.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd5a7e119dc9aceea086c2611f611ee8262d5c82349344029540327c8fc922e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_run.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4a34e573a1821f05127c5c8ade1e25787011c3b52d10de8582533476655881"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_run.go"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc46848e29382f85c7ee8192f3f1830bb230d13cffe46d4fc1c7978c5d4b3886"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_run.go"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bbfce6c0ad2e911147f650c16ee86466f715224bdc84807ea8c463fd7d16d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_run.go"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e21a26476faac7a7c1f1a371967c02681e750e48bd19bf40ff876d3900db5e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/docker_run.go"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a727b0dc56ad69e5bd51bc993a3f1b9ea9b19f3443b676cb981c4a1b603d056b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := io.Copy(writer, ppty); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/host_environment.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d932290fece3aa8fead38bacabcfebff9f4421db594ed3e0cd0a07c1aaf00c54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/container/parse_env_file.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad4c9a5fd885dedab959e00bec51b632fe09f356a472a4295eb729492b0fd13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/handler.go"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"519280dd9596fd85eac72b6fc7090ea00303aaa8bfab0e003a130e8b551ea6e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := db.Get(id, cache); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/handler.go"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"97329af510d6ba7ca891122da0f7d7a791bc4d36e38c4e4a8db187bbcfb5d337"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/handler.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbbffaf8cdfe2d0c5e99eec625347cf4b0933f3cab7684ad7e60517067a6b31"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/artifactcache/storage.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade5219c777c8e1265518029290abe20516b3b1be401fe2b00a7441ececf604b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/actrc.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"587afd4e9f90ae028d6ec56b3b34a498934e6a597a34fc8b770f0c0e72e1c7b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/actrc.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"394dc3e64d99bc8e6892a4adc8bea9fba266592d655a565483de0c07b2fcec3d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := strconv.ParseBool(inline); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/actrc.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f39a12c3f13550ee0f9ac77bf2135ec83672d59f82f30fc5238dc49d795fad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/notices.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d16215cd534fad460749116b3af040484643f31e61c70105ceedae8f349d1fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/project_files.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d34d595e3a8f7948db87d3693930e412d0f3b6fbf53c42f04da570d6f5d266"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/project_files.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3efcfa5fc8876efd8dcdab0de59bb7afca42c4ed130250c46feee234bcbebd6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/project_files.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3323e8f176b70b358bdd89ebedcdd1ec756f7bc5057bf794f48c978cd2562901"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/project_files.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f291e8580bd112ca34419b53c49c3d393e658ed8e288c56882f60d7e59fc072"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/root.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"87145876eda7713c5a42d0b8a418d3fd4d82fc3fd8ca4c944088a163be6d4ea3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := os.Lstat(os.ExpandEnv(p)); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/root.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52ce028b27d5231b6060e7c23c615a9481aa6620709ee63fb1fe668a2f07c2e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/root.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98e9de858ed6522db37ff14e969a83c4ae6bec691281e55ba7bca1f4fc18067"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060parseBoolProjectFlag\u0060 turns a non-nil \u0060err\u0060 into \u0060return nil, \u0022a boolean flag value must be true or false\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/actrc.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a411019cc597ad9069ede983e076dcea62e99cbd0f6ad76b0de0f38211f100"}}],"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-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.html"},{"id":"CWE-1287","guid":"34cd40c1-8599-c25e-bede-5316d810f38a","name":"CWE-1287","shortDescription":{"text":"CWE-1287"},"helpUri":"https://cwe.mitre.org/data/definitions/1287.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.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-193","guid":"3f419d36-cf92-1f5d-b2e2-9bdf244bf9fd","name":"CWE-193","shortDescription":{"text":"CWE-193"},"helpUri":"https://cwe.mitre.org/data/definitions/193.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.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-330","guid":"f811ddf9-2e54-865b-9c76-f97905849790","name":"Use of Insufficiently Random Values","shortDescription":{"text":"Use of Insufficiently Random Values"},"helpUri":"https://cwe.mitre.org/data/definitions/330.html"},{"id":"CWE-362","guid":"03d7a26a-06e8-e553-88a3-4b67b48b4a85","name":"Concurrent Execution using Shared Resource with Improper Synchronization (\u0027Race Condition\u0027)","shortDescription":{"text":"Concurrent Execution using Shared Resource with Improper Synchronization (\u0027Race Condition\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/362.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-476","guid":"df404eaf-4a12-445c-9306-241412f65220","name":"NULL Pointer Dereference","shortDescription":{"text":"NULL Pointer Dereference"},"helpUri":"https://cwe.mitre.org/data/definitions/476.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.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-563","guid":"81263256-a108-5e53-9ac3-46df5a71b0b0","name":"CWE-563","shortDescription":{"text":"CWE-563"},"helpUri":"https://cwe.mitre.org/data/definitions/563.html"},{"id":"CWE-567","guid":"589a5096-54af-2651-9204-ebd9e0bda8a5","name":"CWE-567","shortDescription":{"text":"CWE-567"},"helpUri":"https://cwe.mitre.org/data/definitions/567.html"},{"id":"CWE-703","guid":"fa730aa9-95e4-845e-83fa-8169f2cf339e","name":"Improper Check or Handling of Exceptional Conditions","shortDescription":{"text":"Improper Check or Handling of Exceptional Conditions"},"helpUri":"https://cwe.mitre.org/data/definitions/703.html"},{"id":"CWE-704","guid":"50bd74b4-a921-5159-8671-99fd7e78c810","name":"CWE-704","shortDescription":{"text":"CWE-704"},"helpUri":"https://cwe.mitre.org/data/definitions/704.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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":43,"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."]}]}